[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[elpa] externals/ada-ref-man e94c605 11/18: Release ada-mode version 6.0
|
From: |
Stefan Monnier |
|
Subject: |
[elpa] externals/ada-ref-man e94c605 11/18: Release ada-mode version 6.0. Release wisi version 2.0 |
|
Date: |
Sun, 29 Nov 2020 19:04:47 -0500 (EST) |
branch: externals/ada-ref-man
commit e94c605eb296b9d140422c64c3b0ebf09f3109da
Author: Stephen Leake <stephen_leake@stephe-leake.org>
Commit: Stephen Leake <stephen_leake@stephe-leake.org>
Release ada-mode version 6.0. Release wisi version 2.0
---
aarm2012.info | 69276 ++++++++++++++++++++++++++-------------------------
arm2012.info | 41131 +++++++++++++++---------------
build/Makefile | 14 +-
build/arm_info.gpr | 1 -
build/download.py | 5 +-
progs/arm_frm.adb | 4 +-
progs/arm_mast.adb | 4 +-
progs/arm_rtf.adb | 2 +-
progs/arm_texi.adb | 26 +-
progs/arm_texi.ads | 9 +-
10 files changed, 55623 insertions(+), 54849 deletions(-)
diff --git a/aarm2012.info b/aarm2012.info
index 3546c2c..2b44e7e 100644
--- a/aarm2012.info
+++ b/aarm2012.info
@@ -1,4 +1,4 @@
-This is aarm2012.info, produced by texi2any version 6.4 from
+This is aarm2012.info, produced by texi2any version 6.3 from
aarm2012.texinfo.
INFO-DIR-SECTION GNU Ada tools
@@ -322,12 +322,12 @@ held responsible for identifying any or all such patent
rights.
3/3
International Standard ISO/IEC 8652 was prepared by Joint Technical
-Committee ISO/IEC JTC 1, Information Technology Subcommittee SC22,
-Programming languages, their environments and system software
-interfaces.
+Committee ISO/IEC JTC 1, <Information Technology> Subcommittee SC22,
+<Programming languages, their environments and system software
+interfaces>.
4/4
-{AI05-0299-1AI05-0299-1} This consolidated edition updates the third
+{<AI05-0299-1AI05-0299-1>} This consolidated edition updates the third
edition (ISO/IEC 8652:2012).
5.a/3
@@ -352,7 +352,7 @@ This is the Annotated Ada Reference Manual.
Other available Ada documents include:
3/3
- * {AI95-00387-01AI95-00387-01} {AI05-0245-1AI05-0245-1} Ada 2012
+ * {<AI95-00387-01AI95-00387-01>} {<AI05-0245-1AI05-0245-1>} Ada 2012
Rationale. This gives an introduction to the changes and new
features in Ada 2012, and explains the rationale behind them.
Programmers should read this rationale before reading this Standard
@@ -360,7 +360,7 @@ Other available Ada documents include:
available.
4/1
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
5/3
* The Ada Reference Manual (RM). This is the International Standard
@@ -369,7 +369,7 @@ Other available Ada documents include:
Design Goals
6/3
-{AI95-00387-01AI95-00387-01} Ada was originally designed with three
+{<AI95-00387-01AI95-00387-01>} Ada was originally designed with three
overriding concerns: program reliability and maintenance, programming as
a human activity, and efficiency. The 1995 revision to the language was
designed to provide greater flexibility and extensibility, additional
@@ -452,7 +452,7 @@ separately compiled program unit must name the library
units it
requires.
14
-Program Units
+<Program Units>
15
A subprogram is the basic unit for expressing an algorithm. There are
@@ -485,7 +485,7 @@ either a single executing task or a task type permitting
the creation of
any number of similar tasks.
19/2
-{AI95-00114-01AI95-00114-01} A protected unit is the basic unit for
+{<AI95-00114-01AI95-00114-01>} A protected unit is the basic unit for
defining protected operations for the coordinated use of data shared
between tasks. Simple mutual exclusion is provided automatically, and
more elaborate sharing protocols can be defined. A protected operation
@@ -496,7 +496,7 @@ protected object or a protected type permitting the
creation of several
similar objects.
20
-Declarations and Statements
+<Declarations and Statements>
21
The body of a program unit generally contains two parts: a declarative
@@ -566,7 +566,7 @@ specify the actions to be taken when the error situation
arises.
Exceptions can be raised explicitly by a raise statement.
30
-Data Types
+<Data Types>
31
Every object in the language has a type, which characterizes a set of
@@ -575,11 +575,11 @@ are elementary types (comprising enumeration, numeric,
and access types)
and composite types (including array and record types).
32/2
-{AI95-00285-01AI95-00285-01} {AI95-00387-01AI95-00387-01} An enumeration
-type defines an ordered set of distinct enumeration literals, for
-example a list of states or an alphabet of characters. The enumeration
-types Boolean, Character, Wide_Character, and Wide_Wide_Character are
-predefined.
+{<AI95-00285-01AI95-00285-01>} {<AI95-00387-01AI95-00387-01>} An
+enumeration type defines an ordered set of distinct enumeration
+literals, for example a list of states or an alphabet of characters.
+The enumeration types Boolean, Character, Wide_Character, and
+Wide_Wide_Character are predefined.
33
Numeric types provide a means of performing exact or approximate
@@ -590,7 +590,7 @@ point types, with relative bounds on the error. The
numeric types
Integer, Float, and Duration are predefined.
34/2
-{AI95-00285-01AI95-00285-01} {AI95-00387-01AI95-00387-01} Composite
+{<AI95-00285-01AI95-00285-01>} {<AI95-00387-01AI95-00387-01>} Composite
types allow definitions of structured objects with related components.
The composite types in the language include arrays and records. An
array is an object with indexed components of the same type. A record
@@ -636,7 +636,7 @@ is not known until run time, implicit dispatching is
performed based on
the tag of the operand.
38.1/2
-{AI95-00387-01AI95-00387-01} Interface types provide abstract models
+{<AI95-00387-01AI95-00387-01>} Interface types provide abstract models
from which other interfaces and types may be composed and derived. This
provides a reliable form of multiple inheritance. Interface types may
also be implemented by task types and protected types thereby enabling
@@ -650,10 +650,10 @@ limited set of index values, and records and private
types with
particular discriminant values.
40
-Other Facilities
+<Other Facilities>
41/2
-{AI95-00387-01AI95-00387-01} Aspect clauses can be used to specify the
+{<AI95-00387-01AI95-00387-01>} Aspect clauses can be used to specify the
mapping between types and features of an underlying machine. For
example, the user can specify that objects of a given type must be
represented with a given number of bits, or that the components of a
@@ -663,20 +663,20 @@ implementation-dependent aspects, including the direct
insertion of
machine code.
42/2
-{AI95-00387-01AI95-00387-01} The predefined environment of the language
-provides for input-output and other capabilities by means of standard
-library packages. Input-output is supported for values of user-defined
-as well as of predefined types. Standard means of representing values
-in display form are also provided.
+{<AI95-00387-01AI95-00387-01>} The predefined environment of the
+language provides for input-output and other capabilities by means of
+standard library packages. Input-output is supported for values of
+user-defined as well as of predefined types. Standard means of
+representing values in display form are also provided.
42.1/2
-{AI95-00387-01AI95-00387-01} The predefined standard library packages
+{<AI95-00387-01AI95-00387-01>} The predefined standard library packages
provide facilities such as string manipulation, containers of various
kinds (vectors, lists, maps, etc.), mathematical functions, random
number generation, and access to the execution environment.
42.2/2
-{AI95-00387-01AI95-00387-01} The specialized annexes define further
+{<AI95-00387-01AI95-00387-01>} The specialized annexes define further
predefined library packages and facilities with emphasis on areas such
as real-time scheduling, interrupt handling, distributed systems,
numerical computation, and high-integrity systems.
@@ -690,11 +690,11 @@ to all types of a given class.
Language Changes
-Paragraphs 44 through 57 have been removed as they described differences
-from the first edition of Ada (Ada 83).
+<Paragraphs 44 through 57 have been removed as they described
+differences from the first edition of Ada (Ada 83).>
57.1/3
-{AI95-00387-01AI95-00387-01} This International Standard replaces the
+{<AI95-00387-01AI95-00387-01>} This International Standard replaces the
second edition of 1995. It modifies the previous edition by making
changes and additions that improve the capability of the language and
the reliability of programs written in the language. This edition
@@ -704,7 +704,7 @@ interfacing to other languages, and both the
object-oriented and
real-time capabilities.
57.2/3
-{AI95-00387-01AI95-00387-01} {AI05-0299-1AI05-0299-1} Significant
+{<AI95-00387-01AI95-00387-01>} {<AI05-0299-1AI05-0299-1>} Significant
changes originating in Amendment 1 are incorporated:
57.3/3
@@ -771,7 +771,7 @@ changes originating in Amendment 1 are incorporated:
subclauses *note 6.1::, *note 11.4.2::, and *note 11.5::.
57.12/3
-{AI05-0245-1AI05-0245-1} In addition, this third edition makes
+{<AI05-0245-1AI05-0245-1>} In addition, this third edition makes
enhancements to address two important issues, namely, the particular
problems of multiprocessor architectures, and the need to further
increase the capabilities regarding assertions for correctness. It also
@@ -779,7 +779,7 @@ makes additional changes and additions that improve the
capability of
the language and the reliability of programs written in the language.
57.13/3
-{AI05-0245-1AI05-0245-1} {AI05-0299-1AI05-0299-1} The following
+{<AI05-0245-1AI05-0245-1>} {<AI05-0299-1AI05-0299-1>} The following
significant changes with respect to the 1995 edition as amended by
Amendment 1 are incorporated:
@@ -790,7 +790,7 @@ Amendment 1 are incorporated:
13.1.1::.
57.15/4
- * {AI12-0141-1AI12-0141-1} The concept of assertions introduced in
+ * {<AI12-0141-1AI12-0141-1>} The concept of assertions introduced in
the 2005 edition is extended with the ability to specify
preconditions and postconditions for subprograms, and invariants
for private types and interfaces. The concept of constraints in
@@ -800,7 +800,7 @@ Amendment 1 are incorporated:
subclauses *note 3.2.4::, *note 6.1.1::, and *note 7.3.2::.
57.16/4
- * {AI12-0141-1AI12-0141-1} New forms of expressions are introduced.
+ * {<AI12-0141-1AI12-0141-1>} New forms of expressions are introduced.
These are if expressions, case expressions, quantified expressions,
expression functions, and raise expressions. As well as being
useful for programming in general by avoiding the introduction of
@@ -862,18 +862,18 @@ initiate the defect correction procedure.
Comments should use the following format:
60/3
- !topic Title summarizing comment
- !reference Ada 2012 RMss.ss(pp)
- !from Author Name yy-mm-dd
- !keywords keywords related to topic
+ !topic <Title summarizing comment>
+ !reference Ada 2012 RM<ss.ss(pp)>
+ !from <Author Name yy-mm-dd>
+ !keywords <keywords related to topic>
!discussion
- text of discussion
+ <text of discussion>
61/3
-where ss.ss is the clause or subclause number, pp is the paragraph
-number where applicable, and yy-mm-dd is the date the comment was sent.
-The date is optional, as is the !keywords line.
+where <ss.ss> is the clause or subclause number, <pp> is the paragraph
+number where applicable, and <yy-mm-dd> is the date the comment was
+sent. The date is optional, as is the !keywords line.
62/1
Please use a descriptive "Subject" in your e-mail message, and limit
@@ -1174,10 +1174,10 @@ Manual, except:
thus, the page breaks are in different places.
77.1/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
77.2/3
- * {AI05-0299-1AI05-0299-1} The "Using this version of the Ada
+ * {<AI05-0299-1AI05-0299-1>} The "Using this version of the Ada
Reference Manual" subclause is not included in the International
Standard.
@@ -1213,7 +1213,7 @@ inserted, the paragraph numbers are of the form pp.nn,
where pp is the
number of the preceding paragraph, and nn is an insertion number. For
instance, the first paragraph inserted after paragraph 8 is numbered
8.1, the second paragraph inserted is numbered 8.2, and so on. Deleted
-paragraphs are indicated by the text This paragraph was deleted.
+paragraphs are indicated by the text <This paragraph was deleted.>
Deleted paragraphs include empty paragraphs that were numbered in the
1995 edition of the Ada Reference Manual. Similar markings and
numbering are used for changes to annotations.
@@ -1279,7 +1279,7 @@ File: aarm2012.info, Node: 1, Next: 2, Prev: Front
Matter, Up: Top
2.e
* The rules of the language (and some AARM-only text) are
- categorized, and placed under certain sub-headings that
+ categorized, and placed under certain <sub-headings> that
indicate the category. For example, the distinction
between Name Resolution Rules and Legality Rules is
particularly important, as explained in *note 8.6::.
@@ -1446,9 +1446,8 @@ File: aarm2012.info, Node: 1, Next: 2, Prev: Front
Matter, Up: Top
printed in a smaller font.
2.mm
- If you have trouble finding things, be sure to use the index.
- Each defined term appears there, and also in italics, like
- this. Syntactic categories defined in BNF are also indexed.
+ If you have trouble finding things, be sure to use the index.
Each defined term appears there, and also in <italics, like
+ this>. Syntactic categories defined in BNF are also indexed.
2.nn
A definition marked "[distributed]" is the main definition for
@@ -1470,12 +1469,12 @@ File: aarm2012.info, Node: 1.1, Next: 1.2, Up: 1
=========
1/3
-{AI05-0299-1AI05-0299-1} This International Standard specifies the form
-and meaning of programs written in Ada. Its purpose is to promote the
-portability of Ada programs to a variety of computing systems.
+{<AI05-0299-1AI05-0299-1>} This International Standard specifies the
+form and meaning of programs written in Ada. Its purpose is to promote
+the portability of Ada programs to a variety of computing systems.
2/3
-{AI05-0299-1AI05-0299-1} Ada is a programming language designed to
+{<AI05-0299-1AI05-0299-1>} Ada is a programming language designed to
support the construction of long-lived, highly reliable software
systems. The language includes facilities to define packages of related
types, objects, and operations. The packages may be parameterized and
@@ -1490,8 +1489,8 @@ The language treats modularity in the physical sense as
well, with a
facility to support separate compilation.
3/4
-{AI05-0269-1AI05-0269-1} {AI05-0299-1AI05-0299-1}
-{AI12-0056-1AI12-0056-1} The language provides rich support for
+{<AI05-0269-1AI05-0269-1>} {<AI05-0299-1AI05-0299-1>}
+{<AI12-0056-1AI12-0056-1>} The language provides rich support for
real-time, concurrent programming, and includes facilities for multicore
and multiprocessor programming. Errors can be signaled as exceptions
and handled explicitly. The language also covers systems programming;
@@ -1578,11 +1577,11 @@ File: aarm2012.info, Node: 1.1.2, Next: 1.1.3, Prev:
1.1.1, Up: 1.1
---------------
1/3
-{AI05-0299-1AI05-0299-1} This International Standard contains thirteen
+{<AI05-0299-1AI05-0299-1>} This International Standard contains thirteen
clauses, fifteen annexes, and an index.
1.a/3
- Discussion: {AI05-0299-1AI05-0299-1} What Ada 83 called a
+ Discussion: {<AI05-0299-1AI05-0299-1>} What Ada 83 called a
"chapter" and Ada 95 (and Ada 2005) called a "section" is
called a "clause" in this Standard. Similarly, what Ada 83
called a "section" and Ada 95 (and Ada 2005) called a "clause"
@@ -1591,10 +1590,10 @@ clauses, fifteen annexes, and an index.
ever-changing ISO rules for drafting Standards.
2
-The core of the Ada language consists of:
+The <core> of the Ada language consists of:
3/3
- * {AI05-0299-1AI05-0299-1} Clauses 1 through 13
+ * {<AI05-0299-1AI05-0299-1>} Clauses 1 through 13
4
* *note Annex A::, "*note Annex A:: Predefined Language Environment"
@@ -1606,8 +1605,8 @@ The core of the Ada language consists of:
* *note Annex J::, "*note Annex J:: Obsolescent Features"
7
-The following Specialized Needs Annexes define features that are needed
-by certain application areas:
+The following <Specialized Needs Annexes> define features that are
+needed by certain application areas:
8
* *note Annex C::, "*note Annex C:: Systems Programming"
@@ -1636,8 +1635,8 @@ informative:
* Text under a NOTES or Examples heading.
16/3
- * {AI05-0299-1AI05-0299-1} Each subclause whose title starts with the
- word "Example" or "Examples".
+ * {<AI05-0299-1AI05-0299-1>} Each subclause whose title starts with
+ the word "Example" or "Examples".
17
All implementations shall conform to the core language. In addition, an
@@ -1655,8 +1654,8 @@ The following Annexes are informative:
* *note Annex L::, "*note Annex L:: Language-Defined Pragmas"
21/3
- * {AI05-0004-1AI05-0004-1} *note Annex M::, "*note Annex M:: Summary
- of Documentation Requirements"
+ * {<AI05-0004-1AI05-0004-1>} *note Annex M::, "*note Annex M::
+ Summary of Documentation Requirements"
22
* *note Annex N::, "*note Annex N:: Glossary"
@@ -1665,7 +1664,7 @@ The following Annexes are informative:
* *note Annex P::, "*note Annex P:: Syntax Summary"
23.1/3
- * {AI05-0262-1AI05-0262-1} *note Annex Q::, "*note Annex Q::
+ * {<AI05-0262-1AI05-0262-1>} *note Annex Q::, "*note Annex Q::
Language-Defined Entities"
23.a
@@ -1689,11 +1688,11 @@ The following Annexes are informative:
the functionality.
23.c/2
- {AI95-00114-01AI95-00114-01} We recommend that the
+ {<AI95-00114-01AI95-00114-01>} We recommend that the
certification procedures allow implementations to certify the
core language, plus any set of the Specialized Needs Annexes.
- We recommend that implementations not be allowed to certify a
- portion of one of the Specialized Needs Annexes, although
+ We recommend that implementations <not> be allowed to certify
+ a portion of one of the Specialized Needs Annexes, although
implementations can, of course, provide uncertified support
for such portions. We have designed the Specialized Needs
Annexes assuming that this recommendation is followed. Thus,
@@ -1720,9 +1719,9 @@ The following Annexes are informative:
Needs Annexes, and that the semantics of the program will not
change. For example, an implementation should not provide a
package with the same name as one defined in one of the
- Specialized Needs Annexes, but that behaves differently, even
+ Specialized Needs Annexes, but that behaves differently, <even
if that implementation does not claim conformance to that
- Annex.
+ Annex>.
23.f
Note that the Specialized Needs Annexes do not conflict with
@@ -1730,10 +1729,10 @@ The following Annexes are informative:
conform to all of them.
24/4
-{AI05-0299-1AI05-0299-1} {AI12-0056-1AI12-0056-1} Each clause is divided
-into subclauses that have a common structure. Each clause and subclause
-first introduces its subject. After the introductory text, text is
-labeled with the following headings:
+{<AI05-0299-1AI05-0299-1>} {<AI12-0056-1AI12-0056-1>} Each clause is
+divided into subclauses that have a common structure. Each clause and
+subclause first introduces its subject. After the introductory text,
+text is labeled with the following headings:
_Language Design Principles_
@@ -1744,8 +1743,8 @@ labeled with the following headings:
explained.
24.b/3
- {AI05-0005-1AI05-0005-1} This is not part of the definition of
- the language, and does not appear in the Ada 2012 RM.
+ {<AI05-0005-1AI05-0005-1>} This is not part of the definition
+ of the language, and does not appear in the Ada 2012 RM.
_Syntax_
@@ -1755,7 +1754,7 @@ labeled with the following headings:
_Name Resolution Rules_
26/3
-{AI05-0299-1AI05-0299-1} Compile-time rules that are used in name
+{<AI05-0299-1AI05-0299-1>} Compile-time rules that are used in name
resolution, including overload resolution.
26.a
@@ -1779,7 +1778,7 @@ resolution, including overload resolution.
_Legality Rules_
27
-Rules that are enforced at compile time. A construct is legal if it
+Rules that are enforced at compile time. A construct is <legal> if it
obeys all of the Legality Rules.
27.a
@@ -1811,8 +1810,8 @@ A definition of the compile-time effect of each construct.
_Post-Compilation Rules_
29
-Rules that are enforced before running a partition. A partition is legal
-if its compilation units are legal and it obeys all of the
+Rules that are enforced before running a partition. A partition is
+legal if its compilation units are legal and it obeys all of the
Post-Compilation Rules.
29.a
@@ -1975,7 +1974,7 @@ This material is informative.
39.c
(Note that the semantics of a program is not the same thing as
the behavior of the program. Because of Ada's indeterminacy,
- the "semantics" of a given feature describes a set of
+ the "semantics" of a given feature describes a <set> of
behaviors that can be exhibited by that feature. The set can
contain more than one allowed behavior. Thus, when we ask
whether the semantics changes, we are asking whether the set
@@ -2048,7 +2047,7 @@ This material is informative.
different semantics.
39.n/3
- {AI05-0005-1AI05-0005-1} Inconsistencies marked with
+ {<AI05-0005-1AI05-0005-1>} Inconsistencies marked with
Corrigendum: are corrections to the original Ada 95 definition
introduced by Corrigendum 1. Inconsistencies marked with
Amendment Correction: are corrections to the original Ada 95
@@ -2078,7 +2077,7 @@ This material is informative.
in which a legal Ada 95 program is illegal in Ada 2005.
39.q/3
- {AI05-0005-1AI05-0005-1} As with inconsistencies,
+ {<AI05-0005-1AI05-0005-1>} As with inconsistencies,
incompatibilities marked with Corrigendum: are corrections to
the original Ada 95 definition introduced by Corrigendum 1.
Incompatibilities marked with Amendment Correction: are
@@ -2109,18 +2108,18 @@ This material is informative.
into this category.
39.t/3
- {AI05-0005-1AI05-0005-1} As with incompatibilities, extensions
- marked with Corrigendum: are corrections to the original Ada
- 95 definition introduced by Corrigendum 1. Extensions marked
- with Amendment Correction: are corrections to the original Ada
- 95 definition added by Amendment 1. Formally, these are
- extensions allowed by Ada Issues classified as Binding
- Interpretations. As corrections, implementations of Ada 95
- are allowed to implement these extensions. Thus, these
- strictly speaking are not extensions of Ada 95; they're part
- of Ada 95. Practically, however, they very well may be
- extensions, as early Ada 95 implementations might not
- implement the extension. Therefore, some Ada 95
+ {<AI05-0005-1AI05-0005-1>} As with incompatibilities,
+ extensions marked with Corrigendum: are corrections to the
+ original Ada 95 definition introduced by Corrigendum 1.
+ Extensions marked with Amendment Correction: are corrections
+ to the original Ada 95 definition added by Amendment 1.
+ Formally, these are extensions allowed by Ada Issues
+ classified as Binding Interpretations. As corrections,
+ implementations of Ada 95 are allowed to implement these
+ extensions. Thus, these strictly speaking are not extensions
+ of Ada 95; they're part of Ada 95. Practically, however, they
+ very well may be extensions, as early Ada 95 implementations
+ might not implement the extension. Therefore, some Ada 95
implementations may be able to compile the examples, while
others might not. In contrast, Ada 2005 compilers will always
support the extensions. Therefore, we document these for
@@ -2391,7 +2390,7 @@ File: aarm2012.info, Node: 1.1.3, Next: 1.1.4, Prev:
1.1.2, Up: 1.1
A conforming implementation shall:
1.a
- Discussion: The implementation is the software and hardware
+ Discussion: The <implementation> is the software and hardware
that implements the language. This includes compiler, linker,
operating system, hardware, etc.
@@ -2466,7 +2465,7 @@ A conforming implementation shall:
5.c
Wherever in the standard the text of a language-defined
library unit contains an italicized phrase starting with
- "implementation-defined", the implementation's version will
+ "<implementation-defined>", the implementation's version will
replace that phrase with some implementation-defined text that
is syntactically legal at that place, and follows any other
applicable rules.
@@ -2502,9 +2501,9 @@ A conforming implementation shall:
International Standard.
8
-The external effect of the execution of an Ada program is defined in
-terms of its interactions with its external environment. The following
-are defined as external interactions:
+The <external effect> of the execution of an Ada program is defined in
+terms of its interactions with its external environment. The following
+are defined as <external interactions>:
9
* Any interaction with an external file (see *note A.7::);
@@ -2532,8 +2531,8 @@ are defined as external interactions:
results and values returned in [in] out parameters.
12.a.1/1
- {8652/00948652/0094} {AI95-00119-01AI95-00119-01} The lack of
- a result from a program that does not terminate is also
+ {<8652/00948652/0094>} {<AI95-00119-01AI95-00119-01>} The lack
+ of a result from a program that does not terminate is also
included here.
13
@@ -2545,7 +2544,7 @@ are defined as external interactions:
at the time of any other interaction with the external environment.
14.a/3
- To be honest: {AI05-0229-1AI05-0229-1} Also other uses of
+ To be honest: {<AI05-0229-1AI05-0229-1>} Also other uses of
imported and exported entities, as defined by the
implementation, if the implementation supports such importing
or exporting.
@@ -2572,9 +2571,9 @@ semantics of the given program.
11.6:: is part of the standard.
15.c
- Note also that we only require "an appropriate sequence of
- external interactions" rather than "the same sequence..." An
- optimizer may cause a different sequence of external
+ Note also that we only require "<an appropriate> sequence of
+ external interactions" rather than "<the same> sequence..."
+ An optimizer may cause a different sequence of external
interactions to be produced than would be produced without the
optimizer, so long as the new sequence still satisfies the
requirements of the standard. For example, optimization might
@@ -2617,7 +2616,7 @@ as specified.
Annex.
17/3
-{AI05-0229-1AI05-0229-1} An implementation conforming to this
+{<AI05-0229-1AI05-0229-1>} An implementation conforming to this
International Standard may provide additional aspects, attributes,
library units, and pragmas. However, it shall not provide any aspect,
attribute, library unit, or pragma having the same name as an aspect,
@@ -2675,13 +2674,13 @@ time.
_Documentation Requirements_
18
-Certain aspects of the semantics are defined to be either implementation
-defined or unspecified. In such cases, the set of possible effects is
-specified, and the implementation may choose any effect in the set.
-Implementations shall document their behavior in implementation-defined
-situations, but documentation is not required for unspecified
-situations. The implementation-defined characteristics are summarized
-in *note M.2::.
+Certain aspects of the semantics are defined to be either
+<implementation defined> or <unspecified>. In such cases, the set of
+possible effects is specified, and the implementation may choose any
+effect in the set. Implementations shall document their behavior in
+implementation-defined situations, but documentation is not required for
+unspecified situations. The implementation-defined characteristics are
+summarized in *note M.2::.
18.a
Discussion: We used to use the term "implementation dependent"
@@ -2737,7 +2736,7 @@ Annex feature at run time, it should raise Program_Error
if feasible.
time.
20.a
- Reason: The reason we don't require Program_Error is that
+ Reason: The reason we don't <require> Program_Error is that
there are situations where other exceptions might make sense.
For example, if the Real Time Systems Annex requires that the
range of System.Priority include at least 30 values, an
@@ -2817,7 +2816,7 @@ variant of Backus-Naur Form. In particular:
rules are equivalent.
9/2
- {AI95-00433-01AI95-00433-01}
+ {<AI95-00433-01AI95-00433-01>}
simple_return_statement ::= return [expression];
simple_return_statement ::= return; | return expression;
@@ -2844,7 +2843,7 @@ variant of Backus-Naur Form. In particular:
* If the name of any syntactic category starts with an italicized
part, it is equivalent to the category name without the italicized
part. The italicized part is intended to convey some semantic
- information. For example subtype_name and task_name are both
+ information. For example <subtype_>name and <task_>name are both
equivalent to name alone.
14.a
@@ -2856,7 +2855,7 @@ variant of Backus-Naur Form. In particular:
We often use "if" to mean "if and only if" in definitions.
For example, if we define "photogenic" by saying, "A type is
photogenic if it has the following properties...," we mean
- that a type is photogenic if and only if it has those
+ that a type is photogenic if <and only if> it has those
properties. It is usually clear from the context, and adding
the "and only if" seems too cumbersome.
@@ -2882,8 +2881,8 @@ variant of Backus-Naur Form. In particular:
not some type Duration the user might have declared.
14.1/3
-{AI95-00285-01AI95-00285-01} {AI05-0004-1AI05-0004-1}
-{AI05-0262-1AI05-0262-1} The delimiters, compound delimiters, reserved
+{<AI95-00285-01AI95-00285-01>} {<AI05-0004-1AI05-0004-1>}
+{<AI05-0262-1AI05-0262-1>} The delimiters, compound delimiters, reserved
words, and numeric_literals are exclusively made of the characters whose
code point is between 16#20# and 16#7E#, inclusively. The special
characters for which names are defined in this International Standard
@@ -2897,23 +2896,23 @@ CAPITAL LETTER E", not "GREEK CAPITAL LETTER EPSILON".]
range are required.
14.2/3
-{AI95-00395-01AI95-00395-01} {AI05-0227-1AI05-0227-1}
-{AI05-0299-1AI05-0299-1} When this International Standard mentions the
+{<AI95-00395-01AI95-00395-01>} {<AI05-0227-1AI05-0227-1>}
+{<AI05-0299-1AI05-0299-1>} When this International Standard mentions the
conversion of some character or sequence of characters to upper case, it
means the character or sequence of characters obtained by using simple
upper case mapping, as defined by documents referenced in the note in
Clause 1 of ISO/IEC 10646:2011.
14.e.1/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
15
-A syntactic category is a nonterminal in the grammar defined in BNF
+A <syntactic category> is a nonterminal in the grammar defined in BNF
under "Syntax." Names of syntactic categories are set in a different
font, like_this.
16
-A construct is a piece of text (explicit or implicit) that is an
+A <construct> is a piece of text (explicit or implicit) that is an
instance of a syntactic category defined under "Syntax".
16.a
@@ -2930,21 +2929,21 @@ instance of a syntactic category defined under "Syntax".
of that text.
17
-A constituent of a construct is the construct itself, or any construct
+A <constituent> of a construct is the construct itself, or any construct
appearing within it.
18
Whenever the run-time semantics defines certain actions to happen in an
-arbitrary order, this means that the implementation shall arrange for
+<arbitrary order>, this means that the implementation shall arrange for
these actions to occur in a way that is equivalent to some sequential
order, following the rules that result from that sequential order. When
evaluations are defined to happen in an arbitrary order, with conversion
of the results to some subtypes, or with some run-time checks, the
evaluations, conversions, and checks may be arbitrarily interspersed, so
long as each expression is evaluated before converting or checking its
-value. [Note that the effect of a program can depend on the order chosen
-by the implementation. This can happen, for example, if two actual
-parameters of a given call have side effects.]
+value. [Note that the effect of a program can depend on the order
+chosen by the implementation. This can happen, for example, if two
+actual parameters of a given call have side effects.]
18.a
Discussion: Programs will be more portable if their external
@@ -2999,7 +2998,7 @@ parameters of a given call have side effects.]
_Wording Changes from Ada 95_
21.a/2
- {AI95-00285-01AI95-00285-01} We now explicitly say that the
+ {<AI95-00285-01AI95-00285-01>} We now explicitly say that the
lexical elements of the language (with a few exceptions) are
made up of characters in the lower half of the Latin-1
character set. This is needed to avoid confusion given the
@@ -3007,21 +3006,21 @@ parameters of a given call have side effects.]
and strings.
21.b/2
- {AI95-00395-01AI95-00395-01} We now explicitly define what the
- Standard means by upper case, as there are many possibilities
- for ISO 10646 characters.
+ {<AI95-00395-01AI95-00395-01>} We now explicitly define what
+ the Standard means by upper case, as there are many
+ possibilities for ISO 10646 characters.
21.c/2
- {AI95-00433-01AI95-00433-01} The example for square brackets
+ {<AI95-00433-01AI95-00433-01>} The example for square brackets
has been changed as there is no longer a return_statement
syntax rule.
_Wording Changes from Ada 2005_
21.d/3
- {AI05-0227-1AI05-0227-1} Correction: Upper case is defined by
- "simple upper case mapping", because "full case folding" is a
- mapping (mostly) to lower case.
+ {<AI05-0227-1AI05-0227-1>} Correction: Upper case is defined
+ by "simple upper case mapping", because "full case folding" is
+ a mapping (mostly) to lower case.
File: aarm2012.info, Node: 1.1.5, Prev: 1.1.4, Up: 1.1
@@ -3046,7 +3045,7 @@ categories:
allowed, permitted, legal, or illegal belongs to this category.
Any program that contains such an error is not a legal Ada program;
on the other hand, the fact that a program is legal does not mean,
- per se, that the program is free from other forms of error.
+ <per se>, that the program is free from other forms of error.
4
The rules are further classified as either compile time rules, or
@@ -3081,10 +3080,10 @@ categories:
8
The language rules define certain kinds of errors that need not be
detected either prior to or during run time, but if not detected,
- the range of possible effects shall be bounded. The errors of this
- category are called bounded errors. The possible effects of a given
- bounded error are specified for each such error, but in any case
- one possible effect of a bounded error is the raising of the
+ the range of possible effects shall be bounded. The errors of this
+ category are called <bounded errors>. The possible effects of a
+ given bounded error are specified for each such error, but in any
+ case one possible effect of a bounded error is the raising of the
exception Program_Error.
9
@@ -3092,7 +3091,7 @@ categories:
10
In addition to bounded errors, the language rules define certain
- kinds of errors as leading to erroneous execution. Like bounded
+ kinds of errors as leading to <erroneous execution>. Like bounded
errors, the implementation need not detect such errors either prior
to or during run time. Unlike bounded errors, there is no
language-specified bound on the possible effect of erroneous
@@ -3125,7 +3124,7 @@ categories:
_Implementation Permissions_
11
-[ An implementation may provide nonstandard modes of operation.
+[ An implementation may provide <nonstandard modes> of operation.
Typically these modes would be selected by a pragma or by a command line
switch when the compiler is invoked. When operating in a nonstandard
mode, the implementation may reject compilation_units that do not
@@ -3133,8 +3132,7 @@ conform to additional requirements associated with the
mode, such as an
excessive number of warnings or violation of coding style guidelines.
Similarly, in a nonstandard mode, the implementation may apply special
optimizations or alternative algorithms that are only meaningful for
-programs that satisfy certain criteria specified by the implementation.
-In any case, an implementation shall support a standard mode that
+programs that satisfy certain criteria specified by the implementation.In any
case, an implementation shall support a <standard> mode that
conforms to the requirements of this International Standard; in
particular, in the standard mode, all legal compilation_units shall be
accepted.]
@@ -3170,10 +3168,10 @@ should raise Program_Error.
12.b
Other situations that are erroneous in Ada 83 are changed to
be bounded errors. In particular, evaluating an uninitialized
- scalar variable is a bounded error. The possible results are
+ scalar variable is a bounded error. The possible results are
to raise Program_Error (as always), or to produce a
machine-representable value (which might not be in the subtype
- of the variable). Violating a Range_Check or Overflow_Check
+ of the variable). Violating a Range_Check or Overflow_Check
raises Constraint_Error, even if the value came from an
uninitialized variable. This means that optimizers can no
longer "assume" that all variables are initialized within
@@ -3200,95 +3198,96 @@ File: aarm2012.info, Node: 1.2, Next: 1.3, Prev:
1.1, Up: 1
========================
1/3
-{AI05-0299-1AI05-0299-1} The following documents, in whole or in part,
+{<AI05-0299-1AI05-0299-1>} The following documents, in whole or in part,
are normatively referenced in this document and are indispensable for
its application. For dated references, only the edition cited applies.
For undated references, the latest edition of the referenced document
(including any amendments) applies.
1.1/3
-{AI05-0127-2AI05-0127-2} {AI05-0299-1AI05-0299-1} ISO 639-3:2007, Codes
-for the representation of names of languages -- Part 3: Alpha-3 code for
-comprehensive coverage of languages.
+{<AI05-0127-2AI05-0127-2>} {<AI05-0299-1AI05-0299-1>} ISO 639-3:2007,
+<Codes for the representation of names of languages -- Part 3: Alpha-3
+code for comprehensive coverage of languages>.
2
-ISO/IEC 646:1991, Information technology -- ISO 7-bit coded character
-set for information interchange.
+ISO/IEC 646:1991, <Information technology -- ISO 7-bit coded character
+set for information interchange>.
3/2
-{AI95-00415-01AI95-00415-01} ISO/IEC 1539-1:2004, Information technology
--- Programming languages -- Fortran -- Part 1: Base language.
+{<AI95-00415-01AI95-00415-01>} ISO/IEC 1539-1:2004, <Information
+technology -- Programming languages -- Fortran -- Part 1: Base
+language>.
4/2
-{AI95-00415-01AI95-00415-01} ISO/IEC 1989:2002, Information technology
--- Programming languages -- COBOL.
+{<AI95-00415-01AI95-00415-01>} ISO/IEC 1989:2002, <Information
+technology -- Programming languages -- COBOL>.
4.1/3
-{AI05-0127-2AI05-0127-2} {AI05-0299-1AI05-0299-1} ISO/IEC 3166-1:2006,
-Codes for the representation of names of countries and their
-subdivisions -- Part 1: Country Codes.
+{<AI05-0127-2AI05-0127-2>} {<AI05-0299-1AI05-0299-1>} ISO/IEC
+3166-1:2006, <Codes for the representation of names of countries and
+their subdivisions -- Part 1: Country Codes>.
5
-ISO/IEC 6429:1992, Information technology -- Control functions for coded
-graphic character sets.
+ISO/IEC 6429:1992, <Information technology -- Control functions for
+coded graphic character sets>.
5.1/2
-{AI95-00351-01AI95-00351-01} ISO 8601:2004, Data elements and
+{<AI95-00351-01AI95-00351-01>} ISO 8601:2004, <Data elements and
interchange formats -- Information interchange -- Representation of
-dates and times.
+dates and times>.
6/3
-{AI05-0299-1AI05-0299-1} ISO/IEC 8859-1:1998, Information technology --
-8-bit single-byte coded graphic character sets -- Part 1: Latin alphabet
-No. 1.
+{<AI05-0299-1AI05-0299-1>} ISO/IEC 8859-1:1998, <Information technology
+-- 8-bit single-byte coded graphic character sets -- Part 1: Latin
+alphabet No. 1>.
7/3
-{AI95-00415-01AI95-00415-01} {AI05-0266-1AI05-0266-1} ISO/IEC 9899:2011,
-Information technology -- Programming languages -- C.
+{<AI95-00415-01AI95-00415-01>} {<AI05-0266-1AI05-0266-1>} ISO/IEC
+9899:2011, <Information technology -- Programming languages -- C>.
8/3
-{8652/00018652/0001} {AI95-00124-01AI95-00124-01}
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1} ISO/IEC
-10646:2011, Information technology -- Universal Multiple-Octet Coded
-Character Set (UCS).
+{<8652/00018652/0001>} {<AI95-00124-01AI95-00124-01>}
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>} ISO/IEC
+10646:2011, <Information technology -- Universal Multiple-Octet Coded
+Character Set (UCS)>.
8.a.1/2
- This paragraph was deleted.{8652/00018652/0001}
- {AI95-00124-01AI95-00124-01} {AI95-00285-01AI95-00285-01}
+ <This paragraph was deleted.>{<8652/00018652/0001>}
+ {<AI95-00124-01AI95-00124-01>} {<AI95-00285-01AI95-00285-01>}
9/3
-{AI95-00376-01AI95-00376-01} {AI05-0266-1AI05-0266-1} ISO/IEC
-14882:2011, Information technology -- Programming languages -- C++.
+{<AI95-00376-01AI95-00376-01>} {<AI05-0266-1AI05-0266-1>} ISO/IEC
+14882:2011, <Information technology -- Programming languages -- C++>.
10/2
-{AI95-00285-01AI95-00285-01} ISO/IEC TR 19769:2004, Information
+{<AI95-00285-01AI95-00285-01>} ISO/IEC TR 19769:2004, <Information
technology -- Programming languages, their environments and system
software interfaces -- Extensions for the programming language C to
-support new character data types.
+support new character data types>.
10.a
- Discussion: POSIX, Portable Operating System Interface (POSIX)
- -- Part 1: System Application Program Interface (API) [C
- Language], The Institute of Electrical and Electronics
+ Discussion: POSIX, <Portable Operating System Interface
+ (POSIX) -- Part 1: System Application Program Interface (API)
+ [C Language]>, The Institute of Electrical and Electronics
Engineers, 1990.
_Wording Changes from Ada 95_
10.b/2
- {AI95-00285-01AI95-00285-01} {AI95-00376-01AI95-00376-01}
- {AI95-00415-01AI95-00415-01} Updated references to the most
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00376-01AI95-00376-01>}
+ {<AI95-00415-01AI95-00415-01>} Updated references to the most
recent versions of these standards. Added C++ and time
standards. Added C character set technical report.
_Wording Changes from Ada 2005_
10.c/3
- {AI05-0127-2AI05-0127-2} Added language and country code
+ {<AI05-0127-2AI05-0127-2>} Added language and country code
standards for locale support.
10.d/3
- {AI05-0266-1AI05-0266-1} Updated references to the most recent
- versions of these standards.
+ {<AI05-0266-1AI05-0266-1>} Updated references to the most
+ recent versions of these standards.
File: aarm2012.info, Node: 1.3, Prev: 1.2, Up: 1
@@ -3297,26 +3296,27 @@ File: aarm2012.info, Node: 1.3, Prev: 1.2, Up: 1
=========================
1/2
-{AI95-00415-01AI95-00415-01} Terms are defined throughout this
-International Standard, indicated by italic type. Terms explicitly
+{<AI95-00415-01AI95-00415-01>} Terms are defined throughout this
+International Standard, indicated by <italic> type. Terms explicitly
defined in this International Standard are not to be presumed to refer
implicitly to similar terms defined elsewhere. Mathematical terms not
defined in this International Standard are to be interpreted according
-to the CRC Concise Encyclopedia of Mathematics, Second Edition. Other
+to the <CRC Concise Encyclopedia of Mathematics, Second Edition>. Other
terms not defined in this International Standard are to be interpreted
-according to the Webster's Third New International Dictionary of the
-English Language. Informal descriptions of some terms are also given in
-*note Annex N::, "*note Annex N:: Glossary".
+according to the <Webster's Third New International Dictionary of the
+English Language>. Informal descriptions of some terms are also given
+in *note Annex N::, "*note Annex N:: Glossary".
1.a
Discussion: The index contains an entry for every defined
term.
1.a.1/2
- {AI95-00415-01AI95-00415-01} The contents of the CRC Concise
- Encyclopedia of Mathematics, Second Edition can be accessed on
- http://www.mathworld.com (http://www.mathworld.com). The ISBN
- number of the book is ISBN 1584883472.
+ {<AI95-00415-01AI95-00415-01>} The contents of the <CRC
+ Concise Encyclopedia of Mathematics, Second Edition> can be
+ accessed on http://www.mathworld.com
+ (http://www.mathworld.com). The ISBN number of the book is
+ ISBN 1584883472.
1.b
Glossary entry: Each term defined in *note Annex N:: is marked
@@ -3324,28 +3324,28 @@ English Language. Informal descriptions of some terms
are also given in
1.c/3
Discussion: Here are some AARM-only definitions: The Ada
- Rapporteur Group (ARG) interprets the Ada Reference Manual. An
- Ada Issue (AI) is a numbered ruling from the ARG. Ada Issues
- created for Ada 83 are denoted as "AI83", while Ada Issues
- created for Ada 95 are denoted as "AI95" in this document.
- Similarly, Ada Issues created for Ada 2005 are denoted as
- "AI05" The Ada Commentary Integration Document (ACID) is an
- edition of the Ada 83 RM in which clearly marked insertions
- and deletions indicate the effect of integrating the approved
- AIs. The Uniformity Rapporteur Group (URG) issued
- recommendations intended to increase uniformity across Ada
- implementations. The functions of the URG have been assumed
- by the ARG. A Uniformity Issue (UI) was a numbered
+ Rapporteur Group (ARG) interprets the Ada Reference Manual.
+ An Ada Issue (AI) is a numbered ruling from the ARG. Ada
+ Issues created for Ada 83 are denoted as "AI83", while Ada
+ Issues created for Ada 95 are denoted as "AI95" in this
+ document. Similarly, Ada Issues created for Ada 2005 are
+ denoted as "AI05" The Ada Commentary Integration Document
+ (ACID) is an edition of the Ada 83 RM in which clearly marked
+ insertions and deletions indicate the effect of integrating
+ the approved AIs. The Uniformity Rapporteur Group (URG)
+ issued recommendations intended to increase uniformity across
+ Ada implementations. The functions of the URG have been
+ assumed by the ARG. A Uniformity Issue (UI) was a numbered
recommendation from the URG. A Defect Report and Response is
an official query to WG9 about an error in the standard.
Defect Reports are processed by the ARG, and are referenced
here by their ISO numbers: 8652/nnnn. Most changes to the Ada
95 standard include reference(s) to the Defect Report(s) that
- prompted the change. The Ada Conformity Assessment Test Suite
- (ACATS) is a set of tests intended to check the conformity of
- Ada implementations to this standard. This set of tests was
- previously known as the Ada Compiler Validation Capability
- (ACVC).
+ prompted the change. The <Ada Conformity Assessment Test
+ Suite (ACATS)> is a set of tests intended to check the
+ conformity of Ada implementations to this standard. This set
+ of tests was previously known as the Ada Compiler Validation
+ Capability (ACVC).
File: aarm2012.info, Node: 2, Next: 3, Prev: 1, Up: Top
@@ -3354,8 +3354,8 @@ File: aarm2012.info, Node: 2, Next: 3, Prev: 1, Up:
Top
******************
1/3
-{AI05-0299-1AI05-0299-1} [The text of a program consists of the texts of
-one or more compilations. The text of a compilation is a sequence of
+{<AI05-0299-1AI05-0299-1>} [The text of a program consists of the texts
+of one or more compilations. The text of a compilation is a sequence of
lexical elements, each composed of characters; the rules of composition
are given in this clause. Pragmas, which provide certain information
for the compiler, are also described in this clause.]
@@ -3379,32 +3379,31 @@ File: aarm2012.info, Node: 2.1, Next: 2.2, Up: 2
=================
1/3
-{AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
-{AI05-0266-1AI05-0266-1} The character repertoire for the text of an Ada
-program consists of the entire coding space described by the ISO/IEC
+{<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+{<AI05-0266-1AI05-0266-1>} The character repertoire for the text of an
+Ada program consists of the entire coding space described by the ISO/IEC
10646:2011 Universal Multiple-Octet Coded Character Set. This coding
-space is organized in planes, each plane comprising 65536 characters.
-
+space is organized in <planes>, each plane comprising 65536 characters.
1.a/2
- This paragraph was deleted.{AI95-00285-01AI95-00285-01}
+ <This paragraph was deleted.>{<AI95-00285-01AI95-00285-01>}
1.b/2
- This paragraph was deleted.{AI95-00285-01AI95-00285-01}
+ <This paragraph was deleted.>{<AI95-00285-01AI95-00285-01>}
1.c/3
- Discussion: {AI95-00285-01AI95-00285-01}
- {AI05-0266-1AI05-0266-1} It is our intent to follow the
+ Discussion: {<AI95-00285-01AI95-00285-01>}
+ {<AI05-0266-1AI05-0266-1>} It is our intent to follow the
terminology of ISO/IEC 10646:2011 where appropriate, and to
remain compatible with the character classifications defined
in *note A.3::, "*note A.3:: Character Handling".
_Syntax_
- Paragraphs 2 and 3 were deleted.
+ <Paragraphs 2 and 3 were deleted.>
3.1/3
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
- {AI05-0266-1AI05-0266-1} A character is defined by this
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+ {<AI05-0266-1AI05-0266-1>} A character is defined by this
International Standard for each cell in the coding space described
by ISO/IEC 10646:2011, regardless of whether or not ISO/IEC
10646:2011 allocates a character to that cell.
@@ -3412,9 +3411,9 @@ space is organized in planes, each plane comprising 65536
characters.
_Static Semantics_
4/3
-{AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
-{AI05-0079-1AI05-0079-1} {AI05-0262-1AI05-0262-1}
-{AI05-0266-1AI05-0266-1} The coded representation for characters is
+{<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+{<AI05-0079-1AI05-0079-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0266-1AI05-0266-1>} The coded representation for characters is
implementation defined [(it need not be a representation defined within
ISO/IEC 10646:2011)]. A character whose relative code point in its
plane is 16#FFFE# or 16#FFFF# is not allowed anywhere in the text of a
@@ -3426,16 +3425,16 @@ categories other_format, format_effector, and
graphic_character.
of an Ada program.
4.b/2
- Ramification: {AI95-00285-01AI95-00285-01} Note that this rule
- doesn't really have much force, since the implementation can
- represent characters in the source in any way it sees fit.
+ Ramification: {<AI95-00285-01AI95-00285-01>} Note that this
+ rule doesn't really have much force, since the implementation
+ can represent characters in the source in any way it sees fit.
For example, an implementation could simply define that what
seems to be an other_private_use character is actually a
representation of the space character.
4.1/3
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1}
-{AI05-0299-1AI05-0299-1} The semantics of an Ada program whose text is
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>}
+{<AI05-0299-1AI05-0299-1>} The semantics of an Ada program whose text is
not in Normalization Form KC (as defined by Clause 21 of ISO/IEC
10646:2011) is implementation defined.
@@ -3444,114 +3443,116 @@ not in Normalization Form KC (as defined by Clause 21
of ISO/IEC
text is not in Normalization Form KC.
5/3
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1}
-{AI05-0299-1AI05-0299-1} The description of the language definition in
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>}
+{<AI05-0299-1AI05-0299-1>} The description of the language definition in
this International Standard uses the character properties General
Category, Simple Uppercase Mapping, Uppercase Mapping, and Special Case
Condition of the documents referenced by the note in Clause 1 of ISO/IEC
10646:2011. The actual set of graphic symbols used by an implementation
for the visual representation of the text of an Ada program is not
-specified.
+specified.
6/3
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1} Characters are
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>} Characters are
categorized as follows:
6.a/3
- Discussion: {AI05-0005-1AI05-0005-1} {AI05-0262-1AI05-0262-1}
- {AI05-0266-1AI05-0266-1} Our character classification
- considers that the cells not allocated in ISO/IEC 10646:2011
- are graphic characters, except for those whose relative code
- point in their plane is 16#FFFE# or 16#FFFF#. This seems to
- provide the best compatibility with future versions of ISO/IEC
- 10646, as future characters can already be used in Ada
- character and string literals.
+ Discussion: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0266-1AI05-0266-1>} Our
+ character classification considers that the cells not
+ allocated in ISO/IEC 10646:2011 are graphic characters, except
+ for those whose relative code point in their plane is 16#FFFE#
+ or 16#FFFF#. This seems to provide the best compatibility
+ with future versions of ISO/IEC 10646, as future characters
+ can already be used in Ada character and string literals.
7/2
- This paragraph was deleted.{AI95-00285-01AI95-00285-01}
+ <This paragraph was
+ deleted.>{<AI95-00285-01AI95-00285-01>}
8/2
-{AI95-00285-01AI95-00285-01} letter_uppercase
+{<AI95-00285-01AI95-00285-01>} letter_uppercase
Any character whose General Category is defined to be
"Letter, Uppercase".
9/2
-{AI95-00285-01AI95-00285-01} letter_lowercase
+{<AI95-00285-01AI95-00285-01>} letter_lowercase
Any character whose General Category is defined to be
"Letter, Lowercase".
9.a/1
- This paragraph was deleted.{8652/00018652/0001}
- {AI95-00124-01AI95-00124-01}
+ <This paragraph was deleted.>{<8652/00018652/0001>}
+ {<AI95-00124-01AI95-00124-01>}
9.1/2
-{AI95-00285-01AI95-00285-01} letter_titlecase
+{<AI95-00285-01AI95-00285-01>} letter_titlecase
Any character whose General Category is defined to be
"Letter, Titlecase".
9.2/2
-{AI95-00285-01AI95-00285-01} letter_modifier
+{<AI95-00285-01AI95-00285-01>} letter_modifier
Any character whose General Category is defined to be
"Letter, Modifier".
9.3/2
-{AI95-00285-01AI95-00285-01} letter_other
+{<AI95-00285-01AI95-00285-01>} letter_other
Any character whose General Category is defined to be
"Letter, Other".
9.4/2
-{AI95-00285-01AI95-00285-01} mark_non_spacing
+{<AI95-00285-01AI95-00285-01>} mark_non_spacing
Any character whose General Category is defined to be
"Mark, Non-Spacing".
9.5/2
-{AI95-00285-01AI95-00285-01} mark_spacing_combining
+{<AI95-00285-01AI95-00285-01>} mark_spacing_combining
Any character whose General Category is defined to be
"Mark, Spacing Combining".
10/2
-{AI95-00285-01AI95-00285-01} number_decimal
+{<AI95-00285-01AI95-00285-01>} number_decimal
Any character whose General Category is defined to be
"Number, Decimal".
10.1/2
-{AI95-00285-01AI95-00285-01} number_letter
+{<AI95-00285-01AI95-00285-01>} number_letter
Any character whose General Category is defined to be
"Number, Letter".
10.2/2
-{AI95-00285-01AI95-00285-01} punctuation_connector
+{<AI95-00285-01AI95-00285-01>} punctuation_connector
Any character whose General Category is defined to be
"Punctuation, Connector".
10.3/2
-{AI95-00285-01AI95-00285-01} other_format
+{<AI95-00285-01AI95-00285-01>} other_format
Any character whose General Category is defined to be
"Other, Format".
11/2
-{AI95-00285-01AI95-00285-01} separator_space
+{<AI95-00285-01AI95-00285-01>} separator_space
Any character whose General Category is defined to be
"Separator, Space".
12/2
-{AI95-00285-01AI95-00285-01} separator_line
+{<AI95-00285-01AI95-00285-01>} separator_line
Any character whose General Category is defined to be
"Separator, Line".
12.1/2
-{AI95-00285-01AI95-00285-01} separator_paragraph
+{<AI95-00285-01AI95-00285-01>} separator_paragraph
Any character whose General Category is defined to be
"Separator, Paragraph".
13/3
-{AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} format_effector
+{<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>}
+format_effector
The characters whose code points are 16#09# (CHARACTER
TABULATION), 16#0A# (LINE FEED), 16#0B# (LINE
TABULATION), 16#0C# (FORM FEED), 16#0D# (CARRIAGE
RETURN), 16#85# (NEXT LINE), and the characters in
- categories separator_line and separator_paragraph.
+ categories separator_line and separator_paragraph.
13.a/2
Discussion: ISO/IEC 10646:2003 does not define the names of
@@ -3559,42 +3560,42 @@ categorized as follows:
ISO/IEC 6429:1992. These are the names that we use here.
13.1/2
-{AI95-00285-01AI95-00285-01} other_control
+{<AI95-00285-01AI95-00285-01>} other_control
Any character whose General Category is defined to be
"Other, Control", and which is not defined to be a
format_effector.
13.2/2
-{AI95-00285-01AI95-00285-01} other_private_use
+{<AI95-00285-01AI95-00285-01>} other_private_use
Any character whose General Category is defined to be
"Other, Private Use".
13.3/2
-{AI95-00285-01AI95-00285-01} other_surrogate
+{<AI95-00285-01AI95-00285-01>} other_surrogate
Any character whose General Category is defined to be
"Other, Surrogate".
14/3
-{AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
-{AI05-0262-1AI05-0262-1} graphic_character
+{<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+{<AI05-0262-1AI05-0262-1>} graphic_character
Any character that is not in the categories
other_control, other_private_use, other_surrogate,
format_effector, and whose relative code point in its
plane is neither 16#FFFE# nor 16#FFFF#.
14.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
14.b/2
- Discussion: {AI95-00285-01AI95-00285-01} We considered basing
- the definition of lexical elements on Annex A of ISO/IEC TR
- 10176 (4th edition), which lists the characters which should
- be supported in identifiers for all programming languages, but
- we finally decided against this option. Note that it is not
- our intent to diverge from ISO/IEC TR 10176, except to the
- extent that ISO/IEC TR 10176 itself diverges from ISO/IEC
- 10646:2003 (which is the case at the time of this writing
- [January 2005]).
+ Discussion: {<AI95-00285-01AI95-00285-01>} We considered
+ basing the definition of lexical elements on Annex A of
+ ISO/IEC TR 10176 (4th edition), which lists the characters
+ which should be supported in identifiers for all programming
+ languages, but we finally decided against this option. Note
+ that it is not our intent to diverge from ISO/IEC TR 10176,
+ except to the extent that ISO/IEC TR 10176 itself diverges
+ from ISO/IEC 10646:2003 (which is the case at the time of this
+ writing [January 2005]).
14.c/2
More precisely, we intend to align strictly with ISO/IEC
@@ -3602,8 +3603,8 @@ categorized as follows:
Technical Report while ISO/IEC 10646:2003 is a Standard. If
one has to make a choice, one should conform with the Standard
rather than with the Technical Report. And, it turns out that
- one must make a choice because there are important differences
- between the two:
+ one <must> make a choice because there are important
+ differences between the two:
14.d/2
* ISO/IEC TR 10176 is still based on ISO/IEC 10646:2000
@@ -3648,13 +3649,13 @@ categorized as follows:
Unicode.
15/3
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1} The following
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>} The following
names are used when referring to certain characters (the first name is
that given in ISO/IEC 10646:2011):
15.a/3
- Discussion: {AI95-00285-01AI95-00285-01}
- {AI05-0266-1AI05-0266-1} This table serves to show the
+ Discussion: {<AI95-00285-01AI95-00285-01>}
+ {<AI05-0266-1AI05-0266-1>} This table serves to show the
correspondence between ISO/IEC 10646:2011 names and the
graphic symbols (glyphs) used in this International Standard.
These are the characters that play a special role in the
@@ -3676,7 +3677,7 @@ that given in ISO/IEC 10646:2011):
_Implementation Requirements_
16/3
-{AI05-0286-1AI05-0286-1} An Ada implementation shall accept Ada source
+{<AI05-0286-1AI05-0286-1>} An Ada implementation shall accept Ada source
code in UTF-8 encoding, with or without a BOM (see *note A.4.11::),
where every character is represented by its code point. The character
pair CARRIAGE RETURN/LINE FEED (code points 16#0D# 16#0A#) signifies a
@@ -3685,8 +3686,8 @@ format_effector other than the character whose code point
position is
16#09# (CHARACTER TABULATION) also signifies a single end of line.
16.a/3
- Reason: {AI05-0079-1AI05-0079-1} {AI05-0286-1AI05-0286-1} This
- is simply requiring that an Ada implementation be able to
+ Reason: {<AI05-0079-1AI05-0079-1>} {<AI05-0286-1AI05-0286-1>}
+ This is simply requiring that an Ada implementation be able to
directly process the ACATS, which is provided in the described
format. Note that files that only contain characters with
code points in the first 128 (which is the majority of the
@@ -3716,7 +3717,7 @@ format_effector other than the character whose code point
position is
_Implementation Permissions_
17/3
-{AI95-00285-01AI95-00285-01} {AI05-0266-1AI05-0266-1} The categories
+{<AI95-00285-01AI95-00285-01>} {<AI05-0266-1AI05-0266-1>} The categories
defined above, as well as case mapping and folding, may be based on an
implementation-defined version of ISO/IEC 10646 (2003 edition or later).
@@ -3737,12 +3738,12 @@ implementation-defined version of ISO/IEC 10646 (2003
edition or later).
NOTES
18/2
- 1 {AI95-00285-01AI95-00285-01} The characters in categories
+ 1 {<AI95-00285-01AI95-00285-01>} The characters in categories
other_control, other_private_use, and other_surrogate are only
allowed in comments.
19.a/3
- This paragraph was deleted.{AI05-0286-1AI05-0286-1}
+ <This paragraph was deleted.>{<AI05-0286-1AI05-0286-1>}
_Extensions to Ada 83_
@@ -3753,7 +3754,7 @@ implementation-defined version of ISO/IEC 10646 (2003
edition or later).
_Wording Changes from Ada 83_
19.c/3
- {AI95-00285-01AI95-00285-01} {AI05-0299-1AI05-0299-1} The
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0299-1AI05-0299-1>} The
syntax rules in this subclause are modified to remove the
emphasis on basic characters vs. others. (In this day and
age, there is no need to point out that you can write programs
@@ -3770,16 +3771,16 @@ implementation-defined version of ISO/IEC 10646 (2003
edition or later).
letters without diacritical marks.
19.d/2
- {AI95-00285-01AI95-00285-01} Character names now come from
+ {<AI95-00285-01AI95-00285-01>} Character names now come from
ISO/IEC 10646:2003.
19.e/2
- This paragraph was deleted.{AI95-00285-01AI95-00285-01}
+ <This paragraph was deleted.>{<AI95-00285-01AI95-00285-01>}
_Extensions to Ada 95_
19.f/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
Program text can use most characters defined by
ISO-10646:2003. This subclause has been rewritten to use the
categories defined in that Standard. This should ease
@@ -3788,7 +3789,7 @@ implementation-defined version of ISO/IEC 10646 (2003
edition or later).
_Inconsistencies With Ada 2005_
19.g/3
- {AI05-0299-1AI05-0299-1} {AI05-0266-1AI05-0266-1} An
+ {<AI05-0299-1AI05-0299-1>} {<AI05-0266-1AI05-0266-1>} An
implementation is allowed (but not required) to use a newer
character set standard to determine the categories, case
mapping, and case folding. Doing so will change the results
@@ -3806,13 +3807,13 @@ implementation-defined version of ISO/IEC 10646 (2003
edition or later).
_Wording Changes from Ada 2005_
19.h/3
- {AI05-0079-1AI05-0079-1} Correction: Clarified that only
+ {<AI05-0079-1AI05-0079-1>} Correction: Clarified that only
characters in the categories defined here are allowed in the
source of an Ada program. This was clear in Ada 95, but
Amendment 1 dropped the wording instead of correcting it.
19.i/3
- {AI05-0286-1AI05-0286-1} A standard source representation is
+ {<AI05-0286-1AI05-0286-1>} A standard source representation is
defined that all compilers are expected to process. Since
this is the same format as the ACATS, it seems unlikely that
there are any implementations that don't meet this
@@ -3831,17 +3832,17 @@ File: aarm2012.info, Node: 2.2, Next: 2.3, Prev:
2.1, Up: 2
1
The text of a program consists of the texts of one or more compilations.
-The text of each compilation is a sequence of separate lexical elements.
-Each lexical element is formed from a sequence of characters, and is
-either a delimiter, an identifier, a reserved word, a numeric_literal, a
-character_literal, a string_literal, or a comment. The meaning of a
-program depends only on the particular sequences of lexical elements
-that form its compilations, excluding comments.
+The text of each compilation is a sequence of separate <lexical
+elements>. Each lexical element is formed from a sequence of
+characters, and is either a delimiter, an identifier, a reserved word, a
+numeric_literal, a character_literal, a string_literal, or a comment.
+The meaning of a program depends only on the particular sequences of
+lexical elements that form its compilations, excluding comments.
2/3
-{AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} The text of a
-compilation is divided into lines. In general, the representation for an
-end of line is implementation defined. However, a sequence of one or
+{<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>} The text of a
+compilation is divided into <lines>. In general, the representation for
+an end of line is implementation defined. However, a sequence of one or
more format_effectors other than the character whose code point is
16#09# (CHARACTER TABULATION) signifies at least one end of line.
@@ -3849,18 +3850,18 @@ more format_effectors other than the character whose
code point is
Implementation defined: The representation for an end of line.
3/2
-{AI95-00285-01AI95-00285-01} [In some cases an explicit separator is
+{<AI95-00285-01AI95-00285-01>} [In some cases an explicit <separator> is
required to separate adjacent lexical elements.] A separator is any of
a separator_space, a format_effector, or the end of a line, as follows:
4/2
- * {AI95-00285-01AI95-00285-01} A separator_space is a separator
+ * {<AI95-00285-01AI95-00285-01>} A separator_space is a separator
except within a comment, a string_literal, or a character_literal.
5/3
- * {AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} The character
- whose code point is 16#09# (CHARACTER TABULATION) is a separator
- except within a comment.
+ * {<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>} The
+ character whose code point is 16#09# (CHARACTER TABULATION) is a
+ separator except within a comment.
6
* The end of a line is always a separator.
@@ -3873,19 +3874,19 @@ or a numeric_literal and an adjacent identifier,
reserved word, or
numeric_literal.
7.1/3
-{AI05-0079-1AI05-0079-1} One or more other_format characters are allowed
-anywhere that a separator is[; any such characters have no effect on the
-meaning of an Ada program].
+{<AI05-0079-1AI05-0079-1>} One or more other_format characters are
+allowed anywhere that a separator is[; any such characters have no
+effect on the meaning of an Ada program].
8/2
-{AI95-00285-01AI95-00285-01} A delimiter is either one of the following
-characters:
+{<AI95-00285-01AI95-00285-01>} A <delimiter> is either one of the
+following characters:
9
& ' ( ) * + , - . / : ; < = >
|
10
-or one of the following compound delimiters each composed of two
+or one of the following <compound delimiters> each composed of two
adjacent special characters
11
@@ -3900,16 +3901,18 @@ character_literal, or numeric_literal.
13
The following names are used when referring to compound delimiters:
- delimiter name=> arrow
-.. double dot
-** double star, exponentiate
-:= assignment (pronounced: "becomes")
-/= inequality (pronounced: "not equal")
->= greater than or equal
-<= less than or equal
-<< left label bracket
->> right label bracket
-<> box
+delimiter name
+----------------------------------------------------
+=> arrow
+.. double dot
+** double star, exponentiate
+:= assignment (pronounced: "becomes")
+/= inequality (pronounced: "not equal")
+>= greater than or equal
+<= less than or equal
+<< left label bracket
+>> right label bracket
+<> box
_Implementation Requirements_
14
@@ -3929,14 +3932,14 @@ element length are implementation defined.
_Wording Changes from Ada 95_
14.c/3
- {AI95-00285-01AI95-00285-01} {AI05-0299-1AI05-0299-1} The
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0299-1AI05-0299-1>} The
wording was updated to use the new character categories
defined in the preceding subclause.
_Extensions to Ada 2005_
14.d/3
- {AI05-0079-1AI05-0079-1} Correction: Clarified that
+ {<AI05-0079-1AI05-0079-1>} Correction: Clarified that
other_format characters are allowed anywhere that separators
are allowed. This was intended in Ada 2005, but didn't
actually make it into the wording.
@@ -3953,12 +3956,12 @@ Identifiers are used as names.
_Syntax_
2/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
identifier ::=
identifier_start {identifier_start | identifier_extend}
3/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
identifier_start ::=
letter_uppercase
| letter_lowercase
@@ -3968,16 +3971,16 @@ Identifiers are used as names.
| number_letter
3.1/3
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
- {AI05-0091-1AI05-0091-1} identifier_extend ::=
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+ {<AI05-0091-1AI05-0091-1>} identifier_extend ::=
mark_non_spacing
| mark_spacing_combining
| number_decimal
| punctuation_connector
4/3
- {AI95-00395-01AI95-00395-01} {AI05-0091-1AI05-0091-1} An identifier
- shall not contain two consecutive characters in category
+ {<AI95-00395-01AI95-00395-01>} {<AI05-0091-1AI05-0091-1>} An
+ identifier shall not contain two consecutive characters in category
punctuation_connector, or end with a character in that category.
4.a/3
@@ -3987,29 +3990,29 @@ Identifiers are used as names.
_Static Semantics_
5/3
-{AI95-00285-01AI95-00285-01} {AI05-0091-1AI05-0091-1}
-{AI05-0227-1AI05-0227-1} {AI05-0266-1AI05-0266-1}
-{AI05-0299-1AI05-0299-1} Two identifiers are considered the same if they
-consist of the same sequence of characters after applying
+{<AI95-00285-01AI95-00285-01>} {<AI05-0091-1AI05-0091-1>}
+{<AI05-0227-1AI05-0227-1>} {<AI05-0266-1AI05-0266-1>}
+{<AI05-0299-1AI05-0299-1>} Two identifiers are considered the same if
+they consist of the same sequence of characters after applying
locale-independent simple case folding, as defined by documents
referenced in the note in Clause 1 of ISO/IEC 10646:2011.
5.a/3
- Discussion: {AI05-0227-1AI05-0227-1} Simple case folding is a
- mapping to lower case, so this is matching the defining (lower
- case) version of a reserved word. We could have mentioned
- case folding of the reserved words, but as that is an identity
- function, it would have no effect.
+ Discussion: {<AI05-0227-1AI05-0227-1>} Simple case folding is
+ a mapping to lower case, so this is matching the defining
+ (lower case) version of a reserved word. We could have
+ mentioned case folding of the reserved words, but as that is
+ an identity function, it would have no effect.
5.a.1/3
- {AI05-0227-1AI05-0227-1} The "documents referenced" means
+ {<AI05-0227-1AI05-0227-1>} The "documents referenced" means
Unicode. Note that simple case folding is supposed to be
compatible between Unicode versions, so the Unicode version
used doesn't matter.
5.3/3
-{AI95-00395-01AI95-00395-01} {AI05-0091-1AI05-0091-1}
-{AI05-0227-1AI05-0227-1} After applying simple case folding, an
+{<AI95-00395-01AI95-00395-01>} {<AI05-0091-1AI05-0091-1>}
+{<AI05-0227-1AI05-0227-1>} After applying simple case folding, an
identifier shall not be identical to a reserved word.
5.b/3
@@ -4021,19 +4024,19 @@ identifier shall not be identical to a reserved word.
headaches.
5.c/3
- Ramification: {AI05-0227-1AI05-0227-1} The rules for reserved
- words differ in one way: they define case conversion on
- letters rather than sequences. This means that it is possible
- that there exist some unusual sequences that are neither
- identifiers nor reserved words. We are not aware of any such
- sequences so long as we use simple case folding (as opposed to
- full case folding), but we have defined the rules in case any
- are introduced in future character set standards. This
- originally was a problem when converting to upper case: "if"
- and "acce�" have upper case conversions of "IF" and "ACCESS"
- respectively. We would not want these to be treated as
- reserved words. But neither of these cases exist when using
- simple case folding.
+ Ramification: {<AI05-0227-1AI05-0227-1>} The rules for
+ reserved words differ in one way: they define case conversion
+ on letters rather than sequences. This means that it is
+ possible that there exist some unusual sequences that are
+ neither identifiers nor reserved words. We are not aware of
+ any such sequences so long as we use simple case folding (as
+ opposed to full case folding), but we have defined the rules
+ in case any are introduced in future character set standards.
+ This originally was a problem when converting to upper case:
+ "if" and "acce�" have upper case conversions of "IF" and
+ "ACCESS" respectively. We would not want these to be treated
+ as reserved words. But neither of these cases exist when
+ using simple case folding.
_Implementation Permissions_
@@ -4043,21 +4046,21 @@ case equivalence rules for identifiers[, to accommodate
local
conventions].
6.a/3
- Discussion: {AI95-00285-01AI95-00285-01}
- {AI05-0227-1AI05-0227-1} For instance, in most languages, the
- simple case folded equivalent of LATIN CAPITAL LETTER I (an
- upper case letter without a dot above) is LATIN SMALL LETTER I
- (a lower case letter with a dot above). In Turkish, though,
- LATIN CAPITAL LETTER I and LATIN CAPITAL LETTER I WITH DOT
- ABOVE are two distinct letters, so the case folded equivalent
- of LATIN CAPITAL LETTER I is LATIN SMALL LETTER DOTLESS I, and
- the case folded equivalent of LATIN CAPITAL LETTER I WITH DOT
- ABOVE is LATIN SMALL LETTER I. Take for instance the following
- identifier (which is the name of a city on the Tigris river in
- Eastern Anatolia):
+ Discussion: {<AI95-00285-01AI95-00285-01>}
+ {<AI05-0227-1AI05-0227-1>} For instance, in most languages,
+ the simple case folded equivalent of LATIN CAPITAL LETTER I
+ (an upper case letter without a dot above) is LATIN SMALL
+ LETTER I (a lower case letter with a dot above). In Turkish,
+ though, LATIN CAPITAL LETTER I and LATIN CAPITAL LETTER I WITH
+ DOT ABOVE are two distinct letters, so the case folded
+ equivalent of LATIN CAPITAL LETTER I is LATIN SMALL LETTER
+ DOTLESS I, and the case folded equivalent of LATIN CAPITAL
+ LETTER I WITH DOT ABOVE is LATIN SMALL LETTER I. Take for
+ instance the following identifier (which is the name of a city
+ on the Tigris river in Eastern Anatolia):
6.b/3
- DIYARBAKIR -- The first i is dotted, the second isn't.
+ DIYARBAKIR -- <The first i is dotted, the second isn't.>
6.c/3
A Turkish reader would expect that the above identifier is
@@ -4099,21 +4102,21 @@ conventions].
NOTES
6.1/2
- 2 {AI95-00285-01AI95-00285-01} Identifiers differing only in the
+ 2 {<AI95-00285-01AI95-00285-01>} Identifiers differing only in the
use of corresponding upper and lower case letters are considered
the same.
_Examples_
7
-Examples of identifiers:
+<Examples of identifiers:>
8/2
- {AI95-00433-01AI95-00433-01} Count X Get_Symbol Ethelyn Marion
+ {<AI95-00433-01AI95-00433-01>} Count X Get_Symbol Ethelyn
Marion
Snobol_4 X1 Page_Count Store_Next_Item
- [Unicode 928][Unicode 955][Unicode 940][Unicode 964][Unicode 969][Unicode
957] -- Plato
- [Unicode 1063][Unicode 1072][Unicode 1081][Unicode 1082][Unicode
1086][Unicode 1074][Unicode 1089][Unicode 1082][Unicode 1080][Unicode 1081] --
Tchaikovsky
- [Unicode 952] [Unicode 966] -- Angles
+ [Unicode 928][Unicode 955][Unicode 940][Unicode 964][Unicode 969][Unicode
957] --< Plato>
+ [Unicode 1063][Unicode 1072][Unicode 1081][Unicode 1082][Unicode
1086][Unicode 1074][Unicode 1089][Unicode 1082][Unicode 1080][Unicode 1081]
--< Tchaikovsky>
+ [Unicode 952] [Unicode 966] --< Angles>
_Wording Changes from Ada 83_
@@ -4135,22 +4138,22 @@ Examples of identifiers:
_Extensions to Ada 95_
8.c/2
- {AI95-00285-01AI95-00285-01} An identifier can use any letter
- defined by ISO-10646:2003, along with several other
+ {<AI95-00285-01AI95-00285-01>} An identifier can use any
+ letter defined by ISO-10646:2003, along with several other
categories. This should ease programming in languages other
than English.
_Incompatibilities With Ada 2005_
8.d/3
- {AI05-0091-1AI05-0091-1} Correction: other_format characters
+ {<AI05-0091-1AI05-0091-1>} Correction: other_format characters
were removed from identifiers as the Unicode recommendations
have changed. This change can only affect programs written
for the original Ada 2005, so there should be few such
programs.
8.e/3
- {AI05-0227-1AI05-0227-1} Correction: We now specify simple
+ {<AI05-0227-1AI05-0227-1>} Correction: We now specify simple
case folding rather than full case folding. That potentially
could change identifier equivalence, although it is more
likely that identifiers that are considered the same in
@@ -4168,9 +4171,9 @@ File: aarm2012.info, Node: 2.4, Next: 2.5, Prev: 2.3,
Up: 2
====================
1
-There are two kinds of numeric_literals, real literals and integer
-literals. A real literal is a numeric_literal that includes a point; an
-integer literal is a numeric_literal without a point.
+There are two kinds of numeric_literals, <real literals> and <integer
+literals>. A real literal is a numeric_literal that includes a point;
+an integer literal is a numeric_literal without a point.
_Syntax_
@@ -4180,8 +4183,8 @@ integer literal is a numeric_literal without a point.
NOTES
3
- 3 The type of an integer literal is universal_integer. The type
- of a real literal is universal_real.
+ 3 The type of an integer literal is <universal_integer>. The type
+ of a real literal is <universal_real>.
* Menu:
@@ -4210,7 +4213,7 @@ notation (that is, the base is ten).
exponent ::= E [+] numeral | E - numeral
4.1/2
- {AI95-00285-01AI95-00285-01} digit ::=
+ {<AI95-00285-01AI95-00285-01>} digit ::=
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
5
@@ -4239,12 +4242,12 @@ value of the decimal_literal with the exponent.
_Examples_
8
-Examples of decimal literals:
+<Examples of decimal literals:>
9
- 12 0 1E6 123_456 -- integer literals
+ 12 0 1E6 123_456 --< integer literals>
- 12.0 0.0 0.456 3.14159_26 -- real literals
+ 12.0 0.0 0.456 3.14159_26 --< real literals>
_Wording Changes from Ada 83_
@@ -4284,7 +4287,7 @@ specifies the base explicitly.]
_Legality Rules_
6
-The base (the numeric value of the decimal numeral preceding the first
+The <base> (the numeric value of the decimal numeral preceding the first
#) shall be at least two and at most sixteen. The extended_digits A
through F represent the digits ten through fifteen, respectively. The
value of each extended_digit of a based_literal shall be less than the
@@ -4306,12 +4309,12 @@ in upper case, with the same meaning.
_Examples_
9
-Examples of based literals:
+<Examples of based literals:>
10
- 2#1111_1111# 16#FF# 016#0ff# -- integer literals of value 255
- 16#E#E1 2#1110_0000# -- integer literals of value 224
- 16#F.FF#E+2 2#1.1111_1111_1110#E11 -- real literals of value 4095.0
+ 2#1111_1111# 16#FF# 016#0ff# --< integer literals of value 255>
+ 16#E#E1 2#1110_0000# --< integer literals of value 224>
+ 16#F.FF#E+2 2#1.1111_1111_1110#E11 --< real literals of value 4095.0>
_Wording Changes from Ada 83_
@@ -4344,17 +4347,17 @@ two apostrophe characters.]
_Examples_
4
-Examples of character literals:
+<Examples of character literals:>
5/2
- {AI95-00433-01AI95-00433-01} 'A' '*' ''' ' '
- 'L' '[Unicode 1051]' '[Unicode 923]' -- Various els.
- '[Unicode 8734]' '[Unicode 1488]' -- Big numbers -
infinity and aleph.
+ {<AI95-00433-01AI95-00433-01>} 'A' '*' ''' ' '
+ 'L' '[Unicode 1051]' '[Unicode 923]' --< Various els.>
+ '[Unicode 8734]' '[Unicode 1488]' --< Big numbers -
infinity and aleph.>
_Wording Changes from Ada 83_
5.a/3
- {AI05-0299-1AI05-0299-1} The definitions of the values of
+ {<AI05-0299-1AI05-0299-1>} The definitions of the values of
literals are in Clauses 3 and 4, rather than here, since it
requires knowledge of types.
@@ -4369,7 +4372,7 @@ File: aarm2012.info, Node: 2.6, Next: 2.7, Prev: 2.5,
Up: 2
(possibly none) enclosed between two quotation marks used as string
brackets. They are used to represent operator_symbols (see *note
6.1::), values of a string type (see *note 4.2::), and array
-subaggregates (see *note 4.3.3::). ]
+subaggregates (see *note 4.3.3::). ]
_Syntax_
@@ -4377,7 +4380,7 @@ subaggregates (see *note 4.3.3::). ]
string_literal ::= "{string_element}"
3
- string_element ::= "" | non_quotation_mark_graphic_character
+ string_element ::= "" | <non_quotation_mark_>graphic_character
4
A string_element is either a pair of quotation marks (""), or a
@@ -4386,14 +4389,14 @@ subaggregates (see *note 4.3.3::). ]
_Static Semantics_
5
-The sequence of characters of a string_literal is formed from the
+The <sequence of characters> of a string_literal is formed from the
sequence of string_elements between the bracketing quotation marks, in
the given order, with a string_element that is "" becoming a single
quotation mark in the sequence of characters, and any other
string_element being reproduced in the sequence.
6
-A null string literal is a string_literal with no string_elements
+A <null string literal> is a string_literal with no string_elements
between the quotation marks.
NOTES
@@ -4402,19 +4405,19 @@ between the quotation marks.
5 An end of line cannot appear in a string_literal.
7.1/2
- 6 {AI95-00285-01AI95-00285-01} No transformation is performed on
+ 6 {<AI95-00285-01AI95-00285-01>} No transformation is performed on
the sequence of characters of a string_literal.
_Examples_
8
-Examples of string literals:
+<Examples of string literals:>
9/2
- {AI95-00433-01AI95-00433-01} "Message of the day:"
+ {<AI95-00433-01AI95-00433-01>} "Message of the day:"
- "" -- a null string literal
- " " "A" """" -- three string literals of length 1
+ "" --< a null string literal>
+ " " "A" """" --< three string literals of length 1>
"Characters such as $, %, and } are allowed in string literals"
"Archimedes said ""[Unicode 917][Unicode 973][Unicode 961][Unicode
951][Unicode 954][Unicode 945]"""
@@ -4434,7 +4437,7 @@ Examples of string literals:
_Wording Changes from Ada 95_
9.c/2
- {AI95-00285-01AI95-00285-01} We explicitly say that the
+ {<AI95-00285-01AI95-00285-01>} We explicitly say that the
characters of a string_literal should be used as is. In
particular, no normalization or folding should be performed on
a string_literal.
@@ -4452,7 +4455,7 @@ the line.
_Syntax_
2
- comment ::= --{non_end_of_line_character}
+ comment ::= --{<non_end_of_line_>character}
3
A comment may appear on any line of a program.
@@ -4468,17 +4471,17 @@ human reader.
_Examples_
5
-Examples of comments:
+<Examples of comments:>
6
- -- the last sentence above echoes the Algol 68 report
+ --< the last sentence above echoes the Algol 68 report >
- end; -- processing of Line is complete
+ end; --< processing of Line is complete >
- -- a long comment may be split onto
- -- two or more consecutive lines
+ --< a long comment may be split onto>
+ --< two or more consecutive lines >
- ---------------- the first two hyphens start the comment
+ ----------------< the first two hyphens start the comment >
File: aarm2012.info, Node: 2.8, Next: 2.9, Prev: 2.7, Up: 2
@@ -4494,9 +4497,9 @@ implementation may support additional
(implementation-defined) pragmas.
_Language Design Principles_
1.a/3
- {AI05-0100-1AI05-0100-1} {AI05-0163-1AI05-0163-1} In general,
- if all pragmas are treated as unrecognized pragmas, the
- program should remain both syntactically and semantically
+ {<AI05-0100-1AI05-0100-1>} {<AI05-0163-1AI05-0163-1>} In
+ general, if all pragmas are treated as unrecognized pragmas,
+ the program should remain both syntactically and semantically
legal. There are a few exceptions to this general principle
(for example, pragma Import can eliminate the need for a
completion), but the principle remains, and is strictly true
@@ -4513,17 +4516,18 @@ implementation may support additional
(implementation-defined) pragmas.
pragma_argument_association})];
3/3
- {AI05-0290-1AI05-0290-1} pragma_argument_association ::=
- [pragma_argument_identifier =>] name
- | [pragma_argument_identifier =>] expression
- | pragma_argument_aspect_mark => name
- | pragma_argument_aspect_mark => expression
+ {<AI05-0290-1AI05-0290-1>} pragma_argument_association ::=
+ [<pragma_argument_>identifier =>] name
+ | [<pragma_argument_>identifier =>] expression
+ | <pragma_argument_>aspect_mark => name
+ | <pragma_argument_>aspect_mark => expression
4/3
- {AI05-0290-1AI05-0290-1} In a pragma, any
- pragma_argument_associations without a pragma_argument_identifier
- or pragma_argument_aspect_mark shall precede any associations with
- a pragma_argument_identifier or pragma_argument_aspect_mark.
+ {<AI05-0290-1AI05-0290-1>} In a pragma, any
+ pragma_argument_associations without a <pragma_argument_>identifier
+ or <pragma_argument_>aspect_mark shall precede any associations
+ with a <pragma_argument_>identifier or
+ <pragma_argument_>aspect_mark.
5
Pragmas are only allowed at the following places in a program:
@@ -4533,8 +4537,8 @@ implementation may support additional
(implementation-defined) pragmas.
discriminant_part.
7/3
- * {AI05-0100-1AI05-0100-1} {AI05-0163-1AI05-0163-1} At any place
- where the syntax rules allow a construct defined by a
+ * {<AI05-0100-1AI05-0100-1>} {<AI05-0163-1AI05-0163-1>} At any
+ place where the syntax rules allow a construct defined by a
syntactic category whose name ends with "declaration", "item",
"statement", "clause", or "alternative", or one of the
syntactic categories variant or exception_handler; but not in
@@ -4543,12 +4547,12 @@ implementation may support additional
(implementation-defined) pragmas.
construct.
7.1/3
- * {AI05-0163-1AI05-0163-1} In place of a statement in a
+ * {<AI05-0163-1AI05-0163-1>} In place of a statement in a
sequence_of_statements.
7.2/3
- * {AI05-0100-1AI05-0100-1} At any place where a compilation_unit
- is allowed.
+ * {<AI05-0100-1AI05-0100-1>} At any place where a
+ compilation_unit is allowed.
8
Additional syntax rules and placement restrictions exist for
@@ -4564,18 +4568,18 @@ implementation may support additional
(implementation-defined) pragmas.
generic_formal_parameter_declaration is allowed.
9
-The name of a pragma is the identifier following the reserved word
-pragma. The name or expression of a pragma_argument_association is a
-pragma argument.
+The <name> of a pragma is the identifier following the reserved word
+pragma. The name or expression of a pragma_argument_association is a
+<pragma argument>.
9.a/2
- To be honest: {AI95-00284-02AI95-00284-02} For compatibility
+ To be honest: {<AI95-00284-02AI95-00284-02>} For compatibility
with Ada 83, the name of a pragma may also be "interface",
which is not an identifier (because it is a reserved word).
See *note J.12::.
10/3
-{AI05-0272-1AI05-0272-1} An identifier specific to a pragma is an
+{<AI05-0272-1AI05-0272-1>} An <identifier specific to a pragma> is an
identifier or reserved word that is used in a pragma argument with
special meaning for that pragma.
@@ -4585,7 +4589,7 @@ special meaning for that pragma.
identifier is an identifier specific to that pragma.
10.b/3
- {AI05-0272-1AI05-0272-1} In a few cases, a reserved word is
+ {<AI05-0272-1AI05-0272-1>} In a few cases, a reserved word is
allowed as "an identifier specific to a pragma". Even in
these cases, the syntax still is written as identifier (the
reserved word(s) are not shown). For example, the restriction
@@ -4649,7 +4653,7 @@ the only rules that apply are the Syntax Rules.
be invoked, which is not what we want.
11.i/3
- {AI05-0229-1AI05-0229-1} This also implies that named
+ {<AI05-0229-1AI05-0229-1>} This also implies that named
associations do not allow one to give the arguments in an
arbitrary order -- the order given in the syntax rule for each
individual pragma must be obeyed. However, it is generally
@@ -4742,8 +4746,8 @@ some of the Syntax Rules, if detecting the syntax error
is too complex.
_Implementation Advice_
16/3
-{AI05-0163-1AI05-0163-1} Normally, implementation-defined pragmas should
-have no semantic effect for error-free programs; that is, if the
+{<AI05-0163-1AI05-0163-1>} Normally, implementation-defined pragmas
+should have no semantic effect for error-free programs; that is, if the
implementation-defined pragmas in a working program are replaced with
unrecognized pragmas, the program should still be legal, and should
still have the same semantics.
@@ -4770,10 +4774,10 @@ Normally, an implementation should not define pragmas
that can make an
illegal program legal, except as follows:
18/3
- * {AI05-0229-1AI05-0229-1} A pragma used to complete a declaration;
+ * {<AI05-0229-1AI05-0229-1>} A pragma used to complete a declaration;
18.a/3
- Discussion: {AI05-0229-1AI05-0229-1} There are no
+ Discussion: {<AI05-0229-1AI05-0229-1>} There are no
language-defined pragmas which can be completions; pragma
Import was defined this way in Ada 95 and Ada 2005, but in Ada
2012 pragma Import just sets aspect Import which disallows
@@ -4830,16 +4834,16 @@ illegal program legal, except as follows:
_Extensions to Ada 2005_
19.f/3
- {AI05-0163-1AI05-0163-1} Correction: Allow pragmas in place of
- a statement, even if there are no other statements in a
+ {<AI05-0163-1AI05-0163-1>} Correction: Allow pragmas in place
+ of a statement, even if there are no other statements in a
sequence_of_statements.
19.g/3
- {AI05-0272-1AI05-0272-1} Identifiers specific to a pragma can
- be reserved words.
+ {<AI05-0272-1AI05-0272-1>} Identifiers specific to a pragma
+ can be reserved words.
19.h/3
- {AI05-0290-1AI05-0290-1} Pragma arguments can be identified
+ {<AI05-0290-1AI05-0290-1>} Pragma arguments can be identified
with aspect_marks; this allows identifier'Class in this
context. As usual, this is only allowed if specifically
allowed by a particular pragma.
@@ -4847,7 +4851,7 @@ illegal program legal, except as follows:
_Wording Changes from Ada 2005_
19.i/3
- {AI05-0100-1AI05-0100-1} Correction: Clarified where pragmas
+ {<AI05-0100-1AI05-0100-1>} Correction: Clarified where pragmas
are (and are not) allowed.
_Syntax_
@@ -4921,14 +4925,14 @@ defined how this advice is followed.]
_Examples_
28
-Examples of pragmas:
+<Examples of pragmas:>
29/3
- {AI95-00433-01AI95-00433-01} {AI05-0229-1AI05-0229-1} pragma List(Off);
-- turn off listing generation
- pragma Optimize(Off); -- turn off optional optimizations
- pragma Pure(Rational_Numbers); -- set categorization for package
+ {<AI95-00433-01AI95-00433-01>} {<AI05-0229-1AI05-0229-1>} pragma
List(Off); -- <turn off listing generation>
+ pragma Optimize(Off); -- <turn off optional optimizations>
+ pragma Pure(Rational_Numbers); -- <set categorization for package>
pragma Assert(Exists(File_Name),
- Message => "Nonexistent file"); -- assert file exists
+ Message => "Nonexistent file"); -- <assert file exists>
_Extensions to Ada 83_
@@ -4950,14 +4954,14 @@ Examples of pragmas:
_Wording Changes from Ada 95_
29.d/2
- {AI95-00433-01AI95-00433-01} Updated the example of named
+ {<AI95-00433-01AI95-00433-01>} Updated the example of named
pragma parameters, because the second parameter of pragma
Suppress is obsolescent.
_Wording Changes from Ada 2005_
29.e/3
- {AI05-0229-1AI05-0229-1} Updated the example of pragmas,
+ {<AI05-0229-1AI05-0229-1>} Updated the example of pragmas,
because both pragmas Inline and Import are obsolescent.
@@ -4969,11 +4973,11 @@ File: aarm2012.info, Node: 2.9, Prev: 2.8, Up: 2
_Syntax_
1/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
2/3
- {AI95-00284-02AI95-00284-02} {AI95-00395-01AI95-00395-01}
- {AI05-0091-1AI05-0091-1} The following are the reserved words.
+ {<AI95-00284-02AI95-00284-02>} {<AI95-00395-01AI95-00395-01>}
+ {<AI05-0091-1AI05-0091-1>} The following are the <reserved words>.
Within a program, some or all of the letters of a reserved word may
be in upper case.
@@ -5034,14 +5038,14 @@ do mod requeue
_Wording Changes from Ada 83_
3.b/3
- {AI05-0299-1AI05-0299-1} The subclause entitled "Allowed
+ {<AI05-0299-1AI05-0299-1>} The subclause entitled "Allowed
Replacements of Characters" has been moved to *note Annex J::,
"*note Annex J:: Obsolescent Features".
_Incompatibilities With Ada 95_
3.c/2
- {AI95-00284-02AI95-00284-02} The following words are not
+ {<AI95-00284-02AI95-00284-02>} The following words are not
reserved in Ada 95, but are reserved in Ada 2005: interface,
overriding, synchronized. A special allowance is made for
pragma Interface (see *note J.12::). Uses of these words as
@@ -5051,7 +5055,7 @@ do mod requeue
_Wording Changes from Ada 95_
3.d/2
- {AI95-00395-01AI95-00395-01} The definition of upper case
+ {<AI95-00395-01AI95-00395-01>} The definition of upper case
equivalence has been modified to allow identifiers using all
of the characters of ISO 10646. This change has no effect on
the character sequences that are reserved words, but does make
@@ -5060,7 +5064,7 @@ do mod requeue
_Incompatibilities With Ada 2005_
3.e/3
- {AI05-0091-1AI05-0091-1} Correction: Removed other_format
+ {<AI05-0091-1AI05-0091-1>} Correction: Removed other_format
characters from reserved words in order to be compatible with
the latest Unicode recommendations. This change can only
affect programs written for original Ada 2005, and there is
@@ -5069,8 +5073,8 @@ do mod requeue
programs.
3.f/3
- {AI05-0176-1AI05-0176-1} The following word is not reserved in
- Ada 2005, but is reserved in Ada 2012: some. Uses of this
+ {<AI05-0176-1AI05-0176-1>} The following word is not reserved
+ in Ada 2005, but is reserved in Ada 2012: some. Uses of this
word as an identifier will need to be changed, but we do not
expect them to be common.
@@ -5081,8 +5085,9 @@ File: aarm2012.info, Node: 3, Next: 4, Prev: 2, Up:
Top
************************
1/3
-{AI05-0299-1AI05-0299-1} This clause describes the types in the language
-and the rules for declaring constants, variables, and named numbers.
+{<AI05-0299-1AI05-0299-1>} This clause describes the types in the
+language and the rules for declaring constants, variables, and named
+numbers.
* Menu:
@@ -5105,8 +5110,8 @@ File: aarm2012.info, Node: 3.1, Next: 3.2, Up: 3
================
1
-The language defines several kinds of named entities that are declared
-by declarations. The entity's name is defined by the declaration,
+The language defines several kinds of named <entities> that are declared
+by declarations. The entity's <name> is defined by the declaration,
usually by a defining_identifier (*note 3.1: S0022.), but sometimes by a
defining_character_literal (*note 3.5.1: S0040.) or
defining_operator_symbol (*note 6.1: S0171.).
@@ -5118,7 +5123,7 @@ of declaration defined as follows.
_Syntax_
3/3
- {AI95-00348-01AI95-00348-01} {AI05-0177-1AI05-0177-1}
+ {<AI95-00348-01AI95-00348-01>} {<AI05-0177-1AI05-0177-1>}
basic_declaration ::=
type_declaration | subtype_declaration
| object_declaration | number_declaration
@@ -5134,11 +5139,11 @@ of declaration defined as follows.
_Static Semantics_
5
-A declaration is a language construct that associates a name with (a
-view of) an entity. A declaration may appear explicitly in the program
-text (an explicit declaration), or may be supposed to occur at a given
+A <declaration> is a language construct that associates a name with (a
+view of) an entity. A declaration may appear explicitly in the program
+text (an <explicit> declaration), or may be supposed to occur at a given
place in the text as a consequence of the semantics of another construct
-(an implicit declaration).
+(an <implicit> declaration).
5.a
Discussion: An implicit declaration generally declares a
@@ -5148,8 +5153,8 @@ place in the text as a consequence of the semantics of
another construct
declarations, as part of a type declaration.
6/3
-{AI95-00318-02AI95-00318-02} {AI05-0255-1AI05-0255-1}
-{AI05-0277-1AI05-0277-1} Each of the following is defined to be a
+{<AI95-00318-02AI95-00318-02>} {<AI05-0255-1AI05-0255-1>}
+{<AI05-0277-1AI05-0277-1>} Each of the following is defined to be a
declaration: any basic_declaration (*note 3.1: S0021.); an
enumeration_literal_specification (*note 3.5.1: S0039.); a
discriminant_specification (*note 3.7: S0062.); a component_declaration
@@ -5175,15 +5180,15 @@ S0267.); a generic_formal_parameter_declaration (*note
12.1: S0275.).
sometimes not.
7
-All declarations contain a definition for a view of an entity. A view
-consists of an identification of the entity (the entity of the view),
-plus view-specific characteristics that affect the use of the entity
-through that view (such as mode of access to an object, formal parameter
-names and defaults for a subprogram, or visibility to components of a
-type). In most cases, a declaration also contains the definition for
-the entity itself (a renaming_declaration is an example of a declaration
-that does not define a new entity, but instead defines a view of an
-existing entity (see *note 8.5::)).
+All declarations contain a <definition> for a <view> of an entity. A
+view consists of an identification of the entity (the entity <of> the
+view), plus view-specific characteristics that affect the use of the
+entity through that view (such as mode of access to an object, formal
+parameter names and defaults for a subprogram, or visibility to
+components of a type). In most cases, a declaration also contains the
+definition for the entity itself (a renaming_declaration is an example
+of a declaration that does not define a new entity, but instead defines
+a view of an existing entity (see *note 8.5::)).
7.a/2
Glossary entry: A view of an entity reveals some or all of the
@@ -5195,16 +5200,16 @@ existing entity (see *note 8.5::)).
whose view-specific characteristics are unchanging for the
life of the view. However, subtypes are somewhat unusual in
that they inherit characteristics from whatever view of their
- type is currently visible. Hence, a subtype is not a view of
- a type; it is more of an indirect reference. By contrast, a
- private type provides a single, unchanging (partial) view of
+ type is currently visible. Hence, a subtype is not a <view>
+ of a type; it is more of an indirect reference. By contrast,
+ a private type provides a single, unchanging (partial) view of
its full type.
7.1/3
-{AI05-0080-1AI05-0080-1} When it is clear from context, the term object
-is used in place of view of an object. Similarly, the terms type and
-subtype are used in place of view of a type and view of a subtype,
-respectively.
+{<AI05-0080-1AI05-0080-1>} When it is clear from context, the term
+<object> is used in place of <view of an object>. Similarly, the terms
+<type> and <subtype> are used in place of <view of a type> and <view of
+a subtype>, respectively.
7.c/3
Discussion: Rules interpreted at compile time generally refer
@@ -5221,16 +5226,16 @@ respectively.
8
For each declaration, the language rules define a certain region of text
-called the scope of the declaration (see *note 8.2::). Most
+called the <scope> of the declaration (see *note 8.2::). Most
declarations associate an identifier with a declared entity. Within its
scope, and only there, there are places where it is possible to use the
identifier to refer to the declaration, the view it defines, and the
associated entity; these places are defined by the visibility rules (see
-*note 8.3::). At such places the identifier is said to be a name of the
-entity (the direct_name or selector_name); the name is said to denote
-the declaration, the view, and the associated entity (see *note 8.6::).
-The declaration is said to declare the name, the view, and in most
-cases, the entity itself.
+*note 8.3::). At such places the identifier is said to be a <name> of
+the entity (the direct_name or selector_name); the name is said to
+<denote> the declaration, the view, and the associated entity (see *note
+8.6::). The declaration is said to <declare> the name, the view, and in
+most cases, the entity itself.
9
As an alternative to an identifier, an enumeration literal can be
@@ -5242,10 +5247,10 @@ function can be declared with an operator_symbol as its
name (see *note
The syntax rules use the terms defining_identifier,
defining_character_literal (*note 3.5.1: S0040.), and
defining_operator_symbol (*note 6.1: S0171.) for the defining occurrence
-of a name; these are collectively called defining names. The terms
+of a name; these are collectively called <defining names>. The terms
direct_name and selector_name are used for usage occurrences of
identifiers, character_literals, and operator_symbols. These are
-collectively called usage names.
+collectively called <usage names>.
10.a
To be honest: The terms identifier, character_literal, and
@@ -5259,16 +5264,16 @@ collectively called usage names.
11
The process by which a construct achieves its run-time effect is called
-execution. This process is also called elaboration for declarations and
-evaluation for expressions. One of the terms execution, elaboration, or
-evaluation is defined by this International Standard for each construct
-that has a run-time effect.
+<execution>. This process is also called <elaboration> for declarations
+and <evaluation> for expressions. One of the terms execution,
+elaboration, or evaluation is defined by this International Standard for
+each construct that has a run-time effect.
11.a
Glossary entry: The process by which a construct achieves its
- run-time effect is called execution. Execution of a
- declaration is also called elaboration. Execution of an
- expression is also called evaluation.
+ run-time effect is called <execution>. Execution of a
+ declaration is also called <elaboration>. Execution of an
+ expression is also called <evaluation>.
11.b
To be honest: The term elaboration is also used for the
@@ -5320,9 +5325,9 @@ that has a run-time effect.
of the forms of execution.
11.g
- To be honest: A construct is elaborable if elaboration is
- defined for it. A construct is evaluable if evaluation is
- defined for it. A construct is executable if execution is
+ To be honest: A construct is <elaborable> if elaboration is
+ defined for it. A construct is <evaluable> if evaluation is
+ defined for it. A construct is <executable> if execution is
defined for it.
11.h
@@ -5330,7 +5335,7 @@ that has a run-time effect.
(defined in *note 10.2.1::).
11.i/2
- {AI95-00114-01AI95-00114-01} Evaluation of an evaluable
+ {<AI95-00114-01AI95-00114-01>} Evaluation of an evaluable
construct produces a result that is either a value, a
denotation, or a range. The following are evaluable:
expression; name prefix; range; entry_index_specification; and
@@ -5342,26 +5347,26 @@ that has a run-time effect.
subtype_indications are not evaluated; they are elaborated.
11.j
- Intuitively, an executable construct is one that has a defined
- run-time effect (which may be null). Since execution includes
- elaboration and evaluation as special cases, all elaborable
- and all evaluable constructs are also executable. Hence, most
- constructs in Ada are executable. An important exception is
- that the constructs inside a generic unit are not executable
- directly, but rather are used as a template for (generally)
- executable constructs in instances of the generic.
+ Intuitively, an <executable> construct is one that has a
+ defined run-time effect (which may be null). Since execution
+ includes elaboration and evaluation as special cases, all
+ elaborable and all evaluable constructs are also executable.
+ Hence, most constructs in Ada are executable. An important
+ exception is that the constructs inside a generic unit are not
+ executable directly, but rather are used as a template for
+ (generally) executable constructs in instances of the generic.
NOTES
12
- 1 At compile time, the declaration of an entity declares the
- entity. At run time, the elaboration of the declaration creates the
- entity.
+ 1 At compile time, the declaration of an entity <declares> the
+ entity. At run time, the elaboration of the declaration <creates>
+ the entity.
12.a
Ramification: Syntactic categories for declarations are named
- either entity_declaration (if they include a trailing
- semicolon) or entity_specification (if not).
+ either <entity_>declaration (if they include a trailing
+ semicolon) or <entity_>specification (if not).
12.b
The various kinds of named entities that can be declared are
@@ -5395,12 +5400,12 @@ that has a run-time effect.
indicate a defining occurrence;
12.f/3
- * {AI05-0299-1AI05-0299-1} It becomes a direct_name, in
+ * {<AI05-0299-1AI05-0299-1>} It becomes a direct_name, in
usage occurrences where the usage is required (in Clause
*note 8::) to be directly visible;
12.g/3
- * {AI05-0299-1AI05-0299-1} It becomes a selector_name, in
+ * {<AI05-0299-1AI05-0299-1>} It becomes a selector_name, in
usage occurrences where the usage is required (in Clause
*note 8::) to be visible but not necessarily directly
visible;
@@ -5431,7 +5436,7 @@ that has a run-time effect.
for selector_names.
12.l/3
- {AI05-0299-1AI05-0299-1} (Note that in Ada 95, a declaration
+ {<AI05-0299-1AI05-0299-1>} (Note that in Ada 95, a declaration
is visible at all places where one could have used a
selector_name, not just at places where a selector_name was
actually used. Thus, the places where a declaration is
@@ -5446,7 +5451,7 @@ that has a run-time effect.
"declarations."
12.n/3
- {AI05-0299-1AI05-0299-1} RM83 contains an incomplete
+ {<AI05-0299-1AI05-0299-1>} RM83 contains an incomplete
definition of "elaborated" in this subclause: it defines
"elaborated" for declarations, declarative_parts,
declarative_items and compilation_units, but "elaboration" is
@@ -5479,18 +5484,18 @@ that has a run-time effect.
_Wording Changes from Ada 95_
12.q/2
- {AI95-00318-02AI95-00318-02} Added extended_return_statement
+ {<AI95-00318-02AI95-00318-02>} Added extended_return_statement
to the list of declarations.
12.r/2
- {AI95-00348-01AI95-00348-01} Added null procedures (see *note
- 6.7::) to the syntax.
+ {<AI95-00348-01AI95-00348-01>} Added null procedures (see
+ *note 6.7::) to the syntax.
_Wording Changes from Ada 2005_
12.s/3
- {AI05-0177-1AI05-0177-1} Added expression functions (see *note
- 6.8::) to the syntax.
+ {<AI05-0177-1AI05-0177-1>} Added expression functions (see
+ *note 6.8::) to the syntax.
File: aarm2012.info, Node: 3.2, Next: 3.3, Prev: 3.1, Up: 3
@@ -5501,17 +5506,17 @@ File: aarm2012.info, Node: 3.2, Next: 3.3, Prev:
3.1, Up: 3
_Static Semantics_
1
-A type is characterized by a set of values, and a set of primitive
-operations which implement the fundamental aspects of its semantics. An
-object of a given type is a run-time entity that contains (has) a value
-of the type.
+A <type> is characterized by a set of values, and a set of <primitive
+operations> which implement the fundamental aspects of its semantics.
+An <object> of a given type is a run-time entity that contains (has) a
+value of the type.
1.a/2
- Glossary entry: Each object has a type. A type has an
- associated set of values, and a set of primitive operations
+ Glossary entry: Each object has a type. A <type> has an
+ associated set of values, and a set of <primitive operations>
which implement the fundamental aspects of its semantics.
- Types are grouped into categories. Most language-defined
- categories of types are also classes of types.
+ Types are grouped into <categories>. Most language-defined
+ categories of types are also <classes> of types.
1.b/3
Glossary entry: A subtype is a type together with optional
@@ -5520,16 +5525,17 @@ of the type.
values of a subtype are a subset of the values of its type.
2/2
-{AI95-00442-01AI95-00442-01} Types are grouped into categories of types.
-There exist several language-defined categories of types (see NOTES
-below), reflecting the similarity of their values and primitive
-operations. [Most categories of types form classes of types.]
-Elementary types are those whose values are logically indivisible;
-composite types are those whose values are composed of component values.
+{<AI95-00442-01AI95-00442-01>} Types are grouped into <categories> of
+types. There exist several <language-defined categories> of types (see
+NOTES below), reflecting the similarity of their values and primitive
+operations. [Most categories of types form <classes> of types.]
+<Elementary> types are those whose values are logically indivisible;
+<composite> types are those whose values are composed of <component>
+values.
2.a/2
- Proof: {AI95-00442-01AI95-00442-01} The formal definition of
- category and class is found in *note 3.4::.
+ Proof: {<AI95-00442-01AI95-00442-01>} The formal definition of
+ <category> and <class> is found in *note 3.4::.
2.b/2
Glossary entry: A class is a set of types that is closed under
@@ -5542,7 +5548,7 @@ composite types are those whose values are composed of
component values.
Glossary entry: A category of types is a set of types with one
or more common properties, such as primitive operations. A
category of types that is closed under derivation is also
- known as a class.
+ known as a <class>.
2.c
Glossary entry: An elementary type does not have components.
@@ -5632,48 +5638,48 @@ composite types are those whose values are composed of
component values.
types can be used for defining recursive data structures.
3
-The elementary types are the scalar types (discrete and real) and the
-access types (whose values provide access to objects or subprograms).
-Discrete types are either integer types or are defined by enumeration of
-their values (enumeration types). Real types are either floating point
-types or fixed point types.
+The elementary types are the <scalar> types (<discrete> and <real>) and
+the <access> types (whose values provide access to objects or
+subprograms). Discrete types are either <integer> types or are defined
+by enumeration of their values (<enumeration> types). Real types are
+either <floating point> types or <fixed point> types.
4/2
-{AI95-00251-01AI95-00251-01} {AI95-00326-01AI95-00326-01} The composite
-types are the record types, record extensions, array types, interface
-types, task types, and protected types.
+{<AI95-00251-01AI95-00251-01>} {<AI95-00326-01AI95-00326-01>} The
+composite types are the <record> types, <record extensions>, <array>
+types, <interface> types, <task> types, and <protected> types.
4.a/2
- This paragraph was deleted.{AI95-00442-01AI95-00442-01}
+ <This paragraph was deleted.>{<AI95-00442-01AI95-00442-01>}
4.1/2
-{AI95-00326-01AI95-00326-01} There can be multiple views of a type with
-varying sets of operations. [An incomplete type represents an
+{<AI95-00326-01AI95-00326-01>} There can be multiple views of a type
+with varying sets of operations. [An <incomplete> type represents an
incomplete view (see *note 3.10.1::) of a type with a very restricted
-usage, providing support for recursive data structures. A private type
-or private extension represents a partial view (see *note 7.3::) of a
-type, providing support for data abstraction. The full view (see *note
-3.2.1::) of a type represents its complete definition.] An incomplete
-or partial view is considered a composite type[, even if the full view
-is not].
+usage, providing support for recursive data structures. A <private>
+type or <private extension> represents a partial view (see *note 7.3::)
+of a type, providing support for data abstraction. The full view (see
+*note 3.2.1::) of a type represents its complete definition.] An
+incomplete or partial view is considered a composite type[, even if the
+full view is not].
4.b/3
- Proof: {AI05-0299-1AI05-0299-1} The real definitions of the
+ Proof: {<AI05-0299-1AI05-0299-1>} The real definitions of the
views are in the referenced subclauses.
5/2
-{AI95-00326-01AI95-00326-01} Certain composite types (and views thereof)
-have special components called discriminants whose values affect the
-presence, constraints, or initialization of other components.
+{<AI95-00326-01AI95-00326-01>} Certain composite types (and views
+thereof) have special components called <discriminants> whose values
+affect the presence, constraints, or initialization of other components.
Discriminants can be thought of as parameters of the type.
6/2
-{AI95-00366-01AI95-00366-01} The term subcomponent is used in this
+{<AI95-00366-01AI95-00366-01>} The term <subcomponent> is used in this
International Standard in place of the term component to indicate either
a component, or a component of another subcomponent. Where other
subcomponents are excluded, the term component is used instead.
-Similarly, a part of an object or value is used to mean the whole object
-or value, or any set of its subcomponents. The terms component,
+Similarly, a <part> of an object or value is used to mean the whole
+object or value, or any set of its subcomponents. The terms component,
subcomponent, and part are also applied to a type meaning the component,
subcomponent, or part of objects and values of the type.
@@ -5695,28 +5701,29 @@ subcomponent, or part of objects and values of the type.
whole is controlled, or any subcomponent is.
7/2
-{AI95-00231-01AI95-00231-01} The set of possible values for an object of
-a given type can be subjected to a condition that is called a constraint
-(the case of a null constraint that specifies no restriction is also
-included)[; the rules for which values satisfy a given kind of
-constraint are given in *note 3.5:: for range_constraints, *note 3.6.1::
-for index_constraints, and *note 3.7.1:: for discriminant_constraints].
-The set of possible values for an object of an access type can also be
-subjected to a condition that excludes the null value (see *note
-3.10::).
+{<AI95-00231-01AI95-00231-01>} The set of possible values for an object
+of a given type can be subjected to a condition that is called a
+<constraint> (the case of a <null constraint> that specifies no
+restriction is also included)[; the rules for which values satisfy a
+given kind of constraint are given in *note 3.5:: for range_constraints,
+*note 3.6.1:: for index_constraints, and *note 3.7.1:: for
+discriminant_constraints]. The set of possible values for an object of
+an access type can also be subjected to a condition that excludes the
+null value (see *note 3.10::).
8/2
-{AI95-00231-01AI95-00231-01} {AI95-00415-01AI95-00415-01} A subtype of a
-given type is a combination of the type, a constraint on values of the
-type, and certain attributes specific to the subtype. The given type is
-called the type of the subtype. Similarly, the associated constraint is
-called the constraint of the subtype. The set of values of a subtype
-consists of the values of its type that satisfy its constraint and any
-exclusion of the null value. Such values belong to the subtype.
+{<AI95-00231-01AI95-00231-01>} {<AI95-00415-01AI95-00415-01>} A
+<subtype> of a given type is a combination of the type, a constraint on
+values of the type, and certain attributes specific to the subtype. The
+given type is called the <type of the subtype>. Similarly, the
+associated constraint is called the <constraint of the subtype>. The
+set of values of a subtype consists of the values of its type that
+satisfy its constraint and any exclusion of the null value. Such values
+<belong> to the subtype.
8.a
Discussion: We make a strong distinction between a type and
- its subtypes. In particular, a type is not a subtype of
+ its subtypes. In particular, a type is <not> a subtype of
itself. There is no constraint associated with a type (not
even a null one), and type-related attributes are distinct
from subtype-specific attributes.
@@ -5725,7 +5732,7 @@ exclusion of the null value. Such values belong to the
subtype.
Discussion: We no longer use the term "base type." All types
were "base types" anyway in Ada 83, so the term was redundant,
and occasionally confusing. In the RM95 we say simply "the
- type of the subtype" instead of "the base type of the
+ type <of> the subtype" instead of "the base type of the
subtype."
8.c
@@ -5733,7 +5740,7 @@ exclusion of the null value. Such values belong to the
subtype.
and need not be a proper subset.
8.d/2
- To be honest: {AI95-00442-01AI95-00442-01} Any name of a
+ To be honest: {<AI95-00442-01AI95-00442-01>} Any name of a
category of types (such as "discrete", "real", or "limited")
is also used to qualify its subtypes, as well as its objects,
values, declarations, and definitions, such as an "integer
@@ -5747,11 +5754,11 @@ exclusion of the null value. Such values belong to the
subtype.
explicitly defining them, when the meaning is obvious.
9
-A subtype is called an unconstrained subtype if its type has unknown
+A subtype is called an <unconstrained> subtype if its type has unknown
discriminants, or if its type allows range, index, or discriminant
constraints, but the subtype does not impose such a constraint;
-otherwise, the subtype is called a constrained subtype (since it has no
-unconstrained characteristics).
+otherwise, the subtype is called a <constrained> subtype (since it has
+no unconstrained characteristics).
9.a
Discussion: In an earlier version of Ada 9X, "constrained"
@@ -5772,15 +5779,15 @@ unconstrained characteristics).
NOTES
10/2
- 2 {AI95-00442-01AI95-00442-01} Any set of types can be called a
+ 2 {<AI95-00442-01AI95-00442-01>} Any set of types can be called a
"category" of types, and any set of types that is closed under
derivation (see *note 3.4::) can be called a "class" of types.
However, only certain categories and classes are used in the
description of the rules of the language -- generally those that
have their own particular set of primitive operations (see *note
3.2.3::), or that correspond to a set of types that are matched by
- a given kind of generic formal type (see *note 12.5::). The
- following are examples of "interesting" language-defined classes:
+ a given kind of generic formal type (see *note 12.5::). The
+ following are examples of "interesting" <language-defined classes>:
elementary, scalar, discrete, enumeration, character, boolean,
integer, signed integer, modular, real, floating point, fixed
point, ordinary fixed point, decimal fixed point, numeric, access,
@@ -5788,28 +5795,28 @@ unconstrained characteristics).
(untagged) record, tagged, task, protected, nonlimited. Special
syntax is provided to define types in each of these classes. In
addition to these classes, the following are examples of
- "interesting" language-defined categories: abstract, incomplete,
+ "interesting" <language-defined categories>: abstract, incomplete,
interface, limited, private, record.
10.a
- Discussion: A value is a run-time entity with a given type
+ Discussion: A <value> is a run-time entity with a given type
which can be assigned to an object of an appropriate subtype
- of the type. An operation is a program entity that operates on
- zero or more operands to produce an effect, or yield a result,
- or both.
+ of the type. An <operation> is a program entity that operates
+ on zero or more operands to produce an effect, or yield a
+ result, or both.
10.b/2
- Ramification: {AI95-00442-01AI95-00442-01} Note that a type's
- category (and class) depends on the place of the reference --
- a private type is composite outside and possibly elementary
- inside. It's really the view that is elementary or composite.
- Note that although private types are composite, there are some
- properties that depend on the corresponding full view -- for
- example, parameter passing modes, and the constraint checks
- that apply in various places.
+ Ramification: {<AI95-00442-01AI95-00442-01>} Note that a
+ type's category (and class) depends on the place of the
+ reference -- a private type is composite outside and possibly
+ elementary inside. It's really the <view> that is elementary
+ or composite. Note that although private types are composite,
+ there are some properties that depend on the corresponding
+ full view -- for example, parameter passing modes, and the
+ constraint checks that apply in various places.
10.c/2
- {AI95-00345-01AI95-00345-01} {AI95-00442-01AI95-00442-01}
+ {<AI95-00345-01AI95-00345-01>} {<AI95-00442-01AI95-00442-01>}
Every property of types forms a category, but not every
property of types represents a class. For example, the set of
all abstract types does not form a class, because this set is
@@ -5817,30 +5824,30 @@ unconstrained characteristics).
interface types does not form a class.
10.d/2
- {AI95-00442-01AI95-00442-01} The set of limited types does not
- form a class (since nonlimited types can inherit from limited
- interfaces), but the set of nonlimited types does. The set of
- tagged record types and the set of tagged private types do not
- form a class (because each of them can be extended to create a
- type of the other category); that implies that the set of
- record types and the set of private types also do not form a
- class (even though untagged record types and untagged private
- types do form a class). In all of these cases, we can talk
- about the category of the type; for instance, we can talk
- about the "category of limited types"..
+ {<AI95-00442-01AI95-00442-01>} The set of limited types does
+ not form a class (since nonlimited types can inherit from
+ limited interfaces), but the set of nonlimited types does.
+ The set of tagged record types and the set of tagged private
+ types do not form a class (because each of them can be
+ extended to create a type of the other category); that implies
+ that the set of record types and the set of private types also
+ do not form a class (even though untagged record types and
+ untagged private types do form a class). In all of these
+ cases, we can talk about the category of the type; for
+ instance, we can talk about the "category of limited types"..
10.e/2
- {AI95-00442-01AI95-00442-01} Normatively, the language-defined
- classes are those that are defined to be inherited on
- derivation by *note 3.4::; other properties either aren't
- interesting or form categories, not classes.
+ {<AI95-00442-01AI95-00442-01>} Normatively, the
+ <language-defined classes> are those that are defined to be
+ inherited on derivation by *note 3.4::; other properties
+ either aren't interesting or form categories, not classes.
11/2
- {AI95-00442-01AI95-00442-01} These language-defined categories are
- organized like this:
+ {<AI95-00442-01AI95-00442-01>} These language-defined categories
+ are organized like this:
12/2
- {AI95-00345-01AI95-00345-01} all types
+ {<AI95-00345-01AI95-00345-01>} all types
elementary
scalar
discrete
@@ -5876,14 +5883,14 @@ unconstrained characteristics).
tagged protected
13/2
- {AI95-00345-01AI95-00345-01} {AI95-00442-01AI95-00442-01} There are
- other categories, such as "numeric" and "discriminated", which
+ {<AI95-00345-01AI95-00345-01>} {<AI95-00442-01AI95-00442-01>} There
+ are other categories, such as "numeric" and "discriminated", which
represent other categorization dimensions, but do not fit into the
above strictly hierarchical picture.
13.a.1/2
- Discussion: {AI95-00345-01AI95-00345-01}
- {AI95-00442-01AI95-00442-01} Note that this is also true for
+ Discussion: {<AI95-00345-01AI95-00345-01>}
+ {<AI95-00442-01AI95-00442-01>} Note that this is also true for
some categories mentioned in the chart. The category "task"
includes both untagged tasks and tagged tasks. Similarly for
"protected", "limited", and "nonlimited" (note that limited
@@ -5892,7 +5899,7 @@ unconstrained characteristics).
_Wording Changes from Ada 83_
13.a/3
- {AI05-0299-1AI05-0299-1} This subclause now precedes the
+ {<AI05-0299-1AI05-0299-1>} This subclause now precedes the
subclauses on objects and named numbers, to cut down on the
number of forward references.
@@ -5905,29 +5912,29 @@ unconstrained characteristics).
_Wording Changes from Ada 95_
13.c/2
- {AI95-00231-01AI95-00231-01} Added a mention of null
+ {<AI95-00231-01AI95-00231-01>} Added a mention of null
exclusions when we're talking about constraints (these are not
constraints, but they are similar).
13.d/2
- {AI95-00251-01AI95-00251-01} Defined an interface type to be a
- composite type.
+ {<AI95-00251-01AI95-00251-01>} Defined an interface type to be
+ a composite type.
13.e/2
- {AI95-00326-01AI95-00326-01} Revised the wording so that it is
- clear that an incomplete view is similar to a partial view in
- terms of the language.
+ {<AI95-00326-01AI95-00326-01>} Revised the wording so that it
+ is clear that an incomplete view is similar to a partial view
+ in terms of the language.
13.f/2
- {AI95-00366-01AI95-00366-01} Added a definition of component
+ {<AI95-00366-01AI95-00366-01>} Added a definition of component
of a type, subcomponent of a type, and part of a type. These
are commonly used in the standard, but they were not
previously defined.
13.g/3
- {AI95-00442-01AI95-00442-01} {AI05-0299-1AI05-0299-1} Reworded
- most of this subclause to use category rather than class,
- since so many interesting properties are not, strictly
+ {<AI95-00442-01AI95-00442-01>} {<AI05-0299-1AI05-0299-1>}
+ Reworded most of this subclause to use category rather than
+ class, since so many interesting properties are not, strictly
speaking, classes. Moreover, there was no normative
description of exactly which properties formed classes, and
which did not. The real definition of class, along with a
@@ -5958,7 +5965,7 @@ A type_declaration declares a type and its first subtype.
| private_extension_declaration
3/3
- {AI05-0183-1AI05-0183-1} full_type_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} full_type_declaration ::=
type defining_identifier [known_discriminant_part] is
type_definition
[aspect_specification];
@@ -5966,7 +5973,7 @@ A type_declaration declares a type and its first subtype.
| protected_type_declaration
4/2
- {AI95-00251-01AI95-00251-01} type_definition ::=
+ {<AI95-00251-01AI95-00251-01>} type_definition ::=
enumeration_type_definition | integer_type_definition
| real_type_definition | array_type_definition
| record_type_definition | access_type_definition
@@ -5982,26 +5989,26 @@ itself.
6
The defining_identifier (*note 3.1: S0022.) of a type_declaration (*note
-3.2.1: S0023.) denotes the first subtype of the type. The
+3.2.1: S0023.) denotes the <first subtype> of the type. The
known_discriminant_part (*note 3.7: S0061.), if any, defines the
discriminants of the type (see *note 3.7::, "*note 3.7::
Discriminants"). The remainder of the type_declaration (*note 3.2.1:
S0023.) defines the remaining characteristics of (the view of) the type.
7/2
-{AI95-00230-01AI95-00230-01} A type defined by a type_declaration (*note
-3.2.1: S0023.) is a named type; such a type has one or more nameable
-subtypes. Certain other forms of declaration also include type
+{<AI95-00230-01AI95-00230-01>} A type defined by a type_declaration
+(*note 3.2.1: S0023.) is a <named> type; such a type has one or more
+nameable subtypes. Certain other forms of declaration also include type
definitions as part of the declaration for an object. The type defined
-by such a declaration is anonymous -- it has no nameable subtypes. For
-explanatory purposes, this International Standard sometimes refers to an
-anonymous type by a pseudo-name, written in italics, and uses such
+by such a declaration is <anonymous> -- it has no nameable subtypes.
+For explanatory purposes, this International Standard sometimes refers
+to an anonymous type by a pseudo-name, written in italics, and uses such
pseudo-names at places where the syntax normally requires an identifier.
For a named type whose first subtype is T, this International Standard
sometimes refers to the type of T as simply "the type T".
7.a/2
- Ramification: {AI95-00230-01AI95-00230-01} The only
+ Ramification: {<AI95-00230-01AI95-00230-01>} The only
user-defined types that can be anonymous in the above sense
are array, access, task, and protected types. An anonymous
array, task, or protected type can be defined as part of an
@@ -6009,15 +6016,15 @@ sometimes refers to the type of T as simply "the type
T".
as part of numerous other constructs.
8/2
-{AI95-00230-01AI95-00230-01} {AI95-00326-01AI95-00326-01} A named type
-that is declared by a full_type_declaration (*note 3.2.1: S0024.), or an
-anonymous type that is defined by an access_definition or as part of
-declaring an object of the type, is called a full type. The declaration
-of a full type also declares the full view of the type. The
-type_definition (*note 3.2.1: S0025.), task_definition (*note 9.1:
+{<AI95-00230-01AI95-00230-01>} {<AI95-00326-01AI95-00326-01>} A named
+type that is declared by a full_type_declaration (*note 3.2.1: S0024.),
+or an anonymous type that is defined by an access_definition or as part
+of declaring an object of the type, is called a <full type>. The
+declaration of a full type also declares the <full view> of the type.
+The type_definition (*note 3.2.1: S0025.), task_definition (*note 9.1:
S0207.), protected_definition (*note 9.4: S0212.), or access_definition
-(*note 3.10: S0084.) that defines a full type is called a full type
-definition. [Types declared by other forms of type_declaration (*note
+(*note 3.10: S0084.) that defines a full type is called a <full type
+definition>. [Types declared by other forms of type_declaration (*note
3.2.1: S0023.) are not separate types; they are partial or incomplete
views of some full type.]
@@ -6026,13 +6033,13 @@ views of some full type.]
are full types.
8.b/2
- Reason: {AI95-00230-01AI95-00230-01} We need to mention
+ Reason: {<AI95-00230-01AI95-00230-01>} We need to mention
access_definition separately, as it may occur in renames,
which do not declare objects.
9
-The definition of a type implicitly declares certain predefined
-operators that operate on the type, according to what classes the type
+The definition of a type implicitly declares certain <predefined
+operators> that operate on the type, according to what classes the type
belongs, as specified in *note 4.5::, "*note 4.5:: Operators and
Expression Evaluation".
@@ -6043,10 +6050,10 @@ Expression Evaluation".
only certain classes of types.
10
-The predefined types [(for example the types Boolean, Wide_Character,
-Integer, root_integer, and universal_integer)] are the types that are
-defined in [a predefined library package called] Standard[; this package
-also includes the [(implicit)] declarations of their predefined
+The <predefined types> [(for example the types Boolean, Wide_Character,
+Integer, <root_integer>, and <universal_integer>)] are the types that
+are defined in [a predefined library package called] Standard[; this
+package also includes the [(implicit)] declarations of their predefined
operators]. [The package Standard is described in *note A.1::.]
10.a
@@ -6063,15 +6070,15 @@ operators]. [The package Standard is described in
*note A.1::.]
11
The elaboration of a full_type_declaration consists of the elaboration
-of the full type definition. Each elaboration of a full type definition
+of the full type definition. Each elaboration of a full type definition
creates a distinct type and its first subtype.
11.a
- Reason: The creation is associated with the type definition,
- rather than the type declaration, because there are types that
- are created by full type definitions that are not immediately
- contained within a type declaration (e.g. an array object
- declaration, a singleton task declaration, etc.).
+ Reason: The creation is associated with the type <definition>,
+ rather than the type <declaration>, because there are types
+ that are created by full type definitions that are not
+ immediately contained within a type declaration (e.g. an
+ array object declaration, a singleton task declaration, etc.).
11.b
Ramification: Any implicit declarations that occur immediately
@@ -6081,7 +6088,7 @@ creates a distinct type and its first subtype.
_Examples_
12
-Examples of type definitions:
+<Examples of type definitions:>
13
(White, Red, Yellow, Green, Blue, Brown, Black)
@@ -6089,7 +6096,7 @@ Examples of type definitions:
array(1 .. 10) of Integer
14
-Examples of type declarations:
+<Examples of type declarations:>
15
type Color is (White, Red, Yellow, Green, Blue, Brown, Black);
@@ -6117,7 +6124,7 @@ Examples of type declarations:
and protected type declarations.
16.b/3
- {AI05-0299-1AI05-0299-1} We have generalized the concept of
+ {<AI05-0299-1AI05-0299-1>} We have generalized the concept of
first-named subtype (now called simply "first subtype") to
cover all kinds of types, for uniformity of description
elsewhere. RM83 defined first-named subtype in Section 13.
@@ -6126,7 +6133,7 @@ Examples of type declarations:
some first subtypes have no name.
16.c/2
- {AI95-00230-01AI95-00230-01} We no longer elaborate
+ {<AI95-00230-01AI95-00230-01>} We no longer elaborate
discriminant_parts, because there is nothing to do, and it was
complex to say that you only wanted to elaborate it once for a
private or incomplete type. This is also consistent with the
@@ -6140,23 +6147,23 @@ Examples of type declarations:
_Wording Changes from Ada 95_
16.d/2
- {AI95-00230-01AI95-00230-01} Added wording so that anonymous
+ {<AI95-00230-01AI95-00230-01>} Added wording so that anonymous
access types are always full types, even if they appear in
renames.
16.e/2
- {AI95-00251-01AI95-00251-01} Added interface types (see *note
- 3.9.4::) to the syntax.
+ {<AI95-00251-01AI95-00251-01>} Added interface types (see
+ *note 3.9.4::) to the syntax.
16.f/2
- {AI95-00326-01AI95-00326-01} Added a definition of full view,
- so that all types have a well-defined full view.
+ {<AI95-00326-01AI95-00326-01>} Added a definition of full
+ view, so that all types have a well-defined full view.
_Extensions to Ada 2005_
16.g/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a full_type_declaration. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a full_type_declaration. This is described in
*note 13.1.1::.
@@ -6172,16 +6179,16 @@ type, as defined by a subtype_indication.
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} subtype_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} subtype_declaration ::=
subtype defining_identifier is subtype_indication
[aspect_specification];
3/2
- {AI95-00231-01AI95-00231-01} subtype_indication ::= [
+ {<AI95-00231-01AI95-00231-01>} subtype_indication ::= [
null_exclusion] subtype_mark [constraint]
4
- subtype_mark ::= subtype_name
+ subtype_mark ::= <subtype_>name
4.a
Ramification: Note that name includes attribute_reference;
@@ -6206,21 +6213,22 @@ type, as defined by a subtype_indication.
_Name Resolution Rules_
8
-A subtype_mark shall resolve to denote a subtype. The type determined by
-a subtype_mark is the type of the subtype denoted by the subtype_mark.
+A subtype_mark shall resolve to denote a subtype. The type <determined
+by> a subtype_mark is the type of the subtype denoted by the
+subtype_mark.
8.a/3
- Ramification: {AI05-0005-1AI05-0005-1} Types are never
+ Ramification: {<AI05-0005-1AI05-0005-1>} Types are never
directly named; all subtype_marks denote subtypes -- possibly
an unconstrained (base) subtype, but never the type. When we
- use the term anonymous type we really mean a type with no
+ use the term <anonymous type> we really mean a type with no
nameable subtypes.
_Dynamic Semantics_
9
The elaboration of a subtype_declaration consists of the elaboration of
-the subtype_indication. The elaboration of a subtype_indication creates
+the subtype_indication. The elaboration of a subtype_indication creates
a new subtype. If the subtype_indication does not include a constraint,
the new subtype has the same (possibly null) constraint as that denoted
by the subtype_mark. The elaboration of a subtype_indication that
@@ -6230,7 +6238,7 @@ includes a constraint proceeds as follows:
* The constraint is first elaborated.
11
- * A check is then made that the constraint is compatible with the
+ * A check is then made that the constraint is <compatible> with the
subtype denoted by the subtype_mark.
11.a
@@ -6241,11 +6249,11 @@ includes a constraint proceeds as follows:
12
The condition imposed by a constraint is the condition obtained after
-elaboration of the constraint. The rules defining compatibility are
+elaboration of the constraint. The rules defining compatibility are
given for each form of constraint in the appropriate subclause. These
-rules are such that if a constraint is compatible with a subtype, then
+rules are such that if a constraint is <compatible> with a subtype, then
the condition imposed by the constraint cannot contradict any condition
-already imposed by the subtype on its values. The exception
+already imposed by the subtype on its values. The exception
Constraint_Error is raised if any check of compatibility fails.
12.a
@@ -6270,17 +6278,17 @@ Constraint_Error is raised if any check of
compatibility fails.
_Examples_
14
-Examples of subtype declarations:
+<Examples of subtype declarations:>
15/2
- {AI95-00433-01AI95-00433-01} subtype Rainbow is Color range Red ..
Blue; -- see *note 3.2.1::
+ {<AI95-00433-01AI95-00433-01>} subtype Rainbow is Color range Red ..
Blue; --< see *note 3.2.1::>
subtype Red_Blue is Rainbow;
subtype Int is Integer;
subtype Small_Int is Integer range -10 .. 10;
- subtype Up_To_K is Column range 1 .. K; -- see *note 3.2.1::
- subtype Square is Matrix(1 .. 10, 1 .. 10); -- see *note 3.6::
- subtype Male is Person(Sex => M); -- see *note
3.10.1::
- subtype Binop_Ref is not null Binop_Ptr; -- see *note 3.10::
+ subtype Up_To_K is Column range 1 .. K; --< see *note
3.2.1::>
+ subtype Square is Matrix(1 .. 10, 1 .. 10); --< see *note 3.6::>
+ subtype Male is Person(Sex => M); --< see *note
3.10.1::>
+ subtype Binop_Ref is not null Binop_Ptr; --< see *note
3.10::>
_Incompatibilities With Ada 83_
@@ -6306,16 +6314,16 @@ Examples of subtype declarations:
_Extensions to Ada 95_
15.d/2
- {AI95-00231-01AI95-00231-01} An optional null_exclusion can be
- used in a subtype_indication. This is described in *note
+ {<AI95-00231-01AI95-00231-01>} An optional null_exclusion can
+ be used in a subtype_indication. This is described in *note
3.10::.
_Extensions to Ada 2005_
15.e/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a subtype_declaration. This is described in *note
- 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a subtype_declaration. This is described in
+ *note 13.1.1::.
File: aarm2012.info, Node: 3.2.3, Next: 3.2.4, Prev: 3.2.2, Up: 3.2
@@ -6326,14 +6334,14 @@ File: aarm2012.info, Node: 3.2.3, Next: 3.2.4, Prev:
3.2.2, Up: 3.2
_Static Semantics_
1/2
-{AI95-00416-01AI95-00416-01} An operation operates on a type T if it
-yields a value of type T, if it has an operand whose expected type (see
-*note 8.6::) is T, or if it has an access parameter or access result
-type (see *note 6.1::) designating T. A predefined operator, or other
-language-defined operation such as assignment or a membership test, that
-operates on a type, is called a predefined operation of the type. The
-primitive operations of a type are the predefined operations of the
-type, plus any user-defined primitive subprograms.
+{<AI95-00416-01AI95-00416-01>} An operation <operates on a type> <T> if
+it yields a value of type <T>, if it has an operand whose expected type
+(see *note 8.6::) is <T>, or if it has an access parameter or access
+result type (see *note 6.1::) designating <T>. A predefined operator,
+or other language-defined operation such as assignment or a membership
+test, that operates on a type, is called a <predefined operation> of the
+type. The <primitive operations> of a type are the predefined
+operations of the type, plus any user-defined primitive subprograms.
1.a
Glossary entry: The primitive operations of a type are the
@@ -6359,7 +6367,7 @@ type, plus any user-defined primitive subprograms.
used mostly in conceptual discussions.
2
-The primitive subprograms of a specific type are defined as follows:
+The <primitive subprograms> of a specific type are defined as follows:
3
* The predefined operators of the type (see *note 4.5::);
@@ -6379,16 +6387,16 @@ The primitive subprograms of a specific type are
defined as follows:
within the same package_specification and that operate on the type;
6.1/3
- * {AI05-0128-1AI05-0128-1} For a specific type with an explicitly
+ * {<AI05-0128-1AI05-0128-1>} For a specific type with an explicitly
declared primitive "=" operator whose result type is Boolean, the
corresponding "/=" operator (see *note 6.6::);
7/2
- * {AI95-00200-01AI95-00200-01} For a nonformal type, any subprograms
- not covered above [that are explicitly declared immediately within
- the same declarative region as the type] and that override (see
- *note 8.3::) other implicitly declared primitive subprograms of the
- type.
+ * {<AI95-00200-01AI95-00200-01>} For a nonformal type, any
+ subprograms not covered above [that are explicitly declared
+ immediately within the same declarative region as the type] and
+ that override (see *note 8.3::) other implicitly declared primitive
+ subprograms of the type.
7.a
Discussion: In Ada 83, only subprograms declared in the
@@ -6410,7 +6418,7 @@ The primitive subprograms of a specific type are defined
as follows:
Classes".
7.d/2
- Ramification: {AI95-00200-01AI95-00200-01} Subprograms
+ Ramification: {<AI95-00200-01AI95-00200-01>} Subprograms
declared in a generic package specification are never
primitive for a formal type, even if they happen to override
an operation of the formal type. This includes formal
@@ -6419,7 +6427,7 @@ The primitive subprograms of a specific type are defined
as follows:
8
A primitive subprogram whose designator is an operator_symbol is called
-a primitive operator.
+a <primitive operator>.
_Incompatibilities With Ada 83_
@@ -6441,9 +6449,9 @@ a primitive operator.
_Wording Changes from Ada 83_
8.c
- We have dropped the confusing term operation of a type in
- favor of the more useful primitive operation of a type and the
- phrase operates on a type.
+ We have dropped the confusing term <operation of a type> in
+ favor of the more useful <primitive operation of a type> and
+ the phrase <operates on a type>.
8.d
The description of S'Base has been moved to *note 3.5::,
@@ -6453,20 +6461,20 @@ a primitive operator.
_Wording Changes from Ada 95_
8.e/2
- {AI95-00200-01AI95-00200-01} Clarified that a formal
+ {<AI95-00200-01AI95-00200-01>} Clarified that a formal
subprogram that happens to override a primitive operation of a
formal type is not a primitive operation (and thus not a
dispatching operation) of the formal type.
8.f/2
- {AI95-00416-01AI95-00416-01} Added wording to include access
+ {<AI95-00416-01AI95-00416-01>} Added wording to include access
result types in the kinds of operations that operate on a type
T.
_Wording Changes from Ada 2005_
8.g/3
- {AI05-0128-1AI05-0128-1} Correction: The implicitly declared
+ {<AI05-0128-1AI05-0128-1>} Correction: The implicitly declared
"/=" for a primitive "=" operator is also primitive; this
makes it eligible to be made visible by a use type clause.
@@ -6477,10 +6485,10 @@ File: aarm2012.info, Node: 3.2.4, Prev: 3.2.3, Up:
3.2
------------------------
1/3
-{AI05-0153-3AI05-0153-3} {AI05-0269-1AI05-0269-1}
-{AI05-0299-1AI05-0299-1} The language-defined predicate aspects
+{<AI05-0153-3AI05-0153-3>} {<AI05-0269-1AI05-0269-1>}
+{<AI05-0299-1AI05-0299-1>} The language-defined <predicate aspects>
Static_Predicate and Dynamic_Predicate may be used to define properties
-of subtypes. A predicate specification is an aspect_specification for
+of subtypes. A <predicate specification> is an aspect_specification for
one of the two predicate aspects. General rules for aspects and
aspect_specifications are found in Clause *note 13:: (*note 13.1:: and
*note 13.1.1:: respectively).
@@ -6498,19 +6506,19 @@ aspect_specifications are found in Clause *note 13::
(*note 13.1:: and
_Name Resolution Rules_
2/3
-{AI05-0153-3AI05-0153-3} The expected type for a predicate aspect
+{<AI05-0153-3AI05-0153-3>} The expected type for a predicate aspect
expression is any boolean type.
_Static Semantics_
3/3
-{AI05-0153-3AI05-0153-3} A predicate specification may be given on a
+{<AI05-0153-3AI05-0153-3>} A predicate specification may be given on a
type_declaration or a subtype_declaration, and applies to the declared
subtype. In addition, predicate specifications apply to certain other
subtypes:
4/4
- * {AI12-0071-1AI12-0071-1} {AI12-0099-1AI12-0099-1} For a (first)
+ * {<AI12-0071-1AI12-0071-1>} {<AI12-0099-1AI12-0099-1>} For a (first)
subtype defined by a type declaration, any predicates of parent or
progenitor subtypes apply.
@@ -6519,12 +6527,12 @@ subtypes:
subtype denoted by the subtype_mark applies.
6/4
-This paragraph was deleted.{AI05-0153-3AI05-0153-3}
-{AI12-0071-1AI12-0071-1}
+<This paragraph was deleted.>{<AI05-0153-3AI05-0153-3>}
+{<AI12-0071-1AI12-0071-1>}
7/3
-{AI05-0290-1AI05-0290-1} Predicate checks are defined to be enabled or
-disabled for a given subtype as follows:
+{<AI05-0290-1AI05-0290-1>} Predicate checks are defined to be <enabled>
+or <disabled> for a given subtype as follows:
8/3
* If a subtype is declared by a type_declaration or
@@ -6548,7 +6556,7 @@ disabled for a given subtype as follows:
other subtypes mentioned in the declaration];
12/4
- * {AI12-0099-1AI12-0099-1} If a subtype is defined by a type
+ * {<AI12-0099-1AI12-0099-1>} If a subtype is defined by a type
declaration that does not include a predicate specification, then
predicate checks are enabled for the subtype if and only if any
predicate checks are enabled for parent or progenitor subtypes;
@@ -6572,13 +6580,13 @@ disabled for a given subtype as follows:
above.
14.b/4
- {AI12-0071-1AI12-0071-1} Even when predicate checks are
+ {<AI12-0071-1AI12-0071-1>} Even when predicate checks are
disabled, a predicate can affect various Legality Rules, the
results of membership tests, the items in a for loop, and the
result of the Valid attribute.
14.1/4
-{AI12-0054-2AI12-0054-2} For a subtype with a directly-specified
+{<AI12-0054-2AI12-0054-2>} For a subtype with a directly-specified
predicate aspect, the following additional language-defined aspect may
be specified with an aspect_specification (see *note 13.1.1::):
@@ -6596,28 +6604,28 @@ Predicate_Failure
_Name Resolution Rules_
14.3/4
-{AI12-0054-2AI12-0054-2} The expected type for the Predicate_Failure
+{<AI12-0054-2AI12-0054-2>} The expected type for the Predicate_Failure
expression is String.
_Legality Rules_
15/3
-{AI05-0153-3AI05-0153-3} {AI05-0269-1AI05-0269-1} The expression of a
-Static_Predicate specification shall be predicate-static; that is, one
-of the following:
+{<AI05-0153-3AI05-0153-3>} {<AI05-0269-1AI05-0269-1>} The expression of
+a Static_Predicate specification shall be <predicate-static>; that is,
+one of the following:
16/3
* a static expression;
17/4
- * {AI12-0039-1AI12-0039-1} a membership test whose
- tested_simple_expression is the current instance, and whose
+ * {<AI12-0039-1AI12-0039-1>} a membership test whose
+ <tested_>simple_expression is the current instance, and whose
membership_choice_list meets the requirements for a static
membership test (see *note 4.9::);
18/3
- * a case_expression whose selecting_expression is the current
- instance, and whose dependent_expressions are static expressions;
+ * a case_expression whose <selecting_>expression is the current
+ instance, and whose <dependent_>expressions are static expressions;
19/3
* a call to a predefined equality or ordering operator, where one
@@ -6625,19 +6633,19 @@ of the following:
expression;
20/4
- * {AI05-0262-1AI05-0262-1} {AI12-0099-1AI12-0099-1} a call to a
+ * {<AI05-0262-1AI05-0262-1>} {<AI12-0099-1AI12-0099-1>} a call to a
predefined boolean operator and, or, xor, or not, where each
operand is predicate-static;
21/3
- * {AI05-0269-1AI05-0269-1} a short-circuit control form where both
+ * {<AI05-0269-1AI05-0269-1>} a short-circuit control form where both
operands are predicate-static; or
22/3
* a parenthesized predicate-static expression.
23/3
-{AI05-0262-1AI05-0262-1} A predicate shall not be specified for an
+{<AI05-0262-1AI05-0262-1>} A predicate shall not be specified for an
incomplete subtype.
23.a/3
@@ -6647,8 +6655,8 @@ incomplete subtype.
complexity needed to support it.
24/3
-{AI05-0287-1AI05-0287-1} If a predicate applies to a subtype, then that
-predicate shall not mention any other subtype to which the same
+{<AI05-0287-1AI05-0287-1>} If a predicate applies to a subtype, then
+that predicate shall not mention any other subtype to which the same
predicate applies.
24.a/3
@@ -6664,60 +6672,60 @@ predicate applies.
private
subtype Ugly is Really_Ugly;
type Really_Ugly is new Integer
- with Static_Predicate => Really_Ugly not in Ugly; --
Illegal!
+ with Static_Predicate => Really_Ugly not in Ugly; --<
Illegal!>
25/3
-{AI05-0153-3AI05-0153-3} An index subtype, discrete_range of an
+{<AI05-0153-3AI05-0153-3>} An index subtype, discrete_range of an
index_constraint or slice, or a discrete_subtype_definition of a
constrained_array_definition, entry_declaration, or
entry_index_specification shall not denote a subtype to which predicate
specifications apply.
26/3
-{AI05-0153-3AI05-0153-3} The prefix of an attribute_reference whose
+{<AI05-0153-3AI05-0153-3>} The prefix of an attribute_reference whose
attribute_designator is First, Last, or Range shall not denote a scalar
subtype to which predicate specifications apply.
26.a/3
- Reason: {AI05-0297-1AI05-0297-1} This is to prevent confusion
- about whether the First value is the lowest value of the
- subtype (which does not depend on the predicate) or the lowest
- value of the subtype which meets the predicate. (For a
+ Reason: {<AI05-0297-1AI05-0297-1>} This is to prevent
+ confusion about whether the First value is the lowest value of
+ the subtype (which does not depend on the predicate) or the
+ lowest value of the subtype which meets the predicate. (For a
dynamic predicate, determining this latter value is expensive
as it would usually require a loop.) For a static subtype
that has a static predicate, the First_Valid and Last_Valid
attributes (see *note 3.5.5::) can be used instead.
27/3
-{AI05-0153-3AI05-0153-3} {AI05-0262-1AI05-0262-1}
-{AI05-0287-1AI05-0287-1} The discrete_subtype_definition of a
+{<AI05-0153-3AI05-0153-3>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0287-1AI05-0287-1>} The discrete_subtype_definition of a
loop_parameter_specification shall not denote a nonstatic subtype to
which predicate specifications apply or any subtype to which
Dynamic_Predicate specifications apply.
28/3
-{AI05-0153-3AI05-0153-3} {AI05-0262-1AI05-0262-1} The discrete_choice of
-a named_array_aggregate shall not denote a nonstatic subtype to which
-predicate specifications apply.
+{<AI05-0153-3AI05-0153-3>} {<AI05-0262-1AI05-0262-1>} The
+discrete_choice of a named_array_aggregate shall not denote a nonstatic
+subtype to which predicate specifications apply.
28.a/3
- Reason: {AI05-0262-1AI05-0262-1} This rule prevents
+ Reason: {<AI05-0262-1AI05-0262-1>} This rule prevents
noncontiguous dynamically bounded array aggregates, which
could be expensive to check for. (Array aggregates have rules
to prevent problems with static subtypes.) We define this
rule here so that the runtime generic body check applies.
29/3
-{AI05-0262-1AI05-0262-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules apply also in the private
-part of an instance of a generic unit.
+{<AI05-0262-1AI05-0262-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules apply also in the
+private part of an instance of a generic unit.
_Dynamic Semantics_
29.1/4
-{AI125-0071AI125-0071} If any of the above Legality Rules is violated in
-an instance of a generic unit, Program_Error is raised at the point of
-the violation.
+{<AI125-0071AI125-0071>} If any of the above Legality Rules is violated
+in an instance of a generic unit, Program_Error is raised at the point
+of the violation.
29.a/4
Discussion: This is the usual way around the contract model;
@@ -6727,23 +6735,23 @@ the violation.
should raise Program_Error.
29.2/4
-{AI12-0071-1AI12-0071-1} To determine whether a value satisfies the
-predicates of a subtype S, the following tests are performed in the
+{<AI12-0071-1AI12-0071-1>} To determine whether a value <satisfies the
+predicates> of a subtype <S>, the following tests are performed in the
following order, until one of the tests fails, in which case the
predicates are not satisfied and no further tests are performed, or all
of the tests succeed, in which case the predicates are satisfied:
29.3/4
* the value is first tested to determine whether it satisfies any
- constraints or any null exclusion of S;
+ constraints or any null exclusion of <S>;
29.4/4
* then:
29.5/4
- * if S is a first subtype, the value is tested to determine
+ * if <S> is a first subtype, the value is tested to determine
whether it satisfies the predicates of the parent and
- progenitor subtypes (if any) of S (in an arbitrary order);
+ progenitor subtypes (if any) of <S> (in an arbitrary order);
29.b/4
Ramification: This rule has an effect for derived types (which
@@ -6753,12 +6761,12 @@ of the tests succeed, in which case the predicates are
satisfied:
required for other first subtypes.
29.6/4
- * if S is defined by a subtype_indication, the value is tested
+ * if <S> is defined by a subtype_indication, the value is tested
to determine whether it satisfies the predicates of the
subtype denoted by the subtype_mark of the subtype_indication;
29.7/4
- * finally, if S is defined by a declaration to which one or more
+ * finally, if <S> is defined by a declaration to which one or more
predicate specifications apply, the predicates are evaluated (in an
arbitrary order) to test that all of them yield True for the given
value.
@@ -6769,19 +6777,19 @@ of the tests succeed, in which case the predicates are
satisfied:
earlier steps had succeeded.
30/3
-{AI05-0153-3AI05-0153-3} {AI05-0290-1AI05-0290-1} If predicate checks
-are enabled for a given subtype, then:
+{<AI05-0153-3AI05-0153-3>} {<AI05-0290-1AI05-0290-1>} If predicate
+checks are enabled for a given subtype, then:
31/4
- {AI12-0054-2AI12-0054-2} {AI12-0071-1AI12-0071-1} [On every
- subtype conversion, a check is performed that the operand
- satisfies the predicates of the target subtype. This includes
- all parameter passing, except for certain parameters passed by
- reference, which are covered by the following rule: ] After
- normal completion and leaving of a subprogram, for each in out
- or out parameter that is passed by reference, a check is
- performed that the value of the parameter satisfies the
- predicates of the subtype of the actual. For an object
+ {<AI12-0054-2AI12-0054-2>} {<AI12-0071-1AI12-0071-1>} [On
+ every subtype conversion, a check is performed that the
+ operand satisfies the predicates of the target subtype. This
+ includes all parameter passing, except for certain parameters
+ passed by reference, which are covered by the following rule:
+ ] After normal completion and leaving of a subprogram, for
+ each in out or out parameter that is passed by reference, a
+ check is performed that the value of the parameter satisfies
+ the predicates of the subtype of the actual. For an object
created by an object_declaration with no explicit
initialization expression, or by an uninitialized allocator,
if any subcomponents have default_expressions, a check is
@@ -6789,8 +6797,8 @@ are enabled for a given subtype, then:
predicates of the nominal subtype.
31.1/4
- {AI12-0054-2AI12-0054-2} If any of the predicate checks fail,
- Assertion_Error is raised, unless the subtype whose
+ {<AI12-0054-2AI12-0054-2>} If any of the predicate checks
+ fail, Assertion_Error is raised, unless the subtype whose
directly-specified predicate aspect evaluated to False also
has a directly-specified Predicate_Failure aspect. In that
case, the specified Predicate_Failure expression is evaluated;
@@ -6818,59 +6826,59 @@ are enabled for a given subtype, then:
check if there is no applicable Predicate_Failure aspect.
32/4
-This paragraph was deleted.{AI05-0262-1AI05-0262-1}
-{AI125-0071AI125-0071}
+<This paragraph was deleted.>{<AI05-0262-1AI05-0262-1>}
+{<AI125-0071AI125-0071>}
33/4
-This paragraph was deleted.{AI05-0153-3AI05-0153-3}
-{AI05-0276-1AI05-0276-1} {AI125-0071AI125-0071}
+<This paragraph was deleted.>{<AI05-0153-3AI05-0153-3>}
+{<AI05-0276-1AI05-0276-1>} {<AI125-0071AI125-0071>}
33.a/4
- This paragraph was deleted.
+ <This paragraph was deleted.>
NOTES
34/3
- 5 {AI05-0153-3AI05-0153-3} A predicate specification does not
+ 5 {<AI05-0153-3AI05-0153-3>} A predicate specification does not
cause a subtype to be considered constrained.
35/3
- 6 {AI05-0153-3AI05-0153-3} A Static_Predicate, like a constraint,
- always remains True for all objects of the subtype, except in the
- case of uninitialized variables and other invalid values. A
- Dynamic_Predicate, on the other hand, is checked as specified
- above, but can become False at other times. For example, the
- predicate of a record subtype is not checked when a subcomponent is
- modified.
+ 6 {<AI05-0153-3AI05-0153-3>} A Static_Predicate, like a
+ constraint, always remains True for all objects of the subtype,
+ except in the case of uninitialized variables and other invalid
+ values. A Dynamic_Predicate, on the other hand, is checked as
+ specified above, but can become False at other times. For example,
+ the predicate of a record subtype is not checked when a
+ subcomponent is modified.
36/4
- 7 {AI12-0071-1AI12-0071-1} No predicates apply to the base subtype
- of a scalar type; every value of a scalar type T is considered to
- satisfy the predicates of T'Base.
+ 7 {<AI12-0071-1AI12-0071-1>} No predicates apply to the base
+ subtype of a scalar type; every value of a scalar type <T> is
+ considered to satisfy the predicates of <T>'Base.
37/4
- 8 {AI12-0054-2AI12-0054-2} Predicate_Failure expressions are never
- evaluated during the evaluation of a membership test (see *note
- 4.5.2::) or Valid attribute (see *note 13.9.2::).
+ 8 {<AI12-0054-2AI12-0054-2>} Predicate_Failure expressions are
+ never evaluated during the evaluation of a membership test (see
+ *note 4.5.2::) or Valid attribute (see *note 13.9.2::).
38/4
- 9 {AI12-0054-2AI12-0054-2} A Predicate_Failure expression can be a
- raise_expression (see *note 11.3::).
+ 9 {<AI12-0054-2AI12-0054-2>} A Predicate_Failure expression can be
+ a raise_expression (see *note 11.3::).
_Examples_
39/4
- {AI12-0054-2AI12-0054-2} subtype Basic_Letter is Character -- See *note
A.3.2:: for "basic letter".
+ {<AI12-0054-2AI12-0054-2>} subtype Basic_Letter is Character -- <See
*note A.3.2:: for "basic letter".>
with Static_Predicate => Basic_Letter in 'A'..'Z' | 'a'..'z' | '�' |
'�' | '�' | '�' | '�' | '�' | '�';
40/4
- {AI12-0054-2AI12-0054-2} subtype Even_Integer is Integer
+ {<AI12-0054-2AI12-0054-2>} subtype Even_Integer is Integer
with Dynamic_Predicate => Even_Integer mod 2 = 0,
Predicate_Failure => "Even_Integer must be a multiple of 2";
41/4
-{AI12-0054-2AI12-0054-2} Text_IO (see *note A.10.1::) could have used
-predicates to describe some common exceptional conditions as follows:
+{<AI12-0054-2AI12-0054-2>} <Text_IO (see *note A.10.1::) could have used
+predicates to describe some common exceptional conditions as follows:>
42/4
with Ada.IO_Exceptions;
@@ -6913,19 +6921,19 @@ predicates to describe some common exceptional
conditions as follows:
...
51/4
- -- Similarly for all of the other input and output subprograms.
+ -- <Similarly for all of the other input and output subprograms.>
_Extensions to Ada 2005_
51.a/3
- {AI05-0153-3AI05-0153-3} {AI05-0262-1AI05-0262-1}
- {AI05-0276-1AI05-0276-1} {AI05-0290-1AI05-0290-1} Predicate
- aspects are new in Ada 2012.
+ {<AI05-0153-3AI05-0153-3>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0276-1AI05-0276-1>} {<AI05-0290-1AI05-0290-1>}
+ Predicate aspects are new in Ada 2012.
_Extensions to Ada 2012_
51.b/4
- {AI12-0054-2AI12-0054-2} Corrigendum: The Predicate_Failure
+ {<AI12-0054-2AI12-0054-2>} Corrigendum: The Predicate_Failure
aspect is new. We can consider this a correction as it is
always possible for implementers to add implementation-defined
aspects, so the same is true for language-defined aspects.
@@ -6933,7 +6941,7 @@ predicates to describe some common exceptional conditions
as follows:
_Wording Changes from Ada 2012_
51.c/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Specified the order of
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Specified the order of
evaluation of most predicates, by defining the new term
"satisfies the predicates of the subtype". This is not
inconsistent, as the order previously was unspecified, so any
@@ -6943,14 +6951,14 @@ predicates to describe some common exceptional
conditions as follows:
see the Ada.Text_IO example above for such a case.
51.d/4
- {AI12-0099-1AI12-0099-1} Corrigendum: Revised wording to
+ {<AI12-0099-1AI12-0099-1>} Corrigendum: Revised wording to
ensure all kinds of types are covered, including the anonymous
task associated with a single_task_declaration, and
generalized it.
51.e/4
- {AI12-0099-1AI12-0099-1} Corrigendum: Revised wording to list
- the boolean operators that can be predicate-static, to
+ {<AI12-0099-1AI12-0099-1>} Corrigendum: Revised wording to
+ list the boolean operators that can be predicate-static, to
eliminate confusion about whether not is included.
@@ -6960,8 +6968,8 @@ File: aarm2012.info, Node: 3.3, Next: 3.4, Prev: 3.2,
Up: 3
=============================
1
-[Objects are created at run time and contain a value of a given type. An
-object can be created and initialized as part of elaborating a
+[Objects are created at run time and contain a value of a given type.
+An object can be created and initialized as part of elaborating a
declaration, evaluating an allocator, aggregate, or function_call, or
passing a parameter by copy. Prior to reclaiming the storage for an
object, it is finalized if necessary (see *note 7.6.1::).]
@@ -7001,37 +7009,37 @@ All of the following are objects:
4.1::);
10/3
- * {AI95-00416-01AI95-00416-01} {AI05-0015-1AI05-0015-1} the return
- object of a function;
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0015-1AI05-0015-1>} the
+ return object of a function;
11
* the result of evaluating an aggregate;
11.1/3
- * {AI05-0003-1AI05-0003-1} a qualified_expression whose operand
+ * {<AI05-0003-1AI05-0003-1>} a qualified_expression whose operand
denotes an object;
12
* a component, slice, or view conversion of another object.
13/3
-{AI05-0054-2AI05-0054-2} An object is either a constant object or a
-variable object. Similarly, a view of an object is either a constant or
-a variable. All views of a constant elementary object are constant.
-All views of a constant composite object are constant, except for parts
-that are of controlled or immutably limited types; variable views of
-those parts and their subcomponents may exist. In this sense, objects
-of controlled and immutably limited types are inherently mutable. A
-constant view of an object cannot be used to modify its value. The
-terms constant and variable by themselves refer to constant and variable
-views of objects.
+{<AI05-0054-2AI05-0054-2>} An object is either a <constant> object or a
+<variable> object. Similarly, a view of an object is either a
+<constant> or a <variable>. All views of a constant elementary object
+are constant. All views of a constant composite object are constant,
+except for parts that are of controlled or immutably limited types;
+variable views of those parts and their subcomponents may exist. In
+this sense, objects of controlled and immutably limited types are
+<inherently mutable>. A constant view of an object cannot be used to
+modify its value. The terms constant and variable by themselves refer
+to constant and variable views of objects.
14
-The value of an object is read when the value of any part of the object
-is evaluated, or when the value of an enclosing object is evaluated. The
-value of a variable is updated when an assignment is performed to any
-part of the variable, or when an assignment is performed to an enclosing
-object.
+The value of an object is <read> when the value of any part of the
+object is evaluated, or when the value of an enclosing object is
+evaluated. The value of a variable is <updated> when an assignment is
+performed to any part of the variable, or when an assignment is
+performed to an enclosing object.
14.a
Ramification: Reading and updating are intended to include
@@ -7057,7 +7065,7 @@ constants:
constant;
16.a/2
- To be honest: {AI95-00385-01AI95-00385-01} We mean the word
+ To be honest: {<AI95-00385-01AI95-00385-01>} We mean the word
constant as defined by the grammar for object_declaration, not
some random word constant. Thus,
@@ -7074,29 +7082,29 @@ constants:
* a discriminant;
18.1/3
- * {AI05-0262-1AI05-0262-1} a loop parameter unless specified to be a
- variable for a generalized loop (see *note 5.5.2::);
+ * {<AI05-0262-1AI05-0262-1>} a loop parameter unless specified to be
+ a variable for a generalized loop (see *note 5.5.2::);
19/3
- * {AI05-0262-1AI05-0262-1} a choice parameter or entry index;
+ * {<AI05-0262-1AI05-0262-1>} a choice parameter or entry index;
20
* the dereference of an access-to-constant value;
20.1/3
- * {AI05-0015-1AI05-0015-1} the return object declared by an
+ * {<AI05-0015-1AI05-0015-1>} the return object declared by an
extended_return_statement with the reserved word constant;
21/3
- * {AI05-0015-1AI05-0015-1} the object denoted by a function_call or
+ * {<AI05-0015-1AI05-0015-1>} the object denoted by a function_call or
an aggregate;
21.1/3
- * {AI05-0003-1AI05-0003-1} the result of evaluating a
+ * {<AI05-0003-1AI05-0003-1>} the result of evaluating a
qualified_expression;
21.2/3
- * {AI05-0120-1AI05-0120-1} within the body of a protected function
+ * {<AI05-0120-1AI05-0120-1>} within the body of a protected function
(or a function declared immediately within a protected_body), the
current instance of the enclosing protected unit;
@@ -7105,14 +7113,14 @@ constants:
of a constant.
23/3
-{AI05-0264-1AI05-0264-1} At the place where a view of an object is
-defined, a nominal subtype is associated with the view. The object's
-actual subtype (that is, its subtype) can be more restrictive than the
+{<AI05-0264-1AI05-0264-1>} At the place where a view of an object is
+defined, a <nominal subtype> is associated with the view. The object's
+<actual subtype> (that is, its subtype) can be more restrictive than the
nominal subtype of the view; it always is if the nominal subtype is an
-indefinite subtype. A subtype is an indefinite subtype if it is an
+<indefinite subtype>. A subtype is an indefinite subtype if it is an
unconstrained array subtype, or if it has unknown discriminants or
unconstrained discriminants without defaults (see *note 3.7::);
-otherwise, the subtype is a definite subtype [(all elementary subtypes
+otherwise, the subtype is a <definite> subtype [(all elementary subtypes
are definite subtypes)]. [A class-wide subtype is defined to have
unknown discriminants, and is therefore an indefinite subtype. An
indefinite subtype does not by itself provide enough information to
@@ -7121,8 +7129,8 @@ expression is necessary (see *note 3.3.1::). A component
cannot have an
indefinite nominal subtype.]
23.1/3
-{AI05-0008-1AI05-0008-1} A view of a composite object is known to be
-constrained if:
+{<AI05-0008-1AI05-0008-1>} A view of a composite object is <known to be
+constrained> if:
23.2/3
* its nominal subtype is constrained, and is not an untagged partial
@@ -7132,7 +7140,7 @@ constrained if:
* its nominal subtype is indefinite; or
23.4/3
- * {AI05-0008-1AI05-0008-1} {AI05-0093-1AI05-0093-1} its type is
+ * {<AI05-0008-1AI05-0008-1>} {<AI05-0093-1AI05-0093-1>} its type is
immutably limited (see *note 7.5::); or
23.5/3
@@ -7151,7 +7159,7 @@ constrained if:
extended_return_statement; or
23.9/3
- * {AI05-0008-1AI05-0008-1} {AI05-0041-1AI05-0041-1} it is a
+ * {<AI05-0008-1AI05-0008-1>} {<AI05-0041-1AI05-0041-1>} it is a
dereference of a pool-specific access type, and there is no
ancestor of its type that has a constrained partial view.
@@ -7163,18 +7171,18 @@ constrained if:
be a constant).
23.b/3
- {AI05-0005-1AI05-0005-1} {AI05-0008-1AI05-0008-1} There are
- other cases that could have been included in this definition
- (view conversions, the current instance of a type, objects of
- a formal discriminated private type), but these are not
- relevant to the places this term is used, so they were not
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0008-1AI05-0008-1>} There
+ are other cases that could have been included in this
+ definition (view conversions, the current instance of a type,
+ objects of a formal discriminated private type), but these are
+ not relevant to the places this term is used, so they were not
included. If this term is used in additional places, the
definition should be checked to see if any of these additional
cases are relevant and appropriate wording added if necessary.
23.10/3
-{AI05-0008-1AI05-0008-1} {AI05-0041-1AI05-0041-1} For the purposes of
-determining within a generic body whether an object is known to be
+{<AI05-0008-1AI05-0008-1>} {<AI05-0041-1AI05-0041-1>} For the purposes
+of determining within a generic body whether an object is known to be
constrained:
23.11/3
@@ -7188,7 +7196,7 @@ constrained:
considered pool-specific.
24
-A named number provides a name for a numeric value known at compile
+A <named number> provides a name for a numeric value known at compile
time. It is declared by a number_declaration.
NOTES
@@ -7199,14 +7207,14 @@ time. It is declared by a number_declaration.
and finalization, if any.
25.1/3
- 11 {AI05-0054-2AI05-0054-2} The value of a constant object cannot
- be changed after its initialization, except in some cases where the
- object has a controlled or immutably limited part (see *note 7.5::,
- *note 7.6::, and *note 13.9.1::).
+ 11 {<AI05-0054-2AI05-0054-2>} The value of a constant object
+ cannot be changed after its initialization, except in some cases
+ where the object has a controlled or immutably limited part (see
+ *note 7.5::, *note 7.6::, and *note 13.9.1::).
26/3
- 12 {AI05-0264-1AI05-0264-1} The nominal and actual subtypes of an
- elementary object are always the same. For a discriminated or
+ 12 {<AI05-0264-1AI05-0264-1>} The nominal and actual subtypes of
+ an elementary object are always the same. For a discriminated or
array object, if the nominal subtype is constrained, then so is the
actual subtype.
@@ -7227,7 +7235,7 @@ time. It is declared by a number_declaration.
_Wording Changes from Ada 83_
26.c/3
- {AI05-0299-1AI05-0299-1} This subclause now follows the
+ {<AI05-0299-1AI05-0299-1>} This subclause now follows the
subclauses on types and subtypes, to cut down on the number of
forward references.
@@ -7264,42 +7272,43 @@ time. It is declared by a number_declaration.
_Wording Changes from Ada 95_
26.i/2
- {AI95-00416-01AI95-00416-01} Clarified that the return object
- is the object created by a function call.
+ {<AI95-00416-01AI95-00416-01>} Clarified that the return
+ object is the object created by a function call.
_Extensions to Ada 2005_
26.j/3
- {AI05-0015-1AI05-0015-1} Added wording to allow return objects
- to be declared as constants, and corrected the definition of
- return objects as objects.
+ {<AI05-0015-1AI05-0015-1>} Added wording to allow return
+ objects to be declared as constants, and corrected the
+ definition of return objects as objects.
_Wording Changes from Ada 2005_
26.k/3
- {AI05-0008-1AI05-0008-1} {AI05-0041-1AI05-0041-1}
- {AI05-0093-1AI05-0093-1} Correction: Added a definition of
- known to be constrained, for use in other rules.
+ {<AI05-0008-1AI05-0008-1>} {<AI05-0041-1AI05-0041-1>}
+ {<AI05-0093-1AI05-0093-1>} Correction: Added a definition of
+ <known to be constrained>, for use in other rules.
26.l/3
- {AI05-0054-2AI05-0054-2} Correction: We now recognize the fact
- that not all declared constant objects are immutable; for
+ {<AI05-0054-2AI05-0054-2>} Correction: We now recognize the
+ fact that not all declared constant objects are immutable; for
those that a variable view can be constructed, they can be
changed via that view.
26.m/3
- {AI05-0120-1AI05-0120-1} Correction: Added the current
+ {<AI05-0120-1AI05-0120-1>} Correction: Added the current
instance of a protected object to the list of constant views;
since the list claims to include all possibilities, it had
better include that one.
26.n/3
- {AI05-0003-1AI05-0003-1} The result of a qualified_expression
- is defined to be a constant view and is defined to be an
- object if the operand of the qualified_expression is an
- object. These definitions, combined with some grammar
- changes, allow qualified_expressions to be used in more
- places. See *note 4.1:: for details.
+ {<AI05-0003-1AI05-0003-1>} The result of a
+ qualified_expression is defined to be a constant view and is
+ defined to be an object if the operand of the
+ qualified_expression is an object. These definitions,
+ combined with some grammar changes, allow
+ qualified_expressions to be used in more places. See *note
+ 4.1:: for details.
* Menu:
@@ -7313,17 +7322,17 @@ File: aarm2012.info, Node: 3.3.1, Next: 3.3.2, Up:
3.3
-------------------------
1/3
-{AI05-0262-1AI05-0262-1} An object_declaration declares a stand-alone
-object with a given nominal subtype and, optionally, an explicit initial
-value given by an initialization expression. For an array, access, task,
-or protected object, the object_declaration may include the definition
-of the (anonymous) type of the object.
+{<AI05-0262-1AI05-0262-1>} An object_declaration declares a
+<stand-alone> object with a given nominal subtype and, optionally, an
+explicit initial value given by an initialization expression. For an
+array, access, task, or protected object, the object_declaration may
+include the definition of the (anonymous) type of the object.
_Syntax_
2/3
- {AI95-00385-01AI95-00385-01} {AI95-00406-01AI95-00406-01}
- {AI05-0183-1AI05-0183-1} object_declaration ::=
+ {<AI95-00385-01AI95-00385-01>} {<AI95-00406-01AI95-00406-01>}
+ {<AI05-0183-1AI05-0183-1>} object_declaration ::=
defining_identifier_list : [aliased] [constant]
subtype_indication [:= expression]
[aspect_specification];
@@ -7345,26 +7354,26 @@ of the (anonymous) type of the object.
4
For an object_declaration with an expression following the compound
delimiter :=, the type expected for the expression is that of the
-object. This expression is called the initialization expression.
+object. This expression is called the <initialization expression>.
_Legality Rules_
5/2
-{AI95-00287-01AI95-00287-01} An object_declaration without the reserved
-word constant declares a variable object. If it has a
+{<AI95-00287-01AI95-00287-01>} An object_declaration without the
+reserved word constant declares a variable object. If it has a
subtype_indication or an array_type_definition that defines an
indefinite subtype, then there shall be an initialization expression.
_Static Semantics_
6/3
-{AI05-0264-1AI05-0264-1} {AI05-0299-1AI05-0299-1} An object_declaration
-with the reserved word constant declares a constant object. If it has an
-initialization expression, then it is called a full constant
-declaration. Otherwise, it is called a deferred constant declaration.
-The rules for deferred constant declarations are given in subclause
-*note 7.4::. The rules for full constant declarations are given in this
-subclause.
+{<AI05-0264-1AI05-0264-1>} {<AI05-0299-1AI05-0299-1>} An
+object_declaration with the reserved word constant declares a constant
+object. If it has an initialization expression, then it is called a
+<full constant declaration>. Otherwise, it is called a <deferred
+constant declaration>. The rules for deferred constant declarations are
+given in subclause *note 7.4::. The rules for full constant
+declarations are given in this subclause.
7
Any declaration that includes a defining_identifier_list with more than
@@ -7376,22 +7385,22 @@ Standard relies on this equivalence; explanations are
given for
declarations with a single defining_identifier.
8/2
-{AI95-00385-01AI95-00385-01} The subtype_indication, access_definition,
-or full type definition of an object_declaration defines the nominal
-subtype of the object. The object_declaration declares an object of the
-type of the nominal subtype.
+{<AI95-00385-01AI95-00385-01>} The subtype_indication,
+access_definition, or full type definition of an object_declaration
+defines the nominal subtype of the object. The object_declaration
+declares an object of the type of the nominal subtype.
8.a/2
- Discussion: {AI95-00385-01AI95-00385-01} The phrase "full type
- definition" here includes the case of an anonymous array,
+ Discussion: {<AI95-00385-01AI95-00385-01>} The phrase "full
+ type definition" here includes the case of an anonymous array,
access, task, or protected type.
8.1/2
-{AI95-00373-01AI95-00373-01} A component of an object is said to require
-late initialization if it has an access discriminant value constrained
-by a per-object expression, or if it has an initialization expression
-that includes a name denoting the current instance of the type or
-denoting an access discriminant.
+{<AI95-00373-01AI95-00373-01>} A component of an object is said to
+<require late initialization> if it has an access discriminant value
+constrained by a per-object expression, or if it has an initialization
+expression that includes a name denoting the current instance of the
+type or denoting an access discriminant.
8.b/2
Reason: Such components can depend on the values of other
@@ -7401,27 +7410,27 @@ denoting an access discriminant.
_Dynamic Semantics_
9/2
-{AI95-00363-01AI95-00363-01} If a composite object declared by an
+{<AI95-00363-01AI95-00363-01>} If a composite object declared by an
object_declaration has an unconstrained nominal subtype, then if this
subtype is indefinite or the object is constant the actual subtype of
this object is constrained. The constraint is determined by the bounds
or discriminants (if any) of its initial value; the object is said to be
-constrained by its initial value. When not constrained by its initial
-value, the actual and nominal subtypes of the object are the same. If
-its actual subtype is constrained, the object is called a constrained
-object.
+<constrained by its initial value>. When not constrained by its initial
+value, the actual and nominal subtypes of the object are the same. If
+its actual subtype is constrained, the object is called a <constrained
+object>.
10
For an object_declaration without an initialization expression, any
initial values for the object or its subcomponents are determined by the
-implicit initial values defined for its nominal subtype, as follows:
+<implicit initial values> defined for its nominal subtype, as follows:
11
* The implicit initial value for an access subtype is the null value
of the access type.
11.1/3
- * {AI05-0228-1AI05-0228-1} The implicit initial value for a scalar
+ * {<AI05-0228-1AI05-0228-1>} The implicit initial value for a scalar
subtype that has the Default_Value aspect specified is the value of
that aspect converted to the nominal subtype (which might raise
Constraint_Error -- see *note 4.6::, "*note 4.6:: Type
@@ -7439,13 +7448,13 @@ implicit initial values defined for its nominal
subtype, as follows:
constrained discriminated subtype is defined by the subtype.
13/3
- * {AI05-0228-1AI05-0228-1} For a (definite) composite subtype, the
+ * {<AI05-0228-1AI05-0228-1>} For a (definite) composite subtype, the
implicit initial value of each component with a default_expression
is obtained by evaluation of this expression and conversion to the
component's nominal subtype (which might raise Constraint_Error),
unless the component is a discriminant of a constrained subtype
(the previous case), or is in an excluded variant (see *note
- 3.8.1::). For each component that does not have a
+ 3.8.1::). For each component that does not have a
default_expression, if the composite subtype has the
Default_Component_Value aspect specified, the implicit initial
value is the value of that aspect converted to the component's
@@ -7470,7 +7479,7 @@ The elaboration of an object_declaration proceeds in the
following
sequence of steps:
16/2
- 1. {AI95-00385-01AI95-00385-01} The subtype_indication (*note
+ 1. {<AI95-00385-01AI95-00385-01>} The subtype_indication (*note
3.2.2: S0027.), access_definition (*note 3.10: S0084.),
array_type_definition (*note 3.6: S0051.), single_task_declaration
(*note 9.1: S0206.), or single_protected_declaration (*note 9.4:
@@ -7481,19 +7490,19 @@ sequence of steps:
2. If the object_declaration includes an initialization
expression, the (explicit) initial value is obtained by evaluating
the expression and converting it to the nominal subtype (which
- might raise Constraint_Error -- see *note 4.6::).
+ might raise Constraint_Error -- see *note 4.6::).
18/2
- 3. {8652/00028652/0002} {AI95-00171-01AI95-00171-01}
- {AI95-00373-01AI95-00373-01} The object is created, and, if there
- is not an initialization expression, the object is initialized by
- default. When an object is initialized by default, any per-object
+ 3. {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ {<AI95-00373-01AI95-00373-01>} The object is created, and, if there
+ is not an initialization expression, the object is <initialized by
+ default>. When an object is initialized by default, any per-object
constraints (see *note 3.8::) are elaborated and any implicit
initial values for the object or for its subcomponents are obtained
- as determined by the nominal subtype. Any initial values (whether
+ as determined by the nominal subtype. Any initial values (whether
explicit or implicit) are assigned to the object or to the
corresponding subcomponents. As described in *note 5.2:: and *note
- 7.6::, Initialize and Adjust procedures can be called.
+ 7.6::, Initialize and Adjust procedures can be called.
18.a
Discussion: For a per-object constraint that contains some
@@ -7520,7 +7529,7 @@ sequence of steps:
known early, since this optimization is semantically neutral.
19/2
- This paragraph was deleted.{AI95-00373-01AI95-00373-01}
+ <This paragraph was deleted.>{<AI95-00373-01AI95-00373-01>}
19.a
Ramification: Since the initial values have already been
@@ -7531,12 +7540,12 @@ sequence of steps:
*note 3.5::.
20/2
-{AI95-00373-01AI95-00373-01} For the third step above, evaluations and
+{<AI95-00373-01AI95-00373-01>} For the third step above, evaluations and
assignments are performed in an arbitrary order subject to the following
restrictions:
20.1/2
- * {AI95-00373-01AI95-00373-01} Assignment to any part of the object
+ * {<AI95-00373-01AI95-00373-01>} Assignment to any part of the object
is preceded by the evaluation of the value that is to be assigned.
20.a.1/2
@@ -7547,9 +7556,9 @@ restrictions:
code it wants.
20.2/2
- * {AI95-00373-01AI95-00373-01} The evaluation of a default_expression
- that includes the name of a discriminant is preceded by the
- assignment to that discriminant.
+ * {<AI95-00373-01AI95-00373-01>} The evaluation of a
+ default_expression that includes the name of a discriminant is
+ preceded by the assignment to that discriminant.
20.a.2/2
Reason: Duh again. But we have to say this, too. It's odd
@@ -7558,7 +7567,7 @@ restrictions:
about discriminant values that come from subtype_indications.
20.3/2
- * {AI95-00373-01AI95-00373-01} The evaluation of the
+ * {<AI95-00373-01AI95-00373-01>} The evaluation of the
default_expression for any component that depends on a discriminant
is preceded by the assignment to that discriminant.
@@ -7579,7 +7588,7 @@ restrictions:
that F be evaluated before the aggregate.
20.4/3
- * {AI95-00373-01AI95-00373-01} {AI05-0092-1AI05-0092-1} The
+ * {<AI95-00373-01AI95-00373-01>} {<AI05-0092-1AI05-0092-1>} The
assignments to any components, including implicit components, not
requiring late initialization precede the initial value evaluations
for any components requiring late initialization; if two components
@@ -7623,9 +7632,9 @@ restrictions:
execution to be erroneous.
21/3
-{AI05-0228-1AI05-0228-1} [There is no implicit initial value defined for
-a scalar subtype unless the Default_Value aspect has been specified for
-the type.] In the absence of an explicit initialization or the
+{<AI05-0228-1AI05-0228-1>} [There is no implicit initial value defined
+for a scalar subtype unless the Default_Value aspect has been specified
+for the type.] In the absence of an explicit initialization or the
specification of the Default_Value aspect, a newly created scalar object
might have a value that does not belong to its subtype (see *note
13.9.1:: and *note H.1::).
@@ -7658,8 +7667,8 @@ might have a value that does not belong to its subtype
(see *note
explicit initial value is required.
23/3
- 14 {AI05-0092-1AI05-0092-1} {AI05-0255-1AI05-0255-1} As indicated
- above, a stand-alone object is an object declared by an
+ 14 {<AI05-0092-1AI05-0092-1>} {<AI05-0255-1AI05-0255-1>} As
+ indicated above, a stand-alone object is an object declared by an
object_declaration. Similar definitions apply to "stand-alone
constant" and "stand-alone variable." A subcomponent of an object
is not a stand-alone object, nor is an object that is created by an
@@ -7676,26 +7685,26 @@ might have a value that does not belong to its subtype
(see *note
_Examples_
25
-Example of a multiple object declaration:
+<Example of a multiple object declaration:>
26
- -- the multiple object declaration
+ --< the multiple object declaration >
27/2
- {AI95-00433-01AI95-00433-01} John, Paul : not null Person_Name := new
Person(Sex => M); -- see *note 3.10.1::
+ {<AI95-00433-01AI95-00433-01>} John, Paul : not null Person_Name := new
Person(Sex => M); --< see *note 3.10.1::>
28
- -- is equivalent to the two single object declarations in the order given
+ --< is equivalent to the two single object declarations in the order
given>
29/2
- {AI95-00433-01AI95-00433-01} John : not null Person_Name := new
Person(Sex => M);
+ {<AI95-00433-01AI95-00433-01>} John : not null Person_Name := new
Person(Sex => M);
Paul : not null Person_Name := new Person(Sex => M);
30
-Examples of variable declarations:
+<Examples of variable declarations:>
31/2
- {AI95-00433-01AI95-00433-01} Count, Sum : Integer;
+ {<AI95-00433-01AI95-00433-01>} Count, Sum : Integer;
Size : Integer range 0 .. 10_000 := 0;
Sorted : Boolean := False;
Color_Table : array(1 .. Max) of Color;
@@ -7704,13 +7713,13 @@ Examples of variable declarations:
[Unicode 952], [Unicode 966] : Float range -PI .. +PI;
32
-Examples of constant declarations:
+<Examples of constant declarations:>
33/2
- {AI95-00433-01AI95-00433-01} Limit : constant Integer := 10_000;
+ {<AI95-00433-01AI95-00433-01>} Limit : constant Integer := 10_000;
Low_Limit : constant Integer := Limit/10;
Tolerance : constant Real := Dispersion(1.15);
- Hello_Msg : constant access String := Hello'Access; -- see *note 3.10.2::
+ Hello_Msg : constant access String := Hello'Access; --< see *note
3.10.2::>
_Extensions to Ada 83_
@@ -7759,8 +7768,8 @@ Examples of constant declarations:
_Inconsistencies With Ada 95_
33.f/2
- {AI95-00363-01AI95-00363-01} Unconstrained aliased objects of
- types with discriminants with defaults are no longer
+ {<AI95-00363-01AI95-00363-01>} Unconstrained aliased objects
+ of types with discriminants with defaults are no longer
constrained by their initial values. This means that a
program that raised Constraint_Error from an attempt to change
the discriminants will no longer do so. The change only
@@ -7775,42 +7784,42 @@ Examples of constant declarations:
_Extensions to Ada 95_
33.g/2
- {AI95-00287-01AI95-00287-01} A constant may have a limited
+ {<AI95-00287-01AI95-00287-01>} A constant may have a limited
type; the initialization expression has to be built-in-place
(see *note 7.5::).
33.h/2
- {AI95-00385-01AI95-00385-01} {AI95-00406-01AI95-00406-01} A
- stand-alone object may have an anonymous access type.
+ {<AI95-00385-01AI95-00385-01>} {<AI95-00406-01AI95-00406-01>}
+ A stand-alone object may have an anonymous access type.
_Wording Changes from Ada 95_
33.i/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Corrected wording to say that per-object constraints are
- elaborated (not evaluated).
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Corrected wording to say that per-object
+ constraints are elaborated (not evaluated).
33.j/2
- {AI95-00373-01AI95-00373-01} The rules for evaluating default
- initialization have been tightened. In particular, components
- whose default initialization can refer to the rest of the
- object are required to be initialized last.
+ {<AI95-00373-01AI95-00373-01>} The rules for evaluating
+ default initialization have been tightened. In particular,
+ components whose default initialization can refer to the rest
+ of the object are required to be initialized last.
33.k/2
- {AI95-00433-01AI95-00433-01} Added examples of various new
+ {<AI95-00433-01AI95-00433-01>} Added examples of various new
constructs.
_Extensions to Ada 2005_
33.l/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in an object_declaration. This is described in *note
- 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in an object_declaration. This is described in
+ *note 13.1.1::.
_Wording Changes from Ada 2005_
33.m/3
- {AI05-0228-1AI05-0228-1} Implicit initial values can now be
+ {<AI05-0228-1AI05-0228-1>} Implicit initial values can now be
given for scalar types and for scalar array components, using
the Default_Value (see *note 3.5::) and
Default_Component_Value (see *note 3.6::) aspects; the
@@ -7826,44 +7835,44 @@ File: aarm2012.info, Node: 3.3.2, Prev: 3.3.1, Up:
3.3
A number_declaration declares a named number.
1.a/3
- Discussion: {AI05-0299-1AI05-0299-1} If a value or other
- property of a construct is required to be static that means it
- is required to be determined prior to execution. A static
- expression is an expression whose value is computed at compile
- time and is usable in contexts where the actual value might
- affect the legality of the construct. This is fully defined
- in subclause *note 4.9::.
+ Discussion: {<AI05-0299-1AI05-0299-1>} If a value or other
+ property of a construct is required to be <static> that means
+ it is required to be determined prior to execution. A
+ <static> expression is an expression whose value is computed
+ at compile time and is usable in contexts where the actual
+ value might affect the legality of the construct. This is
+ fully defined in subclause *note 4.9::.
_Syntax_
2
number_declaration ::=
- defining_identifier_list : constant := static_expression;
+ defining_identifier_list : constant := <static_>expression;
_Name Resolution Rules_
3
-The static_expression given for a number_declaration is expected to be
+The <static_>expression given for a number_declaration is expected to be
of any numeric type.
_Legality Rules_
4/3
-{AI05-0299-1AI05-0299-1} The static_expression given for a number
+{<AI05-0299-1AI05-0299-1>} The <static_>expression given for a number
declaration shall be a static expression, as defined by subclause *note
4.9::.
_Static Semantics_
5
-The named number denotes a value of type universal_integer if the type
-of the static_expression is an integer type. The named number denotes a
-value of type universal_real if the type of the static_expression is a
-real type.
+The named number denotes a value of type <universal_integer> if the type
+of the <static_>expression is an integer type. The named number denotes
+a value of type <universal_real> if the type of the <static_>expression
+is a real type.
6
The value denoted by the named number is the value of the
-static_expression, converted to the corresponding universal type.
+<static_>expression, converted to the corresponding universal type.
_Dynamic Semantics_
@@ -7871,22 +7880,22 @@ static_expression, converted to the corresponding
universal type.
The elaboration of a number_declaration has no effect.
7.a
- Proof: Since the static_expression was evaluated at compile
+ Proof: Since the <static_>expression was evaluated at compile
time.
_Examples_
8
-Examples of number declarations:
+<Examples of number declarations:>
9
- Two_Pi : constant := 2.0*Ada.Numerics.Pi; -- a real number (see
*note A.5::)
+ Two_Pi : constant := 2.0*Ada.Numerics.Pi; --< a real number (see
*note A.5::)>
10/2
- {AI95-00433-01AI95-00433-01} Max : constant := 500;
-- an integer number
- Max_Line_Size : constant := Max/6; -- the integer 83
- Power_16 : constant := 2**16; -- the integer 65_536
- One, Un, Eins : constant := 1; -- three different
names for 1
+ {<AI95-00433-01AI95-00433-01>} Max : constant := 500;
--< an integer number>
+ Max_Line_Size : constant := Max/6; --< the integer 83>
+ Power_16 : constant := 2**16; --< the integer 65_536>
+ One, Un, Eins : constant := 1; --< three different
names for 1>
_Extensions to Ada 83_
@@ -7918,10 +7927,10 @@ File: aarm2012.info, Node: 3.4, Next: 3.5, Prev:
3.3, Up: 3
=============================
1/2
-{AI95-00401-01AI95-00401-01} {AI95-00419-01AI95-00419-01} A
-derived_type_definition defines a derived type (and its first subtype)
-whose characteristics are derived from those of a parent type, and
-possibly from progenitor types.
+{<AI95-00401-01AI95-00401-01>} {<AI95-00419-01AI95-00419-01>} A
+derived_type_definition defines a <derived type> (and its first subtype)
+whose characteristics are <derived> from those of a parent type, and
+possibly from progenitor types.
1.a/2
Glossary entry: A derived type is a type defined in terms of
@@ -7935,12 +7944,12 @@ possibly from progenitor types.
(directly or indirectly) form a derivation class.
1.1/2
-{AI95-00442-01AI95-00442-01} A class of types is a set of types that is
-closed under derivation; that is, if the parent or a progenitor type of
-a derived type belongs to a class, then so does the derived type. By
+{<AI95-00442-01AI95-00442-01>} A <class of types> is a set of types that
+is closed under derivation; that is, if the parent or a progenitor type
+of a derived type belongs to a class, then so does the derived type. By
saying that a particular group of types forms a class, we are saying
that all derivatives of a type in the set inherit the characteristics
-that define that set. The more general term category of types is used
+that define that set. The more general term <category of types> is used
for a set of types whose defining characteristics are not necessarily
inherited by derivatives; for example, limited, abstract, and interface
are all categories of types, but not classes of types.
@@ -7951,19 +7960,19 @@ are all categories of types, but not classes of types.
_Syntax_
2/2
- {AI95-00251-01AI95-00251-01} {AI95-00419-01AI95-00419-01}
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00419-01AI95-00419-01>}
derived_type_definition ::=
- [abstract] [limited] new parent_subtype_indication [[and
+ [abstract] [limited] new <parent_>subtype_indication [[and
interface_list] record_extension_part]
_Legality Rules_
3/2
-{AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01}
-{AI95-00419-01AI95-00419-01} The parent_subtype_indication defines the
-parent subtype; its type is the parent type. The interface_list defines
-the progenitor types (see *note 3.9.4::). A derived type has one parent
-type and zero or more progenitor types.
+{<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+{<AI95-00419-01AI95-00419-01>} The <parent_>subtype_indication defines
+the <parent subtype>; its type is the <parent type>. The interface_list
+defines the progenitor types (see *note 3.9.4::). A derived type has
+one parent type and zero or more progenitor types.
3.a/2
Glossary entry: The parent of a derived type is the first type
@@ -7992,17 +8001,17 @@ have to precede the derived_type_definition.]
subsequently became nonlimited.
5/2
-{AI95-00401-01AI95-00401-01} If there is a record_extension_part, the
-derived type is called a record extension of the parent type. A
+{<AI95-00401-01AI95-00401-01>} If there is a record_extension_part, the
+derived type is called a <record extension> of the parent type. A
record_extension_part shall be provided if and only if the parent type
is a tagged type. [An interface_list shall be provided only if the
parent type is a tagged type.]
5.a.1/2
- Proof: {AI95-00401-01AI95-00401-01} The syntax only allows an
- interface_list to appear with a record_extension_part, and a
- record_extension_part can only be provided if the parent type
- is a tagged type. We give the last sentence anyway for
+ Proof: {<AI95-00401-01AI95-00401-01>} The syntax only allows
+ an interface_list to appear with a record_extension_part, and
+ a record_extension_part can only be provided if the parent
+ type is a tagged type. We give the last sentence anyway for
completeness.
5.a
@@ -8016,9 +8025,10 @@ parent type is a tagged type.]
association list.
5.b/2
- Ramification: {AI95-00114-01AI95-00114-01} This rule needs to
- be rechecked in the visible part of an instance of a generic
- unit because of the "only if" part of the rule. For example:
+ Ramification: {<AI95-00114-01AI95-00114-01>} This rule needs
+ to be rechecked in the visible part of an instance of a
+ generic unit because of the "only if" part of the rule. For
+ example:
5.c/2
generic
@@ -8028,10 +8038,10 @@ parent type is a tagged type.]
end P;
5.d/2
- package I is new P (Some_Tagged_Type); -- illegal
+ package I is new P (Some_Tagged_Type); -- <illegal>
5.e/2
- {AI95-00114-01AI95-00114-01} The instantiation is illegal
+ {<AI95-00114-01AI95-00114-01>} The instantiation is illegal
because a tagged type is being extended in the visible part
without a record_extension_part. Note that this is legal in
the private part or body of an instance, both to avoid a
@@ -8046,18 +8056,18 @@ parent type is a tagged type.]
is illegal).
5.1/3
-{AI95-00419-01AI95-00419-01} {AI05-0096-1AI05-0096-1} If the reserved
-word limited appears in a derived_type_definition, the parent type shall
-be a limited type. If the parent type is a tagged formal type, then in
-addition to the places where Legality Rules normally apply (see *note
-12.3::), this rule applies also in the private part of an instance of a
-generic unit.
+{<AI95-00419-01AI95-00419-01>} {<AI05-0096-1AI05-0096-1>} If the
+reserved word limited appears in a derived_type_definition, the parent
+type shall be a limited type. If the parent type is a tagged formal
+type, then in addition to the places where Legality Rules normally apply
+(see *note 12.3::), this rule applies also in the private part of an
+instance of a generic unit.
5.g/2
Reason: We allow limited because we don't inherit limitedness
from interfaces, so we must have a way to derive a limited
type from interfaces. The word limited has to be legal when
- the parent could be an interface, and that includes generic
+ the parent <could be> an interface, and that includes generic
formal abstract types. Since we have to allow it in this
case, we might as well allow it everywhere as documentation,
to make it explicit that the type is limited.
@@ -8088,8 +8098,8 @@ generic unit.
6
The first subtype of the derived type is unconstrained if a
known_discriminant_part is provided in the declaration of the derived
-type, or if the parent subtype is unconstrained. Otherwise, the
-constraint of the first subtype corresponds to that of the parent
+type, or if the parent subtype is unconstrained. Otherwise, the
+constraint of the first subtype <corresponds> to that of the parent
subtype in the following sense: it is the same as that of the parent
subtype except that for a range constraint (implicit or explicit), the
value of each bound of its range is replaced by the corresponding value
@@ -8102,25 +8112,25 @@ of the derived type.
3.5.9::, "*note 3.5.9:: Fixed Point Types".
6.1/2
-{AI95-00231-01AI95-00231-01} The first subtype of the derived type
+{<AI95-00231-01AI95-00231-01>} The first subtype of the derived type
excludes null (see *note 3.10::) if and only if the parent subtype
excludes null.
7/3
-{AI05-0110-1AI05-0110-1} The characteristics and implicitly declared
+{<AI05-0110-1AI05-0110-1>} The <characteristics> and implicitly declared
primitive subprograms of the derived type are defined as follows:
7.a/3
- Ramification: {AI05-0110-1AI05-0110-1} The characteristics of
- a type do not include its primitive subprograms (primitive
+ Ramification: {<AI05-0110-1AI05-0110-1>} The characteristics
+ of a type do not include its primitive subprograms (primitive
subprograms include predefined operators). The rules
governing availability/visibility and inheritance of
characteristics are separate from those for primitive
subprograms.
8/2
- * {AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01}
- {AI95-00442-01AI95-00442-01} [If the parent type or a progenitor
+ * {<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+ {<AI95-00442-01AI95-00442-01>} [If the parent type or a progenitor
type belongs to a class of types, then the derived type also
belongs to that class.] The following sets of types, as well as
any higher-level sets composed from them, are classes in this
@@ -8167,16 +8177,16 @@ primitive subprograms of the derived type are defined
as follows:
known_discriminant_part, if there is one; otherwise, each
discriminant of the parent type (implicitly declared in
the same order with the same specifications) -- in the
- latter case, the discriminants are said to be inherited,
- or if unknown in the parent, are also unknown in the
- derived type;
+ latter case, the discriminants are said to be
+ <inherited>, or if unknown in the parent, are also
+ unknown in the derived type;
12
* Each nondiscriminant component, entry, and protected
subprogram of the parent type, implicitly declared in the
same order with the same declarations; these components,
entries, and protected subprograms are said to be
- inherited;
+ <inherited>;
12.a
Ramification: The profiles of entries and protected
@@ -8206,10 +8216,11 @@ primitive subprograms of the derived type are defined
as follows:
14.b
Ramification: In most cases, these things are implicitly
- declared immediately following the parent subtype_indication.
- However, *note 7.3.1::, "*note 7.3.1:: Private Operations"
- defines some cases in which they are implicitly declared
- later, and some cases in which the are not declared at all.
+ declared <immediately> following the parent
+ subtype_indication. However, *note 7.3.1::, "*note 7.3.1::
+ Private Operations" defines some cases in which they are
+ implicitly declared later, and some cases in which the are not
+ declared at all.
14.c
Discussion: The place of the implicit declarations of
@@ -8223,7 +8234,7 @@ primitive subprograms of the derived type are defined as
follows:
parent type.
15/2
- * This paragraph was deleted.{AI95-00419-01AI95-00419-01}
+ * <This paragraph was deleted.>{<AI95-00419-01AI95-00419-01>}
16
* [For each predefined operator of the parent type, there is a
@@ -8252,12 +8263,12 @@ primitive subprograms of the derived type are defined
as follows:
subprograms.
17/2
- * {AI95-00401-01AI95-00401-01} For each user-defined primitive
+ * {<AI95-00401-01AI95-00401-01>} For each user-defined primitive
subprogram (other than a user-defined equality operator -- see
below) of the parent type or of a progenitor type that already
exists at the place of the derived_type_definition, there exists a
- corresponding inherited primitive subprogram of the derived type
- with the same defining name. Primitive user-defined equality
+ corresponding <inherited> primitive subprogram of the derived type
+ with the same defining name. Primitive user-defined equality
operators of the parent type and any progenitor types are also
inherited by the derived type, except when the derived type is a
nonlimited record extension, and the inherited operator would have
@@ -8265,7 +8276,7 @@ primitive subprograms of the derived type are defined as
follows:
corresponding predefined equality operator; in this case, the
user-defined equality operator is not inherited, but is rather
incorporated into the implementation of the predefined equality
- operator of the record extension (see *note 4.5.2::).
+ operator of the record extension (see *note 4.5.2::).
17.a
Ramification: We say "...already exists..." rather than "is
@@ -8293,7 +8304,7 @@ primitive subprograms of the derived type are defined as
follows:
predefined equality operator to take its place.
17.d/2
- Ramification: {AI95-00114-01AI95-00114-01} Because
+ Ramification: {<AI95-00114-01AI95-00114-01>} Because
user-defined equality operators are not inherited by
nonlimited record extensions, the formal parameter names of =
and /= revert to Left and Right, even if different formal
@@ -8301,21 +8312,21 @@ primitive subprograms of the derived type are defined
as follows:
operators of the parent type.
17.e/2
- Discussion: {AI95-00401-01AI95-00401-01} This rule only
+ Discussion: {<AI95-00401-01AI95-00401-01>} This rule only
describes what operations are inherited; the rules that
describe what happens when there are conflicting inherited
subprograms are found in *note 8.3::.
18/3
- {AI95-00401-01AI95-00401-01} {AI05-0164-1AI05-0164-1}
- {AI05-0240-1AI05-0240-1} The profile of an inherited subprogram
+ {<AI95-00401-01AI95-00401-01>} {<AI05-0164-1AI05-0164-1>}
+ {<AI05-0240-1AI05-0240-1>} The profile of an inherited subprogram
(including an inherited enumeration literal) is obtained from the
profile of the corresponding (user-defined) primitive subprogram of
the parent or progenitor type, after systematic replacement of each
subtype of its profile (see *note 6.1::) that is of the parent or
progenitor type, other than those subtypes found in the designated
- profile of an access_definition, with a corresponding subtype of
- the derived type. For a given subtype of the parent or progenitor
+ profile of an access_definition, with a <corresponding subtype> of
+ the derived type. For a given subtype of the parent or progenitor
type, the corresponding subtype of the derived type is defined as
follows:
@@ -8336,7 +8347,7 @@ primitive subprograms of the derived type are defined as
follows:
is not a record extension, then the corresponding subtype
is constrained to those values that when converted to the
parent type belong to the given subtype (see *note
- 4.6::).
+ 4.6::).
21.a
Reason: An inherited subprogram of an untagged type has an
@@ -8347,7 +8358,7 @@ primitive subprograms of the derived type are defined as
follows:
undesirable implementation burden.
21.b/3
- {AI05-0164-1AI05-0164-1} Note that the exception to
+ {<AI05-0164-1AI05-0164-1>} Note that the exception to
substitution of the parent or progenitor type applies only in
the profiles of anonymous access-to-subprogram types. The
exception is necessary to avoid calling an
@@ -8355,7 +8366,7 @@ primitive subprograms of the derived type are defined as
follows:
than expected by the actual routine.
22/2
- {AI95-00401-01AI95-00401-01} The same formal parameters have
+ {<AI95-00401-01AI95-00401-01>} The same formal parameters have
default_expressions in the profile of the inherited subprogram.
[Any type mismatch due to the systematic replacement of the parent
or progenitor type by the derived type is handled as part of the
@@ -8363,7 +8374,7 @@ primitive subprograms of the derived type are defined as
follows:
*note 6.4.1::.]
22.a/2
- Reason: {AI95-00401-01AI95-00401-01} We don't introduce the
+ Reason: {<AI95-00401-01AI95-00401-01>} We don't introduce the
type conversion explicitly here since conversions to record
extensions or on access parameters are not generally legal.
Furthermore, any type conversion would just be "undone" since
@@ -8373,12 +8384,12 @@ primitive subprograms of the derived type are defined
as follows:
subprograms of an interface.)
23/2
-{AI95-00401-01AI95-00401-01} If a primitive subprogram of the parent or
-progenitor type is visible at the place of the derived_type_definition,
-then the corresponding inherited subprogram is implicitly declared
-immediately after the derived_type_definition. Otherwise, the inherited
-subprogram is implicitly declared later or not at all, as explained in
-*note 7.3.1::.
+{<AI95-00401-01AI95-00401-01>} If a primitive subprogram of the parent
+or progenitor type is visible at the place of the
+derived_type_definition, then the corresponding inherited subprogram is
+implicitly declared immediately after the derived_type_definition.
+Otherwise, the inherited subprogram is implicitly declared later or not
+at all, as explained in *note 7.3.1::.
24
A derived type can also be defined by a private_extension_declaration
@@ -8403,13 +8414,13 @@ S0027.) depends on a discriminant, then only those
expressions that do
not depend on a discriminant are evaluated.
26.a/2
- Discussion: {AI95-00251-01AI95-00251-01} We don't mention the
- interface_list, because it does not need elaboration (see
+ Discussion: {<AI95-00251-01AI95-00251-01>} We don't mention
+ the interface_list, because it does not need elaboration (see
*note 3.9.4::). This is consistent with the handling of
discriminant_parts, which aren't elaborated either.
27/2
-{AI95-00391-01AI95-00391-01} {AI95-00401-01AI95-00401-01} For the
+{<AI95-00391-01AI95-00391-01>} {<AI95-00401-01AI95-00401-01>} For the
execution of a call on an inherited subprogram, a call on the
corresponding primitive subprogram of the parent or progenitor type is
performed; the normal conversion of each actual parameter to the subtype
@@ -8419,10 +8430,9 @@ subprogram is the derived type, the result of calling
the subprogram of
the parent or progenitor is converted to the derived type, or in the
case of a null extension, extended to the derived type using the
equivalent of an extension_aggregate with the original result as the
-ancestor_part and null record as the record_component_association_list.
-
+ancestor_part and null record as the record_component_association_list.
27.a/2
- Discussion: {AI95-00391-01AI95-00391-01} If an inherited
+ Discussion: {<AI95-00391-01AI95-00391-01>} If an inherited
function returns the derived type, and the type is a nonnull
record extension, then the inherited function shall be
overridden, unless the type is abstract (in which case the
@@ -8441,7 +8451,7 @@ ancestor_part and null record as the
record_component_association_list.
17 Evaluating an inherited enumeration literal is equivalent to
evaluating the corresponding enumeration literal of the parent
type, and then converting the result to the derived type. This
- follows from their equivalence to parameterless functions.
+ follows from their equivalence to parameterless functions.
30
18 A generic subprogram is not a subprogram, and hence cannot be a
@@ -8480,51 +8490,51 @@ ancestor_part and null record as the
record_component_association_list.
34.b
type T1 is range 1..100;
subtype S1 is T1 range 1..10;
- procedure P(X : in S1); -- P is a primitive subprogram
+ procedure P(X : in S1); <-- P is a primitive subprogram>
type T2 is new T1 range 11..20;
- -- implicitly declared:
- -- procedure P(X : in T2'Base range 1..10);
- -- X cannot be in T2'First .. T2'Last
+ <-- implicitly declared:>
+ <-- procedure P(X : in T2'Base range 1..10);>
+ <-- X cannot be in T2'First .. T2'Last>
35
23 If the reserved word abstract is given in the declaration of a
type, the type is abstract (see *note 3.9.3::).
35.1/2
- 24 {AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01} An
- interface type that has a progenitor type "is derived from" that
+ 24 {<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+ An interface type that has a progenitor type "is derived from" that
type. A derived_type_definition, however, never defines an
interface type.
35.2/2
- 25 {AI95-00345-01AI95-00345-01} It is illegal for the parent type
- of a derived_type_definition to be a synchronized tagged type.
+ 25 {<AI95-00345-01AI95-00345-01>} It is illegal for the parent
+ type of a derived_type_definition to be a synchronized tagged type.
35.a/3
- Proof: {AI05-0299-1AI05-0299-1} *note 3.9.1:: prohibits record
- extensions whose parent type is a synchronized tagged type,
- and this subclause requires tagged types to have a record
- extension. Thus there are no legal derivations. Note that a
- synchronized interface can be used as a progenitor in an
- interface_type_definition as well as in task and protected
+ Proof: {<AI05-0299-1AI05-0299-1>} *note 3.9.1:: prohibits
+ record extensions whose parent type is a synchronized tagged
+ type, and this subclause requires tagged types to have a
+ record extension. Thus there are no legal derivations. Note
+ that a synchronized interface can be used as a progenitor in
+ an interface_type_definition as well as in task and protected
types, but we do not allow concrete extensions of any
synchronized tagged type.
_Examples_
36
-Examples of derived type declarations:
+<Examples of derived type declarations:>
37
- type Local_Coordinate is new Coordinate; -- two different types
- type Midweek is new Day range Tue .. Thu; -- see *note 3.5.1::
- type Counter is new Positive; -- same range as Positive
+ type Local_Coordinate is new Coordinate; --< two different types>
+ type Midweek is new Day range Tue .. Thu; --< see *note 3.5.1::>
+ type Counter is new Positive; --< same range as Positive >
38
- type Special_Key is new Key_Manager.Key; -- see *note 7.3.1::
- -- the inherited subprograms have the following specifications:
- -- procedure Get_Key(K : out Special_Key);
- -- function "<"(X,Y : Special_Key) return Boolean;
+ type Special_Key is new Key_Manager.Key; --< see *note 7.3.1::>
+ --< the inherited subprograms have the following specifications: >
+ --< procedure Get_Key(K : out Special_Key);>
+ --< function "<"(X,Y : Special_Key) return Boolean;>
_Inconsistencies With Ada 83_
@@ -8552,18 +8562,18 @@ Examples of derived type declarations:
type T is (A, B, C, D);
function F( X : T := A ) return Integer;
type NT is new T;
- -- inherits F as
- -- function F( X : NT := A ) return Integer;
- -- in Ada 95 only
+ --< inherits F as>
+ --< function F( X : NT := A ) return Integer;>
+ --< in Ada 95 only>
...
end P;
...
- use P; -- Only one declaration of F from P is use-visible in
- -- Ada 83; two declarations of F are use-visible in
- -- Ada 95.
+ use P; --< Only one declaration of F from P is use-visible
in>
+ --< Ada 83; two declarations of F are use-visible
in>
+ --< Ada 95.>
begin
...
- if F > 1 then ... -- legal in Ada 83, ambiguous in Ada 95
+ if F > 1 then ... --< legal in Ada 83, ambiguous in Ada 95>
_Extensions to Ada 83_
@@ -8594,13 +8604,13 @@ Examples of derived type declarations:
_Extensions to Ada 95_
38.i/2
- {AI05-0190-1AI05-0190-1} {AI95-00251-01AI95-00251-01}
- {AI95-00401-01AI95-00401-01} A derived type may inherit from
+ {<AI05-0190-1AI05-0190-1>} {<AI95-00251-01AI95-00251-01>}
+ {<AI95-00401-01AI95-00401-01>} A derived type may inherit from
multiple (interface) progenitors, as well as the parent type
-- see *note 3.9.4::, "*note 3.9.4:: Interface Types".
38.j/2
- {AI95-00419-01AI95-00419-01} A derived type may specify that
+ {<AI95-00419-01AI95-00419-01>} A derived type may specify that
it is a limited type. This is required for interface
ancestors (from which limitedness is not inherited), but it is
generally useful as documentation of limitedness.
@@ -8608,12 +8618,12 @@ Examples of derived type declarations:
_Wording Changes from Ada 95_
38.k/2
- {AI95-00391-01AI95-00391-01} Defined the result of functions
+ {<AI95-00391-01AI95-00391-01>} Defined the result of functions
for null extensions (which we no longer require to be
overridden - see *note 3.9.3::).
38.l/2
- {AI95-00442-01AI95-00442-01} Defined the term "category of
+ {<AI95-00442-01AI95-00442-01>} Defined the term "category of
types" and used it in wording elsewhere; also specified the
language-defined categories that form classes of types (this
was never normatively specified in Ada 95).
@@ -8621,7 +8631,7 @@ Examples of derived type declarations:
_Incompatibilities With Ada 2005_
38.m/3
- {AI05-0096-1AI05-0096-1} Correction: Added a (re)check that
+ {<AI05-0096-1AI05-0096-1>} Correction: Added a (re)check that
limited type extensions never are derived from nonlimited
types in generic private parts. This is disallowed as it
would make it possible to pass a limited object to a
@@ -8632,14 +8642,14 @@ Examples of derived type declarations:
_Wording Changes from Ada 2005_
38.n/3
- {AI05-0110-1AI05-0110-1} Correction: Added wording to clarify
- that the characteristics of derived types are formally defined
- here. (This is the only place in the Standard that actually
- spells out what sorts of things are actually characteristics,
- which is rather important.)
+ {<AI05-0110-1AI05-0110-1>} Correction: Added wording to
+ clarify that the characteristics of derived types are formally
+ defined here. (This is the only place in the Standard that
+ actually spells out what sorts of things are actually
+ characteristics, which is rather important.)
38.o/3
- {AI05-0164-1AI05-0164-1} Correction: Added wording to ensure
+ {<AI05-0164-1AI05-0164-1>} Correction: Added wording to ensure
that anonymous access-to-subprogram types don't get modified
on derivation.
@@ -8655,20 +8665,21 @@ File: aarm2012.info, Node: 3.4.1, Up: 3.4
1
In addition to the various language-defined classes of types, types can
-be grouped into derivation classes.
+be grouped into <derivation classes>.
_Static Semantics_
2/2
-{AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01} A derived type
-is derived from its parent type directly; it is derived indirectly from
-any type from which its parent type is derived. A derived type,
-interface type, type extension, task type, protected type, or formal
-derived type is also derived from every ancestor of each of its
-progenitor types, if any. The derivation class of types for a type T
-(also called the class rooted at T) is the set consisting of T (the root
-type of the class) and all types derived from T (directly or indirectly)
-plus any associated universal or class-wide types (defined below).
+{<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>} A derived
+type is <derived from> its parent type <directly>; it is derived
+<indirectly> from any type from which its parent type is derived. A
+derived type, interface type, type extension, task type, protected type,
+or formal derived type is also derived from every ancestor of each of
+its progenitor types, if any. The derivation class of types for a type
+<T> (also called the class <rooted> at <T>) is the set consisting of <T>
+(the <root type> of the class) and all types derived from <T> (directly
+or indirectly) plus any associated universal or class-wide types
+(defined below).
2.a
Discussion: Note that the definition of "derived from" is a
@@ -8678,48 +8689,48 @@ plus any associated universal or class-wide types
(defined below).
2.b
To be honest: By the class-wide type "associated" with a type
- T, we mean the type T'Class. Similarly, the universal type
- associated with root_integer, root_real, and root_fixed are
- universal_integer, universal_real, and universal_fixed,
- respectively.
+ <T>, we mean the type <T>'Class. Similarly, the universal
+ type associated with <root_integer>, <root_real>, and
+ <root_fixed> are <universal_integer>, <universal_real>, and
+ <universal_fixed>, respectively.
3/2
-{AI95-00230-01AI95-00230-01} Every type is either a specific type, a
-class-wide type, or a universal type. A specific type is one defined by
-a type_declaration, a formal_type_declaration, or a full type definition
-embedded in another construct. Class-wide and universal types are
-implicitly defined, to act as representatives for an entire class of
-types, as follows:
+{<AI95-00230-01AI95-00230-01>} Every type is either a <specific> type, a
+<class-wide> type, or a <universal> type. A specific type is one
+defined by a type_declaration, a formal_type_declaration, or a full type
+definition embedded in another construct. Class-wide and universal
+types are implicitly defined, to act as representatives for an entire
+class of types, as follows:
3.a
- To be honest: The root types root_integer, root_real, and
- root_fixed are also specific types. They are declared in the
- specification of package Standard.
+ To be honest: The root types <root_integer>, <root_real>, and
+ <root_fixed> are also specific types. They are declared in
+ the specification of package Standard.
4
Class-wide types
Class-wide types are defined for [(and belong to)] each
derivation class rooted at a tagged type (see *note
- 3.9::). Given a subtype S of a tagged type T, S'Class is
- the subtype_mark for a corresponding subtype of the
- tagged class-wide type T'Class. Such types are called
+ 3.9::). Given a subtype S of a tagged type <T>, S'Class
+ is the subtype_mark for a corresponding subtype of the
+ tagged class-wide type <T>'Class. Such types are called
"class-wide" because when a formal parameter is defined
- to be of a class-wide type T'Class, an actual parameter
- of any type in the derivation class rooted at T is
+ to be of a class-wide type <T>'Class, an actual parameter
+ of any type in the derivation class rooted at <T> is
acceptable (see *note 8.6::).
5
- The set of values for a class-wide type T'Class is the
+ The set of values for a class-wide type <T>'Class is the
discriminated union of the set of values of each specific
- type in the derivation class rooted at T (the tag acts as
- the implicit discriminant -- see *note 3.9::).
+ type in the derivation class rooted at <T> (the tag acts
+ as the implicit discriminant -- see *note 3.9::).
Class-wide types have no primitive subprograms of their
own. However, as explained in *note 3.9.2::, operands of
- a class-wide type T'Class can be used as part of a
- dispatching call on a primitive subprogram of the type T.
- The only components [(including discriminants)] of
- T'Class that are visible are those of T. If S is a first
- subtype, then S'Class is a first subtype.
+ a class-wide type <T>'Class can be used as part of a
+ dispatching call on a primitive subprogram of the type
+ <T>. The only components [(including discriminants)] of
+ <T>'Class that are visible are those of <T>. If S is a
+ first subtype, then S'Class is a first subtype.
5.a
Reason: We want S'Class to be a first subtype when S is, so
@@ -8727,20 +8738,21 @@ Class-wide types
"for S'Class'Output use ...;" will be legal.
6/2
-{AI95-00230-01AI95-00230-01} Universal types
+{<AI95-00230-01AI95-00230-01>} Universal types
Universal types are defined for [(and belong to)] the
integer, real, fixed point, and access classes, and are
referred to in this standard as respectively,
- universal_integer, universal_real, universal_fixed, and
- universal_access. These are analogous to class-wide
- types for these language-defined elementary classes. As
- with class-wide types, if a formal parameter is of a
- universal type, then an actual parameter of any type in
- the corresponding class is acceptable. In addition, a
- value of a universal type (including an integer or real
- numeric_literal, or the literal null) is "universal" in
- that it is acceptable where some particular type in the
- class is expected (see *note 8.6::).
+ <universal_integer>, <universal_real>, <universal_fixed>,
+ and <universal_access>. These are analogous to
+ class-wide types for these language-defined elementary
+ classes. As with class-wide types, if a formal parameter
+ is of a universal type, then an actual parameter of any
+ type in the corresponding class is acceptable. In
+ addition, a value of a universal type (including an
+ integer or real numeric_literal, or the literal null) is
+ "universal" in that it is acceptable where some
+ particular type in the class is expected (see *note
+ 8.6::).
7
The set of values of a universal type is the
@@ -8758,14 +8770,14 @@ Class-wide types
specific to universal and back.
7.b/2
- {AI95-00230-01AI95-00230-01} We considered defining class-wide
- or perhaps universal types for all derivation classes, not
- just tagged classes and these four elementary classes.
- However, this was felt to overly weaken the strong-typing
- model in some situations. Tagged types preserve strong type
- distinctions thanks to the run-time tag. Class-wide or
- universal types for untagged types would weaken the
- compile-time type distinctions without providing a
+ {<AI95-00230-01AI95-00230-01>} We considered defining
+ class-wide or perhaps universal types for all derivation
+ classes, not just tagged classes and these four elementary
+ classes. However, this was felt to overly weaken the
+ strong-typing model in some situations. Tagged types preserve
+ strong type distinctions thanks to the run-time tag.
+ Class-wide or universal types for untagged types would weaken
+ the compile-time type distinctions without providing a
compensating run-time-checkable distinction.
7.c
@@ -8776,36 +8788,37 @@ Class-wide types
7.d
To be honest: Formally, the set of values of a universal type
- is actually a copy of the undiscriminated union of the values
- of the types in its class. This is because we want each value
- to have exactly one type, with explicit or implicit conversion
- needed to go between types. An alternative, consistent model
- would be to associate a class, rather than a particular type,
- with a value, even though any given expression would have a
- particular type. In that case, implicit type conversions
- would not generally need to change the value, although an
- associated subtype conversion might need to.
+ is actually a <copy> of the undiscriminated union of the
+ values of the types in its class. This is because we want
+ each value to have exactly one type, with explicit or implicit
+ conversion needed to go between types. An alternative,
+ consistent model would be to associate a class, rather than a
+ particular type, with a value, even though any given
+ expression would have a particular type. In that case,
+ implicit type conversions would not generally need to change
+ the value, although an associated subtype conversion might
+ need to.
8
The integer and real numeric classes each have a specific root type in
-addition to their universal type, named respectively root_integer and
-root_real.
+addition to their universal type, named respectively <root_integer> and
+<root_real>.
9
-A class-wide or universal type is said to cover all of the types in its
-class. A specific type covers only itself.
+A class-wide or universal type is said to <cover> all of the types in
+its class. A specific type covers only itself.
10/2
-{AI95-00230-01AI95-00230-01} {AI95-00251-01AI95-00251-01} A specific
-type T2 is defined to be a descendant of a type T1 if T2 is the same as
-T1, or if T2 is derived (directly or indirectly) from T1. A class-wide
-type T2'Class is defined to be a descendant of type T1 if T2 is a
-descendant of T1. Similarly, the numeric universal types are defined to
-be descendants of the root types of their classes. If a type T2 is a
-descendant of a type T1, then T1 is called an ancestor of T2. An
-ultimate ancestor of a type is an ancestor of that type that is not
-itself a descendant of any other type. Every untagged type has a unique
-ultimate ancestor.
+{<AI95-00230-01AI95-00230-01>} {<AI95-00251-01AI95-00251-01>} A specific
+type <T2> is defined to be a <descendant> of a type <T1> if <T2> is the
+same as <T1>, or if <T2> is derived (directly or indirectly) from <T1>.
+A class-wide type <T2>'Class is defined to be a descendant of type <T1>
+if <T2> is a descendant of <T1>. Similarly, the numeric universal types
+are defined to be descendants of the root types of their classes. If a
+type <T2> is a descendant of a type <T1>, then <T1> is called an
+<ancestor> of <T2>. An <ultimate ancestor> of a type is an ancestor of
+that type that is not itself a descendant of any other type. Every
+untagged type has a unique ultimate ancestor.
10.a
Ramification: A specific type is a descendant of itself.
@@ -8823,7 +8836,7 @@ ultimate ancestor.
ancestor are all related. For example:
10.d/2
- * {AI95-00251-01AI95-00251-01} Each type has at most one
+ * {<AI95-00251-01AI95-00251-01>} Each type has at most one
parent, and one or more ancestor types; each untagged
type has exactly one ultimate ancestor. In Ada 83, the
term "parent type" was sometimes used more generally to
@@ -8839,9 +8852,9 @@ ultimate ancestor.
the class (including itself).
10.g
- * The type root_integer is the root of the integer class,
+ * The type <root_integer> is the root of the integer class,
and is the ultimate ancestor of all integer types. A
- similar statement applies to root_real.
+ similar statement applies to <root_real>.
10.h/2
Glossary entry: An ancestor of a type is the type itself or,
@@ -8856,7 +8869,7 @@ ultimate ancestor.
11
An inherited component [(including an inherited discriminant)] of a
-derived type is inherited from a given ancestor of the type if the
+derived type is inherited <from> a given ancestor of the type if the
corresponding component was inherited by each derived type in the chain
of derivations going back to the given ancestor.
@@ -8865,18 +8878,18 @@ of derivations going back to the given ancestor.
12
26 Because operands of a universal type are acceptable to the
predefined operators of any type in their class, ambiguity can
- result. For universal_integer and universal_real, this potential
- ambiguity is resolved by giving a preference (see *note 8.6::) to
- the predefined operators of the corresponding root types
- (root_integer and root_real, respectively). Hence, in an
+ result. For <universal_integer> and <universal_real>, this
+ potential ambiguity is resolved by giving a preference (see *note
+ 8.6::) to the predefined operators of the corresponding root types
+ (<root_integer> and <root_real>, respectively). Hence, in an
apparently ambiguous expression like
13
1 + 4 < 7
14
- where each of the literals is of type universal_integer, the
- predefined operators of root_integer will be preferred over those
+ where each of the literals is of type <universal_integer>, the
+ predefined operators of <root_integer> will be preferred over those
of other specific integer types, thereby resolving the ambiguity.
14.a
@@ -8889,14 +8902,14 @@ of derivations going back to the given ancestor.
_Wording Changes from Ada 95_
14.b/2
- {AI95-00230-01AI95-00230-01} Updated the wording to define the
- universal_access type. This was defined to make null for
- anonymous access types sensible.
+ {<AI95-00230-01AI95-00230-01>} Updated the wording to define
+ the <universal_access> type. This was defined to make null
+ for anonymous access types sensible.
14.c/2
- {AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01} The
- definitions of ancestors and descendants were updated to allow
- multiple ancestors (necessary to support interfaces).
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+ The definitions of ancestors and descendants were updated to
+ allow multiple ancestors (necessary to support interfaces).
File: aarm2012.info, Node: 3.5, Next: 3.6, Prev: 3.4, Up: 3
@@ -8905,11 +8918,11 @@ File: aarm2012.info, Node: 3.5, Next: 3.6, Prev:
3.4, Up: 3
================
1
-Scalar types comprise enumeration types, integer types, and real types.
-Enumeration types and integer types are called discrete types; each
-value of a discrete type has a position number which is an integer
-value. Integer types and real types are called numeric types. [All
-scalar types are ordered, that is, all relational operators are
+<Scalar> types comprise enumeration types, integer types, and real
+types. Enumeration types and integer types are called <discrete> types;
+each value of a discrete type has a <position number> which is an
+integer value. Integer types and real types are called <numeric> types.
+[All scalar types are ordered, that is, all relational operators are
predefined for their values.]
_Syntax_
@@ -8928,16 +8941,17 @@ predefined for their values.]
be ambiguous.
4
-A range has a lower bound and an upper bound and specifies a subset of
-the values of some scalar type (the type of the range). A range with
-lower bound L and upper bound R is described by "L .. R". If R is less
-than L, then the range is a null range, and specifies an empty set of
-values. Otherwise, the range specifies the values of the type from the
-lower bound to the upper bound, inclusive. A value belongs to a range if
-it is of the type of the range, and is in the subset of values specified
-by the range. A value satisfies a range constraint if it belongs to the
-associated range. One range is included in another if all values that
-belong to the first range also belong to the second.
+A <range> has a <lower bound> and an <upper bound> and specifies a
+subset of the values of some scalar type (the <type of the range>). A
+range with lower bound L and upper bound R is described by "L .. R". If
+R is less than L, then the range is a <null range>, and specifies an
+empty set of values. Otherwise, the range specifies the values of the
+type from the lower bound to the upper bound, inclusive. A value
+<belongs> to a range if it is of the type of the range, and is in the
+subset of values specified by the range. A value <satisfies> a range
+constraint if it belongs to the associated range. One range is
+<included> in another if all values that belong to the first range also
+belong to the second.
_Name Resolution Rules_
@@ -8945,7 +8959,7 @@ belong to the first range also belong to the second.
For a subtype_indication containing a range_constraint, either directly
or as part of some other scalar_constraint, the type of the range shall
resolve to that of the type determined by the subtype_mark of the
-subtype_indication. For a range of a given type, the simple_expressions
+subtype_indication. For a range of a given type, the simple_expressions
of the range (likewise, the simple_expressions of the equivalent range
for a range_attribute_reference) are expected to be of the type of the
range.
@@ -8957,8 +8971,8 @@ range.
real_range_specifications.
5.b/3
- {AI05-0299-1AI05-0299-1} We say "the expected type is ..." or
- "the type is expected to be ..." depending on which reads
+ {<AI05-0299-1AI05-0299-1>} We say "the expected type is ..."
+ or "the type is expected to be ..." depending on which reads
better. They are fundamentally equivalent, and both feed into
the type resolution rules of subclause *note 8.6::.
@@ -8981,7 +8995,7 @@ range.
_Static Semantics_
6
-The base range of a scalar type is the range of finite values of the
+The <base range> of a scalar type is the range of finite values of the
type that can be represented in every unconstrained object of the type;
it is also the range supported at a minimum for intermediate values
during the evaluation of expressions involving predefined operators of
@@ -9016,17 +9030,17 @@ the type.
7
[A constrained scalar subtype is one to which a range constraint
-applies.] The range of a constrained scalar subtype is the range
-associated with the range constraint of the subtype. The range of an
+applies.] The <range> of a constrained scalar subtype is the range
+associated with the range constraint of the subtype. The <range> of an
unconstrained scalar subtype is the base range of its type.
_Dynamic Semantics_
8
-A range is compatible with a scalar subtype if and only if it is either
-a null range or each bound of the range belongs to the range of the
-subtype. A range_constraint is compatible with a scalar subtype if and
-only if its range is compatible with the subtype.
+A range is <compatible> with a scalar subtype if and only if it is
+either a null range or each bound of the range belongs to the range of
+the subtype. A range_constraint is <compatible> with a scalar subtype
+if and only if its range is compatible with the subtype.
8.a
Ramification: Only range_constraints (explicit or implicit)
@@ -9035,7 +9049,7 @@ only if its range is compatible with the subtype.
delta_constraints impose conditions on the subtype denoted by
the subtype_mark in a subtype_indication, but don't impose a
condition on the values of the subtype being defined.
- Therefore, a scalar subtype is not called constrained if all
+ Therefore, a scalar subtype is not called <constrained> if all
that applies to it is a digits_constraint. Decimal subtypes
are subtle, because a digits_constraint without a
range_constraint nevertheless includes an implicit
@@ -9043,15 +9057,15 @@ only if its range is compatible with the subtype.
9
The elaboration of a range_constraint consists of the evaluation of the
-range. The evaluation of a range determines a lower bound and an upper
+range. The evaluation of a range determines a lower bound and an upper
bound. If simple_expressions are given to specify bounds, the
evaluation of the range evaluates these simple_expressions in an
-arbitrary order, and converts them to the type of the range. If a
+arbitrary order, and converts them to the type of the range. If a
range_attribute_reference is given, the evaluation of the range consists
of the evaluation of the range_attribute_reference.
10
-Attributes
+<Attributes>
11
For every scalar subtype S, the following attributes are defined:
@@ -9080,8 +9094,8 @@ S'Range
15
S'Base
S'Base denotes an unconstrained subtype of the type of S.
- This unconstrained subtype is called the base subtype of
- the type.
+ This unconstrained subtype is called the <base subtype>
+ of the type.
16
S'Min
@@ -9089,7 +9103,7 @@ S'Min
specification:
17
- function S'Min(Left, Right : S'Base)
+ function S'Min(<Left>, <Right> : S'Base)
return S'Base
18
@@ -9110,7 +9124,7 @@ S'Max
specification:
20
- function S'Max(Left, Right : S'Base)
+ function S'Max(<Left>, <Right> : S'Base)
return S'Base
21
@@ -9123,27 +9137,27 @@ S'Succ
specification:
23
- function S'Succ(Arg : S'Base)
+ function S'Succ(<Arg> : S'Base)
return S'Base
24
For an enumeration type, the function returns the value
whose position number is one more than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
- returns the result of adding one to the value of Arg.
+ returns the result of adding one to the value of <Arg>.
For a fixed point type, the function returns the result
- of adding small to the value of Arg. For a floating
+ of adding <small> to the value of <Arg>. For a floating
point type, the function returns the machine number (as
defined in *note 3.5.7::) immediately above the value of
- Arg; Constraint_Error is raised if there is no such
+ <Arg>; Constraint_Error is raised if there is no such
machine number.
24.a
Ramification: S'Succ for a modular integer subtype wraps
- around if the value of Arg is S'Base'Last. S'Succ for a
+ around if the value of <Arg> is S'Base'Last. S'Succ for a
signed integer subtype might raise Constraint_Error if the
- value of Arg is S'Base'Last, or it might return the
+ value of <Arg> is S'Base'Last, or it might return the
out-of-base-range value S'Base'Last+1, as is permitted for all
predefined numeric operations.
@@ -9153,43 +9167,43 @@ S'Pred
specification:
26
- function S'Pred(Arg : S'Base)
+ function S'Pred(<Arg> : S'Base)
return S'Base
27
For an enumeration type, the function returns the value
whose position number is one less than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
returns the result of subtracting one from the value of
- Arg. For a fixed point type, the function returns the
- result of subtracting small from the value of Arg. For a
- floating point type, the function returns the machine
- number (as defined in *note 3.5.7::) immediately below
- the value of Arg; Constraint_Error is raised if there is
- no such machine number.
+ <Arg>. For a fixed point type, the function returns the
+ result of subtracting <small> from the value of <Arg>.
+ For a floating point type, the function returns the
+ machine number (as defined in *note 3.5.7::) immediately
+ below the value of <Arg>; Constraint_Error is raised if
+ there is no such machine number.
27.a
Ramification: S'Pred for a modular integer subtype wraps
- around if the value of Arg is S'Base'First. S'Pred for a
+ around if the value of <Arg> is S'Base'First. S'Pred for a
signed integer subtype might raise Constraint_Error if the
- value of Arg is S'Base'First, or it might return the
+ value of <Arg> is S'Base'First, or it might return the
out-of-base-range value S'Base'First-1, as is permitted for
all predefined numeric operations.
27.1/2
S'Wide_Wide_Image
- {AI95-00285-01AI95-00285-01} S'Wide_Wide_Image denotes a
- function with the following specification:
+ {<AI95-00285-01AI95-00285-01>} S'Wide_Wide_Image denotes
+ a function with the following specification:
27.2/2
- function S'Wide_Wide_Image(Arg : S'Base)
+ function S'Wide_Wide_Image(<Arg> : S'Base)
return Wide_Wide_String
27.3/2
- The function returns an image of the value of Arg, that
- is, a sequence of characters representing the value in
- display form. The lower bound of the result is one.
+ The function returns an <image> of the value of <Arg>,
+ that is, a sequence of characters representing the value
+ in display form. The lower bound of the result is one.
27.4/2
The image of an integer value is the corresponding
@@ -9210,11 +9224,11 @@ S'Wide_Wide_Image
corresponding identifier in upper case or the
corresponding character literal (including the two
apostrophes); neither leading nor trailing spaces are
- included. For a nongraphic character (a value of a
+ included. For a <nongraphic character> (a value of a
character type that has no enumeration literal associated
with it), the result is a corresponding language-defined
name in upper case (for example, the image of the
- nongraphic character identified as nul is "NUL" -- the
+ nongraphic character identified as <nul> is "NUL" -- the
quotes are not part of the image).
27.c/2
@@ -9280,14 +9294,14 @@ S'Wide_Image
specification:
29
- function S'Wide_Image(Arg : S'Base)
+ function S'Wide_Image(<Arg> : S'Base)
return Wide_String
30/3
- {AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1}
- {AI05-0264-1AI05-0264-1} The function returns an image of
- the value of Arg as a Wide_String. The lower bound of
- the result is one. The image has the same sequence of
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0264-1AI05-0264-1>} The function returns an image
+ of the value of <Arg> as a Wide_String. The lower bound
+ of the result is one. The image has the same sequence of
graphic characters as defined for S'Wide_Wide_Image if
all the graphic characters are defined in Wide_Character;
otherwise, the sequence of characters is implementation
@@ -9300,7 +9314,7 @@ S'Wide_Image
characters of S'Wide_Wide_Image are not defined in
Wide_Character.
- Paragraphs 31 through 34 were moved to Wide_Wide_Image.
+ <Paragraphs 31 through 34 were moved to Wide_Wide_Image.>
35
S'Image
@@ -9308,19 +9322,19 @@ S'Image
specification:
36
- function S'Image(Arg : S'Base)
+ function S'Image(<Arg> : S'Base)
return String
37/3
- {AI95-00285-01AI95-00285-01} {AI05-0264-1AI05-0264-1} The
- function returns an image of the value of Arg as a
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0264-1AI05-0264-1>}
+ The function returns an image of the value of <Arg> as a
String. The lower bound of the result is one. The image
has the same sequence of graphic characters as that
defined for S'Wide_Wide_Image if all the graphic
characters are defined in Character; otherwise, the
sequence of characters is implementation defined (but no
shorter than that of S'Wide_Wide_Image for the same value
- of Arg).
+ of <Arg>).
37.a/2
Implementation defined: The sequence of characters of the
@@ -9329,33 +9343,33 @@ S'Image
37.1/2
S'Wide_Wide_Width
- {AI95-00285-01AI95-00285-01} S'Wide_Wide_Width denotes
+ {<AI95-00285-01AI95-00285-01>} S'Wide_Wide_Width denotes
the maximum length of a Wide_Wide_String returned by
S'Wide_Wide_Image over all values of the subtype S. It
denotes zero for a subtype that has a null range. Its
- type is universal_integer.
+ type is <universal_integer>.
38
S'Wide_Width
S'Wide_Width denotes the maximum length of a Wide_String
returned by S'Wide_Image over all values of the subtype
S. It denotes zero for a subtype that has a null range.
- Its type is universal_integer.
+ Its type is <universal_integer>.
39
S'Width
S'Width denotes the maximum length of a String returned
by S'Image over all values of the subtype S. It denotes
zero for a subtype that has a null range. Its type is
- universal_integer.
+ <universal_integer>.
39.1/2
S'Wide_Wide_Value
- {AI95-00285-01AI95-00285-01} S'Wide_Wide_Value denotes a
- function with the following specification:
+ {<AI95-00285-01AI95-00285-01>} S'Wide_Wide_Value denotes
+ a function with the following specification:
39.2/2
- function S'Wide_Wide_Value(Arg : Wide_Wide_String)
+ function S'Wide_Wide_Value(<Arg> : Wide_Wide_String)
return S'Base
39.3/2
@@ -9364,8 +9378,8 @@ S'Wide_Wide_Value
spaces.
39.4/3
- {AI05-0264-1AI05-0264-1} For the evaluation of a call on
- S'Wide_Wide_Value for an enumeration subtype S, if the
+ {<AI05-0264-1AI05-0264-1>} For the evaluation of a call
+ on S'Wide_Wide_Value for an enumeration subtype S, if the
sequence of characters of the parameter (ignoring leading
and trailing spaces) has the syntax of an enumeration
literal and if it corresponds to a literal of the type of
@@ -9381,8 +9395,8 @@ S'Wide_Wide_Value
to lump it in with Range_Check.
39.a.2/2
- To be honest: {8652/00968652/0096}
- {AI95-00053-01AI95-00053-01} A sequence of characters
+ To be honest: {<8652/00968652/0096>}
+ {<AI95-00053-01AI95-00053-01>} A sequence of characters
corresponds to the result of S'Wide_Wide_Image if it is the
same ignoring case. Thus, the case of an image of a
nongraphic character does not matter. For example,
@@ -9391,8 +9405,8 @@ S'Wide_Wide_Value
returns "NUL" for the nul character.
39.5/3
- {AI05-0264-1AI05-0264-1} For the evaluation of a call on
- S'Wide_Wide_Value for an integer subtype S, if the
+ {<AI05-0264-1AI05-0264-1>} For the evaluation of a call
+ on S'Wide_Wide_Value for an integer subtype S, if the
sequence of characters of the parameter (ignoring leading
and trailing spaces) has the syntax of an integer
literal, with an optional leading sign character (plus or
@@ -9436,7 +9450,7 @@ S'Wide_Wide_Value
* base#.based_numeral#[exponent]
39.12/3
- {AI05-0264-1AI05-0264-1} with an optional leading sign
+ {<AI05-0264-1AI05-0264-1>} with an optional leading sign
character (plus or minus), and if the corresponding
numeric value belongs to the base range of the type of S,
then that value is the result; otherwise,
@@ -9450,7 +9464,7 @@ S'Wide_Value
specification:
41
- function S'Wide_Value(Arg : Wide_String)
+ function S'Wide_Value(<Arg> : Wide_String)
return S'Base
42
@@ -9459,8 +9473,8 @@ S'Wide_Value
spaces.
43/3
- {AI95-00285-01AI95-00285-01} {AI05-0264-1AI05-0264-1} For
- the evaluation of a call on S'Wide_Value for an
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0264-1AI05-0264-1>}
+ For the evaluation of a call on S'Wide_Value for an
enumeration subtype S, if the sequence of characters of
the parameter (ignoring leading and trailing spaces) has
the syntax of an enumeration literal and if it
@@ -9469,16 +9483,16 @@ S'Wide_Value
the result is the corresponding enumeration value;
otherwise, Constraint_Error is raised. For a numeric
subtype S, the evaluation of a call on S'Wide_Value with
- Arg of type Wide_String is equivalent to a call on
- S'Wide_Wide_Value for a corresponding Arg of type
+ <Arg> of type Wide_String is equivalent to a call on
+ S'Wide_Wide_Value for a corresponding <Arg> of type
Wide_Wide_String.
43.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
43.a.1/2
- This paragraph was deleted.{8652/00968652/0096}
- {AI95-00053-01AI95-00053-01}
+ <This paragraph was deleted.>{<8652/00968652/0096>}
+ {<AI95-00053-01AI95-00053-01>}
43.b/2
Reason: S'Wide_Value is subtly different from
@@ -9491,7 +9505,7 @@ S'Wide_Value
for numeric subtypes yield the same result given the same
sequence of characters.
- Paragraphs 44 through 51 were moved to Wide_Wide_Value.
+ <Paragraphs 44 through 51 were moved to Wide_Wide_Value.>
52
S'Value
@@ -9499,7 +9513,7 @@ S'Value
specification:
53
- function S'Value(Arg : String)
+ function S'Value(<Arg> : String)
return S'Base
54
@@ -9507,57 +9521,57 @@ S'Value
as a String, ignoring any leading or trailing spaces.
55/3
- {AI95-00285-01AI95-00285-01} {AI05-0264-1AI05-0264-1} For
- the evaluation of a call on S'Value for an enumeration
- subtype S, if the sequence of characters of the parameter
- (ignoring leading and trailing spaces) has the syntax of
- an enumeration literal and if it corresponds to a literal
- of the type of S (or corresponds to the result of S'Image
- for a value of the type), the result is the corresponding
- enumeration value; otherwise, Constraint_Error is raised.
- For a numeric subtype S, the evaluation of a call on
- S'Value with Arg of type String is equivalent to a call
- on S'Wide_Wide_Value for a corresponding Arg of type
- Wide_Wide_String.
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0264-1AI05-0264-1>}
+ For the evaluation of a call on S'Value for an
+ enumeration subtype S, if the sequence of characters of
+ the parameter (ignoring leading and trailing spaces) has
+ the syntax of an enumeration literal and if it
+ corresponds to a literal of the type of S (or corresponds
+ to the result of S'Image for a value of the type), the
+ result is the corresponding enumeration value; otherwise,
+ Constraint_Error is raised. For a numeric subtype S, the
+ evaluation of a call on S'Value with <Arg> of type String
+ is equivalent to a call on S'Wide_Wide_Value for a
+ corresponding <Arg> of type Wide_Wide_String.
55.a/2
- Reason: {AI95-00285-01AI95-00285-01} S'Value is subtly
+ Reason: {<AI95-00285-01AI95-00285-01>} S'Value is subtly
different from S'Wide_Wide_Value for enumeration subtypes; see
the discussion under S'Wide_Value.
55.1/4
-{AI12-0124-1AI12-0124-1} For a prefix X that denotes an object of a
+{<AI12-0124-1AI12-0124-1>} For a prefix X that denotes an object of a
scalar type[ (after any implicit dereference)], the following attributes
are defined:
55.2/4
X'Wide_Wide_Image
- {AI12-0124-1AI12-0124-1} X'Wide_Wide_Image denotes the
- result of calling function S'Wide_Wide_Image with Arg
+ {<AI12-0124-1AI12-0124-1>} X'Wide_Wide_Image denotes the
+ result of calling function S'Wide_Wide_Image with <Arg>
being X, where S is the nominal subtype of X.
55.3/4
X'Wide_Image
- {AI12-0124-1AI12-0124-1} X'Wide_Image denotes the result
- of calling function S'Wide_Image with Arg being X, where
- S is the nominal subtype of X.
+ {<AI12-0124-1AI12-0124-1>} X'Wide_Image denotes the
+ result of calling function S'Wide_Image with <Arg> being
+ X, where S is the nominal subtype of X.
55.4/4
X'Image
- {AI12-0124-1AI12-0124-1} X'Image denotes the result of
- calling function S'Image with Arg being X, where S is the
- nominal subtype of X.
+ {<AI12-0124-1AI12-0124-1>} X'Image denotes the result of
+ calling function S'Image with <Arg> being X, where S is
+ the nominal subtype of X.
_Implementation Permissions_
56/2
-{AI95-00285-01AI95-00285-01} An implementation may extend the
+{<AI95-00285-01AI95-00285-01>} An implementation may extend the
Wide_Wide_Value, [Wide_Value, Value, Wide_Wide_Image, Wide_Image, and
Image] attributes of a floating point type to support special values
such as infinities and NaNs.
56.a/2
- Proof: {AI95-00285-01AI95-00285-01} The permission is really
+ Proof: {<AI95-00285-01AI95-00285-01>} The permission is really
only necessary for Wide_Wide_Value, because Value and
Wide_Value are defined in terms of Wide_Wide_Value, and
because the behavior of Wide_Wide_Image, Wide_Image, and Image
@@ -9569,19 +9583,19 @@ such as infinities and NaNs.
for Get in *note A.10.9::.
56.1/3
-{AI05-0182-1AI05-0182-1} {AI05-0262-1AI05-0262-1}
-{AI05-0269-1AI05-0269-1} An implementation may extend the
+{<AI05-0182-1AI05-0182-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0269-1AI05-0269-1>} An implementation may extend the
Wide_Wide_Value, Wide_Value, and Value attributes of a character type to
-accept strings of the form "Hex_hhhhhhhh" (ignoring case) for any
+accept strings of the form "Hex_<hhhhhhhh>" (ignoring case) for any
character (not just the ones for which Wide_Wide_Image would produce
that form -- see *note 3.5.2::), as well as three-character strings of
-the form "'X'", where X is any character, including nongraphic
+the form "'<X>'", where <X> is any character, including nongraphic
characters.
_Static Semantics_
56.2/3
-{AI05-0228-1AI05-0228-1} For a scalar type, the following
+{<AI05-0228-1AI05-0228-1>} For a scalar type, the following
language-defined representation aspect may be specified with an
aspect_specification (see *note 13.1.1::):
@@ -9609,9 +9623,9 @@ Default_Value
scalar subtype.
56.4/3
-{AI05-0228-1AI05-0228-1} If a derived type with no primitive subprograms
-inherits a boolean Default_Value aspect, the aspect may be specified to
-have any value for the derived type.
+{<AI05-0228-1AI05-0228-1>} If a derived type with no primitive
+subprograms inherits a boolean Default_Value aspect, the aspect may be
+specified to have any value for the derived type.
56.f/3
Reason: This overrides the *note 13.1.1:: rule that says that
@@ -9620,8 +9634,8 @@ have any value for the derived type.
_Name Resolution Rules_
56.5/3
-{AI05-0228-1AI05-0228-1} The expected type for the expression specified
-for the Default_Value aspect is the type defined by the
+{<AI05-0228-1AI05-0228-1>} The expected type for the expression
+specified for the Default_Value aspect is the type defined by the
full_type_declaration on which it appears.
NOTES
@@ -9659,18 +9673,18 @@ full_type_declaration on which it appears.
_Examples_
60
-Examples of ranges:
+<Examples of ranges:>
61
-10 .. 10
X .. X + 1
0.0 .. 2.0*Pi
- Red .. Green -- see *note 3.5.1::
- 1 .. 0 -- a null range
- Table'Range -- a range attribute reference (see *note 3.6::)
+ Red .. Green --< see *note 3.5.1::>
+ 1 .. 0 --< a null range>
+ Table'Range --< a range attribute reference (see *note 3.6::)>
62
-Examples of range constraints:
+<Examples of range constraints:>
63
range -999.0 .. +999.0
@@ -9740,7 +9754,7 @@ Examples of range constraints:
_Extensions to Ada 95_
63.j/2
- {AI95-00285-01AI95-00285-01} The attributes Wide_Wide_Image,
+ {<AI95-00285-01AI95-00285-01>} The attributes Wide_Wide_Image,
Wide_Wide_Value, and Wide_Wide_Width are new. Note that
Wide_Image and Wide_Value are now defined in terms of
Wide_Wide_Image and Wide_Wide_Value, but the image of types
@@ -9749,7 +9763,7 @@ Examples of range constraints:
_Wording Changes from Ada 95_
63.k/2
- {AI95-00285-01AI95-00285-01} The Wide_Image and Wide_Value
+ {<AI95-00285-01AI95-00285-01>} The Wide_Image and Wide_Value
attributes are now defined in terms of Wide_Wide_Image and
Wide_Wide_Value, but the images of numeric types have not
changed.
@@ -9757,11 +9771,11 @@ Examples of range constraints:
_Inconsistencies With Ada 2005_
63.l/3
- {AI05-0181-1AI05-0181-1} Correction: Soft hyphen (code point
+ {<AI05-0181-1AI05-0181-1>} Correction: Soft hyphen (code point
173) is nongraphic in ISO/IEC 10646:2011 (and also in the 2003
version of that standard). Thus, we have given it the
- language-defined name soft_hyphen. This changes the result of
- Character'Image (and all of the related types and Image
+ language-defined name <soft_hyphen>. This changes the result
+ of Character'Image (and all of the related types and Image
attributes) for this character, and changes the behavior of
Character'Value (and all of the related types and Value
attributes) for this character, and (in unusual
@@ -9771,7 +9785,7 @@ Examples of range constraints:
already prepared to handle nongraphic characters.
63.m/3
- {AI05-0182-1AI05-0182-1} Correction: Added an Implementation
+ {<AI05-0182-1AI05-0182-1>} Correction: Added an Implementation
Permissions to let Wide_Wide_Value, Wide_Value, and Value
accept strings in the form of literals containing nongraphic
characters and "Hex_hhhhhhhh" for Latin-1 and graphic
@@ -9785,14 +9799,14 @@ Examples of range constraints:
_Extensions to Ada 2005_
63.n/3
- {AI05-0228-1AI05-0228-1} The new aspect Default_Value allows
+ {<AI05-0228-1AI05-0228-1>} The new aspect Default_Value allows
defining implicit initial values (see *note 3.3.1::) for
scalar types.
_Extensions to Ada 2012_
63.o/4
- {AI12-0124-1AI12-0124-1} Corrigendum: An object can be now
+ {<AI12-0124-1AI12-0124-1>} Corrigendum: An object can be now
used as the prefix of the Image attribute (as well as
Wide_Image and Wide_Wide_Image), a convenience feature already
present in some implementations.
@@ -9836,26 +9850,26 @@ File: aarm2012.info, Node: 3.5.1, Next: 3.5.2, Up:
3.5
_Legality Rules_
5/3
-{AI05-0227-1AI05-0227-1} {AI05-0299-1AI05-0299-1} The
+{<AI05-0227-1AI05-0227-1>} {<AI05-0299-1AI05-0299-1>} The
defining_identifiers in upper case [and the defining_character_literals]
listed in an enumeration_type_definition shall be distinct.
5.a/3
- Proof: {AI05-0227-1AI05-0227-1} For character literals, this
+ Proof: {<AI05-0227-1AI05-0227-1>} For character literals, this
is a ramification of the normal disallowance of homographs
explicitly declared immediately in the same declarative
region.
5.b/3
- Reason: {AI05-0227-1AI05-0227-1} To ease implementation of the
- attribute Wide_Wide_Value, we require that all enumeration
+ Reason: {<AI05-0227-1AI05-0227-1>} To ease implementation of
+ the attribute Wide_Wide_Value, we require that all enumeration
literals have distinct images.
_Static Semantics_
6/3
-{AI05-0006-1AI05-0006-1} Each enumeration_literal_specification is the
-explicit declaration of the corresponding enumeration literal: it
+{<AI05-0006-1AI05-0006-1>} Each enumeration_literal_specification is the
+explicit declaration of the corresponding <enumeration literal>: it
declares a parameterless function, whose defining name is the
defining_identifier (*note 3.1: S0022.) or defining_character_literal
(*note 3.5.1: S0040.), and whose result subtype is the base subtype of
@@ -9872,15 +9886,15 @@ the enumeration type.
and it never fails the Elaboration_Check when called.
6.c/3
- Discussion: {AI05-0006-1AI05-0006-1} The result subtype is
+ Discussion: {<AI05-0006-1AI05-0006-1>} The result subtype is
primarily a concern when an enumeration literal is used as the
expression of a case statement, due to the full coverage
requirement based on the nominal subtype.
7
Each enumeration literal corresponds to a distinct value of the
-enumeration type, and to a distinct position number. The position number
-of the value of the first listed enumeration literal is zero; the
+enumeration type, and to a distinct position number. The position
+number of the value of the first listed enumeration literal is zero; the
position number of the value of each subsequent enumeration literal is
one more than that of its predecessor in the list.
@@ -9892,9 +9906,9 @@ follow the order of corresponding position numbers.]
[ If the same defining_identifier or defining_character_literal is
specified in more than one enumeration_type_definition (*note 3.5.1:
S0038.), the corresponding enumeration literals are said to be
-overloaded. At any place where an overloaded enumeration literal occurs
-in the text of a program, the type of the enumeration literal has to be
-determinable from the context (see *note 8.6::).]
+<overloaded>. At any place where an overloaded enumeration literal
+occurs in the text of a program, the type of the enumeration literal has
+to be determinable from the context (see *note 8.6::).]
_Dynamic Semantics_
@@ -9923,7 +9937,7 @@ literal returns the corresponding value of the
enumeration type.
_Examples_
13
-Examples of enumeration types and subtypes:
+<Examples of enumeration types and subtypes: >
14
type Day is (Mon, Tue, Wed, Thu, Fri, Sat, Sun);
@@ -9931,7 +9945,7 @@ Examples of enumeration types and subtypes:
type Gender is (M, F);
type Level is (Low, Medium, Urgent);
type Color is (White, Red, Yellow, Green, Blue, Brown, Black);
- type Light is (Red, Amber, Green); -- Red and Green are overloaded
+ type Light is (Red, Amber, Green); --< Red and Green are overloaded>
15
type Hexa is ('A', 'B', 'C', 'D', 'E', 'F');
@@ -9940,7 +9954,7 @@ Examples of enumeration types and subtypes:
16
subtype Weekday is Day range Mon .. Fri;
subtype Major is Suit range Hearts .. Spades;
- subtype Rainbow is Color range Red .. Blue; -- the Color Red, not the
Light
+ subtype Rainbow is Color range Red .. Blue; --< the Color Red, not the
Light>
_Wording Changes from Ada 83_
@@ -9957,7 +9971,7 @@ Examples of enumeration types and subtypes:
_Incompatibilities With Ada 2005_
16.c/3
- {AI05-0227-1AI05-0227-1} Correction: Required that all
+ {<AI05-0227-1AI05-0227-1>} Correction: Required that all
enumeration literals in a type have distinct images; this
might not be the case since upper case conversion can map
distinct characters to the same upper case character. This
@@ -9972,7 +9986,7 @@ Examples of enumeration types and subtypes:
_Wording Changes from Ada 2005_
16.d/3
- {AI05-0006-1AI05-0006-1} Correction: Defined the result
+ {<AI05-0006-1AI05-0006-1>} Correction: Defined the result
subtype of an enumeration literal to close a minor language
hole.
@@ -9985,29 +9999,29 @@ File: aarm2012.info, Node: 3.5.2, Next: 3.5.3, Prev:
3.5.1, Up: 3.5
_Static Semantics_
1
-An enumeration type is said to be a character type if at least one of
+An enumeration type is said to be a <character type> if at least one of
its enumeration literals is a character_literal.
2/3
-{AI95-00285-01AI95-00285-01} {AI05-0181-1AI05-0181-1}
-{AI05-0262-1AI05-0262-1} {AI05-0266-1AI05-0266-1} The predefined type
-Character is a character type whose values correspond to the 256 code
-points of Row 00 (also known as Latin-1) of the ISO/IEC 10646:2011 Basic
-Multilingual Plane (BMP). Each of the graphic characters of Row 00 of
-the BMP has a corresponding character_literal in Character. Each of the
-nongraphic characters of Row 00 has a corresponding language-defined
+{<AI95-00285-01AI95-00285-01>} {<AI05-0181-1AI05-0181-1>}
+{<AI05-0262-1AI05-0262-1>} {<AI05-0266-1AI05-0266-1>} The predefined
+type Character is a character type whose values correspond to the 256
+code points of Row 00 (also known as Latin-1) of the ISO/IEC 10646:2011
+Basic Multilingual Plane (BMP). Each of the graphic characters of Row 00
+of the BMP has a corresponding character_literal in Character. Each of
+the nongraphic characters of Row 00 has a corresponding language-defined
name, which is not usable as an enumeration literal, but which is usable
with the attributes Image, Wide_Image, Wide_Wide_Image, Value,
Wide_Value, and Wide_Wide_Value; these names are given in the definition
of type Character in *note A.1::, "*note A.1:: The Package Standard",
-but are set in italics.
+but are set in <italics>.
2.a/3
- Discussion: {AI05-0262-1AI05-0262-1} Code point is defined in
- ISO/IEC 10646:2011.
+ Discussion: {<AI05-0262-1AI05-0262-1>} <Code point> is defined
+ in ISO/IEC 10646:2011.
3/3
-{AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} The predefined
+{<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>} The predefined
type Wide_Character is a character type whose values correspond to the
65536 code points of the ISO/IEC 10646:2011 Basic Multilingual Plane
(BMP). Each of the graphic characters of the BMP has a corresponding
@@ -10017,7 +10031,7 @@ as defined for Character. Each of the
graphic_characters has a
corresponding character_literal.
4/3
-{AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} The predefined
+{<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>} The predefined
type Wide_Wide_Character is a character type whose values correspond to
the 2147483648 code points of the ISO/IEC 10646:2011 character set.
Each of the graphic_characters has a corresponding character_literal in
@@ -10026,7 +10040,7 @@ the same character_literal or language-defined name as
defined for
Wide_Character.
5/3
-{AI95-00285-01AI95-00285-01} {AI05-0262-1AI05-0262-1} The characters
+{<AI95-00285-01AI95-00285-01>} {<AI05-0262-1AI05-0262-1>} The characters
whose code point is larger than 16#FF# and which are not
graphic_characters have language-defined names which are formed by
appending to the string "Hex_" the representation of their code point in
@@ -10035,7 +10049,7 @@ names, these names are usable only with the attributes
(Wide_)Wide_Image
and (Wide_)Wide_Value; they are not usable as enumeration literals.
5.a/2
- Reason: {AI95-00285-01AI95-00285-01} The language-defined
+ Reason: {<AI95-00285-01AI95-00285-01>} The language-defined
names are not usable as enumeration literals to avoid
"polluting" the name space. Since Wide_Character and
Wide_Wide_Character are defined in Standard, if the
@@ -10043,7 +10057,7 @@ and (Wide_)Wide_Value; they are not usable as
enumeration literals.
they would hide other nonoverloadable declarations with the
same names in use-d packages.]}
-Paragraphs 6 and 7 were deleted.
+<Paragraphs 6 and 7 were deleted.>
NOTES
@@ -10059,8 +10073,8 @@ Paragraphs 6 and 7 were deleted.
obsolescent package, and we no longer mention it here.
9/3
- 32 {AI05-0299-1AI05-0299-1} A conventional character set such as
- EBCDIC can be declared as a character type; the internal codes of
+ 32 {<AI05-0299-1AI05-0299-1>} A conventional character set such as
+ <EBCDIC> can be declared as a character type; the internal codes of
the characters can be specified by an
enumeration_representation_clause as explained in subclause *note
13.4::.
@@ -10068,7 +10082,7 @@ Paragraphs 6 and 7 were deleted.
_Examples_
10
-Example of a character type:
+<Example of a character type: >
11
type Roman_Digit is ('I', 'V', 'X', 'L', 'C', 'D', 'M');
@@ -10120,19 +10134,20 @@ Example of a character type:
_Inconsistencies With Ada 95_
11.h/2
- {AI95-00285-01AI95-00285-01} Ada 95 defined most characters in
- Wide_Character to be graphic characters, while Ada 2005 uses
- the categorizations from ISO-10646:2003. It also provides
- language-defined names for all nongraphic characters. That
- means that in Ada 2005, Wide_Character'Wide_Value will raise
- Constraint_Error for a string representing a character_literal
- of a nongraphic character, while Ada 95 would have accepted
- it. Similarly, the result of Wide_Character'Wide_Image will
- change for such nongraphic characters.
+ {<AI95-00285-01AI95-00285-01>} Ada 95 defined most characters
+ in Wide_Character to be graphic characters, while Ada 2005
+ uses the categorizations from ISO-10646:2003. It also
+ provides language-defined names for all nongraphic characters.
+ That means that in Ada 2005, Wide_Character'Wide_Value will
+ raise Constraint_Error for a string representing a
+ character_literal of a nongraphic character, while Ada 95
+ would have accepted it. Similarly, the result of
+ Wide_Character'Wide_Image will change for such nongraphic
+ characters.
11.i/3
- {AI95-00395-01AI95-00395-01} {AI05-0005-1AI05-0005-1}
- {AI05-0262-1AI05-0262-1} The language-defined names FFFE and
+ {<AI95-00395-01AI95-00395-01>} {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0262-1AI05-0262-1>} The language-defined names FFFE and
FFFF were replaced by a consistent set of language-defined
names for all nongraphic characters with code points greater
than 16#FF#. That means that in Ada 2005,
@@ -10144,7 +10159,7 @@ Example of a character type:
characters.
11.j/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
Because of the previously mentioned changes to the
Wide_Character'Wide_Image of various character values, the
value of attribute Wide_Width will change for some subtypes of
@@ -10153,7 +10168,7 @@ Example of a character type:
does not change.
11.k/2
- {AI95-00285-01AI95-00285-01} The declaration of
+ {<AI95-00285-01AI95-00285-01>} The declaration of
Wide_Wide_Character in package Standard hides use-visible
declarations with the same defining identifier. In the (very)
unlikely event that an Ada 95 program had depended on such a
@@ -10164,17 +10179,17 @@ Example of a character type:
_Extensions to Ada 95_
11.l/2
- {AI95-00285-01AI95-00285-01} The type Wide_Wide_Character is
+ {<AI95-00285-01AI95-00285-01>} The type Wide_Wide_Character is
new.
_Wording Changes from Ada 95_
11.m/2
- {AI95-00285-01AI95-00285-01} Characters are now defined in
+ {<AI95-00285-01AI95-00285-01>} Characters are now defined in
terms of the entire ISO/IEC 10646:2003 character set.
11.n/3
- {AI95-00285-01AI95-00285-01} {AI05-0248-1AI05-0248-1} We
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0248-1AI05-0248-1>} We
dropped the Implementation Advice for nonstandard
interpretation of character sets; an implementation can do
what it wants in a nonstandard mode, so there isn't much point
@@ -10183,12 +10198,12 @@ Example of a character type:
_Wording Changes from Ada 2005_
11.o/3
- {AI05-0181-1AI05-0181-1} Correction: Removed the position
+ {<AI05-0181-1AI05-0181-1>} Correction: Removed the position
numbers of nongraphic characters from the text, as it is wrong
and thus misleading.
11.p/3
- {AI05-0262-1AI05-0262-1} Changed "code position" to "code
+ {<AI05-0262-1AI05-0262-1>} Changed "code position" to "code
point" consistently throughout the standard, as ISO/IEC
10646:2011 prefers "code point" and we are referring to the
definition in that Standard. This change also reduces
@@ -10206,9 +10221,9 @@ File: aarm2012.info, Node: 3.5.3, Next: 3.5.4, Prev:
3.5.2, Up: 3.5
1
There is a predefined enumeration type named Boolean, [declared in the
-visible part of package Standard]. It has the two enumeration literals
-False and True ordered with the relation False < True. Any descendant of
-the predefined type Boolean is called a boolean type.
+visible part of package Standard]. It has the two enumeration literals
+False and True ordered with the relation False < True. Any descendant
+of the predefined type Boolean is called a <boolean> type.
1.a
Implementation Note: An implementation is not required to
@@ -10227,11 +10242,11 @@ File: aarm2012.info, Node: 3.5.4, Next: 3.5.5,
Prev: 3.5.3, Up: 3.5
1
An integer_type_definition defines an integer type; it defines either a
-signed integer type, or a modular integer type. The base range of a
+<signed> integer type, or a <modular> integer type. The base range of a
signed integer type includes at least the values of the specified range.
A modular type is an integer type with all arithmetic modulo a specified
-positive modulus; such a type corresponds to an unsigned type with
-wrap-around semantics.
+positive <modulus>; such a type corresponds to an unsigned type with
+wrap-around semantics.
_Syntax_
@@ -10240,8 +10255,8 @@ wrap-around semantics.
modular_type_definition
3
- signed_integer_type_definition ::= range static_
- simple_expression .. static_simple_expression
+ signed_integer_type_definition ::= range <static_>
+ simple_expression .. <static_>simple_expression
3.a
Discussion: We don't call this a range_constraint, because it
@@ -10258,13 +10273,13 @@ wrap-around semantics.
the generic type matching rules.
4
- modular_type_definition ::= mod static_expression
+ modular_type_definition ::= mod <static_>expression
_Name Resolution Rules_
5
Each simple_expression in a signed_integer_type_definition is expected
-to be of any integer type; they need not be of the same type. The
+to be of any integer type; they need not be of the same type. The
expression in a modular_type_definition is likewise expected to be of
any integer type.
@@ -10277,7 +10292,7 @@ System.Max_Int.
7
The expression of a modular_type_definition shall be static, and its
-value (the modulus) shall be positive, and shall be no greater than
+value (the <modulus>) shall be positive, and shall be no greater than
System.Max_Binary_Modulus if a power of 2, or no greater than
System.Max_Nonbinary_Modulus if not.
@@ -10300,27 +10315,27 @@ inclusive.
9
A signed_integer_type_definition defines an integer type whose base
range includes at least the values of the simple_expressions and is
-symmetric about zero, excepting possibly an extra negative value. A
+symmetric about zero, excepting possibly an extra negative value. A
signed_integer_type_definition also defines a constrained first subtype
of the type, with a range whose bounds are given by the values of the
simple_expressions, converted to the type being defined.
9.a/2
- Implementation Note: {AI95-00114-01AI95-00114-01} The base
+ Implementation Note: {<AI95-00114-01AI95-00114-01>} The base
range of a signed integer type might be much larger than is
necessary to satisfy the above requirements.
9.a.1/1
To be honest: The conversion mentioned above is not an
- implicit subtype conversion (which is something that happens
+ <implicit subtype conversion> (which is something that happens
at overload resolution, see *note 4.6::), although it happens
implicitly. Therefore, the freezing rules are not invoked on
the type (which is important so that representation items can
- be given for the type).
+ be given for the type).
10
A modular_type_definition defines a modular type whose base range is
-from zero to one less than the given modulus. A modular_type_definition
+from zero to one less than the given modulus. A modular_type_definition
also defines a constrained first subtype of the type with a range that
is the same as the base range of the type.
@@ -10360,14 +10375,14 @@ package Standard:]
14
A type defined by an integer_type_definition is implicitly derived from
-root_integer, an anonymous predefined (specific) integer type, whose
+<root_integer>, an anonymous predefined (specific) integer type, whose
base range is System.Min_Int .. System.Max_Int. However, the base
-range of the new type is not inherited from root_integer, but is instead
-determined by the range or modulus specified by the
-integer_type_definition. [Integer literals are all of the type
-universal_integer, the universal type (see *note 3.4.1::) for the class
-rooted at root_integer, allowing their use with the operations of any
-integer type.]
+range of the new type is not inherited from <root_integer>, but is
+instead determined by the range or modulus specified by the
+integer_type_definition. [Integer literals are all of the type
+<universal_integer>, the universal type (see *note 3.4.1::) for the
+class rooted at <root_integer>, allowing their use with the operations
+of any integer type.]
14.a
Discussion: This implicit derivation is not considered exactly
@@ -10376,54 +10391,54 @@ integer type.]
via a derived_type_definition inherit their base range from
their parent type. A type defined by an
integer_type_definition does not necessarily inherit its base
- range from root_integer. It is not specified whether the
- implicit derivation from root_integer is direct or indirect,
+ range from <root_integer>. It is not specified whether the
+ implicit derivation from <root_integer> is direct or indirect,
not that it really matters. All we want is for all integer
- types to be descendants of root_integer.
+ types to be descendants of <root_integer>.
14.a.1/1
- {8652/00998652/0099} {AI95-00152-01AI95-00152-01} Note that
- this derivation does not imply any inheritance of subprograms.
- Subprograms are inherited only for types derived by a
- derived_type_definition (*note 3.4: S0035.) (see *note 3.4::),
- or a private_extension_declaration (*note 7.3: S0194.) (see
- *note 7.3::, *note 7.3.1::, and *note 12.5.1::).
+ {<8652/00998652/0099>} {<AI95-00152-01AI95-00152-01>} Note
+ that this derivation does not imply any inheritance of
+ subprograms. Subprograms are inherited only for types derived
+ by a derived_type_definition (*note 3.4: S0035.) (see *note
+ 3.4::), or a private_extension_declaration (*note 7.3: S0194.)
+ (see *note 7.3::, *note 7.3.1::, and *note 12.5.1::).
14.b
Implementation Note: It is the intent that even nonstandard
- integer types (see below) will be descendants of root_integer,
- even though they might have a base range that exceeds that of
- root_integer. This causes no problem for static calculations,
- which are performed without range restrictions (see *note
- 4.9::). However for run-time calculations, it is possible
- that Constraint_Error might be raised when using an operator
- of root_integer on the result of 'Val applied to a value of a
- nonstandard integer type.
+ integer types (see below) will be descendants of
+ <root_integer>, even though they might have a base range that
+ exceeds that of <root_integer>. This causes no problem for
+ static calculations, which are performed without range
+ restrictions (see *note 4.9::). However for run-time
+ calculations, it is possible that Constraint_Error might be
+ raised when using an operator of <root_integer> on the result
+ of 'Val applied to a value of a nonstandard integer type.
15
-The position number of an integer value is equal to the value.
+The <position number> of an integer value is equal to the value.
16/2
-{AI95-00340-01AI95-00340-01} For every modular subtype S, the following
-attributes are defined:
+{<AI95-00340-01AI95-00340-01>} For every modular subtype S, the
+following attributes are defined:
16.1/2
S'Mod
- {AI95-00340-01AI95-00340-01} S'Mod denotes a function
+ {<AI95-00340-01AI95-00340-01>} S'Mod denotes a function
with the following specification:
16.2/2
- function S'Mod (Arg : universal_integer)
+ function S'Mod (<Arg> : <universal_integer>)
return S'Base
16.3/2
- This function returns Arg mod S'Modulus, as a value of
+ This function returns <Arg> mod S'Modulus, as a value of
the type of S.
17
S'Modulus
S'Modulus yields the modulus of the type of S, as a value
- of the type universal_integer.
+ of the type <universal_integer>.
_Dynamic Semantics_
@@ -10488,13 +10503,13 @@ be the base range of its type.
in Standard.
26
-An implementation may provide nonstandard integer types, descendants of
-root_integer that are declared outside of the specification of package
-Standard, which need not have all the standard characteristics of a type
-defined by an integer_type_definition. For example, a nonstandard
-integer type might have an asymmetric base range or it might not be
-allowed as an array or loop index (a very long integer). Any type
-descended from a nonstandard integer type is also nonstandard. An
+An implementation may provide <nonstandard integer types>, descendants
+of <root_integer> that are declared outside of the specification of
+package Standard, which need not have all the standard characteristics
+of a type defined by an integer_type_definition. For example, a
+nonstandard integer type might have an asymmetric base range or it might
+not be allowed as an array or loop index (a very long integer). Any
+type descended from a nonstandard integer type is also nonstandard. An
implementation may place arbitrary restrictions on the use of such
types; it is implementation defined whether operators that are
predefined for "any integer type" are defined for a particular
@@ -10514,11 +10529,11 @@ implementation defined for which powers of 2, if any,
this permission is
exercised.
27.1/1
-{8652/00038652/0003} {AI95-00095-01AI95-00095-01} For a one's complement
-machine, implementations may support nonbinary modulus values greater
-than System.Max_Nonbinary_Modulus. It is implementation defined which
-specific values greater than System.Max_Nonbinary_Modulus, if any, are
-supported.
+{<8652/00038652/0003>} {<AI95-00095-01AI95-00095-01>} For a one's
+complement machine, implementations may support nonbinary modulus values
+greater than System.Max_Nonbinary_Modulus. It is implementation defined
+which specific values greater than System.Max_Nonbinary_Modulus, if any,
+are supported.
27.a.1/1
Reason: On a one's complement machine, the natural full word
@@ -10590,10 +10605,10 @@ should support a nonbinary modulus up to Integer'Last.
30
33 Integer literals are of the anonymous predefined integer type
- universal_integer. Other integer types have no literals. However,
- the overload resolution rules (see *note 8.6::, "*note 8.6:: The
- Context of Overload Resolution") allow expressions of the type
- universal_integer whenever an integer type is expected.
+ <universal_integer>. Other integer types have no literals.
+ However, the overload resolution rules (see *note 8.6::, "*note
+ 8.6:: The Context of Overload Resolution") allow expressions of the
+ type <universal_integer> whenever an integer type is expected.
31
34 The same arithmetic operators are predefined for all signed
@@ -10613,7 +10628,7 @@ should support a nonbinary modulus up to Integer'Last.
_Examples_
33
-Examples of integer types and subtypes:
+<Examples of integer types and subtypes: >
34
type Page_Num is range 1 .. 2_000;
@@ -10625,8 +10640,8 @@ Examples of integer types and subtypes:
subtype Buffer_Size is Integer range 0 .. Max;
36
- type Byte is mod 256; -- an unsigned byte
- type Hash_Index is mod 97; -- modulus is prime
+ type Byte is mod 256; --< an unsigned byte>
+ type Hash_Index is mod 97; --< modulus is prime>
_Extensions to Ada 83_
@@ -10657,7 +10672,7 @@ Examples of integer types and subtypes:
We no longer explain integer type definition in terms of an
equivalence to a normal type derivation, except to say that
all integer types are by definition implicitly derived from
- root_integer. This is for various reasons.
+ <root_integer>. This is for various reasons.
36.g
First of all, the equivalence with a type derivation and a
@@ -10678,7 +10693,7 @@ Examples of integer types and subtypes:
implement a given user-defined integer type. Hence, we would
have needed anonymous integer types as parent types for the
implicit derivation anyway. We have simply chosen to identify
- only one anonymous integer type -- root_integer, and stated
+ only one anonymous integer type -- <root_integer>, and stated
that every integer type is derived from it.
36.j
@@ -10692,7 +10707,7 @@ Examples of integer types and subtypes:
_Extensions to Ada 95_
36.k/2
- {AI95-00340-01AI95-00340-01} The Mod attribute is new. It
+ {<AI95-00340-01AI95-00340-01>} The Mod attribute is new. It
eases mixing of signed and unsigned values in an expression,
which can be difficult as there may be no type which can
contain all of the values of both of the types involved.
@@ -10700,9 +10715,9 @@ Examples of integer types and subtypes:
_Wording Changes from Ada 95_
36.l/2
- {8652/00038652/0003} {AI95-00095-01AI95-00095-01} Corrigendum:
- Added additional permissions for modular types on one's
- complement machines.
+ {<8652/00038652/0003>} {<AI95-00095-01AI95-00095-01>}
+ Corrigendum: Added additional permissions for modular types on
+ one's complement machines.
File: aarm2012.info, Node: 3.5.5, Next: 3.5.6, Prev: 3.5.4, Up: 3.5
@@ -10721,12 +10736,12 @@ S'Pos
specification:
3
- function S'Pos(Arg : S'Base)
- return universal_integer
+ function S'Pos(<Arg> : S'Base)
+ return <universal_integer>
4
This function returns the position number of the value of
- Arg, as a value of type universal_integer.
+ <Arg>, as a value of type <universal_integer>.
5
S'Val
@@ -10734,20 +10749,20 @@ S'Val
specification:
6
- function S'Val(Arg : universal_integer)
+ function S'Val(<Arg> : <universal_integer>)
return S'Base
7
This function returns a value of the type of S whose
- position number equals the value of Arg. For the
+ position number equals the value of <Arg>. For the
evaluation of a call on S'Val, if there is no value in
the base range of its type with the given position
number, Constraint_Error is raised.
7.a
Ramification: By the overload resolution rules, a formal
- parameter of type universal_integer allows an actual parameter
- of any integer type.
+ parameter of type <universal_integer> allows an actual
+ parameter of any integer type.
7.b
Reason: We considered allowing S'Val for a signed integer
@@ -10756,27 +10771,27 @@ S'Val
allowance didn't seem worth the complexity of the rule.
7.1/4
-{AI05-0297-1AI05-0297-1} {AI12-0071-1AI12-0071-1} For every static
+{<AI05-0297-1AI05-0297-1>} {<AI12-0071-1AI12-0071-1>} For every static
discrete subtype S for which there exists at least one value belonging
to S that satisfies the predicates of S, the following attributes are
defined:
7.2/4
S'First_Valid
- {AI05-0297-1AI05-0297-1} {AI12-0071-1AI12-0071-1}
+ {<AI05-0297-1AI05-0297-1>} {<AI12-0071-1AI12-0071-1>}
S'First_Valid denotes the smallest value that belongs to
S and satisfies the predicates of S. The value of this
attribute is of the type of S.
7.3/4
S'Last_Valid
- {AI05-0297-1AI05-0297-1} {AI12-0071-1AI12-0071-1}
+ {<AI05-0297-1AI05-0297-1>} {<AI12-0071-1AI12-0071-1>}
S'Last_Valid denotes the largest value that belongs to S
and satisfies the predicates of S. The value of this
attribute is of the type of S.
7.4/3
-{AI05-0297-1AI05-0297-1} [First_Valid and Last_Valid
+{<AI05-0297-1AI05-0297-1>} [First_Valid and Last_Valid
attribute_references are always static expressions. Any explicit
predicate of S can only have been specified by a Static_Predicate
aspect.]
@@ -10804,7 +10819,7 @@ aspect.]
For the evaluation of a call on S'Pos for an enumeration subtype, if the
value of the operand does not correspond to the internal code for any
enumeration literal of its type [(perhaps due to an uninitialized
-variable)], then the implementation should raise Program_Error. This is
+variable)], then the implementation should raise Program_Error. This is
particularly important for enumeration types with noncontiguous internal
codes specified by an enumeration_representation_clause (*note 13.4:
S0311.).
@@ -10829,7 +10844,7 @@ S0311.).
36 Indexing and loop iteration use values of discrete types.
10/3
- 37 {AI05-0299-1AI05-0299-1} The predefined operations of a
+ 37 {<AI05-0299-1AI05-0299-1>} The predefined operations of a
discrete type include the assignment operation, qualification, the
membership tests, and the relational operators; for a boolean type
they include the short-circuit control forms and the logical
@@ -10858,10 +10873,10 @@ S0311.).
_Examples_
14
-Examples of attributes of discrete subtypes:
+<Examples of attributes of discrete subtypes: >
15
- -- For the types and subtypes declared in subclause *note 3.5.1:: the
following hold:
+ --< For the types and subtypes declared in subclause *note 3.5.1:: the
following hold: >
16
-- Color'First = White, Color'Last = Black
@@ -10882,13 +10897,13 @@ Examples of attributes of discrete subtypes:
_Extensions to Ada 2005_
17.b/3
- {AI05-0297-1AI05-0297-1} The attributes S'First_Valid and
+ {<AI05-0297-1AI05-0297-1>} The attributes S'First_Valid and
S'Last_Valid are new.
_Wording Changes from Ada 2012_
17.c/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of the
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of the
attributes S'First_Valid and S'Last_Valid to use the new term
"satisfies the predicates" (see *note 3.2.4::).
@@ -10913,32 +10928,32 @@ fixed point types.
3
A type defined by a real_type_definition is implicitly derived from
-root_real, an anonymous predefined (specific) real type. [Hence, all
+<root_real>, an anonymous predefined (specific) real type. [Hence, all
real types, whether floating point or fixed point, are in the derivation
-class rooted at root_real.]
+class rooted at <root_real>.]
3.a
Ramification: It is not specified whether the derivation from
- root_real is direct or indirect, not that it really matters.
+ <root_real> is direct or indirect, not that it really matters.
All we want is for all real types to be descendants of
- root_real.
+ <root_real>.
3.a.1/1
- {8652/00998652/0099} {AI95-00152-01AI95-00152-01} Note that
- this derivation does not imply any inheritance of subprograms.
- Subprograms are inherited only for types derived by a
- derived_type_definition (*note 3.4: S0035.) (see *note 3.4::),
- or a private_extension_declaration (*note 7.3: S0194.) (see
- *note 7.3::, *note 7.3.1::, and *note 12.5.1::).
+ {<8652/00998652/0099>} {<AI95-00152-01AI95-00152-01>} Note
+ that this derivation does not imply any inheritance of
+ subprograms. Subprograms are inherited only for types derived
+ by a derived_type_definition (*note 3.4: S0035.) (see *note
+ 3.4::), or a private_extension_declaration (*note 7.3: S0194.)
+ (see *note 7.3::, *note 7.3.1::, and *note 12.5.1::).
4
-[ Real literals are all of the type universal_real, the universal type
-(see *note 3.4.1::) for the class rooted at root_real, allowing their
-use with the operations of any real type. Certain multiplying operators
-have a result type of universal_fixed (see *note 4.5.5::), the universal
-type for the class of fixed point types, allowing the result of the
-multiplication or division to be used where any specific fixed point
-type is expected.]
+[ Real literals are all of the type <universal_real>, the universal type
+(see *note 3.4.1::) for the class rooted at <root_real>, allowing their
+use with the operations of any real type. Certain multiplying operators
+have a result type of <universal_fixed> (see *note 4.5.5::), the
+universal type for the class of fixed point types, allowing the result
+of the multiplication or division to be used where any specific fixed
+point type is expected.]
_Dynamic Semantics_
@@ -10950,39 +10965,39 @@ the floating_point_definition or the
fixed_point_definition.
6
An implementation shall perform the run-time evaluation of a use of a
-predefined operator of root_real with an accuracy at least as great as
+predefined operator of <root_real> with an accuracy at least as great as
that of any floating point type definable by a
floating_point_definition.
6.a
Ramification: Static calculations using the operators of
- root_real are exact, as for all static calculations. See
+ <root_real> are exact, as for all static calculations. See
*note 4.9::.
6.b
Implementation Note: The Digits attribute of the type used to
- represent root_real at run time is at least as great as that
+ represent <root_real> at run time is at least as great as that
of any other floating point type defined by a
floating_point_definition, and its safe range includes that of
any such floating point type with the same Digits attribute.
On some machines, there might be real types with less accuracy
but a wider range, and hence run-time calculations with
- root_real might not be able to accommodate all values that can
- be represented at run time in such floating point or fixed
+ <root_real> might not be able to accommodate all values that
+ can be represented at run time in such floating point or fixed
point types.
_Implementation Permissions_
7/2
-{AI95-00114-01AI95-00114-01} [For the execution of a predefined
+{<AI95-00114-01AI95-00114-01>} [For the execution of a predefined
operation of a real type, the implementation need not raise
Constraint_Error if the result is outside the base range of the type, so
long as the correct result is produced, or the Machine_Overflows
attribute of the type is False (see *note G.2::).]
8
-An implementation may provide nonstandard real types, descendants of
-root_real that are declared outside of the specification of package
+An implementation may provide <nonstandard real types>, descendants of
+<root_real> that are declared outside of the specification of package
Standard, which need not have all the standard characteristics of a type
defined by a real_type_definition. For example, a nonstandard real type
might have an asymmetric or unsigned base range, or its predefined
@@ -11004,9 +11019,10 @@ explicit_generic_actual_parameters for formal scalar
types -- see *note
9
40 As stated, real literals are of the anonymous predefined real
- type universal_real. Other real types have no literals. However,
- the overload resolution rules (see *note 8.6::) allow expressions
- of the type universal_real whenever a real type is expected.
+ type <universal_real>. Other real types have no literals.
+ However, the overload resolution rules (see *note 8.6::) allow
+ expressions of the type <universal_real> whenever a real type is
+ expected.
_Wording Changes from Ada 83_
@@ -11022,7 +11038,7 @@ explicit_generic_actual_parameters for formal scalar
types -- see *note
All discussion of model numbers, safe ranges, and machine
numbers is moved to *note 3.5.7::, *note 3.5.8::, and *note
G.2::. Values of a fixed point type are now described as
- being multiples of the small of the fixed point type, and we
+ being multiples of the <small> of the fixed point type, and we
have no need for model numbers, safe ranges, etc. for fixed
point types.
@@ -11041,19 +11057,19 @@ digits.
2
floating_point_definition ::=
- digits static_expression [real_range_specification]
+ digits <static_>expression [real_range_specification]
3
real_range_specification ::=
- range static_simple_expression .. static_simple_expression
+ range <static_>simple_expression .. <static_>simple_expression
_Name Resolution Rules_
4
-The requested decimal precision, which is the minimum number of
+The <requested decimal precision>, which is the minimum number of
significant decimal digits required for the floating point type, is
specified by the value of the expression given after the reserved word
-digits. This expression is expected to be of any integer type.
+digits. This expression is expected to be of any integer type.
5
Each simple_expression of a real_range_specification is expected to be
@@ -11065,18 +11081,18 @@ of any real type[; the types need not be the same].
The requested decimal precision shall be specified by a static
expression whose value is positive and no greater than
System.Max_Base_Digits. Each simple_expression of a
-real_range_specification shall also be static. If the
+real_range_specification shall also be static. If the
real_range_specification is omitted, the requested decimal precision
shall be no greater than System.Max_Digits.
6.a
Reason: We have added Max_Base_Digits to package System. It
- corresponds to the requested decimal precision of root_real.
+ corresponds to the requested decimal precision of <root_real>.
System.Max_Digits corresponds to the maximum value for Digits
that may be specified in the absence of a
real_range_specification, for upward compatibility. These
- might not be the same if root_real has a base range that does
- not include � 10.0**(4*Max_Base_Digits).
+ might not be the same if <root_real> has a base range that
+ does not include � 10.0**(4*Max_Base_Digits).
7
A floating_point_definition is illegal if the implementation does not
@@ -11091,9 +11107,9 @@ precision and range.
8
The set of values for a floating point type is the (infinite) set of
-rational numbers. The machine numbers of a floating point type are the
-values of the type that can be represented exactly in every
-unconstrained variable of the type. The base range (see *note 3.5::) of
+rational numbers. The <machine numbers> of a floating point type are
+the values of the type that can be represented exactly in every
+unconstrained variable of the type. The base range (see *note 3.5::) of
a floating point type is symmetric around zero, except that it can
include some extra negative values in some implementations.
@@ -11110,9 +11126,9 @@ include some extra negative values in some
implementations.
plus zero.
9
-The base decimal precision of a floating point type is the number of
-decimal digits of precision representable in objects of the type. The
-safe range of a floating point type is that part of its base range for
+The <base decimal precision> of a floating point type is the number of
+decimal digits of precision representable in objects of the type. The
+<safe range> of a floating point type is that part of its base range for
which the accuracy corresponding to the base decimal precision is
preserved by all predefined operations.
@@ -11126,7 +11142,7 @@ preserved by all predefined operations.
10
A floating_point_definition defines a floating point type whose base
-decimal precision is no less than the requested decimal precision. If a
+decimal precision is no less than the requested decimal precision. If a
real_range_specification is given, the safe range of the floating point
type (and hence, also its base range) includes at least the values of
the simple expressions given in the real_range_specification. If a
@@ -11137,19 +11153,19 @@ range might include other values as well. The
attributes Safe_First and
Safe_Last give the actual bounds of the safe range.]
11
-A floating_point_definition also defines a first subtype of the type. If
-a real_range_specification is given, then the subtype is constrained to
-a range whose bounds are given by a conversion of the values of the
+A floating_point_definition also defines a first subtype of the type.
+If a real_range_specification is given, then the subtype is constrained
+to a range whose bounds are given by a conversion of the values of the
simple_expressions of the real_range_specification to the type being
defined. Otherwise, the subtype is unconstrained.
11.a.1/1
To be honest: The conversion mentioned above is not an
- implicit subtype conversion (which is something that happens
+ <implicit subtype conversion> (which is something that happens
at overload resolution, see *note 4.6::), although it happens
implicitly. Therefore, the freezing rules are not invoked on
the type (which is important so that representation items can
- be given for the type).
+ be given for the type).
12
There is a predefined, unconstrained, floating point subtype named
@@ -11228,7 +11244,7 @@ library package Interfaces (see *note B.2::).
_Examples_
19
-Examples of floating point types and subtypes:
+<Examples of floating point types and subtypes:>
20
type Coefficient is digits 10 range -1.0 .. 1.0;
@@ -11238,7 +11254,7 @@ Examples of floating point types and subtypes:
type Mass is digits 7 range 0.0 .. 1.0E35;
22
- subtype Probability is Real range 0.0 .. 1.0; -- a subtype with a
smaller range
+ subtype Probability is Real range 0.0 .. 1.0; --< a subtype with a
smaller range>
_Inconsistencies With Ada 83_
@@ -11298,13 +11314,13 @@ The following attribute is defined for every floating
point subtype S:
2/1
S'Digits
- {8652/00048652/0004} {AI95-00203-01AI95-00203-01}
+ {<8652/00048652/0004>} {<AI95-00203-01AI95-00203-01>}
S'Digits denotes the requested decimal precision for the
subtype S. The value of this attribute is of the type
- universal_integer. The requested decimal precision of
- the base subtype of a floating point type T is defined to
- be the largest value of d for which
- ceiling(d * log(10) / log(T'Machine_Radix)) + g <=
+ <universal_integer>. The requested decimal precision of
+ the base subtype of a floating point type <T> is defined
+ to be the largest value of <d> for which
+ ceiling(<d> * log(10) / log(T'Machine_Radix)) + <g> <=
T'Model_Mantissa
where g is 0 if Machine_Radix is a positive power of 10
and 1 otherwise.
@@ -11328,8 +11344,9 @@ S'Digits
_Wording Changes from Ada 95_
4.a/2
- {8652/00048652/0004} {AI95-00203-01AI95-00203-01} Corrigendum:
- Corrected the formula for Digits when the Machine_Radix is 10.
+ {<8652/00048652/0004>} {<AI95-00203-01AI95-00203-01>}
+ Corrigendum: Corrected the formula for Digits when the
+ Machine_Radix is 10.
File: aarm2012.info, Node: 3.5.9, Next: 3.5.10, Prev: 3.5.8, Up: 3.5
@@ -11339,8 +11356,8 @@ File: aarm2012.info, Node: 3.5.9, Next: 3.5.10,
Prev: 3.5.8, Up: 3.5
1
A fixed point type is either an ordinary fixed point type, or a decimal
-fixed point type. The error bound of a fixed point type is specified as
-an absolute value, called the delta of the fixed point type.
+fixed point type. The error bound of a fixed point type is specified as
+an absolute value, called the <delta> of the fixed point type.
_Syntax_
@@ -11350,32 +11367,32 @@ an absolute value, called the delta of the fixed
point type.
3
ordinary_fixed_point_definition ::=
- delta static_expression real_range_specification
+ delta <static_>expression real_range_specification
4
decimal_fixed_point_definition ::=
- delta static_expression digits static_expression [
+ delta <static_>expression digits <static_>expression [
real_range_specification]
5/4
- {AI12-0152-1AI12-0152-1} digits_constraint ::=
- digits static_simple_expression [range_constraint]
+ {<AI12-0152-1AI12-0152-1>} digits_constraint ::=
+ digits <static_>simple_expression [range_constraint]
_Name Resolution Rules_
6
-For a type defined by a fixed_point_definition, the delta of the type is
-specified by the value of the expression given after the reserved word
-delta; this expression is expected to be of any real type. For a type
-defined by a decimal_fixed_point_definition (a decimal fixed point
-type), the number of significant decimal digits for its first subtype
-(the digits of the first subtype) is specified by the expression given
-after the reserved word digits; this expression is expected to be of any
-integer type.
+For a type defined by a fixed_point_definition, the <delta> of the type
+is specified by the value of the expression given after the reserved
+word delta; this expression is expected to be of any real type. For a
+type defined by a decimal_fixed_point_definition (a <decimal> fixed
+point type), the number of significant decimal digits for its first
+subtype (the <digits> of the first subtype) is specified by the
+expression given after the reserved word digits; this expression is
+expected to be of any integer type.
6.1/4
-{AI12-0159-1AI12-0159-1} The simple_expression of a digits_constraint is
-expected to be of any integer type.
+{<AI12-0159-1AI12-0159-1>} The simple_expression of a digits_constraint
+is expected to be of any integer type.
_Legality Rules_
@@ -11385,35 +11402,35 @@ after the reserved words delta and digits shall be
static; their values
shall be positive.
8/2
-{AI95-00100-01AI95-00100-01} The set of values of a fixed point type
-comprise the integral multiples of a number called the small of the
-type. The machine numbers of a fixed point type are the values of the
+{<AI95-00100-01AI95-00100-01>} The set of values of a fixed point type
+comprise the integral multiples of a number called the <small> of the
+type. The <machine numbers> of a fixed point type are the values of the
type that can be represented exactly in every unconstrained variable of
-the type. For a type defined by an ordinary_fixed_point_definition (an
-ordinary fixed point type), the small may be specified by an
+the type. For a type defined by an ordinary_fixed_point_definition (an
+<ordinary> fixed point type), the <small> may be specified by an
attribute_definition_clause (*note 13.3: S0310.) (see *note 13.3::); if
-so specified, it shall be no greater than the delta of the type. If not
-specified, the small of an ordinary fixed point type is an
-implementation-defined power of two less than or equal to the delta.
+so specified, it shall be no greater than the <delta> of the type. If
+not specified, the <small> of an ordinary fixed point type is an
+implementation-defined power of two less than or equal to the <delta>.
8.a
- Implementation defined: The small of an ordinary fixed point
+ Implementation defined: The <small> of an ordinary fixed point
type.
9
-For a decimal fixed point type, the small equals the delta; the delta
-shall be a power of 10. If a real_range_specification is given, both
-bounds of the range shall be in the range -(10**digits-1)*delta ..
-+(10**digits-1)*delta.
+For a decimal fixed point type, the <small> equals the <delta>; the
+<delta> shall be a power of 10. If a real_range_specification is given,
+both bounds of the range shall be in the range -(10**<digits>-1)*<delta>
+.. +(10**<digits>-1)*<delta>.
10
A fixed_point_definition is illegal if the implementation does not
-support a fixed point type with the given small and specified range or
-digits.
+support a fixed point type with the given <small> and specified range or
+<digits>.
10.a
- Implementation defined: What combinations of small, range, and
- digits are supported for fixed point types.
+ Implementation defined: What combinations of <small>, range,
+ and <digits> are supported for fixed point types.
11
For a subtype_indication with a digits_constraint, the subtype_mark
@@ -11432,10 +11449,10 @@ implementations.
13
An ordinary_fixed_point_definition defines an ordinary fixed point type
-whose base range includes at least all multiples of small that are
+whose base range includes at least all multiples of <small> that are
between the bounds specified in the real_range_specification. The base
range of the type does not necessarily include the specified bounds
-themselves. An ordinary_fixed_point_definition (*note 3.5.9: S0048.)
+themselves. An ordinary_fixed_point_definition (*note 3.5.9: S0048.)
also defines a constrained first subtype of the type, with each bound of
its range given by the closer to zero of:
@@ -11445,32 +11462,32 @@ its range given by the closer to zero of:
14.a.1/1
To be honest: The conversion mentioned above is not an
- implicit subtype conversion (which is something that happens
+ <implicit subtype conversion> (which is something that happens
at overload resolution, see *note 4.6::), although it happens
implicitly. Therefore, the freezing rules are not invoked on
the type (which is important so that representation items can
- be given for the type).
+ be given for the type).
15
* the corresponding bound of the base range.
16
A decimal_fixed_point_definition defines a decimal fixed point type
-whose base range includes at least the range -(10**digits-1)*delta ..
-+(10**digits-1)*delta. A decimal_fixed_point_definition also defines a
-constrained first subtype of the type. If a real_range_specification is
-given, the bounds of the first subtype are given by a conversion of the
-values of the expressions of the real_range_specification. Otherwise,
-the range of the first subtype is -(10**digits-1)*delta ..
-+(10**digits-1)*delta.
+whose base range includes at least the range -(10**<digits>-1)*<delta>
+.. +(10**<digits>-1)*<delta>. A decimal_fixed_point_definition also
+defines a constrained first subtype of the type. If a
+real_range_specification is given, the bounds of the first subtype are
+given by a conversion of the values of the expressions of the
+real_range_specification. Otherwise, the range of the first subtype is
+-(10**<digits>-1)*<delta> .. +(10**<digits>-1)*<delta>.
16.a.1/1
To be honest: The conversion mentioned above is not an
- implicit subtype conversion (which is something that happens
+ <implicit subtype conversion> (which is something that happens
at overload resolution, see *note 4.6::), although it happens
implicitly. Therefore, the freezing rules are not invoked on
the type (which is important so that representation items can
- be given for the type).
+ be given for the type).
_Dynamic Semantics_
@@ -11479,18 +11496,18 @@ The elaboration of a fixed_point_definition creates
the fixed point type
and its first subtype.
18/4
-{AI12-0152-1AI12-0152-1} For a digits_constraint on a decimal fixed
-point subtype with a given delta, if it does not have a
-range_constraint, then it specifies an implicit range -(10**D-1)*delta
-.. +(10**D-1)*delta, where D is the value of the simple_expression. A
-digits_constraint is compatible with a decimal fixed point subtype if
-the value of the simple_expression is no greater than the digits of the
-subtype, and if it specifies (explicitly or implicitly) a range that is
-compatible with the subtype.
+{<AI12-0152-1AI12-0152-1>} For a digits_constraint on a decimal fixed
+point subtype with a given <delta>, if it does not have a
+range_constraint, then it specifies an implicit range
+-(10**<D>-1)*<delta> .. +(10**<D>-1)*<delta>, where <D> is the value of
+the simple_expression. A digits_constraint is <compatible> with a
+decimal fixed point subtype if the value of the simple_expression is no
+greater than the <digits> of the subtype, and if it specifies
+(explicitly or implicitly) a range that is compatible with the subtype.
18.a
- Discussion: Except for the requirement that the digits
- specified be no greater than the digits of the subtype being
+ Discussion: Except for the requirement that the <digits>
+ specified be no greater than the <digits> of the subtype being
constrained, a digits_constraint is essentially equivalent to
a range_constraint.
@@ -11508,12 +11525,12 @@ compatible with the subtype.
compatible.
18.e/2
- {AI95-00114-01AI95-00114-01} A value of a scalar type belongs
- to a constrained subtype of the type if it belongs to the
- range of the subtype. Attributes like Digits and Delta have
- no effect on this fundamental rule. So the obsolescent forms
- of digits_constraints and delta_constraints that are called
- "accuracy constraints" in RM83 don't really represent
+ {<AI95-00114-01AI95-00114-01>} A value of a scalar type
+ belongs to a constrained subtype of the type if it belongs to
+ the range of the subtype. Attributes like Digits and Delta
+ have no effect on this fundamental rule. So the obsolescent
+ forms of digits_constraints and delta_constraints that are
+ called "accuracy constraints" in RM83 don't really represent
constraints on the values of the subtype, but rather primarily
affect compatibility of the "constraint" with the subtype
being "constrained." In this sense, they might better be
@@ -11521,18 +11538,18 @@ compatible with the subtype.
18.f
Note that the digits_constraint on a decimal fixed point
- subtype is a combination of an assertion about the digits of
+ subtype is a combination of an assertion about the <digits> of
the subtype being further constrained, and a constraint on the
range of the subtype being defined, either explicit or
implicit.
19/4
-{AI12-0152-1AI12-0152-1} The elaboration of a digits_constraint consists
-of the elaboration of the range_constraint, if any. If a
+{<AI12-0152-1AI12-0152-1>} The elaboration of a digits_constraint
+consists of the elaboration of the range_constraint, if any. If a
range_constraint is given, a check is made that the bounds of the range
-are both in the range -(10**D-1)*delta .. +(10**D-1)*delta, where D is
-the value of the (static) simple_expression given after the reserved
-word digits. If this check fails, Constraint_Error is raised.
+are both in the range -(10**<D>-1)*<delta> .. +(10**<D>-1)*<delta>,
+where <D> is the value of the (static) simple_expression given after the
+reserved word digits. If this check fails, Constraint_Error is raised.
_Implementation Requirements_
@@ -11542,28 +11559,29 @@ The implementation shall support at least 24 bits of
precision
20.a
Reason: This is sufficient to represent Standard.Duration with
- a small no more than 50 milliseconds.
+ a <small> no more than 50 milliseconds.
_Implementation Permissions_
21
-Implementations are permitted to support only smalls that are a power of
-two. In particular, all decimal fixed point type declarations can be
+Implementations are permitted to support only <small>s that are a power
+of two. In particular, all decimal fixed point type declarations can be
disallowed. Note however that conformance with the Information Systems
-Annex requires support for decimal smalls, and decimal fixed point type
-declarations with digits up to at least 18.
+Annex requires support for decimal <small>s, and decimal fixed point
+type declarations with <digits> up to at least 18.
21.a
Implementation Note: The accuracy requirements for
multiplication, division, and conversion (see *note G.2.1::,
"*note G.2.1:: Model of Floating Point Arithmetic") are such
- that support for arbitrary smalls should be practical without
- undue implementation effort. Therefore, implementations
- should support fixed point types with arbitrary values for
- small (within reason). One reasonable limitation would be to
- limit support to fixed point types that can be converted to
- the most precise floating point type without loss of precision
- (so that Fixed_IO is implementable in terms of Float_IO).
+ that support for arbitrary <small>s should be practical
+ without undue implementation effort. Therefore,
+ implementations should support fixed point types with
+ arbitrary values for <small> (within reason). One reasonable
+ limitation would be to limit support to fixed point types that
+ can be converted to the most precise floating point type
+ without loss of precision (so that Fixed_IO is implementable
+ in terms of Float_IO).
NOTES
@@ -11574,7 +11592,7 @@ declarations with digits up to at least 18.
23
type Fraction is delta 2.0**(-15) range -1.0 .. 1.0;
-
+
24
With 2's complement hardware, such a type could have a signed
@@ -11584,40 +11602,40 @@ declarations with digits up to at least 18.
_Examples_
25
-Examples of fixed point types and subtypes:
+<Examples of fixed point types and subtypes:>
26
type Volt is delta 0.125 range 0.0 .. 255.0;
27
- -- A pure fraction which requires all the available
- -- space in a word can be declared as the type Fraction:
+ -- <A pure fraction which requires all the available>
+ -- <space in a word can be declared as the type Fraction:>
type Fraction is delta System.Fine_Delta range -1.0 .. 1.0;
- -- Fraction'Last = 1.0 - System.Fine_Delta
+ -- <Fraction'Last = 1.0 - System.Fine_Delta>
28
- type Money is delta 0.01 digits 15; -- decimal fixed point
+ type Money is delta 0.01 digits 15; -- <decimal fixed point>
subtype Salary is Money digits 10;
- -- Money'Last = 10.0**13 - 0.01, Salary'Last = 10.0**8 - 0.01
+ -- <Money'Last = 10.0**13 - 0.01, Salary'Last = 10.0**8 - 0.01>
_Inconsistencies With Ada 83_
28.a
In Ada 95, S'Small always equals S'Base'Small, so if an
- implementation chooses a small for a fixed point type smaller
- than required by the delta, the value of S'Small in Ada 95
- might not be the same as it was in Ada 83.
+ implementation chooses a <small> for a fixed point type
+ smaller than required by the <delta>, the value of S'Small in
+ Ada 95 might not be the same as it was in Ada 83.
_Extensions to Ada 83_
28.b/3
- {AI05-0005-1AI05-0005-1} Decimal fixed point types are new,
+ {<AI05-0005-1AI05-0005-1>} Decimal fixed point types are new,
though their capabilities are essentially similar to that
- available in Ada 83 with a fixed point type whose small equals
- its delta and both are a power of 10. However, in the
- Information Systems Annex, additional requirements are placed
- on the support of decimal fixed point types (e.g. a minimum
- of 18 digits of precision).
+ available in Ada 83 with a fixed point type whose <small>
+ equals its <delta> and both are a power of 10. However, in
+ the Information Systems Annex, additional requirements are
+ placed on the support of decimal fixed point types (e.g. a
+ minimum of 18 digits of precision).
_Wording Changes from Ada 83_
@@ -11631,14 +11649,14 @@ Examples of fixed point types and subtypes:
_Wording Changes from Ada 95_
28.d/2
- {AI95-00100-01AI95-00100-01} Added wording to define the
+ {<AI95-00100-01AI95-00100-01>} Added wording to define the
machine numbers of fixed point types; this is needed by the
static evaluation rules.
_Incompatibilities With Ada 2012_
28.e/4
- {AI12-0152-1AI12-0152-1} Corrigendum: Changed the syntax so
+ {<AI12-0152-1AI12-0152-1>} Corrigendum: Changed the syntax so
that the value following digits in a digits_constraint is a
simple_expression. This is compatible with one very unlikely
exception: if the digits expression is a static expression of
@@ -11650,7 +11668,7 @@ Examples of fixed point types and subtypes:
_Wording Changes from Ada 2012_
28.f/4
- {AI12-0159-1AI12-0159-1} Corrigendum:Added wording to define
+ {<AI12-0159-1AI12-0159-1>} Corrigendum:Added wording to define
the expected type for a digits_constraint. This was missing
since Ada 95, but as it is obvious and unchanged from Ada 83,
we don't consider it an incompatibility.
@@ -11668,13 +11686,13 @@ The following attributes are defined for every fixed
point subtype S:
2/1
S'Small
- {8652/00058652/0005} {AI95-00054-01AI95-00054-01} S'Small
- denotes the small of the type of S. The value of this
- attribute is of the type universal_real. Small may be
- specified for nonderived ordinary fixed point types via
- an attribute_definition_clause (*note 13.3: S0310.) (see
- *note 13.3::); the expression of such a clause shall be
- static.
+ {<8652/00058652/0005>} {<AI95-00054-01AI95-00054-01>}
+ S'Small denotes the <small> of the type of S. The value
+ of this attribute is of the type <universal_real>. Small
+ may be specified for nonderived ordinary fixed point
+ types via an attribute_definition_clause (*note 13.3:
+ S0310.) (see *note 13.3::); the expression of such a
+ clause shall be static.
2.a/3
Aspect Description for Small: Scale factor for a fixed point
@@ -11682,14 +11700,14 @@ S'Small
3
S'Delta
- S'Delta denotes the delta of the fixed point subtype S.
+ S'Delta denotes the <delta> of the fixed point subtype S.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
3.a
- Reason: The delta is associated with the subtype as opposed to
- the type, because of the possibility of an (obsolescent)
- delta_constraint.
+ Reason: The <delta> is associated with the <sub>type as
+ opposed to the type, because of the possibility of an
+ (obsolescent) delta_constraint.
4
S'Fore
@@ -11700,17 +11718,18 @@ S'Fore
a one-character prefix that is either a minus sign or a
space. (This minimum number does not include superfluous
zeros or underlines, and is at least 2.) The value of
- this attribute is of the type universal_integer.
+ this attribute is of the type <universal_integer>.
5
S'Aft
S'Aft yields the number of decimal digits needed after
- the decimal point to accommodate the delta of the subtype
- S, unless the delta of the subtype S is greater than 0.1,
- in which case the attribute yields the value one.
- [(S'Aft is the smallest positive integer N for which
- (10**N)*S'Delta is greater than or equal to one.)] The
- value of this attribute is of the type universal_integer.
+ the decimal point to accommodate the <delta> of the
+ subtype S, unless the <delta> of the subtype S is greater
+ than 0.1, in which case the attribute yields the value
+ one. [(S'Aft is the smallest positive integer N for
+ which (10**N)*S'Delta is greater than or equal to one.)]
+ The value of this attribute is of the type
+ <universal_integer>.
6
The following additional attributes are defined for every decimal fixed
@@ -11718,11 +11737,12 @@ point subtype S:
7
S'Digits
- S'Digits denotes the digits of the decimal fixed point
+ S'Digits denotes the <digits> of the decimal fixed point
subtype S, which corresponds to the number of decimal
digits that are representable in objects of the subtype.
The value of this attribute is of the type
- universal_integer. Its value is determined as follows:
+ <universal_integer>. Its value is determined as follows:
+
8
* For a first subtype or a subtype defined by a
@@ -11745,17 +11765,18 @@ S'Digits
10
* The digits of a base subtype is the largest integer
- D such that the range -(10**D-1)*delta ..
- +(10**D-1)*delta is included in the base range of
- the type.
+ <D> such that the range -(10**<D>-1)*<delta> ..
+ +(10**<D>-1)*<delta> is included in the base range
+ of the type.
11
S'Scale
- S'Scale denotes the scale of the subtype S, defined as
+ S'Scale denotes the <scale> of the subtype S, defined as
the value N such that S'Delta = 10.0**(-N). [The scale
indicates the position of the point relative to the
rightmost significant digits of values of subtype S.] The
- value of this attribute is of the type universal_integer.
+ value of this attribute is of the type
+ <universal_integer>.
11.a
Ramification: S'Scale is negative if S'Delta is greater than
@@ -11767,7 +11788,7 @@ S'Round
specification:
13
- function S'Round(X : universal_real)
+ function S'Round(<X> : <universal_real>)
return S'Base
14
@@ -11802,9 +11823,9 @@ S'Round
_Wording Changes from Ada 95_
18.a/2
- {8652/00058652/0005} {AI95-00054-01AI95-00054-01} Corrigendum:
- Clarified that small may be specified only for ordinary fixed
- point types.
+ {<8652/00058652/0005>} {<AI95-00054-01AI95-00054-01>}
+ Corrigendum: Clarified that <small> may be specified only for
+ ordinary fixed point types.
File: aarm2012.info, Node: 3.6, Next: 3.7, Prev: 3.5, Up: 3
@@ -11813,11 +11834,11 @@ File: aarm2012.info, Node: 3.6, Next: 3.7, Prev:
3.5, Up: 3
===============
1
-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.
+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_
@@ -11839,10 +11860,11 @@ components.
discrete_subtype_definition}) of component_definition
6
- discrete_subtype_definition ::= discrete_subtype_indication | range
+ discrete_subtype_definition ::= <discrete_>subtype_indication |
+ range
7/2
- {AI95-00230-01AI95-00230-01} {AI95-00406-01AI95-00406-01}
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00406-01AI95-00406-01>}
component_definition ::=
[aliased] subtype_indication
| [aliased] access_definition
@@ -11853,23 +11875,24 @@ components.
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 *note 8.6::).]
+range itself (plus the preference for <root_integer> -- see *note
+8.6::).]
_Legality Rules_
9
Each index_subtype_definition or discrete_subtype_definition in an
-array_type_definition defines an index subtype; its type (the index
-type) shall be discrete.
+array_type_definition defines an <index subtype>; its type (the <index
+type>) shall be discrete.
9.a
- Discussion: An index is a discrete quantity used to select
+ Discussion: An <index> is a discrete quantity used to select
along a given dimension of an array. A component is selected
by specifying corresponding values for each of the indices.
10
The subtype defined by the subtype_indication of a component_definition
-(the component subtype) shall be a definite subtype.
+(the <component subtype>) shall be a definite subtype.
10.a
Ramification: This applies to all uses of
@@ -11877,12 +11900,12 @@ The subtype defined by the subtype_indication of a
component_definition
protected_definitions.
11/2
-This paragraph was deleted.{AI95-00363-01AI95-00363-01}
+<This paragraph was deleted.>{<AI95-00363-01AI95-00363-01>}
_Static Semantics_
12
-An array is characterized by the number of indices (the dimensionality
+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.
@@ -11893,11 +11916,11 @@ 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.
+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.
14
An array_type_definition defines an array type and its first subtype.
@@ -11912,19 +11935,19 @@ An unconstrained_array_definition defines an array
type with an
unconstrained first subtype. Each index_subtype_definition (*note 3.6:
S0053.) defines the corresponding index subtype to be the subtype
denoted by the subtype_mark (*note 3.2.2: S0028.). [ The compound
-delimiter <> (called a box) of an index_subtype_definition stands for an
-undefined range (different objects of the type need not have the same
+delimiter <> (called a <box>) of an index_subtype_definition stands for
+an undefined range (different objects of the type need not have the same
bounds).]
16
A constrained_array_definition defines an array type with a constrained
first subtype. Each discrete_subtype_definition (*note 3.6: S0055.)
defines the corresponding index subtype, as well as the corresponding
-index range for the constrained first subtype. The constraint of the
+index range for the constrained first subtype. The <constraint> of the
first subtype consists of the bounds of the index ranges.
16.a/3
- Discussion: {AI05-0005-1AI05-0005-1} Although there is no
+ Discussion: {<AI05-0005-1AI05-0005-1>} Although there is no
nameable unconstrained array subtype in this case, the
predefined slicing and concatenation operations can operate on
and yield values that do not necessarily belong to the first
@@ -11936,7 +11959,7 @@ The discrete subtype defined by a
discrete_subtype_definition (*note
3.2.2: S0027.), or a subtype determined by the range as follows:
18
- * If the type of the range resolves to root_integer, then the
+ * 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;
@@ -11944,12 +11967,12 @@ The discrete subtype defined by a
discrete_subtype_definition (*note
18.a
Reason: This ensures that indexing over the discrete subtype
can be performed with regular Integers, rather than only
- universal_integers.
+ <universal_integer>s.
18.b
Discussion: We considered doing this by simply creating a
- "preference" for Integer when resolving the range. However,
- this can introduce Beaujolais effects when the
+ "preference" for Integer when resolving the range. However,
+ this can introduce <Beaujolais> effects when the
simple_expressions involve calls on functions visible due to
use clauses.
@@ -11972,14 +11995,14 @@ discrete_subtype_definition (*note 3.6: S0055.)s and
the
component_definition (*note 3.6: S0056.).
22/2
-{8652/00028652/0002} {AI95-00171-01AI95-00171-01}
-{AI95-00230-01AI95-00230-01} The elaboration of a
+{<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+{<AI95-00230-01AI95-00230-01>} The elaboration of a
discrete_subtype_definition that does not contain any per-object
expressions creates the discrete subtype, and consists of the
elaboration of the subtype_indication (*note 3.2.2: S0027.) or the
evaluation of the range. The elaboration of a
discrete_subtype_definition that contains one or more per-object
-expressions is defined in *note 3.8::. The elaboration of a
+expressions is defined in *note 3.8::. The elaboration of a
component_definition (*note 3.6: S0056.) in an array_type_definition
(*note 3.6: S0051.) consists of the elaboration of the
subtype_indication (*note 3.2.2: S0027.) or access_definition. The
@@ -11990,9 +12013,9 @@ performed in an arbitrary order.
_Static Semantics_
22.1/3
-{AI05-0228-1AI05-0228-1} For an array type with a scalar component type,
-the following language-defined representation aspect may be specified
-with an aspect_specification (see *note 13.1.1::):
+{<AI05-0228-1AI05-0228-1>} For an array type with a scalar component
+type, the following language-defined representation aspect may be
+specified with an aspect_specification (see *note 13.1.1::):
22.2/3
Default_Component_Value
@@ -12018,9 +12041,9 @@ Default_Component_Value
for the components of an array-of-scalar subtype.
22.3/3
-{AI05-0228-1AI05-0228-1} If a derived type with no primitive subprograms
-inherits a boolean Default_Component_Value aspect, the aspect may be
-specified to have any value for the derived type.
+{<AI05-0228-1AI05-0228-1>} If a derived type with no primitive
+subprograms inherits a boolean Default_Component_Value aspect, the
+aspect may be specified to have any value for the derived type.
22.d/3
Reason: This overrides the *note 13.1.1:: rule that says that
@@ -12029,9 +12052,10 @@ specified to have any value for the derived type.
_Name Resolution Rules_
22.4/3
-{AI05-0228-1AI05-0228-1} The expected type for the expression specified
-for the Default_Component_Value aspect is the component type of the
-array type defined by the full_type_declaration on which it appears.
+{<AI05-0228-1AI05-0228-1>} The expected type for the expression
+specified for the Default_Component_Value aspect is the component type
+of the array type defined by the full_type_declaration on which it
+appears.
NOTES
@@ -12050,16 +12074,16 @@ array type defined by the full_type_declaration on
which it appears.
_Examples_
25
-Examples of type declarations with unconstrained array definitions:
+<Examples of type declarations with unconstrained array definitions: >
26
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 *note
3.5.2::
+ type Roman is array(Positive range <>) of Roman_Digit; --< see *note
3.5.2::>
27
-Examples of type declarations with constrained array definitions:
+<Examples of type declarations with constrained array definitions: >
28
type Table is array(1 .. 10) of Integer;
@@ -12067,17 +12091,17 @@ Examples of type declarations with constrained array
definitions:
type Line is array(1 .. Max_Line_Size) of Character;
29
-Examples of object declarations with array type definitions:
+<Examples of object declarations with array type definitions: >
30/2
- {AI95-00433-01AI95-00433-01} Grid : array(1 .. 80, 1 .. 100) of
Boolean;
+ {<AI95-00433-01AI95-00433-01>} 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 *note
4.3.3::
+ Page : array(Positive range <>) of Line := --< an array of arrays>
+ (1 | 50 => Line'(1 | Line'Last => '+', others => '-'), --< see *note
4.3.3::>
2 .. 49 => Line'(1 | Line'Last => '|', others => ' '));
- -- Page is constrained by its initial value to (1..50)
+ --< Page is constrained by its initial value to (1..50)>
_Extensions to Ada 83_
@@ -12089,7 +12113,7 @@ Examples of object declarations with array type
definitions:
The syntax rules for unconstrained_array_definition and
constrained_array_definition are modified to use
component_definition (instead of
- component_subtype_indication). The effect of this change is
+ <component_>subtype_indication). The effect of this change is
to allow the reserved word aliased before the component
subtype_indication.
@@ -12122,11 +12146,11 @@ Examples of object declarations with array type
definitions:
_Extensions to Ada 95_
30.g/2
- {AI95-00230-01AI95-00230-01} {AI95-00406-01AI95-00406-01}
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00406-01AI95-00406-01>}
Array components can have an anonymous access type.
30.h/2
- {AI95-00363-01AI95-00363-01} The prohibition against
+ {<AI95-00363-01AI95-00363-01>} The prohibition against
unconstrained discriminated aliased components has been
lifted. It has been replaced by a prohibition against the
actual troublemakers: general access discriminant constraints
@@ -12135,14 +12159,14 @@ Examples of object declarations with array type
definitions:
_Wording Changes from Ada 95_
30.i/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Added wording to allow the elaboration of per-object
- constraints for constrained arrays.
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Added wording to allow the elaboration of
+ per-object constraints for constrained arrays.
_Extensions to Ada 2005_
30.j/3
- {AI05-0228-1AI05-0228-1} The new aspect
+ {<AI05-0228-1AI05-0228-1>} The new aspect
Default_Component_Value allows defining implicit initial
values (see *note 3.3.1::) for arrays of scalar types.
@@ -12168,13 +12192,13 @@ index of an array subtype, and thereby the
corresponding array bounds.
index_constraint ::= (discrete_range {, discrete_range})
3
- discrete_range ::= discrete_subtype_indication | range
+ discrete_range ::= <discrete_>subtype_indication | range
_Name Resolution Rules_
4
The type of a discrete_range is the type of the subtype defined by the
-subtype_indication, or the type of the range. For an index_constraint,
+subtype_indication, or the type of the range. For an index_constraint,
each discrete_range shall resolve to be of the type of the corresponding
index.
@@ -12201,13 +12225,13 @@ by the range of the subtype defined by the
subtype_indication.
_Dynamic Semantics_
7
-An index_constraint is compatible with an unconstrained array subtype if
-and only if the index range defined by each discrete_range is compatible
-(see *note 3.5::) with the corresponding index subtype. If any of the
-discrete_ranges defines a null range, any array thus constrained is a
-null array, having no components. An array value satisfies an
-index_constraint if at each index position the array value and the
-index_constraint have the same index bounds.
+An index_constraint is <compatible> with an unconstrained array subtype
+if and only if the index range defined by each discrete_range is
+compatible (see *note 3.5::) with the corresponding index subtype. If
+any of the discrete_ranges defines a null range, any array thus
+constrained is a <null array>, having no components. An array value
+<satisfies> an index_constraint if at each index position the array
+value and the index_constraint have the same index bounds.
7.a
Ramification: There is no need to define compatibility with a
@@ -12216,7 +12240,7 @@ index_constraint have the same index bounds.
8
The elaboration of an index_constraint consists of the evaluation of the
-discrete_range(s), in an arbitrary order. The evaluation of a
+discrete_range(s), in an arbitrary order. The evaluation of a
discrete_range consists of the elaboration of the subtype_indication or
the evaluation of the range.
@@ -12237,24 +12261,24 @@ the evaluation of the range.
_Examples_
11
-Examples of array declarations including an index constraint:
+<Examples of array declarations including an index constraint: >
12
- Board : Matrix(1 .. 8, 1 .. 8); -- see *note 3.6::
+ Board : Matrix(1 .. 8, 1 .. 8); --< see *note 3.6::>
Rectangle : Matrix(1 .. 20, 1 .. 30);
- Inverse : Matrix(1 .. N, 1 .. N); -- N need not be static
+ Inverse : Matrix(1 .. N, 1 .. N); --< N need not be static >
13
Filter : Bit_Vector(0 .. 31);
14
-Example of array declaration with a constrained array subtype:
+<Example of array declaration with a constrained array subtype: >
15
- My_Schedule : Schedule; -- all arrays of type Schedule have the same
bounds
+ My_Schedule : Schedule; --< all arrays of type Schedule have the same
bounds>
16
-Example of record type with a component that is an array:
+<Example of record type with a component that is an array: >
17
type Var_Line(Length : Natural) is
@@ -12263,7 +12287,7 @@ Example of record type with a component that is an
array:
end record;
18
- Null_Line : Var_Line(0); -- Null_Line.Image is a null array
+ Null_Line : Var_Line(0); --< Null_Line.Image is a null array>
_Extensions to Ada 83_
@@ -12307,7 +12331,7 @@ dimensionality of the array.
_Static Semantics_
2/1
-{8652/00068652/0006} {AI95-00030-01AI95-00030-01} The following
+{<8652/00068652/0006>} {<AI95-00030-01AI95-00030-01>} The following
attributes are defined for a prefix A that is of an array type [(after
any implicit dereference)], or denotes a constrained array subtype:
@@ -12351,18 +12375,18 @@ A'Range(N)
A'Length
A'Length denotes the number of values of the first index
range (zero for a null range); its type is
- universal_integer.
+ <universal_integer>.
10
A'Length(N)
A'Length(N) denotes the number of values of the N-th
index range (zero for a null range); its type is
- universal_integer.
+ <universal_integer>.
_Implementation Advice_
11/3
-{AI05-0229-1AI05-0229-1} An implementation should normally represent
+{<AI05-0229-1AI05-0229-1>} An implementation should normally represent
multidimensional arrays in row-major order, consistent with the notation
used for multidimensional array aggregates (see *note 4.3.3::).
However, if convention Fortran is specified for a multidimensional array
@@ -12401,7 +12425,7 @@ type, then column-major order should be used instead
(see *note B.5::,
operators are also included.
16/2
- 56 {AI95-00287-01AI95-00287-01} A component of an array can be
+ 56 {<AI95-00287-01AI95-00287-01>} A component of an array can be
named with an indexed_component. A value of an array type can be
specified with an array_aggregate. For a one-dimensional array
type, a slice of the array can be named; also, string literals are
@@ -12410,8 +12434,8 @@ type, then column-major order should be used instead
(see *note B.5::,
_Examples_
17
-Examples (using arrays declared in the examples of subclause *note
-3.6.1::):
+<Examples (using arrays declared in the examples of subclause *note
+3.6.1::):>
18
-- Filter'First = 0 Filter'Last = 31 Filter'Length =
32
@@ -12427,10 +12451,10 @@ File: aarm2012.info, Node: 3.6.3, Prev: 3.6.2, Up:
3.6
1
A one-dimensional array type whose component type is a character type is
-called a string type.
+called a <string> type.
2/2
-{AI95-00285-01AI95-00285-01} [There are three predefined string types,
+{<AI95-00285-01AI95-00285-01>} [There are three predefined string types,
String, Wide_String, and Wide_Wide_String, each indexed by values of the
predefined subtype Positive; these are declared in the visible part of
package Standard:]
@@ -12439,7 +12463,7 @@ package Standard:]
[subtype Positive is Integer range 1 .. Integer'Last;
4/2
- {AI95-00285-01AI95-00285-01} type String is array(Positive range <>) of
Character;
+ {<AI95-00285-01AI95-00285-01>} type String is array(Positive range <>) of
Character;
type Wide_String is array(Positive range <>) of Wide_Character;
type Wide_Wide_String is array(Positive range <>) of Wide_Wide_Character;
]
@@ -12458,17 +12482,17 @@ package Standard:]
_Examples_
6
-Examples of string objects:
+<Examples of string objects:>
7
Stars : String(1 .. 120) := (1 .. 120 => '*' );
Question : constant String := "How many characters?";
- -- Question'First = 1, Question'Last = 20
- -- Question'Length = 20 (the number of characters)
+ --< Question'First = 1, Question'Last = 20>
+ --< Question'Length = 20 (the number of characters)>
8
- Ask_Twice : String := Question & Question; -- constrained to (1..40)
- Ninety_Six : constant Roman := "XCVI"; -- see *note 3.5.2:: and *note
3.6::
+ Ask_Twice : String := Question & Question; --< constrained to (1..40)>
+ Ninety_Six : constant Roman := "XCVI"; --< see *note 3.5.2:: and
*note 3.6::>
_Inconsistencies With Ada 83_
@@ -12500,13 +12524,13 @@ Examples of string objects:
_Wording Changes from Ada 83_
8.f
- We define the term string type as a natural analogy to the
- term character type.
+ We define the term <string type> as a natural analogy to the
+ term <character type>.
_Inconsistencies With Ada 95_
8.g/2
- {AI95-00285-01AI95-00285-01} The declaration of
+ {<AI95-00285-01AI95-00285-01>} The declaration of
Wide_Wide_String in Standard hides a use-visible declaration
with the same defining_identifier. In the (very) unlikely
event that an Ada 95 program had depended on such a
@@ -12517,7 +12541,8 @@ Examples of string objects:
_Extensions to Ada 95_
8.h/2
- {AI95-00285-01AI95-00285-01} The type Wide_Wide_String is new.
+ {<AI95-00285-01AI95-00285-01>} The type Wide_Wide_String is
+ new.
File: aarm2012.info, Node: 3.7, Next: 3.8, Prev: 3.6, Up: 3
@@ -12526,14 +12551,15 @@ File: aarm2012.info, Node: 3.7, Next: 3.8, Prev:
3.6, Up: 3
=================
1/2
-{AI95-00251-01AI95-00251-01} {AI95-00326-01AI95-00326-01} [ A composite
-type (other than an array or interface type) can have discriminants,
-which parameterize the type. A known_discriminant_part specifies the
-discriminants of a composite type. A discriminant of an object is a
-component of the object, and is either of a discrete type or an access
-type. An unknown_discriminant_part in the declaration of a view of a
-type specifies that the discriminants of the type are unknown for the
-given view; all subtypes of such a view are indefinite subtypes.]
+{<AI95-00251-01AI95-00251-01>} {<AI95-00326-01AI95-00326-01>} [ A
+composite type (other than an array or interface type) can have
+discriminants, which parameterize the type. A known_discriminant_part
+specifies the discriminants of a composite type. A discriminant of an
+object is a component of the object, and is either of a discrete type or
+an access type. An unknown_discriminant_part in the declaration of a
+view of a type specifies that the discriminants of the type are unknown
+for the given view; all subtypes of such a view are indefinite
+subtypes.]
1.a/2
Glossary entry: A discriminant is a parameter for a composite
@@ -12543,17 +12569,17 @@ given view; all subtypes of such a view are
indefinite subtypes.]
upon creation.
1.b/2
- Discussion: {AI95-00114-01AI95-00114-01} A view of a type, and
- all subtypes of the view, have unknown discriminants when the
- number or names of the discriminants, if any, are unknown at
- the point of the type declaration for the view. A
+ Discussion: {<AI95-00114-01AI95-00114-01>} A view of a type,
+ and all subtypes of the view, have <unknown discriminants>
+ when the number or names of the discriminants, if any, are
+ unknown at the point of the type declaration for the view. A
discriminant_part of (<>) is used to indicate unknown
discriminants.
_Language Design Principles_
1.c/2
- {AI95-00402-01AI95-00402-01} When an access discriminant is
+ {<AI95-00402-01AI95-00402-01>} When an access discriminant is
initialized at the time of object creation with an allocator
of an anonymous type, the allocated object and the object with
the discriminant are tied together for their lifetime. They
@@ -12600,7 +12626,7 @@ given view; all subtypes of such a view are indefinite
subtypes.]
(discriminant_specification {; discriminant_specification})
5/2
- {AI95-00231-01AI95-00231-01} discriminant_specification ::=
+ {<AI95-00231-01AI95-00231-01>} discriminant_specification ::=
defining_identifier_list : [null_exclusion] subtype_mark [:=
default_expression]
| defining_identifier_list : access_definition [:=
@@ -12618,11 +12644,11 @@ discriminant_specification is that of the
corresponding discriminant.
_Legality Rules_
8/2
-{8652/00078652/0007} {AI95-00098-01AI95-00098-01}
-{AI95-00251-01AI95-00251-01} A discriminant_part is only permitted in a
-declaration for a composite type that is not an array or interface type
-[(this includes generic formal types)]. A type declared with a
-known_discriminant_part is called a discriminated type, as is a type
+{<8652/00078652/0007>} {<AI95-00098-01AI95-00098-01>}
+{<AI95-00251-01AI95-00251-01>} A discriminant_part is only permitted in
+a declaration for a composite type that is not an array or interface
+type [(this includes generic formal types)]. A type declared with a
+known_discriminant_part is called a <discriminated> type, as is a type
that inherits (known) discriminants.
8.a
@@ -12640,23 +12666,24 @@ that inherits (known) discriminants.
composite, much less have any discriminants.
8.b.1/1
- {8652/00078652/0007} {AI95-00098-01AI95-00098-01} On the other
- hand, unknown_discriminant_parts cannot be applied to type
- declarations that cannot have a known_discriminant_part.
+ {<8652/00078652/0007>} {<AI95-00098-01AI95-00098-01>} On the
+ other hand, unknown_discriminant_parts cannot be applied to
+ type declarations that cannot have a known_discriminant_part.
There is no point in having unknown discriminants on a type
that can never have discriminants (for instance, a formal
modular type), even when these are allowed syntactically.
9/2
-{AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01} The subtype of
-a discriminant may be defined by an optional null_exclusion and a
-subtype_mark, in which case the subtype_mark shall denote a discrete or
-access subtype, or it may be defined by an access_definition. A
-discriminant that is defined by an access_definition is called an access
-discriminant and is of an anonymous access type.
+{<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>} The
+subtype of a discriminant may be defined by an optional null_exclusion
+and a subtype_mark, in which case the subtype_mark shall denote a
+discrete or access subtype, or it may be defined by an
+access_definition. A discriminant that is defined by an
+access_definition is called an <access discriminant> and is of an
+anonymous access type.
9.a/2
- This paragraph was deleted.{AI95-00230-01AI95-00230-01}
+ <This paragraph was deleted.>{<AI95-00230-01AI95-00230-01>}
9.b
Reason: Note that discriminants of a named access type are not
@@ -12665,7 +12692,7 @@ discriminant and is of an anonymous access type.
access_definition.
9.1/3
-{AI95-00402-01AI95-00402-01} {AI05-0214-1AI05-0214-1}
+{<AI95-00402-01AI95-00402-01>} {<AI05-0214-1AI05-0214-1>}
Default_expressions shall be provided either for all or for none of the
discriminants of a known_discriminant_part (*note 3.7: S0061.). No
default_expression (*note 3.7: S0063.)s are permitted in a
@@ -12683,23 +12710,24 @@ nonlimited tagged type [or a generic formal type].
discriminants alterable as part of assigning to the object.
9.d/3
- {AI05-0214-1AI05-0214-1} Defaults for discriminants of tagged
- types are disallowed so that every object of a nonlimited
- tagged type is constrained, either by an explicit constraint,
- or by its initial discriminant values. This substantially
- simplifies the semantic rules and the implementation of
- inherited dispatching operations. We don't need this rule for
- limited tagged types, as the discriminants of such objects
- cannot be changed after the object is created in any case --
- no full-object assignment is supported, and that is required
- to change discriminant values. For generic formal types, the
- restriction simplifies the type matching rules. If one simply
- wants a "default" value for the discriminants, a constrained
- subtype can be declared for future use.
+ {<AI05-0214-1AI05-0214-1>} Defaults for discriminants of
+ tagged types are disallowed so that every object of a
+ nonlimited tagged type is constrained, either by an explicit
+ constraint, or by its initial discriminant values. This
+ substantially simplifies the semantic rules and the
+ implementation of inherited dispatching operations. We don't
+ need this rule for limited tagged types, as the discriminants
+ of such objects cannot be changed after the object is created
+ in any case -- no full-object assignment is supported, and
+ that is required to change discriminant values. For generic
+ formal types, the restriction simplifies the type matching
+ rules. If one simply wants a "default" value for the
+ discriminants, a constrained subtype can be declared for
+ future use.
10/3
-{AI95-00230-01AI95-00230-01} {AI95-00402-01AI95-00402-01}
-{AI95-00419-01AI95-00419-01} {AI05-0063-1AI05-0063-1} A
+{<AI95-00230-01AI95-00230-01>} {<AI95-00402-01AI95-00402-01>}
+{<AI95-00419-01AI95-00419-01>} {<AI05-0063-1AI05-0063-1>} A
discriminant_specification for an access discriminant may have a
default_expression only in the declaration for an immutably limited type
(see *note 7.5::). In addition to the places where Legality Rules
@@ -12722,7 +12750,7 @@ part of an instance of a generic unit.
will always be immutably limited (if legal).
10.c/2
- Reason: {AI95-00230-01AI95-00230-01} We considered the
+ Reason: {<AI95-00230-01AI95-00230-01>} We considered the
following rules for access discriminants:
10.d
@@ -12746,7 +12774,7 @@ part of an instance of a generic unit.
that "become nonlimited".
10.e.1/3
- * {AI05-0063-1AI05-0063-1} A type may have an access
+ * {<AI05-0063-1AI05-0063-1>} A type may have an access
discriminant if it is an immutably limited type. This
was the rule chosen for Ada 95.
@@ -12761,7 +12789,7 @@ part of an instance of a generic unit.
accessibility.
10.f.1/3
- * {AI05-0063-1AI05-0063-1} Any type may have an access
+ * {<AI05-0063-1AI05-0063-1>} Any type may have an access
discriminant, as above. However, special accessibility
rules only apply to types that are immutably limited
(task, protected, and explicitly limited records).
@@ -12769,7 +12797,7 @@ part of an instance of a generic unit.
depend on the definition of accessibility.
10.f.2/3
- * {AI05-0063-1AI05-0063-1} Any type may have an access
+ * {<AI05-0063-1AI05-0063-1>} Any type may have an access
discriminant, as above. Limited types have special
accessibility, while nonlimited types have normal
accessibility. However, a limited partial view with an
@@ -12800,14 +12828,14 @@ part of an instance of a generic unit.
it would be horribly incompatible with Ada 95.
10.h.1/3
- * {AI05-0063-1AI05-0063-1} Any type may have an access
+ * {<AI05-0063-1AI05-0063-1>} Any type may have an access
discriminant, but access discriminants may have defaults
only if they are of an immutably limited type. This is
the rule chosen for Ada 2005, as it is not incompatible,
and it doesn't require weird accessibility checks.
11/2
-This paragraph was deleted.{AI95-00402-01AI95-00402-01}
+<This paragraph was deleted.>{<AI95-00402-01AI95-00402-01>}
12
For a type defined by a derived_type_definition, if a
@@ -12843,10 +12871,10 @@ known_discriminant_part is provided in its
declaration, then:
parent's discriminant.
16/3
-This paragraph was deleted.{AI05-0102-1AI05-0102-1}
+<This paragraph was deleted.>{<AI05-0102-1AI05-0102-1>}
16.a/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Static Semantics_
@@ -12860,14 +12888,14 @@ defined by the access_definition.
[For a type defined by a derived_type_definition, each discriminant of
the parent type is either inherited, constrained to equal some new
discriminant of the derived type, or constrained to the value of an
-expression.] When inherited or constrained to equal some new
+expression.] When inherited or constrained to equal some new
discriminant, the parent discriminant and the discriminant of the
-derived type are said to correspond. Two discriminants also correspond
-if there is some common discriminant to which they both correspond. A
-discriminant corresponds to itself as well. If a discriminant of a
-parent type is constrained to a specific value by a
-derived_type_definition, then that discriminant is said to be specified
-by that derived_type_definition.
+derived type are said to <correspond>. Two discriminants also
+correspond if there is some common discriminant to which they both
+correspond. A discriminant corresponds to itself as well. If a
+discriminant of a parent type is constrained to a specific value by a
+derived_type_definition, then that discriminant is said to be
+<specified> by that derived_type_definition.
18.a
Ramification: The correspondence relationship is transitive,
@@ -12877,26 +12905,26 @@ by that derived_type_definition.
19
A constraint that appears within the definition of a discriminated type
-depends on a discriminant of the type if it names the discriminant as a
-bound or discriminant value. A component_definition depends on a
+<depends on a discriminant> of the type if it names the discriminant as
+a bound or discriminant value. A component_definition depends on a
discriminant if its constraint depends on the discriminant, or on a
discriminant that corresponds to it.
19.a
Ramification: A constraint in a task_body is not considered to
- depend on a discriminant of the task type, even if it names
+ <depend> on a discriminant of the task type, even if it names
it. It is only the constraints in the type definition itself
that are considered dependents. Similarly for protected
types.
20
-A component depends on a discriminant if:
+A component <depends on a discriminant> if:
21
* Its component_definition depends on the discriminant; or
21.a
- Ramification: A component does not depend on a discriminant
+ Ramification: A component does <not> depend on a discriminant
just because its default_expression refers to the
discriminant.
@@ -12906,8 +12934,8 @@ A component depends on a discriminant if:
23
* It is a component inherited as part of a derived_type_definition,
- and the constraint of the parent_subtype_indication depends on the
- discriminant; or
+ and the constraint of the <parent_>subtype_indication depends on
+ the discriminant; or
23.a
Reason: When the parent subtype depends on a discriminant, the
@@ -12952,22 +12980,22 @@ type.
To be honest: Which values are present might depend on
discriminants of some ancestor type that are constrained in an
intervening derived_type_definition. That's why we say
- "values of discriminants" instead of "values of the
+ "values of discriminants" instead of "values of <the>
discriminants" -- a subtle point.
26
-A type declared with a known_discriminant_part is said to have known
-discriminants; its first subtype is unconstrained. A type declared with
-an unknown_discriminant_part is said to have unknown discriminants. A
-type declared without a discriminant_part has no discriminants, unless
-it is a derived type; if derived, such a type has the same sort of
-discriminants (known, unknown, or none) as its parent (or ancestor)
-type. A tagged class-wide type also has unknown discriminants. [Any
-subtype of a type with unknown discriminants is an unconstrained and
-indefinite subtype (see *note 3.2:: and *note 3.3::).]
+A type declared with a known_discriminant_part is said to have <known
+discriminants>; its first subtype is unconstrained. A type declared
+with an unknown_discriminant_part is said to have <unknown
+discriminants>. A type declared without a discriminant_part has no
+discriminants, unless it is a derived type; if derived, such a type has
+the same sort of discriminants (known, unknown, or none) as its parent
+(or ancestor) type. A tagged class-wide type also has unknown
+discriminants. [Any subtype of a type with unknown discriminants is an
+unconstrained and indefinite subtype (see *note 3.2:: and *note 3.3::).]
26.a/2
- Discussion: {AI95-00114-01AI95-00114-01} An
+ Discussion: {<AI95-00114-01AI95-00114-01>} An
unknown_discriminant_part "(<>)" is only permitted in the
declaration of a (generic or nongeneric) private type, private
extension, incomplete type, or formal derived type. Hence,
@@ -12982,7 +13010,7 @@ indefinite subtype (see *note 3.2:: and *note 3.3::).]
is not known at compile time.
26.b/2
- {AI95-00287-01AI95-00287-01} A subtype with unknown
+ {<AI95-00287-01AI95-00287-01>} A subtype with unknown
discriminants is indefinite, and hence an object of such a
subtype needs explicit initialization. A limited private type
with unknown discriminants is "extremely" limited; objects of
@@ -13003,20 +13031,20 @@ indefinite subtype (see *note 3.2:: and *note 3.3::).]
_Dynamic Semantics_
27/2
-{AI95-00230-01AI95-00230-01} {AI95-00416-01AI95-00416-01} For an access
-discriminant, its access_definition is elaborated when the value of the
-access discriminant is defined: by evaluation of its default_expression,
-by elaboration of a discriminant_constraint, or by an assignment that
-initializes the enclosing object.
+{<AI95-00230-01AI95-00230-01>} {<AI95-00416-01AI95-00416-01>} For an
+access discriminant, its access_definition is elaborated when the value
+of the access discriminant is defined: by evaluation of its
+default_expression, by elaboration of a discriminant_constraint, or by
+an assignment that initializes the enclosing object.
27.a/2
- Ramification: {AI95-00231-01AI95-00231-01}
- {AI95-00416-01AI95-00416-01} The conversion of the expression
- defining the access discriminant to the anonymous access type
- raises Program_Error for an object created by an allocator of
- an access type T, if the initial value is an access parameter
- that designates a view whose accessibility level is deeper
- than that of T.
+ Ramification: {<AI95-00231-01AI95-00231-01>}
+ {<AI95-00416-01AI95-00416-01>} The conversion of the
+ expression defining the access discriminant to the anonymous
+ access type raises Program_Error for an object created by an
+ allocator of an access type T, if the initial value is an
+ access parameter that designates a view whose accessibility
+ level is deeper than that of T.
NOTES
@@ -13039,8 +13067,8 @@ initializes the enclosing object.
28.b
An unconstrained discriminated subtype with defaults is called
- a mutable subtype, and a variable of such a subtype is called
- a mutable variable, because the discriminants of such a
+ a <mutable> subtype, and a variable of such a subtype is
+ called a mutable variable, because the discriminants of such a
variable can change. There are no mutable arrays (that is,
the bounds of an array object can never change), because there
is no way in the language to define default values for the
@@ -13068,7 +13096,7 @@ initializes the enclosing object.
enclosing object, presuming it is an unconstrained variable.
30.a/2
- Discussion: {AI95-00114-01AI95-00114-01} An
+ Discussion: {<AI95-00114-01AI95-00114-01>} An
unknown_discriminant_part is permitted only in the declaration
of a private type (including generic formal private), private
extension, incomplete type, or generic formal derived type.
@@ -13102,10 +13130,10 @@ initializes the enclosing object.
_Examples_
32
-Examples of discriminated types:
+<Examples of discriminated types:>
33
- type Buffer(Size : Buffer_Size := 100) is -- see *note 3.5.4::
+ type Buffer(Size : Buffer_Size := 100) is --< see *note 3.5.4::>
record
Pos : Buffer_Size := 0;
Value : String(1 .. Size);
@@ -13114,7 +13142,7 @@ Examples of discriminated types:
34
type Matrix_Rec(Rows, Columns : Integer) is
record
- Mat : Matrix(1 .. Rows, 1 .. Columns); -- see *note 3.6::
+ Mat : Matrix(1 .. Rows, 1 .. Columns); --< see *note 3.6::>
end record;
35
@@ -13129,9 +13157,9 @@ Examples of discriminated types:
end record;
37/3
- {AI95-00433-01AI95-00433-01} {AI05-0229-1AI05-0229-1} task type
Worker(Prio : System.Priority; Buf : access Buffer)
- with Priority => Prio is -- see *note D.1::
- -- discriminants used to parameterize the task type (see *note 9.1::)
+ {<AI95-00433-01AI95-00433-01>} {<AI05-0229-1AI05-0229-1>} task type
Worker(Prio : System.Priority; Buf : access Buffer)
+ with Priority => Prio is --< see *note D.1::>
+ --< discriminants used to parameterize the task type (see *note 9.1::)>
entry Fill;
entry Drain;
end Worker;
@@ -13140,12 +13168,12 @@ Examples of discriminated types:
37.a
The syntax for a discriminant_specification is modified to
- allow an access discriminant, with a type specified by an
+ allow an <access discriminant>, with a type specified by an
access_definition (see *note 3.10::).
37.b/2
- {AI95-00251-01AI95-00251-01} Discriminants are allowed on all
- composite types other than array and interface types.
+ {<AI95-00251-01AI95-00251-01>} Discriminants are allowed on
+ all composite types other than array and interface types.
37.c
Discriminants may be of an access type.
@@ -13160,44 +13188,45 @@ Examples of discriminated types:
_Extensions to Ada 95_
37.e/2
- {AI95-00230-01AI95-00230-01} {AI95-00402-01AI95-00402-01}
- {AI95-00416-01AI95-00416-01} Access discriminants (anonymous
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00402-01AI95-00402-01>}
+ {<AI95-00416-01AI95-00416-01>} Access discriminants (anonymous
access types used as a discriminant) can be used on any type
allowing discriminants. Defaults aren't allowed on
discriminants of nonlimited types, however, so that
accessibility problems don't happen on assignment.
37.f/2
- {AI95-00231-01AI95-00231-01} null_exclusion can be used in the
- declaration of a discriminant.
+ {<AI95-00231-01AI95-00231-01>} null_exclusion can be used in
+ the declaration of a discriminant.
_Wording Changes from Ada 95_
37.g/2
- {8652/00078652/0007} {AI95-00098-01AI95-00098-01} Corrigendum:
- The wording was clarified so that types that cannot have
- discriminants cannot have an unknown_discriminant_part.
+ {<8652/00078652/0007>} {<AI95-00098-01AI95-00098-01>}
+ Corrigendum: The wording was clarified so that types that
+ cannot have discriminants cannot have an
+ unknown_discriminant_part.
37.h/2
- {AI95-00251-01AI95-00251-01} Added wording to prevent
+ {<AI95-00251-01AI95-00251-01>} Added wording to prevent
interfaces from having discriminants. We don't want
interfaces to have any components.
37.i/2
- {AI95-00254-01AI95-00254-01} Removed wording which implied or
- required an access discriminant to have an access-to-object
+ {<AI95-00254-01AI95-00254-01>} Removed wording which implied
+ or required an access discriminant to have an access-to-object
type (anonymous access types can now be access-to-subprogram
types as well).
37.j/3
- {AI95-00326-01AI95-00326-01} {AI05-0299-1AI05-0299-1} Fixed
- the wording of the introduction to this subclause to reflect
- that both incomplete and partial views can have unknown
- discriminants. That was always true, but for some reason this
- wording specified partial views.
+ {<AI95-00326-01AI95-00326-01>} {<AI05-0299-1AI05-0299-1>}
+ Fixed the wording of the introduction to this subclause to
+ reflect that both incomplete and partial views can have
+ unknown discriminants. That was always true, but for some
+ reason this wording specified partial views.
37.k/2
- {AI95-00419-01AI95-00419-01} Changed the wording to use the
+ {<AI95-00419-01AI95-00419-01>} Changed the wording to use the
new term "explicitly limited record", which makes the intent
much clearer (and eliminates confusion with derived types that
happen to contain the reserved word limited).
@@ -13205,7 +13234,7 @@ Examples of discriminated types:
_Incompatibilities With Ada 2005_
37.l/3
- {AI05-0063-1AI05-0063-1} Correction: Changed the rules for
+ {<AI05-0063-1AI05-0063-1>} Correction: Changed the rules for
when access discriminants can have defaults to depend on the
new definition for immutably limited types; this will help
ensure that unusual corner cases are properly handled. Note
@@ -13217,14 +13246,14 @@ Examples of discriminated types:
_Extensions to Ada 2005_
37.m/3
- {AI05-0214-1AI05-0214-1} A limited tagged type may now have
+ {<AI05-0214-1AI05-0214-1>} A limited tagged type may now have
defaults for its discriminants.
_Wording Changes from Ada 2005_
37.n/3
- {AI05-0102-1AI05-0102-1} Correction: Moved implicit conversion
- Legality Rule to *note 8.6::.
+ {<AI05-0102-1AI05-0102-1>} Correction: Moved implicit
+ conversion Legality Rule to *note 8.6::.
* Menu:
@@ -13244,7 +13273,7 @@ a given discriminated type.
_Language Design Principles_
1.a/3
- {AI05-0299-1AI05-0299-1} The rules in this subclause are
+ {<AI05-0299-1AI05-0299-1>} The rules in this subclause are
intentionally parallel to those given in *note 4.3.1::, "*note
4.3.1:: Record Aggregates".
@@ -13256,13 +13285,13 @@ a given discriminated type.
3
discriminant_association ::=
- [discriminant_selector_name {| discriminant_selector_name} =>]
- expression
+ [<discriminant_>selector_name {| <discriminant_>
+ selector_name} =>] expression
4
- A discriminant_association is said to be named if it has one or
- more discriminant_selector_names; it is otherwise said to be
- positional. In a discriminant_constraint, any positional
+ A discriminant_association is said to be <named> if it has one or
+ more <discriminant_>selector_names; it is otherwise said to be
+ <positional>. In a discriminant_constraint, any positional
associations shall precede any named associations.
_Name Resolution Rules_
@@ -13270,12 +13299,12 @@ a given discriminated type.
5
Each selector_name of a named discriminant_association (*note 3.7.1:
S0065.) shall resolve to denote a discriminant of the subtype being
-constrained; the discriminants so named are the associated discriminants
-of the named association. For a positional association, the associated
-discriminant is the one whose discriminant_specification (*note 3.7:
-S0062.) occurred in the corresponding position in the
-known_discriminant_part (*note 3.7: S0061.) that defined the
-discriminants of the subtype being constrained.
+constrained; the discriminants so named are the <associated
+discriminants> of the named association. For a positional association,
+the <associated discriminant> is the one whose
+discriminant_specification (*note 3.7: S0062.) occurred in the
+corresponding position in the known_discriminant_part (*note 3.7:
+S0061.) that defined the discriminants of the subtype being constrained.
6
The expected type for the expression in a discriminant_association is
@@ -13284,8 +13313,8 @@ that of the associated discriminant(s).
_Legality Rules_
7/3
-{8652/00088652/0008} {AI95-00168-01AI95-00168-01}
-{AI95-00363-01AI95-00363-01} {AI05-0041-1AI05-0041-1} A
+{<8652/00088652/0008>} {<AI95-00168-01AI95-00168-01>}
+{<AI95-00363-01AI95-00363-01>} {<AI05-0041-1AI05-0041-1>} A
discriminant_constraint is only allowed in a subtype_indication whose
subtype_mark denotes either an unconstrained discriminated subtype, or
an unconstrained access subtype whose designated subtype is an
@@ -13297,11 +13326,11 @@ Rules normally apply (see *note 12.3::), these rules
apply also in the
private part of an instance of a generic unit.
7.a.1/2
- This paragraph was deleted.{8652/00088652/0008}
- {AI95-00168-01AI95-00168-01} {AI95-00363-01AI95-00363-01}
+ <This paragraph was deleted.>{<8652/00088652/0008>}
+ {<AI95-00168-01AI95-00168-01>} {<AI95-00363-01AI95-00363-01>}
7.a/2
- Reason: {AI95-00363-01AI95-00363-01} The second rule is
+ Reason: {<AI95-00363-01AI95-00363-01>} The second rule is
necessary to prevent objects from changing so that they no
longer match their constraint. In Ada 95, we attempted to
prevent this by banning every case where an aliased object
@@ -13315,12 +13344,12 @@ private part of an instance of a generic unit.
to an item whose discriminants can be changed by assignment".
7.b/3
- Discussion: {AI05-0041-1AI05-0041-1} The second rule will only
- use the indefinite or dereference bullets in the definition of
- "known to be constrained". The rule is worded in terms of
- "known to be constrained" in order to capture the special
- rules that apply in generic bodies (rather than repeating them
- and getting them subtly wrong).
+ Discussion: {<AI05-0041-1AI05-0041-1>} The second rule will
+ only use the indefinite or dereference bullets in the
+ definition of "known to be constrained". The rule is worded
+ in terms of "known to be constrained" in order to capture the
+ special rules that apply in generic bodies (rather than
+ repeating them and getting them subtly wrong).
8
A named discriminant_association with more than one selector_name is
@@ -13329,7 +13358,7 @@ discriminant_constraint shall provide exactly one value
for each
discriminant of the subtype being constrained.
9/3
-This paragraph was deleted.{AI05-0102-1AI05-0102-1}
+<This paragraph was deleted.>{<AI05-0102-1AI05-0102-1>}
9.a/3
Ramification: In addition, *note 8.6:: requires that the
@@ -13346,7 +13375,7 @@ This paragraph was deleted.{AI05-0102-1AI05-0102-1}
_Dynamic Semantics_
10
-A discriminant_constraint is compatible with an unconstrained
+A discriminant_constraint is <compatible> with an unconstrained
discriminated subtype if each discriminant value belongs to the subtype
of the corresponding discriminant.
@@ -13361,7 +13390,7 @@ of the corresponding discriminant.
to constrain it again.
11
-A composite value satisfies a discriminant constraint if and only if
+A composite value <satisfies> a discriminant constraint if and only if
each discriminant of the composite value has the value imposed by the
discriminant constraint.
@@ -13371,7 +13400,7 @@ discriminant_associations are evaluated in an arbitrary
order and
converted to the type of the associated discriminant (which might raise
Constraint_Error -- see *note 4.6::); the expression of a named
association is evaluated (and converted) once for each associated
-discriminant. The result of each evaluation and conversion is the value
+discriminant. The result of each evaluation and conversion is the value
imposed by the constraint for the associated discriminant.
12.a
@@ -13399,16 +13428,16 @@ imposed by the constraint for the associated
discriminant.
_Examples_
14/3
-{AI05-0299-1AI05-0299-1} Examples (using types declared above in
-subclause *note 3.7::):
+{<AI05-0299-1AI05-0299-1>} <Examples (using types declared above in
+subclause *note 3.7::):>
15
- Large : Buffer(200); -- constrained, always 200 characters
- -- (explicit discriminant value)
- Message : Buffer; -- unconstrained, initially 100 characters
- -- (default discriminant value)
- Basis : Square(5); -- constrained, always 5 by 5
- Illegal : Square; -- illegal, a Square has to be constrained
+ Large : Buffer(200); --< constrained, always 200 characters>
+ --< (explicit discriminant value)>
+ Message : Buffer; --< unconstrained, initially 100 characters>
+ --< (default discriminant value)>
+ Basis : Square(5); --< constrained, always 5 by 5>
+ Illegal : Square; --< illegal, a Square has to be constrained>
_Inconsistencies With Ada 83_
@@ -13431,8 +13460,8 @@ subclause *note 3.7::):
_Incompatibilities With Ada 95_
15.c/2
- {8652/00088652/0008} {AI95-00168-01AI95-00168-01}
- {AI95-00363-01AI95-00363-01} The Corrigendum added a
+ {<8652/00088652/0008>} {<AI95-00168-01AI95-00168-01>}
+ {<AI95-00363-01AI95-00363-01>} The Corrigendum added a
restriction on discriminant_constraints for general access
subtypes. Such constraints are prohibited if the designated
type can be treated as constrained somewhere in the program.
@@ -13452,15 +13481,15 @@ subclause *note 3.7::):
_Wording Changes from Ada 2005_
15.d/3
- {AI05-0041-1AI05-0041-1} Correction: Revised the rules on
+ {<AI05-0041-1AI05-0041-1>} Correction: Revised the rules on
access subtypes having discriminant constraints to depend on
the "known to be constrained" rules. This centralizes the
rules so that future fixes need to be made in only one place,
as well as fixing bugs in obscure cases.
15.e/3
- {AI05-0102-1AI05-0102-1} Correction: Moved implicit conversion
- Legality Rule to *note 8.6::.
+ {<AI05-0102-1AI05-0102-1>} Correction: Moved implicit
+ conversion Legality Rule to *note 8.6::.
File: aarm2012.info, Node: 3.7.2, Prev: 3.7.1, Up: 3.7
@@ -13484,12 +13513,12 @@ dereference)], the following attribute is defined:
3/3
A'Constrained
- {AI05-0214-1AI05-0214-1} Yields the value True if A
+ {<AI05-0214-1AI05-0214-1>} Yields the value True if A
denotes a constant, a value, a tagged object, or a
constrained variable, and False otherwise.
3.a/3
- Implementation Note: {AI05-0214-1AI05-0214-1} This attribute
+ Implementation Note: {<AI05-0214-1AI05-0214-1>} This attribute
is primarily used on parameters, to determine whether the
discriminants can be changed as part of an assignment. The
Constrained attribute is statically True for in parameters.
@@ -13506,8 +13535,8 @@ A'Constrained
change its discriminants.
3.b/4
- Reason: {AI05-0214-1AI05-0214-1} {AI12-0005-1AI12-0005-1} All
- tagged objects are known to be constrained (as nonlimited
+ Reason: {<AI05-0214-1AI05-0214-1>} {<AI12-0005-1AI12-0005-1>}
+ All tagged objects are known to be constrained (as nonlimited
tagged types cannot have discriminant defaults, and limited
tagged objects are immutably limited), and are always
considered constrained by this attribute to avoid distributed
@@ -13520,12 +13549,12 @@ A'Constrained
parameters.
3.c/3
- Discussion: {AI05-0005-1AI05-0005-1} {AI05-0214-1AI05-0214-1}
- If the type of A is a type derived from an untagged partial
- view of a tagged type such that it is not a tagged type, then
- A is not considered a tagged object, and A'Constrained can
- return either True or False depending on the nature of the
- object.
+ Discussion: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0214-1AI05-0214-1>} If the type of A is a type derived
+ from an untagged partial view of a tagged type such that it is
+ not a tagged type, then A is not considered a tagged object,
+ and A'Constrained can return either True or False depending on
+ the nature of the object.
_Erroneous Execution_
@@ -13575,7 +13604,7 @@ execution) of the subcomponent denoted by the name.
_Wording Changes from Ada 2005_
4.e/3
- {AI05-0214-1AI05-0214-1} A'Constrained is now defined to
+ {<AI05-0214-1AI05-0214-1>} A'Constrained is now defined to
return True for any A that is a tagged object. This doesn't
change the result for any A allowed by previous versions of
Ada; the change is necessary to avoid unnecessary overhead for
@@ -13590,7 +13619,7 @@ File: aarm2012.info, Node: 3.8, Next: 3.9, Prev:
3.7, Up: 3
1
A record object is a composite object consisting of named components.
The value of a record object is a composite value consisting of the
-values of the components.
+values of the components.
_Syntax_
@@ -13612,11 +13641,11 @@ values of the components.
| null;
5/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} component_item
- ::= component_declaration | aspect_clause
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ component_item ::= component_declaration | aspect_clause
6/3
- {AI05-0183-1AI05-0183-1} component_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} component_declaration ::=
defining_identifier_list : component_definition [:=
default_expression]
[aspect_specification];
@@ -13630,10 +13659,10 @@ component_declaration is the type of the component.
_Legality Rules_
8/2
-This paragraph was deleted.{AI95-00287-01AI95-00287-01}
+<This paragraph was deleted.>{<AI95-00287-01AI95-00287-01>}
9/2
-{AI95-00366-01AI95-00366-01} Each component_declaration declares a
+{<AI95-00366-01AI95-00366-01>} Each component_declaration declares a
component of the record type. Besides components declared by
component_declarations, the components of a record type include any
components declared by discriminant_specifications of the record type
@@ -13641,7 +13670,7 @@ declaration. [The identifiers of all components of a
record type shall
be distinct.]
9.a/3
- Proof: {AI05-0299-1AI05-0299-1} The identifiers of all
+ Proof: {<AI05-0299-1AI05-0299-1>} The identifiers of all
components of a record type have to be distinct because they
are all declared immediately within the same declarative
region. See Clause *note 8::.
@@ -13651,14 +13680,14 @@ Within a type_declaration, a name that denotes a
component, protected
subprogram, or entry of the type is allowed only in the following cases:
11/3
- * {AI05-0004-1AI05-0004-1} {AI05-0295-1AI05-0295-1} A name that
+ * {<AI05-0004-1AI05-0004-1>} {<AI05-0295-1AI05-0295-1>} A name that
denotes any component, protected subprogram, or entry is allowed
within an aspect_specification, an operational item, or a
representation item that occurs within the declaration of the
composite type.
12/3
- * {AI05-0264-1AI05-0264-1} A name that denotes a noninherited
+ * {<AI05-0264-1AI05-0264-1>} A name that denotes a noninherited
discriminant is allowed within the declaration of the type, but not
within the discriminant_part. If the discriminant is used to
define the constraint of a component, the bounds of an entry
@@ -13689,7 +13718,7 @@ subprogram, or entry of the type is allowed only in the
following cases:
type.
12.e/2
- Reason: {AI95-00373-01AI95-00373-01} The above rules, and a
+ Reason: {<AI95-00373-01AI95-00373-01>} The above rules, and a
similar one in *note 6.1:: for formal parameters, are intended
to allow initializations of components or parameters to occur
in a (nearly) arbitrary order -- whatever order is most
@@ -13698,11 +13727,11 @@ subprogram, or entry of the type is allowed only in
the following cases:
another one. They also prevent circularities.
12.f/3
- Ramification: {AI05-0295-1AI05-0295-1} Inherited discriminants
- are not allowed to be denoted, except within
+ Ramification: {<AI05-0295-1AI05-0295-1>} Inherited
+ discriminants are not allowed to be denoted, except within
aspect_specifications and representation items. However, the
- discriminant_selector_name of the parent subtype_indication is
- allowed to denote a discriminant of the parent.
+ <discriminant_>selector_name of the parent subtype_indication
+ is allowed to denote a discriminant of the parent.
13
If the name of the current instance of a type (see *note 8.6::) is used
@@ -13720,9 +13749,9 @@ of an access type, and the attribute_reference shall
appear alone.
_Static Semantics_
13.1/3
-{AI95-00318-02AI95-00318-02} {AI05-0004-1AI05-0004-1} If a
+{<AI95-00318-02AI95-00318-02>} {<AI05-0004-1AI05-0004-1>} If a
record_type_definition includes the reserved word limited, the type is
-called an explicitly limited record type.
+called an <explicitly limited record> type.
14
The component_definition of a component_declaration defines the
@@ -13733,7 +13762,7 @@ appears in the component_definition, then the component
is aliased (see
15
If the component_list of a record type is defined by the reserved word
null and there are no discriminants, then the record type has no
-components and all records of the type are null records. A
+components and all records of the type are <null records>. A
record_definition of null record is equivalent to record null; end
record.
@@ -13746,13 +13775,13 @@ record.
16
The elaboration of a record_type_definition creates the record type and
its first subtype, and consists of the elaboration of the
-record_definition. The elaboration of a record_definition consists of
+record_definition. The elaboration of a record_definition consists of
the elaboration of its component_list, if any.
17
The elaboration of a component_list consists of the elaboration of the
component_items and variant_part, if any, in the order in which they
-appear. The elaboration of a component_declaration consists of the
+appear. The elaboration of a component_declaration consists of the
elaboration of the component_definition.
17.a
@@ -13763,30 +13792,31 @@ elaboration of the component_definition.
elaborated once for each defining_identifier in the list.
18/2
-{8652/00028652/0002} {AI95-00171-01AI95-00171-01}
-{AI95-00230-01AI95-00230-01} Within the definition of a composite type,
-if a component_definition or discrete_subtype_definition (see *note
-9.5.2::) includes a name that denotes a discriminant of the type, or
-that is an attribute_reference whose prefix denotes the current instance
-of the type, the expression containing the name is called a per-object
-expression, and the constraint or range being defined is called a
-per-object constraint. For the elaboration of a component_definition of
-a component_declaration or the discrete_subtype_definition (*note 3.6:
-S0055.) of an entry_declaration (*note 9.5.2: S0218.) for an entry
-family (see *note 9.5.2::), if the component subtype is defined by an
-access_definition or if the constraint or range of the
-subtype_indication or discrete_subtype_definition (*note 3.6: S0055.) is
-not a per-object constraint, then the access_definition,
-subtype_indication, or discrete_subtype_definition (*note 3.6: S0055.)
-is elaborated. On the other hand, if the constraint or range is a
-per-object constraint, then the elaboration consists of the evaluation
-of any included expression that is not part of a per-object expression.
-Each such expression is evaluated once unless it is part of a named
-association in a discriminant constraint, in which case it is evaluated
-once for each associated discriminant.
+{<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+{<AI95-00230-01AI95-00230-01>} Within the definition of a composite
+type, if a component_definition or discrete_subtype_definition (see
+*note 9.5.2::) includes a name that denotes a discriminant of the type,
+or that is an attribute_reference whose prefix denotes the current
+instance of the type, the expression containing the name is called a
+<per-object expression>, and the constraint or range being defined is
+called a <per-object constraint>. For the elaboration of a
+component_definition of a component_declaration or the
+discrete_subtype_definition (*note 3.6: S0055.) of an entry_declaration
+(*note 9.5.2: S0218.) for an entry family (see *note 9.5.2::), if the
+component subtype is defined by an access_definition or if the
+constraint or range of the subtype_indication or
+discrete_subtype_definition (*note 3.6: S0055.) is not a per-object
+constraint, then the access_definition, subtype_indication, or
+discrete_subtype_definition (*note 3.6: S0055.) is elaborated. On the
+other hand, if the constraint or range is a per-object constraint, then
+the elaboration consists of the evaluation of any included expression
+that is not part of a per-object expression. Each such expression is
+evaluated once unless it is part of a named association in a
+discriminant constraint, in which case it is evaluated once for each
+associated discriminant.
18.1/1
-{8652/00028652/0002} {AI95-00171-01AI95-00171-01} When a per-object
+{<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>} When a per-object
constraint is elaborated [(as part of creating an object)], each
per-object expression of the constraint is evaluated. For other
expressions, the values determined during the elaboration of the
@@ -13839,14 +13869,14 @@ associated subtype is created.
equality operators.
25/2
- 69 {AI95-00287-01AI95-00287-01} A component of a record can be
+ 69 {<AI95-00287-01AI95-00287-01>} A component of a record can be
named with a selected_component. A value of a record can be
specified with a record_aggregate.
_Examples_
26
-Examples of record type declarations:
+<Examples of record type declarations: >
27
type Date is
@@ -13864,14 +13894,14 @@ Examples of record type declarations:
end record;
29
-Examples of record variables:
+<Examples of record variables: >
30
Tomorrow, Yesterday : Date;
A, B, C : Complex;
31
- -- both components of A, B, and C are implicitly initialized to zero
+ --< both components of A, B, and C are implicitly initialized to zero >
_Extensions to Ada 83_
@@ -13901,8 +13931,8 @@ Examples of record variables:
_Wording Changes from Ada 83_
31.d/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} The syntax
- rules now allow aspect_clauses to appear in a
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} The
+ syntax rules now allow aspect_clauses to appear in a
record_definition. This is not a language extension, because
Legality Rules prevent all language-defined representation
clauses from appearing there. However, an
@@ -13914,11 +13944,11 @@ Examples of record variables:
_Extensions to Ada 95_
31.e/2
- {AI95-00287-01AI95-00287-01} Record components can have an
+ {<AI95-00287-01AI95-00287-01>} Record components can have an
anonymous access type.
31.f/2
- {AI95-00287-01AI95-00287-01} Limited components can be
+ {<AI95-00287-01AI95-00287-01>} Limited components can be
initialized, so long as the expression is one that allows
building the object in place (such as an aggregate or
function_call).
@@ -13926,24 +13956,25 @@ Examples of record variables:
_Wording Changes from Ada 95_
31.g/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Improved the description of the elaboration of per-object
- constraints.
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Improved the description of the elaboration of
+ per-object constraints.
31.h/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Changed representation clauses to aspect clauses to reflect
- that they are used for more than just representation.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Changed representation clauses to aspect clauses
+ to reflect that they are used for more than just
+ representation.
31.i/2
- {AI95-00318-02AI95-00318-02} Defined explicitly limited record
- type to use in other rules.
+ {<AI95-00318-02AI95-00318-02>} Defined <explicitly limited
+ record> type to use in other rules.
_Extensions to Ada 2005_
31.j/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a component_declaration. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a component_declaration. This is described in
*note 13.1.1::.
* Menu:
@@ -13963,7 +13994,7 @@ of the discriminant covered by its discrete_choice_list.
1.a
Discussion: Discrete_choice_lists and discrete_choices are
- said to cover values as defined below; which
+ said to <cover> values as defined below; which
discrete_choice_list covers a value determines which of
various alternatives is chosen. These are used in
variant_parts, array_aggregates, and case_statements.
@@ -13983,7 +14014,7 @@ of the discriminant covered by its discrete_choice_list.
2
variant_part ::=
- case discriminant_direct_name is
+ case <discriminant_>direct_name is
variant
{variant}
end case;
@@ -13997,18 +14028,18 @@ of the discriminant covered by its
discrete_choice_list.
discrete_choice_list ::= discrete_choice {| discrete_choice}
5/3
- {AI05-0153-3AI05-0153-3} {AI05-0158-1AI05-0158-1} discrete_choice
- ::= choice_expression | discrete_subtype_indication |
- range | others
+ {<AI05-0153-3AI05-0153-3>} {<AI05-0158-1AI05-0158-1>}
+ discrete_choice ::= choice_expression | <discrete_>
+ subtype_indication | range | others
_Name Resolution Rules_
6
-The discriminant_direct_name shall resolve to denote a discriminant
-(called the discriminant of the variant_part) specified in the
+The <discriminant_>direct_name shall resolve to denote a discriminant
+(called the <discriminant of the variant_part>) specified in the
known_discriminant_part of the full_type_declaration that contains the
-variant_part. The expected type for each discrete_choice in a variant is
-the type of the discriminant of the variant_part.
+variant_part. The expected type for each discrete_choice in a variant
+is the type of the discriminant of the variant_part.
6.a
Ramification: A full_type_declaration with a variant_part has
@@ -14025,37 +14056,37 @@ The discriminant of the variant_part shall be of a
discrete type.
anonymous.
8/3
-{AI05-0153-3AI05-0153-3} The choice_expressions, subtype_indications,
+{<AI05-0153-3AI05-0153-3>} The choice_expressions, subtype_indications,
and ranges given as discrete_choices in a variant_part shall be static.
The discrete_choice others shall appear alone in a discrete_choice_list,
and such a discrete_choice_list, if it appears, shall be the last one in
the enclosing construct.
9
-A discrete_choice is defined to cover a value in the following cases:
+A discrete_choice is defined to <cover a value> in the following cases:
10/3
- * {AI05-0262-1AI05-0262-1} A discrete_choice that is a
+ * {<AI05-0262-1AI05-0262-1>} A discrete_choice that is a
choice_expression covers a value if the value equals the value of
the choice_expression converted to the expected type.
10.1/4
- * {AI05-0153-3AI05-0153-3} {AI05-0262-1AI05-0262-1}
- {AI12-0071-1AI12-0071-1} A discrete_choice that is a
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0262-1AI05-0262-1>}
+ {<AI12-0071-1AI12-0071-1>} A discrete_choice that is a
subtype_indication covers all values (possibly none) that belong to
the subtype and that satisfy the static predicates of the subtype
(see *note 3.2.4::).
10.a/3
- Ramification: {AI05-0262-1AI05-0262-1} A dynamic predicate is
- never allowed in this case (for variants, case_statements, and
- case_expressions, a subtype with a dynamic predicate isn't
+ Ramification: {<AI05-0262-1AI05-0262-1>} A dynamic predicate
+ is never allowed in this case (for variants, case_statements,
+ and case_expressions, a subtype with a dynamic predicate isn't
static and thus isn't allowed in a discrete_choice, and for a
choice in an array_aggregate, a dynamic predicate is
explicitly disallowed -- see *note 3.2.4::).
11/3
- * {AI05-0153-3AI05-0153-3} A discrete_choice that is a range covers
+ * {<AI05-0153-3AI05-0153-3>} A discrete_choice that is a range covers
all values (possibly none) that belong to the range.
12
@@ -14080,8 +14111,8 @@ The possible values of the discriminant of a
variant_part shall be
covered as follows:
15/4
- * {AI05-0153-3AI05-0153-3} {AI05-0188-1AI05-0188-1}
- {AI05-0262-1AI05-0262-1} {AI12-0071-1AI12-0071-1} If the
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0188-1AI05-0188-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI12-0071-1AI12-0071-1>} If the
discriminant is of a static constrained scalar subtype then, except
within an instance of a generic unit, each non-others
discrete_choice (*note 3.8.1: S0074.) shall cover only values in
@@ -14091,7 +14122,7 @@ covered as follows:
others)];
15.a/3
- Reason: {AI05-0188-1AI05-0188-1} The exemption for a
+ Reason: {<AI05-0188-1AI05-0188-1>} The exemption for a
discriminated type declared in an instance allows the
following example:
@@ -14110,10 +14141,10 @@ covered as follows:
end G;
15.c/3
- package I is new G (Natural); -- Legal
+ package I is new G (Natural); -- <Legal>
16/3
- * {AI05-0264-1AI05-0264-1} If the type of the discriminant is a
+ * {<AI05-0264-1AI05-0264-1>} If the type of the discriminant is a
descendant of a generic formal scalar type, then the variant_part
shall have an others discrete_choice;
@@ -14135,7 +14166,7 @@ If the component_list of a variant is specified by
null, the variant has
no components.
20
-The discriminant of a variant_part is said to govern the variant_part
+The discriminant of a variant_part is said to <govern> the variant_part
and its variants. In addition, the discriminant of a derived type
governs a variant_part and its variants if it corresponds (see *note
3.7::) to the discriminant of the variant_part.
@@ -14150,13 +14181,13 @@ in turn to any further variant that is, itself,
included in the
component_list of the given variant.
21.1/3
-{AI05-0290-1AI05-0290-1} When an object of a discriminated type T is
+{<AI05-0290-1AI05-0290-1>} When an object of a discriminated type <T> is
initialized by default, Constraint_Error is raised if no
-discrete_choice_list of any variant of a variant_part of T covers the
+discrete_choice_list of any variant of a variant_part of <T> covers the
value of the discriminant that governs the variant_part. When a
-variant_part appears in the component_list of another variant V, this
-test is only applied if the value of the discriminant governing V is
-covered by the discrete_choice_list of V.
+variant_part appears in the component_list of another variant <V>, this
+test is only applied if the value of the discriminant governing <V> is
+covered by the discrete_choice_list of <V>.
21.a/3
Implementation Note: This is not a "check"; it cannot be
@@ -14189,7 +14220,7 @@ component_list of each variant in the order in which
they appear.
_Examples_
23
-Example of record type with a variant part:
+<Example of record type with a variant part: >
24
type Device is (Printer, Disk, Drum);
@@ -14209,14 +14240,14 @@ Example of record type with a variant part:
end record;
26
-Examples of record subtypes:
+<Examples of record subtypes:>
27
subtype Drum_Unit is Peripheral(Drum);
subtype Disk_Unit is Peripheral(Disk);
28
-Examples of constrained record variables:
+<Examples of constrained record variables:>
29
Writer : Peripheral(Unit => Printer);
@@ -14239,7 +14270,7 @@ Examples of constrained record variables:
associations.
29.c/3
- {AI05-0299-1AI05-0299-1} We have added the term Discrete
+ {<AI05-0299-1AI05-0299-1>} We have added the term Discrete
Choice to the title since this is where they are talked about.
This is analogous to the name of the subclause "Index
Constraints and Discrete Ranges" in the subclause on Array
@@ -14253,7 +14284,7 @@ Examples of constrained record variables:
_Incompatibilities With Ada 2005_
29.e/3
- {AI05-0158-1AI05-0158-1} Membership tests are no longer
+ {<AI05-0158-1AI05-0158-1>} Membership tests are no longer
allowed as a discrete_choice, in order that those tests can be
expanded to allow multiple tests in a single expression
without ambiguity. Since a membership test has a boolean
@@ -14262,12 +14293,12 @@ Examples of constrained record variables:
_Extensions to Ada 2005_
29.f/3
- {AI05-0153-3AI05-0153-3} Subtypes with static predicates can
+ {<AI05-0153-3AI05-0153-3>} Subtypes with static predicates can
be used in discrete_choices, and the coverage rules are
modified to respect the predicates.
29.g/3
- {AI05-0188-1AI05-0188-1} Variants in generic specifications
+ {<AI05-0188-1AI05-0188-1>} Variants in generic specifications
are no longer rejected if the subtype of the actual type does
not include all of the case choices. This probably isn't
useful, but it is consistent with the treatment of
@@ -14276,17 +14307,17 @@ Examples of constrained record variables:
_Wording Changes from Ada 2005_
29.h/3
- {AI05-0290-1AI05-0290-1} Added a test that some variant covers
- the value of a discriminant that governs a variant_part. This
- is similar to the test that some case limb covers the value of
- the Selecting_expression of a case_statement. This test
- cannot change the behavior of any nonerroneous Ada 2005
- program, so it is not an inconsistency.
+ {<AI05-0290-1AI05-0290-1>} Added a test that some variant
+ covers the value of a discriminant that governs a
+ variant_part. This is similar to the test that some case limb
+ covers the value of the <Selecting_>expression of a
+ case_statement. This test cannot change the behavior of any
+ nonerroneous Ada 2005 program, so it is not an inconsistency.
_Wording Changes from Ada 2012_
29.i/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of the
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of the
coverage rules to use the new term "satisfies the predicates"
(see *note 3.2.4::).
@@ -14299,14 +14330,14 @@ File: aarm2012.info, Node: 3.9, Next: 3.10, Prev:
3.8, Up: 3
1
[ Tagged types and type extensions support object-oriented programming,
based on inheritance with extension and run-time polymorphism via
-dispatching operations. ]
+<dispatching operations>. ]
_Language Design Principles_
1.a/2
- {AI95-00251-01AI95-00251-01} The intended implementation model
- is for the static portion of a tag to be represented as a
- pointer to a statically allocated and link-time initialized
+ {<AI95-00251-01AI95-00251-01>} The intended implementation
+ model is for the static portion of a tag to be represented as
+ a pointer to a statically allocated and link-time initialized
type descriptor. The type descriptor contains the address of
the code for each primitive operation of the type. It
probably also contains other information, such as might make
@@ -14321,7 +14352,7 @@ dispatching operations. ]
operation; the linker fills in the actual addresses.
1.b.1/2
- {AI95-00251-01AI95-00251-01} Primitive operations of type
+ {<AI95-00251-01AI95-00251-01>} Primitive operations of type
extensions that are declared at a level deeper than the level
of the ultimate ancestor from which they are derived can be
represented by wrappers that use the dynamic part of the tag
@@ -14335,7 +14366,7 @@ dispatching operations. ]
indirect access.)
1.b.2/2
- {AI95-00251-01AI95-00251-01} If the tagged type is descended
+ {<AI95-00251-01AI95-00251-01>} If the tagged type is descended
from any interface types, it also will need to include
"subtags" (one for each interface) that describe the mapping
of the primitive operations of the interface to the primitives
@@ -14357,7 +14388,7 @@ dispatching operations. ]
possible to get a run-time error from a missing method.
1.e/2
- {AI95-00251-01AI95-00251-01} Dispatching calls should be
+ {<AI95-00251-01AI95-00251-01>} Dispatching calls should be
efficient, and should have a bounded worst-case execution
time. This is important in a language intended for real-time
applications. In the intended implementation model, a
@@ -14401,7 +14432,7 @@ dispatching operations. ]
the type profiles of the operations.
1.k/2
- {AI95-00401-01AI95-00401-01} When a type extension is
+ {<AI95-00401-01AI95-00401-01>} When a type extension is
declared, if there is any place within its immediate scope
where a certain subprogram of the parent or progenitor is
visible, then a matching subprogram should override. If there
@@ -14422,21 +14453,21 @@ dispatching operations. ]
_Static Semantics_
2/2
-{AI95-00345-01AI95-00345-01} A record type or private type that has the
-reserved word tagged in its declaration is called a tagged type. In
-addition, an interface type is a tagged type, as is a task or protected
-type derived from an interface (see *note 3.9.4::). [When deriving from
-a tagged type, as for any derived type, additional primitive subprograms
-may be defined, and inherited primitive subprograms may be overridden.]
-The derived type is called an extension of its ancestor types, or simply
-a type extension.
+{<AI95-00345-01AI95-00345-01>} A record type or private type that has
+the reserved word tagged in its declaration is called a <tagged> type.
+In addition, an interface type is a tagged type, as is a task or
+protected type derived from an interface (see *note 3.9.4::). [When
+deriving from a tagged type, as for any derived type, additional
+primitive subprograms may be defined, and inherited primitive
+subprograms may be overridden.] The derived type is called an
+<extension> of its ancestor types, or simply a <type extension>.
2.1/2
-{AI95-00345-01AI95-00345-01} Every type extension is also a tagged type,
-and is a record extension or a private extension of some other tagged
-type, or a noninterface synchronized tagged type (see *note 3.9.4::). A
-record extension is defined by a derived_type_definition with a
-record_extension_part (see *note 3.9.1::)[, which may include the
+{<AI95-00345-01AI95-00345-01>} Every type extension is also a tagged
+type, and is a <record extension> or a <private extension> of some other
+tagged type, or a noninterface synchronized tagged type (see *note
+3.9.4::). A record extension is defined by a derived_type_definition
+with a record_extension_part (see *note 3.9.1::)[, which may include the
definition of additional components]. A private extension, which is a
partial view of a record extension or of a synchronized tagged type, can
be declared in the visible part of a package (see *note 7.3::) or in a
@@ -14453,8 +14484,8 @@ generic formal part (see *note 12.5.1::).
with additional components.
2.b/2
- Ramification: {AI95-00218-03AI95-00218-03} If a tagged type is
- declared other than in a package_specification, it is
+ Ramification: {<AI95-00218-03AI95-00218-03>} If a tagged type
+ is declared other than in a package_specification, it is
impossible to add new primitive subprograms for that type,
although it can inherit primitive subprograms, and those can
be overridden. If the user incorrectly thinks a certain
@@ -14468,15 +14499,16 @@ generic formal part (see *note 12.5.1::).
with Ada 95.
3
-An object of a tagged type has an associated (run-time) tag that
+An object of a tagged type has an associated (run-time) <tag> that
identifies the specific tagged type used to create the object
-originally. [ The tag of an operand of a class-wide tagged type T'Class
-controls which subprogram body is to be executed when a primitive
-subprogram of type T is applied to the operand (see *note 3.9.2::);
-using a tag to control which body to execute is called dispatching.]
+originally. [ The tag of an operand of a class-wide tagged type
+<T>'Class controls which subprogram body is to be executed when a
+primitive subprogram of type <T> is applied to the operand (see *note
+3.9.2::); using a tag to control which body to execute is called
+<dispatching>.]
4/2
-{AI95-00344-01AI95-00344-01} The tag of a specific tagged type
+{<AI95-00344-01AI95-00344-01>} The tag of a specific tagged type
identifies the full_type_declaration of the type, and for a type
extension, is sufficient to uniquely identify the type among all
descendants of the same ancestor. If a declaration for a tagged type
@@ -14488,10 +14520,10 @@ generic body, the language does not specify whether
repeated
instantiations of the generic body result in distinct tags.
4.a/2
- This paragraph was deleted.{AI95-00344-01AI95-00344-01}
+ <This paragraph was deleted.>{<AI95-00344-01AI95-00344-01>}
4.a.1/2
- Implementation Note: {AI95-00344-01AI95-00344-01} In most
+ Implementation Note: {<AI95-00344-01AI95-00344-01>} In most
cases, a tag need only identify a particular tagged type
declaration, and can therefore be a simple link-time-known
address. However, for tag checks (see *note 3.9.2::) it is
@@ -14514,7 +14546,7 @@ instantiations of the generic body result in distinct
tags.
level of indirection, the type Tag could remain a single-word.
4.b/2
- {AI95-00344-01AI95-00344-01} For types that are not type
+ {<AI95-00344-01AI95-00344-01>} For types that are not type
extensions (even for ones declared in nested scopes), we do
not require that repeated elaborations of the same
full_type_declaration correspond to distinct tags. This was
@@ -14524,7 +14556,7 @@ instantiations of the generic body result in distinct
tags.
in Ada 95 require additional information with the tag.
4.c/2
- To be honest: {AI95-00344-01AI95-00344-01} The wording "is
+ To be honest: {<AI95-00344-01AI95-00344-01>} The wording "is
sufficient to uniquely identify the type among all descendants
of the same ancestor" only applies to types that currently
exist. It is not necessary to distinguish between descendants
@@ -14540,44 +14572,44 @@ instantiations of the generic body result in distinct
tags.
The following language-defined library package exists:
6/2
- {AI95-00362-01AI95-00362-01} package Ada.Tags is
+ {<AI95-00362-01AI95-00362-01>} package Ada.Tags is
pragma Preelaborate(Tags);
type Tag is private;
pragma Preelaborable_Initialization(Tag);
6.1/2
- {AI95-00260-02AI95-00260-02} No_Tag : constant Tag;
+ {<AI95-00260-02AI95-00260-02>} No_Tag : constant Tag;
7/2
- {AI95-00400-01AI95-00400-01} function Expanded_Name(T : Tag) return
String;
+ {<AI95-00400-01AI95-00400-01>} function Expanded_Name(T : Tag) return
String;
function Wide_Expanded_Name(T : Tag) return Wide_String;
function Wide_Wide_Expanded_Name(T : Tag) return Wide_Wide_String;
function External_Tag(T : Tag) return String;
function Internal_Tag(External : String) return Tag;
7.1/2
- {AI95-00344-01AI95-00344-01} function Descendant_Tag(External :
String; Ancestor : Tag) return Tag;
+ {<AI95-00344-01AI95-00344-01>} function Descendant_Tag(External :
String; Ancestor : Tag) return Tag;
function Is_Descendant_At_Same_Level(Descendant, Ancestor : Tag)
return Boolean;
7.2/2
- {AI95-00260-02AI95-00260-02} function Parent_Tag (T : Tag) return Tag;
+ {<AI95-00260-02AI95-00260-02>} function Parent_Tag (T : Tag) return
Tag;
7.3/2
- {AI95-00405-01AI95-00405-01} type Tag_Array is array (Positive range
<>) of Tag;
+ {<AI95-00405-01AI95-00405-01>} type Tag_Array is array (Positive
range <>) of Tag;
7.4/2
- {AI95-00405-01AI95-00405-01} function Interface_Ancestor_Tags (T :
Tag) return Tag_Array;
+ {<AI95-00405-01AI95-00405-01>} function Interface_Ancestor_Tags (T :
Tag) return Tag_Array;
7.5/3
- {AI05-0173-1AI05-0173-1} function Is_Abstract (T : Tag) return
Boolean;
+ {<AI05-0173-1AI05-0173-1>} function Is_Abstract (T : Tag) return
Boolean;
8
Tag_Error : exception;
9
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Tags;
9.a
@@ -14593,15 +14625,15 @@ The following language-defined library package exists:
one reason to allow equality for type Tag.
9.1/2
-{AI95-00260-02AI95-00260-02} No_Tag is the default initial value of type
-Tag.
+{<AI95-00260-02AI95-00260-02>} No_Tag is the default initial value of
+type Tag.
9.c/2
- Reason: {AI95-00260-02AI95-00260-02} This is similar to the
+ Reason: {<AI95-00260-02AI95-00260-02>} This is similar to the
requirement that all access values be initialized to null.
10/2
-{AI95-00400-01AI95-00400-01} The function Wide_Wide_Expanded_Name
+{<AI95-00400-01AI95-00400-01>} The function Wide_Wide_Expanded_Name
returns the full expanded name of the first subtype of the specific type
identified by the tag, in upper case, starting with a root library unit.
The result is implementation defined if the type is declared within an
@@ -14617,7 +14649,7 @@ unnamed block_statement.
unnamed block_statement.
10.1/2
-{AI95-00400-01AI95-00400-01} The function Expanded_Name (respectively,
+{<AI95-00400-01AI95-00400-01>} The function Expanded_Name (respectively,
Wide_Expanded_Name) returns the same sequence of graphic characters as
that defined for Wide_Wide_Expanded_Name, if all the graphic characters
are defined in Character (respectively, Wide_Character); otherwise, the
@@ -14645,12 +14677,12 @@ equivalent to the attribute_reference S'External_Tag
(see *note 13.3::).
via an attribute_definition_clause.
11.1/2
-{AI95-00417-01AI95-00417-01} The string returned by the functions
+{<AI95-00417-01AI95-00417-01>} The string returned by the functions
Expanded_Name, Wide_Expanded_Name, Wide_Wide_Expanded_Name, and
External_Tag has lower bound 1.
12/2
-{AI95-00279-01AI95-00279-01} The function Internal_Tag returns a tag
+{<AI95-00279-01AI95-00279-01>} The function Internal_Tag returns a tag
that corresponds to the given external tag, or raises Tag_Error if the
given string is not the external tag for any specific type of the
partition. Tag_Error is also raised if the specific type identified is
@@ -14658,19 +14690,20 @@ a library-level type whose tag has not yet been
created (see *note
13.14::).
12.a/3
- Reason: {AI95-00279-01AI95-00279-01} {AI05-0005-1AI05-0005-1}
- The check for uncreated library-level types prevents a
- reference to the type before execution reaches the freezing
- point of the type. This is important so that T'Class'Input or
- an instance of Tags.Generic_Dispatching_Constructor do not try
- to create an object of a type that hasn't been frozen (which
- might not have yet elaborated its constraints). We don't
- require this behavior for non-library-level types as the tag
- can be created multiple times and possibly multiple copies can
- exist at the same time, making the check complex.
+ Reason: {<AI95-00279-01AI95-00279-01>}
+ {<AI05-0005-1AI05-0005-1>} The check for uncreated
+ library-level types prevents a reference to the type before
+ execution reaches the freezing point of the type. This is
+ important so that T'Class'Input or an instance of
+ Tags.Generic_Dispatching_Constructor do not try to create an
+ object of a type that hasn't been frozen (which might not have
+ yet elaborated its constraints). We don't require this
+ behavior for non-library-level types as the tag can be created
+ multiple times and possibly multiple copies can exist at the
+ same time, making the check complex.
12.1/3
-{AI95-00344-01AI95-00344-01} {AI05-0113-1AI05-0113-1} The function
+{<AI95-00344-01AI95-00344-01>} {<AI05-0113-1AI05-0113-1>} The function
Descendant_Tag returns the (internal) tag for the type that corresponds
to the given external tag and is both a descendant of the type
identified by the Ancestor tag and has the same accessibility level as
@@ -14692,7 +14725,7 @@ has the appropriate Ancestor and accessibility level.
constructing a user-defined replacement for T'Class'Input.
12.b.1/3
- {AI05-0113-1AI05-0113-1} Rules for specifying external tags
+ {<AI05-0113-1AI05-0113-1>} Rules for specifying external tags
will usually prevent an external tag from identifying more
than one type. However, an external tag can identify multiple
types if a generic body contains a derivation of a tagged type
@@ -14702,7 +14735,7 @@ has the appropriate Ancestor and accessibility level.
case.)
12.2/2
-{AI95-00344-01AI95-00344-01} The function Is_Descendant_At_Same_Level
+{<AI95-00344-01AI95-00344-01>} The function Is_Descendant_At_Same_Level
returns True if the Descendant tag identifies a type that is both a
descendant of the type identified by Ancestor and at the same
accessibility level. If not, it returns False.
@@ -14716,9 +14749,9 @@ accessibility level. If not, it returns False.
a user-defined replacement for T'Class'Output.
12.3/3
-{AI05-0115-1AI05-0115-1} For the purposes of the dynamic semantics of
+{<AI05-0115-1AI05-0115-1>} For the purposes of the dynamic semantics of
functions Descendant_Tag and Is_Descendant_At_Same_Level, a tagged type
-T2 is a descendant of a type T1 if it is the same as T1, or if its
+T2 is a <descendant> of a type T1 if it is the same as T1, or if its
parent type or one of its progenitor types is a descendant of type T1 by
this rule[, even if at the point of the declaration of T2, one of the
derivations in the chain is not visible].
@@ -14729,20 +14762,20 @@ derivations in the chain is not visible].
parent type. See *note 7.3.1::.
12.4/4
-{AI95-00260-02AI95-00260-02} {AI12-0056-1AI12-0056-1} The function
+{<AI95-00260-02AI95-00260-02>} {<AI12-0056-1AI12-0056-1>} The function
Parent_Tag returns the tag of the parent type of the type whose tag is
T. If the type does not have a parent type (that is, it was not defined
by a derived_type_definition), then No_Tag is returned.
12.d/4
- Ramification: {AI12-0005-1AI12-0005-1} The parent type is
+ Ramification: {<AI12-0005-1AI12-0005-1>} The parent type is
always the parent of the full type; a private extension
appears to define a parent type, but it does not (only the
various forms of derivation do that). As this is a run-time
operation, ignoring privacy is OK.
12.5/3
-{AI95-00405-01AI95-00405-01} The function Interface_Ancestor_Tags
+{<AI95-00405-01AI95-00405-01>} The function Interface_Ancestor_Tags
returns an array containing the tag of each interface ancestor type of
the type whose tag is T, other than T itself. The lower bound of the
returned array is 1, and the order of the returned tags is unspecified.
@@ -14761,24 +14794,24 @@ has no interface ancestors, a null array is returned.]
has an interface as an ancestor.
12.6/3
-{AI05-0173-1AI05-0173-1} The function Is_Abstract returns True if the
+{<AI05-0173-1AI05-0173-1>} The function Is_Abstract returns True if the
type whose tag is T is abstract, and False otherwise.
13
-For every subtype S of a tagged type T (specific or class-wide), the
+For every subtype S of a tagged type <T> (specific or class-wide), the
following attributes are defined:
14
S'Class
S'Class denotes a subtype of the class-wide type (called
- T'Class in this International Standard) for the class
- rooted at T (or if S already denotes a class-wide
+ <T>'Class in this International Standard) for the class
+ rooted at <T> (or if S already denotes a class-wide
subtype, then S'Class is the same as S).
15
S'Class is unconstrained. However, if S is constrained,
then the values of S'Class are only those that when
- converted to the type T belong to S.
+ converted to the type <T> belong to S.
15.a
Ramification: This attribute is defined for both specific and
@@ -14788,10 +14821,10 @@ S'Class
15.b
Note that if S is constrained, S'Class is only partially
constrained, since there might be additional discriminants
- added in descendants of T which are not constrained.
+ added in descendants of <T> which are not constrained.
15.c/2
- Reason: {AI95-00326-01AI95-00326-01} The Class attribute is
+ Reason: {<AI95-00326-01AI95-00326-01>} The Class attribute is
not defined for untagged subtypes (except for incomplete types
and private types whose full view is tagged -- see *note
J.11:: and *note 7.3.1::) so as to preclude implicit
@@ -14802,7 +14835,7 @@ S'Class
16
S'Tag
- S'Tag denotes the tag of the type T (or if T is
+ S'Tag denotes the tag of the type <T> (or if <T> is
class-wide, the tag of the root type of the corresponding
class). The value of this attribute is of type Tag.
@@ -14828,11 +14861,11 @@ X'Tag
of a class-wide type.
18.1/2
-{AI95-00260-02AI95-00260-02} {AI95-00441-01AI95-00441-01} The following
-language-defined generic function exists:
+{<AI95-00260-02AI95-00260-02>} {<AI95-00441-01AI95-00441-01>} The
+following language-defined generic function exists:
18.2/3
- {AI05-0229-1AI05-0229-1} generic
+ {<AI05-0229-1AI05-0229-1>} generic
type T (<>) is abstract tagged limited private;
type Parameters (<>) is limited private;
with function Constructor (Params : not null access Parameters)
@@ -14844,7 +14877,7 @@ language-defined generic function exists:
pragma Preelaborate(Generic_Dispatching_Constructor);
18.3/2
-{AI95-00260-02AI95-00260-02} Tags.Generic_Dispatching_Constructor
+{<AI95-00260-02AI95-00260-02>} Tags.Generic_Dispatching_Constructor
provides a mechanism to create an object of an appropriate type from
just a tag value. The function Constructor is expected to create the
object given a reference to an object of type Parameters.
@@ -14865,20 +14898,20 @@ follows:
20
* The tag of a stand-alone object, a component, or an aggregate of a
- specific tagged type T identifies T.
+ specific tagged type <T> identifies <T>.
20.a
- Discussion: The tag of a formal parameter of type T is not
- necessarily the tag of T, if, for example, the actual was a
+ Discussion: The tag of a formal parameter of type <T> is not
+ necessarily the tag of <T>, if, for example, the actual was a
type conversion.
21
* The tag of an object created by an allocator for an access type
- with a specific designated tagged type T, identifies T.
+ with a specific designated tagged type <T>, identifies <T>.
21.a
Discussion: The tag of an object designated by a value of such
- an access type might not be T, if, for example, the access
+ an access type might not be <T>, if, for example, the access
value is the result of a type conversion.
22
@@ -14894,10 +14927,10 @@ follows:
23
* The tag of the result returned by a function whose result type is a
- specific tagged type T identifies T.
+ specific tagged type <T> identifies <T>.
23.a/2
- Implementation Note: {AI95-00318-02AI95-00318-02} For a
+ Implementation Note: {<AI95-00318-02AI95-00318-02>} For a
limited tagged type, the return object is "built in place" in
the ultimate result object with the appropriate tag. For a
nonlimited type, a new anonymous object with the appropriate
@@ -14905,7 +14938,7 @@ follows:
6.5::, "*note 6.5:: Return Statements".
24/2
- * {AI95-00318-02AI95-00318-02} The tag of the result returned by a
+ * {<AI95-00318-02AI95-00318-02>} The tag of the result returned by a
function with a class-wide result type is that of the return
object.
@@ -14914,16 +14947,16 @@ The tag is preserved by type conversion and by
parameter passing. The
tag of a value is the tag of the associated object (see *note 6.2::).
25.1/3
-{AI95-00260-02AI95-00260-02} {AI95-00344-01AI95-00344-01}
-{AI95-00405-01AI95-00405-01} {AI05-0092-1AI05-0092-1}
-{AI05-0262-1AI05-0262-1} Tag_Error is raised by a call of
+{<AI95-00260-02AI95-00260-02>} {<AI95-00344-01AI95-00344-01>}
+{<AI95-00405-01AI95-00405-01>} {<AI05-0092-1AI05-0092-1>}
+{<AI05-0262-1AI05-0262-1>} Tag_Error is raised by a call of
Descendant_Tag, Expanded_Name, External_Tag, Interface_Ancestor_Tags,
Is_Abstract, Is_Descendant_At_Same_Level, Parent_Tag,
Wide_Expanded_Name, or Wide_Wide_Expanded_Name if any tag passed is
No_Tag.
25.2/2
-{AI95-00260-02AI95-00260-02} An instance of
+{<AI95-00260-02AI95-00260-02>} An instance of
Tags.Generic_Dispatching_Constructor raises Tag_Error if The_Tag does
not represent a concrete descendant of T or if the innermost master (see
*note 7.6.1::) of this descendant is not also a master of the instance.
@@ -14945,12 +14978,12 @@ returns the result. Any exception raised by the
function is propagated.
_Erroneous Execution_
25.3/2
-{AI95-00260-02AI95-00260-02} If an internal tag provided to an instance
-of Tags.Generic_Dispatching_Constructor or to any subprogram declared in
-package Tags identifies either a type that is not library-level and
-whose tag has not been created (see *note 13.14::), or a type that does
-not exist in the partition at the time of the call, then execution is
-erroneous.
+{<AI95-00260-02AI95-00260-02>} If an internal tag provided to an
+instance of Tags.Generic_Dispatching_Constructor or to any subprogram
+declared in package Tags identifies either a type that is not
+library-level and whose tag has not been created (see *note 13.14::), or
+a type that does not exist in the partition at the time of the call,
+then execution is erroneous.
25.b/2
Ramification: One reason that a type might not exist in the
@@ -14976,7 +15009,7 @@ erroneous.
13.13.2::).
25.d/2
- Discussion: {AI95-00344-01AI95-00344-01} Ada 95 allowed
+ Discussion: {<AI95-00344-01AI95-00344-01>} Ada 95 allowed
Tag_Error in this case, or expected the functions to work.
This worked because most implementations used tags constructed
at link-time, and each elaboration of the same
@@ -15006,7 +15039,7 @@ erroneous.
_Implementation Permissions_
26/2
-{AI95-00260-02AI95-00260-02} {AI95-00279-01AI95-00279-01} The
+{<AI95-00260-02AI95-00260-02>} {<AI95-00279-01AI95-00279-01>} The
implementation of Internal_Tag and Descendant_Tag may raise Tag_Error if
no specific type corresponding to the string External passed as a
parameter exists in the partition at the time the function is called, or
@@ -15014,8 +15047,8 @@ if there is no such type whose innermost master is a
master of the point
of the function call.
26.a/2
- Reason: {AI95-00260-02AI95-00260-02}
- {AI95-00279-01AI95-00279-01} {AI95-00344-01AI95-00344-01}
+ Reason: {<AI95-00260-02AI95-00260-02>}
+ {<AI95-00279-01AI95-00279-01>} {<AI95-00344-01AI95-00344-01>}
Locking would be required to ensure that the mapping of
strings to tags never returned tags of types which no longer
exist, because types can cease to exist (because they belong
@@ -15029,7 +15062,7 @@ of the function call.
_Implementation Advice_
26.1/3
-{AI95-00260-02AI95-00260-02} {AI05-0113-1AI05-0113-1} Internal_Tag
+{<AI95-00260-02AI95-00260-02>} {<AI05-0113-1AI05-0113-1>} Internal_Tag
should return the tag of a type, if one exists, whose innermost master
is a master of the point of the function call.
@@ -15039,16 +15072,16 @@ is a master of the point of the function call.
of the point of the function call..
26.c/2
- Reason: {AI95-00260-02AI95-00260-02}
- {AI95-00344-01AI95-00344-01} It's not helpful if Internal_Tag
- returns the tag of some type in another task when one is
- available in the task that made the call. We don't require
- this behavior (because it requires the same implementation
- techniques we decided not to insist on previously), but
- encourage it.
+ Reason: {<AI95-00260-02AI95-00260-02>}
+ {<AI95-00344-01AI95-00344-01>} It's not helpful if
+ Internal_Tag returns the tag of some type in another task when
+ one is available in the task that made the call. We don't
+ require this behavior (because it requires the same
+ implementation techniques we decided not to insist on
+ previously), but encourage it.
26.d/3
- Discussion: {AI05-0113-1AI05-0113-1} There is no Advice for
+ Discussion: {<AI05-0113-1AI05-0113-1>} There is no Advice for
the result of Internal_Tag if no such type exists. In most
cases, the Implementation Permission can be used to raise
Tag_Error, but some other tag can be returned as well.
@@ -15072,14 +15105,14 @@ is a master of the point of the function call.
class-wide.
30/2
- 73 {AI95-00260-02AI95-00260-02} {AI95-00326-01AI95-00326-01} The
- capability provided by Tags.Generic_Dispatching_Constructor is
- sometimes known as a factory.
+ 73 {<AI95-00260-02AI95-00260-02>} {<AI95-00326-01AI95-00326-01>}
+ The capability provided by Tags.Generic_Dispatching_Constructor is
+ sometimes known as a <factory>.
_Examples_
31
-Examples of tagged record types:
+<Examples of tagged record types:>
32
type Point is tagged
@@ -15089,7 +15122,7 @@ Examples of tagged record types:
33
type Expression is tagged null record;
- -- Components will be added by each extension
+ --< Components will be added by each extension>
_Extensions to Ada 83_
@@ -15099,7 +15132,7 @@ Examples of tagged record types:
_Inconsistencies With Ada 95_
33.b/2
- {AI95-00279-01AI95-00279-01} Amendment Correction: Added
+ {<AI95-00279-01AI95-00279-01>} Amendment Correction: Added
wording specifying that Internal_Tag must raise Tag_Error if
the tag of a library-level type has not yet been created. Ada
95 gave an Implementation Permission to do this; we require it
@@ -15115,8 +15148,8 @@ Examples of tagged record types:
Permission, this is not a significant inconsistency.
33.c/2
- {AI95-00417-01AI95-00417-01} We now define the lower bound of
- the string returned from [[Wide_]Wide_]Expanded_Name and
+ {<AI95-00417-01AI95-00417-01>} We now define the lower bound
+ of the string returned from [[Wide_]Wide_]Expanded_Name and
External_Name. This makes working with the returned string
easier, and is consistent with many other string-returning
functions in Ada. This is technically an inconsistency; if a
@@ -15128,71 +15161,72 @@ Examples of tagged record types:
_Incompatibilities With Ada 95_
33.d/3
- {AI95-00260-02AI95-00260-02} {AI95-00344-01AI95-00344-01}
- {AI95-00400-01AI95-00400-01} {AI95-00405-01AI95-00405-01}
- {AI05-0005-1AI05-0005-1} Constant No_Tag, and functions
+ {<AI95-00260-02AI95-00260-02>} {<AI95-00344-01AI95-00344-01>}
+ {<AI95-00400-01AI95-00400-01>} {<AI95-00405-01AI95-00405-01>}
+ {<AI05-0005-1AI05-0005-1>} Constant No_Tag, and functions
Parent_Tag, Interface_Ancestor_Tags, Descendant_Tag,
Is_Descendant_At_Same_Level, Wide_Expanded_Name, and
Wide_Wide_Expanded_Name are added to Ada.Tags. If Ada.Tags is
- referenced in a use_clause, and an entity E with the same
+ referenced in a use_clause, and an entity <E> with the same
defining_identifier as a new entity in Ada.Tags is defined in
a package that is also referenced in a use_clause, the entity
- E may no longer be use-visible, resulting in errors. This
+ <E> may no longer be use-visible, resulting in errors. This
should be rare and is easily fixed if it does occur.
_Extensions to Ada 95_
33.e/2
- {AI95-00362-01AI95-00362-01} Ada.Tags is now defined to be
+ {<AI95-00362-01AI95-00362-01>} Ada.Tags is now defined to be
preelaborated.
33.f/2
- {AI95-00260-02AI95-00260-02} Generic function
+ {<AI95-00260-02AI95-00260-02>} Generic function
Tags.Generic_Dispatching_Constructor is new.
_Wording Changes from Ada 95_
33.g/2
- {AI95-00318-02AI95-00318-02} We talk about return objects
+ {<AI95-00318-02AI95-00318-02>} We talk about return objects
rather than return expressions, as functions can return using
an extended_return_statement.
33.h/2
- {AI95-00344-01AI95-00344-01} Added wording to define that tags
- for all descendants of a tagged type must be distinct. This
- is needed to ensure that more nested type extensions will work
- properly. The wording does not require implementation changes
- for types that were allowed in Ada 95.
+ {<AI95-00344-01AI95-00344-01>} Added wording to define that
+ tags for all descendants of a tagged type must be distinct.
+ This is needed to ensure that more nested type extensions will
+ work properly. The wording does not require implementation
+ changes for types that were allowed in Ada 95.
_Inconsistencies With Ada 2005_
33.i/3
- {AI05-0113-1AI05-0113-1} Correction: Added wording specifying
- that Dependent_Tag must raise Tag_Error if there is more than
- one type which matches the requirements. If an implementation
- had returned a random tag of the matching types, a program may
- have worked properly. However, such a program would not be
- portable (another implementation may return a different tag)
- and the conditions that would cause the problem are unlikely
- (most likely, a tagged type extension declared in a generic
- body with multiple instances in the same scope).
+ {<AI05-0113-1AI05-0113-1>} Correction: Added wording
+ specifying that Dependent_Tag must raise Tag_Error if there is
+ more than one type which matches the requirements. If an
+ implementation had returned a random tag of the matching
+ types, a program may have worked properly. However, such a
+ program would not be portable (another implementation may
+ return a different tag) and the conditions that would cause
+ the problem are unlikely (most likely, a tagged type extension
+ declared in a generic body with multiple instances in the same
+ scope).
_Incompatibilities With Ada 2005_
33.j/3
- {AI05-0173-1AI05-0173-1} Function Is_Abstract is added to
+ {<AI05-0173-1AI05-0173-1>} Function Is_Abstract is added to
Ada.Tags. If Ada.Tags is referenced in a use_clause, and an
- entity E with the defining_identifier Is_Abstract is defined
+ entity <E> with the defining_identifier Is_Abstract is defined
in a package that is also referenced in a use_clause, the
- entity E may no longer be use-visible, resulting in errors.
+ entity <E> may no longer be use-visible, resulting in errors.
This should be rare and is easily fixed if it does occur.
_Wording Changes from Ada 2005_
33.k/3
- {AI05-0115-1AI05-0115-1} Correction: We explicitly define the
- meaning of "descendant" at runtime, so that it does not depend
- on visibility as does the usual meaning.
+ {<AI05-0115-1AI05-0115-1>} Correction: We explicitly define
+ the meaning of "descendant" at runtime, so that it does not
+ depend on visibility as does the usual meaning.
* Menu:
@@ -15208,9 +15242,9 @@ File: aarm2012.info, Node: 3.9.1, Next: 3.9.2, Up:
3.9
---------------------
1/2
-{AI95-00345-01AI95-00345-01} [ Every type extension is a tagged type,
-and is a record extension or a private extension of some other tagged
-type, or a noninterface synchronized tagged type.]
+{<AI95-00345-01AI95-00345-01>} [ Every type extension is a tagged type,
+and is a <record extension> or a <private extension> of some other
+tagged type, or a noninterface synchronized tagged type.]
_Language Design Principles_
@@ -15232,37 +15266,37 @@ type, or a noninterface synchronized tagged type.]
_Legality Rules_
3/2
-{AI95-00344-01AI95-00344-01} {AI95-00345-01AI95-00345-01}
-{AI95-00419-01AI95-00419-01} The parent type of a record extension shall
-not be a class-wide type nor shall it be a synchronized tagged type (see
-*note 3.9.4::). If the parent type or any progenitor is nonlimited,
-then each of the components of the record_extension_part shall be
-nonlimited. In addition to the places where Legality Rules normally
-apply (see *note 12.3::), these rules apply also in the private part of
-an instance of a generic unit.
+{<AI95-00344-01AI95-00344-01>} {<AI95-00345-01AI95-00345-01>}
+{<AI95-00419-01AI95-00419-01>} The parent type of a record extension
+shall not be a class-wide type nor shall it be a synchronized tagged
+type (see *note 3.9.4::). If the parent type or any progenitor is
+nonlimited, then each of the components of the record_extension_part
+shall be nonlimited. In addition to the places where Legality Rules
+normally apply (see *note 12.3::), these rules apply also in the private
+part of an instance of a generic unit.
3.a
Reason: If the parent is a limited formal type, then the
actual might be nonlimited.
3.b/2
- {AI95-00344-01AI95-00344-01} Ada 95 required the record
+ {<AI95-00344-01AI95-00344-01>} Ada 95 required the record
extensions to be the same level as the parent type. Now we
use accessibility checks on class-wide allocators and return
statements to prevent objects from living longer than their
type.
3.c/2
- {AI95-00345-01AI95-00345-01} Synchronized tagged types cannot
- be extended. We have this limitation so that all of the data
- of a task or protected type is defined within the type. Data
- defined outside of the type wouldn't be subject to the mutual
- exclusion properties of a protected type, and couldn't be used
- by a task, and thus doesn't seem to be worth the potential
- impact on implementations.
+ {<AI95-00345-01AI95-00345-01>} Synchronized tagged types
+ cannot be extended. We have this limitation so that all of
+ the data of a task or protected type is defined within the
+ type. Data defined outside of the type wouldn't be subject to
+ the mutual exclusion properties of a protected type, and
+ couldn't be used by a task, and thus doesn't seem to be worth
+ the potential impact on implementations.
4/2
-{AI95-00344-01AI95-00344-01} Within the body of a generic unit, or the
+{<AI95-00344-01AI95-00344-01>} Within the body of a generic unit, or the
body of any of its descendant library units, a tagged type shall not be
declared as a descendant of a formal type declared within the formal
part of the generic unit.
@@ -15272,26 +15306,26 @@ part of the generic unit.
never attempt to execute an inaccessible subprogram body.
4.a.1/2
- {AI95-00344-01AI95-00344-01} The convoluted wording ("formal
+ {<AI95-00344-01AI95-00344-01>} The convoluted wording ("formal
type declared within the formal part") is necessary to include
tagged types that are formal parameters of formal packages of
the generic unit, as well as formal tagged and tagged formal
derived types of the generic unit.
4.b/2
- {AI95-00344-01AI95-00344-01} This rule is necessary in order
+ {<AI95-00344-01AI95-00344-01>} This rule is necessary in order
to preserve the contract model.
4.c/2
- {AI05-0005-1AI05-0005-1} {AI95-00344-01AI95-00344-01} If an
- ancestor is a formal of the generic unit , we have a problem
- because it might have an unknown number of subprograms that
- require overriding, as in the following example:
+ {<AI05-0005-1AI05-0005-1>} {<AI95-00344-01AI95-00344-01>} If
+ an ancestor is a formal of the generic unit , we have a
+ problem because it might have an unknown number of subprograms
+ that require overriding, as in the following example:
4.d/2
package P is
type T is tagged null record;
- function F return T; -- Inherited versions will require
overriding.
+ function F return T; --< Inherited versions will require
overriding.>
end P;
4.e
@@ -15304,11 +15338,11 @@ part of the generic unit.
4.f/2
package body Gp is
- type NT2 is new NT with null record; -- Illegal!
+ type NT2 is new NT with null record; --< Illegal!>
procedure Q(X : in NT2) is begin null; end Q;
- -- Is this legal or not? Can't decide because
- -- we don't know whether TT had any functions that require
- -- overriding on extension.
+ --< Is this legal or not? Can't decide because>
+ --< we don't know whether TT had any functions that require>
+ --< overriding on extension.>
end Gp;
4.g
@@ -15351,10 +15385,10 @@ part of the generic unit.
having to do with abstract types.
4.l/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
4.m/2
- Ramification: {AI95-00344AI95-00344} This rule applies to
+ Ramification: {<AI95-00344AI95-00344>} This rule applies to
types with ancestors (directly or indirectly) of formal
interface types (see *note 12.5.5::), formal tagged private
types (see *note 12.5.1::), and formal derived private types
@@ -15363,8 +15397,8 @@ part of the generic unit.
_Static Semantics_
4.1/2
-{AI95-00391-01AI95-00391-01} A record extension is a null extension if
-its declaration has no known_discriminant_part and its
+{<AI95-00391-01AI95-00391-01>} A record extension is a <null extension>
+if its declaration has no known_discriminant_part and its
record_extension_part includes no component_declarations.
_Dynamic Semantics_
@@ -15397,7 +15431,7 @@ of the record_definition.
extension").
7/2
- 75 {AI95-00344-01AI95-00344-01} When an extension is declared
+ 75 {<AI95-00344-01AI95-00344-01>} When an extension is declared
immediately within a body, primitive subprograms are inherited and
are overridable, but new primitive subprograms cannot be added.
@@ -15427,41 +15461,41 @@ of the record_definition.
_Examples_
10
-Examples of record extensions (of types defined above in *note 3.9::):
+<Examples of record extensions (of types defined above in *note 3.9::):>
11
type Painted_Point is new Point with
record
Paint : Color := White;
end record;
- -- Components X and Y are inherited
+ --< Components X and Y are inherited>
12
Origin : constant Painted_Point := (X | Y => 0.0, Paint => Black);
13
type Literal is new Expression with
- record -- a leaf in an Expression tree
+ record --< a leaf in an Expression tree>
Value : Real;
end record;
14
type Expr_Ptr is access all Expression'Class;
- -- see *note 3.10::
+ --< see *note 3.10::>
15
type Binary_Operation is new Expression with
- record -- an internal node in an Expression tree
+ record --< an internal node in an Expression tree>
Left, Right : Expr_Ptr;
end record;
16
type Addition is new Binary_Operation with null record;
type Subtraction is new Binary_Operation with null record;
- -- No additional components needed for these extensions
+ --< No additional components needed for these extensions>
17
- Tree : Expr_Ptr := -- A tree representation of "5.0 + (13.0-7.0)"
+ Tree : Expr_Ptr := --< A tree representation of "5.0 +
(13.0-7.0)">
new Addition'(
Left => new Literal'(Value => 5.0),
Right => new Subtraction'(
@@ -15476,7 +15510,7 @@ Examples of record extensions (of types defined above
in *note 3.9::):
_Extensions to Ada 95_
17.b/2
- {AI95-00344-01AI95-00344-01} Type extensions now can be
+ {<AI95-00344-01AI95-00344-01>} Type extensions now can be
declared in more nested scopes than their parent types.
Additional accessibility checks on allocators and return
statements prevent objects from outliving their type.
@@ -15484,11 +15518,11 @@ Examples of record extensions (of types defined above
in *note 3.9::):
_Wording Changes from Ada 95_
17.c/2
- {AI95-00345-01AI95-00345-01} Added wording to prevent
+ {<AI95-00345-01AI95-00345-01>} Added wording to prevent
extending synchronized tagged types.
17.d/2
- {AI95-00391-01AI95-00391-01} Defined null extension for use
+ {<AI95-00391-01AI95-00391-01>} Defined null extension for use
elsewhere.
@@ -15498,34 +15532,35 @@ File: aarm2012.info, Node: 3.9.2, Next: 3.9.3,
Prev: 3.9.1, Up: 3.9
--------------------------------------------
1/2
-{AI95-00260-02AI95-00260-02} {AI95-00335-01AI95-00335-01} The primitive
-subprograms of a tagged type, the subprograms declared by
+{<AI95-00260-02AI95-00260-02>} {<AI95-00335-01AI95-00335-01>} The
+primitive subprograms of a tagged type, the subprograms declared by
formal_abstract_subprogram_declaration (*note 12.6: S0298.)s, and the
stream attributes of a specific tagged type that are available (see
*note 13.13.2::) at the end of the declaration list where the type is
-declared are called dispatching operations. [A dispatching operation
-can be called using a statically determined controlling tag, in which
+declared are called <dispatching operations>. [A dispatching operation
+can be called using a statically determined <controlling> tag, in which
case the body to be executed is determined at compile time.
Alternatively, the controlling tag can be dynamically determined, in
-which case the call dispatches to a body that is determined at run
-time;] such a call is termed a dispatching call. [As explained below,
+which case the call <dispatches> to a body that is determined at run
+time;] such a call is termed a <dispatching call>. [As explained below,
the properties of the operands and the context of a particular call on a
dispatching operation determine how the controlling tag is determined,
and hence whether or not the call is a dispatching call. Run-time
polymorphism is achieved when a dispatching operation is called by a
-dispatching call.]
+dispatching call.]
1.a.1/2
- Reason: {AI95-00335-01AI95-00335-01} For the stream attributes
- of a type declared immediately within a package_specification
- that has a partial view, the declaration list to consider is
- the visible part of the package. Stream attributes that are
- not available in the same declaration list are not dispatching
- as there is no guarantee that descendants of the type have
- available attributes (there is such a guarantee for visibly
- available attributes). If we allowed dispatching for any
- available attribute, then for attributes defined in the
- private part we could end up executing a nonexistent body.
+ Reason: {<AI95-00335-01AI95-00335-01>} For the stream
+ attributes of a type declared immediately within a
+ package_specification that has a partial view, the declaration
+ list to consider is the visible part of the package. Stream
+ attributes that are not available in the same declaration list
+ are not dispatching as there is no guarantee that descendants
+ of the type have available attributes (there is such a
+ guarantee for visibly available attributes). If we allowed
+ dispatching for any available attribute, then for attributes
+ defined in the private part we could end up executing a
+ nonexistent body.
_Language Design Principles_
@@ -15539,22 +15574,22 @@ dispatching call.]
_Static Semantics_
2/3
-{AI95-00260-02AI95-00260-02} {AI95-00416-01AI95-00416-01}
-{AI05-0076-1AI05-0076-1} A call on a dispatching operation is a call
+{<AI95-00260-02AI95-00260-02>} {<AI95-00416-01AI95-00416-01>}
+{<AI05-0076-1AI05-0076-1>} A <call on a dispatching operation> is a call
whose name or prefix denotes the declaration of a dispatching operation.
-A controlling operand in a call on a dispatching operation of a tagged
-type T is one whose corresponding formal parameter is of type T or is of
-an anonymous access type with designated type T; the corresponding
-formal parameter is called a controlling formal parameter. If the
-controlling formal parameter is an access parameter, the controlling
-operand is the object designated by the actual parameter, rather than
-the actual parameter itself. If the call is to a (primitive) function
-with result type T (a function with a controlling result), then the call
-has a controlling result -- the context of the call can control the
-dispatching. Similarly, if the call is to a function with an access
-result type designating T (a function with a controlling access result),
-then the call has a controlling access result, and the context can
-similarly control dispatching.
+A <controlling operand> in a call on a dispatching operation of a tagged
+type <T> is one whose corresponding formal parameter is of type <T> or
+is of an anonymous access type with designated type <T>; the
+corresponding formal parameter is called a <controlling formal
+parameter>. If the controlling formal parameter is an access parameter,
+the controlling operand is the object designated by the actual
+parameter, rather than the actual parameter itself. If the call is to a
+(primitive) function with result type <T> (a <function with a
+controlling result>), then the call has a <controlling result> -- the
+context of the call can control the dispatching. Similarly, if the call
+is to a function with an access result type designating <T> (a <function
+with a controlling access result>), then the call has a <controlling
+access result>, and the context can similarly control dispatching.
2.a
Ramification: This definition implies that a call through the
@@ -15565,8 +15600,8 @@ similarly control dispatching.
thing being renamed is irrelevant.
3
-A name or expression of a tagged type is either statically tagged,
-dynamically tagged, or tag indeterminate, according to whether, when
+A name or expression of a tagged type is either <statically> tagged,
+<dynamically> tagged, or <tag indeterminate>, according to whether, when
used as a controlling operand, the tag that controls dispatching is
determined statically by the operand's (specific) type, dynamically by
its tag at run time, or from context. A qualified_expression or
@@ -15575,10 +15610,10 @@ tagged according to its operand. For other kinds of
names and
expressions, this is determined as follows:
4/2
- * {AI95-00416-01AI95-00416-01} The name or expression is statically
- tagged if it is of a specific tagged type and, if it is a call with
- a controlling result or controlling access result, it has at least
- one statically tagged controlling operand;
+ * {<AI95-00416-01AI95-00416-01>} The name or expression is
+ <statically tagged> if it is of a specific tagged type and, if it
+ is a call with a controlling result or controlling access result,
+ it has at least one statically tagged controlling operand;
4.a
Discussion: It is illegal to have both statically tagged and
@@ -15586,20 +15621,20 @@ expressions, this is determined as follows:
see below.
5/2
- * {AI95-00416-01AI95-00416-01} The name or expression is dynamically
- tagged if it is of a class-wide type, or it is a call with a
- controlling result or controlling access result and at least one
- dynamically tagged controlling operand;
+ * {<AI95-00416-01AI95-00416-01>} The name or expression is
+ <dynamically tagged> if it is of a class-wide type, or it is a call
+ with a controlling result or controlling access result and at least
+ one dynamically tagged controlling operand;
6/2
- * {AI95-00416-01AI95-00416-01} The name or expression is tag
- indeterminate if it is a call with a controlling result or
+ * {<AI95-00416-01AI95-00416-01>} The name or expression is <tag
+ indeterminate> if it is a call with a controlling result or
controlling access result, all of whose controlling operands (if
any) are tag indeterminate.
7/1
-{8652/00108652/0010} {AI95-00127-01AI95-00127-01} [A type_conversion is
-statically or dynamically tagged according to whether the type
+{<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>} [A type_conversion
+is statically or dynamically tagged according to whether the type
determined by the subtype_mark is specific or class-wide, respectively.]
For an object that is designated by an expression whose expected type is
an anonymous access-to-specific tagged type, the object is dynamically
@@ -15616,9 +15651,9 @@ respectively.
indeterminate.
7.a.1/1
- {8652/00108652/0010} {AI95-00127-01AI95-00127-01} Allocators
- and access attributes of class-wide types can be used as the
- controlling parameters of dispatching calls.
+ {<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
+ Allocators and access attributes of class-wide types can be
+ used as the controlling parameters of dispatching calls.
_Legality Rules_
@@ -15633,8 +15668,8 @@ and statically tagged controlling operands.
statically tagged operand(s).
9/1
-{8652/00108652/0010} {AI95-00127-01AI95-00127-01} If the expected type
-for an expression or name is some specific tagged type, then the
+{<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>} If the expected
+type for an expression or name is some specific tagged type, then the
expression or name shall not be dynamically tagged unless it is a
controlling operand in a call on a dispatching operation. Similarly, if
the expected type for an expression is an anonymous access-to-specific
@@ -15649,25 +15684,26 @@ dispatching operation.
this truncation.
9.b/4
- Ramification: {AI95-00252-01AI95-00252-01}
- {AI12-0039-1AI12-0039-1} This rule applies to all expressions
- or names with a specific expected type, not just those that
- are actual parameters to a dispatching call. This rule does
- not apply to a membership test whose tested_simple_expression
- is class-wide, since any type that covers the tested type is
- explicitly allowed. See *note 4.5.2::. This rule also
- doesn't apply to a selected_component whose selector_name is a
- subprogram, since the rules explicitly say that the prefix may
- be class-wide (see *note 4.1.3::).
+ Ramification: {<AI95-00252-01AI95-00252-01>}
+ {<AI12-0039-1AI12-0039-1>} This rule applies to all
+ expressions or names with a specific expected type, not just
+ those that are actual parameters to a dispatching call. This
+ rule does not apply to a membership test whose
+ <tested_>simple_expression is class-wide, since any type that
+ covers the tested type is explicitly allowed. See *note
+ 4.5.2::. This rule also doesn't apply to a selected_component
+ whose selector_name is a subprogram, since the rules
+ explicitly say that the prefix may be class-wide (see *note
+ 4.1.3::).
10/2
-{8652/00118652/0011} {AI95-00117-01AI95-00117-01}
-{AI95-00430-01AI95-00430-01} In the declaration of a dispatching
+{<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>}
+{<AI95-00430-01AI95-00430-01>} In the declaration of a dispatching
operation of a tagged type, everywhere a subtype of the tagged type
appears as a subtype of the profile (see *note 6.1::), it shall
-statically match the first subtype of the tagged type. If the
+statically match the first subtype of the tagged type. If the
dispatching operation overrides an inherited subprogram, it shall be
-subtype conformant with the inherited subprogram. The convention of an
+subtype conformant with the inherited subprogram. The convention of an
inherited dispatching operation is the convention of the corresponding
primitive operation of the parent or progenitor type. The default
convention of a dispatching operation that overrides an inherited
@@ -15684,11 +15720,11 @@ shall not be of convention Intrinsic.
that are outside of its first subtype.
11/2
-{AI95-00416-01AI95-00416-01} The default_expression for a controlling
+{<AI95-00416-01AI95-00416-01>} The default_expression for a controlling
formal parameter of a dispatching operation shall be tag indeterminate.
11.a/2
- Reason: {AI95-00416-01AI95-00416-01} This rule ensures that
+ Reason: {<AI95-00416-01AI95-00416-01>} This rule ensures that
the default_expression always produces the "correct" tag when
called with or without dispatching, or when inherited by a
descendant. If it were statically tagged, the default would
@@ -15697,8 +15733,8 @@ formal parameter of a dispatching operation shall be
tag indeterminate.
call.
11.1/2
-{AI95-00404-01AI95-00404-01} If a dispatching operation is defined by a
-subprogram_renaming_declaration or the instantiation of a generic
+{<AI95-00404-01AI95-00404-01>} If a dispatching operation is defined by
+a subprogram_renaming_declaration or the instantiation of a generic
subprogram, any access parameter of the renamed subprogram or the
generic subprogram that corresponds to a controlling access parameter of
the dispatching operation, shall have a subtype that excludes null.
@@ -15714,12 +15750,13 @@ distinct tagged types.
types.
12.a.1/1
- Ramification: {8652/00988652/0098}
- {AI95-00183-01AI95-00183-01} This restriction applies even if
- the partial view (see *note 7.3::) of one or both of the types
- is untagged. This follows from the definition of dispatching
- operation: the operation is a dispatching operation anywhere
- the full views of the (tagged) types are visible.
+ Ramification: {<8652/00988652/0098>}
+ {<AI95-00183-01AI95-00183-01>} This restriction applies even
+ if the partial view (see *note 7.3::) of one or both of the
+ types is untagged. This follows from the definition of
+ dispatching operation: the operation is a dispatching
+ operation anywhere the full views of the (tagged) types are
+ visible.
13
The explicit declaration of a primitive subprogram of a tagged type
@@ -15729,13 +15766,13 @@ values of the type exist, nor after deriving a record
extension from it,
nor after a body.]
13.a/2
- Reason: {AI95-00344-01AI95-00344-01} This rule is needed
+ Reason: {<AI95-00344-01AI95-00344-01>} This rule is needed
because (1) we don't want people dispatching to things that
haven't been declared yet, and (2) we want to allow the static
part of tagged type descriptors to be static (allocated
statically, and initialized to link-time-known symbols).
Suppose T2 inherits primitive P from T1, and then overrides P.
- Suppose P is called before the declaration of the overriding
+ Suppose P is called <before> the declaration of the overriding
P. What should it dispatch to? If the answer is the new P,
we've violated the first principle above. If the answer is
the old P, we've violated the second principle. (A call to
@@ -15743,8 +15780,8 @@ nor after a body.]
beside the point.)
13.b
- Note that a call upon a dispatching operation of type T will
- freeze T.
+ Note that a call upon a dispatching operation of type <T> will
+ freeze <T>.
13.c
We considered applying this rule to all derived types, for
@@ -15754,7 +15791,7 @@ nor after a body.]
confusing).
13.d/2
- Implementation Note: {AI95-00326-01AI95-00326-01} Because of
+ Implementation Note: {<AI95-00326-01AI95-00326-01>} Because of
this rule, the type descriptor can be created (presumably
containing linker symbols pointing at the not-yet-compiled
bodies) at the first freezing point of the type. It also
@@ -15763,15 +15800,15 @@ nor after a body.]
subprogram.
13.e/2
- Ramification: {AI95-00251-01AI95-00251-01} A consequence is
+ Ramification: {<AI95-00251-01AI95-00251-01>} A consequence is
that for a tagged type declaration in a declarative_part, only
the last (overriding) primitive subprogram can be declared by
a subprogram_body. (Other overridings must be provided by
subprogram_declarations.)
13.f/3
- To be honest: {AI05-0222-1AI05-0222-1} This rule applies only
- to "original" declarations and not to the completion of a
+ To be honest: {<AI05-0222-1AI05-0222-1>} This rule applies
+ only to "original" declarations and not to the completion of a
primitive subprogram, even though a completion is technically
an explicit declaration, and it may declare a primitive
subprogram.
@@ -15779,26 +15816,28 @@ nor after a body.]
_Dynamic Semantics_
14
-For the execution of a call on a dispatching operation of a type T, the
-controlling tag value determines which subprogram body is executed. The
-controlling tag value is defined as follows:
+For the execution of a call on a dispatching operation of a type <T>,
+the <controlling tag value> determines which subprogram body is
+executed. The controlling tag value is defined as follows:
15
* If one or more controlling operands are statically tagged, then the
- controlling tag value is statically determined to be the tag of T.
+ controlling tag value is <statically determined> to be the tag of
+ <T>.
16
* If one or more controlling operands are dynamically tagged, then
the controlling tag value is not statically determined, but is
- rather determined by the tags of the controlling operands. If there
- is more than one dynamically tagged controlling operand, a check is
- made that they all have the same tag. If this check fails,
- Constraint_Error is raised unless the call is a function_call whose
- name denotes the declaration of an equality operator (predefined or
- user defined) that returns Boolean, in which case the result of the
- call is defined to indicate inequality, and no subprogram_body is
- executed. This check is performed prior to evaluating any
- tag-indeterminate controlling operands.
+ rather determined by the tags of the controlling operands. If
+ there is more than one dynamically tagged controlling operand, a
+ check is made that they all have the same tag. If this check
+ fails, Constraint_Error is raised unless the call is a
+ function_call whose name denotes the declaration of an equality
+ operator (predefined or user defined) that returns Boolean, in
+ which case the result of the call is defined to indicate
+ inequality, and no subprogram_body is executed. This check is
+ performed prior to evaluating any tag-indeterminate controlling
+ operands.
16.a
Reason: Tag mismatch is considered an error (except for "="
@@ -15814,21 +15853,22 @@ controlling tag value is defined as follows:
Constraint_Error.
17/2
- * {AI95-00196-01AI95-00196-01} If all of the controlling operands (if
- any) are tag-indeterminate, then:
+ * {<AI95-00196-01AI95-00196-01>} If all of the controlling operands
+ (if any) are tag-indeterminate, then:
18/2
- * {AI95-00239-01AI95-00239-01} {AI95-00416-01AI95-00416-01}
- If the call has a controlling result or controlling
- access result and is itself, or designates, a (possibly
- parenthesized or qualified) controlling operand of an
- enclosing call on a dispatching operation of a descendant
- of type T, then its controlling tag value is determined
- by the controlling tag value of this enclosing call;
+ * {<AI95-00239-01AI95-00239-01>}
+ {<AI95-00416-01AI95-00416-01>} If the call has a
+ controlling result or controlling access result and is
+ itself, or designates, a (possibly parenthesized or
+ qualified) controlling operand of an enclosing call on a
+ dispatching operation of a descendant of type <T>, then
+ its controlling tag value is determined by the
+ controlling tag value of this enclosing call;
18.a/2
- Discussion: {AI95-00239-01AI95-00239-01} For code that a user
- can write explicitly, the only contexts that can control
+ Discussion: {<AI95-00239-01AI95-00239-01>} For code that a
+ user can write explicitly, the only contexts that can control
dispatching of a function with a controlling result of type T
are those that involve controlling operands of the same type
T: if the two types differ there is an illegality and the
@@ -15847,17 +15887,17 @@ controlling tag value is defined as follows:
call, so it is guaranteed to always land on a concrete body.
18.1/2
- * {AI95-00196-01AI95-00196-01} {AI95-00416-01AI95-00416-01}
- If the call has a controlling result or controlling
- access result and (possibly parenthesized, qualified, or
- dereferenced) is the expression of an
- assignment_statement whose target is of a class-wide
- type, then its controlling tag value is determined by the
- target;
+ * {<AI95-00196-01AI95-00196-01>}
+ {<AI95-00416-01AI95-00416-01>} If the call has a
+ controlling result or controlling access result and
+ (possibly parenthesized, qualified, or dereferenced) is
+ the expression of an assignment_statement whose target is
+ of a class-wide type, then its controlling tag value is
+ determined by the target;
19
* Otherwise, the controlling tag value is statically
- determined to be the tag of type T.
+ determined to be the tag of type <T>.
19.a
Ramification: This includes the cases of a tag-indeterminate
@@ -15866,19 +15906,19 @@ controlling tag value is defined as follows:
object.
20/3
-{AI95-00345-01AI95-00345-01} {AI05-0126-1AI05-0126-1} For the execution
-of a call on a dispatching operation, the action performed is determined
-by the properties of the corresponding dispatching operation of the
-specific type identified by the controlling tag value:
+{<AI95-00345-01AI95-00345-01>} {<AI05-0126-1AI05-0126-1>} For the
+execution of a call on a dispatching operation, the action performed is
+determined by the properties of the corresponding dispatching operation
+of the specific type identified by the controlling tag value:
20.1/3
- * {AI05-0126-1AI05-0126-1} if the corresponding operation is
+ * {<AI05-0126-1AI05-0126-1>} if the corresponding operation is
explicitly declared for this type, [even if the declaration occurs
in a private part], then the action comprises an invocation of the
explicit body for the operation;
20.2/3
- * {AI95-00345-01AI95-00345-01} {AI05-0126-1AI05-0126-1} if the
+ * {<AI95-00345-01AI95-00345-01>} {<AI05-0126-1AI05-0126-1>} if the
corresponding operation is implicitly declared for this type and is
implemented by an entry or protected subprogram (see *note 9.1::
and *note 9.4::), then the action comprises a call on this entry or
@@ -15888,14 +15928,14 @@ specific type identified by the controlling tag value:
actual parameters of the call, if any;
20.3/3
- * {AI05-0197-1AI05-0197-1} if the corresponding operation is a
+ * {<AI05-0197-1AI05-0197-1>} if the corresponding operation is a
predefined operator then the action comprises an invocation of that
operator;
20.4/3
- * {AI95-00345-01AI95-00345-01} {AI05-0126-1AI05-0126-1}
- {AI05-0197-1AI05-0197-1} {AI05-0250-1AI05-0250-1}
- {AI05-0254-1AI05-0254-1} otherwise, the action is the same as the
+ * {<AI95-00345-01AI95-00345-01>} {<AI05-0126-1AI05-0126-1>}
+ {<AI05-0197-1AI05-0197-1>} {<AI05-0250-1AI05-0250-1>}
+ {<AI05-0254-1AI05-0254-1>} otherwise, the action is the same as the
action for the corresponding operation of the parent type or
progenitor type from which the operation was inherited except that
additional invariant checks (see *note 7.3.2::) and class-wide
@@ -15905,29 +15945,29 @@ specific type identified by the controlling tag value:
action is that of an arbitrary one of the operations.
20.a/3
- This paragraph was deleted.{AI05-0126-1AI05-0126-1}
+ <This paragraph was deleted.>{<AI05-0126-1AI05-0126-1>}
20.a.1/3
- Ramification: {AI05-0005-1AI05-0005-1}
- {AI05-0126-1AI05-0126-1} "Corresponding dispatching operation"
- refers to the inheritance relationship between subprograms.
- Primitive operations are always inherited for a type T, but
- they might not be declared if the primitive operation is never
- visible within the immediate scope of the type T. If no
- corresponding operation is declared, the last bullet is used
- and the corresponding operation of the parent type is executed
- (an explicit body that happens to have the same name and
- profile is not called in that case).
+ Ramification: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0126-1AI05-0126-1>} "Corresponding dispatching
+ operation" refers to the inheritance relationship between
+ subprograms. Primitive operations are always inherited for a
+ type T, but they might not be declared if the primitive
+ operation is never visible within the immediate scope of the
+ type T. If no corresponding operation is declared, the last
+ bullet is used and the corresponding operation of the parent
+ type is executed (an explicit body that happens to have the
+ same name and profile is not called in that case).
20.a.2/3
- {AI05-0005-1AI05-0005-1} {AI05-0126-1AI05-0126-1} We have to
- talk about progenitors in the last bullet in case the
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0126-1AI05-0126-1>} We have
+ to talk about progenitors in the last bullet in case the
corresponding operation is a null procedure inherited from an
interface. In that case, the parent type might not even have
the operation in question.
20.a.3/3
- {AI05-0197-1AI05-0197-1} For the last bullet, if there are
+ {<AI05-0197-1AI05-0197-1>} For the last bullet, if there are
multiple corresponding operations for the parent and
progenitors, all but one of them have to be a null procedure.
(If the progenitors declared abstract routines, there would
@@ -15936,13 +15976,13 @@ specific type identified by the controlling tag value:
one exists.
20.a.4/3
- {AI05-0126-1AI05-0126-1} Any explicit declaration for an
+ {<AI05-0126-1AI05-0126-1>} Any explicit declaration for an
inherited corresponding operation has to be an overriding
routine. These rules mean that a dispatching call executes
the overriding routine (if any) for the specific type.
20.b/3
- Reason: {AI05-0005-1AI05-0005-1} The wording of the above
+ Reason: {<AI05-0005-1AI05-0005-1>} The wording of the above
rules is intended to ensure that the same body is executed for
a given tag, whether that tag is determined statically or
dynamically. For a type declared in a package, it doesn't
@@ -15972,10 +16012,10 @@ specific type identified by the controlling tag value:
X : P2.T2;
Y : P1.T1'Class := X;
begin
- P2.Op_A(Param => X); -- Nondispatching call to a
dispatching operation.
- P1.Op_A(Arg => Y); -- Dispatching call.
- P2.Op_B(Arg => X); -- Nondispatching call to a dispatching
operation.
- P1.Op_B(Arg => Y); -- Dispatching call.
+ P2.Op_A(Param => X); --< Nondispatching call to a
dispatching operation.>
+ P1.Op_A(Arg => Y); --< Dispatching call.>
+ P2.Op_B(Arg => X); --< Nondispatching call to a dispatching
operation.>
+ P1.Op_B(Arg => Y); --< Dispatching call.>
end Main;
20.f
@@ -15996,8 +16036,8 @@ specific type identified by the controlling tag value:
call.
20.h
- Implementation Note: Even when a tag is not statically
- determined, a compiler might still be able to figure it out
+ Implementation Note: Even when a tag is not <statically
+ determined>, a compiler might still be able to figure it out
and thereby avoid the overhead of run-time dispatching.
NOTES
@@ -16010,7 +16050,7 @@ specific type identified by the controlling tag value:
call.
22/2
- 79 {AI95-00260-02AI95-00260-02} This subclause covers calls on
+ 79 {<AI95-00260-02AI95-00260-02>} This subclause covers calls on
dispatching subprograms of a tagged type. Rules for tagged type
membership tests are described in *note 4.5.2::. Controlling tag
determination for an assignment_statement is described in *note
@@ -16035,7 +16075,7 @@ specific type identified by the controlling tag value:
_Incompatibilities With Ada 95_
24.b/2
- {AI95-00404-01AI95-00404-01} If a dispatching operation is
+ {<AI95-00404-01AI95-00404-01>} If a dispatching operation is
defined by a subprogram_renaming_declaration, and it has a
controlling access parameter, Ada 2005 requires the subtype of
the parameter to exclude null. The same applies to
@@ -16052,53 +16092,53 @@ specific type identified by the controlling tag value:
_Extensions to Ada 95_
24.c/2
- {AI95-00416-01AI95-00416-01} Functions that have an access
+ {<AI95-00416-01AI95-00416-01>} Functions that have an access
result type can be dispatching in the same way as a function
that returns a tagged object directly.
_Wording Changes from Ada 95_
24.d/3
- {8652/00108652/0010} {AI95-00127-01AI95-00127-01}
- {AI05-0299-1AI05-0299-1} Corrigendum: Allocators and access
+ {<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
+ {<AI05-0299-1AI05-0299-1>} Corrigendum: Allocators and access
attributes of objects of class-wide types can be used as the
controlling parameter in a dispatching calls. This was an
oversight in the definition of Ada 95. (See *note 3.10.2::
and *note 4.8::).
24.e/2
- {8652/00118652/0011} {AI95-00117-01AI95-00117-01}
- {AI95-00430-01AI95-00430-01} Corrigendum: Corrected the
+ {<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>}
+ {<AI95-00430-01AI95-00430-01>} Corrigendum: Corrected the
conventions of dispatching operations. This is extended in
Ada 2005 to cover operations inherited from progenitors, and
to ensure that the conventions of all inherited operations are
the same.
24.f/2
- {AI95-00196-01AI95-00196-01} Clarified the wording to ensure
+ {<AI95-00196-01AI95-00196-01>} Clarified the wording to ensure
that functions with no controlling operands are
tag-indeterminate, and to describe that the controlling tag
can come from the target of an assignment_statement.
24.g/2
- {AI95-00239-01AI95-00239-01} Fixed the wording to cover
+ {<AI95-00239-01AI95-00239-01>} Fixed the wording to cover
default expressions inherited by derived subprograms. A
literal reading of the old wording would have implied that
operations would be called with objects of the wrong type.
24.h/2
- {AI95-00260-02AI95-00260-02} An abstract formal subprogram is
- a dispatching operation, even though it is not a primitive
+ {<AI95-00260-02AI95-00260-02>} An abstract formal subprogram
+ is a dispatching operation, even though it is not a primitive
operation. See *note 12.6::, "*note 12.6:: Formal
Subprograms".
24.i/2
- {AI95-00345-01AI95-00345-01} Dispatching calls include
+ {<AI95-00345-01AI95-00345-01>} Dispatching calls include
operations implemented by entries and protected operations, so
we have to update the wording to reflect that.
24.j/2
- {AI95-00335-01AI95-00335-01} A stream attribute of a tagged
+ {<AI95-00335-01AI95-00335-01>} A stream attribute of a tagged
type is usually a dispatching operation, even though it is not
a primitive operation. If they weren't dispatching,
T'Class'Input and T'Class'Output wouldn't work.
@@ -16106,14 +16146,15 @@ specific type identified by the controlling tag value:
_Wording Changes from Ada 2005_
24.k/3
- {AI05-0076-1AI05-0076-1} Correction: Defined "function with a
- controlling result", as it is used in *note 3.9.3::.
+ {<AI05-0076-1AI05-0076-1>} Correction: Defined "function with
+ a controlling result", as it is used in *note 3.9.3::.
24.l/3
- {AI05-0126-1AI05-0126-1} {AI05-0197-1AI05-0197-1} Correction:
- Corrected holes in the definition of dynamic dispatching: the
- behavior for operations that are never declared and/or
- inherited from a progenitor were not specified.
+ {<AI05-0126-1AI05-0126-1>} {<AI05-0197-1AI05-0197-1>}
+ Correction: Corrected holes in the definition of dynamic
+ dispatching: the behavior for operations that are never
+ declared and/or inherited from a progenitor were not
+ specified.
File: aarm2012.info, Node: 3.9.3, Next: 3.9.4, Prev: 3.9.2, Up: 3.9
@@ -16122,10 +16163,10 @@ File: aarm2012.info, Node: 3.9.3, Next: 3.9.4,
Prev: 3.9.2, Up: 3.9
------------------------------------
1/2
-{AI95-00345-01AI95-00345-01} [ An abstract type is a tagged type
+{<AI95-00345-01AI95-00345-01>} [ An <abstract type> is a tagged type
intended for use as an ancestor of other types, but which is not allowed
-to have objects of its own. An abstract subprogram is a subprogram that
-has no body, but is intended to be overridden at some point when
+to have objects of its own. An <abstract subprogram> is a subprogram
+that has no body, but is intended to be overridden at some point when
inherited. Because objects of an abstract type cannot be created, a
dispatching call to an abstract subprogram always dispatches to some
overriding body.]
@@ -16138,7 +16179,7 @@ overriding body.]
_Language Design Principles_
1.a/3
- {AI05-0299-1AI05-0299-1} An abstract subprogram has no body,
+ {<AI05-0299-1AI05-0299-1>} An abstract subprogram has no body,
so the rules in this subclause are designed to ensure (at
compile time) that the body will never be invoked. We do so
primarily by disallowing the creation of values of the
@@ -16152,8 +16193,8 @@ overriding body.]
_Syntax_
1.1/3
- {AI95-00218-03AI95-00218-03} {AI95-00348-01AI95-00348-01}
- {AI05-0183-1AI05-0183-1} abstract_subprogram_declaration ::=
+ {<AI95-00218-03AI95-00218-03>} {<AI95-00348-01AI95-00348-01>}
+ {<AI05-0183-1AI05-0183-1>} abstract_subprogram_declaration ::=
[overriding_indicator]
subprogram_specification is abstract
[aspect_specification];
@@ -16161,7 +16202,7 @@ overriding body.]
_Static Semantics_
1.2/2
-{AI95-00345-01AI95-00345-01} Interface types (see *note 3.9.4::) are
+{<AI95-00345-01AI95-00345-01>} Interface types (see *note 3.9.4::) are
abstract types. In addition, a tagged type that has the reserved word
abstract in its declaration is an abstract type. The class-wide type
(see *note 3.4.1::) rooted at an abstract type is not itself an abstract
@@ -16170,8 +16211,8 @@ type.
_Legality Rules_
2/2
-{AI95-00345-01AI95-00345-01} Only a tagged type shall have the reserved
-word abstract in its declaration.
+{<AI95-00345-01AI95-00345-01>} Only a tagged type shall have the
+reserved word abstract in its declaration.
2.a
Ramification: Untagged types are never abstract, even though
@@ -16188,11 +16229,11 @@ word abstract in its declaration.
will necessarily be different from T'Tag.
3/2
-{AI95-00260-02AI95-00260-02} {AI95-00348-01AI95-00348-01} A subprogram
-declared by an abstract_subprogram_declaration (*note 3.9.3: S0076.) or
-a formal_abstract_subprogram_declaration (*note 12.6: S0298.) (see *note
-12.6::) is an abstract subprogram. If it is a primitive subprogram of a
-tagged type, then the tagged type shall be abstract.
+{<AI95-00260-02AI95-00260-02>} {<AI95-00348-01AI95-00348-01>} A
+subprogram declared by an abstract_subprogram_declaration (*note 3.9.3:
+S0076.) or a formal_abstract_subprogram_declaration (*note 12.6: S0298.)
+(see *note 12.6::) is an <abstract subprogram>. If it is a primitive
+subprogram of a tagged type, then the tagged type shall be abstract.
3.a
Ramification: Note that for a private type, this applies to
@@ -16201,24 +16242,24 @@ tagged type, then the tagged type shall be abstract.
3.b
package P is
type T is abstract tagged private;
- function Foo (X : T) return Boolean is abstract; -- Illegal!
+ function Foo (X : T) return Boolean is abstract; --<
Illegal!>
private
- type T is tagged null record; -- Illegal!
+ type T is tagged null record; --< Illegal!>
X : T;
Y : Boolean := Foo (T'Class (X));
end P;
3.c
The full view of T is not abstract, but has an abstract
- operation Foo, which is illegal. The two lines marked "--
- Illegal!" are illegal when taken together.
+ operation Foo, which is illegal. The two lines marked "--<
+ Illegal!>" are illegal when taken together.
3.d/2
- Reason: {AI95-00310-01AI95-00310-01} We considered disallowing
- untagged types from having abstract primitive subprograms.
- However, we rejected that plan, because it introduced some
- silly anomalies, and because such subprograms are harmless.
- For example:
+ Reason: {<AI95-00310-01AI95-00310-01>} We considered
+ disallowing untagged types from having abstract primitive
+ subprograms. However, we rejected that plan, because it
+ introduced some silly anomalies, and because such subprograms
+ are harmless. For example:
3.e/1
package P is
@@ -16228,7 +16269,7 @@ tagged type, then the tagged type shall be abstract.
. . .
package Q is
type My_Field_Size is new Field_Size;
- -- implicit declaration of Print(X : T; F : My_Field_Size :=
0) is abstract;
+ --< implicit declaration of Print(X : T; F : My_Field_Size
:= 0) is abstract;>
end Q;
3.f
@@ -16239,27 +16280,27 @@ tagged type, then the tagged type shall be abstract.
but the current ones seem like the simplest.
3.g/2
- {AI95-00310-01AI95-00310-01} In Ada 2005, abstract primitive
+ {<AI95-00310-01AI95-00310-01>} In Ada 2005, abstract primitive
subprograms of an untagged type may be used to "undefine" an
operation.
3.h/2
- Ramification: {AI95-00260-02AI95-00260-02} Note that the
+ Ramification: {<AI95-00260-02AI95-00260-02>} Note that the
second sentence does not apply to abstract formal subprograms,
as they are never primitive operations of a type.
4/3
-{AI95-00251-01AI95-00251-01} {AI95-00334-01AI95-00334-01}
-{AI95-00391-01AI95-00391-01} {AI05-0097-1AI05-0097-1}
-{AI05-0198-1AI05-0198-1} If a type has an implicitly declared primitive
-subprogram that is inherited or is a predefined operator, and the
-corresponding primitive subprogram of the parent or ancestor type is
+{<AI95-00251-01AI95-00251-01>} {<AI95-00334-01AI95-00334-01>}
+{<AI95-00391-01AI95-00391-01>} {<AI05-0097-1AI05-0097-1>}
+{<AI05-0198-1AI05-0198-1>} If a type has an implicitly declared
+primitive subprogram that is inherited or is a predefined operator, and
+the corresponding primitive subprogram of the parent or ancestor type is
abstract or is a function with a controlling access result, or if a type
other than a nonabstract null extension inherits a function with a
controlling result, then:
4.a/3
- Ramification: {AI05-0068-1AI05-0068-1} These rules apply to
+ Ramification: {<AI05-0068-1AI05-0068-1>} These rules apply to
each view of the type individually. That is necessary to
preserve privacy. For instance, in the following example:
@@ -16273,7 +16314,7 @@ controlling result, then:
with P;
package Q is
type T is abstract new P.I with private;
- -- Op inherited here.
+ -- <Op inherited here.>
private
type T is abstract new P.I with null record;
procedure Op (X : T) is null;
@@ -16283,7 +16324,7 @@ controlling result, then:
with Q;
package R is
type T2 is new Q.T with null record;
- -- Illegal. Op inherited here, but requires overriding.
+ -- <Illegal. Op inherited here, but requires overriding.>
end R;
4.e/3
@@ -16302,29 +16343,29 @@ controlling result, then:
been legal.
5/2
- * {AI95-00251-01AI95-00251-01} {AI95-00334-01AI95-00334-01} If the
- type is abstract or untagged, the implicitly declared subprogram is
- abstract.
+ * {<AI95-00251-01AI95-00251-01>} {<AI95-00334-01AI95-00334-01>} If
+ the type is abstract or untagged, the implicitly declared
+ subprogram is <abstract>.
5.a
Ramification: Note that it is possible to override a concrete
subprogram with an abstract one.
6/4
- * {AI95-00391-01AI95-00391-01} {AI12-0080-1AI12-0080-1} Otherwise,
- the subprogram shall be overridden with a nonabstract subprogram
- or, in the case of a private extension inheriting a nonabstract
- function with a controlling result, have a full type that is a null
- extension[; for a type declared in the visible part of a package,
- the overriding may be either in the visible or the private part].
- Such a subprogram is said to require overriding. However, if the
- type is a generic formal type, the subprogram need not be
- overridden for the formal type itself; [a nonabstract version will
- necessarily be provided by the actual type.]
+ * {<AI95-00391-01AI95-00391-01>} {<AI12-0080-1AI12-0080-1>}
+ Otherwise, the subprogram shall be overridden with a nonabstract
+ subprogram or, in the case of a private extension inheriting a
+ nonabstract function with a controlling result, have a full type
+ that is a null extension[; for a type declared in the visible part
+ of a package, the overriding may be either in the visible or the
+ private part]. Such a subprogram is said to <require overriding>.
+ However, if the type is a generic formal type, the subprogram need
+ not be overridden for the formal type itself; [a nonabstract
+ version will necessarily be provided by the actual type.]
6.a/2
- Reason: {AI95-00228-01AI95-00228-01}
- {AI95-00391-01AI95-00391-01} A function that returns the
+ Reason: {<AI95-00228-01AI95-00228-01>}
+ {<AI95-00391-01AI95-00391-01>} A function that returns the
parent type requires overriding for a type extension (or
becomes abstract for an abstract type) because conversion from
a parent type to a type extension is not defined, and function
@@ -16347,8 +16388,8 @@ controlling result, then:
with Pack1; use Pack1;
package Pack2 is
type T1 is new Ancestor with record ...;
- -- A concrete type.
- procedure Do_Something(X : in T1); -- Have to override.
+ --< A concrete type.>
+ procedure Do_Something(X : in T1); --< Have to override.>
end Pack2;
6.e
@@ -16356,16 +16397,16 @@ controlling result, then:
with Pack2; use Pack2;
package Pack3 is
type T2 is new Ancestor with private;
- -- A concrete type.
+ --< A concrete type.>
private
- type T2 is new T1 with -- Parent different from ancestor.
+ type T2 is new T1 with --< Parent different from ancestor.>
record ... end record;
- -- Here, we inherit Pack2.Do_Something.
+ --< Here, we inherit Pack2.Do_Something.>
end Pack3;
-
+
6.f/2
- {AI95-00228-01AI95-00228-01} T2 inherits an abstract
+ {<AI95-00228-01AI95-00228-01>} T2 inherits an abstract
Do_Something, but T2 is not abstract, so Do_Something has to
be overridden. However, it is OK to override it in the
private part. In this case, we override it by inheriting a
@@ -16375,15 +16416,15 @@ controlling result, then:
necessarily overridden somewhere.
6.g/2
- {AI95-00391-01AI95-00391-01} For a null extension, the result
- of a function with a controlling result is defined in terms of
- an extension_aggregate with a null record extension part (see
- *note 3.4::). This means that these restrictions on functions
- with a controlling result do not have to apply to null
- extensions.
+ {<AI95-00391-01AI95-00391-01>} For a null extension, the
+ result of a function with a controlling result is defined in
+ terms of an extension_aggregate with a null record extension
+ part (see *note 3.4::). This means that these restrictions on
+ functions with a controlling result do not have to apply to
+ null extensions.
6.h/2
- {AI95-00391-01AI95-00391-01} However, functions with
+ {<AI95-00391-01AI95-00391-01>} However, functions with
controlling access results still require overriding. Changing
the tag in place might clobber a preexisting object, and
allocating new memory would possibly change the pool of the
@@ -16398,14 +16439,14 @@ A call on an abstract subprogram shall be a
dispatching call;
[nondispatching calls to an abstract subprogram are not allowed.]
7.a/2
- Ramification: {AI95-00310-01AI95-00310-01} If an abstract
+ Ramification: {<AI95-00310-01AI95-00310-01>} If an abstract
subprogram is not a dispatching operation of some tagged type,
then it cannot be called at all. In Ada 2005, such
subprograms are not even considered by name resolution (see
*note 6.4::).
8/3
-{AI05-0073-1AI05-0073-1} {AI05-0203-1AI05-0203-1} The type of an
+{<AI05-0073-1AI05-0073-1>} {<AI05-0203-1AI05-0203-1>} The type of an
aggregate, or of an object created by an object_declaration or an
allocator, or a generic formal object of mode in, shall not be abstract.
The type of the target of an assignment operation (see *note 5.2::)
@@ -16430,10 +16471,10 @@ result type designating an abstract type.
terribly useful.
8.c/3
- {AI05-0073-1AI05-0073-1} Generic functions returning a formal
- abstract type are illegal because any instance would have to
- be instantiated with a nonabstract type in order to avoid
- violating the function rule (generic functions cannot be
+ {<AI05-0073-1AI05-0073-1>} Generic functions returning a
+ formal abstract type are illegal because any instance would
+ have to be instantiated with a nonabstract type in order to
+ avoid violating the function rule (generic functions cannot be
declared abstract). But that would be an implied contract; it
would be better for the contract to be explicit by the formal
type not being declared abstract. Moreover, the implied
@@ -16458,7 +16499,7 @@ corresponding primitive subprogram of the actual shall
not be abstract.
dispatching operations.
9.c/2
- To be honest: {AI95-00294-01AI95-00294-01} In the sentence
+ To be honest: {<AI95-00294-01AI95-00294-01>} In the sentence
about primitive subprograms above, there is some ambiguity as
to what is meant by "corresponding" in the case where an
inherited operation is overridden. This is best explained by
@@ -16468,24 +16509,24 @@ corresponding primitive subprogram of the actual
shall not be abstract.
9.d/2
package P1 is
type T1 is abstract tagged null record;
- procedure P (X : T1); -- (1)
+ procedure P (X : T1); -- <(1)>
end P1;
9.e/2
package P2 is
type T2 is abstract new P1.T1 with null record;
- -- procedure P (X : T2); -- (2)
+ -- <procedure P (X : T2); -- (2)>
procedure P (X : T2) is abstract; -- (3)
end P2;
9.f/2
generic
type D is abstract new P1.T1 with private;
- -- procedure P (X : D); -- (4)
+ -- <procedure P (X : D); -- (4)>
procedure G (X : D);
9.g/2
- procedure I is new G (P2.T2); -- Illegal.
+ procedure I is new G (P2.T2); -- <Illegal.>
9.h/2
Type T2 inherits a nonabstract procedure P (2) from the
@@ -16497,7 +16538,7 @@ corresponding primitive subprogram of the actual shall
not be abstract.
does not "reemerge". Therefore, the instantiation is illegal.
10/3
-{AI05-0073-1AI05-0073-1} For an abstract type declared in a visible
+{<AI05-0073-1AI05-0073-1>} For an abstract type declared in a visible
part, an abstract primitive subprogram shall not be declared in the
private part, unless it is overriding an abstract subprogram implicitly
declared in the visible part. For a tagged type declared in a visible
@@ -16534,9 +16575,9 @@ overriding a function implicitly declared in the
visible part.
T1 and T2, the example would be legal as is.
11/2
-{AI95-00260-02AI95-00260-02} A generic actual subprogram shall not be an
-abstract subprogram unless the generic formal subprogram is declared by
-a formal_abstract_subprogram_declaration. The prefix of an
+{<AI95-00260-02AI95-00260-02>} A generic actual subprogram shall not be
+an abstract subprogram unless the generic formal subprogram is declared
+by a formal_abstract_subprogram_declaration. The prefix of an
attribute_reference for the Access, Unchecked_Access, or Address
attributes shall not denote an abstract subprogram.
@@ -16548,7 +16589,7 @@ attributes shall not denote an abstract subprogram.
subprogram.
11.b/2
- {AI95-00260-02AI95-00260-02} The part about generic actual
+ {<AI95-00260-02AI95-00260-02>} The part about generic actual
subprograms includes those given by default. Of course, an
abstract formal subprogram's actual subprogram can be
abstract.
@@ -16556,7 +16597,7 @@ attributes shall not denote an abstract subprogram.
_Dynamic Semantics_
11.1/2
-{AI95-00348-01AI95-00348-01} The elaboration of an
+{<AI95-00348-01AI95-00348-01>} The elaboration of an
abstract_subprogram_declaration has no effect.
NOTES
@@ -16581,7 +16622,7 @@ abstract_subprogram_declaration has no effect.
_Examples_
14
-Example of an abstract type representing a set of natural numbers:
+<Example of an abstract type representing a set of natural numbers:>
15
package Sets is
@@ -16598,8 +16639,8 @@ Example of an abstract type representing a set of
natural numbers:
NOTES
16
- 84 Notes on the example: Given the above abstract type, one could
- then derive various (nonabstract) extensions of the type,
+ 84 <Notes on the example:> Given the above abstract type, one
+ could then derive various (nonabstract) extensions of the type,
representing alternative implementations of a set. One might use a
bit vector, but impose an upper bound on the largest element
representable, while another might use a hash table, trading off
@@ -16636,7 +16677,7 @@ Example of an abstract type representing a set of
natural numbers:
_Extensions to Ada 95_
16.d/2
- {AI95-00391-01AI95-00391-01} It is not necessary to override
+ {<AI95-00391-01AI95-00391-01>} It is not necessary to override
functions with a controlling result for a null extension.
This makes it easier to derive a tagged type to complete a
private type.
@@ -16644,58 +16685,58 @@ Example of an abstract type representing a set of
natural numbers:
_Wording Changes from Ada 95_
16.e/2
- {AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01}
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>}
Updated the wording to reflect the addition of interface types
(see *note 3.9.4::).
16.f/2
- {AI95-00260-02AI95-00260-02} Updated the wording to reflect
+ {<AI95-00260-02AI95-00260-02>} Updated the wording to reflect
the addition of abstract formal subprograms (see *note
12.6::).
16.g/2
- {AI95-00334-01AI95-00334-01} The wording of
+ {<AI95-00334-01AI95-00334-01>} The wording of
shall-be-overridden was clarified so that it clearly applies
to abstract predefined equality.
16.h/2
- {AI95-00348-01AI95-00348-01} Moved the syntax and elaboration
- rule for abstract_subprogram_declaration here, so the syntax
- and most of the semantics are together (which is consistent
- with null procedures).
+ {<AI95-00348-01AI95-00348-01>} Moved the syntax and
+ elaboration rule for abstract_subprogram_declaration here, so
+ the syntax and most of the semantics are together (which is
+ consistent with null procedures).
16.i/2
- {AI95-00391-01AI95-00391-01} We define the term require
- overriding to make other wording easier to understand.
+ {<AI95-00391-01AI95-00391-01>} We define the term <require
+ overriding> to make other wording easier to understand.
_Incompatibilities With Ada 2005_
16.j/3
- {AI05-0073-1AI05-0073-1} Correction: Added rules to eliminate
- holes with controlling access results and generic functions
- that return abstract types. While these changes are
+ {<AI05-0073-1AI05-0073-1>} Correction: Added rules to
+ eliminate holes with controlling access results and generic
+ functions that return abstract types. While these changes are
technically incompatible, it is unlikely that they could be
used in a program without violating some other rule of the use
of abstract types.
16.k/3
- {AI05-0097-1AI05-0097-1} Correction: Corrected a minor glitch
- having to do with abstract null extensions. The Ada 2005 rule
- allowed such extensions to inherit concrete operations in some
- rare cases. It is unlikely that these cases exist in user
- code.
+ {<AI05-0097-1AI05-0097-1>} Correction: Corrected a minor
+ glitch having to do with abstract null extensions. The Ada
+ 2005 rule allowed such extensions to inherit concrete
+ operations in some rare cases. It is unlikely that these
+ cases exist in user code.
_Extensions to Ada 2005_
16.l/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in an abstract_subprogram_declaration. This is
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in an abstract_subprogram_declaration. This is
described in *note 13.1.1::.
_Wording Changes from Ada 2005_
16.m/3
- {AI05-0198-1AI05-0198-1} Correction: Clarified that the
+ {<AI05-0198-1AI05-0198-1>} Correction: Clarified that the
predefined operator corresponding to an inherited abstract
operator is also abstract. The Ada 2005 rules caused the
predefined operator and the inherited operator to override
@@ -16703,10 +16744,10 @@ Example of an abstract type representing a set of
natural numbers:
way (the operator is not considered for resolution).
16.n/3
- {AI05-0203-1AI05-0203-1} Correction: Added wording to disallow
- abstract return objects. These were illegal in Ada 2005 by
- other rules; the extension to support class-wide type better
- opened a hole which has now been plugged.
+ {<AI05-0203-1AI05-0203-1>} Correction: Added wording to
+ disallow abstract return objects. These were illegal in Ada
+ 2005 by other rules; the extension to support class-wide type
+ better opened a hole which has now been plugged.
File: aarm2012.info, Node: 3.9.4, Prev: 3.9.3, Up: 3.9
@@ -16715,10 +16756,10 @@ File: aarm2012.info, Node: 3.9.4, Prev: 3.9.3, Up:
3.9
---------------------
1/2
-{AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01} [An interface
-type is an abstract tagged type that provides a restricted form of
-multiple inheritance. A tagged type, task type, or protected type may
-have one or more interface types as ancestors.]
+{<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>} [An
+interface type is an abstract tagged type that provides a restricted
+form of multiple inheritance. A tagged type, task type, or protected
+type may have one or more interface types as ancestors.]
1.a/2
Glossary entry: An interface type is a form of abstract tagged
@@ -16731,9 +16772,9 @@ have one or more interface types as ancestors.]
_Language Design Principles_
1.b/2
- {AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01} The
- rules are designed so that an interface can be used as either
- a parent type or a progenitor type without changing the
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>}
+ The rules are designed so that an interface can be used as
+ either a parent type or a progenitor type without changing the
meaning. That's important so that the order that interfaces
are specified in a derived_type_definition is not significant.
In particular, we want:
@@ -16748,28 +16789,28 @@ have one or more interface types as ancestors.]
_Syntax_
2/2
- {AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01}
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>}
interface_type_definition ::=
[limited | task | protected | synchronized] interface [and
interface_list]
3/2
- {AI95-00251-01AI95-00251-01} {AI95-00419-01AI95-00419-01}
- interface_list ::= interface_subtype_mark {and interface_
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00419-01AI95-00419-01>}
+ interface_list ::= <interface_>subtype_mark {and <interface_>
subtype_mark}
_Static Semantics_
4/2
-{AI95-00251-01AI95-00251-01} An interface type (also called an
-interface) is a specific abstract tagged type that is defined by an
+{<AI95-00251-01AI95-00251-01>} An interface type (also called an
+<interface>) is a specific abstract tagged type that is defined by an
interface_type_definition.
5/2
-{AI95-00345-01AI95-00345-01} An interface with the reserved word
+{<AI95-00345-01AI95-00345-01>} An interface with the reserved word
limited, task, protected, or synchronized in its definition is termed,
-respectively, a limited interface, a task interface, a protected
-interface, or a synchronized interface. In addition, all task and
+respectively, a <limited interface>, a <task interface>, a <protected
+interface>, or a <synchronized interface>. In addition, all task and
protected interfaces are synchronized interfaces, and all synchronized
interfaces are limited interfaces.
@@ -16781,9 +16822,9 @@ interfaces are limited interfaces.
type.
6/2
-{AI95-00345-01AI95-00345-01} {AI95-00443-01AI95-00443-01} [A task or
+{<AI95-00345-01AI95-00345-01>} {<AI95-00443-01AI95-00443-01>} [A task or
protected type derived from an interface is a tagged type.] Such a
-tagged type is called a synchronized tagged type, as are synchronized
+tagged type is called a <synchronized> tagged type, as are synchronized
interfaces and private extensions whose declaration includes the
reserved word synchronized.
@@ -16797,18 +16838,19 @@ reserved word synchronized.
task type (including a task interface type) is a task type,
because "task" is one of the language-defined classes of types
(see *note 3.2::). However, the class-wide type associated
- with an interface is not an interface type, as "interface" is
- not one of the language-defined classes (as it is not closed
- under derivation). In this sense, "interface" is similar to
- "abstract". The class-wide type associated with an interface
- is a concrete (nonabstract) indefinite tagged composite type.
+ with an interface is <not> an interface type, as "interface"
+ is <not> one of the language-defined classes (as it is not
+ closed under derivation). In this sense, "interface" is
+ similar to "abstract". The class-wide type associated with an
+ interface is a concrete (nonabstract) indefinite tagged
+ composite type.
6.c/2
"Private extension" includes generic formal private
extensions, as explained in *note 12.5.1::.
7/2
-{AI95-00345-01AI95-00345-01} A task interface is an [abstract] task
+{<AI95-00345-01AI95-00345-01>} A task interface is an [abstract] task
type. A protected interface is an [abstract] protected type.
7.a/2
@@ -16823,16 +16865,16 @@ type. A protected interface is an [abstract]
protected type.
interfaces for consistency.
8/2
-{AI95-00251-01AI95-00251-01} [An interface type has no components.]
+{<AI95-00251-01AI95-00251-01>} [An interface type has no components.]
8.a/2
Proof: This follows from the syntax and the fact that
discriminants are not allowed for interface types.
9/2
-{AI95-00419-01AI95-00419-01} An interface_subtype_mark in an
-interface_list names a progenitor subtype; its type is the progenitor
-type. An interface type inherits user-defined primitive subprograms
+{<AI95-00419-01AI95-00419-01>} An <interface_>subtype_mark in an
+interface_list names a <progenitor subtype>; its type is the <progenitor
+type>. An interface type inherits user-defined primitive subprograms
from each progenitor type in the same way that a derived type inherits
user-defined primitive subprograms from its progenitor types (see *note
3.4::).
@@ -16847,32 +16889,32 @@ user-defined primitive subprograms from its
progenitor types (see *note
_Legality Rules_
10/2
-{AI95-00251-01AI95-00251-01} All user-defined primitive subprograms of
+{<AI95-00251-01AI95-00251-01>} All user-defined primitive subprograms of
an interface type shall be abstract subprograms or null procedures.
11/2
-{AI95-00251-01AI95-00251-01} The type of a subtype named in an
+{<AI95-00251-01AI95-00251-01>} The type of a subtype named in an
interface_list shall be an interface type.
12/2
-{AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01} A type derived
-from a nonlimited interface shall be nonlimited.
+{<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>} A type
+derived from a nonlimited interface shall be nonlimited.
13/2
-{AI95-00345-01AI95-00345-01} An interface derived from a task interface
-shall include the reserved word task in its definition; any other type
-derived from a task interface shall be a private extension or a task
-type declared by a task declaration (see *note 9.1::).
+{<AI95-00345-01AI95-00345-01>} An interface derived from a task
+interface shall include the reserved word task in its definition; any
+other type derived from a task interface shall be a private extension or
+a task type declared by a task declaration (see *note 9.1::).
14/2
-{AI95-00345-01AI95-00345-01} An interface derived from a protected
+{<AI95-00345-01AI95-00345-01>} An interface derived from a protected
interface shall include the reserved word protected in its definition;
any other type derived from a protected interface shall be a private
extension or a protected type declared by a protected declaration (see
*note 9.4::).
15/2
-{AI95-00345-01AI95-00345-01} An interface derived from a synchronized
+{<AI95-00345-01AI95-00345-01>} An interface derived from a synchronized
interface shall include one of the reserved words task, protected, or
synchronized in its definition; any other type derived from a
synchronized interface shall be a private extension, a task type
@@ -16895,7 +16937,7 @@ protected declaration.
the kind of the formal interface (see *note 12.5.5::).
16/2
-{AI95-00345-01AI95-00345-01} No type shall be derived from both a task
+{<AI95-00345-01AI95-00345-01>} No type shall be derived from both a task
interface and a protected interface.
16.a
@@ -16907,12 +16949,12 @@ interface and a protected interface.
early detection of the errors.
17/2
-{AI95-00251-01AI95-00251-01} In addition to the places where Legality
+{<AI95-00251-01AI95-00251-01>} In addition to the places where Legality
Rules normally apply (see *note 12.3::), these rules apply also in the
private part of an instance of a generic unit.
17.a/3
- Ramification: {AI05-0299-1AI05-0299-1} This paragraph is
+ Ramification: {<AI05-0299-1AI05-0299-1>} This paragraph is
intended to apply to all of the Legality Rules in this
subclause. We cannot allow interface types which do not obey
these rules, anywhere. Luckily, deriving from a formal type
@@ -16923,9 +16965,9 @@ private part of an instance of a generic unit.
_Dynamic Semantics_
18/3
-{AI95-00251-01AI95-00251-01} {AI05-0070-1AI05-0070-1} The elaboration of
-an interface_type_definition creates the interface type and its first
-subtype.
+{<AI95-00251-01AI95-00251-01>} {<AI05-0070-1AI05-0070-1>} The
+elaboration of an interface_type_definition creates the interface type
+and its first subtype.
18.a/3
Discussion: There is no other effect. An interface_list is
@@ -16936,7 +16978,7 @@ subtype.
NOTES
19/2
- 85 {AI95-00411-01AI95-00411-01} Nonlimited interface types have
+ 85 {<AI95-00411-01AI95-00411-01>} Nonlimited interface types have
predefined nonabstract equality operators. These may be overridden
with user-defined abstract equality operators. Such operators will
then require an explicit overriding for any nonabstract descendant
@@ -16945,8 +16987,8 @@ subtype.
_Examples_
20/2
-{AI95-00433-01AI95-00433-01} Example of a limited interface and a
-synchronized interface extending it:
+{<AI95-00433-01AI95-00433-01>} <Example of a limited interface and a
+synchronized interface extending it:>
21/2
type Queue is limited interface;
@@ -16955,15 +16997,15 @@ synchronized interface extending it:
Person : out Person_Name) is abstract;
function Cur_Count(Q : in Queue) return Natural is abstract;
function Max_Count(Q : in Queue) return Natural is abstract;
- -- See *note 3.10.1:: for Person_Name.
+ -- <See *note 3.10.1:: for Person_Name.>
22/3
- {AI05-0004-1AI05-0004-1} Queue_Error : exception;
- -- Append raises Queue_Error if Cur_Count(Q) = Max_Count(Q)
- -- Remove_First raises Queue_Error if Cur_Count(Q) = 0
+ {<AI05-0004-1AI05-0004-1>} Queue_Error : exception;
+ --< Append raises Queue_Error if Cur_Count(Q) = Max_Count(Q)>
+ --< Remove_First raises Queue_Error if Cur_Count(Q) = 0>
23/2
- type Synchronized_Queue is synchronized interface and Queue; -- see *note
9.11::
+ type Synchronized_Queue is synchronized interface and Queue; --< see
*note 9.11::>
procedure Append_Wait(Q : in out Synchronized_Queue;
Person : in Person_Name) is abstract;
procedure Remove_First_Wait(Q : in out Synchronized_Queue;
@@ -17004,10 +17046,10 @@ This synchronized interface may only be implemented
by a task or
protected type, and as such ensures safe concurrent access.
28/2
-{AI95-00433-01AI95-00433-01} Example use of the interface:
+{<AI95-00433-01AI95-00433-01>} <Example use of the interface:>
29/3
- {AI05-0004-1AI05-0004-1} type Fast_Food_Queue is new Queue with record
...;
+ {<AI05-0004-1AI05-0004-1>} type Fast_Food_Queue is new Queue with record
...;
procedure Append(Q : in out Fast_Food_Queue; Person : in Person_Name);
procedure Remove_First(Q : in out Fast_Food_Queue; Person : out
Person_Name);
function Cur_Count(Q : in Fast_Food_Queue) return Natural;
@@ -17021,9 +17063,9 @@ protected type, and as such ensures safe concurrent
access.
32/2
...
- -- Add George (see *note 3.10.1::) to the cashier's queue:
+ -- <Add George (see *note 3.10.1::) to the cashier's queue:>
Append (Cashier, George);
- -- After payment, move George to the sandwich counter queue:
+ -- <After payment, move George to the sandwich counter queue:>
Transfer (Cashier, Counter);
...
@@ -17036,10 +17078,10 @@ must be provided. Inside the call of Transfer, calls
will dispatch to
the implementations of Append and Remove_First for type Fast_Food_Queue.
34/2
-{AI95-00433-01AI95-00433-01} Example of a task interface:
+{<AI95-00433-01AI95-00433-01>} <Example of a task interface:>
35/2
- type Serial_Device is task interface; -- see *note 9.1::
+ type Serial_Device is task interface; --< see *note 9.1::>
procedure Read (Dev : in Serial_Device; C : out Character) is abstract;
procedure Write(Dev : in Serial_Device; C : in Character) is abstract;
@@ -17050,7 +17092,7 @@ intended to be implemented by task entries (see 9.1).
_Extensions to Ada 95_
36.a/2
- {AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01}
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>}
Interface types are new. They provide multiple inheritance of
interfaces, similar to the facility provided in Java and other
recent language designs.
@@ -17058,9 +17100,9 @@ intended to be implemented by task entries (see 9.1).
_Wording Changes from Ada 2005_
36.b/3
- {AI05-0070-1AI05-0070-1} Correction: Corrected the definition
- of elaboration for an interface_type_definition to match that
- of other type definitions.
+ {<AI05-0070-1AI05-0070-1>} Correction: Corrected the
+ definition of elaboration for an interface_type_definition to
+ match that of other type definitions.
File: aarm2012.info, Node: 3.10, Next: 3.11, Prev: 3.9, Up: 3
@@ -17069,22 +17111,22 @@ File: aarm2012.info, Node: 3.10, Next: 3.11, Prev:
3.9, Up: 3
=================
1
-A value of an access type (an access value) provides indirect access to
-the object or subprogram it designates. Depending on its type, an
+A value of an access type (an <access value>) provides indirect access
+to the object or subprogram it <designates>. Depending on its type, an
access value can designate either subprograms, objects created by
-allocators (see *note 4.8::), or more generally aliased objects of an
-appropriate type.
+allocators (see *note 4.8::), or more generally <aliased> objects of an
+appropriate type.
1.a
- Discussion: A name denotes an entity; an access value
- designates an entity. The "dereference" of an access value X,
- written "X.all", is a name that denotes the entity designated
- by X.
+ Discussion: A name <denotes> an entity; an access value
+ <designates> an entity. The "dereference" of an access value
+ X, written "X.all", is a name that denotes the entity
+ designated by X.
_Language Design Principles_
1.b/3
- {AI05-0299-1AI05-0299-1} Access values should always be well
+ {<AI05-0299-1AI05-0299-1>} Access values should always be well
defined (barring uses of certain unchecked features of Clause
*note 13::). In particular, uninitialized access variables
should be prevented by compile-time rules.
@@ -17092,7 +17134,7 @@ appropriate type.
_Syntax_
2/2
- {AI95-00231-01AI95-00231-01} access_type_definition ::=
+ {<AI95-00231-01AI95-00231-01>} access_type_definition ::=
[null_exclusion] access_to_object_definition
| [null_exclusion] access_to_subprogram_definition
@@ -17109,11 +17151,11 @@ appropriate type.
| access [protected] function parameter_and_result_profile
5.1/2
- {AI95-00231-01AI95-00231-01} null_exclusion ::= not null
+ {<AI95-00231-01AI95-00231-01>} null_exclusion ::= not null
6/2
- {AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01}
- {AI95-00404-01AI95-00404-01} access_definition ::=
+ {<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00404-01AI95-00404-01>} access_definition ::=
[null_exclusion] access [constant] subtype_mark
| [null_exclusion] access [protected] procedure parameter_profile
| [null_exclusion] access [protected] function
@@ -17122,23 +17164,23 @@ appropriate type.
_Static Semantics_
7/1
-{8652/00128652/0012} {AI95-00062-01AI95-00062-01} There are two kinds of
-access types, access-to-object types, whose values designate objects,
-and access-to-subprogram types, whose values designate subprograms.
-Associated with an access-to-object type is a storage pool; several
-access types may share the same storage pool. All descendants of an
-access type share the same storage pool. A storage pool is an area of
-storage used to hold dynamically allocated objects (called pool
-elements) created by allocators[; storage pools are described further in
-*note 13.11::, "*note 13.11:: Storage Management"].
+{<8652/00128652/0012>} {<AI95-00062-01AI95-00062-01>} There are two
+kinds of access types, <access-to-object> types, whose values designate
+objects, and <access-to-subprogram> types, whose values designate
+subprograms. Associated with an access-to-object type is a <storage
+pool>; several access types may share the same storage pool. All
+descendants of an access type share the same storage pool. A storage
+pool is an area of storage used to hold dynamically allocated objects
+(called <pool elements>) created by allocators[; storage pools are
+described further in *note 13.11::, "*note 13.11:: Storage Management"].
8
-Access-to-object types are further subdivided into pool-specific access
-types, whose values can designate only the elements of their associated
-storage pool, and general access types, whose values can designate the
-elements of any storage pool, as well as aliased objects created by
-declarations rather than allocators, and aliased subcomponents of other
-objects.
+Access-to-object types are further subdivided into <pool-specific>
+access types, whose values can designate only the elements of their
+associated storage pool, and <general> access types, whose values can
+designate the elements of any storage pool, as well as aliased objects
+created by declarations rather than allocators, and aliased
+subcomponents of other objects.
8.a
Implementation Note: The value of an access type will
@@ -17148,19 +17190,20 @@ objects.
to the elements of that pool.
9/3
-{AI95-00225-01AI95-00225-01} {AI95-00363-01AI95-00363-01}
-{AI05-0053-1AI05-0053-1} {AI05-0142-4AI05-0142-4}
-{AI05-0277-1AI05-0277-1} A view of an object is defined to be aliased if
-it is defined by an object_declaration (*note 3.3.1: S0032.),
-component_definition (*note 3.6: S0056.), parameter_specification (*note
-6.1: S0175.), or extended_return_object_declaration with the reserved
-word aliased, or by a renaming of an aliased view. In addition, the
-dereference of an access-to-object value denotes an aliased view, as
-does a view conversion (see *note 4.6::) of an aliased view. The
-current instance of an immutably limited type (see *note 7.5::) is
-defined to be aliased. Finally, a formal parameter or generic formal
-object of a tagged type is defined to be aliased. [Aliased views are
-the ones that can be designated by an access value.]
+{<AI95-00225-01AI95-00225-01>} {<AI95-00363-01AI95-00363-01>}
+{<AI05-0053-1AI05-0053-1>} {<AI05-0142-4AI05-0142-4>}
+{<AI05-0277-1AI05-0277-1>} A view of an object is defined to be
+<aliased> if it is defined by an object_declaration (*note 3.3.1:
+S0032.), component_definition (*note 3.6: S0056.),
+parameter_specification (*note 6.1: S0175.), or
+extended_return_object_declaration with the reserved word aliased, or by
+a renaming of an aliased view. In addition, the dereference of an
+access-to-object value denotes an aliased view, as does a view
+conversion (see *note 4.6::) of an aliased view. The current instance
+of an immutably limited type (see *note 7.5::) is defined to be aliased.
+Finally, a formal parameter or generic formal object of a tagged type is
+defined to be aliased. [Aliased views are the ones that can be
+designated by an access value.]
9.a
Glossary entry: An aliased view of an object is one that can
@@ -17187,8 +17230,8 @@ the ones that can be designated by an access value.]
discussion.
9.f/2
- Reason: {AI95-00225-01AI95-00225-01} The current instance of a
- limited type is defined to be aliased so that an access
+ Reason: {<AI95-00225-01AI95-00225-01>} The current instance of
+ a limited type is defined to be aliased so that an access
discriminant of a component can be initialized with T'Access
inside the definition of T. Note that we don't want this to
apply to a type that could become nonlimited later within its
@@ -17218,12 +17261,12 @@ the ones that can be designated by an access value.]
type T2 is new T1 with ...;
procedure P(X : access T2) is
begin
- P(T1(X.all)'Access); -- hand off to T1's P
- . . . -- now do extra T2-specific processing
+ P(T1(X.all)'Access); --< hand off to T1's P>
+ . . . --< now do extra T2-specific processing>
end P;
9.k/2
- This paragraph was deleted.{AI95-00363-01AI95-00363-01}
+ <This paragraph was deleted.>{<AI95-00363-01AI95-00363-01>}
9.l/2
We considered making more kinds of objects aliased by default.
@@ -17250,20 +17293,20 @@ the ones that can be designated by an access value.]
10
An access_to_object_definition defines an access-to-object type and its
first subtype; the subtype_indication (*note 3.2.2: S0027.) defines the
-designated subtype of the access type. If a general_access_modifier
+<designated subtype> of the access type. If a general_access_modifier
(*note 3.10: S0081.) appears, then the access type is a general access
-type. If the modifier is the reserved word constant, then the type is an
-access-to-constant type[; a designated object cannot be updated through
-a value of such a type]. If the modifier is the reserved word all, then
-the type is an access-to-variable type[; a designated object can be both
-read and updated through a value of such a type]. If no
+type. If the modifier is the reserved word constant, then the type is
+an <access-to-constant type>[; a designated object cannot be updated
+through a value of such a type]. If the modifier is the reserved word
+all, then the type is an <access-to-variable type>[; a designated object
+can be both read and updated through a value of such a type]. If no
general_access_modifier (*note 3.10: S0081.) appears in the
access_to_object_definition (*note 3.10: S0080.), the access type is a
pool-specific access-to-variable type.
10.a
To be honest: The type of the designated subtype is called the
- designated type.
+ <designated type>.
10.b
Reason: The modifier all was picked to suggest that values of
@@ -17300,27 +17343,27 @@ pool-specific access-to-variable type.
11
An access_to_subprogram_definition defines an access-to-subprogram type
and its first subtype; the parameter_profile or
-parameter_and_result_profile defines the designated profile of the
-access type. There is a calling convention associated with the
+parameter_and_result_profile defines the <designated profile> of the
+access type. There is a <calling convention> associated with the
designated profile[; only subprograms with this calling convention can
be designated by values of the access type.] By default, the calling
-convention is "protected" if the reserved word protected appears, and
+convention is "<protected>" if the reserved word protected appears, and
"Ada" otherwise. [See *note Annex B:: for how to override this
default.]
11.a
- Ramification: The calling convention protected is in italics
+ Ramification: The calling convention <protected> is in italics
to emphasize that it cannot be specified explicitly by the
user. This is a consequence of it being a reserved word.
11.b/2
- Implementation Note: {AI95-00254-01AI95-00254-01} For a named
- access-to-subprogram type, the representation of an access
- value might include implementation-defined information needed
- to support up-level references -- for example, a static link.
- The accessibility rules (see *note 3.10.2::) ensure that in a
- "global-display-based" implementation model (as opposed to a
- static-link-based model), a named
+ Implementation Note: {<AI95-00254-01AI95-00254-01>} For a
+ named access-to-subprogram type, the representation of an
+ access value might include implementation-defined information
+ needed to support up-level references -- for example, a static
+ link. The accessibility rules (see *note 3.10.2::) ensure
+ that in a "global-display-based" implementation model (as
+ opposed to a static-link-based model), a named
access-to-(unprotected)-subprogram value need consist only of
the address of the subprogram. The global display is
guaranteed to be properly set up any time the designated
@@ -17374,30 +17417,30 @@ default.]
descriptor, by indexing off the "known" register.
11.f/2
- This paragraph was deleted.{AI95-00344-01AI95-00344-01}
+ <This paragraph was deleted.>{<AI95-00344-01AI95-00344-01>}
11.g/2
- {AI95-00254-01AI95-00254-01} Note that access parameters of an
- anonymous access-to-subprogram type are permitted. Such
+ {<AI95-00254-01AI95-00254-01>} Note that access parameters of
+ an anonymous access-to-subprogram type are permitted. Such
parameters represent full "downward" closures, meaning that in
an implementation that uses a per-task (global) display, the
display will have to be passed as a hidden parameter, and
reconstructed at the point of call.
12/3
-{AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01}
-{AI95-00254-01AI95-00254-01} {AI05-0264-1AI05-0264-1} An
+{<AI95-00230-01AI95-00230-01>} {<AI95-00231-01AI95-00231-01>}
+{<AI95-00254-01AI95-00254-01>} {<AI05-0264-1AI05-0264-1>} An
access_definition defines an anonymous general access type or an
anonymous access-to-subprogram type. For a general access type, the
-subtype_mark denotes its designated subtype; if the
+subtype_mark denotes its <designated subtype>; if the
general_access_modifier (*note 3.10: S0081.) constant appears, the type
is an access-to-constant type; otherwise, it is an access-to-variable
type. For an access-to-subprogram type, the parameter_profile (*note
6.1: S0172.) or parameter_and_result_profile (*note 6.1: S0173.) denotes
-its designated profile.
+its <designated profile>.
13/2
-{AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01} For each
+{<AI95-00230-01AI95-00230-01>} {<AI95-00231-01AI95-00231-01>} For each
access type, there is a null access value designating no entity at all,
which can be obtained by (implicitly) converting the literal null to the
access type. [The null value of an access type is the default initial
@@ -17411,16 +17454,16 @@ evaluating an attribute_reference for the Access
attribute of a
nonintrinsic subprogram.
13.a/2
- This paragraph was deleted.{AI95-00231-01AI95-00231-01}
+ <This paragraph was deleted.>{<AI95-00231-01AI95-00231-01>}
13.b/2
- This paragraph was deleted.{AI95-00231-01AI95-00231-01}
+ <This paragraph was deleted.>{<AI95-00231-01AI95-00231-01>}
13.1/2
-{AI95-00231-01AI95-00231-01} A null_exclusion in a construct specifies
+{<AI95-00231-01AI95-00231-01>} A null_exclusion in a construct specifies
that the null value does not belong to the access subtype defined by the
-construct, that is, the access subtype excludes null. In addition, the
-anonymous access subtype defined by the access_definition for a
+construct, that is, the access subtype <excludes null>. In addition,
+the anonymous access subtype defined by the access_definition for a
controlling access parameter (see *note 3.9.2::) excludes null.
Finally, for a subtype_indication without a null_exclusion, the subtype
denoted by the subtype_indication excludes null if and only if the
@@ -17428,28 +17471,29 @@ subtype denoted by the subtype_mark in the
subtype_indication excludes
null.
13.c/2
- Reason: {AI95-00231-01AI95-00231-01} An access_definition used
- in a controlling parameter excludes null because it is
+ Reason: {<AI95-00231-01AI95-00231-01>} An access_definition
+ used in a controlling parameter excludes null because it is
necessary to read the tag to dispatch, and null has no tag.
We would have preferred to require not null to be specified
for such parameters, but that would have been too incompatible
with Ada 95 code to require.
13.d/2
- {AI95-00416-01AI95-00416-01} Note that we considered imposing
- a similar implicit null exclusion for controlling access
- results, but chose not to do that, because there is no Ada 95
- compatibility issue, and there is no automatic null check
- inherent in the use of a controlling access result. If a null
- check is necessary, it is because there is a dereference of
- the result, or because the value is passed to a parameter
- whose subtype excludes null. If there is no dereference of
- the result, a null return value is perfectly acceptable, and
- can be a useful indication of a particular status of the call.
+ {<AI95-00416-01AI95-00416-01>} Note that we considered
+ imposing a similar implicit null exclusion for controlling
+ access results, but chose not to do that, because there is no
+ Ada 95 compatibility issue, and there is no automatic null
+ check inherent in the use of a controlling access result. If
+ a null check is necessary, it is because there is a
+ dereference of the result, or because the value is passed to a
+ parameter whose subtype excludes null. If there is no
+ dereference of the result, a null return value is perfectly
+ acceptable, and can be a useful indication of a particular
+ status of the call.
14/3
-{8652/00138652/0013} {AI95-00012-01AI95-00012-01}
-{AI05-0264-1AI05-0264-1} [All subtypes of an access-to-subprogram type
+{<8652/00138652/0013>} {<AI95-00012-01AI95-00012-01>}
+{<AI05-0264-1AI05-0264-1>} [All subtypes of an access-to-subprogram type
are constrained.] The first subtype of a type defined by an
access_definition or an access_to_object_definition is unconstrained if
the designated subtype is an unconstrained array or discriminated
@@ -17467,7 +17511,7 @@ subtype; otherwise, it is constrained.
subtype_indication with a constraint.
14.b/2
- Reason: {AI95-00363-01AI95-00363-01} Only
+ Reason: {<AI95-00363-01AI95-00363-01>} Only
composite_constraints are permitted for an access type, and
only on access-to-composite types. A constraint on an
access-to-scalar or access-to-access type might be violated
@@ -17487,7 +17531,7 @@ subtype; otherwise, it is constrained.
_Legality Rules_
14.1/2
-{AI95-00231-01AI95-00231-01} If a subtype_indication (*note 3.2.2:
+{<AI95-00231-01AI95-00231-01>} If a subtype_indication (*note 3.2.2:
S0027.), discriminant_specification (*note 3.7: S0062.),
parameter_specification (*note 6.1: S0175.),
parameter_and_result_profile (*note 6.1: S0173.),
@@ -17497,27 +17541,28 @@ formal_object_declaration (*note 12.4: S0280.) has a
null_exclusion
construct shall denote an access subtype that does not exclude null.
14.c/2
- To be honest: {AI95-00231-01AI95-00231-01} This means
+ To be honest: {<AI95-00231-01AI95-00231-01>} This means
"directly allowed in"; we are not talking about a
null_exclusion that occurs in an access_definition in one of
these constructs (for an access_definition, the subtype_mark
in such an access_definition is not restricted).
14.d/2
- Reason: {AI95-00231-01AI95-00231-01} This is similar to doubly
- constraining a composite subtype, which we also don't allow.
+ Reason: {<AI95-00231-01AI95-00231-01>} This is similar to
+ doubly constraining a composite subtype, which we also don't
+ allow.
_Dynamic Semantics_
15/2
-{AI95-00231-01AI95-00231-01} A composite_constraint is compatible with
-an unconstrained access subtype if it is compatible with the designated
-subtype. A null_exclusion is compatible with any access subtype that
-does not exclude null. An access value satisfies a composite_constraint
-of an access subtype if it equals the null value of its type or if it
-designates an object whose value satisfies the constraint. An access
-value satisfies an exclusion of the null value if it does not equal the
-null value of its type.
+{<AI95-00231-01AI95-00231-01>} A composite_constraint is <compatible>
+with an unconstrained access subtype if it is compatible with the
+designated subtype. A null_exclusion is compatible with any access
+subtype that does not exclude null. An access value <satisfies> a
+composite_constraint of an access subtype if it equals the null value of
+its type or if it designates an object whose value satisfies the
+constraint. An access value satisfies an exclusion of the null value if
+it does not equal the null value of its type.
16
The elaboration of an access_type_definition creates the access type and
@@ -17526,7 +17571,7 @@ includes the elaboration of the subtype_indication,
which creates the
designated subtype.
17/2
-{AI95-00230-01AI95-00230-01} {AI95-00254-01AI95-00254-01} The
+{<AI95-00230-01AI95-00230-01>} {<AI95-00254-01AI95-00254-01>} The
elaboration of an access_definition creates an anonymous access type.
NOTES
@@ -17550,22 +17595,22 @@ elaboration of an access_definition creates an
anonymous access type.
_Examples_
21
-Examples of access-to-object types:
+<Examples of access-to-object types:>
22/4
- {AI95-00433-01AI95-00433-01} {AI12-0056-1AI12-0056-1} type Frame is
access Matrix; -- see *note 3.6::
- type Peripheral_Ref is not null access Peripheral; -- see *note 3.8.1::
+ {<AI95-00433-01AI95-00433-01>} {<AI12-0056-1AI12-0056-1>} type Frame is
access Matrix; --< see *note 3.6::>
+ type Peripheral_Ref is not null access Peripheral; --< see *note
3.8.1::>
type Binop_Ptr is access all Binary_Operation'Class;
- -- general
access-to-class-wide, see *note 3.9.1::
+ --< general
access-to-class-wide, see *note 3.9.1::>
23
-Example of an access subtype:
+<Example of an access subtype:>
24
- subtype Drum_Ref is Peripheral_Ref(Drum); -- see *note 3.8.1::
+ subtype Drum_Ref is Peripheral_Ref(Drum); --< see *note 3.8.1::>
25
-Example of an access-to-subprogram type:
+<Example of an access-to-subprogram type:>
26
type Message_Procedure is access procedure (M : in String := "Error!");
@@ -17576,8 +17621,8 @@ Example of an access-to-subprogram type:
...
Give_Message := Other_Procedure'Access;
...
- Give_Message("File not found."); -- call with parameter (.all is
optional)
- Give_Message.all; -- call with no parameters
+ Give_Message("File not found."); --< call with parameter (.all is
optional)>
+ Give_Message.all; --< call with no parameters>
_Extensions to Ada 83_
@@ -17590,7 +17635,7 @@ Example of an access-to-subprogram type:
_Wording Changes from Ada 83_
26.b/3
- {AI05-0190-1AI05-0190-1} We use the term "storage pool" to
+ {<AI05-0190-1AI05-0190-1>} We use the term "storage pool" to
talk about the data area from which allocation takes place.
The term "collection" is only used for finalization.
("Collection" and "storage pool" are not the same thing
@@ -17600,7 +17645,7 @@ Example of an access-to-subprogram type:
_Inconsistencies With Ada 95_
26.c/2
- {AI95-00231-01AI95-00231-01} Access discriminants and
+ {<AI95-00231-01AI95-00231-01>} Access discriminants and
noncontrolling access parameters no longer exclude null. A
program which passed null to such an access discriminant or
access parameter and expected it to raise Constraint_Error may
@@ -17610,7 +17655,7 @@ Example of an access-to-subprogram type:
likely.)
26.d/2
- {AI95-00363-01AI95-00363-01} Most unconstrained aliased
+ {<AI95-00363-01AI95-00363-01>} Most unconstrained aliased
objects with defaulted discriminants are no longer constrained
by their initial values. This means that a program that
raised Constraint_Error from an attempt to change the
@@ -17625,7 +17670,7 @@ Example of an access-to-subprogram type:
_Incompatibilities With Ada 95_
26.e/2
- {AI95-00225-01AI95-00225-01} Amendment Correction: The rule
+ {<AI95-00225-01AI95-00225-01>} Amendment Correction: The rule
defining when a current instance of a limited type is
considered to be aliased has been tightened to apply only to
types that cannot become nonlimited. A program that attempts
@@ -17639,14 +17684,14 @@ Example of an access-to-subprogram type:
_Extensions to Ada 95_
26.f/2
- {AI95-00231-01AI95-00231-01} The null_exclusion is new. It
+ {<AI95-00231-01AI95-00231-01>} The null_exclusion is new. It
can be used in both anonymous and named access type
definitions. It is most useful to declare that parameters
cannot be null, thus eliminating the need for checks on use.
26.g/2
- {AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01}
- {AI95-00404-01AI95-00404-01} The kinds of anonymous access
+ {<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00404-01AI95-00404-01>} The kinds of anonymous access
types allowed were increased by adding anonymous
access-to-constant and anonymous access-to-subprogram types.
Anonymous access-to-subprogram types used as parameters allow
@@ -17655,26 +17700,26 @@ Example of an access-to-subprogram type:
_Wording Changes from Ada 95_
26.h/2
- {8652/00128652/0012} {AI95-00062-01AI95-00062-01} Corrigendum:
- Added accidentally-omitted wording that says that a derived
- access type shares its storage pool with its parent type.
- This was clearly intended, both because of a note in *note
- 3.4::, and because anything else would have been incompatible
- with Ada 83.
+ {<8652/00128652/0012>} {<AI95-00062-01AI95-00062-01>}
+ Corrigendum: Added accidentally-omitted wording that says that
+ a derived access type shares its storage pool with its parent
+ type. This was clearly intended, both because of a note in
+ *note 3.4::, and because anything else would have been
+ incompatible with Ada 83.
26.i/2
- {8652/00138652/0013} {AI95-00012-01AI95-00012-01} Corrigendum:
- Fixed typographical errors in the description of when access
- types are constrained.
+ {<8652/00138652/0013>} {<AI95-00012-01AI95-00012-01>}
+ Corrigendum: Fixed typographical errors in the description of
+ when access types are constrained.
26.j/2
- {AI95-00230-01AI95-00230-01} The wording was fixed to allow
+ {<AI95-00230-01AI95-00230-01>} The wording was fixed to allow
allocators and the literal null for anonymous access types.
The former was clearly intended by Ada 95; see the
Implementation Advice in *note 13.11::.
26.k/2
- {AI95-00363-01AI95-00363-01} The rules about aliased objects
+ {<AI95-00363-01AI95-00363-01>} The rules about aliased objects
being constrained by their initial values now apply only to
allocated objects, and thus have been moved to *note 4.8::,
"*note 4.8:: Allocators".
@@ -17682,17 +17727,18 @@ Example of an access-to-subprogram type:
_Wording Changes from Ada 2005_
26.l/3
- {AI05-0053-1AI05-0053-1} {AI05-0277-1AI05-0277-1} Correction:
- The rule about a current instance being aliased now is worded
- in terms of immutably limited types. Wording was also added
- to make extended return object declarations that have the
- keyword aliased be considered aliased. This latter was a
- significant oversight in Ada 2005 -- technically, the keyword
- aliased had no effect. But of course implementations followed
- the intent, not the letter of the Standard.
+ {<AI05-0053-1AI05-0053-1>} {<AI05-0277-1AI05-0277-1>}
+ Correction: The rule about a current instance being aliased
+ now is worded in terms of immutably limited types. Wording
+ was also added to make extended return object declarations
+ that have the keyword aliased be considered aliased. This
+ latter was a significant oversight in Ada 2005 -- technically,
+ the keyword aliased had no effect. But of course
+ implementations followed the intent, not the letter of the
+ Standard.
26.m/3
- {AI05-0142-4AI05-0142-4} Explicitly aliased parameters (see
+ {<AI05-0142-4AI05-0142-4>} Explicitly aliased parameters (see
*note 6.1::) are defined to be aliased.
* Menu:
@@ -17718,49 +17764,49 @@ subsequent full_type_declaration.
_Syntax_
2/2
- {AI95-00326-01AI95-00326-01} incomplete_type_declaration ::= type
- defining_identifier [discriminant_part] [is tagged];
+ {<AI95-00326-01AI95-00326-01>} incomplete_type_declaration ::=
+ type defining_identifier [discriminant_part] [is tagged];
_Static Semantics_
2.1/4
-{AI95-00326-01AI95-00326-01} {AI12-0137-1AI12-0137-1} An
-incomplete_type_declaration declares an incomplete view of a type and
+{<AI95-00326-01AI95-00326-01>} {<AI12-0137-1AI12-0137-1>} An
+incomplete_type_declaration declares an <incomplete view> of a type and
its first subtype; the first subtype is unconstrained if a
discriminant_part appears. If the incomplete_type_declaration (*note
-3.10.1: S0085.) includes the reserved word tagged, it declares a tagged
-incomplete view. If T denotes a tagged incomplete view, then T'Class
-denotes a tagged incomplete view. [An incomplete view of a type is a
-limited view of the type (see *note 7.5::).]
+3.10.1: S0085.) includes the reserved word tagged, it declares a <tagged
+incomplete view>. If <T> denotes a tagged incomplete view, then
+<T>'Class denotes a tagged incomplete view. [An incomplete view of a
+type is a limited view of the type (see *note 7.5::).]
2.2/2
-{AI95-00326-01AI95-00326-01} Given an access type A whose designated
-type T is an incomplete view, a dereference of a value of type A also
-has this incomplete view except when:
+{<AI95-00326-01AI95-00326-01>} Given an access type <A> whose designated
+type <T> is an incomplete view, a dereference of a value of type <A>
+also has this incomplete view except when:
2.a/3
- Discussion: {AI05-0208-1AI05-0208-1} Whether the designated
+ Discussion: {<AI05-0208-1AI05-0208-1>} Whether the designated
type is an incomplete view (and thus whether this set of rules
applies) is determined by the view of the type at the
declaration of the access type; it does not change during the
life of the type.
2.3/2
- * it occurs within the immediate scope of the completion of T, or
+ * it occurs within the immediate scope of the completion of <T>, or
2.4/3
- * {AI05-0208-1AI05-0208-1} it occurs within the scope of a
+ * {<AI05-0208-1AI05-0208-1>} it occurs within the scope of a
nonlimited_with_clause that mentions a library package in whose
- visible part the completion of T is declared, or
+ visible part the completion of <T> is declared, or
2.5/3
- * {AI05-0208-1AI05-0208-1} it occurs within the scope of the
- completion of T and T is an incomplete view declared by an
+ * {<AI05-0208-1AI05-0208-1>} it occurs within the scope of the
+ completion of <T> and <T> is an incomplete view declared by an
incomplete_type_declaration.
2.6/3
-{AI05-0162-1AI05-0162-1} In these cases, the dereference has the view of
-T visible at the point of the dereference.
+{<AI05-0162-1AI05-0162-1>} In these cases, the dereference has the view
+of <T> visible at the point of the dereference.
2.b/2
Discussion: We need the "in whose visible part" rule so that
@@ -17780,26 +17826,26 @@ T visible at the point of the dereference.
end P.C;
2.e/3
- {AI05-0005-1AI05-0005-1} with P.C;
+ {<AI05-0005-1AI05-0005-1>} with P.C;
package body P is
- -- Ptr.all'Size is not legal here, but we are within the
scope
- -- of a nonlimited_with_clause for P.
+ -- <Ptr.all'Size is not legal here, but we are within the
scope>
+ -- <of a nonlimited_with_clause for P.>
type T is ...
- -- Ptr.all'Size is legal here.
+ -- <Ptr.all'Size is legal here.>
end P;
2.7/3
-{AI95-00412-01AI95-00412-01} {AI05-0162-1AI05-0162-1}
-{AI05-0208-1AI05-0208-1} Similarly, if a subtype_mark denotes a
-subtype_declaration defining a subtype of an incomplete view T, the
+{<AI95-00412-01AI95-00412-01>} {<AI05-0162-1AI05-0162-1>}
+{<AI05-0208-1AI05-0208-1>} Similarly, if a subtype_mark denotes a
+subtype_declaration defining a subtype of an incomplete view <T>, the
subtype_mark denotes an incomplete view except under the same three
-circumstances given above, in which case it denotes the view of T
+circumstances given above, in which case it denotes the view of <T>
visible at the point of the subtype_mark.
_Legality Rules_
3/3
-{AI05-0162-1AI05-0162-1} An incomplete_type_declaration (*note 3.10.1:
+{<AI05-0162-1AI05-0162-1>} An incomplete_type_declaration (*note 3.10.1:
S0085.) requires a completion, which shall be a type_declaration (*note
3.2.1: S0023.) other than an incomplete_type_declaration (*note 3.10.1:
S0085.). [If the incomplete_type_declaration (*note 3.10.1: S0085.)
@@ -17834,7 +17880,7 @@ the corresponding package_body (*note 7.2: S0192.).]
is allowed.
4/3
-{AI95-00326-01AI95-00326-01} {AI05-0162-1AI05-0162-1} If an
+{<AI95-00326-01AI95-00326-01>} {<AI05-0162-1AI05-0162-1>} If an
incomplete_type_declaration (*note 3.10.1: S0085.) includes the reserved
word tagged, then a type_declaration (*note 3.2.1: S0023.) that
completes it shall declare a tagged type. If an
@@ -17842,18 +17888,18 @@ incomplete_type_declaration (*note 3.10.1: S0085.)
has a
known_discriminant_part (*note 3.7: S0061.), then a type_declaration
(*note 3.2.1: S0023.) that completes it shall have a fully conforming
(explicit) known_discriminant_part (*note 3.7: S0061.) (see *note
-6.3.1::). [If an incomplete_type_declaration (*note 3.10.1: S0085.) has
+6.3.1::). [If an incomplete_type_declaration (*note 3.10.1: S0085.) has
no discriminant_part (or an unknown_discriminant_part (*note 3.7:
S0060.)), then a corresponding type_declaration (*note 3.2.1: S0023.) is
nevertheless allowed to have discriminants, either explicitly, or
inherited via derivation.]
5/2
-{AI95-00326-01AI95-00326-01} A name that denotes an incomplete view of a
-type may be used as follows:
+{<AI95-00326-01AI95-00326-01>} A name that denotes an incomplete view of
+a type may be used as follows:
6/3
- * {AI05-0098-1AI05-0098-1} as the subtype_mark in the
+ * {<AI05-0098-1AI05-0098-1>} as the subtype_mark in the
subtype_indication of an access_to_object_definition (*note 3.10:
S0080.); [the only form of constraint allowed in this
subtype_indication is a discriminant_constraint [(a null_exclusion
@@ -17868,13 +17914,14 @@ type may be used as follows:
AI83-00007.
7/2
- * {AI95-00326-01AI95-00326-01} {AI95-00412-01AI95-00412-01} as the
- subtype_mark in the subtype_indication of a subtype_declaration;
- the subtype_indication (*note 3.2.2: S0027.) shall not have a
- null_exclusion (*note 3.10: S0083.) or a constraint;
+ * {<AI95-00326-01AI95-00326-01>} {<AI95-00412-01AI95-00412-01>} as
+ the subtype_mark in the subtype_indication of a
+ subtype_declaration; the subtype_indication (*note 3.2.2: S0027.)
+ shall not have a null_exclusion (*note 3.10: S0083.) or a
+ constraint;
8/3
- * {AI95-00326-01AI95-00326-01} {AI05-0151-1AI05-0151-1} as the
+ * {<AI95-00326-01AI95-00326-01>} {<AI05-0151-1AI05-0151-1>} as the
subtype_mark in an access_definition for an access-to-object type;
8.a/2
@@ -17884,7 +17931,7 @@ type may be used as follows:
access_definition.
8.1/3
- * {AI05-0151-1AI05-0151-1} as the subtype_mark defining the subtype
+ * {<AI05-0151-1AI05-0151-1>} as the subtype_mark defining the subtype
of a parameter or result in a profile occurring within a
basic_declaration;
@@ -17892,43 +17939,43 @@ type may be used as follows:
Ramification: But not in the profile for a body or entry.
8.2/3
- * {AI05-0213-1AI05-0213-1} as a generic actual parameter whose
+ * {<AI05-0213-1AI05-0213-1>} as a generic actual parameter whose
corresponding generic formal parameter is a formal incomplete type
(see *note 12.5.1::).
8.3/2
-{AI95-00326-01AI95-00326-01} If such a name denotes a tagged incomplete
-view, it may also be used:
+{<AI95-00326-01AI95-00326-01>} If such a name denotes a tagged
+incomplete view, it may also be used:
8.4/3
- * {AI95-00326-01AI95-00326-01} {AI05-0151-1AI05-0151-1} as the
+ * {<AI95-00326-01AI95-00326-01>} {<AI05-0151-1AI05-0151-1>} as the
subtype_mark defining the subtype of a parameter in the profile for
a subprogram_body, entry_body, or accept_statement;
9/2
- * {AI95-00326-01AI95-00326-01} as the prefix of an
+ * {<AI95-00326-01AI95-00326-01>} as the prefix of an
attribute_reference whose attribute_designator (*note 4.1.4:
S0101.) is Class; such an attribute_reference (*note 4.1.4: S0100.)
is restricted to the uses allowed here; it denotes a tagged
incomplete view.
9.a/2
- This paragraph was deleted.{AI95-00326-01AI95-00326-01}
+ <This paragraph was deleted.>{<AI95-00326-01AI95-00326-01>}
9.1/3
-This paragraph was deleted.{AI95-00326-01AI95-00326-01}
-{AI05-0151-1AI05-0151-1}
+<This paragraph was deleted.>{<AI95-00326-01AI95-00326-01>}
+{<AI05-0151-1AI05-0151-1>}
9.2/3
- * This paragraph was deleted.{AI95-00326-01AI95-00326-01}
- {AI05-0098-1AI05-0098-1} {AI05-0151-1AI05-0151-1}
+ * <This paragraph was deleted.>{<AI95-00326-01AI95-00326-01>}
+ {<AI05-0098-1AI05-0098-1>} {<AI05-0151-1AI05-0151-1>}
9.b/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
9.3/2
-{AI95-00326-01AI95-00326-01} If any of the above uses occurs as part of
-the declaration of a primitive subprogram of the incomplete view, and
+{<AI95-00326-01AI95-00326-01>} If any of the above uses occurs as part
+of the declaration of a primitive subprogram of the incomplete view, and
the declaration occurs immediately within the private part of a package,
then the completion of the incomplete view shall also occur immediately
within the private part; it shall not be deferred to the package body.
@@ -17942,11 +17989,11 @@ within the private part; it shall not be deferred to
the package body.
representation of the type.
9.4/2
-{AI95-00326-01AI95-00326-01} No other uses of a name that denotes an
+{<AI95-00326-01AI95-00326-01>} No other uses of a name that denotes an
incomplete view of a type are allowed.
10/3
-{AI95-00326-01AI95-00326-01} {AI05-0151-1AI05-0151-1} A prefix that
+{<AI95-00326-01AI95-00326-01>} {<AI05-0151-1AI05-0151-1>} A prefix that
denotes an object shall not be of an incomplete view. An actual
parameter in a call shall not be of an untagged incomplete view. The
result object of a function call shall not be of an incomplete view. A
@@ -17963,10 +18010,10 @@ untagged incomplete view, nor a return type that is
an incomplete view.
10.b/2
This also disallows prefixes that are directly of an
- incomplete view. For instance, a parameter P can be declared
- of a tagged incomplete type, but we don't want to allow
- P'Size, P'Alignment, or the like, as representation values
- aren't known for an incomplete view.
+ incomplete view. For instance, a parameter <P> can be
+ declared of a tagged incomplete type, but we don't want to
+ allow <P>'Size, <P>'Alignment, or the like, as representation
+ values aren't known for an incomplete view.
10.c/2
We say "denotes an object" so that prefixes that directly name
@@ -17974,14 +18021,14 @@ untagged incomplete view, nor a return type that is
an incomplete view.
such cases, and we certainly don't want to ban Incomp'Class.
10.d/3
- {AI05-0151-1AI05-0151-1} As subprogram profiles now may
+ {<AI05-0151-1AI05-0151-1>} As subprogram profiles now may
include any kind of incomplete type, we also disallow passing
objects of untagged incomplete types in subprogram calls (as
the parameter passing method is not known as it is for tagged
types) and disallow returning any sort of incomplete objects
(since we don't know how big they are).
-Paragraph 11 was deleted.
+<Paragraph 11 was deleted.>
_Dynamic Semantics_
@@ -18006,18 +18053,18 @@ The elaboration of an incomplete_type_declaration has
no effect.
prior to it in the same declarative_part (see *note 13.14::).
13.1/3
- 90 {AI05-0151-1AI05-0151-1} {AI05-0269-1AI05-0269-1} A name that
- denotes an object of an incomplete view is defined to be of a
+ 90 {<AI05-0151-1AI05-0151-1>} {<AI05-0269-1AI05-0269-1>} A name
+ that denotes an object of an incomplete view is defined to be of a
limited type. Hence, the target of an assignment statement cannot
be of an incomplete view.
_Examples_
14
-Example of a recursive type:
+<Example of a recursive type:>
15
- type Cell; -- incomplete type declaration
+ type Cell; --< incomplete type declaration>
type Link is access Cell;
16
@@ -18033,18 +18080,18 @@ Example of a recursive type:
Next : Link := Head.Succ;
18
-Examples of mutually dependent access types:
+<Examples of mutually dependent access types:>
19/2
- {AI95-00433-01AI95-00433-01} type Person(<>); -- incomplete type
declaration
- type Car is tagged; -- incomplete type declaration
+ {<AI95-00433-01AI95-00433-01>} type Person(<>); --< incomplete type
declaration>
+ type Car is tagged; --< incomplete type declaration>
20/2
- {AI95-00433-01AI95-00433-01} type Person_Name is access Person;
+ {<AI95-00433-01AI95-00433-01>} type Person_Name is access Person;
type Car_Name is access all Car'Class;
21/2
- {AI95-00433-01AI95-00433-01} type Car is tagged
+ {<AI95-00433-01AI95-00433-01>} type Car is tagged
record
Number : Integer;
Owner : Person_Name;
@@ -18064,7 +18111,7 @@ Examples of mutually dependent access types:
end record;
23
- My_Car, Your_Car, Next_Car : Car_Name := new Car; -- see *note 4.8::
+ My_Car, Your_Car, Next_Car : Car_Name := new Car; --< see *note 4.8::>
George : Person_Name := new Person(M);
...
George.Vehicle := Your_Car;
@@ -18107,7 +18154,7 @@ Examples of mutually dependent access types:
end Pack;
23.e
- package body Pack is -- Could be separately compiled!
+ package body Pack is --< Could be separately compiled!>
type Sep is ...;
X := new Sep;
end Pack;
@@ -18115,7 +18162,7 @@ Examples of mutually dependent access types:
23.f
pragma Elaborate(Pack);
private package Pack.Child is
- I : Integer := X.all'Size; -- Legal, by AI-00039.
+ I : Integer := X.all'Size; --< Legal, by AI-00039.>
end Pack.Child;
23.g
@@ -18130,7 +18177,7 @@ Examples of mutually dependent access types:
_Incompatibilities With Ada 95_
23.h/2
- {AI95-00326-01AI95-00326-01} It is now illegal to use an
+ {<AI95-00326-01AI95-00326-01>} It is now illegal to use an
incomplete view (type) as the parameter or result of an
access-to-subprogram type unless the incomplete view is
completed in the same declaration list as the use. This was
@@ -18141,7 +18188,7 @@ Examples of mutually dependent access types:
views.
23.i/2
- {AI95-00326-01AI95-00326-01} It is now illegal to use an
+ {<AI95-00326-01AI95-00326-01>} It is now illegal to use an
incomplete view (type) in a primitive subprogram of the type
unless the incomplete view is completed in the package
specification. This was allowed in Ada 95 for incomplete
@@ -18153,22 +18200,22 @@ Examples of mutually dependent access types:
_Extensions to Ada 95_
23.j/2
- {AI95-00326-01AI95-00326-01} Tagged incomplete types are new.
- They are allowed in parameter declarations as well as the
- usual places, as tagged types are always by-reference types
- (and thus there can be no code generation issue).
+ {<AI95-00326-01AI95-00326-01>} Tagged incomplete types are
+ new. They are allowed in parameter declarations as well as
+ the usual places, as tagged types are always by-reference
+ types (and thus there can be no code generation issue).
23.k/2
- {AI95-00412-01AI95-00412-01} A subtype_declaration can be used
- to give a new name to an incomplete view of a type. This is
- valuable to give shorter names to entities imported with a
+ {<AI95-00412-01AI95-00412-01>} A subtype_declaration can be
+ used to give a new name to an incomplete view of a type. This
+ is valuable to give shorter names to entities imported with a
limited_with_clause.
_Wording Changes from Ada 95_
23.l/2
- {AI95-00326-01AI95-00326-01} The description of incomplete
- types as incomplete views is new. Ada 95 defined these as
+ {<AI95-00326-01AI95-00326-01>} The description of incomplete
+ types as <incomplete views> is new. Ada 95 defined these as
separate types, but neglected to give any rules for matching
them with other types. Luckily, implementers did the right
thing anyway. This change also makes it easier to describe
@@ -18177,40 +18224,41 @@ Examples of mutually dependent access types:
_Extensions to Ada 2005_
23.m/3
- {AI05-0098-1AI05-0098-1} Correction: Fixed the definition so
+ {<AI05-0098-1AI05-0098-1>} Correction: Fixed the definition so
that an anonymous access-to-subprogram type can use an
incomplete view in the same way that a named
access-to-subprogram type can.
23.n/3
- {AI05-0151-1AI05-0151-1} Incomplete types now can be used in
+ {<AI05-0151-1AI05-0151-1>} Incomplete types now can be used in
subprogram declarations. The type has to be complete before
any calls or the body is declared. This reduces the places
where access types are required for types imported from
limited views of packages.
23.o/3
- {AI05-0162-1AI05-0162-1} Incomplete types now can be completed
- by private types and private extensions. Since this can
- already happen for limited views, there is no remaining reason
- to disallow it for explicitly declared incomplete types.
+ {<AI05-0162-1AI05-0162-1>} Incomplete types now can be
+ completed by private types and private extensions. Since this
+ can already happen for limited views, there is no remaining
+ reason to disallow it for explicitly declared incomplete
+ types.
_Wording Changes from Ada 2005_
23.p/3
- {AI05-0208-1AI05-0208-1} Correction: Changed the rules of uses
- of dereferences of incomplete views such that it does not
+ {<AI05-0208-1AI05-0208-1>} Correction: Changed the rules of
+ uses of dereferences of incomplete views such that it does not
introduce an unintentional incompatibility with Ada 83 and Ada
95.
23.q/3
- {AI05-0213-1AI05-0213-1} Incomplete types now can be used as
+ {<AI05-0213-1AI05-0213-1>} Incomplete types now can be used as
actuals to formal incomplete types (see *note 12.5.1::).
_Wording Changes from Ada 2012_
23.r/4
- {AI12-0137-1AI12-0137-1} Corrigndum: Changed the wording to
+ {<AI12-0137-1AI12-0137-1>} Corrigndum: Changed the wording to
clarify that the class-wide type associated with a specific
tagged type that has an incomplete view is also an incomplete
view. While this was previously undefined, an interpretation
@@ -18226,9 +18274,9 @@ File: aarm2012.info, Node: 3.10.2, Prev: 3.10.1, Up:
3.10
---------------------------------
1/3
-{AI05-0299-1AI05-0299-1} [The attribute Access is used to create access
-values designating aliased objects and nonintrinsic subprograms. The
-"accessibility" rules prevent dangling references (in the absence of
+{<AI05-0299-1AI05-0299-1>} [The attribute Access is used to create
+access values designating aliased objects and nonintrinsic subprograms.
+The "accessibility" rules prevent dangling references (in the absence of
uses of certain unchecked features -- see Clause *note 13::).]
_Language Design Principles_
@@ -18250,26 +18298,26 @@ uses of certain unchecked features -- see Clause
*note 13::).]
_Name Resolution Rules_
2/2
-{AI95-00235-01AI95-00235-01} For an attribute_reference with
+{<AI95-00235-01AI95-00235-01>} For an attribute_reference with
attribute_designator Access (or Unchecked_Access -- see *note 13.10::),
-the expected type shall be a single access type A such that:
+the expected type shall be a single access type <A> such that:
2.1/2
- * {AI95-00235-01AI95-00235-01} A is an access-to-object type with
- designated type D and the type of the prefix is D'Class or is
- covered by D, or
+ * {<AI95-00235-01AI95-00235-01>} <A> is an access-to-object type with
+ designated type <D> and the type of the prefix is <D>'Class or is
+ covered by <D>, or
2.2/2
- * {AI95-00235-01AI95-00235-01} A is an access-to-subprogram type
+ * {<AI95-00235-01AI95-00235-01>} <A> is an access-to-subprogram type
whose designated profile is type conformant with that of the
prefix.
2.3/2
-{AI95-00235-01AI95-00235-01} [The prefix of such an attribute_reference
-is never interpreted as an implicit_dereference or a parameterless
-function_call (see *note 4.1.4::).] The designated type or profile of
-the expected type of the attribute_reference is the expected type or
-profile for the prefix.
+{<AI95-00235-01AI95-00235-01>} [The prefix of such an
+attribute_reference is never interpreted as an implicit_dereference or a
+parameterless function_call (see *note 4.1.4::).] The designated type
+or profile of the expected type of the attribute_reference is the
+expected type or profile for the prefix.
2.a
Discussion: Saying that the expected type shall be a "single
@@ -18284,8 +18332,8 @@ profile for the prefix.
4.1.4::.
2.b/2
- {AI95-00235-01AI95-00235-01} Saying "single access type" is a
- bit of a fudge. Both the context and the prefix may provide
+ {<AI95-00235-01AI95-00235-01>} Saying "single access type" is
+ a bit of a fudge. Both the context and the prefix may provide
both multiple types; "single" only means that a single,
specific interpretation must remain after resolution. We say
"single" here to trigger the Legality Rules of *note 8.6::.
@@ -18298,26 +18346,26 @@ profile for the prefix.
type Float_Ptr is access all Float;
2.d/2
- function Zap (Val : Int_Ptr) return Float; -- (1)
- function Zap (Val : Float_Ptr) return Float; -- (2)
- function Zop return Int_Ptr; -- (3)
- function Zop return Char_Ptr; -- (4)
+ function Zap (Val : Int_Ptr) return Float; -- <(1)>
+ function Zap (Val : Float_Ptr) return Float; -- <(2)>
+ function Zop return Int_Ptr; -- <(3)>
+ function Zop return Char_Ptr; -- <(4)>
2.e/2
- Result : Float := Zap (Zop.all'Access); -- Resolves to Zap (1)
and Zop (3).
+ Result : Float := Zap (Zop.all'Access); -- <Resolves to Zap (1)
and Zop (3).>
_Static Semantics_
3/2
-{AI95-00162-01AI95-00162-01} [The accessibility rules, which prevent
-dangling references, are written in terms of accessibility levels, which
-reflect the run-time nesting of masters. As explained in *note 7.6.1::,
-a master is the execution of a certain construct, such as a
-subprogram_body. An accessibility level is deeper than another if it is
-more deeply nested at run time. For example, an object declared local
-to a called subprogram has a deeper accessibility level than an object
-declared local to the calling subprogram. The accessibility rules for
-access types require that the accessibility level of an object
+{<AI95-00162-01AI95-00162-01>} [The accessibility rules, which prevent
+dangling references, are written in terms of <accessibility levels>,
+which reflect the run-time nesting of <masters>. As explained in *note
+7.6.1::, a master is the execution of a certain construct, such as a
+subprogram_body. An accessibility level is <deeper than> another if it
+is more deeply nested at run time. For example, an object declared
+local to a called subprogram has a deeper accessibility level than an
+object declared local to the calling subprogram. The accessibility
+rules for access types require that the accessibility level of an object
designated by an access value be no deeper than that of the access type.
This ensures that the object will live at least as long as the access
type, which in turn ensures that the access value cannot later designate
@@ -18325,7 +18373,7 @@ an object that no longer exists. The Unchecked_Access
attribute may be
used to circumvent the accessibility rules.]
3.a/3
- Discussion: {AI05-0005-1AI05-0005-1} The Unchecked_Access
+ Discussion: {<AI05-0005-1AI05-0005-1>} The Unchecked_Access
attribute acts as if the object was declared at library-level;
this applies even when it is used as the value of anonymous
access type. See *note 13.10::.
@@ -18335,10 +18383,10 @@ used to circumvent the accessibility rules.]
informally known as the "Heart of Darkness" amongst the
maintainers of Ada. Woe unto all who enter here (well, at
least unto anyone that needs to understand any of these
- rules).
+ rules).
4
-[A given accessibility level is said to be statically deeper than
+[A given accessibility level is said to be <statically deeper> than
another if the given level is known at compile time (as defined below)
to be deeper than the other for all possible executions. In most cases,
accessibility is enforced at compile time by Legality Rules. Run-time
@@ -18356,25 +18404,25 @@ accessibility level:
depends (see *note 9.3::).
7/4
- * {AI95-00162-01AI95-00162-01} {AI95-00416-01AI95-00416-01}
- {AI05-0235-1AI05-0235-1} {AI12-0067-1AI12-0067-1}
- {AI12-0089-1AI12-0089-1} An entity or view defined by a declaration
- and created as part of its elaboration has the same accessibility
- level as the innermost master of the declaration except in the
- cases of renaming and derived access types described below. Other
- than for an explicitly aliased parameter of a function or generic
- function, a formal parameter of a callable entity has the same
- accessibility level as the master representing the invocation of
- the entity.
+ * {<AI95-00162-01AI95-00162-01>} {<AI95-00416-01AI95-00416-01>}
+ {<AI05-0235-1AI05-0235-1>} {<AI12-0067-1AI12-0067-1>}
+ {<AI12-0089-1AI12-0089-1>} An entity or view defined by a
+ declaration and created as part of its elaboration has the same
+ accessibility level as the innermost master of the declaration
+ except in the cases of renaming and derived access types described
+ below. Other than for an explicitly aliased parameter of a
+ function or generic function, a formal parameter of a callable
+ entity has the same accessibility level as the master representing
+ the invocation of the entity.
7.a/2
- Reason: {AI95-00416-01AI95-00416-01} This rule defines the
+ Reason: {<AI95-00416-01AI95-00416-01>} This rule defines the
"normal" accessibility of entities. In the absence of special
rules below, we intend for this rule to apply.
7.b/4
- Discussion: {AI95-00416-01AI95-00416-01}
- {AI12-0005-1AI12-0005-1} This rule defines the accessibility
+ Discussion: {<AI95-00416-01AI95-00416-01>}
+ {<AI12-0005-1AI12-0005-1>} This rule defines the accessibility
of all named access types, as well as the accessibility level
of anonymous access types in a component_definition Special
rules exist for the accessibility level of other anonymous
@@ -18383,7 +18431,7 @@ accessibility level:
named access types defined at the same point.
7.c/2
- Ramification: {AI95-00230-01AI95-00230-01} Because
+ Ramification: {<AI95-00230-01AI95-00230-01>} Because
accessibility level is determined by where the
access_definition is elaborated, for a type extension, the
anonymous access types of components (other than access
@@ -18395,22 +18443,22 @@ accessibility level:
type have the same accessibility as they did in the parent.
7.d/3
- To be honest: {AI05-0235-1AI05-0235-1} We use "invocation of"
- in the parameter case as a master is formally an execution of
- something. But we mean this to be interpreted statically (for
- instance, as the body of the subprogram) for the purposes of
- computing "statically deeper than" (see below).
+ To be honest: {<AI05-0235-1AI05-0235-1>} We use "invocation
+ of" in the parameter case as a master is formally an execution
+ of something. But we mean this to be interpreted statically
+ (for instance, as the body of the subprogram) for the purposes
+ of computing "statically deeper than" (see below).
7.e/3
- Ramification: {AI05-0235-1AI05-0235-1} Note that accessibility
- can differ depending on the view of an object (for both static
- and dynamic accessibility). For instance, the accessibility
- level of a formal parameter may be different than the
- accessibility level of the corresponding actual parameter.
- This occurs in other cases as well.
+ Ramification: {<AI05-0235-1AI05-0235-1>} Note that
+ accessibility can differ depending on the view of an object
+ (for both static and dynamic accessibility). For instance,
+ the accessibility level of a formal parameter may be different
+ than the accessibility level of the corresponding actual
+ parameter. This occurs in other cases as well.
7.f/3
- Reason: {AI05-0235-1AI05-0235-1} We define the (dynamic)
+ Reason: {<AI05-0235-1AI05-0235-1>} We define the (dynamic)
accessibility of formal parameters in order that it does not
depend on the parameter passing model (by-reference or
by-copy) as that is implementation defined. Otherwise, there
@@ -18422,29 +18470,29 @@ accessibility level:
renamed view.
9/2
- * {AI95-00416-01AI95-00416-01} The accessibility level of a view
+ * {<AI95-00416-01AI95-00416-01>} The accessibility level of a view
conversion, qualified_expression, or parenthesized expression, is
the same as that of the operand.
9.1/3
- * {AI05-0188-1AI05-0188-1} The accessibility level of a
+ * {<AI05-0188-1AI05-0188-1>} The accessibility level of a
conditional_expression is the accessibility level of the evaluated
- dependent_expression.
+ <dependent_>expression.
10/4
- * {AI95-00318-02AI95-00318-02} {AI95-00416-01AI95-00416-01}
- {AI05-0234-1AI05-0234-1} {AI12-0027-1AI12-0027-1} The accessibility
- level of an aggregate that is used (in its entirety) to directly
- initialize part of an object is that of the object being
- initialized. In other contexts, the accessibility level of an
- aggregate is that of the innermost master that evaluates the
+ * {<AI95-00318-02AI95-00318-02>} {<AI95-00416-01AI95-00416-01>}
+ {<AI05-0234-1AI05-0234-1>} {<AI12-0027-1AI12-0027-1>} The
+ accessibility level of an aggregate that is used (in its entirety)
+ to directly initialize part of an object is that of the object
+ being initialized. In other contexts, the accessibility level of
+ an aggregate is that of the innermost master that evaluates the
aggregate. Corresponding rules apply to a value conversion (see
*note 4.6::).
10.1/3
- * {AI05-0234-1AI05-0234-1} The accessibility level of the result of a
- function call is that of the master of the function call, which is
- determined by the point of call as follows:
+ * {<AI05-0234-1AI05-0234-1>} The accessibility level of the result of
+ a function call is that of the <master of the function call>, which
+ is determined by the point of call as follows:
10.2/3
* If the result is used (in its entirety) to directly
@@ -18456,16 +18504,16 @@ accessibility level:
be transferred.
10.a/2
- To be honest: {AI95-00416-01AI95-00416-01} The first sentence
- is talking about a static use of the entire return object -- a
- slice that happens to be the entire return object doesn't
- count. On the other hand, this is intended to allow
+ To be honest: {<AI95-00416-01AI95-00416-01>} The first
+ sentence is talking about a static use of the entire return
+ object -- a slice that happens to be the entire return object
+ doesn't count. On the other hand, this is intended to allow
parentheses and qualified_expressions.
10.b/3
- Ramification: {AI95-00416-01AI95-00416-01}
- {AI05-0234-1AI05-0234-1} If the function is used as a prefix,
- this bullet does not apply. Similarly, an
+ Ramification: {<AI95-00416-01AI95-00416-01>}
+ {<AI05-0234-1AI05-0234-1>} If the function is used as a
+ prefix, this bullet does not apply. Similarly, an
assignment_statement is not an initialization of an object, so
this bullet does not apply.
@@ -18491,27 +18539,28 @@ accessibility level:
innermost master that evaluates the function call.
10.c/2
- Ramification: {AI95-00318-02AI95-00318-02}
- {AI95-00416-01AI95-00416-01} The "innermost master which
+ Ramification: {<AI95-00318-02AI95-00318-02>}
+ {<AI95-00416-01AI95-00416-01>} The "innermost master which
evaluated the function call" does not include the function
call itself (which might be a master).
10.d/2
- {AI95-00318-02AI95-00318-02} {AI95-00416-01AI95-00416-01} We
- really mean the innermost master here, which could be a very
- short lifetime. Consider a function call used as a parameter
- of a procedure call. In this case the innermost master which
- evaluated the function call is the procedure call.
+ {<AI95-00318-02AI95-00318-02>} {<AI95-00416-01AI95-00416-01>}
+ We really mean the innermost master here, which could be a
+ very short lifetime. Consider a function call used as a
+ parameter of a procedure call. In this case the innermost
+ master which evaluated the function call is the procedure
+ call.
10.d.1/3
- Ramification: {AI05-0234-1AI05-0234-1} These rules do not
+ Ramification: {<AI05-0234-1AI05-0234-1>} These rules do not
mention whether the result object is built-in-place (see *note
7.6::). In particular, in the case where building in place is
optional, the choice whether or not to build-in-place has no
effect on masters, lifetimes, or accessibility.
10.d.2/3
- Implementation Note: {AI05-0234-1AI05-0234-1} There are
+ Implementation Note: {<AI05-0234-1AI05-0234-1>} There are
several cases where the implementation may have to pass in the
accessibility level of the result object on a call, to support
later rules where the accessibility level comes from the
@@ -18539,13 +18588,13 @@ accessibility level:
parameter.
10.7/3
- {AI05-0284-1AI05-0284-1} In the case of a call to a function whose
- result type is an anonymous access type, the accessibility level of
- the type of the result of the function call is also determined by
- the point of call as described above.
+ {<AI05-0284-1AI05-0284-1>} In the case of a call to a function
+ whose result type is an anonymous access type, the accessibility
+ level of the type of the result of the function call is also
+ determined by the point of call as described above.
10.8/3
- * {AI95-00416-01AI95-00416-01} Within a return statement, the
+ * {<AI95-00416-01AI95-00416-01>} Within a return statement, the
accessibility level of the return object is that of the execution
of the return statement. If the return statement completes
normally by returning from the function, then prior to leaving the
@@ -18569,13 +18618,13 @@ accessibility level:
that of its ultimate ancestor.
11.1/2
- * {AI95-00230-01AI95-00230-01} The accessibility level of the
+ * {<AI95-00230-01AI95-00230-01>} The accessibility level of the
anonymous access type defined by an access_definition of an
object_renaming_declaration is the same as that of the renamed
view.
12/2
- * {AI95-00230-01AI95-00230-01} {AI95-00416-01AI95-00416-01} The
+ * {<AI95-00230-01AI95-00230-01>} {<AI95-00416-01AI95-00416-01>} The
accessibility level of the anonymous access type of an access
discriminant in the subtype_indication or qualified_expression of
an allocator, or in the expression or return_subtype_indication
@@ -18608,20 +18657,21 @@ accessibility level:
access-to-constrained subtype, etc.
12.e/3
- Ramification: {AI05-0281-1AI05-0281-1} The subtype_indication
- mentioned in this bullet is not necessarily the one given in
- the allocator or return statement that is determining the
- accessibility level; the constrained subtype might have been
- defined in an earlier declaration (as a named subtype).
+ Ramification: {<AI05-0281-1AI05-0281-1>} The
+ subtype_indication mentioned in this bullet is not necessarily
+ the one given in the allocator or return statement that is
+ determining the accessibility level; the constrained subtype
+ might have been defined in an earlier declaration (as a named
+ subtype).
12.f/3
- {AI05-0005-1AI05-0005-1} If the value for this rule and the
+ {<AI05-0005-1AI05-0005-1>} If the value for this rule and the
next one is derived from an Unchecked_Access attribute, the
accessibility is library-level no matter what the
accessibility level of the object is (see *note 13.10::).
12.2/3
- * {AI05-0234-1AI05-0234-1} If the value of the access
+ * {<AI05-0234-1AI05-0234-1>} If the value of the access
discriminant is determined by a default_expression in the
declaration of the discriminant, the level of the object
or subprogram designated by the associated value (or
@@ -18633,7 +18683,7 @@ accessibility level:
discriminants.
12.3/3
- * {AI05-0004-1AI05-0004-1} If the value of the access
+ * {<AI05-0004-1AI05-0004-1>} If the value of the access
discriminant is determined by a
record_component_association in an aggregate, the
accessibility level of the object or subprogram
@@ -18654,7 +18704,7 @@ accessibility level:
the object.
12.h/2
- Discussion: {AI95-00416-01AI95-00416-01} In other words, if
+ Discussion: {<AI95-00416-01AI95-00416-01>} In other words, if
you know the value of the discriminant for an allocator or
return statement from a discriminant constraint or an
aggregate component association, then that determines the
@@ -18662,24 +18712,24 @@ accessibility level:
the object itself.
12.5/3
- * {AI95-00416-01AI95-00416-01} The accessibility level of the
+ * {<AI95-00416-01AI95-00416-01>} The accessibility level of the
anonymous access type of an access discriminant in any other
context is that of the enclosing object.
13/3
- * {AI95-00162-01AI95-00162-01} {AI95-00254-01AI95-00254-01}
- {AI05-0270-1AI05-0270-1} The accessibility level of the anonymous
+ * {<AI95-00162-01AI95-00162-01>} {<AI95-00254-01AI95-00254-01>}
+ {<AI05-0270-1AI05-0270-1>} The accessibility level of the anonymous
access type of an access parameter specifying an access-to-object
type is the same as that of the view designated by the actual (or
library-level if the actual is null).
13.a/3
- Ramification: {AI05-0005-1AI05-0005-1} If the value of the
+ Ramification: {<AI05-0005-1AI05-0005-1>} If the value of the
actual is derived from an Unchecked_Access attribute, the
accessibility is always library-level (see *note 13.10::).
13.1/2
- * {AI95-00254-01AI95-00254-01} The accessibility level of the
+ * {<AI95-00254-01AI95-00254-01>} The accessibility level of the
anonymous access type of an access parameter specifying an
access-to-subprogram type is deeper than that of any master; all
such anonymous access types have this same level.
@@ -18694,14 +18744,14 @@ accessibility level:
information needed to make a call.
13.2/4
- * {AI12-0070-1AI12-0070-1} The accessibility level of the anonymous
+ * {<AI12-0070-1AI12-0070-1>} The accessibility level of the anonymous
access subtype defined by a return_subtype_indication that is an
access_definition (see *note 6.5::) is that of the result subtype
of the enclosing function.
13.3/4
- * {AI05-0148-1AI05-0148-1} {AI05-0240-1AI05-0240-1}
- {AI12-0070-1AI12-0070-1} The accessibility level of the type of a
+ * {<AI05-0148-1AI05-0148-1>} {<AI05-0240-1AI05-0240-1>}
+ {<AI12-0070-1AI12-0070-1>} The accessibility level of the type of a
stand-alone object of an anonymous access-to-object type is the
same as the accessibility level of the type of the access value
most recently assigned to the object[; accessibility checks ensure
@@ -18709,18 +18759,18 @@ accessibility level:
stand-alone object].
13.4/4
- * {AI05-0142-4AI05-0142-4} {AI05-0240-1AI05-0240-1}
- {AI12-0070-1AI12-0070-1} The accessibility level of an explicitly
+ * {<AI05-0142-4AI05-0142-4>} {<AI05-0240-1AI05-0240-1>}
+ {<AI12-0070-1AI12-0070-1>} The accessibility level of an explicitly
aliased (see *note 6.1::) formal parameter in a function body is
determined by the point of call; it is the same level that the
return object ultimately will have.
14/3
- * {AI95-00416-01AI95-00416-01} {AI05-0051-1AI05-0051-1}
- {AI05-0253-1AI05-0253-1} The accessibility level of an object
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0051-1AI05-0051-1>}
+ {<AI05-0253-1AI05-0253-1>} The accessibility level of an object
created by an allocator is the same as that of the access type,
- except for an allocator of an anonymous access type (an anonymous
- allocator) in certain contexts, as follows: For an anonymous
+ except for an allocator of an anonymous access type (an <anonymous
+ allocator>) in certain contexts, as follows: For an anonymous
allocator that defines the result of a function with an access
result, the accessibility level is determined as though the
allocator were in place of the call of the function; in the special
@@ -18735,24 +18785,25 @@ accessibility level:
determined as follows:
14.1/3
- * {AI95-00416-01AI95-00416-01} {AI05-0024-1AI05-0024-1} for
- an allocator used to define the discriminant of an
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0024-1AI05-0024-1>}
+ for an allocator used to define the discriminant of an
object, the level of the object;
14.2/3
- * {AI95-00416-01AI95-00416-01} {AI05-0024-1AI05-0024-1} for
- an allocator used to define the constraint in a
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0024-1AI05-0024-1>}
+ for an allocator used to define the constraint in a
subtype_indication in any other context, the level of the
master that elaborates the subtype_indication.
14.3/3
- * This paragraph was deleted.{AI95-00416-01AI95-00416-01}
- {AI05-0024-1AI05-0024-1}
+ * <This paragraph was
+ deleted.>{<AI95-00416-01AI95-00416-01>}
+ {<AI05-0024-1AI05-0024-1>}
14.4/3
- {AI95-00416-01AI95-00416-01} {AI05-0024-1AI05-0024-1}
- {AI05-0066-1AI05-0066-1} In the first case, the allocated object is
- said to be a coextension of the object whose discriminant
+ {<AI95-00416-01AI95-00416-01>} {<AI05-0024-1AI05-0024-1>}
+ {<AI05-0066-1AI05-0066-1>} In the first case, the allocated object
+ is said to be a <coextension> of the object whose discriminant
designates it, as well as of any object of which the discriminated
object is itself a coextension or subcomponent. If the allocated
object is a coextension of an anonymous object representing the
@@ -18773,21 +18824,22 @@ accessibility level:
stack frame, in the case of a declared object).
14.5/3
- * {AI05-0051-1AI05-0051-1} Within a return statement, the
+ * {<AI05-0051-1AI05-0051-1>} Within a return statement, the
accessibility level of the anonymous access type of an access
result is that of the master of the call.
15/3
- * {AI05-0014-1AI05-0014-1} The accessibility level of a view of an
+ * {<AI05-0014-1AI05-0014-1>} The accessibility level of a view of an
object or subprogram designated by an access value is the same as
that of the access type.
15.a/3
- Discussion: {AI05-0005-1AI05-0005-1} {AI05-0014-1AI05-0014-1}
- This rule applies even when no dereference exists, for example
- when an access value is passed as an access parameter. This
- rule ensures that implementations are not required to include
- dynamic accessibility values with all access values.
+ Discussion: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0014-1AI05-0014-1>} This rule applies even when no
+ dereference exists, for example when an access value is passed
+ as an access parameter. This rule ensures that
+ implementations are not required to include dynamic
+ accessibility values with all access values.
16
* The accessibility level of a component, protected subprogram, or
@@ -18795,17 +18847,17 @@ accessibility level:
view of) the composite object.
16.1/3
-{AI95-00416-01AI95-00416-01} {AI05-0262-1AI05-0262-1} In the above
+{<AI95-00416-01AI95-00416-01>} {<AI05-0262-1AI05-0262-1>} In the above
rules, the operand of a view conversion, parenthesized expression or
qualified_expression is considered to be used in a context if the view
conversion, parenthesized expression or qualified_expression itself is
-used in that context. Similarly, a dependent_expression of a
+used in that context. Similarly, a <dependent_>expression of a
conditional_expression is considered to be used in a context if the
conditional_expression itself is used in that context.
17
-One accessibility level is defined to be statically deeper than another
-in the following cases:
+One accessibility level is defined to be <statically deeper> than
+another in the following cases:
18
* For a master that is statically nested within another master, the
@@ -18814,9 +18866,9 @@ in the following cases:
18.a
To be honest: Strictly speaking, this should talk about the
- constructs (such as subprogram_bodies) being statically nested
- within one another; the masters are really the executions of
- those constructs.
+ <constructs> (such as subprogram_bodies) being statically
+ nested within one another; the masters are really the
+ <executions> of those constructs.
18.b
To be honest: If a given accessibility level is statically
@@ -18825,7 +18877,7 @@ in the following cases:
to be the same as the other level.
18.1/2
- * {AI95-00254-01AI95-00254-01} The accessibility level of the
+ * {<AI95-00254-01AI95-00254-01>} The accessibility level of the
anonymous access type of an access parameter specifying an
access-to-subprogram type is statically deeper than that of any
master; all such anonymous access types have this same level.
@@ -18838,7 +18890,7 @@ in the following cases:
conversion's accessibility will succeed).
19/3
- * {AI95-00254-01AI95-00254-01} {AI05-0082-1AI05-0082-1} The
+ * {<AI95-00254-01AI95-00254-01>} {<AI05-0082-1AI05-0082-1>} The
statically deeper relationship does not apply to the accessibility
level of the anonymous type of an access parameter specifying an
access-to-object type nor does it apply to a descendant of a
@@ -18847,7 +18899,7 @@ in the following cases:
any other.
19.1/3
- * {AI05-0148-1AI05-0148-1} The statically deeper relationship does
+ * {<AI05-0148-1AI05-0148-1>} The statically deeper relationship does
not apply to the accessibility level of the type of a stand-alone
object of an anonymous access-to-object type; that is, such an
accessibility level is not considered to be statically deeper, nor
@@ -18858,36 +18910,36 @@ in the following cases:
checks.
19.2/4
- * {AI05-0142-4AI05-0142-4} {AI05-0235-1AI05-0235-1}
- {AI12-0089-1AI12-0089-1} {AI12-0157-1AI12-0157-1} Inside a return
- statement that applies to a function or generic function F, or the
- return expression of an expression function F, when determining
- whether the accessibility level of an explicitly aliased parameter
- of F is statically deeper than the level of the return object of F,
- the level of the return object is considered to be the same as that
- of the level of the explicitly aliased parameter; for statically
- comparing with the level of other entities, an explicitly aliased
- parameter of F is considered to have the accessibility level of the
- body of F.
+ * {<AI05-0142-4AI05-0142-4>} {<AI05-0235-1AI05-0235-1>}
+ {<AI12-0089-1AI12-0089-1>} {<AI12-0157-1AI12-0157-1>} Inside a
+ return statement that applies to a function or generic function
+ <F>, or the return expression of an expression function <F>, when
+ determining whether the accessibility level of an explicitly
+ aliased parameter of <F> is statically deeper than the level of the
+ return object of <F>, the level of the return object is considered
+ to be the same as that of the level of the explicitly aliased
+ parameter; for statically comparing with the level of other
+ entities, an explicitly aliased parameter of <F> is considered to
+ have the accessibility level of the body of <F>.
19.3/4
- * {AI05-0051-1AI05-0051-1} {AI05-0234-1AI05-0234-1}
- {AI05-0235-1AI05-0235-1} {AI12-0089-1AI12-0089-1}
- {AI12-0157-1AI12-0157-1} For determining whether a level is
+ * {<AI05-0051-1AI05-0051-1>} {<AI05-0234-1AI05-0234-1>}
+ {<AI05-0235-1AI05-0235-1>} {<AI12-0089-1AI12-0089-1>}
+ {<AI12-0157-1AI12-0157-1>} For determining whether a level is
statically deeper than the level of the anonymous access type of an
- access result of a function or generic function F, when within a
- return statement that applies to F or the return expression of
- expression function F, the level of the master of the call is
+ access result of a function or generic function <F>, when within a
+ return statement that applies to <F> or the return expression of
+ expression function <F>, the level of the master of the call is
presumed to be the same as that of the level of the master that
- elaborated the body of F.
+ elaborated the body of <F>.
20
- * or generic function F
+ * or generic function <F>
20.a/3
- To be honest: {AI05-0235-1AI05-0235-1} This rule has no effect
- if the previous bullet also applies (that is, the "a level" is
- of an explicitly aliased parameter).
+ To be honest: {<AI05-0235-1AI05-0235-1>} This rule has no
+ effect if the previous bullet also applies (that is, the "a
+ level" is of an explicitly aliased parameter).
21
* [For determining whether one level is statically deeper than
@@ -18897,7 +18949,7 @@ in the following cases:
nested instantiations.]
21.a/3
- Proof: {AI05-0082-1AI05-0082-1} A generic package does not
+ Proof: {<AI05-0082-1AI05-0082-1>} A generic package does not
introduce a new master, so it has the static level of its
declaration; the rest follows from the other "statically
deeper" rules.
@@ -18913,8 +18965,8 @@ in the following cases:
time of the type_declaration, in an assume-the-worst manner.
23
-The accessibility level of all library units is called the library
-level; a library-level declaration or entity is one whose accessibility
+The accessibility level of all library units is called the <library
+level>; a library-level declaration or entity is one whose accessibility
level is the library level.
23.a
@@ -18984,9 +19036,9 @@ level is the library level.
the package.
23.k
- Note that the level of the view denoted by X.all can be
- different from the level of the object denoted by X.all. The
- former is determined by the type of X; the latter is
+ Note that the level of the <view> denoted by X.all can be
+ different from the level of the <object> denoted by X.all.
+ The former is determined by the type of X; the latter is
determined either by the type of the allocator, or by the
master in which the object was declared. The former is used
in several Legality Rules and run-time checks; the latter is
@@ -19019,11 +19071,11 @@ level is the library level.
a type.
23.o.1/3
- * {AI05-0082-1AI05-0082-1} Checks involving generic formal
- types and their descendants. This is because the actual
- type can be more or less deeply nested than the generic
- unit. Note that this only applies to the generic unit
- itself, and not to the instance. Any static checks
+ * {<AI05-0082-1AI05-0082-1>} Checks involving generic
+ formal types and their descendants. This is because the
+ actual type can be more or less deeply nested than the
+ generic unit. Note that this only applies to the generic
+ unit itself, and not to the instance. Any static checks
needed in the instance will be performed. Any other
checks (such as those in the generic body) will require a
run-time check of some sort (although implementations
@@ -19031,23 +19083,24 @@ level is the library level.
the check when the generic is expanded).
23.p/3
- * {AI05-0082-1AI05-0082-1} Checks involving other entities
- and views within generic packages. This is because an
- instantiation can be at a level that is more deeply
- nested than the generic package itself. In
+ * {<AI05-0082-1AI05-0082-1>} Checks involving other
+ entities and views within generic packages. This is
+ because an instantiation can be at a level that is more
+ deeply nested than the generic package itself. In
implementations that use a macro-expansion model of
generics, these violations can be detected at
macro-expansion time. For implementations that share
generics, run-time code is needed to detect the error.
23.q/2
- * {AI95-00318-02AI95-00318-02} {AI95-00344-01AI95-00344-01}
- {AI95-00416-01AI95-00416-01} Checks during function
+ * {<AI95-00318-02AI95-00318-02>}
+ {<AI95-00344-01AI95-00344-01>}
+ {<AI95-00416-01AI95-00416-01>} Checks during function
return and allocators, for nested type extensions and
access discriminants.
23.r/3
- {AI05-0005-1AI05-0005-1} Note that run-time checks are not
+ {<AI05-0005-1AI05-0005-1>} Note that run-time checks are not
required for access discriminants (except during function
returns and allocators), because their accessibility is
determined statically by the accessibility level of the
@@ -19064,9 +19117,9 @@ level is the library level.
deeper, or deeper, respectively, than something else.
23.u/2
- Implementation Note: {AI95-00318-02AI95-00318-02}
- {AI95-00344-01AI95-00344-01} {AI95-00416-01AI95-00416-01} If
- an accessibility Legality Rule is satisfied, then the
+ Implementation Note: {<AI95-00318-02AI95-00318-02>}
+ {<AI95-00344-01AI95-00344-01>} {<AI95-00416-01AI95-00416-01>}
+ If an accessibility Legality Rule is satisfied, then the
corresponding run-time check (if any) cannot fail (and a
reasonable implementation will not generate any checking code)
unless one of the cases requiring run-time checks mentioned
@@ -19094,7 +19147,7 @@ level is the library level.
is not deeper than Y would involve checking that X <= Y.
23.x
- A more efficient method is based on passing static nesting
+ A more efficient method is based on passing <static> nesting
levels (within constructs that correspond at run time to
masters -- packages don't count). Whenever an access
parameter is passed, an implicit extra parameter is passed
@@ -19158,7 +19211,7 @@ level is the library level.
overhead.
23.ff.1/3
- {AI05-0148-1AI05-0148-1} The implementation of accessibility
+ {<AI05-0148-1AI05-0148-1>} The implementation of accessibility
checks for stand-alone objects of anonymous access-to-object
types can be similar to that for anonymous access-to-object
parameters. A static level suffices; it can be calculated
@@ -19166,15 +19219,15 @@ level is the library level.
parameters.
23.ff.2/3
- {AI05-0148-1AI05-0148-1} One important difference between the
- stand-alone access variables and access parameters is that one
- can assign a local access parameter to a more global
+ {<AI05-0148-1AI05-0148-1>} One important difference between
+ the stand-alone access variables and access parameters is that
+ one can assign a local access parameter to a more global
stand-alone access variable. Similarly, one can assign a more
global access parameter to a more local stand-alone access
variable.
23.ff.3/3
- {AI05-0148-1AI05-0148-1} For these cases, it is important to
+ {<AI05-0148-1AI05-0148-1>} For these cases, it is important to
note that the "correct" static accessibility level for an
access parameter assigned to a stand-alone access object is
the minimum of the passed in level and the static
@@ -19192,26 +19245,26 @@ level is the library level.
Discussion: Examples of accessibility:
23.hh/3
- {AI05-0005-1AI05-0005-1} package body Lib_Unit is
+ {<AI05-0005-1AI05-0005-1>} package body Lib_Unit is
type T is tagged ...;
type A0 is access all T;
Global: A0 := ...;
procedure P(X: in out T) is
Y: aliased T;
type A1 is access all T;
- Ptr0: A0 := Global; -- OK.
- Ptr1: A1 := X'Access; -- OK.
+ Ptr0: A0 := Global; --< OK.>
+ Ptr1: A1 := X'Access; --< OK.>
begin
- Ptr1 := Y'Access; -- OK;
- Ptr0 := A0(Ptr1); -- Illegal type conversion!
- Ptr0 := X'Access; -- Illegal reference to Access
attribute!
- Ptr0 := Y'Access; -- Illegal reference to Access
attribute!
- Global := Ptr0; -- OK.
+ Ptr1 := Y'Access; --< OK;>
+ Ptr0 := A0(Ptr1); --< Illegal type conversion!>
+ Ptr0 := X'Access; --< Illegal reference to Access
attribute!>
+ Ptr0 := Y'Access; --< Illegal reference to Access
attribute!>
+ Global := Ptr0; --< OK.>
end P;
end Lib_Unit;
23.ii/3
- {AI05-0005-1AI05-0005-1} The above illegal statements are
+ {<AI05-0005-1AI05-0005-1>} The above illegal statements are
illegal because the accessibility levels of X and Y are
statically deeper than the accessibility level of A0. In
every possible execution of any program including this library
@@ -19231,8 +19284,8 @@ level is the library level.
procedure P(X: access Integer) is
type Nested_Type is access all Integer;
begin
- ... Nested_Type(X) ... -- (1)
- ... Level_1_Type(X) ... -- (2)
+ ... Nested_Type(X) ... --< (1)>
+ ... Level_1_Type(X) ... --< (2)>
end P;
23.mm
@@ -19249,13 +19302,13 @@ level is the library level.
procedure R is
Level_2: aliased Integer;
begin
- Q(Level_2'Access); -- (3)
+ Q(Level_2'Access); --< (3)>
end R;
23.oo
Level_1: aliased Integer;
begin
- Q(Level_1'Access); -- (4)
+ Q(Level_1'Access); --< (4)>
R;
end Main;
@@ -19269,7 +19322,7 @@ level is the library level.
assume-the-worst manner. For example:
23.rr/3
- {AI05-0298-1AI05-0298-1} package P is
+ {<AI05-0298-1AI05-0298-1>} package P is
type Int_Ptr is access all Integer;
type Rec(D: access Integer) is limited private;
private
@@ -19278,9 +19331,9 @@ level is the library level.
function G(X: access Rec) return Boolean;
type Rec(D: access Integer) is
limited record
- C1: Int_Ptr := Int_Ptr(D); -- Illegal!
- C2: Rec_Ptr := Rec'Access; -- Illegal!
- C3: Boolean := F(Rec'Access); -- Illegal!
+ C1: Int_Ptr := Int_Ptr(D); --< Illegal!>
+ C2: Rec_Ptr := Rec'Access; --< Illegal!>
+ C3: Boolean := F(Rec'Access); --< Illegal!>
C4: Boolean := G(Rec'Access);
end record;
end P;
@@ -19306,24 +19359,23 @@ aliased view of an object:
25/1
X'Access
- {8652/00108652/0010} {AI95-00127-01AI95-00127-01}
+ {<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
X'Access yields an access value that designates the
object denoted by X. The type of X'Access is an
access-to-object type, as determined by the expected
- type. The expected type shall be a general access type.
- X shall denote an aliased view of an object[, including
+ type. The expected type shall be a general access type.
X shall denote an aliased view of an object[, including
possibly the current instance (see *note 8.6::) of a
limited type within its definition, or a formal parameter
or generic formal object of a tagged type]. The view
denoted by the prefix X shall satisfy the following
additional requirements, presuming the expected type for
- X'Access is the general access type A with designated
- type D:
+ X'Access is the general access type <A> with designated
+ type <D>:
26
- * If A is an access-to-variable type, then the view
- shall be a variable; [on the other hand, if A is an
- access-to-constant type, the view may be either a
+ * If <A> is an access-to-variable type, then the view
+ shall be a variable; [on the other hand, if <A> is
+ an access-to-constant type, the view may be either a
constant or a variable.]
26.a
@@ -19331,11 +19383,11 @@ X'Access
considered a variable.
27/3
- * {AI95-00363-01AI95-00363-01}
- {AI05-0008-1AI05-0008-1} {AI05-0041-1AI05-0041-1}
- The view shall not be a subcomponent that depends on
- discriminants of an object unless the object is
- known to be constrained.
+ * {<AI95-00363-01AI95-00363-01>}
+ {<AI05-0008-1AI05-0008-1>}
+ {<AI05-0041-1AI05-0041-1>} The view shall not be a
+ subcomponent that depends on discriminants of an
+ object unless the object is known to be constrained.
27.a
Discussion: This restriction is intended to be similar to the
@@ -19387,26 +19439,28 @@ X'Access
the derived type (see *note 3.7::).
28/2
- * {8652/00108652/0010} {AI95-00127-01AI95-00127-01}
- {AI95-00363-01AI95-00363-01} If A is a named access
- type and D is a tagged type, then the type of the
- view shall be covered by D; if A is anonymous and D
- is tagged, then the type of the view shall be either
- D'Class or a type covered by D; if D is untagged,
- then the type of the view shall be D, and either:
+ * {<8652/00108652/0010>}
+ {<AI95-00127-01AI95-00127-01>}
+ {<AI95-00363-01AI95-00363-01>} If <A> is a named
+ access type and <D> is a tagged type, then the type
+ of the view shall be covered by <D>; if <A> is
+ anonymous and <D> is tagged, then the type of the
+ view shall be either <D>'Class or a type covered by
+ <D>; if <D> is untagged, then the type of the view
+ shall be <D>, and either:
28.1/2
- * {AI95-00363-01AI95-00363-01} the
- designated subtype of A shall statically
+ * {<AI95-00363-01AI95-00363-01>} the
+ designated subtype of <A> shall statically
match the nominal subtype of the view; or
28.2/4
- * {AI95-00363-01AI95-00363-01}
- {AI05-0041-1AI05-0041-1}
- {AI12-0095-1AI12-0095-1} D shall be
+ * {<AI95-00363-01AI95-00363-01>}
+ {<AI05-0041-1AI05-0041-1>}
+ {<AI12-0095-1AI12-0095-1>} <D> shall be
discriminated in its full view and
unconstrained in any partial view, and the
- designated subtype of A shall be
+ designated subtype of <A> shall be
unconstrained.
28.a
@@ -19415,56 +19469,57 @@ X'Access
not be if its nominal subtype is constrained.
28.a.1/1
- Ramification: {8652/00108652/0010}
- {AI95-00127-01AI95-00127-01} An access attribute can be used
+ Ramification: {<8652/00108652/0010>}
+ {<AI95-00127-01AI95-00127-01>} An access attribute can be used
as the controlling operand in a dispatching call; see *note
3.9.2::.
28.a.2/2
- {AI95-00363-01AI95-00363-01} This does not require that types
- have a partial view in order to allow an access attribute of
- an unconstrained discriminated object, only that any partial
- view that does exist is unconstrained.
+ {<AI95-00363-01AI95-00363-01>} This does not require that
+ types have a partial view in order to allow an access
+ attribute of an unconstrained discriminated object, only that
+ any partial view that does exist is unconstrained.
28.a.3/4
- Discussion: {AI12-0095-1AI12-0095-1} We assume the worst in a
- generic body whether or not a formal subtype has a constrained
- partial view; specifically, in a generic body a discriminated
- subtype is considered to have a constrained partial view if it
- is a descendant of an untagged generic formal private or
- derived type (see *note 12.5.1:: for the formal definition of
- this rule).
+ Discussion: {<AI12-0095-1AI12-0095-1>} We assume the worst in
+ a generic body whether or not a formal subtype has a
+ constrained partial view; specifically, in a generic body a
+ discriminated subtype is considered to have a constrained
+ partial view if it is a descendant of an untagged generic
+ formal private or derived type (see *note 12.5.1:: for the
+ formal definition of this rule).
29/3
- * {AI05-0041-1AI05-0041-1} The accessibility level of
- the view shall not be statically deeper than that of
- the access type A.
+ * {<AI05-0041-1AI05-0041-1>} The accessibility level
+ of the view shall not be statically deeper than that
+ of the access type <A>.
29.a
Ramification: In an instance body, a run-time check applies.
29.b/2
- {AI95-00230-01AI95-00230-01} If A is an anonymous
+ {<AI95-00230-01AI95-00230-01>} If <A> is an anonymous
access-to-object type of an access parameter, then the view
- can never have a deeper accessibility level than A. The same
- is true for an anonymous access-to-object type of an access
- discriminant, except when X'Access is used to initialize an
- access discriminant of an object created by an allocator. The
- latter case is illegal if the accessibility level of X is
- statically deeper than that of the access type of the
- allocator; a run-time check is needed in the case where the
- initial value comes from an access parameter. Other anonymous
- access-to-object types have "normal" accessibility checks.
+ can never have a deeper accessibility level than <A>. The
+ same is true for an anonymous access-to-object type of an
+ access discriminant, except when X'Access is used to
+ initialize an access discriminant of an object created by an
+ allocator. The latter case is illegal if the accessibility
+ level of X is statically deeper than that of the access type
+ of the allocator; a run-time check is needed in the case where
+ the initial value comes from an access parameter. Other
+ anonymous access-to-object types have "normal" accessibility
+ checks.
29.1/3
- {AI05-0041-1AI05-0041-1} In addition to the places where
- Legality Rules normally apply (see *note 12.3::), these
- requirements apply also in the private part of an
+ {<AI05-0041-1AI05-0041-1>} In addition to the places
+ where Legality Rules normally apply (see *note 12.3::),
+ these requirements apply also in the private part of an
instance of a generic unit.
30
A check is made that the accessibility level of X is not
- deeper than that of the access type A. If this check
+ deeper than that of the access type <A>. If this check
fails, Program_Error is raised.
30.a/2
@@ -19472,7 +19527,7 @@ X'Access
access-to-object type and in instance bodies.
30.a.1/3
- {AI05-0024-1AI05-0024-1} Because there are no access
+ {<AI05-0024-1AI05-0024-1>} Because there are no access
parameters permitted for task entries, the accessibility
levels are always comparable. We would have to switch to the
terminology used in *note 4.8:: and *note 6.5:: based on
@@ -19480,7 +19535,7 @@ X'Access
might introduce unacceptable distributed overhead.
30.b/3
- Implementation Note: {AI05-0148-1AI05-0148-1} This check
+ Implementation Note: {<AI05-0148-1AI05-0148-1>} This check
requires that some indication of lifetime is passed as an
implicit parameter along with access parameters of an
access-to-object type. A similar indication is required for
@@ -19491,7 +19546,7 @@ X'Access
31
If the nominal subtype of X does not statically match the
- designated subtype of A, a view conversion of X to the
+ designated subtype of <A>, a view conversion of X to the
designated subtype is evaluated (which might raise
Constraint_Error -- see *note 4.6::) and the value of
X'Access designates that view.
@@ -19502,27 +19557,28 @@ subprogram:
33/3
P'Access
- {AI95-00229-01AI95-00229-01} {AI95-00254-01AI95-00254-01}
- {AI05-0239-1AI05-0239-1} P'Access yields an access value
- that designates the subprogram denoted by P. The type of
- P'Access is an access-to-subprogram type (S), as
- determined by the expected type. The accessibility level
- of P shall not be statically deeper than that of S. In
- addition to the places where Legality Rules normally
- apply (see *note 12.3::), this rule applies also in the
- private part of an instance of a generic unit. The
- profile of P shall be subtype conformant with the
- designated profile of S, and shall not be Intrinsic. If
- the subprogram denoted by P is declared within a generic
- unit, and the expression P'Access occurs within the body
- of that generic unit or within the body of a generic unit
- declared within the declarative region of the generic
- unit, then the ultimate ancestor of S shall be either a
- nonformal type declared within the generic unit or an
- anonymous access type of an access parameter.
+ {<AI95-00229-01AI95-00229-01>}
+ {<AI95-00254-01AI95-00254-01>} {<AI05-0239-1AI05-0239-1>}
+ P'Access yields an access value that designates the
+ subprogram denoted by P. The type of P'Access is an
+ access-to-subprogram type (<S>), as determined by the
+ expected type. The accessibility level of P shall not be
+ statically deeper than that of <S>. In addition to the
+ places where Legality Rules normally apply (see *note
+ 12.3::), this rule applies also in the private part of an
+ instance of a generic unit. The profile of P shall be
+ subtype conformant with the designated profile of <S>,
+ and shall not be Intrinsic. If the subprogram denoted by
+ P is declared within a generic unit, and the expression
+ P'Access occurs within the body of that generic unit or
+ within the body of a generic unit declared within the
+ declarative region of the generic unit, then the ultimate
+ ancestor of <S> shall be either a nonformal type declared
+ within the generic unit or an anonymous access type of an
+ access parameter.
33.a/2
- Discussion: {AI95-00229-01AI95-00229-01} The part about
+ Discussion: {<AI95-00229-01AI95-00229-01>} The part about
generic bodies is worded in terms of the denoted subprogram,
not the denoted view; this implies that renaming is invisible
to this part of the rule. "Declared within the declarative
@@ -19539,15 +19595,15 @@ P'Access
conformant. This rule specifies that subtype conformance is
required (which also requires matching calling conventions).
P cannot denote an entry because access-to-subprogram types
- never have the entry calling convention. P cannot denote an
+ never have the <entry> calling convention. P cannot denote an
enumeration literal or an attribute function because these
have intrinsic calling conventions.
_Legality Rules_
33.1/3
-{AI05-0188-1AI05-0188-1} An expression is said to have distributed
-accessibility if it is
+{<AI05-0188-1AI05-0188-1>} An expression is said to have <distributed
+accessibility> if it is
33.2/3
* a conditional_expression (see *note 4.5.7::); or
@@ -19557,17 +19613,17 @@ accessibility if it is
expression whose operand has distributed accessibility.
33.4/3
-{AI05-0188-1AI05-0188-1} The statically deeper relationship does not
+{<AI05-0188-1AI05-0188-1>} The statically deeper relationship does not
apply to the accessibility level of an expression having distributed
accessibility; that is, such an accessibility level is not considered to
be statically deeper, nor statically shallower, than any other.
33.5/3
-{AI05-0188-1AI05-0188-1} Any static accessibility requirement that is
+{<AI05-0188-1AI05-0188-1>} Any static accessibility requirement that is
imposed on an expression that has distributed accessibility (or on its
-type) is instead imposed on the dependent_expressions of the underlying
-conditional_expression. This rule is applied recursively if a
-dependent_expression also has distributed accessibility.
+type) is instead imposed on the <dependent_>expressions of the
+underlying conditional_expression. This rule is applied recursively if
+a <dependent_>expression also has distributed accessibility.
33.c/3
Discussion: This means that any Legality Rule requiring that
@@ -19575,7 +19631,8 @@ dependent_expression also has distributed accessibility.
of an expression) shall or shall not be statically deeper than
some other level also applies, in the case where the
expression has distributed accessibility, to each
- dependent_expression of the underlying conditional_expression.
+ <dependent_>expression of the underlying
+ conditional_expression.
NOTES
@@ -19589,18 +19646,18 @@ dependent_expression also has distributed
accessibility.
at all (see *note 4.2::).
35/2
- 92 {AI95-00230-01AI95-00230-01} The predefined operations of an
+ 92 {<AI95-00230-01AI95-00230-01>} The predefined operations of an
access type also include the assignment operation, qualification,
and membership tests. Explicit conversion is allowed between
general access types with matching designated subtypes; explicit
conversion is allowed between access-to-subprogram types with
- subtype conformant profiles (see *note 4.6::). Named access types
+ subtype conformant profiles (see *note 4.6::). Named access types
have predefined equality operators; anonymous access types do not,
but they can use the predefined equality operators for
- universal_access (see *note 4.5.2::).
+ <universal_access> (see *note 4.5.2::).
35.a/2
- Reason: {AI95-00230-01AI95-00230-01} Anonymous access types
+ Reason: {<AI95-00230-01AI95-00230-01>} Anonymous access types
can use the universal access equality operators declared in
Standard, while named access types cannot for compatibility
reasons. By not having equality operators for anonymous
@@ -19624,7 +19681,7 @@ dependent_expression also has distributed accessibility.
Proof: See *note 3.9.2::.
38/2
- 95 {AI95-00254-01AI95-00254-01} The Access attribute for
+ 95 {<AI95-00254-01AI95-00254-01>} The Access attribute for
subprograms and parameters of an anonymous access-to-subprogram
type may together be used to implement "downward closures" -- that
is, to pass a more-nested subprogram as a parameter to a
@@ -19656,10 +19713,10 @@ dependent_expression also has distributed
accessibility.
_Examples_
41
-Example of use of the Access attribute:
+<Example of use of the Access attribute:>
42
- Martha : Person_Name := new Person(F); -- see *note 3.10.1::
+ Martha : Person_Name := new Person(F); --< see *note 3.10.1::>
Cars : array (1..2) of aliased Car;
...
Martha.Vehicle := Cars(1)'Access;
@@ -19678,7 +19735,7 @@ Example of use of the Access attribute:
_Incompatibilities With Ada 95_
42.b/2
- {AI95-00363-01AI95-00363-01} Aliased variables are not
+ {<AI95-00363-01AI95-00363-01>} Aliased variables are not
necessarily constrained in Ada 2005 (see *note 3.6::).
Therefore, a subcomponent of an aliased variable may disappear
or change shape, and taking 'Access of such a subcomponent
@@ -19701,23 +19758,23 @@ Example of use of the Access attribute:
42.d/2
A_T : aliased T1;
- Ptr : Acc_Int := A_T.C1'Access; -- Illegal in Ada 2005, legal
in Ada 95
- A_T := (D1 => True); -- Raised Constraint_Error in
Ada 95, but does not
- -- in Ada 2005, so Ptr would
become invalid when this
- -- is assigned (thus Ptr is
illegal).
+ Ptr : Acc_Int := A_T.C1'Access; -- <Illegal in Ada 2005, legal
in Ada 95>
+ A_T := (D1 => True); -- <Raised Constraint_Error in
Ada 95, but does not>
+ -- <in Ada 2005, so Ptr would
become invalid when this>
+ -- <is assigned (thus Ptr is
illegal).>
42.e/2
- {AI95-00363-01AI95-00363-01} If a discriminated full type has
- a partial view (private type) that is constrained, we do not
- allow 'Access on objects to create a value of an object of an
- access-to-unconstrained type. Ada 95 allowed this attribute
- and various access subtypes, requiring that the heap object be
- constrained and thus making details of the implementation of
- the private type visible to the client of the private type.
- See *note 4.8:: for more on this topic.
+ {<AI95-00363-01AI95-00363-01>} If a discriminated full type
+ has a partial view (private type) that is constrained, we do
+ not allow 'Access on objects to create a value of an object of
+ an access-to-unconstrained type. Ada 95 allowed this
+ attribute and various access subtypes, requiring that the heap
+ object be constrained and thus making details of the
+ implementation of the private type visible to the client of
+ the private type. See *note 4.8:: for more on this topic.
42.f/2
- {AI95-00229-01AI95-00229-01} {AI95-00254-01AI95-00254-01}
+ {<AI95-00229-01AI95-00229-01>} {<AI95-00254-01AI95-00254-01>}
Amendment Correction: Taking 'Access of a subprogram declared
in a generic unit in the body of that generic is no longer
allowed. Such references can easily be used to create
@@ -19733,14 +19790,14 @@ Example of use of the Access attribute:
_Extensions to Ada 95_
42.g/2
- {8652/00108652/0010} {AI95-00127-01AI95-00127-01} Corrigendum:
- Access attributes of objects of class-wide types can be used
- as the controlling parameter in a dispatching calls (see *note
- 3.9.2::). This was an oversight in Ada 95.
+ {<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
+ Corrigendum: Access attributes of objects of class-wide types
+ can be used as the controlling parameter in a dispatching
+ calls (see *note 3.9.2::). This was an oversight in Ada 95.
42.h/2
- {AI95-00235-01AI95-00235-01} Amendment Correction: The type of
- the prefix can now be used in resolving Access attributes.
+ {<AI95-00235-01AI95-00235-01>} Amendment Correction: The type
+ of the prefix can now be used in resolving Access attributes.
This allows more uses of the Access attribute to resolve. For
example:
@@ -19756,8 +19813,8 @@ Example of use of the Access attribute:
Value : aliased Integer := 10;
42.l/2
- Result1 : Float := Zap (Value'access); -- Ambiguous in Ada 95;
resolves in Ada 2005.
- Result2 : Float := Zap (Int_Ptr'(Value'access)); -- Resolves in
Ada 95 and Ada 2005.
+ Result1 : Float := Zap (Value'access); -- <Ambiguous in Ada 95;
resolves in Ada 2005.>
+ Result2 : Float := Zap (Int_Ptr'(Value'access)); -- <Resolves
in Ada 95 and Ada 2005.>
42.m/2
This change is upward compatible; any expression that does not
@@ -19766,19 +19823,19 @@ Example of use of the Access attribute:
_Wording Changes from Ada 95_
42.n/2
- {AI95-00162-01AI95-00162-01} Adjusted the wording to reflect
+ {<AI95-00162-01AI95-00162-01>} Adjusted the wording to reflect
the fact that expressions and function calls are masters.
42.o/2
- {AI95-00230-01AI95-00230-01} {AI95-00254-01AI95-00254-01}
- {AI95-00318-02AI95-00318-02} {AI95-00385-01AI95-00385-01}
- {AI95-00416-01AI95-00416-01} Defined the accessibility of the
- various new kinds and uses of anonymous access types.
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00318-02AI95-00318-02>} {<AI95-00385-01AI95-00385-01>}
+ {<AI95-00416-01AI95-00416-01>} Defined the accessibility of
+ the various new kinds and uses of anonymous access types.
_Incompatibilities With Ada 2005_
42.p/3
- {AI05-0008-1AI05-0008-1} Correction: Simplified the
+ {<AI05-0008-1AI05-0008-1>} Correction: Simplified the
description of when a discriminant-dependent component is
allowed as the prefix of 'Access to when the object is known
to be constrained. This fixes a confusion as to whether a
@@ -19791,9 +19848,9 @@ Example of use of the Access attribute:
constrained.
42.q/3
- {AI05-0041-1AI05-0041-1} Correction: Corrected the checks for
- the constrainedness of the prefix of the Access attribute so
- that assume-the-worst is used in generic bodies. This may
+ {<AI05-0041-1AI05-0041-1>} Correction: Corrected the checks
+ for the constrainedness of the prefix of the Access attribute
+ so that assume-the-worst is used in generic bodies. This may
make some programs illegal, but those programs were at risk
having objects disappear while valid access values still
pointed at them.
@@ -19801,63 +19858,64 @@ Example of use of the Access attribute:
_Extensions to Ada 2005_
42.r/3
- {AI05-0082-1AI05-0082-1} Correction: Eliminated the static
+ {<AI05-0082-1AI05-0082-1>} Correction: Eliminated the static
accessibility definition for generic formal types, as the
actual can be more or less nested than the generic itself.
This allows programs that were illegal for Ada 95 and for Ada
2005.
42.s/3
- {AI05-0148-1AI05-0148-1} {AI05-0253-1AI05-0253-1} Eliminate
- the static accessibility definition for stand-alone objects of
- anonymous access-to-object types. This allows such objects to
- be used as temporaries without causing accessibility problems.
+ {<AI05-0148-1AI05-0148-1>} {<AI05-0253-1AI05-0253-1>}
+ Eliminate the static accessibility definition for stand-alone
+ objects of anonymous access-to-object types. This allows such
+ objects to be used as temporaries without causing
+ accessibility problems.
_Wording Changes from Ada 2005_
42.t/3
- {AI05-0014-1AI05-0014-1} Correction: Corrected the rules so
+ {<AI05-0014-1AI05-0014-1>} Correction: Corrected the rules so
that the accessibility of the object designated by an access
object is that of the access type, even when no dereference is
given. The accessibility was not specified in the past. This
correction applies to both Ada 95 and Ada 2005.
42.u/3
- {AI05-0024-1AI05-0024-1} Correction: Corrected accessibility
+ {<AI05-0024-1AI05-0024-1>} Correction: Corrected accessibility
rules for access discriminants so that no cases are omitted.
42.v/3
- {AI05-0051-1AI05-0051-1} {AI05-0234-1AI05-0234-1}
- {AI05-0235-1AI05-0235-1} {AI05-0284-1AI05-0284-1} Correction:
- Corrected accessibility rules for anonymous access return
- types and access discriminants in return statements.
+ {<AI05-0051-1AI05-0051-1>} {<AI05-0234-1AI05-0234-1>}
+ {<AI05-0235-1AI05-0235-1>} {<AI05-0284-1AI05-0284-1>}
+ Correction: Corrected accessibility rules for anonymous access
+ return types and access discriminants in return statements.
42.w/3
- {AI05-0066-1AI05-0066-1} Correction: Changed coextension rules
- so that coextensions that belong to an anonymous object are
- transfered to the ultimate object.
+ {<AI05-0066-1AI05-0066-1>} Correction: Changed coextension
+ rules so that coextensions that belong to an anonymous object
+ are transfered to the ultimate object.
42.x/3
- {AI05-0142-4AI05-0142-4} {AI05-0188-1AI05-0188-1}
- {AI05-0235-1AI05-0235-1} Defined the accessibility of
+ {<AI05-0142-4AI05-0142-4>} {<AI05-0188-1AI05-0188-1>}
+ {<AI05-0235-1AI05-0235-1>} Defined the accessibility of
explicitly aliased parameters (see *note 6.1::) and
conditional_expressions (see *note 4.5.7::).
42.y/3
- {AI05-0234-1AI05-0234-1} Correction: Defined the term "master
- of the call" to simplify other wording, especially that for
- the accessibility checks associated with return statements and
- explicitly aliased parameters.
+ {<AI05-0234-1AI05-0234-1>} Correction: Defined the term
+ "master of the call" to simplify other wording, especially
+ that for the accessibility checks associated with return
+ statements and explicitly aliased parameters.
42.z/3
- {AI05-0270-1AI05-0270-1} Correction: Defined the (omitted)
+ {<AI05-0270-1AI05-0270-1>} Correction: Defined the (omitted)
accessibility level of null values when those are passed as
the actual of an access-to-object parameter.
_Incompatibilities With Ada 2012_
42.aa/4
- {AI12-0027-1AI12-0027-1} Corrigendum: Defined the
+ {<AI12-0027-1AI12-0027-1>} Corrigendum: Defined the
accessibility of a value conversion, so that it is treated
like an aggregate built at the point of the conversion. This
was previously unspecified, so this change might be
@@ -19875,31 +19933,31 @@ Example of use of the Access attribute:
_Wording Changes from Ada 2012_
42.bb/4
- {AI12-0067-1AI12-0067-1} Corrigendum: Corrected so that it is
- clear that explicitly aliased parameters in procedures have
+ {<AI12-0067-1AI12-0067-1>} Corrigendum: Corrected so that it
+ is clear that explicitly aliased parameters in procedures have
the same accessibility as other parameters. Only explicitly
aliased parameters in functions are special.
42.cc/4
- {AI12-0070-1AI12-0070-1} Corrigendum: The accessibility of an
- anonymous access type of an extended_return_statement is
+ {<AI12-0070-1AI12-0070-1>} Corrigendum: The accessibility of
+ an anonymous access type of an extended_return_statement is
defined here rather than in *note 6.5:: so that all
accessibility rules are here.
42.dd/4
- {AI12-0089-1AI12-0089-1} Corrigendum: Corrected a number of
+ {<AI12-0089-1AI12-0089-1>} Corrigendum: Corrected a number of
rules so that they clearly apply to generic functions as well
as functions. (Remember, a generic function is not a
function.)
42.ee/4
- {AI12-0095-1AI12-0095-1} Corrigendum: Moved the assume the
+ {<AI12-0095-1AI12-0095-1>} Corrigendum: Moved the assume the
worst rule about constrainedness of the prefix of attribute
Access to *note 12.5.1::, as a number of places in the
Standard need this rule.
42.ff/4
- {AI12-0157-1AI12-0157-1} Corrigendum: Ensured that the
+ {<AI12-0157-1AI12-0157-1>} Corrigendum: Ensured that the
statically deeper relationship applies within the return
expression of an expression function. (Dynamic properties
apply by equivalence, but static properties are handled
@@ -19924,7 +19982,7 @@ File: aarm2012.info, Node: 3.11, Prev: 3.10, Up: 3
basic_declarative_item | body
4/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
basic_declarative_item ::=
basic_declaration | aspect_clause | use_clause
@@ -19938,8 +19996,9 @@ File: aarm2012.info, Node: 3.11, Prev: 3.10, Up: 3
_Static Semantics_
6.1/2
-{AI95-00420-01AI95-00420-01} The list of declarative_items of a
-declarative_part is called the declaration list of the declarative_part.
+{<AI95-00420-01AI95-00420-01>} The list of declarative_items of a
+declarative_part is called the <declaration list> of the
+declarative_part.
_Dynamic Semantics_
@@ -19949,8 +20008,9 @@ declarative_items, if any, in the order in which they
are given in the
declarative_part.
8
-An elaborable construct is in the elaborated state after the normal
-completion of its elaboration. Prior to that, it is not yet elaborated.
+An elaborable construct is in the <elaborated> state after the normal
+completion of its elaboration. Prior to that, it is <not yet
+elaborated>.
8.a
Ramification: The elaborated state is only important for
@@ -19971,8 +20031,8 @@ For a construct that attempts to use a body, a check
(Elaboration_Check)
is performed, as follows:
10/1
- * {8652/00148652/0014} {AI95-00064-01AI95-00064-01} For a call to a
- (non-protected) subprogram that has an explicit body, a check is
+ * {<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>} For a call to
+ a (non-protected) subprogram that has an explicit body, a check is
made that the body is already elaborated. This check and the
evaluations of any actual parameters of the call are done in an
arbitrary order.
@@ -19987,15 +20047,15 @@ is performed, as follows:
applies to generic instantiation as well (see below).
10.a.1/3
- {8652/00148652/0014} {AI95-00064-01AI95-00064-01}
- {AI05-0177-1AI05-0177-1} A subprogram can be completed by a
+ {<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>}
+ {<AI05-0177-1AI05-0177-1>} A subprogram can be completed by a
renaming-as-body, a null_procedure_declaration, or an
expression_function_declaration, and we need to make an
elaboration check on such a body, so we use "body" rather than
subprogram_body above.
11/3
- * {AI05-0229-1AI05-0229-1} For a call to a protected operation of a
+ * {<AI05-0229-1AI05-0229-1>} For a call to a protected operation of a
protected type (that has a body -- no check is performed if the
protected type is imported -- see *note B.1::), a check is made
that the protected_body is already elaborated. This check and the
@@ -20048,7 +20108,7 @@ The exception Program_Error is raised if any of these
checks fails.
_Extensions to Ada 83_
14.a/2
- {AI95-00114-01AI95-00114-01} The syntax for declarative_part
+ {<AI95-00114-01AI95-00114-01>} The syntax for declarative_part
is modified to remove the ordering restrictions of Ada 83;
that is, the distinction between basic_declarative_items and
later_declarative_items within declarative_parts is removed.
@@ -20087,17 +20147,18 @@ The exception Program_Error is raised if any of these
checks fails.
_Wording Changes from Ada 95_
14.f/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Changed representation clauses to aspect clauses to reflect
- that they are used for more than just representation.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Changed representation clauses to aspect clauses
+ to reflect that they are used for more than just
+ representation.
14.g/2
- {8652/00148652/0014} {AI95-00064-01AI95-00064-01} Corrigendum:
- Clarified that the elaboration check applies to all kinds of
- subprogram bodies.
+ {<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>}
+ Corrigendum: Clarified that the elaboration check applies to
+ all kinds of subprogram bodies.
14.h/2
- {AI95-00420-01AI95-00420-01} Defined "declaration list" to
+ {<AI95-00420-01AI95-00420-01>} Defined "declaration list" to
avoid confusion for various rules. Other kinds of declaration
list are defined elsewhere.
@@ -20112,12 +20173,12 @@ File: aarm2012.info, Node: 3.11.1, Up: 3.11
----------------------------------
1/3
-{8652/00148652/0014} {AI95-00064-01AI95-00064-01}
-{AI05-0177-1AI05-0177-1} Declarations sometimes come in two parts. A
-declaration that requires a second part is said to require completion.
-The second part is called the completion of the declaration (and of the
-entity declared), and is either another declaration, a body, or a
-pragma. A body is a body, an entry_body, a null_procedure_declaration
+{<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>}
+{<AI05-0177-1AI05-0177-1>} Declarations sometimes come in two parts. A
+declaration that requires a second part is said to <require completion>.
+The second part is called the <completion> of the declaration (and of
+the entity declared), and is either another declaration, a body, or a
+pragma. A <body> is a body, an entry_body, a null_procedure_declaration
or an expression_function_declaration that completes another
declaration, or a renaming-as-body (see *note 8.5.4::).
@@ -20147,16 +20208,16 @@ declaration, or a renaming-as-body (see *note
8.5.4::).
Note that the declaration of a private type (if limited) can
be completed with the declaration of a task type, which is
then completed with a body. Thus, a declaration can actually
- come in three parts.
+ come in <three> parts.
1.h/3
- {AI95-00217-06AI95-00217-06} {AI05-0162-1AI05-0162-1} An
+ {<AI95-00217-06AI95-00217-06>} {<AI05-0162-1AI05-0162-1>} An
incomplete type (whether declared in the limited view of a
package or not) may be completed by a private type
- declaration, so we can in fact have four parts.
+ declaration, so we can in fact have <four> parts.
1.i/3
- {AI05-0229-1AI05-0229-1} In Ada 2012, there are no
+ {<AI05-0229-1AI05-0229-1>} In Ada 2012, there are no
language-defined pragmas that act as completions. Pragma
Import (which is obsolescent) has the effect of setting aspect
Import to True; such an aspect makes giving a completion
@@ -20181,34 +20242,34 @@ a prior declaration only if:
5
* If the declaration is overloadable, then the completion either has
- a type-conformant profile, or is a pragma.
+ a type-conformant profile, or is a pragma.
_Legality Rules_
6/3
-{AI05-0229-1AI05-0229-1} An implicit declaration shall not have a
-completion. For any explicit declaration that is specified to require
-completion, there shall be a corresponding explicit completion, unless
+{<AI05-0229-1AI05-0229-1>} An implicit declaration shall not have a
+completion. For any explicit declaration that is specified to <require
+completion>, there shall be a corresponding explicit completion, unless
the declared entity is imported (see *note B.1::).
6.a.1/2
- To be honest: {AI95-00217-06AI95-00217-06} The implicit
+ To be honest: {<AI95-00217-06AI95-00217-06>} The implicit
declarations occurring in a limited view do have a completion
(the explicit declaration occurring in the full view) but
that's a special case, since the implicit declarations are
- actually built from the explicit ones. So they do not require
- a completion, they have one by fiat.
+ actually built from the explicit ones. So they do not
+ <require> a completion, they have one by <fiat>.
6.a/3
- Discussion: {AI05-0299-1AI05-0299-1} The implicit declarations
- of predefined operators are not allowed to have a completion.
- Enumeration literals, although they are subprograms, are not
- allowed to have a corresponding subprogram_body. That's
- because the completion rules are described in terms of
- constructs (subprogram_declarations) and not entities
- (subprograms). When a completion is required, it has to be
- explicit; the implicit null package_body that Clause *note 7::
- talks about cannot serve as the completion of a
+ Discussion: {<AI05-0299-1AI05-0299-1>} The implicit
+ declarations of predefined operators are not allowed to have a
+ completion. Enumeration literals, although they are
+ subprograms, are not allowed to have a corresponding
+ subprogram_body. That's because the completion rules are
+ described in terms of constructs (subprogram_declarations) and
+ not entities (subprograms). When a completion is required, it
+ has to be explicit; the implicit null package_body that Clause
+ *note 7:: talks about cannot serve as the completion of a
package_declaration if a completion is required.
7
@@ -20221,13 +20282,13 @@ defined.
7.b
If the completion of a declaration is also a declaration, then
- that declaration might have a completion, too. For example, a
- limited private type can be completed with a task type, which
- can then be completed with a task body. This is not a
+ <that> declaration might have a completion, too. For example,
+ a limited private type can be completed with a task type,
+ which can then be completed with a task body. This is not a
violation of the "at most one completion" rule.
8
-A type is completely defined at a place that is after its full type
+A type is <completely defined> at a place that is after its full type
definition (if it has one) and after all of its subcomponent types are
completely defined. A type shall be completely defined before it is
frozen (see *note 13.14:: and *note 7.3::).
@@ -20240,14 +20301,14 @@ frozen (see *note 13.14:: and *note 7.3::).
NOTES
9/3
- 98 {AI05-0229-1AI05-0229-1} Completions are in principle allowed
+ 98 {<AI05-0229-1AI05-0229-1>} Completions are in principle allowed
for any kind of explicit declaration. However, for some kinds of
declaration, the only allowed completion is an
implementation-defined pragma, and implementations are not required
to have any such pragmas.
9.a/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
10
99 There are rules that prevent premature uses of declarations
@@ -20270,15 +20331,16 @@ frozen (see *note 13.14:: and *note 7.3::).
_Wording Changes from Ada 95_
10.b/2
- {8652/00148652/0014} {AI95-00064-01AI95-00064-01} Corrigendum:
- Added a definition of body, which is different than body or
- body.
+ {<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>}
+ Corrigendum: Added a definition of <body>, which is different
+ than body or body.
_Wording Changes from Ada 2005_
10.c/3
- {AI95-0177-1AI95-0177-1} Added null procedures and expression
- functions that are completions to the definition of body.
+ {<AI95-0177-1AI95-0177-1>} Added null procedures and
+ expression functions that are completions to the definition of
+ <body>.
File: aarm2012.info, Node: 4, Next: 5, Prev: 3, Up: Top
@@ -20287,8 +20349,9 @@ File: aarm2012.info, Node: 4, Next: 5, Prev: 3, Up:
Top
***********************
1/3
-{AI05-0299-1AI05-0299-1} [The rules applicable to the different forms of
-name and expression, and to their evaluation, are given in this clause.]
+{<AI05-0299-1AI05-0299-1>} [The rules applicable to the different forms
+of name and expression, and to their evaluation, are given in this
+clause.]
* Menu:
@@ -20320,7 +20383,7 @@ foregoing.]
_Syntax_
2/3
- {AI05-0003-1AI05-0003-1} {AI05-0139-2AI05-0139-2} name ::=
+ {<AI05-0003-1AI05-0003-1>} {<AI05-0139-2AI05-0139-2>} name ::=
direct_name | explicit_dereference
| indexed_component | slice
| selected_component | attribute_reference
@@ -20332,10 +20395,10 @@ foregoing.]
direct_name ::= identifier | operator_symbol
3.a/2
- Discussion: {AI95-00114-01AI95-00114-01} character_literal is
- no longer a direct_name. character_literals are usable even
- when the corresponding enumeration type declaration is not
- visible. See *note 4.2::.
+ Discussion: {<AI95-00114-01AI95-00114-01>} character_literal
+ is no longer a direct_name. character_literals are usable
+ even when the corresponding enumeration type declaration is
+ not visible. See *note 4.2::.
4
prefix ::= name | implicit_dereference
@@ -20347,7 +20410,7 @@ foregoing.]
implicit_dereference ::= name
7/3
-{AI05-0004-1AI05-0004-1} [Certain forms of name (indexed_components,
+{<AI05-0004-1AI05-0004-1>} [Certain forms of name (indexed_components,
selected_components, slices, and attribute_references) include a prefix
that is either itself a name that denotes some related entity, or an
implicit_dereference of an access value that designates some related
@@ -20356,21 +20419,21 @@ entity.]
_Name Resolution Rules_
8
-The name in a dereference (either an implicit_dereference or an
+The name in a <dereference> (either an implicit_dereference or an
explicit_dereference) is expected to be of any access type.
_Static Semantics_
9/3
-{AI05-0008-1AI05-0008-1} If the type of the name in a dereference is
-some access-to-object type T, then the dereference denotes a view of an
-object, the nominal subtype of the view being the designated subtype of
-T. If the designated subtype has unconstrained discriminants, the
-(actual) subtype of the view is constrained by the values of the
-discriminants of the designated object, except when there is a partial
-view of the type of the designated subtype that does not have
-discriminants, in which case the dereference is not constrained by its
-discriminant values.
+{<AI05-0008-1AI05-0008-1>} If the type of the name in a dereference is
+some access-to-object type <T>, then the dereference denotes a view of
+an object, the <nominal subtype> of the view being the designated
+subtype of <T>. If the designated subtype has unconstrained
+discriminants, the (actual) subtype of the view is constrained by the
+values of the discriminants of the designated object, except when there
+is a partial view of the type of the designated subtype that does not
+have discriminants, in which case the dereference is not constrained by
+its discriminant values.
9.a
Ramification: If the value of the name is the result of an
@@ -20387,7 +20450,7 @@ discriminant values.
mean the same thing.
9.c/3
- Reason: {AI05-0008-1AI05-0008-1} The last sentence was not
+ Reason: {<AI05-0008-1AI05-0008-1>} The last sentence was not
present in Ada 95; it is necessary in Ada 2005 because general
access types can designate unconstrained objects, which was
not possible in Ada 95. Thus, the rules that had this effect
@@ -20395,22 +20458,22 @@ discriminant values.
don't work in Ada 2005 and we have to say this explicitly.
9.d/3
- {AI05-0008-1AI05-0008-1} The "except" part of the last
+ {<AI05-0008-1AI05-0008-1>} The "except" part of the last
sentence prevents privacy "breaking", so that if a private
type has discriminants only in the full view, they don't
interfere with freely interassigning values between objects of
the type, even when the objects live in the heap.
9.e/3
- Implementation Note: {AI05-0008-1AI05-0008-1} Since we don't
+ Implementation Note: {<AI05-0008-1AI05-0008-1>} Since we don't
depend on whether the designated object is constrained, it is
not necessary to include a constrained bit in every object
that could be designated by a general access type.
10
If the type of the name in a dereference is some access-to-subprogram
-type S, then the dereference denotes a view of a subprogram, the profile
-of the view being the designated profile of S.
+type <S>, then the dereference denotes a view of a subprogram, the
+<profile> of the view being the designated profile of <S>.
10.a
Ramification: This means that the formal parameter names and
@@ -20423,46 +20486,46 @@ of the view being the designated profile of S.
_Dynamic Semantics_
11/2
-{AI95-00415-01AI95-00415-01} The evaluation of a name determines the
+{<AI95-00415-01AI95-00415-01>} The evaluation of a name determines the
entity denoted by the name. This evaluation has no other effect for a
name that is a direct_name or a character_literal.
12
[The evaluation of a name that has a prefix includes the evaluation of
-the prefix.] The evaluation of a prefix consists of the evaluation of
+the prefix.] The evaluation of a prefix consists of the evaluation of
the name or the implicit_dereference. The prefix denotes the entity
denoted by the name or the implicit_dereference.
13
The evaluation of a dereference consists of the evaluation of the name
and the determination of the object or subprogram that is designated by
-the value of the name. A check is made that the value of the name is not
-the null access value. Constraint_Error is raised if this check fails.
-The dereference denotes the object or subprogram designated by the value
-of the name.
+the value of the name. A check is made that the value of the name is
+not the null access value. Constraint_Error is raised if this check
+fails. The dereference denotes the object or subprogram designated by
+the value of the name.
_Examples_
14
-Examples of direct names:
+<Examples of direct names:>
15
- Pi -- the direct name of a number (see *note 3.3.2::)
- Limit -- the direct name of a constant (see *note 3.3.1::)
- Count -- the direct name of a scalar variable (see *note 3.3.1::)
- Board -- the direct name of an array variable (see *note 3.6.1::)
- Matrix -- the direct name of a type (see *note 3.6::)
- Random -- the direct name of a function (see *note 6.1::)
- Error -- the direct name of an exception (see *note 11.1::)
+ Pi <-- the direct name of a number> (see *note 3.3.2::)
+ Limit <-- the direct name of a constant> (see *note 3.3.1::)
+ Count <-- the direct name of a scalar variable> (see *note 3.3.1::)
+ Board <-- the direct name of an array variable> (see *note 3.6.1::)
+ Matrix <-- the direct name of a type> (see *note 3.6::)
+ Random <-- the direct name of a function> (see *note 6.1::)
+ Error <-- the direct name of an exception> (see *note 11.1::)
16
-Examples of dereferences:
+<Examples of dereferences:>
17
- Next_Car.all -- explicit dereference denoting the object designated by
- -- the access variable Next_Car (see *note 3.10.1::)
- Next_Car.Owner -- selected component with implicit dereference;
- -- same as Next_Car.all.Owner
+ Next_Car.all --< explicit dereference denoting the object designated
by>
+ --< the access variable Next_Car (see *note 3.10.1::)>
+ Next_Car.Owner --< selected component with implicit dereference;>
+ --< same as Next_Car.all.Owner>
_Extensions to Ada 83_
@@ -20493,7 +20556,7 @@ Examples of dereferences:
_Wording Changes from Ada 83_
17.c/2
- {AI95-00114-01AI95-00114-01} Everything of the general
+ {<AI95-00114-01AI95-00114-01>} Everything of the general
syntactic form name(...) is now syntactically a name. In any
realistic parser, this would be a necessity since
distinguishing among the various name(...) constructs
@@ -20540,17 +20603,17 @@ Examples of dereferences:
that would be a bit radical.
17.g
- We no longer use the term appropriate for a type since we now
- describe the semantics of a prefix in terms of implicit
+ We no longer use the term <appropriate for a type> since we
+ now describe the semantics of a prefix in terms of implicit
dereference.
_Extensions to Ada 2005_
17.h/3
- {AI05-0003-1AI05-0003-1} A qualified_expression is now a name
- denoting a constant view; this allows them to be used as a
- prefix and to be renamed as an object. They are often used to
- remove ambiguity from function calls, and there may be no
+ {<AI05-0003-1AI05-0003-1>} A qualified_expression is now a
+ name denoting a constant view; this allows them to be used as
+ a prefix and to be renamed as an object. They are often used
+ to remove ambiguity from function calls, and there may be no
other way to do that. Interestingly, a type_conversion of a
qualified_expression is already legal in these contexts, so
this change mainly reduces clutter by eliminating an otherwise
@@ -20559,14 +20622,14 @@ Examples of dereferences:
_Wording Changes from Ada 2005_
17.i/3
- {AI05-0008-1AI05-0008-1} Correction: Added a missing rule so
+ {<AI05-0008-1AI05-0008-1>} Correction: Added a missing rule so
that most dereferences are assumed constrained (without
determining whether the designated object is). This is just
confirming the Ada 95 rules; Ada 2005 failed to ensure that
this property was unchanged.
17.j/3
- {AI05-0139-2AI05-0139-2} {AI05-0299-1AI05-0299-1} Added
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0299-1AI05-0299-1>} Added
generalized_reference and generalized_indexing as types of
name; these are documented as extensions in the appropriate
subclauses.
@@ -20588,7 +20651,7 @@ File: aarm2012.info, Node: 4.1.1, Next: 4.1.2, Up:
4.1
1
[An indexed_component denotes either a component of an array or an entry
-in a family of entries. ]
+in a family of entries. ]
_Syntax_
@@ -20611,7 +20674,7 @@ The expected type for each expression is the
corresponding index type.
5
When the prefix denotes an array, the indexed_component denotes the
-component of the array with the specified index value(s). The nominal
+component of the array with the specified index value(s). The nominal
subtype of the indexed_component is the component subtype of the array
type.
@@ -20624,28 +20687,28 @@ the individual entry of the entry family with the
specified index value.
7
For the evaluation of an indexed_component, the prefix and the
expressions are evaluated in an arbitrary order. The value of each
-expression is converted to the corresponding index type. A check is made
-that each index value belongs to the corresponding index range of the
-array or entry family denoted by the prefix. Constraint_Error is raised
-if this check fails.
+expression is converted to the corresponding index type. A check is
+made that each index value belongs to the corresponding index range of
+the array or entry family denoted by the prefix. Constraint_Error is
+raised if this check fails.
_Examples_
8
-Examples of indexed components:
+<Examples of indexed components:>
9
- My_Schedule(Sat) -- a component of a one-dimensional array (see
*note 3.6.1::)
- Page(10) -- a component of a one-dimensional array (see
*note 3.6::)
- Board(M, J + 1) -- a component of a two-dimensional array (see
*note 3.6.1::)
- Page(10)(20) -- a component of a component (see *note 3.6::)
- Request(Medium) -- an entry in a family of entries (see *note
9.1::)
- Next_Frame(L)(M, N) -- a component of a function call (see *note
6.1::)
+ My_Schedule(Sat) --< a component of a one-dimensional array (see
*note 3.6.1::)>
+ Page(10) --< a component of a one-dimensional array (see
*note 3.6::)>
+ Board(M, J + 1) --< a component of a two-dimensional array (see
*note 3.6.1::)>
+ Page(10)(20) --< a component of a component (see *note
3.6::)>
+ Request(Medium) --< an entry in a family of entries (see *note
9.1::)>
+ Next_Frame(L)(M, N) --< a component of a function call (see *note
6.1::)>
NOTES
10
- 1 Notes on the examples: Distinct notations are used for
+ 1 <Notes on the examples:> Distinct notations are used for
components of multidimensional arrays (such as Board) and arrays of
arrays (such as Page). The components of an array of arrays are
arrays and can therefore be indexed. Thus Page(10)(20) denotes the
@@ -20695,10 +20758,10 @@ defined by the discrete_range.
7
For the evaluation of a slice, the prefix and the discrete_range are
-evaluated in an arbitrary order. If the slice is not a null slice (a
+evaluated in an arbitrary order. If the slice is not a <null slice> (a
slice where the discrete_range is a null range), then a check is made
that the bounds of the discrete_range belong to the index range of the
-array denoted by the prefix. Constraint_Error is raised if this check
+array denoted by the prefix. Constraint_Error is raised if this check
fails.
NOTES
@@ -20728,16 +20791,16 @@ fails.
_Examples_
10
-Examples of slices:
+<Examples of slices:>
11
- Stars(1 .. 15) -- a slice of 15 characters (see *note
3.6.3::)
- Page(10 .. 10 + Size) -- a slice of 1 + Size components (see *note
3.6::)
- Page(L)(A .. B) -- a slice of the array Page(L) (see *note
3.6::)
- Stars(1 .. 0) -- a null slice (see *note 3.6.3::)
- My_Schedule(Weekday) -- bounds given by subtype (see *note 3.6.1::
and *note 3.5.1::)
- Stars(5 .. 15)(K) -- same as Stars(K) (see *note 3.6.3::)
- -- provided that K is in 5 .. 15
+ Stars(1 .. 15) --< a slice of 15 characters (see *note
3.6.3::)>
+ Page(10 .. 10 + Size) --< a slice of 1 + Size components (see *note
3.6::)>
+ Page(L)(A .. B) --< a slice of the array Page(L) (see *note
3.6::)>
+ Stars(1 .. 0) --< a null slice (see *note 3.6.3::)>
+ My_Schedule(Weekday) --< bounds given by subtype (see *note
3.6.1:: and *note 3.5.1::)>
+ Stars(5 .. 15)(K) --< same as Stars(K) (see *note 3.6.3::)>
+ --< provided that K is in 5 .. 15>
File: aarm2012.info, Node: 4.1.3, Next: 4.1.4, Prev: 4.1.2, Up: 4.1
@@ -20748,7 +20811,7 @@ File: aarm2012.info, Node: 4.1.3, Next: 4.1.4, Prev:
4.1.2, Up: 4.1
1
[Selected_components are used to denote components (including
discriminants), entries, entry families, and protected subprograms; they
-are also used as expanded names as described below. ]
+are also used as expanded names as described below. ]
_Syntax_
@@ -20761,7 +20824,7 @@ are also used as expanded names as described below. ]
_Name Resolution Rules_
4
-A selected_component is called an expanded name if, according to the
+A selected_component is called an <expanded name> if, according to the
visibility rules, at least one possible interpretation of its prefix
denotes a package or an enclosing named construct (directly, not through
a subprogram_renaming_declaration or generic_renaming_declaration).
@@ -20792,13 +20855,13 @@ denote one of the following:
the corresponding component of the object or value.
7.a/3
- Reason: {AI05-0005-1AI05-0005-1} The components of a protected
- object cannot be named except by an expanded name, even from
- within the corresponding protected body. The protected body
- cannot reference the private components of some arbitrary
- object of the protected type; the protected body may reference
- components of the current instance only (by an expanded name
- or a direct_name).
+ Reason: {<AI05-0005-1AI05-0005-1>} The components of a
+ protected object cannot be named except by an expanded name,
+ even from within the corresponding protected body. The
+ protected body cannot reference the private components of some
+ arbitrary object of the protected type; the protected body may
+ reference components of the current instance only (by an
+ expanded name or a direct_name).
7.b
Ramification: Only the discriminants and components visible at
@@ -20825,34 +20888,34 @@ denote one of the following:
(and expanded name notation has to be used for that).
9.1/2
- * {AI95-00252-01AI95-00252-01} {AI95-00407-01AI95-00407-01} A view of
- a subprogram whose first formal parameter is of a tagged type or is
- an access parameter whose designated type is tagged:
+ * {<AI95-00252-01AI95-00252-01>} {<AI95-00407-01AI95-00407-01>} A
+ view of a subprogram whose first formal parameter is of a tagged
+ type or is an access parameter whose designated type is tagged:
9.2/3
- {AI95-00252-01AI95-00252-01} {AI95-00407-01AI95-00407-01}
- {AI05-0090-1AI05-0090-1} The prefix (after any implicit
+ {<AI95-00252-01AI95-00252-01>} {<AI95-00407-01AI95-00407-01>}
+ {<AI05-0090-1AI05-0090-1>} The prefix (after any implicit
dereference) shall resolve to denote an object or value of a
- specific tagged type T or class-wide type T'Class. The
+ specific tagged type <T> or class-wide type <T>'Class. The
selector_name shall resolve to denote a view of a subprogram
declared immediately within the declarative region in which an
- ancestor of the type T is declared. The first formal parameter of
- the subprogram shall be of type T, or a class-wide type that covers
- T, or an access parameter designating one of these types. The
- designator of the subprogram shall not be the same as that of a
+ ancestor of the type <T> is declared. The first formal parameter
+ of the subprogram shall be of type <T>, or a class-wide type that
+ covers <T>, or an access parameter designating one of these types.
+ The designator of the subprogram shall not be the same as that of a
component of the tagged type visible at the point of the
selected_component. The subprogram shall not be an implicitly
- declared primitive operation of type T that overrides an inherited
- subprogram implemented by an entry or protected subprogram visible
- at the point of the selected_component. The selected_component
- denotes a view of this subprogram that omits the first formal
- parameter. This view is called a prefixed view of the subprogram,
- and the prefix of the selected_component (after any implicit
- dereference) is called the prefix of the prefixed view.
+ declared primitive operation of type <T> that overrides an
+ inherited subprogram implemented by an entry or protected
+ subprogram visible at the point of the selected_component. The
+ selected_component denotes a view of this subprogram that omits the
+ first formal parameter. This view is called a <prefixed view> of
+ the subprogram, and the prefix of the selected_component (after any
+ implicit dereference) is called the <prefix> of the prefixed view.
9.b/3
- Discussion: {AI05-0090-1AI05-0090-1} The part of the rule that
- excludes a primitive overriding subprogram as a selector
+ Discussion: {<AI05-0090-1AI05-0090-1>} The part of the rule
+ that excludes a primitive overriding subprogram as a selector
applies only to the wrapper subprogram that is implicitly
declared to override a subprogram inherited from a
synchronized interface that is implemented by an operation of
@@ -20905,12 +20968,12 @@ immediately within a named declarative region, as
follows:
_Legality Rules_
13.1/2
-{AI95-00252-01AI95-00252-01} {AI95-00407-01AI95-00407-01} For a
+{<AI95-00252-01AI95-00252-01>} {<AI95-00407-01AI95-00407-01>} For a
subprogram whose first parameter is an access parameter, the prefix of
any prefixed view shall denote an aliased view of an object.
13.2/2
-{AI95-00407-01AI95-00407-01} For a subprogram whose first parameter is
+{<AI95-00407-01AI95-00407-01>} For a subprogram whose first parameter is
of mode in out or out, or of an anonymous access-to-variable type, the
prefix of any prefixed view shall denote a variable.
@@ -20932,36 +20995,36 @@ prefix.
15
For a selected_component that denotes a component of a variant, a check
is made that the values of the discriminants are such that the value or
-object denoted by the prefix has this component. The exception
+object denoted by the prefix has this component. The exception
Constraint_Error is raised if this check fails.
_Examples_
16
-Examples of selected components:
+<Examples of selected components:>
17/2
- {AI95-00252-01AI95-00252-01} {AI95-00407-01AI95-00407-01}
Tomorrow.Month -- a record component (see *note 3.8::)
- Next_Car.Owner -- a record component (see *note 3.10.1::)
- Next_Car.Owner.Age -- a record component (see *note 3.10.1::)
- -- the previous two lines involve implicit
dereferences
- Writer.Unit -- a record component (a discriminant) (see
*note 3.8.1::)
- Min_Cell(H).Value -- a record component of the result (see *note
6.1::)
- -- of the function call Min_Cell(H)
- Cashier.Append -- a prefixed view of a procedure (see *note
3.9.4::)
- Control.Seize -- an entry of a protected object (see *note
9.4::)
- Pool(K).Write -- an entry of the task Pool(K) (see *note 9.4::)
+ {<AI95-00252-01AI95-00252-01>} {<AI95-00407-01AI95-00407-01>}
Tomorrow.Month --< a record component (see *note 3.8::)>
+ Next_Car.Owner --< a record component (see *note 3.10.1::)>
+ Next_Car.Owner.Age --< a record component (see *note 3.10.1::)>
+ --< the previous two lines involve implicit
dereferences>
+ Writer.Unit --< a record component (a discriminant) (see
*note 3.8.1::)>
+ Min_Cell(H).Value --< a record component of the result (see *note
6.1::)>
+ --< of the function call Min_Cell(H)>
+ Cashier.Append --< a prefixed view of a procedure (see *note
3.9.4::)>
+ Control.Seize --< an entry of a protected object (see *note
9.4::)>
+ Pool(K).Write --< an entry of the task Pool(K) (see *note
9.4::)>
18
-Examples of expanded names:
+<Examples of expanded names:>
19
- Key_Manager."<" -- an operator of the visible part of a package
(see *note 7.3.1::)
- Dot_Product.Sum -- a variable declared in a function body (see
*note 6.1::)
- Buffer.Pool -- a variable declared in a protected unit
(see *note 9.11::)
- Buffer.Read -- an entry of a protected unit (see *note
9.11::)
- Swap.Temp -- a variable declared in a block statement
(see *note 5.6::)
- Standard.Boolean -- the name of a predefined type (see *note
A.1::)
+ Key_Manager."<" --< an operator of the visible part of a package
(see *note 7.3.1::)>
+ Dot_Product.Sum --< a variable declared in a function body
(see *note 6.1::)>
+ Buffer.Pool --< a variable declared in a protected unit
(see *note 9.11::)>
+ Buffer.Read --< an entry of a protected unit (see *note
9.11::)>
+ Swap.Temp --< a variable declared in a block statement
(see *note 5.6::)>
+ Standard.Boolean --< the name of a predefined type (see *note
A.1::)>
_Extensions to Ada 83_
@@ -20995,11 +21058,11 @@ Examples of expanded names:
_Extensions to Ada 95_
19.e/2
- {AI95-00252-01AI95-00252-01} The prefixed view notation for
+ {<AI95-00252-01AI95-00252-01>} The prefixed view notation for
tagged objects is new. This provides a similar notation to
that used in other popular languages, and also reduces the
need for use_clauses. This is sometimes known as
- "distinguished receiver notation".
+ "distinguished receiver notation".
19.f/2
Given the following definitions for a tagged type T:
@@ -21026,9 +21089,10 @@ Examples of expanded names:
_Wording Changes from Ada 2005_
19.l/3
- {AI05-0090-1AI05-0090-1} Correction: Corrected the definition
- of a prefixed view to ignore the implicit subprograms declared
- for "implemented by" entries and protected subprograms.
+ {<AI05-0090-1AI05-0090-1>} Correction: Corrected the
+ definition of a prefixed view to ignore the implicit
+ subprograms declared for "implemented by" entries and
+ protected subprograms.
File: aarm2012.info, Node: 4.1.4, Next: 4.1.5, Prev: 4.1.3, Up: 4.1
@@ -21037,7 +21101,7 @@ File: aarm2012.info, Node: 4.1.4, Next: 4.1.5, Prev:
4.1.3, Up: 4.1
----------------
1
-[An attribute is a characteristic of an entity that can be queried via
+[An <attribute> is a characteristic of an entity that can be queried via
an attribute_reference (*note 4.1.4: S0100.) or a
range_attribute_reference (*note 4.1.4: S0102.).]
@@ -21047,15 +21111,15 @@ range_attribute_reference (*note 4.1.4: S0102.).]
attribute_reference ::= prefix'attribute_designator
3/2
- {AI05-0004-1AI05-0004-1} attribute_designator ::=
- identifier[(static_expression)]
+ {<AI05-0004-1AI05-0004-1>} attribute_designator ::=
+ identifier[(<static_>expression)]
| Access | Delta | Digits | Mod
4
range_attribute_reference ::= prefix'range_attribute_designator
5
- range_attribute_designator ::= Range[(static_expression)]
+ range_attribute_designator ::= Range[(<static_>expression)]
_Name Resolution Rules_
@@ -21092,19 +21156,19 @@ denotes a function, it is interpreted as a
parameterless function_call.
profile of the prefix.
6.d/2
- {AI95-00114-01AI95-00114-01} Other than the rules given above,
- the Name Resolution Rules for the prefix of each attribute are
- defined as Name Resolution Rules for that attribute. If no
- such rules are defined, then no context at all should be used
- when resolving the prefix. In particular, any knowledge about
- the kind of entities required must not be used for resolution
- unless that is required by Name Resolution Rules. This
- matters in obscure cases; for instance, given the following
- declarations:
+ {<AI95-00114-01AI95-00114-01>} Other than the rules given
+ above, the Name Resolution Rules for the prefix of each
+ attribute are defined as Name Resolution Rules for that
+ attribute. If no such rules are defined, then no context at
+ all should be used when resolving the prefix. In particular,
+ any knowledge about the kind of entities required must not be
+ used for resolution unless that is required by Name Resolution
+ Rules. This matters in obscure cases; for instance, given the
+ following declarations:
6.e/2
- function Get_It return Integer is ... -- (1)
- function Get_It return Some_Record_Type is ... -- (2)
+ function Get_It return Integer is ... -- <(1)>
+ function Get_It return Some_Record_Type is ... -- <(2)>
6.f/2
the following attribute_reference cannot be resolved and is
@@ -21114,7 +21178,7 @@ denotes a function, it is interpreted as a
parameterless function_call.
if Get_It'Valid then
6.h/3
- {AI05-0005-1AI05-0005-1} even though the Valid attribute is
+ {<AI05-0005-1AI05-0005-1>} even though the Valid attribute is
only defined for objects of scalar types, and thus cannot be
applied to the result of function (2). That information
cannot be used to resolve the prefix. The same would be true
@@ -21135,8 +21199,8 @@ range_attribute_designator shall be static.
_Static Semantics_
9/4
-{AI05-0006-1AI05-0006-1} {AI12-0032-1AI12-0032-1}
-{AI12-0159-1AI12-0159-1} An attribute_reference denotes a value, an
+{<AI05-0006-1AI05-0006-1>} {<AI12-0032-1AI12-0032-1>}
+{<AI12-0159-1AI12-0159-1>} An attribute_reference denotes a value, an
object, a subprogram, or some other kind of program entity. Unless
explicitly specified otherwise, for an attribute_reference that denotes
a value or an object, if its type is scalar, then its nominal subtype is
@@ -21157,7 +21221,7 @@ predicate.
additional attributes.
9.b/3
- Discussion: {AI05-0006-1AI05-0006-1} The nominal subtype is
+ Discussion: {<AI05-0006-1AI05-0006-1>} The nominal subtype is
primarily a concern when an attribute_reference, or a call on
an attribute_reference, is used as the expression of a case
statement, due to the full coverage requirement based on the
@@ -21166,12 +21230,12 @@ predicate.
otherwise for implementation-defined attribute functions.
9.c/3
- The rule is written to match the meaning of the italicized T
+ The rule is written to match the meaning of the italicized <T>
in the definition of attributes such as Input; see *note
4.5.1::.
9.d/3
- To be honest: {AI05-0006-1AI05-0006-1} We don't worry about
+ To be honest: {<AI05-0006-1AI05-0006-1>} We don't worry about
the fact that "base subtype" is not explicitly defined for the
universal types. Since it is not possible to constrain a
universal numeric type, all subtypes are unconstrained, and
@@ -21197,8 +21261,8 @@ consists of the evaluation of the prefix.
_Implementation Permissions_
12/1
-{8652/00158652/0015} {AI95-00093-01AI95-00093-01} An implementation may
-provide implementation-defined attributes; the identifier for an
+{<8652/00158652/0015>} {<AI95-00093-01AI95-00093-01>} An implementation
+may provide implementation-defined attributes; the identifier for an
implementation-defined attribute shall differ from those of the
language-defined attributes unless supplied for compatibility with a
previous edition of this International Standard.
@@ -21218,7 +21282,7 @@ previous edition of this International Standard.
expression.
12.c.1/1
- {8652/00158652/0015} {AI95-00093-01AI95-00093-01}
+ {<8652/00158652/0015>} {<AI95-00093-01AI95-00093-01>}
Implementations are allowed to support the Small attribute for
floating types, as this was defined in Ada 83, even though the
name would conflict with a language-defined attribute.
@@ -21230,19 +21294,19 @@ previous edition of this International Standard.
and are summarized in *note K.2::.
14/2
- 5 {AI95-00235AI95-00235} In general, the name in a prefix of an
+ 5 {<AI95-00235AI95-00235>} In general, the name in a prefix of an
attribute_reference (or a range_attribute_reference) has to be
resolved without using any context. However, in the case of the
Access attribute, the expected type for the attribute_reference has
to be a single access type, and the resolution of the name can use
the fact that the type of the object or the profile of the callable
entity denoted by the prefix has to match the designated type or be
- type conformant with the designated profile of the access type.
+ type conformant with the designated profile of the access type.
14.a/2
- Proof: {AI95-00235AI95-00235} In the general case, there is no
- "expected type" for the prefix of an attribute_reference. In
- the special case of 'Access, there is an "expected type" or
+ Proof: {<AI95-00235AI95-00235>} In the general case, there is
+ no "expected type" for the prefix of an attribute_reference.
+ In the special case of 'Access, there is an "expected type" or
"expected profile" for the prefix.
14.b
@@ -21253,17 +21317,17 @@ previous edition of this International Standard.
_Examples_
15
-Examples of attributes:
+<Examples of attributes:>
16
- Color'First -- minimum value of the enumeration type Color (see
*note 3.5.1::)
- Rainbow'Base'First -- same as Color'First (see *note 3.5.1::)
- Real'Digits -- precision of the type Real (see *note 3.5.7::)
- Board'Last(2) -- upper bound of the second dimension of Board
(see *note 3.6.1::)
- Board'Range(1) -- index range of the first dimension of Board (see
*note 3.6.1::)
- Pool(K)'Terminated -- True if task Pool(K) is terminated (see *note
9.1::)
- Date'Size -- number of bits for records of type Date (see
*note 3.8::)
- Message'Address -- address of the record variable Message (see
*note 3.7.1::)
+ Color'First --< minimum value of the enumeration type Color
(see *note 3.5.1::)>
+ Rainbow'Base'First --< same as Color'First (see *note 3.5.1::)>
+ Real'Digits --< precision of the type Real (see *note 3.5.7::)>
+ Board'Last(2) --< upper bound of the second dimension of Board
(see *note 3.6.1::)>
+ Board'Range(1) --< index range of the first dimension of Board
(see *note 3.6.1::)>
+ Pool(K)'Terminated --< True if task Pool(K) is terminated (see *note
9.1::)>
+ Date'Size --< number of bits for records of type Date (see
*note 3.8::)>
+ Message'Address --< address of the record variable Message (see
*note 3.7.1::)>
_Extensions to Ada 83_
@@ -21272,8 +21336,8 @@ Examples of attributes:
its use with scalar subtypes.
16.b
- We allow any integer type in the static_expression of an
- attribute designator, not just a value of universal_integer.
+ We allow any integer type in the <static_>expression of an
+ attribute designator, not just a value of <universal_integer>.
The preference rules ensure upward compatibility.
_Wording Changes from Ada 83_
@@ -21314,33 +21378,33 @@ Examples of attributes:
_Wording Changes from Ada 95_
16.h/2
- {8652/00158652/0015} {AI95-00093-01AI95-00093-01} Corrigendum:
- The wording was changed to allow implementations to continue
- to implement the Ada 83 Small attribute. This was always
- intended to be allowed.
+ {<8652/00158652/0015>} {<AI95-00093-01AI95-00093-01>}
+ Corrigendum: The wording was changed to allow implementations
+ to continue to implement the Ada 83 Small attribute. This was
+ always intended to be allowed.
16.i/2
- {AI95-00235-01AI95-00235-01} The note about resolving prefixes
- of attributes was updated to reflect that the prefix of an
- Access attribute now has an expected type (see *note
+ {<AI95-00235-01AI95-00235-01>} The note about resolving
+ prefixes of attributes was updated to reflect that the prefix
+ of an Access attribute now has an expected type (see *note
3.10.2::).
_Wording Changes from Ada 2005_
16.j/3
- {AI05-0006-1AI05-0006-1} Correction: Defined the nominal
+ {<AI05-0006-1AI05-0006-1>} Correction: Defined the nominal
subtype of an attribute_reference to close a minor language
hole.
_Wording Changes from Ada 2012_
16.k/4
- {AI12-0032-1AI12-0032-1} Corrigendum: Allowed overriding the
+ {<AI12-0032-1AI12-0032-1>} Corrigendum: Allowed overriding the
nominal subtype of an attribute_reference for an object; that
is used elsewhere in this standard.
16.l/4
- {AI12-0159-1AI12-0159-1} Corrigendum: Added wording so it is
+ {<AI12-0159-1AI12-0159-1>} Corrigendum: Added wording so it is
clear that predicates don't apply to the result of an
attribute.
@@ -21353,23 +21417,23 @@ File: aarm2012.info, Node: 4.1.5, Next: 4.1.6,
Prev: 4.1.4, Up: 4.1
_Static Semantics_
1/3
-{AI05-0139-2AI05-0139-2} Given a discriminated type T, the following
+{<AI05-0139-2AI05-0139-2>} Given a discriminated type <T>, the following
type-related operational aspect may be specified:
2/3
Implicit_Dereference
This aspect is specified by a name that denotes an access
- discriminant declared for the type T.
+ discriminant declared for the type <T>.
2.a/3
Aspect Description for Implicit_Dereference: Mechanism for
user-defined implicit .all.
3/3
-{AI05-0139-2AI05-0139-2} A (view of a) type with a specified
-Implicit_Dereference aspect is a reference type. A reference object is
-an object of a reference type. The discriminant named by the
-Implicit_Dereference aspect is the reference discriminant of the
+{<AI05-0139-2AI05-0139-2>} A (view of a) type with a specified
+Implicit_Dereference aspect is a <reference type>. A <reference object>
+is an object of a reference type. The discriminant named by the
+Implicit_Dereference aspect is the <reference discriminant> of the
reference type or reference object. [A generalized_reference is a name
that identifies a reference object, and denotes the object or subprogram
designated by the reference discriminant of the reference object.]
@@ -21382,20 +21446,20 @@ designated by the reference discriminant of the
reference object.]
_Syntax_
4/3
- {AI05-0139-2AI05-0139-2} generalized_reference ::=
- reference_object_name
+ {<AI05-0139-2AI05-0139-2>} generalized_reference ::=
+ <reference_object_>name
_Name Resolution Rules_
5/3
-{AI05-0139-2AI05-0139-2} {AI05-0269-1AI05-0269-1} The expected type for
-the reference_object_name in a generalized_reference is any reference
-type.
+{<AI05-0139-2AI05-0139-2>} {<AI05-0269-1AI05-0269-1>} The expected type
+for the <reference_object_>name in a generalized_reference is any
+reference type.
_Static Semantics_
5.1/4
-{AI12-0138-1AI12-0138-1} The Implicit_Dereference aspect is
+{<AI12-0138-1AI12-0138-1>} The Implicit_Dereference aspect is
nonoverridable (see *note 13.1.1::).
5.a/4
@@ -21404,28 +21468,29 @@ nonoverridable (see *note 13.1.1::).
contract problems with formal derived types.
6/3
-{AI05-0139-2AI05-0139-2} A generalized_reference denotes a view
+{<AI05-0139-2AI05-0139-2>} A generalized_reference denotes a view
equivalent to that of a dereference of the reference discriminant of the
reference object.
7/3
-{AI05-0139-2AI05-0139-2} Given a reference type T, the
-Implicit_Dereference aspect is inherited by descendants of type T if not
-overridden. If a descendant type constrains the value of the reference
-discriminant of T by a new discriminant, that new discriminant is the
-reference discriminant of the descendant. [If the descendant type
-constrains the value of the reference discriminant of T by an expression
-other than the name of a new discriminant, a generalized_reference that
-identifies an object of the descendant type denotes the object or
-subprogram designated by the value of this constraining expression.]
+{<AI05-0139-2AI05-0139-2>} Given a reference type <T>, the
+Implicit_Dereference aspect is inherited by descendants of type <T> if
+not overridden. If a descendant type constrains the value of the
+reference discriminant of <T> by a new discriminant, that new
+discriminant is the reference discriminant of the descendant. [If the
+descendant type constrains the value of the reference discriminant of
+<T> by an expression other than the name of a new discriminant, a
+generalized_reference that identifies an object of the descendant type
+denotes the object or subprogram designated by the value of this
+constraining expression.]
_Dynamic Semantics_
8/3
-{AI05-0139-2AI05-0139-2} The evaluation of a generalized_reference
-consists of the evaluation of the reference_object_name and a
+{<AI05-0139-2AI05-0139-2>} The evaluation of a generalized_reference
+consists of the evaluation of the <reference_object_>name and a
determination of the object or subprogram designated by the reference
-discriminant of the named reference object. A check is made that the
+discriminant of the named reference object. A check is made that the
value of the reference discriminant is not the null access value.
Constraint_Error is raised if this check fails. The
generalized_reference denotes the object or subprogram designated by the
@@ -21434,41 +21499,41 @@ value of the reference discriminant of the named
reference object.
_Examples_
9/3
- {AI05-0268-1AI05-0268-1} type Barrel is tagged ... -- holds objects of
type Element
+ {<AI05-0268-1AI05-0268-1>} type Barrel is tagged ... -- <holds objects
of type Element>
10/3
- {AI05-0139-2AI05-0139-2} {AI05-0299-1AI05-0299-1} type Ref_Element(Data :
access Element) is limited private
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0299-1AI05-0299-1>} type
Ref_Element(Data : access Element) is limited private
with Implicit_Dereference => Data;
- -- This Ref_Element type is a "reference" type.
- -- "Data" is its reference discriminant.
+ -- <This Ref_Element type is a "reference" type.>
+ -- <"Data" is its reference discriminant.>
11/3
- {AI05-0139-2AI05-0139-2} {AI05-0268-1AI05-0268-1} function Find (B :
aliased in out Barrel; Key : String) return Ref_Element;
- -- Return a reference to an element of a barrel.
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0268-1AI05-0268-1>} function Find (B :
aliased in out Barrel; Key : String) return Ref_Element;
+ -- <Return a reference to an element of a barrel.>
12/3
- {AI05-0268-1AI05-0268-1} {AI05-0299-1AI05-0299-1} B: aliased Barrel;
+ {<AI05-0268-1AI05-0268-1>} {<AI05-0299-1AI05-0299-1>} B: aliased Barrel;
13/3
- {AI05-0139-2AI05-0139-2} ...
+ {<AI05-0139-2AI05-0139-2>} ...
14/3
- {AI05-0139-2AI05-0139-2} {AI05-0268-1AI05-0268-1} Find (B, "grape") :=
Element'(...); -- Assign through a reference.
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0268-1AI05-0268-1>} Find (B, "grape")
:= Element'(...); -- <Assign through a reference.>
15/3
- {AI05-0139-2AI05-0139-2} {AI05-0268-1AI05-0268-1} -- This is equivalent
to:
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0268-1AI05-0268-1>} -- <This is
equivalent to:>
Find (B, "grape").Data.all := Element'(...);
_Extensions to Ada 2005_
15.a/3
- {AI05-0139-2AI05-0139-2} The aspect Implicit_Dereference and
+ {<AI05-0139-2AI05-0139-2>} The aspect Implicit_Dereference and
the generalized_reference are new.
_Incompatibilities With Ada 2012_
15.b/4
- {AI12-0138-1AI12-0138-1} Corrigendum: Defined
+ {<AI12-0138-1AI12-0138-1>} Corrigendum: Defined
Implicit_Dereference to be nonoveridable, which makes
redefinitions and hiding of the aspect illegal. It's possible
that some program could violate one of these new restrictions,
@@ -21484,18 +21549,18 @@ File: aarm2012.info, Node: 4.1.6, Prev: 4.1.5, Up:
4.1
_Static Semantics_
1/3
-{AI05-0139-2AI05-0139-2} Given a tagged type T, the following
+{<AI05-0139-2AI05-0139-2>} Given a tagged type <T>, the following
type-related, operational aspects may be specified:
2/3
Constant_Indexing
This aspect shall be specified by a name that denotes one
or more functions declared immediately within the same
- declaration list in which T is declared. All such
+ declaration list in which <T> is declared. All such
functions shall have at least two parameters, the first
- of which is of type T or T'Class, or is an
- access-to-constant parameter with designated type T or
- T'Class.
+ of which is of type <T> or <T>'Class, or is an
+ access-to-constant parameter with designated type <T> or
+ <T>'Class.
2.a/3
Aspect Description for Constant_Indexing: Defines function(s)
@@ -21505,13 +21570,13 @@ Constant_Indexing
Variable_Indexing
This aspect shall be specified by a name that denotes one
or more functions declared immediately within the same
- declaration list in which T is declared. All such
+ declaration list in which <T> is declared. All such
functions shall have at least two parameters, the first
- of which is of type T or T'Class, or is an access
- parameter with designated type T or T'Class. All such
- functions shall have a return type that is a reference
- type (see *note 4.1.5::), whose reference discriminant is
- of an access-to-variable type.
+ of which is of type <T> or <T>'Class, or is an access
+ parameter with designated type <T> or <T>'Class. All
+ such functions shall have a return type that is a
+ reference type (see *note 4.1.5::), whose reference
+ discriminant is of an access-to-variable type.
3.a/3
Reason: We require these functions to return a reference type
@@ -21524,8 +21589,8 @@ Variable_Indexing
to implement user-defined indexed_components.
4/4
-{AI12-0104-1AI12-0104-1} These aspects are inherited by descendants of T
-(including the class-wide type T'Class).
+{<AI12-0104-1AI12-0104-1>} These aspects are inherited by descendants of
+<T> (including the class-wide type <T>'Class).
4.a/3
Ramification: Indexing can be provided for multiple index
@@ -21536,10 +21601,10 @@ Variable_Indexing
aspects.
5/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} An indexable container
-type is (a view of) a tagged type with at least one of the aspects
-Constant_Indexing or Variable_Indexing specified. An indexable
-container object is an object of an indexable container type. [A
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} An <indexable
+container type> is (a view of) a tagged type with at least one of the
+aspects Constant_Indexing or Variable_Indexing specified. An <indexable
+container object> is an object of an indexable container type. [A
generalized_indexing is a name that denotes the result of calling a
function named by a Constant_Indexing or Variable_Indexing aspect.]
@@ -21549,7 +21614,7 @@ function named by a Constant_Indexing or
Variable_Indexing aspect.]
or Variable_Indexing aspects.
5.1/4
-{AI12-0138-1AI12-0138-1} The Constant_Indexing and Variable_Indexing
+{<AI12-0138-1AI12-0138-1>} The Constant_Indexing and Variable_Indexing
aspects are nonoverridable (see *note 13.1.1::).
5.a/4
@@ -21558,7 +21623,7 @@ aspects are nonoverridable (see *note 13.1.1::).
prevents generic contract problems with formal derived types.
5.b/4
- {AI12-0104-1AI12-0104-1} {AI12-0138-1AI12-0138-1} A
+ {<AI12-0104-1AI12-0104-1>} {<AI12-0138-1AI12-0138-1>} A
nonoverridable aspect allows the replacement of the
implementation of an indexing function and the addition of a
new indexing function for a derived type, but not the removal
@@ -21572,35 +21637,35 @@ aspects are nonoverridable (see *note 13.1.1::).
be changed from the original body (that's just normal
dispatching).
-Paragraphs 6 through 9 were deleted.
+<Paragraphs 6 through 9 were deleted.>
_Syntax_
10/3
- {AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1}
- generalized_indexing ::= indexable_container_object_prefix
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>}
+ generalized_indexing ::= <indexable_container_object_>prefix
actual_parameter_part
_Name Resolution Rules_
11/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} The expected type for
-the indexable_container_object_prefix of a generalized_indexing is any
-indexable container type.
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} The expected type
+for the <indexable_container_object_>prefix of a generalized_indexing is
+any indexable container type.
12/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} If the
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} If the
Constant_Indexing aspect is specified for the type of the
-indexable_container_object_prefix of a generalized_indexing, then the
-generalized_indexing is interpreted as a constant indexing under the
+<indexable_container_object_>prefix of a generalized_indexing, then the
+generalized_indexing is interpreted as a <constant indexing> under the
following circumstances:
13/3
* when the Variable_Indexing aspect is not specified for the type of
- the indexable_container_object_prefix;
+ the <indexable_container_object_>prefix;
14/3
- * when the indexable_container_object_prefix denotes a constant;
+ * when the <indexable_container_object_>prefix denotes a constant;
15/3
* when the generalized_indexing is used within a primary where a name
@@ -21608,41 +21673,41 @@ following circumstances:
15.a/3
Ramification: This means it is not interpreted as a constant
- indexing for the variable_name in the LHS of an assignment
+ indexing for the <variable_>name in the LHS of an assignment
(not inside a primary), nor for the name used for an out or in
out parameter (not allowed to be a constant), nor for the name
in an object renaming (not inside a primary), unless there is
no Variable_Indexing aspect defined.
16/3
-Otherwise, the generalized_indexing is interpreted as a variable
-indexing.
+Otherwise, the generalized_indexing is interpreted as a <variable
+indexing>.
17/3
When a generalized_indexing is interpreted as a constant (or variable)
indexing, it is equivalent to a call on a prefixed view of one of the
functions named by the Constant_Indexing (or Variable_Indexing) aspect
-of the type of the indexable_container_object_prefix with the given
-actual_parameter_part, and with the indexable_container_object_prefix as
-the prefix of the prefixed view.
+of the type of the <indexable_container_object_>prefix with the given
+actual_parameter_part, and with the <indexable_container_object_>prefix
+as the prefix of the prefixed view.
17.a/3
Ramification: In other words, the generalized_indexing is
equivalent to:
17.b/3
- indexable_container_object_prefix.Indexing actual_parameter_part
+ <indexable_container_object_>prefix.Indexing
actual_parameter_part
17.c/4
- {AI12-0005-1AI12-0005-1} where Indexing is the name specified
- for the Constant_Indexing or Variable_Indexing aspect. This
- equivalence is then resolved in the normal way; the aspect
- specifies a name, it does not denote declarations.
+ {<AI12-0005-1AI12-0005-1>} where Indexing is the name
+ specified for the Constant_Indexing or Variable_Indexing
+ aspect. This equivalence is then resolved in the normal way;
+ the aspect specifies a name, it does not denote declarations.
NOTES
18/4
- 6 {AI12-0104-1AI12-0104-1} The Constant_Indexing and
+ 6 {<AI12-0104-1AI12-0104-1>} The Constant_Indexing and
Variable_Indexing aspects cannot be redefined when inherited for a
derived type, but the functions that they denote can be modified by
overriding or overloading.
@@ -21650,42 +21715,42 @@ the prefix of the prefixed view.
_Examples_
19/3
- {AI05-0268-1AI05-0268-1} {AI05-0292-1AI05-0292-1} type Indexed_Barrel is
tagged ...
+ {<AI05-0268-1AI05-0268-1>} {<AI05-0292-1AI05-0292-1>} type Indexed_Barrel
is tagged ...
with Variable_Indexing => Find;
- -- Indexed_Barrel is an indexable container type,
- -- Find is the generalized indexing operation.
+ -- <Indexed_Barrel is an indexable container type,>
+ -- <Find is the generalized indexing operation.>
20/3
- {AI05-0268-1AI05-0268-1} function Find (B : aliased in out
Indexed_Barrel; Key : String) return Ref_Element;
- -- Return a reference to an element of a barrel (see *note 4.1.5::).
+ {<AI05-0268-1AI05-0268-1>} function Find (B : aliased in out
Indexed_Barrel; Key : String) return Ref_Element;
+ -- <Return a reference to an element of a barrel (see *note 4.1.5::).>
21/3
- {AI05-0268-1AI05-0268-1} IB: aliased Indexed_Barrel;
+ {<AI05-0268-1AI05-0268-1>} IB: aliased Indexed_Barrel;
22/3
- {AI05-0268-1AI05-0268-1} -- All of the following calls are then
equivalent:
- Find (IB,"pear").Data.all := Element'(...); -- Traditional call
- IB.Find ("pear").Data.all := Element'(...); -- Call of prefixed view
- IB.Find ("pear") := Element'(...); -- Implicit dereference (see
*note 4.1.5::)
- IB ("pear") := Element'(...); -- Implicit indexing and
dereference
- IB ("pear").Data.all := Element'(...); -- Implicit indexing only
+ {<AI05-0268-1AI05-0268-1>} -- <All of the following calls are then
equivalent:>
+ Find (IB,"pear").Data.all := Element'(...); -- <Traditional call>
+ IB.Find ("pear").Data.all := Element'(...); -- <Call of prefixed view>
+ IB.Find ("pear") := Element'(...); -- <Implicit dereference (see
*note 4.1.5::)>
+ IB ("pear") := Element'(...); -- <Implicit indexing and
dereference>
+ IB ("pear").Data.all := Element'(...); -- <Implicit indexing only>
_Extensions to Ada 2005_
22.a/3
- {AI05-0139-2AI05-0139-2} Aspects Constant_Indexing and
+ {<AI05-0139-2AI05-0139-2>} Aspects Constant_Indexing and
Variable_Indexing, and the generalized_indexing syntax are
new.
_Wording Changes from Ada 2012_
22.b/4
- {AI12-0104-1AI12-0104-1} Corrigendum: Converted confusing and
- unnecessary normative wording about "overriding an aspect"
+ {<AI12-0104-1AI12-0104-1>} Corrigendum: Converted confusing
+ and unnecessary normative wording about "overriding an aspect"
into a note.
22.c/4
- {AI12-0138-1AI12-0138-1} Corrigendum: Defined
+ {<AI12-0138-1AI12-0138-1>} Corrigendum: Defined
Constant_Indexing and Variable_Indexing to be nonoveridable.
This is merely a new description for Legality Rules which
already applied to these aspects.
@@ -21697,21 +21762,21 @@ File: aarm2012.info, Node: 4.2, Next: 4.3, Prev:
4.1, Up: 4
============
1
-[ A literal represents a value literally, that is, by means of notation
-suited to its kind.] A literal is either a numeric_literal, a
-character_literal, the literal null, or a string_literal.
+[ A <literal> represents a value literally, that is, by means of
+notation suited to its kind.] A literal is either a numeric_literal, a
+character_literal, the literal null, or a string_literal.
1.a
Discussion: An enumeration literal that is an identifier
- rather than a character_literal is not considered a literal in
- the above sense, because it involves no special notation
+ rather than a character_literal is not considered a <literal>
+ in the above sense, because it involves no special notation
"suited to its kind." It might more properly be called an
enumeration_identifier, except for historical reasons.
_Name Resolution Rules_
2/2
-This paragraph was deleted.{AI95-00230-01AI95-00230-01}
+<This paragraph was deleted.>{<AI95-00230-01AI95-00230-01>}
3
For a name that consists of a character_literal, either its expected
@@ -21745,15 +21810,15 @@ type, there shall be a corresponding
defining_character_literal of the
component type of the expected string type.
7/2
-This paragraph was deleted.{AI95-00230-01AI95-00230-01}
-{AI95-00231-01AI95-00231-01}
+<This paragraph was deleted.>{<AI95-00230-01AI95-00230-01>}
+{<AI95-00231-01AI95-00231-01>}
_Static Semantics_
8/2
-{AI95-00230-01AI95-00230-01} An integer literal is of type
-universal_integer. A real literal is of type universal_real. The
-literal null is of type universal_access.
+{<AI95-00230-01AI95-00230-01>} An integer literal is of type
+<universal_integer>. A real literal is of type <universal_real>. The
+literal null is of type <universal_access>.
_Dynamic Semantics_
@@ -21770,11 +21835,11 @@ positional_array_aggregates (see *note 4.3.3::),
except that for a null
string literal, the upper bound is the predecessor of the lower bound.
11
-For the evaluation of a string_literal of type T, a check is made that
+For the evaluation of a string_literal of type <T>, a check is made that
the value of each character of the string_literal belongs to the
-component subtype of T. For the evaluation of a null string literal, a
-check is made that its lower bound is greater than the lower bound of
-the base range of the index type. The exception Constraint_Error is
+component subtype of <T>. For the evaluation of a null string literal,
+a check is made that its lower bound is greater than the lower bound of
+the base range of the index type. The exception Constraint_Error is
raised if either of these checks fails.
11.a
@@ -21795,13 +21860,13 @@ raised if either of these checks fails.
_Examples_
13
-Examples of literals:
+<Examples of literals:>
14
- 3.14159_26536 -- a real literal
- 1_345 -- an integer literal
- 'A' -- a character literal
- "Some Text" -- a string literal
+ 3.14159_26536 --< a real literal>
+ 1_345 --< an integer literal>
+ 'A' --< a character literal>
+ "Some Text" --< a string literal >
_Incompatibilities With Ada 83_
@@ -21832,9 +21897,9 @@ Examples of literals:
_Extensions to Ada 95_
14.d/2
- {AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01} Null
- now has type universal_access, which is similar to other
- literals. Null can be used with anonymous access types.
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00231-01AI95-00231-01>}
+ Null now has type <universal_access>, which is similar to
+ other literals. Null can be used with anonymous access types.
File: aarm2012.info, Node: 4.3, Next: 4.4, Prev: 4.2, Up: 4
@@ -21843,8 +21908,8 @@ File: aarm2012.info, Node: 4.3, Next: 4.4, Prev:
4.2, Up: 4
==============
1
-[ An aggregate combines component values into a composite value of an
-array type, record type, or record extension.]
+[ An <aggregate> combines component values into a composite value of an
+array type, record type, or record extension.]
_Syntax_
@@ -21855,8 +21920,8 @@ array type, record type, or record extension.]
_Name Resolution Rules_
3/2
-{AI95-00287-01AI95-00287-01} The expected type for an aggregate shall be
-a single array type, record type, or record extension.
+{<AI95-00287-01AI95-00287-01>} The expected type for an aggregate shall
+be a single array type, record type, or record extension.
3.a
Discussion: See *note 8.6::, "*note 8.6:: The Context of
@@ -21864,7 +21929,7 @@ a single array type, record type, or record extension.
type."
3.b/3
- Ramification: {AI05-0005-1AI05-0005-1} There are additional
+ Ramification: {<AI05-0005-1AI05-0005-1>} There are additional
rules for each kind of aggregate. These aggregate rules are
additive; a legal expression needs to satisfy all of the
applicable rules. That means the rule given here must be
@@ -21899,7 +21964,7 @@ For the evaluation of an aggregate, an anonymous object
is created and
values for the components or ancestor part are obtained (as described in
the subsequent subclause for each kind of the aggregate) and assigned
into the corresponding components or ancestor part of the anonymous
-object. Obtaining the values and the assignments occur in an arbitrary
+object. Obtaining the values and the assignments occur in an arbitrary
order. The value of the aggregate is the value of this object.
5.a
@@ -21926,7 +21991,7 @@ order. The value of the aggregate is the value of this
object.
6
If an aggregate is of a tagged type, a check is made that its value
-belongs to the first subtype of the type. Constraint_Error is raised if
+belongs to the first subtype of the type. Constraint_Error is raised if
this check fails.
6.a
@@ -21958,10 +22023,10 @@ this check fails.
_Incompatibilities With Ada 95_
6.e/2
- {AI95-00287-01AI95-00287-01} In Ada 95, a limited type is not
- considered when resolving an aggregate. Since Ada 2005 now
- allows limited aggregates, we can have incompatibilities. For
- example:
+ {<AI95-00287-01AI95-00287-01>} In Ada 95, a limited type is
+ not considered when resolving an aggregate. Since Ada 2005
+ now allows limited aggregates, we can have incompatibilities.
+ For example:
6.f/2
type Lim is limited
@@ -21980,7 +22045,7 @@ this check fails.
procedure P(X: Not_Lim);
6.i/2
- P((Comp => 123)); -- Illegal in Ada 2005, legal in Ada 95
+ P((Comp => 123)); -- <Illegal in Ada 2005, legal in Ada 95>
6.j/2
The call to P is ambiguous in Ada 2005, while it would not be
@@ -21993,7 +22058,7 @@ this check fails.
_Extensions to Ada 95_
6.k/2
- {AI95-00287-01AI95-00287-01} Aggregates can be of a limited
+ {<AI95-00287-01AI95-00287-01>} Aggregates can be of a limited
type.
* Menu:
@@ -22024,22 +22089,22 @@ association.]
| null record
4/2
- {AI95-00287-01AI95-00287-01} record_component_association ::=
+ {<AI95-00287-01AI95-00287-01>} record_component_association ::=
[component_choice_list =>] expression
| component_choice_list => <>
5
component_choice_list ::=
- component_selector_name {| component_selector_name}
+ <component_>selector_name {| <component_>selector_name}
| others
6
- A record_component_association (*note 4.3.1: S0109.) is a named
- component association if it has a component_choice_list; otherwise,
- it is a positional component association. Any positional component
- associations shall precede any named component associations. If
- there is a named association with a component_choice_list of
- others, it shall come last.
+ A record_component_association (*note 4.3.1: S0109.) is a <named
+ component association> if it has a component_choice_list;
+ otherwise, it is a <positional component association>. Any
+ positional component associations shall precede any named component
+ associations. If there is a named association with a
+ component_choice_list of others, it shall come last.
6.a
Discussion: These rules were implied by the BNF in an early
@@ -22057,7 +22122,7 @@ association.]
association, it shall be a named association.
7.a/3
- Reason: {AI05-0264-1AI05-0264-1} Otherwise, the construct
+ Reason: {<AI05-0264-1AI05-0264-1>} Otherwise, the construct
would be interpreted as a parenthesized expression. This is
considered a syntax rule, since it is relevant to overload
resolution. We choose not to express it with BNF so we can
@@ -22071,7 +22136,7 @@ association.]
_Name Resolution Rules_
8/2
-{AI95-00287-01AI95-00287-01} The expected type for a record_aggregate
+{<AI95-00287-01AI95-00287-01>} The expected type for a record_aggregate
shall be a single record type or record extension.
8.a
@@ -22083,8 +22148,8 @@ shall be a single record type or record extension.
9
For the record_component_association_list (*note 4.3.1: S0108.) of a
record_aggregate (*note 4.3.1: S0107.), all components of the composite
-value defined by the aggregate are needed[; for the association list of
-an extension_aggregate, only those components not determined by the
+value defined by the aggregate are <needed>[; for the association list
+of an extension_aggregate, only those components not determined by the
ancestor expression or subtype are needed (see *note 4.3.2::).] Each
selector_name (*note 4.1.3: S0099.) in a record_component_association
(*note 4.3.1: S0109.) shall denote a needed component [(including
@@ -22111,7 +22176,7 @@ possibly a discriminant)].
10
The expected type for the expression of a record_component_association
-(*note 4.3.1: S0109.) is the type of the associated component(s); the
+(*note 4.3.1: S0109.) is the type of the <associated> component(s); the
associated component(s) are as follows:
11
@@ -22126,7 +22191,7 @@ associated component(s) are as follows:
to determine the position.
11.b/3
- {AI05-0005-1AI05-0005-1} For a derived type (including type
+ {<AI05-0005-1AI05-0005-1>} For a derived type (including type
extensions), the order of declaration is defined in *note
3.4::, "*note 3.4:: Derived Types and Classes". In
particular, all discriminants come first, regardless of
@@ -22134,8 +22199,8 @@ associated component(s) are as follows:
added to the derived type.
12
- * For a named association with one or more component_selector_names,
- the named component(s);
+ * For a named association with one or more
+ <component_>selector_names, the named component(s);
13
* For a named association with the reserved word others, all needed
@@ -22149,8 +22214,8 @@ be a descendant of a record type, through one or more
record extensions
(and no private extensions).
15/3
-{AI05-0016-1AI05-0016-1} The reserved words null record may appear only
-if there are no components needed in a given
+{<AI05-0016-1AI05-0016-1>} The reserved words null record may appear
+only if there are no components needed in a given
record_component_association_list (*note 4.3.1: S0108.).
15.a
@@ -22160,16 +22225,16 @@ record_component_association_list (*note 4.3.1:
S0108.).
defined as a null record extension of T.
15.b/3
- {AI05-0016-1AI05-0016-1} If no components are needed and null
- record is not used, the record_component_association (*note
- 4.3.1: S0109.) must necessarily be others => <>, as that is
- the only record_component_association (*note 4.3.1: S0109.)
- that does not require an associated component.
+ {<AI05-0016-1AI05-0016-1>} If no components are needed and
+ null record is not used, the record_component_association
+ (*note 4.3.1: S0109.) must necessarily be others => <>, as
+ that is the only record_component_association (*note 4.3.1:
+ S0109.) that does not require an associated component.
16/4
-{AI95-00287-01AI95-00287-01} {AI05-0199-1AI05-0199-1}
-{AI12-0046-1AI12-0046-1} Each record_component_association other than an
-others choice with a <> shall have at least one associated component,
+{<AI95-00287-01AI95-00287-01>} {<AI05-0199-1AI05-0199-1>}
+{<AI12-0046-1AI12-0046-1>} Each record_component_association other than
+an others choice with a <> shall have at least one associated component,
and each needed component shall be associated with exactly one
record_component_association (*note 4.3.1: S0109.). If a
record_component_association (*note 4.3.1: S0109.) with an expression
@@ -22179,13 +22244,13 @@ statically match. In addition, Legality Rules are
enforced separately
for each associated component.
16.a/2
- Ramification: {AI95-00287-01AI95-00287-01} These rules apply
+ Ramification: {<AI95-00287-01AI95-00287-01>} These rules apply
to an association with an others choice with an expression.
An others choice with a <> can match zero components or
several components with different types.
16.b/2
- Reason: {AI95-00287-01AI95-00287-01} Without these rules,
+ Reason: {<AI95-00287-01AI95-00287-01>} Without these rules,
there would be no way to know what was the expected type for
the expression of the association. Note that some of the
rules do not apply to <> associations, as we do not need to
@@ -22195,12 +22260,12 @@ for each associated component.
record or array value.
16.c/4
- Discussion: {AI12-0046-1AI12-0046-1} AI83-00244 also requires
- that the expression shall be legal for each associated
- component. Ada 95 omitted this wording, as it was thought
- that all cases of difference had been eliminated. That
- probably was true, but Ada 2005 reintroduced cases where the
- types match but the legality differs. For example:
+ Discussion: {<AI12-0046-1AI12-0046-1>} AI83-00244 also
+ requires that the expression shall be legal for each
+ associated component. Ada 95 omitted this wording, as it was
+ thought that all cases of difference had been eliminated.
+ That probably was true, but Ada 2005 reintroduced cases where
+ the types match but the legality differs. For example:
16.c.1/4
type Rec (D : access Integer) is record
@@ -22210,7 +22275,7 @@ for each associated component.
16.c.2/4
...
X : aliased Integer;
- R : Rec := (D | F => X'Access); -- Legal for D, illegal for F
+ R : Rec := (D | F => X'Access); -- <Legal for D, illegal for F>
16.c.3/4
There are additional ways for this to happen; because of cases
@@ -22230,10 +22295,10 @@ for each associated component.
components are left out, nor specified twice.
17/3
-{AI05-0220-1AI05-0220-1} The value of a discriminant that governs a
-variant_part P shall be given by a static expression, unless P is nested
-within a variant V that is not selected by the discriminant value
-governing the variant_part enclosing V.
+{<AI05-0220-1AI05-0220-1>} The value of a discriminant that governs a
+variant_part <P> shall be given by a static expression, unless <P> is
+nested within a variant <V> that is not selected by the discriminant
+value governing the variant_part enclosing <V>.
17.a
Ramification: This expression might either be given within the
@@ -22242,7 +22307,7 @@ governing the variant_part enclosing V.
aggregate.
17.1/2
-{AI95-00287-01AI95-00287-01} A record_component_association for a
+{<AI95-00287-01AI95-00287-01>} A record_component_association for a
discriminant without a default_expression shall have an expression
rather than <>.
@@ -22261,7 +22326,7 @@ record_component_association_list (*note 4.3.1: S0108.).
For the evaluation of a record_component_association_list (*note 4.3.1:
S0108.), any per-object constraints (see *note 3.8::) for components
specified in the association list are elaborated and any expressions are
-evaluated and converted to the subtype of the associated component. Any
+evaluated and converted to the subtype of the associated component. Any
constraint elaborations and expression evaluations (and conversions)
occur in an arbitrary order, except that the expression for a
discriminant is evaluated (and converted) prior to the elaboration of
@@ -22278,8 +22343,8 @@ with the per-object constraint.
as part of the dependent compatibility check in Ada 83.
19.1/2
-{AI95-00287-01AI95-00287-01} For a record_component_association with an
-expression, the expression defines the value for the associated
+{<AI95-00287-01AI95-00287-01>} For a record_component_association with
+an expression, the expression defines the value for the associated
component(s). For a record_component_association with <>, if the
component_declaration has a default_expression, that default_expression
defines the value for the associated component(s); otherwise, the
@@ -22291,7 +22356,7 @@ The expression of a record_component_association is
evaluated (and
converted) once for each associated component.
20.a/3
- Ramification: {AI05-0005-1AI05-0005-1} We don't need similar
+ Ramification: {<AI05-0005-1AI05-0005-1>} We don't need similar
language for <>, as we're considering the value of <> for each
individual component. Each component has its own default
expression or its own default initialization (they can be
@@ -22311,41 +22376,41 @@ converted) once for each associated component.
_Examples_
22
-Example of a record aggregate with positional associations:
+<Example of a record aggregate with positional associations:>
23
- (4, July, 1776) -- see *note 3.8::
+ (4, July, 1776) --< see *note
3.8:: >
24
-Examples of record aggregates with named associations:
+<Examples of record aggregates with named associations:>
25
(Day => 4, Month => July, Year => 1776)
(Month => July, Day => 4, Year => 1776)
26
- (Disk, Closed, Track => 5, Cylinder => 12) -- see *note
3.8.1::
+ (Disk, Closed, Track => 5, Cylinder => 12) --< see *note
3.8.1::>
(Unit => Disk, Status => Closed, Cylinder => 9, Track => 1)
27/2
-{AI95-00287-01AI95-00287-01} Examples of component associations with
-several choices:
+{<AI95-00287-01AI95-00287-01>} <Examples of component associations with
+several choices:>
28
- (Value => 0, Succ|Pred => new Cell'(0, null, null)) -- see *note
3.10.1::
+ (Value => 0, Succ|Pred => new Cell'(0, null, null)) --< see *note
3.10.1::>
29
- -- The allocator is evaluated twice: Succ and Pred designate different
cells
+ --< The allocator is evaluated twice: Succ and Pred designate different
cells>
29.1/2
- (Value => 0, Succ|Pred => <>) -- see *note 3.10.1::
+ (Value => 0, Succ|Pred => <>) --< see *note 3.10.1::>
29.2/2
- -- Succ and Pred will be set to null
+ --< Succ and Pred will be set to null>
30
-Examples of record aggregates for tagged types (see *note 3.9:: and
-*note 3.9.1::):
+<Examples of record aggregates for tagged types (see *note 3.9:: and
+*note 3.9.1::):>
31
Expression'(null record)
@@ -22369,24 +22434,24 @@ Examples of record aggregates for tagged types (see
*note 3.9:: and
_Extensions to Ada 95_
31.c/2
- {AI95-00287-01AI95-00287-01} <> can be used in place of an
+ {<AI95-00287-01AI95-00287-01>} <> can be used in place of an
expression in a record_aggregate, default initializing the
component.
_Wording Changes from Ada 95_
31.d/2
- {AI95-00287-01AI95-00287-01} Limited record_aggregates are
+ {<AI95-00287-01AI95-00287-01>} Limited record_aggregates are
allowed (since all kinds of aggregates can now be limited, see
*note 4.3::).
_Incompatibilities With Ada 2005_
31.e/3
- {AI05-0220-1AI05-0220-1} Correction: Corrected wording so that
- the rule for discriminants governing variant_parts was not
- effectively circular. The change makes a few aggregates where
- a nonstatic discriminant governs an empty variant_part
+ {<AI05-0220-1AI05-0220-1>} Correction: Corrected wording so
+ that the rule for discriminants governing variant_parts was
+ not effectively circular. The change makes a few aggregates
+ where a nonstatic discriminant governs an empty variant_part
illegal. However, most Ada implementations already enforce
some version of the new rule and already reject these
aggregates. So it is unlikely that any incompatibility will
@@ -22395,14 +22460,14 @@ Examples of record aggregates for tagged types (see
*note 3.9:: and
_Extensions to Ada 2005_
31.f/3
- {AI05-0016-1AI05-0016-1} Correction: Fixed the wording so that
- others => <> can be used in place of null record. This is
- needed to avoid a generic contract issue for generic bodies:
- we do not want to have to assume the worst to disallow others
- => <> if the record type might be a null record.
+ {<AI05-0016-1AI05-0016-1>} Correction: Fixed the wording so
+ that others => <> can be used in place of null record. This
+ is needed to avoid a generic contract issue for generic
+ bodies: we do not want to have to assume the worst to disallow
+ others => <> if the record type <might> be a null record.
31.g/3
- {AI05-0199-1AI05-0199-1} Correction: We now allow multiple
+ {<AI05-0199-1AI05-0199-1>} Correction: We now allow multiple
components with anonymous access types to be specified with a
single component association. This is to be consistent with
the capabilities of a named access type.
@@ -22410,12 +22475,12 @@ Examples of record aggregates for tagged types (see
*note 3.9:: and
_Wording Changes from Ada 2012_
31.h/4
- {AI12-0046-1AI12-0046-1} Corrigendum: We explicitly say that
+ {<AI12-0046-1AI12-0046-1>} Corrigendum: We explicitly say that
the Legality Rules have to be rechecked for each component
- individually. This seems obvious, but as the AARM note *note
- 4.3.1:: (16.c) appeared to say that this was not necessary,
- and since we explicitly state this sort of thing for generic
- instances, it seemed better to be explicit.
+ individually. This <seems> obvious, but as the AARM note
+ *note 4.3.1:: (16.c) appeared to say that this was not
+ necessary, and since we explicitly state this sort of thing
+ for generic instances, it seemed better to be explicit.
File: aarm2012.info, Node: 4.3.2, Next: 4.3.3, Prev: 4.3.1, Up: 4.3
@@ -22451,21 +22516,21 @@ ancestor_part.]
_Name Resolution Rules_
4/2
-{AI95-00287-01AI95-00287-01} The expected type for an
+{<AI95-00287-01AI95-00287-01>} The expected type for an
extension_aggregate shall be a single type that is a record extension.
If the ancestor_part is an expression, it is expected to be of any
tagged type.
4.a
- Reason: We could have made the expected type T'Class where T
- is the ultimate ancestor of the type of the aggregate, or we
- could have made it even more specific than that. However, if
- the overload resolution rules get too complicated, the
+ Reason: We could have made the expected type <T'>Class where
+ <T> is the ultimate ancestor of the type of the aggregate, or
+ we could have made it even more specific than that. However,
+ if the overload resolution rules get too complicated, the
implementation gets more difficult and it becomes harder to
produce good error messages.
4.b/3
- Ramification: {AI05-0005-1AI05-0005-1} This rule is additive
+ Ramification: {<AI05-0005-1AI05-0005-1>} This rule is additive
with the rule given in *note 4.3::. That means the *note
4.3:: rule must be satisfied even though it is always
syntactically possible to tell that something is an extension
@@ -22479,24 +22544,24 @@ tagged type.
_Legality Rules_
5/3
-{AI95-00306-01AI95-00306-01} {AI05-0115-1AI05-0115-1} If the
+{<AI95-00306-01AI95-00306-01>} {<AI05-0115-1AI05-0115-1>} If the
ancestor_part is a subtype_mark, it shall denote a specific tagged
subtype. If the ancestor_part is an expression, it shall not be
dynamically tagged. The type of the extension_aggregate shall be a
-descendant of the type of the ancestor_part (the ancestor type), through
-one or more record extensions (and no private extensions). If the
-ancestor_part is a subtype_mark, the view of the ancestor type from
+descendant of the type of the ancestor_part (the <ancestor> type),
+through one or more record extensions (and no private extensions). If
+the ancestor_part is a subtype_mark, the view of the ancestor type from
which the type is descended (see *note 7.3.1::) shall not have unknown
discriminants.
5.a/2
- Reason: {AI95-00306-01AI95-00306-01} The expression cannot be
- dynamically tagged to prevent implicit "truncation" of a
+ Reason: {<AI95-00306-01AI95-00306-01>} The expression cannot
+ be dynamically tagged to prevent implicit "truncation" of a
dynamically-tagged value to the specific ancestor type. This
is similar to the rules in *note 3.9.2::.
5.1/3
-{AI05-0067-1AI05-0067-1} {AI05-0244-1AI05-0244-1} If the type of the
+{<AI05-0067-1AI05-0067-1>} {<AI05-0244-1AI05-0244-1>} If the type of the
ancestor_part is limited and at least one component is needed in the
record_component_association_list, then the ancestor_part shall not be:
@@ -22508,19 +22573,19 @@ record_component_association_list, then the
ancestor_part shall not be:
this rule; nor
5.4/3
- * a conditional_expression having at least one dependent_expression
+ * a conditional_expression having at least one <dependent_>expression
that would violate this rule.
5.b/3
- Reason: {AI05-0067-1AI05-0067-1} {AI05-0244-1AI05-0244-1} This
- restriction simplifies implementation, because it ensures that
- either the caller or the callee knows the size to allocate for
- the aggregate. Without this restriction, information from
- both caller and callee would have to be combined to determine
- the appropriate size.
+ Reason: {<AI05-0067-1AI05-0067-1>} {<AI05-0244-1AI05-0244-1>}
+ This restriction simplifies implementation, because it ensures
+ that either the caller or the callee knows the size to
+ allocate for the aggregate. Without this restriction,
+ information from both caller and callee would have to be
+ combined to determine the appropriate size.
5.c/3
- {AI05-0067-1AI05-0067-1} The (F(...) with null record) case
+ {<AI05-0067-1AI05-0067-1>} The (F(...) with null record) case
is exempt from this rule, because such extension aggregates
are created internally for inherited functions returning
null-extension types -- we can't very well make those illegal.
@@ -22531,7 +22596,7 @@ record_component_association_list, then the
ancestor_part shall not be:
6
For the record_component_association_list (*note 4.3.1: S0108.) of an
-extension_aggregate (*note 4.3.2: S0111.), the only components needed
+extension_aggregate (*note 4.3.2: S0111.), the only components <needed>
are those of the composite value defined by the aggregate that are not
inherited from the type of the ancestor_part (*note 4.3.2: S0112.), plus
any inherited discriminants if the ancestor_part (*note 4.3.2: S0112.)
@@ -22553,14 +22618,14 @@ discriminant is evaluated prior to any other
evaluation or
initialization that depends on it.
8/3
-{AI05-0282-1AI05-0282-1} If the type of the ancestor_part has
+{<AI05-0282-1AI05-0282-1>} If the type of the ancestor_part has
discriminants and the ancestor_part is not a subtype_mark that denotes
an unconstrained subtype, then a check is made that each discriminant
determined by the ancestor_part has the value specified for a
corresponding discriminant, if any, either in the
record_component_association_list (*note 4.3.1: S0108.), or in the
derived_type_definition for some ancestor of the type of the
-extension_aggregate. Constraint_Error is raised if this check fails.
+extension_aggregate. Constraint_Error is raised if this check fails.
8.a
Ramification: Corresponding and specified discriminants are
@@ -22571,7 +22636,7 @@ extension_aggregate. Constraint_Error is raised if this
check fails.
expression.
8.b/3
- {AI05-0282-1AI05-0282-1} The check needs to be made any time
+ {<AI05-0282-1AI05-0282-1>} The check needs to be made any time
that the ancestor is constrained; the source of the
discriminants or the constraints is irrelevant.
@@ -22593,7 +22658,7 @@ extension_aggregate. Constraint_Error is raised if this
check fails.
_Examples_
11
-Examples of extension aggregates (for types defined in *note 3.9.1::):
+<Examples of extension aggregates (for types defined in *note 3.9.1::):>
12
Painted_Point'(Point with Red)
@@ -22602,7 +22667,7 @@ Examples of extension aggregates (for types defined in
*note 3.9.1::):
13
(Expression with Left => 1.2, Right => 3.4)
Addition'(Binop with null record)
- -- presuming Binop is of type Binary_Operation
+ --< presuming Binop is of type Binary_Operation>
_Extensions to Ada 83_
@@ -22612,24 +22677,25 @@ Examples of extension aggregates (for types defined
in *note 3.9.1::):
_Incompatibilities With Ada 95_
13.b/2
- {AI95-00306-01AI95-00306-01} Amendment Correction: Eliminated
- implicit "truncation" of a dynamically tagged value when it is
- used as an ancestor expression. If an aggregate includes such
- an expression, it is illegal in Ada 2005. Such aggregates are
- thought to be rare; the problem can be fixed with a type
- conversion to the appropriate specific type if it occurs.
+ {<AI95-00306-01AI95-00306-01>} Amendment Correction:
+ Eliminated implicit "truncation" of a dynamically tagged value
+ when it is used as an ancestor expression. If an aggregate
+ includes such an expression, it is illegal in Ada 2005. Such
+ aggregates are thought to be rare; the problem can be fixed
+ with a type conversion to the appropriate specific type if it
+ occurs.
_Wording Changes from Ada 95_
13.c/2
- {AI95-00287-01AI95-00287-01} Limited extension_aggregates are
- allowed (since all kinds of aggregates can now be limited, see
- *note 4.3::).
+ {<AI95-00287-01AI95-00287-01>} Limited extension_aggregates
+ are allowed (since all kinds of aggregates can now be limited,
+ see *note 4.3::).
_Inconsistencies With Ada 2005_
13.d/3
- {AI05-0282-1AI05-0282-1} Correction: An extension_aggregate
+ {<AI05-0282-1AI05-0282-1>} Correction: An extension_aggregate
with an ancestor_part whose discriminants are constrained and
inherited might now raise Constraint_Error if the aggregate's
type is constrained, while it was OK in Ada 2005. In almost
@@ -22646,7 +22712,7 @@ Examples of extension aggregates (for types defined in
*note 3.9.1::):
_Incompatibilities With Ada 2005_
13.e/3
- {AI05-0067-1AI05-0067-1} Correction: A limited unconstrained
+ {<AI05-0067-1AI05-0067-1>} Correction: A limited unconstrained
ancestor expression that is a function call is now illegal
unless the extension part is null. Such aggregates were first
introduced in Ada 2005 and are very complex to implement as
@@ -22655,8 +22721,8 @@ Examples of extension aggregates (for types defined in
*note 3.9.1::):
compilers and thus not often used in existing code.
13.f/3
- {AI05-0115-1AI05-0115-1} Correction: An ancestor_part that is
- a subtype with unknown discriminants is now explicitly
+ {<AI05-0115-1AI05-0115-1>} Correction: An ancestor_part that
+ is a subtype with unknown discriminants is now explicitly
illegal. Such a subtype should not be used to declare an
object, and the ancestor_part acts like an object. The Ada 95
rules did not disallow such cases, so it is possible that code
@@ -22692,7 +22758,7 @@ by the values covered by the discrete_choices.
positional_array_aggregate | named_array_aggregate
3/2
- {AI95-00287-01AI95-00287-01} positional_array_aggregate ::=
+ {<AI95-00287-01AI95-00287-01>} positional_array_aggregate ::=
(expression, expression {, expression})
| (expression {, expression}, others => expression)
| (expression {, expression}, others => <>)
@@ -22702,19 +22768,19 @@ by the values covered by the discrete_choices.
(array_component_association {, array_component_association})
5/2
- {AI95-00287-01AI95-00287-01} array_component_association ::=
+ {<AI95-00287-01AI95-00287-01>} array_component_association ::=
discrete_choice_list => expression
| discrete_choice_list => <>
6
-An n-dimensional array_aggregate is one that is written as n levels of
+An <n-dimensional> array_aggregate is one that is written as n levels of
nested array_aggregates (or at the bottom level, equivalent
-string_literals). For the multidimensional case (n >= 2) the
+string_literals). For the multidimensional case (n >= 2) the
array_aggregates (or equivalent string_literals) at the n-1 lower levels
-are called subaggregates of the enclosing n-dimensional array_aggregate.
-The expressions of the bottom level subaggregates (or of the
-array_aggregate itself if one-dimensional) are called the array
-component expressions of the enclosing n-dimensional array_aggregate.
+are called <subaggregate>s of the enclosing n-dimensional
+array_aggregate. The expressions of the bottom level subaggregates (or
+of the array_aggregate itself if one-dimensional) are called the <array
+component expressions> of the enclosing n-dimensional array_aggregate.
6.a
Ramification: Subaggregates do not have a type. They
@@ -22724,29 +22790,29 @@ component expressions of the enclosing n-dimensional
array_aggregate.
subaggregates as well as aggregates that have a type.
6.b
- To be honest: An others choice is the reserved word others as
- it appears in a positional_array_aggregate or as the
+ To be honest: An <others choice> is the reserved word others
+ as it appears in a positional_array_aggregate or as the
discrete_choice of the discrete_choice_list in an
array_component_association.
_Name Resolution Rules_
7/2
-{AI95-00287-01AI95-00287-01} The expected type for an array_aggregate
-(that is not a subaggregate) shall be a single array type. The component
-type of this array type is the expected type for each array component
-expression of the array_aggregate.
+{<AI95-00287-01AI95-00287-01>} The expected type for an array_aggregate
+(that is not a subaggregate) shall be a single array type. The
+component type of this array type is the expected type for each array
+component expression of the array_aggregate.
7.a/2
- Ramification: {AI95-00287-01AI95-00287-01} We already require
- a single array or record type or record extension for an
- aggregate. The above rule requiring a single array type (and
- similar ones for record and extension aggregates) resolves
- which kind of aggregate you have.
+ Ramification: {<AI95-00287-01AI95-00287-01>} We already
+ require a single array or record type or record extension for
+ an aggregate. The above rule requiring a single array type
+ (and similar ones for record and extension aggregates)
+ resolves which kind of aggregate you have.
8
The expected type for each discrete_choice in any discrete_choice_list
-of a named_array_aggregate is the type of the corresponding index; the
+of a named_array_aggregate is the type of the <corresponding index>; the
corresponding index for an array_aggregate that is not a subaggregate is
the first index of its type; for an (n-m)-dimensional subaggregate
within an array_aggregate of an n-dimensional type, the corresponding
@@ -22764,15 +22830,16 @@ n-dimensional array_aggregate.
be an (m-1)-dimensional subaggregate.
10
-An others choice is allowed for an array_aggregate only if an applicable
-index constraint applies to the array_aggregate. [An applicable index
-constraint is a constraint provided by certain contexts where an
-array_aggregate is permitted that can be used to determine the bounds of
-the array value specified by the aggregate.] Each of the following
-contexts (and none other) defines an applicable index constraint:
+An others choice is allowed for an array_aggregate only if an
+<applicable index constraint> applies to the array_aggregate. [An
+applicable index constraint is a constraint provided by certain contexts
+where an array_aggregate is permitted that can be used to determine the
+bounds of the array value specified by the aggregate.] Each of the
+following contexts (and none other) defines an applicable index
+constraint:
11/4
- * {AI95-00318-02AI95-00318-02} {AI12-0157-1AI12-0157-1} For an
+ * {<AI95-00318-02AI95-00318-02>} {<AI12-0157-1AI12-0157-1>} For an
explicit_actual_parameter, an explicit_generic_actual_parameter,
the expression of a return statement, the return expression of an
expression function, the initialization expression in an
@@ -22809,7 +22876,7 @@ contexts (and none other) defines an applicable index
constraint:
used within a larger aggregate.
15/3
- * {AI05-0147-1AI05-0147-1} For a parenthesized expression, the
+ * {<AI05-0147-1AI05-0147-1>} For a parenthesized expression, the
applicable index constraint is that, if any, defined for the
expression;
@@ -22819,12 +22886,12 @@ contexts (and none other) defines an applicable index
constraint:
becomes illegal if parenthesized.
15.1/3
- * {AI05-0147-1AI05-0147-1} For a conditional_expression, the
- applicable index constraint for each dependent_expression is that,
- if any, defined for the conditional_expression.
+ * {<AI05-0147-1AI05-0147-1>} For a conditional_expression, the
+ applicable index constraint for each <dependent_>expression is
+ that, if any, defined for the conditional_expression.
16
-The applicable index constraint applies to an array_aggregate that
+The applicable index constraint <applies> to an array_aggregate that
appears in such a context, as well as to any subaggregates thereof. In
the case of an explicit_actual_parameter (or default_expression) for a
call on a generic formal subprogram, no applicable index constraint is
@@ -22836,7 +22903,7 @@ defined.
subprograms with generic formal subprograms.
17/3
-{AI05-0153-3AI05-0153-3} The discrete_choice_list of an
+{<AI05-0153-3AI05-0153-3>} The discrete_choice_list of an
array_component_association is allowed to have a discrete_choice that is
a nonstatic choice_expression or that is a subtype_indication or range
that defines a nonstatic or null range, only if it is the single
@@ -22848,7 +22915,7 @@ array_component_association in the array_aggregate.
there are other array component expressions as well.
18/3
-{AI05-0262-1AI05-0262-1} In a named_array_aggregate where all
+{<AI05-0262-1AI05-0262-1>} In a named_array_aggregate where all
discrete_choices are static, no two discrete_choices are allowed to
cover the same value (see *note 3.8.1::); if there is no others choice,
the discrete_choices taken together shall exactly cover a contiguous
@@ -22859,7 +22926,7 @@ sequence of values of the corresponding index type.
specified exactly once. See AI83-309.
18.b/3
- Reason: {AI05-0262-1AI05-0262-1} This has to apply even if
+ Reason: {<AI05-0262-1AI05-0262-1>} This has to apply even if
there is only one static discrete_choice; a single choice has
to represent a contiguous range (a subtype_mark with a static
predicate might represent a discontiguous set of values). If
@@ -22897,7 +22964,7 @@ two steps:
2. The array component expressions of the aggregate are evaluated
in an arbitrary order and their values are converted to the
component subtype of the array type; an array component expression
- is evaluated once for each associated component.
+ is evaluated once for each associated component.
23.a
Ramification: Subaggregates are not separately evaluated. The
@@ -22905,9 +22972,9 @@ two steps:
component subtype might raise Constraint_Error.
23.b/3
- {AI05-0005-1AI05-0005-1} We don't need to say that <> is
+ {<AI05-0005-1AI05-0005-1>} We don't need to say that <> is
evaluated once for each component, as <> means that each
- component is initialized by default. That means that the
+ component is <initialized by default>. That means that the
actions defined for default initialization are applied to each
component individually. Initializing one component by default
and copying that to the others would be an incorrect
@@ -22915,13 +22982,14 @@ two steps:
default initialization is known to be constant).
23.1/4
-{AI95-00287-01AI95-00287-01} {AI12-0084-1AI12-0084-1} Each expression in
-an array_component_association defines the value for the associated
-component(s). For an array_component_association with <>, the
-associated component(s) are initialized to the Default_Component_Value
-of the array type if this aspect has been specified for the array type;
-otherwise, they are initialized by default as for a stand-alone object
-of the component subtype (see *note 3.3.1::).
+{<AI95-00287-01AI95-00287-01>} {<AI12-0084-1AI12-0084-1>} Each
+expression in an array_component_association defines the value for the
+associated component(s). For an array_component_association with <>,
+the associated component(s) are initialized to the
+Default_Component_Value of the array type if this aspect has been
+specified for the array type; otherwise, they are initialized by default
+as for a stand-alone object of the component subtype (see *note
+3.3.1::).
24
The bounds of the index range of an array_aggregate [(including a
@@ -22966,8 +23034,8 @@ its bounds is compatible with the corresponding index
subtype.
a subtype. See AI83-00313.
29/3
-{AI05-0037-1AI05-0037-1} For an array_aggregate with an others choice, a
-check is made that no expression or <> is specified for an index value
+{<AI05-0037-1AI05-0037-1>} For an array_aggregate with an others choice,
+a check is made that no expression or <> is specified for an index value
outside the bounds determined by the applicable index constraint.
29.a
@@ -22999,7 +23067,7 @@ fail.
NOTES
32/3
- 11 {AI05-0004-1AI05-0004-1} In an array_aggregate, positional
+ 11 {<AI05-0004-1AI05-0004-1>} In an array_aggregate, positional
notation may only be used with two or more expressions; a single
expression in parentheses is interpreted as a parenthesized
expression. A named_array_aggregate, such as (1 => X), may be used
@@ -23008,30 +23076,30 @@ fail.
_Examples_
33
-Examples of array aggregates with positional associations:
+<Examples of array aggregates with positional associations:>
34
(7, 9, 5, 1, 3, 2, 4, 8, 6, 0)
- Table'(5, 8, 4, 1, others => 0) -- see *note 3.6::
+ Table'(5, 8, 4, 1, others => 0) --< see *note 3.6:: >
35
-Examples of array aggregates with named associations:
+<Examples of array aggregates with named associations:>
36
- (1 .. 5 => (1 .. 8 => 0.0)) -- two-dimensional
- (1 .. N => new Cell) -- N new cells, in particular for N = 0
+ (1 .. 5 => (1 .. 8 => 0.0)) --< two-dimensional>
+ (1 .. N => new Cell) --< N new cells, in particular for N =
0>
37
Table'(2 | 4 | 10 => 1, others => 0)
- Schedule'(Mon .. Fri => True, others => False) -- see *note 3.6::
+ Schedule'(Mon .. Fri => True, others => False) --< see *note 3.6::>
Schedule'(Wed | Sun => False, others => True)
- Vector'(1 => 2.5) -- single-component
vector
+ Vector'(1 => 2.5) --< single-component
vector>
38
-Examples of two-dimensional array aggregates:
+<Examples of two-dimensional array aggregates:>
39
- -- Three aggregates for the same value of subtype Matrix(1..2,1..3) (see
*note 3.6::):
+ --< Three aggregates for the same value of subtype Matrix(1..2,1..3) (see
*note 3.6::):>
40
((1.1, 1.2, 1.3), (2.1, 2.2, 2.3))
@@ -23039,25 +23107,25 @@ Examples of two-dimensional array aggregates:
(1 => (1 => 1.1, 2 => 1.2, 3 => 1.3), 2 => (1 => 2.1, 2 => 2.2, 3 => 2.3))
41
-Examples of aggregates as initial values:
+<Examples of aggregates as initial values:>
42
- A : Table := (7, 9, 5, 1, 3, 2, 4, 8, 6, 0); -- A(1)=7, A(10)=0
- B : Table := (2 | 4 | 10 => 1, others => 0); -- B(1)=0, B(10)=1
- C : constant Matrix := (1 .. 5 => (1 .. 8 => 0.0)); -- C'Last(1)=5,
C'Last(2)=8
+ A : Table := (7, 9, 5, 1, 3, 2, 4, 8, 6, 0); --< A(1)=7, A(10)=0>
+ B : Table := (2 | 4 | 10 => 1, others => 0); --< B(1)=0, B(10)=1>
+ C : constant Matrix := (1 .. 5 => (1 .. 8 => 0.0)); --< C'Last(1)=5,
C'Last(2)=8>
43
- D : Bit_Vector(M .. N) := (M .. N => True); -- see *note 3.6::
+ D : Bit_Vector(M .. N) := (M .. N => True); --< see *note 3.6::>
E : Bit_Vector(M .. N) := (others => True);
- F : String(1 .. 1) := (1 => 'F'); -- a one component aggregate: same as
"F"
+ F : String(1 .. 1) := (1 => 'F'); --< a one component aggregate: same as
"F">
44/2
-{AI95-00433-01AI95-00433-01} Example of an array aggregate with
+{<AI95-00433-01AI95-00433-01>} <Example of an array aggregate with
defaulted others choice and with an applicable index constraint provided
-by an enclosing record aggregate:
+by an enclosing record aggregate:>
45/2
- Buffer'(Size => 50, Pos => 1, Value => String'('x', others => <>)) --
see *note 3.7::
+ Buffer'(Size => 50, Pos => 1, Value => String'('x', others => <>)) --<
see *note 3.7::>
_Incompatibilities With Ada 83_
@@ -23074,7 +23142,7 @@ by an enclosing record aggregate:
with function F (The_S3 : in S3) return Integer;
package Gp is
I : constant Integer := F ((1 => '!', others => '?'));
- -- The aggregate is legal in Ada 83, illegal in Ada 95.
+ -- <The aggregate is legal in Ada 83, illegal in Ada 95.>
end Gp;
45.a.3/1
@@ -23121,19 +23189,19 @@ by an enclosing record aggregate:
_Extensions to Ada 95_
45.f/2
- {AI95-00287-01AI95-00287-01} <> can be used in place of an
+ {<AI95-00287-01AI95-00287-01>} <> can be used in place of an
expression in an array_aggregate, default-initializing the
component.
_Wording Changes from Ada 95_
45.g/2
- {AI95-00287-01AI95-00287-01} Limited array_aggregates are
+ {<AI95-00287-01AI95-00287-01>} Limited array_aggregates are
allowed (since all kinds of aggregates can now be limited, see
*note 4.3::).
45.h/2
- {AI95-00318-02AI95-00318-02} Fixed aggregates to use the
+ {<AI95-00318-02AI95-00318-02>} Fixed aggregates to use the
subtype of the return object of a function, rather than the
result subtype, because they can be different for an
extended_return_statement, and we want to use the subtype
@@ -23142,7 +23210,7 @@ by an enclosing record aggregate:
_Inconsistencies With Ada 2005_
45.i/3
- {AI05-0037-1AI05-0037-1} Correction: Fixed so the check for
+ {<AI05-0037-1AI05-0037-1>} Correction: Fixed so the check for
components outside of the array applies to both expressions
and <>s. As <> was a new feature in Ada 2005, there should be
little existing code that depends on a <> component that is
@@ -23153,13 +23221,14 @@ by an enclosing record aggregate:
_Wording Changes from Ada 2005_
45.j/3
- {AI05-0147-1AI05-0147-1} Added a definition of the applicable
- index constraint for conditional_expressions (which are new).
+ {<AI05-0147-1AI05-0147-1>} Added a definition of the
+ applicable index constraint for conditional_expressions (which
+ are new).
_Inconsistencies With Ada 2012_
45.k/4
- {AI05-0084-1AI05-0084-1} Corrigendum: Fixed so that the
+ {<AI05-0084-1AI05-0084-1>} Corrigendum: Fixed so that the
Default_Component_Value (if any) is used to initialize
components specified with <>. This is what users would
expect, and all Ada 2012 implementation known at the time of
@@ -23170,7 +23239,7 @@ by an enclosing record aggregate:
_Wording Changes from Ada 2012_
45.l/4
- {AI05-0157-1AI05-0157-1} Corrigendum: Added expression
+ {<AI05-0157-1AI05-0157-1>} Corrigendum: Added expression
functions to the contexts that provide an applicable index
constraint, because expression functions are handled
separately in static semantics and legality rules.
@@ -23182,13 +23251,13 @@ File: aarm2012.info, Node: 4.4, Next: 4.5, Prev:
4.3, Up: 4
===============
1/3
-{AI05-0147-1AI05-0147-1} {AI05-0158-1AI05-0158-1}
-{AI05-0176-1AI05-0176-1} An expression is a formula that defines the
+{<AI05-0147-1AI05-0147-1>} {<AI05-0158-1AI05-0158-1>}
+{<AI05-0176-1AI05-0176-1>} An <expression> is a formula that defines the
computation or retrieval of a value. In this International Standard,
the term "expression" refers to a construct of the syntactic category
expression or of any of the following categories: choice_expression,
choice_relation, relation, simple_expression, term, factor, primary,
-conditional_expression, quantified_expression.
+conditional_expression, quantified_expression.
_Syntax_
@@ -23199,7 +23268,7 @@ conditional_expression, quantified_expression.
| relation {xor relation}
2.1/3
- {AI05-0158-1AI05-0158-1} choice_expression ::=
+ {<AI05-0158-1AI05-0158-1>} choice_expression ::=
choice_relation {and choice_relation}
| choice_relation {or choice_relation}
| choice_relation {xor choice_relation}
@@ -23207,23 +23276,24 @@ conditional_expression, quantified_expression.
| choice_relation {or else choice_relation}
2.2/3
- {AI05-0158-1AI05-0158-1} choice_relation ::=
+ {<AI05-0158-1AI05-0158-1>} choice_relation ::=
simple_expression [relational_operator simple_expression]
3/4
- {AI05-0158-1AI05-0158-1} {AI12-0022-1AI12-0022-1}
- {AI12-0039-1AI12-0039-1} relation ::=
+ {<AI05-0158-1AI05-0158-1>} {<AI12-0022-1AI12-0022-1>}
+ {<AI12-0039-1AI12-0039-1>} relation ::=
simple_expression [relational_operator simple_expression]
- | tested_simple_expression [not] in membership_choice_list
+ | <tested_>simple_expression [not] in membership_choice_list
| raise_expression
3.1/3
- {AI05-0158-1AI05-0158-1} membership_choice_list ::=
+ {<AI05-0158-1AI05-0158-1>} membership_choice_list ::=
membership_choice {| membership_choice}
3.2/4
- {AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} membership_choice
- ::= choice_simple_expression | range | subtype_mark
+ {<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>}
+ membership_choice ::= <choice_>simple_expression | range |
+ subtype_mark
4
simple_expression ::= [unary_adding_operator] term {
@@ -23236,8 +23306,8 @@ conditional_expression, quantified_expression.
factor ::= primary [** primary] | abs primary | not primary
7/3
- {AI05-0003-1AI05-0003-1} {AI05-0147-1AI05-0147-1}
- {AI05-0176-1AI05-0176-1} primary ::=
+ {<AI05-0003-1AI05-0003-1>} {<AI05-0147-1AI05-0147-1>}
+ {<AI05-0176-1AI05-0176-1>} primary ::=
numeric_literal | null | string_literal | aggregate
| name | allocator | (expression)
| (conditional_expression) | (quantified_expression)
@@ -23284,7 +23354,7 @@ base range of its type, the implementation may either
raise
Constraint_Error or return the value of the object.
11.a/3
- Ramification: {AI05-0299-1AI05-0299-1} This means that if
+ Ramification: {<AI05-0299-1AI05-0299-1>} This means that if
extra-range intermediates are used to hold the value of an
object of an unconstrained numeric subtype, a Constraint_Error
can be raised on a read of the object, rather than only on an
@@ -23311,36 +23381,36 @@ Constraint_Error or return the value of the object.
_Examples_
12
-Examples of primaries:
+<Examples of primaries:>
13
- 4.0 -- real literal
- Pi -- named number
- (1 .. 10 => 0) -- array aggregate
- Sum -- variable
- Integer'Last -- attribute
- Sine(X) -- function call
- Color'(Blue) -- qualified expression
- Real(M*N) -- conversion
- (Line_Count + 10) -- parenthesized expression
+ 4.0 --< real literal>
+ Pi --< named number>
+ (1 .. 10 => 0) --< array aggregate>
+ Sum --< variable>
+ Integer'Last --< attribute>
+ Sine(X) --< function call>
+ Color'(Blue) --< qualified expression>
+ Real(M*N) --< conversion>
+ (Line_Count + 10) --< parenthesized expression >
14
-Examples of expressions:
+<Examples of expressions:>
15/2
- {AI95-00433-01AI95-00433-01} Volume -- primary
- not Destroyed -- factor
- 2*Line_Count -- term
- -4.0 -- simple expression
- -4.0 + A -- simple expression
- B**2 - 4.0*A*C -- simple expression
- R*Sin([Unicode 952])*Cos([Unicode 966]) -- simple expression
- Password(1 .. 3) = "Bwv" -- relation
- Count in Small_Int -- relation
- Count not in Small_Int -- relation
- Index = 0 or Item_Hit -- expression
- (Cold and Sunny) or Warm -- expression (parentheses are required)
- A**(B**C) -- expression (parentheses are required)
+ {<AI95-00433-01AI95-00433-01>} Volume --< primary>
+ not Destroyed --< factor>
+ 2*Line_Count --< term>
+ -4.0 --< simple expression>
+ -4.0 + A --< simple expression>
+ B**2 - 4.0*A*C --< simple expression>
+ R*Sin([Unicode 952])*Cos([Unicode 966]) --< simple expression>
+ Password(1 .. 3) = "Bwv" --< relation>
+ Count in Small_Int --< relation>
+ Count not in Small_Int --< relation>
+ Index = 0 or Item_Hit --< expression>
+ (Cold and Sunny) or Warm --< expression (parentheses are required)>
+ A**(B**C) --< expression (parentheses are required)>
_Extensions to Ada 83_
@@ -23367,22 +23437,22 @@ Examples of expressions:
_Wording Changes from Ada 2005_
15.c/3
- {AI05-0003-1AI05-0003-1} Moved qualified_expression from
+ {<AI05-0003-1AI05-0003-1>} Moved qualified_expression from
primary to name (see *note 4.1::). This allows the use of
qualified_expressions in more places.
15.d/3
- {AI05-0147-1AI05-0147-1} {AI05-0176-1AI05-0176-1} Added
+ {<AI05-0147-1AI05-0147-1>} {<AI05-0176-1AI05-0176-1>} Added
conditional_expression and quantified_expression to primary.
15.e/3
- {AI05-0158-1AI05-0158-1} Expanded membership test syntax (see
- *note 4.5.2::).
+ {<AI05-0158-1AI05-0158-1>} Expanded membership test syntax
+ (see *note 4.5.2::).
_Inconsistencies With Ada 2012_
15.f/4
- {AI12-0039-1AI12-0039-1} Corrigendum: Revised membership
+ {<AI12-0039-1AI12-0039-1>} Corrigendum: Revised membership
syntax to eliminate ambiguities. In some cases, previously
ambiguous membership expressions will now have an unambiguous
meaning. If an Ada 2012 implementation chose the "wrong"
@@ -23402,7 +23472,7 @@ Examples of expressions:
_Incompatibilities With Ada 2012_
15.g/4
- {AI12-0039-1AI12-0039-1} Corrigendum: The revised membership
+ {<AI12-0039-1AI12-0039-1>} Corrigendum: The revised membership
syntax will require parentheses in membership_choice_lists in
some cases where the Ada 2012 grammar did not require them.
For instance, A in B in C | D is now illegal. However, such
@@ -23472,10 +23542,10 @@ Parentheses can be used to impose specific
associations.
9
For each form of type definition, certain of the above operators are
-predefined; that is, they are implicitly declared immediately after the
-type definition. For each such implicit operator declaration, the
-parameters are called Left and Right for binary operators; the single
-parameter is called Right for unary operators. [An expression of the
+<predefined>; that is, they are implicitly declared immediately after
+the type definition. For each such implicit operator declaration, the
+parameters are called Left and Right for <binary> operators; the single
+parameter is called Right for <unary> operators. [An expression of the
form X op Y, where op is a binary operator, is equivalent to a
function_call of the form "op"(X, Y). An expression of the form op Y,
where op is a unary operator, is equivalent to a function_call of the
@@ -23547,18 +23617,18 @@ association.
_Examples_
15
-Examples of precedence:
+<Examples of precedence:>
16
- not Sunny or Warm -- same as (not Sunny) or Warm
- X > 4.0 and Y > 0.0 -- same as (X > 4.0) and (Y > 0.0)
+ not Sunny or Warm --< same as (not Sunny) or Warm>
+ X > 4.0 and Y > 0.0 --< same as (X > 4.0) and (Y > 0.0)>
17
- -4.0*A**2 -- same as -(4.0 * (A**2))
- abs(1 + A) + B -- same as (abs (1 + A)) + B
- Y**(-3) -- parentheses are necessary
- A / B * C -- same as (A/B)*C
- A + (B + C) -- evaluate B + C before adding it to A
+ -4.0*A**2 --< same as -(4.0 * (A**2))>
+ abs(1 + A) + B --< same as (abs (1 + A)) + B>
+ Y**(-3) --< parentheses are necessary>
+ A / B * C --< same as (A/B)*C>
+ A + (B + C) --< evaluate B + C before adding it to A >
_Wording Changes from Ada 83_
@@ -23591,8 +23661,9 @@ File: aarm2012.info, Node: 4.5.1, Next: 4.5.2, Up:
4.5
1
An expression consisting of two relations connected by and then or or
-else (a short-circuit control form) shall resolve to be of some boolean
-type; the expected type for both relations is that same boolean type.
+else (a <short-circuit control form>) shall resolve to be of some
+boolean type; the expected type for both relations is that same boolean
+type.
1.a
Reason: This rule is written this way so that overload
@@ -23604,40 +23675,40 @@ type; the expected type for both relations is that
same boolean type.
_Static Semantics_
2
-The following logical operators are predefined for every boolean type T,
-for every modular type T, and for every one-dimensional array type T
-whose component type is a boolean type:
+The following logical operators are predefined for every boolean type
+<T>, for every modular type <T>, and for every one-dimensional array
+type <T> whose component type is a boolean type:
3
- function "and"(Left, Right : T) return T
- function "or" (Left, Right : T) return T
- function "xor"(Left, Right : T) return T
+ function "and"(Left, Right : <T>) return <T>
+ function "or" (Left, Right : <T>) return <T>
+ function "xor"(Left, Right : <T>) return <T>
3.a/2
- This paragraph was deleted.{AI95-00145-01AI95-00145-01}
+ <This paragraph was deleted.>{<AI95-00145-01AI95-00145-01>}
3.b/2
- Ramification: {AI95-00145-01AI95-00145-01} For these
+ Ramification: {<AI95-00145-01AI95-00145-01>} For these
operators, we are talking about the type without any
(interesting) subtype, and not some subtype with a constraint
or exclusion. Since it's possible that there is no name for
the "uninteresting" subtype, we denote the type with an
- italicized T. This applies to the italicized T in many other
- predefined operators and attributes as well.
+ italicized <T>. This applies to the italicized <T> in many
+ other predefined operators and attributes as well.
3.c/2
- {AI95-00145-01AI95-00145-01} In many cases, there is a subtype
- with the correct properties available. The italicized T
- means:
+ {<AI95-00145-01AI95-00145-01>} In many cases, there is a
+ subtype with the correct properties available. The italicized
+ <T> means:
3.d/2
- * T'Base, for scalars;
+ * <T>'Base, for scalars;
3.e/2
- * the first subtype of T, for tagged types;
+ * the first subtype of <T>, for tagged types;
3.f/2
- * a subtype of the type T without any constraint or null
+ * a subtype of the type <T> without any constraint or null
exclusion, in other cases.
3.g/2
@@ -23648,13 +23719,13 @@ whose component type is a boolean type:
3.h/2
Thus, the last case often is the same as the first subtype of
- T, but that isn't the case for constrained array types (where
- the correct subtype is unconstrained) and for access types
- with a null_exclusion (where the correct subtype does not
- exclude null).
+ <T>, but that isn't the case for constrained array types
+ (where the correct subtype is unconstrained) and for access
+ types with a null_exclusion (where the correct subtype does
+ not exclude null).
3.i/2
- This italicized T is used for defining operators and
+ This italicized <T> is used for defining operators and
attributes of the language. The meaning is intended to be as
described here.
@@ -23690,8 +23761,8 @@ determines the result.
8
For the logical operators on arrays, a check is made that for each
component of the left operand there is a matching component of the right
-operand, and vice versa. Also, a check is made that each component of
-the result belongs to the component subtype. The exception
+operand, and vice versa. Also, a check is made that each component of
+the result belongs to the component subtype. The exception
Constraint_Error is raised if either of the above checks fails.
8.a
@@ -23715,17 +23786,17 @@ Constraint_Error is raised if either of the above
checks fails.
_Examples_
11
-Examples of logical operators:
+<Examples of logical operators:>
12
Sunny or Warm
- Filter(1 .. 10) and Filter(15 .. 24) -- see *note 3.6.1::
+ Filter(1 .. 10) and Filter(15 .. 24) --< see *note 3.6.1:: >
13
-Examples of short-circuit control forms:
+<Examples of short-circuit control forms:>
14
- Next_Car.Owner /= null and then Next_Car.Owner.Age > 25 -- see *note
3.10.1::
+ Next_Car.Owner /= null and then Next_Car.Owner.Age > 25 --< see *note
3.10.1::>
N = 0 or else A(N) = Hit_Value
@@ -23735,21 +23806,21 @@ File: aarm2012.info, Node: 4.5.2, Next: 4.5.3,
Prev: 4.5.1, Up: 4.5
-----------------------------------------------
1
-[ The equality operators = (equals) and /= (not equals) are predefined
-for nonlimited types. The other relational_operators are the ordering
-operators < (less than), <= (less than or equal), > (greater than), and
->= (greater than or equal). The ordering operators are predefined for
-scalar types, and for discrete array types, that is, one-dimensional
+[ The <equality operators> = (equals) and /= (not equals) are predefined
+for nonlimited types. The other relational_operators are the <ordering
+operators> < (less than), <= (less than or equal), > (greater than), and
+>= (greater than or equal). The ordering operators are predefined for
+scalar types, and for <discrete array types>, that is, one-dimensional
array types whose components are of a discrete type.
1.a
- Ramification: The equality operators are not defined for every
- nonlimited type -- see below for the exact rule.
+ Ramification: The equality operators are not defined for
+ <every> nonlimited type -- see below for the exact rule.
2/3
-{AI05-0262-1AI05-0262-1} {AI05-0269-1AI05-0269-1} A membership test,
-using in or not in, determines whether or not a value belongs to any
-given subtype or range, is equal to any given value, has a tag that
+{<AI05-0262-1AI05-0262-1>} {<AI05-0269-1AI05-0269-1>} A <membership
+test>, using in or not in, determines whether or not a value belongs to
+any given subtype or range, is equal to any given value, has a tag that
identifies a type that is covered by a given type, or is convertible to
and has an accessibility level appropriate for a given access type.
Membership tests are allowed for all types.]
@@ -23757,50 +23828,50 @@ Membership tests are allowed for all types.]
_Name Resolution Rules_
3/3
-{AI95-00251-01AI95-00251-01} {AI05-0158-1AI05-0158-1} The tested type of
-a membership test is determined by the membership_choices of the
-membership_choice_list. Either all membership_choices of the
+{<AI95-00251-01AI95-00251-01>} {<AI05-0158-1AI05-0158-1>} The <tested
+type> of a membership test is determined by the membership_choices of
+the membership_choice_list. Either all membership_choices of the
membership_choice_list shall resolve to the same type, which is the
tested type; or each membership_choice shall be of an elementary type,
and the tested type shall be covered by each of these elementary types.
3.1/4
-{AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} If the tested type is
-tagged, then the tested_simple_expression shall resolve to be of a type
-that is convertible (see *note 4.6::) to the tested type; if untagged,
-the expected type for the tested_simple_expression is the tested type.
-The expected type of a choice_simple_expression in a membership_choice,
-and of a simple_expression of a range in a membership_choice, is the
-tested type of the membership operation.
+{<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>} If the tested type
+is tagged, then the <tested_>simple_expression shall resolve to be of a
+type that is convertible (see *note 4.6::) to the tested type; if
+untagged, the expected type for the <tested_>simple_expression is the
+tested type. The expected type of a <choice_>simple_expression in a
+membership_choice, and of a simple_expression of a range in a
+membership_choice, is the tested type of the membership operation.
3.a/2
- Reason: {AI95-00230-01AI95-00230-01} The part of the rule for
- untagged types is stated in a way that ensures that operands
- like a string literal are still legal as operands of a
- membership test.
+ Reason: {<AI95-00230-01AI95-00230-01>} The part of the rule
+ for untagged types is stated in a way that ensures that
+ operands like a string literal are still legal as operands of
+ a membership test.
3.b/4
- {AI95-00251-01AI95-00251-01} {AI12-0039-1AI12-0039-1} The
+ {<AI95-00251-01AI95-00251-01>} {<AI12-0039-1AI12-0039-1>} The
significance of "is convertible to" is that we allow the
- tested_simple_expression to be of any class-wide type that
+ <tested_>simple_expression to be of any class-wide type that
could be converted to the tested type, not just the one rooted
at the tested type. This includes any class-wide type that
covers the tested type, along with class-wide interfaces in
some cases.
3.c/3
- {AI05-0158-1AI05-0158-1} The special rule for determining the
- tested type for elementary types is to allow numeric literals
- in membership_choice_lists. Without the rule, A in B | 1
- would be illegal as B and 1 would have different types (the
- literal having type universal integer).
+ {<AI05-0158-1AI05-0158-1>} The special rule for determining
+ the tested type for elementary types is to allow numeric
+ literals in membership_choice_lists. Without the rule, A in B
+ | 1 would be illegal as B and 1 would have different types
+ (the literal having type <universal integer>).
_Legality Rules_
4/4
-{AI12-0039-1AI12-0039-1} For a membership test, if the
-tested_simple_expression is of a tagged class-wide type, then the tested
-type shall be (visibly) tagged.
+{<AI12-0039-1AI12-0039-1>} For a membership test, if the
+<tested_>simple_expression is of a tagged class-wide type, then the
+tested type shall be (visibly) tagged.
4.a
Ramification: Untagged types covered by the tagged class-wide
@@ -23812,13 +23883,13 @@ type shall be (visibly) tagged.
class-wide type.
4.1/4
-{AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} If a membership test
-includes one or more choice_simple_expressions and the tested type of
-the membership test is limited, then the tested type of the membership
-test shall have a visible primitive equality operator.
+{<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>} If a membership
+test includes one or more <choice_>simple_expressions and the tested
+type of the membership test is limited, then the tested type of the
+membership test shall have a visible primitive equality operator.
4.b/3
- Reason: {AI05-0158-1AI05-0158-1} A visible equality operator
+ Reason: {<AI05-0158-1AI05-0158-1>} A visible equality operator
is required in order to avoid breaking privacy; that is, we
don't want to depend on a hidden equality operator.
@@ -23828,54 +23899,56 @@ test shall have a visible primitive equality operator.
The result type of a membership test is the predefined type Boolean.
6
-The equality operators are predefined for every specific type T that is
-not limited, and not an anonymous access type, with the following
+The equality operators are predefined for every specific type <T> that
+is not limited, and not an anonymous access type, with the following
specifications:
7
- function "=" (Left, Right : T) return Boolean
- function "/="(Left, Right : T) return Boolean
+ function "=" (Left, Right : <T>) return Boolean
+ function "/="(Left, Right : <T>) return Boolean
7.1/2
-{AI95-00230-01AI95-00230-01} The following additional equality operators
-for the universal_access type are declared in package Standard for use
-with anonymous access types:
+{<AI95-00230-01AI95-00230-01>} The following additional equality
+operators for the <universal_access> type are declared in package
+Standard for use with anonymous access types:
7.2/2
- function "=" (Left, Right : universal_access) return Boolean
- function "/="(Left, Right : universal_access) return Boolean
+ function "=" (Left, Right : <universal_access>) return Boolean
+ function "/="(Left, Right : <universal_access>) return Boolean
8
-The ordering operators are predefined for every specific scalar type T,
-and for every discrete array type T, with the following specifications:
+The ordering operators are predefined for every specific scalar type
+<T>, and for every discrete array type <T>, with the following
+specifications:
9
- function "<" (Left, Right : T) return Boolean
- function "<="(Left, Right : T) return Boolean
- function ">" (Left, Right : T) return Boolean
- function ">="(Left, Right : T) return Boolean
+ function "<" (Left, Right : <T>) return Boolean
+ function "<="(Left, Right : <T>) return Boolean
+ function ">" (Left, Right : <T>) return Boolean
+ function ">="(Left, Right : <T>) return Boolean
_Name Resolution Rules_
9.1/2
-{AI95-00230-01AI95-00230-01} {AI95-00420-01AI95-00420-01} At least one
-of the operands of an equality operator for universal_access shall be of
-a specific anonymous access type. Unless the predefined equality
+{<AI95-00230-01AI95-00230-01>} {<AI95-00420-01AI95-00420-01>} At least
+one of the operands of an equality operator for <universal_access> shall
+be of a specific anonymous access type. Unless the predefined equality
operator is identified using an expanded name with prefix denoting the
package Standard, neither operand shall be of an access-to-object type
-whose designated type is D or D'Class, where D has a user-defined
+whose designated type is <D> or <D>'Class, where <D> has a user-defined
primitive equality operator such that:
9.2/2
* its result type is Boolean;
9.3/3
- * {AI05-0020-1AI05-0020-1} it is declared immediately within the same
- declaration list as D or any partial or incomplete view of D; and
+ * {<AI05-0020-1AI05-0020-1>} it is declared immediately within the
+ same declaration list as <D> or any partial or incomplete view of
+ <D>; and
9.4/2
* at least one of its operands is an access parameter with designated
- type D.
+ type <D>.
9.a/2
Reason: The first sentence prevents compatibility problems by
@@ -23903,9 +23976,9 @@ primitive equality operator such that:
_Legality Rules_
9.5/2
-{AI95-00230-01AI95-00230-01} At least one of the operands of the
-equality operators for universal_access shall be of type
-universal_access, or both shall be of access-to-object types, or both
+{<AI95-00230-01AI95-00230-01>} At least one of the operands of the
+equality operators for <universal_access> shall be of type
+<universal_access>, or both shall be of access-to-object types, or both
shall be of access-to-subprogram types. Further:
9.6/2
@@ -23931,11 +24004,11 @@ shall be of access-to-subprogram types. Further:
restrictions on Ada implementations.
9.8/4
-{AI05-0123-1AI05-0123-1} {AI12-0101-1AI12-0101-1} If the profile of an
-explicitly declared primitive equality operator of an untagged record
+{<AI05-0123-1AI05-0123-1>} {<AI12-0101-1AI12-0101-1>} If the profile of
+an explicitly declared primitive equality operator of an untagged record
type is type conformant with that of the corresponding predefined
equality operator, the declaration shall occur before the type is
-frozen. In addition to the places where Legality Rules normally apply
+frozen. In addition to the places where Legality Rules normally apply
(see *note 12.3::), this rule applies also in the private part of an
instance of a generic unit.
@@ -23953,7 +24026,7 @@ operands, subject to the accuracy of the type.
11.a
Ramification: For floating point types, the results of
- comparing nearly equal values depends on the accuracy of the
+ comparing <nearly> equal values depends on the accuracy of the
implementation (see *note G.2.1::, "*note G.2.1:: Model of
Floating Point Arithmetic" for implementations that support
the Numerics Annex).
@@ -23972,7 +24045,7 @@ or if both are equal to the null value of the access
type.
Two access-to-subprogram values are equal if they are the result of the
same evaluation of an Access attribute_reference, or if both are equal
to the null value of the access type. Two access-to-subprogram values
-are unequal if they designate different subprograms. [It is unspecified
+are unequal if they designate different subprograms. [It is unspecified
whether two access values that designate the same subprogram but are the
result of distinct evaluations of Access attribute_references are equal
or unequal.]
@@ -23983,7 +24056,7 @@ or unequal.]
necessary to support an indirect call.
14/3
-{AI05-0123-1AI05-0123-1} For a type extension, predefined equality is
+{<AI05-0123-1AI05-0123-1>} For a type extension, predefined equality is
defined in terms of the primitive [(possibly user-defined)] equals
operator for the parent type and for any components that have a record
type in the extension part, and predefined equality for any other
@@ -24001,7 +24074,7 @@ components not inherited from the parent type.
them equal.
14.b/2
- {AI95-00349-01AI95-00349-01} The full type extension's
+ {<AI95-00349-01AI95-00349-01>} The full type extension's
operation is used for a private extension. This follows as
only full types have parent types; the type specified in a
private extension is an ancestor, but not necessarily the
@@ -24014,7 +24087,7 @@ components not inherited from the parent type.
private
type Typ3 is new Pak1.Typ2 with null record;
end Pak2;
-
+
14.d/2
the parent type is Pak1.Typ2, not Pak1.Typ1, and the equality
@@ -24022,9 +24095,9 @@ components not inherited from the parent type.
for Typ3.
14.1/3
-{AI05-0123-1AI05-0123-1} For a derived type whose parent is an untagged
-record type, predefined equality is defined in terms of the primitive
-(possibly user-defined) equals operator of the parent type.
+{<AI05-0123-1AI05-0123-1>} For a derived type whose parent is an
+untagged record type, predefined equality is defined in terms of the
+primitive (possibly user-defined) equals operator of the parent type.
14.e/3
Reason: This prevents predefined equality from reemerging in
@@ -24033,7 +24106,7 @@ record type, predefined equality is defined in terms of
the primitive
primitive.
15/3
-{AI05-0123-1AI05-0123-1} For a private type, if its full type is a
+{<AI05-0123-1AI05-0123-1>} For a private type, if its full type is a
record type, predefined equality is defined in terms of the primitive
equals operator of the full type; otherwise, predefined equality for the
private type is that of its full type.
@@ -24042,7 +24115,7 @@ private type is that of its full type.
For other composite types, the predefined equality operators [(and
certain other predefined operations on composite types -- see *note
4.5.1:: and *note 4.6::)] are defined in terms of the corresponding
-operation on matching components, defined as follows:
+operation on <matching components>, defined as follows:
17
* For two composite objects or values of the same non-array type,
@@ -24082,13 +24155,13 @@ composite types covered earlier) is defined as
follows:
False;
24/3
- * {AI05-0123-1AI05-0123-1} Otherwise, the result is defined in terms
- of the primitive equals operator for any matching components that
- are records, and the predefined equals for any other matching
+ * {<AI05-0123-1AI05-0123-1>} Otherwise, the result is defined in
+ terms of the primitive equals operator for any matching components
+ that are records, and the predefined equals for any other matching
components.
24.a/3
- Reason: {AI05-0123-1AI05-0123-1} This asymmetry between
+ Reason: {<AI05-0123-1AI05-0123-1>} This asymmetry between
components with and without a record type is necessary to
preserve most upward compatibility and corresponds with the
corresponding situation with generics, where the predefined
@@ -24108,8 +24181,8 @@ composite types covered earlier) is defined as follows:
equal; two null records of the same type are always equal.
24.c/3
- {AI05-0123-1AI05-0123-1} Note that if a composite object has a
- component of a floating point type, and the floating point
+ {<AI05-0123-1AI05-0123-1>} Note that if a composite object has
+ a component of a floating point type, and the floating point
type has both a plus and minus zero, which are considered
equal by the predefined equality, then a block compare cannot
be used for the predefined composite equality. Of course,
@@ -24122,19 +24195,19 @@ composite types covered earlier) is defined as
follows:
(integer) zero.
24.d/2
- To be honest: {AI95-00230-01AI95-00230-01} For a component
+ To be honest: {<AI95-00230-01AI95-00230-01>} For a component
with an anonymous access type, "predefined equality" is that
- defined for the universal_access type (anonymous access types
- have no equality operators of their own).
+ defined for the <universal_access> type (anonymous access
+ types have no equality operators of their own).
24.e/3
- {AI05-0123-1AI05-0123-1} For a component with a record type T,
- "the primitive equals operator" is the one with two parameters
- of T which returns Boolean. We're not talking about some
- random other primitive function named "=".
+ {<AI05-0123-1AI05-0123-1>} For a component with a record type
+ <T>, "the primitive equals operator" is the one with two
+ parameters of <T> which returns Boolean. We're not talking
+ about some random other primitive function named "=".
24.1/3
-{AI05-0123-1AI05-0123-1} If the primitive equals operator for an
+{<AI05-0123-1AI05-0123-1>} If the primitive equals operator for an
untagged record type is abstract, then Program_Error is raised at the
point of any (implicit) call to that abstract subprogram.
@@ -24150,7 +24223,7 @@ point of any (implicit) call to that abstract
subprogram.
does not occur.
24.2/1
-{8652/00168652/0016} {AI95-00123-01AI95-00123-01} For any composite
+{<8652/00168652/0016>} {<AI95-00123-01AI95-00123-01>} For any composite
type, the order in which "=" is called for components is unspecified.
Furthermore, if the result can be determined before calling "=" on some
components, it is unspecified whether "=" is called on those components.
@@ -24166,8 +24239,8 @@ predefined "=" operator.
give the complementary result. See *note 6.6::.
26/3
-{AI05-0264-1AI05-0264-1} For a discrete array type, the predefined
-ordering operators correspond to lexicographic order using the
+{<AI05-0264-1AI05-0264-1>} For a discrete array type, the predefined
+ordering operators correspond to <lexicographic order> using the
predefined order relation of the component type: A null array is
lexicographically less than any array having at least one component. In
the case of nonnull arrays, the left operand is lexicographically less
@@ -24175,60 +24248,61 @@ than the right operand if the first component of the
left operand is
less than that of the right; otherwise, the left operand is
lexicographically less than the right operand only if their first
components are equal and the tail of the left operand is
-lexicographically less than that of the right (the tail consists of the
-remaining components beyond the first and can be null).
+lexicographically less than that of the right (the <tail> consists of
+the remaining components beyond the first and can be null).
26.1/3
-{AI05-0269-1AI05-0269-1} An individual membership test is the membership
-test of a single membership_choice.
+{<AI05-0269-1AI05-0269-1>} An <individual membership test> is the
+membership test of a single membership_choice.
27/4
-{AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} For the evaluation of
-a membership test using in whose membership_choice_list has a single
-membership_choice, the tested_simple_expression and the
+{<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>} For the evaluation
+of a membership test using in whose membership_choice_list has a single
+membership_choice, the <tested_>simple_expression and the
membership_choice are evaluated in an arbitrary order; the result is the
result of the individual membership test for the membership_choice.
27.1/4
-{AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} For the evaluation of
-a membership test using in whose membership_choice_list has more than
-one membership_choice, the tested_simple_expression of the membership
+{<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>} For the evaluation
+of a membership test using in whose membership_choice_list has more than
+one membership_choice, the <tested_>simple_expression of the membership
test is evaluated first and the result of the operation is equivalent to
that of a sequence consisting of an individual membership test on each
membership_choice combined with the short-circuit control form or else.
27.a.1/3
- Ramification: {AI05-0158-1AI05-0158-1} This equivalence
+ Ramification: {<AI05-0158-1AI05-0158-1>} This equivalence
includes the evaluation of the membership_choices; evaluation
stops as soon as an individual choice evaluates to True.
28/3
-{AI05-0158-1AI05-0158-1} {AI05-0269-1AI05-0269-1} An individual
+{<AI05-0158-1AI05-0158-1>} {<AI05-0269-1AI05-0269-1>} An individual
membership test yields the result True if:
28.1/4
- * {AI05-0158-1AI05-0158-1} {AI05-0264-1AI05-0264-1}
- {AI12-0039-1AI12-0039-1} The membership_choice is a
- choice_simple_expression, and the tested_simple_expression is equal
- to the value of the membership_choice. If the tested type is a
- record type or a limited type, the test uses the primitive equality
- for the type; otherwise, the test uses predefined equality.
+ * {<AI05-0158-1AI05-0158-1>} {<AI05-0264-1AI05-0264-1>}
+ {<AI12-0039-1AI12-0039-1>} The membership_choice is a
+ <choice_>simple_expression, and the <tested_>simple_expression is
+ equal to the value of the membership_choice. If the tested type is
+ a record type or a limited type, the test uses the primitive
+ equality for the type; otherwise, the test uses predefined
+ equality.
28.2/4
- * {AI05-0153-3AI05-0153-3} {AI05-0158-1AI05-0158-1}
- {AI12-0039-1AI12-0039-1} The membership_choice is a range and the
- value of the tested_simple_expression belongs to the given range.
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0158-1AI05-0158-1>}
+ {<AI12-0039-1AI12-0039-1>} The membership_choice is a range and the
+ value of the <tested_>simple_expression belongs to the given range.
29/4
- * {AI05-0153-3AI05-0153-3} {AI05-0158-1AI05-0158-1}
- {AI12-0039-1AI12-0039-1} {AI12-0071-1AI12-0071-1} The
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0158-1AI05-0158-1>}
+ {<AI12-0039-1AI12-0039-1>} {<AI12-0071-1AI12-0071-1>} The
membership_choice is a subtype_mark, the tested type is scalar, the
- value of the tested_simple_expression belongs to the range of the
+ value of the <tested_>simple_expression belongs to the range of the
named subtype, and the value satisfies the predicates of the named
subtype.
29.a/3
- Ramification: {AI05-0153-3AI05-0153-3} The scalar membership
+ Ramification: {<AI05-0153-3AI05-0153-3>} The scalar membership
test only does a range check and a predicate check. It does
not perform any other check, such as whether a value falls in
a "hole" of a "holey" enumeration type. The Pos attribute
@@ -24241,79 +24315,79 @@ membership test yields the result True if:
outside Float'Range.
30/4
- * {AI95-00231-01AI95-00231-01} {AI05-0153-3AI05-0153-3}
- {AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1}
- {AI12-0071-1AI12-0071-1} The membership_choice is a subtype_mark,
+ * {<AI95-00231-01AI95-00231-01>} {<AI05-0153-3AI05-0153-3>}
+ {<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>}
+ {<AI12-0071-1AI12-0071-1>} The membership_choice is a subtype_mark,
the tested type is not scalar, the value of the
- tested_simple_expression satisfies any constraints of the named
+ <tested_>simple_expression satisfies any constraints of the named
subtype, the value satisfies the predicates of the named subtype,
and:
30.1/4
- * {AI95-00231-01AI95-00231-01} {AI12-0039-1AI12-0039-1} if
- the type of the tested_simple_expression is class-wide,
- the value has a tag that identifies a type covered by the
- tested type;
+ * {<AI95-00231-01AI95-00231-01>} {<AI12-0039-1AI12-0039-1>}
+ if the type of the <tested_>simple_expression is
+ class-wide, the value has a tag that identifies a type
+ covered by the tested type;
30.a/4
- Ramification: {AI12-0039-1AI12-0039-1} Note that the tag is
- not checked if the tested_simple_expression is of a specific
+ Ramification: {<AI12-0039-1AI12-0039-1>} Note that the tag is
+ not checked if the <tested_>simple_expression is of a specific
type.
30.2/4
- * {AI95-00231-01AI95-00231-01} {AI05-0149-1AI05-0149-1}
- {AI12-0039-1AI12-0039-1} if the tested type is an access
- type and the named subtype excludes null, the value of
- the tested_simple_expression is not null;
+ * {<AI95-00231-01AI95-00231-01>} {<AI05-0149-1AI05-0149-1>}
+ {<AI12-0039-1AI12-0039-1>} if the tested type is an
+ access type and the named subtype excludes null, the
+ value of the <tested_>simple_expression is not null;
30.3/4
- * {AI05-0149-1AI05-0149-1} {AI12-0039-1AI12-0039-1} if the
- tested type is a general access-to-object type, the type
- of the tested_simple_expression is convertible to the
- tested type and its accessibility level is no deeper than
- that of the tested type; further, if the designated type
- of the tested type is tagged and the
- tested_simple_expression is nonnull, the tag of the
+ * {<AI05-0149-1AI05-0149-1>} {<AI12-0039-1AI12-0039-1>} if
+ the tested type is a general access-to-object type, the
+ type of the <tested_>simple_expression is convertible to
+ the tested type and its accessibility level is no deeper
+ than that of the tested type; further, if the designated
+ type of the tested type is tagged and the
+ <tested_>simple_expression is nonnull, the tag of the
object designated by the value of the
- tested_simple_expression is covered by the designated
+ <tested_>simple_expression is covered by the designated
type of the tested type.
31/3
-{AI05-0264-1AI05-0264-1} Otherwise, the test yields the result False.
+{<AI05-0264-1AI05-0264-1>} Otherwise, the test yields the result False.
32
A membership test using not in gives the complementary result to the
corresponding membership test using in.
32.a/4
- To be honest: {AI05-0158-1AI05-0158-1}
- {AI12-0039-1AI12-0039-1} X not in A | B | C is intended to be
- exactly equivalent to not (X in A | B | C), including the
- order of evaluation of the tested_simple_expression and
- membership_choices.
+ To be honest: {<AI05-0158-1AI05-0158-1>}
+ {<AI12-0039-1AI12-0039-1>} <X> not in <A> | <B> | <C> is
+ intended to be exactly equivalent to not (<X> in <A> | <B> |
+ <C>), including the order of evaluation of the
+ <tested_>simple_expression and membership_choices.
_Implementation Requirements_
32.1/1
-{8652/00168652/0016} {AI95-00123-01AI95-00123-01} For all nonlimited
+{<8652/00168652/0016>} {<AI95-00123-01AI95-00123-01>} For all nonlimited
types declared in language-defined packages, the "=" and "/=" operators
of the type shall behave as if they were the predefined equality
operators for the purposes of the equality of composite types and
generic formal types.
32.a.1/3
- Ramification: {AI95-00123-01AI95-00123-01}
- {AI05-0123-1AI05-0123-1} If any language-defined types are
+ Ramification: {<AI95-00123-01AI95-00123-01>}
+ {<AI05-0123-1AI05-0123-1>} If any language-defined types are
implemented with a user-defined "=" operator, then either the
full type must be a record type, or the compiler must use
"magic" to implement equality for this type. A normal
- user-defined "=" operator for a non-record type does not meet
- this requirement.
+ user-defined "=" operator for a non-record type does <not>
+ meet this requirement.
NOTES
33/2
- This paragraph was deleted.{AI95-00230-01AI95-00230-01}
+ <This paragraph was deleted.>{<AI95-00230-01AI95-00230-01>}
34
14 If a composite type has components that depend on
@@ -24325,28 +24399,28 @@ generic formal types.
_Examples_
35
-Examples of expressions involving relational operators and membership
-tests:
+<Examples of expressions involving relational operators and membership
+tests:>
36
X /= Y
37
- "" < "A" and "A" < "Aa" -- True
- "Aa" < "B" and "A" < "A " -- True
+ "" < "A" and "A" < "Aa" --< True>
+ "Aa" < "B" and "A" < "A " --< True>
38/3
- {AI05-0264-1AI05-0264-1} My_Car = null -- True if My_Car
has been set to null (see *note 3.10.1::)
- My_Car = Your_Car -- True if we both share the same car
- My_Car.all = Your_Car.all -- True if the two cars are identical
+ {<AI05-0264-1AI05-0264-1>} My_Car = null --< True if My_Car
has been set to null (see *note 3.10.1::)>
+ My_Car = Your_Car --< True if we both share the same car>
+ My_Car.all = Your_Car.all --< True if the two cars are identical>
39/3
- {AI05-0158-1AI05-0158-1} N not in 1 .. 10 -- range membership
test
- Today in Mon .. Fri -- range membership test
- Today in Weekday -- subtype membership test (see *note 3.5.1::)
- Card in Clubs | Spades -- list membership test (see *note 3.5.1::)
- Archive in Disk_Unit -- subtype membership test (see *note 3.8.1::)
- Tree.all in Addition'Class -- class membership test (see *note 3.9.1::)
+ {<AI05-0158-1AI05-0158-1>} N not in 1 .. 10 --< range
membership test>
+ Today in Mon .. Fri --< range membership test>
+ Today in Weekday --< subtype membership test (see *note
3.5.1::)>
+ Card in Clubs | Spades --< list membership test (see *note 3.5.1::)>
+ Archive in Disk_Unit --< subtype membership test (see *note
3.8.1::)>
+ Tree.all in Addition'Class --< class membership test (see *note 3.9.1::)>
_Extensions to Ada 83_
@@ -24368,7 +24442,7 @@ tests:
39.d
We use the term "equality operator" to refer to both the =
(equals) and /= (not equals) operators. Ada 83 referred to =
- as the equality operator, and /= as the inequality operator.
+ as <the> equality operator, and /= as the inequality operator.
The new wording is more consistent with the ISO 10646 name for
"=" (equals sign) and provides a category similar to "ordering
operator" to refer to both = and /=.
@@ -24379,38 +24453,38 @@ tests:
_Extensions to Ada 95_
39.f/2
- {AI95-00230-01AI95-00230-01} {AI95-00420-01AI95-00420-01} The
- universal_access equality operators are new. They provide
- equality operations (most importantly, testing against null)
- for anonymous access types.
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00420-01AI95-00420-01>}
+ The <universal_access> equality operators are new. They
+ provide equality operations (most importantly, testing against
+ null) for anonymous access types.
_Wording Changes from Ada 95_
39.g/2
- {8652/00168652/0016} {AI95-00123-01AI95-00123-01} Corrigendum:
- Wording was added to clarify that the order of calls (and
- whether the calls are made at all) on "=" for components is
- unspecified. Also clarified that "=" must compose properly
- for language-defined types.
+ {<8652/00168652/0016>} {<AI95-00123-01AI95-00123-01>}
+ Corrigendum: Wording was added to clarify that the order of
+ calls (and whether the calls are made at all) on "=" for
+ components is unspecified. Also clarified that "=" must
+ compose properly for language-defined types.
39.h/2
- {AI95-00251-01AI95-00251-01} Memberships were adjusted to
+ {<AI95-00251-01AI95-00251-01>} Memberships were adjusted to
allow interfaces which don't cover the tested type, in order
to be consistent with type conversions.
_Inconsistencies With Ada 2005_
39.i/3
- {AI05-0123-1AI05-0123-1} User-defined untagged record equality
- is now defined to compose and be used in generics. Any code
- which assumes that the predefined equality reemerges in
- generics and in predefined equals for composite types could
+ {<AI05-0123-1AI05-0123-1>} User-defined untagged record
+ equality is now defined to compose and be used in generics.
+ Any code which assumes that the predefined equality reemerges
+ in generics and in predefined equals for composite types could
fail. However, it is much more likely that this change will
fix bugs, as the behavior that would be expected (the
user-defined "=" is used) will be true in more cases.
39.j/3
- {AI05-0123-1AI05-0123-1} If a composite type contains a
+ {<AI05-0123-1AI05-0123-1>} If a composite type contains a
component of an untagged record type with an abstract equality
operation, calling "=" on the composite type will raise
Program_Error, while in the past a result will be returned
@@ -24421,7 +24495,7 @@ tests:
_Incompatibilities With Ada 2005_
39.k/3
- {AI05-0123-1AI05-0123-1} Late and hidden overriding of
+ {<AI05-0123-1AI05-0123-1>} Late and hidden overriding of
equality for untagged record types is now prohibited. This is
necessary to make composition of equality predictable. It
should always be possible to move the overriding to an earlier
@@ -24430,23 +24504,23 @@ tests:
_Extensions to Ada 2005_
39.l/3
- {AI05-0149-1AI05-0149-1} Membership tests for valid
+ {<AI05-0149-1AI05-0149-1>} Membership tests for valid
accessibility levels and tag coverage by the designated type
for general access types are new.
39.m/3
- {AI05-0153-3AI05-0153-3} Membership tests now include a
+ {<AI05-0153-3AI05-0153-3>} Membership tests now include a
predicate check.
39.n/3
- {AI05-0158-1AI05-0158-1} Membership tests now allow multiple
+ {<AI05-0158-1AI05-0158-1>} Membership tests now allow multiple
choices.
_Wording Changes from Ada 2005_
39.o/3
- {AI05-0020-1AI05-0020-1} Correction: Wording was added to
- clarify that universal_access "=" does not apply if an
+ {<AI05-0020-1AI05-0020-1>} Correction: Wording was added to
+ clarify that <universal_access> "=" does not apply if an
appropriate operator is declared for a partial or incomplete
view of the designated type. Otherwise, adding a partial or
incomplete view could make some "=" operators ambiguous.
@@ -24454,32 +24528,32 @@ tests:
_Inconsistencies With Ada 2012_
39.p/4
- {AI12-0101-1AI12-0101-1} Corrigendum: Removed the incompatible
- rule preventing the declaration of "=" in the private part of
- a package specification for an untagged record type that
- completes a private type. Any code that calls the predefined
- "=" on the private type will now execute the body for the
- redefined "=" instead for the predefined "=". Eliminating the
- rule eliminates an unnecessary incompatibility (especially for
- programs that never call the predefined "="). Moreover, (like
- the composition of untagged record "=" in Ada 2012) this is
- more likely to fix bugs than cause them (who defines an "="
- with a presumably different result and does not want clients
- to us it?).
+ {<AI12-0101-1AI12-0101-1>} Corrigendum: Removed the
+ incompatible rule preventing the declaration of "=" in the
+ private part of a package specification for an untagged record
+ type that completes a private type. Any code that calls the
+ predefined "=" on the private type will now execute the body
+ for the redefined "=" instead for the predefined "=".
+ Eliminating the rule eliminates an unnecessary incompatibility
+ (especially for programs that never call the predefined "=").
+ Moreover, (like the composition of untagged record "=" in Ada
+ 2012) this is more likely to fix bugs than cause them (who
+ defines an "=" with a presumably different result and does not
+ want clients to us it?).
_Wording Changes from Ada 2012_
39.q/4
- {AI12-0039-1AI12-0039-1} Corrigendum: Reworded membership
- tests to use the syntax items tested_simple_expression and
- choice_simple_expression. This was necessary to eliminate
+ {<AI12-0039-1AI12-0039-1>} Corrigendum: Reworded membership
+ tests to use the syntax items <tested_>simple_expression and
+ <choice_>simple_expression. This was necessary to eliminate
wording ambiguities introduced when the grammar was corrected
to eliminate syntax ambiguities. (Both of the above are now
simple_expressions, so merely talking about a
simple_expression is insufficient.)
39.r/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of the
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of the
membership tests to use the new term "satisfies the
predicates" (see *note 3.2.4::).
@@ -24493,29 +24567,29 @@ File: aarm2012.info, Node: 4.5.3, Next: 4.5.4,
Prev: 4.5.2, Up: 4.5
1
The binary adding operators + (addition) and - (subtraction) are
-predefined for every specific numeric type T with their conventional
+predefined for every specific numeric type <T> with their conventional
meaning. They have the following specifications:
2
- function "+"(Left, Right : T) return T
- function "-"(Left, Right : T) return T
+ function "+"(Left, Right : <T>) return <T>
+ function "-"(Left, Right : <T>) return <T>
3
The concatenation operators & are predefined for every nonlimited,
-one-dimensional array type T with component type C. They have the
+one-dimensional array type <T> with component type <C>. They have the
following specifications:
4
- function "&"(Left : T; Right : T) return T
- function "&"(Left : T; Right : C) return T
- function "&"(Left : C; Right : T) return T
- function "&"(Left : C; Right : C) return T
+ function "&"(Left : <T>; Right : <T>) return <T>
+ function "&"(Left : <T>; Right : <C>) return <T>
+ function "&"(Left : <C>; Right : <T>) return <T>
+ function "&"(Left : <C>; Right : <C>) return <T>
_Dynamic Semantics_
5
-For the evaluation of a concatenation with result type T, if both
-operands are of type T, the result of the concatenation is a
+For the evaluation of a concatenation with result type <T>, if both
+operands are of type <T>, the result of the concatenation is a
one-dimensional array whose length is the sum of the lengths of its
operands, and whose components comprise the components of the left
operand followed by the components of the right operand. If the left
@@ -24539,17 +24613,17 @@ follows:
is that of the left operand.
8
-[The upper bound is determined by the lower bound and the length.] A
+[The upper bound is determined by the lower bound and the length.] A
check is made that the upper bound of the result of the concatenation
belongs to the range of the index subtype, unless the result is a null
-array. Constraint_Error is raised if this check fails.
+array. Constraint_Error is raised if this check fails.
9
-If either operand is of the component type C, the result of the
+If either operand is of the component type <C>, the result of the
concatenation is given by the above rules, using in place of such an
operand an array having this operand as its only component (converted to
the component subtype) and having the lower bound of the index subtype
-of the array type as its lower bound.
+of the array type as its lower bound.
9.a
Ramification: The conversion might raise Constraint_Error.
@@ -24590,15 +24664,15 @@ anonymous object, as for any function call (see *note
6.5::).
_Examples_
12
-Examples of expressions involving binary adding operators:
+<Examples of expressions involving binary adding operators:>
13
- Z + 0.1 -- Z has to be of a real type
+ Z + 0.1 --< Z has to be of a real type >
14
- "A" & "BCD" -- concatenation of two string literals
- 'A' & "BCD" -- concatenation of a character literal and a string literal
- 'A' & 'A' -- concatenation of two character literals
+ "A" & "BCD" --< concatenation of two string literals>
+ 'A' & "BCD" --< concatenation of a character literal and a string
literal>
+ 'A' & 'A' --< concatenation of two character literals >
_Inconsistencies With Ada 83_
@@ -24639,12 +24713,12 @@ File: aarm2012.info, Node: 4.5.4, Next: 4.5.5,
Prev: 4.5.3, Up: 4.5
1
The unary adding operators + (identity) and - (negation) are predefined
-for every specific numeric type T with their conventional meaning. They
-have the following specifications:
+for every specific numeric type <T> with their conventional meaning.
+They have the following specifications:
2
- function "+"(Right : T) return T
- function "-"(Right : T) return T
+ function "+"(Right : <T>) return <T>
+ function "-"(Right : <T>) return <T>
NOTES
@@ -24665,13 +24739,13 @@ File: aarm2012.info, Node: 4.5.5, Next: 4.5.6,
Prev: 4.5.4, Up: 4.5
1
The multiplying operators * (multiplication), / (division), mod
(modulus), and rem (remainder) are predefined for every specific integer
-type T:
+type <T>:
2
- function "*" (Left, Right : T) return T
- function "/" (Left, Right : T) return T
- function "mod"(Left, Right : T) return T
- function "rem"(Left, Right : T) return T
+ function "*" (Left, Right : <T>) return <T>
+ function "/" (Left, Right : <T>) return <T>
+ function "mod"(Left, Right : <T>) return <T>
+ function "rem"(Left, Right : <T>) return <T>
3
Signed integer multiplication has its conventional meaning.
@@ -24690,10 +24764,11 @@ absolute value of B. Signed integer division
satisfies the identity:
(-A)/B = -(A/B) = A/(-B)
8/3
-{AI05-0260-1AI05-0260-1} The signed integer modulus operator is defined
-such that the result of A mod B is either zero, or has the sign of B and
-an absolute value less than the absolute value of B; in addition, for
-some signed integer value N, this result satisfies the relation:
+{<AI05-0260-1AI05-0260-1>} The signed integer modulus operator is
+defined such that the result of A mod B is either zero, or has the sign
+of B and an absolute value less than the absolute value of B; in
+addition, for some signed integer value N, this result satisfies the
+relation:
9
A = B*N + (A mod B)
@@ -24711,72 +24786,72 @@ is only possible for the "*" operator)].
11
Multiplication and division operators are predefined for every specific
-floating point type T:
+floating point type <T>:
12
- function "*"(Left, Right : T) return T
- function "/"(Left, Right : T) return T
+ function "*"(Left, Right : <T>) return <T>
+ function "/"(Left, Right : <T>) return <T>
13
The following multiplication and division operators, with an operand of
the predefined type Integer, are predefined for every specific fixed
-point type T:
+point type <T>:
14
- function "*"(Left : T; Right : Integer) return T
- function "*"(Left : Integer; Right : T) return T
- function "/"(Left : T; Right : Integer) return T
+ function "*"(Left : <T>; Right : Integer) return <T>
+ function "*"(Left : Integer; Right : <T>) return <T>
+ function "/"(Left : <T>; Right : Integer) return <T>
15
[All of the above multiplying operators are usable with an operand of an
appropriate universal numeric type.] The following additional
-multiplying operators for root_real are predefined[, and are usable when
-both operands are of an appropriate universal or root numeric type, and
-the result is allowed to be of type root_real, as in a
+multiplying operators for <root_real> are predefined[, and are usable
+when both operands are of an appropriate universal or root numeric type,
+and the result is allowed to be of type <root_real>, as in a
number_declaration]:
15.a
Ramification: These operators are analogous to the multiplying
operators involving fixed or floating point types where
- root_real substitutes for the fixed or floating point type,
- and root_integer substitutes for Integer. Only values of the
- corresponding universal numeric types are implicitly
+ <root_real> substitutes for the fixed or floating point type,
+ and <root_integer> substitutes for Integer. Only values of
+ the corresponding universal numeric types are implicitly
convertible to these root numeric types, so these operators
are really restricted to use with operands of a universal
type, or the specified root numeric types.
16
- function "*"(Left, Right : root_real) return root_real
- function "/"(Left, Right : root_real) return root_real
+ function "*"(Left, Right : <root_real>) return <root_real>
+ function "/"(Left, Right : <root_real>) return <root_real>
17
- function "*"(Left : root_real; Right : root_integer) return root_real
- function "*"(Left : root_integer; Right : root_real) return root_real
- function "/"(Left : root_real; Right : root_integer) return root_real
+ function "*"(Left : <root_real>; Right : <root_integer>) return
<root_real>
+ function "*"(Left : <root_integer>; Right : <root_real>) return
<root_real>
+ function "/"(Left : <root_real>; Right : <root_integer>) return
<root_real>
18
Multiplication and division between any two fixed point types are
provided by the following two predefined operators:
18.a
- Ramification: Universal_fixed is the universal type for the
+ Ramification: <Universal_fixed> is the universal type for the
class of fixed point types, meaning that these operators take
operands of any fixed point types (not necessarily the same)
and return a result that is implicitly (or explicitly)
convertible to any fixed point type.
19
- function "*"(Left, Right : universal_fixed) return universal_fixed
- function "/"(Left, Right : universal_fixed) return universal_fixed
+ function "*"(Left, Right : <universal_fixed>) return <universal_fixed>
+ function "/"(Left, Right : <universal_fixed>) return <universal_fixed>
_Name Resolution Rules_
19.1/2
-{AI95-00364-01AI95-00364-01} {AI95-00420-01AI95-00420-01} The above two
-fixed-fixed multiplying operators shall not be used in a context where
-the expected type for the result is itself universal_fixed [-- the
-context has to identify some other numeric type to which the result is
-to be converted, either explicitly or implicitly]. Unless the
+{<AI95-00364-01AI95-00364-01>} {<AI95-00420-01AI95-00420-01>} The above
+two fixed-fixed multiplying operators shall not be used in a context
+where the expected type for the result is itself <universal_fixed> [--
+the context has to identify some other numeric type to which the result
+is to be converted, either explicitly or implicitly]. Unless the
predefined universal operator is identified using an expanded name with
prefix denoting the package Standard, an explicit conversion is required
on the result when using the above fixed-fixed multiplication operator
@@ -24784,43 +24859,43 @@ if either operand is of a type having a user-defined
primitive
multiplication operator such that:
19.2/3
- * {AI05-0020-1AI05-0020-1} {AI05-0209-1AI05-0209-1} it is declared
- immediately within the same declaration list as the type or any
- partial or incomplete view thereof; and
+ * {<AI05-0020-1AI05-0020-1>} {<AI05-0209-1AI05-0209-1>} it is
+ declared immediately within the same declaration list as the type
+ or any partial or incomplete view thereof; and
19.3/2
* both of its formal parameters are of a fixed-point type.
19.4/2
-{AI95-00364-01AI95-00364-01} {AI95-00420-01AI95-00420-01} A
+{<AI95-00364-01AI95-00364-01>} {<AI95-00420-01AI95-00420-01>} A
corresponding requirement applies to the universal fixed-fixed division
operator.
19.a/2
- Discussion: The small of universal_fixed is infinitesimal; no
- loss of precision is permitted. However, fixed-fixed division
- is impractical to implement when an exact result is required,
- and multiplication will sometimes result in unanticipated
- overflows in such circumstances, so we require an explicit
- conversion to be inserted in expressions like A * B * C if A,
- B, and C are each of some fixed point type.
+ Discussion: The <small> of <universal_fixed> is infinitesimal;
+ no loss of precision is permitted. However, fixed-fixed
+ division is impractical to implement when an exact result is
+ required, and multiplication will sometimes result in
+ unanticipated overflows in such circumstances, so we require
+ an explicit conversion to be inserted in expressions like A *
+ B * C if A, B, and C are each of some fixed point type.
19.b/2
On the other hand, X := A * B; is permitted by this rule, even
if X, A, and B are all of different fixed point types, since
the expected type for the result of the multiplication is the
- type of X, which is necessarily not universal_fixed.
+ type of X, which is necessarily not <universal_fixed>.
19.c/2
- {AI95-00364-01AI95-00364-01} {AI95-00420-01AI95-00420-01} We
- have made these into Name Resolution rules to ensure that
+ {<AI95-00364-01AI95-00364-01>} {<AI95-00420-01AI95-00420-01>}
+ We have made these into Name Resolution rules to ensure that
user-defined primitive fixed-fixed operators are not made
unusable due to the presence of these universal fixed-fixed
operators. But we do allow these operators to be used if
prefixed by package Standard, so that they can be used in the
definitions of user-defined operators.
-Paragraph 20 was deleted.
+<Paragraph 20 was deleted.>
_Dynamic Semantics_
@@ -24829,15 +24904,15 @@ The multiplication and division operators for real
types have their
conventional meaning. [For floating point types, the accuracy of the
result is determined by the precision of the result type. For decimal
fixed point types, the result is truncated toward zero if the
-mathematical result is between two multiples of the small of the
+mathematical result is between two multiples of the <small> of the
specific result type (possibly determined by context); for ordinary
fixed point types, if the mathematical result is between two multiples
-of the small, it is unspecified which of the two is the result. ]
+of the <small>, it is unspecified which of the two is the result. ]
22
The exception Constraint_Error is raised by integer division, rem, and
-mod if the right operand is zero. [Similarly, for a real type T with
-T'Machine_Overflows True, division by zero raises Constraint_Error.]
+mod if the right operand is zero. [Similarly, for a real type <T> with
+<T'>Machine_Overflows True, division by zero raises Constraint_Error.]
NOTES
@@ -24882,7 +24957,7 @@ T'Machine_Overflows True, division by zero raises
Constraint_Error.]
_Examples_
31
-Examples of expressions involving multiplying operators:
+<Examples of expressions involving multiplying operators:>
32
I : Integer := 1;
@@ -24890,41 +24965,41 @@ Examples of expressions involving multiplying
operators:
K : Integer := 3;
33
- X : Real := 1.0; -- see *note 3.5.7::
+ X : Real := 1.0; --< see *note 3.5.7::>
Y : Real := 2.0;
34
- F : Fraction := 0.25; -- see *note 3.5.9::
+ F : Fraction := 0.25; --< see *note 3.5.9::>
G : Fraction := 0.5;
35
- Expression Value Result Type
+ <Expression> <Value> <Result Type>
- I*J 2 same as I and J, that is, Integer
- K/J 1 same as K and J, that is, Integer
- K mod J 1 same as K and J, that is, Integer
+ I*J 2 <same as I and J, that is, Integer>
+ K/J 1 <same as K and J, that is, Integer>
+ K mod J 1 <same as K and J, that is, Integer>
- X/Y 0.5 same as X and Y, that is, Real
- F/2 0.125 same as F, that is, Fraction
+ X/Y 0.5 <same as X and Y, that is, Real>
+ F/2 0.125 <same as F, that is, Fraction>
- 3*F 0.75 same as F, that is, Fraction
- 0.75*G 0.375 universal_fixed, implicitly convertible
- to any fixed point type
- Fraction(F*G) 0.125 Fraction, as stated by the conversion
- Real(J)*Y 4.0 Real, the type of both operands after
- conversion of J
+ 3*F 0.75 <same as F, that is, Fraction>
+ 0.75*G 0.375 <universal_fixed, implicitly convertible>
+ <to any fixed point type>
+ Fraction(F*G) 0.125 <Fraction, as stated by the conversion>
+ Real(J)*Y 4.0 <Real, the type of both operands after>
+ <conversion of J>
_Incompatibilities With Ada 83_
35.a.1/2
- {AI95-00364-01AI95-00364-01} {AI95-00420-01AI95-00420-01} The
- universal fixed-fixed multiplying operators are now directly
- available (see below). Any attempt to use user-defined
- fixed-fixed multiplying operators will be ambiguous with the
- universal ones. The only way to use the user-defined
- operators is to fully qualify them in a prefix call. This
- problem was not documented during the design of Ada 95, and
- has been mitigated by Ada 2005.
+ {<AI95-00364-01AI95-00364-01>} {<AI95-00420-01AI95-00420-01>}
+ The universal fixed-fixed multiplying operators are now
+ directly available (see below). Any attempt to use
+ user-defined fixed-fixed multiplying operators will be
+ ambiguous with the universal ones. The only way to use the
+ user-defined operators is to fully qualify them in a prefix
+ call. This problem was not documented during the design of
+ Ada 95, and has been mitigated by Ada 2005.
_Extensions to Ada 83_
@@ -24937,9 +25012,9 @@ Examples of expressions involving multiplying operators:
multiply or divide was felt to be inappropriate.
35.b
- The type universal_fixed is covered by universal_real, so real
- literals and fixed point operands may be multiplied or divided
- directly, without any explicit conversions required.
+ The type <universal_fixed> is covered by <universal_real>, so
+ real literals and fixed point operands may be multiplied or
+ divided directly, without any explicit conversions required.
_Wording Changes from Ada 83_
@@ -24950,7 +25025,7 @@ Examples of expressions involving multiplying operators:
_Incompatibilities With Ada 95_
35.d/2
- {AI95-00364-01AI95-00364-01} We have changed the resolution
+ {<AI95-00364-01AI95-00364-01>} We have changed the resolution
rules for the universal fixed-fixed multiplying operators to
remove the incompatibility with Ada 83 discussed above. The
solution is to hide the universal operators in some
@@ -24964,15 +25039,15 @@ Examples of expressions involving multiplying
operators:
_Wording Changes from Ada 2005_
35.e/3
- {AI05-0020-1AI05-0020-1} {AI05-0209-1AI05-0209-1} Correction:
- Wording was added to clarify that universal_fixed "*" and "/"
- does not apply if an appropriate operator is declared for a
- partial (or incomplete) view of the designated type.
- Otherwise, adding a partial (or incomplete) view could make
- some "*" and "/" operators ambiguous.
+ {<AI05-0020-1AI05-0020-1>} {<AI05-0209-1AI05-0209-1>}
+ Correction: Wording was added to clarify that
+ <universal_fixed> "*" and "/" does not apply if an appropriate
+ operator is declared for a partial (or incomplete) view of the
+ designated type. Otherwise, adding a partial (or incomplete)
+ view could make some "*" and "/" operators ambiguous.
35.f/3
- {AI05-0260-1AI05-0260-1} Correction: The wording for the mod
+ {<AI05-0260-1AI05-0260-1>} Correction: The wording for the mod
operator was corrected so that a result of 0 does not have to
have "the sign of B" (which is impossible if B is negative).
@@ -24986,19 +25061,19 @@ File: aarm2012.info, Node: 4.5.6, Next: 4.5.7,
Prev: 4.5.5, Up: 4.5
1
The highest precedence unary operator abs (absolute value) is predefined
-for every specific numeric type T, with the following specification:
+for every specific numeric type <T>, with the following specification:
2
- function "abs"(Right : T) return T
+ function "abs"(Right : <T>) return <T>
3
The highest precedence unary operator not (logical negation) is
-predefined for every boolean type T, every modular type T, and for every
-one-dimensional array type T whose components are of a boolean type,
-with the following specification:
+predefined for every boolean type <T>, every modular type <T>, and for
+every one-dimensional array type <T> whose components are of a boolean
+type, with the following specification:
4
- function "not"(Right : T) return T
+ function "not"(Right : <T>) return <T>
5
The result of the operator not for a modular type is defined as the
@@ -25012,32 +25087,32 @@ The operator not that applies to a one-dimensional
array of boolean
components yields a one-dimensional boolean array with the same bounds;
each component of the result is obtained by logical negation of the
corresponding component of the operand (that is, the component that has
-the same index value). A check is made that each component of the result
-belongs to the component subtype; the exception Constraint_Error is
-raised if this check fails.
+the same index value). A check is made that each component of the
+result belongs to the component subtype; the exception Constraint_Error
+is raised if this check fails.
6.a
Discussion: The check against the component subtype is per
AI83-00535.
7
-The highest precedence exponentiation operator ** is predefined for
-every specific integer type T with the following specification:
+The highest precedence <exponentiation> operator ** is predefined for
+every specific integer type <T> with the following specification:
8
- function "**"(Left : T; Right : Natural) return T
+ function "**"(Left : <T>; Right : Natural) return <T>
9
Exponentiation is also predefined for every specific floating point type
-as well as root_real, with the following specification (where T is
-root_real or the floating point type):
+as well as <root_real>, with the following specification (where <T> is
+<root_real> or the floating point type):
10
- function "**"(Left : T; Right : Integer'Base) return T
+ function "**"(Left : <T>; Right : Integer'Base) return <T>
11/3
-{AI05-0088-1AI05-0088-1} The right operand of an exponentiation is the
-exponent. The value of X**N with the value of the exponent N positive
+{<AI05-0088-1AI05-0088-1>} The right operand of an exponentiation is the
+<exponent>. The value of X**N with the value of the exponent N positive
is the same as the value of X*X*...X (with N-1 multiplications) except
that the multiplications are associated in an arbitrary order. With N
equal to zero, the result is one. With the value of N negative [(only
@@ -25066,12 +25141,12 @@ generally be 0.0.)
13
19 As implied by the specification given above for exponentiation
of an integer type, a check is made that the exponent is not
- negative. Constraint_Error is raised if this check fails.
+ negative. Constraint_Error is raised if this check fails.
_Inconsistencies With Ada 83_
13.a.1/1
- {8652/01008652/0100} {AI95-00018-01AI95-00018-01} The
+ {<8652/01008652/0100>} {<AI95-00018-01AI95-00018-01>} The
definition of "**" allows arbitrary association of the
multiplications which make up the result. Ada 83 required
left-to-right associations (confirmed by AI83-00137). Thus it
@@ -25090,7 +25165,7 @@ generally be 0.0.)
_Wording Changes from Ada 2005_
13.b/3
- {AI05-0088-1AI05-0088-1} Correction: The equivalence
+ {<AI05-0088-1AI05-0088-1>} Correction: The equivalence
definition for "**" was corrected so that it does not imply
that the operands are evaluated multiple times.
@@ -25101,68 +25176,68 @@ File: aarm2012.info, Node: 4.5.7, Next: 4.5.8,
Prev: 4.5.6, Up: 4.5
-----------------------------
1/3
-{AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1}
-{AI05-0262-1AI05-0262-1} A conditional_expression selects for evaluation
-at most one of the enclosed dependent_expressions, depending on a
-decision among the alternatives. One kind of conditional_expression is
-the if_expression, which selects for evaluation a dependent_expression
-depending on the value of one or more corresponding conditions. The
-other kind of conditional_expression is the case_expression, which
-selects for evaluation one of a number of alternative
-dependent_expressions; the chosen alternative is determined by the value
-of a selecting_expression.
+{<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>}
+{<AI05-0262-1AI05-0262-1>} A conditional_expression selects for
+evaluation at most one of the enclosed <dependent_>expressions,
+depending on a decision among the alternatives. One kind of
+conditional_expression is the if_expression, which selects for
+evaluation a <dependent_>expression depending on the value of one or
+more corresponding conditions. The other kind of conditional_expression
+is the case_expression, which selects for evaluation one of a number of
+alternative <dependent_>expressions; the chosen alternative is
+determined by the value of a <selecting_>expression.
_Language Design Principles_
1.a/3
- {AI05-0188-1AI05-0188-1} As previously noted, there are two
+ {<AI05-0188-1AI05-0188-1>} As previously noted, there are two
kinds of conditional_expression, if_expressions and
case_expressions. Whenever possible, we have written the
rules in terms of conditional_expressions to avoid
duplication.
1.b/3
- {AI05-0147-1AI05-0147-1} The rules for conditional_expressions
- have been designed as much as possible to work similarly to a
- parenthesized expression. The intent is that as much as
- possible, wherever a parenthesized expression would be
- allowed, a conditional_expression would be allowed, and it
- should work the same way.
+ {<AI05-0147-1AI05-0147-1>} The rules for
+ conditional_expressions have been designed as much as possible
+ to work similarly to a parenthesized expression. The intent
+ is that as much as possible, wherever a parenthesized
+ expression would be allowed, a conditional_expression would be
+ allowed, and it should work the same way.
_Syntax_
2/3
- {AI05-0188-1AI05-0188-1} conditional_expression ::=
+ {<AI05-0188-1AI05-0188-1>} conditional_expression ::=
if_expression | case_expression
3/3
- {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} if_expression ::=
-
- if condition then dependent_expression
- {elsif condition then dependent_expression}
- [else dependent_expression]
+ {<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} if_expression
+ ::=
+ if condition then <dependent_>expression
+ {elsif condition then <dependent_>expression}
+ [else <dependent_>expression]
4/3
- {AI05-0147-1AI05-0147-1} condition ::= boolean_expression
+ {<AI05-0147-1AI05-0147-1>} condition ::= <boolean_>expression
5/3
- {AI05-0188-1AI05-0188-1} case_expression ::=
- case selecting_expression is
+ {<AI05-0188-1AI05-0188-1>} case_expression ::=
+ case <selecting_>expression is
case_expression_alternative {,
case_expression_alternative}
6/3
- {AI05-0188-1AI05-0188-1} case_expression_alternative ::=
+ {<AI05-0188-1AI05-0188-1>} case_expression_alternative ::=
when discrete_choice_list =>
- dependent_expression
+ <dependent_>expression
7/3
- {AI05-0147-1AI05-0147-1} Wherever the Syntax Rules allow an
+ {<AI05-0147-1AI05-0147-1>} Wherever the Syntax Rules allow an
expression, a conditional_expression may be used in place of the
expression, so long as it is immediately surrounded by parentheses.
7.a/3
- Discussion: {AI05-0147-1AI05-0147-1} The syntactic category
+ Discussion: {<AI05-0147-1AI05-0147-1>} The syntactic category
conditional_expression appears only as a primary that is
parenthesized. The above rule allows it to additionally be
used in other contexts where it would be directly surrounded
@@ -25172,8 +25247,8 @@ of a selecting_expression.
The grammar makes the following directly legal:
7.c/3
- A := (if X then Y else Z); -- parentheses required
- A := B + (if X then Y else Z) + C; -- parentheses required
+ A := (if X then Y else Z); --< parentheses required>
+ A := B + (if X then Y else Z) + C; --< parentheses required>
7.d/3
The following procedure calls are syntactically legal; the
@@ -25182,7 +25257,7 @@ of a selecting_expression.
7.e/3
P(if X then Y else Z);
- P((if X then Y else Z)); -- redundant parentheses
+ P((if X then Y else Z)); --< redundant parentheses>
7.f/3
P((if X then Y else Z), Some_Other_Param);
@@ -25218,10 +25293,10 @@ of a selecting_expression.
complete grammar is given in AI05-0147-1AI05-0147-1.
7.l/3
- Implementation Note: {AI05-0147-1AI05-0147-1} Implementers are
- cautioned to consider error detection when implementing the
- syntax for conditional_expressions. An if_expression and an
- if_statement are very similar syntactically, (as are a
+ Implementation Note: {<AI05-0147-1AI05-0147-1>} Implementers
+ are cautioned to consider error detection when implementing
+ the syntax for conditional_expressions. An if_expression and
+ an if_statement are very similar syntactically, (as are a
case_expression and a case_statement) and simple mistakes can
appear to change one into the other, potentially causing
errors to be moved far away from their actual location. The
@@ -25231,18 +25306,18 @@ of a selecting_expression.
_Name Resolution Rules_
8/3
-{AI05-0147-1AI05-0147-1} If a conditional_expression is expected to be
-of a type T, then each dependent_expression of the
-conditional_expression is expected to be of type T. Similarly, if a
+{<AI05-0147-1AI05-0147-1>} If a conditional_expression is expected to be
+of a type <T>, then each <dependent_>expression of the
+conditional_expression is expected to be of type <T>. Similarly, if a
conditional_expression is expected to be of some class of types, then
-each dependent_expression of the conditional_expression is subject to
+each <dependent_>expression of the conditional_expression is subject to
the same expectation. If a conditional_expression shall resolve to be
-of a type T, then each dependent_expression shall resolve to be of type
-T.
+of a type <T>, then each <dependent_>expression shall resolve to be of
+type <T>.
9/3
-{AI05-0147-1AI05-0147-1} The possible types of a conditional_expression
-are further determined as follows:
+{<AI05-0147-1AI05-0147-1>} The possible types of a
+conditional_expression are further determined as follows:
10/3
* If the conditional_expression is the operand of a type conversion,
@@ -25251,7 +25326,7 @@ are further determined as follows:
10.a/3
Reason: This rule distributes an enclosing type conversion to
- the dependent_expressions. This means that
+ the <dependent_>expressions. This means that
10.b/3
T(if C then A else B)
@@ -25263,59 +25338,63 @@ are further determined as follows:
(if C then T(A) else T(B))
11/3
- * If all of the dependent_expressions are of the same type, the type
- of the conditional_expression is that type; otherwise,
+ * If all of the <dependent_>expressions are of the same type, the
+ type of the conditional_expression is that type; otherwise,
12/3
- * If a dependent_expression is of an elementary type, the type of the
- conditional_expression shall be covered by that type; otherwise,
+ * If a <dependent_>expression is of an elementary type, the type of
+ the conditional_expression shall be covered by that type;
+ otherwise,
12.a/3
Reason: This rule supports the use of numeric literals and
universal expressions within a conditional_expression.
13/3
- * If the conditional_expression is expected to be of type T or shall
- resolve to type T, then the conditional_expression is of type T.
+ * If the conditional_expression is expected to be of type <T> or
+ shall resolve to type <T>, then the conditional_expression is of
+ type <T>.
13.a/3
Ramification: If the type of the conditional_expression cannot
be determined by one of these rules, then Name Resolution has
- failed for that expression, even if the dependent_expressions
- would resolve individually.
+ failed for that expression, even if the
+ <dependent_>expressions would resolve individually.
14/3
-{AI05-0147-1AI05-0147-1} A condition is expected to be of any boolean
+{<AI05-0147-1AI05-0147-1>} A condition is expected to be of any boolean
type.
15/3
-{AI05-0188-1AI05-0188-1} The expected type for the selecting_expression
-and the discrete_choices are as for case statements (see *note 5.4::).
+{<AI05-0188-1AI05-0188-1>} The expected type for the
+<selecting_>expression and the discrete_choices are as for case
+statements (see *note 5.4::).
_Legality Rules_
16/3
-{AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} All of the
-dependent_expressions shall be convertible (see *note 4.6::) to the type
-of the conditional_expression.
+{<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} All of the
+<dependent_>expressions shall be convertible (see *note 4.6::) to the
+type of the conditional_expression.
17/3
-{AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1}
-{AI05-0269-1AI05-0269-1} If the expected type of a
+{<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>}
+{<AI05-0269-1AI05-0269-1>} If the expected type of a
conditional_expression is a specific tagged type, all of the
-dependent_expressions of the conditional_expression shall be dynamically
-tagged, or none shall be dynamically tagged. In this case, the
-conditional_expression is dynamically tagged if all of the
-dependent_expressions are dynamically tagged, is tag-indeterminate if
-all of the dependent_expressions are tag-indeterminate, and is
+<dependent_>expressions of the conditional_expression shall be
+dynamically tagged, or none shall be dynamically tagged. In this case,
+the conditional_expression is dynamically tagged if all of the
+<dependent_>expressions are dynamically tagged, is tag-indeterminate if
+all of the <dependent_>expressions are tag-indeterminate, and is
statically tagged otherwise.
18/3
-{AI05-0147-1AI05-0147-1} {AI05-0262-1AI05-0262-1} If there is no else
-dependent_expression, the if_expression shall be of a boolean type.
+{<AI05-0147-1AI05-0147-1>} {<AI05-0262-1AI05-0262-1>} If there is no
+else <dependent_>expression, the if_expression shall be of a boolean
+type.
19/3
-{AI05-0188-1AI05-0188-1} {AI05-0269-1AI05-0269-1} All Legality Rules
+{<AI05-0188-1AI05-0188-1>} {<AI05-0269-1AI05-0269-1>} All Legality Rules
that apply to the discrete_choices of a case_statement (see *note 5.4::)
also apply to the discrete_choices of a case_expression except within an
instance of a generic unit.
@@ -25338,7 +25417,7 @@ instance of a generic unit.
function Nat_Func return Natural is (123);
19.d/3
- package I is new G (Int_Func => Nat_Func); -- Legal
+ package I is new G (Int_Func => Nat_Func); -- <Legal>
19.e/3
Note that the Legality Rules still apply in the generic unit
@@ -25347,15 +25426,15 @@ instance of a generic unit.
_Dynamic Semantics_
20/3
-{AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} For the evaluation of
-an if_expression, the condition specified after if, and any conditions
-specified after elsif, are evaluated in succession (treating a final
-else as elsif True then), until one evaluates to True or all conditions
-are evaluated and yield False. If a condition evaluates to True, the
-associated dependent_expression is evaluated, converted to the type of
-the if_expression, and the resulting value is the value of the
-if_expression. Otherwise (when there is no else clause), the value of
-the if_expression is True.
+{<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} For the evaluation
+of an if_expression, the condition specified after if, and any
+conditions specified after elsif, are evaluated in succession (treating
+a final else as elsif True then), until one evaluates to True or all
+conditions are evaluated and yield False. If a condition evaluates to
+True, the associated <dependent_>expression is evaluated, converted to
+the type of the if_expression, and the resulting value is the value of
+the if_expression. Otherwise (when there is no else clause), the value
+of the if_expression is True.
20.a/3
Ramification: Else is required unless the if_expression has a
@@ -25363,20 +25442,20 @@ the if_expression is True.
if_expressions with a boolean type.
21/3
-{AI05-0188-1AI05-0188-1} For the evaluation of a case_expression, the
-selecting_expression is first evaluated. If the value of the
-selecting_expression is covered by the discrete_choice_list of some
-case_expression_alternative, then the dependent_expression of the
+{<AI05-0188-1AI05-0188-1>} For the evaluation of a case_expression, the
+<selecting_>expression is first evaluated. If the value of the
+<selecting_>expression is covered by the discrete_choice_list of some
+case_expression_alternative, then the <dependent_>expression of the
case_expression_alternative is evaluated, converted to the type of the
case_expression, and the resulting value is the value of the
-case_expression. Otherwise (the value is not covered by any
+case_expression. Otherwise (the value is not covered by any
discrete_choice_list, perhaps due to being outside the base range),
Constraint_Error is raised.
_Extensions to Ada 2005_
21.a/3
- {AI05-0147-1AI05-0147-1} If expressions and case expressions
+ {<AI05-0147-1AI05-0147-1>} If expressions and case expressions
are new.
@@ -25386,25 +25465,25 @@ File: aarm2012.info, Node: 4.5.8, Prev: 4.5.7, Up:
4.5
----------------------------
0.1/4
-{AI12-0158-1AI12-0158-1} Quantified expressions provide a way to write
+{<AI12-0158-1AI12-0158-1>} Quantified expressions provide a way to write
universally and existentially quantified predicates over containers and
arrays.
_Syntax_
1/3
- {AI05-0176-1AI05-0176-1} quantified_expression ::= for quantifier
- loop_parameter_specification => predicate
+ {<AI05-0176-1AI05-0176-1>} quantified_expression ::= for
+ quantifier loop_parameter_specification => predicate
| for quantifier iterator_specification => predicate
2/3
quantifier ::= all | some
3/3
- predicate ::= boolean_expression
+ predicate ::= <boolean_>expression
4/3
- {AI05-0176-1AI05-0176-1} Wherever the Syntax Rules allow an
+ {<AI05-0176-1AI05-0176-1>} Wherever the Syntax Rules allow an
expression, a quantified_expression may be used in place of the
expression, so long as it is immediately surrounded by parentheses.
@@ -25420,15 +25499,15 @@ arrays.
_Name Resolution Rules_
5/3
-{AI05-0176-1AI05-0176-1} The expected type of a quantified_expression is
-any Boolean type. The predicate in a quantified_expression is expected
-to be of the same type.
+{<AI05-0176-1AI05-0176-1>} The expected type of a quantified_expression
+is any Boolean type. The predicate in a quantified_expression is
+expected to be of the same type.
_Dynamic Semantics_
6/4
-{AI05-0176-1AI05-0176-1} {AI12-0158-1AI12-0158-1} For the evaluation of
-a quantified_expression, the loop_parameter_specification or
+{<AI05-0176-1AI05-0176-1>} {<AI12-0158-1AI12-0158-1>} For the evaluation
+of a quantified_expression, the loop_parameter_specification or
iterator_specification is first elaborated. The evaluation of a
quantified_expression then evaluates the predicate for the values of the
loop parameter in the order specified by the
@@ -25436,11 +25515,11 @@ loop_parameter_specification (see *note 5.5::) or
iterator_specification
(see *note 5.5.2::).
7/3
-{AI05-0176-1AI05-0176-1} The value of the quantified_expression is
+{<AI05-0176-1AI05-0176-1>} The value of the quantified_expression is
determined as follows:
8/4
- * {AI12-0158-1AI12-0158-1} If the quantifier is all, the expression
+ * {<AI12-0158-1AI12-0158-1>} If the quantifier is all, the expression
is False if the evaluation of any predicate yields False;
evaluation of the quantified_expression stops at that point.
Otherwise (every predicate has been evaluated and yielded True),
@@ -25452,12 +25531,12 @@ determined as follows:
values.
9/4
- * {AI12-0158-1AI12-0158-1} If the quantifier is some, the expression
- is True if the evaluation of any predicate yields True; evaluation
- of the quantified_expression stops at that point. Otherwise (every
- predicate has been evaluated and yielded False), the expression is
- False. Any exception raised by evaluation of the predicate is
- propagated.
+ * {<AI12-0158-1AI12-0158-1>} If the quantifier is some, the
+ expression is True if the evaluation of any predicate yields True;
+ evaluation of the quantified_expression stops at that point.
+ Otherwise (every predicate has been evaluated and yielded False),
+ the expression is False. Any exception raised by evaluation of the
+ predicate is propagated.
9.a/3
Ramification: The expression is False if the domain contains
@@ -25466,7 +25545,7 @@ determined as follows:
_Examples_
10/3
-{AI05-0176-1AI05-0176-1} The postcondition for a sorting routine on an
+{<AI05-0176-1AI05-0176-1>} The postcondition for a sorting routine on an
array A with an index subtype T can be written:
11/3
@@ -25474,7 +25553,7 @@ array A with an index subtype T can be written:
(for all I in A'First .. T'Pred(A'Last) => A (I) <= A (T'Succ (I))))
12/3
-{AI05-0176-1AI05-0176-1} The assertion that a positive number is
+{<AI05-0176-1AI05-0176-1>} The assertion that a positive number is
composite (as opposed to prime) can be written:
13/3
@@ -25483,12 +25562,12 @@ composite (as opposed to prime) can be written:
_Extensions to Ada 2005_
13.a/3
- {AI05-0176-1AI05-0176-1} Quantified expressions are new.
+ {<AI05-0176-1AI05-0176-1>} Quantified expressions are new.
_Wording Changes from Ada 2012_
13.b/4
- {AI12-0158-1AI12-0158-1} Corrigendum: Revised the wording to
+ {<AI12-0158-1AI12-0158-1>} Corrigendum: Revised the wording to
make it clear that the semantics is short-circuited, and what
the result is when there are no values for the loop parameter.
@@ -25499,11 +25578,11 @@ File: aarm2012.info, Node: 4.6, Next: 4.7, Prev:
4.5, Up: 4
====================
1/3
-{AI05-0299-1AI05-0299-1} [Explicit type conversions, both value
+{<AI05-0299-1AI05-0299-1>} [Explicit type conversions, both value
conversions and view conversions, are allowed between closely related
types as defined below. This subclause also defines rules for value and
view conversions to a particular subtype of a type, both explicit ones
-and those implicit in other constructs. ]
+and those implicit in other constructs. ]
_Syntax_
@@ -25513,15 +25592,15 @@ and those implicit in other constructs. ]
| subtype_mark(name)
3
-The target subtype of a type_conversion is the subtype denoted by the
-subtype_mark. The operand of a type_conversion is the expression or name
-within the parentheses; its type is the operand type.
+The <target subtype> of a type_conversion is the subtype denoted by the
+subtype_mark. The <operand> of a type_conversion is the expression or
+name within the parentheses; its type is the <operand type>.
4/3
-{AI05-0299-1AI05-0299-1} One type is convertible to a second type if a
-type_conversion with the first type as operand type and the second type
-as target type is legal according to the rules of this subclause. Two
-types are convertible if each is convertible to the other.
+{<AI05-0299-1AI05-0299-1>} One type is <convertible> to a second type if
+a type_conversion with the first type as operand type and the second
+type as target type is legal according to the rules of this subclause.
+Two types are convertible if each is convertible to the other.
4.a
Ramification: Note that "convertible" is defined in terms of
@@ -25530,12 +25609,12 @@ types are convertible if each is convertible to the
other.
definition.
5/2
-{8652/00178652/0017} {AI95-00184-01AI95-00184-01}
-{AI95-00330-01AI95-00330-01} A type_conversion whose operand is the name
-of an object is called a view conversion if both its target type and
-operand type are tagged, or if it appears in a call as an actual
-parameter of mode out or in out; other type_conversions are called value
-conversions.
+{<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>}
+{<AI95-00330-01AI95-00330-01>} A type_conversion whose operand is the
+name of an object is called a <view conversion> if both its target type
+and operand type are tagged, or if it appears in a call as an actual
+parameter of mode out or in out; other type_conversions are called
+<value conversions>.
5.a
Ramification: A view conversion to a tagged type can appear in
@@ -25548,8 +25627,8 @@ conversions.
implementation burden.
5.b/2
- {AI95-00330-01AI95-00330-01} A type conversion appearing as an
- in out parameter in a generic instantiation is not a view
+ {<AI95-00330-01AI95-00330-01>} A type conversion appearing as
+ an in out parameter in a generic instantiation is not a view
conversion; the second part of the rule only applies to
subprogram calls, not instantiations.
@@ -25569,14 +25648,14 @@ The operand of a view conversion is interpreted only
as a name; the
operand of a value conversion is interpreted as an expression.
7.a/4
- Reason: {AI12-0005-1AI12-0005-1} This formally resolves the
+ Reason: {<AI12-0005-1AI12-0005-1>} This formally resolves the
syntactic ambiguity between the two forms of type_conversion.
This matters as an expression that is a name is evaluated and
represents a value while a name by itself can be an object; we
want a view conversion to be an object.
7.b/4
- Ramification: {AI12-0005-1AI12-0005-1} This wording uses
+ Ramification: {<AI12-0005-1AI12-0005-1>} This wording uses
"interpreted as" rather than "shall be" so that this rule is
not used to resolve overloading; it is solely about evaluation
as described above.
@@ -25584,8 +25663,8 @@ operand of a value conversion is interpreted as an
expression.
_Legality Rules_
8/2
-{AI95-00251-01AI95-00251-01} In a view conversion for an untagged type,
-the target type shall be convertible (back) to the operand type.
+{<AI95-00251-01AI95-00251-01>} In a view conversion for an untagged
+type, the target type shall be convertible (back) to the operand type.
8.a/2
Reason: Untagged view conversions appear only as [in] out
@@ -25594,10 +25673,10 @@ the target type shall be convertible (back) to the
operand type.
parameter, because (for example) actual parameters of an
access type are always copied in anyway.
-Paragraphs 9 through 20 were reorganized and moved below.
+<Paragraphs 9 through 20 were reorganized and moved below.>
8.b/2
- Discussion: {AI95-00251-01AI95-00251-01} The entire Legality
+ Discussion: {<AI95-00251-01AI95-00251-01>} The entire Legality
Rules section has been reorganized to eliminate an
unintentional incompatibility with Ada 83. In rare cases, a
type conversion between two types related by derivation is not
@@ -25611,13 +25690,14 @@ Paragraphs 9 through 20 were reorganized and moved
below.
24.12, 24.13, 24.17, 24.19, 24.20, and 8.
21/3
-{AI95-00251-01AI95-00251-01} {AI05-0115-1AI05-0115-1} If there is a type
-(other than a root numeric type) that is an ancestor of both the target
-type and the operand type, or both types are class-wide types, then at
-least one of the following rules shall apply:
+{<AI95-00251-01AI95-00251-01>} {<AI05-0115-1AI05-0115-1>} If there is a
+type (other than a root numeric type) that is an ancestor of both the
+target type and the operand type, or both types are class-wide types,
+then at least one of the following rules shall apply:
21.1/2
- * {AI95-00251-01AI95-00251-01} The target type shall be untagged; or
+ * {<AI95-00251-01AI95-00251-01>} The target type shall be untagged;
+ or
22
* The operand type shall be covered by or descended from the target
@@ -25628,8 +25708,8 @@ least one of the following rules shall apply:
always safe.
23/2
- * {AI95-00251-01AI95-00251-01} The operand type shall be a class-wide
- type that covers the target type; or
+ * {<AI95-00251-01AI95-00251-01>} The operand type shall be a
+ class-wide type that covers the target type; or
23.a
Ramification: This is a conversion of a class-wide type toward
@@ -25637,7 +25717,7 @@ least one of the following rules shall apply:
Semantics.
23.b/2
- {AI95-00251-01AI95-00251-01} These two rules imply that a
+ {<AI95-00251-01AI95-00251-01>} These two rules imply that a
conversion from an ancestor type to a type extension is not
permitted, as this would require specifying the values for
additional components, in general, and changing the tag. An
@@ -25648,7 +25728,7 @@ least one of the following rules shall apply:
operand's tag is a descendant of the target.
23.1/2
- * {AI95-00251-01AI95-00251-01} The operand and target types shall
+ * {<AI95-00251-01AI95-00251-01>} The operand and target types shall
both be class-wide types and the specific type associated with at
least one of them shall be an interface type.
@@ -25663,33 +25743,33 @@ least one of the following rules shall apply:
the needed interface.
24/3
-{AI95-00251-01AI95-00251-01} {AI05-0115-1AI05-0115-1} If there is no
+{<AI95-00251-01AI95-00251-01>} {<AI05-0115-1AI05-0115-1>} If there is no
type (other than a root numeric type) that is the ancestor of both the
target type and the operand type, and they are not both class-wide
types, one of the following rules shall apply:
24.1/2
- * {AI95-00251-01AI95-00251-01} If the target type is a numeric type,
- then the operand type shall be a numeric type.
+ * {<AI95-00251-01AI95-00251-01>} If the target type is a numeric
+ type, then the operand type shall be a numeric type.
24.2/2
- * {AI95-00251-01AI95-00251-01} If the target type is an array type,
+ * {<AI95-00251-01AI95-00251-01>} If the target type is an array type,
then the operand type shall be an array type. Further:
24.3/2
- * {AI95-00251-01AI95-00251-01} The types shall have the
+ * {<AI95-00251-01AI95-00251-01>} The types shall have the
same dimensionality;
24.4/2
- * {AI95-00251-01AI95-00251-01} Corresponding index types
+ * {<AI95-00251-01AI95-00251-01>} Corresponding index types
shall be convertible;
24.5/2
- * {AI95-00251-01AI95-00251-01} The component subtypes shall
- statically match;
+ * {<AI95-00251-01AI95-00251-01>} The component subtypes
+ shall statically match;
24.6/2
- * {AI95-00392-01AI95-00392-01} If the component types are
+ * {<AI95-00392-01AI95-00392-01>} If the component types are
anonymous access types, then the accessibility level of
the operand type shall not be statically deeper than that
of the target type;
@@ -25705,8 +25785,8 @@ types, one of the following rules shall apply:
check will prevent problems.
24.7/2
- * {AI95-00246-01AI95-00246-01} Neither the target type nor
- the operand type shall be limited;
+ * {<AI95-00246-01AI95-00246-01>} Neither the target type
+ nor the operand type shall be limited;
24.c/2
Reason: We cannot allow conversions between unrelated limited
@@ -25715,24 +25795,26 @@ types, one of the following rules shall apply:
representations.
24.8/2
- * {AI95-00251-01AI95-00251-01} {AI95-00363-01AI95-00363-01}
- If the target type of a view conversion has aliased
- components, then so shall the operand type; and
+ * {<AI95-00251-01AI95-00251-01>}
+ {<AI95-00363-01AI95-00363-01>} If the target type of a
+ view conversion has aliased components, then so shall the
+ operand type; and
24.d/2
- Reason: {AI95-00363-01AI95-00363-01} We cannot allow a view
+ Reason: {<AI95-00363-01AI95-00363-01>} We cannot allow a view
conversion from an object with unaliased components to an
object with aliased components, because that would effectively
allow pointers to unaliased components. This rule was missing
from Ada 95.
24.9/2
- * {AI95-00246-01AI95-00246-01} {AI95-00251-01AI95-00251-01}
- The operand type of a view conversion shall not have a
- tagged, private, or volatile subcomponent.
+ * {<AI95-00246-01AI95-00246-01>}
+ {<AI95-00251-01AI95-00251-01>} The operand type of a view
+ conversion shall not have a tagged, private, or volatile
+ subcomponent.
24.e/2
- Reason: {AI95-00246-01AI95-00246-01} We cannot allow view
+ Reason: {<AI95-00246-01AI95-00246-01>} We cannot allow view
conversions between unrelated might-be-by-reference types, as
they may have different representations, and a copy cannot be
made to reconcile the representations.
@@ -25743,18 +25825,18 @@ types, one of the following rules shall apply:
between related types.
24.10/2
- * {AI95-00230-01AI95-00230-01} If the target type is
- universal_access, then the operand type shall be an access type.
+ * {<AI95-00230-01AI95-00230-01>} If the target type is
+ <universal_access>, then the operand type shall be an access type.
24.g/2
Discussion: Such a conversion cannot be written explicitly, of
course, but it can be implicit (see below).
24.11/2
- * {AI95-00230-01AI95-00230-01} {AI95-00251-01AI95-00251-01} If the
- target type is a general access-to-object type, then the operand
- type shall be universal_access or an access-to-object type.
- Further, if the operand type is not universal_access:
+ * {<AI95-00230-01AI95-00230-01>} {<AI95-00251-01AI95-00251-01>} If
+ the target type is a general access-to-object type, then the
+ operand type shall be <universal_access> or an access-to-object
+ type. Further, if the operand type is not <universal_access>:
24.h/2
Discussion: The Legality Rules and Dynamic Semantics are
@@ -25765,7 +25847,7 @@ types, one of the following rules shall apply:
whereas the attribute_reference would raise Constraint_Error.
24.12/2
- * {AI95-00251-01AI95-00251-01} If the target type is an
+ * {<AI95-00251-01AI95-00251-01>} If the target type is an
access-to-variable type, then the operand type shall be
an access-to-variable type;
@@ -25775,69 +25857,70 @@ types, one of the following rules shall apply:
access-to-variable.
24.13/2
- * {AI95-00251-01AI95-00251-01} If the target designated
+ * {<AI95-00251-01AI95-00251-01>} If the target designated
type is tagged, then the operand designated type shall be
convertible to the target designated type;
24.14/2
- * {AI95-00251-01AI95-00251-01} {AI95-00363-01AI95-00363-01}
- If the target designated type is not tagged, then the
- designated types shall be the same, and either:
+ * {<AI95-00251-01AI95-00251-01>}
+ {<AI95-00363-01AI95-00363-01>} If the target designated
+ type is not tagged, then the designated types shall be
+ the same, and either:
24.15/2
- * {AI95-00363-01AI95-00363-01} the designated subtypes
- shall statically match; or
+ * {<AI95-00363-01AI95-00363-01>} the designated
+ subtypes shall statically match; or
24.16/2
- * {AI95-00363-01AI95-00363-01}
- {AI95-00384-01AI95-00384-01} the designated type
+ * {<AI95-00363-01AI95-00363-01>}
+ {<AI95-00384-01AI95-00384-01>} the designated type
shall be discriminated in its full view and
unconstrained in any partial view, and one of the
designated subtypes shall be unconstrained;
24.j/2
- Ramification: {AI95-00363-01AI95-00363-01} This does not
+ Ramification: {<AI95-00363-01AI95-00363-01>} This does not
require that types have a partial view in order to allow the
conversion, simply that any partial view that does exist is
unconstrained.
24.k/2
- {AI95-00384-01AI95-00384-01} This allows conversions both ways
- (either subtype can be unconstrained); while Ada 95 only
+ {<AI95-00384-01AI95-00384-01>} This allows conversions both
+ ways (either subtype can be unconstrained); while Ada 95 only
allowed the conversion if the target subtype is unconstrained.
We generally want type conversions to be symmetric; which type
is the target shouldn't matter for legality.
24.l/2
- Reason: {AI95-00363-01AI95-00363-01} If the visible partial
+ Reason: {<AI95-00363-01AI95-00363-01>} If the visible partial
view is constrained, we do not allow conversion between
unconstrained and constrained subtypes. This means that
whether the full type had discriminants is not visible to
clients of the partial view.
24.l.1/4
- Discussion: {AI12-0095-1AI12-0095-1} We assume the worst in a
- generic body whether or not a formal subtype has a constrained
- partial view; specifically, in a generic body a discriminated
- subtype is considered to have a constrained partial view if it
- is a descendant of an untagged generic formal private or
- derived type (see *note 12.5.1:: for the formal definition of
- this rule).
+ Discussion: {<AI12-0095-1AI12-0095-1>} We assume the worst in
+ a generic body whether or not a formal subtype has a
+ constrained partial view; specifically, in a generic body a
+ discriminated subtype is considered to have a constrained
+ partial view if it is a descendant of an untagged generic
+ formal private or derived type (see *note 12.5.1:: for the
+ formal definition of this rule).
24.m/2
Reason: These rules are designed to ensure that aliased array
- objects only need "dope" if their nominal subtype is
- unconstrained, but they can always have dope if required by
+ objects only <need> "dope" if their nominal subtype is
+ unconstrained, but they can always <have> dope if required by
the run-time model (since no sliding is permitted as part of
access type conversion). By contrast, aliased discriminated
- objects will always need their discriminants stored with them,
- even if nominally constrained. (Here, we are assuming an
- implementation that represents an access value as a single
+ objects will always <need> their discriminants stored with
+ them, even if nominally constrained. (Here, we are assuming
+ an implementation that represents an access value as a single
pointer.)
24.17/4
- * {AI95-00251-01AI95-00251-01} {AI05-0148-1AI05-0148-1}
- {AI05-0248-1AI05-0248-1} {AI12-0027-1AI12-0027-1} The
+ * {<AI95-00251-01AI95-00251-01>} {<AI05-0148-1AI05-0148-1>}
+ {<AI05-0248-1AI05-0248-1>} {<AI12-0027-1AI12-0027-1>} The
accessibility level of the operand type shall not be
statically deeper than that of the target type, unless
the target type is an anonymous access type of a
@@ -25847,7 +25930,7 @@ types, one of the following rules shall apply:
the declaration of the stand-alone object.
24.n/3
- Ramification: {AI05-0148-1AI05-0148-1} The access parameter
+ Ramification: {<AI05-0148-1AI05-0148-1>} The access parameter
case is handled by a run-time check. Run-time checks are also
done in instance bodies, and for stand-alone objects of
anonymous access types.
@@ -25859,9 +25942,9 @@ types, one of the following rules shall apply:
dangling accesses.
24.18/2
- * {AI95-00230-01AI95-00230-01} If the target type is a pool-specific
- access-to-object type, then the operand type shall be
- universal_access.
+ * {<AI95-00230-01AI95-00230-01>} If the target type is a
+ pool-specific access-to-object type, then the operand type shall be
+ <universal_access>.
24.o/2
Reason: This allows null to be converted to pool-specific
@@ -25872,18 +25955,18 @@ types, one of the following rules shall apply:
derived or other related types.
24.19/2
- * {AI95-00230-01AI95-00230-01} {AI95-00251-01AI95-00251-01} If the
- target type is an access-to-subprogram type, then the operand type
- shall be universal_access or an access-to-subprogram type.
- Further, if the operand type is not universal_access:
+ * {<AI95-00230-01AI95-00230-01>} {<AI95-00251-01AI95-00251-01>} If
+ the target type is an access-to-subprogram type, then the operand
+ type shall be <universal_access> or an access-to-subprogram type.
+ Further, if the operand type is not <universal_access>:
24.20/3
- * {AI95-00251-01AI95-00251-01} {AI05-0239-1AI05-0239-1} The
- designated profiles shall be subtype conformant.
+ * {<AI95-00251-01AI95-00251-01>} {<AI05-0239-1AI05-0239-1>}
+ The designated profiles shall be subtype conformant.
24.21/4
- * {AI95-00251-01AI95-00251-01} {AI12-0027-1AI12-0027-1} The
- accessibility level of the operand type shall not be
+ * {<AI95-00251-01AI95-00251-01>} {<AI12-0027-1AI12-0027-1>}
+ The accessibility level of the operand type shall not be
statically deeper than that of the target type. If the
operand type is declared within a generic body, the
target type shall be declared within the generic body.
@@ -25900,18 +25983,18 @@ types, one of the following rules shall apply:
the instantiation.
24.22/4
-{AI12-0027-1AI12-0027-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules apply also in the private
-part of an instance of a generic unit.
+{<AI12-0027-1AI12-0027-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules apply also in the
+private part of an instance of a generic unit.
24.q/4
- Discussion: This applies to all of the Legality Rules in this
- section. It won't matter for the majority of these rules, but
- in any case that it does, we want to apply the same recheck in
- the private part. (Ada got the default wrong for these, as
- there is only one known case where we don't want to recheck in
- the private part, see derivations without record extensions in
- *note 3.4::.)
+ Discussion: This applies to <all> of the Legality Rules in
+ this section. It won't matter for the majority of these
+ rules, but in any case that it does, we want to apply the same
+ recheck in the private part. (Ada got the default wrong for
+ these, as there is only one known case where we don't want to
+ recheck in the private part, see derivations without record
+ extensions in *note 3.4::.)
_Static Semantics_
@@ -25920,7 +26003,7 @@ A type_conversion that is a value conversion denotes
the value that is
the result of converting the value of the operand to the target subtype.
26/3
-{AI05-0264-1AI05-0264-1} A type_conversion that is a view conversion
+{<AI05-0264-1AI05-0264-1>} A type_conversion that is a view conversion
denotes a view of the object denoted by the operand. This view is a
variable of the target type if the operand denotes a variable;
otherwise, it is a constant of the target type.
@@ -25932,9 +26015,9 @@ The nominal subtype of a type_conversion is its target
subtype.
28
For the evaluation of a type_conversion that is a value conversion, the
-operand is evaluated, and then the value of the operand is converted to
-a corresponding value of the target type, if any. If there is no value
-of the target type that corresponds to the operand value,
+operand is evaluated, and then the value of the operand is <converted>
+to a <corresponding> value of the target type, if any. If there is no
+value of the target type that corresponds to the operand value,
Constraint_Error is raised[; this can only happen on conversion to a
modular type, and only when the operand value is outside the base range
of the modular type.] Additional rules follow:
@@ -25951,7 +26034,7 @@ of the modular type.] Additional rules follow:
31
* If the target type is a decimal fixed point type, then
the result is truncated (toward 0) if the value of the
- operand is not a multiple of the small of the target
+ operand is not a multiple of the <small> of the target
type.
32
@@ -25973,7 +26056,7 @@ of the modular type.] Additional rules follow:
integers).
33.a/2
- Discussion: {AI95-00267-01AI95-00267-01} This was
+ Discussion: {<AI95-00267-01AI95-00267-01>} This was
implementation defined in Ada 83. There seems no reason to
preserve the nonportability in Ada 95. Round-away-from-zero
is the conventional definition of rounding, and standard
@@ -26013,7 +26096,7 @@ of the modular type.] Additional rules follow:
* If the target subtype is an unconstrained array subtype,
then the bounds of the result are obtained by converting
each bound of the value of the operand to the
- corresponding index type of the target type. For each
+ corresponding index type of the target type. For each
nonnull index range, a check is made that the bounds of
the range belong to the corresponding index subtype.
@@ -26031,10 +26114,10 @@ of the modular type.] Additional rules follow:
initialized.
39.1/2
- * {AI95-00392-01AI95-00392-01} If the component types of
+ * {<AI95-00392-01AI95-00392-01>} If the component types of
the array types are anonymous access types, then a check
is made that the accessibility level of the operand type
- is not deeper than that of the target type.
+ is not deeper than that of the target type.
39.b/2
Reason: This check is needed for operands that are access
@@ -26053,7 +26136,7 @@ of the modular type.] Additional rules follow:
initialized.
42
- * [The tag of the result is that of the operand.] If the
+ * [The tag of the result is that of the operand.] If the
operand type is class-wide, a check is made that the tag
of the operand identifies a (specific) type that is
covered by or descended from the target type.
@@ -26105,8 +26188,8 @@ of the modular type.] Additional rules follow:
* Access Type Conversion
48/3
- * {AI05-0148-1AI05-0148-1} {AI05-0248-1AI05-0248-1} For an
- access-to-object type, a check is made that the
+ * {<AI05-0148-1AI05-0148-1>} {<AI05-0248-1AI05-0248-1>} For
+ an access-to-object type, a check is made that the
accessibility level of the operand type is not deeper
than that of the target type, unless the target type is
an anonymous access type of a stand-alone object. If the
@@ -26115,10 +26198,10 @@ of the modular type.] Additional rules follow:
is not deeper than that of the declaration of the
stand-alone object[; then if the check succeeds, the
accessibility level of the target type becomes that of
- the operand type].
+ the operand type].
48.a/3
- Ramification: {AI05-0148-1AI05-0148-1} This check is needed
+ Ramification: {<AI05-0148-1AI05-0148-1>} This check is needed
for operands that are access parameters, for stand-alone
anonymous access objects, and in instance bodies.
@@ -26128,9 +26211,10 @@ of the modular type.] Additional rules follow:
is done when calling a subprogram with an access parameter.
49/2
- * {AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01}
- If the operand value is null, the result of the
- conversion is the null value of the target type.
+ * {<AI95-00230-01AI95-00230-01>}
+ {<AI95-00231-01AI95-00231-01>} If the operand value is
+ null, the result of the conversion is the null value of
+ the target type.
49.a/2
Ramification: A conversion to an anonymous access type happens
@@ -26150,9 +26234,9 @@ of the modular type.] Additional rules follow:
and operand designated subtypes statically match.
51/4
-{AI95-00231-01AI95-00231-01} {AI05-0153-3AI05-0153-3}
-{AI05-0290-1AI05-0290-1} {AI12-0071-1AI12-0071-1} After conversion of
-the value to the target type, if the target subtype is constrained, a
+{<AI95-00231-01AI95-00231-01>} {<AI05-0153-3AI05-0153-3>}
+{<AI05-0290-1AI05-0290-1>} {<AI12-0071-1AI12-0071-1>} After conversion
+of the value to the target type, if the target subtype is constrained, a
check is performed that the value satisfies this constraint. If the
target subtype excludes null, then a check is made that the value is not
null. If predicate checks are enabled for the target subtype (see *note
@@ -26160,7 +26244,7 @@ null. If predicate checks are enabled for the target
subtype (see *note
of the target subtype.
51.a/2
- Ramification: {AI95-00231-01AI95-00231-01} The first check
+ Ramification: {<AI95-00231-01AI95-00231-01>} The first check
above is a Range_Check for scalar subtypes, a
Discriminant_Check or Index_Check for access subtypes, and a
Discriminant_Check for discriminated subtypes. The
@@ -26178,7 +26262,7 @@ performed as above for a value conversion.
The properties of this new view are as follows:
54/1
- * {8652/00178652/0017} {AI95-00184-01AI95-00184-01} If the target
+ * {<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>} If the target
type is composite, the bounds or discriminants (if any) of the view
are as defined above for a value conversion; each nondiscriminant
component of the view denotes the matching component of the operand
@@ -26196,21 +26280,21 @@ The properties of this new view are as follows:
object (which might raise Constraint_Error);
56/4
- * {AI12-0074-1AI12-0074-1} Reading the value of the view yields the
+ * {<AI12-0074-1AI12-0074-1>} Reading the value of the view yields the
result of converting the value of the operand object to the target
subtype (which might raise Constraint_Error), except if the object
is of an elementary type and the view conversion is passed as an
out parameter; in this latter case, the value of the operand object
may be used to initialize the formal parameter without checking
against any constraint of the target subtype (as described more
- precisely in *note 6.4.1::).
+ precisely in *note 6.4.1::).
56.a/4
- Reason: {AI12-0074-1AI12-0074-1} This ensures that even an out
- parameter of an elementary type is initialized reasonably.
+ Reason: {<AI12-0074-1AI12-0074-1>} This ensures that even an
+ out parameter of an elementary type is initialized reasonably.
57/4
-{AI05-0290-1AI05-0290-1} {AI12-0096-1AI12-0096-1} If an
+{<AI05-0290-1AI05-0290-1>} {<AI12-0096-1AI12-0096-1>} If an
Accessibility_Check fails, Program_Error is raised. If a predicate
check fails, the effect is as defined in subclause *note 3.2.4::, "*note
3.2.4:: Subtype Predicates". Any other check associated with a
@@ -26233,10 +26317,10 @@ subtype of the type.
if the value is outside the base range of the type.
58.1/4
-{AI12-0027-1AI12-0027-1} Evaluation of a value conversion of a composite
-type either creates a new anonymous object[ (similar to the object
-created by the evaluation of an aggregate or a function call)] or yields
-a new view of the operand object without creating a new object:
+{<AI12-0027-1AI12-0027-1>} Evaluation of a value conversion of a
+composite type either creates a new anonymous object[ (similar to the
+object created by the evaluation of an aggregate or a function call)] or
+yields a new view of the operand object without creating a new object:
58.2/4
* If the target type is a by-reference type and there is a type that
@@ -26252,7 +26336,7 @@ a new view of the operand object without creating a new
object:
* Otherwise, it is unspecified whether a new object is created.
58.5/4
-{AI12-0027-1AI12-0027-1} If a new object is created, then the
+{<AI12-0027-1AI12-0027-1>} If a new object is created, then the
initialization of that object is an assignment operation.
58.b.1/4
@@ -26267,7 +26351,7 @@ initialization of that object is an assignment
operation.
performed implicitly in situations where the expected type and the
actual type of a construct differ, as is permitted by the type
resolution rules (see *note 8.6::). For example, an integer
- literal is of the type universal_integer, and is implicitly
+ literal is of the type <universal_integer>, and is implicitly
converted when assigned to a target of some specific integer type.
Similarly, an actual parameter of a specific tagged type is
implicitly converted when the corresponding formal parameter is of
@@ -26281,7 +26365,7 @@ initialization of that object is an assignment
operation.
the constraints of the target subtype.
61/2
- 21 {AI95-00230-01AI95-00230-01} A ramification of the overload
+ 21 {<AI95-00230-01AI95-00230-01>} A ramification of the overload
resolution rules is that the operand of an (explicit)
type_conversion cannot be an allocator, an aggregate, a
string_literal, a character_literal, or an attribute_reference for
@@ -26300,15 +26384,15 @@ initialization of that object is an assignment
operation.
_Examples_
63
-Examples of numeric type conversion:
+<Examples of numeric type conversion:>
64
- Real(2*J) -- value is converted to floating point
- Integer(1.6) -- value is 2
- Integer(-0.4) -- value is 0
+ Real(2*J) <-- value is converted to floating point>
+ Integer(1.6) <-- value is 2>
+ Integer(-0.4) <-- value is 0>
65
-Example of conversion between derived types:
+<Example of conversion between derived types:>
66
type A_Form is new B_Form;
@@ -26319,10 +26403,10 @@ Example of conversion between derived types:
68
X := A_Form(Y);
- Y := B_Form(X); -- the reverse conversion
+ Y := B_Form(X); <-- the reverse conversion >
69
-Examples of conversions between array types:
+<Examples of conversions between array types:>
70
type Sequence is array (Integer range <>) of Integer;
@@ -26330,9 +26414,9 @@ Examples of conversions between array types:
Ledger : array(1 .. 100) of Integer;
71
- Sequence(Ledger) -- bounds are those of Ledger
- Sequence(Ledger(31 .. 42)) -- bounds are 31 and 42
- Dozen(Ledger(31 .. 42)) -- bounds are those of Dozen
+ Sequence(Ledger) <-- bounds are those of Ledger>
+ Sequence(Ledger(31 .. 42)) <-- bounds are 31 and 42>
+ Dozen(Ledger(31 .. 42)) <-- bounds are those of Dozen >
_Incompatibilities With Ada 83_
@@ -26397,7 +26481,7 @@ Examples of conversions between array types:
allowed as the operand of a type_conversion, except in a NOTE.
71.i/3
- {AI05-0299-1AI05-0299-1} The rules in this subclause subsume
+ {<AI05-0299-1AI05-0299-1>} The rules in this subclause subsume
the rules for "parameters of the form of a type conversion,"
and have been generalized to cover the use of a type
conversion as a name.
@@ -26405,20 +26489,20 @@ Examples of conversions between array types:
_Incompatibilities With Ada 95_
71.j/2
- {AI95-00246-01AI95-00246-01} Amendment Correction: Conversions
- between unrelated array types that are limited or (for view
- conversions) might be by-reference types are now illegal. The
- representations of two such arrays may differ, making the
- conversions impossible. We make the check here, because
- legality should not be based on representation properties.
- Such conversions are likely to be rare, anyway. There is a
- potential that this change would make a working program
- illegal (if the types have the same representation).
+ {<AI95-00246-01AI95-00246-01>} Amendment Correction:
+ Conversions between unrelated array types that are limited or
+ (for view conversions) might be by-reference types are now
+ illegal. The representations of two such arrays may differ,
+ making the conversions impossible. We make the check here,
+ because legality should not be based on representation
+ properties. Such conversions are likely to be rare, anyway.
+ There is a potential that this change would make a working
+ program illegal (if the types have the same representation).
71.k/2
- {AI95-00363-01AI95-00363-01} If a discriminated full type has
- a partial view (private type) that is constrained, we do not
- allow conversion between access-to-unconstrained and
+ {<AI95-00363-01AI95-00363-01>} If a discriminated full type
+ has a partial view (private type) that is constrained, we do
+ not allow conversion between access-to-unconstrained and
access-to-constrained subtypes designating the type. Ada 95
allowed this conversion and the declaration of various access
subtypes, requiring that the designated object be constrained
@@ -26429,14 +26513,14 @@ Examples of conversions between array types:
_Extensions to Ada 95_
71.l/2
- {AI95-00230-01AI95-00230-01} Conversion rules for
- universal_access were defined. These allow the use of
+ {<AI95-00230-01AI95-00230-01>} Conversion rules for
+ <universal_access> were defined. These allow the use of
anonymous access values in equality tests (see *note 4.5.2::),
and also allow the use of null in type conversions and other
contexts that do not provide a single expected type.
71.m/2
- {AI95-00384-01AI95-00384-01} A type conversion from an
+ {<AI95-00384-01AI95-00384-01>} A type conversion from an
access-to-discriminated and unconstrained object to an
access-to-discriminated and constrained one is allowed. Ada
95 only allowed the reverse conversion, which was weird and
@@ -26446,33 +26530,34 @@ Examples of conversions between array types:
_Wording Changes from Ada 95_
71.n/2
- {8652/00178652/0017} {AI95-00184-01AI95-00184-01} Corrigendum:
- Wording was added to ensure that view conversions are
- constrained, and that a tagged view conversion has a tagged
- object. Both rules are needed to avoid having a way to change
- the discriminants of a constrained object.
+ {<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>}
+ Corrigendum: Wording was added to ensure that view conversions
+ are constrained, and that a tagged view conversion has a
+ tagged object. Both rules are needed to avoid having a way to
+ change the discriminants of a constrained object.
71.o/2
- {8652/00088652/0008} {AI95-00168-01AI95-00168-01} Corrigendum:
- Wording was added to ensure that the aliased status of array
- components cannot change in a view conversion. This rule was
- needed to avoid having a way to change the discriminants of an
- aliased object. This rule was repealed later, as Ada 2005
- allows changing the discriminants of an aliased object.
+ {<8652/00088652/0008>} {<AI95-00168-01AI95-00168-01>}
+ Corrigendum: Wording was added to ensure that the aliased
+ status of array components cannot change in a view conversion.
+ This rule was needed to avoid having a way to change the
+ discriminants of an aliased object. This rule was repealed
+ later, as Ada 2005 allows changing the discriminants of an
+ aliased object.
71.p/2
- {AI95-00231-01AI95-00231-01} Wording was added to check
+ {<AI95-00231-01AI95-00231-01>} Wording was added to check
subtypes that exclude null (see *note 3.10::).
71.q/2
- {AI95-00251-01AI95-00251-01} The organization of the legality
- rules was changed, both to make it clearer, and to eliminate
- an unintentional incompatibility with Ada 83. The old
- organization prevented type conversions between some types
+ {<AI95-00251-01AI95-00251-01>} The organization of the
+ legality rules was changed, both to make it clearer, and to
+ eliminate an unintentional incompatibility with Ada 83. The
+ old organization prevented type conversions between some types
that were related by derivation (which Ada 83 always allowed).
71.r/3
- {AI95-00330-01AI95-00330-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00330-01AI95-00330-01>} {<AI05-0005-1AI05-0005-1>}
Clarified that an untagged type conversion appearing as a
generic actual parameter for a generic in out formal parameter
is not a view conversion (and thus is illegal). This confirms
@@ -26480,13 +26565,13 @@ Examples of conversions between array types:
interpretation.
71.s/2
- {AI95-00363-01AI95-00363-01} Rules added by the Corrigendum to
- eliminate problems with discriminants of aliased components
+ {<AI95-00363-01AI95-00363-01>} Rules added by the Corrigendum
+ to eliminate problems with discriminants of aliased components
changing were removed, as we now generally allow discriminants
of aliased components to be changed.
71.t/2
- {AI95-00392-01AI95-00392-01} Accessibility checks on
+ {<AI95-00392-01AI95-00392-01>} Accessibility checks on
conversions involving types with anonymous access components
were added. These components have the level of the type, and
conversions can be between types at different levels, which
@@ -26496,8 +26581,8 @@ Examples of conversions between array types:
_Inconsistencies With Ada 2005_
71.u/3
- {AI05-0148-1AI05-0148-1} A stand-alone object of an anonymous
- access-to-object type now has dynamic accessibility.
+ {<AI05-0148-1AI05-0148-1>} A stand-alone object of an
+ anonymous access-to-object type now has dynamic accessibility.
Normally, this will make programs legal that were illegal in
Ada 2005. However, it is possible that a program that
previously raised Program_Error now will not. It is very
@@ -26508,39 +26593,39 @@ Examples of conversions between array types:
_Wording Changes from Ada 2005_
71.v/3
- {AI05-0115-1AI05-0115-1} Correction: Clarified that a root
+ {<AI05-0115-1AI05-0115-1>} Correction: Clarified that a root
numeric type is not considered a common ancestor for a
conversion.
71.w/3
- {AI05-0153-3AI05-0153-3} {AI05-0290-1AI05-0290-1} Added rules
- so that predicate aspects (see *note 3.2.4::) are enforced on
- subtype conversion.
+ {<AI05-0153-3AI05-0153-3>} {<AI05-0290-1AI05-0290-1>} Added
+ rules so that predicate aspects (see *note 3.2.4::) are
+ enforced on subtype conversion.
_Incompatibilities With Ada 2012_
71.x/4
- {AI12-0095-1AI12-0095-1} Corrigendum: Because of a rule added
- in *note 12.5.1::, the checks for the legality of an access
- type conversion in a generic body were strengthened to use an
- assume the worst rule. This case is rather unlikely as a
- formal private or derived type with discriminants is required
- along with a conversion between two access types whose
- designated types don't statically match, and any such programs
- were at risk having objects disappear while valid access
- values still pointed at them.
+ {<AI12-0095-1AI12-0095-1>} Corrigendum: Because of a rule
+ added in *note 12.5.1::, the checks for the legality of an
+ access type conversion in a generic body were strengthened to
+ use an assume the worst rule. This case is rather unlikely as
+ a formal private or derived type with discriminants is
+ required along with a conversion between two access types
+ whose designated types don't statically match, and any such
+ programs were at risk having objects disappear while valid
+ access values still pointed at them.
_Wording Changes from Ada 2012_
71.y/4
- {AI12-0027-1AI12-0027-1} Corrigendum: Moved the generic
+ {<AI12-0027-1AI12-0027-1>} Corrigendum: Moved the generic
boilerplate so that it covers all Legality Rules in this
subclause. This was always intended, but it is not expected
to change anything other than conversions between unrelated
arrays.
71.z/4
- {AI12-0027-1AI12-0027-1} Corrigendum: Added a formal
+ {<AI12-0027-1AI12-0027-1>} Corrigendum: Added a formal
definition of the copy potentially created by a value
conversion of a composite type, so properties like
finalization and accessibility are properly defined. This
@@ -26548,20 +26633,20 @@ Examples of conversions between array types:
would not work), but it was not previously formally defined.
71.aa/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of type
- conversions to use the new term "satisfies the predicates"
- (see *note 3.2.4::).
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of
+ type conversions to use the new term "satisfies the
+ predicates" (see *note 3.2.4::).
71.bb/4
- {AI12-0074-1AI12-0074-1} Corrigendum: Clarified the wording
+ {<AI12-0074-1AI12-0074-1>} Corrigendum: Clarified the wording
describing the effect of view conversions of out parameters
such that it is clear that the detailed effect is defined in
*note 6.4.1::, not here.
71.cc/4
- {AI12-0096-1AI12-0096-1} Corrigendum: Updated wording of type
- conversions so that the exception raise or other effect of a
- failed predicate check is as defined in *note 3.2.4::; we
+ {<AI12-0096-1AI12-0096-1>} Corrigendum: Updated wording of
+ type conversions so that the exception raise or other effect
+ of a failed predicate check is as defined in *note 3.2.4::; we
don't want to repeat those rules here. This doesn't change
the behavior for predicate checks possible in original Ada
2012, only ones using the new aspect Predicate_Failure.
@@ -26575,7 +26660,7 @@ File: aarm2012.info, Node: 4.7, Next: 4.8, Prev:
4.6, Up: 4
1
[A qualified_expression is used to state explicitly the type, and to
verify the subtype, of an operand that is either an expression or an
-aggregate. ]
+aggregate. ]
_Syntax_
@@ -26586,28 +26671,29 @@ aggregate. ]
_Name Resolution Rules_
3
-The operand (the expression or aggregate) shall resolve to be of the
+The <operand> (the expression or aggregate) shall resolve to be of the
type determined by the subtype_mark (*note 3.2.2: S0028.), or a
universal type that covers it.
_Static Semantics_
3.1/3
-{AI05-0003-1AI05-0003-1} [If the operand of a qualified_expression
+{<AI05-0003-1AI05-0003-1>} [If the operand of a qualified_expression
denotes an object, the qualified_expression denotes a constant view of
that object.] The nominal subtype of a qualified_expression is the
subtype denoted by the subtype_mark.
3.a/3
- Proof: {AI05-0003-1AI05-0003-1} This is stated in *note 3.3::.
+ Proof: {<AI05-0003-1AI05-0003-1>} This is stated in *note
+ 3.3::.
_Dynamic Semantics_
4/4
-{AI12-0100-1AI12-0100-1} The evaluation of a qualified_expression
+{<AI12-0100-1AI12-0100-1>} The evaluation of a qualified_expression
evaluates the operand (and if of a universal type, converts it to the
type determined by the subtype_mark) and checks that its value belongs
-to the subtype denoted by the subtype_mark. The exception
+to the subtype denoted by the subtype_mark. The exception
Constraint_Error is raised if this check fails. Furthermore, if
predicate checks are enabled for the subtype denoted by the
subtype_mark, a check is performed as defined in subclause *note
@@ -26621,7 +26707,7 @@ predicates of the subtype.
provided.
4.a.1/4
- {AI12-0100-1AI12-0100-1} The effect of a failed predicate
+ {<AI12-0100-1AI12-0100-1>} The effect of a failed predicate
check is as defined in *note 3.2.4::; such a check could raise
any exception, not just Constraint_Error or Assertion_Error.
@@ -26634,8 +26720,8 @@ predicates of the subtype.
if subtype conversion is desired.
4.c/4
- {AI12-0100-1AI12-0100-1} We do a predicate check here so that
- a qualified_expression never allows something that the
+ {<AI12-0100-1AI12-0100-1>} We do a predicate check here so
+ that a qualified_expression never allows something that the
equivalent type_conversion would not allow.
NOTES
@@ -26650,34 +26736,34 @@ predicates of the subtype.
_Examples_
6
-Examples of disambiguating expressions using qualification:
+<Examples of disambiguating expressions using qualification:>
7
type Mask is (Fix, Dec, Exp, Signif);
type Code is (Fix, Cla, Dec, Tnz, Sub);
8
- Print (Mask'(Dec)); -- Dec is of type Mask
- Print (Code'(Dec)); -- Dec is of type Code
+ Print (Mask'(Dec)); <-- Dec is of type Mask>
+ Print (Code'(Dec)); <-- Dec is of type Code >
9
- for J in Code'(Fix) .. Code'(Dec) loop ... -- qualification needed for
either Fix or Dec
- for J in Code range Fix .. Dec loop ... -- qualification unnecessary
- for J in Code'(Fix) .. Dec loop ... -- qualification unnecessary
for Dec
+ for J in Code'(Fix) .. Code'(Dec) loop ... <-- qualification needed for
either Fix or Dec>
+ for J in Code range Fix .. Dec loop ... <-- qualification unnecessary>
+ for J in Code'(Fix) .. Dec loop ... <-- qualification unnecessary
for Dec>
10
- Dozen'(1 | 3 | 5 | 7 => 2, others => 0) -- see *note 4.6::
+ Dozen'(1 | 3 | 5 | 7 => 2, others => 0) <-- see *note 4.6:: >
_Wording Changes from Ada 2005_
10.a/3
- {AI05-0003-1AI05-0003-1} Added a definition of the nominal
+ {<AI05-0003-1AI05-0003-1>} Added a definition of the nominal
subtype of a qualified_expression.
_Inconsistencies With Ada 2012_
10.b/4
- {AI12-0100-1AI12-0100-1} Corrigendum: A qualified_expression
+ {<AI12-0100-1AI12-0100-1>} Corrigendum: A qualified_expression
now performs a predicate check for the named subtype (if it is
enabled). Original Ada 2012 did not include that check (an
omission). While this is formally inconsistent (an exception
@@ -26695,21 +26781,21 @@ File: aarm2012.info, Node: 4.8, Next: 4.9, Prev:
4.7, Up: 4
1
[The evaluation of an allocator creates an object and yields an access
-value that designates the object. ]
+value that designates the object. ]
_Syntax_
2/3
- {AI05-0111-3AI05-0111-3} allocator ::=
+ {<AI05-0111-3AI05-0111-3>} allocator ::=
new [subpool_specification] subtype_indication
| new [subpool_specification] qualified_expression
2.1/3
- {AI05-0111-3AI05-0111-3} subpool_specification ::= (subpool_handle_
- name)
+ {<AI05-0111-3AI05-0111-3>} subpool_specification ::=
+ (<subpool_handle_>name)
2.2/3
- {AI05-0104-1AI05-0104-1} For an allocator with a
+ {<AI05-0104-1AI05-0104-1>} For an allocator with a
subtype_indication, the subtype_indication shall not specify a
null_exclusion.
@@ -26723,16 +26809,16 @@ value that designates the object. ]
_Name Resolution Rules_
3/3
-{8652/00108652/0010} {AI95-00127-01AI95-00127-01}
-{AI05-0111-3AI05-0111-3} {AI05-0269-1AI05-0269-1} The expected type for
-an allocator shall be a single access-to-object type with designated
-type D such that either D covers the type determined by the subtype_mark
-of the subtype_indication (*note 3.2.2: S0027.) or qualified_expression
-(*note 4.7: S0142.), or the expected type is anonymous and the
-determined type is D'Class. A subpool_handle_name is expected to be of
-any type descended from Subpool_Handle, which is the type used to
-identify a subpool, declared in package System.Storage_Pools.Subpools
-(see *note 13.11.4::).
+{<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
+{<AI05-0111-3AI05-0111-3>} {<AI05-0269-1AI05-0269-1>} The expected type
+for an allocator shall be a single access-to-object type with designated
+type <D> such that either <D> covers the type determined by the
+subtype_mark of the subtype_indication (*note 3.2.2: S0027.) or
+qualified_expression (*note 4.7: S0142.), or the expected type is
+anonymous and the determined type is <D>'Class. A <subpool_handle_>name
+is expected to be of any type descended from Subpool_Handle, which is
+the type used to identify a subpool, declared in package
+System.Storage_Pools.Subpools (see *note 13.11.4::).
3.a
Discussion: See *note 8.6::, "*note 8.6:: The Context of
@@ -26740,20 +26826,19 @@ identify a subpool, declared in package
System.Storage_Pools.Subpools
type whose ..."
3.a.1/1
- Ramification: {8652/00108652/0010}
- {AI95-00127-01AI95-00127-01} An allocator is allowed as a
+ Ramification: {<8652/00108652/0010>}
+ {<AI95-00127-01AI95-00127-01>} An allocator is allowed as a
controlling parameter of a dispatching call (see *note
3.9.2::).
_Legality Rules_
4
-An initialized allocator is an allocator with a qualified_expression. An
-uninitialized allocator is one with a subtype_indication. In the
+An <initialized> allocator is an allocator with a qualified_expression.An
<uninitialized> allocator is one with a subtype_indication. In the
subtype_indication of an uninitialized allocator, a constraint is
permitted only if the subtype_mark denotes an [unconstrained] composite
subtype; if there is no constraint, then the subtype_mark shall denote a
-definite subtype.
+definite subtype.
4.a
Ramification: For example, ... new S'Class ... (with no
@@ -26763,20 +26848,20 @@ definite subtype.
have a constraint.)
5/2
-{AI95-00287-01AI95-00287-01} If the type of the allocator is an
+{<AI95-00287-01AI95-00287-01>} If the type of the allocator is an
access-to-constant type, the allocator shall be an initialized
allocator.
5.a/2
- This paragraph was deleted.{AI95-00287-01AI95-00287-01}
+ <This paragraph was deleted.>{<AI95-00287-01AI95-00287-01>}
5.1/3
-{AI05-0111-3AI05-0111-3} If a subpool_specification is given, the type
+{<AI05-0111-3AI05-0111-3>} If a subpool_specification is given, the type
of the storage pool of the access type shall be a descendant of
Root_Storage_Pool_With_Subpools.
5.2/3
-{AI95-00344-01AI95-00344-01} If the designated type of the type of the
+{<AI95-00344-01AI95-00344-01>} If the designated type of the type of the
allocator is class-wide, the accessibility level of the type determined
by the subtype_indication or qualified_expression shall not be
statically deeper than that of the type of the allocator.
@@ -26786,7 +26871,7 @@ statically deeper than that of the type of the
allocator.
type.
5.3/3
-{AI95-00416-01AI95-00416-01} {AI05-0051-1AI05-0051-1} If the subtype
+{<AI95-00416-01AI95-00416-01>} {<AI05-0051-1AI05-0051-1>} If the subtype
determined by the subtype_indication or qualified_expression of the
allocator has one or more access discriminants, then the accessibility
level of the anonymous access type of each access discriminant shall not
@@ -26798,10 +26883,10 @@ be statically deeper than that of the type of the
allocator (see *note
discriminants.
5.4/3
-{AI95-00366-01AI95-00366-01} {AI05-0052-1AI05-0052-1}
-{AI05-0157-1AI05-0157-1} An allocator shall not be of an access type for
-which the Storage_Size has been specified by a static expression with
-value zero or is defined by the language to be zero.
+{<AI95-00366-01AI95-00366-01>} {<AI05-0052-1AI05-0052-1>}
+{<AI05-0157-1AI05-0157-1>} An allocator shall not be of an access type
+for which the Storage_Size has been specified by a static expression
+with value zero or is defined by the language to be zero.
5.d/2
Reason: An allocator for an access type that has Storage_Size
@@ -26813,19 +26898,19 @@ value zero or is defined by the language to be zero.
would represent state.
5.e/3
- {AI05-0157-1AI05-0157-1} We don't need a special rule to cover
- generic formals (unlike many other similar Legality Rules).
- There are only two cases of interest. For formal access
- types, the Storage_Size property is not known in the generic,
- and surely isn't static, so this Legality Rule can never
- apply. For a formal derived type, this Legality Rule can only
- be triggered by a parent type having one of the appropriate
- properties. But Storage_Size can never be specified for a
- derived access type, so it always has the same value for all
- child types; additionally, a type derived from a remote access
- type (which has Storage_Size defined to be zero) is also a
- remote access type. That means that any actual that would
- match the formal derived type necessarily has the same
+ {<AI05-0157-1AI05-0157-1>} We don't need a special rule to
+ cover generic formals (unlike many other similar Legality
+ Rules). There are only two cases of interest. For formal
+ access types, the Storage_Size property is not known in the
+ generic, and surely isn't static, so this Legality Rule can
+ never apply. For a formal derived type, this Legality Rule
+ can only be triggered by a parent type having one of the
+ appropriate properties. But Storage_Size can never be
+ specified for a derived access type, so it always has the same
+ value for all child types; additionally, a type derived from a
+ remote access type (which has Storage_Size defined to be zero)
+ is also a remote access type. That means that any actual that
+ would match the formal derived type necessarily has the same
Storage_Size properties, so it is harmless (and preferable) to
check them in the body - they are always known in that case.
For other formal types,allocators are not allowed, so we don't
@@ -26833,7 +26918,7 @@ value zero or is defined by the language to be zero.
rule here.
5.5/3
-{AI05-0052-1AI05-0052-1} If the designated type of the type of the
+{<AI05-0052-1AI05-0052-1>} If the designated type of the type of the
allocator is limited, then the allocator shall not be used to define the
value of an access discriminant, unless the discriminated type is
immutably limited (see *note 7.5::).
@@ -26850,9 +26935,9 @@ immutably limited (see *note 7.5::).
containing object is of a type that is always limited.
5.6/3
-{AI05-0052-1AI05-0052-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules apply also in the private
-part of an instance of a generic unit.
+{<AI05-0052-1AI05-0052-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules apply also in the
+private part of an instance of a generic unit.
5.g/3
Discussion: This applies to all of the Legality Rules of this
@@ -26861,27 +26946,28 @@ part of an instance of a generic unit.
_Static Semantics_
6/3
-{AI95-00363-01AI95-00363-01} {AI05-0041-1AI05-0041-1} If the designated
-type of the type of the allocator is elementary, then the subtype of the
-created object is the designated subtype. If the designated type is
-composite, then the subtype of the created object is the designated
-subtype when the designated subtype is constrained or there is an
-ancestor of the designated type that has a constrained partial view;
-otherwise, the created object is constrained by its initial value [(even
-if the designated subtype is unconstrained with defaults)].
+{<AI95-00363-01AI95-00363-01>} {<AI05-0041-1AI05-0041-1>} If the
+designated type of the type of the allocator is elementary, then the
+subtype of the created object is the designated subtype. If the
+designated type is composite, then the subtype of the created object is
+the designated subtype when the designated subtype is constrained or
+there is an ancestor of the designated type that has a constrained
+partial view; otherwise, the created object is constrained by its
+initial value [(even if the designated subtype is unconstrained with
+defaults)].
6.a
Discussion: See AI83-00331.
6.b/2
- Reason: {AI95-00363-01AI95-00363-01} All objects created by an
- allocator are aliased, and most aliased composite objects need
- to be constrained so that access subtypes work reasonably.
- Problematic access subtypes are prohibited for types with a
- constrained partial view.
+ Reason: {<AI95-00363-01AI95-00363-01>} All objects created by
+ an allocator are aliased, and most aliased composite objects
+ need to be constrained so that access subtypes work
+ reasonably. Problematic access subtypes are prohibited for
+ types with a constrained partial view.
6.c/2
- Discussion: {AI95-00363-01AI95-00363-01} If there is a
+ Discussion: {<AI95-00363-01AI95-00363-01>} If there is a
constrained partial view of the type, this allows the objects
to be unconstrained. This eliminates privacy breaking (we
don't want the objects to act differently simply because
@@ -26898,11 +26984,11 @@ if the designated subtype is unconstrained with
defaults)].
_Dynamic Semantics_
7/2
-{AI95-00373-01AI95-00373-01} For the evaluation of an initialized
+{<AI95-00373-01AI95-00373-01>} For the evaluation of an initialized
allocator, the evaluation of the qualified_expression is performed
-first. An object of the designated type is created and the value of the
+first. An object of the designated type is created and the value of the
qualified_expression is converted to the designated subtype and assigned
-to the object.
+to the object.
7.a
Ramification: The conversion might raise Constraint_Error.
@@ -26912,19 +26998,19 @@ For the evaluation of an uninitialized allocator, the
elaboration of the
subtype_indication is performed first. Then:
9/2
- * {AI95-00373-01AI95-00373-01} If the designated type is elementary,
- an object of the designated subtype is created and any implicit
- initial value is assigned;
+ * {<AI95-00373-01AI95-00373-01>} If the designated type is
+ elementary, an object of the designated subtype is created and any
+ implicit initial value is assigned;
10/2
- * {8652/00028652/0002} {AI95-00171-01AI95-00171-01}
- {AI95-00373-01AI95-00373-01} If the designated type is composite,
+ * {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ {<AI95-00373-01AI95-00373-01>} If the designated type is composite,
an object of the designated type is created with tag, if any,
determined by the subtype_mark of the subtype_indication. This
object is then initialized by default (see *note 3.3.1::) using the
- subtype_indication to determine its nominal subtype. A check is
+ subtype_indication to determine its nominal subtype. A check is
made that the value of the object belongs to the designated
- subtype. Constraint_Error is raised if this check fails. This
+ subtype. Constraint_Error is raised if this check fails. This
check and the initialization of the object are performed in an
arbitrary order.
@@ -26932,9 +27018,9 @@ subtype_indication is performed first. Then:
Discussion: AI83-00150.
10.1/3
-{AI95-00344-01AI95-00344-01} {AI95-00416-01AI95-00416-01}
-{AI05-0024-1AI05-0024-1} {AI05-0051-1AI05-0051-1}
-{AI05-0234-1AI05-0234-1} For any allocator, if the designated type of
+{<AI95-00344-01AI95-00344-01>} {<AI95-00416-01AI95-00416-01>}
+{<AI05-0024-1AI05-0024-1>} {<AI05-0051-1AI05-0051-1>}
+{<AI05-0234-1AI05-0234-1>} For any allocator, if the designated type of
the type of the allocator is class-wide, then a check is made that the
master of the type determined by the subtype_indication, or by the tag
of the value of the qualified_expression, includes the elaboration of
@@ -26944,21 +27030,22 @@ tag of the value if the type of the
qualified_expression is class-wide)
has one or more access discriminants, then a check is made that the
accessibility level of the anonymous access type of each access
discriminant is not deeper than that of the type of the allocator.
-Program_Error is raised if either such check fails.
+Program_Error is raised if either such check fails.
10.b/3
- Reason: {AI95-00344-01AI95-00344-01} {AI05-0024-1AI05-0024-1}
- The master check on class-wide types prevents the allocated
- object from outliving its type. We need the run-time check in
- instance bodies, or when the type of the qualified_expression
- is class-wide (other cases are statically detected).
+ Reason: {<AI95-00344-01AI95-00344-01>}
+ {<AI05-0024-1AI05-0024-1>} The master check on class-wide
+ types prevents the allocated object from outliving its type.
+ We need the run-time check in instance bodies, or when the
+ type of the qualified_expression is class-wide (other cases
+ are statically detected).
10.b.1/3
- {AI05-0024-1AI05-0024-1} We can't use the normal accessibility
- level "deeper than" check here because we may have
- "incomparable" levels if the appropriate master and the type
- declaration belong to two different tasks. This can happen
- when checking the master of the tag for an allocator
+ {<AI05-0024-1AI05-0024-1>} We can't use the normal
+ accessibility level "deeper than" check here because we may
+ have "incomparable" levels if the appropriate master and the
+ type declaration belong to two different tasks. This can
+ happen when checking the master of the tag for an allocator
initialized by a parameter passed in to an accept statement,
if the type of the allocator is an access type declared in the
enclosing task body. For example:
@@ -26970,22 +27057,22 @@ Program_Error is raised if either such check fails.
begin
accept E(X : T'Class) do
P := new T'Class'(X);
- -- Master check on tag of X.
- -- Can't use "accessibility levels" since they might
be incomparable.
- -- Must revert to checking that the master of the
type identified by
- -- X'tag includes the elaboration of Acc_TC, so it is
sure to outlive it.
+ <-- Master check on tag of X.>
+ <-- Can't use "accessibility levels" since they might
be incomparable.>
+ <-- Must revert to checking that the master of the
type identified by>
+ <-- X'tag includes the elaboration of Acc_TC, so it
is sure to outlive it.>
end E;
10.c/2
- {AI95-00416-01AI95-00416-01} The accessibility check on access
- discriminants prevents the allocated object from outliving its
- discriminants.
+ {<AI95-00416-01AI95-00416-01>} The accessibility check on
+ access discriminants prevents the allocated object from
+ outliving its discriminants.
10.2/2
-{AI95-00280-01AI95-00280-01} If the object to be created by an allocator
-has a controlled or protected part, and the finalization of the
-collection of the type of the allocator (see *note 7.6.1::) has started,
-Program_Error is raised.
+{<AI95-00280-01AI95-00280-01>} If the object to be created by an
+allocator has a controlled or protected part, and the finalization of
+the collection of the type of the allocator (see *note 7.6.1::) has
+started, Program_Error is raised.
10.d/2
Reason: If the object has a controlled or protected part, its
@@ -27005,10 +27092,10 @@ Program_Error is raised.
allocating them.
10.3/2
-{AI95-00280-01AI95-00280-01} If the object to be created by an allocator
-contains any tasks, and the master of the type of the allocator is
-completed, and all of the dependent tasks of the master are terminated
-(see *note 9.3::), then Program_Error is raised.
+{<AI95-00280-01AI95-00280-01>} If the object to be created by an
+allocator contains any tasks, and the master of the type of the
+allocator is completed, and all of the dependent tasks of the master are
+terminated (see *note 9.3::), then Program_Error is raised.
10.f/2
Reason: A task created after waiting for tasks has finished
@@ -27016,10 +27103,11 @@ completed, and all of the dependent tasks of the
master are terminated
never be awaited.
10.4/3
-{AI05-0111-3AI05-0111-3} If the allocator includes a
-subpool_handle_name, Constraint_Error is raised if the subpool handle is
-null. Program_Error is raised if the subpool does not belong (see *note
-13.11.4::) to the storage pool of the access type of the allocator.
+{<AI05-0111-3AI05-0111-3>} If the allocator includes a
+<subpool_handle_>name, Constraint_Error is raised if the subpool handle
+is null. Program_Error is raised if the subpool does not <belong> (see
+*note 13.11.4::) to the storage pool of the access type of the
+allocator.
10.g/3
Implementation Note: This can be implemented by comparing the
@@ -27044,10 +27132,10 @@ returned.
_Bounded (Run-Time) Errors_
11.1/2
-{AI95-00280-01AI95-00280-01} It is a bounded error if the finalization
-of the collection of the type (see *note 7.6.1::) of the allocator has
-started. If the error is detected, Program_Error is raised. Otherwise,
-the allocation proceeds normally.
+{<AI95-00280-01AI95-00280-01>} It is a bounded error if the
+finalization of the collection of the type (see *note 7.6.1::) of the
+allocator has started. If the error is detected, Program_Error is
+raised. Otherwise, the allocation proceeds normally.
11.a/2
Discussion: This check is required in some cases; see above.
@@ -27066,14 +27154,14 @@ the allocation proceeds normally.
14
26 As explained in *note 13.11::, "*note 13.11:: Storage
Management", the storage for an object allocated by an allocator
- comes from a storage pool (possibly user defined). The exception
+ comes from a storage pool (possibly user defined). The exception
Storage_Error is raised by an allocator if there is not enough
storage. Instances of Unchecked_Deallocation may be used to
explicitly reclaim storage.
15/3
- 27 {AI05-0229-1AI05-0229-1} Implementations are permitted, but not
- required, to provide garbage collection.
+ 27 {<AI05-0229-1AI05-0229-1>} Implementations are permitted, but
+ not required, to provide garbage collection.
15.a
Ramification: Note that in an allocator, the exception
@@ -27090,24 +27178,24 @@ the allocation proceeds normally.
_Examples_
16
-Examples of allocators:
+<Examples of allocators:>
17
- new Cell'(0, null, null) -- initialized
explicitly, see *note 3.10.1::
- new Cell'(Value => 0, Succ => null, Pred => null) -- initialized
explicitly
- new Cell -- not initialized
+ new Cell'(0, null, null) <-- initialized
explicitly, see *note 3.10.1::>
+ new Cell'(Value => 0, Succ => null, Pred => null) <-- initialized
explicitly>
+ new Cell <-- not initialized>
18
- new Matrix(1 .. 10, 1 .. 20) -- the bounds only are
given
- new Matrix'(1 .. 10 => (1 .. 20 => 0.0)) -- initialized
explicitly
+ new Matrix(1 .. 10, 1 .. 20) <-- the bounds only are
given>
+ new Matrix'(1 .. 10 => (1 .. 20 => 0.0)) <-- initialized
explicitly>
19
- new Buffer(100) -- the discriminant
only is given
- new Buffer'(Size => 80, Pos => 0, Value => (1 .. 80 => 'A')) --
initialized explicitly
+ new Buffer(100) <-- the discriminant
only is given>
+ new Buffer'(Size => 80, Pos => 0, Value => (1 .. 80 => 'A')) <--
initialized explicitly>
20
- Expr_Ptr'(new Literal) -- allocator for
access-to-class-wide type, see *note 3.9.1::
- Expr_Ptr'(new Literal'(Expression with 3.5)) -- initialized
explicitly
+ Expr_Ptr'(new Literal) <-- allocator for
access-to-class-wide type, see *note 3.9.1::>
+ Expr_Ptr'(new Literal'(Expression with 3.5)) <-- initialized
explicitly>
_Incompatibilities With Ada 83_
@@ -27120,9 +27208,9 @@ Examples of allocators:
_Extensions to Ada 83_
20.b
- Allocators creating objects of type T are now overloaded on
- access types designating T'Class and all class-wide types that
- cover T.
+ Allocators creating objects of type <T> are now overloaded on
+ access types designating <T'>Class and all class-wide types
+ that cover <T>.
20.c
Implicit array subtype conversion (sliding) is now performed
@@ -27143,7 +27231,7 @@ Examples of allocators:
_Inconsistencies With Ada 95_
20.f/2
- {AI95-00363-01AI95-00363-01} If the designated type has a
+ {<AI95-00363-01AI95-00363-01>} If the designated type has a
constrained partial view, the allocated object can be
unconstrained. This might cause the object to take up a
different amount of memory, and might cause the operations to
@@ -27157,7 +27245,7 @@ Examples of allocators:
_Incompatibilities With Ada 95_
20.g/2
- {AI95-00366-01AI95-00366-01} An allocator for an access type
+ {<AI95-00366-01AI95-00366-01>} An allocator for an access type
that has Storage_Size specified to be zero is now illegal.
Ada 95 allowed the allocator, but it had to raise
Storage_Error if executed. The primary impact of this change
@@ -27166,23 +27254,23 @@ Examples of allocators:
_Extensions to Ada 95_
20.h/2
- {8652/00108652/0010} {AI95-00127-01AI95-00127-01} Corrigendum:
- An allocator can be a controlling parameter of a dispatching
- call. This was an oversight in Ada 95.
+ {<8652/00108652/0010>} {<AI95-00127-01AI95-00127-01>}
+ Corrigendum: An allocator can be a controlling parameter of a
+ dispatching call. This was an oversight in Ada 95.
20.i/2
- {AI95-00287-01AI95-00287-01} Initialized allocators are
+ {<AI95-00287-01AI95-00287-01>} Initialized allocators are
allowed when the designated type is limited.
_Wording Changes from Ada 95_
20.j/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Clarified the elaboration of per-object constraints for an
- uninitialized allocator.
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Clarified the elaboration of per-object
+ constraints for an uninitialized allocator.
20.k/2
- {AI95-00280-01AI95-00280-01} Program_Error is now raised if
+ {<AI95-00280-01AI95-00280-01>} Program_Error is now raised if
the allocator occurs after the finalization of the collection
or the waiting for tasks. This is not listed as an
incompatibility as the Ada 95 behavior was unspecified, and
@@ -27190,20 +27278,20 @@ Examples of allocators:
this case.
20.l/2
- {AI95-00344-01AI95-00344-01} Added accessibility checks to
+ {<AI95-00344-01AI95-00344-01>} Added accessibility checks to
class-wide allocators. These checks could not fail in Ada 95
(as all of the designated types had to be declared at the same
level, so the access type would necessarily have been at the
same level or more nested than the type of allocated object).
20.m/2
- {AI95-00373-01AI95-00373-01} Revised the description of
+ {<AI95-00373-01AI95-00373-01>} Revised the description of
evaluation of uninitialized allocators to use "initialized by
default" so that the ordering requirements are the same for
all kinds of objects that are default-initialized.
20.n/2
- {AI95-00416-01AI95-00416-01} Added accessibility checks to
+ {<AI95-00416-01AI95-00416-01>} Added accessibility checks to
access discriminants of allocators. These checks could not
fail in Ada 95 as the discriminants always have the
accessibility of the object.
@@ -27211,7 +27299,7 @@ Examples of allocators:
_Incompatibilities With Ada 2005_
20.o/3
- {AI05-0052-1AI05-0052-1} Correction: Added a rule to prevent
+ {<AI05-0052-1AI05-0052-1>} Correction: Added a rule to prevent
limited coextensions of nonlimited types. Allowing this would
have far-reaching implementation costs. Because of those
costs, it seems unlikely that any implementation ever
@@ -27219,7 +27307,7 @@ Examples of allocators:
existing code depends on this capability.
20.p/3
- {AI05-0104-1AI05-0104-1} Correction: Added a rule to make
+ {<AI05-0104-1AI05-0104-1>} Correction: Added a rule to make
null_exclusions illegal for uninitialized allocators, as such
an allocator would always raise Constraint_Error. Programs
that depend on the unconditional raising of a predefined
@@ -27228,27 +27316,28 @@ Examples of allocators:
_Extensions to Ada 2005_
20.q/3
- {AI05-0111-3AI05-0111-3} Subpool handles (see *note 13.11.4::)
- can be specified in an allocator.
+ {<AI05-0111-3AI05-0111-3>} Subpool handles (see *note
+ 13.11.4::) can be specified in an allocator.
_Wording Changes from Ada 2005_
20.r/3
- {AI05-0024-1AI05-0024-1} Correction: Corrected the master
+ {<AI05-0024-1AI05-0024-1>} Correction: Corrected the master
check for tags since the masters may be for different tasks
and thus incomparable.
20.s/3
- {AI05-0041-1AI05-0041-1} Correction: Corrected the rules for
+ {<AI05-0041-1AI05-0041-1>} Correction: Corrected the rules for
when a designated object is constrained by its initial value
so that types derived from a partial view are handled
properly.
20.t/3
- {AI05-0051-1AI05-0051-1} {AI05-0234-1AI05-0234-1} Correction:
- Corrected the accessibility check for access discriminants so
- that it does not depend on the designated type (which might
- not have discriminants when the allocated type does).
+ {<AI05-0051-1AI05-0051-1>} {<AI05-0234-1AI05-0234-1>}
+ Correction: Corrected the accessibility check for access
+ discriminants so that it does not depend on the designated
+ type (which might not have discriminants when the allocated
+ type does).
File: aarm2012.info, Node: 4.9, Prev: 4.8, Up: 4
@@ -27259,9 +27348,9 @@ File: aarm2012.info, Node: 4.9, Prev: 4.8, Up: 4
1
Certain expressions of a scalar or string type are defined to be static.
Similarly, certain discrete ranges are defined to be static, and certain
-scalar and string subtypes are defined to be static subtypes. [ Static
-means determinable at compile time, using the declared properties or
-values of the program entities.]
+scalar and string subtypes are defined to be static subtypes. [
+<Static> means determinable at compile time, using the declared
+properties or values of the program entities.]
1.a
Discussion: As opposed to more elaborate data flow analysis,
@@ -27321,9 +27410,9 @@ the following:
the function_call case.
6
- * a function_call whose function_name or function_prefix statically
- denotes a static function, and whose actual parameters, if any
- (whether given explicitly or by default), are all static
+ * a function_call whose <function_>name or <function_>prefix
+ statically denotes a static function, and whose actual parameters,
+ if any (whether given explicitly or by default), are all static
expressions;
6.a
@@ -27337,7 +27426,7 @@ the following:
7.a
Ramification: Note that this does not include the case of an
attribute that is a function; a reference to such an attribute
- is not even an expression. See above for function calls.
+ is not even an expression. See above for function <calls>.
7.b
An implementation may define the staticness and other
@@ -27365,11 +27454,11 @@ the following:
it nonstatic, even for strings.
11/4
- * {AI05-0158-1AI05-0158-1} {AI05-0269-1AI05-0269-1}
- {AI12-0039-1AI12-0039-1} a membership test whose
- tested_simple_expression is a static expression, and whose
+ * {<AI05-0158-1AI05-0158-1>} {<AI05-0269-1AI05-0269-1>}
+ {<AI12-0039-1AI12-0039-1>} a membership test whose
+ <tested_>simple_expression is a static expression, and whose
membership_choice_list consists only of membership_choices that are
- either static choice_simple_expressions, static ranges, or
+ either static <choice_>simple_expressions, static ranges, or
subtype_marks that denote a static [(scalar or string)] subtype;
11.a
@@ -27381,17 +27470,17 @@ the following:
expressions;
12.1/3
- * {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} a
+ * {<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} a
conditional_expression all of whose conditions,
- selecting_expressions, and dependent_expressions are static
+ <selecting_>expressions, and <dependent_>expressions are static
expressions;
13
* a static expression enclosed in parentheses.
13.a
- Discussion: Informally, we talk about a static value. When we
- do, we mean a value specified by a static expression.
+ Discussion: Informally, we talk about a <static value>. When
+ we do, we mean a value specified by a static expression.
13.b
Ramification: The language requires a static expression in a
@@ -27402,7 +27491,7 @@ the following:
extension_aggregate.
14
-A name statically denotes an entity if it denotes the entity and:
+A name <statically denotes> an entity if it denotes the entity and:
15
* It is a direct_name, expanded name, or character_literal, and it
@@ -27421,7 +27510,7 @@ A name statically denotes an entity if it denotes the
entity and:
and indexed_components do not statically denote things.
18
-A static function is one of the following:
+A <static function> is one of the following:
18.a
Ramification: These are the functions whose calls can be
@@ -27447,7 +27536,7 @@ A static function is one of the following:
In any case, a generic formal subprogram is not a static function.
24
-A static constant is a constant view declared by a full constant
+A <static constant> is a constant view declared by a full constant
declaration or an object_renaming_declaration (*note 8.5.1: S0200.) with
a static nominal subtype, having a value defined by a static scalar
expression or by a static string expression whose value has a length not
@@ -27460,7 +27549,7 @@ the implementation.
be static.
24.b/3
- Reason: {AI05-0229-1AI05-0229-1} The reason for restricting
+ Reason: {<AI05-0229-1AI05-0229-1>} The reason for restricting
the length of static string constants is so that compilers
don't have to store giant strings in their symbol tables.
Since most string constants will be initialized from
@@ -27478,26 +27567,27 @@ the implementation.
quotes don't count.
25
-A static range is a range whose bounds are static expressions, [or a
+A <static range> is a range whose bounds are static expressions, [or a
range_attribute_reference (*note 4.1.4: S0102.) that is equivalent to
-such a range.] A static discrete_range (*note 3.6.1: S0058.) is one that
-is a static range or is a subtype_indication (*note 3.2.2: S0027.) that
-defines a static scalar subtype. The base range of a scalar type is a
-static range, unless the type is a descendant of a formal scalar type.
+such a range.] A <static discrete_range (*note 3.6.1: S0058.)> is one
+that is a static range or is a subtype_indication (*note 3.2.2: S0027.)
+that defines a static scalar subtype. The base range of a scalar type
+is a static range, unless the type is a descendant of a formal scalar
+type.
26/3
-{AI95-00263-01AI95-00263-01} {AI05-0153-3AI05-0153-3} A static subtype
-is either a static scalar subtype or a static string subtype. A static
-scalar subtype is an unconstrained scalar subtype whose type is not a
-descendant of a formal type, or a constrained scalar subtype formed by
-imposing a compatible static constraint on a static scalar subtype. A
-static string subtype is an unconstrained string subtype whose index
-subtype and component subtype are static, or a constrained string
+{<AI95-00263-01AI95-00263-01>} {<AI05-0153-3AI05-0153-3>} A <static
+subtype> is either a <static scalar subtype> or a <static string
+subtype>. A static scalar subtype is an unconstrained scalar subtype
+whose type is not a descendant of a formal type, or a constrained scalar
subtype formed by imposing a compatible static constraint on a static
-string subtype. In any case, the subtype of a generic formal object of
-mode in out, and the result subtype of a generic formal function, are
-not static. Also, a subtype is not static if any Dynamic_Predicate
-specifications apply to it.
+scalar subtype. A static string subtype is an unconstrained string
+subtype whose index subtype and component subtype are static, or a
+constrained string subtype formed by imposing a compatible static
+constraint on a static string subtype. In any case, the subtype of a
+generic formal object of mode in out, and the result subtype of a
+generic formal function, are not static. Also, a subtype is not static
+if any Dynamic_Predicate specifications apply to it.
26.a
Ramification: String subtypes are the only composite subtypes
@@ -27522,13 +27612,13 @@ specifications apply to it.
begin
case F is
when 1..10 => null;
- -- Illegal!
+ --< Illegal!>
end case;
end G;
26.f
X : Integer range 1..20;
- procedure I is new G(F => X); -- OK.
+ procedure I is new G(F => X); --< OK.>
26.g
The case_statement is illegal, because the subtype of F is not
@@ -27538,7 +27628,7 @@ specifications apply to it.
names.
27
-The different kinds of static constraint are defined as follows:
+The different kinds of <static constraint> are defined as follows:
28
* A null constraint is always static;
@@ -27557,42 +27647,42 @@ The different kinds of static constraint are defined
as follows:
static.
31.1/2
-{AI95-00311-01AI95-00311-01} In any case, the constraint of the first
+{<AI95-00311-01AI95-00311-01>} In any case, the constraint of the first
subtype of a scalar formal type is neither static nor null.
32
-A subtype is statically constrained if it is constrained, and its
-constraint is static. An object is statically constrained if its
+A subtype is <statically constrained> if it is constrained, and its
+constraint is static. An object is <statically constrained> if its
nominal subtype is statically constrained, or if it is a static string
constant.
_Legality Rules_
32.1/3
-{AI05-0147-1AI05-0147-1} An expression is statically unevaluated if it
-is part of:
+{<AI05-0147-1AI05-0147-1>} An expression is <statically unevaluated> if
+it is part of:
32.2/3
- * {AI05-0147-1AI05-0147-1} the right operand of a static
+ * {<AI05-0147-1AI05-0147-1>} the right operand of a static
short-circuit control form whose value is determined by its left
operand; or
32.3/3
- * {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} a
- dependent_expression of an if_expression whose associated condition
- is static and equals False; or
+ * {<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} a
+ <dependent_>expression of an if_expression whose associated
+ condition is static and equals False; or
32.4/3
- * {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} a condition or
- dependent_expression of an if_expression where the condition
- corresponding to at least one preceding dependent_expression of the
- if_expression is static and equals True; or
+ * {<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} a condition
+ or <dependent_>expression of an if_expression where the condition
+ corresponding to at least one preceding <dependent_>expression of
+ the if_expression is static and equals True; or
32.a/3
Reason: We need this bullet so that only a single
- dependent_expression is evaluated in a static if_expression if
- there is more than one condition that evaluates to True. The
- part about conditions makes
+ <dependent_>expression is evaluated in a static if_expression
+ if there is more than one condition that evaluates to True.
+ The part about conditions makes
32.b/3
(if N = 0 then Min elsif 10_000/N > Min then 10_000/N else Min)
@@ -27601,77 +27691,78 @@ is part of:
legal if N and Min are static and N = 0.
32.d/3
- Discussion: {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1}
- We need the "of the if_expression" here so there is no
- confusion for nested if_expressions; this rule only applies to
- the conditions and dependent_expressions of a single
- if_expression. Similar reasoning applies to the "of a
- case_expression" of the last bullet.
+ Discussion: {<AI05-0147-1AI05-0147-1>}
+ {<AI05-0188-1AI05-0188-1>} We need the "of the if_expression"
+ here so there is no confusion for nested if_expressions; this
+ rule only applies to the conditions and
+ <dependent_>expressions of a single if_expression. Similar
+ reasoning applies to the "of a case_expression" of the last
+ bullet.
32.5/3
- * {AI05-0188-1AI05-0188-1} {AI05-0269-1AI05-0269-1} a
- dependent_expression of a case_expression whose
- selecting_expression is static and whose value is not covered by
+ * {<AI05-0188-1AI05-0188-1>} {<AI05-0269-1AI05-0269-1>} a
+ <dependent_>expression of a case_expression whose
+ <selecting_>expression is static and whose value is not covered by
the corresponding discrete_choice_list; or
32.6/4
- * {AI05-0158-1AI05-0158-1} {AI12-0039-1AI12-0039-1} a
- choice_simple_expression (or a simple_expression of a range that
+ * {<AI05-0158-1AI05-0158-1>} {<AI12-0039-1AI12-0039-1>} a
+ <choice_>simple_expression (or a simple_expression of a range that
occurs as a membership_choice of a membership_choice_list) of a
static membership test that is preceded in the enclosing
membership_choice_list by another item whose individual membership
test (see *note 4.5.2::) statically yields True.
33/3
-{AI05-0147-1AI05-0147-1} A static expression is evaluated at compile
+{<AI05-0147-1AI05-0147-1>} A static expression is evaluated at compile
time except when it is statically unevaluated. The compile-time
evaluation of a static expression is performed exactly, without
performing Overflow_Checks. For a static expression that is evaluated:
34/3
- * {AI05-0262-1AI05-0262-1} The expression is illegal if its
+ * {<AI05-0262-1AI05-0262-1>} The expression is illegal if its
evaluation fails a language-defined check other than
Overflow_Check. For the purposes of this evaluation, the assertion
policy is assumed to be Check.
34.a/3
- Reason: {AI05-0262-1AI05-0262-1} Assertion policies can
+ Reason: {<AI05-0262-1AI05-0262-1>} Assertion policies can
control whether checks are made, but we don't want assertion
policies to affect legality. For Ada 2012, subtype predicates
are the only checks controlled by the assertion policy that
can appear in static expressions.
35/2
- * {AI95-00269-01AI95-00269-01} If the expression is not part of a
+ * {<AI95-00269-01AI95-00269-01>} If the expression is not part of a
larger static expression and the expression is expected to be of a
single specific type, then its value shall be within the base range
of its expected type. Otherwise, the value may be arbitrarily
large or small.
35.a/2
- Ramification: {AI95-00269-01AI95-00269-01} If the expression
+ Ramification: {<AI95-00269-01AI95-00269-01>} If the expression
is expected to be of a universal type, or of "any integer
type", there are no limits on the value of the expression.
36/2
- * {AI95-00269-01AI95-00269-01} If the expression is of type
- universal_real and its expected type is a decimal fixed point type,
- then its value shall be a multiple of the small of the decimal
- type. This restriction does not apply if the expected type is a
- descendant of a formal scalar type (or a corresponding actual type
- in an instance).
+ * {<AI95-00269-01AI95-00269-01>} If the expression is of type
+ <universal_real> and its expected type is a decimal fixed point
+ type, then its value shall be a multiple of the <small> of the
+ decimal type. This restriction does not apply if the expected type
+ is a descendant of a formal scalar type (or a corresponding actual
+ type in an instance).
36.a
Ramification: This means that a numeric_literal for a decimal
type cannot have "extra" significant digits.
36.b/2
- Reason: {AI95-00269-01AI95-00269-01} The small is not known
+ Reason: {<AI95-00269-01AI95-00269-01>} The small is not known
for a generic formal type, so we have to exclude formal types
from this check.
37/2
-{AI95-00269-01AI95-00269-01} In addition to the places where Legality
+{<AI95-00269-01AI95-00269-01>} In addition to the places where Legality
Rules normally apply (see *note 12.3::), the above restrictions also
apply in the private part of an instance of a generic unit.
@@ -27689,7 +27780,7 @@ apply in the private part of an instance of a generic
unit.
37.c
N: constant := 0.0;
- X: constant Boolean := (N = 0.0) or else (1.0/N > 0.5); --
Static.
+ X: constant Boolean := (N = 0.0) or else (1.0/N > 0.5); --<
Static.>
37.d
The declaration of X is legal, since the divide-by-zero part
@@ -27699,7 +27790,7 @@ apply in the private part of an instance of a generic
unit.
_Implementation Requirements_
38/2
-{AI95-00268-01AI95-00268-01} {AI95-00269-01AI95-00269-01} For a real
+{<AI95-00268-01AI95-00268-01>} {<AI95-00269-01AI95-00269-01>} For a real
static expression that is not part of a larger static expression, and
whose expected type is not a descendant of a formal type, the
implementation shall round or truncate the value (according to the
@@ -27717,7 +27808,7 @@ rules apply (see *note Annex G::).
which are exactly half-way between two machine numbers.
38.a/2
- Reason: {AI95-00268-01AI95-00268-01} Discarding extended
+ Reason: {<AI95-00268-01AI95-00268-01>} Discarding extended
precision enhances portability by ensuring that the value of a
static constant of a real type is always a machine number of
the type.
@@ -27731,12 +27822,12 @@ rules apply (see *note Annex G::).
rules apply for descendants of a formal fixed point type.
38.b.1/2
- {AI95-00269-01AI95-00269-01} There is no requirement for exact
- evaluation or special rounding in an instance body (unless the
- expression is static in the generic body). This eliminates a
- potential contract issue where the exact value of a static
- expression depends on the actual parameters (which could then
- affect the legality of other code).
+ {<AI95-00269-01AI95-00269-01>} There is no requirement for
+ exact evaluation or special rounding in an instance body
+ (unless the expression is static in the generic body). This
+ eliminates a potential contract issue where the exact value of
+ a static expression depends on the actual parameters (which
+ could then affect the legality of other code).
38.c
Implementation Note: Note that the implementation of static
@@ -27744,7 +27835,7 @@ rules apply (see *note Annex G::).
type whose Signed_Zeros attribute is True.
38.d/2
- {AI95-00100-01AI95-00100-01} Note that the only machine
+ {<AI95-00100-01AI95-00100-01>} Note that the only machine
numbers of a fixed point type are the multiples of the small,
so a static conversion to a fixed-point type, or division by
an integer, must do truncation to a multiple of small. It is
@@ -27754,7 +27845,7 @@ rules apply (see *note Annex G::).
_Implementation Advice_
38.1/2
-{AI95-00268-01AI95-00268-01} For a real static expression that is not
+{<AI95-00268-01AI95-00268-01>} For a real static expression that is not
part of a larger static expression, and whose expected type is not a
descendant of a formal type, the rounding should be the same as the
default rounding for the target system.
@@ -27811,21 +27902,21 @@ default rounding for the target system.
_Examples_
41
-Examples of static expressions:
+<Examples of static expressions:>
42
- 1 + 1 -- 2
- abs(-10)*3 -- 30
+ 1 + 1 <-- 2>
+ abs(-10)*3 <-- 30>
43
Kilo : constant := 1000;
- Mega : constant := Kilo*Kilo; -- 1_000_000
+ Mega : constant := Kilo*Kilo; <-- 1_000_000>
Long : constant := Float'Digits*2;
44
- Half_Pi : constant := Pi/2; -- see *note 3.3.2::
+ Half_Pi : constant := Pi/2; <-- see *note 3.3.2::>
Deg_To_Rad : constant := Half_Pi/90;
- Rad_To_Deg : constant := 1.0/Deg_To_Rad; -- equivalent to
1.0/((3.14159_26536/2)/90)
+ Rad_To_Deg : constant := 1.0/Deg_To_Rad; <-- equivalent to
1.0/((3.14159_26536/2)/90)>
_Extensions to Ada 83_
@@ -27908,7 +27999,7 @@ Examples of static expressions:
_Wording Changes from Ada 83_
44.n/3
- {AI05-0299-1AI05-0299-1} This subclause (and *note 4.5.5::,
+ {<AI05-0299-1AI05-0299-1>} This subclause (and *note 4.5.5::,
"*note 4.5.5:: Multiplying Operators") subsumes the RM83
section on Universal Expressions.
@@ -27930,7 +28021,7 @@ Examples of static expressions:
an exception. Thus, for example:
44.q
- Bad: constant := 1/0; -- Illegal!
+ Bad: constant := 1/0; --< Illegal!>
44.r
was illegal because 1/0 was not static. In Ada 95, the above
@@ -27941,55 +28032,57 @@ Examples of static expressions:
_Inconsistencies With Ada 95_
44.s/2
- {AI95-00268-01AI95-00268-01} Amendment Correction: Rounding of
- static real expressions is implementation-defined in Ada 2005,
- while it was specified as away from zero in (original) Ada 95.
- This could make subtle differences in programs. However, the
- original Ada 95 rule required rounding that (probably)
- differed from the target processor, thus creating anomalies
- where the value of a static expression was required to be
- different than the same expression evaluated at run-time.
+ {<AI95-00268-01AI95-00268-01>} Amendment Correction: Rounding
+ of static real expressions is implementation-defined in Ada
+ 2005, while it was specified as away from zero in (original)
+ Ada 95. This could make subtle differences in programs.
+ However, the original Ada 95 rule required rounding that
+ (probably) differed from the target processor, thus creating
+ anomalies where the value of a static expression was required
+ to be different than the same expression evaluated at
+ run-time.
_Wording Changes from Ada 95_
44.t/2
- {AI95-00263-01AI95-00263-01} {AI95-00268-01AI95-00268-01} The
- Ada 95 wording that defined static subtypes unintentionally
- failed to exclude formal derived types that happen to be
- scalar (these aren't formal scalar types); and had a
- parenthetical remark excluding formal string types - but that
- was neither necessary nor parenthetical (it didn't follow from
- other wording). This issue also applies to the rounding rules
- for real static expressions.
+ {<AI95-00263-01AI95-00263-01>} {<AI95-00268-01AI95-00268-01>}
+ The Ada 95 wording that defined static subtypes
+ unintentionally failed to exclude formal derived types that
+ happen to be scalar (these aren't formal scalar types); and
+ had a parenthetical remark excluding formal string types - but
+ that was neither necessary nor parenthetical (it didn't follow
+ from other wording). This issue also applies to the rounding
+ rules for real static expressions.
44.u/2
- {AI95-00269-01AI95-00269-01} Ada 95 didn't clearly define the
- bounds of a value of a static expression for universal types
- and for "any integer/float/fixed type". We also make it clear
- that we do not intend exact evaluation of static expressions
- in an instance body if the expressions aren't static in the
- generic body.
+ {<AI95-00269-01AI95-00269-01>} Ada 95 didn't clearly define
+ the bounds of a value of a static expression for universal
+ types and for "any integer/float/fixed type". We also make it
+ clear that we do not intend exact evaluation of static
+ expressions in an instance body if the expressions aren't
+ static in the generic body.
44.v/2
- {AI95-00311-01AI95-00311-01} We clarify that the first subtype
- of a scalar formal type has a nonstatic, nonnull constraint.
+ {<AI95-00311-01AI95-00311-01>} We clarify that the first
+ subtype of a scalar formal type has a nonstatic, nonnull
+ constraint.
_Wording Changes from Ada 2005_
44.w/3
- {AI05-0147-1AI05-0147-1} {AI05-0188-1AI05-0188-1} Added
+ {<AI05-0147-1AI05-0147-1>} {<AI05-0188-1AI05-0188-1>} Added
wording to define staticness and the lack of evaluation for
if_expressions and case_expressions. These are new and
defined elsewhere.
44.x/3
- {AI05-0153-3AI05-0153-3} Added wording to prevent subtypes
+ {<AI05-0153-3AI05-0153-3>} Added wording to prevent subtypes
that have dynamic predicates (see *note 3.2.4::) from being
static.
44.y/3
- {AI05-0158-1AI05-0158-1} Revised wording for membership tests
- to allow for the new possibilities allowed by the
+ {<AI05-0158-1AI05-0158-1>} Revised wording for membership
+ tests to allow for the new possibilities allowed by the
membership_choice_list.
* Menu:
@@ -28005,7 +28098,7 @@ File: aarm2012.info, Node: 4.9.1, Up: 4.9
_Static Semantics_
1/2
-{AI95-00311-01AI95-00311-01} A constraint statically matches another
+{<AI95-00311-01AI95-00311-01>} A constraint <statically matches> another
constraint if:
1.1/2
@@ -28022,14 +28115,14 @@ constraint if:
3.6: S0055.); or
1.4/2
- * {AI95-00311-01AI95-00311-01} both are nonstatic and come from the
+ * {<AI95-00311-01AI95-00311-01>} both are nonstatic and come from the
same formal_type_declaration.
2/3
-{AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01}
-{AI05-0153-3AI05-0153-3} A subtype statically matches another subtype of
-the same type if they have statically matching constraints, all
-predicate specifications that apply to them come from the same
+{<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>}
+{<AI05-0153-3AI05-0153-3>} A subtype <statically matches> another
+subtype of the same type if they have statically matching constraints,
+all predicate specifications that apply to them come from the same
declarations, and, for access subtypes, either both or neither exclude
null. Two anonymous access-to-object subtypes statically match if their
designated subtypes statically match, and either both or neither exclude
@@ -28051,7 +28144,7 @@ null.
conform, so they couldn't be used in separate specifications.
3
-Two ranges of the same type statically match if both result from the
+Two ranges of the same type <statically match> if both result from the
same evaluation of a range, or if both are static and have equal
corresponding bounds.
@@ -28062,12 +28155,12 @@ corresponding bounds.
have to statically match.
4/3
-{AI05-0086-1AI05-0086-1} {AI05-0153-3AI05-0153-3} A constraint is
-statically compatible with a scalar subtype if it statically matches the
-constraint of the subtype, or if both are static and the constraint is
-compatible with the subtype. A constraint is statically compatible with
-an access or composite subtype if it statically matches the constraint
-of the subtype, or if the subtype is unconstrained.
+{<AI05-0086-1AI05-0086-1>} {<AI05-0153-3AI05-0153-3>} A constraint is
+<statically compatible> with a scalar subtype if it statically matches
+the constraint of the subtype, or if both are static and the constraint
+is compatible with the subtype. A constraint is <statically compatible>
+with an access or composite subtype if it statically matches the
+constraint of the subtype, or if the subtype is unconstrained.
4.a
Discussion: Static compatibility is required when constraining
@@ -28081,31 +28174,31 @@ of the subtype, or if the subtype is unconstrained.
different contexts.
5/3
-{AI05-0153-3AI05-0153-3} Two statically matching subtypes are statically
-compatible with each other. In addition, a subtype S1 is statically
-compatible with a subtype S2 if:
+{<AI05-0153-3AI05-0153-3>} Two statically matching subtypes are
+statically compatible with each other. In addition, a subtype <S1> is
+statically compatible with a subtype <S2> if:
6/3
- * the constraint of S1 is statically compatible with S2, and
+ * the constraint of <S1> is statically compatible with <S2>, and
7/3
- * {AI05-0086-1AI05-0086-1} if S2 excludes null, so does S1, and
+ * {<AI05-0086-1AI05-0086-1>} if <S2> excludes null, so does <S1>, and
8/3
* either:
9/3
- * all predicate specifications that apply to S2 apply also
- to S1, or
+ * all predicate specifications that apply to <S2> apply
+ also to <S1>, or
10/4
- * {AI05-0290-1AI05-0290-1} {AI12-0071-1AI12-0071-1} both
- subtypes are static, every value that satisfies the
- predicates of S1 also satisfies the predicates of S2, and
- it is not the case that both types each have at least one
- applicable predicate specification, predicate checks are
- enabled (see *note 11.4.2::) for S2, and predicate checks
- are not enabled for S1.
+ * {<AI05-0290-1AI05-0290-1>} {<AI12-0071-1AI12-0071-1>}
+ both subtypes are static, every value that satisfies the
+ predicates of <S1> also satisfies the predicates of <S2>,
+ and it is not the case that both types each have at least
+ one applicable predicate specification, predicate checks
+ are enabled (see *note 11.4.2::) for <S2>, and predicate
+ checks are not enabled for <S1>.
_Wording Changes from Ada 83_
@@ -28115,19 +28208,19 @@ compatible with a subtype S2 if:
_Wording Changes from Ada 95_
10.b/2
- {AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01}
+ {<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>}
Added static matching rules for null exclusions and anonymous
access-to-subprogram types; both of these are new.
10.c/2
- {AI95-00311-01AI95-00311-01} We clarify that the constraint of
- the first subtype of a scalar formal type statically matches
- itself.
+ {<AI95-00311-01AI95-00311-01>} We clarify that the constraint
+ of the first subtype of a scalar formal type statically
+ matches itself.
_Incompatibilities With Ada 2005_
10.d/3
- {AI05-0086-1AI05-0086-1} Correction: Updated the statically
+ {<AI05-0086-1AI05-0086-1>} Correction: Updated the statically
compatible rules to take null exclusions into account. This
is technically incompatible, as it could cause a legal Ada
2005 program to be rejected; however, such a program violates
@@ -28137,14 +28230,14 @@ compatible with a subtype S2 if:
_Wording Changes from Ada 2005_
10.e/3
- {AI05-0153-3AI05-0153-3} {AI05-0290-1AI05-0290-1} Modified
+ {<AI05-0153-3AI05-0153-3>} {<AI05-0290-1AI05-0290-1>} Modified
static matching and static compatibility to take predicate
aspects (see *note 3.2.4::) into account.
_Wording Changes from Ada 2012_
10.f/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of
static compatibility to use the new term "satisfies the
predicates" (see *note 3.2.4::).
@@ -28158,7 +28251,7 @@ File: aarm2012.info, Node: 5, Next: 6, Prev: 4, Up:
Top
[A statement defines an action to be performed upon its execution.]
2/3
-{AI95-00318-02AI95-00318-02} {AI05-0299-1AI05-0299-1} [This clause
+{<AI95-00318-02AI95-00318-02>} {<AI05-0299-1AI05-0299-1>} [This clause
describes the general rules applicable to all statements. Some
statements are discussed in later clauses: Procedure_call_statement
(*note 6.4: S0178.)s and return statements are described in *note 6::,
@@ -28175,7 +28268,7 @@ clause.]
_Wording Changes from Ada 83_
2.a/2
- {AI95-00318-02AI95-00318-02} The description of return
+ {<AI95-00318-02AI95-00318-02>} The description of return
statements has been moved to *note 6.5::, "*note 6.5:: Return
Statements", so that it is closer to the description of
subprograms.
@@ -28205,7 +28298,7 @@ and other compound_statements.]
_Syntax_
2/3
- {AI05-0179-1AI05-0179-1} sequence_of_statements ::= statement {
+ {<AI05-0179-1AI05-0179-1>} sequence_of_statements ::= statement {
statement} {label}
3
@@ -28213,7 +28306,7 @@ and other compound_statements.]
{label} simple_statement | {label} compound_statement
4/2
- {AI95-00318-02AI95-00318-02} simple_statement ::= null_statement
+ {<AI95-00318-02AI95-00318-02>} simple_statement ::= null_statement
| assignment_statement | exit_statement
| goto_statement | procedure_call_statement
| simple_return_statement | entry_call_statement
@@ -28222,7 +28315,7 @@ and other compound_statements.]
| code_statement
5/2
- {AI95-00318-02AI95-00318-02} compound_statement ::=
+ {<AI95-00318-02AI95-00318-02>} compound_statement ::=
if_statement | case_statement
| loop_statement | block_statement
| extended_return_statement
@@ -28232,7 +28325,7 @@ and other compound_statements.]
null_statement ::= null;
7
- label ::= <<label_statement_identifier>>
+ label ::= <<<label_>statement_identifier>>
8
statement_identifier ::= direct_name
@@ -28302,18 +28395,18 @@ statement_identifier.
12.f
declare
- -- Label Foo is implicitly declared here.
+ --< Label Foo is implicitly declared here.>
begin
for Foo in ... loop
...
- <<Foo>> -- Illegal.
+ <<Foo>> --< Illegal.>
...
end loop;
end;
-
+
12.g/3
- {AI05-0299-1AI05-0299-1} The label in this example is hidden
+ {<AI05-0299-1AI05-0299-1>} The label in this example is hidden
from itself by the loop parameter with the same name; the
example is illegal. We considered creating a new syntactic
category name, separate from direct_name and selector_name,
@@ -28321,7 +28414,7 @@ statement_identifier.
confuse the rules in Clause 8, so we didn't do it.
12.1/3
-{AI05-0179-1AI05-0179-1} If one or more labels end a
+{<AI05-0179-1AI05-0179-1>} If one or more labels end a
sequence_of_statements, an implicit null_statement follows the labels
before any following constructs.
@@ -28337,7 +28430,7 @@ before any following constructs.
The execution of a null_statement has no effect.
14/2
-{AI95-00318-02AI95-00318-02} A transfer of control is the run-time
+{<AI95-00318-02AI95-00318-02>} A <transfer of control> is the run-time
action of an exit_statement, return statement, goto_statement, or
requeue_statement, selection of a terminate_alternative, raising of an
exception, or an abort, which causes the next action performed to be one
@@ -28374,20 +28467,20 @@ completed.
16.b
task body Compute is
- Sum : Integer := 0; -- Compute.Sum
+ Sum : Integer := 0; --< Compute.Sum>
begin
- Outer: -- Compute.Outer
- for I in 1..10 loop -- Compute.Outer.I
- Blk: -- Compute.Blk
+ Outer: --< Compute.Outer>
+ for I in 1..10 loop --< Compute.Outer.I>
+ Blk: --< Compute.Blk>
declare
- Sum : Integer := 0; -- Compute.Blk.Sum
+ Sum : Integer := 0; --<
Compute.Blk.Sum>
begin
accept Ent(I : out Integer; J : in Integer) do
- -- Compute.Ent.I,
Compute.Ent.J
+ --< Compute.Ent.I,
Compute.Ent.J>
Compute.Ent.I := Compute.Outer.I;
- Inner: --
Compute.Blk.Inner
+ Inner: --<
Compute.Blk.Inner>
for J in 1..10 loop
- --
Compute.Blk.Inner.J
+ --<
Compute.Blk.Inner.J>
Sum := Sum + Compute.Blk.Inner.J * Compute.Ent.J;
end loop Inner;
end Ent;
@@ -28400,7 +28493,7 @@ completed.
_Examples_
17
-Examples of labeled statements:
+<Examples of labeled statements:>
18
<<Here>> <<Ici>> <<Aqui>> <<Hier>> null;
@@ -28428,13 +28521,13 @@ Examples of labeled statements:
_Extensions to Ada 95_
19.d/2
- {AI95-00318-02AI95-00318-02} The extended_return_statement is
- new (simple_return_statement is merely renamed).
+ {<AI95-00318-02AI95-00318-02>} The extended_return_statement
+ is new (simple_return_statement is merely renamed).
_Extensions to Ada 2005_
19.e/3
- {AI95-0179-1AI95-0179-1} A label can end a
+ {<AI95-0179-1AI95-0179-1>} A label can end a
sequence_of_statements, eliminating the requirement for having
an explicit null; statement after an ending label (a common
use).
@@ -28453,17 +28546,17 @@ the result of evaluating an expression.]
2
assignment_statement ::=
- variable_name := expression;
+ <variable_>name := expression;
3
The execution of an assignment_statement includes the evaluation of the
-expression and the assignment of the value of the expression into the
-target. [An assignment operation (as opposed to an assignment_statement
-(*note 5.2: S0152.)) is performed in other contexts as well, including
-object initialization and by-copy parameter passing.] The target of an
-assignment operation is the view of the object to which a value is being
-assigned; the target of an assignment_statement (*note 5.2: S0152.) is
-the variable denoted by the variable_name.
+expression and the <assignment> of the value of the expression into the
+<target>. [An assignment operation (as opposed to an
+assignment_statement (*note 5.2: S0152.)) is performed in other contexts
+as well, including object initialization and by-copy parameter passing.]
+The <target> of an assignment operation is the view of the object to
+which a value is being assigned; the target of an assignment_statement
+(*note 5.2: S0152.) is the variable denoted by the <variable_>name.
3.a
Discussion: Don't confuse this notion of the "target" of an
@@ -28484,13 +28577,13 @@ the variable denoted by the variable_name.
_Name Resolution Rules_
4/2
-{AI95-00287-01AI95-00287-01} The variable_name of an
-assignment_statement is expected to be of any type. The expected type
+{<AI95-00287-01AI95-00287-01>} The <variable_>name of an
+assignment_statement is expected to be of any type. The expected type
for the expression is the type of the target.
4.a
Implementation Note: An assignment_statement as a whole is a
- "complete context," so if the variable_name of an
+ "complete context," so if the <variable_>name of an
assignment_statement is overloaded, the expression can be used
to help disambiguate it. For example:
@@ -28505,17 +28598,17 @@ for the expression is the type of the target.
4.d
X : R1;
begin
- F.all := X; -- Right hand side helps resolve left hand side
+ F.all := X; --< Right hand side helps resolve left hand side>
_Legality Rules_
5/2
-{AI95-00287-01AI95-00287-01} The target [denoted by the variable_name]
-shall be a variable of a nonlimited type.
+{<AI95-00287-01AI95-00287-01>} The target [denoted by the
+<variable_>name] shall be a variable of a nonlimited type.
6
-If the target is of a tagged class-wide type T'Class, then the
-expression shall either be dynamically tagged, or of type T and
+If the target is of a tagged class-wide type <T>'Class, then the
+expression shall either be dynamically tagged, or of type <T> and
tag-indeterminate (see *note 3.9.2::).
6.a
@@ -28526,7 +28619,7 @@ tag-indeterminate (see *note 3.9.2::).
statically tagged initialization expression is permitted,
since there is no chance for confusion (or Tag_Check failure).
Also, in an object initialization, tag-indeterminate
- expressions of any type covered by T'Class would be allowed,
+ expressions of any type covered by <T>'Class would be allowed,
but with an assignment_statement, that might not work if the
tag of the target was for a type that didn't have one of the
dispatching operations in the tag-indeterminate expression.
@@ -28534,14 +28627,14 @@ tag-indeterminate (see *note 3.9.2::).
_Dynamic Semantics_
7
-For the execution of an assignment_statement, the variable_name and the
-expression are first evaluated in an arbitrary order.
+For the execution of an assignment_statement, the <variable_>name and
+the expression are first evaluated in an arbitrary order.
7.a
Ramification: Other rules of the language may require that the
bounds of the variable be determined prior to evaluating the
expression, but that does not necessarily require evaluation
- of the variable_name, as pointed out by the ACID.
+ of the <variable_>name, as pointed out by the ACID.
8
When the type of the target is class-wide:
@@ -28562,7 +28655,7 @@ When the type of the target is class-wide:
11
The value of the expression is converted to the subtype of the target.
-[The conversion might raise an exception (see *note 4.6::).]
+[The conversion might raise an exception (see *note 4.6::).]
11.a
Ramification: *note 4.6::, "*note 4.6:: Type Conversions"
@@ -28577,7 +28670,7 @@ The value of the expression is converted to the subtype
of the target.
In cases involving controlled types, the target is finalized, and an
anonymous object might be used as an intermediate in the assignment, as
described in *note 7.6.1::, "*note 7.6.1:: Completion and Finalization".
-In any case, the converted value of the expression is then assigned to
+In any case, the converted value of the expression is then <assigned> to
the target, which consists of the following two steps:
12.a
@@ -28589,8 +28682,8 @@ the target, which consists of the following two steps:
* The value of the target becomes the converted value.
14/3
- * {AI05-0299-1AI05-0299-1} If any part of the target is controlled,
- its value is adjusted as explained in subclause *note 7.6::.
+ * {<AI05-0299-1AI05-0299-1>} If any part of the target is controlled,
+ its value is adjusted as explained in subclause *note 7.6::.
14.a
Ramification: If any parts of the object are controlled, abort
@@ -28604,7 +28697,7 @@ the target, which consists of the following two steps:
assignment_statement does not change the tag of the target.
16/2
- This paragraph was deleted.{AI95-00363-01AI95-00363-01}
+ <This paragraph was deleted.>{<AI95-00363-01AI95-00363-01>}
16.a
Ramification: The implicit subtype conversion described above
@@ -28624,22 +28717,22 @@ the target, which consists of the following two steps:
_Examples_
17
-Examples of assignment statements:
+<Examples of assignment statements:>
18
Value := Max_Value - 1;
Shade := Blue;
19
- Next_Frame(F)(M, N) := 2.5; -- see *note 4.1.1::
- U := Dot_Product(V, W); -- see *note 6.3::
+ Next_Frame(F)(M, N) := 2.5; --< see *note 4.1.1::>
+ U := Dot_Product(V, W); --< see *note 6.3::>
20/4
- {AI12-0056-1AI12-0056-1} Writer := (Status => Open, Unit => Printer,
Line_Count => 60); -- see *note 3.8.1::
- Next.all := (72074, null, Head); -- see *note 3.10.1::
+ {<AI12-0056-1AI12-0056-1>} Writer := (Status => Open, Unit => Printer,
Line_Count => 60); --< see *note 3.8.1::>
+ Next.all := (72074, null, Head); --< see *note 3.10.1::>
21
-Examples involving scalar subtype conversions:
+<Examples involving scalar subtype conversions:>
22
I, J : Integer range 1 .. 10 := 5;
@@ -28647,12 +28740,12 @@ Examples involving scalar subtype conversions:
...
23
- I := J; -- identical ranges
- K := J; -- compatible ranges
- J := K; -- will raise Constraint_Error if K > 10
+ I := J; --< identical ranges>
+ K := J; --< compatible ranges>
+ J := K; --< will raise Constraint_Error if K > 10>
24
-Examples involving array subtype conversions:
+<Examples involving array subtype conversions:>
25
A : String(1 .. 31);
@@ -28660,20 +28753,21 @@ Examples involving array subtype conversions:
...
26
- A := B; -- same number of components
+ A := B; --< same number of components>
27
A(1 .. 9) := "tar sauce";
- A(4 .. 12) := A(1 .. 9); -- A(1 .. 12) = "tartar sauce"
+ A(4 .. 12) := A(1 .. 9); --< A(1 .. 12) = "tartar sauce">
NOTES
28
- 3 Notes on the examples: Assignment_statements are allowed even in
- the case of overlapping slices of the same array, because the
- variable_name and expression are both evaluated before copying the
- value into the variable. In the above example, an implementation
- yielding A(1 .. 12) = "tartartartar" would be incorrect.
+ 3 <Notes on the examples:> Assignment_statements are allowed even
+ in the case of overlapping slices of the same array, because the
+ <variable_>name and expression are both evaluated before copying
+ the value into the variable. In the above example, an
+ implementation yielding A(1 .. 12) = "tartartartar" would be
+ incorrect.
_Extensions to Ada 83_
@@ -28702,7 +28796,7 @@ Examples involving array subtype conversions:
_Incompatibilities With Ada 95_
28.d/2
- {AI95-00287-01AI95-00287-01} The change of the limited check
+ {<AI95-00287-01AI95-00287-01>} The change of the limited check
from a resolution rule to a legality rule is not quite upward
compatible. For example
@@ -28748,12 +28842,12 @@ corresponding conditions.]
sequence_of_statements]
end if;
-Paragraphs 3 and 4 were deleted.
+<Paragraphs 3 and 4 were deleted.>
_Dynamic Semantics_
5/3
-{AI05-0264-1AI05-0264-1} For the execution of an if_statement, the
+{<AI05-0264-1AI05-0264-1>} For the execution of an if_statement, the
condition specified after if, and any conditions specified after elsif,
are evaluated in succession (treating a final else as elsif True then),
until one evaluates to True or all conditions are evaluated and yield
@@ -28768,7 +28862,7 @@ sequence_of_statements is executed; otherwise, none of
them is executed.
_Examples_
6
-Examples of if statements:
+<Examples of if statements:>
7
if Month = December and Day = 31 then
@@ -28788,14 +28882,14 @@ Examples of if statements:
end if;
9
- if My_Car.Owner.Vehicle /= My_Car then -- see *note 3.10.1::
+ if My_Car.Owner.Vehicle /= My_Car then --< see *note 3.10.1::>
Report ("Incorrect data");
end if;
_Wording Changes from Ada 2005_
9.a/3
- {AI05-0147-1AI05-0147-1} Moved definition of condition to
+ {<AI05-0147-1AI05-0147-1>} Moved definition of condition to
*note 4.5.7:: in order to eliminate a forward reference.
@@ -28812,8 +28906,8 @@ of an expression.]
_Syntax_
2/3
- {AI05-0188-1AI05-0188-1} case_statement ::=
- case selecting_expression is
+ {<AI05-0188-1AI05-0188-1>} case_statement ::=
+ case <selecting_>expression is
case_statement_alternative
{case_statement_alternative}
end case;
@@ -28826,32 +28920,32 @@ of an expression.]
_Name Resolution Rules_
4/3
-{AI05-0188-1AI05-0188-1} The selecting_expression is expected to be of
-any discrete type. The expected type for each discrete_choice is the
-type of the selecting_expression.
+{<AI05-0188-1AI05-0188-1>} The <selecting_>expression is expected to be
+of any discrete type. The expected type for each discrete_choice is the
+type of the <selecting_>expression.
_Legality Rules_
5/3
-{AI05-0153-3AI05-0153-3} The choice_expressions, subtype_indications,
+{<AI05-0153-3AI05-0153-3>} The choice_expressions, subtype_indications,
and ranges given as discrete_choices of a case_statement shall be
static. [A discrete_choice others, if present, shall appear alone and
in the last discrete_choice_list.]
6/3
-{AI05-0188-1AI05-0188-1} {AI05-0240-1AI05-0240-1} The possible values of
-the selecting_expression shall be covered (see *note 3.8.1::) as
-follows:
+{<AI05-0188-1AI05-0188-1>} {<AI05-0240-1AI05-0240-1>} The possible
+values of the <selecting_>expression shall be covered (see *note
+3.8.1::) as follows:
6.a/3
- Discussion: {AI05-0240-1AI05-0240-1} The meaning of "covered"
- here and in the following rules is that of the term "cover a
- value" that is defined in *note 3.8.1::.
+ Discussion: {<AI05-0240-1AI05-0240-1>} The meaning of
+ "covered" here and in the following rules is that of the term
+ "cover a value" that is defined in *note 3.8.1::.
7/4
- * {AI05-0003-1AI05-0003-1} {AI05-0153-3AI05-0153-3}
- {AI05-0188-1AI05-0188-1} {AI05-0262-1AI05-0262-1}
- {AI12-0071-1AI12-0071-1} If the selecting_expression is a name
+ * {<AI05-0003-1AI05-0003-1>} {<AI05-0153-3AI05-0153-3>}
+ {<AI05-0188-1AI05-0188-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI12-0071-1AI12-0071-1>} If the <selecting_>expression is a name
[(including a type_conversion, qualified_expression, or
function_call)] having a static and constrained nominal subtype,
then each non-others discrete_choice shall cover only values in
@@ -28865,18 +28959,19 @@ follows:
target subtype. See *note 4.6::.
8/3
- * {AI05-0188-1AI05-0188-1} If the type of the selecting_expression is
- root_integer, universal_integer, or a descendant of a formal scalar
- type, then the case_statement shall have an others discrete_choice.
+ * {<AI05-0188-1AI05-0188-1>} If the type of the
+ <selecting_>expression is <root_integer>, <universal_integer>, or a
+ descendant of a formal scalar type, then the case_statement shall
+ have an others discrete_choice.
8.a
Reason: This is because the base range is implementation
- defined for root_integer and universal_integer, and not known
- statically in the case of a formal scalar type.
+ defined for <root_integer> and <universal_integer>, and not
+ known statically in the case of a formal scalar type.
9/3
- * {AI05-0188-1AI05-0188-1} Otherwise, each value of the base range of
- the type of the selecting_expression shall be covered [(either
+ * {<AI05-0188-1AI05-0188-1>} Otherwise, each value of the base range
+ of the type of the <selecting_>expression shall be covered [(either
explicitly or by others)].
10
@@ -28884,10 +28979,10 @@ Two distinct discrete_choices of a case_statement
shall not cover the
same value.
10.a/3
- Ramification: {AI05-0188-1AI05-0188-1} The goal of these
+ Ramification: {<AI05-0188-1AI05-0188-1>} The goal of these
coverage rules is that any possible value of the
- selecting_expression of a case_statement should be covered by
- exactly one discrete_choice of the case_statement, and that
+ <selecting_>expression of a case_statement should be covered
+ by exactly one discrete_choice of the case_statement, and that
this should be checked at compile time. The goal is achieved
in most cases, but there are two minor loopholes:
@@ -28902,13 +28997,13 @@ same value.
subtype.
10.c/3
- * {AI95-00114-01AI95-00114-01} {AI05-0188-1AI05-0188-1} If
- the compiler chooses to represent the value of an
+ * {<AI95-00114-01AI95-00114-01>} {<AI05-0188-1AI05-0188-1>}
+ If the compiler chooses to represent the value of an
expression of an unconstrained subtype in a way that
includes values outside the bounds of the subtype, then
those values can be outside the covered range. For
example, if X: Integer := Integer'Last;, and the case
- selecting_expression is X+1, then the implementation
+ <selecting_>expression is X+1, then the implementation
might choose to produce the correct value, which is
outside the bounds of Integer. (It might raise
Constraint_Error instead.) This case can only happen for
@@ -28939,11 +29034,11 @@ same value.
_Dynamic Semantics_
11/3
-{AI05-0188-1AI05-0188-1} For the execution of a case_statement the
-selecting_expression is first evaluated.
+{<AI05-0188-1AI05-0188-1>} For the execution of a case_statement the
+<selecting_>expression is first evaluated.
12/3
-{AI05-0188-1AI05-0188-1} If the value of the selecting_expression is
+{<AI05-0188-1AI05-0188-1>} If the value of the <selecting_>expression is
covered by the discrete_choice_list (*note 3.8.1: S0073.) of some
case_statement_alternative (*note 5.4: S0155.), then the
sequence_of_statements (*note 5.1: S0145.) of the _alternative is
@@ -28968,7 +29063,7 @@ due to being outside the base range), Constraint_Error
is raised.
_Examples_
15
-Examples of case statements:
+<Examples of case statements:>
16
case Sensor is
@@ -29036,12 +29131,12 @@ Examples of case statements:
case F is
when 1 => ...;
when 2 => ...;
- -- No others needed.
+ --< No others needed.>
end case;
18.d/3
- {AI05-0005-1AI05-0005-1} Note that the result subtype given in
- a function renaming_declaration is ignored; for a
+ {<AI05-0005-1AI05-0005-1>} Note that the result subtype given
+ in a function renaming_declaration is ignored; for a
case_statement whose expression calls a such a function, the
full coverage rules are checked using the result subtype of
the original function. Note that predefined operators such as
@@ -29058,7 +29153,7 @@ Examples of case statements:
values.
18.f
- We take advantage of rules and terms (e.g. cover a value)
+ We take advantage of rules and terms (e.g. <cover a value>)
defined for discrete_choices and discrete_choice_lists in
*note 3.8.1::, "*note 3.8.1:: Variant Parts and Discrete
Choices".
@@ -29080,25 +29175,25 @@ Examples of case statements:
_Wording Changes from Ada 2005_
18.i/3
- {AI05-0003-1AI05-0003-1} Rewording to reflect that a
+ {<AI05-0003-1AI05-0003-1>} Rewording to reflect that a
qualified_expression is now a name.
18.j/3
- {AI05-0153-3AI05-0153-3} Revised for changes to
+ {<AI05-0153-3AI05-0153-3>} Revised for changes to
discrete_choices made to allow static predicates (see *note
3.2.4::) as case choices (see *note 3.8.1::).
18.k/3
- {AI05-0188-1AI05-0188-1} Added the selecting_ prefix to make
- this wording consistent with case_expression, and to clarify
- which expression is being talked about in the wording.
+ {<AI05-0188-1AI05-0188-1>} Added the <selecting_> prefix to
+ make this wording consistent with case_expression, and to
+ clarify which expression is being talked about in the wording.
_Wording Changes from Ada 2012_
18.l/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of case
- coverage to use the new term "satisfies the predicates" (see
- *note 3.2.4::).
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of
+ case coverage to use the new term "satisfies the predicates"
+ (see *note 3.2.4::).
File: aarm2012.info, Node: 5.5, Next: 5.6, Prev: 5.4, Up: 5
@@ -29114,13 +29209,13 @@ executed repeatedly, zero or more times.]
2
loop_statement ::=
- [loop_statement_identifier:]
+ [<loop_>statement_identifier:]
[iteration_scheme] loop
sequence_of_statements
- end loop [loop_identifier];
+ end loop [<loop_>identifier];
3/3
- {AI05-0139-2AI05-0139-2} iteration_scheme ::= while condition
+ {<AI05-0139-2AI05-0139-2>} iteration_scheme ::= while condition
| for loop_parameter_specification
| for iterator_specification
@@ -29129,14 +29224,14 @@ executed repeatedly, zero or more times.]
defining_identifier in [reverse] discrete_subtype_definition
5
- If a loop_statement has a loop_statement_identifier, then the
+ If a loop_statement has a <loop_>statement_identifier, then the
identifier shall be repeated after the end loop; otherwise, there
shall not be an identifier after the end loop.
_Static Semantics_
6
-A loop_parameter_specification declares a loop parameter, which is an
+A loop_parameter_specification declares a <loop parameter>, which is an
object whose subtype is that defined by the discrete_subtype_definition.
_Dynamic Semantics_
@@ -29157,9 +29252,9 @@ executed; if False, the execution of the loop_statement
(*note 5.5:
S0156.) is complete.
9/4
-{AI05-0139-2AI05-0139-2} {AI05-0262-1AI05-0262-1}
-{AI12-0071-1AI12-0071-1} For the execution of a loop_statement with the
-iteration_scheme being for loop_parameter_specification (*note 5.5:
+{<AI05-0139-2AI05-0139-2>} {<AI05-0262-1AI05-0262-1>}
+{<AI12-0071-1AI12-0071-1>} For the execution of a loop_statement with
+the iteration_scheme being for loop_parameter_specification (*note 5.5:
S0158.), the loop_parameter_specification (*note 5.5: S0158.) is first
elaborated. This elaboration creates the loop parameter and elaborates
the discrete_subtype_definition (*note 3.6: S0055.). If the
@@ -29168,9 +29263,9 @@ null range, the execution of the loop_statement is
complete. Otherwise,
the sequence_of_statements (*note 5.1: S0145.) is executed once for each
value of the discrete subtype defined by the discrete_subtype_definition
(*note 3.6: S0055.) that satisfies the predicates of the subtype (or
-until the loop is left as a consequence of a transfer of control). Prior
-to each such iteration, the corresponding value of the discrete subtype
-is assigned to the loop parameter. These values are assigned in
+until the loop is left as a consequence of a transfer of control).
+Prior to each such iteration, the corresponding value of the discrete
+subtype is assigned to the loop parameter. These values are assigned in
increasing order unless the reserved word reverse is present, in which
case the values are assigned in decreasing order.
@@ -29182,17 +29277,17 @@ case the values are assigned in decreasing order.
do that).
9.b/3
- {AI05-0262-1AI05-0262-1} The predicate (if any) necessarily
+ {<AI05-0262-1AI05-0262-1>} The predicate (if any) necessarily
has to be a static predicate as a dynamic predicate is
explicitly disallowed -- see *note 3.2.4::.
9.c/3
- Reason: {AI05-0262-1AI05-0262-1} If there is a predicate, the
- loop still visits the values in the order of the underlying
- base type; the order of the values in the predicate is
- irrelevant. This is the case so that the following loops have
- the same sequence of calls and parameters on procedure Call
- for any subtype S:
+ Reason: {<AI05-0262-1AI05-0262-1>} If there is a predicate,
+ the loop still visits the values in the order of the
+ underlying base type; the order of the values in the predicate
+ is irrelevant. This is the case so that the following loops
+ have the same sequence of calls and parameters on procedure
+ Call for any subtype S:
9.d
for I in S loop
@@ -29207,7 +29302,7 @@ case the values are assigned in decreasing order.
end loop;
9.1/3
-{AI05-0262-1AI05-0262-1} [For details about the execution of a
+{<AI05-0262-1AI05-0262-1>} [For details about the execution of a
loop_statement with the iteration_scheme being for
iterator_specification, see *note 5.5.2::.]
@@ -29247,7 +29342,7 @@ iterator_specification, see *note 5.5.2::.]
_Examples_
14
-Example of a loop statement without an iteration scheme:
+<Example of a loop statement without an iteration scheme:>
15
loop
@@ -29256,7 +29351,7 @@ Example of a loop statement without an iteration scheme:
end loop;
16
-Example of a loop statement with a while iteration scheme:
+<Example of a loop statement with a while iteration scheme:>
17
while Bid(N).Price < Cut_Off.Price loop
@@ -29265,21 +29360,21 @@ Example of a loop statement with a while iteration
scheme:
end loop;
18
-Example of a loop statement with a for iteration scheme:
+<Example of a loop statement with a for iteration scheme:>
19
- for J in Buffer'Range loop -- works even with a null range
+ for J in Buffer'Range loop --< works even with a null range>
if Buffer(J) /= Space then
Put(Buffer(J));
end if;
end loop;
20
-Example of a loop statement with a name:
+<Example of a loop statement with a name:>
21
Summation:
- while Next /= Head loop -- see *note 3.10.1::
+ while Next /= Head loop --< see *note 3.10.1::>
Sum := Sum + Next.Value;
Next := Next.Succ;
end loop Summation;
@@ -29293,17 +29388,17 @@ Example of a loop statement with a name:
_Wording Changes from Ada 2005_
21.b/3
- {AI05-0139-2AI05-0139-2} {AI05-0262-1AI05-0262-1}
- {AI05-0299-1AI05-0299-1} Generalized iterator_specifications
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0299-1AI05-0299-1>} Generalized iterator_specifications
are allowed in for loops; these are documented as an extension
in the appropriate subclause.
_Wording Changes from Ada 2012_
21.c/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of loop
- execution to use the new term "satisfies the predicates" (see
- *note 3.2.4::).
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of
+ loop execution to use the new term "satisfies the predicates"
+ (see *note 3.2.4::).
* Menu:
@@ -29319,8 +29414,8 @@ File: aarm2012.info, Node: 5.5.1, Next: 5.5.2, Up:
5.5
_Static Semantics_
1/3
-{AI05-0139-2AI05-0139-2} The following language-defined generic library
-package exists:
+{<AI05-0139-2AI05-0139-2>} The following language-defined generic
+library package exists:
2/3
generic
@@ -29345,34 +29440,34 @@ package exists:
end Ada.Iterator_Interfaces;
6/3
-{AI05-0139-2AI05-0139-2} An iterator type is a type descended from the
-Forward_Iterator interface from some instance of
-Ada.Iterator_Interfaces. A reversible iterator type is a type descended
-from the Reversible_Iterator interface from some instance of
-Ada.Iterator_Interfaces. An iterator object is an object of an iterator
-type. A reversible iterator object is an object of a reversible
-iterator type. The formal subtype Cursor from the associated instance
-of Ada.Iterator_Interfaces is the iteration cursor subtype for the
-iterator type.
+{<AI05-0139-2AI05-0139-2>} An <iterator type> is a type descended from
+the Forward_Iterator interface from some instance of
+Ada.Iterator_Interfaces. A <reversible iterator type> is a type
+descended from the Reversible_Iterator interface from some instance of
+Ada.Iterator_Interfaces. An <iterator object> is an object of an
+iterator type. A <reversible iterator object> is an object of a
+reversible iterator type. The formal subtype Cursor from the associated
+instance of Ada.Iterator_Interfaces is the <iteration cursor subtype>
+for the iterator type.
7/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} The following
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} The following
type-related operational aspects may be specified for an indexable
-container type T (see *note 4.1.6::):
+container type <T> (see *note 4.1.6::):
8/3
Default_Iterator
This aspect is specified by a name that denotes exactly
one function declared immediately within the same
- declaration list in which T is declared, whose first
- parameter is of type T or T'Class or an access parameter
- whose designated type is type T or T'Class, whose other
- parameters, if any, have default expressions, and whose
- result type is an iterator type. This function is the
- default iterator function for T. Its result subtype is
- the default iterator subtype for T. The iteration cursor
- subtype for the default iterator subtype is the default
- cursor subtype for T.
+ declaration list in which <T> is declared, whose first
+ parameter is of type <T> or <T>'Class or an access
+ parameter whose designated type is type <T> or <T>'Class,
+ whose other parameters, if any, have default expressions,
+ and whose result type is an iterator type. This function
+ is the <default iterator function> for <T>. Its result
+ subtype is the <default iterator subtype> for <T>. The
+ iteration cursor subtype for the default iterator subtype
+ is the <default cursor subtype> for <T>.
8.a/3
Aspect Description for Default_Iterator: Default iterator to
@@ -29381,24 +29476,24 @@ Default_Iterator
9/3
Iterator_Element
This aspect is specified by a name that denotes a
- subtype. This is the default element subtype for T.
+ subtype. This is the <default element subtype> for <T>.
9.a/3
Aspect Description for Iterator_Element: Element type to be
used for user-defined iterators.
10/3
-These aspects are inherited by descendants of type T (including
-T'Class).
+These aspects are inherited by descendants of type <T> (including
+<T>'Class).
11/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} An iterable container
-type is an indexable container type with specified Default_Iterator and
-Iterator_Element aspects. A reversible iterable container type is an
-iterable container type with the default iterator type being a
-reversible iterator type. An iterable container object is an object of
-an iterable container type. A reversible iterable container object is
-an object of a reversible iterable container type.
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} An <iterable
+container type> is an indexable container type with specified
+Default_Iterator and Iterator_Element aspects. A <reversible iterable
+container type> is an iterable container type with the default iterator
+type being a reversible iterator type. An <iterable container object>
+is an object of an iterable container type. A <reversible iterable
+container object> is an object of a reversible iterable container type.
11.a.1/3
Glossary entry: An iterable container type is one that has
@@ -29406,7 +29501,7 @@ an object of a reversible iterable container type.
and Iterator_Element aspects.
11.1/4
-{AI12-0138-1AI12-0138-1} The Default_Iterator and Iterator_Element
+{<AI12-0138-1AI12-0138-1>} The Default_Iterator and Iterator_Element
aspects are nonoverridable (see *note 13.1.1::).
11.a/4
@@ -29417,26 +29512,27 @@ aspects are nonoverridable (see *note 13.1.1::).
_Legality Rules_
12/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} The Constant_Indexing
-aspect (if any) of an iterable container type T shall denote exactly one
-function with the following properties:
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} The
+Constant_Indexing aspect (if any) of an iterable container type <T>
+shall denote exactly one function with the following properties:
13/3
* the result type of the function is covered by the default element
- type of T or is a reference type (see *note 4.1.5::) with an access
- discriminant designating a type covered by the default element type
- of T;
+ type of <T> or is a reference type (see *note 4.1.5::) with an
+ access discriminant designating a type covered by the default
+ element type of <T>;
14/3
* the type of the second parameter of the function covers the default
- cursor type for T;
+ cursor type for <T>;
15/3
* if there are more than two parameters, the additional parameters
all have default expressions.
16/3
-This function (if any) is the default constant indexing function for T.
+This function (if any) is the <default constant indexing function> for
+<T>.
16.a/3
Ramification: This does not mean that Constant_Indexing has to
@@ -29448,39 +29544,40 @@ This function (if any) is the default constant
indexing function for T.
key instead of a cursor; this is allowed.
17/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} The Variable_Indexing
-aspect (if any) of an iterable container type T shall denote exactly one
-function with the following properties:
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} The
+Variable_Indexing aspect (if any) of an iterable container type <T>
+shall denote exactly one function with the following properties:
18/3
* the result type of the function is a reference type (see *note
4.1.5::) with an access discriminant designating a type covered by
- the default element type of T;
+ the default element type of <T>;
19/3
* the type of the second parameter of the function covers the default
- cursor type for T;
+ cursor type for <T>;
20/3
* if there are more than two parameters, the additional parameters
all have default expressions.
21/3
-This function (if any) is the default variable indexing function for T.
+This function (if any) is the <default variable indexing function> for
+<T>.
_Extensions to Ada 2005_
21.a/3
- {AI05-0139-2AI05-0139-2} User-defined iterator types are new
+ {<AI05-0139-2AI05-0139-2>} User-defined iterator types are new
in Ada 2012.
_Incompatibilities With Ada 2012_
21.b/4
- {AI12-0138-1AI12-0138-1} Corrigendum: Defined Default_Iterator
- and Iterator_Element to be nonoveridable, which makes
- redefinitions and hiding of these aspects illegal. It's
- possible that some program could violate one of these new
+ {<AI12-0138-1AI12-0138-1>} Corrigendum: Defined
+ Default_Iterator and Iterator_Element to be nonoveridable,
+ which makes redefinitions and hiding of these aspects illegal.
+ It's possible that some program could violate one of these new
restrictions, but in most cases this can easily be worked
around by using overriding rather than redefinition.
@@ -29491,28 +29588,28 @@ File: aarm2012.info, Node: 5.5.2, Prev: 5.5.1, Up:
5.5
--------------------------------
1/3
-{AI05-0139-2AI05-0139-2} Generalized forms of loop iteration are
+{<AI05-0139-2AI05-0139-2>} Generalized forms of loop iteration are
provided by an iterator_specification.
_Syntax_
2/3
- {AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1}
+ {<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>}
iterator_specification ::=
- defining_identifier in [reverse] iterator_name
+ defining_identifier in [reverse] <iterator_>name
| defining_identifier [:
- subtype_indication] of [reverse] iterable_name
+ subtype_indication] of [reverse] <iterable_>name
_Name Resolution Rules_
3/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} For the first form of
-iterator_specification, called a generalized iterator, the expected type
-for the iterator_name is any iterator type. For the second form of
-iterator_specification, the expected type for the iterable_name is any
-array or iterable container type. If the iterable_name denotes an array
-object, the iterator_specification is called an array component
-iterator; otherwise it is called a container element iterator.
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} For the first form
+of iterator_specification, called a <generalized iterator>, the expected
+type for the <iterator_>name is any iterator type. For the second form
+of iterator_specification, the expected type for the <iterable_>name is
+any array or iterable container type. If the <iterable_>name denotes an
+array object, the iterator_specification is called an <array component
+iterator>; otherwise it is called a <container element iterator>.
3.a.1/3
Glossary entry: An iterator is a construct that is used to
@@ -29523,29 +29620,29 @@ iterator; otherwise it is called a container element
iterator.
_Legality Rules_
4/3
-{AI05-0139-2AI05-0139-2} If the reserved word reverse appears, the
-iterator_specification is a reverse iterator; otherwise it is a forward
-iterator. In a reverse generalized iterator, the iterator_name shall be
-of a reversible iterator type. In a reverse container element iterator,
-the default iterator type for the type of the iterable_name shall be a
-reversible iterator type.
+{<AI05-0139-2AI05-0139-2>} If the reserved word reverse appears, the
+iterator_specification is a <reverse iterator>; otherwise it is a
+<forward iterator>. In a reverse generalized iterator, the
+<iterator_>name shall be of a reversible iterator type. In a reverse
+container element iterator, the default iterator type for the type of
+the <iterable_>name shall be a reversible iterator type.
5/4
-{AI05-0139-2AI05-0139-2} {AI12-0151-1AI12-0151-1} The subtype defined by
-the subtype_indication, if any, of an array component iterator shall
-statically match the component subtype of the type of the iterable_name.
-The subtype defined by the subtype_indication, if any, of a container
-element iterator shall statically match the default element subtype for
-the type of the iterable_name.
+{<AI05-0139-2AI05-0139-2>} {<AI12-0151-1AI12-0151-1>} The subtype
+defined by the subtype_indication, if any, of an array component
+iterator shall statically match the component subtype of the type of the
+<iterable_>name. The subtype defined by the subtype_indication, if any,
+of a container element iterator shall statically match the default
+element subtype for the type of the <iterable_>name.
6/3
-{AI05-0139-2AI05-0139-2} In a container element iterator whose
-iterable_name has type T, if the iterable_name denotes a constant or the
-Variable_Indexing aspect is not specified for T, then the
-Constant_Indexing aspect shall be specified for T.
+{<AI05-0139-2AI05-0139-2>} In a container element iterator whose
+<iterable_>name has type <T>, if the <iterable_>name denotes a constant
+or the Variable_Indexing aspect is not specified for <T>, then the
+Constant_Indexing aspect shall be specified for <T>.
6.1/4
-{AI12-0047-1AI12-0047-1} The iterator_name or iterable_name of an
+{<AI12-0047-1AI12-0047-1>} The <iterator_>name or <iterable_>name of an
iterator_specification shall not denote a subcomponent that depends on
discriminants of an object whose nominal subtype is unconstrained,
unless the object is known to be constrained.
@@ -29556,23 +29653,23 @@ unless the object is known to be constrained.
disappearing while the iterator is still using it.
6.2/4
-{AI12-0120-1AI12-0120-1} A container element iterator is illegal if the
-call of the default iterator function that creates the loop iterator
+{<AI12-0120-1AI12-0120-1>} A container element iterator is illegal if
+the call of the default iterator function that creates the loop iterator
(see below) is illegal.
6.b/4
Ramification: This can happen if the parameter to the default
- iterator function is in out and the iterable_name is a
+ iterator function is in out and the <iterable_>name is a
constant. The wording applies to any reason that the call
would be illegal, as it's possible that one of the default
parameters would be illegal, or that some accessibility check
would fail.
6.3/4
-{AI12-0120-1AI12-0120-1} A generalized iterator is illegal if the
-iteration cursor subtype of the iterator_name is a limited type at the
+{<AI12-0120-1AI12-0120-1>} A generalized iterator is illegal if the
+iteration cursor subtype of the <iterator_>name is a limited type at the
point of the generalized iterator. A container element iterator is
-illegal if the default cursor subtype of the type of the iterable_name
+illegal if the default cursor subtype of the type of the <iterable_>name
is a limited type at the point of the container element iterator.
6.c/4
@@ -29585,31 +29682,32 @@ is a limited type at the point of the container
element iterator.
_Static Semantics_
7/3
-{AI05-0139-2AI05-0139-2} {AI05-0269-1AI05-0269-1}
-{AI05-0292-1AI05-0292-1} An iterator_specification declares a loop
-parameter. In a generalized iterator, the nominal subtype of the loop
+{<AI05-0139-2AI05-0139-2>} {<AI05-0269-1AI05-0269-1>}
+{<AI05-0292-1AI05-0292-1>} An iterator_specification declares a <loop
+parameter>. In a generalized iterator, the nominal subtype of the loop
parameter is the iteration cursor subtype. In an array component
iterator or a container element iterator, if a subtype_indication is
present, it determines the nominal subtype of the loop parameter. In an
array component iterator, if a subtype_indication is not present, the
nominal subtype of the loop parameter is the component subtype of the
-type of the iterable_name. In a container element iterator, if a
+type of the <iterable_>name. In a container element iterator, if a
subtype_indication is not present, the nominal subtype of the loop
parameter is the default element subtype for the type of the
-iterable_name.
+<iterable_>name.
8/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} In a generalized
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} In a generalized
iterator, the loop parameter is a constant. In an array component
-iterator, the loop parameter is a constant if the iterable_name denotes
-a constant; otherwise it denotes a variable. In a container element
-iterator, the loop parameter is a constant if the iterable_name denotes
-a constant, or if the Variable_Indexing aspect is not specified for the
-type of the iterable_name; otherwise it is a variable.
+iterator, the loop parameter is a constant if the <iterable_>name
+denotes a constant; otherwise it denotes a variable. In a container
+element iterator, the loop parameter is a constant if the
+<iterable_>name denotes a constant, or if the Variable_Indexing aspect
+is not specified for the type of the <iterable_>name; otherwise it is a
+variable.
8.a/4
- Ramification: {AI12-0093-1AI12-0093-1} The loop parameter of a
- generalized iterator has the same accessibility as the loop
+ Ramification: {<AI12-0093-1AI12-0093-1>} The loop parameter of
+ a generalized iterator has the same accessibility as the loop
statement. This means that the loop parameter object is
finalized when the loop statement is left. (It also may be
finalized as part of assigning a new value to the loop
@@ -29621,68 +29719,68 @@ type of the iterable_name; otherwise it is a variable.
_Dynamic Semantics_
9/3
-{AI05-0139-2AI05-0139-2} For the execution of a loop_statement with an
+{<AI05-0139-2AI05-0139-2>} For the execution of a loop_statement with an
iterator_specification, the iterator_specification is first elaborated.
This elaboration elaborates the subtype_indication, if any.
10/3
-{AI05-0139-2AI05-0139-2} For a generalized iterator, the loop parameter
-is created, the iterator_name is evaluated, and the denoted iterator
-object becomes the loop iterator. In a forward generalized iterator,
-the operation First of the iterator type is called on the loop iterator,
-to produce the initial value for the loop parameter. If the result of
-calling Has_Element on the initial value is False, then the execution of
-the loop_statement is complete. Otherwise, the sequence_of_statements
-is executed and then the Next operation of the iterator type is called
-with the loop iterator and the current value of the loop parameter to
-produce the next value to be assigned to the loop parameter. This
-repeats until the result of calling Has_Element on the loop parameter is
-False, or the loop is left as a consequence of a transfer of control.
-For a reverse generalized iterator, the operations Last and Previous are
-called rather than First and Next.
+{<AI05-0139-2AI05-0139-2>} For a generalized iterator, the loop
+parameter is created, the <iterator_>name is evaluated, and the denoted
+iterator object becomes the <loop iterator>. In a forward generalized
+iterator, the operation First of the iterator type is called on the loop
+iterator, to produce the initial value for the loop parameter. If the
+result of calling Has_Element on the initial value is False, then the
+execution of the loop_statement is complete. Otherwise, the
+sequence_of_statements is executed and then the Next operation of the
+iterator type is called with the loop iterator and the current value of
+the loop parameter to produce the next value to be assigned to the loop
+parameter. This repeats until the result of calling Has_Element on the
+loop parameter is False, or the loop is left as a consequence of a
+transfer of control. For a reverse generalized iterator, the operations
+Last and Previous are called rather than First and Next.
10.a/4
- Ramification: {AI12-0093-1AI12-0093-1} The loop parameter of a
- generalized iterator is a variable of which the user only has
- a constant view. It follows the normal rules for a variable
- of its nominal subtype. In particular, if the nominal subtype
- is indefinite, the variable is constrained by its initial
- value. Similarly, if the nominal subtype is class-wide, the
- variable (like all variables) has the tag of the initial
- value. Constraint_Error may be raised by a subsequent
- iteration if Next or Previous return an object with a
- different tag or constraint.
+ Ramification: {<AI12-0093-1AI12-0093-1>} The loop parameter of
+ a generalized iterator is a variable of which the user only
+ has a constant view. It follows the normal rules for a
+ variable of its nominal subtype. In particular, if the
+ nominal subtype is indefinite, the variable is constrained by
+ its initial value. Similarly, if the nominal subtype is
+ class-wide, the variable (like all variables) has the tag of
+ the initial value. Constraint_Error may be raised by a
+ subsequent iteration if Next or Previous return an object with
+ a different tag or constraint.
11/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} For an array component
-iterator, the iterable_name is evaluated and the denoted array object
-becomes the array for the loop. If the array for the loop is a null
-array, then the execution of the loop_statement is complete. Otherwise,
-the sequence_of_statements is executed with the loop parameter denoting
-each component of the array for the loop, using a canonical order of
-components, which is last dimension varying fastest (unless the array
-has convention Fortran, in which case it is first dimension varying
-fastest). For a forward array component iterator, the iteration starts
-with the component whose index values are each the first in their index
-range, and continues in the canonical order. For a reverse array
-component iterator, the iteration starts with the component whose index
-values are each the last in their index range, and continues in the
-reverse of the canonical order. The loop iteration proceeds until the
-sequence_of_statements has been executed for each component of the array
-for the loop, or until the loop is left as a consequence of a transfer
-of control.
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} For an array
+component iterator, the <iterable_>name is evaluated and the denoted
+array object becomes the <array for the loop>. If the array for the
+loop is a null array, then the execution of the loop_statement is
+complete. Otherwise, the sequence_of_statements is executed with the
+loop parameter denoting each component of the array for the loop, using
+a <canonical> order of components, which is last dimension varying
+fastest (unless the array has convention Fortran, in which case it is
+first dimension varying fastest). For a forward array component
+iterator, the iteration starts with the component whose index values are
+each the first in their index range, and continues in the canonical
+order. For a reverse array component iterator, the iteration starts
+with the component whose index values are each the last in their index
+range, and continues in the reverse of the canonical order. The loop
+iteration proceeds until the sequence_of_statements has been executed
+for each component of the array for the loop, or until the loop is left
+as a consequence of a transfer of control.
12/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} For a container
-element iterator, the iterable_name is evaluated and the denoted
-iterable container object becomes the iterable container object for the
-loop. The default iterator function for the type of the iterable
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} For a container
+element iterator, the <iterable_>name is evaluated and the denoted
+iterable container object becomes the <iterable container object for the
+loop>. The default iterator function for the type of the iterable
container object for the loop is called on the iterable container object
-and the result is the loop iterator. An object of the default cursor
-subtype is created (the loop cursor).
+and the result is the <loop iterator>. An object of the default cursor
+subtype is created (the <loop cursor>).
13/3
-{AI05-0139-2AI05-0139-2} {AI05-0292-1AI05-0292-1} For a forward
+{<AI05-0139-2AI05-0139-2>} {<AI05-0292-1AI05-0292-1>} For a forward
container element iterator, the operation First of the iterator type is
called on the loop iterator, to produce the initial value for the loop
cursor. If the result of calling Has_Element on the initial value is
@@ -29702,9 +29800,9 @@ type of the iterable container object for the loop;
otherwise it uses
the default variable indexing function.
14/4
-{AI12-0120-1AI12-0120-1} Any exception propagated by the execution of a
-generalized iterator or container element iterator is propagated by the
-immediately enclosing loop statement.
+{<AI12-0120-1AI12-0120-1>} Any exception propagated by the execution of
+a generalized iterator or container element iterator is propagated by
+the immediately enclosing loop statement.
14.a/4
Ramification: This text covers exceptions raised by called
@@ -29715,26 +29813,26 @@ immediately enclosing loop statement.
_Examples_
15/3
- {AI05-0269-1AI05-0269-1} -- Array component iterator example:
- for Element of Board loop -- See *note 3.6.1::.
- Element := Element * 2.0; -- Double each element of Board, a
two-dimensional array.
+ {<AI05-0269-1AI05-0269-1>} -- <Array component iterator example:>
+ for Element of Board loop -- <See *note 3.6.1::.>
+ Element := Element * 2.0; -- <Double each element of Board, a
two-dimensional array.>
end loop;
16/3
-{AI05-0268-1AI05-0268-1} For examples of use of generalized iterators,
+{<AI05-0268-1AI05-0268-1>} For examples of use of generalized iterators,
see *note A.18.32:: and the corresponding container packages in *note
A.18.2:: and *note A.18.3::.
_Extensions to Ada 2005_
16.a/3
- {AI05-0139-2AI05-0139-2} Generalized forms of loop iteration
+ {<AI05-0139-2AI05-0139-2>} Generalized forms of loop iteration
are new.
_Incompatibilities With Ada 2012_
16.b/4
- {AI12-0047-1AI12-0047-1} Corrigendum: Added a rule to ensure
+ {<AI12-0047-1AI12-0047-1>} Corrigendum: Added a rule to ensure
that the object being iterated cannot be a component that
could disappear before the loop completes. This could be
incompatible by making a loop that was legal (and worked
@@ -29744,7 +29842,7 @@ A.18.2:: and *note A.18.3::.
especially as these iterator forms are new to Ada 2012.
16.c/4
- {AI12-0120-1AI12-0120-1} Corrigendum: Added rules to reject
+ {<AI12-0120-1AI12-0120-1>} Corrigendum: Added rules to reject
loops if the call to the default iterator function for a
container element iterator is illegal, or if the cursor type
of an iterator is limited. These are formally incompatible
@@ -29755,9 +29853,9 @@ A.18.2:: and *note A.18.3::.
in practice.
16.d/4
- {AI12-0151-1AI12-0151-1} Corrigendum: Added a requirement that
- the given subtype statically match the subtype of the element
- or component for a component element iterator or array
+ {<AI12-0151-1AI12-0151-1>} Corrigendum: Added a requirement
+ that the given subtype statically match the subtype of the
+ element or component for a component element iterator or array
component iterator. Original Ada 2012 text allowed any type
that covered the subtype of the element or component, but that
led to questions of what the meaning was if they are
@@ -29774,10 +29872,10 @@ A.18.2:: and *note A.18.3::.
_Wording Changes from Ada 2012_
16.e/4
- {AI12-0120-1AI12-0120-1} Corrigendum: Added wording to specify
- that a loop propagates any exceptions propagated by the
- execution of an iterator. Since that's what naturally would
- happen from a macro-style expansion of the parts of an
+ {<AI12-0120-1AI12-0120-1>} Corrigendum: Added wording to
+ specify that a loop propagates any exceptions propagated by
+ the execution of an iterator. Since that's what naturally
+ would happen from a macro-style expansion of the parts of an
iterator, and no other interpretation makes sense given the
way the rest of Ada works, we consider it so unlikely that any
Ada 2012 implementation ever did anything else that we don't
@@ -29797,15 +29895,15 @@ preceded by a declarative_part.]
2
block_statement ::=
- [block_statement_identifier:]
+ [<block_>statement_identifier:]
[declare
declarative_part]
begin
handled_sequence_of_statements
- end [block_identifier];
+ end [<block_>identifier];
3
- If a block_statement has a block_statement_identifier, then the
+ If a block_statement has a <block_>statement_identifier, then the
identifier shall be repeated after the end; otherwise, there shall
not be an identifier after the end.
@@ -29829,7 +29927,7 @@ handled_sequence_of_statements.
_Examples_
6
-Example of a block statement with a local variable:
+<Example of a block statement with a local variable:>
7
Swap:
@@ -29872,18 +29970,18 @@ includes a condition.]
2
exit_statement ::=
- exit [loop_name] [when condition];
+ exit [<loop_>name] [when condition];
_Name Resolution Rules_
3
-The loop_name, if any, in an exit_statement shall resolve to denote a
+The <loop_>name, if any, in an exit_statement shall resolve to denote a
loop_statement.
_Legality Rules_
4
-Each exit_statement (*note 5.7: S0161.) applies to a loop_statement
+Each exit_statement (*note 5.7: S0161.) <applies to> a loop_statement
(*note 5.5: S0156.); this is the loop_statement (*note 5.5: S0156.)
being exited. An exit_statement (*note 5.7: S0161.) with a name is only
allowed within the loop_statement (*note 5.5: S0156.) denoted by the
@@ -29913,7 +30011,7 @@ False, no transfer of control takes place.
_Examples_
7
-Examples of loops with exit statements:
+<Examples of loops with exit statements:>
8
for N in 1 .. Max_Num_Items loop
@@ -29925,9 +30023,9 @@ Examples of loops with exit statements:
9
Main_Cycle:
loop
- -- initial statements
+ --< initial statements>
exit Main_Cycle when Found;
- -- final statements
+ --< final statements>
end loop Main_Cycle;
@@ -29943,13 +30041,13 @@ statement to a target statement with a given label.]
_Syntax_
2
- goto_statement ::= goto label_name;
+ goto_statement ::= goto <label_>name;
_Name Resolution Rules_
3
-The label_name shall resolve to denote a label; the statement with that
-label is the target statement.
+The <label_>name shall resolve to denote a label; the statement with
+that label is the <target statement>.
_Legality Rules_
@@ -29988,7 +30086,7 @@ encloses the goto_statement but does not enclose the
target.
_Examples_
7
-Example of a loop containing a goto statement:
+<Example of a loop containing a goto statement:>
8
<<Sort>>
@@ -30035,11 +30133,11 @@ and enumeration literals are functions.]
not return a result and can only be called by a statement.
2/3
-{AI05-0299-1AI05-0299-1} A callable entity is a subprogram or entry (see
-Section 9). A callable entity is invoked by a call; that is, a
-subprogram call or entry call. A callable construct is a construct that
-defines the action of a call upon a callable entity: a subprogram_body,
-entry_body, or accept_statement.
+{<AI05-0299-1AI05-0299-1>} A <callable entity> is a subprogram or entry
+(see Section 9). A callable entity is invoked by a <call>; that is, a
+subprogram call or entry call. A <callable construct> is a construct
+that defines the action of a call upon a callable entity: a
+subprogram_body, entry_body, or accept_statement.
2.a
Ramification: Note that "callable entity" includes predefined
@@ -30070,26 +30168,26 @@ File: aarm2012.info, Node: 6.1, Next: 6.2, Up: 6
_Syntax_
2/3
- {AI95-00218-03AI95-00218-03} {AI05-0183-1AI05-0183-1}
+ {<AI95-00218-03AI95-00218-03>} {<AI05-0183-1AI05-0183-1>}
subprogram_declaration ::=
[overriding_indicator]
subprogram_specification
[aspect_specification];
3/2
- This paragraph was deleted.{AI95-00348-01AI95-00348-01}
+ <This paragraph was deleted.>{<AI95-00348-01AI95-00348-01>}
4/2
- {AI95-00348-01AI95-00348-01} subprogram_specification ::=
+ {<AI95-00348-01AI95-00348-01>} subprogram_specification ::=
procedure_specification
| function_specification
4.1/2
- {AI95-00348-01AI95-00348-01} procedure_specification ::= procedure
- defining_program_unit_name parameter_profile
+ {<AI95-00348-01AI95-00348-01>} procedure_specification ::=
+ procedure defining_program_unit_name parameter_profile
4.2/2
- {AI95-00348-01AI95-00348-01} function_specification ::= function
+ {<AI95-00348-01AI95-00348-01>} function_specification ::= function
defining_designator parameter_and_result_profile
5
@@ -30111,20 +30209,20 @@ File: aarm2012.info, Node: 6.1, Next: 6.2, Up: 6
operator_symbol ::= string_literal
10/3
- {AI95-00395-01AI95-00395-01} {AI05-0299-1AI05-0299-1} The sequence
- of characters in an operator_symbol shall form a reserved word, a
- delimiter, or compound delimiter that corresponds to an operator
- belonging to one of the six categories of operators defined in
- subclause *note 4.5::.
+ {<AI95-00395-01AI95-00395-01>} {<AI05-0299-1AI05-0299-1>} The
+ sequence of characters in an operator_symbol shall form a reserved
+ word, a delimiter, or compound delimiter that corresponds to an
+ operator belonging to one of the six categories of operators
+ defined in subclause *note 4.5::.
10.a/3
- Reason: {AI95-00395-01AI95-00395-01} {AI05-0090-1AI05-0090-1}
- The "sequence of characters" of the string literal of the
- operator is a technical term (see *note 2.6::), and does not
- include the surrounding quote characters. As defined in *note
- 2.2::, lexical elements are "formed" from a sequence of
- characters. Spaces are not allowed, and upper and lower case
- is not significant.
+ Reason: {<AI95-00395-01AI95-00395-01>}
+ {<AI05-0090-1AI05-0090-1>} The "sequence of characters" of the
+ string literal of the operator is a technical term (see *note
+ 2.6::), and does not include the surrounding quote characters.
+ As defined in *note 2.2::, lexical elements are "formed" from
+ a sequence of characters. Spaces are not allowed, and upper
+ and lower case is not significant.
11
defining_operator_symbol ::= operator_symbol
@@ -30133,7 +30231,7 @@ File: aarm2012.info, Node: 6.1, Next: 6.2, Up: 6
parameter_profile ::= [formal_part]
13/2
- {AI95-00231-01AI95-00231-01} {AI95-00318-02AI95-00318-02}
+ {<AI95-00231-01AI95-00231-01>} {<AI95-00318-02AI95-00318-02>}
parameter_and_result_profile ::=
[formal_part] return [null_exclusion] subtype_mark
| [formal_part] return access_definition
@@ -30143,7 +30241,7 @@ File: aarm2012.info, Node: 6.1, Next: 6.2, Up: 6
(parameter_specification {; parameter_specification})
15/3
- {AI95-00231-01AI95-00231-01} {AI05-0142-4AI05-0142-4}
+ {<AI95-00231-01AI95-00231-01>} {<AI05-0142-4AI05-0142-4>}
parameter_specification ::=
defining_identifier_list : [aliased] mode [null_exclusion]
subtype_mark [:= default_expression]
@@ -30156,30 +30254,30 @@ File: aarm2012.info, Node: 6.1, Next: 6.2, Up: 6
_Name Resolution Rules_
17
-A formal parameter is an object [directly visible within a
+A <formal parameter> is an object [directly visible within a
subprogram_body] that represents the actual parameter passed to the
-subprogram in a call; it is declared by a parameter_specification. For a
-formal parameter, the expected type for its default_expression, if any,
-is that of the formal parameter.
+subprogram in a call; it is declared by a parameter_specification. For
+a formal parameter, the expected type for its default_expression, if
+any, is that of the formal parameter.
_Legality Rules_
18/3
-{AI05-0143-1AI05-0143-1} The parameter mode of a formal parameter
+{<AI05-0143-1AI05-0143-1>} The <parameter mode> of a formal parameter
conveys the direction of information transfer with the actual parameter:
in, in out, or out. Mode in is the default, and is the mode of a
parameter defined by an access_definition.
18.a/3
- This paragraph was deleted.{AI05-0143-1AI05-0143-1}
+ <This paragraph was deleted.>{<AI05-0143-1AI05-0143-1>}
19
A default_expression is only allowed in a parameter_specification for a
formal parameter of mode in.
20/3
-{AI95-00348-01AI95-00348-01} {AI05-0177-1AI05-0177-1}
-{AI05-0229-1AI05-0229-1} A subprogram_declaration or a
+{<AI95-00348-01AI95-00348-01>} {<AI05-0177-1AI05-0177-1>}
+{<AI05-0229-1AI05-0229-1>} A subprogram_declaration or a
generic_subprogram_declaration requires a completion [unless the Import
aspect (see *note B.1::) is True for the declaration; the completion
shall be a body or a renaming_declaration (see *note 8.5::)]. [A
@@ -30188,11 +30286,11 @@ completion is not allowed for an
abstract_subprogram_declaration (see
expression_function_declaration (see *note 6.8::).]
20.a/3
- Ramification: {AI95-00348-01AI95-00348-01}
- {AI05-0177-1AI05-0177-1} Abstract subprograms , null
+ Ramification: {<AI95-00348-01AI95-00348-01>}
+ {<AI05-0177-1AI05-0177-1>} Abstract subprograms , null
procedures, and expression functions are not declared by
subprogram_declarations, and so do not require completion
- (although the latter two can be completions). Protected
+ (although the latter two can <be> completions). Protected
subprograms are declared by subprogram_declarations, and so
require completion. Note that an abstract subprogram is a
subprogram, a null procedure is a subprogram, an expression
@@ -30200,8 +30298,9 @@ expression_function_declaration (see *note 6.8::).]
subprogram, but a generic subprogram is not a subprogram.
20.b/3
- Proof: {AI05-0229-1AI05-0229-1} When the Import aspect is True
- for any entity, no completion is allowed (see *note B.1::).
+ Proof: {<AI05-0229-1AI05-0229-1>} When the Import aspect is
+ True for any entity, no completion is allowed (see *note
+ B.1::).
21
A name that denotes a formal parameter is not allowed within the
@@ -30216,7 +30315,7 @@ corresponding body or accept_statement.
_Static Semantics_
22
-The profile of (a view of) a callable entity is either a
+The <profile> of (a view of) a callable entity is either a
parameter_profile or parameter_and_result_profile[; it embodies
information about the interface to that entity -- for example, the
profile includes information about parameters passed to the callable
@@ -30228,24 +30327,24 @@ indicated by the initial reserved word, with name and
profile as given
by its specification.
23/2
-{AI95-00231-01AI95-00231-01} {AI95-00318-02AI95-00318-02} The nominal
-subtype of a formal parameter is the subtype determined by the optional
-null_exclusion and the subtype_mark, or defined by the
+{<AI95-00231-01AI95-00231-01>} {<AI95-00318-02AI95-00318-02>} The
+nominal subtype of a formal parameter is the subtype determined by the
+optional null_exclusion and the subtype_mark, or defined by the
access_definition, in the parameter_specification. The nominal subtype
of a function result is the subtype determined by the optional
null_exclusion and the subtype_mark, or defined by the
-access_definition, in the parameter_and_result_profile.
+access_definition, in the parameter_and_result_profile.
23.1/3
-{AI05-0142-4AI05-0142-4} An explicitly aliased parameter is a formal
+{<AI05-0142-4AI05-0142-4>} An <explicitly aliased parameter> is a formal
parameter whose parameter_specification includes the reserved word
aliased.
24/2
-{AI95-00231-01AI95-00231-01} {AI95-00254-01AI95-00254-01}
-{AI95-00318-02AI95-00318-02} An access parameter is a formal in
-parameter specified by an access_definition. An access result type is a
-function result type specified by an access_definition. An access
+{<AI95-00231-01AI95-00231-01>} {<AI95-00254-01AI95-00254-01>}
+{<AI95-00318-02AI95-00318-02>} An <access parameter> is a formal in
+parameter specified by an access_definition. An <access result type> is
+a function result type specified by an access_definition. An access
parameter or result type is of an anonymous access type (see *note
3.10::). [Access parameters of an access-to-object type allow
dispatching calls to be controlled by access values. Access parameters
@@ -30253,45 +30352,45 @@ of an access-to-subprogram type permit calls to
subprograms passed as
parameters irrespective of their accessibility level.]
24.a/2
- Discussion: {AI95-00318-02AI95-00318-02} Access result types
+ Discussion: {<AI95-00318-02AI95-00318-02>} Access result types
have normal accessibility and thus don't have any special
properties worth noting here.
25
-The subtypes of a profile are:
+The <subtypes of a profile> are:
26
* For any non-access parameters, the nominal subtype of the
parameter.
27/2
- * {AI95-00254-01AI95-00254-01} For any access parameters of an
+ * {<AI95-00254-01AI95-00254-01>} For any access parameters of an
access-to-object type, the designated subtype of the parameter
type.
27.1/3
- * {AI95-00254-01AI95-00254-01} {AI05-0164-1AI05-0164-1} For any
+ * {<AI95-00254-01AI95-00254-01>} {<AI05-0164-1AI05-0164-1>} For any
access parameters of an access-to-subprogram type, the subtypes of
the designated profile of the parameter type.
28/2
- * {AI95-00231-01AI95-00231-01} {AI95-00318-02AI95-00318-02} For any
- non-access result, the nominal subtype of the function result.
+ * {<AI95-00231-01AI95-00231-01>} {<AI95-00318-02AI95-00318-02>} For
+ any non-access result, the nominal subtype of the function result.
28.1/2
- * {AI95-00318-02AI95-00318-02} For any access result type of an
+ * {<AI95-00318-02AI95-00318-02>} For any access result type of an
access-to-object type, the designated subtype of the result type.
28.2/3
- * {AI95-00318-02AI95-00318-02} {AI05-0164-1AI05-0164-1} For any
+ * {<AI95-00318-02AI95-00318-02>} {<AI05-0164-1AI05-0164-1>} For any
access result type of an access-to-subprogram type, the subtypes of
the designated profile of the result type.
29
-[ The types of a profile are the types of those subtypes.]
+[ The <types of a profile> are the types of those subtypes.]
30/3
-{AI95-00348-01AI95-00348-01} {AI05-0177-1AI05-0177-1} [A subprogram
+{<AI95-00348-01AI95-00348-01>} {<AI05-0177-1AI05-0177-1>} [A subprogram
declared by an abstract_subprogram_declaration is abstract; a subprogram
declared by a subprogram_declaration is not. See *note 3.9.3::, "*note
3.9.3:: Abstract Types and Subprograms". Similarly, a procedure
@@ -30303,15 +30402,15 @@ declared by a subprogram_declaration is not. See
*note 6.8::, "*note
6.8:: Expression Functions".]
30.1/2
-{AI95-00218-03AI95-00218-03} [An overriding_indicator is used to
+{<AI95-00218-03AI95-00218-03>} [An overriding_indicator is used to
indicate whether overriding is intended. See *note 8.3.1::, "*note
8.3.1:: Overriding Indicators".]
_Dynamic Semantics_
31/2
-{AI95-00348-01AI95-00348-01} The elaboration of a subprogram_declaration
-has no effect.
+{<AI95-00348-01AI95-00348-01>} The elaboration of a
+subprogram_declaration has no effect.
NOTES
@@ -30337,33 +30436,33 @@ has no effect.
_Examples_
36
-Examples of subprogram declarations:
+<Examples of subprogram declarations:>
37
procedure Traverse_Tree;
procedure Increment(X : in out Integer);
- procedure Right_Indent(Margin : out Line_Size); -- see *note
3.5.4::
- procedure Switch(From, To : in out Link); -- see *note
3.10.1::
+ procedure Right_Indent(Margin : out Line_Size); --< see *note
3.5.4::>
+ procedure Switch(From, To : in out Link); --< see *note
3.10.1::>
38
- function Random return Probability; -- see *note
3.5.7::
+ function Random return Probability; --< see *note
3.5.7::>
39/4
- {AI12-0056-1AI12-0056-1} function Min_Cell(X : Link) return Cell;
-- see *note 3.10.1::
- function Next_Frame(K : Positive) return Frame; -- see *note
3.10::
- function Dot_Product(Left, Right : Vector) return Real; -- see *note
3.6::
+ {<AI12-0056-1AI12-0056-1>} function Min_Cell(X : Link) return Cell;
--< see *note 3.10.1::>
+ function Next_Frame(K : Positive) return Frame; --< see *note
3.10::>
+ function Dot_Product(Left, Right : Vector) return Real; --< see *note
3.6::>
function Find(B : aliased in out Barrel; Key : String) return Real;
- -- see *note
4.1.5::
+ --< see *note
4.1.5::>
40
- function "*"(Left, Right : Matrix) return Matrix; -- see *note
3.6::
+ function "*"(Left, Right : Matrix) return Matrix; --< see *note
3.6::>
41
-Examples of in parameters with default expressions:
+<Examples of in parameters with default expressions:>
42
procedure Print_Header(Pages : in Natural;
- Header : in Line := (1 .. Line'Last => ' '); -- see
*note 3.6::
+ Header : in Line := (1 .. Line'Last => ' '); --< see
*note 3.6::>
Center : in Boolean := True);
_Extensions to Ada 83_
@@ -30374,9 +30473,9 @@ Examples of in parameters with default expressions:
access parameters (see *note 3.10::)
42.b/3
- {AI05-0299-1AI05-0299-1} Program units that are library units
- may have a parent_unit_name to indicate the parent of a child
- (see *note 10.1.1::).
+ {<AI05-0299-1AI05-0299-1>} Program units that are library
+ units may have a parent_unit_name to indicate the parent of a
+ child (see *note 10.1.1::).
_Wording Changes from Ada 83_
@@ -30400,62 +30499,62 @@ Examples of in parameters with default expressions:
_Extensions to Ada 95_
42.f/2
- {AI95-00218-03AI95-00218-03} Subprograms now allow
+ {<AI95-00218-03AI95-00218-03>} Subprograms now allow
overriding_indicators for better error checking of overriding.
42.g/2
- {AI95-00231-01AI95-00231-01} An optional null_exclusion can be
- used in a formal parameter declaration. Similarly, an
+ {<AI95-00231-01AI95-00231-01>} An optional null_exclusion can
+ be used in a formal parameter declaration. Similarly, an
optional null_exclusion can be used in a function result.
42.h/2
- {AI95-00318-02AI95-00318-02} The return type of a function can
- be an anonymous access type.
+ {<AI95-00318-02AI95-00318-02>} The return type of a function
+ can be an anonymous access type.
_Wording Changes from Ada 95_
42.i/2
- {AI95-00254-01AI95-00254-01} A description of the purpose of
+ {<AI95-00254-01AI95-00254-01>} A description of the purpose of
anonymous access-to-subprogram parameters and the definition
of the profile of subprograms containing them was added.
42.j/2
- {AI95-00348-01AI95-00348-01} Split the production for
+ {<AI95-00348-01AI95-00348-01>} Split the production for
subprogram_specification in order to make the declaration of
null procedures (see *note 6.7::) easier.
42.k/2
- {AI95-00348-01AI95-00348-01} Moved the Syntax and Dynamic
+ {<AI95-00348-01AI95-00348-01>} Moved the Syntax and Dynamic
Semantics for abstract_subprogram_declaration to *note
3.9.3::, so that the syntax and semantics are together. This
also keeps abstract and null subprograms similar.
42.l/2
- {AI95-00395-01AI95-00395-01} Revised to allow other_format
+ {<AI95-00395-01AI95-00395-01>} Revised to allow other_format
characters in operator_symbols in the same way as the
underlying constructs.
_Extensions to Ada 2005_
42.m/3
- {AI05-0142-4AI05-0142-4} Parameters can now be explicitly
+ {<AI05-0142-4AI05-0142-4>} Parameters can now be explicitly
aliased, allowing parts of function results to designate
parameters and forcing by-reference parameter passing.
42.n/3
- {AI05-0143-1AI05-0143-1} The parameters of a function can now
- have any mode.
+ {<AI05-0143-1AI05-0143-1>} The parameters of a function can
+ now have any mode.
42.o/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a subprogram_declaration. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a subprogram_declaration. This is described in
*note 13.1.1::.
_Wording Changes from Ada 2005_
42.p/3
- {AI05-0177-1AI05-0177-1} Added expression functions (see *note
- 6.8::) to the wording.
+ {<AI05-0177-1AI05-0177-1>} Added expression functions (see
+ *note 6.8::) to the wording.
* Menu:
@@ -30468,13 +30567,13 @@ File: aarm2012.info, Node: 6.1.1, Up: 6.1
--------------------------------------
1/4
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI12-0045-1AI12-0045-1} For a noninstance subprogram, a generic
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI12-0045-1AI12-0045-1>} For a noninstance subprogram, a generic
subprogram, or an entry, the following language-defined aspects may be
specified with an aspect_specification (see *note 13.1.1::):
1.a/4
- Ramification: {AI12-0045-1AI12-0045-1} "Noninstance
+ Ramification: {<AI12-0045-1AI12-0045-1>} "Noninstance
subprogram" excludes a subprogram that is an instance of a
generic subprogram. In that case, the aspects should be
specified on the generic subprogram. If preconditions or
@@ -30487,7 +30586,7 @@ specified with an aspect_specification (see *note
13.1.1::):
Pre
This aspect specifies a specific precondition for a
callable entity; it shall be specified by an expression,
- called a specific precondition expression. If not
+ called a <specific precondition expression>. If not
specified for an entity, the specific precondition
expression for the entity is the enumeration literal
True.
@@ -30505,17 +30604,17 @@ Pre
must hold true before a call.
3/3
-{AI05-0254-1AI05-0254-1} {AI05-0262-1AI05-0262-1} Pre'Class
+{<AI05-0254-1AI05-0254-1>} {<AI05-0262-1AI05-0262-1>} Pre'Class
This aspect specifies a class-wide precondition for an
operation of a tagged type and its descendants; it shall
- be specified by an expression, called a class-wide
- precondition expression. If not specified for an entity,
- then if no other class-wide precondition applies to the
- entity, the class-wide precondition expression for the
- entity is the enumeration literal True.
+ be specified by an expression, called a <class-wide
+ precondition expression>. If not specified for an
+ entity, then if no other class-wide precondition applies
+ to the entity, the class-wide precondition expression for
+ the entity is the enumeration literal True.
3.a/3
- Ramification: {AI05-0254-1AI05-0254-1} If other class-wide
+ Ramification: {<AI05-0254-1AI05-0254-1>} If other class-wide
preconditions apply to the entity and no class-wide
precondition is specified, no class-wide precondition is
defined for the entity; of course, the class-wide
@@ -30534,7 +30633,7 @@ Pre
Post
This aspect specifies a specific postcondition for a
callable entity; it shall be specified by an expression,
- called a specific postcondition expression. If not
+ called a <specific postcondition expression>. If not
specified for an entity, the specific postcondition
expression for the entity is the enumeration literal
True.
@@ -30544,11 +30643,11 @@ Post
must hold true after a call.
5/3
-{AI05-0262-1AI05-0262-1} Post'Class
+{<AI05-0262-1AI05-0262-1>} Post'Class
This aspect specifies a class-wide postcondition for an
operation of a tagged type and its descendants; it shall
- be specified by an expression, called a class-wide
- postcondition expression. If not specified for an
+ be specified by an expression, called a <class-wide
+ postcondition expression>. If not specified for an
entity, the class-wide postcondition expression for the
entity is the enumeration literal True.
@@ -30559,29 +30658,29 @@ Post
_Name Resolution Rules_
6/3
-{AI05-0145-2AI05-0145-2} The expected type for a precondition or
+{<AI05-0145-2AI05-0145-2>} The expected type for a precondition or
postcondition expression is any boolean type.
7/4
-{AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1}
-{AI12-0113-1AI12-0113-1} {AI12-0159-1AI12-0159-1} Within the expression
-for a Pre'Class or Post'Class aspect for a primitive subprogram S of a
-tagged type T, a name that denotes a formal parameter (or S'Result) of
-type T is interpreted as though it had a (notional) type NT that is a
-formal derived type whose ancestor type is T, with directly visible
-primitive operations. Similarly, a name that denotes a formal access
-parameter (or S'Result) of type access-to-T is interpreted as having
-type access-to-NT. [The result of this interpretation is that the only
-operations that can be applied to such names are those defined for such
-a formal derived type.]
+{<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>}
+{<AI12-0113-1AI12-0113-1>} {<AI12-0159-1AI12-0159-1>} Within the
+expression for a Pre'Class or Post'Class aspect for a primitive
+subprogram <S> of a tagged type <T>, a name that denotes a formal
+parameter (or <S>'Result) of type <T> is interpreted as though it had a
+(notional) type <NT> that is a formal derived type whose ancestor type
+is <T>, with directly visible primitive operations. Similarly, a name
+that denotes a formal access parameter (or <S>'Result) of type
+access-to-<T> is interpreted as having type access-to-<NT>. [The result
+of this interpretation is that the only operations that can be applied
+to such names are those defined for such a formal derived type.]
7.a/4
- Reason: {AI12-0159-1AI12-0159-1} This ensures that the
+ Reason: {<AI12-0159-1AI12-0159-1>} This ensures that the
expression is well-defined for any primitive subprogram of a
- type descended from T.
+ type descended from <T>.
8/3
-{AI05-0145-2AI05-0145-2} {AI05-0264-1AI05-0264-1} For an
+{<AI05-0145-2AI05-0145-2>} {<AI05-0264-1AI05-0264-1>} For an
attribute_reference with attribute_designator Old, if the attribute
reference has an expected type or shall resolve to a given type, the
same applies to the prefix; otherwise, the prefix shall be resolved
@@ -30590,44 +30689,45 @@ independently of context.
_Legality Rules_
9/3
-{AI05-0145-2AI05-0145-2} {AI05-0230-1AI05-0230-1} The Pre or Post aspect
-shall not be specified for an abstract subprogram or a null procedure.
-[Only the Pre'Class and Post'Class aspects may be specified for such a
-subprogram.]
+{<AI05-0145-2AI05-0145-2>} {<AI05-0230-1AI05-0230-1>} The Pre or Post
+aspect shall not be specified for an abstract subprogram or a null
+procedure. [Only the Pre'Class and Post'Class aspects may be specified
+for such a subprogram.]
9.a/3
- Discussion: {AI05-0183-1AI05-0183-1} Pre'Class and Post'Class
- can only be specified on primitive routines of tagged types,
- by a blanket rule found in *note 13.1.1::.
+ Discussion: {<AI05-0183-1AI05-0183-1>} Pre'Class and
+ Post'Class can only be specified on primitive routines of
+ tagged types, by a blanket rule found in *note 13.1.1::.
10/3
-{AI05-0247-1AI05-0247-1} {AI05-0254-1AI05-0254-1} If a type T has an
-implicitly declared subprogram P inherited from a parent type T1 and a
-homograph (see *note 8.3::) of P from a progenitor type T2, and
+{<AI05-0247-1AI05-0247-1>} {<AI05-0254-1AI05-0254-1>} If a type <T> has
+an implicitly declared subprogram <P> inherited from a parent type <T1>
+and a homograph (see *note 8.3::) of <P> from a progenitor type <T2>,
+and
11/3
- * the corresponding primitive subprogram P1 of type T1 is neither
+ * the corresponding primitive subprogram <P1> of type <T1> is neither
null nor abstract; and
12/3
- * the class-wide precondition expression True does not apply to P1
+ * the class-wide precondition expression True does not apply to <P1>
(implicitly or explicitly); and
13/3
* there is a class-wide precondition expression that applies to the
- corresponding primitive subprogram P2 of T2 that does not fully
+ corresponding primitive subprogram <P2> of <T2> that does not fully
conform to any class-wide precondition expression that applies to
- P1,
+ <P1>,
14/3
-{AI05-0247-1AI05-0247-1} {AI05-0254-1AI05-0254-1} then:
+{<AI05-0247-1AI05-0247-1>} {<AI05-0254-1AI05-0254-1>} then:
15/3
- * If the type T is abstract, the implicitly declared subprogram P is
- abstract.
+ * If the type <T> is abstract, the implicitly declared subprogram <P>
+ is <abstract>.
16/3
- * Otherwise, the subprogram P requires overriding and shall be
+ * Otherwise, the subprogram <P> <requires overriding> and shall be
overridden with a nonabstract subprogram.
16.a/3
@@ -30680,18 +30780,19 @@ homograph (see *note 8.3::) of P from a progenitor
type T2, and
overriding is required, the complexity is too much.
17/3
-{AI05-0247-1AI05-0247-1} If a renaming of a subprogram or entry S1
-overrides an inherited subprogram S2, then the overriding is illegal
-unless each class-wide precondition expression that applies to S1 fully
-conforms to some class-wide precondition expression that applies to S2
-and each class-wide precondition expression that applies to S2 fully
-conforms to some class-wide precondition expression that applies to S1.
+{<AI05-0247-1AI05-0247-1>} If a renaming of a subprogram or entry <S1>
+overrides an inherited subprogram <S2>, then the overriding is illegal
+unless each class-wide precondition expression that applies to <S1>
+fully conforms to some class-wide precondition expression that applies
+to <S2> and each class-wide precondition expression that applies to <S2>
+fully conforms to some class-wide precondition expression that applies
+to <S1>.
17.a/3
Reason: Such an overriding subprogram would violate LSP, as
- the precondition of S1 would usually be different (and thus
+ the precondition of <S1> would usually be different (and thus
stronger) than the one known to a dispatching call through an
- ancestor routine of S2. This is always OK if the
+ ancestor routine of <S2>. This is always OK if the
preconditions match, so we always allow that.
17.b/3
@@ -30699,10 +30800,10 @@ conforms to some class-wide precondition expression
that applies to S1.
other routines cannot have class-wide preconditions.
17.1/4
-{AI12-0131-1AI12-0131-1} Pre'Class shall not be specified for an
-overriding primitive subprogram of a tagged type T unless the Pre'Class
-aspect is specified for the corresponding primitive subprogram of some
-ancestor of T.
+{<AI12-0131-1AI12-0131-1>} Pre'Class shall not be specified for an
+overriding primitive subprogram of a tagged type <T> unless the
+Pre'Class aspect is specified for the corresponding primitive subprogram
+of some ancestor of <T>.
17.c/4
Reason: Any such Pre'Class will have no effect, as it will be
@@ -30716,20 +30817,20 @@ ancestor of T.
subprogram has explicitly specified a precondition of True).
17.2/4
-{AI12-0131-1AI12-0131-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules also apply in the private
-part of an instance of a generic unit.
+{<AI12-0131-1AI12-0131-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules also apply in the
+private part of an instance of a generic unit.
_Static Semantics_
18/4
-{AI05-0145-2AI05-0145-2} {AI12-0113-1AI12-0113-1}
-{AI12-0131-1AI12-0131-1} If a Pre'Class or Post'Class aspect is
-specified for a primitive subprogram S of a tagged type T, or such an
-aspect defaults to True, then a corresponding expression also applies to
-the corresponding primitive subprogram S of each descendant of T. The
-corresponding expression is constructed from the associated expression
-as follows:
+{<AI05-0145-2AI05-0145-2>} {<AI12-0113-1AI12-0113-1>}
+{<AI12-0131-1AI12-0131-1>} If a Pre'Class or Post'Class aspect is
+specified for a primitive subprogram <S> of a tagged type <T>, or such
+an aspect defaults to True, then a corresponding expression also applies
+to the corresponding primitive subprogram <S> of each descendant of <T>.
+The <corresponding expression> is constructed from the associated
+expression as follows:
18.a/4
Ramification: A Pre'Class defaults to True only if no
@@ -30743,10 +30844,11 @@ as follows:
postconditions for consistency.
18.1/4
- * {AI12-0113-1AI12-0113-1} References to formal parameters of S (or
- to S itself) are replaced with references to the corresponding
- formal parameters of the corresponding inherited or overriding
- subprogram S (or to the corresponding subprogram S itself).
+ * {<AI12-0113-1AI12-0113-1>} References to formal parameters of <S>
+ (or to <S> itself) are replaced with references to the
+ corresponding formal parameters of the corresponding inherited or
+ overriding subprogram <S> (or to the corresponding subprogram <S>
+ itself).
18.c/4
Reason: We have to define the corresponding expression this
@@ -30756,8 +30858,8 @@ as follows:
without mentioning any names.
18.2/4
-{AI12-0113-1AI12-0113-1} The primitive subprogram S is illegal if it is
-not abstract and the corresponding expression for a Pre'Class or
+{<AI12-0113-1AI12-0113-1>} The primitive subprogram <S> is illegal if it
+is not abstract and the corresponding expression for a Pre'Class or
Post'Class aspect would be illegal.
18.d/4
@@ -30774,32 +30876,32 @@ Post'Class aspect would be illegal.
subprograms.
19/3
-{AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1}
-{AI05-0290-1AI05-0290-1} If performing checks is required by the Pre,
+{<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0290-1AI05-0290-1>} If performing checks is required by the Pre,
Pre'Class, Post, or Post'Class assertion policies (see *note 11.4.2::)
in effect at the point of a corresponding aspect specification
applicable to a given subprogram or entry, then the respective
-precondition or postcondition expressions are considered enabled.
+precondition or postcondition expressions are considered <enabled>.
19.a/3
- Ramification: {AI05-0290-1AI05-0290-1} If a class-wide
+ Ramification: {<AI05-0290-1AI05-0290-1>} If a class-wide
precondition or postcondition expression is enabled, it
remains enabled when inherited by an overriding subprogram,
even if the policy in effect is Ignore for the inheriting
subprogram.
20/3
-{AI05-0273-1AI05-0273-1} An expression is potentially unevaluated if it
-occurs within:
+{<AI05-0273-1AI05-0273-1>} An expression is <potentially unevaluated> if
+it occurs within:
21/3
* any part of an if_expression other than the first condition;
22/3
- * a dependent_expression of a case_expression;
+ * a <dependent_>expression of a case_expression;
22.1/4
- * {AI12-0032-1AI12-0032-1} a predicate of a quantified_expression;
+ * {<AI12-0032-1AI12-0032-1>} a predicate of a quantified_expression;
23/3
* the right operand of a short-circuit control form; or
@@ -30808,36 +30910,36 @@ occurs within:
* a membership_choice other than the first of a membership operation.
25/3
-{AI05-0145-2AI05-0145-2} For a prefix X that denotes an object of a
+{<AI05-0145-2AI05-0145-2>} For a prefix X that denotes an object of a
nonlimited type, the following attribute is defined:
26/4
X'Old
- {AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1}
- {AI05-0273-1AI05-0273-1} {AI12-0032-1AI12-0032-1} Each
- X'Old in a postcondition expression that is enabled
+ {<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0273-1AI05-0273-1>} {<AI12-0032-1AI12-0032-1>}
+ Each X'Old in a postcondition expression that is enabled
denotes a constant that is implicitly declared at the
beginning of the subprogram body, entry body, or accept
statement.
26.1/4
- {AI12-0032-1AI12-0032-1} {AI12-0159-1AI12-0159-1} The
+ {<AI12-0032-1AI12-0032-1>} {<AI12-0159-1AI12-0159-1>} The
implicitly declared entity denoted by each occurrence of
X'Old is declared as follows:
26.2/4
* If X is of an anonymous access type defined by an
- access_definition A then
+ access_definition <A> then
26.3/4
- X'Old : constant A := X;
+ <X'Old> : constant <A> := X;
26.4/4
- * If X is of a specific tagged type T then
+ * If X is of a specific tagged type <T> then
26.5/4
- anonymous : constant T'Class := T'Class(X);
- X'Old : T renames T(anonymous);
+ <anonymous> : constant <T>'Class := <T>'Class(X);
+ <X'Old> : <T> renames <T>(<anonymous>);
26.6/4
where the name X'Old denotes the object renaming.
@@ -30850,24 +30952,24 @@ X'Old
* Otherwise
26.8/4
- X'Old : constant S := X;
+ <X'Old> : constant <S> := X;
26.9/4
- where S is the nominal subtype of X. This includes
- the case where the type of S is an anonymous array
+ where <S> is the nominal subtype of X. This includes
+ the case where the type of <S> is an anonymous array
type or a universal type.
26.10/4
- {AI12-0032-1AI12-0032-1} The nominal subtype of X'Old is
- as implied by the above definitions. The expected type
- of the prefix of an Old attribute is that of the
+ {<AI12-0032-1AI12-0032-1>} The nominal subtype of X'Old
+ is as implied by the above definitions. The expected
+ type of the prefix of an Old attribute is that of the
attribute. Similarly, if an Old attribute shall resolve
to be of some type, then the prefix of the attribute
shall resolve to be of that type.
27/3
- {AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1}
- {AI05-0273-1AI05-0273-1} Reference to this attribute is
+ {<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0273-1AI05-0273-1>} Reference to this attribute is
only allowed within a postcondition expression. The
prefix of an Old attribute_reference shall not contain a
Result attribute_reference, nor an Old
@@ -30903,10 +31005,10 @@ X'Old
legal, see below).
27.d/4
- {AI12-0032-1AI12-0032-1} If X has controlled parts, adjustment
- and finalization are implied by the implicit constant
- declaration. Similarly, the implicit constant declaration
- defines the accessibility level of X'Old.
+ {<AI12-0032-1AI12-0032-1>} If X has controlled parts,
+ adjustment and finalization are implied by the implicit
+ constant declaration. Similarly, the implicit constant
+ declaration defines the accessibility level of X'Old.
27.e/3
If postconditions are disabled, we want the compiler to avoid
@@ -30918,19 +31020,20 @@ X'Old
to allow build-in-place, but it's not worth the trouble.
27.g/3
- Reason: {AI05-0273-1AI05-0273-1} Since the prefix is evaluated
- unconditionally when the subprogram is called, we cannot allow
- it to include values that do not exist at that time (like
- 'Result and loop parameters of quantified_expressions). We
- also do not allow it to include 'Old references, as those
- would be redundant (the entire prefix is evaluated when the
- subprogram is called), and allowing them would require some
- sort of order to the implicit constant declarations (because
- in A(I'Old)'Old, we surely would want the value of I'Old
- evaluated before the A(I'Old) is evaluated).
+ Reason: {<AI05-0273-1AI05-0273-1>} Since the prefix is
+ evaluated unconditionally when the subprogram is called, we
+ cannot allow it to include values that do not exist at that
+ time (like 'Result and loop parameters of
+ quantified_expressions). We also do not allow it to include
+ 'Old references, as those would be redundant (the entire
+ prefix is evaluated when the subprogram is called), and
+ allowing them would require some sort of order to the implicit
+ constant declarations (because in A(I'Old)'Old, we surely
+ would want the value of I'Old evaluated before the A(I'Old) is
+ evaluated).
27.h/3
- {AI05-0273-1AI05-0273-1} In addition, we only allow simple
+ {<AI05-0273-1AI05-0273-1>} In addition, we only allow simple
names as the prefix of the Old attribute if the
attribute_reference might not be evaluated when the
postcondition expression is evaluated. This is necessary
@@ -30942,7 +31045,7 @@ X'Old
27.i/3
Table : array (1..10) of Integer := ...
procedure Bar (I : in out Natural)
- with Post => I > 0 and then Table(I)'Old = 1; -- Illegal
+ with Post => I > 0 and then Table(I)'Old = 1; -- <Illegal>
27.j/3
In this example, the compiler cannot know the value of I when
@@ -30971,14 +31074,14 @@ X'Old
subprogram.)
27.l/4
- Ramification: {AI12-0032-1AI12-0032-1} An accept statement for
- a task entry with enabled postconditions such as
+ Ramification: {<AI12-0032-1AI12-0032-1>} An accept statement
+ for a task entry with enabled postconditions such as
27.m/4
accept E do
- statements
+ <statements>
exception
- handlers
+ <handlers>
end;
27.n/4
@@ -30987,58 +31090,58 @@ X'Old
27.o/4
accept E do
declare
- declarations, if any, of 'Old constants
+ <declarations, if any, of 'Old constants>
begin
begin
- statements
+ <statements>
exception
- handlers
+ <handlers>
end;
- postcondition checks
+ <postcondition checks>
end;
end;
27.p/4
- {AI12-0032-1AI12-0032-1} Preconditions are checked by the
+ {<AI12-0032-1AI12-0032-1>} Preconditions are checked by the
caller before the rendezvous begins. Postcondition
expressions might, of course, reference 'Old constants.
27.q/4
- {AI12-0032-1AI12-0032-1} In the case of a protected operation
- with enabled postconditions, 'Old constant declarations (if
- any) are elaborated after the start of the protected action.
- Postcondition checks (which might reference these constants)
- are performed before the end of the protected action as
- described below.
+ {<AI12-0032-1AI12-0032-1>} In the case of a protected
+ operation with enabled postconditions, 'Old constant
+ declarations (if any) are elaborated after the start of the
+ protected action. Postcondition checks (which might reference
+ these constants) are performed before the end of the protected
+ action as described below.
28/3
-{AI05-0145-2AI05-0145-2} For a prefix F that denotes a function
+{<AI05-0145-2AI05-0145-2>} For a prefix F that denotes a function
declaration, the following attribute is defined:
29/3
F'Result
- {AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1} Within
- a postcondition expression for function F, denotes the
- result object of the function. The type of this
+ {<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>}
+ Within a postcondition expression for function F, denotes
+ the result object of the function. The type of this
attribute is that of the function result except within a
Post'Class postcondition expression for a function with a
controlling result or with a controlling access result.
For a controlling result, the type of the attribute is
- T'Class, where T is the function result type. For a
+ <T>'Class, where <T> is the function result type. For a
controlling access result, the type of the attribute is
an anonymous access type whose designated type is
- T'Class, where T is the designated type of the function
- result type.
+ <T>'Class, where <T> is the designated type of the
+ function result type.
30/3
- {AI05-0262-1AI05-0262-1} Use of this attribute is allowed
- only within a postcondition expression for F.
+ {<AI05-0262-1AI05-0262-1>} Use of this attribute is
+ allowed only within a postcondition expression for F.
_Dynamic Semantics_
31/3
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0290-1AI05-0290-1} Upon a call of the subprogram or entry, after
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0290-1AI05-0290-1>} Upon a call of the subprogram or entry, after
evaluating any actual parameters, precondition checks are performed as
follows:
@@ -31069,8 +31172,8 @@ follows:
precondition expressions are enabled.
34/3
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0254-1AI05-0254-1} {AI05-0269-1AI05-0269-1} The precondition
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0254-1AI05-0254-1>} {<AI05-0269-1AI05-0269-1>} The precondition
checks are performed in an arbitrary order, and if any of the class-wide
precondition expressions evaluate to True, it is not specified whether
the other class-wide precondition expressions are evaluated. The
@@ -31090,9 +31193,9 @@ performed prior to checking whether the entry is open.
check propagates an exception.
35/3
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0254-1AI05-0254-1} {AI05-0262-1AI05-0262-1}
-{AI05-0290-1AI05-0290-1} Upon successful return from a call of the
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0254-1AI05-0254-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0290-1AI05-0290-1>} Upon successful return from a call of the
subprogram or entry, prior to copying back any by-copy in out or out
parameters, the postcondition check is performed. This consists of the
evaluation of any enabled specific and class-wide postcondition
@@ -31114,7 +31217,7 @@ performed in an arbitrary order.
invoked body.
35.1/4
-{AI12-0032-1AI12-0032-1} For a call to a task entry, the postcondition
+{<AI12-0032-1AI12-0032-1>} For a call to a task entry, the postcondition
check is performed before the end of the rendezvous; for a call to a
protected operation, the postcondition check is performed before the end
of the protected action of the call. The postcondition check for any
@@ -31124,9 +31227,9 @@ but after the finalization of any other entities whose
accessibility
level is that of the execution of the callable construct.
35.a.1/4
- Reason: {AI12-0032-1AI12-0032-1} If a postcondition references
- the implicitly-declared constant associated with an Old
- attribute, the postcondition must be evaluated before the
+ Reason: {<AI12-0032-1AI12-0032-1>} If a postcondition
+ references the implicitly-declared constant associated with an
+ Old attribute, the postcondition must be evaluated before the
constant is finalized. One way to think of this is to imagine
declaring a controlled object between any implicit "'Old"
constant declarations and any explicit declarations, then
@@ -31134,31 +31237,31 @@ level is that of the execution of the callable
construct.
this object.
36/3
-{AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1} If a precondition or
-postcondition check fails, the exception is raised at the point of the
-call[; the exception cannot be handled inside the called subprogram or
-entry]. Similarly, any exception raised by the evaluation of a
+{<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>} If a precondition
+or postcondition check fails, the exception is raised at the point of
+the call[; the exception cannot be handled inside the called subprogram
+or entry]. Similarly, any exception raised by the evaluation of a
precondition or postcondition expression is raised at the point of call.
37/4
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0254-1AI05-0254-1} {AI05-0262-1AI05-0262-1}
-{AI12-0113-1AI12-0113-1} {AI12-0159-1AI12-0159-1} For any call to a
-subprogram or entry S (including dispatching calls), the checks that are
-performed to verify specific precondition expressions and specific and
-class-wide postcondition expressions are determined by those for the
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0254-1AI05-0254-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI12-0113-1AI12-0113-1>} {<AI12-0159-1AI12-0159-1>} For any call to a
+subprogram or entry <S> (including dispatching calls), the checks that
+are performed to verify specific precondition expressions and specific
+and class-wide postcondition expressions are determined by those for the
subprogram or entry actually invoked. Note that the class-wide
postcondition expressions verified by the postcondition check that is
-part of a call on a primitive subprogram of type T includes all
+part of a call on a primitive subprogram of type <T> includes all
class-wide postcondition expressions originating in any progenitor of
-T[, even if the primitive subprogram called is inherited from a type T1
-and some of the postcondition expressions do not apply to the
-corresponding primitive subprogram of T1]. Any operations within a
+<T>[, even if the primitive subprogram called is inherited from a type
+<T1> and some of the postcondition expressions do not apply to the
+corresponding primitive subprogram of <T1>]. Any operations within a
class-wide postcondition expression that were resolved as primitive
-operations of the (notional) formal derived type NT, are in the
+operations of the (notional) formal derived type <NT>, are in the
evaluation of the postcondition bound to the corresponding operations of
-the type identified by the controlling tag of the call on S.[ This
-applies to both dispatching and non-dispatching calls on S.]
+the type identified by the controlling tag of the call on <S>.[ This
+applies to both dispatching and non-dispatching calls on <S>.]
37.a/3
Ramification: This applies to access-to-subprogram calls,
@@ -31180,17 +31283,17 @@ applies to both dispatching and non-dispatching calls
on S.]
preconditions; they have their own rules mentioned below.
38/4
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0254-1AI05-0254-1} {AI12-0113-1AI12-0113-1}
-{AI12-0159-1AI12-0159-1} The class-wide precondition check for a call to
-a subprogram or entry S consists solely of checking the class-wide
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0254-1AI05-0254-1>} {<AI12-0113-1AI12-0113-1>}
+{<AI12-0159-1AI12-0159-1>} The class-wide precondition check for a call
+to a subprogram or entry <S> consists solely of checking the class-wide
precondition expressions that apply to the denoted callable entity (not
necessarily to the one that is invoked). Any operations within such an
expression that were resolved as primitive operations of the (notional)
-formal derived type NT are in the evaluation of the precondition bound
+formal derived type <NT> are in the evaluation of the precondition bound
to the corresponding operations of the type identified by the
-controlling tag of the call on S.[ This applies to both dispatching and
-non-dispatching calls on S.]
+controlling tag of the call on <S>.[ This applies to both dispatching
+and non-dispatching calls on <S>.]
38.a/3
Ramification: For a dispatching call, we are talking about the
@@ -31235,8 +31338,8 @@ non-dispatching calls on S.]
the foreign code that it most likely cannot analyze.
39/3
-{AI05-0145-2AI05-0145-2} {AI05-0247-1AI05-0247-1}
-{AI05-0254-1AI05-0254-1} For a call via an access-to-subprogram value,
+{<AI05-0145-2AI05-0145-2>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0254-1AI05-0254-1>} For a call via an access-to-subprogram value,
all precondition and postcondition checks performed are determined by
the subprogram or entry denoted by the prefix of the Access attribute
reference that produced the value.
@@ -31244,23 +31347,23 @@ reference that produced the value.
NOTES
40/3
- 5 {AI05-0145-2AI05-0145-2} {AI05-0262-1AI05-0262-1} A precondition
- is checked just before the call. If another task can change any
- value that the precondition expression depends on, the precondition
- need not hold within the subprogram or entry body.
+ 5 {<AI05-0145-2AI05-0145-2>} {<AI05-0262-1AI05-0262-1>} A
+ precondition is checked just before the call. If another task can
+ change any value that the precondition expression depends on, the
+ precondition need not hold within the subprogram or entry body.
_Extensions to Ada 2005_
40.a/3
- {AI05-0145-2AI05-0145-2} {AI05-0230-1AI05-0230-1}
- {AI05-0247-1AI05-0247-1} {AI05-0254-1AI05-0254-1}
- {AI05-0262-1AI05-0262-1} {AI05-0273-1AI05-0273-1}
- {AI05-0274-1AI05-0274-1} Pre and Post aspects are new.
+ {<AI05-0145-2AI05-0145-2>} {<AI05-0230-1AI05-0230-1>}
+ {<AI05-0247-1AI05-0247-1>} {<AI05-0254-1AI05-0254-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0273-1AI05-0273-1>}
+ {<AI05-0274-1AI05-0274-1>} Pre and Post aspects are new.
_Inconsistencies With Ada 2012_
40.b/4
- {AI12-0032-1AI12-0032-1} Corrigendum: The Old attribute is
+ {<AI12-0032-1AI12-0032-1>} Corrigendum: The Old attribute is
defined more carefully. This changes the nominal subtype and
place of declaration of the attribute compared to the
published Ada 2012 Standard. In extreme cases, this could
@@ -31270,24 +31373,24 @@ reference that produced the value.
possible that a program that previously worked might fail.
40.c/4
- {AI12-0113-1AI12-0113-1} {AI12-0159-1AI12-0159-1} Corrigendum:
- Eliminated unintentional redispatching from class-wide
- preconditions and postconditions. This means that a different
- body might be evaluated for a statically bound call to a
- routine that has a class-wide precondition or postcondition.
- The change means that the behavior of Pre and Pre'Class will
- be the same for a particular subprogram, and that the known
- behavior of the operations can be assumed within the body of
- that subprogram for Pre'Class. We expect that this change
- will primarily fix bugs, as it will make Pre'Class and
- Post'Class work more like expected. In the case where
- redispatching is desired, an explicit conversion to a
+ {<AI12-0113-1AI12-0113-1>} {<AI12-0159-1AI12-0159-1>}
+ Corrigendum: Eliminated unintentional redispatching from
+ class-wide preconditions and postconditions. This means that
+ a different body might be evaluated for a statically bound
+ call to a routine that has a class-wide precondition or
+ postcondition. The change means that the behavior of Pre and
+ Pre'Class will be the same for a particular subprogram, and
+ that the known behavior of the operations can be assumed
+ within the body of that subprogram for Pre'Class. We expect
+ that this change will primarily fix bugs, as it will make
+ Pre'Class and Post'Class work more like expected. In the case
+ where redispatching is desired, an explicit conversion to a
class-wide type can be used.
_Incompatibilities With Ada 2012_
40.d/4
- {AI12-0045-1AI12-0045-1} Corrigendum: Precondition and
+ {<AI12-0045-1AI12-0045-1>} Corrigendum: Precondition and
postcondition aspects cannot be specified on instances of
generic subprograms (they should be specified on the generic
subprogram instead). This was (unintentionally) allowed by
@@ -31300,7 +31403,7 @@ reference that produced the value.
package (a common conversion).
40.e/4
- {AI12-0131-1AI12-0131-1} Corrigendum: Pre'Class is no longer
+ {<AI12-0131-1AI12-0131-1>} Corrigendum: Pre'Class is no longer
allowed to be specified for an overriding primitive subprogram
unless there are also inherited class-wide precondittions.
This incompatibility prevents cases where the explicit
@@ -31332,22 +31435,23 @@ out, or out.]
_Static Semantics_
2
-A parameter is passed either by copy or by reference. [When a parameter
-is passed by copy, the formal parameter denotes a separate object from
-the actual parameter, and any information transfer between the two
-occurs only before and after executing the subprogram. When a parameter
-is passed by reference, the formal parameter denotes (a view of) the
-object denoted by the actual parameter; reads and updates of the formal
-parameter directly reference the actual parameter object.]
+A parameter is passed either <by copy> or <by reference>. [When a
+parameter is passed by copy, the formal parameter denotes a separate
+object from the actual parameter, and any information transfer between
+the two occurs only before and after executing the subprogram. When a
+parameter is passed by reference, the formal parameter denotes (a view
+of) the object denoted by the actual parameter; reads and updates of the
+formal parameter directly reference the actual parameter object.]
3/3
-{AI05-0142-4AI05-0142-4} {AI05-0262-1AI05-0262-1} A type is a by-copy
-type if it is an elementary type, or if it is a descendant of a private
-type whose full type is a by-copy type. A parameter of a by-copy type
-is passed by copy, unless the formal parameter is explicitly aliased.
+{<AI05-0142-4AI05-0142-4>} {<AI05-0262-1AI05-0262-1>} A type is a
+<by-copy type> if it is an elementary type, or if it is a descendant of
+a private type whose full type is a by-copy type. A parameter of a
+by-copy type is passed by copy, unless the formal parameter is
+explicitly aliased.
4
-A type is a by-reference type if it is a descendant of one of the
+A type is a <by-reference type> if it is a descendant of one of the
following:
5
@@ -31357,10 +31461,10 @@ following:
* a task or protected type;
7/3
- * {AI05-0096-1AI05-0096-1} an explicitly limited record type;
+ * {<AI05-0096-1AI05-0096-1>} an explicitly limited record type;
7.a/3
- This paragraph was deleted.{AI05-0096-1AI05-0096-1}
+ <This paragraph was deleted.>{<AI05-0096-1AI05-0096-1>}
8
* a composite type with a subcomponent of a by-reference type;
@@ -31369,16 +31473,16 @@ following:
* a private type whose full type is a by-reference type.
10/4
-{AI05-0142-4AI05-0142-4} {AI05-0188-1AI05-0188-1}
-{AI12-0027-1AI12-0027-1} A parameter of a by-reference type is passed by
-reference, as is an explicitly aliased parameter of any type. Each value
-of a by-reference type has an associated object. For a parenthesized
-expression, qualified_expression, or view conversion, this object is the
-one associated with the operand. For a value conversion, the associated
-object is the anonymous result object if such an object is created (see
-*note 4.6::); otherwise it is the associated object of the operand. For
-a conditional_expression, this object is the one associated with the
-evaluated dependent_expression.
+{<AI05-0142-4AI05-0142-4>} {<AI05-0188-1AI05-0188-1>}
+{<AI12-0027-1AI12-0027-1>} A parameter of a by-reference type is passed
+by reference, as is an explicitly aliased parameter of any type. Each
+value of a by-reference type has an associated object. For a
+parenthesized expression, qualified_expression, or view conversion, this
+object is the one associated with the operand. For a value conversion,
+the associated object is the anonymous result object if such an object
+is created (see *note 4.6::); otherwise it is the associated object of
+the operand. For a conditional_expression, this object is the one
+associated with the evaluated <dependent_>expression.
10.a
Ramification: By-reference parameter passing makes sense only
@@ -31402,8 +31506,8 @@ evaluated dependent_expression.
conversion (or a renaming thereof) in certain cases.
10.d/2
- {AI95-00318-02AI95-00318-02} We do not want this definition to
- depend on the view of the type; privateness is essentially
+ {<AI95-00318-02AI95-00318-02>} We do not want this definition
+ to depend on the view of the type; privateness is essentially
ignored for this definition. Otherwise, things would be
confusing (does the rule apply at the call site, at the site
of the declaration of the subprogram, at the site of the
@@ -31417,10 +31521,10 @@ evaluated dependent_expression.
10.f
Every value of a limited by-reference type is the value of one
- and only one limited object. The associated object of a value
- of a limited by-reference type is the object whose value it
- represents. Two values of a limited by-reference type are the
- same if and only if they represent the value of the same
+ and only one limited object. The <associated object> of a
+ value of a limited by-reference type is the object whose value
+ it represents. Two values of a limited by-reference type are
+ the <same> if and only if they represent the value of the same
object.
10.g
@@ -31429,11 +31533,11 @@ evaluated dependent_expression.
nonlimited (unfortunately).
11/3
-{AI05-0240-1AI05-0240-1} For other parameters, it is unspecified whether
-the parameter is passed by copy or by reference.
+{<AI05-0240-1AI05-0240-1>} For other parameters, it is unspecified
+whether the parameter is passed by copy or by reference.
11.a/3
- Discussion: {AI05-0005-1AI05-0005-1} There is no need to
+ Discussion: {<AI05-0005-1AI05-0005-1>} There is no need to
incorporate the discussion of AI83-00178, which requires
pass-by-copy for certain kinds of actual parameters, while
allowing pass-by-reference for others. This is because we
@@ -31446,10 +31550,10 @@ the parameter is passed by copy or by reference.
_Bounded (Run-Time) Errors_
12/3
-{AI05-0240-1AI05-0240-1} If one name denotes a part of a formal
+{<AI05-0240-1AI05-0240-1>} If one name denotes a part of a formal
parameter, and a second name denotes a part of a distinct formal
parameter or an object that is not part of a formal parameter, then the
-two names are considered distinct access paths. If an object is of a
+two names are considered <distinct access paths>. If an object is of a
type for which the parameter passing mechanism is not specified and is
not an explicitly aliased parameter, then it is a bounded error to
assign to the object via one access path, and then read the value of the
@@ -31474,7 +31578,7 @@ assigned value is read, or some old value of the object
is read.
always be read, and again there is no error.
12.b
- Reason: We are saying assign here, not update, because
+ Reason: We are saying <assign> here, not <update>, because
updating any subcomponent is considered to update the
enclosing object.
@@ -31528,7 +31632,7 @@ assigned value is read, or some old value of the object
is read.
Drop : in Truncation := Error;
Justify : in Alignment := Left;
Pad : in Character := Space);
- -- Copies elements from Source to Target (safely if they
overlap)
+ --< Copies elements from Source to Target (safely if they
overlap)>
12.i
This is from the standard string handling package. It would
@@ -31564,7 +31668,7 @@ assigned value is read, or some old value of the object
is read.
NOTES
13/4
- 6 {AI12-0056-1AI12-0056-1} The mode of a formal parameter
+ 6 {<AI12-0056-1AI12-0056-1>} The mode of a formal parameter
describes the direction of information transfer to or from the
subprogram_body (see *note 6.1::).
@@ -31573,8 +31677,8 @@ assigned value is read, or some old value of the object
is read.
3.3::); it cannot be updated within the subprogram_body.
15/4
- 8 {AI12-0056-1AI12-0056-1} A formal parameter of mode out might be
- uninitialized at the start of the subprogram_body (see *note
+ 8 {<AI12-0056-1AI12-0056-1>} A formal parameter of mode out might
+ be uninitialized at the start of the subprogram_body (see *note
6.4.1::).
_Extensions to Ada 83_
@@ -31602,21 +31706,23 @@ assigned value is read, or some old value of the
object is read.
_Wording Changes from Ada 2005_
15.e/3
- {AI05-0096-1AI05-0096-1} Correction: Corrected so that limited
- derived types are by-reference only if their parent is.
+ {<AI05-0096-1AI05-0096-1>} Correction: Corrected so that
+ limited derived types are by-reference only if their parent
+ is.
15.f/3
- {AI05-0142-4AI05-0142-4} Defined that explicitly aliased
+ {<AI05-0142-4AI05-0142-4>} Defined that explicitly aliased
parameters (see *note 6.1::) are always passed by reference.
_Wording Changes from Ada 2012_
15.g/4
- {AI05-0027-1AI05-0027-1} Corrigendum: Corrected so that value
- conversions that are copies are the "associated object" for
- parameter passing of by-reference types. This can only happen
- if the conversion is between unrelated non-limited types, and
- it is necessary just so the correct object is defined.
+ {<AI05-0027-1AI05-0027-1>} Corrigendum: Corrected so that
+ value conversions that are copies are the "associated object"
+ for parameter passing of by-reference types. This can only
+ happen if the conversion is between unrelated non-limited
+ types, and it is necessary just so the correct object is
+ defined.
File: aarm2012.info, Node: 6.3, Next: 6.4, Prev: 6.2, Up: 6
@@ -31630,7 +31736,7 @@ File: aarm2012.info, Node: 6.3, Next: 6.4, Prev:
6.2, Up: 6
_Syntax_
2/3
- {AI95-00218-03AI95-00218-03} {AI05-0183-1AI05-0183-1}
+ {<AI95-00218-03AI95-00218-03>} {<AI05-0183-1AI05-0183-1>}
subprogram_body ::=
[overriding_indicator]
subprogram_specification
@@ -31652,8 +31758,7 @@ completion of a previous declaration[, in which case
the body declares
the subprogram]. If the body is a completion, it shall be the
completion of a subprogram_declaration or
generic_subprogram_declaration. The profile of a subprogram_body that
-completes a declaration shall conform fully to that of the declaration.
-
+completes a declaration shall conform fully to that of the declaration.
_Static Semantics_
5
@@ -31683,7 +31788,7 @@ handled_sequence_of_statements is then executed.
_Examples_
8
-Example of procedure body:
+<Example of procedure body:>
9
procedure Push(E : in Element_Type; S : in out Stack) is
@@ -31697,7 +31802,7 @@ Example of procedure body:
end Push;
10
-Example of a function body:
+<Example of a function body:>
11
function Dot_Product(Left, Right : Vector) return Real is
@@ -31737,14 +31842,14 @@ Example of a function body:
_Wording Changes from Ada 95_
11.f/2
- {AI95-00218-03AI95-00218-03} Overriding_indicator is added to
- subprogram_body.
+ {<AI95-00218-03AI95-00218-03>} Overriding_indicator is added
+ to subprogram_body.
_Extensions to Ada 2005_
11.g/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a subprogram_body. This is described in *note
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a subprogram_body. This is described in *note
13.1.1::.
* Menu:
@@ -31766,17 +31871,18 @@ conformance, subtype conformance, or full
conformance.]
_Static Semantics_
2/1
-{8652/00118652/0011} {AI95-00117-01AI95-00117-01} [As explained in *note
-B.1::, "*note B.1:: Interfacing Aspects", a convention can be specified
-for an entity.] Unless this International Standard states otherwise,
-the default convention of an entity is Ada. [For a callable entity or
-access-to-subprogram type, the convention is called the calling
-convention.] The following conventions are defined by the language:
+{<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>} [As explained in
+*note B.1::, "*note B.1:: Interfacing Aspects", a <convention> can be
+specified for an entity.] Unless this International Standard states
+otherwise, the default convention of an entity is Ada. [For a callable
+entity or access-to-subprogram type, the convention is called the
+<calling convention>.] The following conventions are defined by the
+language:
3/3
- * {AI05-0229-1AI05-0229-1} The default calling convention for any
- subprogram not listed below is Ada. [The Convention aspect may be
- specified to override the default calling convention (see *note
+ * {<AI05-0229-1AI05-0229-1>} The default calling convention for any
+ subprogram not listed below is <Ada>. [The Convention aspect may
+ be specified to override the default calling convention (see *note
B.1::)].
3.a
@@ -31784,7 +31890,7 @@ convention.] The following conventions are defined by
the language:
*note 8.5.4::.
4
- * The Intrinsic calling convention represents subprograms that are
+ * The <Intrinsic> calling convention represents subprograms that are
"built in" to the compiler. The default calling convention is
Intrinsic for the following:
@@ -31824,19 +31930,19 @@ convention.] The following conventions are defined
by the language:
...
X: Formal := ...;
...
- Proc(X); -- This is a dispatching call in Instance, because
- -- the actual type for Formal is class-wide.
+ Proc(X); -- <This is a dispatching call in Instance,
because>
+ -- <the actual type for Formal is class-wide.>
...
- -- Proc'Access would be illegal here, because it is of
- -- convention Intrinsic, by the above rule.
+ -- <Proc'Access would be illegal here, because it is of>
+ -- <convention Intrinsic, by the above rule.>
end G;
8.a.5/1
type Actual is new Root with ...;
procedure Proc(X: Actual);
package Instance is new G(Formal => Actual'Class);
- -- It is legal to pass in a class-wide actual, because
Formal
- -- has unknown discriminants.
+ -- <It is legal to pass in a class-wide actual, because
Formal>
+ -- <has unknown discriminants.>
8.a.6/1
Within Instance, all calls to Proc will be dispatching calls,
@@ -31849,15 +31955,15 @@ convention.] The following conventions are defined
by the language:
* an attribute that is a subprogram;
10/2
- * {AI95-00252-01AI95-00252-01} a subprogram declared
+ * {<AI95-00252-01AI95-00252-01>} a subprogram declared
immediately within a protected_body;
10.1/4
- * {AI95-00252-01AI95-00252-01} {AI95-00407-01AI95-00407-01}
- {AI12-0107-1AI12-0107-1} any prefixed view of a
- subprogram (see *note 4.1.3::) without synchronization
- kind (see *note 9.5::) By_Entry or
- By_Protected_Procedure.
+ * {<AI95-00252-01AI95-00252-01>}
+ {<AI95-00407-01AI95-00407-01>} {<AI12-0107-1AI12-0107-1>}
+ any prefixed view of a subprogram (see *note 4.1.3::)
+ without synchronization kind (see *note 9.5::) By_Entry
+ or By_Protected_Procedure.
10.a/2
Reason: The profile of a prefixed view is different than the
@@ -31866,7 +31972,7 @@ convention.] The following conventions are defined by
the language:
as that would require generating a wrapper of some sort.
10.b/4
- {AI12-0107-1AI12-0107-1} We except prefixed views that have
+ {<AI12-0107-1AI12-0107-1>} We except prefixed views that have
synchronization kind By_Protected_Procedure so that they can
be used with an access-to-protected-procedure type. These
don't require special wrappers (this is the normal form for a
@@ -31885,7 +31991,7 @@ convention.] The following conventions are defined by
the language:
to generate an out of line body for an intrinsic.
11.b/3
- {AI05-0229-1AI05-0229-1} Whenever we wish to disallow the
+ {<AI05-0229-1AI05-0229-1>} Whenever we wish to disallow the
Access attribute in order to ease implementation, we make the
subprogram Intrinsic. Several language-defined subprograms
have "with Convention => Intrinsic;". An implementation might
@@ -31898,7 +32004,7 @@ convention.] The following conventions are defined by
the language:
Subprograms declared in protected_bodies will generally have a
special calling convention so as to pass along the
identification of the current instance of the protected type.
- The convention is not protected since such local subprograms
+ The convention is not <protected> since such local subprograms
need not contain any "locking" logic since they are not
callable via "external" calls; this rule prevents an access
value designating such a subprogram from being passed outside
@@ -31910,22 +32016,22 @@ convention.] The following conventions are defined
by the language:
the inherited subprograms of untagged types.
12/4
- * {AI12-0107-1AI12-0107-1} {AI12-0159-1AI12-0159-1} The default
- calling convention is protected for a protected subprogram, for a
+ * {<AI12-0107-1AI12-0107-1>} {<AI12-0159-1AI12-0159-1>} The default
+ calling convention is <protected> for a protected subprogram, for a
prefixed view of a subprogram with a synchronization kind of
By_Protected_Procedure, and for an access-to-subprogram type with
the reserved word protected in its definition.
13/4
- * {AI12-0107-1AI12-0107-1} {AI12-0159-1AI12-0159-1} The default
- calling convention is entry for an entry and for a prefixed view of
- a subprogram with a synchronization kind of By_Entry.
+ * {<AI12-0107-1AI12-0107-1>} {<AI12-0159-1AI12-0159-1>} The default
+ calling convention is <entry> for an entry and for a prefixed view
+ of a subprogram with a synchronization kind of By_Entry.
13.1/3
- * {AI95-00254-01AI95-00254-01} {AI95-00409-01AI95-00409-01}
- {AI05-0264-1AI05-0264-1} The calling convention for an anonymous
+ * {<AI95-00254-01AI95-00254-01>} {<AI95-00409-01AI95-00409-01>}
+ {<AI05-0264-1AI05-0264-1>} The calling convention for an anonymous
access-to-subprogram parameter or anonymous access-to-subprogram
- result is protected if the reserved word protected appears in its
+ result is <protected> if the reserved word protected appears in its
definition; otherwise, it is the convention of the subprogram that
contains the parameter.
@@ -31934,12 +32040,12 @@ convention.] The following conventions are defined
by the language:
access-to-subprogram types is Ada.
13.2/1
- * {8652/00118652/0011} {AI95-00117-01AI95-00117-01} [If not specified
- above as Intrinsic, the calling convention for any inherited or
- overriding dispatching operation of a tagged type is that of the
- corresponding subprogram of the parent type.] The default calling
- convention for a new dispatching operation of a tagged type is the
- convention of the type.
+ * {<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>} [If not
+ specified above as Intrinsic, the calling convention for any
+ inherited or overriding dispatching operation of a tagged type is
+ that of the corresponding subprogram of the parent type.] The
+ default calling convention for a new dispatching operation of a
+ tagged type is the convention of the type.
13.a.1/1
Reason: The first rule is officially stated in *note 3.9.2::.
@@ -31948,25 +32054,26 @@ convention.] The following conventions are defined
by the language:
operations all have the same convention.
14/3
-{AI05-0229-1AI05-0229-1} Of these four conventions, only Ada and
-Intrinsic are allowed as a convention_identifier in the specification of
-a Convention aspect.
+{<AI05-0229-1AI05-0229-1>} Of these four conventions, only Ada and
+Intrinsic are allowed as a <convention_>identifier in the specification
+of a Convention aspect.
14.a/3
- Discussion: {AI05-0229-1AI05-0229-1} The names of the
- protected and entry calling conventions cannot be used in the
- specification of Convention. Note that protected and entry
- are reserved words.
+ Discussion: {<AI05-0229-1AI05-0229-1>} The names of the
+ <protected> and <entry> calling conventions cannot be used in
+ the specification of Convention. Note that protected and
+ entry are reserved words.
15/2
-{AI95-00409-01AI95-00409-01} Two profiles are type conformant if they
-have the same number of parameters, and both have a result if either
-does, and corresponding parameter and result types are the same, or, for
-access parameters or access results, corresponding designated types are
-the same, or corresponding designated profiles are type conformant.
+{<AI95-00409-01AI95-00409-01>} Two profiles are <type conformant> if
+they have the same number of parameters, and both have a result if
+either does, and corresponding parameter and result types are the same,
+or, for access parameters or access results, corresponding designated
+types are the same, or corresponding designated profiles are type
+conformant.
15.a/2
- Discussion: {AI95-00409-01AI95-00409-01} For anonymous
+ Discussion: {<AI95-00409-01AI95-00409-01>} For anonymous
access-to-object parameters, the designated types have to be
the same for type conformance, not the access types, since in
general each access parameter has its own anonymous access
@@ -31975,56 +32082,57 @@ the same, or corresponding designated profiles are
type conformant.
parameters or both not access parameters.
15.b/2
- {AI95-00409-01AI95-00409-01} Similarly, for anonymous
+ {<AI95-00409-01AI95-00409-01>} Similarly, for anonymous
access-to-subprogram parameters, the designated profiles of
the types, not the types themselves, have to be conformant.
16/3
-{AI95-00318-02AI95-00318-02} {AI95-00409-01AI95-00409-01}
-{AI05-0142-4AI05-0142-4} Two profiles are mode conformant if:
+{<AI95-00318-02AI95-00318-02>} {<AI95-00409-01AI95-00409-01>}
+{<AI05-0142-4AI05-0142-4>} Two profiles are <mode conformant> if:
16.1/3
- * {AI05-0142-4AI05-0142-4} {AI05-0262-1AI05-0262-1} they are type
+ * {<AI05-0142-4AI05-0142-4>} {<AI05-0262-1AI05-0262-1>} they are type
conformant; and
16.2/3
- * {AI05-0142-4AI05-0142-4} corresponding parameters have identical
+ * {<AI05-0142-4AI05-0142-4>} corresponding parameters have identical
modes and both or neither are explicitly aliased parameters; and
16.3/3
- * {AI05-0207-1AI05-0207-1} for corresponding access parameters and
+ * {<AI05-0207-1AI05-0207-1>} for corresponding access parameters and
any access result type, the designated subtypes statically match
and either both or neither are access-to-constant, or the
- designated profiles are subtype conformant.
+ designated profiles are subtype conformant.
17/3
-{AI05-0239-1AI05-0239-1} Two profiles are subtype conformant if they are
-mode conformant, corresponding subtypes of the profile statically match,
-and the associated calling conventions are the same. The profile of a
-generic formal subprogram is not subtype conformant with any other
-profile.
+{<AI05-0239-1AI05-0239-1>} Two profiles are <subtype conformant> if they
+are mode conformant, corresponding subtypes of the profile statically
+match, and the associated calling conventions are the same. The profile
+of a generic formal subprogram is not subtype conformant with any other
+profile.
17.a
Ramification:
18/3
-{AI05-0134-1AI05-0134-1} {AI05-0262-1AI05-0262-1} Two profiles are fully
-conformant if they are subtype conformant, if they have
+{<AI05-0134-1AI05-0134-1>} {<AI05-0262-1AI05-0262-1>} Two profiles are
+<fully conformant> if they are subtype conformant, if they have
access-to-subprogram results whose designated profiles are fully
conformant, and for corresponding parameters:
18.1/3
- * {AI05-0262-1AI05-0262-1} they have the same names; and
+ * {<AI05-0262-1AI05-0262-1>} they have the same names; and
18.2/3
- * {AI05-0046-1AI05-0046-1} both or neither have null_exclusions; and
+ * {<AI05-0046-1AI05-0046-1>} both or neither have null_exclusions;
+ and
18.3/3
* neither have default_expressions, or they both have
default_expressions that are fully conformant with one another; and
18.4/3
- * {AI05-0134-1AI05-0134-1} for access-to-subprogram parameters, the
+ * {<AI05-0134-1AI05-0134-1>} for access-to-subprogram parameters, the
designated profiles are fully conformant.
18.a
@@ -32034,22 +32142,22 @@ conformant, and for corresponding parameters:
or entry are always the same by definition.
18.b/3
- Reason: {AI05-0046-1AI05-0046-1} The part about
+ Reason: {<AI05-0046-1AI05-0046-1>} The part about
null_exclusions is necessary to prevent controlling parameters
from having different exclusions, as such a parameter is
defined to exclude null whether or not an exclusion is given.
18.c/3
- {AI05-0134-1AI05-0134-1} The parts about access-to-subprogram
- parameters and results is necessary to prevent such types from
- having different default_expressions in the specification and
- body of a subprogram. If that was allowed, it would be
- undefined which default_expression was used in a call of an
- access-to-subprogram parameter.
+ {<AI05-0134-1AI05-0134-1>} The parts about
+ access-to-subprogram parameters and results is necessary to
+ prevent such types from having different default_expressions
+ in the specification and body of a subprogram. If that was
+ allowed, it would be undefined which default_expression was
+ used in a call of an access-to-subprogram parameter.
19
-Two expressions are fully conformant if, [after replacing each use of an
-operator with the equivalent function_call:]
+Two expressions are <fully conformant> if, [after replacing each use of
+an operator with the equivalent function_call:]
20
* each constituent construct of one corresponds to an instance of the
@@ -32058,11 +32166,11 @@ operator with the equivalent function_call:]
different expanded name in the other; and
20.1/4
- * {AI12-0050-1AI12-0050-1} corresponding defining_identifiers
+ * {<AI12-0050-1AI12-0050-1>} corresponding defining_identifiers
occurring within the two expressions are the same; and
21/4
- * {AI12-0050-1AI12-0050-1} each direct_name, character_literal, and
+ * {<AI12-0050-1AI12-0050-1>} each direct_name, character_literal, and
selector_name that is not part of the prefix of an expanded name in
one denotes the same declaration as the corresponding direct_name,
character_literal, or selector_name in the other, or they denote
@@ -32090,7 +32198,7 @@ operator with the equivalent function_call:]
end A;
21.c.1/3
- {AI05-0005-1AI05-0005-1} with A;
+ {<AI05-0005-1AI05-0005-1>} with A;
package B is
package A_View renames A;
function F_View(X : Integer := 9999) return Boolean renames
A.F;
@@ -32108,7 +32216,7 @@ operator with the equivalent function_call:]
different default_expressions.
21.f/4
- Discussion: {AI12-0050-1AI12-0050-1} We talk about
+ Discussion: {<AI12-0050-1AI12-0050-1>} We talk about
defining_identifiers and "corresponding declarations" because
of the possibility of iterator_specifications occurring within
the expressions; each iterator_specification is a separate
@@ -32116,8 +32224,8 @@ operator with the equivalent function_call:]
that the defining_identifiers are the same.
21.1/3
- * {8652/00188652/0018} {AI95-00175-01AI95-00175-01}
- {AI05-0092-1AI05-0092-1} each attribute_designator in one is the
+ * {<8652/00188652/0018>} {<AI95-00175-01AI95-00175-01>}
+ {<AI05-0092-1AI05-0092-1>} each attribute_designator in one is the
same as the corresponding attribute_designator in the other; and
22
@@ -32132,20 +32240,20 @@ operator with the equivalent function_call:]
conformance a transitive relation.
23
-Two known_discriminant_parts are fully conformant if they have the same
-number of discriminants, and discriminants in the same positions have
-the same names, statically matching subtypes, and default_expressions
-that are fully conformant with one another.
+Two known_discriminant_parts are <fully conformant> if they have the
+same number of discriminants, and discriminants in the same positions
+have the same names, statically matching subtypes, and
+default_expressions that are fully conformant with one another.
24
-Two discrete_subtype_definitions are fully conformant if they are both
+Two discrete_subtype_definitions are <fully conformant> if they are both
subtype_indications or are both ranges, the subtype_marks (if any)
denote the same subtype, and the corresponding simple_expressions of the
ranges (if any) fully conform.
24.a
Ramification: In the subtype_indication case, any ranges have
- to be corresponding; that is, two subtype_indications cannot
+ to <be> corresponding; that is, two subtype_indications cannot
conform unless both or neither has a range.
24.b
@@ -32156,12 +32264,13 @@ ranges (if any) fully conform.
corresponding entry_index_specification of the entry_body.
24.1/2
-{AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01} The prefixed
-view profile of a subprogram is the profile obtained by omitting the
-first parameter of that subprogram. There is no prefixed view profile
-for a parameterless subprogram. For the purposes of defining subtype
-and mode conformance, the convention of a prefixed view profile is
-considered to match that of either an entry or a protected operation.
+{<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>} The
+<prefixed view profile> of a subprogram is the profile obtained by
+omitting the first parameter of that subprogram. There is no prefixed
+view profile for a parameterless subprogram. For the purposes of
+defining subtype and mode conformance, the convention of a prefixed view
+profile is considered to match that of either an entry or a protected
+operation.
24.c/2
Discussion: This definition is used to define how primitive
@@ -32193,39 +32302,39 @@ library unit to be intrinsic.
_Wording Changes from Ada 95_
25.b/2
- {8652/00118652/0011} {AI95-00117-01AI95-00117-01} Corrigendum:
- Clarified that the default convention is Ada. Also clarified
- that the convention of a primitive operation of a tagged type
- is the same as that of the type.
+ {<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>}
+ Corrigendum: Clarified that the default convention is Ada.
+ Also clarified that the convention of a primitive operation of
+ a tagged type is the same as that of the type.
25.c/2
- {8652/00188652/0018} {AI95-00175-01AI95-00175-01} Corrigendum:
- Added wording to ensure that two attributes conform only if
- they have the same attribute_designator.
+ {<8652/00188652/0018>} {<AI95-00175-01AI95-00175-01>}
+ Corrigendum: Added wording to ensure that two attributes
+ conform only if they have the same attribute_designator.
25.d/2
- {AI95-00252-01AI95-00252-01} {AI95-00254-01AI95-00254-01}
- {AI95-00407-01AI95-00407-01} Defined the calling convention
+ {<AI95-00252-01AI95-00252-01>} {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00407-01AI95-00407-01>} Defined the calling convention
for anonymous access-to-subprogram types and for prefixed
views of subprograms (see *note 4.1.3::).
25.e/2
- {AI95-00318-02AI95-00318-02} Defined the conformance of access
- result types (see *note 6.1::).
+ {<AI95-00318-02AI95-00318-02>} Defined the conformance of
+ access result types (see *note 6.1::).
25.f/2
- {AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01}
+ {<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>}
Defined the prefixed view profile of subprograms for later
use.
25.g/2
- {AI95-00409-01AI95-00409-01} Defined the conformance of
+ {<AI95-00409-01AI95-00409-01>} Defined the conformance of
anonymous access-to-subprogram parameters.
_Incompatibilities With Ada 2005_
25.h/3
- {AI05-0046-1AI05-0046-1} Correction: Now require
+ {<AI05-0046-1AI05-0046-1>} Correction: Now require
null_exclusions to match for full conformance. While this is
technically incompatible with Ada 2005 as defined by Amendment
1, it is a new Ada 2005 feature and it is unlikely that users
@@ -32234,7 +32343,7 @@ library unit to be intrinsic.
add a null_exclusion where needed for conformance.
25.i/3
- {AI05-0134-1AI05-0134-1} Correction: Now require full
+ {<AI05-0134-1AI05-0134-1>} Correction: Now require full
conformance of anonymous access-to-subprogram parameters and
results for full conformance. This is necessary so that there
is no confusion about the default expression that is used for
@@ -32246,37 +32355,37 @@ library unit to be intrinsic.
don't conform so that they do conform.
25.j/3
- {AI05-0207-1AI05-0207-1} Correction: Now include the presence
- or absence of constant in access parameters to be considered
- when checking mode conformance. This is necessary to prevent
- modification of constants. While this is technically
- incompatible with Ada 2005 as defined by Amendment 1, it is a
- new Ada 2005 feature and it is unlikely that users have been
- intentionally taking advantage and writing mismatching access
- types.
+ {<AI05-0207-1AI05-0207-1>} Correction: Now include the
+ presence or absence of constant in access parameters to be
+ considered when checking mode conformance. This is necessary
+ to prevent modification of constants. While this is
+ technically incompatible with Ada 2005 as defined by Amendment
+ 1, it is a new Ada 2005 feature and it is unlikely that users
+ have been intentionally taking advantage and writing
+ mismatching access types.
_Wording Changes from Ada 2005_
25.k/3
- {AI05-0142-4AI05-0142-4} Explicitly aliased parameters are
+ {<AI05-0142-4AI05-0142-4>} Explicitly aliased parameters are
included as part of mode conformance (since it affects the
parameter passing mechanism).
_Extensions to Ada 2012_
25.l/4
- {AI05-0107-1AI05-0107-1} {AI05-0159-1AI05-0159-1} Corrigendum:
- We now define that a prefixed view of a subprogram with
- synchronization kind By_Protected_Procedure can be used as the
- prefix of 'Access for an access-to-protected type. We
- consider this a correction as it certainly appears that it
- ought to work, but in original Ada 2012 it would have had a
- convention mismatch.
+ {<AI05-0107-1AI05-0107-1>} {<AI05-0159-1AI05-0159-1>}
+ Corrigendum: We now define that a prefixed view of a
+ subprogram with synchronization kind By_Protected_Procedure
+ can be used as the prefix of 'Access for an
+ access-to-protected type. We consider this a correction as it
+ certainly appears that it ought to work, but in original Ada
+ 2012 it would have had a convention mismatch.
_Wording Changes from Ada 2012_
25.m/4
- {AI05-0050-1AI05-0050-1} Corrigendum: We now define how two
+ {<AI05-0050-1AI05-0050-1>} Corrigendum: We now define how two
expressions containing quantified expressions can fully
conform. This isn't incompatible, as the original Ada 2012
never allowed such expressions to conform (the declarations in
@@ -32292,14 +32401,15 @@ File: aarm2012.info, Node: 6.3.2, Prev: 6.3.1, Up:
6.3
1
[Subprograms may be expanded in line at the call site.]
-Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
5/3
-{AI05-0229-1AI05-0229-1} For a callable entity or a generic subprogram,
-the following language-defined representation aspect may be specified:
+{<AI05-0229-1AI05-0229-1>} For a callable entity or a generic
+subprogram, the following language-defined representation aspect may be
+specified:
5.1/3
Inline
@@ -32320,16 +32430,16 @@ Inline
are requested for a subprogram.
5.b/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
5.c/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
5.d/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
5.e/3
- Ramification: {AI05-0229-1AI05-0229-1} The meaning of a
+ Ramification: {<AI05-0229-1AI05-0229-1>} The meaning of a
subprogram can be changed by inline expansion as requested by
aspect Inline only in the presence of failing checks (see
*note 11.6::).
@@ -32337,7 +32447,7 @@ Inline
_Implementation Permissions_
6/3
-{AI05-0229-1AI05-0229-1} For each call, an implementation is free to
+{<AI05-0229-1AI05-0229-1>} For each call, an implementation is free to
follow or to ignore the recommendation determined by the Inline aspect.
6.a
@@ -32351,24 +32461,24 @@ follow or to ignore the recommendation determined by
the Inline aspect.
_Incompatibilities With Ada 83_
7.a/3
- This paragraph was deleted.{AI95-00309-01AI95-00309-01}
- {AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI95-00309-01AI95-00309-01>}
+ {<AI05-0229-1AI05-0229-1>}
_Extensions to Ada 83_
7.b/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
_Extensions to Ada 95_
7.c/3
- This paragraph was deleted.{AI95-00309-01AI95-00309-01}
- {AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI95-00309-01AI95-00309-01>}
+ {<AI05-0229-1AI05-0229-1>}
_Extensions to Ada 2005_
7.d/3
- {AI05-0229-1AI05-0229-1} Aspect Inline is new; pragma Inline
+ {<AI05-0229-1AI05-0229-1>} Aspect Inline is new; pragma Inline
is now obsolescent.
@@ -32378,7 +32488,7 @@ File: aarm2012.info, Node: 6.4, Next: 6.5, Prev:
6.3, Up: 6
====================
1
-A subprogram call is either a procedure_call_statement or a
+A <subprogram call> is either a procedure_call_statement or a
function_call; [it invokes the execution of the subprogram_body. The
call specifies the association of the actual parameters, if any, with
formal parameters of the subprogram.]
@@ -32387,16 +32497,16 @@ formal parameters of the subprogram.]
2
procedure_call_statement ::=
- procedure_name;
- | procedure_prefix actual_parameter_part;
+ <procedure_>name;
+ | <procedure_>prefix actual_parameter_part;
3
function_call ::=
- function_name
- | function_prefix actual_parameter_part
+ <function_>name
+ | <function_>prefix actual_parameter_part
3.a/3
- To be honest: {AI05-0005-1AI05-0005-1} For the purpose of
+ To be honest: {<AI05-0005-1AI05-0005-1>} For the purpose of
non-syntax rules, infix operator calls are considered
function_calls. See *note 6.6::.
@@ -32406,17 +32516,18 @@ formal parameters of the subprogram.]
5
parameter_association ::=
- [formal_parameter_selector_name =>] explicit_actual_parameter
+ [<formal_parameter_>selector_name =>] explicit_actual_parameter
6
- explicit_actual_parameter ::= expression | variable_name
+ explicit_actual_parameter ::= expression | <variable_>name
7
- A parameter_association is named or positional according to whether
- or not the formal_parameter_selector_name (*note 4.1.3: S0099.) is
- specified. Any positional associations shall precede any named
- associations. Named associations are not allowed if the prefix in
- a subprogram call is an attribute_reference (*note 4.1.4: S0100.).
+ A parameter_association is <named> or <positional> according to
+ whether or not the <formal_parameter_>selector_name (*note 4.1.3:
+ S0099.) is specified. Any positional associations shall precede
+ any named associations. Named associations are not allowed if the
+ prefix in a subprogram call is an attribute_reference (*note 4.1.4:
+ S0100.).
7.a
Ramification: This means that the formal parameter names used
@@ -32426,7 +32537,7 @@ formal parameters of the subprogram.]
_Name Resolution Rules_
8/2
-{AI95-00310-01AI95-00310-01} The name or prefix given in a
+{<AI95-00310-01AI95-00310-01>} The name or prefix given in a
procedure_call_statement shall resolve to denote a callable entity that
is a procedure, or an entry renamed as (viewed as) a procedure. The
name or prefix given in a function_call shall resolve to denote a
@@ -32437,9 +32548,10 @@ S0180.), the prefix can be an implicit_dereference
(*note 4.1: S0095.)
of an access-to-subprogram value.]
8.a.1/2
- Discussion: {AI95-00310-01AI95-00310-01} This rule is talking
- about dispatching operations (which is a static concept) and
- not about dispatching calls (which is a dynamic concept).
+ Discussion: {<AI95-00310-01AI95-00310-01>} This rule is
+ talking about dispatching operations (which is a static
+ concept) and not about dispatching calls (which is a dynamic
+ concept).
8.a
Ramification: The function can be an operator, enumeration
@@ -32452,22 +32564,23 @@ default_expression (in the profile of the view
denoted by the name or
prefix). [This rule is an overloading rule (see *note 8.6::).]
9.a/3
- Proof: {AI05-0240-1AI05-0240-1} All Name Resolution Rules are
- overloading rules, see *note 8.6::.
+ Proof: {<AI05-0240-1AI05-0240-1>} All Name Resolution Rules
+ are overloading rules, see *note 8.6::.
_Dynamic Semantics_
10/2
-{AI95-00345-01AI95-00345-01} For the execution of a subprogram call, the
-name or prefix of the call is evaluated, and each parameter_association
-(*note 6.4: S0181.) is evaluated (see *note 6.4.1::). If a
-default_expression (*note 3.7: S0063.) is used, an implicit
-parameter_association (*note 6.4: S0181.) is assumed for this rule.
-These evaluations are done in an arbitrary order. The subprogram_body
-(*note 6.3: S0177.) is then executed, or a call on an entry or protected
-subprogram is performed (see *note 3.9.2::). Finally, if the subprogram
-completes normally, then after it is left, any necessary assigning back
-of formal to actual parameters occurs (see *note 6.4.1::).
+{<AI95-00345-01AI95-00345-01>} For the execution of a subprogram call,
+the name or prefix of the call is evaluated, and each
+parameter_association (*note 6.4: S0181.) is evaluated (see *note
+6.4.1::). If a default_expression (*note 3.7: S0063.) is used, an
+implicit parameter_association (*note 6.4: S0181.) is assumed for this
+rule. These evaluations are done in an arbitrary order. The
+subprogram_body (*note 6.3: S0177.) is then executed, or a call on an
+entry or protected subprogram is performed (see *note 3.9.2::).
+Finally, if the subprogram completes normally, then after it is left,
+any necessary assigning back of formal to actual parameters occurs (see
+*note 6.4.1::).
10.a
Discussion: The implicit association for a default is only for
@@ -32488,15 +32601,15 @@ of formal to actual parameters occurs (see *note
6.4.1::).
9.5.3::, "*note 9.5.3:: Entry Calls".
10.d.1/2
- {AI95-00345-01AI95-00345-01} If the subprogram is implemented
- by an entry or protected subprogram, it will be treated as a
- dispatching call to the corresponding entry (see *note
- 9.5.3::, "*note 9.5.3:: Entry Calls") or protected subprogram
- (see *note 9.5.1::, "*note 9.5.1:: Protected Subprograms and
- Protected Actions").
+ {<AI95-00345-01AI95-00345-01>} If the subprogram is
+ implemented by an entry or protected subprogram, it will be
+ treated as a dispatching call to the corresponding entry (see
+ *note 9.5.3::, "*note 9.5.3:: Entry Calls") or protected
+ subprogram (see *note 9.5.1::, "*note 9.5.1:: Protected
+ Subprograms and Protected Actions").
10.e/2
- {AI95-00348-01AI95-00348-01} Normally, the subprogram_body
+ {<AI95-00348-01AI95-00348-01>} Normally, the subprogram_body
that is executed by the above rule is the one for the
subprogram being called. For an enumeration literal,
implicitly declared (but noninherited) subprogram, null
@@ -32506,8 +32619,8 @@ of formal to actual parameters occurs (see *note
6.4.1::).
which subprogram_body is executed.
10.1/2
-{AI95-00407-01AI95-00407-01} If the name or prefix of a subprogram call
-denotes a prefixed view (see *note 4.1.3::), the subprogram call is
+{<AI95-00407-01AI95-00407-01>} If the name or prefix of a subprogram
+call denotes a prefixed view (see *note 4.1.3::), the subprogram call is
equivalent to a call on the underlying subprogram, with the first actual
parameter being provided by the prefix of the prefixed view (or the
Access attribute of this prefix if the first formal parameter is an
@@ -32515,7 +32628,7 @@ access parameter), and the remaining actual parameters
given by the
actual_parameter_part, if any.
11/2
-{AI95-00318-02AI95-00318-02} The exception Program_Error is raised at
+{<AI95-00318-02AI95-00318-02>} The exception Program_Error is raised at
the point of a function_call if the function completes normally without
executing a return statement.
@@ -32530,34 +32643,34 @@ executing a return statement.
(since it can usually be statically eliminated as dead code).
12/2
-{AI95-00231-01AI95-00231-01} A function_call denotes a constant, as
+{<AI95-00231-01AI95-00231-01>} A function_call denotes a constant, as
defined in *note 6.5::; the nominal subtype of the constant is given by
-the nominal subtype of the function result.
+the nominal subtype of the function result.
_Examples_
13
-Examples of procedure calls:
+<Examples of procedure calls:>
14
- Traverse_Tree; -- see
*note 6.1::
- Print_Header(128, Title, True); -- see
*note 6.1::
+ Traverse_Tree; --< see
*note 6.1::>
+ Print_Header(128, Title, True); --< see
*note 6.1::>
15
- Switch(From => X, To => Next); -- see
*note 6.1::
- Print_Header(128, Header => Title, Center => True); -- see
*note 6.1::
- Print_Header(Header => Title, Center => True, Pages => 128); -- see
*note 6.1::
+ Switch(From => X, To => Next); --< see
*note 6.1::>
+ Print_Header(128, Header => Title, Center => True); --< see
*note 6.1::>
+ Print_Header(Header => Title, Center => True, Pages => 128); --< see
*note 6.1::>
16
-Examples of function calls:
+<Examples of function calls:>
17
- Dot_Product(U, V) -- see *note 6.1:: and *note 6.3::
- Clock -- see *note 9.6::
- F.all -- presuming F is of an access-to-subprogram type --
see *note 3.10::
+ Dot_Product(U, V) --< see *note 6.1:: and *note 6.3::>
+ Clock --< see *note 9.6::>
+ F.all --< presuming F is of an access-to-subprogram type
-- see *note 3.10::>
18
-Examples of procedures with default expressions:
+<Examples of procedures with default expressions:>
19
procedure Activate(Process : in Process_Name;
@@ -32566,10 +32679,10 @@ Examples of procedures with default expressions:
Prior : in Boolean := False);
20/3
- {AI05-0299-1AI05-0299-1} procedure Pair(Left, Right : in Person_Name :=
new Person(M)); -- see *note 3.10.1::
+ {<AI05-0299-1AI05-0299-1>} procedure Pair(Left, Right : in Person_Name :=
new Person(M)); --< see *note 3.10.1::>
21
-Examples of their calls:
+<Examples of their calls:>
22
Activate(X);
@@ -32578,7 +32691,7 @@ Examples of their calls:
Activate(X, Y, 10.0, False);
23/3
- {AI05-0299-1AI05-0299-1} Pair;
+ {<AI05-0299-1AI05-0299-1>} Pair;
Pair(Left => new Person(F), Right => new Person(M));
NOTES
@@ -32593,7 +32706,7 @@ Examples of their calls:
_Examples_
25
-Examples of overloaded subprograms:
+<Examples of overloaded subprograms:>
26
procedure Put(X : in Integer);
@@ -32604,7 +32717,7 @@ Examples of overloaded subprograms:
procedure Set(Signal : in Light);
28
-Examples of their calls:
+<Examples of their calls:>
29
Put(28);
@@ -32616,8 +32729,8 @@ Examples of their calls:
Set(Color'(Red));
31
- -- Set(Red) would be ambiguous since Red may
- -- denote a value either of type Color or of type Light
+ --< Set(Red) would be ambiguous since Red may>
+ --< denote a value either of type Color or of type Light>
_Wording Changes from Ada 83_
@@ -32638,7 +32751,7 @@ Examples of their calls:
_Extensions to Ada 95_
31.d/2
- {AI95-00310-01AI95-00310-01} Nondispatching abstract
+ {<AI95-00310-01AI95-00310-01>} Nondispatching abstract
operations are no longer considered when resolving a
subprogram call. That makes it possible to use abstract to
"undefine" a predefined operation for an untagged type.
@@ -32648,19 +32761,19 @@ Examples of their calls:
_Wording Changes from Ada 95_
31.e/2
- {AI95-00231-01AI95-00231-01} Changed the definition of the
+ {<AI95-00231-01AI95-00231-01>} Changed the definition of the
nominal subtype of a function_call to use the nominal subtype
wording of *note 6.1::, to take into account null_exclusions
and access result types.
31.f/2
- {AI95-00345-01AI95-00345-01} Added wording to clarify that the
- meaning of a call on a subprogram "implemented by" an entry or
- protected operation is defined by *note 3.9.2::.
+ {<AI95-00345-01AI95-00345-01>} Added wording to clarify that
+ the meaning of a call on a subprogram "implemented by" an
+ entry or protected operation is defined by *note 3.9.2::.
31.g/2
- {AI95-00407-01AI95-00407-01} Defined the meaning of a call on
- a prefixed view of a subprogram (see *note 4.1.3::).
+ {<AI95-00407-01AI95-00407-01>} Defined the meaning of a call
+ on a prefixed view of a subprogram (see *note 4.1.3::).
* Menu:
@@ -32685,9 +32798,9 @@ parameter and a formal parameter.]
being passed as an out parameter.
1.b/3
- {AI05-0142-4AI05-0142-4} For explicitly aliased parameters of
- functions, we will ensure at the call site that a part of the
- parameter can be returned as part of the function result
+ {<AI05-0142-4AI05-0142-4>} For explicitly aliased parameters
+ of functions, we will ensure at the call site that a part of
+ the parameter can be returned as part of the function result
without creating a dangling pointer. We do this with
accessibility checks at the call site that all actual objects
of explicitly aliased parameters live at least as long as the
@@ -32698,25 +32811,25 @@ parameter and a formal parameter.]
_Name Resolution Rules_
2/3
-{AI05-0118-1AI05-0118-1} The formal_parameter_selector_name of a named
-parameter_association (*note 6.4: S0181.) shall resolve to denote a
-parameter_specification (*note 6.1: S0175.) of the view being called;
+{<AI05-0118-1AI05-0118-1>} The <formal_parameter_>selector_name of a
+named parameter_association (*note 6.4: S0181.) shall resolve to denote
+a parameter_specification (*note 6.1: S0175.) of the view being called;
this is the formal parameter of the association. The formal parameter
for a positional parameter_association (*note 6.4: S0181.) is the
parameter with the corresponding position in the formal part of the view
being called.
2.a/3
- To be honest: {AI05-0118-1AI05-0118-1} For positional
+ To be honest: {<AI05-0118-1AI05-0118-1>} For positional
parameters, the "corresponding position" is calculated after
any transformation of prefixed views.
3
-The actual parameter is either the explicit_actual_parameter given in a
-parameter_association for a given formal parameter, or the corresponding
-default_expression if no parameter_association is given for the formal
-parameter. The expected type for an actual parameter is the type of the
-corresponding formal parameter.
+The <actual parameter> is either the explicit_actual_parameter given in
+a parameter_association for a given formal parameter, or the
+corresponding default_expression if no parameter_association is given
+for the formal parameter. The expected type for an actual parameter is
+the type of the corresponding formal parameter.
3.a
To be honest: The corresponding default_expression is the one
@@ -32728,8 +32841,8 @@ If the mode is in, the actual is interpreted as an
expression;
otherwise, the actual is interpreted only as a name, if possible.
4.a/4
- Ramification: {AI12-0005-1AI12-0005-1} This formally resolves
- the ambiguity present in the syntax rule for
+ Ramification: {<AI12-0005-1AI12-0005-1>} This formally
+ resolves the ambiguity present in the syntax rule for
explicit_actual_parameter. This matters as an expression that
is a name is evaluated and represents a value while a name by
itself can be an object; if the mode is not in, we want the
@@ -32738,7 +32851,7 @@ otherwise, the actual is interpreted only as a name, if
possible.
in; we do that below.
4.b/4
- {AI12-0005-1AI12-0005-1} This wording uses "interpreted as"
+ {<AI12-0005-1AI12-0005-1>} This wording uses "interpreted as"
rather than "shall be" so that this rule is not used to
resolve overloading; it is solely about evaluation as
described above. We definitely do not want to allow oddities
@@ -32768,8 +32881,8 @@ variable.
procedure Print(X : in Integer; Y : in Boolean := True);
procedure Print(Z : in out Integer);
. . .
- Print(3); -- Ambiguous!
-
+ Print(3); --< Ambiguous!>
+
5.d
The above call to Print is ambiguous even though the call is
@@ -32780,10 +32893,10 @@ variable.
ambiguous.
5.1/4
-{AI12-0074-1AI12-0074-1} {AI12-0159-1AI12-0159-1} If the mode is out,
-the actual parameter is a view conversion, and the type of the formal
-parameter is an access type or a scalar type that has the Default_Value
-aspect specified, then
+{<AI12-0074-1AI12-0074-1>} {<AI12-0159-1AI12-0159-1>} If the mode is
+out, the actual parameter is a view conversion, and the type of the
+formal parameter is an access type or a scalar type that has the
+Default_Value aspect specified, then
5.2/4
* there shall exist a type (other than a root numeric type) that is
@@ -32794,7 +32907,7 @@ aspect specified, then
conversion shall have the Default_Value aspect specified.
5.4/4
-{AI12-0074-1AI12-0074-1} {AI12-0159-1AI12-0159-1} In addition to the
+{<AI12-0074-1AI12-0074-1>} {<AI12-0159-1AI12-0159-1>} In addition to the
places where Legality Rules normally apply (see *note 12.3::), these
rules also apply in the private part of an instance of a generic unit.
@@ -32803,18 +32916,18 @@ rules also apply in the private part of an instance
of a generic unit.
well-defined parameter value is passed.
6/3
-{AI05-0102-1AI05-0102-1} {AI05-0142-4AI05-0142-4} If the formal
+{<AI05-0102-1AI05-0102-1>} {<AI05-0142-4AI05-0142-4>} If the formal
parameter is an explicitly aliased parameter, the type of the actual
parameter shall be tagged or the actual parameter shall be an aliased
-view of an object. Further, if the formal parameter subtype F is
+view of an object. Further, if the formal parameter subtype <F> is
untagged:
6.1/3
- * the subtype F shall statically match the nominal subtype of the
+ * the subtype <F> shall statically match the nominal subtype of the
actual object; or
6.2/3
- * the subtype F shall be unconstrained, discriminated in its full
+ * the subtype <F> shall be unconstrained, discriminated in its full
view, and unconstrained in any partial view.
6.a/3
@@ -32835,24 +32948,24 @@ untagged:
require any additional implementation burden.
6.b.1/4
- Discussion: {AI12-0095-1AI12-0095-1} We assume the worst in a
- generic body whether or not a formal subtype has a constrained
- partial view; specifically, in a generic body a discriminated
- subtype is considered to have a constrained partial view if it
- is a descendant of an untagged generic formal private or
- derived type (see *note 12.5.1:: for the formal definition of
- this rule).
+ Discussion: {<AI12-0095-1AI12-0095-1>} We assume the worst in
+ a generic body whether or not a formal subtype has a
+ constrained partial view; specifically, in a generic body a
+ discriminated subtype is considered to have a constrained
+ partial view if it is a descendant of an untagged generic
+ formal private or derived type (see *note 12.5.1:: for the
+ formal definition of this rule).
6.3/4
-{AI12-0095-1AI12-0095-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules also apply in the private
-part of an instance of a generic unit.
+{<AI12-0095-1AI12-0095-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules also apply in the
+private part of an instance of a generic unit.
6.4/3
-{AI05-0142-4AI05-0142-4} {AI05-0234-1AI05-0234-1} In a function call,
-the accessibility level of the actual object for each explicitly aliased
-parameter shall not be statically deeper than the accessibility level of
-the master of the call (see *note 3.10.2::).
+{<AI05-0142-4AI05-0142-4>} {<AI05-0234-1AI05-0234-1>} In a function
+call, the accessibility level of the actual object for each explicitly
+aliased parameter shall not be statically deeper than the accessibility
+level of the master of the call (see *note 3.10.2::).
6.c/3
Discussion: Since explicitly aliased parameters are either
@@ -32865,7 +32978,7 @@ the master of the call (see *note 3.10.2::).
subprogram).
6.d/4
- Ramification: {AI12-0095-1AI12-0095-1} This accessibility
+ Ramification: {<AI12-0095-1AI12-0095-1>} This accessibility
check (and its dynamic cousin as well) can only fail if the
master of the function call (which is defined in the Heart of
Darkness, or *note 3.10.2:: if you prefer) is different than
@@ -32874,8 +32987,8 @@ the master of the call (see *note 3.10.2::).
in almost all other cases this check will always pass.
6.5/3
-{AI05-0144-2AI05-0144-2} Two names are known to denote the same object
-if:
+{<AI05-0144-2AI05-0144-2>} Two names are <known to denote the same
+object> if:
6.6/3
* both names statically denote the same stand-alone object or
@@ -32904,11 +33017,11 @@ if:
6.11/3
* one of the two names statically denotes a renaming declaration
- whose renamed object_name is known to denote the same object as the
- other, the prefix of any dereference within the renamed object_name
- is not a variable, and any expression within the renamed
- object_name contains no references to variables nor calls on
- nonstatic functions.
+ whose renamed <object_>name is known to denote the same object as
+ the other, the prefix of any dereference within the renamed
+ <object_>name is not a variable, and any expression within the
+ renamed <object_>name contains no references to variables nor calls
+ on nonstatic functions.
6.e/3
Reason: This exposes known renamings of slices, indexing, and
@@ -33013,8 +33126,8 @@ if:
we already know denote the same object.
6.12/3
-{AI05-0144-2AI05-0144-2} Two names are known to refer to the same object
-if
+{<AI05-0144-2AI05-0144-2>} Two names are <known to refer to the same
+object> if
6.13/3
* The two names are known to denote the same object; or
@@ -33026,7 +33139,7 @@ if
6.15/3
* One of the two names statically denotes a renaming declaration
- whose renamed object_name is known to refer to the same object as
+ whose renamed <object_>name is known to refer to the same object as
the other name.
6.u/3
@@ -33039,23 +33152,24 @@ if
object it designates.)
6.16/3
-{AI05-0144-2AI05-0144-2} If a call C has two or more parameters of mode
-in out or out that are of an elementary type, then the call is legal
-only if:
+{<AI05-0144-2AI05-0144-2>} If a call <C> has two or more parameters of
+mode in out or out that are of an elementary type, then the call is
+legal only if:
6.17/3
- * For each name N that is passed as a parameter of mode in out or out
- to the call C, there is no other name among the other parameters of
- mode in out or out to C that is known to denote the same object.
+ * For each name <N> that is passed as a parameter of mode in out or
+ out to the call <C>, there is no other name among the other
+ parameters of mode in out or out to <C> that is known to denote the
+ same object.
6.v/3
- To be honest: This means visibly an elementary type; it does
+ To be honest: This means <visibly> an elementary type; it does
not include partial views of elementary types (partial views
are always composite). That's necessary to avoid having
Legality Rules depend on the contents of the private part.
6.18/3
-{AI05-0144-2AI05-0144-2} If a construct C has two or more direct
+{<AI05-0144-2AI05-0144-2>} If a construct <C> has two or more direct
constituents that are names or expressions whose evaluation may occur in
an arbitrary order, at least one of which contains a function call with
an in out or out parameter, then the construct is legal only if:
@@ -33068,11 +33182,11 @@ an in out or out parameter, then the construct is
legal only if:
or finalization).
6.19/3
- * For each name N that is passed as a parameter of mode in out or out
- to some inner function call C2 (not including the construct C
- itself), there is no other name anywhere within a direct
- constituent of the construct C other than the one containing C2,
- that is known to refer to the same object.
+ * For each name <N> that is passed as a parameter of mode in out or
+ out to some inner function call <C2> (not including the construct
+ <C> itself), there is no other name anywhere within a direct
+ constituent of the construct <C> other than the one containing
+ <C2>, that is known to refer to the same object.
6.x/3
Ramification: This requirement cannot fail for a procedure or
@@ -33099,7 +33213,7 @@ an in out or out parameter, then the construct is legal
only if:
correspond to any allowed sequential order.
6.20/3
-{AI05-0144-2AI05-0144-2} For the purposes of checking this rule:
+{<AI05-0144-2AI05-0144-2>} For the purposes of checking this rule:
6.21/3
* For an array aggregate, an expression associated with a
@@ -33146,7 +33260,7 @@ For the evaluation of a parameter_association:
* For a parameter [(of any mode)] that is passed by reference (see
*note 6.2::), a view conversion of the actual parameter to the
nominal subtype of the formal parameter is evaluated, and the
- formal parameter denotes that conversion.
+ formal parameter denotes that conversion.
10.a
Discussion: We are always allowing sliding, even for [in] out
@@ -33156,7 +33270,7 @@ For the evaluation of a parameter_association:
* For an in or in out parameter that is passed by copy (see *note
6.2::), the formal parameter object is created, and the value of
the actual parameter is converted to the nominal subtype of the
- formal parameter and assigned to the formal.
+ formal parameter and assigned to the formal.
11.a
Ramification: The conversion mentioned here is a value
@@ -33167,7 +33281,7 @@ For the evaluation of a parameter_association:
object is created, and:
13/3
- * {AI05-0153-3AI05-0153-3} {AI05-0196-1AI05-0196-1} For an
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0196-1AI05-0196-1>} For an
access type, the formal parameter is initialized from the
value of the actual, without checking that the value satisfies
any constraint, any predicate, or any exclusion of the null
@@ -33179,26 +33293,26 @@ For the evaluation of a parameter_association:
"reasonable" value.
13.1/4
- * {AI05-0153-3AI05-0153-3} {AI05-0228-1AI05-0228-1}
- {AI12-0074-1AI12-0074-1} {AI12-0159-1AI12-0159-1} For a scalar
- type that has the Default_Value aspect specified, the formal
- parameter is initialized from the value of the actual, without
- checking that the value satisfies any constraint or any
- predicate. Furthermore, if the actual parameter is a view
+ * {<AI05-0153-3AI05-0153-3>} {<AI05-0228-1AI05-0228-1>}
+ {<AI12-0074-1AI12-0074-1>} {<AI12-0159-1AI12-0159-1>} For a
+ scalar type that has the Default_Value aspect specified, the
+ formal parameter is initialized from the value of the actual,
+ without checking that the value satisfies any constraint or
+ any predicate. Furthermore, if the actual parameter is a view
conversion and either
13.2/4
- * {AI12-0074-1AI12-0074-1} there exists no type (other than
- a root numeric type) that is an ancestor of both the
+ * {<AI12-0074-1AI12-0074-1>} there exists no type (other
+ than a root numeric type) that is an ancestor of both the
target type and the type of the operand of the
conversion; or
13.3/4
- * {AI12-0074-1AI12-0074-1} the Default_Value aspect is
+ * {<AI12-0074-1AI12-0074-1>} the Default_Value aspect is
unspecified for the type of the operand of the conversion
13.4/4
- {AI12-0074-1AI12-0074-1} then Program_Error is raised;
+ {<AI12-0074-1AI12-0074-1>} then Program_Error is raised;
13.b/3
Reason: This preserves the Language Design Principle that all
@@ -33209,11 +33323,11 @@ For the evaluation of a parameter_association:
13.c/3
Implementation Note: This rule means that out parameters of a
- subtype T with a specified Default_Value need to be large
- enough to support any possible value of the base type of T. In
- contrast, a type that does not have a Default_Value only need
- support the size of the subtype (since no values are passed
- in).
+ subtype <T> with a specified Default_Value need to be large
+ enough to support any possible value of the base type of <T>.
+ In contrast, a type that does not have a Default_Value only
+ need support the size of the subtype (since no values are
+ passed in).
13.d/4
Discussion: The Program_Error case can only occur in the body
@@ -33245,30 +33359,30 @@ For the evaluation of a parameter_association:
subtype of the formal is given by its nominal subtype.
15.a/3
- Ramification: {AI05-0228-1AI05-0228-1} This case covers scalar
- types that do not have Default_Value specified, and composite
- types whose subcomponent's subtypes do not have any implicit
- initial values. The view conversion for composite types
- ensures that if the lengths don't match between an actual and
- a formal array parameter, the Constraint_Error is raised
- before the call, rather than after.
+ Ramification: {<AI05-0228-1AI05-0228-1>} This case covers
+ scalar types that do not have Default_Value specified, and
+ composite types whose subcomponent's subtypes do not have any
+ implicit initial values. The view conversion for composite
+ types ensures that if the lengths don't match between an
+ actual and a formal array parameter, the Constraint_Error is
+ raised before the call, rather than after.
15.1/3
- * {AI05-0142-4AI05-0142-4} {AI05-0234-1AI05-0234-1} In a function
+ * {<AI05-0142-4AI05-0142-4>} {<AI05-0234-1AI05-0234-1>} In a function
call, for each explicitly aliased parameter, a check is made that
the accessibility level of the master of the actual object is not
deeper than that of the master of the call (see *note 3.10.2::).
15.a.1/3
- Ramification: If the actual object to a call C is a formal
- parameter of some function call F, no dynamic check against
- the master of the actual parameter of F is necessary. Any
+ Ramification: If the actual object to a call <C> is a formal
+ parameter of some function call <F>, no dynamic check against
+ the master of the actual parameter of <F> is necessary. Any
case which could fail the dynamic check is already statically
- illegal (either at the call site of F, or at the call site C).
- This is important, as it would require nasty distributed
- overhead to accurately know the dynamic accessibility of a
- formal parameter (all tagged and explicitly aliased parameters
- would have to carry accessibility levels).
+ illegal (either at the call site of <F>, or at the call site
+ <C>). This is important, as it would require nasty
+ distributed overhead to accurately know the dynamic
+ accessibility of a formal parameter (all tagged and explicitly
+ aliased parameters would have to carry accessibility levels).
16
A formal parameter of mode in out or out with discriminants is
@@ -33279,8 +33393,8 @@ constrained.
After normal completion and leaving of a subprogram, for each in out or
out parameter that is passed by copy, the value of the formal parameter
is converted to the subtype of the variable given as the actual
-parameter and assigned to it. These conversions and assignments occur in
-an arbitrary order.
+parameter and assigned to it. These conversions and assignments occur
+in an arbitrary order.
17.a
Ramification: The conversions mentioned above during parameter
@@ -33299,8 +33413,8 @@ an arbitrary order.
17.d
Discussion: The variable we're talking about is the one
- denoted by the variable_name given as the
- explicit_actual_parameter. If this variable_name is a
+ denoted by the <variable_>name given as the
+ explicit_actual_parameter. If this <variable_>name is a
type_conversion, then the rules in *note 4.6:: for assigning
to a view conversion apply. That is, if X is of subtype S1,
and the actual is S2(X), the above-mentioned conversion will
@@ -33310,7 +33424,7 @@ an arbitrary order.
_Erroneous Execution_
18/3
-{AI05-0008-1AI05-0008-1} If the nominal subtype of a formal parameter
+{<AI05-0008-1AI05-0008-1>} If the nominal subtype of a formal parameter
with discriminants is constrained or indefinite, and the parameter is
passed by reference, then the execution of the call is erroneous if the
value of any discriminant of the actual is changed while the formal
@@ -33329,13 +33443,13 @@ construct).
_Wording Changes from Ada 83_
18.b/3
- {AI05-0299-1AI05-0299-1} We have eliminated the subclause on
+ {<AI05-0299-1AI05-0299-1>} We have eliminated the subclause on
Default Parameters, as it is subsumed by earlier subclauses.
_Inconsistencies With Ada 2005_
18.c/3
- {AI05-0196-1AI05-0196-1} Correction: Clarified that out
+ {<AI05-0196-1AI05-0196-1>} Correction: Clarified that out
parameters of an access type are not checked for null
exclusions when they are passed in (which is similar to the
behavior for constraints). This was unspecified in Ada 2005,
@@ -33347,7 +33461,7 @@ construct).
_Incompatibilities With Ada 2005_
18.d/3
- {AI05-0144-2AI05-0144-2} Additional rules have been added to
+ {<AI05-0144-2AI05-0144-2>} Additional rules have been added to
make illegal passing the same elementary object to more than
one in out or out parameters of the same call. In this case,
the result in the object could depend on the compiler version,
@@ -33362,8 +33476,8 @@ construct).
_Wording Changes from Ada 2005_
18.e/3
- {AI05-0008-1AI05-0008-1} Correction: A missing rule was added
- to cover cases that were missed in Ada 95 and Ada 2005;
+ {<AI05-0008-1AI05-0008-1>} Correction: A missing rule was
+ added to cover cases that were missed in Ada 95 and Ada 2005;
specifically, that an in parameter passed by reference might
have its discriminants changed via another path. Such cases
are erroneous as requiring compilers to detect such errors
@@ -33374,22 +33488,22 @@ construct).
any current behavior.
18.f/3
- {AI05-0102-1AI05-0102-1} Correction: Moved implicit conversion
- Legality Rule to *note 8.6::.
+ {<AI05-0102-1AI05-0102-1>} Correction: Moved implicit
+ conversion Legality Rule to *note 8.6::.
18.g/3
- {AI05-0118-1AI05-0118-1} Correction: Added a definition for
+ {<AI05-0118-1AI05-0118-1>} Correction: Added a definition for
positional parameters, as this is missing from Ada 95 and
later.
18.h/3
- {AI05-0142-4AI05-0142-4} Rules have been added defining the
+ {<AI05-0142-4AI05-0142-4>} Rules have been added defining the
legality and dynamic checks needed for explicitly aliased
parameters (see *note 6.1::).
18.i/3
- {AI05-0144-2AI05-0144-2} Additional rules have been added such
- that passing an object to an in out or out parameter of a
+ {<AI05-0144-2AI05-0144-2>} Additional rules have been added
+ such that passing an object to an in out or out parameter of a
function is illegal if it is used elsewhere in a construct
which allows evaluation in an arbitrary order. Such calls are
not portable (since the results may depend on the evaluation
@@ -33399,25 +33513,25 @@ construct).
_Incompatibilities With Ada 2012_
18.j/4
- {AI12-0074-1AI12-0074-1} {AI12-0159-1AI12-0159-1} Corrigendum:
- Added rules to ensure that the value passed into a out
- parameter for elementary types is well-defined in the case of
- a view conversion. The new rules can be incompatible. For a
- view conversion to an unrelated type with the Default_Value
- aspect specified, the aspect is new in Ada 2012 so it should
- be unlikely to occur in existing code. For a view conversion
- to an unrelated access type, the incompatibility is possible
- as this could be written in Ada 95, but such a view conversion
- is thought to be rare. In both cases, declaring and passing a
- temporary rather than a view conversion will eliminate the
- problem.
+ {<AI12-0074-1AI12-0074-1>} {<AI12-0159-1AI12-0159-1>}
+ Corrigendum: Added rules to ensure that the value passed into
+ a out parameter for elementary types is well-defined in the
+ case of a view conversion. The new rules can be incompatible.
+ For a view conversion to an unrelated type with the
+ Default_Value aspect specified, the aspect is new in Ada 2012
+ so it should be unlikely to occur in existing code. For a
+ view conversion to an unrelated access type, the
+ incompatibility is possible as this could be written in Ada
+ 95, but such a view conversion is thought to be rare. In both
+ cases, declaring and passing a temporary rather than a view
+ conversion will eliminate the problem.
18.k/4
- {AI12-0095-1AI12-0095-1} Corrigendum: Because of a rule added
- in *note 12.5.1::, the checks for the passing of an object to
- an explicitly aliased parameter in a generic body were
- strengthened to use an assume the worst rule. This case is
- rather unlikely as a formal private or derived type with
+ {<AI12-0095-1AI12-0095-1>} Corrigendum: Because of a rule
+ added in *note 12.5.1::, the checks for the passing of an
+ object to an explicitly aliased parameter in a generic body
+ were strengthened to use an assume the worst rule. This case
+ is rather unlikely as a formal private or derived type with
discriminants is required along with an explicitly aliased
parameter whose type doesn't statically match the formal type.
Such a program is very unlikely, especially as explicitly
@@ -33430,44 +33544,44 @@ File: aarm2012.info, Node: 6.5, Next: 6.6, Prev:
6.4, Up: 6
=====================
1/2
-{AI95-00318-02AI95-00318-02} A simple_return_statement (*note 6.5:
+{<AI95-00318-02AI95-00318-02>} A simple_return_statement (*note 6.5:
S0183.) or extended_return_statement (*note 6.5: S0186.) (collectively
-called a return statement) is used to complete the execution of the
+called a <return statement>) is used to complete the execution of the
innermost enclosing subprogram_body (*note 6.3: S0177.), entry_body
(*note 9.5.2: S0221.), or accept_statement (*note 9.5.2: S0219.).
_Syntax_
2/2
- {AI95-00318-02AI95-00318-02} simple_return_statement ::= return [
+ {<AI95-00318-02AI95-00318-02>} simple_return_statement ::= return [
expression];
2.1/3
- {AI05-0277-1AI05-0277-1} extended_return_object_declaration ::=
+ {<AI05-0277-1AI05-0277-1>} extended_return_object_declaration ::=
defining_identifier : [aliased][constant]
return_subtype_indication [:= expression]
2.2/3
- {AI95-00318-02AI95-00318-02} {AI05-0015-1AI05-0015-1}
- {AI05-0053-1AI05-0053-1} {AI05-0277-1AI05-0277-1}
- {AI05-0299-1AI05-0299-1} extended_return_statement ::=
+ {<AI95-00318-02AI95-00318-02>} {<AI05-0015-1AI05-0015-1>}
+ {<AI05-0053-1AI05-0053-1>} {<AI05-0277-1AI05-0277-1>}
+ {<AI05-0299-1AI05-0299-1>} extended_return_statement ::=
return extended_return_object_declaration [do
handled_sequence_of_statements
end return];
2.3/2
- {AI95-00318-02AI95-00318-02} return_subtype_indication ::=
+ {<AI95-00318-02AI95-00318-02>} return_subtype_indication ::=
subtype_indication | access_definition
_Name Resolution Rules_
3/2
-{AI95-00318-02AI95-00318-02} The result subtype of a function is the
+{<AI95-00318-02AI95-00318-02>} The <result subtype> of a function is the
subtype denoted by the subtype_mark, or defined by the
access_definition, after the reserved word return in the profile of the
function. The expected type for the expression, if any, of a
simple_return_statement (*note 6.5: S0183.) is the result type of the
-corresponding function. The expected type for the expression of an
+corresponding function. The expected type for the expression of an
extended_return_statement is that of the return_subtype_indication
(*note 6.5: S0187.).
@@ -33477,22 +33591,22 @@ extended_return_statement is that of the
return_subtype_indication
_Legality Rules_
4/2
-{AI95-00318-02AI95-00318-02} A return statement shall be within a
-callable construct, and it applies to the innermost callable construct
+{<AI95-00318-02AI95-00318-02>} A return statement shall be within a
+callable construct, and it <applies to> the innermost callable construct
or extended_return_statement that contains it. A return statement shall
not be within a body that is within the construct to which the return
statement applies.
4.a/4
- To be honest: {AI12-0089-1AI12-0089-1} The above also applies
- to generic subprograms, even though they are not callable
- constructs. (An instance of a generic subprogram is a
- callable construct, but not a generic subprogram itself.)
+ To be honest: {<AI12-0089-1AI12-0089-1>} The above also
+ applies to generic subprograms, even though they are not
+ callable constructs. (An instance of a generic subprogram is
+ a callable construct, but not a generic subprogram itself.)
5/3
-{AI95-00318-02AI95-00318-02} {AI05-0015-1AI05-0015-1} A function body
-shall contain at least one return statement that applies to the function
-body, unless the function contains code_statements. A
+{<AI95-00318-02AI95-00318-02>} {<AI05-0015-1AI05-0015-1>} A function
+body shall contain at least one return statement that applies to the
+function body, unless the function contains code_statements. A
simple_return_statement (*note 6.5: S0183.) shall include an expression
if and only if it applies to a function body. An
extended_return_statement shall apply to a function body. An
@@ -33500,20 +33614,21 @@ extended_return_statement with the reserved word
constant shall include
an expression.
5.a/4
- Reason: {AI95-00318-02AI95-00318-02} {AI12-0022-1AI12-0022-1}
- The requirement that a function body has to have at least one
- return statement is a "helpful" restriction. There has been
- some interest in lifting this restriction, or allowing a raise
- statement to substitute for the return statement. However,
- there was enough interest in leaving it as is that we decided
- not to change it. Note that for Ada 2012, Corrigendum 1, a
- return statement whose expression is a raise_expression can be
- given in any function body (the raise_expression will match
- any type), so there is much less need to eliminate this rule.
+ Reason: {<AI95-00318-02AI95-00318-02>}
+ {<AI12-0022-1AI12-0022-1>} The requirement that a function
+ body has to have at least one return statement is a "helpful"
+ restriction. There has been some interest in lifting this
+ restriction, or allowing a raise statement to substitute for
+ the return statement. However, there was enough interest in
+ leaving it as is that we decided not to change it. Note that
+ for Ada 2012, Corrigendum 1, a return statement whose
+ expression is a raise_expression can be given in <any>
+ function body (the raise_expression will match any type), so
+ there is much less need to eliminate this rule.
5.b/2
- Ramification: {AI95-00318-02AI95-00318-02} A return statement
- can apply to an extended_return_statement, so a
+ Ramification: {<AI95-00318-02AI95-00318-02>} A return
+ statement can apply to an extended_return_statement, so a
simple_return_statement (*note 6.5: S0183.) without an
expression can be given in one. However, neither
simple_return_statement (*note 6.5: S0183.) with an expression
@@ -33522,19 +33637,19 @@ an expression.
function body.
5.b.1/4
- {AI12-0089-1AI12-0089-1} Since a "function body" includes a
+ {<AI12-0089-1AI12-0089-1>} Since a "function body" includes a
generic function body, this rule and all of the following
Legality Rules apply to generic function bodies as well as
non-generic function bodies. This is true even though a
generic function is not a function.
5.1/2
-{AI95-00318-02AI95-00318-02} For an extended_return_statement (*note
+{<AI95-00318-02AI95-00318-02>} For an extended_return_statement (*note
6.5: S0186.) that applies to a function body:
5.2/3
- * {AI95-00318-02AI95-00318-02} {AI05-0032-1AI05-0032-1}
- {AI05-0103-1AI05-0103-1} If the result subtype of the function is
+ * {<AI95-00318-02AI95-00318-02>} {<AI05-0032-1AI05-0032-1>}
+ {<AI05-0103-1AI05-0103-1>} If the result subtype of the function is
defined by a subtype_mark, the return_subtype_indication (*note
6.5: S0187.) shall be a subtype_indication. The type of the
subtype_indication shall be covered by the result type of the
@@ -33546,20 +33661,21 @@ an expression.
shall be a definite subtype, or there shall be an expression.
5.3/2
- * {AI95-00318-02AI95-00318-02} If the result subtype of the function
- is defined by an access_definition, the return_subtype_indication
- (*note 6.5: S0187.) shall be an access_definition. The subtype
- defined by the access_definition shall statically match the result
- subtype of the function. [The accessibility level of this
- anonymous access subtype is that of the result subtype.]
+ * {<AI95-00318-02AI95-00318-02>} If the result subtype of the
+ function is defined by an access_definition, the
+ return_subtype_indication (*note 6.5: S0187.) shall be an
+ access_definition. The subtype defined by the access_definition
+ shall statically match the result subtype of the function. [The
+ accessibility level of this anonymous access subtype is that of the
+ result subtype.]
5.b.2/4
- Proof: {AI12-0070-1AI12-0070-1} The accessibility of such
+ Proof: {<AI12-0070-1AI12-0070-1>} The accessibility of such
anonymous access types is defined in the Heart of Darkness
(aka *note 3.10.2::).
5.4/3
- * {AI05-0032-1AI05-0032-1} If the result subtype of the function is
+ * {<AI05-0032-1AI05-0032-1>} If the result subtype of the function is
class-wide, the accessibility level of the type of the subtype
defined by the return_subtype_indication shall not be statically
deeper than that of the master that elaborated the function body.
@@ -33570,37 +33686,37 @@ an expression.
expression to check.
5.5/3
-{AI95-00318-02AI95-00318-02} {AI05-0032-1AI05-0032-1} For any return
+{<AI95-00318-02AI95-00318-02>} {<AI05-0032-1AI05-0032-1>} For any return
statement that applies to a function body:
5.6/3
- * {AI95-00318-02AI95-00318-02} {AI05-0188-1AI05-0188-1} [If the
+ * {<AI95-00318-02AI95-00318-02>} {<AI05-0188-1AI05-0188-1>} [If the
result subtype of the function is limited, then the expression of
the return statement (if any) shall meet the restrictions described
in *note 7.5::.]
5.c/3
- This paragraph was deleted.{AI05-0188-1AI05-0188-1}
+ <This paragraph was deleted.>{<AI05-0188-1AI05-0188-1>}
5.7/3
- * {AI95-00416-01AI95-00416-01} {AI05-0032-1AI05-0032-1}
- {AI05-0051-1AI05-0051-1} If the result subtype of the function is
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0032-1AI05-0032-1>}
+ {<AI05-0051-1AI05-0051-1>} If the result subtype of the function is
class-wide, the accessibility level of the type of the expression
(if any) of the return statement shall not be statically deeper
than that of the master that elaborated the function body.
5.d/4
- Discussion: {AI05-0032-1AI05-0032-1} {AI05-0051-1AI05-0051-1}
- {AI12-0005-1AI12-0005-1} If the result type is class-wide,
- then there must be an expression of the return statement
- unless this is an extended_return_statement whose
- return_subtype_indication is a specific type. We have a
- separate rule to cover that case. Note that if an
- extended_return_statement has an expression, then both this
- rule and the next one must be satisfied.
+ Discussion: {<AI05-0032-1AI05-0032-1>}
+ {<AI05-0051-1AI05-0051-1>} {<AI12-0005-1AI12-0005-1>} If the
+ result type is class-wide, then there must be an expression of
+ the return statement unless this is an
+ extended_return_statement whose return_subtype_indication is a
+ specific type. We have a separate rule to cover that case.
+ Note that if an extended_return_statement has an expression,
+ then both this rule and the next one must be satisfied.
5.8/3
- * {AI05-0051-1AI05-0051-1} If the subtype determined by the
+ * {<AI05-0051-1AI05-0051-1>} If the subtype determined by the
expression of the simple_return_statement or by the
return_subtype_indication has one or more access discriminants, the
accessibility level of the anonymous access type of each access
@@ -33615,26 +33731,26 @@ statement that applies to a function body:
a class-wide type).
5.9/3
-{AI05-0277-1AI05-0277-1} If the keyword aliased is present in an
+{<AI05-0277-1AI05-0277-1>} If the keyword aliased is present in an
extended_return_object_declaration, the type of the extended return
object shall be immutably limited.
_Static Semantics_
5.10/3
-{AI95-00318-02AI95-00318-02} {AI05-0015-1AI05-0015-1}
-{AI05-0144-2AI05-0144-2} Within an extended_return_statement, the return
-object is declared with the given defining_identifier, with the nominal
-subtype defined by the return_subtype_indication (*note 6.5: S0187.).
-An extended_return_statement with the reserved word constant is a full
-constant declaration that declares the return object to be a constant
-object.
+{<AI95-00318-02AI95-00318-02>} {<AI05-0015-1AI05-0015-1>}
+{<AI05-0144-2AI05-0144-2>} Within an extended_return_statement, the
+<return object> is declared with the given defining_identifier, with the
+nominal subtype defined by the return_subtype_indication (*note 6.5:
+S0187.). An extended_return_statement with the reserved word constant
+is a full constant declaration that declares the return object to be a
+constant object.
_Dynamic Semantics_
5.11/3
-{AI95-00318-02AI95-00318-02} {AI95-00416-01AI95-00416-01}
-{AI05-0032-1AI05-0032-1} For the execution of an
+{<AI95-00318-02AI95-00318-02>} {<AI95-00416-01AI95-00416-01>}
+{<AI05-0032-1AI05-0032-1>} For the execution of an
extended_return_statement, the subtype_indication or access_definition
is elaborated. This creates the nominal subtype of the return object.
If there is an expression, it is evaluated and converted to the nominal
@@ -33645,7 +33761,7 @@ by default as for a stand-alone object of its nominal
subtype (see *note
3.3.1::). If the nominal subtype is indefinite, the return object is
constrained by its initial value. A check is made that the value of the
return object belongs to the function result subtype. Constraint_Error
-is raised if this check fails.
+is raised if this check fails.
5.e/2
Ramification: If the result type is controlled or has a
@@ -33656,7 +33772,7 @@ is raised if this check fails.
no call on Adjust).
5.f/3
- {AI05-0005-1AI05-0005-1} If the return statement is left
+ {<AI05-0005-1AI05-0005-1>} If the return statement is left
without resulting in a return (for example, due to an
exception propagated from the expression or the
handled_sequence_of_statements, or a goto out of the
@@ -33666,7 +33782,7 @@ is raised if this check fails.
statement is left, it is not created or finalized.
5.g/3
- {AI05-0032-1AI05-0032-1} Other rules ensure that the check
+ {<AI05-0032-1AI05-0032-1>} Other rules ensure that the check
required by this rule cannot fail unless the function has a
class-wide result subtype where the associated specific
subtype is constrained. In other cases, either the subtypes
@@ -33674,19 +33790,20 @@ is raised if this check fails.
needs no checking.
6/2
-{AI95-00318-02AI95-00318-02} For the execution of a
+{<AI95-00318-02AI95-00318-02>} For the execution of a
simple_return_statement (*note 6.5: S0183.), the expression (if any) is
first evaluated, converted to the result subtype, and then is assigned
-to the anonymous return object.
+to the anonymous <return object>.
6.a
Ramification: The conversion might raise Constraint_Error --
(see *note 4.6::).
7/2
-{AI95-00318-02AI95-00318-02} {AI95-00416-01AI95-00416-01} [If the return
-object has any parts that are tasks, the activation of those tasks does
-not occur until after the function returns (see *note 9.2::).]
+{<AI95-00318-02AI95-00318-02>} {<AI95-00416-01AI95-00416-01>} [If the
+return object has any parts that are tasks, the activation of those
+tasks does not occur until after the function returns (see *note
+9.2::).]
7.a/2
Proof: This is specified by the rules in *note 9.2::.
@@ -33702,29 +33819,30 @@ not occur until after the function returns (see *note
9.2::).]
is being used to initialize part of a declared object.
8/4
-{AI95-00318-02AI95-00318-02} {AI95-00344-01AI95-00344-01}
-{AI05-0024-1AI05-0024-1} {AI05-0032-1AI05-0032-1}
-{AI12-0097-1AI12-0097-1} If the result type of a function is a specific
-tagged type, the tag of the return object is that of the result type.
-If the result type is class-wide, the tag of the return object is that
-of the value of the expression, unless the return object is defined by
-an extended_return_object_declaration with a subtype_indication that is
-specific, in which case it is that of the type of the
+{<AI95-00318-02AI95-00318-02>} {<AI95-00344-01AI95-00344-01>}
+{<AI05-0024-1AI05-0024-1>} {<AI05-0032-1AI05-0032-1>}
+{<AI12-0097-1AI12-0097-1>} If the result type of a function is a
+specific tagged type, the tag of the return object is that of the result
+type. If the result type is class-wide, the tag of the return object is
+that of the value of the expression, unless the return object is defined
+by an extended_return_object_declaration with a subtype_indication that
+is specific, in which case it is that of the type of the
subtype_indication. A check is made that the master of the type
identified by the tag of the result includes the elaboration of the
master that elaborated the function body. If this check fails,
-Program_Error is raised.
+Program_Error is raised.
8.a/2
- Ramification: {AI95-00318-02AI95-00318-02} The first sentence
- is true even if the tag of the expression is different, which
- could happen if the expression were a view conversion or a
- dereference of an access value. Note that for a limited type,
- because of the restriction to aggregates and function calls
- (and no conversions), the tag will already match.
+ Ramification: {<AI95-00318-02AI95-00318-02>} The first
+ sentence is true even if the tag of the expression is
+ different, which could happen if the expression were a view
+ conversion or a dereference of an access value. Note that for
+ a limited type, because of the restriction to aggregates and
+ function calls (and no conversions), the tag will already
+ match.
8.b/2
- Reason: {AI95-00318-02AI95-00318-02} The first rule ensures
+ Reason: {<AI95-00318-02AI95-00318-02>} The first rule ensures
that a function whose result type is a specific tagged type
always returns an object whose tag is that of the result type.
This is important for dispatching on controlling result, and
@@ -33748,8 +33866,8 @@ Program_Error is raised.
parameter to the accept statement.
8.d.1/4
- To be honest: {AI12-0097-1AI12-0097-1} The expression here is
- the return expression if the return statement is a
+ To be honest: {<AI12-0097-1AI12-0097-1>} The expression here
+ is the return expression if the return statement is a
simple_return_statement, and the initializing expression of
the extended_return_object_declaration if the return statement
is an extended_return_statement (ignoring any inner
@@ -33758,11 +33876,11 @@ Program_Error is raised.
extended_return_statement).
8.1/3
-{AI05-0073-1AI05-0073-1} If the result subtype of the function is
-defined by an access_definition designating a specific tagged type T, a
-check is made that the result value is null or the tag of the object
-designated by the result value identifies T. Constraint_Error is raised
-if this check fails.
+{<AI05-0073-1AI05-0073-1>} If the result subtype of the function is
+defined by an access_definition designating a specific tagged type <T>,
+a check is made that the result value is null or the tag of the object
+designated by the result value identifies <T>. Constraint_Error is
+raised if this check fails.
8.e/3
Reason: This check is needed so that dispatching on
@@ -33772,22 +33890,22 @@ if this check fails.
the function could return an object with a tag different than
the one assumed by the dispatching rules.
-Paragraphs 9 through 20 were deleted.
+<Paragraphs 9 through 20 were deleted.>
21/3
-{AI95-00318-02AI95-00318-02} {AI95-00402-01AI95-00402-01}
-{AI95-00416-01AI95-00416-01} {AI05-0051-1AI05-0051-1} If any part of the
-specific type of the return object of a function (or coextension
+{<AI95-00318-02AI95-00318-02>} {<AI95-00402-01AI95-00402-01>}
+{<AI95-00416-01AI95-00416-01>} {<AI05-0051-1AI05-0051-1>} If any part of
+the specific type of the return object of a function (or coextension
thereof) has one or more access discriminants whose value is not
constrained by the result subtype of the function, a check is made that
the accessibility level of the anonymous access type of each access
discriminant, as determined by the expression or the
return_subtype_indication (*note 6.5: S0187.) of the return statement,
is not deeper than the level of the master of the call (see *note
-3.10.2::). If this check fails, Program_Error is raised.
+3.10.2::). If this check fails, Program_Error is raised.
21.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
21.b/2
Reason: The check prevents the returned object (for a
@@ -33799,7 +33917,7 @@ is not deeper than the level of the master of the call
(see *note
check both.
21.c/3
- Implementation Note: {AI05-0234-1AI05-0234-1} The reason for
+ Implementation Note: {<AI05-0234-1AI05-0234-1>} The reason for
saying "any part of the specific type" is to simplify
implementation. In the case of class-wide result objects,
this allows the testing of a simple flag in the tagged type
@@ -33810,7 +33928,7 @@ is not deeper than the level of the master of the call
(see *note
arrays (which might be empty) are present.
21.d/3
- Discussion: {AI05-0234-1AI05-0234-1} For a function with a
+ Discussion: {<AI05-0234-1AI05-0234-1>} For a function with a
class-wide result type, the access values that need to be
checked are determined by the tag of the return object. In
order to implement this accessibility check in the case where
@@ -33825,9 +33943,9 @@ is not deeper than the level of the master of the call
(see *note
added to this descriptor.
21.e/3
- {AI05-0005-1AI05-0005-1} {AI05-0234-1AI05-0234-1} Note that
- the flag should only be queried in the case where the result
- object might have access discriminants that might have
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0234-1AI05-0234-1>} Note
+ that the flag should only be queried in the case where the
+ result object might have access discriminants that might have
subtypes with "bad" accessibility levels (as determined by the
rules of *note 3.10.2:: for determining the accessibility
level of the type of an access discriminant in the expression
@@ -33886,11 +34004,11 @@ is not deeper than the level of the master of the
call (see *note
return X : Undiscriminated := (Fld => (Discrim =>
Local'Access)) do
Foo;
end return;
- -- raises Program_Error after calling Foo.
+ --< raises Program_Error after calling Foo.>
end F;
21.q/3
- Ramification: {AI05-0234-1AI05-0234-1} In the case where the
+ Ramification: {<AI05-0234-1AI05-0234-1>} In the case where the
tag of the result is not known statically at the point of the
return statement and the run-time accessibility check is
needed, discriminant values and array bounds play no role in
@@ -33901,8 +34019,8 @@ is not deeper than the level of the master of the call
(see *note
bit and conditionally raising Program_Error.
22/3
-{AI95-00318-02AI95-00318-02} {AI05-0058-1AI05-0058-1} For the execution
-of an extended_return_statement (*note 6.5: S0186.), the
+{<AI95-00318-02AI95-00318-02>} {<AI05-0058-1AI05-0058-1>} For the
+execution of an extended_return_statement (*note 6.5: S0186.), the
handled_sequence_of_statements (*note 11.2: S0265.) is executed. Within
this handled_sequence_of_statements (*note 11.2: S0265.), the execution
of a simple_return_statement (*note 6.5: S0183.) that applies to the
@@ -33916,7 +34034,7 @@ performed which completes the execution of the callable
construct, and
returns to the caller.
22.a/3
- Ramification: {AI05-0058-1AI05-0058-1} A transfer of control
+ Ramification: {<AI05-0058-1AI05-0058-1>} A transfer of control
that completes an extended_return_statement (such as an exit
or goto) does not cause a return to the caller unless it is
caused by simple_return_statement (that is, triggers the
@@ -33927,26 +34045,26 @@ returns to the caller.
includes the one nested in the extended_return_statement.
23/2
-{AI95-00318-02AI95-00318-02} In the case of a function, the
+{<AI95-00318-02AI95-00318-02>} In the case of a function, the
function_call denotes a constant view of the return object.
_Implementation Permissions_
24/3
-{AI95-00416-01AI95-00416-01} {AI05-0050-1AI05-0050-1} For a function
+{<AI95-00416-01AI95-00416-01>} {<AI05-0050-1AI05-0050-1>} For a function
call used to initialize a composite object with a constrained nominal
subtype or used to initialize a return object that is built in place
into such an object:
24.1/3
- * {AI05-0050-1AI05-0050-1} If the result subtype of the function is
+ * {<AI05-0050-1AI05-0050-1>} If the result subtype of the function is
constrained, and conversion of an object of this subtype to the
subtype of the object being initialized would raise
Constraint_Error, then Constraint_Error may be raised before
calling the function.
24.2/3
- * {AI05-0050-1AI05-0050-1} If the result subtype of the function is
+ * {<AI05-0050-1AI05-0050-1>} If the result subtype of the function is
unconstrained, and a return statement is executed such that the
return object is known to be constrained, and conversion of the
return object to the subtype of the object being initialized would
@@ -33955,33 +34073,33 @@ into such an object:
body).
24.a/3
- Reason: {AI95-00416-01AI95-00416-01} {AI05-0050-1AI05-0050-1}
- Without such a permission, it would be very difficult to
- implement "built-in-place" semantics. The intention is that
- the exception is raised at the same point that it would have
- been raised without the permission; it should not change
- handlers if the implementation switches between return-by-copy
- and built-in-place. This means that the exception is not
- handleable within the function, because in the return-by-copy
- case, the constraint check to verify that the result satisfies
- the constraints of the object being initialized happens after
- the function returns. This implies further that upon
- detecting such a situation, the implementation may need to
- simulate a goto to a point outside any local exception
- handlers prior to raising the exception.
+ Reason: {<AI95-00416-01AI95-00416-01>}
+ {<AI05-0050-1AI05-0050-1>} Without such a permission, it would
+ be very difficult to implement "built-in-place" semantics.
+ The intention is that the exception is raised at the same
+ point that it would have been raised without the permission;
+ it should not change handlers if the implementation switches
+ between return-by-copy and built-in-place. This means that
+ the exception is not handleable within the function, because
+ in the return-by-copy case, the constraint check to verify
+ that the result satisfies the constraints of the object being
+ initialized happens after the function returns. This implies
+ further that upon detecting such a situation, the
+ implementation may need to simulate a goto to a point outside
+ any local exception handlers prior to raising the exception.
24.b/3
- Ramification: {AI95-00416-01AI95-00416-01}
- {AI05-0050-1AI05-0050-1} These permissions do not apply in the
- case of an extended return object with mutable discriminants.
- That's necessary because in that case a return object can be
- created with the "wrong" discriminants and then changed to the
- "right" discriminants later (but before returning). We don't
- want this case raising an exception when the canonical
- semantics will not do so.
+ Ramification: {<AI95-00416-01AI95-00416-01>}
+ {<AI05-0050-1AI05-0050-1>} These permissions do not apply in
+ the case of an extended return object with mutable
+ discriminants. That's necessary because in that case a return
+ object can be created with the "wrong" discriminants and then
+ changed to the "right" discriminants later (but before
+ returning). We don't want this case raising an exception when
+ the canonical semantics will not do so.
24.c/3
- {AI05-0050-1AI05-0050-1} It's still possible to write a
+ {<AI05-0050-1AI05-0050-1>} It's still possible to write a
program that will raise an exception using this permission
that would not in the canonical semantics. That could happen
if a return statement with the "wrong" discriminants or bounds
@@ -33995,7 +34113,7 @@ into such an object:
objects that this permission is intended to ease.
24.d/3
- {AI05-0050-1AI05-0050-1} Note that the mutable-discriminant
+ {<AI05-0050-1AI05-0050-1>} Note that the mutable-discriminant
case only happens when built-in-place initialization is
optional. This means that any difficulties associated with
implementing built-in-place initialization without these
@@ -34004,17 +34122,17 @@ into such an object:
_Examples_
25
-Examples of return statements:
+<Examples of return statements:>
26/2
- {AI95-00318-02AI95-00318-02} return; -- in a
procedure body, entry_body,
- -- accept_statement, or
extended_return_statement
+ {<AI95-00318-02AI95-00318-02>} return; --< in a
procedure body, >entry_body<,>
+ -- accept_statement<, or
>extended_return_statement
27
- return Key_Value(Last_Index); -- in a function body
+ return Key_Value(Last_Index); --< in a function body>
28/2
- {AI95-00318-02AI95-00318-02} return Node : Cell do -- in a
function body, see *note 3.10.1:: for Cell
+ {<AI95-00318-02AI95-00318-02>} return Node : Cell do --< in a
function body, see *note 3.10.1:: for Cell>
Node.Value := Result;
Node.Succ := Next_Node;
end return;
@@ -34022,8 +34140,8 @@ Examples of return statements:
_Incompatibilities With Ada 83_
28.a/2
- {AI95-00318-02AI95-00318-02} In Ada 95, if the result type of
- a function has a part that is a task, then an attempt to
+ {<AI95-00318-02AI95-00318-02>} In Ada 95, if the result type
+ of a function has a part that is a task, then an attempt to
return a local variable will raise Program_Error. This is
illegal in Ada 2005, see below. In Ada 83, if a function
returns a local variable containing a task, execution is
@@ -34045,7 +34163,7 @@ Examples of return statements:
_Wording Changes from Ada 83_
28.c/3
- {AI05-0299-1AI05-0299-1} This subclause has been moved here
+ {<AI05-0299-1AI05-0299-1>} This subclause has been moved here
from chapter 5, since it has mainly to do with subprograms.
28.d
@@ -34053,12 +34171,12 @@ Examples of return statements:
so that controlled types will work.
28.e/2
- {AI95-00318-02AI95-00318-02} We have clarified that a return
+ {<AI95-00318-02AI95-00318-02>} We have clarified that a return
statement applies to a callable construct, not to a callable
entity.
28.f/2
- {AI95-00318-02AI95-00318-02} There is no need to mention
+ {<AI95-00318-02AI95-00318-02>} There is no need to mention
generics in the rules about where a return statement can
appear and what it applies to; the phrase "body of a
subprogram or generic subprogram" is syntactic, and refers
@@ -34067,8 +34185,8 @@ Examples of return statements:
_Inconsistencies With Ada 95_
28.f.1/3
- {AI95-0416-1AI95-0416-1} {AI05-0005-1AI05-0005-1}
- {AI05-0050-1AI05-0050-1} Added an Implementation Permission
+ {<AI95-0416-1AI95-0416-1>} {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0050-1AI05-0050-1>} Added an Implementation Permission
allowing early raising of Constraint_Error if the result
cannot fit in the ultimate object. This gives implementations
more flexibility to do built-in-place returns, and is
@@ -34084,7 +34202,7 @@ Examples of return statements:
_Incompatibilities With Ada 95_
28.g/2
- {AI95-00318-02AI95-00318-02} The entire business about
+ {<AI95-00318-02AI95-00318-02>} The entire business about
return-by-reference types has been dropped. Instead, the
expression of a return statement of a limited type can only be
an aggregate or function_call (see *note 7.5::). This means
@@ -34106,8 +34224,8 @@ Examples of return statements:
_Extensions to Ada 95_
28.i/2
- {AI95-00318-02AI95-00318-02} The extended_return_statement is
- new. This provides a name for the object being returned,
+ {<AI95-00318-02AI95-00318-02>} The extended_return_statement
+ is new. This provides a name for the object being returned,
which reduces the copying needed to return complex objects
(including no copying at all for limited objects). It also
allows component-by-component construction of the return
@@ -34116,16 +34234,16 @@ Examples of return statements:
_Wording Changes from Ada 95_
28.j/2
- {AI95-00318-02AI95-00318-02} The wording was updated to
+ {<AI95-00318-02AI95-00318-02>} The wording was updated to
support anonymous access return subtypes.
28.k/2
- {AI95-00318-02AI95-00318-02} The term "return expression" was
- dropped because reviewers found it confusing when applied to
- the default expression of an extended_return_statement.
+ {<AI95-00318-02AI95-00318-02>} The term "return expression"
+ was dropped because reviewers found it confusing when applied
+ to the default expression of an extended_return_statement.
28.l/2
- {AI95-00344-01AI95-00344-01} {AI95-00416-01AI95-00416-01}
+ {<AI95-00344-01AI95-00344-01>} {<AI95-00416-01AI95-00416-01>}
Added accessibility checks to class-wide return statements.
These checks could not fail in Ada 95 (as all of the types had
to be declared at the same level, so the tagged type would
@@ -34133,7 +34251,7 @@ Examples of return statements:
object).
28.m/2
- {AI95-00402-01AI95-00402-01} {AI95-00416-01AI95-00416-01}
+ {<AI95-00402-01AI95-00402-01>} {<AI95-00416-01AI95-00416-01>}
Added accessibility checks to return statements for types with
access discriminants. Since such types have to be limited in
Ada 95, the expression of a return statement would have been
@@ -34142,7 +34260,7 @@ Examples of return statements:
_Inconsistencies With Ada 2005_
28.n/3
- {AI05-0050-1AI05-0050-1} Correction: The Implementation
+ {<AI05-0050-1AI05-0050-1>} Correction: The Implementation
Permission allowing early raising of Constraint_Error was
modified to remove the most common of these cases from the
permission (returning an object with mutable discriminants,
@@ -34159,17 +34277,17 @@ Examples of return statements:
rare.
28.o/3
- {AI05-0051-1AI05-0051-1} {AI05-0234-1AI05-0234-1} Correction:
- Accessibility checks for access discriminants now depend on
- the master of the call rather than the point of declaration of
- the function. This will result in cases that used to raise
- Program_Error now running without raising any exception. This
- is technically inconsistent with Ada 2005 (as defined by
- Amendment 1), but it is unlikely that any real code depends on
- the raising of this exception.
+ {<AI05-0051-1AI05-0051-1>} {<AI05-0234-1AI05-0234-1>}
+ Correction: Accessibility checks for access discriminants now
+ depend on the master of the call rather than the point of
+ declaration of the function. This will result in cases that
+ used to raise Program_Error now running without raising any
+ exception. This is technically inconsistent with Ada 2005 (as
+ defined by Amendment 1), but it is unlikely that any real code
+ depends on the raising of this exception.
28.p/3
- {AI05-0073-1AI05-0073-1} Correction: Added a tag check for
+ {<AI05-0073-1AI05-0073-1>} Correction: Added a tag check for
functions returning anonymous access-to-tagged types, so that
dispatching of tag-indeterminate function works as expected.
This is technically inconsistent with Ada 2005 (as defined by
@@ -34180,24 +34298,24 @@ Examples of return statements:
_Incompatibilities With Ada 2005_
28.q/3
- {AI05-0053-1AI05-0053-1} {AI05-0277-1AI05-0277-1} Correction:
- The aliased keyword can now only appear on extended return
- objects with an immutably limited type. Other types would
- provide a way to get an aliased view of an object that is not
- necessarily aliased, which would be very bad. This is
- incompatible, but since the feature was added in Ada 2005, the
- keyword had no defined meaning in Ada 2005 (a significant
- oversight), and most sensible uses involve immutably limited
- types, it is unlikely that it appears meaningfully in existing
- programs.
+ {<AI05-0053-1AI05-0053-1>} {<AI05-0277-1AI05-0277-1>}
+ Correction: The aliased keyword can now only appear on
+ extended return objects with an immutably limited type. Other
+ types would provide a way to get an aliased view of an object
+ that is not necessarily aliased, which would be very bad.
+ This is incompatible, but since the feature was added in Ada
+ 2005, the keyword had no defined meaning in Ada 2005 (a
+ significant oversight), and most sensible uses involve
+ immutably limited types, it is unlikely that it appears
+ meaningfully in existing programs.
28.r/3
- {AI05-0103-1AI05-0103-1} Correction: Added wording to require
- static matching for unconstrained access types in extended
- return statements. This disallows adding or omitting null
- exclusions, and adding access constraints, in the declaration
- of the return object. While this is incompatible, the
- incompatible cases in question are either useless (access
+ {<AI05-0103-1AI05-0103-1>} Correction: Added wording to
+ require static matching for unconstrained access types in
+ extended return statements. This disallows adding or omitting
+ null exclusions, and adding access constraints, in the
+ declaration of the return object. While this is incompatible,
+ the incompatible cases in question are either useless (access
constraints - the constraint can be given on an allocator if
necessary, and still must be given there even if given on the
return object) or wrong (null exclusions - null could be
@@ -34207,13 +34325,13 @@ Examples of return statements:
_Extensions to Ada 2005_
28.s/3
- {AI05-0015-1AI05-0015-1} {AI05-0144-2AI05-0144-2} The return
- object of an extended_return_statement can be declared
+ {<AI05-0015-1AI05-0015-1>} {<AI05-0144-2AI05-0144-2>} The
+ return object of an extended_return_statement can be declared
constant; this works similarly to a constant object
declaration.
28.t/3
- {AI05-0032-1AI05-0032-1} Added wording to allow the
+ {<AI05-0032-1AI05-0032-1>} Added wording to allow the
return_subtype_indication to have a specific type if the
return subtype of the function is class-wide. Specifying the
(specific) type of the return object is awkward without this
@@ -34222,27 +34340,27 @@ Examples of return statements:
_Wording Changes from Ada 2005_
28.u/3
- {AI05-0024-1AI05-0024-1} Correction: Corrected the master
+ {<AI05-0024-1AI05-0024-1>} Correction: Corrected the master
check for tags since the masters may be for different tasks
and thus incomparable.
28.v/3
- {AI05-0058-1AI05-0058-1} Correction: Corrected the wording
+ {<AI05-0058-1AI05-0058-1>} Correction: Corrected the wording
defining returns for extended_return_statements, since leaving
by an exit or goto is considered "normal" completion of the
statement.
28.w/3
- {AI05-0205-1AI05-0205-1} {AI05-0277-1AI05-0277-1} Correction:
- Added the extended_return_object_declaration to make other
- rules easier to write and eliminate the problem described in
- AI05-0205-1.
+ {<AI05-0205-1AI05-0205-1>} {<AI05-0277-1AI05-0277-1>}
+ Correction: Added the extended_return_object_declaration to
+ make other rules easier to write and eliminate the problem
+ described in AI05-0205-1.
_Wording Changes from Ada 2012_
28.x/4
- {AI05-0097-1AI05-0097-1} Corrigendum: Clarified the wording so
- that it is clear where the tag of the return object comes
+ {<AI05-0097-1AI05-0097-1>} Corrigendum: Clarified the wording
+ so that it is clear where the tag of the return object comes
from. While a literal reading of the original Ada 2012 rule
could have caused some weird results (by using some nearby
subtype_indication to provide the tag in the case of a
@@ -34264,8 +34382,8 @@ File: aarm2012.info, Node: 6.5.1, Up: 6.5
-----------------------------
1/3
-{AI95-00329-01AI95-00329-01} {AI95-00414-01AI95-00414-01}
-{AI05-0229-1AI05-0229-1} Specifying aspect No_Return to have the value
+{<AI95-00329-01AI95-00329-01>} {<AI95-00414-01AI95-00414-01>}
+{<AI05-0229-1AI05-0229-1>} Specifying aspect No_Return to have the value
True indicates that a procedure cannot return normally[; it may
propagate an exception or loop forever].
@@ -34273,20 +34391,20 @@ propagate an exception or loop forever].
Discussion: Aspect No_Deposit will have to wait for Ada 2020.
:-)
-Paragraphs 2 and 3 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 and 3 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
3.1/3
-{AI05-0229-1AI05-0229-1} For a procedure or generic procedure, the
+{<AI05-0229-1AI05-0229-1>} For a procedure or generic procedure, the
following language-defined representation aspect may be specified:
3.2/3
No_Return
The type of aspect No_Return is Boolean. When aspect
No_Return is True for an entity, the entity is said to be
- nonreturning.
+ <nonreturning>.
3.3/3
If directly specified, the aspect_definition shall be a
@@ -34298,16 +34416,16 @@ No_Return
normally.
3.4/3
-{AI05-0229-1AI05-0229-1} If a generic procedure is nonreturning, then so
-are its instances. If a procedure declared within a generic unit is
+{<AI05-0229-1AI05-0229-1>} If a generic procedure is nonreturning, then
+so are its instances. If a procedure declared within a generic unit is
nonreturning, then so are the corresponding copies of that procedure in
instances.
_Legality Rules_
4/3
-{AI95-00329-01AI95-00329-01} {AI95-00414-01AI95-00414-01}
-{AI05-0229-1AI05-0229-1} Aspect No_Return shall not be specified for a
+{<AI95-00329-01AI95-00329-01>} {<AI95-00414-01AI95-00414-01>}
+{<AI05-0229-1AI05-0229-1>} Aspect No_Return shall not be specified for a
null procedure nor an instance of a generic unit.
4.a/2
@@ -34316,19 +34434,19 @@ null procedure nor an instance of a generic unit.
loop forever.
4.b/3
- Ramification: {AI05-0229-1AI05-0229-1} The procedure can be
+ Ramification: {<AI05-0229-1AI05-0229-1>} The procedure can be
abstract. If a nonreturning procedure is renamed (anywhere)
calls through the new name still have the nonreturning
semantics.
5/2
-{AI95-00329-01AI95-00329-01} {AI95-00414-01AI95-00414-01} A return
+{<AI95-00329-01AI95-00329-01>} {<AI95-00414-01AI95-00414-01>} A return
statement shall not apply to a nonreturning procedure or generic
procedure.
6/2
-{AI95-00414-01AI95-00414-01} A procedure shall be nonreturning if it
-overrides a dispatching nonreturning procedure. In addition to the
+{<AI95-00414-01AI95-00414-01>} A procedure shall be nonreturning if it
+overrides a dispatching nonreturning procedure. In addition to the
places where Legality Rules normally apply (see *note 12.3::), this rule
applies also in the private part of an instance of a generic unit.
@@ -34337,7 +34455,7 @@ applies also in the private part of an instance of a
generic unit.
procedures will, in fact, not return.
7/2
-{AI95-00414-01AI95-00414-01} If a renaming-as-body completes a
+{<AI95-00414-01AI95-00414-01>} If a renaming-as-body completes a
nonreturning procedure declaration, then the renamed procedure shall be
nonreturning.
@@ -34346,14 +34464,14 @@ nonreturning.
the renames (that is, no wrapper is needed) as the body has
the same property.
-Paragraph 8 was deleted.
+<Paragraph 8 was deleted.>
_Dynamic Semantics_
9/2
-{AI95-00329-01AI95-00329-01} {AI95-00414-01AI95-00414-01} If the body of
-a nonreturning procedure completes normally, Program_Error is raised at
-the point of the call.
+{<AI95-00329-01AI95-00329-01>} {<AI95-00414-01AI95-00414-01>} If the
+body of a nonreturning procedure completes normally, Program_Error is
+raised at the point of the call.
9.a/2
Discussion: Note that there is no name for suppressing this
@@ -34386,20 +34504,20 @@ the point of the call.
_Examples_
10/3
- {AI95-00433-01AI95-00433-01} {AI05-0229-1AI05-0229-1} procedure Fail(Msg
: String) -- raises Fatal_Error exception
+ {<AI95-00433-01AI95-00433-01>} {<AI05-0229-1AI05-0229-1>} procedure
Fail(Msg : String) --< raises Fatal_Error exception>
with No_Return;
- -- Inform compiler and reader that procedure never returns normally
+ --< Inform compiler and reader that procedure never returns normally>
_Extensions to Ada 95_
10.a/2
- {AI95-00329-01AI95-00329-01} {AI95-00414-01AI95-00414-01}
+ {<AI95-00329-01AI95-00329-01>} {<AI95-00414-01AI95-00414-01>}
Pragma No_Return is new.
_Extensions to Ada 2005_
10.b/3
- {AI05-0229-1AI05-0229-1} Aspect No_Return is new; pragma
+ {<AI05-0229-1AI05-0229-1>} Aspect No_Return is new; pragma
No_Return is now obsolescent.
@@ -34409,19 +34527,19 @@ File: aarm2012.info, Node: 6.6, Next: 6.7, Prev:
6.5, Up: 6
============================
1
-An operator is a function whose designator is an operator_symbol.
+An <operator> is a function whose designator is an operator_symbol.
[Operators, like other functions, may be overloaded.]
_Name Resolution Rules_
2
Each use of a unary or binary operator is equivalent to a function_call
-with function_prefix being the corresponding operator_symbol, and with
+with <function_>prefix being the corresponding operator_symbol, and with
(respectively) one or two positional actual parameters being the
operand(s) of the operator (in order).
2.a/3
- To be honest: {AI05-0299-1AI05-0299-1} We also use the term
+ To be honest: {<AI05-0299-1AI05-0299-1>} We also use the term
operator (in Clause 4 and in *note 6.1::) to refer to one of
the syntactic categories defined in *note 4.5::, "*note 4.5::
Operators and Expression Evaluation" whose names end with
@@ -34433,8 +34551,8 @@ operand(s) of the operator (in order).
highest_precedence_operator (*note 4.5: S0132.).
2.b/3
- Discussion: {AI05-0005-1AI05-0005-1} This equivalence extends
- to uses of function_call in most other language rules.
+ Discussion: {<AI05-0005-1AI05-0005-1>} This equivalence
+ extends to uses of function_call in most other language rules.
However, as often happens, the equivalence is not perfect, as
operator calls are not a name, while a function_call is a
name. Thus, operator calls cannot be used in contexts that
@@ -34446,7 +34564,7 @@ operand(s) of the operator (in order).
_Legality Rules_
3/3
-{AI05-0143-1AI05-0143-1} The subprogram_specification of a unary or
+{<AI05-0143-1AI05-0143-1>} The subprogram_specification of a unary or
binary operator shall have one or two parameters, respectively. The
parameters shall be of mode in. A generic function instantiation whose
designator is an operator_symbol is only allowed if the specification of
@@ -34465,16 +34583,16 @@ predefined type Boolean.
_Static Semantics_
6/3
-{AI05-0128-1AI05-0128-1} An explicit declaration of "=" whose result
+{<AI05-0128-1AI05-0128-1>} An explicit declaration of "=" whose result
type is Boolean implicitly declares an operator "/=" that gives the
complementary result.
6.a/3
- Discussion: {AI05-0128-1AI05-0128-1} A "/=" defined by this
+ Discussion: {<AI05-0128-1AI05-0128-1>} A "/=" defined by this
rule is considered user-defined, which means that it will be
inherited by a derived type. "User-defined" means "not
language-defined" for the purposes of inheritance, that is
- anything other than predefined operators.
+ anything other than predefined operators.
NOTES
@@ -34486,14 +34604,14 @@ complementary result.
_Examples_
8
-Examples of user-defined operators:
+<Examples of user-defined operators:>
9
function "+" (Left, Right : Matrix) return Matrix;
function "+" (Left, Right : Vector) return Vector;
- -- assuming that A, B, and C are of the type Vector
- -- the following two statements are equivalent:
+ --< assuming that A, B, and C are of the type Vector>
+ --< the following two statements are equivalent:>
A := B + C;
A := "+"(B, C);
@@ -34511,16 +34629,16 @@ Examples of user-defined operators:
_Wording Changes from Ada 2005_
9.c/3
- {AI05-0128-1AI05-0128-1} Correction: Corrected the wording so
- that only explicit declarations of "=" cause an implicit
+ {<AI05-0128-1AI05-0128-1>} Correction: Corrected the wording
+ so that only explicit declarations of "=" cause an implicit
declaration of "/="; otherwise, we could get multiple implicit
definitions of "/=" without an obvious way to chose between
them.
9.d/3
- {AI05-0143-1AI05-0143-1} Added wording so that operators only
- allow parameters of mode in. This was made necessary by the
- elimination elsewhere of the restriction that function
+ {<AI05-0143-1AI05-0143-1>} Added wording so that operators
+ only allow parameters of mode in. This was made necessary by
+ the elimination elsewhere of the restriction that function
parameters be only of mode in.
@@ -34530,13 +34648,13 @@ File: aarm2012.info, Node: 6.7, Next: 6.8, Prev:
6.6, Up: 6
===================
1/2
-{AI95-00348-01AI95-00348-01} A null_procedure_declaration provides a
+{<AI95-00348-01AI95-00348-01>} A null_procedure_declaration provides a
shorthand to declare a procedure with an empty body.
_Syntax_
2/3
- {AI95-00348-01AI95-00348-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00348-01AI95-00348-01>} {<AI05-0183-1AI05-0183-1>}
null_procedure_declaration ::=
[overriding_indicator]
procedure_specification is null
@@ -34545,7 +34663,7 @@ shorthand to declare a procedure with an empty body.
_Legality Rules_
2.1/3
-{AI05-0177-1AI05-0177-1} If a null_procedure_declaration is a
+{<AI05-0177-1AI05-0177-1>} If a null_procedure_declaration is a
completion, it shall be the completion of a subprogram_declaration or
generic_subprogram_declaration. The profile of a
null_procedure_declaration that completes a declaration shall conform
@@ -34554,9 +34672,9 @@ fully to that of the declaration.
_Static Semantics_
3/3
-{AI95-00348-01AI95-00348-01} {AI05-0177-1AI05-0177-1}
-{AI05-0264-1AI05-0264-1} A null_procedure_declaration declares a null
-procedure. A completion is not allowed for a
+{<AI95-00348-01AI95-00348-01>} {<AI05-0177-1AI05-0177-1>}
+{<AI05-0264-1AI05-0264-1>} A null_procedure_declaration declares a <null
+procedure>. A completion is not allowed for a
null_procedure_declaration; however, a null_procedure_declaration can
complete a previous declaration.
@@ -34569,7 +34687,7 @@ complete a previous declaration.
_Dynamic Semantics_
4/2
-{AI95-00348-01AI95-00348-01} The execution of a null procedure is
+{<AI95-00348-01AI95-00348-01>} The execution of a null procedure is
invoked by a subprogram call. For the execution of a subprogram call on
a null procedure, the execution of the subprogram_body has no effect.
@@ -34586,31 +34704,32 @@ a null procedure, the execution of the
subprogram_body has no effect.
of a procedure specification.
5/3
-{AI95-00348-01AI95-00348-01} {AI05-0177-1AI05-0177-1} The elaboration of
-a null_procedure_declaration has no other effect than to establish that
-the null procedure can be called without failing the Elaboration_Check.
+{<AI95-00348-01AI95-00348-01>} {<AI05-0177-1AI05-0177-1>} The
+elaboration of a null_procedure_declaration has no other effect than to
+establish that the null procedure can be called without failing the
+Elaboration_Check.
_Examples_
6/2
- {AI95-00433-01AI95-00433-01} procedure Simplify(Expr : in out Expression)
is null; -- see *note 3.9::
- -- By default, Simplify does nothing, but it may be overridden in
extensions of Expression
+ {<AI95-00433-01AI95-00433-01>} procedure Simplify(Expr : in out
Expression) is null; --< see *note 3.9::>
+ --< By default, Simplify does nothing, but it may be overridden in
extensions of Expression>
_Extensions to Ada 95_
6.a/2
- {AI95-00348-01AI95-00348-01} Null procedures are new.
+ {<AI95-00348-01AI95-00348-01>} Null procedures are new.
_Extensions to Ada 2005_
6.b/3
- {AI05-0177-1AI05-0177-1} A null_procedure_declaration can now
- be a completion.
+ {<AI05-0177-1AI05-0177-1>} A null_procedure_declaration can
+ now be a completion.
6.c/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a null_procedure_declaration. This is described in
- *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a null_procedure_declaration. This is
+ described in *note 13.1.1::.
File: aarm2012.info, Node: 6.8, Prev: 6.7, Up: 6
@@ -34619,14 +34738,14 @@ File: aarm2012.info, Node: 6.8, Prev: 6.7, Up: 6
========================
1/3
-{AI05-0177-1AI05-0177-1} An expression_function_declaration provides a
+{<AI05-0177-1AI05-0177-1>} An expression_function_declaration provides a
shorthand to declare a function whose body consists of a single return
statement.
_Syntax_
2/4
- {AI95-0177-1AI95-0177-1} {AI95-0147-1AI95-0147-1}
+ {<AI95-0177-1AI95-0177-1>} {<AI95-0147-1AI95-0147-1>}
expression_function_declaration ::=
[overriding_indicator]
function_specification is
@@ -34640,24 +34759,25 @@ statement.
_Name Resolution Rules_
3/4
-{AI05-0177-1AI05-0177-1} {AI95-0147-1AI95-0147-1} The expected type for
-the expression or aggregate of an expression_function_declaration (*note
-6.8: S0189.) is the result type (see *note 6.5::) of the function.
+{<AI05-0177-1AI05-0177-1>} {<AI95-0147-1AI95-0147-1>} The expected type
+for the expression or aggregate of an expression_function_declaration
+(*note 6.8: S0189.) is the result type (see *note 6.5::) of the
+function.
_Legality Rules_
4/3
-{AI05-0177-1AI05-0177-1} If an expression_function_declaration (*note
+{<AI05-0177-1AI05-0177-1>} If an expression_function_declaration (*note
6.8: S0189.) is a completion, it shall be the completion of a
subprogram_declaration or generic_subprogram_declaration. The profile
of an expression_function_declaration (*note 6.8: S0189.) that completes
a declaration shall conform fully to that of the declaration.
5/4
-{AI05-0177-1AI05-0177-1} {AI95-0147-1AI95-0147-1} If the result subtype
-has one or more unconstrained access discriminants, the accessibility
-level of the anonymous access type of each access discriminant, as
-determined by the expression or aggregate of the
+{<AI05-0177-1AI05-0177-1>} {<AI95-0147-1AI95-0147-1>} If the result
+subtype has one or more unconstrained access discriminants, the
+accessibility level of the anonymous access type of each access
+discriminant, as determined by the expression or aggregate of the
expression_function_declaration (*note 6.8: S0189.), shall not be
statically deeper than that of the master that elaborated the
expression_function_declaration (*note 6.8: S0189.).
@@ -34668,7 +34788,7 @@ expression_function_declaration (*note 6.8: S0189.).
no local declarations here.
5.b/4
- Discussion: {AI12-0005-1AI12-0005-1} We don't need to repeat
+ Discussion: {<AI12-0005-1AI12-0005-1>} We don't need to repeat
any of the other Legality Rules for return statements since
none of them can fail here: the implicit return statement has
to apply to this function (and isn't nested in something),
@@ -34679,10 +34799,10 @@ expression_function_declaration (*note 6.8: S0189.).
_Static Semantics_
6/4
-{AI05-0177-1AI05-0177-1} {AI05-0264-1AI05-0264-1}
-{AI95-0147-1AI95-0147-1} An expression_function_declaration (*note 6.8:
-S0189.) declares an expression function. The return expression of an
-expression function is the expression or aggregate of the
+{<AI05-0177-1AI05-0177-1>} {<AI05-0264-1AI05-0264-1>}
+{<AI95-0147-1AI95-0147-1>} An expression_function_declaration (*note
+6.8: S0189.) declares an <expression function>. The <return expression>
+of an expression function is the expression or aggregate of the
expression_function_declaration. A completion is not allowed for an
expression_function_declaration (*note 6.8: S0189.); however, an
expression_function_declaration (*note 6.8: S0189.) can complete a
@@ -34691,8 +34811,8 @@ previous declaration.
_Dynamic Semantics_
7/4
-{AI05-0177-1AI05-0177-1} {AI05-0262-1AI05-0262-1}
-{AI95-0147-1AI95-0147-1} The execution of an expression function is
+{<AI05-0177-1AI05-0177-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI95-0147-1AI95-0147-1>} The execution of an expression function is
invoked by a subprogram call. For the execution of a subprogram call on
an expression function, the execution of the subprogram_body executes an
implicit function body containing only a simple_return_statement whose
@@ -34704,7 +34824,7 @@ expression is the return expression of the expression
function.
don't have to repeat it here.
8/3
-{AI05-0177-1AI05-0177-1} The elaboration of an
+{<AI05-0177-1AI05-0177-1>} The elaboration of an
expression_function_declaration (*note 6.8: S0189.) has no other effect
than to establish that the expression function can be called without
failing the Elaboration_Check.
@@ -34712,19 +34832,19 @@ failing the Elaboration_Check.
_Examples_
9/3
- {AI05-0177-1AI05-0177-1} function Is_Origin (P : in Point) return Boolean
is -- see *note 3.9::
+ {<AI05-0177-1AI05-0177-1>} function Is_Origin (P : in Point) return
Boolean is -- <see *note 3.9::>
(P.X = 0.0 and P.Y = 0.0);
_Extensions to Ada 2005_
9.a/3
- {AI05-0177-1AI05-0177-1} Expression functions are new in Ada
+ {<AI05-0177-1AI05-0177-1>} Expression functions are new in Ada
2012.
_Extensions to Ada 2012_
9.b/4
- {AI12-0157-1AI12-0157-1} A aggregate can directly be the
+ {<AI12-0157-1AI12-0157-1>} A aggregate can directly be the
return expression of an expression function. This eliminates
the double parentheses that otherwise would be necessary.
@@ -34740,7 +34860,7 @@ logically related entities. Typically, a package
contains the
declaration of a type (often a private type or private extension) along
with the declarations of primitive subprograms of the type, which can be
called from outside the package, while their inner workings remain
-hidden from outside users. ]
+hidden from outside users. ]
* Menu:
@@ -34768,7 +34888,7 @@ all packages have a package_body.]
package_declaration ::= package_specification;
3/3
- {AI05-0183-1AI05-0183-1} package_specification ::=
+ {<AI05-0183-1AI05-0183-1>} package_specification ::=
package defining_program_unit_name
[aspect_specification] is
{basic_declarative_item}
@@ -34784,13 +34904,13 @@ all packages have a package_body.]
_Legality Rules_
5/2
-{AI95-00434-01AI95-00434-01} A package_declaration or
+{<AI95-00434-01AI95-00434-01>} A package_declaration or
generic_package_declaration requires a completion [(a body)] if it
contains any basic_declarative_item that requires a completion, but
whose completion is not in its package_specification.
5.a/3
- To be honest: {AI05-0229-1AI05-0229-1} If an implementation
+ To be honest: {<AI05-0229-1AI05-0229-1>} If an implementation
supports it, the body of a package or generic package may be
imported (using aspect Import, see *note B.1::), in which case
no explicit body is allowed.
@@ -34798,14 +34918,15 @@ whose completion is not in its package_specification.
_Static Semantics_
6/2
-{AI95-00420-01AI95-00420-01} {AI95-00434-01AI95-00434-01} The first list
-of basic_declarative_items of a package_specification of a package other
-than a generic formal package is called the visible part of the package.
-[ The optional list of basic_declarative_items after the reserved word
-private (of any package_specification) is called the private part of the
-package. If the reserved word private does not appear, the package has
-an implicit empty private part.] Each list of basic_declarative_items
-of a package_specification forms a declaration list of the package.
+{<AI95-00420-01AI95-00420-01>} {<AI95-00434-01AI95-00434-01>} The first
+list of basic_declarative_items of a package_specification of a package
+other than a generic formal package is called the <visible part> of the
+package. [ The optional list of basic_declarative_items after the
+reserved word private (of any package_specification) is called the
+<private part> of the package. If the reserved word private does not
+appear, the package has an implicit empty private part.] Each list of
+basic_declarative_items of a package_specification forms a <declaration
+list> of the package.
6.a
Ramification: This definition of visible part does not apply
@@ -34857,7 +34978,7 @@ its basic_declarative_items in the given order.
_Examples_
11
-Example of a package declaration:
+<Example of a package declaration:>
12
package Rational_Numbers is
@@ -34873,7 +34994,7 @@ Example of a package declaration:
function "="(X,Y : Rational) return Boolean;
15
- function "/" (X,Y : Integer) return Rational; -- to construct a
rational number
+ function "/" (X,Y : Integer) return Rational; --< to construct a
rational number>
16
function "+" (X,Y : Rational) return Rational;
@@ -34899,7 +35020,7 @@ language environment (see *note Annex A::).
_Wording Changes from Ada 83_
17.b/3
- {AI05-0299-1AI05-0299-1} We have moved the syntax into this
+ {<AI05-0299-1AI05-0299-1>} We have moved the syntax into this
subclause and the next subclause from RM83-7.1, "Package
Structure", which we have removed.
@@ -34916,15 +35037,15 @@ language environment (see *note Annex A::).
_Wording Changes from Ada 95_
17.d/2
- {AI95-00420-01AI95-00420-01} Defined "declaration list" to
+ {<AI95-00420-01AI95-00420-01>} Defined "declaration list" to
avoid ambiguity in other rules as to whether packages are
included.
_Extensions to Ada 2005_
17.e/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a package_specification. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a package_specification. This is described in
*note 13.1.1::.
@@ -34944,7 +35065,7 @@ from the internal entities.]
_Syntax_
2/3
- {AI05-0267-1AI05-0267-1} package_body ::=
+ {<AI05-0267-1AI05-0267-1>} package_body ::=
package body defining_program_unit_name
[aspect_specification] is
declarative_part
@@ -34981,15 +35102,15 @@ a library_unit_declaration (*note 10.1.1: S0249.) to
have a body (see
_Static Semantics_
5/3
-{AI05-0299-1AI05-0299-1} In any package_body without statements there is
-an implicit null_statement (*note 5.1: S0149.). For any
+{<AI05-0299-1AI05-0299-1>} In any package_body without statements there
+is an implicit null_statement (*note 5.1: S0149.). For any
package_declaration (*note 7.1: S0190.) without an explicit completion,
there is an implicit package_body (*note 7.2: S0192.) containing a
single null_statement. For a noninstance, nonlibrary package, this body
occurs at the end of the declarative_part (*note 3.11: S0086.) of the
innermost enclosing program unit or block_statement (*note 5.6: S0160.);
if there are several such packages, the order of the implicit
-package_bodies is unspecified. [(For an instance, the implicit
+package_bodies is unspecified. [(For an instance, the implicit
package_body (*note 7.2: S0192.) occurs at the place of the
instantiation (see *note 12.3::). For a library package, the place is
partially determined by the elaboration dependences (see Clause *note
@@ -35037,7 +35158,7 @@ handled_sequence_of_statements (*note 11.2: S0265.) is
then executed.
_Examples_
9
-Example of a package body (see *note 7.1::):
+<Example of a package body (see *note 7.1::):>
10
package body Rational_Numbers is
@@ -35045,7 +35166,7 @@ Example of a package body (see *note 7.1::):
11
procedure Same_Denominator (X,Y : in out Rational) is
begin
- -- reduces X and Y to the same denominator:
+ --< reduces X and Y to the same denominator:>
...
end Same_Denominator;
@@ -35105,8 +35226,8 @@ Example of a package body (see *note 7.1::):
_Extensions to Ada 2005_
15.f/3
- {AI05-0267-1AI05-0267-1} An optional aspect_specification can
- be used in a package_body. This is described in *note
+ {<AI05-0267-1AI05-0267-1>} An optional aspect_specification
+ can be used in a package_body. This is described in *note
13.1.1::.
@@ -35121,7 +35242,7 @@ private type or private extension serves to separate
the characteristics
that can be used directly by outside program units (that is, the logical
properties) from other characteristics whose direct use is confined to
the package (the details of the definition of the type itself). See
-*note 3.9.1:: for an overview of type extensions. ]
+*note 3.9.1:: for an overview of type extensions. ]
_Language Design Principles_
@@ -35141,17 +35262,17 @@ the package (the details of the definition of the
type itself). See
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} private_type_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} private_type_declaration ::=
type defining_identifier [
discriminant_part] is [[abstract] tagged] [limited] private
[aspect_specification];
3/3
- {AI95-00251-01AI95-00251-01} {AI95-00419-01AI95-00419-01}
- {AI95-00443-01AI95-00443-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00419-01AI95-00419-01>}
+ {<AI95-00443-01AI95-00443-01>} {<AI05-0183-1AI05-0183-1>}
private_extension_declaration ::=
type defining_identifier [discriminant_part] is
- [abstract] [limited | synchronized] new ancestor_
+ [abstract] [limited | synchronized] new <ancestor_>
subtype_indication
[and interface_list] with private
[aspect_specification];
@@ -35160,12 +35281,12 @@ the package (the details of the definition of the
type itself). See
4
A private_type_declaration or private_extension_declaration declares a
-partial view of the type; such a declaration is allowed only as a
+<partial view> of the type; such a declaration is allowed only as a
declarative_item of the visible part of a package, and it requires a
completion, which shall be a full_type_declaration that occurs as a
declarative_item of the private part of the package. [ The view of the
-type declared by the full_type_declaration is called the full view.] A
-generic formal private type or a generic formal private extension is
+type declared by the full_type_declaration is called the <full view>.]
+A generic formal private type or a generic formal private extension is
also a partial view.
4.a
@@ -35175,11 +35296,11 @@ also a partial view.
4.b
Reason: We originally used the term "private view," but this
- was easily confused with the view provided from the private
+ was easily confused with the view provided <from> the private
part, namely the full view.
4.c/2
- Proof: {AI95-00326-01AI95-00326-01} Full view is now defined
+ Proof: {<AI95-00326-01AI95-00326-01>} Full view is now defined
in *note 3.2.1::, "*note 3.2.1:: Type Declarations", as all
types now have them.
@@ -35197,7 +35318,7 @@ representation item.]
"*note 3.11.1:: Completions of Declarations".
6/2
-{AI95-00419-01AI95-00419-01} {AI95-00443-01AI95-00443-01} [A private
+{<AI95-00419-01AI95-00419-01>} {<AI95-00443-01AI95-00443-01>} [A private
type is limited if its declaration includes the reserved word limited; a
private extension is limited if its ancestor type is a limited type that
is not an interface type, or if the reserved word limited or
@@ -35247,7 +35368,7 @@ the full view are allowed.]
than using the "assume the best" or "assume the worst" method.
7.d/2
- Reason: {AI95-00230-01AI95-00230-01} Tagged limited private
+ Reason: {<AI95-00230-01AI95-00230-01>} Tagged limited private
types have certain capabilities that are incompatible with
having assignment for the full view of the type. In
particular, tagged limited private types can be extended with
@@ -35259,8 +35380,8 @@ the full view are allowed.]
type T1 is tagged limited private;
procedure Foo(X : in T1'Class);
private
- type T1 is tagged null record; -- Illegal!
- -- This should say "tagged limited null record".
+ type T1 is tagged null record; --< Illegal!>
+ --< This should say "tagged limited null record".>
end P1;
7.f/1
@@ -35270,18 +35391,18 @@ the full view are allowed.]
procedure Foo(X : in T1'Class) is
begin
Global := new T1'Class'(X);
- -- This would be illegal if the full view of
- -- T1 were limited, like it's supposed to be.
+ --< This would be illegal if the full view of>
+ --< T1 were limited, like it's supposed to be.>
end Foo;
end P1;
7.g/2
- {AI95-00230-01AI95-00230-01} with P1;
+ {<AI95-00230-01AI95-00230-01>} with P1;
package P2 is
type T2(D : access Integer)
is new P1.T1 with
record
- My_Task : Some_Task_Type; -- Trouble!
+ My_Task : Some_Task_Type; --< Trouble!>
end record;
end P2;
@@ -35294,12 +35415,12 @@ the full view are allowed.]
begin
P1.Foo(Y);
end Main;
-
+
7.i/2
- {AI95-00230-01AI95-00230-01} If the above example were legal,
- we would have succeeded in doing an assignment of a task
- object, which is supposed to be a no-no.
+ {<AI95-00230-01AI95-00230-01>} If the above example were
+ legal, we would have succeeded in doing an assignment of a
+ task object, which is supposed to be a no-no.
7.j
This rule is not needed for private extensions, because they
@@ -35331,10 +35452,10 @@ the full view are allowed.]
7.n
with Q; use Q;
package body P is
- ... T'Class ... -- Illegal!
+ ... T'Class ... --< Illegal!>
Object: T;
- ... Object.X ... -- Illegal!
- ... Parent(Object).X ... -- OK.
+ ... Object.X ... --< Illegal!>
+ ... Parent(Object).X ... --< OK.>
end P;
7.o
@@ -35345,7 +35466,7 @@ the full view are allowed.]
can get one's hands on it via a type_conversion.
7.1/2
-{AI95-00396-01AI95-00396-01} If a full type has a partial view that is
+{<AI95-00396-01AI95-00396-01>} If a full type has a partial view that is
tagged, then:
7.2/2
@@ -35383,17 +35504,17 @@ tagged, then:
type T1 is new Parent_1 with private;
private
type Parent_2 is new Parent_1 and Pkg.Ifc with null record;
- procedure Foo (X : Parent_2); -- Foo #1
+ procedure Foo (X : Parent_2); -- <Foo #1>
7.t/2
- type T1 is new Parent_2 with null record; -- Illegal.
+ type T1 is new Parent_2 with null record; -- <Illegal.>
end P;
7.u/2
with P;
package P_Client is
type T2 is new P.T1 and P.Pkg.Ifc with null record;
- procedure Foo (X : T2); -- Foo #2
+ procedure Foo (X : T2); -- <Foo #2>
X : T2;
end P_Client;
@@ -35405,12 +35526,12 @@ tagged, then:
7.w/2
procedure Bar (X : T1'Class) is
begin
- Pkg.Foo (X); -- should call Foo #1 or an override thereof
+ Pkg.Foo (X); -- <should call Foo #1 or an override
thereof>
end;
7.x/2
begin
- Pkg.Foo (Pkg.Ifc'Class (P_Client.X)); -- should call
Foo #2
+ Pkg.Foo (Pkg.Ifc'Class (P_Client.X)); -- <should call
Foo #2>
Bar (T1'Class (P_Client.X));
end P;
@@ -35459,18 +35580,19 @@ tagged, then:
choose.
7.cc/3
- Ramification: {AI05-0005-1AI05-0005-1} This rule also prevents
- completing a private type with an interface. An interface,
- like all types, is a descendant of itself, and thus this rule
- is triggered. One reason this is necessary is that a client
- of a private extension should be able to inherit limitedness
- without having to look in the private part to see if the type
- is an interface (remember that limitedness of interfaces is
- never inherited, while it is inherited from other types).
+ Ramification: {<AI05-0005-1AI05-0005-1>} This rule also
+ prevents completing a private type with an interface. An
+ interface, like all types, is a descendant of itself, and thus
+ this rule is triggered. One reason this is necessary is that
+ a client of a private extension should be able to inherit
+ limitedness without having to look in the private part to see
+ if the type is an interface (remember that limitedness of
+ interfaces is never inherited, while it is inherited from
+ other types).
8
-The ancestor subtype of a private_extension_declaration is the subtype
-defined by the ancestor_subtype_indication (*note 3.2.2: S0027.); the
+The <ancestor subtype> of a private_extension_declaration is the subtype
+defined by the <ancestor_>subtype_indication (*note 3.2.2: S0027.); the
ancestor type shall be a specific tagged type. The full view of a
private extension shall be derived (directly or indirectly) from the
ancestor type. In addition to the places where Legality Rules normally
@@ -35483,7 +35605,7 @@ applies also in the private part of an instance of a
generic unit.
types produced by generic_instantiations.
8.1/2
-{AI95-00419-01AI95-00419-01} {AI95-00443-01AI95-00443-01} If the
+{<AI95-00419-01AI95-00419-01>} {<AI95-00443-01AI95-00443-01>} If the
reserved word limited appears in a private_extension_declaration, the
ancestor type shall be a limited type. If the reserved word
synchronized appears in a private_extension_declaration, the ancestor
@@ -35493,7 +35615,7 @@ type shall be a limited interface.
If the declaration of a partial view includes a known_discriminant_part,
then the full_type_declaration shall have a fully conforming
[(explicit)] known_discriminant_part [(see *note 6.3.1::, "*note 6.3.1::
-Conformance Rules")]. [The ancestor subtype may be unconstrained; the
+Conformance Rules")]. [The ancestor subtype may be unconstrained; the
parent subtype of the full view is required to be constrained (see *note
3.7::).]
@@ -35516,9 +35638,9 @@ parent subtype of the full view is required to be
constrained (see *note
package P is
type T(D : Integer) is private;
private
- type T is new Some_Other_Type; -- Illegal!
+ type T is new Some_Other_Type; --< Illegal!>
end P;
-
+
9.e
even if Some_Other_Type has an integer discriminant called D.
@@ -35544,20 +35666,20 @@ constrained if and only if the ancestor subtype is
constrained.
the full view.
10.1/3
-{AI95-00419-01AI95-00419-01} {AI05-0004-1AI05-0004-1} If the
+{<AI95-00419-01AI95-00419-01>} {<AI05-0004-1AI05-0004-1>} If the
full_type_declaration for a private extension includes a
derived_type_definition, then the reserved word limited shall appear in
the full_type_declaration if and only if it also appears in the
private_extension_declaration.
10.b/3
- Reason: {AI05-0004-1AI05-0004-1} The word limited is optional
- (unless the ancestor is an interface), but it should be used
- consistently. Otherwise things would be too confusing for the
- reader. Of course, we only require that if the full type
- includes a derived_type_definition, as we want to allow task
- and protected types to complete extensions of synchronized
- interfaces.
+ Reason: {<AI05-0004-1AI05-0004-1>} The word limited is
+ optional (unless the ancestor is an interface), but it should
+ be used consistently. Otherwise things would be too confusing
+ for the reader. Of course, we only require that if the full
+ type includes a derived_type_definition, as we want to allow
+ task and protected types to complete extensions of
+ synchronized interfaces.
11
[If a partial view has unknown discriminants, then the
@@ -35571,7 +35693,7 @@ full_type_declaration shall define a definite subtype.
13
If the ancestor subtype of a private extension has constrained
discriminants, then the parent subtype of the full view shall impose a
-statically matching constraint on those discriminants.
+statically matching constraint on those discriminants.
13.a
Ramification: If the parent type of the full view is not the
@@ -35588,7 +35710,7 @@ statically matching constraint on those discriminants.
package P is
type T2 is new T1(Discrim => 3) with private;
private
- type T2 is new T1(Discrim => 999) -- Illegal!
+ type T2 is new T1(Discrim => 999) --< Illegal!>
with record ...;
end P;
@@ -35622,18 +35744,18 @@ statically matching constraint on those discriminants.
14
A private_type_declaration declares a private type and its first
-subtype. Similarly, a private_extension_declaration (*note 7.3: S0194.)
+subtype. Similarly, a private_extension_declaration (*note 7.3: S0194.)
declares a private extension and its first subtype.
14.a
- Discussion: A package-private type is one declared by a
+ Discussion: A <package-private type> is one declared by a
private_type_declaration; that is, a private type other than a
- generic formal private type. Similarly, a package-private
- extension is one declared by a private_extension_declaration.
+ generic formal private type. Similarly, a <package-private
+ extension> is one declared by a private_extension_declaration.
These terms are not used in the RM95 version of this document.
15/3
-{AI05-0269-1AI05-0269-1} A declaration of a partial view and the
+{<AI05-0269-1AI05-0269-1>} A declaration of a partial view and the
corresponding full_type_declaration define two views of a single type.
The declaration of a partial view together with the visible part define
the operations that are available to outside program units; the
@@ -35648,7 +35770,7 @@ attributes and other predefined operations are allowed,
and whether the
first subtype is static. See *note 7.3.1::.
16/3
-{AI95-00401-01AI95-00401-01} {AI05-0110-1AI05-0110-1} For a private
+{<AI95-00401-01AI95-00401-01>} {<AI05-0110-1AI05-0110-1>} For a private
extension, the characteristics (including components, but excluding
discriminants if there is a new discriminant_part specified), predefined
operators, and inherited user-defined primitive subprograms are
@@ -35658,9 +35780,9 @@ its parent type and its progenitor types (see *note
3.4:: and *note
7.3.1::).
16.a/3
- To be honest: {AI05-0110-1AI05-0110-1} If an operation of the
- ancestor or parent type is abstract, then the abstractness of
- the inherited operation is different for nonabstract record
+ To be honest: {<AI05-0110-1AI05-0110-1>} If an operation of
+ the ancestor or parent type is abstract, then the abstractness
+ of the inherited operation is different for nonabstract record
extensions than for nonabstract private extensions (see *note
3.9.3::).
@@ -35668,8 +35790,8 @@ its parent type and its progenitor types (see *note
3.4:: and *note
17
The elaboration of a private_type_declaration creates a partial view of
-a type. The elaboration of a private_extension_declaration elaborates
-the ancestor_subtype_indication, and creates a partial view of a type.
+a type. The elaboration of a private_extension_declaration elaborates
+the <ancestor_>subtype_indication, and creates a partial view of a type.
NOTES
@@ -35681,7 +35803,7 @@ the ancestor_subtype_indication, and creates a partial
view of a type.
view.
19/2
- 6 {AI95-00318-02AI95-00318-02} Declaring a private type with an
+ 6 {<AI95-00318-02AI95-00318-02>} Declaring a private type with an
unknown_discriminant_part is a way of preventing clients from
creating uninitialized objects of the type; they are then forced to
initialize each object by calling some operation declared in the
@@ -35730,7 +35852,7 @@ the ancestor_subtype_indication, and creates a partial
view of a type.
completion of a private type always declares a specific type.
20/2
- 7 {AI95-00401AI95-00401} The ancestor type specified in a
+ 7 {<AI95-00401AI95-00401>} The ancestor type specified in a
private_extension_declaration and the parent type specified in the
corresponding declaration of a record extension given in the
private part need not be the same. If the ancestor type is not an
@@ -35744,7 +35866,7 @@ the ancestor_subtype_indication, and creates a partial
view of a type.
view. See *note 3.9.2::.
20.1/2
- 8 {AI95-00401AI95-00401} If the ancestor type specified in a
+ 8 {<AI95-00401AI95-00401>} If the ancestor type specified in a
private_extension_declaration is an interface type, the parent type
can be any type so long as the full view is a descendant of the
ancestor type. The progenitor types specified in a
@@ -35757,14 +35879,14 @@ the ancestor_subtype_indication, and creates a
partial view of a type.
_Examples_
21
-Examples of private type declarations:
+<Examples of private type declarations:>
22
type Key is private;
type File_Name is limited private;
23
-Example of a private extension declaration:
+<Example of a private extension declaration:>
24
type List is new Ada.Finalization.Controlled with private;
@@ -35807,19 +35929,19 @@ Example of a private extension declaration:
_Extensions to Ada 95_
24.d/2
- {AI95-00251-01AI95-00251-01} {AI95-00396-01AI95-00396-01}
- {AI95-00401-01AI95-00401-01} Added interface_list to private
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00396-01AI95-00396-01>}
+ {<AI95-00401-01AI95-00401-01>} Added interface_list to private
extensions to support interfaces and multiple inheritance (see
*note 3.9.4::).
24.e/2
- {AI95-00419-01AI95-00419-01} A private extension may specify
+ {<AI95-00419-01AI95-00419-01>} A private extension may specify
that it is a limited type. This is required for interface
ancestors (from which limitedness is not inherited), but it is
generally useful as documentation of limitedness.
24.f/2
- {AI95-00443-01AI95-00443-01} A private extension may specify
+ {<AI95-00443-01AI95-00443-01>} A private extension may specify
that it is a synchronized type. This is required in order so
that a regular limited interface can be used as the ancestor
of a synchronized type (we do not allow hiding of
@@ -35828,18 +35950,18 @@ Example of a private extension declaration:
_Extensions to Ada 2005_
24.g/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a private_type_declaration and a
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a private_type_declaration and a
private_extension_declaration. This is described in *note
13.1.1::.
_Wording Changes from Ada 2005_
24.h/3
- {AI05-0110-1AI05-0110-1} Correction: The description of how a
- private extension inherits characteristics was made consistent
- with the way formal derived types inherit characteristics (see
- *note 12.5.1::).
+ {<AI05-0110-1AI05-0110-1>} Correction: The description of how
+ a private extension inherits characteristics was made
+ consistent with the way formal derived types inherit
+ characteristics (see *note 12.5.1::).
* Menu:
@@ -35855,8 +35977,8 @@ File: aarm2012.info, Node: 7.3.1, Next: 7.3.2, Up:
7.3
1
[For a type declared in the visible part of a package or generic
package, certain operations on the type do not become visible until
-later in the package -- either in the private part or the body. Such
-private operations are available only inside the declarative region of
+later in the package -- either in the private part or the body. Such
+<private operations> are available only inside the declarative region of
the package or generic package.]
_Static Semantics_
@@ -35871,66 +35993,67 @@ implicitly declared immediately after the definition
of the type, except
as stated below.
3/3
-{8652/00198652/0019} {AI95-00033-01AI95-00033-01}
-{AI05-0029-1AI05-0029-1} For a composite type, the characteristics (see
-*note 7.3::) of the type are determined in part by the characteristics
-of its component types. At the place where the composite type is
-declared, the only characteristics of component types used are those
-characteristics visible at that place. If later immediately within the
-declarative region in which the composite type is declared additional
-characteristics become visible for a component type, then any
-corresponding characteristics become visible for the composite type.
-Any additional predefined operators are implicitly declared at that
-place. If there is no such place, then additional predefined operators
-are not declared at all, but they still exist.
+{<8652/00198652/0019>} {<AI95-00033-01AI95-00033-01>}
+{<AI05-0029-1AI05-0029-1>} For a composite type, the characteristics
+(see *note 7.3::) of the type are determined in part by the
+characteristics of its component types. At the place where the
+composite type is declared, the only characteristics of component types
+used are those characteristics visible at that place. If later
+immediately within the declarative region in which the composite type is
+declared additional characteristics become visible for a component type,
+then any corresponding characteristics become visible for the composite
+type. Any additional predefined operators are implicitly declared at
+that place. If there is no such place, then additional predefined
+operators are not declared at all, but they still exist.
3.a/3
- Reason: {AI05-0029-1AI05-0029-1} We say that the predefined
+ Reason: {<AI05-0029-1AI05-0029-1>} We say that the predefined
operators exist because they can emerge in some unusual
generic instantiations. See *note 12.5::.
3.b/3
- Discussion: {AI05-0029-1AI05-0029-1} The predefined operators
- for the underlying class of a type always exist, even if there
- is no visibility on that underlying class. This rule is
- simply about where (if ever) those operators are declared (and
- thus become usable). The "additional predefined operators"
- defined by this rule are any that are not declared at the
- point of the original type declaration. For instance, a type
- derived from a private type whose full type is type String
- always will have a ">" operator, but where that operator is
- declared (and thus whether it is visible) will depend on the
- visibility of the full type of the parent type.
+ Discussion: {<AI05-0029-1AI05-0029-1>} The predefined
+ operators for the underlying class of a type always exist,
+ even if there is no visibility on that underlying class. This
+ rule is simply about where (if ever) those operators are
+ declared (and thus become usable). The "additional predefined
+ operators" defined by this rule are any that are not declared
+ at the point of the original type declaration. For instance,
+ a type derived from a private type whose full type is type
+ String always will have a ">" operator, but where that
+ operator is declared (and thus whether it is visible) will
+ depend on the visibility of the full type of the parent type.
4/1
-{8652/00198652/0019} {AI95-00033-01AI95-00033-01} The corresponding rule
-applies to a type defined by a derived_type_definition, if there is a
-place immediately within the declarative region in which the type is
+{<8652/00198652/0019>} {<AI95-00033-01AI95-00033-01>} The corresponding
+rule applies to a type defined by a derived_type_definition, if there is
+a place immediately within the declarative region in which the type is
declared where additional characteristics of its parent type become
visible.
5/1
-{8652/00198652/0019} {AI95-00033-01AI95-00033-01} [For example, an array
-type whose component type is limited private becomes nonlimited if the
-full view of the component type is nonlimited and visible at some later
-place immediately within the declarative region in which the array type
-is declared. In such a case, the predefined "=" operator is implicitly
-declared at that place, and assignment is allowed after that place.]
+{<8652/00198652/0019>} {<AI95-00033-01AI95-00033-01>} [For example, an
+array type whose component type is limited private becomes nonlimited if
+the full view of the component type is nonlimited and visible at some
+later place immediately within the declarative region in which the array
+type is declared. In such a case, the predefined "=" operator is
+implicitly declared at that place, and assignment is allowed after that
+place.]
5.1/3
-{AI05-0115-1AI05-0115-1} {AI05-0269-1AI05-0269-1} A type is a descendant
-of the full view of some ancestor of its parent type only if the current
-view it has of its parent is a descendant of the full view of that
-ancestor. More generally, at any given place, a type is descended from
-the same view of an ancestor as that from which the current view of its
-parent is descended. This view determines what characteristics are
-inherited from the ancestor[, and, for example, whether the type is
-considered to be a descendant of a record type, or a descendant only
-through record extensions of a more distant ancestor].
+{<AI05-0115-1AI05-0115-1>} {<AI05-0269-1AI05-0269-1>} A type is a
+<descendant> of the full view of some ancestor of its parent type only
+if the current view it has of its parent is a descendant of the full
+view of that ancestor. More generally, at any given place, a type is
+descended from the same view of an ancestor as that from which the
+current view of its parent is descended. This view determines what
+characteristics are inherited from the ancestor[, and, for example,
+whether the type is considered to be a descendant of a record type, or a
+descendant only through record extensions of a more distant ancestor].
5.2/4
-{AI05-0115-1AI05-0115-1} {AI12-0065-1AI12-0065-1} [Furthermore, it is
-possible for there to be places where a derived type is known to be
+{<AI05-0115-1AI05-0115-1>} {<AI12-0065-1AI12-0065-1>} [Furthermore, it
+is possible for there to be places where a derived type is known to be
derived indirectly from an ancestor type, but is not a descendant of
even a partial view of the ancestor type, because the parent of the
derived type is not visibly a descendant of the ancestor. In this case,
@@ -35938,7 +36061,7 @@ the derived type inherits no characteristics from that
ancestor, but
nevertheless is within the derivation class of the ancestor for the
purposes of type conversion, the "covers" relationship, and matching
against a formal derived type. In this case the derived type is
-effectively a descendant of an incomplete view of the ancestor.]
+effectively a <descendant> of an incomplete view of the ancestor.]
5.a/3
Discussion: Here is an example of this situation:
@@ -35953,32 +36076,32 @@ effectively a descendant of an incomplete view of the
ancestor.]
end P;
5.c/4
- {AI12-0065-1AI12-0065-1} with P;
+ {<AI12-0065-1AI12-0065-1>} with P;
package Q is
- type T2 is new P.T; -- T2 is not a descendant of Integer
+ type T2 is new P.T; -- <T2 is not a descendant of Integer>
end Q;
5.d/4
- {AI12-0065-1AI12-0065-1} with Q;
+ {<AI12-0065-1AI12-0065-1>} with Q;
package P.Child is
type T3 is new Q.T2;
private
- -- Here T3 is known to be indirectly derived from Integer,
but inherits
- -- no characteristics from Integer, since T2 inherits no
characteristics
- -- from Integer.
- -- However, we allow an explicit conversion of T3 to/from
Integer.
- -- Hence, T3 is effectively a descendant of an "incomplete"
view of Integer.
+ -- <Here T3 is known to be indirectly derived from Integer,
but inherits>
+ -- <no characteristics from Integer, since T2 inherits no
characteristics>
+ -- <from Integer.>
+ -- <However, we allow an explicit conversion of T3 to/from
Integer.>
+ -- <Hence, T3 is effectively a descendant of an
"incomplete" view of Integer.>
Int : Integer := 52;
- V : T3 := T3(P.C); -- Legal: conversion allowed
- W : T3 := T3(Int); -- Legal: conversion allowed
- X : T3 := T3(42); -- Error: T3 is not a numeric type
- Y : T3 := X + 1; -- Error: no visible "+" operator
- Z : T3 := T3(Integer(W) + 1); -- Legal: convert to
Integer first
+ V : T3 := T3(P.C); -- <Legal: conversion allowed>
+ W : T3 := T3(Int); -- <Legal: conversion allowed>
+ X : T3 := T3(42); -- <Error: T3 is not a numeric type>
+ Y : T3 := X + 1; -- <Error: no visible "+" operator>
+ Z : T3 := T3(Integer(W) + 1); -- <Legal: convert to
Integer first>
end P.Child;
6/3
-{8652/00198652/0019} {AI95-00033-01AI95-00033-01}
-{AI05-0029-1AI05-0029-1} Inherited primitive subprograms follow a
+{<8652/00198652/0019>} {<AI95-00033-01AI95-00033-01>}
+{<AI05-0029-1AI05-0029-1>} Inherited primitive subprograms follow a
different rule. For a derived_type_definition, each inherited primitive
subprogram is implicitly declared at the earliest place, if any,
immediately within the declarative region in which the type_declaration
@@ -36037,7 +36160,7 @@ extension, [though it might be for the full type].
7.h
package Parent.Child is
type T3 is new Root with null record;
- -- Op1(T3) implicitly declared here.
+ --< Op1(T3) implicitly declared here.>
7.i
package Nested is
@@ -36046,7 +36169,7 @@ extension, [though it might be for the full type].
...
end Nested;
private
- -- Op2(T3) implicitly declared here.
+ --< Op2(T3) implicitly declared here.>
...
end Parent.Child;
@@ -36054,7 +36177,7 @@ extension, [though it might be for the full type].
with Unrelated; use Unrelated;
package body Parent.Child is
package body Nested is
- -- Op2(T4) implicitly declared here.
+ --< Op2(T4) implicitly declared here.>
end Nested;
7.k
@@ -36121,29 +36244,29 @@ extension, [though it might be for the full type].
type A is array(Integer range <>) of Comp2;
private
type Comp2 is new Comp1;
- -- A becomes nonlimited here.
- -- "="(A, A) return Boolean is implicitly declared here.
+ --< A becomes nonlimited here.>
+ --< "="(A, A) return Boolean is implicitly declared
here.>
...
end R;
private
- -- Now we find out what Comp1 really is, which reveals
- -- more information about Comp2, but we're not within
- -- the immediate scope of Comp2, so we don't do anything
- -- about it yet.
+ --< Now we find out what Comp1 really is, which reveals>
+ --< more information about Comp2, but we're not within>
+ --< the immediate scope of Comp2, so we don't do anything>
+ --< about it yet.>
end P.Q;
7.v
package body P.Q is
package body R is
- -- Things like "xor"(A,A) return A are implicitly
- -- declared here.
+ --< Things like "xor"(A,A) return A are implicitly>
+ --< declared here.>
end R;
end P.Q;
7.v.1/1
- {8652/00198652/0019} {AI95-00033-01AI95-00033-01} We say
- immediately within the declarative region in order that types
- do not gain operations within a nested scope. Consider:
+ {<8652/00198652/0019>} {<AI95-00033-01AI95-00033-01>} We say
+ <immediately> within the declarative region in order that
+ types do not gain operations within a nested scope. Consider:
7.v.2/1
package Outer is
@@ -36200,7 +36323,7 @@ S'Class
objects.
12/2
- 10 {AI95-00287-01AI95-00287-01} Partial views provide
+ 10 {<AI95-00287-01AI95-00287-01>} Partial views provide
initialization, membership tests, selected components for the
selection of discriminants and inherited components, qualification,
and explicit conversion. Nonlimited partial views also allow use
@@ -36216,12 +36339,12 @@ S'Class
_Examples_
14
-Example of a type with private operations:
+<Example of a type with private operations:>
15
package Key_Manager is
type Key is private;
- Null_Key : constant Key; -- a deferred constant declaration (see *note
7.4::)
+ Null_Key : constant Key; --< a deferred constant declaration (see
*note 7.4::)>
procedure Get_Key(K : out Key);
function "<" (X, Y : Key) return Boolean;
private
@@ -36248,7 +36371,7 @@ Example of a type with private operations:
NOTES
18
- 12 Notes on the example: Outside of the package Key_Manager, the
+ 12 <Notes on the example:> Outside of the package Key_Manager, the
operations available for objects of type Key include assignment,
the comparison for equality or inequality, the procedure Get_Key
and the operator "<"; they do not include other relational
@@ -36282,24 +36405,25 @@ Example of a type with private operations:
_Wording Changes from Ada 95_
20.c/2
- {8652/00188652/0018} {AI95-00033-01AI95-00033-01} Corrigendum:
- Clarified when additional operations are declared.
+ {<8652/00188652/0018>} {<AI95-00033-01AI95-00033-01>}
+ Corrigendum: Clarified when additional operations are
+ declared.
20.d/2
- {AI95-00287-01AI95-00287-01} Revised the note on operations of
- partial views to reflect that limited types do have an
+ {<AI95-00287-01AI95-00287-01>} Revised the note on operations
+ of partial views to reflect that limited types do have an
assignment operation, but not assignment_statements.
_Wording Changes from Ada 2005_
20.e/3
- {AI05-0029-1AI05-0029-1} Correction: Revised the wording to
+ {<AI05-0029-1AI05-0029-1>} Correction: Revised the wording to
say that predefined operations still exist even if they are
never declared, because it is possible to reference them in a
generic unit.
20.f/3
- {AI05-0115-1AI05-0115-1} Correction: Clarified that the
+ {<AI05-0115-1AI05-0115-1>} Correction: Clarified that the
characteristics of a descendant of a private type depend on
the visibility of the full view of the direct ancestor. This
has to be the case (so that privacy is not violated), but it
@@ -36308,7 +36432,7 @@ Example of a type with private operations:
_Wording Changes from Ada 2012_
20.g/4
- {AI12-0065-1AI12-0065-1} Corrigendum: Clarified the
+ {<AI12-0065-1AI12-0065-1>} Corrigendum: Clarified the
clarification added by AI05-0115-1, as it turned out to not be
that clear. Hopefully this version is better.
@@ -36319,37 +36443,38 @@ File: aarm2012.info, Node: 7.3.2, Prev: 7.3.1, Up:
7.3
---------------------
1/4
-{AI05-0146-1AI05-0146-1} {AI12-0041-1AI12-0041-1} For a private type,
-private extension, or interface, the following language-defined aspects
-may be specified with an aspect_specification (see *note 13.1.1::):
+{<AI05-0146-1AI05-0146-1>} {<AI12-0041-1AI12-0041-1>} For a private
+type, private extension, or interface, the following language-defined
+aspects may be specified with an aspect_specification (see *note
+13.1.1::):
2/3
-{AI05-0146-1AI05-0146-1} {AI05-0250-1AI05-0250-1} Type_Invariant
+{<AI05-0146-1AI05-0146-1>} {<AI05-0250-1AI05-0250-1>} Type_Invariant
This aspect shall be specified by an expression, called
- an invariant expression. Type_Invariant may be specified
- on a private_type_declaration (*note 7.3: S0193.), on a
- private_extension_declaration (*note 7.3: S0194.), or on
- a full_type_declaration (*note 3.2.1: S0024.) that
- declares the completion of a private type or private
- extension.
+ an <invariant expression>. Type_Invariant may be
+ specified on a private_type_declaration (*note 7.3:
+ S0193.), on a private_extension_declaration (*note 7.3:
+ S0194.), or on a full_type_declaration (*note 3.2.1:
+ S0024.) that declares the completion of a private type or
+ private extension.
2.a/3
Aspect Description for Type_Invariant: A condition that must
hold true for all objects of a type.
3/4
-{AI05-0146-1AI05-0146-1} {AI12-0041-1AI12-0041-1}
-{AI12-0150-1AI12-0150-1} Type_Invariant'Class
+{<AI05-0146-1AI05-0146-1>} {<AI12-0041-1AI12-0041-1>}
+{<AI12-0150-1AI12-0150-1>} Type_Invariant'Class
This aspect shall be specified by an expression, called
- an invariant expression. Type_Invariant'Class may be
+ an <invariant expression>. Type_Invariant'Class may be
specified on a private_type_declaration (*note 7.3:
S0193.), a private_extension_declaration (*note 7.3:
S0194.), or a full_type_declaration (*note 3.2.1: S0024.)
for an interface type. Type_Invariant'Class determines a
- class-wide type invariant for a tagged type.
+ <class-wide type invariant> for a tagged type.
3.a/3
- Reason: {AI05-0254-1AI05-0254-1} A class-wide type invariant
+ Reason: {<AI05-0254-1AI05-0254-1>} A class-wide type invariant
cannot be hidden in the private part, as the creator of an
extension needs to know about it in order to conform to it in
any new or overriding operations. On the other hand, a
@@ -36364,34 +36489,34 @@ may be specified with an aspect_specification (see
*note 13.1.1::):
_Name Resolution Rules_
4/3
-{AI05-0146-1AI05-0146-1} The expected type for an invariant expression
+{<AI05-0146-1AI05-0146-1>} The expected type for an invariant expression
is any boolean type.
5/4
-{AI05-0146-1AI05-0146-1} {AI12-0150-1AI12-0150-1}
-{AI12-0159-1AI12-0159-1} [Within an invariant expression, the identifier
-of the first subtype of the associated type denotes the current instance
-of the type.] Within an invariant expression for the Type_Invariant
-aspect of a type T, the type of this current instance is T. Within an
-invariant expression for the Type_Invariant'Class aspect of a type T,
-the type of this current instance is interpreted as though it had a
-(notional) type NT that is a visible formal derived type whose ancestor
-type is T.[ The effect of this interpretation is that the only
-operations that can be applied to this current instance are those
-defined for such a formal derived type.]
+{<AI05-0146-1AI05-0146-1>} {<AI12-0150-1AI12-0150-1>}
+{<AI12-0159-1AI12-0159-1>} [Within an invariant expression, the
+identifier of the first subtype of the associated type denotes the
+current instance of the type.] Within an invariant expression for the
+Type_Invariant aspect of a type <T>, the type of this current instance
+is <T>. Within an invariant expression for the Type_Invariant'Class
+aspect of a type <T>, the type of this current instance is interpreted
+as though it had a (notional) type <NT> that is a visible formal derived
+type whose ancestor type is <T>.[ The effect of this interpretation is
+that the only operations that can be applied to this current instance
+are those defined for such a formal derived type.]
5.a/3
Proof: The first sentence is given formally in *note 13.1.1::.
5.b/4
- Reason: {AI12-0159-1AI12-0159-1} The rules for
+ Reason: {<AI12-0159-1AI12-0159-1>} The rules for
Type_Invariant'Class ensure that the invariant expression is
- well-defined for any type descended from T.
+ well-defined for any type descended from <T>.
_Legality Rules_
6/3
-{AI05-0146-1AI05-0146-1} [The Type_Invariant'Class aspect shall not be
+{<AI05-0146-1AI05-0146-1>} [The Type_Invariant'Class aspect shall not be
specified for an untagged type.] The Type_Invariant aspect shall not be
specified for an abstract type.
@@ -36399,7 +36524,7 @@ specified for an abstract type.
Proof: The first sentence is given formally in *note 13.1.1::.
6.1/4
-{AI12-0042-1AI12-0042-1} If a type extension occurs at a point where a
+{<AI12-0042-1AI12-0042-1>} If a type extension occurs at a point where a
private operation of some ancestor is visible and inherited, and a
Type_Invariant'Class expression applies to that ancestor, then the
inherited operation shall be abstract or shall be overridden.
@@ -36407,13 +36532,13 @@ inherited operation shall be abstract or shall be
overridden.
_Static Semantics_
7/3
-{AI05-0250-1AI05-0250-1} [If the Type_Invariant aspect is specified for
-a type T, then the invariant expression applies to T.]
+{<AI05-0250-1AI05-0250-1>} [If the Type_Invariant aspect is specified
+for a type <T>, then the invariant expression applies to <T>.]
8/3
-{AI05-0146-1AI05-0146-1} [If the Type_Invariant'Class aspect is
-specified for a tagged type T, then the invariant expression applies to
-all descendants of T.]
+{<AI05-0146-1AI05-0146-1>} [If the Type_Invariant'Class aspect is
+specified for a tagged type <T>, then the invariant expression applies
+to all descendants of <T>.]
8.a/3
Proof: "Applies" is formally defined in *note 13.1.1::.
@@ -36421,46 +36546,46 @@ all descendants of T.]
_Dynamic Semantics_
9/4
-{AI05-0146-1AI05-0146-1} {AI05-0247-1AI05-0247-1}
-{AI05-0290-1AI05-0290-1} {AI12-0150-1AI12-0150-1} If one or more
-invariant expressions apply to a nonabstract type T, then an invariant
+{<AI05-0146-1AI05-0146-1>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0290-1AI05-0290-1>} {<AI12-0150-1AI12-0150-1>} If one or more
+invariant expressions apply to a nonabstract type <T>, then an invariant
check is performed at the following places, on the specified object(s):
10/4
- * {AI12-0133-1AI12-0133-1} After successful initialization of an
- object of type T by default (see *note 3.3.1::), the check is
- performed on the new object unless the partial view of T has
+ * {<AI12-0133-1AI12-0133-1>} After successful initialization of an
+ object of type <T> by default (see *note 3.3.1::), the check is
+ performed on the new object unless the partial view of <T> has
unknown discriminants;
10.a/4
- Reason: {AI12-0133-1AI12-0133-1} The check applies everywhere,
- even in the package body, because default initialization has
- to work the same for clients as it does within the package.
- As such, checks within the package are either harmless or will
- uncover a bug that could also happen to a client. However, if
- the partial view of the type has unknown discriminants, no
- client of the package can declare a default-initialized
- object. Therefore, no invariant check is needed, as all
- default initialized objects are necessarily inside the
- package.
+ Reason: {<AI12-0133-1AI12-0133-1>} The check applies
+ everywhere, even in the package body, because default
+ initialization has to work the same for clients as it does
+ within the package. As such, checks within the package are
+ either harmless or will uncover a bug that could also happen
+ to a client. However, if the partial view of the type has
+ unknown discriminants, no client of the package can declare a
+ default-initialized object. Therefore, no invariant check is
+ needed, as all default initialized objects are necessarily
+ inside the package.
10.1/4
- * {AI12-0049-1AI12-0049-1} After successful explicit initialization
- of the completion of a deferred constant with a part of type T, if
- the completion is inside the immediate scope of the full view of T,
- and the deferred constant is visible outside the immediate scope of
- T, the check is performed on the part(s) of type T;
+ * {<AI12-0049-1AI12-0049-1>} After successful explicit initialization
+ of the completion of a deferred constant with a part of type <T>,
+ if the completion is inside the immediate scope of the full view of
+ <T>, and the deferred constant is visible outside the immediate
+ scope of <T>, the check is performed on the part(s) of type <T>;
11/3
- * After successful conversion to type T, the check is performed on
+ * After successful conversion to type <T>, the check is performed on
the result of the conversion;
12/3
- * {AI05-0146-1AI05-0146-1} {AI05-0269-1AI05-0269-1} For a view
- conversion, outside the immediate scope of T, that converts from a
- descendant of T (including T itself) to an ancestor of type T
- (other than T itself), a check is performed on the part of the
- object that is of type T:
+ * {<AI05-0146-1AI05-0146-1>} {<AI05-0269-1AI05-0269-1>} For a view
+ conversion, outside the immediate scope of <T>, that converts from
+ a descendant of <T> (including <T> itself) to an ancestor of type
+ <T> (other than <T> itself), a check is performed on the part of
+ the object that is of type <T>:
13/3
* after assigning to the view conversion; and
@@ -36476,7 +36601,7 @@ check is performed at the following places, on the
specified object(s):
needed.
14.b/3
- Implementation Note: {AI05-0299-1AI05-0299-1} For calls to
+ Implementation Note: {<AI05-0299-1AI05-0299-1>} For calls to
inherited subprograms (including dispatching calls), the
implied view conversions mean that a wrapper is probably
needed. (See the Note at the bottom of this subclause for
@@ -36493,45 +36618,46 @@ check is performed at the following places, on the
specified object(s):
the tag is for itself, the operation is complete.
15/4
- * {AI12-0146-1AI12-0146-1} After a successful call on the Read or
- Input stream-oriented attribute of the type T, the check is
+ * {<AI12-0146-1AI12-0146-1>} After a successful call on the Read or
+ Input stream-oriented attribute of the type <T>, the check is
performed on the object initialized by the attribute;
16/3
- * {AI05-0146-1AI05-0146-1} {AI05-0269-1AI05-0269-1} An invariant is
- checked upon successful return from a call on any subprogram or
+ * {<AI05-0146-1AI05-0146-1>} {<AI05-0269-1AI05-0269-1>} An invariant
+ is checked upon successful return from a call on any subprogram or
entry that:
17/4
- * {AI05-0146-1AI05-0146-1} {AI05-0269-1AI05-0269-1}
- {AI12-0042-1AI12-0042-1} is declared within the immediate
- scope of type T (or by an instance of a generic unit, and the
- generic is declared within the immediate scope of type T),
+ * {<AI05-0146-1AI05-0146-1>} {<AI05-0269-1AI05-0269-1>}
+ {<AI12-0042-1AI12-0042-1>} is declared within the immediate
+ scope of type <T> (or by an instance of a generic unit, and
+ the generic is declared within the immediate scope of type
+ <T>),
18/4
- * This paragraph was deleted.{AI12-0042-1AI12-0042-1}
+ * <This paragraph was deleted.>{<AI12-0042-1AI12-0042-1>}
19/4
- * {AI05-0289-1AI05-0289-1} {AI12-0042-1AI12-0042-1}
- {AI12-0044-1AI12-0044-1} and either:
+ * {<AI05-0289-1AI05-0289-1>} {<AI12-0042-1AI12-0042-1>}
+ {<AI12-0044-1AI12-0044-1>} and either:
19.1/4
- * {AI12-0044-1AI12-0044-1} has a result with a part of type
- T, or
+ * {<AI12-0044-1AI12-0044-1>} has a result with a part of
+ type <T>, or
19.2/4
- * {AI12-0044-1AI12-0044-1} has one or more out or in out
- parameters with a part of type T, or
+ * {<AI12-0044-1AI12-0044-1>} has one or more out or in out
+ parameters with a part of type <T>, or
19.3/4
- * {AI12-0044-1AI12-0044-1} {AI12-0149-1AI12-0149-1} has an
- access-to-object parameter or result whose designated
- type has a part of type T, or
+ * {<AI12-0044-1AI12-0044-1>} {<AI12-0149-1AI12-0149-1>} has
+ an access-to-object parameter or result whose designated
+ type has a part of type <T>, or
19.4/4
- * {AI12-0042-1AI12-0042-1} {AI12-0044-1AI12-0044-1} is a
- procedure or entry that has an in parameter with a part
- of type T,
+ * {<AI12-0042-1AI12-0042-1>} {<AI12-0044-1AI12-0044-1>} is
+ a procedure or entry that has an in parameter with a part
+ of type <T>,
19.a/4
Discussion: We don't check in parameters for functions to
@@ -36543,29 +36669,29 @@ check is performed at the following places, on the
specified object(s):
modify their parameters than other callable entities.
19.5/4
- * {AI12-0042-1AI12-0042-1} and either:
+ * {<AI12-0042-1AI12-0042-1>} and either:
19.6/4
- * T is a private type or a private extension and the
+ * <T> is a private type or a private extension and the
subprogram or entry is visible outside the immediate
- scope of type T or overrides an inherited operation that
- is visible outside the immediate scope of T, or
+ scope of type <T> or overrides an inherited operation
+ that is visible outside the immediate scope of <T>, or
19.7/4
- * T is a record extension, and the subprogram or entry is a
- primitive operation visible outside the immediate scope
- of type T or overrides an inherited operation that is
- visible outside the immediate scope of T.
+ * <T> is a record extension, and the subprogram or entry is
+ a primitive operation visible outside the immediate scope
+ of type <T> or overrides an inherited operation that is
+ visible outside the immediate scope of <T>.
20/3
- {AI05-0146-1AI05-0146-1} {AI05-0269-1AI05-0269-1} The check is
- performed on each such part of type T.
+ {<AI05-0146-1AI05-0146-1>} {<AI05-0269-1AI05-0269-1>} The check is
+ performed on each such part of type <T>.
20.1/4
- * {AI12-0042-1AI12-0042-1} For a view conversion to a class-wide type
- occurring within the immediate scope of T, from a specific type
- that is a descendant of T (including T itself), a check is
- performed on the part of the object that is of type T.
+ * {<AI12-0042-1AI12-0042-1>} For a view conversion to a class-wide
+ type occurring within the immediate scope of <T>, from a specific
+ type that is a descendant of <T> (including <T> itself), a check is
+ performed on the part of the object that is of type <T>.
20.a/4
Reason: Class-wide objects are treated as though they exist
@@ -36573,12 +36699,12 @@ check is performed at the following places, on the
specified object(s):
package "boundaries" freely without further invariant checks.
21/4
-{AI05-0290-1AI05-0290-1} {AI12-0080-1AI12-0080-1}
-{AI12-0159-1AI12-0159-1} If performing checks is required by the
+{<AI05-0290-1AI05-0290-1>} {<AI12-0080-1AI12-0080-1>}
+{<AI12-0159-1AI12-0159-1>} If performing checks is required by the
Type_Invariant or Type_Invariant'Class assertion policies (see *note
11.4.2::) in effect at the point of the corresponding aspect
specification applicable to a given type, then the respective invariant
-expression is considered enabled.
+expression is considered <enabled>.
21.a/3
Ramification: If a class-wide invariant expression is enabled
@@ -36587,38 +36713,39 @@ expression is considered enabled.
inheriting type.
22/3
-{AI05-0146-1AI05-0146-1} {AI05-0250-1AI05-0250-1}
-{AI05-0289-1AI05-0289-1} {AI05-0290-1AI05-0290-1} The invariant check
-consists of the evaluation of each enabled invariant expression that
-applies to T, on each of the objects specified above. If any of these
-evaluate to False, Assertions.Assertion_Error is raised at the point of
-the object initialization, conversion, or call. If a given call
-requires more than one evaluation of an invariant expression, either for
-multiple objects of a single type or for multiple types with invariants,
-the evaluations are performed in an arbitrary order, and if one of them
-evaluates to False, it is not specified whether the others are
-evaluated. Any invariant check is performed prior to copying back any
-by-copy in out or out parameters. Invariant checks, any postcondition
-check, and any constraint or predicate checks associated with in out or
-out parameters are performed in an arbitrary order.
+{<AI05-0146-1AI05-0146-1>} {<AI05-0250-1AI05-0250-1>}
+{<AI05-0289-1AI05-0289-1>} {<AI05-0290-1AI05-0290-1>} The invariant
+check consists of the evaluation of each enabled invariant expression
+that applies to <T>, on each of the objects specified above. If any of
+these evaluate to False, Assertions.Assertion_Error is raised at the
+point of the object initialization, conversion, or call. If a given
+call requires more than one evaluation of an invariant expression,
+either for multiple objects of a single type or for multiple types with
+invariants, the evaluations are performed in an arbitrary order, and if
+one of them evaluates to False, it is not specified whether the others
+are evaluated. Any invariant check is performed prior to copying back
+any by-copy in out or out parameters. Invariant checks, any
+postcondition check, and any constraint or predicate checks associated
+with in out or out parameters are performed in an arbitrary order.
22.1/4
-{AI12-0150-1AI12-0150-1} {AI12-0159-1AI12-0159-1} For an invariant check
-on a value of type T1 based on a class-wide invariant expression
-inherited from an ancestor type T, any operations within the invariant
+{<AI12-0150-1AI12-0150-1>} {<AI12-0159-1AI12-0159-1>} For an invariant
+check on a value of type <T1> based on a class-wide invariant expression
+inherited from an ancestor type <T>, any operations within the invariant
expression that were resolved as primitive operations of the (notional)
-formal derived type NT are bound to the corresponding operations of type
-T1 in the evaluation of the invariant expression for the check on T1.
+formal derived type <NT> are bound to the corresponding operations of
+type <T1> in the evaluation of the invariant expression for the check on
+<T1>.
23/3
-{AI05-0146-1AI05-0146-1} {AI05-0247-1AI05-0247-1}
-{AI05-0250-1AI05-0250-1} The invariant checks performed on a call are
+{<AI05-0146-1AI05-0146-1>} {<AI05-0247-1AI05-0247-1>}
+{<AI05-0250-1AI05-0250-1>} The invariant checks performed on a call are
determined by the subprogram or entry actually invoked, whether
directly, as part of a dispatching call, or as part of a call through an
access-to-subprogram value.
23.a/4
- Ramification: {AI12-0149-1AI12-0149-1} Invariant checks on
+ Ramification: {<AI12-0149-1AI12-0149-1>} Invariant checks on
subprogram return are not performed on objects that are
accessible only through access values that are subcomponents
of some other object. It is also possible to call through an
@@ -36628,14 +36755,14 @@ access-to-subprogram value.
performed if the designated subprogram is not itself
externally visible. These cases represent "holes" in the
protection provided by invariant checks; but note that these
- holes cannot be caused by clients of the type T with the
+ holes cannot be caused by clients of the type <T> with the
invariant. The designer of the package has to declare a
- visible type with an access-to-T subcomponent and use it as a
- parameter or result to subprograms in the package, or pass the
- client an access-to-subprogram value representing a private
- operation of the package. In the absence of such things, all
- values that the client can see will be checked for a private
- type or extension.
+ visible type with an access-to-<T> subcomponent and use it as
+ a parameter or result to subprograms in the package, or pass
+ the client an access-to-subprogram value representing a
+ private operation of the package. In the absence of such
+ things, all values that the client can see will be checked for
+ a private type or extension.
23.b/3
Implementation Note: The implementation might want to produce
@@ -36647,12 +36774,13 @@ access-to-subprogram value.
NOTES
24/3
- 13 {AI05-0250-1AI05-0250-1} {AI05-0269-1AI05-0269-1} For a call of
- a primitive subprogram of type NT that is inherited from type T,
- the specified checks of the specific invariants of both the types
- NT and T are performed. For a call of a primitive subprogram of
- type NT that is overridden for type NT, the specified checks of the
- specific invariants of only type NT are performed.
+ 13 {<AI05-0250-1AI05-0250-1>} {<AI05-0269-1AI05-0269-1>} For a
+ call of a primitive subprogram of type <NT> that is inherited from
+ type <T>, the specified checks of the specific invariants of both
+ the types <NT> and <T> are performed. For a call of a primitive
+ subprogram of type <NT> that is overridden for type <NT>, the
+ specified checks of the specific invariants of only type <NT> are
+ performed.
24.a/3
Proof: This follows from the definition of a call on an
@@ -36660,8 +36788,8 @@ access-to-subprogram value.
the type and a call to the original subprogram (see *note
3.4::), along with the normal invariant checking rules. In
particular, the call to the original subprogram takes care of
- any checks needed on type T, and the checks required on view
- conversions take care of any checks needed on type NT,
+ any checks needed on type <T>, and the checks required on view
+ conversions take care of any checks needed on type <NT>,
specifically on in out and out parameters. We require this in
order that the semantics of an explicitly defined wrapper that
does nothing but call the original subprogram is the same as
@@ -36670,25 +36798,25 @@ access-to-subprogram value.
_Extensions to Ada 2005_
24.b/3
- {AI05-0146-1AI05-0146-1} {AI05-0247-1AI05-0247-1}
- {AI05-0250-1AI05-0250-1} {AI05-0289-1AI05-0289-1}
+ {<AI05-0146-1AI05-0146-1>} {<AI05-0247-1AI05-0247-1>}
+ {<AI05-0250-1AI05-0250-1>} {<AI05-0289-1AI05-0289-1>}
Type_Invariant aspects are new.
_Inconsistencies With Ada 2012_
24.c/4
- {AI12-0042-1AI12-0042-1} Corrigendum: Clarified the definition
- of when invariant checks occur for inherited subprograms.
- This might cause checks to be added or removed in some cases.
- These are all rare cases involving class-wide type invariants
- and either record extensions or multiple levels of derivation.
- Additionally, implementations probably make the checks as the
- intent seems clear, even though the formal language did not
- include them. So we do not expect this to be a problem in
- practice.
+ {<AI12-0042-1AI12-0042-1>} Corrigendum: Clarified the
+ definition of when invariant checks occur for inherited
+ subprograms. This might cause checks to be added or removed
+ in some cases. These are all rare cases involving class-wide
+ type invariants and either record extensions or multiple
+ levels of derivation. Additionally, implementations probably
+ make the checks as the intent seems clear, even though the
+ formal language did not include them. So we do not expect
+ this to be a problem in practice.
24.d/4
- {AI12-0042-1AI12-0042-1} Corrigendum: Added invariant checks
+ {<AI12-0042-1AI12-0042-1>} Corrigendum: Added invariant checks
for conversions to class-wide types. This might cause an
invariant check to fail in some cases where they would not be
made in the original definition of Ada 2012. Such cases
@@ -36697,7 +36825,7 @@ access-to-subprogram value.
than it causes.
24.e/4
- {AI12-0044-1AI12-0044-1} Corrigendum: Removed the invariant
+ {<AI12-0044-1AI12-0044-1>} Corrigendum: Removed the invariant
check for in parameters of functions, so that typical
invariants don't cause infinite recursion. This is strictly
inconsistent, as the Ada 2012 definition has this check;
@@ -36708,29 +36836,30 @@ access-to-subprogram value.
unlikely.
24.f/4
- {AI12-0049-1AI12-0049-1} {AI12-0149-1AI12-0149-1} Corrigendum:
- Added an invariant check for deferred constants and for access
- values returned from functions, so they cannot be used to
- "leak" values that violate the invariant from a package. This
- is strictly inconsistent, as the Ada 2012 definition is
- missing these checks; therefore, programs could depend on
- using values that violate an invariant outside of the package
- of definition. These will not raise Assertion_Error in Ada
- 2012 as defined in the Ada 2012 Standard, but ought to do so
- (as noted by this change). As these are a violation of the
- intent of invariants, we think that this change will mainly
- reveal bugs rather than cause them.
+ {<AI12-0049-1AI12-0049-1>} {<AI12-0149-1AI12-0149-1>}
+ Corrigendum: Added an invariant check for deferred constants
+ and for access values returned from functions, so they cannot
+ be used to "leak" values that violate the invariant from a
+ package. This is strictly inconsistent, as the Ada 2012
+ definition is missing these checks; therefore, programs could
+ depend on using values that violate an invariant outside of
+ the package of definition. These will not raise
+ Assertion_Error in Ada 2012 as defined in the Ada 2012
+ Standard, but ought to do so (as noted by this change). As
+ these are a violation of the intent of invariants, we think
+ that this change will mainly reveal bugs rather than cause
+ them.
24.g/4
- {AI12-0150-1AI12-0150-1} {AI12-0159-1AI12-0159-1} Corrigendum:
- Eliminated unintentional redispatching from class-wide type
- invariants. This means that a different body might be
- evaluated for a type invariant check where the value has a
- different tag than that of the type. The change means that
- the behavior of Type_Invariant and Type_Invariant'Class will
- be the same for a particular subprogram, and that the known
- behavior of the operations can be assumed. We expect that
- this change will primarily fix bugs, as it will make
+ {<AI12-0150-1AI12-0150-1>} {<AI12-0159-1AI12-0159-1>}
+ Corrigendum: Eliminated unintentional redispatching from
+ class-wide type invariants. This means that a different body
+ might be evaluated for a type invariant check where the value
+ has a different tag than that of the type. The change means
+ that the behavior of Type_Invariant and Type_Invariant'Class
+ will be the same for a particular subprogram, and that the
+ known behavior of the operations can be assumed. We expect
+ that this change will primarily fix bugs, as it will make
class-wide type invariants work more like expected. In the
case where redispatching is desired, an explicit conversion to
a class-wide type can be used.
@@ -36738,8 +36867,8 @@ access-to-subprogram value.
_Incompatibilities With Ada 2012_
24.h/4
- {AI12-0042-1AI12-0042-1} Corrigendum: A private operation that
- is inherited in the visible part of a package to which a
+ {<AI12-0042-1AI12-0042-1>} Corrigendum: A private operation
+ that is inherited in the visible part of a package to which a
class-wide invariant applies now requires overriding. This is
a very unlikely situation, and will prevent problems with
invariant checks being added to routines that assume that they
@@ -36748,14 +36877,14 @@ access-to-subprogram value.
_Extensions to Ada 2012_
24.i/4
- {AI12-0041-1AI12-0041-1} Corrigendum: Class-wide type
+ {<AI12-0041-1AI12-0041-1>} Corrigendum: Class-wide type
invariants can now be specified on interfaces as well as
private types.
_Wording Changes from Ada 2012_
24.j/4
- {AI12-0133-1AI12-0133-1} Corrigendum: Clarified that all
+ {<AI12-0133-1AI12-0133-1>} Corrigendum: Clarified that all
objects that are initialized by default should have an
invariant check, and added an exception for types with unknown
discriminants, as in that case the client cannot declare a
@@ -36782,23 +36911,23 @@ from other languages (see *note Annex B::).]
_Legality Rules_
2/3
-{AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} [ A deferred constant
-declaration is an object_declaration with the reserved word constant but
-no initialization expression.] The constant declared by a deferred
-constant declaration is called a deferred constant. [Unless the Import
-aspect (see *note B.1::) is True for a deferred constant declaration,
-the ] deferred constant declaration requires a completion, which shall
-be a full constant declaration (called the full declaration of the
-deferred constant).
+{<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} [ A <deferred
+constant declaration> is an object_declaration with the reserved word
+constant but no initialization expression.] The constant declared by a
+deferred constant declaration is called a <deferred constant>. [Unless
+the Import aspect (see *note B.1::) is True for a deferred constant
+declaration, the ] deferred constant declaration requires a completion,
+which shall be a full constant declaration (called the <full
+declaration> of the deferred constant).
2.a
Proof: The first sentence is redundant, as it is stated
officially in *note 3.3.1::.
2.b/3
- {AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} The first
- part of the last sentence is redundant, as no imported entity
- may have a completion, as stated in *note B.1::.
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} The
+ first part of the last sentence is redundant, as no imported
+ entity may have a completion, as stated in *note B.1::.
3
A deferred constant declaration that is completed by a full constant
@@ -36811,30 +36940,30 @@ apply to the corresponding full declaration:
part of the same package;
5/2
- * {AI95-00385-01AI95-00385-01} The deferred and full constants shall
- have the same type, or shall have statically matching anonymous
- access subtypes;
+ * {<AI95-00385-01AI95-00385-01>} The deferred and full constants
+ shall have the same type, or shall have statically matching
+ anonymous access subtypes;
5.a/2
- Ramification: {AI95-00385-01AI95-00385-01} This implies that
+ Ramification: {<AI95-00385-01AI95-00385-01>} This implies that
both the deferred declaration and the full declaration have to
have a subtype_indication or access_definition rather than an
array_type_definition, because each array_type_definition
would define a new type.
6/3
- * {AI95-00385-01AI95-00385-01} {AI05-0062-1AI05-0062-1}
- {AI05-0262-1AI05-0262-1} If the deferred constant declaration
- includes a subtype_indication S that defines a constrained subtype,
- then the constraint defined by the subtype_indication in the full
- declaration shall match the constraint defined by S statically.[ On
- the other hand, if the subtype of the deferred constant is
- unconstrained, then the full declaration is still allowed to impose
- a constraint. The constant itself will be constrained, like all
- constants;]
+ * {<AI95-00385-01AI95-00385-01>} {<AI05-0062-1AI05-0062-1>}
+ {<AI05-0262-1AI05-0262-1>} If the deferred constant declaration
+ includes a subtype_indication <S> that defines a constrained
+ subtype, then the constraint defined by the subtype_indication in
+ the full declaration shall match the constraint defined by <S>
+ statically.[ On the other hand, if the subtype of the deferred
+ constant is unconstrained, then the full declaration is still
+ allowed to impose a constraint. The constant itself will be
+ constrained, like all constants;]
7/2
- * {AI95-00231-01AI95-00231-01} If the deferred constant declaration
+ * {<AI95-00231-01AI95-00231-01>} If the deferred constant declaration
includes the reserved word aliased, then the full declaration shall
also;
@@ -36843,7 +36972,7 @@ apply to the corresponding full declaration:
aliased even if the deferred constant is not.
7.1/2
- * {AI95-00231-01AI95-00231-01} If the subtype of the deferred
+ * {<AI95-00231-01AI95-00231-01>} If the subtype of the deferred
constant declaration excludes null, the subtype of the full
declaration shall also exclude null.
@@ -36855,25 +36984,25 @@ apply to the corresponding full declaration:
null_exclusion).
8/3
-{AI05-0229-1AI05-0229-1} [A deferred constant declaration for which the
-Import aspect is True need not appear in the visible part of a
+{<AI05-0229-1AI05-0229-1>} [A deferred constant declaration for which
+the Import aspect is True need not appear in the visible part of a
package_specification, and has no full constant declaration.]
9/2
-{AI95-00256-01AI95-00256-01} The completion of a deferred constant
+{<AI95-00256-01AI95-00256-01>} The completion of a deferred constant
declaration shall occur before the constant is frozen (see *note
13.14::).
_Dynamic Semantics_
10/3
-{AI05-0004-1AI05-0004-1} The elaboration of a deferred constant
+{<AI05-0004-1AI05-0004-1>} The elaboration of a deferred constant
declaration elaborates the subtype_indication, access_definition, or
(only allowed in the case of an imported constant) the
array_type_definition.
10.a/3
- Ramification: {AI05-0004-1AI05-0004-1} For nonimported
+ Ramification: {<AI05-0004-1AI05-0004-1>} For nonimported
constants, these elaborations cannot require any code or
checks for a legal program, because the given
subtype_indication has to be indefinite or statically match
@@ -36911,15 +37040,15 @@ array_type_definition.
_Examples_
12
-Examples of deferred constant declarations:
+<Examples of deferred constant declarations:>
13
- Null_Key : constant Key; -- see *note 7.3.1::
+ Null_Key : constant Key; --< see *note 7.3.1::>
14/3
- {AI05-0229-1AI05-0229-1} CPU_Identifier : constant String(1..8)
+ {<AI05-0229-1AI05-0229-1>} CPU_Identifier : constant String(1..8)
with Import => True, Convention => Assembler, Link_Name => "CPU_ID";
- -- see *note B.1::
+ --< see *note B.1::>
_Extensions to Ada 83_
@@ -36975,7 +37104,7 @@ Examples of deferred constant declarations:
_Wording Changes from Ada 83_
14.h/3
- {AI05-0299-1AI05-0299-1} Since deferred constants can now be
+ {<AI05-0299-1AI05-0299-1>} Since deferred constants can now be
of a nonprivate type, we have made this a stand-alone
subclause, rather than a subclause of *note 7.3::, "*note
7.3:: Private Types and Private Extensions".
@@ -36987,19 +37116,19 @@ Examples of deferred constant declarations:
_Extensions to Ada 95_
14.j/2
- {AI95-00385-01AI95-00385-01} Deferred constants were enhanced
- to allow the use of anonymous access types in them.
+ {<AI95-00385-01AI95-00385-01>} Deferred constants were
+ enhanced to allow the use of anonymous access types in them.
_Wording Changes from Ada 95_
14.k/2
- {AI95-00231-01AI95-00231-01} Added matching rules for subtypes
- that exclude null.
+ {<AI95-00231-01AI95-00231-01>} Added matching rules for
+ subtypes that exclude null.
_Wording Changes from Ada 2005_
14.l/3
- {AI05-0062-1AI05-0062-1} Correction: Corrected rules so that
+ {<AI05-0062-1AI05-0062-1>} Correction: Corrected rules so that
the intent that a full constant may have a null exclusion even
if the deferred constant does not is actually met.
@@ -37010,19 +37139,19 @@ File: aarm2012.info, Node: 7.5, Next: 7.6, Prev:
7.4, Up: 7
=================
1/2
-{AI95-00287-01AI95-00287-01} [A limited type is (a view of) a type for
+{<AI95-00287-01AI95-00287-01>} [A limited type is (a view of) a type for
which copying (such as for an assignment_statement) is not allowed. A
nonlimited type is a (view of a) type for which copying is allowed.]
1.a
- Discussion: The concept of the value of a limited type is
+ Discussion: The concept of the <value> of a limited type is
difficult to define, since the abstract value of a limited
type often extends beyond its physical representation. In
some sense, values of a limited type cannot be divorced from
- their object. The value is the object.
+ their object. The value <is> the object.
1.b/2
- {AI95-00318-02AI95-00318-02} In Ada 83, in the two places
+ {<AI95-00318-02AI95-00318-02>} In Ada 83, in the two places
where limited types were defined by the language, namely tasks
and files, an implicit level of indirection was implied by the
semantics to avoid the separation of the value from an
@@ -37033,11 +37162,11 @@ nonlimited type is a (view of a) type for which
copying is allowed.]
the logical value of most limited types.
1.c/2
- To be honest: {AI95-00287-01AI95-00287-01}
- {AI95-00419-01AI95-00419-01} For a limited partial view whose
- full view is nonlimited, copying is possible on parameter
- passing and function return. To prevent any copying
- whatsoever, one should make both the partial and full views
+ To be honest: {<AI95-00287-01AI95-00287-01>}
+ {<AI95-00419-01AI95-00419-01>} For a limited partial view
+ whose full view is nonlimited, copying is possible on
+ parameter passing and function return. To prevent any copying
+ whatsoever, one should make both the partial <and> full views
limited.
1.d/2
@@ -37048,19 +37177,19 @@ nonlimited type is a (view of a) type for which
copying is allowed.]
_Legality Rules_
2/2
-{AI95-00419-01AI95-00419-01} If a tagged record type has any limited
+{<AI95-00419-01AI95-00419-01>} If a tagged record type has any limited
components, then the reserved word limited shall appear in its
record_type_definition. [If the reserved word limited appears in the
definition of a derived_type_definition, its parent type and any
progenitor interfaces shall be limited.]
2.a.1/2
- Proof: {AI95-00419-01AI95-00419-01} The rule about the parent
- type being required to be limited can be found in *note 3.4::.
- Rules about progenitor interfaces can be found in *note
- 3.9.4::, specifically, a nonlimited interface can appear only
- on a nonlimited type. We repeat these rules here to gather
- these scattered rules in one obvious place.
+ Proof: {<AI95-00419-01AI95-00419-01>} The rule about the
+ parent type being required to be limited can be found in *note
+ 3.4::. Rules about progenitor interfaces can be found in
+ *note 3.9.4::, specifically, a nonlimited interface can appear
+ only on a nonlimited type. We repeat these rules here to
+ gather these scattered rules in one obvious place.
2.a
Reason: This prevents tagged limited types from becoming
@@ -37070,12 +37199,12 @@ progenitor interfaces shall be limited.]
package P is
type T is limited private;
type R is tagged
- record -- Illegal!
- -- This should say "limited record".
+ record --< Illegal!>
+ --< This should say "limited record".>
X : T;
end record;
private
- type T is new Integer; -- R becomes nonlimited here.
+ type T is new Integer; --< R becomes nonlimited here.>
end P;
2.c/2
@@ -37087,17 +37216,17 @@ progenitor interfaces shall be limited.]
end Q;
2.d/2
- {AI95-00230-01AI95-00230-01} If the above were legal, then
+ {<AI95-00230-01AI95-00230-01>} If the above were legal, then
assignment would be defined for R'Class in the body of P,
which is bad news, given the task.
2.1/3
-{AI95-00287-01AI95-00287-01} {AI95-00318-02AI95-00318-02}
-{AI05-0147-1AI05-0147-1} In the following contexts, an expression of a
+{<AI95-00287-01AI95-00287-01>} {<AI95-00318-02AI95-00318-02>}
+{<AI05-0147-1AI05-0147-1>} In the following contexts, an expression of a
limited type is not permitted unless it is an aggregate, a
function_call, a parenthesized expression or qualified_expression whose
operand is permitted by this rule, or a conditional_expression all of
-whose dependent_expressions are permitted by this rule:
+whose <dependent_>expressions are permitted by this rule:
2.2/2
* the initialization expression of an object_declaration (see *note
@@ -37126,7 +37255,7 @@ whose dependent_expressions are permitted by this rule:
* the expression of a return statement (see *note 6.5::)
2.9/4
- * {AI05-0177-1AI05-0177-1} {AI12-0157-1AI12-0157-1} the return
+ * {<AI05-0177-1AI05-0177-1>} {<AI12-0157-1AI12-0157-1>} the return
expression of an expression function (see *note 6.8::)
2.10/3
@@ -37141,13 +37270,13 @@ whose dependent_expressions are permitted by this
rule:
_Static Semantics_
3/3
-{AI95-00419-01AI95-00419-01} {AI05-0178-1AI05-0178-1} A view of a type
-is limited if it is one of the following:
+{<AI95-00419-01AI95-00419-01>} {<AI05-0178-1AI05-0178-1>} A view of a
+type is <limited> if it is one of the following:
4/2
- * {AI95-00411-01AI95-00411-01} {AI95-00419-01AI95-00419-01} a type
- with the reserved word limited, synchronized, task, or protected in
- its definition;
+ * {<AI95-00411-01AI95-00411-01>} {<AI95-00419-01AI95-00419-01>} a
+ type with the reserved word limited, synchronized, task, or
+ protected in its definition;
4.a
Ramification: Note that there is always a "definition,"
@@ -37155,39 +37284,39 @@ is limited if it is one of the following:
"..._definition".
4.b/2
- {AI95-00419-01AI95-00419-01} This includes interfaces of the
+ {<AI95-00419-01AI95-00419-01>} This includes interfaces of the
above kinds, derived types with the reserved word limited, as
well as task and protected types.
5/3
- * {AI95-00419-01AI95-00419-01} {AI05-0087-1AI05-0087-1} a class-wide
- type whose specific type is limited;
+ * {<AI95-00419-01AI95-00419-01>} {<AI05-0087-1AI05-0087-1>} a
+ class-wide type whose specific type is limited;
6/2
- * {AI95-00419-01AI95-00419-01} a composite type with a limited
+ * {<AI95-00419-01AI95-00419-01>} a composite type with a limited
component;
6.1/3
- * {AI05-0178-1AI05-0178-1} an incomplete view;
+ * {<AI05-0178-1AI05-0178-1>} an incomplete view;
6.2/2
- * {AI95-00419-01AI95-00419-01} a derived type whose parent is limited
- and is not an interface.
+ * {<AI95-00419-01AI95-00419-01>} a derived type whose parent is
+ limited and is not an interface.
6.a/2
- Ramification: {AI95-00419-01AI95-00419-01} Limitedness is not
- inherited from interfaces; it must be explicitly specified
+ Ramification: {<AI95-00419-01AI95-00419-01>} Limitedness is
+ not inherited from interfaces; it must be explicitly specified
when the parent is an interface.
6.b/2
- To be honest: {AI95-00419-01AI95-00419-01} A derived type can
- become nonlimited if limited does not appear and the
+ To be honest: {<AI95-00419-01AI95-00419-01>} A derived type
+ can become nonlimited if limited does not appear and the
derivation takes place in the visible part of a child package,
and the parent type is nonlimited as viewed from the private
part or body of the child package.
6.c/2
- Reason: {AI95-00419-01AI95-00419-01} We considered a rule
+ Reason: {<AI95-00419-01AI95-00419-01>} We considered a rule
where limitedness was always inherited from the parent for
derived types, but in the case of a type whose parent is an
interface, this meant that the first interface is treated
@@ -37199,7 +37328,7 @@ is limited if it is one of the following:
simpler to understand.
6.d/2
- {AI95-00419-01AI95-00419-01} The rules for interfaces are
+ {<AI95-00419-01AI95-00419-01>} The rules for interfaces are
asymmetrical, but the language is not: if the parent interface
is limited, the presence of the word limited determines the
limitedness, and nonlimited progenitors are illegal by the
@@ -37215,15 +37344,15 @@ Otherwise, the type is nonlimited.
[There are no predefined equality operators for a limited type.]
8.1/3
-{AI05-0052-1AI05-0052-1} A type is immutably limited if it is one of the
-following:
+{<AI05-0052-1AI05-0052-1>} A type is <immutably limited> if it is one of
+the following:
8.2/3
* An explicitly limited record type;
8.3/3
- * {AI05-0217-1AI05-0217-1} A record extension with the reserved word
- limited;
+ * {<AI05-0217-1AI05-0217-1>} A record extension with the reserved
+ word limited;
8.4/3
* A nonformal limited private type that is tagged or has at least one
@@ -37256,7 +37385,7 @@ following:
immutably limited; a type derived from it can be nonlimited.
8.7/3
-{AI05-0052-1AI05-0052-1} A descendant of a generic formal limited
+{<AI05-0052-1AI05-0052-1>} A descendant of a generic formal limited
private type is presumed to be immutably limited except within the body
of a generic unit or a body declared within the declarative region of a
generic unit, if the formal type is declared within the formal part of
@@ -37272,8 +37401,8 @@ the generic unit.
NOTES
9/3
- 15 {AI95-00287-01AI95-00287-01} {AI95-00318-02AI95-00318-02}
- {AI05-0067-1AI05-0067-1} While it is allowed to write
+ 15 {<AI95-00287-01AI95-00287-01>} {<AI95-00318-02AI95-00318-02>}
+ {<AI05-0067-1AI05-0067-1>} While it is allowed to write
initializations of limited objects, such initializations never copy
a limited object. The source of such an assignment operation must
be an aggregate or function_call, and such aggregates and
@@ -37285,7 +37414,7 @@ the generic unit.
nonlimited (see below); function_calls only are required to be
build-in-place for "really" limited types.
- Paragraphs 10 through 15 were deleted.
+ <Paragraphs 10 through 15 were deleted.>
16
16 As illustrated in *note 7.3.1::, an untagged limited type can
@@ -37310,7 +37439,7 @@ the generic unit.
_Examples_
17
-Example of a package with a limited type:
+<Example of a package with a limited type:>
18
package IO_Package is
@@ -37345,7 +37474,7 @@ Example of a package with a limited type:
NOTES
21
- 17 Notes on the example: In the example above, an outside
+ 17 <Notes on the example:> In the example above, an outside
subprogram making use of IO_Package may obtain a file name by
calling Open and later use it in calls to Read and Write. Thus,
outside the package, a file name obtained from Open acts as a kind
@@ -37364,7 +37493,7 @@ Example of a package with a limited type:
those given in the package specification.
23/2
- {AI95-00318-02AI95-00318-02} The fact that the full view of
+ {<AI95-00318-02AI95-00318-02>} The fact that the full view of
File_Name is explicitly declared limited means that parameter
passing will always be by reference and function results will
always be built directly in the result object (see *note 6.2:: and
@@ -37379,15 +37508,16 @@ Example of a package with a limited type:
_Wording Changes from Ada 83_
23.b/3
- {AI05-0299-1AI05-0299-1} Since limitedness and privateness are
- orthogonal in Ada 95 (and to some extent in Ada 83), this is
- now its own subclause rather than being a subclause of *note
- 7.3::, "*note 7.3:: Private Types and Private Extensions".
+ {<AI05-0299-1AI05-0299-1>} Since limitedness and privateness
+ are orthogonal in Ada 95 (and to some extent in Ada 83), this
+ is now its own subclause rather than being a subclause of
+ *note 7.3::, "*note 7.3:: Private Types and Private
+ Extensions".
_Extensions to Ada 95_
23.c/2
- {AI95-00287-01AI95-00287-01} {AI95-00318-02AI95-00318-02}
+ {<AI95-00287-01AI95-00287-01>} {<AI95-00318-02AI95-00318-02>}
Limited types now have an assignment operation, but its use is
restricted such that all uses are build-in-place. This is
accomplished by restricting uses to aggregates and
@@ -37400,7 +37530,7 @@ Example of a package with a limited type:
_Wording Changes from Ada 95_
23.d/2
- {AI95-00411-01AI95-00411-01} {AI95-00419-01AI95-00419-01}
+ {<AI95-00411-01AI95-00411-01>} {<AI95-00419-01AI95-00419-01>}
Rewrote the definition of limited to ensure that interfaces
are covered, but that limitedness is not inherited from
interfaces. Derived types that explicitly include limited are
@@ -37409,36 +37539,36 @@ Example of a package with a limited type:
_Wording Changes from Ada 2005_
23.e/3
- {AI05-0052-1AI05-0052-1} {AI05-0217-1AI05-0217-1} Correction:
- Added a definition for immutably limited types, so that the
- fairly complex definition does not need to be repeated in
- rules elsewhere in the Standard.
+ {<AI05-0052-1AI05-0052-1>} {<AI05-0217-1AI05-0217-1>}
+ Correction: Added a definition for immutably limited types, so
+ that the fairly complex definition does not need to be
+ repeated in rules elsewhere in the Standard.
23.f/3
- {AI05-0067-1AI05-0067-1} {AI05-0299-1AI05-0299-1} Correction:
- The built-in-place rules are consolidated in *note 7.6::, and
- thus they are removed from this subclause.
+ {<AI05-0067-1AI05-0067-1>} {<AI05-0299-1AI05-0299-1>}
+ Correction: The built-in-place rules are consolidated in *note
+ 7.6::, and thus they are removed from this subclause.
23.g/3
- {AI05-0087-1AI05-0087-1} Correction: Fixed an oversight:
+ {<AI05-0087-1AI05-0087-1>} Correction: Fixed an oversight:
class-wide types were never defined to be limited, even if
their associated specific type is. It is thought that this
oversight was never implemented incorrectly by any compiler,
thus we have not classified it as an incompatibility.
23.h/3
- {AI05-0147-1AI05-0147-1} Allowed conditional_expressions in
+ {<AI05-0147-1AI05-0147-1>} Allowed conditional_expressions in
limited constructor contexts -- we want to treat these as
closely to parentheses as possible.
23.i/3
- {AI05-0177-1AI05-0177-1} Added wording so that expression
+ {<AI05-0177-1AI05-0177-1>} Added wording so that expression
functions can return limited entities.
23.j/3
- {AI05-0178-1AI05-0178-1} Correction: Added incomplete views to
- the list of reasons for a view of a type to be limited. This
- is not a change as the definition already was in *note
+ {<AI05-0178-1AI05-0178-1>} Correction: Added incomplete views
+ to the list of reasons for a view of a type to be limited.
+ This is not a change as the definition already was in *note
3.10.1::. But it is much better to have all of the reasons
for limitedness together.
@@ -37457,18 +37587,18 @@ finalized before being destroyed (for example, by
leaving a
subprogram_body containing an object_declaration, or by a call to an
instance of Unchecked_Deallocation). An assignment operation is used as
part of assignment_statements, explicit initialization, parameter
-passing, and other operations.
+passing, and other operations.
2
Default definitions for these three fundamental operations are provided
-by the language, but a controlled type gives the user additional control
-over parts of these operations. In particular, the user can define, for
-a controlled type, an Initialize procedure which is invoked immediately
-after the normal default initialization of a controlled object, a
-Finalize procedure which is invoked immediately before finalization of
-any of the components of a controlled object, and an Adjust procedure
-which is invoked as the last step of an assignment to a (nonlimited)
-controlled object.]
+by the language, but a <controlled> type gives the user additional
+control over parts of these operations. In particular, the user can
+define, for a controlled type, an Initialize procedure which is invoked
+immediately after the normal default initialization of a controlled
+object, a Finalize procedure which is invoked immediately before
+finalization of any of the components of a controlled object, and an
+Adjust procedure which is invoked as the last step of an assignment to a
+(nonlimited) controlled object.]
2.a
Glossary entry: A controlled type supports user-defined
@@ -37476,8 +37606,8 @@ controlled object.]
before being destroyed.
2.b/2
- Ramification: {AI95-00114-01AI95-00114-01}
- {AI95-00287-01AI95-00287-01} Here's the basic idea of
+ Ramification: {<AI95-00114-01AI95-00114-01>}
+ {<AI95-00287-01AI95-00287-01>} Here's the basic idea of
initialization, value adjustment, and finalization, whether or
not user defined: When an object is created, if it is
explicitly assigned an initial value, the object is either
@@ -37501,31 +37631,31 @@ controlled object.]
The following language-defined library package exists:
4/3
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01}
{AI05-0212-1AI05-0212-1} package Ada.Finalization is
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>}
{<AI05-0212-1AI05-0212-1>} package Ada.Finalization is
pragma Pure(Finalization);
5/2
- {AI95-00161-01AI95-00161-01} type Controlled is abstract tagged
private;
+ {<AI95-00161-01AI95-00161-01>} type Controlled is abstract tagged
private;
pragma Preelaborable_Initialization(Controlled);
6/2
- {AI95-00348-01AI95-00348-01} procedure Initialize (Object : in out
Controlled) is null;
+ {<AI95-00348-01AI95-00348-01>} procedure Initialize (Object : in out
Controlled) is null;
procedure Adjust (Object : in out Controlled) is null;
procedure Finalize (Object : in out Controlled) is null;
7/2
- {AI95-00161-01AI95-00161-01} type Limited_Controlled is abstract
tagged limited private;
+ {<AI95-00161-01AI95-00161-01>} type Limited_Controlled is abstract
tagged limited private;
pragma Preelaborable_Initialization(Limited_Controlled);
8/2
- {AI95-00348-01AI95-00348-01} procedure Initialize (Object : in out
Limited_Controlled) is null;
+ {<AI95-00348-01AI95-00348-01>} procedure Initialize (Object : in out
Limited_Controlled) is null;
procedure Finalize (Object : in out Limited_Controlled) is null;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Finalization;
9/2
-{AI95-00348-01AI95-00348-01} A controlled type is a descendant of
+{<AI95-00348-01AI95-00348-01>} A controlled type is a descendant of
Controlled or Limited_Controlled. The predefined "=" operator of type
Controlled always returns True, [since this operator is incorporated
into the implementation of the predefined equality operator of types
@@ -37559,7 +37689,7 @@ lacks the primitive subprogram Adjust.
the implementation wishes to make them "magic" in some way.
9.d/2
- {AI95-00251-01AI95-00251-01} For Ada 2005, we considered
+ {<AI95-00251-01AI95-00251-01>} For Ada 2005, we considered
making these types interfaces. That would have the advantage
of allowing them to be added to existing trees. But that was
rejected both because it would cause massive disruptions to
@@ -37570,21 +37700,21 @@ lacks the primitive subprogram Adjust.
Limited_Controlled -- a very common idiom.
9.1/2
-{AI95-00360-01AI95-00360-01} A type is said to need finalization if:
+{<AI95-00360-01AI95-00360-01>} A type is said to <need finalization> if:
9.2/2
* it is a controlled type, a task type or a protected type; or
9.3/3
- * {AI05-0092-1AI05-0092-1} it has a component whose type needs
+ * {<AI05-0092-1AI05-0092-1>} it has a component whose type needs
finalization; or
9.4/3
- * {AI05-0013-1AI05-0013-1} it is a class-wide type; or
+ * {<AI05-0013-1AI05-0013-1>} it is a class-wide type; or
9.5/3
- * {AI05-0026-1AI05-0026-1} it is a partial view whose full view needs
- finalization; or
+ * {<AI05-0026-1AI05-0026-1>} it is a partial view whose full view
+ needs finalization; or
9.6/2
* it is one of a number of language-defined types that are explicitly
@@ -37605,7 +37735,7 @@ lacks the primitive subprogram Adjust.
_Dynamic Semantics_
10/2
-{AI95-00373-01AI95-00373-01} During the elaboration or evaluation of a
+{<AI95-00373-01AI95-00373-01>} During the elaboration or evaluation of a
construct that causes an object to be initialized by default, for every
controlled subcomponent of the object that is not assigned an initial
value (as defined in *note 3.3.1::), Initialize is called on that
@@ -37613,8 +37743,8 @@ subcomponent. Similarly, if the object that is
initialized by default
as a whole is controlled, Initialize is called on the object.
11/2
-{8652/00218652/0021} {AI95-00182-01AI95-00182-01}
-{AI95-00373-01AI95-00373-01} For an extension_aggregate whose
+{<8652/00218652/0021>} {<AI95-00182-01AI95-00182-01>}
+{<AI95-00373-01AI95-00373-01>} For an extension_aggregate whose
ancestor_part is a subtype_mark denoting a controlled subtype, the
Initialize procedure of the ancestor type is called, unless that
Initialize procedure is abstract.
@@ -37625,14 +37755,14 @@ Initialize procedure is abstract.
11.b
type T1 is new Controlled with
record
- ... -- some components might have defaults
+ ... --< some components might have defaults>
end record;
11.c
type T2 is new Controlled with
record
- X : T1; -- no default
- Y : T1 := ...; -- default
+ X : T1; --< no default>
+ Y : T1 := ...; --< default>
end record;
11.d
@@ -37653,8 +37783,8 @@ Initialize procedure is abstract.
is, it applies Adjust to B.X, B.Y, and B.
11.f.1/2
- {8652/00218652/0021} {AI95-00182-01AI95-00182-01}
- {AI95-00373-01AI95-00373-01} The ancestor_part of an
+ {<8652/00218652/0021>} {<AI95-00182-01AI95-00182-01>}
+ {<AI95-00373-01AI95-00373-01>} The ancestor_part of an
extension_aggregate, <> in aggregates, and the return object
of an extended_return_statement are handled similarly.
@@ -37686,28 +37816,28 @@ all calls on Initialize.
13
When a target object with any controlled parts is assigned a value,
[either when created or in a subsequent assignment_statement,] the
-assignment operation proceeds as follows:
+<assignment operation> proceeds as follows:
14
* The value of the target becomes the assigned value.
15
- * The value of the target is adjusted.
+ * The value of the target is <adjusted.>
15.a
Ramification: If any parts of the object are controlled, abort
is deferred during the assignment operation.
16/3
-{AI05-0067-1AI05-0067-1} To adjust the value of a composite object, the
-values of the components of the object are first adjusted in an
+{<AI05-0067-1AI05-0067-1>} To adjust the value of a composite object,
+the values of the components of the object are first adjusted in an
arbitrary order, and then, if the object is nonlimited controlled,
Adjust is called. Adjusting the value of an elementary object has no
effect[, nor does adjusting the value of a composite object with no
controlled parts.]
16.a/3
- Ramification: {AI05-0067-1AI05-0067-1} Adjustment is never
+ Ramification: {<AI05-0067-1AI05-0067-1>} Adjustment is never
actually performed for values of an immutably limited type,
since all assignment operations for such types are required to
be built-in-place. Even so, we still define adjustment for
@@ -37715,7 +37845,7 @@ controlled parts.]
well-defined.
16.b/3
- Reason: {AI05-0005-1AI05-0005-1} The verbiage in the
+ Reason: {<AI05-0005-1AI05-0005-1>} The verbiage in the
Initialize rule about access discriminants constrained by
per-object expressions is not necessary here, since such types
are either limited or do not have defaults, so the
@@ -37781,16 +37911,16 @@ given in *note 5.2::, "*note 5.2:: Assignment
Statements".]
generic contract model violations.
17.1/3
-{AI05-0067-1AI05-0067-1} When a function call or aggregate is used to
+{<AI05-0067-1AI05-0067-1>} When a function call or aggregate is used to
initialize an object, the result of the function call or aggregate is an
anonymous object, which is assigned into the newly-created object. For
-such an assignment, the anonymous object might be built in place, in
+such an assignment, the anonymous object might be <built in place>, in
which case the assignment does not involve any copying. Under certain
circumstances, the anonymous object is required to be built in place.
In particular:
17.i/3
- Discussion: {AI05-0067-1AI05-0067-1} We say assignment to
+ Discussion: {<AI05-0067-1AI05-0067-1>} We say assignment to
built-in-place objects does not involve copying, which matches
the intended implementation (see below). Of course, the
implementation can do any copying it likes, if it can make
@@ -37802,22 +37932,22 @@ In particular:
the anonymous object is built in place.
17.j/3
- Reason: {AI05-0067-1AI05-0067-1} We talk about the full types
- being immutably limited, as this is independent of the view of
- a type (in the same way that it is for determining the
+ Reason: {<AI05-0067-1AI05-0067-1>} We talk about the full
+ types being immutably limited, as this is independent of the
+ view of a type (in the same way that it is for determining the
technique of parameter passing). That is, privacy is ignored
for this purpose.
17.k/3
- {AI05-0005-1AI05-0005-1} {AI05-0067-1AI05-0067-1} For function
- calls, we only require building in place for immutably limited
- types. These are the types that would have been
- return-by-reference types in Ada 95. We limited the
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0067-1AI05-0067-1>} For
+ function calls, we only require building in place for
+ immutably limited types. These are the types that would have
+ been return-by-reference types in Ada 95. We limited the
requirement because we want to minimize disruption to Ada 95
implementations and users.
17.l/3
- To be honest: {AI05-0232-1AI05-0232-1} This is a dynamic
+ To be honest: {<AI05-0232-1AI05-0232-1>} This is a dynamic
property and is determined by the specific type of the parts
of the actual object. In particular, if a part has a
class-wide type, the tag of the object might need to be
@@ -37837,9 +37967,9 @@ In particular:
in place.
17.m/3
- Reason: {AI05-0067-1AI05-0067-1} This is necessary to prevent
- elaboration problems with deferred constants of controlled
- types. Consider:
+ Reason: {<AI05-0067-1AI05-0067-1>} This is necessary to
+ prevent elaboration problems with deferred constants of
+ controlled types. Consider:
17.m.1/3
package P is
@@ -37894,12 +38024,12 @@ In particular:
made here anyway.
17.5/3
-{AI05-0067-1AI05-0067-1} Notwithstanding what this International
+{<AI05-0067-1AI05-0067-1>} Notwithstanding what this International
Standard says elsewhere, if an object is built in place:
17.6/3
* Upon successful completion of the return statement or aggregate,
- the anonymous object mutates into the newly-created object; that
+ the anonymous object <mutates into> the newly-created object; that
is, the anonymous object ceases to exist, and the newly-created
object appears in its place.
@@ -37977,22 +38107,22 @@ Standard says elsewhere, if an object is built in
place:
_Implementation Permissions_
18/3
-{AI05-0067-1AI05-0067-1} An implementation is allowed to relax the above
-rules for assignment_statements in the following ways:
+{<AI05-0067-1AI05-0067-1>} An implementation is allowed to relax the
+above rules for assignment_statements in the following ways:
18.a/3
- This paragraph was deleted.{AI05-0067-1AI05-0067-1}
+ <This paragraph was deleted.>{<AI05-0067-1AI05-0067-1>}
18.b/3
- Ramification: {AI05-0067-1AI05-0067-1} The relaxations apply
+ Ramification: {<AI05-0067-1AI05-0067-1>} The relaxations apply
only to nonlimited types, as assignment_statements are not
allowed for limited types. This is important so that the
programmer can count on a stricter semantics for limited
controlled types.
19/3
- * {AI05-0067-1AI05-0067-1} If an object is assigned the value of that
- same object, the implementation need not do anything.
+ * {<AI05-0067-1AI05-0067-1>} If an object is assigned the value of
+ that same object, the implementation need not do anything.
19.a
Ramification: In other words, even if an object is controlled
@@ -38000,7 +38130,7 @@ rules for assignment_statements in the following ways:
have a net side effect, they need not be performed.
20/3
- * {AI05-0067-1AI05-0067-1} For assignment of a noncontrolled type,
+ * {<AI05-0067-1AI05-0067-1>} For assignment of a noncontrolled type,
the implementation may finalize and assign each component of the
variable separately (rather than finalizing the entire variable and
assigning the entire new value) unless a discriminant of the
@@ -38015,8 +38145,8 @@ rules for assignment_statements in the following ways:
assignment, can in general be determined only at run time.
20.b/3
- Ramification: {AI05-0005-1AI05-0005-1} This potentially breaks
- a single assignment operation into many, and thus abort
+ Ramification: {<AI05-0005-1AI05-0005-1>} This potentially
+ breaks a single assignment operation into many, and thus abort
deferral (see *note 9.8::) needs to last only across an
individual component assignment when the component has a
controlled part. It is only important that the copy step is
@@ -38024,7 +38154,7 @@ rules for assignment_statements in the following ways:
between component assignments is not harmful.
21/3
- * {AI95-00147-01AI95-00147-01} {AI05-0067-1AI05-0067-1} The
+ * {<AI95-00147-01AI95-00147-01>} {<AI05-0067-1AI05-0067-1>} The
implementation need not create an anonymous object if the value
being assigned is the result of evaluating a name denoting an
object (the source object) whose storage cannot overlap with the
@@ -38036,13 +38166,13 @@ rules for assignment_statements in the following ways:
target and the source of the assignment are the same object).
21.a/3
- Ramification: {AI05-0005-1AI05-0005-1} If the anonymous object
- is eliminated by this permission, there is no anonymous object
- to be finalized and thus the Finalize call on it is
+ Ramification: {<AI05-0005-1AI05-0005-1>} If the anonymous
+ object is eliminated by this permission, there is no anonymous
+ object to be finalized and thus the Finalize call on it is
eliminated.
21.b/3
- {AI95-00147-01AI95-00147-01} {AI05-0005-1AI05-0005-1} Note
+ {<AI95-00147-01AI95-00147-01>} {<AI05-0005-1AI05-0005-1>} Note
that if the anonymous object is eliminated but the new value
is not built in place in the target object, that Adjust must
be called directly on the target object as the last step of
@@ -38052,10 +38182,10 @@ rules for assignment_statements in the following ways:
permissions.
22/2
-{AI95-00147-01AI95-00147-01} Furthermore, an implementation is permitted
-to omit implicit Initialize, Adjust, and Finalize calls and associated
-assignment operations on an object of a nonlimited controlled type
-provided that:
+{<AI95-00147-01AI95-00147-01>} Furthermore, an implementation is
+permitted to omit implicit Initialize, Adjust, and Finalize calls and
+associated assignment operations on an object of a nonlimited controlled
+type provided that:
23/2
* any omitted Initialize call is not a call on a user-defined
@@ -38111,7 +38241,7 @@ implicit calls have additional external effects.
_Extensions to Ada 95_
27.c/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Types
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Types
Controlled and Limited_Controlled now have
Preelaborable_Initialization, so that objects of types derived
from these types can be used in preelaborated packages.
@@ -38119,46 +38249,47 @@ implicit calls have additional external effects.
_Wording Changes from Ada 95_
27.d/2
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01} Corrigendum:
- Clarified that Ada.Finalization is a remote types package.
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>}
+ Corrigendum: Clarified that Ada.Finalization is a remote types
+ package.
27.e/2
- {8652/00218652/0021} {AI95-00182-01AI95-00182-01} Corrigendum:
- Added wording to clarify that the default initialization
- (whatever it is) of an ancestor part is used.
+ {<8652/00218652/0021>} {<AI95-00182-01AI95-00182-01>}
+ Corrigendum: Added wording to clarify that the default
+ initialization (whatever it is) of an ancestor part is used.
27.f/2
- {8652/00228652/0022} {AI95-00083-01AI95-00083-01} Corrigendum:
- Clarified that Adjust is never called on an aggregate used for
- the initialization of an object or subaggregate, or passed as
- a parameter.
+ {<8652/00228652/0022>} {<AI95-00083-01AI95-00083-01>}
+ Corrigendum: Clarified that Adjust is never called on an
+ aggregate used for the initialization of an object or
+ subaggregate, or passed as a parameter.
27.g/2
- {AI95-00147-01AI95-00147-01} Additional optimizations are
+ {<AI95-00147-01AI95-00147-01>} Additional optimizations are
allowed for nonlimited controlled types. These allow
traditional dead variable elimination to be applied to such
types.
27.h/2
- {AI95-00318-02AI95-00318-02} Corrected the build-in-place
+ {<AI95-00318-02AI95-00318-02>} Corrected the build-in-place
requirement for controlled aggregates to be consistent with
the requirements for limited types.
27.i/2
- {AI95-00348-01AI95-00348-01} The operations of types
+ {<AI95-00348-01AI95-00348-01>} The operations of types
Controlled and Limited_Controlled are now declared as null
procedures (see *note 6.7::) to make the semantics clear (and
to provide a good example of what null procedures can be used
for).
27.j/2
- {AI95-00360-01AI95-00360-01} Types that need finalization are
- defined; this is used by the No_Nested_Finalization
+ {<AI95-00360-01AI95-00360-01>} Types that need finalization
+ are defined; this is used by the No_Nested_Finalization
restriction (see *note D.7::, "*note D.7:: Tasking
Restrictions").
27.k/2
- {AI95-00373-01AI95-00373-01} Generalized the description of
+ {<AI95-00373-01AI95-00373-01>} Generalized the description of
objects that have Initialize called for them to say that it is
done for all objects that are initialized by default. This is
needed so that all of the new cases are covered.
@@ -38166,15 +38297,15 @@ implicit calls have additional external effects.
_Extensions to Ada 2005_
27.l/3
- {AI05-0212-1AI05-0212-1} Package Ada.Finalization now has Pure
- categorization, so it can be mentioned for any package. Note
- that this does not change the preelaborability of objects
+ {<AI05-0212-1AI05-0212-1>} Package Ada.Finalization now has
+ Pure categorization, so it can be mentioned for any package.
+ Note that this does not change the preelaborability of objects
descended from Controlled and Limited_Controlled.
_Wording Changes from Ada 2005_
27.m/3
- {AI05-0013-1AI05-0013-1} Correction: Eliminated coextensions
+ {<AI05-0013-1AI05-0013-1>} Correction: Eliminated coextensions
from the "needs finalization" rules, as this cannot be
determined in general in the compilation unit that declares
the type. (The designated type of the coextension may have
@@ -38184,18 +38315,18 @@ implicit calls have additional external effects.
D.7::) or that coextensions cannot happen.
27.n/3
- {AI05-0013-1AI05-0013-1} Correction: Corrected the "needs
+ {<AI05-0013-1AI05-0013-1>} Correction: Corrected the "needs
finalization" rules to include class-wide types, as a future
extension can include a part that needs finalization.
27.o/3
- {AI05-0026-1AI05-0026-1} Correction: Corrected the "needs
+ {<AI05-0026-1AI05-0026-1>} Correction: Corrected the "needs
finalization" rules to clearly say that they ignore privacy.
27.p/3
- {AI05-0067-1AI05-0067-1} Correction: Changed "built in place"
- to Dynamic Semantics and centralized the rules here. This
- eliminates the fiction that built in place is just a
+ {<AI05-0067-1AI05-0067-1>} Correction: Changed "built in
+ place" to Dynamic Semantics and centralized the rules here.
+ This eliminates the fiction that built in place is just a
combination of a permission and a requirement; it clearly has
noticeable semantic effects. This wording change is not
intended to change the semantics of any correct Ada program.
@@ -38211,24 +38342,25 @@ File: aarm2012.info, Node: 7.6.1, Up: 7.6
---------------------------------
1
-[This subclause defines completion and leaving of the execution of
-constructs and entities. A master is the execution of a construct that
-includes finalization of local objects after it is complete (and after
-waiting for any local tasks -- see *note 9.3::), but before leaving.
-Other constructs and entities are left immediately upon completion. ]
+[This subclause defines <completion> and <leaving> of the execution of
+constructs and entities. A <master> is the execution of a construct
+that includes finalization of local objects after it is complete (and
+after waiting for any local tasks -- see *note 9.3::), but before
+leaving. Other constructs and entities are left immediately upon
+completion. ]
_Dynamic Semantics_
2/2
-{AI95-00318-02AI95-00318-02} The execution of a construct or entity is
-complete when the end of that execution has been reached, or when a
-transfer of control (see *note 5.1::) causes it to be abandoned.
+{<AI95-00318-02AI95-00318-02>} The execution of a construct or entity is
+<complete> when the end of that execution has been reached, or when a
+transfer of control (see *note 5.1::) causes it to be abandoned.
Completion due to reaching the end of execution, or due to the transfer
of control of an exit_statement, return statement, goto_statement, or
requeue_statement or of the selection of a terminate_alternative is
-normal completion. Completion is abnormal otherwise [-- when control is
-transferred out of a construct due to abort or the raising of an
-exception].
+<normal completion>. Completion is <abnormal> otherwise [-- when
+control is transferred out of a construct due to abort or the raising of
+an exception].
2.a
Discussion: Don't confuse the run-time concept of completion
@@ -38236,21 +38368,21 @@ exception].
3.11.1::.
3/2
-{AI95-00162-01AI95-00162-01} {AI95-00416-01AI95-00416-01} After
-execution of a construct or entity is complete, it is left, meaning that
-execution continues with the next action, as defined for the execution
-that is taking place. Leaving an execution happens immediately after its
-completion, except in the case of a master: the execution of a body
-other than a package_body; the execution of a statement; or the
-evaluation of an expression, function_call, or range that is not part of
-an enclosing expression, function_call, range, or simple_statement
-(*note 5.1: S0147.) other than a simple_return_statement (*note 6.5:
-S0183.). A master is finalized after it is complete, and before it is
-left.
+{<AI95-00162-01AI95-00162-01>} {<AI95-00416-01AI95-00416-01>} After
+execution of a construct or entity is complete, it is <left>, meaning
+that execution continues with the next action, as defined for the
+execution that is taking place. Leaving an execution happens
+immediately after its completion, except in the case of a <master>: the
+execution of a body other than a package_body; the execution of a
+statement; or the evaluation of an expression, function_call, or range
+that is not part of an enclosing expression, function_call, range, or
+simple_statement (*note 5.1: S0147.) other than a
+simple_return_statement (*note 6.5: S0183.). A master is finalized
+after it is complete, and before it is left.
3.a/2
- Reason: {AI95-00162-01AI95-00162-01}
- {AI95-00416-01AI95-00416-01} Expressions and statements are
+ Reason: {<AI95-00162-01AI95-00162-01>}
+ {<AI95-00416-01AI95-00416-01>} Expressions and statements are
masters so that objects created by subprogram calls (in
aggregates, allocators for anonymous access-to-object types,
and so on) are finalized and have their tasks awaited before
@@ -38261,16 +38393,17 @@ left.
simple_statement (*note 5.1: S0147.).
3.b/2
- {AI95-00416-01AI95-00416-01} We have to include function_calls
- in the contexts that do not cause masters to occur so that
- expressions contained in a function_call (that is not part of
- an expression or simple_statement) do not individually become
- masters. We certainly do not want the parameter expressions
- of a function_call to be separate masters, as they would then
- be finalized before the function is called.
+ {<AI95-00416-01AI95-00416-01>} We have to include
+ function_calls in the contexts that do not cause masters to
+ occur so that expressions contained in a function_call (that
+ is not part of an expression or simple_statement) do not
+ individually become masters. We certainly do not want the
+ parameter expressions of a function_call to be separate
+ masters, as they would then be finalized before the function
+ is called.
3.c/2
- Ramification: {AI95-00416-01AI95-00416-01} The fact that a
+ Ramification: {<AI95-00416-01AI95-00416-01>} The fact that a
function_call is a master does not change the accessibility of
the return object denoted by the function_call; that depends
on the use of the function_call. The function_call is the
@@ -38278,9 +38411,9 @@ left.
parameters of types with task or controlled parts).
4
-For the finalization of a master, dependent tasks are first awaited, as
-explained in *note 9.3::. Then each object whose accessibility level is
-the same as that of the master is finalized if the object was
+For the <finalization> of a master, dependent tasks are first awaited,
+as explained in *note 9.3::. Then each object whose accessibility level
+is the same as that of the master is finalized if the object was
successfully initialized and still exists. [These actions are performed
whether the master is left by reaching the last statement or via a
transfer of control.] When a transfer of control causes completion of
@@ -38324,43 +38457,43 @@ outward.
executions of constructs or entities. However, the standard
sometimes (informally) refers to the constructs or entities
whose executions are being completed. Thus, for example, "the
- subprogram call or task is complete" really means "the
- execution of the subprogram call or task is complete."
+ subprogram call or task is complete" really means "<the
+ execution of> the subprogram call or task is complete."
5
-For the finalization of an object:
+For the <finalization> of an object:
6/3
- * {AI05-0099-1AI05-0099-1} If the full type of the object is an
+ * {<AI05-0099-1AI05-0099-1>} If the full type of the object is an
elementary type, finalization has no effect;
6.a/3
- Reason: {AI05-0099-1AI05-0099-1} We say "full type" in this
+ Reason: {<AI05-0099-1AI05-0099-1>} We say "full type" in this
and the following bullets as privacy is ignored for the
purpose of determining the finalization actions of an object;
that is as expected for Dynamic Semantics rules.
7/3
- * {AI05-0099-1AI05-0099-1} If the full type of the object is a tagged
- type, and the tag of the object identifies a controlled type, the
- Finalize procedure of that controlled type is called;
+ * {<AI05-0099-1AI05-0099-1>} If the full type of the object is a
+ tagged type, and the tag of the object identifies a controlled
+ type, the Finalize procedure of that controlled type is called;
8/3
- * {AI05-0099-1AI05-0099-1} If the full type of the object is a
+ * {<AI05-0099-1AI05-0099-1>} If the full type of the object is a
protected type, or if the full type of the object is a tagged type
and the tag of the object identifies a protected type, the actions
defined in *note 9.4:: are performed;
9/3
- * {AI95-00416-01AI95-00416-01} {AI05-0099-1AI05-0099-1} If the full
- type of the object is a composite type, then after performing the
- above actions, if any, every component of the object is finalized
- in an arbitrary order, except as follows: if the object has a
- component with an access discriminant constrained by a per-object
- expression, this component is finalized before any components that
- do not have such discriminants; for an object with several
- components with such a discriminant, they are finalized in the
- reverse of the order of their component_declarations;
+ * {<AI95-00416-01AI95-00416-01>} {<AI05-0099-1AI05-0099-1>} If the
+ full type of the object is a composite type, then after performing
+ the above actions, if any, every component of the object is
+ finalized in an arbitrary order, except as follows: if the object
+ has a component with an access discriminant constrained by a
+ per-object expression, this component is finalized before any
+ components that do not have such discriminants; for an object with
+ several components with such a discriminant, they are finalized in
+ the reverse of the order of their component_declarations;
9.a
Reason: This allows the finalization of a component with an
@@ -38368,20 +38501,20 @@ For the finalization of an object:
enclosing object prior to their being finalized.
9.b/4
- To be honest: {AI05-0099-1AI05-0099-1}
- {AI12-0005-1AI12-0005-1} The components discussed here are all
- of the components that the object actually has, not just those
- components that are statically identified by the type of the
- object. These can be different if the object has a class-wide
- type.
+ To be honest: {<AI05-0099-1AI05-0099-1>}
+ {<AI12-0005-1AI12-0005-1>} The components discussed here are
+ all of the components that the object actually has, not just
+ those components that are statically identified by the type of
+ the object. These can be different if the object has a
+ class-wide type.
9.1/2
- * {AI95-00416-01AI95-00416-01} If the object has coextensions (see
+ * {<AI95-00416-01AI95-00416-01>} If the object has coextensions (see
*note 3.10.2::), each coextension is finalized after the object
whose access discriminant designates it.
9.c/3
- Ramification: {AI05-0066-1AI05-0066-1} In the case of an
+ Ramification: {<AI05-0066-1AI05-0066-1>} In the case of an
aggregate or function call that is used (in its entirety) to
directly initialize a part of an object, the coextensions of
the result of evaluating the aggregate or function call are
@@ -38398,25 +38531,25 @@ allocator, the object will still exist when the
corresponding master
completes, and it will be finalized then.]
11/3
-{AI95-00280-01AI95-00280-01} {AI05-0051-1AI05-0051-1}
-{AI05-0190-1AI05-0190-1} The finalization of a master performs
+{<AI95-00280-01AI95-00280-01>} {<AI05-0051-1AI05-0051-1>}
+{<AI05-0190-1AI05-0190-1>} The finalization of a master performs
finalization of objects created by declarations in the master in the
reverse order of their creation. After the finalization of a master is
complete, the objects finalized as part of its finalization cease to
-exist, as do any types and subtypes defined and created within the
-master.
+<exist>, as do any types and subtypes defined and created within the
+master.
11.a/3
- This paragraph was deleted.{AI05-0190-1AI05-0190-1}
+ <This paragraph was deleted.>{<AI05-0190-1AI05-0190-1>}
11.b/3
- This paragraph was deleted.{AI05-0190-1AI05-0190-1}
+ <This paragraph was deleted.>{<AI05-0190-1AI05-0190-1>}
11.c/3
- This paragraph was deleted.{AI05-0190-1AI05-0190-1}
+ <This paragraph was deleted.>{<AI05-0190-1AI05-0190-1>}
11.d/3
- This paragraph was deleted.{AI05-0190-1AI05-0190-1}
+ <This paragraph was deleted.>{<AI05-0190-1AI05-0190-1>}
11.e
Ramification: Note that a deferred constant declaration does
@@ -38441,38 +38574,38 @@ master.
(well-defined) finalized state.
11.1/3
-{AI05-0190-1AI05-0190-1} Each nonderived access type T has an associated
-collection, which is the set of objects created by allocators of T, or
-of types derived from T. Unchecked_Deallocation removes an object from
-its collection. Finalization of a collection consists of finalization
-of each object in the collection, in an arbitrary order. The collection
-of an access type is an object implicitly declared at the following
-place:
+{<AI05-0190-1AI05-0190-1>} Each nonderived access type <T> has an
+associated <collection>, which is the set of objects created by
+allocators of <T>, or of types derived from <T>. Unchecked_Deallocation
+removes an object from its collection. Finalization of a collection
+consists of finalization of each object in the collection, in an
+arbitrary order. The collection of an access type is an object
+implicitly declared at the following place:
11.h/3
- Ramification: {AI05-0190-1AI05-0190-1} The place of the
+ Ramification: {<AI05-0190-1AI05-0190-1>} The place of the
implicit declaration determines when allocated objects are
finalized. For multiple collections declared at the same
place, we do not define the order of their implicit
declarations.
11.i/3
- {AI05-0190-1AI05-0190-1} Finalization of allocated objects is
- done according to the (ultimate ancestor) allocator type, not
- according to the storage pool in which they are allocated.
+ {<AI05-0190-1AI05-0190-1>} Finalization of allocated objects
+ is done according to the (ultimate ancestor) allocator type,
+ not according to the storage pool in which they are allocated.
Pool finalization might reclaim storage (see *note 13.11::,
"*note 13.11:: Storage Management"), but has nothing
(directly) to do with finalization of the pool elements.
11.j/3
- {AI05-0190-1AI05-0190-1} Note that finalization is done only
+ {<AI05-0190-1AI05-0190-1>} Note that finalization is done only
for objects that still exist; if an instance of
Unchecked_Deallocation has already gotten rid of a given pool
element, that pool element will not be finalized when the
master is left.
11.k/3
- Reason: {AI05-0190-1AI05-0190-1} Note that we talk about the
+ Reason: {<AI05-0190-1AI05-0190-1>} Note that we talk about the
type of the allocator here. There may be access values of a
(general) access type pointing at objects created by
allocators for some other type; these are not (necessarily)
@@ -38483,7 +38616,7 @@ place:
13.14::) of the type.
11.l/3
- Reason: {AI05-0190-1AI05-0190-1} The freezing point of the
+ Reason: {<AI05-0190-1AI05-0190-1>} The freezing point of the
ultimate ancestor access type is chosen because before that
point, pool elements cannot be created, and after that point,
access values designating (parts of) the pool elements can be
@@ -38502,26 +38635,26 @@ place:
(see *note 3.10.2::).
11.m/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0190-1AI05-0190-1} We mean at a place within the master
- consistent with the execution of the call within the master.
- We don't say that normatively, as it is difficult to explain
- that when the master of the call need not be the master that
- immediately includes the call (such as when an anonymous
- result is converted to a named access type).
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0190-1AI05-0190-1>} We mean at a place within the
+ master consistent with the execution of the call within the
+ master. We don't say that normatively, as it is difficult to
+ explain that when the master of the call need not be the
+ master that immediately includes the call (such as when an
+ anonymous result is converted to a named access type).
11.5/3
* For any other anonymous access type, the first freezing point of
the innermost enclosing declaration.
12/2
-{AI95-00256-01AI95-00256-01} The target of an assignment_statement is
+{<AI95-00256-01AI95-00256-01>} The target of an assignment_statement is
finalized before copying in the new value, as explained in *note 7.6::.
13/3
-{8652/00218652/0021} {AI95-00182-01AI95-00182-01}
-{AI95-00162-01AI95-00162-01} {AI05-0066-1AI05-0066-1}
-{AI05-0142-4AI05-0142-4} {AI05-0269-1AI05-0269-1} The master of an
+{<8652/00218652/0021>} {<AI95-00182-01AI95-00182-01>}
+{<AI95-00162-01AI95-00162-01>} {<AI05-0066-1AI05-0066-1>}
+{<AI05-0142-4AI05-0142-4>} {<AI05-0269-1AI05-0269-1>} The master of an
object is the master enclosing its creation whose accessibility level
(see *note 3.10.2::) is equal to that of the object, except in the case
of an anonymous object representing the result of an aggregate or
@@ -38535,24 +38668,24 @@ evaluation of the aggregate or function call, which
may be the aggregate
or function call itself.
13.a/2
- This paragraph was deleted.{AI95-00162-01AI95-00162-01}
+ <This paragraph was deleted.>{<AI95-00162-01AI95-00162-01>}
13.b/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
13.c/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
13.d/2
- Reason: {AI95-00162-01AI95-00162-01} This effectively imports
- all of the special rules for the accessibility level of
- renames, allocators, and so on, and applies them to determine
- where objects created in them are finalized. For instance,
- the master of a rename of a subprogram is that of the renamed
- subprogram.
+ Reason: {<AI95-00162-01AI95-00162-01>} This effectively
+ imports all of the special rules for the accessibility level
+ of renames, allocators, and so on, and applies them to
+ determine where objects created in them are finalized. For
+ instance, the master of a rename of a subprogram is that of
+ the renamed subprogram.
13.e/3
- {AI05-0066-1AI05-0066-1} In *note 3.10.2:: we assign an
+ {<AI05-0066-1AI05-0066-1>} In *note 3.10.2:: we assign an
accessibility level to the result of an aggregate or function
call that is used to directly initialize a part of an object
based on the object being initialized. This is important to
@@ -38565,11 +38698,11 @@ or function call itself.
rather than persisting until the target object is finalized
(but not its coextensions). (Note than an implementation is
never required to create such an anonymous object, and in some
- cases is required to not have such a separate object, but
+ cases is required to <not> have such a separate object, but
rather to build the result directly in the target.)
13.f/3
- {AI05-0142-4AI05-0142-4} The special case for explicitly
+ {<AI05-0142-4AI05-0142-4>} The special case for explicitly
aliased parameters of functions is needed for the same reason,
as access discriminants of the returned object may designate
one of these parameters. In that case, we want to lengthen
@@ -38577,7 +38710,7 @@ or function call itself.
lifetime of the result.
13.g/3
- {AI05-0142-4AI05-0142-4} We don't do a similar change for
+ {<AI05-0142-4AI05-0142-4>} We don't do a similar change for
other kinds of calls, because the extended lifetime of the
parameters adds no value, but could constitute a storage leak.
For instance, such an anonymous object created by a procedure
@@ -38587,31 +38720,31 @@ or function call itself.
Unchecked_Access).
13.h/3
- Ramification: {AI05-0142-4AI05-0142-4} Note that the lifetime
- of the master given to anonymous objects in explicitly aliased
- parameters of functions is not necessarily as long as the
- lifetime of the master of the object being initialized (if the
- function call is used to initialize an allocator, for
- instance). In that case, the accessibility check on
- explicitly aliased parameters will necessarily fail if any
- such anonymous objects exist. This is necessary to avoid
- requiring the objects to live as long as the access type or
- having the implementation complexity of an implicit
+ Ramification: {<AI05-0142-4AI05-0142-4>} Note that the
+ lifetime of the master given to anonymous objects in
+ explicitly aliased parameters of functions is not necessarily
+ as long as the lifetime of the master of the object being
+ initialized (if the function call is used to initialize an
+ allocator, for instance). In that case, the accessibility
+ check on explicitly aliased parameters will necessarily fail
+ if any such anonymous objects exist. This is necessary to
+ avoid requiring the objects to live as long as the access type
+ or having the implementation complexity of an implicit
coextension.
13.1/3
-{8652/00238652/0023} {AI95-00169-01AI95-00169-01}
-{AI95-00162-01AI95-00162-01} {AI05-0066-1AI05-0066-1}
-{AI05-0262-1AI05-0262-1} In the case of an expression that is a master,
-finalization of any (anonymous) objects occurs after completing
+{<8652/00238652/0023>} {<AI95-00169-01AI95-00169-01>}
+{<AI95-00162-01AI95-00162-01>} {<AI05-0066-1AI05-0066-1>}
+{<AI05-0262-1AI05-0262-1>} In the case of an expression that is a
+master, finalization of any (anonymous) objects occurs after completing
evaluation of the expression and all use of the objects, prior to
starting the execution of any subsequent construct.
_Bounded (Run-Time) Errors_
14/1
-{8652/00238652/0023} {AI95-00169-01AI95-00169-01} It is a bounded error
-for a call on Finalize or Adjust that occurs as part of object
+{<8652/00238652/0023>} {<AI95-00169-01AI95-00169-01>} It is a bounded
+error for a call on Finalize or Adjust that occurs as part of object
finalization or assignment to propagate an exception. The possible
consequences depend on what action invoked the Finalize or Adjust
operation:
@@ -38625,29 +38758,30 @@ operation:
way.
14.a.1/1
- {8652/00238652/0023} {AI95-00169-01AI95-00169-01} It also is
- not a bounded error for an explicit call to Finalize or Adjust
- to propagate an exception. We do not want implementations to
- have to treat explicit calls to these routines specially.
+ {<8652/00238652/0023>} {<AI95-00169-01AI95-00169-01>} It also
+ is not a bounded error for an explicit call to Finalize or
+ Adjust to propagate an exception. We do not want
+ implementations to have to treat explicit calls to these
+ routines specially.
15
* For a Finalize invoked as part of an assignment_statement,
Program_Error is raised at that point.
16/2
- * {8652/00248652/0024} {AI95-00193-01AI95-00193-01}
- {AI95-00256-01AI95-00256-01} For an Adjust invoked as part of
+ * {<8652/00248652/0024>} {<AI95-00193-01AI95-00193-01>}
+ {<AI95-00256-01AI95-00256-01>} For an Adjust invoked as part of
assignment operations other than those invoked as part of an
assignment_statement, other adjustments due to be performed might
or might not be performed, and then Program_Error is raised.
During its propagation, finalization might or might not be applied
- to objects whose Adjust failed. For an Adjust invoked as part of an
- assignment_statement, any other adjustments due to be performed are
- performed, and then Program_Error is raised.
+ to objects whose Adjust failed. For an Adjust invoked as part of
+ an assignment_statement, any other adjustments due to be performed
+ are performed, and then Program_Error is raised.
16.a/2
- Reason: {8652/00248652/0024} {AI95-00193-01AI95-00193-01}
- {AI95-00256-01AI95-00256-01} In the case of assignments that
+ Reason: {<8652/00248652/0024>} {<AI95-00193-01AI95-00193-01>}
+ {<AI95-00256-01AI95-00256-01>} In the case of assignments that
are part of initialization, there is no need to complete all
adjustments if one propagates an exception, as the object will
immediately be finalized. So long as a subcomponent is not
@@ -38666,14 +38800,14 @@ operation:
permission.
16.a.1/1
- Ramification: {8652/00248652/0024}
- {AI95-00193-01AI95-00193-01} Even if an Adjust invoked as part
- of the initialization of a controlled object propagates an
- exception, objects whose initialization (including any Adjust
- or Initialize calls) successfully completed will be finalized.
- The permission above only applies to objects whose Adjust
- failed. Objects for which Adjust was never even invoked must
- not be finalized.
+ Ramification: {<8652/00248652/0024>}
+ {<AI95-00193-01AI95-00193-01>} Even if an Adjust invoked as
+ part of the initialization of a controlled object propagates
+ an exception, objects whose initialization (including any
+ Adjust or Initialize calls) successfully completed will be
+ finalized. The permission above only applies to objects whose
+ Adjust failed. Objects for which Adjust was never even
+ invoked must not be finalized.
17
* For a Finalize invoked as part of a call on an instance of
@@ -38681,38 +38815,40 @@ operation:
are performed, and then Program_Error is raised.
17.a.1/1
- Discussion: {8652/01048652/0104} {AI95-00179-01AI95-00179-01}
- The standard does not specify if storage is recovered in this
- case. If storage is not recovered (and the object continues
- to exist), Finalize may be called on the object again (when
- the allocator's master is finalized).
+ Discussion: {<8652/01048652/0104>}
+ {<AI95-00179-01AI95-00179-01>} The standard does not specify
+ if storage is recovered in this case. If storage is not
+ recovered (and the object continues to exist), Finalize may be
+ called on the object again (when the allocator's master is
+ finalized).
17.1/3
- * This paragraph was deleted.{8652/00238652/0023}
- {AI95-00169-01AI95-00169-01} {AI05-0064-1AI05-0064-1}
+ * <This paragraph was deleted.>{<8652/00238652/0023>}
+ {<AI95-00169-01AI95-00169-01>} {<AI05-0064-1AI05-0064-1>}
17.2/1
- * {8652/00238652/0023} {AI95-00169-01AI95-00169-01} For a Finalize
- invoked due to reaching the end of the execution of a master, any
- other finalizations associated with the master are performed, and
- Program_Error is raised immediately after leaving the master.
+ * {<8652/00238652/0023>} {<AI95-00169-01AI95-00169-01>} For a
+ Finalize invoked due to reaching the end of the execution of a
+ master, any other finalizations associated with the master are
+ performed, and Program_Error is raised immediately after leaving
+ the master.
17.a/3
- Discussion: {AI05-0064-1AI05-0064-1} This rule covers both
+ Discussion: {<AI05-0064-1AI05-0064-1>} This rule covers both
ordinary objects created by a declaration, and anonymous
objects created as part of evaluating an expression. All
contexts that create objects that need finalization are
defined to be masters.
18/2
- * {AI95-00318-02AI95-00318-02} For a Finalize invoked by the transfer
- of control of an exit_statement, return statement, goto_statement,
- or requeue_statement (*note 9.5.4: S0226.), Program_Error is raised
- no earlier than after the finalization of the master being
- finalized when the exception occurred, and no later than the point
- where normal execution would have continued. Any other
- finalizations due to be performed up to that point are performed
- before raising Program_Error.
+ * {<AI95-00318-02AI95-00318-02>} For a Finalize invoked by the
+ transfer of control of an exit_statement, return statement,
+ goto_statement, or requeue_statement (*note 9.5.4: S0226.),
+ Program_Error is raised no earlier than after the finalization of
+ the master being finalized when the exception occurred, and no
+ later than the point where normal execution would have continued.
+ Any other finalizations due to be performed up to that point are
+ performed before raising Program_Error.
18.a
Ramification: For example, upon leaving a block_statement due
@@ -38735,13 +38871,13 @@ operation:
begin
goto The_Label;
exception
- when Program_Error => ... -- Handler number 1.
+ when Program_Error => ... --< Handler number 1.>
end;
exception
- when Program_Error => ... -- Handler number 2.
+ when Program_Error => ... --< Handler number 2.>
end;
exception
- when Program_Error => ... -- Handler number 3.
+ when Program_Error => ... --< Handler number 3.>
end Main;
18.c
@@ -38802,8 +38938,8 @@ operation:
_Implementation Permissions_
20.1/3
-{AI05-0107-1AI05-0107-1} If the execution of an allocator propagates an
-exception, any parts of the allocated object that were successfully
+{<AI05-0107-1AI05-0107-1>} If the execution of an allocator propagates
+an exception, any parts of the allocated object that were successfully
initialized may be finalized as part of the finalization of the
innermost master enclosing the allocator.
@@ -38816,11 +38952,12 @@ innermost master enclosing the allocator.
type is library level.
20.2/3
-{AI05-0111-3AI05-0111-3} {AI05-0262-1AI05-0262-1} The implementation may
-finalize objects created by allocators for an access type whose storage
-pool supports subpools (see *note 13.11.4::) as if the objects were
-created (in an arbitrary order) at the point where the storage pool was
-elaborated instead of at the first freezing point of the access type.
+{<AI05-0111-3AI05-0111-3>} {<AI05-0262-1AI05-0262-1>} The implementation
+may finalize objects created by allocators for an access type whose
+storage pool supports subpools (see *note 13.11.4::) as if the objects
+were created (in an arbitrary order) at the point where the storage pool
+was elaborated instead of at the first freezing point of the access
+type.
20.d/3
Ramification: This allows the finalization of such objects to
@@ -38841,7 +38978,7 @@ elaborated instead of at the first freezing point of
the access type.
NOTES
21/3
- 18 {AI05-0299-1AI05-0299-1} The rules of Clause 10 imply that
+ 18 {<AI05-0299-1AI05-0299-1>} The rules of Clause 10 imply that
immediately prior to partition termination, Finalize operations are
applied to library-level controlled objects (including those
created by allocators of library-level access types, except those
@@ -38894,16 +39031,16 @@ elaborated instead of at the first freezing point of
the access type.
value and adjusting it).
24.c/2
- Discussion: {AI95-00287-01AI95-00287-01} Either Initialize or
- Adjust, but not both, is applied to (almost) every controlled
- object when it is created: Initialize is done when no initial
- value is assigned to the object, whereas Adjust is done as
- part of assigning the initial value. The one exception is the
- object initialized by an aggregate (both the anonymous object
- created for an aggregate, or an object initialized by an
- aggregate that is built-in-place); Initialize is not applied
- to the aggregate as a whole, nor is the value of the aggregate
- or object adjusted.
+ Discussion: {<AI95-00287-01AI95-00287-01>} Either Initialize
+ or Adjust, but not both, is applied to (almost) every
+ controlled object when it is created: Initialize is done when
+ no initial value is assigned to the object, whereas Adjust is
+ done as part of assigning the initial value. The one
+ exception is the object initialized by an aggregate (both the
+ anonymous object created for an aggregate, or an object
+ initialized by an aggregate that is built-in-place);
+ Initialize is not applied to the aggregate as a whole, nor is
+ the value of the aggregate or object adjusted.
24.d
All of the following use the assignment operation, and thus
@@ -38923,7 +39060,7 @@ elaborated instead of at the first freezing point of
the access type.
value of the object as a whole is not adjusted);
24.h/2
- * {AI95-00318-02AI95-00318-02} function return, when the
+ * {<AI95-00318-02AI95-00318-02>} function return, when the
result is not built-in-place (adjustment of the result
happens before finalization of the function);
@@ -38936,7 +39073,7 @@ elaborated instead of at the first freezing point of
the access type.
these are defined in terms of constant declarations; and
24.k/2
- * {AI95-00287-01AI95-00287-01} aggregates (see *note
+ * {<AI95-00287-01AI95-00287-01>} aggregates (see *note
4.3::), when the result is not built-in-place (in this
case, the value of each component, and the parent part,
for an extension_aggregate, is assigned, and therefore
@@ -38966,7 +39103,7 @@ elaborated instead of at the first freezing point of
the access type.
controlled, nothing interesting happens there, either.
24.n.1/2
- * {AI95-00318-02AI95-00318-02} Objects initialized by
+ * {<AI95-00318-02AI95-00318-02>} Objects initialized by
function results and aggregates that are built-in-place.
In this case, the assignment operation is never executed,
and no adjustment takes place. While built-in-place is
@@ -38975,7 +39112,7 @@ elaborated instead of at the first freezing point of
the access type.
limited types have no Adjust to call.
24.o/2
- This paragraph was deleted.{AI95-00287-01AI95-00287-01}
+ <This paragraph was deleted.>{<AI95-00287-01AI95-00287-01>}
24.p
Finalization of the parts of a protected object are not done
@@ -39023,18 +39160,19 @@ elaborated instead of at the first freezing point of
the access type.
_Wording Changes from Ada 83_
24.v/3
- {AI05-0299-1AI05-0299-1} Finalization depends on the concepts
- of completion and leaving, and on the concept of a master.
- Therefore, we have moved the definitions of these concepts
- here, from where they used to be in Clause *note 9::. These
- concepts also needed to be generalized somewhat. Task waiting
- is closely related to user-defined finalization; the rules
- here refer to the task-waiting rules of Clause *note 9::.
+ {<AI05-0299-1AI05-0299-1>} Finalization depends on the
+ concepts of completion and leaving, and on the concept of a
+ master. Therefore, we have moved the definitions of these
+ concepts here, from where they used to be in Clause *note 9::.
+ These concepts also needed to be generalized somewhat. Task
+ waiting is closely related to user-defined finalization; the
+ rules here refer to the task-waiting rules of Clause *note
+ 9::.
_Inconsistencies With Ada 95_
24.v.1/3
- {AI05-0066-1AI05-0066-1} Ada 2012 Correction: Changed the
+ {<AI05-0066-1AI05-0066-1>} Ada 2012 Correction: Changed the
definition of the master of an anonymous object used to
directly initialize an object, so it can be finalized
immediately rather than having to hang around as long as the
@@ -39047,24 +39185,24 @@ elaborated instead of at the first freezing point of
the access type.
_Wording Changes from Ada 95_
24.w/2
- {8652/00218652/0021} {AI95-00182-01AI95-00182-01} Corrigendum:
- Fixed the wording to say that anonymous objects aren't
- finalized until the object can't be used anymore.
+ {<8652/00218652/0021>} {<AI95-00182-01AI95-00182-01>}
+ Corrigendum: Fixed the wording to say that anonymous objects
+ aren't finalized until the object can't be used anymore.
24.x/2
- {8652/00238652/0023} {AI95-00169-01AI95-00169-01} Corrigendum:
- Added wording to clarify what happens when Adjust or Finalize
- raises an exception; some cases had been omitted.
+ {<8652/00238652/0023>} {<AI95-00169-01AI95-00169-01>}
+ Corrigendum: Added wording to clarify what happens when Adjust
+ or Finalize raises an exception; some cases had been omitted.
24.y/2
- {8652/00248652/0024} {AI95-00193-01AI95-00193-01}
- {AI95-00256-01AI95-00256-01} Corrigendum: Stated that if
+ {<8652/00248652/0024>} {<AI95-00193-01AI95-00193-01>}
+ {<AI95-00256-01AI95-00256-01>} Corrigendum: Stated that if
Adjust raises an exception during initialization, nothing
further is required. This is corrected in Ada 2005 to include
all kinds of assignment other than assignment_statements.
24.z/2
- {AI95-00162-01AI95-00162-01} {AI95-00416-01AI95-00416-01}
+ {<AI95-00162-01AI95-00162-01>} {<AI95-00416-01AI95-00416-01>}
Revised the definition of master to include expressions and
statements, in order to cleanly define what happens for tasks
and controlled objects created as part of a subprogram call.
@@ -39073,13 +39211,13 @@ elaborated instead of at the first freezing point of
the access type.
rolling in).
24.aa/2
- {AI95-00280-01AI95-00280-01} We define finalization of the
- collection here, so as to be able to conveniently refer to it
+ {<AI95-00280-01AI95-00280-01>} We define <finalization of the
+ collection> here, so as to be able to conveniently refer to it
in other rules (especially in *note 4.8::, "*note 4.8::
Allocators").
24.bb/2
- {AI95-00416-01AI95-00416-01} Clarified that a coextension is
+ {<AI95-00416-01AI95-00416-01>} Clarified that a coextension is
finalized at the same time as the outer object. (This was
intended for Ada 95, but since the concept did not have a
name, it was overlooked.)
@@ -39087,42 +39225,42 @@ elaborated instead of at the first freezing point of
the access type.
_Inconsistencies With Ada 2005_
24.cc/3
- {AI05-0051-1AI05-0051-1} {AI05-0190-1AI05-0190-1} Correction:
- Better defined when objects allocated from anonymous access
- types are finalized. This could be inconsistent if objects
- are finalized in a different order than in an Ada 2005
- implementation and that order caused different program
- behavior; however programs that depend on the order of
- finalization within a single master are already fragile and
- hopefully are rare.
+ {<AI05-0051-1AI05-0051-1>} {<AI05-0190-1AI05-0190-1>}
+ Correction: Better defined when objects allocated from
+ anonymous access types are finalized. This could be
+ inconsistent if objects are finalized in a different order
+ than in an Ada 2005 implementation and that order caused
+ different program behavior; however programs that depend on
+ the order of finalization within a single master are already
+ fragile and hopefully are rare.
_Wording Changes from Ada 2005_
24.dd/3
- {AI05-0064-1AI05-0064-1} Correction: Removed a redundant rule,
- which is now covered by the additional places where masters
- are defined.
+ {<AI05-0064-1AI05-0064-1>} Correction: Removed a redundant
+ rule, which is now covered by the additional places where
+ masters are defined.
24.ee/4
- {AI05-0099-1AI05-0099-1} {AI12-0005-1AI12-0005-1} Correction:
- Clarified the finalization rules so that there is no doubt
- that privacy is ignored, and to ensure that objects of
- class-wide interface types are finalized based on their
+ {<AI05-0099-1AI05-0099-1>} {<AI12-0005-1AI12-0005-1>}
+ Correction: Clarified the finalization rules so that there is
+ no doubt that privacy is ignored, and to ensure that objects
+ of class-wide interface types are finalized based on their
specific concrete type.
24.ff/3
- {AI05-0107-1AI05-0107-1} Correction: Allowed premature
+ {<AI05-0107-1AI05-0107-1>} Correction: Allowed premature
finalization of parts of failed allocators. This could be an
inconsistency, but the previous behavior is still allowed and
there is no requirement that implementations take advantage of
the permission.
24.gg/3
- {AI05-0111-3AI05-0111-3} Added a permission to finalize an
+ {<AI05-0111-3AI05-0111-3>} Added a permission to finalize an
object allocated from a subpool later than usual.
24.hh/3
- {AI05-0142-4AI05-0142-4} Added text to specially define the
+ {<AI05-0142-4AI05-0142-4>} Added text to specially define the
master of anonymous objects which are passed as explicitly
aliased parameters (see *note 6.1::) of functions. The model
for these parameters is explained in detail in *note 6.4.1::.
@@ -39134,21 +39272,21 @@ File: aarm2012.info, Node: 8, Next: 9, Prev: 7,
Up: Top
******************
1/3
-{AI05-0299-1AI05-0299-1} [The rules defining the scope of declarations
+{<AI05-0299-1AI05-0299-1>} [The rules defining the scope of declarations
and the rules defining which identifiers, character_literals, and
operator_symbols are visible at (or from) various places in the text of
the program are described in this clause. The formulation of these
rules uses the notion of a declarative region.
2/3
-{AI05-0299-1AI05-0299-1} As explained in Clause *note 3::, a declaration
-declares a view of an entity and associates a defining name with that
-view. The view comprises an identification of the viewed entity, and
-possibly additional properties. A usage name denotes a declaration. It
-also denotes the view declared by that declaration, and denotes the
-entity of that view. Thus, two different usage names might denote two
-different views of the same entity; in this case they denote the same
-entity.]
+{<AI05-0299-1AI05-0299-1>} As explained in Clause *note 3::, a
+declaration declares a view of an entity and associates a defining name
+with that view. The view comprises an identification of the viewed
+entity, and possibly additional properties. A usage name denotes a
+declaration. It also denotes the view declared by that declaration, and
+denotes the entity of that view. Thus, two different usage names might
+denote two different views of the same entity; in this case they denote
+the same entity.]
2.a
To be honest: In some cases, a usage name that denotes a
@@ -39192,7 +39330,7 @@ File: aarm2012.info, Node: 8.1, Next: 8.2, Up: 8
1
For each of the following constructs, there is a portion of the program
-text called its declarative region, [within which nested declarations
+text called its <declarative region>, [within which nested declarations
can occur]:
2
@@ -39200,7 +39338,7 @@ can occur]:
not a completion [of a previous declaration];
2.1/4
- * {AI12-0094-1AI12-0094-1} an access_definition;
+ * {<AI12-0094-1AI12-0094-1>} an access_definition;
3
* a block_statement;
@@ -39209,10 +39347,10 @@ can occur]:
* a loop_statement;
4.1/3
- * {AI05-0255-1AI05-0255-1} a quantified_expression;
+ * {<AI05-0255-1AI05-0255-1>} a quantified_expression;
4.2/3
- * {AI95-00318-02AI95-00318-02} an extended_return_statement;
+ * {<AI95-00318-02AI95-00318-02>} an extended_return_statement;
5
* an accept_statement;
@@ -39245,8 +39383,8 @@ additional text determined [(recursively)], as follows:
directly visible in the record_representation_clause.
12
-The declarative region of a declaration is also called the declarative
-region of any view or entity declared by the declaration.
+The declarative region of a declaration is also called the <declarative
+region> of any view or entity declared by the declaration.
12.a
Reason: The constructs that have declarative regions are the
@@ -39265,9 +39403,9 @@ region of any view or entity declared by the
declaration.
context_clauses.
13
-A declaration occurs immediately within a declarative region if this
+A declaration occurs <immediately within> a declarative region if this
region is the innermost declarative region that encloses the declaration
-(the immediately enclosing declarative region), not counting the
+(the <immediately enclosing> declarative region), not counting the
declarative region (if any) associated with the declaration itself.
13.a
@@ -39276,10 +39414,10 @@ declarative region (if any) associated with the
declaration itself.
immediately occurs.
14
-[ A declaration is local to a declarative region if the declaration
-occurs immediately within the declarative region.] [An entity is local
-to a declarative region if the entity is declared by a declaration that
-is local to the declarative region.]
+[ A declaration is <local> to a declarative region if the declaration
+occurs immediately within the declarative region.] [An entity is
+<local> to a declarative region if the entity is declared by a
+declaration that is local to the declarative region.]
14.a
Ramification: "Occurs immediately within" and "local to" are
@@ -39294,11 +39432,11 @@ is local to the declarative region.]
confusion.
15
-A declaration is global to a declarative region if the declaration
+A declaration is <global> to a declarative region if the declaration
occurs immediately within another declarative region that encloses the
-declarative region. An entity is global to a declarative region if the
-entity is declared by a declaration that is global to the declarative
-region.
+declarative region. An entity is <global> to a declarative region if
+the entity is declared by a declaration that is global to the
+declarative region.
NOTES
@@ -39313,8 +39451,8 @@ region.
2 As explained above and in *note 10.1.1::, "*note 10.1.1::
Compilation Units - Library Units", all library units are
descendants of Standard, and so are contained in the declarative
- region of Standard. They are not inside the declaration or body of
- Standard, but they are inside its declarative region.
+ region of Standard. They are <not> inside the declaration or body
+ of Standard, but they <are> inside its declarative region.
18
3 For a declarative region that comes in multiple parts, the text
@@ -39424,14 +39562,14 @@ region.
_Wording Changes from Ada 95_
18.q/2
- {AI95-00318-02AI95-00318-02} Extended_return_statement (see
+ {<AI95-00318-02AI95-00318-02>} Extended_return_statement (see
*note 6.5::) is added to the list of constructs that have a
declarative region.
_Extensions to Ada 2012_
18.r/4
- {AI12-0094-1AI12-0094-1} Corrigendum: access_definition is
+ {<AI12-0094-1AI12-0094-1>} Corrigendum: access_definition is
added to the list of constructs that have a declarative
region. This allows parameter names declared in anonymous
access type subprogram types to be the same as other names
@@ -39459,7 +39597,7 @@ File: aarm2012.info, Node: 8.2, Next: 8.3, Prev:
8.1, Up: 8
1
[For each declaration, the language rules define a certain portion of
-the program text called the scope of the declaration. The scope of a
+the program text called the <scope> of the declaration. The scope of a
declaration is also called the scope of any view or entity declared by
the declaration. Within the scope of an entity, and only there, there
are places where it is legal to refer to the declared entity. These
@@ -39468,7 +39606,7 @@ places are defined by the rules of visibility and
overloading.]
_Static Semantics_
2
-The immediate scope of a declaration is a portion of the declarative
+The <immediate scope> of a declaration is a portion of the declarative
region immediately enclosing the declaration. The immediate scope
starts at the beginning of the declaration, except in the case of an
overloadable declaration, in which case the immediate scope starts just
@@ -39493,7 +39631,7 @@ exceptions:
dependents.
3.a/3
- Reason: {AI05-0299-1AI05-0299-1} Clause 10 defines only a
+ Reason: {<AI05-0299-1AI05-0299-1>} Clause 10 defines only a
partial ordering of library_items. Therefore, it is a good
idea to restrict the immediate scope (and the scope, defined
below) to semantic dependents.
@@ -39513,7 +39651,7 @@ exceptions:
with P;
package R is
package X renames P;
- J : Integer := X.Q.I; -- Illegal!
+ J : Integer := X.Q.I; --< Illegal!>
end R;
3.f
@@ -39524,7 +39662,7 @@ exceptions:
declaration).
3.g/2
- Ramification: {AI95-00217-06AI95-00217-06} This rule applies
+ Ramification: {<AI95-00217-06AI95-00217-06>} This rule applies
to limited views as well as "normal" library items. In that
case, the semantic dependents are the units that have a
limited_with_clause for the limited view.
@@ -39532,7 +39670,7 @@ exceptions:
4
* The immediate scope of a declaration in the private part of a
library unit does not include the visible part of any public
- descendant of that library unit.
+ descendant of that library unit.
4.a
Ramification: In other words, a declaration in the private
@@ -39546,9 +39684,9 @@ exceptions:
giving private information to clients.
4.c/2
- Ramification: {AI95-00231-01AI95-00231-01} For a public child
- subprogram, this means that the parent's private part is not
- visible in the profile of the declaration and of the body.
+ Ramification: {<AI95-00231-01AI95-00231-01>} For a public
+ child subprogram, this means that the parent's private part is
+ not visible in the profile of the declaration and of the body.
This is true even for subprogram_bodies that are not
completions. For a public child generic unit, it means that
the parent's private part is not visible in the
@@ -39557,9 +39695,8 @@ exceptions:
(syntactic) profile (for a generic subprogram).
5
-[The visible part of (a view of) an entity is a portion of the text of
-its declaration containing declarations that are visible from outside.]
-The private part of (a view of) an entity that has a visible part
+[The <visible part> of (a view of) an entity is a portion of the text of
+its declaration containing declarations that are visible from outside.]The
<private part> of (a view of) an entity that has a visible part
contains all declarations within the declaration of (the view of) the
entity, except those in the visible part; [these are not visible from
outside. Visible and private parts are defined only for these kinds of
@@ -39622,15 +39759,15 @@ the scope of a library_item includes only its
semantic dependents.
declared.
10.1/3
-{AI95-00408-01AI95-00408-01} {AI05-0183-1AI05-0183-1} The scope of an
-attribute_definition_clause is identical to the scope of a declaration
-that would occur at the point of the attribute_definition_clause. The
-scope of an aspect_specification is identical to the scope of the
-associated declaration.
+{<AI95-00408-01AI95-00408-01>} {<AI05-0183-1AI05-0183-1>} The scope of
+an attribute_definition_clause is identical to the scope of a
+declaration that would occur at the point of the
+attribute_definition_clause. The scope of an aspect_specification is
+identical to the scope of the associated declaration.
11
The immediate scope of a declaration is also the immediate scope of the
-entity or view declared by the declaration. Similarly, the scope of a
+entity or view declared by the declaration. Similarly, the scope of a
declaration is also the scope of the entity or view declared by the
declaration.
@@ -39691,7 +39828,7 @@ declaration.
some children.
12/4
-{AI12-0003-1AI12-0003-1} The immediate scope of a pragma that is not
+{<AI12-0003-1AI12-0003-1>} The immediate scope of a pragma that is not
used as a configuration pragma is defined to be the region extending
from immediately after the pragma to the end of the declarative region
immediately enclosing the pragma.
@@ -39699,7 +39836,7 @@ immediately enclosing the pragma.
NOTES
13/3
- 4 {AI05-0299-1AI05-0299-1} There are notations for denoting
+ 4 {<AI05-0299-1AI05-0299-1>} There are notations for denoting
visible declarations that are not directly visible. For example,
parameter_specification (*note 6.1: S0175.)s are in the visible
part of a subprogram_declaration (*note 6.1: S0163.) so that they
@@ -39709,8 +39846,8 @@ immediately enclosing the pragma.
package, and can be made directly visible by a use_clause.
13.a/3
- Ramification: {AI95-00114-01AI95-00114-01}
- {AI05-0299-1AI05-0299-1} There are some obscure cases
+ Ramification: {<AI95-00114-01AI95-00114-01>}
+ {<AI05-0299-1AI05-0299-1>} There are some obscure cases
involving generics in which there is no such notation. See
Clause *note 12::.
@@ -39734,21 +39871,21 @@ immediately enclosing the pragma.
identifiers, character_literals, and operator_symbols.
13.d/3
- {AI05-0299-1AI05-0299-1} The notion of "visible part" has been
- extended in Ada 95. The syntax of task and protected units
- now allows private parts, thus requiring us to be able to talk
- about the visible part as well. It was necessary to extend
- the concept to subprograms and to generic units, in order for
- the visibility rules related to child library units to work
- properly. It was necessary to define the concept separately
- for generic formal packages, since their visible part is
- slightly different from that of a normal package. Extending
- the concept to composite types made the definition of scope
- slightly simpler. We define visible part for some things
- elsewhere, since it makes a big difference to the user for
- those things. For composite types and subprograms, however,
- the concept is used only in arcane visibility rules, so we
- localize it to this subclause.
+ {<AI05-0299-1AI05-0299-1>} The notion of "visible part" has
+ been extended in Ada 95. The syntax of task and protected
+ units now allows private parts, thus requiring us to be able
+ to talk about the visible part as well. It was necessary to
+ extend the concept to subprograms and to generic units, in
+ order for the visibility rules related to child library units
+ to work properly. It was necessary to define the concept
+ separately for generic formal packages, since their visible
+ part is slightly different from that of a normal package.
+ Extending the concept to composite types made the definition
+ of scope slightly simpler. We define visible part for some
+ things elsewhere, since it makes a big difference to the user
+ for those things. For composite types and subprograms,
+ however, the concept is used only in arcane visibility rules,
+ so we localize it to this subclause.
13.e
In Ada 83, the semantics of with_clauses was described in
@@ -39767,7 +39904,7 @@ immediately enclosing the pragma.
13.h
package R is
package X renames Standard;
- X.Q.I := 17; -- Illegal!
+ X.Q.I := 17; --< Illegal!>
end R;
13.i
@@ -39777,23 +39914,23 @@ immediately enclosing the pragma.
_Wording Changes from Ada 95_
13.j/2
- {AI95-00408-01AI95-00408-01} The scope of an
+ {<AI95-00408-01AI95-00408-01>} The scope of an
attribute_definition_clause is defined so that it can be used
- to define the visibility of such a clause, so that can be used
- by the stream attribute availability rules (see *note
+ to define the visibility of such a clause, so <that> can be
+ used by the stream attribute availability rules (see *note
13.13.2::).
_Wording Changes from Ada 2005_
13.k/3
- {AI05-0183-1AI05-0183-1} The scope of an aspect_specification
- is defined for similar reasons that it was defined for
- attribute_definition_clauses.
+ {<AI05-0183-1AI05-0183-1>} The scope of an
+ aspect_specification is defined for similar reasons that it
+ was defined for attribute_definition_clauses.
_Wording Changes from Ada 2012_
13.l/4
- {AI12-0003-1AI12-0003-1} The immediate scope of a pragma is
+ {<AI12-0003-1AI12-0003-1>} The immediate scope of a pragma is
defined as it is used in other rules in the Standard.
@@ -39803,19 +39940,19 @@ File: aarm2012.info, Node: 8.3, Next: 8.4, Prev:
8.2, Up: 8
==============
1
-[ The visibility rules, given below, determine which declarations are
+[ The <visibility rules>, given below, determine which declarations are
visible and directly visible at each place within a program. The
visibility rules apply to both explicit and implicit declarations.]
_Static Semantics_
2
-A declaration is defined to be directly visible at places where a name
+A declaration is defined to be <directly visible> at places where a name
consisting of only an identifier or operator_symbol is sufficient to
denote the declaration; that is, no selected_component notation or
special context (such as preceding => in a named association) is
-necessary to denote the declaration. A declaration is defined to be
-visible wherever it is directly visible, as well as at other places
+necessary to denote the declaration. A declaration is defined to be
+<visible> wherever it is directly visible, as well as at other places
where some name (such as a selected_component) can denote the
declaration.
@@ -39826,21 +39963,22 @@ used to indicate contexts where visibility, but not
direct visibility,
is required.
4
-There are two kinds of direct visibility: immediate visibility and
-use-visibility. A declaration is immediately visible at a place if it is
-directly visible because the place is within its immediate scope. A
+There are two kinds of direct visibility: <immediate visibility> and
+<use-visibility>. A declaration is immediately visible at a place if it
+is directly visible because the place is within its immediate scope. A
declaration is use-visible if it is directly visible because of a
use_clause (see *note 8.4::). Both conditions can apply.
5
-A declaration can be hidden, either from direct visibility, or from all
-visibility, within certain parts of its scope. Where hidden from all
-visibility, it is not visible at all (neither using a direct_name nor a
-selector_name). Where hidden from direct visibility, only direct
-visibility is lost; visibility using a selector_name is still possible.
+A declaration can be <hidden>, either from direct visibility, or from
+all visibility, within certain parts of its scope. Where <hidden from
+all visibility>, it is not visible at all (neither using a direct_name
+nor a selector_name). Where <hidden from direct visibility>, only
+direct visibility is lost; visibility using a selector_name is still
+possible.
6
-[ Two or more declarations are overloaded if they all have the same
+[ Two or more declarations are <overloaded> if they all have the same
defining name and there is a place where they are all directly visible.]
6.a
@@ -39853,7 +39991,7 @@ defining name and there is a place where they are all
directly visible.]
7
The declarations of callable entities [(including enumeration literals)]
-are overloadable[, meaning that overloading is allowed for them].
+are <overloadable>[, meaning that overloading is allowed for them].
7.a
Ramification: A generic_declaration is not overloadable within
@@ -39866,8 +40004,8 @@ are overloadable[, meaning that overloading is allowed
for them].
the formal parameter hides the generic from direct visibility.
8
-Two declarations are homographs if they have the same defining name,
-and, if both are overloadable, their profiles are type conformant. [An
+Two declarations are <homographs> if they have the same defining name,
+and, if both are overloadable, their profiles are type conformant. [An
inner declaration hides any outer homograph from direct visibility.]
8.a/2
@@ -39876,22 +40014,22 @@ inner declaration hides any outer homograph from
direct visibility.]
explicitly as overriding or not overriding.
9/1
-{8652/00258652/0025} {AI95-00044-01AI95-00044-01} [Two homographs are
-not generally allowed immediately within the same declarative region
-unless one overrides the other (see Legality Rules below).] The only
-declarations that are overridable are the implicit declarations for
+{<8652/00258652/0025>} {<AI95-00044-01AI95-00044-01>} [Two homographs
+are not generally allowed immediately within the same declarative region
+unless one <overrides> the other (see Legality Rules below).] The only
+declarations that are <overridable> are the implicit declarations for
predefined operators and inherited primitive subprograms. A declaration
overrides another homograph that occurs immediately within the same
declarative region in the following cases:
10/1
- * {8652/00258652/0025} {AI95-00044-01AI95-00044-01} A declaration
+ * {<8652/00258652/0025>} {<AI95-00044-01AI95-00044-01>} A declaration
that is not overridable overrides one that is overridable,
[regardless of which declaration occurs first];
10.a/1
- Ramification: {8652/00258652/0025}
- {AI95-00044-01AI95-00044-01} And regardless of whether the
+ Ramification: {<8652/00258652/0025>}
+ {<AI95-00044-01AI95-00044-01>} And regardless of whether the
nonoverridable declaration is overloadable or not. For
example, statement_identifiers are covered by this rule.
@@ -39926,7 +40064,7 @@ declarative region in the following cases:
says the inherited one wins.
11.b/2
- {AI95-00114-01AI95-00114-01} The "regardless of which
+ {<AI95-00114-01AI95-00114-01>} The "regardless of which
declaration occurs first" applies here as well, in the case
where derived_type_definition in the visible part of a public
library unit derives from a private type declared in the
@@ -39941,11 +40079,11 @@ declarative region in the following cases:
previous implicit declaration of an inherited subprogram.
12.1/2
- * {AI95-00251-01AI95-00251-01} If two or more homographs are
+ * {<AI95-00251-01AI95-00251-01>} If two or more homographs are
implicitly declared at the same place:
12.2/2
- * {AI95-00251-01AI95-00251-01} If at least one is a
+ * {<AI95-00251-01AI95-00251-01>} If at least one is a
subprogram that is neither a null procedure nor an
abstract subprogram, and does not require overriding (see
*note 3.9.3::), then they override those that are null
@@ -39954,14 +40092,14 @@ declarative region in the following cases:
overridden, then they are all hidden from all visibility.
12.3/2
- * {AI95-00251-01AI95-00251-01} Otherwise (all are null
+ * {<AI95-00251-01AI95-00251-01>} Otherwise (all are null
procedures, abstract subprograms, or require overriding),
then any null procedure overrides all abstract
subprograms and all subprograms that require overriding;
if more than one such homograph remains that is not thus
overridden, then if they are all fully conformant with
one another, one is chosen arbitrarily; if not, they are
- all hidden from all visibility.
+ all hidden from all visibility.
12.a/2
Discussion: In the case where the implementation arbitrarily
@@ -40041,7 +40179,7 @@ declarative region in the following cases:
explained there.
13.b/3
- To be honest: {AI05-0042-1AI05-0042-1} The implicit
+ To be honest: {<AI05-0042-1AI05-0042-1>} The implicit
subprograms declared when an operation of a progenitor is
implemented by an entry or subprogram also override the
appropriate implicitly declared inherited operations of the
@@ -40074,12 +40212,12 @@ visibility, as follows:
record;
18/3
- * {AI95-00345-01AI95-00345-01} {AI05-0177-1AI05-0177-1} For
- a package_declaration, generic_package_declaration (*note
- 12.1: S0273.), subprogram_body (*note 6.3: S0177.), or
- expression_function_declaration (*note 6.8: S0189.), the
- declaration is hidden from all visibility only until the
- reserved word is of the declaration;
+ * {<AI95-00345-01AI95-00345-01>} {<AI05-0177-1AI05-0177-1>}
+ For a package_declaration, generic_package_declaration
+ (*note 12.1: S0273.), subprogram_body (*note 6.3:
+ S0177.), or expression_function_declaration (*note 6.8:
+ S0189.), the declaration is hidden from all visibility
+ only until the reserved word is of the declaration;
18.a
Ramification: We're talking about the is of the construct
@@ -40087,7 +40225,7 @@ visibility, as follows:
generic_formal_part.
18.1/2
- * {AI95-00345-01AI95-00345-01} For a task declaration or
+ * {<AI95-00345-01AI95-00345-01>} For a task declaration or
protected declaration, the declaration is hidden from all
visibility only until the reserved word with of the
declaration if there is one, or the reserved word is of
@@ -40126,7 +40264,7 @@ visibility, as follows:
denote it.
20/2
- * {AI95-00217-06AI95-00217-06} {AI95-00412-01AI95-00412-01} The
+ * {<AI95-00217-06AI95-00217-06>} {<AI95-00412-01AI95-00412-01>} The
declaration of a library unit (including a
library_unit_renaming_declaration) is hidden from all visibility at
places outside its declarative region that are not within the scope
@@ -40141,17 +40279,17 @@ visibility, as follows:
provided by a package renaming.
20.a/2
- Discussion: {AI95-00217-06AI95-00217-06} This is the rule that
- prevents with_clauses from being transitive; the [immediate]
- scope includes indirect semantic dependents. This rule also
- prevents the limited view of a package from being visible in
- the same place as the full view of the package, which prevents
- various ripple effects.
+ Discussion: {<AI95-00217-06AI95-00217-06>} This is the rule
+ that prevents with_clauses from being transitive; the
+ [immediate] scope includes indirect semantic dependents. This
+ rule also prevents the limited view of a package from being
+ visible in the same place as the full view of the package,
+ which prevents various ripple effects.
20.1/2
- * {AI95-00217-06AI95-00217-06} {AI95-00412-01AI95-00412-01} [For each
- declaration or renaming of a generic unit as a child of some parent
- generic package, there is a corresponding declaration nested
+ * {<AI95-00217-06AI95-00217-06>} {<AI95-00412-01AI95-00412-01>} [For
+ each declaration or renaming of a generic unit as a child of some
+ parent generic package, there is a corresponding declaration nested
immediately within each instance of the parent.] Such a nested
declaration is hidden from all visibility except at places that are
within the scope of a with_clause that mentions the child.
@@ -40171,15 +40309,15 @@ scope except where hidden from direct visibility, as
follows:
from all visibility.
23.1/3
-{AI95-00195-01AI95-00195-01} {AI95-00408-01AI95-00408-01}
-{AI05-0183-1AI05-0183-1} An attribute_definition_clause or an
-aspect_specification is visible everywhere within its scope.
+{<AI95-00195-01AI95-00195-01>} {<AI95-00408-01AI95-00408-01>}
+{<AI05-0183-1AI05-0183-1>} An attribute_definition_clause or an
+aspect_specification is <visible> everywhere within its scope.
_Name Resolution Rules_
24
A direct_name shall resolve to denote a directly visible declaration
-whose defining name is the same as the direct_name. A selector_name
+whose defining name is the same as the direct_name. A selector_name
shall resolve to denote a visible declaration whose defining name is the
same as the selector_name.
@@ -40205,23 +40343,24 @@ place of a compilation_unit. For those contexts, see
the rules in *note
_Legality Rules_
26/2
-{8652/00258652/0025} {8652/00268652/0026} {AI95-00044-01AI95-00044-01}
-{AI95-00150-01AI95-00150-01} {AI95-00377-01AI95-00377-01} A
-nonoverridable declaration is illegal if there is a homograph occurring
-immediately within the same declarative region that is visible at the
-place of the declaration, and is not hidden from all visibility by the
-nonoverridable declaration. In addition, a type extension is illegal if
-somewhere within its immediate scope it has two visible components with
-the same name. Similarly, the context_clause for a compilation unit is
-illegal if it mentions (in a with_clause) some library unit, and there
-is a homograph of the library unit that is visible at the place of the
-compilation unit, and the homograph and the mentioned library unit are
-both declared immediately within the same declarative region. These
-rules also apply to dispatching operations declared in the visible part
-of an instance of a generic unit. However, they do not apply to other
-overloadable declarations in an instance[; such declarations may have
-type conformant profiles in the instance, so long as the corresponding
-declarations in the generic were not type conformant].
+{<8652/00258652/0025>} {<8652/00268652/0026>}
+{<AI95-00044-01AI95-00044-01>} {<AI95-00150-01AI95-00150-01>}
+{<AI95-00377-01AI95-00377-01>} A nonoverridable declaration is illegal
+if there is a homograph occurring immediately within the same
+declarative region that is visible at the place of the declaration, and
+is not hidden from all visibility by the nonoverridable declaration. In
+addition, a type extension is illegal if somewhere within its immediate
+scope it has two visible components with the same name. Similarly, the
+context_clause for a compilation unit is illegal if it mentions (in a
+with_clause) some library unit, and there is a homograph of the library
+unit that is visible at the place of the compilation unit, and the
+homograph and the mentioned library unit are both declared immediately
+within the same declarative region. These rules also apply to
+dispatching operations declared in the visible part of an instance of a
+generic unit. However, they do not apply to other overloadable
+declarations in an instance[; such declarations may have type conformant
+profiles in the instance, so long as the corresponding declarations in
+the generic were not type conformant].
26.a
Discussion: Normally, these rules just mean you can't
@@ -40250,14 +40389,14 @@ declarations in the generic were not type conformant].
26.f
package body P is
- Q : Integer; -- OK; we cannot see package P.Q here.
+ Q : Integer; --< OK; we cannot see package P.Q here.>
procedure Sub is separate;
end P;
26.g
with P.Q;
separate(P)
- procedure Sub is -- Illegal.
+ procedure Sub is --< Illegal.>
begin
null;
end Sub;
@@ -40277,47 +40416,48 @@ declarations in the generic were not type conformant].
compilers have never before been required to do.
26.i.1/1
- * {8652/00268652/0026} {8652/01028652/0102}
- {AI95-00150-01AI95-00150-01} {AI95-00157-01AI95-00157-01}
- If a type extension contains a component with the same
- name as a component in an ancestor type, there must be no
- place where both components are visible. For instance:
+ * {<8652/00268652/0026>} {<8652/01028652/0102>}
+ {<AI95-00150-01AI95-00150-01>}
+ {<AI95-00157-01AI95-00157-01>} If a type extension
+ contains a component with the same name as a component in
+ an ancestor type, there must be no place where both
+ components are visible. For instance:
26.i.2/1
package A is
type T is tagged private;
package B is
type NT is new T with record
- I: Integer; -- Illegal because T.I is visible in the
body.
- end record; -- T.I is not visible here.
+ I: Integer; -- <Illegal because T.I is visible in the
body.>
+ end record; -- <T.I is not visible here.>
end B;
private
type T is tagged record
- I: Integer; -- Illegal because T.I is visible in the body.
+ I: Integer; -- <Illegal because T.I is visible in the
body.>
end record;
end A;
26.i.3/2
- {AI95-00114-01AI95-00114-01} package body A is
+ {<AI95-00114-01AI95-00114-01>} package body A is
package body B is
- -- T.I becomes visible here.
+ -- <T.I becomes visible here.>
end B;
end A;
26.i.4/1
package A.C is
type NT2 is new A.T with record
- I: Integer; -- Illegal because T.I is visible in the
private part.
- end record; -- T.I is not visible here.
+ I: Integer; -- <Illegal because T.I is visible in the
private part.>
+ end record; -- <T.I is not visible here.>
private
- -- T.I is visible here.
+ -- <T.I is visible here.>
end A.C;
26.i.5/1
with A;
package D is
type NT3 is new A.T with record
- I: Integer; -- Legal because T.I is never visible in this
package.
+ I: Integer; -- <Legal because T.I is never visible in
this package.>
end record;
end D;
@@ -40326,15 +40466,15 @@ declarations in the generic were not type conformant].
package A.E is
type NT4 is new D.NT3 with null record;
X : NT4;
- I1 : Integer := X.I; -- D.NT3.I
- I2 : Integer := D.NT3(X).I; -- D.NT3.I
- I3 : Integer := A.T(X).I; -- A.T.I
+ I1 : Integer := X.I; -- <D.NT3.I>
+ I2 : Integer := D.NT3(X).I; -- <D.NT3.I>
+ I3 : Integer := A.T(X).I; -- <A.T.I>
end A.E;
26.i.7/1
- {8652/01028652/0102} {AI95-00157-01AI95-00157-01} D.NT3
- can have a component I because the component I of the
- parent type is never visible. The parent component
+ {<8652/01028652/0102>} {<AI95-00157-01AI95-00157-01>}
+ D.NT3 can have a component I because the component I of
+ the parent type is never visible. The parent component
exists, of course, but is never declared for the type
D.NT3. In the child package A.E, the component I of A.T
is visible, but that does not change the fact that the
@@ -40353,7 +40493,7 @@ declarations in the generic were not type conformant].
7.3.1:: for more on the rules.
26.i.8/2
- * {AI95-00377-01AI95-00377-01} It is illegal to mention
+ * {<AI95-00377-01AI95-00377-01>} It is illegal to mention
both an explicit child of an instance, and a child of the
generic from which the instance was instantiated. This
is easier to understand with an example:
@@ -40377,7 +40517,7 @@ declarations in the generic were not type conformant].
26.i.13/2
with G1.G2;
- with I1.G2; -- Illegal
+ with I1.G2; -- <Illegal>
package Bad is ...
26.i.14/2
@@ -40448,18 +40588,18 @@ declarations in the generic were not type conformant].
4. A pragma identifier.
29.f
- 5. A pragma_argument_identifier.
+ 5. A <pragma_argument_>identifier.
29.g
6. An identifier specific to a pragma used in a pragma
argument.
29.g.1/3
- 7. {AI05-0183-1AI05-0183-1} An aspect_mark;
+ 7. {<AI05-0183-1AI05-0183-1>} An aspect_mark;
29.g.2/3
- 8. {AI05-0183-1AI05-0183-1} An identifier specific to an
- aspect used in an aspect_definition.
+ 8. {<AI05-0183-1AI05-0183-1>} An identifier specific to
+ an aspect used in an aspect_definition.
29.h
The visibility rules have nothing to do with the above cases;
@@ -40500,8 +40640,8 @@ declarations in the generic were not type conformant].
X : constant Integer := 17;
package P is
generic
- Z : Integer := X; -- Illegal!
- procedure X(Y : in Integer := X); -- Illegal!
+ Z : Integer := X; --< Illegal!>
+ procedure X(Y : in Integer := X); --< Illegal!>
end P;
29.o
@@ -40530,7 +40670,7 @@ declarations in the generic were not type conformant].
_Incompatibilities With Ada 95_
29.s/2
- {AI95-00251-01AI95-00251-01} Added rules to handle the
+ {<AI95-00251-01AI95-00251-01>} Added rules to handle the
inheritance and overriding of multiple homographs for a single
type declaration, in order to support multiple inheritance
from interfaces. The new rules are intended to be compatible
@@ -40549,16 +40689,16 @@ declarations in the generic were not type conformant].
end G;]
29.u/2
- package I is new G (Integer, Integer); -- Exports homographs of
P.
+ package I is new G (Integer, Integer); -- <Exports homographs
of P.>
29.v/2
- type D is new I.T; -- Both Ps are inherited.
+ type D is new I.T; -- <Both Ps are inherited.>
29.w/2
Obj : D;
29.x/2
- P (Obj, Z => 10); -- Legal in Ada 95, illegal in Ada 2005.
+ P (Obj, Z => 10); -- <Legal in Ada 95, illegal in Ada 2005.>
29.y/2
The call to P would resolve in Ada 95 by using the parameter
@@ -40568,7 +40708,7 @@ declarations in the generic were not type conformant].
already are.
29.z/2
- {AI95-00377-01AI95-00377-01} Amendment Correction: A
+ {<AI95-00377-01AI95-00377-01>} Amendment Correction: A
with_clause is illegal if it would create a homograph of an
implicitly declared generic child (see *note 10.1.1::). An
Ada 95 compiler could have allowed this, but which unit of the
@@ -40579,36 +40719,37 @@ declarations in the generic were not type conformant].
_Wording Changes from Ada 95_
29.aa/2
- {8652/00258652/0025} {AI95-00044-01AI95-00044-01} Corrigendum:
- Clarified the overriding rules so that "/=" and
+ {<8652/00258652/0025>} {<AI95-00044-01AI95-00044-01>}
+ Corrigendum: Clarified the overriding rules so that "/=" and
statement_identifiers are covered.
29.bb/2
- {8652/00268652/0026} {AI95-00150-01AI95-00150-01} Corrigendum:
- Clarified that is it never possible for two components with
- the same name to be visible; any such program is illegal.
+ {<8652/00268652/0026>} {<AI95-00150-01AI95-00150-01>}
+ Corrigendum: Clarified that is it never possible for two
+ components with the same name to be visible; any such program
+ is illegal.
29.cc/2
- {AI95-00195-01AI95-00195-01} {AI95-00408-01AI95-00408-01} The
- visibility of an attribute_definition_clause is defined so
+ {<AI95-00195-01AI95-00195-01>} {<AI95-00408-01AI95-00408-01>}
+ The visibility of an attribute_definition_clause is defined so
that it can be used by the stream attribute availability rules
(see *note 13.13.2::).
29.dd/2
- {AI95-00217-06AI95-00217-06} The visibility of a limited view
- of a library package is defined (see *note 10.1.1::).
+ {<AI95-00217-06AI95-00217-06>} The visibility of a limited
+ view of a library package is defined (see *note 10.1.1::).
_Wording Changes from Ada 2005_
29.ee/4
- {AI05-0177-1AI05-0177-1} {AI12-0157-1AI12-0157-1} Added
+ {<AI05-0177-1AI05-0177-1>} {<AI12-0157-1AI12-0157-1>} Added
wording so that the parameters of an
expression_function_declaration (*note 6.8: S0189.) are
visible in the return expression of the function. (It would
be pretty useless without such a rule.)
29.ff/3
- {AI05-0183-1AI05-0183-1} The visibility of an
+ {<AI05-0183-1AI05-0183-1>} The visibility of an
aspect_specification is defined so that it can be used in
various other rules.
@@ -40623,21 +40764,21 @@ File: aarm2012.info, Node: 8.3.1, Up: 8.3
---------------------------
1/2
-{AI95-00218-03AI95-00218-03} An overriding_indicator is used to declare
-that an operation is intended to override (or not override) an inherited
-operation.
+{<AI95-00218-03AI95-00218-03>} An overriding_indicator is used to
+declare that an operation is intended to override (or not override) an
+inherited operation.
_Syntax_
2/2
- {AI95-00218-03AI95-00218-03} overriding_indicator ::=
+ {<AI95-00218-03AI95-00218-03>} overriding_indicator ::=
[not] overriding
_Legality Rules_
3/3
-{AI95-00218-03AI95-00218-03} {AI95-00348-01AI95-00348-01}
-{AI95-00397-01AI95-00397-01} {AI05-0177-1AI05-0177-1} If an
+{<AI95-00218-03AI95-00218-03>} {<AI95-00348-01AI95-00348-01>}
+{<AI95-00397-01AI95-00397-01>} {<AI05-0177-1AI05-0177-1>} If an
abstract_subprogram_declaration (*note 3.9.3: S0076.),
null_procedure_declaration (*note 6.7: S0188.),
expression_function_declaration (*note 6.8: S0189.), subprogram_body,
@@ -40655,7 +40796,7 @@ subprogram has an overriding_indicator (*note 8.3.1:
S0195.), then:
override a homograph at the place of the declaration or body;
5.a/3
- To be honest: {AI05-0005-1AI05-0005-1} This doesn't require
+ To be honest: {<AI05-0005-1AI05-0005-1>} This doesn't require
that the overriding happen at precisely the place of the
declaration or body; it only requires that the region in which
the overriding is known to have happened includes this place.
@@ -40691,17 +40832,17 @@ rules also apply in the private part of an instance
of a generic unit.
NOTES
8/2
- 8 {AI95-00397-01AI95-00397-01} Rules for overriding_indicators of
- task and protected entries and of protected subprograms are found
- in *note 9.5.2:: and *note 9.4::, respectively.
+ 8 {<AI95-00397-01AI95-00397-01>} Rules for overriding_indicators
+ of task and protected entries and of protected subprograms are
+ found in *note 9.5.2:: and *note 9.4::, respectively.
_Examples_
9/2
-{AI95-00433-01AI95-00433-01} The use of overriding_indicators allows the
-detection of errors at compile-time that otherwise might not be detected
-at all. For instance, we might declare a security queue derived from
-the Queue interface of 3.9.4 as:
+{<AI95-00433-01AI95-00433-01>} The use of overriding_indicators allows
+the detection of errors at compile-time that otherwise might not be
+detected at all. For instance, we might declare a security queue
+derived from the Queue interface of 3.9.4 as:
10/2
type Security_Queue is new Queue with record ...;
@@ -40745,7 +40886,7 @@ this is a new operation.
_Extensions to Ada 95_
16.b/2
- {AI95-00218-03AI95-00218-03} Overriding_indicators are new.
+ {<AI95-00218-03AI95-00218-03>} Overriding_indicators are new.
These let the programmer state her overriding intentions to
the compiler; if the compiler disagrees, an error will be
produced rather than a hard to find bug.
@@ -40753,7 +40894,7 @@ this is a new operation.
_Wording Changes from Ada 2005_
16.c/3
- {AI95-0177-1AI95-0177-1} Expression functions can have
+ {<AI95-0177-1AI95-0177-1>} Expression functions can have
overriding indicators.
@@ -40779,8 +40920,8 @@ direct visibility of the primitive operators of a type.]
1.b
The rules for use_clauses were carefully constructed to avoid
- so-called Beaujolais effects, where the addition or removal of
- a single use_clause, or a single declaration in a "use"d
+ so-called <Beaujolais> effects, where the addition or removal
+ of a single use_clause, or a single declaration in a "use"d
package, would change the meaning of a program from one legal
interpretation to another.
@@ -40790,16 +40931,16 @@ direct visibility of the primitive operators of a
type.]
use_clause ::= use_package_clause | use_type_clause
3
- use_package_clause ::= use package_name {, package_name};
+ use_package_clause ::= use <package_>name {, <package_>name};
4/3
- {AI05-0150-1AI05-0150-1} use_type_clause ::= use [all] type
+ {<AI05-0150-1AI05-0150-1>} use_type_clause ::= use [all] type
subtype_mark {, subtype_mark};
_Legality Rules_
5/2
-{AI95-00217-06AI95-00217-06} A package_name of a use_package_clause
+{<AI95-00217-06AI95-00217-06>} A <package_>name of a use_package_clause
shall denote a nonlimited view of a package.
5.a
@@ -40808,13 +40949,13 @@ shall denote a nonlimited view of a package.
_Static Semantics_
6
-For each use_clause, there is a certain region of text called the scope
-of the use_clause. For a use_clause within a context_clause of a
-library_unit_declaration or library_unit_renaming_declaration, the scope
-is the entire declarative region of the declaration. For a use_clause
-within a context_clause of a body, the scope is the entire body [and any
-subunits (including multiply nested subunits). The scope does not
-include context_clauses themselves.]
+For each use_clause, there is a certain region of text called the
+<scope> of the use_clause. For a use_clause within a context_clause of
+a library_unit_declaration or library_unit_renaming_declaration, the
+scope is the entire declarative region of the declaration. For a
+use_clause within a context_clause of a body, the scope is the entire
+body [and any subunits (including multiply nested subunits). The scope
+does not include context_clauses themselves.]
7
For a use_clause immediately within a declarative region, the scope is
@@ -40843,7 +40984,7 @@ the visible part of any public descendant of that
library unit.
7.d
package Parent.Child is
- Y : T; -- Illegal!
+ Y : T; --< Illegal!>
Z : P.T;
private
W : T;
@@ -40855,38 +40996,39 @@ the visible part of any public descendant of that
library unit.
there. The declarations of X, Z, and W are legal.
7.1/2
-{AI95-00217-06AI95-00217-06} A package is named in a use_package_clause
-if it is denoted by a package_name of that clause. A type is named in a
-use_type_clause if it is determined by a subtype_mark of that clause.
+{<AI95-00217-06AI95-00217-06>} A package is <named> in a
+use_package_clause if it is denoted by a <package_>name of that clause.
+A type is <named> in a use_type_clause if it is determined by a
+subtype_mark of that clause.
8/3
-{AI95-00217-06AI95-00217-06} {AI05-0150-1AI05-0150-1} For each package
-named in a use_package_clause whose scope encloses a place, each
+{<AI95-00217-06AI95-00217-06>} {<AI05-0150-1AI05-0150-1>} For each
+package named in a use_package_clause whose scope encloses a place, each
declaration that occurs immediately within the declarative region of the
-package is potentially use-visible at this place if the declaration is
-visible at this place. For each type T or T'Class named in a
+package is <potentially use-visible> at this place if the declaration is
+visible at this place. For each type <T> or <T>'Class named in a
use_type_clause whose scope encloses a place, the declaration of each
-primitive operator of type T is potentially use-visible at this place if
-its declaration is visible at this place. If a use_type_clause whose
+primitive operator of type <T> is potentially use-visible at this place
+if its declaration is visible at this place. If a use_type_clause whose
scope encloses a place includes the reserved word all, then the
following entities are also potentially use-visible at this place if the
declaration of the entity is visible at this place:
8.1/3
- * {AI05-0150-1AI05-0150-1} Each primitive subprogram of T including
- each enumeration literal (if any);
+ * {<AI05-0150-1AI05-0150-1>} Each primitive subprogram of <T>
+ including each enumeration literal (if any);
8.2/3
- * {AI05-0150-1AI05-0150-1} Each subprogram that is declared
+ * {<AI05-0150-1AI05-0150-1>} Each subprogram that is declared
immediately within the declarative region in which an ancestor type
- of T is declared and that operates on a class-wide type that covers
- T.
+ of <T> is declared and that operates on a class-wide type that
+ covers <T>.
8.a/3
- Ramification: {AI05-0150-1AI05-0150-1} Primitive subprograms
- whose defining name is an identifier are not made potentially
- visible by a use_type_clause unless reserved word all is
- included. A use_type_clause without all is only for
+ Ramification: {<AI05-0150-1AI05-0150-1>} Primitive subprograms
+ whose defining name is an identifier are <not> made
+ potentially visible by a use_type_clause unless reserved word
+ all is included. A use_type_clause without all is only for
operators.
8.b
@@ -40911,13 +41053,13 @@ declaration of the entity is visible at this place:
which helps avoid breaking the generic contract model.
8.3/3
-{AI05-0131-1AI05-0131-1} Certain implicit declarations may become
+{<AI05-0131-1AI05-0131-1>} Certain implicit declarations may become
potentially use-visible in certain contexts as described in *note
12.6::.
9
-A declaration is use-visible if it is potentially use-visible, except in
-these naming-conflict cases:
+A declaration is <use-visible> if it is potentially use-visible, except
+in these naming-conflict cases:
10
* A potentially use-visible declaration is not use-visible if the
@@ -40947,16 +41089,16 @@ The elaboration of a use_clause has no effect.
_Examples_
13
-Example of a use clause in a context clause:
+<Example of a use clause in a context clause:>
14
with Ada.Calendar; use Ada;
15
-Example of a use type clause:
+<Example of a use type clause:>
16
- use type Rational_Numbers.Rational; -- see *note 7.1::
+ use type Rational_Numbers.Rational; --< see *note 7.1::>
Two_Thirds: Rational_Numbers.Rational := 2/3;
16.a
@@ -41011,21 +41153,21 @@ Example of a use type clause:
_Wording Changes from Ada 95_
16.g/2
- {AI95-00217-06AI95-00217-06} Limited views of packages are not
- allowed in use clauses. Defined named in a use clause for use
- in other limited view rules (see *note 10.1.2::).
+ {<AI95-00217-06AI95-00217-06>} Limited views of packages are
+ not allowed in use clauses. Defined <named in a use clause>
+ for use in other limited view rules (see *note 10.1.2::).
_Extensions to Ada 2005_
16.h/3
- {AI05-0150-1AI05-0150-1} The use all type version of the
+ {<AI05-0150-1AI05-0150-1>} The use all type version of the
use_type_clause is new to Ada 2012. It works similarly to
prefixed views.
_Wording Changes from Ada 2005_
16.i/3
- {AI05-0131-1AI05-0131-1} Correction: Added wording to allow
+ {<AI05-0131-1AI05-0131-1>} Correction: Added wording to allow
other declarations to be potentially use-visible, to support
corrections to formal subprograms.
@@ -41061,9 +41203,9 @@ of a previous subprogram_declaration.]
3
The elaboration of a renaming_declaration evaluates the name that
follows the reserved word renames and thereby determines the view and
-entity denoted by this name (the renamed view and renamed entity). [A
-name that denotes the renaming_declaration denotes (a new view of) the
-renamed entity.]
+entity denoted by this name (the <renamed view> and <renamed entity>).
+[A name that denotes the renaming_declaration denotes (a new view of)
+the renamed entity.]
NOTES
@@ -41126,38 +41268,38 @@ File: aarm2012.info, Node: 8.5.1, Next: 8.5.2, Up:
8.5
_Syntax_
2/3
- {AI95-00230-01AI95-00230-01} {AI95-00423-01AI95-00423-01}
- {AI05-0183-1AI05-0183-1} object_renaming_declaration ::=
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00423-01AI95-00423-01>}
+ {<AI05-0183-1AI05-0183-1>} object_renaming_declaration ::=
defining_identifier : [null_exclusion]
- subtype_mark renames object_name
+ subtype_mark renames <object_>name
[aspect_specification];
- | defining_identifier : access_definition renames object_name
+ | defining_identifier : access_definition renames <object_>name
[aspect_specification];
_Name Resolution Rules_
3/2
-{AI95-00230-01AI95-00230-01} {AI95-00254-01AI95-00254-01}
-{AI95-00409-01AI95-00409-01} The type of the object_name shall resolve
-to the type determined by the subtype_mark, or in the case where the
-type is defined by an access_definition, to an anonymous access type.
-If the anonymous access type is an access-to-object type, the type of
-the object_name shall have the same designated type as that of the
-access_definition. If the anonymous access type is an
-access-to-subprogram type, the type of the object_name shall have a
+{<AI95-00230-01AI95-00230-01>} {<AI95-00254-01AI95-00254-01>}
+{<AI95-00409-01AI95-00409-01>} The type of the <object_>name shall
+resolve to the type determined by the subtype_mark, or in the case where
+the type is defined by an access_definition, to an anonymous access
+type. If the anonymous access type is an access-to-object type, the
+type of the <object_>name shall have the same designated type as that of
+the access_definition. If the anonymous access type is an
+access-to-subprogram type, the type of the <object_>name shall have a
designated profile that is type conformant with that of the
access_definition.
3.a
Reason: A previous version of Ada 9X used the usual "expected
type" wording:
- "The expected type for the object_name is that determined by
+ "The expected type for the <object_>name is that determined by
the subtype_mark."
We changed it so that this would be illegal:
3.b
X: T;
- Y: T'Class renames X; -- Illegal!
+ Y: T'Class renames X; --< Illegal!>
3.c
When the above was legal, it was unclear whether Y was of type
@@ -41183,33 +41325,33 @@ access_definition.
The renamed entity shall be an object.
4.1/2
-{AI95-00231-01AI95-00231-01} {AI95-00409-01AI95-00409-01} In the case
-where the type is defined by an access_definition, the type of the
+{<AI95-00231-01AI95-00231-01>} {<AI95-00409-01AI95-00409-01>} In the
+case where the type is defined by an access_definition, the type of the
renamed object and the type defined by the access_definition:
4.2/2
- * {AI95-00231-01AI95-00231-01} {AI95-00409-01AI95-00409-01} shall
+ * {<AI95-00231-01AI95-00231-01>} {<AI95-00409-01AI95-00409-01>} shall
both be access-to-object types with statically matching designated
subtypes and with both or neither being access-to-constant types;
or
4.3/2
- * {AI95-00409-01AI95-00409-01} shall both be access-to-subprogram
- types with subtype conformant designated profiles.
+ * {<AI95-00409-01AI95-00409-01>} shall both be access-to-subprogram
+ types with subtype conformant designated profiles.
4.4/2
-{AI95-00423-01AI95-00423-01} For an object_renaming_declaration with a
+{<AI95-00423-01AI95-00423-01>} For an object_renaming_declaration with a
null_exclusion or an access_definition that has a null_exclusion:
4.5/2
- * if the object_name denotes a generic formal object of a generic
- unit G, and the object_renaming_declaration occurs within the body
- of G or within the body of a generic unit declared within the
- declarative region of G, then the declaration of the formal object
- of G shall have a null_exclusion;
+ * if the <object_>name denotes a generic formal object of a generic
+ unit <G>, and the object_renaming_declaration occurs within the
+ body of <G> or within the body of a generic unit declared within
+ the declarative region of <G>, then the declaration of the formal
+ object of <G> shall have a null_exclusion;
4.6/2
- * otherwise, the subtype of the object_name shall exclude null. In
+ * otherwise, the subtype of the <object_>name shall exclude null. In
addition to the places where Legality Rules normally apply (see
*note 12.3::), this rule applies also in the private part of an
instance of a generic unit.
@@ -41250,12 +41392,12 @@ null_exclusion or an access_definition that has a
null_exclusion:
bodies of child generics as well as in the bodies of generics.
5/3
-{8652/00178652/0017} {AI95-00184-01AI95-00184-01}
-{AI95-00363-01AI95-00363-01} {AI05-0008-1AI05-0008-1} The renamed entity
-shall not be a subcomponent that depends on discriminants of an object
-whose nominal subtype is unconstrained unless the object is known to be
-constrained. A slice of an array shall not be renamed if this
-restriction disallows renaming of the array. In addition to the places
+{<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>}
+{<AI95-00363-01AI95-00363-01>} {<AI05-0008-1AI05-0008-1>} The renamed
+entity shall not be a subcomponent that depends on discriminants of an
+object whose nominal subtype is unconstrained unless the object is known
+to be constrained. A slice of an array shall not be renamed if this
+restriction disallows renaming of the array. In addition to the places
where Legality Rules normally apply, these rules apply also in the
private part of an instance of a generic unit.
@@ -41265,8 +41407,8 @@ private part of an instance of a generic unit.
restrictions exist for the Access attribute.
5.a.1/3
- {8652/00178652/0017} {AI95-00184-01AI95-00184-01}
- {AI05-0008-1AI05-0008-1} The "recheck on instantiation"
+ {<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>}
+ {<AI05-0008-1AI05-0008-1>} The "recheck on instantiation"
requirement on generics is necessary to avoid renaming of
components which could disappear even when the nominal subtype
would prevent the problem:
@@ -41297,10 +41439,10 @@ private part of an instance of a generic unit.
package I is new G (T2, Y);
- Y := (D1 => True); -- Oops! What happened to I.C1_Ren?
+ Y := (D1 => True); -- <Oops! What happened to I.C1_Ren?>
5.a.5/3
- {AI05-0008-1AI05-0008-1} In addition, the "known to be
+ {<AI05-0008-1AI05-0008-1>} In addition, the "known to be
constrained" rules include assume-the-worst rules for generic
bodies partially to prevent such problems.
@@ -41320,7 +41462,7 @@ private part of an instance of a generic unit.
_Static Semantics_
6/2
-{AI95-00230-01AI95-00230-01} {AI95-00409-01AI95-00409-01} An
+{<AI95-00230-01AI95-00230-01>} {<AI95-00409-01AI95-00409-01>} An
object_renaming_declaration declares a new view [of the renamed object]
whose properties are identical to those of the renamed view. [Thus, the
properties of the renamed object are not affected by the
@@ -41336,20 +41478,20 @@ object_renaming_declaration is ignored).]
writing an object_renaming_declaration.
6.b/2
- {AI95-00409-01AI95-00409-01} If no null_exclusion is given in
- the renaming, the object may or may not exclude null. This is
- similar to the way that constraints need not match, and
+ {<AI95-00409-01AI95-00409-01>} If no null_exclusion is given
+ in the renaming, the object may or may not exclude null. This
+ is similar to the way that constraints need not match, and
constant is not specified. The renaming defines a view of the
renamed entity, inheriting the original properties.
_Examples_
7
-Example of renaming an object:
+<Example of renaming an object:>
8
declare
- L : Person renames Leftmost_Person; -- see *note 3.10.1::
+ L : Person renames Leftmost_Person; --< see *note 3.10.1::>
begin
L.Age := L.Age + 1;
end;
@@ -41366,7 +41508,7 @@ Example of renaming an object:
_Incompatibilities With Ada 95_
8.b/2
- {AI95-00363-01AI95-00363-01} Aliased variables are not
+ {<AI95-00363-01AI95-00363-01>} Aliased variables are not
necessarily constrained in Ada 2005 (see *note 3.6::).
Therefore, a subcomponent of an aliased variable may disappear
or change shape, and renaming such a subcomponent thus is
@@ -41378,39 +41520,40 @@ Example of renaming an object:
8.c/2
AT2 : aliased T2;
- C1_Ren : Integer renames AT2.C1; -- Illegal in Ada 2005,
legal in Ada 95
- AT2 := (D1 => True); -- Raised Constraint_Error
in Ada 95,
- -- but does not in Ada
2005, so C1_Ren becomes
- -- invalid when this is
assigned.
+ C1_Ren : Integer renames AT2.C1; -- <Illegal in Ada 2005,
legal in Ada 95>
+ AT2 := (D1 => True); -- <Raised Constraint_Error
in Ada 95,>
+ -- <but does not in Ada
2005, so C1_Ren becomes>
+ -- <invalid when this is
assigned.>
_Extensions to Ada 95_
8.d/2
- {AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01}
- {AI95-00254-01AI95-00254-01} {AI95-00409-01AI95-00409-01} A
- renaming can have an anonymous access type. In that case, the
- accessibility of the renaming is that of the original object
- (accessibility is not lost as it is for assignment to a
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00231-01AI95-00231-01>}
+ {<AI95-00254-01AI95-00254-01>} {<AI95-00409-01AI95-00409-01>}
+ A renaming can have an anonymous access type. In that case,
+ the accessibility of the renaming is that of the original
+ object (accessibility is not lost as it is for assignment to a
component or stand-alone object).
8.e/2
- {AI95-00231-01AI95-00231-01} {AI95-00423-01AI95-00423-01} A
- renaming can have a null_exclusion; if so, the renamed object
- must also exclude null, so that the null_exclusion does not
- lie. On the other hand, if the renaming does not have a
+ {<AI95-00231-01AI95-00231-01>} {<AI95-00423-01AI95-00423-01>}
+ A renaming can have a null_exclusion; if so, the renamed
+ object must also exclude null, so that the null_exclusion does
+ not lie. On the other hand, if the renaming does not have a
null_exclusion. it excludes null if the renamed object does.
_Wording Changes from Ada 95_
8.f/2
- {8652/00178652/0017} {AI95-00184-01AI95-00184-01} Corrigendum:
- Fixed to forbid renamings of depends-on-discriminant
- components if the type might be definite.
+ {<8652/00178652/0017>} {<AI95-00184-01AI95-00184-01>}
+ Corrigendum: Fixed to forbid renamings of
+ depends-on-discriminant components if the type <might> be
+ definite.
_Incompatibilities With Ada 2005_
8.g/3
- {AI05-0008-1AI05-0008-1} Correction: Simplified the
+ {<AI05-0008-1AI05-0008-1>} Correction: Simplified the
description of when a discriminant-dependent component is
allowed to be renamed -- it's now simply when the object is
known to be constrained. This fixes a confusion as to whether
@@ -41424,9 +41567,9 @@ Example of renaming an object:
_Extensions to Ada 2005_
8.h/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in an object_renaming_declaration. This is described
- in *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in an object_renaming_declaration. This is
+ described in *note 13.1.1::.
File: aarm2012.info, Node: 8.5.2, Next: 8.5.3, Prev: 8.5.1, Up: 8.5
@@ -41440,8 +41583,8 @@ File: aarm2012.info, Node: 8.5.2, Next: 8.5.3, Prev:
8.5.1, Up: 8.5
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} exception_renaming_declaration ::=
- defining_identifier : exception renames exception_name
+ {<AI05-0183-1AI05-0183-1>} exception_renaming_declaration ::=
+ defining_identifier : exception renames <exception_>name
[aspect_specification];
_Legality Rules_
@@ -41458,16 +41601,16 @@ exception].
_Examples_
5
-Example of renaming an exception:
+<Example of renaming an exception:>
6
- EOF : exception renames Ada.IO_Exceptions.End_Error; -- see *note A.13::
+ EOF : exception renames Ada.IO_Exceptions.End_Error; <-- see *note A.13::>
_Extensions to Ada 2005_
6.a/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in an exception_renaming_declaration. This is
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in an exception_renaming_declaration. This is
described in *note 13.1.1::.
@@ -41482,8 +41625,8 @@ File: aarm2012.info, Node: 8.5.3, Next: 8.5.4, Prev:
8.5.2, Up: 8.5
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} package_renaming_declaration ::= package
- defining_program_unit_name renames package_name
+ {<AI05-0183-1AI05-0183-1>} package_renaming_declaration ::=
+ package defining_program_unit_name renames <package_>name
[aspect_specification];
_Legality Rules_
@@ -41492,12 +41635,13 @@ File: aarm2012.info, Node: 8.5.3, Next: 8.5.4,
Prev: 8.5.2, Up: 8.5
The renamed entity shall be a package.
3.1/2
-{AI95-00217-06AI95-00217-06} {AI95-00412-01AI95-00412-01} If the
-package_name of a package_renaming_declaration denotes a limited view of
-a package P, then a name that denotes the package_renaming_declaration
-shall occur only within the immediate scope of the renaming or the scope
-of a with_clause that mentions the package P or, if P is a nested
-package, the innermost library package enclosing P.
+{<AI95-00217-06AI95-00217-06>} {<AI95-00412-01AI95-00412-01>} If the
+<package_>name of a package_renaming_declaration denotes a limited view
+of a package <P>, then a name that denotes the
+package_renaming_declaration shall occur only within the immediate scope
+of the renaming or the scope of a with_clause that mentions the package
+<P> or, if <P> is a nested package, the innermost library package
+enclosing <P>.
3.a.1/2
Discussion: The use of a renaming that designates a limited
@@ -41515,7 +41659,7 @@ A package_renaming_declaration declares a new view [of
the renamed
package].
4.1/2
-{AI95-00412-01AI95-00412-01} [At places where the declaration of the
+{<AI95-00412-01AI95-00412-01>} [At places where the declaration of the
limited view of the renamed package is visible, a name that denotes the
package_renaming_declaration denotes a limited view of the package (see
*note 10.1.1::).]
@@ -41527,7 +41671,7 @@ package_renaming_declaration denotes a limited view of
the package (see
_Examples_
5
-Example of renaming a package:
+<Example of renaming a package:>
6
package TM renames Table_Manager;
@@ -41535,16 +41679,16 @@ Example of renaming a package:
_Wording Changes from Ada 95_
6.a/2
- {AI95-00217-06AI95-00217-06} {AI95-00412-01AI95-00412-01} Uses
- of renamed limited views of packages can only be used within
- the scope of a with_clause for the renamed package.
+ {<AI95-00217-06AI95-00217-06>} {<AI95-00412-01AI95-00412-01>}
+ Uses of renamed limited views of packages can only be used
+ within the scope of a with_clause for the renamed package.
_Extensions to Ada 2005_
6.b/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a package_renaming_declaration. This is described
- in *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a package_renaming_declaration. This is
+ described in *note 13.1.1::.
File: aarm2012.info, Node: 8.5.4, Next: 8.5.5, Prev: 8.5.3, Up: 8.5
@@ -41553,55 +41697,57 @@ File: aarm2012.info, Node: 8.5.4, Next: 8.5.5,
Prev: 8.5.3, Up: 8.5
--------------------------------------
1/3
-{AI05-0299-1AI05-0299-1} A subprogram_renaming_declaration can serve as
-the completion of a subprogram_declaration; such a renaming_declaration
-is called a renaming-as-body. A subprogram_renaming_declaration that is
-not a completion is called a renaming-as-declaration[, and is used to
-rename a subprogram (possibly an enumeration literal) or an entry].
+{<AI05-0299-1AI05-0299-1>} A subprogram_renaming_declaration can serve
+as the completion of a subprogram_declaration; such a
+renaming_declaration is called a <renaming-as-body>. A
+subprogram_renaming_declaration that is not a completion is called a
+<renaming-as-declaration>[, and is used to rename a subprogram (possibly
+an enumeration literal) or an entry].
1.a/3
- Ramification: {AI05-0299-1AI05-0299-1} A renaming-as-body is a
- declaration, as defined in Clause *note 3::.
+ Ramification: {<AI05-0299-1AI05-0299-1>} A renaming-as-body is
+ a declaration, as defined in Clause *note 3::.
_Syntax_
2/3
- {AI95-00218-03AI95-00218-03} {AI05-0183-1AI05-0183-1}
+ {<AI95-00218-03AI95-00218-03>} {<AI05-0183-1AI05-0183-1>}
subprogram_renaming_declaration ::=
[overriding_indicator]
- subprogram_specification renames callable_entity_name
+ subprogram_specification renames <callable_entity_>name
[aspect_specification];
_Name Resolution Rules_
3
-The expected profile for the callable_entity_name is the profile given
+The expected profile for the <callable_entity_>name is the profile given
in the subprogram_specification.
_Legality Rules_
4/3
-{AI05-0239-1AI05-0239-1} The profile of a renaming-as-declaration shall
-be mode conformant, with that of the renamed callable entity.
+{<AI05-0239-1AI05-0239-1>} The profile of a renaming-as-declaration
+shall be mode conformant, with that of the renamed callable entity.
4.1/2
-{AI95-00423-01AI95-00423-01} For a parameter or result subtype of the
+{<AI95-00423-01AI95-00423-01>} For a parameter or result subtype of the
subprogram_specification that has an explicit null_exclusion:
4.2/2
- * if the callable_entity_name denotes a generic formal subprogram of
- a generic unit G, and the subprogram_renaming_declaration occurs
- within the body of a generic unit G or within the body of a generic
- unit declared within the declarative region of the generic unit G,
- then the corresponding parameter or result subtype of the formal
- subprogram of G shall have a null_exclusion;
+ * if the <callable_entity_>name denotes a generic formal subprogram
+ of a generic unit <G>, and the subprogram_renaming_declaration
+ occurs within the body of a generic unit <G> or within the body of
+ a generic unit declared within the declarative region of the
+ generic unit <G>, then the corresponding parameter or result
+ subtype of the formal subprogram of <G> shall have a
+ null_exclusion;
4.3/2
* otherwise, the subtype of the corresponding parameter or result
- type of the renamed callable entity shall exclude null. In addition
- to the places where Legality Rules normally apply (see *note
- 12.3::), this rule applies also in the private part of an instance
- of a generic unit.
+ type of the renamed callable entity shall exclude null. In
+ addition to the places where Legality Rules normally apply (see
+ *note 12.3::), this rule applies also in the private part of an
+ instance of a generic unit.
4.a/2
Reason: This rule prevents "lying". Null must never be the
@@ -41611,15 +41757,16 @@ subprogram_specification that has an explicit
null_exclusion:
child units) when the formal subtype excludes null implicitly.
5/3
-{8652/00278652/0027} {8652/00288652/0028} {AI95-00135-01AI95-00135-01}
-{AI95-00145-01AI95-00145-01} {AI05-0239-1AI05-0239-1} The profile of a
-renaming-as-body shall conform fully to that of the declaration it
-completes. If the renaming-as-body completes that declaration before the
-subprogram it declares is frozen, the profile shall be mode conformant
-with that of the renamed callable entity and the subprogram it declares
-takes its convention from the renamed subprogram; otherwise, the profile
-shall be subtype conformant with that of the renamed callable entity and
-the convention of the renamed subprogram shall not be Intrinsic. A
+{<8652/00278652/0027>} {<8652/00288652/0028>}
+{<AI95-00135-01AI95-00135-01>} {<AI95-00145-01AI95-00145-01>}
+{<AI05-0239-1AI05-0239-1>} The profile of a renaming-as-body shall
+conform fully to that of the declaration it completes. If the
+renaming-as-body completes that declaration before the subprogram it
+declares is frozen, the profile shall be mode conformant with that of
+the renamed callable entity and the subprogram it declares takes its
+convention from the renamed subprogram; otherwise, the profile shall be
+subtype conformant with that of the renamed callable entity and the
+convention of the renamed subprogram shall not be Intrinsic. A
renaming-as-body is illegal if the declaration occurs before the
subprogram whose declaration it completes is frozen, and the renaming
renames the subprogram itself, through one or more subprogram renaming
@@ -41637,8 +41784,8 @@ declarations, none of whose subprograms has been frozen.
at call time.)
5.a.1/1
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} The first
- part of the second sentence is intended to allow
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>} The
+ first part of the second sentence is intended to allow
renaming-as-body of predefined operators before the
subprogram_declaration is frozen. For some types (such as
integer types), the parameter type for operators is the base
@@ -41667,19 +41814,19 @@ declarations, none of whose subprograms has been
frozen.
is involved in the conformance rules.
5.d.1/1
- Reason: {8652/00278652/0027} {AI95-00135-01AI95-00135-01}
+ Reason: {<8652/00278652/0027>} {<AI95-00135-01AI95-00135-01>}
Circular renames before freezing is illegal, as the compiler
would not be able to determine the convention of the
subprogram. Other circular renames are handled below; see
Bounded (Run-Time) Errors.
5.1/2
-{AI95-00228-01AI95-00228-01} The callable_entity_name of a renaming
+{<AI95-00228-01AI95-00228-01>} The <callable_entity_>name of a renaming
shall not denote a subprogram that requires overriding (see *note
3.9.3::).
5.d.2/2
- Reason: {AI95-00228-01AI95-00228-01} Such a rename cannot be
+ Reason: {<AI95-00228-01AI95-00228-01>} Such a rename cannot be
of the inherited subprogram (which requires overriding because
it cannot be called), and thus cannot squirrel away a
subprogram (see below). That would be confusing, so we make
@@ -41688,16 +41835,16 @@ shall not denote a subprogram that requires
overriding (see *note
inherited one.
5.2/2
-{AI95-00228-01AI95-00228-01} The callable_entity_name of a
+{<AI95-00228-01AI95-00228-01>} The <callable_entity_>name of a
renaming-as-body shall not denote an abstract subprogram.
5.d.3/2
- Reason: {AI95-00228-01AI95-00228-01} Such a subprogram has no
- body, so it hardly can replace one in the program.
+ Reason: {<AI95-00228-01AI95-00228-01>} Such a subprogram has
+ no body, so it hardly can replace one in the program.
6
A name that denotes a formal parameter of the subprogram_specification
-is not allowed within the callable_entity_name.
+is not allowed within the <callable_entity_>name.
6.a
Reason: This is to prevent things like this:
@@ -41734,8 +41881,8 @@ function or procedure, never an entry.
like barrier waiting.
7.b.1/3
- {8652/01058652/0105} {AI95-00211-01AI95-00211-01}
- {AI95-00228-01AI95-00228-01} {AI05-0095-1AI05-0095-1} All
+ {<8652/01058652/0105>} {<AI95-00211-01AI95-00211-01>}
+ {<AI95-00228-01AI95-00228-01>} {<AI05-0095-1AI05-0095-1>} All
properties of the renamed entity are inherited by the new view
unless otherwise stated by this International Standard. In
particular, if the renamed entity is abstract, the new view
@@ -41746,7 +41893,7 @@ function or procedure, never an entry.
_Dynamic Semantics_
7.1/1
-{8652/00148652/0014} {AI95-00064-01AI95-00064-01} For a call to a
+{<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>} For a call to a
subprogram whose body is given as a renaming-as-body, the execution of
the renaming-as-body is equivalent to the execution of a subprogram_body
that simply calls the renamed subprogram with its formal parameters as
@@ -41758,7 +41905,7 @@ call.
the renaming-as-body has its own elaboration check.
8/3
-{AI05-0123-1AI05-0123-1} For a call on a renaming of a dispatching
+{<AI05-0123-1AI05-0123-1>} For a call on a renaming of a dispatching
subprogram that is overridden, if the overriding occurred before the
renaming, then the body executed is that of the overriding declaration,
even if the overriding declaration is not visible at the place of the
@@ -41771,8 +41918,8 @@ equality operator for an untagged record type.
primitive has nothing to do with the renamed subprogram.
8.b/3
- {AI05-0123-1AI05-0123-1} Note that the above rule is only for
- tagged types and equality of untagged record types.
+ {<AI05-0123-1AI05-0123-1>} Note that the above rule is only
+ for tagged types and equality of untagged record types.
8.c
Consider the following example:
@@ -41782,7 +41929,7 @@ equality operator for an untagged record type.
type T is tagged null record;
function Predefined_Equal(X, Y : T) return Boolean renames
"=";
private
- function "="(X, Y : T) return Boolean; -- Override
predefined "=".
+ function "="(X, Y : T) return Boolean; --< Override
predefined "=".>
end P;
8.e
@@ -41804,14 +41951,14 @@ equality operator for an untagged record type.
_Bounded (Run-Time) Errors_
8.1/1
-{8652/00278652/0027} {AI95-00135-01AI95-00135-01} If a subprogram
+{<8652/00278652/0027>} {<AI95-00135-01AI95-00135-01>} If a subprogram
directly or indirectly renames itself, then it is a bounded error to
call that subprogram. Possible consequences are that Program_Error or
Storage_Error is raised, or that the call results in infinite recursion.
8.g.1/1
- Reason: {8652/00278652/0027} {AI95-00135-01AI95-00135-01} This
- has to be a bounded error, as it is possible for a
+ Reason: {<8652/00278652/0027>} {<AI95-00135-01AI95-00135-01>}
+ This has to be a bounded error, as it is possible for a
renaming-as-body appearing in a package body to cause this
problem. Thus it is not possible in general to detect this
problem at compile time.
@@ -41867,72 +42014,73 @@ Storage_Error is raised, or that the call results in
infinite recursion.
_Examples_
13
-Examples of subprogram renaming declarations:
+<Examples of subprogram renaming declarations:>
14
- procedure My_Write(C : in Character) renames Pool(K).Write; -- see *note
4.1.3::
+ procedure My_Write(C : in Character) renames Pool(K).Write; --< see
*note 4.1.3::>
15
function Real_Plus(Left, Right : Real ) return Real renames "+";
function Int_Plus (Left, Right : Integer) return Integer renames "+";
16
- function Rouge return Color renames Red; -- see *note 3.5.1::
+ function Rouge return Color renames Red; --< see *note 3.5.1::>
function Rot return Color renames Red;
function Rosso return Color renames Rouge;
17
- function Next(X : Color) return Color renames Color'Succ; -- see *note
3.5.1::
+ function Next(X : Color) return Color renames Color'Succ; --< see *note
3.5.1::>
18
-Example of a subprogram renaming declaration with new parameter names:
+<Example of a subprogram renaming declaration with new parameter names:>
19
- function "*" (X,Y : Vector) return Real renames Dot_Product; -- see *note
6.1::
+ function "*" (X,Y : Vector) return Real renames Dot_Product; --< see
*note 6.1::>
20
-Example of a subprogram renaming declaration with a new default
-expression:
+<Example of a subprogram renaming declaration with a new default
+expression:>
21
- function Minimum(L : Link := Head) return Cell renames Min_Cell; -- see
*note 6.1::
+ function Minimum(L : Link := Head) return Cell renames Min_Cell; --< see
*note 6.1::>
_Extensions to Ada 95_
21.a/2
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} Corrigendum:
- Allowed a renaming-as-body to be just mode conformant with the
- specification if the subprogram is not yet frozen.
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>}
+ Corrigendum: Allowed a renaming-as-body to be just mode
+ conformant with the specification if the subprogram is not yet
+ frozen.
21.b/2
- {AI95-00218-03AI95-00218-03} Overriding_indicator (see *note
+ {<AI95-00218-03AI95-00218-03>} Overriding_indicator (see *note
8.3.1::) is optionally added to subprogram renamings.
_Wording Changes from Ada 95_
21.c/2
- {8652/00148652/0014} {AI95-00064-01AI95-00064-01} Corrigendum:
- Described the semantics of renaming-as-body, so that the
- location of elaboration checks is clear.
+ {<8652/00148652/0014>} {<AI95-00064-01AI95-00064-01>}
+ Corrigendum: Described the semantics of renaming-as-body, so
+ that the location of elaboration checks is clear.
21.d/2
- {8652/00278652/0027} {AI95-00135-01AI95-00135-01} Corrigendum:
- Clarified that circular renaming-as-body is illegal (if it can
- be detected in time) or a bounded error.
+ {<8652/00278652/0027>} {<AI95-00135-01AI95-00135-01>}
+ Corrigendum: Clarified that circular renaming-as-body is
+ illegal (if it can be detected in time) or a bounded error.
21.e/2
- {AI95-00228-01AI95-00228-01} Amendment Correction: Clarified
+ {<AI95-00228-01AI95-00228-01>} Amendment Correction: Clarified
that renaming a shall-be-overridden subprogram is illegal, as
well as renaming-as-body an abstract subprogram.
21.f/2
- {AI95-00423-01AI95-00423-01} Added matching rules for
+ {<AI95-00423-01AI95-00423-01>} Added matching rules for
null_exclusions.
_Inconsistencies With Ada 2005_
21.f.1/3
- {AI05-0123-1AI05-0123-1} Renaming of user-defined untagged
+ {<AI05-0123-1AI05-0123-1>} Renaming of user-defined untagged
record equality is now defined to call the overridden body so
long as the overriding occurred before the renames. This
could change the body called in unusual cases; the change is
@@ -41946,8 +42094,8 @@ expression:
_Extensions to Ada 2005_
21.g/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a subprogram_renaming_declaration. This is
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a subprogram_renaming_declaration. This is
described in *note 13.1.1::.
@@ -41962,15 +42110,15 @@ File: aarm2012.info, Node: 8.5.5, Prev: 8.5.4, Up:
8.5
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} generic_renaming_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} generic_renaming_declaration ::=
generic package
- defining_program_unit_name renames generic_package_name
+ defining_program_unit_name renames <generic_package_>name
[aspect_specification];
| generic procedure
- defining_program_unit_name renames generic_procedure_name
+ defining_program_unit_name renames <generic_procedure_>name
[aspect_specification];
| generic function
- defining_program_unit_name renames generic_function_name
+ defining_program_unit_name renames <generic_function_>name
[aspect_specification];
_Legality Rules_
@@ -41997,10 +42145,10 @@ generic unit].
_Examples_
6
-Example of renaming a generic unit:
+<Example of renaming a generic unit:>
7
- generic package Enum_IO renames Ada.Text_IO.Enumeration_IO; -- see *note
A.10.10::
+ generic package Enum_IO renames Ada.Text_IO.Enumeration_IO; <-- see
*note A.10.10::>
_Extensions to Ada 83_
@@ -42023,9 +42171,9 @@ Example of renaming a generic unit:
_Extensions to Ada 2005_
7.c/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a generic_renaming_declaration. This is described
- in *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a generic_renaming_declaration. This is
+ described in *note 13.1.1::.
File: aarm2012.info, Node: 8.6, Prev: 8.5, Up: 8
@@ -42034,8 +42182,8 @@ File: aarm2012.info, Node: 8.6, Prev: 8.5, Up: 8
======================================
1/3
-{AI05-0299-1AI05-0299-1} [ Because declarations can be overloaded, it is
-possible for an occurrence of a usage name to have more than one
+{<AI05-0299-1AI05-0299-1>} [ Because declarations can be overloaded, it
+is possible for an occurrence of a usage name to have more than one
possible interpretation; in most cases, ambiguity is disallowed. This
subclause describes how the possible interpretations resolve to the
actual interpretation.
@@ -42068,9 +42216,9 @@ formal and actual parameters are overloading rules.]
_Name Resolution Rules_
4
-[Overload resolution is applied separately to each complete context, not
-counting inner complete contexts.] Each of the following constructs is
-a complete context:
+[Overload resolution is applied separately to each <complete context>,
+not counting inner complete contexts.] Each of the following constructs
+is a <complete context>:
5
* A context_item.
@@ -42094,7 +42242,7 @@ a complete context:
applies to a complete context.
9/4
- * {AI12-0040-1AI12-0040-1} The selecting_expression of a
+ * {<AI12-0040-1AI12-0040-1>} The <selecting_>expression of a
case_statement or case_expression.
9.a
@@ -42102,16 +42250,17 @@ a complete context:
without looking at the choices.
10
-An (overall) interpretation of a complete context embodies its meaning,
-and includes the following information about the constituents of the
-complete context, not including constituents of inner complete contexts:
+An (overall) <interpretation> of a complete context embodies its
+meaning, and includes the following information about the constituents
+of the complete context, not including constituents of inner complete
+contexts:
11
* for each constituent of the complete context, to which syntactic
categories it belongs, and by which syntax rules; and
11.a
- Ramification: Syntactic categories is plural here, because
+ Ramification: Syntactic categor<ies> is plural here, because
there are lots of trivial productions -- an expression might
also be all of the following, in this order: identifier, name,
primary, factor, term, simple_expression, and relation.
@@ -42124,7 +42273,7 @@ complete context, not including constituents of inner
complete contexts:
which view and which entity it denotes); and
12.a/2
- Ramification: {AI95-00382-01AI95-00382-01} In most cases, a
+ Ramification: {<AI95-00382-01AI95-00382-01>} In most cases, a
usage name denotes the view declared by the denoted
declaration. However, in certain cases, a usage name that
denotes a declaration and appears inside the declarative
@@ -42149,19 +42298,19 @@ complete context, not including constituents of inner
complete contexts:
information is tentative.
13.c
- Discussion: A possible interpretation (an input to overload
- resolution) contains information about what a usage name might
- denote, but what it actually does denote requires overload
- resolution to determine. Hence the term "tentative" is needed
- for possible interpretations; otherwise, the definition would
- be circular.
+ Discussion: A possible interpretation (an <input> to overload
+ resolution) contains information about what a usage name
+ <might> denote, but what it actually <does> denote requires
+ overload resolution to determine. Hence the term "tentative"
+ is needed for possible interpretations; otherwise, the
+ definition would be circular.
14
-A possible interpretation is one that obeys the syntax rules and the
-visibility rules. An acceptable interpretation is a possible
-interpretation that obeys the overloading rules[, that is, those rules
+A <possible interpretation> is one that obeys the syntax rules and the
+visibility rules. An <acceptable interpretation> is a possible
+interpretation that obeys the <overloading rules>[, that is, those rules
that specify an expected type or expected profile, or specify how a
-construct shall resolve or be interpreted.]
+construct shall <resolve> or be <interpreted>.]
14.a
To be honest: One rule that falls into this category, but does
@@ -42176,15 +42325,15 @@ construct shall resolve or be interpreted.]
the appropriate heading.
15
-The interpretation of a constituent of a complete context is determined
-from the overall interpretation of the complete context as a whole.
-[Thus, for example, "interpreted as a function_call," means that the
-construct's interpretation says that it belongs to the syntactic
+The <interpretation> of a constituent of a complete context is
+determined from the overall interpretation of the complete context as a
+whole. [Thus, for example, "interpreted as a function_call," means that
+the construct's interpretation says that it belongs to the syntactic
category function_call.]
16
-[Each occurrence of] a usage name denotes the declaration determined by
-its interpretation. It also denotes the view declared by its denoted
+[Each occurrence of] a usage name <denotes> the declaration determined
+by its interpretation. It also denotes the view declared by its denoted
declaration, except in the following cases:
16.a
@@ -42193,21 +42342,22 @@ declaration, except in the following cases:
all of the views declared by those declarations.
17/3
- * {AI95-00382-01AI95-00382-01} {AI05-0287-1AI05-0287-1} If a usage
- name appears within the declarative region of a type_declaration
- and denotes that same type_declaration, then it denotes the current
- instance of the type (rather than the type itself); the current
- instance of a type is the object or value of the type that is
- associated with the execution that evaluates the usage name.
- Similarly, if a usage name appears within the declarative region of
- a subtype_declaration and denotes that same subtype_declaration,
- then it denotes the current instance of the subtype. These rules
- do not apply if the usage name appears within the subtype_mark of
- an access_definition for an access-to-object type, or within the
- subtype of a parameter or result of an access-to-subprogram type.
+ * {<AI95-00382-01AI95-00382-01>} {<AI05-0287-1AI05-0287-1>} If a
+ usage name appears within the declarative region of a
+ type_declaration and denotes that same type_declaration, then it
+ denotes the <current instance> of the type (rather than the type
+ itself); the current instance of a type is the object or value of
+ the type that is associated with the execution that evaluates the
+ usage name. Similarly, if a usage name appears within the
+ declarative region of a subtype_declaration and denotes that same
+ subtype_declaration, then it denotes the current instance of the
+ subtype. These rules do not apply if the usage name appears within
+ the subtype_mark of an access_definition for an access-to-object
+ type, or within the subtype of a parameter or result of an
+ access-to-subprogram type.
17.a/2
- Reason: {AI95-00382-01AI95-00382-01} This is needed, for
+ Reason: {<AI95-00382-01AI95-00382-01>} This is needed, for
example, for references to the Access attribute from within
the type_declaration. Also, within a task_body or
protected_body, we need to be able to denote the current task
@@ -42218,17 +42368,17 @@ declaration, except in the following cases:
natural manner (otherwise such types would be illegal).
17.b/2
- Discussion: {AI95-00382-01AI95-00382-01} The phrase "within
+ Discussion: {<AI95-00382-01AI95-00382-01>} The phrase "within
the subtype_mark" in the "this rule does not apply" part is
intended to cover a case like access T'Class appearing within
the declarative region of T: here T denotes the type, not the
current instance.
17.1/4
- {AI12-0068-1AI12-0068-1} Within an aspect_specification for a type
- or subtype, the current instance represents a value of the type; it
- is not an object. The nominal subtype of this value is given by
- the subtype itself (the first subtype in the case of a
+ {<AI12-0068-1AI12-0068-1>} Within an aspect_specification for a
+ type or subtype, the current instance represents a value of the
+ type; it is not an object. The nominal subtype of this value is
+ given by the subtype itself (the first subtype in the case of a
type_declaration), prior to applying any predicate specified
directly on the type or subtype. If the type or subtype is
by-reference, the associated object with the value is the object
@@ -42244,9 +42394,9 @@ declaration, except in the following cases:
18
* If a usage name appears within the declarative region of a
generic_declaration (but not within its generic_formal_part) and it
- denotes that same generic_declaration, then it denotes the current
- instance of the generic unit (rather than the generic unit itself).
- See also *note 12.3::.
+ denotes that same generic_declaration, then it denotes the <current
+ instance> of the generic unit (rather than the generic unit
+ itself). See also *note 12.3::.
18.a
To be honest: The current instance of a generic unit is the
@@ -42266,12 +42416,12 @@ A usage name that denotes a view also denotes the
entity of that view.
declaration, and therefore one view and one entity.
20/2
-{AI95-00231-01AI95-00231-01} The expected type for a given expression,
-name, or other construct determines, according to the type resolution
-rules given below, the types considered for the construct during
-overload resolution. [ The type resolution rules provide support for
-class-wide programming, universal literals, dispatching operations, and
-anonymous access types:]
+{<AI95-00231-01AI95-00231-01>} The <expected type> for a given
+expression, name, or other construct determines, according to the <type
+resolution rules> given below, the types considered for the construct
+during overload resolution. [ The type resolution rules provide support
+for class-wide programming, universal literals, dispatching operations,
+and anonymous access types:]
20.a
Ramification: Expected types are defined throughout the RM95.
@@ -42293,25 +42443,25 @@ anonymous access types:]
21.a
Ramification: This matching rule handles (among other things)
cases like the Val attribute, which denotes a function that
- takes a parameter of type universal_integer.
+ takes a parameter of type <universal_integer>.
21.b/1
The last part of the rule, "or to a universal type that covers
the class" implies that if the expected type for an expression
- is universal_fixed, then an expression whose type is
- universal_real (such as a real literal) is OK.
+ is <universal_fixed>, then an expression whose type is
+ <universal_real> (such as a real literal) is OK.
22
- * If the expected type for a construct is a specific type T, then the
- type of the construct shall resolve either to T, or:
+ * If the expected type for a construct is a specific type <T>, then
+ the type of the construct shall resolve either to <T>, or:
22.a
- Ramification: This rule is not intended to create a preference
- for the specific type -- such a preference would cause
- Beaujolais effects.
+ Ramification: This rule is <not> intended to create a
+ preference for the specific type -- such a preference would
+ cause Beaujolais effects.
23
- * to T'Class; or
+ * to <T>'Class; or
23.a
Ramification: This will only be legal as part of a call on a
@@ -42320,48 +42470,49 @@ anonymous access types:]
is not a Name Resolution Rule.
24
- * to a universal type that covers T; or
+ * to a universal type that covers <T>; or
25/2
- * {AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01}
- {AI95-00254-01AI95-00254-01} {AI95-00409-01AI95-00409-01}
- when T is a specific anonymous access-to-object type (see
- *note 3.10::) with designated type D, to an
- access-to-object type whose designated type is D'Class or
- is covered by D; or
+ * {<AI95-00230-01AI95-00230-01>}
+ {<AI95-00231-01AI95-00231-01>}
+ {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00409-01AI95-00409-01>} when <T> is a specific
+ anonymous access-to-object type (see *note 3.10::) with
+ designated type <D>, to an access-to-object type whose
+ designated type is <D>'Class or is covered by <D>; or
25.a/2
- This paragraph was deleted.{AI95-00409-01AI95-00409-01}
+ <This paragraph was deleted.>{<AI95-00409-01AI95-00409-01>}
25.b
- Ramification: The case where the actual is access-to-D'Class
+ Ramification: The case where the actual is access-to-<D>'Class
will only be legal as part of a call on a dispatching
operation; see *note 3.9.2::, "*note 3.9.2:: Dispatching
Operations of Tagged Types". Note that that rule is not a
Name Resolution Rule.
25.1/3
- * {AI05-0149-1AI05-0149-1} when T is a named general
+ * {<AI05-0149-1AI05-0149-1>} when <T> is a named general
access-to-object type (see *note 3.10::) with designated
- type D, to an anonymous access-to-object type whose
- designated type covers or is covered by D; or
+ type <D>, to an anonymous access-to-object type whose
+ designated type covers or is covered by <D>; or
25.2/3
- * {AI95-00254-01AI95-00254-01} {AI95-00409-01AI95-00409-01}
- {AI05-0239-1AI05-0239-1} when T is an anonymous
- access-to-subprogram type (see *note 3.10::), to an
- access-to-subprogram type whose designated profile is
- type conformant with that of T.
+ * {<AI95-00254-01AI95-00254-01>}
+ {<AI95-00409-01AI95-00409-01>} {<AI05-0239-1AI05-0239-1>}
+ when <T> is an anonymous access-to-subprogram type (see
+ *note 3.10::), to an access-to-subprogram type whose
+ designated profile is type conformant with that of <T>.
26
In certain contexts, [such as in a subprogram_renaming_declaration,] the
-Name Resolution Rules define an expected profile for a given name; in
+Name Resolution Rules define an <expected profile> for a given name; in
such cases, the name shall resolve to the name of a callable entity
-whose profile is type conformant with the expected profile.
+whose profile is type conformant with the expected profile.
26.a/3
- Ramification: {AI05-0239-1AI05-0239-1} The parameter and
- result subtypes are not used in overload resolution. Only
+ Ramification: {<AI05-0239-1AI05-0239-1>} The parameter and
+ result <sub>types are not used in overload resolution. Only
type conformance of profiles is considered during overload
resolution. Legality rules generally require at least mode
conformance in addition, but those rules are not used in
@@ -42370,9 +42521,9 @@ whose profile is type conformant with the expected
profile.
_Legality Rules_
27/2
-{AI95-00332-01AI95-00332-01} When a construct is one that requires that
-its expected type be a single type in a given class, the type of the
-construct shall be determinable solely from the context in which the
+{<AI95-00332-01AI95-00332-01>} When a construct is one that requires
+that its expected type be a <single> type in a given class, the type of
+the construct shall be determinable solely from the context in which the
construct appears, excluding the construct itself, but using the
requirement that it be in the given class. Furthermore, the context
shall not be one that expects any type in some class that contains types
@@ -42380,7 +42531,7 @@ of the given class; in particular, the construct shall
not be the
operand of a type_conversion.
27.a/2
- Ramification: {AI95-00230-01AI95-00230-01} For example, the
+ Ramification: {<AI95-00230-01AI95-00230-01>} For example, the
expected type for a string literal is required to be a single
string type. But the expected type for the operand of a
type_conversion is any type. Therefore, a string literal is
@@ -42391,25 +42542,25 @@ operand of a type_conversion.
exactly one type in a class in scope.
27.b/2
- Discussion: {AI95-00332-01AI95-00332-01} The first sentence is
- carefully worded so that it only mentions "expected type" as
- part of identifying the interesting case, but doesn't require
- that the context actually provide such an expected type. This
- allows such constructs to be used inside of constructs that
- don't provide an expected type (like qualified expressions and
- renames). Otherwise, such constructs wouldn't allow
- aggregates, 'Access, and so on.
+ Discussion: {<AI95-00332-01AI95-00332-01>} The first sentence
+ is carefully worded so that it only mentions "expected type"
+ as part of identifying the interesting case, but doesn't
+ require that the context actually provide such an expected
+ type. This allows such constructs to be used inside of
+ constructs that don't provide an expected type (like qualified
+ expressions and renames). Otherwise, such constructs wouldn't
+ allow aggregates, 'Access, and so on.
27.1/4
-{AI05-0102-1AI05-0102-1} {AI05-0149-1AI05-0149-1}
-{AI05-0299-1AI05-0299-1} {AI12-0039-1AI12-0039-1} Other than for the
-tested_simple_expression of a membership test, if the expected type for
-a name or expression is not the same as the actual type of the name or
-expression, the actual type shall be convertible to the expected type
+{<AI05-0102-1AI05-0102-1>} {<AI05-0149-1AI05-0149-1>}
+{<AI05-0299-1AI05-0299-1>} {<AI12-0039-1AI12-0039-1>} Other than for the
+<tested_>simple_expression of a membership test, if the expected type
+for a name or expression is not the same as the actual type of the name
+or expression, the actual type shall be convertible to the expected type
(see *note 4.6::); further, if the expected type is a named
-access-to-object type with designated type D1 and the actual type is an
-anonymous access-to-object type with designated type D2, then D1 shall
-cover D2, and the name or expression shall denote a view with an
+access-to-object type with designated type <D1> and the actual type is
+an anonymous access-to-object type with designated type <D2>, then <D1>
+shall cover <D2>, and the name or expression shall denote a view with an
accessibility level for which the statically deeper relationship
applies[; in particular it shall not denote an access parameter nor a
stand-alone access object].
@@ -42447,13 +42598,13 @@ there is exactly one, then that one is chosen.
rule have to be Legality Rules.
29
-There is a preference for the primitive operators (and ranges) of the
-root numeric types root_integer and root_real. In particular, if two
-acceptable interpretations of a constituent of a complete context differ
-only in that one is for a primitive operator (or range) of the type
-root_integer or root_real, and the other is not, the interpretation
-using the primitive operator (or range) of the root numeric type is
-preferred.
+There is a <preference> for the primitive operators (and ranges) of the
+root numeric types <root_integer> and <root_real>. In particular, if
+two acceptable interpretations of a constituent of a complete context
+differ only in that one is for a primitive operator (or range) of the
+type <root_integer> or <root_real>, and the other is not, the
+interpretation using the primitive operator (or range) of the root
+numeric type is <preferred>.
29.a
Reason: The reason for this preference is so that expressions
@@ -42463,17 +42614,17 @@ preferred.
29.b/1
N : constant := 123;
- if N > 100 then -- Preference for root_integer ">" operator.
+ if N > 100 then --< Preference for root_integer ">" operator.>
...
end if;
29.1/3
-{AI05-0149-1AI05-0149-1} Similarly, there is a preference for the
-equality operators of the universal_access type (see *note 4.5.2::). If
-two acceptable interpretations of a constituent of a complete context
+{<AI05-0149-1AI05-0149-1>} Similarly, there is a preference for the
+equality operators of the <universal_access> type (see *note 4.5.2::).
+If two acceptable interpretations of a constituent of a complete context
differ only in that one is for an equality operator of the
-universal_access type, and the other is not, the interpretation using
-the equality operator of the universal_access type is preferred.
+<universal_access> type, and the other is not, the interpretation using
+the equality operator of the <universal_access> type is preferred.
29.c/3
Reason: This preference is necessary because of implicit
@@ -42487,7 +42638,8 @@ For a complete context, if there is exactly one overall
acceptable
interpretation where each constituent's interpretation is the same as or
preferred (in the above sense) over those in all other overall
acceptable interpretations, then that one overall acceptable
-interpretation is chosen. Otherwise, the complete context is ambiguous.
+interpretation is chosen. Otherwise, the complete context is
+<ambiguous>.
31
A complete context other than a pragma_argument_association shall not be
@@ -42497,13 +42649,13 @@ ambiguous.
A complete context that is a pragma_argument_association is allowed to
be ambiguous (unless otherwise specified for the particular pragma), but
only if every acceptable interpretation of the pragma argument is as a
-name that statically denotes a callable entity. Such a name denotes all
+name that statically denotes a callable entity. Such a name denotes all
of the declarations determined by its interpretations, and all of the
views declared by these declarations.
32.a/3
- Ramification: {AI95-00224-01AI95-00224-01}
- {AI05-0229-1AI05-0229-1} This applies to Inline, Suppress,
+ Ramification: {<AI95-00224-01AI95-00224-01>}
+ {<AI05-0229-1AI05-0229-1>} This applies to Inline, Suppress,
Import, Export, and Convention pragmas. For example, it is OK
to say "pragma Export(C, Entity_Name => P.Q);", even if there
are two directly visible P's, and there are two Q's declared
@@ -42521,7 +42673,7 @@ views declared by these declarations.
declarations, are preferred in Ada 2012.
32.b
- Note that if a pragma argument denotes a call to a callable
+ Note that if a pragma argument denotes a <call> to a callable
entity, rather than the entity itself, this exception does not
apply, and ambiguity is disallowed.
@@ -42558,8 +42710,8 @@ views declared by these declarations.
34.a
The new preference rule for operators of root numeric types is
upward incompatible, but only in cases that involved
- Beaujolais effects in Ada 83. Such cases are ambiguous in Ada
- 95.
+ <Beaujolais> effects in Ada 83. Such cases are ambiguous in
+ Ada 95.
_Extensions to Ada 83_
@@ -42590,7 +42742,7 @@ views declared by these declarations.
sorts of rules are overloading rules.
34.e/3
- {AI05-0299-1AI05-0299-1} It is not clear from RM83 what
+ {<AI05-0299-1AI05-0299-1>} It is not clear from RM83 what
information is embodied in a "meaning" or an "interpretation."
"Meaning" and "interpretation" were intended to be synonymous;
we now use the latter only in defining the rules about
@@ -42632,7 +42784,7 @@ views declared by these declarations.
type T is array(Integer range 1..10) of A;
I : Integer := 3;
function F(X : Integer := 7) return A;
- Y : A := F(I); -- Ambiguous? (We hope so.)
+ Y : A := F(I); --< Ambiguous? (We hope so.)>
34.i/1
Consider the declaration of Y (a complete context). In the
@@ -42656,11 +42808,11 @@ views declared by these declarations.
numeric operators is more locally enforceable than that of
RM83-4.6(15). It should also eliminate interpretation shifts
due to the addition or removal of a use_clause (the so called
- Beaujolais effect).
+ <Beaujolais> effect).
34.l/2
- {AI95-00114-01AI95-00114-01} RM83-8.7 seems to be missing some
- complete contexts, such as pragma_argument_associations,
+ {<AI95-00114-01AI95-00114-01>} RM83-8.7 seems to be missing
+ some complete contexts, such as pragma_argument_associations,
declarative_items that are not declarations or aspect_clauses,
and context_items. We have added these, and also replaced the
"must be determinable" wording of RM83-5.4(3) with the notion
@@ -42674,8 +42826,8 @@ views declared by these declarations.
_Incompatibilities With Ada 95_
34.n/2
- {AI95-00409-01AI95-00409-01} Ada 95 allowed name resolution to
- distinguish between anonymous access-to-variable and
+ {<AI95-00409-01AI95-00409-01>} Ada 95 allowed name resolution
+ to distinguish between anonymous access-to-variable and
access-to-constant types. This is similar to distinguishing
between subprograms with in and in out parameters, which is
known to be bad. Thus, that part of the rule was dropped as
@@ -42687,7 +42839,7 @@ views declared by these declarations.
procedure Proc (Acc : access Integer) ...
procedure Proc (Acc : Cacc) ...
List : Cacc := ...;
- Proc (List); -- OK in Ada 95, ambiguous in Ada 2005.
+ Proc (List); -- <OK in Ada 95, ambiguous in Ada 2005.>
34.p/2
If there is any code like this (such code should be rare), it
@@ -42696,14 +42848,14 @@ views declared by these declarations.
_Extensions to Ada 95_
34.q/2
- {AI95-00230-01AI95-00230-01} {AI95-00231-01AI95-00231-01}
- {AI95-00254-01AI95-00254-01} Generalized the anonymous access
- resolution rules to support the new capabilities of anonymous
- access types (that is, access-to-subprogram and
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00231-01AI95-00231-01>}
+ {<AI95-00254-01AI95-00254-01>} Generalized the anonymous
+ access resolution rules to support the new capabilities of
+ anonymous access types (that is, access-to-subprogram and
access-to-constant).
34.r/2
- {AI95-00382-01AI95-00382-01} We now allow the creation of
+ {<AI95-00382-01AI95-00382-01>} We now allow the creation of
self-referencing types via anonymous access types. This is an
extension in unusual cases involving task and protected types.
For example:
@@ -42713,7 +42865,7 @@ views declared by these declarations.
34.t/2
task body T is
- procedure P (X : access T) is -- Illegal in Ada 95, legal in
Ada 2005
+ procedure P (X : access T) is -- <Illegal in Ada 95, legal
in Ada 2005>
...
end P;
begin
@@ -42723,7 +42875,7 @@ views declared by these declarations.
_Wording Changes from Ada 95_
34.u/2
- {AI95-00332-01AI95-00332-01} Corrected the "single expected
+ {<AI95-00332-01AI95-00332-01>} Corrected the "single expected
type" so that it works in contexts that don't have expected
types (like object renames and qualified expressions). This
fixes a hole in Ada 95 that appears to prohibit using
@@ -42733,7 +42885,7 @@ views declared by these declarations.
_Incompatibilities With Ada 2005_
34.v/3
- {AI05-0149-1AI05-0149-1} Implicit conversion is now allowed
+ {<AI05-0149-1AI05-0149-1>} Implicit conversion is now allowed
from anonymous access-to-object types to general
access-to-object types. Such conversions can make calls
ambiguous. That can only happen when there are two visible
@@ -42747,7 +42899,7 @@ views declared by these declarations.
_Extensions to Ada 2005_
34.w/3
- {AI05-0149-1AI05-0149-1} Implicit conversion is allowed from
+ {<AI05-0149-1AI05-0149-1>} Implicit conversion is allowed from
anonymous access-to-object types to general access-to-object
types if the designated type is convertible and runtime checks
are minimized. See also the incompatibilities section.
@@ -42755,7 +42907,7 @@ views declared by these declarations.
_Wording Changes from Ada 2005_
34.x/3
- {AI05-0102-1AI05-0102-1} Added a requirement here that
+ {<AI05-0102-1AI05-0102-1>} Added a requirement here that
implicit conversions are convertible to the appropriate type.
This rule was scattered about the Standard, we moved a single
generalized version here.
@@ -42763,27 +42915,27 @@ views declared by these declarations.
_Inconsistencies With Ada 2012_
34.y/4
- {AI12-0068-1AI12-0068-1} Corrigendum: Added a rule to specify
- that the current instance of a type or subtype is a value
- within an aspect_specification. This could be inconsistent if
- a predicate or invariant uses the Constrained attribute on the
- current instance (it will always be False now, while it might
- have returned True in original Ada 2012). More likely, a
- usage of a current instance as a prefix of an attribute will
- become illegal (such as Size or Alignment). Any such code is
- very tricky. Moreover, as this is a new feature of Ada 2012,
- there are not that many predicates and invariants, and the
- ones that exist are very unlikely to be this tricky. Thus we
- do not believe that there will be any practical effect to this
- change, other than to explicitly allow common implementation
- strategies.
+ {<AI12-0068-1AI12-0068-1>} Corrigendum: Added a rule to
+ specify that the current instance of a type or subtype is a
+ value within an aspect_specification. This could be
+ inconsistent if a predicate or invariant uses the Constrained
+ attribute on the current instance (it will always be False
+ now, while it might have returned True in original Ada 2012).
+ More likely, a usage of a current instance as a prefix of an
+ attribute will become illegal (such as Size or Alignment).
+ Any such code is very tricky. Moreover, as this is a new
+ feature of Ada 2012, there are not that many predicates and
+ invariants, and the ones that exist are very unlikely to be
+ this tricky. Thus we do not believe that there will be any
+ practical effect to this change, other than to explicitly
+ allow common implementation strategies.
_Wording Changes from Ada 2012_
34.z/4
- {AI12-0040-1AI12-0040-1} Corrigendum: Added wording to clarify
- that the selecting_expression of a case_expression is a
- complete context, just like that of a case_statement.
+ {<AI12-0040-1AI12-0040-1>} Corrigendum: Added wording to
+ clarify that the <selecting_>expression of a case_expression
+ is a complete context, just like that of a case_statement.
Clearly, everyone expects these to work the same way.
Moreover, since it would be a lot of extra work to treat
case_expressions differently, it is quite unlikely that any
@@ -42798,11 +42950,11 @@ File: aarm2012.info, Node: 9, Next: 10, Prev: 8,
Up: Top
***************************
1/3
-{AI05-0299-1AI05-0299-1} The execution of an Ada program consists of the
-execution of one or more tasks. Each task represents a separate thread
-of control that proceeds independently and concurrently between the
-points where it interacts with other tasks. The various forms of task
-interaction are described in this clause, and include:
+{<AI05-0299-1AI05-0299-1>} The execution of an Ada program consists of
+the execution of one or more <tasks>. Each task represents a separate
+thread of control that proceeds independently and concurrently between
+the points where it <interacts> with other tasks. The various forms of
+task interaction are described in this clause, and include:
1.a
To be honest: The execution of an Ada program consists of the
@@ -42814,7 +42966,7 @@ interaction are described in this clause, and include:
* the activation and termination of a task;
3
- * a call on a protected subprogram of a protected object, providing
+ * a call on a protected subprogram of a <protected object>, providing
exclusive read-write access, or concurrent read-only access to
shared data;
@@ -42848,22 +43000,23 @@ synchronized through some other kind of task
interaction.
9
The properties of a task are defined by a corresponding task declaration
-and task_body, which together define a program unit called a task unit.
+and task_body, which together define a program unit called a <task
+unit>.
_Dynamic Semantics_
10
-Over time, tasks proceed through various states. A task is initially
-inactive; upon activation, and prior to its termination it is either
-blocked (as part of some task interaction) or ready to run. While ready,
-a task competes for the available execution resources that it requires
-to run.
+Over time, tasks proceed through various <states>. A task is initially
+<inactive>; upon activation, and prior to its <termination> it is either
+<blocked> (as part of some task interaction) or <ready> to run. While
+ready, a task competes for the available <execution resources> that it
+requires to run.
10.a/3
- Discussion: {AI05-0229-1AI05-0229-1} The means for selecting
+ Discussion: {<AI05-0229-1AI05-0229-1>} The means for selecting
which of the ready tasks to run, given the currently available
- execution resources, is determined by the task dispatching
- policy in effect, which is generally implementation defined,
+ execution resources, is determined by the <task dispatching
+ policy> in effect, which is generally implementation defined,
but may be controlled by aspects, pragmas, and operations
defined in the Real-Time Annex (see *note D.2:: and *note
D.5::).
@@ -42912,16 +43065,17 @@ File: aarm2012.info, Node: 9.1, Next: 9.2, Up: 9
===============================
1
-A task unit is declared by a task declaration, which has a corresponding
-task_body. A task declaration may be a task_type_declaration, in which
-case it declares a named task type; alternatively, it may be a
-single_task_declaration, in which case it defines an anonymous task
-type, as well as declaring a named task object of that type.
+A task unit is declared by a <task declaration>, which has a
+corresponding task_body. A task declaration may be a
+task_type_declaration, in which case it declares a named task type;
+alternatively, it may be a single_task_declaration, in which case it
+defines an anonymous task type, as well as declaring a named task object
+of that type.
_Syntax_
2/3
- {AI95-00345-01AI95-00345-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00345-01AI95-00345-01>} {<AI05-0183-1AI05-0183-1>}
task_type_declaration ::=
task type defining_identifier [known_discriminant_part]
[aspect_specification] [is
@@ -42929,7 +43083,7 @@ type, as well as declaring a named task object of that
type.
task_definition];
3/3
- {AI95-00399-01AI95-00399-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00399-01AI95-00399-01>} {<AI05-0183-1AI05-0183-1>}
single_task_declaration ::=
task defining_identifier
[aspect_specification][is
@@ -42941,34 +43095,34 @@ type, as well as declaring a named task object of
that type.
{task_item}
[ private
{task_item}]
- end [task_identifier]
+ end [<task_>identifier]
5/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} task_item ::=
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} task_item ::=
entry_declaration | aspect_clause
6/3
- {AI05-0267-1AI05-0267-1} task_body ::=
+ {<AI05-0267-1AI05-0267-1>} task_body ::=
task body defining_identifier
[aspect_specification] is
declarative_part
begin
handled_sequence_of_statements
- end [task_identifier];
+ end [<task_>identifier];
7
- If a task_identifier appears at the end of a task_definition or
+ If a <task_>identifier appears at the end of a task_definition or
task_body, it shall repeat the defining_identifier.
8.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
-Paragraph 8 was deleted.
+<Paragraph 8 was deleted.>
_Static Semantics_
9
-A task_definition defines a task type and its first subtype. The first
+A task_definition defines a task type and its first subtype. The first
list of task_items of a task_definition (*note 9.1: S0207.), together
with the known_discriminant_part (*note 3.7: S0061.), if any, is called
the visible part of the task unit. [ The optional list of task_items
@@ -42976,40 +43130,41 @@ after the reserved word private is called the private
part of the task
unit.]
9.a/3
- Proof: {AI05-0299-1AI05-0299-1} Private part is defined in
+ Proof: {<AI05-0299-1AI05-0299-1>} Private part is defined in
Clause *note 8::.
9.1/1
-{8652/00298652/0029} {AI95-00116-01AI95-00116-01} For a task declaration
-without a task_definition, a task_definition without task_items is
-assumed.
+{<8652/00298652/0029>} {<AI95-00116-01AI95-00116-01>} For a task
+declaration without a task_definition, a task_definition without
+task_items is assumed.
9.2/3
-{AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01}
-{AI95-00399-01AI95-00399-01} {AI95-00419-01AI95-00419-01}
-{AI05-0042-1AI05-0042-1} For a task declaration with an interface_list,
-the task type inherits user-defined primitive subprograms from each
-progenitor type (see *note 3.9.4::), in the same way that a derived type
-inherits user-defined primitive subprograms from its progenitor types
-(see *note 3.4::). If the first parameter of a primitive inherited
-subprogram is of the task type or an access parameter designating the
-task type, and there is an entry_declaration for a single entry with the
-same identifier within the task declaration, whose profile is type
-conformant with the prefixed view profile of the inherited subprogram,
-the inherited subprogram is said to be implemented by the conforming
-task entry using an implicitly declared nonabstract subprogram which has
-the same profile as the inherited subprogram and which overrides it.
+{<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>}
+{<AI95-00399-01AI95-00399-01>} {<AI95-00419-01AI95-00419-01>}
+{<AI05-0042-1AI05-0042-1>} For a task declaration with an
+interface_list, the task type inherits user-defined primitive
+subprograms from each progenitor type (see *note 3.9.4::), in the same
+way that a derived type inherits user-defined primitive subprograms from
+its progenitor types (see *note 3.4::). If the first parameter of a
+primitive inherited subprogram is of the task type or an access
+parameter designating the task type, and there is an entry_declaration
+for a single entry with the same identifier within the task declaration,
+whose profile is type conformant with the prefixed view profile of the
+inherited subprogram, the inherited subprogram is said to be
+<implemented> by the conforming task entry using an implicitly declared
+nonabstract subprogram which has the same profile as the inherited
+subprogram and which overrides it.
9.b/2
Ramification: The inherited subprograms can only come from an
interface given as part of the task declaration.
9.b.1/3
- Reason: {AI05-0042-1AI05-0042-1} The part about the implicitly
- declared subprogram is needed so that a subprogram implemented
- by an entry is considered to be overridden for the purpose of
- the other rules of the language. Without it, it would for
- instance be illegal for an abstract subprogram to be
+ Reason: {<AI05-0042-1AI05-0042-1>} The part about the
+ implicitly declared subprogram is needed so that a subprogram
+ implemented by an entry is considered to be overridden for the
+ purpose of the other rules of the language. Without it, it
+ would for instance be illegal for an abstract subprogram to be
implemented by an entry, because the abstract subprogram would
not be overridden. The Legality Rules below ensure that there
is no conflict between the implicit overriding subprogram and
@@ -43018,19 +43173,19 @@ the same profile as the inherited subprogram and
which overrides it.
_Legality Rules_
9.3/2
-{AI95-00345-01AI95-00345-01} A task declaration requires a completion[,
-which shall be a task_body,] and every task_body shall be the completion
-of some task declaration.
+{<AI95-00345-01AI95-00345-01>} A task declaration requires a
+completion[, which shall be a task_body,] and every task_body shall be
+the completion of some task declaration.
9.c/3
- To be honest: {AI05-0229-1AI05-0229-1} If the implementation
+ To be honest: {<AI05-0229-1AI05-0229-1>} If the implementation
supports it, the task body can be imported (using aspect
Import, see *note B.1::), in which case no explicit task_body
is allowed.
9.4/2
-{AI95-00345-01AI95-00345-01} {AI95-00399-01AI95-00399-01} [Each
-interface_subtype_mark of an interface_list appearing within a task
+{<AI95-00345-01AI95-00345-01>} {<AI95-00399-01AI95-00399-01>} [Each
+<interface_>subtype_mark of an interface_list appearing within a task
declaration shall denote a limited interface type that is not a
protected interface.]
@@ -43043,10 +43198,10 @@ protected interface.]
offer operations that a task does not have.
9.5/3
-{AI95-00397-01AI95-00397-01} {AI05-0090-1AI05-0090-1} The prefixed view
-profile of an explicitly declared primitive subprogram of a tagged task
-type shall not be type conformant with any entry of the task type, if
-the subprogram has the same defining name as the entry and the first
+{<AI95-00397-01AI95-00397-01>} {<AI05-0090-1AI05-0090-1>} The prefixed
+view profile of an explicitly declared primitive subprogram of a tagged
+task type shall not be type conformant with any entry of the task type,
+if the subprogram has the same defining name as the entry and the first
parameter of the subprogram is of the task type or is an access
parameter designating the task type.
@@ -43063,32 +43218,31 @@ parameter designating the task type.
would be incompatible with Ada 95.
9.6/2
-{AI95-00345-01AI95-00345-01} {AI95-00399-01AI95-00399-01} For each
+{<AI95-00345-01AI95-00345-01>} {<AI95-00399-01AI95-00399-01>} For each
primitive subprogram inherited by the type declared by a task
declaration, at most one of the following shall apply:
9.7/2
- * {AI95-00345-01AI95-00345-01} the inherited subprogram is overridden
- with a primitive subprogram of the task type, in which case the
- overriding subprogram shall be subtype conformant with the
+ * {<AI95-00345-01AI95-00345-01>} the inherited subprogram is
+ overridden with a primitive subprogram of the task type, in which
+ case the overriding subprogram shall be subtype conformant with the
inherited subprogram and not abstract; or
9.8/2
- * {AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01} the
+ * {<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>} the
inherited subprogram is implemented by a single entry of the task
type; in which case its prefixed view profile shall be subtype
- conformant with that of the task entry.
+ conformant with that of the task entry.
9.f/2
Ramification: An entry may implement two subprograms from the
- ancestors, one whose first parameter is of type T and one
- whose first parameter is of type access T. That doesn't cause
- implementation problems because "implemented by" (unlike
+ ancestors, one whose first parameter is of type <T> and one
+ whose first parameter is of type access <T>. That doesn't
+ cause implementation problems because "implemented by" (unlike
"overridden') probably entails the creation of wrappers.
9.9/2
-If neither applies, the inherited subprogram shall be a null procedure.
-In addition to the places where Legality Rules normally apply (see *note
+If neither applies, the inherited subprogram shall be a null procedure.In
addition to the places where Legality Rules normally apply (see *note
12.3::), these rules also apply in the private part of an instance of a
generic unit.
@@ -43101,8 +43255,7 @@ generic unit.
_Dynamic Semantics_
10
-[ The elaboration of a task declaration elaborates the task_definition.
-The elaboration of a single_task_declaration (*note 9.1: S0206.) also
+[ The elaboration of a task declaration elaborates the task_definition.The
elaboration of a single_task_declaration (*note 9.1: S0206.) also
creates an object of an (anonymous) task type.]
10.a
@@ -43116,7 +43269,7 @@ first subtype;] it also includes the elaboration of the
entry_declarations in the given order.
12/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} As part of the
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} As part of the
initialization of a task object, any aspect_clauses and any per-object
constraints associated with entry_declaration (*note 9.5.2: S0218.)s of
the corresponding task_definition (*note 9.1: S0207.) are elaborated in
@@ -43164,14 +43317,15 @@ The content of a task object of a given task type
includes:
NOTES
19/2
- 2 {AI95-00382-01AI95-00382-01} Other than in an access_definition,
- the name of a task unit within the declaration or body of the task
- unit denotes the current instance of the unit (see *note 8.6::),
- rather than the first subtype of the corresponding task type (and
- thus the name cannot be used as a subtype_mark).
+ 2 {<AI95-00382-01AI95-00382-01>} Other than in an
+ access_definition, the name of a task unit within the declaration
+ or body of the task unit denotes the current instance of the unit
+ (see *note 8.6::), rather than the first subtype of the
+ corresponding task type (and thus the name cannot be used as a
+ subtype_mark).
19.a/2
- Discussion: {AI95-00382-01AI95-00382-01} It can be used as a
+ Discussion: {<AI95-00382-01AI95-00382-01>} It can be used as a
subtype_mark in an anonymous access type. In addition, it is
possible to refer to some other subtype of the task type
within its body, presuming such a subtype has been declared
@@ -43184,20 +43338,21 @@ The content of a task object of a given task type
includes:
corresponding discriminant of the current instance of the unit.
21/2
- 4 {AI95-00287-01AI95-00287-01} A task type is a limited type (see
- *note 7.5::), and hence precludes use of assignment_statements and
- predefined equality operators. If an application needs to store
- and exchange task identities, it can do so by defining an access
- type designating the corresponding task objects and by using access
- values for identification purposes. Assignment is available for
- such an access type as for any access type. Alternatively, if the
- implementation supports the Systems Programming Annex, the Identity
- attribute can be used for task identification (see *note C.7.1::).
+ 4 {<AI95-00287-01AI95-00287-01>} A task type is a limited type
+ (see *note 7.5::), and hence precludes use of assignment_statements
+ and predefined equality operators. If an application needs to
+ store and exchange task identities, it can do so by defining an
+ access type designating the corresponding task objects and by using
+ access values for identification purposes. Assignment is available
+ for such an access type as for any access type. Alternatively, if
+ the implementation supports the Systems Programming Annex, the
+ Identity attribute can be used for task identification (see *note
+ C.7.1::).
_Examples_
22
-Examples of declarations of task types:
+<Examples of declarations of task types:>
23
task type Server is
@@ -43206,18 +43361,18 @@ Examples of declarations of task types:
end Server;
24/2
- {AI95-00433-01AI95-00433-01} task type Keyboard_Driver(ID : Keyboard_ID
:= New_ID) is
- new Serial_Device with -- see *note 3.9.4::
+ {<AI95-00433-01AI95-00433-01>} task type Keyboard_Driver(ID : Keyboard_ID
:= New_ID) is
+ new Serial_Device with --< see *note 3.9.4::>
entry Read (C : out Character);
entry Write(C : in Character);
end Keyboard_Driver;
25
-Examples of declarations of single tasks:
+<Examples of declarations of single tasks:>
26
task Controller is
- entry Request(Level)(D : Item); -- a family of entries
+ entry Request(Level)(D : Item); --< a family of entries>
end Controller;
27
@@ -43227,10 +43382,10 @@ Examples of declarations of single tasks:
end;
28
- task User; -- has no entries
+ task User; --< has no entries>
29
-Examples of task objects:
+<Examples of task objects:>
30
Agent : Server;
@@ -43238,7 +43393,7 @@ Examples of task objects:
Pool : array(1 .. 10) of Keyboard_Driver;
31
-Example of access type designating task objects:
+<Example of access type designating task objects:>
32
type Keyboard is access Keyboard_Driver;
@@ -43274,9 +43429,9 @@ Example of access type designating task objects:
_Extensions to Ada 95_
32.e/2
- {AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01}
- {AI95-00399-01AI95-00399-01} {AI95-00419-01AI95-00419-01} Task
- types and single tasks can be derived from one or more
+ {<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>}
+ {<AI95-00399-01AI95-00399-01>} {<AI95-00419-01AI95-00419-01>}
+ Task types and single tasks can be derived from one or more
interfaces. Entries of the task type can implement the
primitive operations of an interface. Overriding_indicators
can be used to specify whether or not an entry implements a
@@ -43285,42 +43440,43 @@ Example of access type designating task objects:
_Wording Changes from Ada 95_
32.f/2
- {8652/00298652/0029} {AI95-00116-01AI95-00116-01} Corrigendum:
- Clarified that a task type has an implicit empty
+ {<8652/00298652/0029>} {<AI95-00116-01AI95-00116-01>}
+ Corrigendum: Clarified that a task type has an implicit empty
task_definition if none is given.
32.g/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Changed representation clauses to aspect clauses to reflect
- that they are used for more than just representation.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Changed representation clauses to aspect clauses
+ to reflect that they are used for more than just
+ representation.
32.h/2
- {AI95-00287-01AI95-00287-01} Revised the note on operations of
- task types to reflect that limited types do have an assignment
- operation, but not copying (assignment_statements).
+ {<AI95-00287-01AI95-00287-01>} Revised the note on operations
+ of task types to reflect that limited types do have an
+ assignment operation, but not copying (assignment_statements).
32.i/2
- {AI95-00382-01AI95-00382-01} Revised the note on use of the
+ {<AI95-00382-01AI95-00382-01>} Revised the note on use of the
name of a task type within itself to reflect the exception for
anonymous access types.
_Extensions to Ada 2005_
32.j/3
- {AI05-0183-1AI05-0183-1} {AI05-0267-1AI05-0267-1} An optional
- aspect_specification can be used in a task_type_declaration, a
- single_task_declaration, and a task_body. This is described
- in *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} {<AI05-0267-1AI05-0267-1>} An
+ optional aspect_specification can be used in a
+ task_type_declaration, a single_task_declaration, and a
+ task_body. This is described in *note 13.1.1::.
_Wording Changes from Ada 2005_
32.k/3
- {AI05-0042-1AI05-0042-1} Correction: Clarified that an
+ {<AI05-0042-1AI05-0042-1>} Correction: Clarified that an
inherited procedure of a progenitor is overridden when it is
implemented by an entry.
32.l/3
- {AI05-0090-1AI05-0090-1} Correction: Added the missing
+ {<AI05-0090-1AI05-0090-1>} Correction: Added the missing
defining name in the no conflicting primitive operation rule.
@@ -43333,14 +43489,14 @@ File: aarm2012.info, Node: 9.2, Next: 9.3, Prev:
9.1, Up: 9
1
The execution of a task of a given task type consists of the execution
-of the corresponding task_body. The initial part of this execution is
-called the activation of the task; it consists of the elaboration of the
-declarative_part of the task_body. Should an exception be propagated by
-the elaboration of its declarative_part, the activation of the task is
-defined to have failed, and it becomes a completed task.
+of the corresponding task_body. The initial part of this execution is
+called the <activation> of the task; it consists of the elaboration of
+the declarative_part of the task_body. Should an exception be
+propagated by the elaboration of its declarative_part, the activation of
+the task is defined to have <failed>, and it becomes a completed task.
2/2
-{AI95-00416-01AI95-00416-01} A task object (which represents one task)
+{<AI95-00416-01AI95-00416-01>} A task object (which represents one task)
can be a part of a stand-alone object, of an object created by an
allocator, or of an anonymous object of a limited type, or a coextension
of one of these. All tasks that are part or coextensions of any of the
@@ -43356,11 +43512,11 @@ stand-alone object are activated together.
that contain tasks. For example, the default expression for a
subcomponent of an object created by an allocator might call a
function that evaluates a completely different allocator.
- Tasks created by the two allocators are not activated
+ Tasks created by the two allocators are <not> activated
together.
3/2
-{AI95-00416-01AI95-00416-01} For the tasks of a given declarative
+{<AI95-00416-01AI95-00416-01>} For the tasks of a given declarative
region, the activations are initiated within the context of the
handled_sequence_of_statements (*note 11.2: S0265.) (and its associated
exception_handler (*note 11.2: S0266.)s if any -- see *note 11.2::),
@@ -43376,8 +43532,8 @@ assumed, as defined in *note 7.2::.]
S0265.).
4/2
-{AI95-00416-01AI95-00416-01} For tasks that are part or coextensions of
-a single object that is not a stand-alone object, activations are
+{<AI95-00416-01AI95-00416-01>} For tasks that are part or coextensions
+of a single object that is not a stand-alone object, activations are
initiated after completing any initialization of the outermost object
enclosing these tasks, prior to performing any other operation on the
outermost object. In particular, for tasks that are part or
@@ -43388,7 +43544,7 @@ part or coextensions of an object that is the result of
a function call,
the activations are not initiated until after the function returns.
4.a/2
- Discussion: {AI95-00416-01AI95-00416-01} The intent is that
+ Discussion: {<AI95-00416-01AI95-00416-01>} The intent is that
"temporary" objects with task parts (or coextensions) are
treated similarly to an object created by an allocator. The
"whole" object is initialized, and then all of the task parts
@@ -43399,8 +43555,8 @@ the activations are not initiated until after the
function returns.
5
The task that created the new tasks and initiated their activations (the
-activator) is blocked until all of these activations complete
-(successfully or not). Once all of these activations are complete, if
+<activator>) is blocked until all of these activations complete
+(successfully or not). Once all of these activations are complete, if
the activation of any of the tasks has failed [(due to the propagation
of an exception)], Tasking_Error is raised in the activator, at the
place at which it initiated the activations. Otherwise, the activator
@@ -43419,30 +43575,30 @@ raise Tasking_Error.
more of the tasks being activated fail their activation.
5.c/2
- To be honest: {AI95-00265-01AI95-00265-01} The pragma
+ To be honest: {<AI95-00265-01AI95-00265-01>} The pragma
Partition_Elaboration_Policy (see *note H.6::) can be used to
defer task activation to a later point, thus changing many of
these rules.
6/3
-{AI05-0045-1AI05-0045-1} If the master that directly encloses the point
-where the activation of a task T would be initiated, completes before
-the activation of T is initiated, T becomes terminated and is never
-activated. Furthermore, if a return statement is left such that the
-return object is not returned to the caller, any task that was created
-as a part of the return object or one of its coextensions immediately
-becomes terminated and is never activated.
+{<AI05-0045-1AI05-0045-1>} If the master that directly encloses the
+point where the activation of a task <T> would be initiated, completes
+before the activation of <T> is initiated, <T> becomes terminated and is
+never activated. Furthermore, if a return statement is left such that
+the return object is not returned to the caller, any task that was
+created as a part of the return object or one of its coextensions
+immediately becomes terminated and is never activated.
6.a/3
- Ramification: {AI05-0045-1AI05-0045-1} The first case can only
- happen if the activation point of T is not reached due to an
- exception being raised or a task or statement being aborted.
- Note that this is exclusive; if the master completes normally
- and starts finalization, we're already past the activation
- point.
+ Ramification: {<AI05-0045-1AI05-0045-1>} The first case can
+ only happen if the activation point of T is not reached due to
+ an exception being raised or a task or statement being
+ aborted. Note that this is exclusive; if the master completes
+ normally and starts finalization, we're already past the
+ activation point.
6.b/3
- {AI05-0045-1AI05-0045-1} The second case can happen with an
+ {<AI05-0045-1AI05-0045-1>} The second case can happen with an
exception being raised in a return statement, by an exit or
goto from an extended_return_statement, or by a return
statement being aborted. Any tasks created for the return
@@ -43466,34 +43622,34 @@ becomes terminated and is never activated.
_Examples_
10
-Example of task activation:
+<Example of task activation:>
11
procedure P is
- A, B : Server; -- elaborate the task objects A, B
- C : Server; -- elaborate the task object C
+ A, B : Server; --< elaborate the task objects A, B>
+ C : Server; --< elaborate the task object C>
begin
- -- the tasks A, B, C are activated together before the first statement
+ --< the tasks A, B, C are activated together before the first
statement>
...
end;
_Wording Changes from Ada 83_
11.a
- We have replaced the term suspended with blocked, since we
+ We have replaced the term <suspended> with <blocked>, since we
didn't want to consider a task blocked when it was simply
competing for execution resources. "Suspended" is sometimes
used more generally to refer to tasks that are not actually
running on some processor, due to the lack of resources.
11.b/3
- {AI05-0299-1AI05-0299-1} This subclause has been rewritten in
- an attempt to improve presentation.
+ {<AI05-0299-1AI05-0299-1>} This subclause has been rewritten
+ in an attempt to improve presentation.
_Wording Changes from Ada 95_
11.c/2
- {AI95-00416-01AI95-00416-01} Adjusted the wording for
+ {<AI95-00416-01AI95-00416-01>} Adjusted the wording for
activating tasks to handle the case of anonymous function
return objects. This is critical; we don't want to be waiting
for the tasks in a return object when we exit the function
@@ -43502,7 +43658,7 @@ Example of task activation:
_Wording Changes from Ada 2005_
11.d/3
- {AI05-0045-1AI05-0045-1} Correction: Corrected the wording
+ {<AI05-0045-1AI05-0045-1>} Correction: Corrected the wording
that handles tasks that are never activated to ensure that no
lookahead is implied and to make it clear that tasks created
by return statements that never return are never activated.
@@ -43516,11 +43672,11 @@ File: aarm2012.info, Node: 9.3, Next: 9.4, Prev:
9.2, Up: 9
_Dynamic Semantics_
1
-Each task (other than an environment task -- see *note 10.2::) depends
+Each task (other than an environment task -- see *note 10.2::) <depends>
on one or more masters (see *note 7.6.1::), as follows:
2/4
- * {AI12-0070-1AI12-0070-1} If the task is created by the evaluation
+ * {<AI12-0070-1AI12-0070-1>} If the task is created by the evaluation
of an allocator for a given named access type, it depends on each
master that includes the elaboration of the declaration of the
ultimate ancestor of the given access type.
@@ -43530,14 +43686,14 @@ on one or more masters (see *note 7.6.1::), as
follows:
it depends on each master that includes this elaboration.
3.1/2
- * {AI95-00416-01AI95-00416-01} Otherwise, the task depends on the
+ * {<AI95-00416-01AI95-00416-01>} Otherwise, the task depends on the
master of the outermost object of which it is a part (as determined
by the accessibility level of that object -- see *note 3.10.2:: and
*note 7.6.1::), as well as on any master whose execution includes
that of the master of the outermost object.
3.a/2
- Ramification: {AI95-00416-01AI95-00416-01} The master of a
+ Ramification: {<AI95-00416-01AI95-00416-01>} The master of a
task created by a return statement changes when the
accessibility of the return object changes. Note that its
activation happens, if at all, only after the function returns
@@ -43554,12 +43710,12 @@ master of that task.
"*note 10.1.1:: Compilation Units - Library Units".
5
-A task is said to be completed when the execution of its corresponding
-task_body is completed. A task is said to be terminated when any
+A task is said to be <completed> when the execution of its corresponding
+task_body is completed. A task is said to be <terminated> when any
finalization of the task_body has been performed (see *note 7.6.1::).
[The first step of finalizing a master (including a task_body) is to
-wait for the termination of any tasks dependent on the master.] The task
-executing the master is blocked until all the dependents have
+wait for the termination of any tasks dependent on the master.] The
+task executing the master is blocked until all the dependents have
terminated. [Any remaining finalization is then performed and the
master is left.]
@@ -43571,7 +43727,7 @@ terminate_alternative is selected if and only if the
following
conditions are satisfied:
7/2
- * {AI95-00415-01AI95-00415-01} The task depends on some completed
+ * {<AI95-00415-01AI95-00415-01>} The task depends on some completed
master; and
8
@@ -43634,27 +43790,27 @@ that are not yet completed.
_Examples_
19
-Example of task dependence:
+<Example of task dependence:>
20
declare
- type Global is access Server; -- see *note 9.1::
+ type Global is access Server; --< see *note 9.1::>
A, B : Server;
G : Global;
begin
- -- activation of A and B
+ --< activation of A and B>
declare
type Local is access Server;
- X : Global := new Server; -- activation of X.all
- L : Local := new Server; -- activation of L.all
+ X : Global := new Server; --< activation of X.all>
+ L : Local := new Server; --< activation of L.all>
C : Server;
begin
- -- activation of C
- G := X; -- both G and X designate the same task object
+ --< activation of C>
+ G := X; --< both G and X designate the same task object>
...
- end; -- await termination of C and L.all (but not X.all)
+ end; --< await termination of C and L.all (but not X.all)>
...
- end; -- await termination of A, B, and G.all
+ end; --< await termination of A, B, and G.all>
_Wording Changes from Ada 83_
@@ -43681,16 +43837,16 @@ Example of task dependence:
_Wording Changes from Ada 95_
20.d/2
- {AI95-00416-01AI95-00416-01} Added missing wording that
+ {<AI95-00416-01AI95-00416-01>} Added missing wording that
explained the master of tasks that are neither
object_declarations nor allocators, such as function returns.
_Wording Changes from Ada 2012_
20.e/4
- {AI12-0070-1AI12-0070-1} Corrigendum: Ensured that the master
- of tasks that are not allocators of named access types is
- correctly determined. (Ignoring the accessibility rules of
+ {<AI12-0070-1AI12-0070-1>} Corrigendum: Ensured that the
+ master of tasks that are not allocators of named access types
+ is correctly determined. (Ignoring the accessibility rules of
*note 3.10.2:: could not be intended.)
@@ -43700,20 +43856,20 @@ File: aarm2012.info, Node: 9.4, Next: 9.5, Prev:
9.3, Up: 9
=========================================
1
-A protected object provides coordinated access to shared data, through
-calls on its visible protected operations, which can be protected
-subprograms or protected entries. A protected unit is declared by a
-protected declaration, which has a corresponding protected_body. A
+A <protected object> provides coordinated access to shared data, through
+calls on its visible <protected operations>, which can be <protected
+subprograms> or <protected entries>. A <protected unit> is declared by
+a <protected declaration>, which has a corresponding protected_body. A
protected declaration may be a protected_type_declaration, in which case
it declares a named protected type; alternatively, it may be a
single_protected_declaration, in which case it defines an anonymous
protected type, as well as declaring a named protected object of that
-type.
+type.
_Syntax_
2/3
- {AI95-00345-01AI95-00345-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00345-01AI95-00345-01>} {<AI05-0183-1AI05-0183-1>}
protected_type_declaration ::=
protected type defining_identifier [known_discriminant_part]
[aspect_specification] is
@@ -43721,7 +43877,7 @@ type.
protected_definition;
3/3
- {AI95-00399-01AI95-00399-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00399-01AI95-00399-01>} {<AI05-0183-1AI05-0183-1>}
single_protected_declaration ::=
protected defining_identifier
[aspect_specification] is
@@ -43733,10 +43889,10 @@ type.
{ protected_operation_declaration }
[ private
{ protected_element_declaration } ]
- end [protected_identifier]
+ end [<protected_>identifier]
5/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
protected_operation_declaration ::= subprogram_declaration
| entry_declaration
| aspect_clause
@@ -43752,15 +43908,15 @@ type.
items inside declarative_parts and task_definitions as well.
7/3
- {AI05-0267-1AI05-0267-1} protected_body ::=
+ {<AI05-0267-1AI05-0267-1>} protected_body ::=
protected body defining_identifier
[aspect_specification] is
{ protected_operation_item }
- end [protected_identifier];
+ end [<protected_>identifier];
8/4
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- {AI12-0147-1AI12-0147-1} protected_operation_item ::=
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ {<AI12-0147-1AI12-0147-1>} protected_operation_item ::=
subprogram_declaration
| subprogram_body
| null_procedure_declaration
@@ -43769,21 +43925,21 @@ type.
| aspect_clause
9
- If a protected_identifier appears at the end of a
+ If a <protected_>identifier appears at the end of a
protected_definition or protected_body, it shall repeat the
defining_identifier.
10.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
-Paragraph 10 was deleted.
+<Paragraph 10 was deleted.>
_Static Semantics_
11/2
-{AI95-00345-01AI95-00345-01} {AI95-00401-01AI95-00401-01} A
-protected_definition defines a protected type and its first subtype. The
-list of protected_operation_declaration (*note 9.4: S0213.)s of a
+{<AI95-00345-01AI95-00345-01>} {<AI95-00401-01AI95-00401-01>} A
+protected_definition defines a protected type and its first subtype.
+The list of protected_operation_declaration (*note 9.4: S0213.)s of a
protected_definition (*note 9.4: S0212.), together with the
known_discriminant_part (*note 3.7: S0061.), if any, is called the
visible part of the protected unit. [ The optional list of
@@ -43791,13 +43947,13 @@ protected_element_declaration (*note 9.4: S0214.)s
after the reserved
word private is called the private part of the protected unit.]
11.a/3
- Proof: {AI05-0299-1AI05-0299-1} Private part is defined in
+ Proof: {<AI05-0299-1AI05-0299-1>} Private part is defined in
Clause *note 8::.
11.1/3
-{AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01}
-{AI95-00399-01AI95-00399-01} {AI95-00419-01AI95-00419-01}
-{AI05-0042-1AI05-0042-1} For a protected declaration with an
+{<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>}
+{<AI95-00399-01AI95-00399-01>} {<AI95-00419-01AI95-00419-01>}
+{<AI05-0042-1AI05-0042-1>} For a protected declaration with an
interface_list, the protected type inherits user-defined primitive
subprograms from each progenitor type (see *note 3.9.4::), in the same
way that a derived type inherits user-defined primitive subprograms from
@@ -43807,45 +43963,46 @@ parameter designating the protected type, and there
is a
protected_operation_declaration for a protected subprogram or single
entry with the same identifier within the protected declaration, whose
profile is type conformant with the prefixed view profile of the
-inherited subprogram, the inherited subprogram is said to be implemented
-by the conforming protected subprogram or entry using an implicitly
-declared nonabstract subprogram which has the same profile as the
-inherited subprogram and which overrides it.
+inherited subprogram, the inherited subprogram is said to be
+<implemented> by the conforming protected subprogram or entry using an
+implicitly declared nonabstract subprogram which has the same profile as
+the inherited subprogram and which overrides it.
11.b/2
Ramification: The inherited subprograms can only come from an
interface given as part of the protected declaration.
11.b.1/3
- Reason: {AI05-0042-1AI05-0042-1} The part about the implicitly
- declared subprogram is needed so that a subprogram implemented
- by an entry or subprogram is considered to be overridden for
- the purpose of the other rules of the language. Without it,
- it would for instance be illegal for an abstract subprogram to
- be implemented by an entry, because the abstract subprogram
- would not be overridden. The Legality Rules below ensure that
- there is no conflict between the implicit overriding
- subprogram and a user-defined overriding subprogram.
+ Reason: {<AI05-0042-1AI05-0042-1>} The part about the
+ implicitly declared subprogram is needed so that a subprogram
+ implemented by an entry or subprogram is considered to be
+ overridden for the purpose of the other rules of the language.
+ Without it, it would for instance be illegal for an abstract
+ subprogram to be implemented by an entry, because the abstract
+ subprogram would not be overridden. The Legality Rules below
+ ensure that there is no conflict between the implicit
+ overriding subprogram and a user-defined overriding
+ subprogram.
_Legality Rules_
11.2/2
-{AI95-00345-01AI95-00345-01} A protected declaration requires a
+{<AI95-00345-01AI95-00345-01>} A protected declaration requires a
completion[, which shall be a protected_body (*note 9.4: S0215.),] and
every protected_body (*note 9.4: S0215.) shall be the completion of some
protected declaration.
11.c/3
- To be honest: {AI05-0229-1AI05-0229-1} If the implementation
+ To be honest: {<AI05-0229-1AI05-0229-1>} If the implementation
supports it, the protected body can be imported (using aspect
Import, see *note B.1::), in which case no explicit
protected_body is allowed.
11.3/2
-{AI95-00345-01AI95-00345-01} {AI95-00399-01AI95-00399-01} [Each
-interface_subtype_mark of an interface_list appearing within a protected
-declaration shall denote a limited interface type that is not a task
-interface.]
+{<AI95-00345-01AI95-00345-01>} {<AI95-00399-01AI95-00399-01>} [Each
+<interface_>subtype_mark of an interface_list appearing within a
+protected declaration shall denote a limited interface type that is not
+a task interface.]
11.d/2
Proof: *note 3.9.4:: requires that an interface_list only name
@@ -43856,8 +44013,8 @@ interface.]
operations that a protected type does not have.
11.4/3
-{AI95-00397-01AI95-00397-01} {AI05-0042-1AI05-0042-1} The prefixed view
-profile of an explicitly declared primitive subprogram of a tagged
+{<AI95-00397-01AI95-00397-01>} {<AI05-0042-1AI05-0042-1>} The prefixed
+view profile of an explicitly declared primitive subprogram of a tagged
protected type shall not be type conformant with any protected operation
of the protected type, if the subprogram has the same defining name as
the protected operation and the first parameter of the subprogram is of
@@ -43877,26 +44034,25 @@ type.
protected types would be incompatible with Ada 95.
11.5/2
-{AI95-00345-01AI95-00345-01} {AI95-00399-01AI95-00399-01} For each
+{<AI95-00345-01AI95-00345-01>} {<AI95-00399-01AI95-00399-01>} For each
primitive subprogram inherited by the type declared by a protected
declaration, at most one of the following shall apply:
11.6/2
- * {AI95-00345-01AI95-00345-01} the inherited subprogram is overridden
- with a primitive subprogram of the protected type, in which case
- the overriding subprogram shall be subtype conformant with the
- inherited subprogram and not abstract; or
+ * {<AI95-00345-01AI95-00345-01>} the inherited subprogram is
+ overridden with a primitive subprogram of the protected type, in
+ which case the overriding subprogram shall be subtype conformant
+ with the inherited subprogram and not abstract; or
11.7/2
- * {AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01} the
+ * {<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>} the
inherited subprogram is implemented by a protected subprogram or
single entry of the protected type, in which case its prefixed view
profile shall be subtype conformant with that of the protected
- subprogram or entry.
+ subprogram or entry.
11.8/2
-If neither applies, the inherited subprogram shall be a null procedure.
-In addition to the places where Legality Rules normally apply (see *note
+If neither applies, the inherited subprogram shall be a null procedure.In
addition to the places where Legality Rules normally apply (see *note
12.3::), these rules also apply in the private part of an instance of a
generic unit.
@@ -43908,13 +44064,13 @@ generic unit.
procedure.
11.9/3
-{AI95-00345-01AI95-00345-01} {AI05-0291-1AI05-0291-1} If an inherited
-subprogram is implemented by a protected procedure or an entry, then the
-first parameter of the inherited subprogram shall be of mode out or in
-out, or an access-to-variable parameter. If an inherited subprogram is
-implemented by a protected function, then the first parameter of the
-inherited subprogram shall be of mode in, but not an access-to-variable
-parameter.
+{<AI95-00345-01AI95-00345-01>} {<AI05-0291-1AI05-0291-1>} If an
+inherited subprogram is implemented by a protected procedure or an
+entry, then the first parameter of the inherited subprogram shall be of
+mode out or in out, or an access-to-variable parameter. If an inherited
+subprogram is implemented by a protected function, then the first
+parameter of the inherited subprogram shall be of mode in, but not an
+access-to-variable parameter.
11.g/3
Reason: For a protected procedure or entry, the protected
@@ -43926,7 +44082,7 @@ parameter.
reflect that.
11.10/2
-{AI95-00397-01AI95-00397-01} If a protected subprogram declaration has
+{<AI95-00397-01AI95-00397-01>} If a protected subprogram declaration has
an overriding_indicator, then at the point of the declaration:
11.11/2
@@ -43955,7 +44111,7 @@ generic unit.
12
[The elaboration of a protected declaration elaborates the
-protected_definition. The elaboration of a single_protected_declaration
+protected_definition. The elaboration of a single_protected_declaration
(*note 9.4: S0211.) also creates an object of an (anonymous) protected
type.]
@@ -43996,9 +44152,9 @@ The content of an object of a given protected type
includes:
single entry, plus one for each entry of each entry family.
18
- * A representation of the state of the execution resource associated
- with the protected object (one such resource is associated with
- each protected object).
+ * A representation of the state of the execution resource
+ <associated> with the protected object (one such resource is
+ associated with each protected object).
19
[The execution resource associated with a protected object has to be
@@ -44008,7 +44164,7 @@ either for concurrent read-only access, or for
exclusive read-write
access.]
20
-As the first step of the finalization of a protected object, each call
+As the first step of the <finalization> of a protected object, each call
remaining on any entry queue of the object is removed from its queue and
Program_Error is raised at the place of the corresponding
entry_call_statement (*note 9.5.3: S0225.).
@@ -44050,7 +44206,7 @@ entry_call_statement (*note 9.5.3: S0225.).
end Main;
20.e/3
- {AI05-0005-1AI05-0005-1} The environment task is queued on
+ {<AI05-0005-1AI05-0005-1>} The environment task is queued on
PO.Ee when PO is finalized.
20.f
@@ -44061,7 +44217,7 @@ entry_call_statement (*note 9.5.3: S0225.).
_Bounded (Run-Time) Errors_
20.1/2
-{AI95-00280-01AI95-00280-01} It is a bounded error to call an entry or
+{<AI95-00280-01AI95-00280-01>} It is a bounded error to call an entry or
subprogram of a protected object after that object is finalized. If the
error is detected, Program_Error is raised. Otherwise, the call
proceeds normally, which may leave a task queued forever.
@@ -44124,15 +44280,15 @@ proceeds normally, which may leave a task queued
forever.
NOTES
21/2
- 13 {AI95-00382-01AI95-00382-01} Within the declaration or body of
- a protected unit other than in an access_definition, the name of
+ 13 {<AI95-00382-01AI95-00382-01>} Within the declaration or body
+ of a protected unit other than in an access_definition, the name of
the protected unit denotes the current instance of the unit (see
*note 8.6::), rather than the first subtype of the corresponding
protected type (and thus the name cannot be used as a
subtype_mark).
21.a/2
- Discussion: {AI95-00382-01AI95-00382-01} It can be used as a
+ Discussion: {<AI95-00382-01AI95-00382-01>} It can be used as a
subtype_mark in an anonymous access type. In addition, it is
possible to refer to some other subtype of the protected type
within its body, presuming such a subtype has been declared
@@ -44145,9 +44301,9 @@ proceeds normally, which may leave a task queued
forever.
corresponding discriminant of the current instance of the unit.
23/2
- 15 {AI95-00287-01AI95-00287-01} A protected type is a limited type
- (see *note 7.5::), and hence precludes use of assignment_statements
- and predefined equality operators.
+ 15 {<AI95-00287-01AI95-00287-01>} A protected type is a limited
+ type (see *note 7.5::), and hence precludes use of
+ assignment_statements and predefined equality operators.
24
16 The bodies of the protected operations given in the
@@ -44175,7 +44331,7 @@ proceeds normally, which may leave a task queued
forever.
_Examples_
26
-Example of declaration of protected type and corresponding body:
+<Example of declaration of protected type and corresponding body:>
27
protected type Resource is
@@ -44200,11 +44356,11 @@ Example of declaration of protected type and
corresponding body:
end Resource;
30
-Example of a single protected declaration and corresponding body:
+<Example of a single protected declaration and corresponding body:>
31
protected Shared_Array is
- -- Index, Item, and Item_Array are global types
+ --< Index, Item, and Item_Array are global types>
function Component (N : in Index) return Item;
procedure Set_Component(N : in Index; E : in Item);
private
@@ -44226,7 +44382,7 @@ Example of a single protected declaration and
corresponding body:
end Shared_Array;
34
-Examples of protected objects:
+<Examples of protected objects:>
35
Control : Resource;
@@ -44235,15 +44391,15 @@ Examples of protected objects:
_Extensions to Ada 83_
35.a/3
- {AI05-0299-1AI05-0299-1} This entire subclause is new;
+ {<AI05-0299-1AI05-0299-1>} This entire subclause is new;
protected units do not exist in Ada 83.
_Extensions to Ada 95_
35.b/2
- {AI95-00345-01AI95-00345-01} {AI95-00397-01AI95-00397-01}
- {AI95-00399-01AI95-00399-01} {AI95-00401-01AI95-00401-01}
- {AI95-00419-01AI95-00419-01} Protected types and single
+ {<AI95-00345-01AI95-00345-01>} {<AI95-00397-01AI95-00397-01>}
+ {<AI95-00399-01AI95-00399-01>} {<AI95-00401-01AI95-00401-01>}
+ {<AI95-00419-01AI95-00419-01>} Protected types and single
protected objects can be derived from one or more interfaces.
Operations declared in the protected type can implement the
primitive operations of an interface. Overriding_indicators
@@ -44253,28 +44409,29 @@ Examples of protected objects:
_Wording Changes from Ada 95_
35.c/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Changed representation clauses to aspect clauses to reflect
- that they are used for more than just representation.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Changed representation clauses to aspect clauses
+ to reflect that they are used for more than just
+ representation.
35.d/2
- {AI95-00280-01AI95-00280-01} Described what happens when an
+ {<AI95-00280-01AI95-00280-01>} Described what happens when an
operation of a finalized protected object is called.
35.e/2
- {AI95-00287-01AI95-00287-01} Revised the note on operations of
- protected types to reflect that limited types do have an
+ {<AI95-00287-01AI95-00287-01>} Revised the note on operations
+ of protected types to reflect that limited types do have an
assignment operation, but not copying (assignment_statements).
35.f/2
- {AI95-00382-01AI95-00382-01} Revised the note on use of the
+ {<AI95-00382-01AI95-00382-01>} Revised the note on use of the
name of a protected type within itself to reflect the
exception for anonymous access types.
_Incompatibilities With Ada 2005_
35.g/3
- {AI05-0291-1AI05-0291-1} Correction: When an inherited
+ {<AI05-0291-1AI05-0291-1>} Correction: When an inherited
subprogram is implemented by a protected function, the first
parameter has to be an in parameter, but not an
access-to-variable type. Original Ada 2005 allowed
@@ -44285,26 +44442,26 @@ Examples of protected objects:
_Extensions to Ada 2005_
35.h/3
- {AI05-0183-1AI05-0183-1} {AI05-0267-1AI05-0267-1} An optional
- aspect_specification can be used in a
+ {<AI05-0183-1AI05-0183-1>} {<AI05-0267-1AI05-0267-1>} An
+ optional aspect_specification can be used in a
protected_type_declaration, a single_protected_declaration,
and a protected_body. This is described in *note 13.1.1::.
_Wording Changes from Ada 2005_
35.i/3
- {AI05-0042-1AI05-0042-1} Correction: Clarified that an
+ {<AI05-0042-1AI05-0042-1>} Correction: Clarified that an
inherited subprogram of a progenitor is overridden when it is
implemented by an entry or subprogram.
35.j/3
- {AI05-0090-1AI05-0090-1} Correction: Added the missing
+ {<AI05-0090-1AI05-0090-1>} Correction: Added the missing
defining name in the no conflicting primitive operation rule.
_Extensions to Ada 2012_
35.k/4
- {AI12-0147-1AI12-0147-1} Corrigendum: Null procedures and
+ {<AI12-0147-1AI12-0147-1>} Corrigendum: Null procedures and
expression functions are allowed in protected bodies. We
consider this an omission, as there is no reason why the
convinient shorthand notations should not be allowed in this
@@ -44328,14 +44485,14 @@ indirectly via a shared protected object.
_Static Semantics_
2/3
-{AI05-0225-1AI05-0225-1} {AI05-0291-1AI05-0291-1} When a name or prefix
-denotes an entry, protected subprogram, or a prefixed view of a
+{<AI05-0225-1AI05-0225-1>} {<AI05-0291-1AI05-0291-1>} When a name or
+prefix denotes an entry, protected subprogram, or a prefixed view of a
primitive subprogram of a limited interface whose first parameter is a
-controlling parameter, the name or prefix determines a target object, as
-follows:
+controlling parameter, the name or prefix determines a <target object>,
+as follows:
2.a/3
- To be honest: {AI05-0291-1AI05-0291-1} This wording uses
+ To be honest: {<AI05-0291-1AI05-0291-1>} This wording uses
"denotes" to mean "denotes a view of an entity" (when the term
is used in Legality Rules), and "denotes an entity" (when the
term is used in Dynamic Semantics rules). It does not mean
@@ -44343,17 +44500,17 @@ follows:
renames is not an entry or protected subprogram).
3/3
- * {AI05-0291-1AI05-0291-1} If it is a direct_name or expanded name
+ * {<AI05-0291-1AI05-0291-1>} If it is a direct_name or expanded name
that denotes the declaration (or body) of the operation, then the
target object is implicitly specified to be the current instance of
the task or protected unit immediately enclosing the operation; a
- call using such a name is defined to be an internal call;
+ call using such a name is defined to be an <internal call>;
4/3
- * {AI05-0291-1AI05-0291-1} If it is a selected_component that is not
- an expanded name, then the target object is explicitly specified to
- be the object denoted by the prefix of the name; a call using such
- a name is defined to be an external call;
+ * {<AI05-0291-1AI05-0291-1>} If it is a selected_component that is
+ not an expanded name, then the target object is explicitly
+ specified to be the object denoted by the prefix of the name; a
+ call using such a name is defined to be an <external call>;
4.a
Discussion: For example:
@@ -44375,20 +44532,20 @@ follows:
4.e
procedure Op2 is
begin
- Op1; -- An internal call.
- Pt.Op1; -- Another internal call.
- PO.Op1; -- An external call. It the current instance is PO,
then
- -- this is a bounded error (see *note 9.5.1::).
- Other_Object.Some_Op; -- An external call.
+ Op1; --< An internal call.>
+ Pt.Op1; --< Another internal call.>
+ PO.Op1; --< An external call. It the current instance is
PO, then>
+ --< this is a bounded error (see *note 9.5.1::).>
+ Other_Object.Some_Op; --< An external call.>
end Op2;
end Pt;
5/3
- * {AI05-0291-1AI05-0291-1} If the name or prefix is a dereference
+ * {<AI05-0291-1AI05-0291-1>} If the name or prefix is a dereference
(implicit or explicit) of an access-to-protected-subprogram value,
then the target object is determined by the prefix of the Access
attribute_reference that produced the access value originally; a
- call using such a name is defined to be an external call;
+ call using such a name is defined to be an <external call>;
6
* If the name or prefix denotes a subprogram_renaming_declaration,
@@ -44396,29 +44553,29 @@ follows:
entity.
6.1/3
-{AI05-0291-1AI05-0291-1} A call on an entry or a protected subprogram
+{<AI05-0291-1AI05-0291-1>} A call on an entry or a protected subprogram
either uses a name or prefix that determines a target object implicitly,
as above, or is a call on (a non-prefixed view of) a primitive
subprogram of a limited interface whose first parameter is a controlling
parameter, in which case the target object is identified explicitly by
-the first parameter. This latter case is an external call.
+the first parameter. This latter case is an <external call>.
7
A corresponding definition of target object applies to a
requeue_statement (see *note 9.5.4::), with a corresponding distinction
-between an internal requeue and an external requeue.
+between an <internal requeue> and an <external requeue>.
_Legality Rules_
7.1/3
-{AI95-00345-01AI95-00345-01} {AI05-0225-1AI05-0225-1}
-{AI05-0291-1AI05-0291-1} If a name or prefix determines a target object,
-and the name denotes a protected entry or procedure, then the target
-object shall be a variable, unless the prefix is for an
+{<AI95-00345-01AI95-00345-01>} {<AI05-0225-1AI05-0225-1>}
+{<AI05-0291-1AI05-0291-1>} If a name or prefix determines a target
+object, and the name denotes a protected entry or procedure, then the
+target object shall be a variable, unless the prefix is for an
attribute_reference to the Count attribute (see *note 9.9::).
7.a/3
- Reason: {AI05-0225-1AI05-0225-1} The point is to prevent any
+ Reason: {<AI05-0225-1AI05-0225-1>} The point is to prevent any
calls to such a name whose target object is a constant view of
a protected object, directly, or via an access value, renames,
or generic formal subprogram. It is, however, legal to say
@@ -44426,7 +44583,7 @@ attribute_reference to the Count attribute (see *note
9.9::).
protected object is a constant view there.
7.b/3
- Ramification: {AI05-0291-1AI05-0291-1} This rule does not
+ Ramification: {<AI05-0291-1AI05-0291-1>} This rule does not
apply to calls that are not to a prefixed view. Specifically
a "normal" call to a primitive operation of a limited
interface is not covered by this rule. In that case, the
@@ -44465,17 +44622,17 @@ entry.
_Syntax_
10/3
- {AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1}
+ {<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>}
synchronization_kind ::=
By_Entry | By_Protected_Procedure | Optional
_Static Semantics_
11/3
-{AI05-0215-1AI05-0215-1} For the declaration of a primitive procedure of
-a synchronized tagged type the following language-defined representation
-aspect may be specified with an aspect_specification (see *note
-13.1.1::):
+{<AI05-0215-1AI05-0215-1>} For the declaration of a primitive procedure
+of a synchronized tagged type the following language-defined
+representation aspect may be specified with an aspect_specification (see
+*note 13.1.1::):
12/3
Synchronization
@@ -44488,53 +44645,53 @@ Synchronization
implemented by an entry or protected procedure.
13/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} Inherited subprograms
-inherit the Synchronization aspect, if any, from the corresponding
-subprogram of the parent or progenitor type. If an overriding operation
-does not have a directly specified Synchronization aspect then the
-Synchronization aspect of the inherited operation is inherited by the
-overriding operation.
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} Inherited
+subprograms inherit the Synchronization aspect, if any, from the
+corresponding subprogram of the parent or progenitor type. If an
+overriding operation does not have a directly specified Synchronization
+aspect then the Synchronization aspect of the inherited operation is
+inherited by the overriding operation.
_Legality Rules_
14/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} The
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} The
synchronization_kind By_Protected_Procedure shall not be applied to a
primitive procedure of a task interface.
15/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} A procedure for which
-the specified synchronization_kind is By_Entry shall be implemented by
-an entry. A procedure for which the specified synchronization_kind is
-By_Protected_Procedure shall be implemented by a protected procedure. A
-procedure for which the specified synchronization_kind is Optional may
-be implemented by an entry or by a procedure (including a protected
-procedure).
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} A procedure for
+which the specified synchronization_kind is By_Entry shall be
+implemented by an entry. A procedure for which the specified
+synchronization_kind is By_Protected_Procedure shall be implemented by a
+protected procedure. A procedure for which the specified
+synchronization_kind is Optional may be implemented by an entry or by a
+procedure (including a protected procedure).
16/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} If a primitive
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} If a primitive
procedure overrides an inherited operation for which the Synchronization
aspect has been specified to be By_Entry or By_Protected_Procedure, then
any specification of the aspect Synchronization applied to the
overriding operation shall have the same synchronization_kind.
17/3
-{AI05-0030-2AI05-0030-2} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules also apply in the private
-part of an instance of a generic unit.
+{<AI05-0030-2AI05-0030-2>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules also apply in the
+private part of an instance of a generic unit.
NOTES
18/3
- 18 {AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} The
+ 18 {<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} The
synchronization_kind By_Protected_Procedure implies that the
operation will not block.
_Wording Changes from Ada 95_
18.a/2
- {AI95-00345-01AI95-00345-01} Added a Legality Rule to make it
- crystal-clear that the protected object of an entry or
+ {<AI95-00345-01AI95-00345-01>} Added a Legality Rule to make
+ it crystal-clear that the protected object of an entry or
procedure call must be a variable. This rule was implied by
the Dynamic Semantics here, along with the Static Semantics of
*note 3.3::, but it is much better to explicitly say it.
@@ -44545,18 +44702,20 @@ part of an instance of a generic unit.
_Extensions to Ada 2005_
18.b/3
- {AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} Added the
- Synchronization aspect to allow specifying that an interface
- procedure is really an entry or a protected procedure.
+ {<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} Added
+ the Synchronization aspect to allow specifying that an
+ interface procedure is really an entry or a protected
+ procedure.
_Wording Changes from Ada 2005_
18.c/3
- {AI05-0225-1AI05-0225-1} Correction: Clarified that the target
- object of any name denoted a protected procedure or entry can
- never be a constant (other than for the 'Count attribute).
- This closes holes involving calls to access-to-protected,
- renaming as a procedure, and generic formal subprograms.
+ {<AI05-0225-1AI05-0225-1>} Correction: Clarified that the
+ target object of any name denoted a protected procedure or
+ entry can never be a constant (other than for the 'Count
+ attribute). This closes holes involving calls to
+ access-to-protected, renaming as a procedure, and generic
+ formal subprograms.
* Menu:
@@ -44572,7 +44731,7 @@ File: aarm2012.info, Node: 9.5.1, Next: 9.5.2, Up:
9.5
-------------------------------------------------
1
-A protected subprogram is a subprogram declared immediately within a
+A <protected subprogram> is a subprogram declared immediately within a
protected_definition. Protected procedures provide exclusive read-write
access to the data of a protected object; protected functions provide
concurrent read-only access to the data.
@@ -44595,9 +44754,9 @@ protected_body), and within an entry_body, the current
instance is
defined to be a variable (updating is permitted).]
2.a.1/3
- Proof: {AI05-0120-1AI05-0120-1} All constant views are defined
- in *note 3.3::, "*note 3.3:: Objects and Named Numbers",
- anything not named there is a variable view.
+ Proof: {<AI05-0120-1AI05-0120-1>} All constant views are
+ defined in *note 3.3::, "*note 3.3:: Objects and Named
+ Numbers", anything not named there is a variable view.
2.a
Ramification: The current instance is like an implicit
@@ -44605,7 +44764,7 @@ defined to be a variable (updating is permitted).]
out for a protected procedure (or protected entry).
2.1/4
-{AI12-0129-1AI12-0129-1} For a type declared by a
+{<AI12-0129-1AI12-0129-1>} For a type declared by a
protected_type_declaration or for the anonymous type of an object
declared by a single_protected_declaration, the following
language-defined type-related representation aspect may be specified:
@@ -44628,10 +44787,10 @@ Exclusive_Functions
exclusion behavior of protected functions in a protected type.
2.4/4
-{AI12-0129-1AI12-0129-1} A protected procedure or entry is an exclusive
-protected operation. A protected function of a protected type P is an
-exclusive protected operation if the Exclusive_Functions aspect of P is
-True.
+{<AI12-0129-1AI12-0129-1>} A protected procedure or entry is an
+<exclusive> protected operation. A protected function of a protected
+type <P> is an exclusive protected operation if the Exclusive_Functions
+aspect of <P> is True.
_Dynamic Semantics_
@@ -44642,31 +44801,32 @@ back of in out or out parameters, proceeds as for a
normal subprogram
call (see *note 6.4::). If the call is an internal call (see *note
9.5::), the body of the subprogram is executed as for a normal
subprogram call. If the call is an external call, then the body of the
-subprogram is executed as part of a new protected action on the target
+subprogram is executed as part of a new <protected action> on the target
protected object; the protected action completes after the body of the
subprogram is executed. [A protected action can also be started by an
entry call (see *note 9.5.3::).]
4/4
-{AI12-0129-1AI12-0129-1} A new protected action is not started on a
+{<AI12-0129-1AI12-0129-1>} A new protected action is not started on a
protected object while another protected action on the same protected
object is underway, unless both actions are the result of a call on a
nonexclusive protected function. This rule is expressible in terms of
the execution resource associated with the protected object:
5/4
- * {AI12-0129-1AI12-0129-1} Starting a protected action on a protected
- object corresponds to acquiring the execution resource associated
- with the protected object, either for exclusive read-write access
- if the protected action is for a call on an exclusive protected
- operation, or for concurrent read-only access otherwise;
+ * {<AI12-0129-1AI12-0129-1>} <Starting> a protected action on a
+ protected object corresponds to <acquiring> the execution resource
+ associated with the protected object, either for exclusive
+ read-write access if the protected action is for a call on an
+ exclusive protected operation, or for concurrent read-only access
+ otherwise;
6
- * Completing the protected action corresponds to releasing the
+ * <Completing> the protected action corresponds to <releasing> the
associated execution resource.
7/4
-{AI12-0129-1AI12-0129-1} [After performing an exclusive protected
+{<AI12-0129-1AI12-0129-1>} [After performing an exclusive protected
operation on a protected object, but prior to completing the associated
protected action, the entry queues (if any) of the protected object are
serviced (see *note 9.5.3::).]
@@ -44675,7 +44835,7 @@ serviced (see *note 9.5.3::).]
8
During a protected action, it is a bounded error to invoke an operation
-that is potentially blocking. The following are defined to be
+that is <potentially blocking>. The following are defined to be
potentially blocking operations:
8.a
@@ -44728,10 +44888,10 @@ detected, the bounded error might result in deadlock
or a (nested)
protected action on the same target object.
17.a/2
- Discussion: {AI95-00305-01AI95-00305-01} By "nested protected
- action", we mean that an additional protected action can be
- started by another task on the same protected object. This
- means that mutual exclusion may be broken in this bounded
+ Discussion: {<AI95-00305-01AI95-00305-01>} By "nested
+ protected action", we mean that an additional protected action
+ can be started by another task on the same protected object.
+ This means that mutual exclusion may be broken in this bounded
error case. A way to ensure that this does not happen is to
use pragma Detect_Blocking (see *note H.5::).
@@ -44744,7 +44904,7 @@ identified where they are defined. When not specified
as potentially
blocking, a language-defined subprogram is nonblocking.
18.a/2
- Discussion: {AI95-00178-01AI95-00178-01} Any subprogram in a
+ Discussion: {<AI95-00178-01AI95-00178-01>} Any subprogram in a
language-defined input-output package that has a file
parameter or result or operates on a default file is
considered to manipulate a file. An instance of a
@@ -44801,15 +44961,15 @@ blocking, a language-defined subprogram is
nonblocking.
task indefinitely.
22.1/2
- 23 {AI95-00305-01AI95-00305-01} The pragma Detect_Blocking may be
- used to ensure that all executions of potentially blocking
+ 23 {<AI95-00305-01AI95-00305-01>} The pragma Detect_Blocking may
+ be used to ensure that all executions of potentially blocking
operations during a protected action raise Program_Error. See
*note H.5::.
_Examples_
23
-Examples of protected subprogram calls (see *note 9.4::):
+<Examples of protected subprogram calls (see *note 9.4::):>
24
Shared_Array.Set_Component(N, E);
@@ -44819,7 +44979,7 @@ Examples of protected subprogram calls (see *note
9.4::):
_Wording Changes from Ada 95_
24.a/2
- {AI95-00305-01AI95-00305-01} Added a note pointing out the
+ {<AI95-00305-01AI95-00305-01>} Added a note pointing out the
existence of pragma Detect_Blocking. This pragma can be used
to ensure portable (somewhat pessimistic) behavior of
protected actions by converting the Bounded Error into a
@@ -44828,7 +44988,7 @@ Examples of protected subprogram calls (see *note
9.4::):
_Extensions to Ada 2012_
24.b/4
- {AI12-0129-1AI12-0129-1} Corrigendum: Aspect
+ {<AI12-0129-1AI12-0129-1>} Corrigendum: Aspect
Exclusive_Functions is new. The term "exclusive protected
operations" is new.
@@ -44846,7 +45006,7 @@ tasks and protected objects.
_Syntax_
2/3
- {AI95-00397-01AI95-00397-01} {AI05-0183-1AI05-0183-1}
+ {<AI95-00397-01AI95-00397-01>} {<AI05-0183-1AI05-0183-1>}
entry_declaration ::=
[overriding_indicator]
entry defining_identifier [(discrete_subtype_definition)]
@@ -44855,9 +45015,9 @@ tasks and protected objects.
3
accept_statement ::=
- accept entry_direct_name [(entry_index)] parameter_profile [do
+ accept <entry_>direct_name [(entry_index)] parameter_profile [do
handled_sequence_of_statements
- end [entry_identifier]];
+ end [<entry_>identifier]];
3.a
Reason: We cannot use defining_identifier for
@@ -44876,10 +45036,10 @@ tasks and protected objects.
declarative_part
begin
handled_sequence_of_statements
- end [entry_identifier];
+ end [<entry_>identifier];
5.a/2
- Discussion: {AI95-00397-01AI95-00397-01} We don't allow an
+ Discussion: {<AI95-00397-01AI95-00397-01>} We don't allow an
overriding_indicator on an entry_body because entries always
implement procedures at the point of the type declaration;
there is no late implementation. And we don't want to have to
@@ -44897,10 +45057,10 @@ tasks and protected objects.
discrete_subtype_definition
9
- If an entry_identifier appears at the end of an accept_statement,
- it shall repeat the entry_direct_name (*note 4.1: S0092.). If an
- entry_identifier appears at the end of an entry_body (*note 9.5.2:
- S0221.), it shall repeat the defining_identifier (*note 3.1:
+ If an <entry_>identifier appears at the end of an accept_statement,
+ it shall repeat the <entry_>direct_name (*note 4.1: S0092.). If an
+ <entry_>identifier appears at the end of an entry_body (*note
+ 9.5.2: S0221.), it shall repeat the defining_identifier (*note 3.1:
S0022.).
10
@@ -44911,8 +45071,8 @@ tasks and protected objects.
Proof: This follows from the BNF.
10.1/2
- {AI95-00397-01AI95-00397-01} An overriding_indicator is not allowed
- in an entry_declaration that includes a
+ {<AI95-00397-01AI95-00397-01>} An overriding_indicator is not
+ allowed in an entry_declaration that includes a
discrete_subtype_definition.
10.a.1/2
@@ -44923,7 +45083,7 @@ tasks and protected objects.
_Name Resolution Rules_
11
-In an accept_statement, the expected profile for the entry_direct_name
+In an accept_statement, the expected profile for the <entry_>direct_name
is that of the entry_declaration (*note 9.5.2: S0218.); the expected
type for an entry_index is that of the subtype defined by the
discrete_subtype_definition (*note 3.6: S0055.) of the corresponding
@@ -44956,7 +45116,7 @@ specification for an access parameter (see *note
3.10::).
13.b
task T is
- entry E(Z : access Integer); -- Illegal!
+ entry E(Z : access Integer); --< Illegal!>
end T;
13.c
@@ -44973,7 +45133,7 @@ specification for an access parameter (see *note
3.10::).
end Inner;
begin
accept E(Z : access Integer) do
- X := A(Z); -- Accessibility_Check
+ X := A(Z); --< Accessibility_Check>
end E;
end;
end T;
@@ -44996,7 +45156,7 @@ specification for an access parameter (see *note
3.10::).
protected_body).
13.1/2
-{AI95-00397-01AI95-00397-01} If an entry_declaration has an
+{<AI95-00397-01AI95-00397-01>} If an entry_declaration has an
overriding_indicator, then at the point of the declaration:
13.2/2
@@ -45023,11 +45183,11 @@ generic unit.
14
For an accept_statement, the innermost enclosing body shall be a
-task_body, and the entry_direct_name (*note 4.1: S0092.) shall denote an
-entry_declaration (*note 9.5.2: S0218.) in the corresponding task
+task_body, and the <entry_>direct_name (*note 4.1: S0092.) shall denote
+an entry_declaration (*note 9.5.2: S0218.) in the corresponding task
declaration; the profile of the accept_statement (*note 9.5.2: S0219.)
shall conform fully to that of the corresponding entry_declaration
-(*note 9.5.2: S0218.). An accept_statement (*note 9.5.2: S0219.) shall
+(*note 9.5.2: S0218.). An accept_statement (*note 9.5.2: S0219.) shall
have a parenthesized entry_index (*note 9.5.2: S0220.) if and only if
the corresponding entry_declaration (*note 9.5.2: S0218.) has a
discrete_subtype_definition (*note 3.6: S0055.).
@@ -45075,8 +45235,8 @@ enclosing task_body.
An entry_declaration of a protected unit requires a completion[, which
shall be an entry_body,] and every entry_body (*note 9.5.2: S0221.)
shall be the completion of an entry_declaration (*note 9.5.2: S0218.) of
-a protected unit. The profile of the entry_body (*note 9.5.2: S0221.)
-shall conform fully to that of the corresponding declaration.
+a protected unit. The profile of the entry_body (*note 9.5.2: S0221.)
+shall conform fully to that of the corresponding declaration.
16.a
Ramification: An entry_declaration, unlike a
@@ -45084,7 +45244,7 @@ shall conform fully to that of the corresponding
declaration.
renaming_declaration (*note 8.5: S0199.).
16.b/3
- To be honest: {AI05-0229-1AI05-0229-1} If the implementation
+ To be honest: {<AI05-0229-1AI05-0229-1>} If the implementation
supports it, the entry body can be imported (using aspect
Import, see *note B.1::), in which case no explicit entry_body
is allowed.
@@ -45105,7 +45265,7 @@ An entry_body_formal_part shall have an
entry_index_specification (*note
In this case, the discrete_subtype_definition (*note 3.6: S0055.)s of
the entry_declaration (*note 9.5.2: S0218.) and the
entry_index_specification (*note 9.5.2: S0224.) shall fully conform to
-one another (see *note 6.3.1::).
+one another (see *note 6.3.1::).
18
A name that denotes a formal parameter of an entry_body is not allowed
@@ -45124,19 +45284,19 @@ have the same meaning (see *note 6.2::).
20
An entry_declaration with a discrete_subtype_definition (see *note
-3.6::) declares a family of distinct entries having the same profile,
-with one such entry for each value of the entry index subtype defined by
-the discrete_subtype_definition (*note 3.6: S0055.). [A name for an
+3.6::) declares a <family> of distinct entries having the same profile,
+with one such entry for each value of the <entry index subtype> defined
+by the discrete_subtype_definition (*note 3.6: S0055.). [A name for an
entry of a family takes the form of an indexed_component, where the
prefix denotes the entry_declaration for the family, and the index value
-identifies the entry within the family.] The term single entry is used
-to refer to any entry other than an entry of an entry family.
+identifies the entry within the family.] The term <single entry> is
+used to refer to any entry other than an entry of an entry family.
21
In the entry_body for an entry family, the entry_index_specification
declares a named constant whose subtype is the entry index subtype
-defined by the corresponding entry_declaration; the value of the named
-entry index identifies which entry of the family was called.
+defined by the corresponding entry_declaration; the value of the <named
+entry index> identifies which entry of the family was called.
21.a
Ramification: The discrete_subtype_definition of the
@@ -45150,14 +45310,14 @@ entry index identifies which entry of the family was
called.
_Dynamic Semantics_
22/1
-{8652/00028652/0002} {AI95-00171-01AI95-00171-01} The elaboration of an
-entry_declaration for an entry family consists of the elaboration of the
-discrete_subtype_definition (*note 3.6: S0055.), as described in *note
-3.8::. The elaboration of an entry_declaration (*note 9.5.2: S0218.)
-for a single entry has no effect.
+{<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>} The elaboration of
+an entry_declaration for an entry family consists of the elaboration of
+the discrete_subtype_definition (*note 3.6: S0055.), as described in
+*note 3.8::. The elaboration of an entry_declaration (*note 9.5.2:
+S0218.) for a single entry has no effect.
22.a/3
- Discussion: {AI05-0299-1AI05-0299-1} The elaboration of the
+ Discussion: {<AI05-0299-1AI05-0299-1>} The elaboration of the
declaration of a protected subprogram has no effect, as
specified in subclause *note 6.1::. The default
initialization of an object of a task or protected type is
@@ -45172,7 +45332,7 @@ an entry of a task unit, and by the corresponding
entry_body (*note
24
For the execution of an accept_statement, the entry_index, if any, is
first evaluated and converted to the entry index subtype; this index
-value identifies which entry of the family is to be accepted. Further
+value identifies which entry of the family is to be accepted. Further
execution of the accept_statement is then blocked until a caller of the
corresponding entry is selected (see *note 9.5.3::), whereupon the
handled_sequence_of_statements, if any, of the accept_statement is
@@ -45203,19 +45363,19 @@ entry_call_statement.
25
The above interaction between a calling task and an accepting task is
-called a rendezvous. [After a rendezvous, the two tasks continue their
-execution independently.]
+called a <rendezvous>. [After a rendezvous, the two tasks continue
+their execution independently.]
26
[An entry_body is executed when the condition of the entry_barrier
evaluates to True and a caller of the corresponding single entry, or
entry of the corresponding entry family, has been selected (see *note
-9.5.3::).] For the execution of the entry_body (*note 9.5.2: S0221.),
+9.5.3::).] For the execution of the entry_body (*note 9.5.2: S0221.),
the declarative_part (*note 3.11: S0086.) of the entry_body (*note
9.5.2: S0221.) is elaborated, and the handled_sequence_of_statements
(*note 11.2: S0265.) of the body is executed, as for the execution of a
subprogram_body. The value of the named entry index, if any, is
-determined by the value of the entry index specified in the entry_name
+determined by the value of the entry index specified in the <entry_>name
of the selected entry call (or intermediate requeue_statement (*note
9.5.4: S0226.) -- see *note 9.5.4::).
@@ -45239,7 +45399,7 @@ of the selected entry call (or intermediate
requeue_statement (*note
for its own entries.
29/2
- 26 {AI95-00318-02AI95-00318-02} A return statement (see *note
+ 26 {<AI95-00318-02AI95-00318-02>} A return statement (see *note
6.5::) or a requeue_statement (see *note 9.5.4::) may be used to
complete the execution of an accept_statement or an entry_body.
@@ -45277,15 +45437,15 @@ of the selected entry call (or intermediate
requeue_statement (*note
_Examples_
32
-Examples of entry declarations:
+<Examples of entry declarations:>
33
entry Read(V : out Item);
entry Seize;
- entry Request(Level)(D : Item); -- a family of entries
+ entry Request(Level)(D : Item); --< a family of entries>
34
-Examples of accept statements:
+<Examples of accept statements:>
35
accept Shut_Down;
@@ -45311,20 +45471,21 @@ Examples of accept statements:
_Wording Changes from Ada 95_
37.c/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Clarified the elaboration of per-object constraints.
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Clarified the elaboration of per-object
+ constraints.
37.d/2
- {AI95-00397-01AI95-00397-01} Overriding_indicators can be used
- on entries; this is only useful when a task or protected type
- inherits from an interface.
+ {<AI95-00397-01AI95-00397-01>} Overriding_indicators can be
+ used on entries; this is only useful when a task or protected
+ type inherits from an interface.
_Extensions to Ada 2005_
37.e/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in an entry_declaration. This is described in *note
- 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in an entry_declaration. This is described in
+ *note 13.1.1::.
File: aarm2012.info, Node: 9.5.3, Next: 9.5.4, Prev: 9.5.2, Up: 9.5
@@ -45333,8 +45494,8 @@ File: aarm2012.info, Node: 9.5.3, Next: 9.5.4, Prev:
9.5.2, Up: 9.5
-----------------
1
-[An entry_call_statement (an entry call) can appear in various
-contexts.] A simple entry call is a stand-alone statement that
+[An entry_call_statement (an <entry call>) can appear in various
+contexts.] A <simple> entry call is a stand-alone statement that
represents an unconditional call on an entry of a target task or a
protected object. [Entry calls can also appear as part of
select_statements (see *note 9.7::).]
@@ -45342,19 +45503,19 @@ select_statements (see *note 9.7::).]
_Syntax_
2
- entry_call_statement ::= entry_name [actual_parameter_part];
+ entry_call_statement ::= <entry_>name [actual_parameter_part];
_Name Resolution Rules_
3
-The entry_name given in an entry_call_statement shall resolve to denote
-an entry. The rules for parameter associations are the same as for
-subprogram calls (see *note 6.4:: and *note 6.4.1::).
+The <entry_>name given in an entry_call_statement shall resolve to
+denote an entry. The rules for parameter associations are the same as
+for subprogram calls (see *note 6.4:: and *note 6.4.1::).
_Static Semantics_
4
-[The entry_name of an entry_call_statement specifies (explicitly or
+[The <entry_>name of an entry_call_statement specifies (explicitly or
implicitly) the target object of the call, the entry or entry family,
and the entry index, if any (see *note 9.5::).]
@@ -45362,22 +45523,22 @@ and the entry index, if any (see *note 9.5::).]
5
Under certain circumstances (detailed below), an entry of a task or
-protected object is checked to see whether it is open or closed:
+protected object is checked to see whether it is <open> or <closed>:
6/3
- * {AI05-0264-1AI05-0264-1} An entry of a task is open if the task is
- blocked on an accept_statement that corresponds to the entry (see
- *note 9.5.2::), or on a selective_accept (see *note 9.7.1::) with
- an open accept_alternative that corresponds to the entry;
+ * {<AI05-0264-1AI05-0264-1>} An entry of a task is open if the task
+ is blocked on an accept_statement that corresponds to the entry
+ (see *note 9.5.2::), or on a selective_accept (see *note 9.7.1::)
+ with an open accept_alternative that corresponds to the entry;
otherwise, it is closed.
7/3
- * {AI05-0264-1AI05-0264-1} An entry of a protected object is open if
- the condition of the entry_barrier of the corresponding entry_body
- evaluates to True; otherwise, it is closed. If the evaluation of
- the condition propagates an exception, the exception Program_Error
- is propagated to all current callers of all entries of the
- protected object.
+ * {<AI05-0264-1AI05-0264-1>} An entry of a protected object is open
+ if the condition of the entry_barrier of the corresponding
+ entry_body evaluates to True; otherwise, it is closed. If the
+ evaluation of the condition propagates an exception, the exception
+ Program_Error is propagated to all current callers of all entries
+ of the protected object.
7.a
Reason: An exception during barrier evaluation is considered
@@ -45400,10 +45561,10 @@ protected object is checked to see whether it is open
or closed:
8
For the execution of an entry_call_statement, evaluation of the name and
of the parameter associations is as for a subprogram call (see *note
-6.4::). The entry call is then issued: For a call on an entry of a
+6.4::). The entry call is then <issued>: For a call on an entry of a
protected object, a new protected action is started on the object (see
*note 9.5.1::). The named entry is checked to see if it is open; if
-open, the entry call is said to be selected immediately, and the
+open, the entry call is said to be <selected immediately>, and the
execution of the call proceeds as follows:
9
@@ -45430,16 +45591,16 @@ such assignments take place outside of any protected
action.
action and releasing the associated execution resource.
12
-If the named entry is closed, the entry call is added to an entry queue
-(as part of the protected action, for a call on a protected entry), and
-the call remains queued until it is selected or cancelled; there is a
-separate (logical) entry queue for each entry of a given task or
-protected object [(including each entry of an entry family)].
+If the named entry is closed, the entry call is added to an <entry
+queue> (as part of the protected action, for a call on a protected
+entry), and the call remains queued until it is selected or cancelled;
+there is a separate (logical) entry queue for each entry of a given task
+or protected object [(including each entry of an entry family)].
13
-When a queued call is selected, it is removed from its entry queue.
+When a queued call is <selected>, it is removed from its entry queue.
Selecting a queued call from a particular entry queue is called
-servicing the entry queue. An entry with queued calls can be serviced
+<servicing> the entry queue. An entry with queued calls can be serviced
under the following circumstances:
14
@@ -45447,20 +45608,21 @@ under the following circumstances:
or a selective_accept with a corresponding open accept_alternative;
15/4
- * {AI12-0129-1AI12-0129-1} If after performing, as part of a
+ * {<AI12-0129-1AI12-0129-1>} If after performing, as part of a
protected action on the associated protected object, an exclusive
protected operation on the object, the entry is checked and found
to be open.
16
If there is at least one call on a queue corresponding to an open entry,
-then one such call is selected according to the entry queuing policy in
-effect (see below), and the corresponding accept_statement or entry_body
-is executed as above for an entry call that is selected immediately.
+then one such call is selected according to the <entry queuing policy>
+in effect (see below), and the corresponding accept_statement or
+entry_body is executed as above for an entry call that is selected
+immediately.
17
The entry queuing policy controls selection among queued calls both for
-task and protected entry queues. The default entry queuing policy is to
+task and protected entry queues. The default entry queuing policy is to
select calls on a given entry queue in order of arrival. If calls from
two or more queues are simultaneously eligible for selection, the
default entry queuing policy does not specify which queue is serviced
@@ -45510,11 +45672,11 @@ the entry queues (in case some entry barrier depends
on a Count
attribute).]
20.a/2
- Implementation Note: {AI95-00114-01AI95-00114-01} In the case
- of an attempted cancellation due to abort, this removal might
- have to be performed by the calling task itself if the ceiling
- priority of the protected object is lower than the priority of
- the task initiating the abort.
+ Implementation Note: {<AI95-00114-01AI95-00114-01>} In the
+ case of an attempted cancellation due to abort, this removal
+ might have to be performed by the calling task itself if the
+ ceiling priority of the protected object is lower than the
+ priority of the task initiating the abort.
21
A call on an entry of a task that has already completed its execution
@@ -45542,12 +45704,13 @@ waiting for the entire protected action to complete.
work during a protected action (see *note C.7.1::).
23/4
-{AI12-0129-1AI12-0129-1} When the entry of a protected object is checked
-to see whether it is open, the implementation need not reevaluate the
-condition of the corresponding entry_barrier if no variable or attribute
-referenced by the condition (directly or indirectly) has been altered by
-the execution (or cancellation) of a call to an exclusive protected
-operation of the object since the condition was last evaluated.
+{<AI12-0129-1AI12-0129-1>} When the entry of a protected object is
+checked to see whether it is open, the implementation need not
+reevaluate the condition of the corresponding entry_barrier if no
+variable or attribute referenced by the condition (directly or
+indirectly) has been altered by the execution (or cancellation) of a
+call to an exclusive protected operation of the object since the
+condition was last evaluated.
23.a/4
Ramification: Changes to variables referenced by an entry
@@ -45691,20 +45854,21 @@ even if this might allow the entry call to be
selected in the interim.
_Examples_
30
-Examples of entry calls:
+<Examples of entry calls:>
31
- Agent.Shut_Down; -- see *note 9.1::
- Parser.Next_Lexeme(E); -- see *note 9.1::
- Pool(5).Read(Next_Char); -- see *note 9.1::
- Controller.Request(Low)(Some_Item); -- see *note 9.1::
- Flags(3).Seize; -- see *note 9.4::
+ Agent.Shut_Down; --< see *note 9.1::>
+ Parser.Next_Lexeme(E); --< see *note 9.1::>
+ Pool(5).Read(Next_Char); --< see *note 9.1::>
+ Controller.Request(Low)(Some_Item); --< see *note 9.1::>
+ Flags(3).Seize; --< see *note 9.4::>
_Wording Changes from Ada 2012_
31.a/4
- {AI12-0129-1AI12-0129-1} Corrigendum: Revised wording to talk
- about "exclusive protected operations" (see *note 9.5.1::).
+ {<AI12-0129-1AI12-0129-1>} Corrigendum: Revised wording to
+ talk about "exclusive protected operations" (see *note
+ 9.5.1::).
File: aarm2012.info, Node: 9.5.4, Prev: 9.5.3, Up: 9.5
@@ -45715,26 +45879,26 @@ File: aarm2012.info, Node: 9.5.4, Prev: 9.5.3, Up:
9.5
1
[A requeue_statement can be used to complete an accept_statement or
entry_body, while redirecting the corresponding entry call to a new (or
-the same) entry queue. Such a requeue can be performed with or without
-allowing an intermediate cancellation of the call, due to an abort or
-the expiration of a delay. ]
+the same) entry queue. Such a <requeue> can be performed with or
+without allowing an intermediate cancellation of the call, due to an
+abort or the expiration of a delay. ]
_Syntax_
2/3
- {AI05-0030-2AI05-0030-2} requeue_statement ::=
- requeue procedure_or_entry_name [with abort];
+ {<AI05-0030-2AI05-0030-2>} requeue_statement ::=
+ requeue <procedure_or_entry_>name [with abort];
_Name Resolution Rules_
3/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} The
-procedure_or_entry_name of a requeue_statement shall resolve to denote a
-procedure or an entry (the requeue target). The profile of the entry,
-or the profile or prefixed profile of the procedure, shall either have
-no parameters, or be type conformant (see *note 6.3.1::) with the
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} The
+<procedure_or_entry_>name of a requeue_statement shall resolve to denote
+a procedure or an entry (the <requeue ><target>). The profile of the
+entry, or the profile or prefixed profile of the procedure, shall either
+have no parameters, or be type conformant (see *note 6.3.1::) with the
profile of the innermost enclosing entry_body (*note 9.5.2: S0221.) or
-accept_statement (*note 9.5.2: S0219.).
+accept_statement (*note 9.5.2: S0219.).
_Legality Rules_
@@ -45744,24 +45908,25 @@ an entry_body or an accept_statement, and this
construct shall be the
innermost enclosing body or callable construct.
5/3
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} If the requeue target
-has parameters, then its (prefixed) profile shall be subtype conformant
-with the profile of the innermost enclosing callable construct.
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} If the requeue
+target has parameters, then its (prefixed) profile shall be subtype
+conformant with the profile of the innermost enclosing callable
+construct.
5.1/4
-{AI12-0090-1AI12-0090-1} Given a requeue_statement where the innermost
-enclosing callable construct is for an entry E1, for every [specific or
-class-wide ]postcondition expression P1 that applies to E1, there shall
-exist a postcondition expression P2 that applies to the requeue target
-E2 such that
+{<AI12-0090-1AI12-0090-1>} Given a requeue_statement where the innermost
+enclosing callable construct is for an entry <E1>, for every [specific
+or class-wide ]postcondition expression <P1> that applies to <E1>, there
+shall exist a postcondition expression <P2> that applies to the requeue
+target <E2> such that
5.2/4
- * P1 is fully conformant with the expression produced by replacing
- each reference in P2 to a formal parameter of E2 with a reference
- to the corresponding formal paramter of E1; and
+ * <P1> is fully conformant with the expression produced by replacing
+ each reference in <P2> to a formal parameter of <E2> with a
+ reference to the corresponding formal paramter of <E1>; and
5.3/4
- * if P1 is enabled, then P2 is also enabled.
+ * if <P1> is enabled, then <P2> is also enabled.
5.a/4
Discussion: Roughly speaking, the postcondition of the requeue
@@ -45769,12 +45934,12 @@ E2 such that
construct.
5.4/4
-{AI12-0090-1AI12-0090-1} The requeue target shall not have an applicable
-specific or class-wide postcondition which includes an Old
+{<AI12-0090-1AI12-0090-1>} The requeue target shall not have an
+applicable specific or class-wide postcondition which includes an Old
attribute_reference.
5.5/4
-{AI12-0090-1AI12-0090-1} If the requeue target is declared immediately
+{<AI12-0090-1AI12-0090-1>} If the requeue target is declared immediately
within the task_definition of a named task type or the
protected_definition of a named protected type, and if the requeue
statement occurs within the body of that type, and if the requeue is an
@@ -45789,8 +45954,8 @@ declaration of that type.
enabled.
5.6/4
-{AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1}
-{AI12-0090-1AI12-0090-1} If the target is a procedure, the name shall
+{<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>}
+{<AI12-0090-1AI12-0090-1>} If the target is a procedure, the name shall
denote a renaming of an entry, or shall denote a view or a prefixed view
of a primitive subprogram of a synchronized interface, where the first
parameter of the unprefixed view of the primitive subprogram shall be a
@@ -45798,7 +45963,7 @@ controlling parameter, and the Synchronization aspect
shall be specified
with synchronization_kind By_Entry for the primitive subprogram.
6/3
-{AI05-0030-2AI05-0030-2} In a requeue_statement of an accept_statement
+{<AI05-0030-2AI05-0030-2>} In a requeue_statement of an accept_statement
of some task unit, either the target object shall be a part of a formal
parameter of the accept_statement, or the accessibility level of the
target object shall not be equal to or statically deeper than any
@@ -45849,9 +46014,9 @@ the entry_declaration for the entry_body.
_Dynamic Semantics_
7/4
-{AI05-0030-2AI05-0030-2} {AI12-0090-1AI12-0090-1} The execution of a
+{<AI05-0030-2AI05-0030-2>} {<AI12-0090-1AI12-0090-1>} The execution of a
requeue_statement proceeds by first evaluating the
-procedure_or_entry_name[, including the prefix identifying the target
+<procedure_or_entry_>name[, including the prefix identifying the target
task or protected object and the expression identifying the entry within
an entry family, if any]. Precondition checks are then performed as for
a call to the requeue target entry or subprogram. The entry_body or
@@ -45889,18 +46054,18 @@ after leaving the enclosing callable construct:
object and proceeds as for a normal entry call (see *note 9.5.3::).
12/4
-{AI05-0030-2AI05-0030-2} {AI05-0090-1AI05-0090-1} If the requeue target
-named in the requeue_statement has formal parameters, then during the
-execution of the accept_statement or entry_body corresponding to the new
-entry and during the checking of any preconditions of the new entry, the
-formal parameters denote the same objects as did the corresponding
+{<AI05-0030-2AI05-0030-2>} {<AI05-0090-1AI05-0090-1>} If the requeue
+target named in the requeue_statement has formal parameters, then during
+the execution of the accept_statement or entry_body corresponding to the
+new entry and during the checking of any preconditions of the new entry,
+the formal parameters denote the same objects as did the corresponding
formal parameters of the callable construct completed by the requeue.
[In any case, no parameters are specified in a requeue_statement; any
parameter passing is implicit.]
13
If the requeue_statement includes the reserved words with abort (it is a
-requeue-with-abort), then:
+<requeue-with-abort>), then:
14
* if the original entry call has been aborted (see *note 9.8::), then
@@ -45937,21 +46102,21 @@ requeue_statement.
32 A requeue is permitted from a single entry to an entry of an
entry family, or vice-versa. The entry index, if any, plays no
part in the subtype conformance check between the profiles of the
- two entries; an entry index is part of the entry_name for an entry
- of a family.
+ two entries; an entry index is part of the <entry_>name for an
+ entry of a family.
_Examples_
18
-Examples of requeue statements:
+<Examples of requeue statements:>
19
requeue Request(Medium) with abort;
- -- requeue on a member of an entry family of the
current task, see *note 9.1::
+ --< requeue on a member of an entry family of the
current task, see *note 9.1::>
20
requeue Flags(I).Seize;
- -- requeue on an entry of an array component, see
*note 9.4::
+ --< requeue on an entry of an array component, see
*note 9.4::>
_Extensions to Ada 83_
@@ -45961,14 +46126,14 @@ Examples of requeue statements:
_Extensions to Ada 2005_
20.b/3
- {AI05-0030-2AI05-0030-2} {AI05-0215-1AI05-0215-1} Added the
- ability to requeue on operations of synchronized interfaces
- that are declared to be an entry.
+ {<AI05-0030-2AI05-0030-2>} {<AI05-0215-1AI05-0215-1>} Added
+ the ability to requeue on operations of synchronized
+ interfaces that are declared to be an entry.
_Inconsistencies With Ada 2012_
20.c/4
- {AI05-0090-1AI05-0090-1} Corrigendum: We now define that any
+ {<AI05-0090-1AI05-0090-1>} Corrigendum: We now define that any
preconditions of the requeue target are evaluated as part of a
requeue_statement. Original Ada 2012 did not specify this, so
a program that requeues when the preconditions fail will raise
@@ -45981,15 +46146,15 @@ Examples of requeue statements:
_Incompatibilities With Ada 2012_
20.d/4
- {AI05-0090-1AI05-0090-1} Corrigendum: If a requeue target has
- a different postcondition than the original entry, the requeue
- is now illegal. In such a case, the original postcondition
- would never have been evaluated, and assumptions that the
- caller relied upon might not be true. A requeue should be
- invisible to the caller with respect to any postconditions;
- thus we only allow it when the original entry has no
- postconditions or the requeue target has (at least) the same
- postconditions.
+ {<AI05-0090-1AI05-0090-1>} Corrigendum: If a requeue target
+ has a different postcondition than the original entry, the
+ requeue is now illegal. In such a case, the original
+ postcondition would never have been evaluated, and assumptions
+ that the caller relied upon might not be true. A requeue
+ should be invisible to the caller with respect to any
+ postconditions; thus we only allow it when the original entry
+ has no postconditions or the requeue target has (at least) the
+ same postconditions.
File: aarm2012.info, Node: 9.6, Next: 9.7, Prev: 9.5, Up: 9
@@ -45999,12 +46164,12 @@ File: aarm2012.info, Node: 9.6, Next: 9.7, Prev:
9.5, Up: 9
1
[ A delay_statement is used to block further execution until a specified
-expiration time is reached. The expiration time can be specified either
-as a particular point in time (in a delay_until_statement (*note 9.6:
-S0228.)), or in seconds from the current time (in a
+<expiration time> is reached. The expiration time can be specified
+either as a particular point in time (in a delay_until_statement (*note
+9.6: S0228.)), or in seconds from the current time (in a
delay_relative_statement (*note 9.6: S0229.)). The language-defined
package Calendar provides definitions for a type Time and associated
-operations, including a function Clock that returns the current time. ]
+operations, including a function Clock that returns the current time. ]
_Syntax_
@@ -46013,24 +46178,25 @@ operations, including a function Clock that returns
the current time. ]
delay_relative_statement
3
- delay_until_statement ::= delay until delay_expression;
+ delay_until_statement ::= delay until <delay_>expression;
4
- delay_relative_statement ::= delay delay_expression;
+ delay_relative_statement ::= delay <delay_>expression;
_Name Resolution Rules_
5
-The expected type for the delay_expression in a delay_relative_statement
-is the predefined type Duration. The delay_expression in a
-delay_until_statement is expected to be of any nonlimited type.
+The expected type for the <delay_>expression in a
+delay_relative_statement is the predefined type Duration. The
+<delay_>expression in a delay_until_statement is expected to be of any
+nonlimited type.
_Legality Rules_
6/3
-{AI05-0092-1AI05-0092-1} There can be multiple time bases, each with a
-corresponding clock, and a corresponding time type. The type of the
-delay_expression in a delay_until_statement shall be a time type --
+{<AI05-0092-1AI05-0092-1>} There can be multiple time bases, each with a
+corresponding clock, and a corresponding <time type>. The type of the
+<delay_>expression in a delay_until_statement shall be a time type --
either the type Time defined in the language-defined package Calendar
(see below), the type Time in the package Real_Time (see *note D.8::),
or some other implementation-defined time type.
@@ -46048,7 +46214,7 @@ type Duration is not specific to a particular time
base, but can be used
with any time base.]
8/3
-{AI05-0092-1AI05-0092-1} A value of the type Time in package Calendar,
+{<AI05-0092-1AI05-0092-1>} A value of the type Time in package Calendar,
or of some other time type, represents a time as reported by a
corresponding clock.
@@ -46056,20 +46222,20 @@ corresponding clock.
The following language-defined library package exists:
10
-
+
package Ada.Calendar is
type Time is private;
11/2
- {AI95-00351-01AI95-00351-01} subtype Year_Number is Integer range 1901
.. 2399;
+ {<AI95-00351-01AI95-00351-01>} subtype Year_Number is Integer range
1901 .. 2399;
subtype Month_Number is Integer range 1 .. 12;
subtype Day_Number is Integer range 1 .. 31;
subtype Day_Duration is Duration range 0.0 .. 86_400.0;
11.a/2
- Reason: {AI95-00351-01AI95-00351-01} A range of 500 years was
- chosen, as that only requires one extra bit for the year as
- compared to Ada 95. This was done to minimize disruptions
+ Reason: {<AI95-00351-01AI95-00351-01>} A range of 500 years
+ was chosen, as that only requires one extra bit for the year
+ as compared to Ada 95. This was done to minimize disruptions
with existing implementations. (One implementor reports that
their time values represent nanoseconds, and this year range
requires 63.77 bits to represent.)
@@ -46114,21 +46280,22 @@ The following language-defined library package exists:
19
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Calendar;
_Dynamic Semantics_
20
-For the execution of a delay_statement, the delay_expression is first
-evaluated. For a delay_until_statement, the expiration time for the
-delay is the value of the delay_expression, in the time base associated
-with the type of the expression. For a delay_relative_statement, the
-expiration time is defined as the current time, in the time base
-associated with relative delays, plus the value of the delay_expression
-converted to the type Duration, and then rounded up to the next clock
-tick. The time base associated with relative delays is as defined in
-*note D.9::, "*note D.9:: Delay Accuracy" or is implementation defined.
+For the execution of a delay_statement, the <delay_>expression is first
+evaluated. For a delay_until_statement, the expiration time for the
+delay is the value of the <delay_>expression, in the time base
+associated with the type of the expression. For a
+delay_relative_statement, the expiration time is defined as the current
+time, in the time base associated with relative delays, plus the value
+of the <delay_>expression converted to the type Duration, and then
+rounded up to the next clock tick. The time base associated with
+relative delays is as defined in *note D.9::, "*note D.9:: Delay
+Accuracy" or is implementation defined.
20.a
Implementation defined: The time base associated with relative
@@ -46147,8 +46314,8 @@ expiration time has already passed, the task is not
blocked.
21.a
Discussion: For a delay_relative_statement, this case
- corresponds to when the value of the delay_expression is zero
- or negative.
+ corresponds to when the value of the <delay_>expression is
+ zero or negative.
21.b
Even though the task is not blocked, it might be put back on
@@ -46156,7 +46323,7 @@ expiration time has already passed, the task is not
blocked.
Priority Scheduling".
22/3
-{AI05-0092-1AI05-0092-1} If an attempt is made to cancel the
+{<AI05-0092-1AI05-0092-1>} If an attempt is made to <cancel> the
delay_statement [(as part of an asynchronous_select (*note 9.7.4:
S0241.) or abort -- see *note 9.7.4:: and *note 9.8::)], the statement
is cancelled if the expiration time has not yet passed, thereby
@@ -46183,21 +46350,21 @@ during which the value of Calendar.Clock remains
constant.]
Calendar.Time.
24/2
-{AI95-00351-01AI95-00351-01} The functions Year, Month, Day, and Seconds
-return the corresponding values for a given value of the type Time, as
-appropriate to an implementation-defined time zone; the procedure Split
-returns all four corresponding values. Conversely, the function Time_Of
-combines a year number, a month number, a day number, and a duration,
-into a value of type Time. The operators "+" and "-" for addition and
-subtraction of times and durations, and the relational operators for
-times, have the conventional meaning.
+{<AI95-00351-01AI95-00351-01>} The functions Year, Month, Day, and
+Seconds return the corresponding values for a given value of the type
+Time, as appropriate to an implementation-defined time zone; the
+procedure Split returns all four corresponding values. Conversely, the
+function Time_Of combines a year number, a month number, a day number,
+and a duration, into a value of type Time. The operators "+" and "-"
+for addition and subtraction of times and durations, and the relational
+operators for times, have the conventional meaning.
24.a/2
Implementation defined: The time zone used for package
Calendar operations.
24.b/3
- Ramification: {AI05-0119-1AI05-0119-1} The behavior of these
+ Ramification: {<AI05-0119-1AI05-0119-1>} The behavior of these
values and subprograms if the time zone changes is also
implementation-defined. In particular, the changes associated
with summer time adjustments (like Daylight Savings Time in
@@ -46220,7 +46387,7 @@ through the Seconds parameter of the procedure Split is
always less than
86_400.0.
26/1
-{8652/00308652/0030} {AI95-00113-01AI95-00113-01} The exception
+{<8652/00308652/0030>} {<AI95-00113-01AI95-00113-01>} The exception
Time_Error is raised by the function Time_Of if the actual parameters do
not form a proper date. This exception is also raised by the operators
"+" and "-" if the result is not representable in the type Time or
@@ -46230,8 +46397,8 @@ year number of the given date is outside of the range
of the subtype
Year_Number.
26.a/1
- To be honest: {8652/01068652/0106}
- {AI95-00160-01AI95-00160-01} By "proper date" above we mean
+ To be honest: {<8652/01068652/0106>}
+ {<AI95-00160-01AI95-00160-01>} By "proper date" above we mean
that the given year has a month with the given day. For
example, February 29th is a proper date only for a leap year.
We do not mean to include the Seconds in this notion; in
@@ -46240,15 +46407,15 @@ Year_Number.
starts in the spring.
26.b/2
- Reason: {8652/00308652/0030} {AI95-00113-01AI95-00113-01}
- {AI95-00351-01AI95-00351-01} We allow Year and Split to raise
- Time_Error because the arithmetic operators are allowed (but
- not required) to produce times that are outside the range of
- years from 1901 to 2399. This is similar to the way integer
- operators may return values outside the base range of their
- type so long as the value is mathematically correct. We allow
- the functions Month, Day and Seconds to raise Time_Error so
- that they can be implemented in terms of Split.
+ Reason: {<8652/00308652/0030>} {<AI95-00113-01AI95-00113-01>}
+ {<AI95-00351-01AI95-00351-01>} We allow Year and Split to
+ raise Time_Error because the arithmetic operators are allowed
+ (but not required) to produce times that are outside the range
+ of years from 1901 to 2399. This is similar to the way
+ integer operators may return values outside the base range of
+ their type so long as the value is mathematically correct. We
+ allow the functions Month, Day and Seconds to raise Time_Error
+ so that they can be implemented in terms of Split.
_Implementation Requirements_
@@ -46263,12 +46430,12 @@ representation of other dates as well (both earlier
and later).]
_Implementation Permissions_
28/3
-{AI05-0092-1AI05-0092-1} An implementation may define additional time
+{<AI05-0092-1AI05-0092-1>} An implementation may define additional time
types.
29
An implementation may raise Time_Error if the value of a
-delay_expression in a delay_until_statement of a select_statement
+<delay_>expression in a delay_until_statement of a select_statement
represents a time more than 90 days past the current time. The actual
limit, if any, is implementation-defined.
@@ -46295,7 +46462,7 @@ should be no greater than 100 microseconds.
30.a
Implementation Note: This can be satisfied using a 32-bit 2's
- complement representation with a small of 2.0**(-14) -- that
+ complement representation with a <small> of 2.0**(-14) -- that
is, 61 microseconds -- and a range of � 2.0**17 -- that is,
131_072.0.
@@ -46315,7 +46482,7 @@ not be the same time base as used for Calendar.Clock.
32
33 A delay_relative_statement with a negative value of the
- delay_expression is equivalent to one with a zero value.
+ <delay_>expression is equivalent to one with a zero value.
33
34 A delay_statement may be executed by the environment task;
@@ -46332,7 +46499,7 @@ not be the same time base as used for Calendar.Clock.
35
36 There is no necessary relationship between System.Tick (the
resolution of the clock of package Calendar) and Duration'Small
- (the small of type Duration).
+ (the <small> of type Duration).
35.a
Ramification: The inaccuracy of the delay_statement has no
@@ -46354,23 +46521,23 @@ not be the same time base as used for Calendar.Clock.
_Examples_
37
-Example of a relative delay statement:
+<Example of a relative delay statement:>
38
- delay 3.0; -- delay 3.0 seconds
+ delay 3.0; --< delay 3.0 seconds>
39
-Example of a periodic task:
+<Example of a periodic task:>
40
declare
use Ada.Calendar;
Next_Time : Time := Clock + Period;
- -- Period is a global constant of type Duration
+ --< Period is a global constant of type Duration>
begin
- loop -- repeated every Period seconds
+ loop --< repeated every Period seconds>
delay until Next_Time;
- ... -- perform some actions
+ ... --< perform some actions>
Next_Time := Next_Time + Period;
end loop;
end;
@@ -46392,9 +46559,9 @@ Example of a periodic task:
delay_until_statements.
40.c/2
- {AI95-00351-01AI95-00351-01} The type Time may represent dates
- with year numbers outside of Year_Number. Therefore, the
- operations "+" and "-" need only raise Time_Error if the
+ {<AI95-00351-01AI95-00351-01>} The type Time may represent
+ dates with year numbers outside of Year_Number. Therefore,
+ the operations "+" and "-" need only raise Time_Error if the
result is not representable in Time (or Duration); also, Split
or Year will now raise Time_Error if the year number is
outside of Year_Number. This change is intended to simplify
@@ -46411,12 +46578,12 @@ Example of a periodic task:
and Seconds being pure functions of their input.
40.d/2
- This paragraph was deleted.{AI95-00351-01AI95-00351-01}
+ <This paragraph was deleted.>{<AI95-00351-01AI95-00351-01>}
_Inconsistencies With Ada 95_
40.e/2
- {AI95-00351-01AI95-00351-01} The upper bound of Year_Number
+ {<AI95-00351-01AI95-00351-01>} The upper bound of Year_Number
has been changed to avoid a year 2100 problem. A program
which expects years past 2099 to raise Constraint_Error will
fail in Ada 2005. We don't expect there to be many programs
@@ -46430,8 +46597,9 @@ Example of a periodic task:
_Wording Changes from Ada 95_
40.f/2
- {8652/00028652/0002} {AI95-00171-01AI95-00171-01} Corrigendum:
- Clarified that Month, Day, and Seconds can raise Time_Error.
+ {<8652/00028652/0002>} {<AI95-00171-01AI95-00171-01>}
+ Corrigendum: Clarified that Month, Day, and Seconds can raise
+ Time_Error.
* Menu:
@@ -46446,29 +46614,29 @@ File: aarm2012.info, Node: 9.6.1, Up: 9.6
_Static Semantics_
1/2
-{AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01} The following
-language-defined library packages exist:
+{<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>} The
+following language-defined library packages exist:
2/2
package Ada.Calendar.Time_Zones is
3/2
- -- Time zone manipulation:
+ -- <Time zone manipulation:>
4/2
type Time_Offset is range -28*60 .. 28*60;
4.a/4
- Reason: {AI12-0005-1AI12-0005-1} We want to be able to specify
- the difference between any two arbitrary time zones. You
- might think that 1440 (24 hours) would be enough, but there
- are places (like Tonga, which is UTC+13hr) which are more than
- 12 hours different than UTC. Combined with summer time (known
- as daylight saving time in some parts of the world) - which
- switches opposite in the northern and southern hemispheres -
- and even greater differences are possible. We know of cases
- of a 26 hours difference, so we err on the safe side by
- selecting 28 hours as the limit.
+ Reason: {<AI12-0005-1AI12-0005-1>} We want to be able to
+ specify the difference between any two arbitrary time zones.
+ You might think that 1440 (24 hours) would be enough, but
+ there are places (like Tonga, which is UTC+13hr) which are
+ more than 12 hours different than UTC. Combined with summer
+ time (known as daylight saving time in some parts of the
+ world) - which switches opposite in the northern and southern
+ hemispheres - and even greater differences are possible. We
+ know of cases of a 26 hours difference, so we err on the safe
+ side by selecting 28 hours as the limit.
5/2
Unknown_Zone_Error : exception;
@@ -46480,11 +46648,11 @@ language-defined library packages exist:
end Ada.Calendar.Time_Zones;
8/2
-
+
package Ada.Calendar.Arithmetic is
9/2
- -- Arithmetic on days:
+ -- <Arithmetic on days:>
10/2
type Day_Count is range
@@ -46518,12 +46686,12 @@ language-defined library packages exist:
end Ada.Calendar.Arithmetic;
15/2
-
+
with Ada.Calendar.Time_Zones;
package Ada.Calendar.Formatting is
16/2
- -- Day of the week:
+ -- <Day of the week:>
17/2
type Day_Name is (Monday, Tuesday, Wednesday, Thursday,
@@ -46533,7 +46701,7 @@ language-defined library packages exist:
function Day_of_Week (Date : Time) return Day_Name;
19/2
- -- Hours:Minutes:Seconds access:
+ -- <Hours:Minutes:Seconds access:>
20/2
subtype Hour_Number is Natural range 0 .. 23;
@@ -46642,7 +46810,7 @@ language-defined library packages exist:
Time_Zone : in Time_Zones.Time_Offset := 0);
35/2
- -- Simple image and value:
+ -- <Simple image and value:>
function Image (Date : Time;
Include_Time_Fraction : Boolean := False;
Time_Zone : Time_Zones.Time_Offset := 0) return
String;
@@ -46662,7 +46830,7 @@ language-defined library packages exist:
end Ada.Calendar.Formatting;
40/2
-{AI95-00351-01AI95-00351-01} Type Time_Offset represents the number of
+{<AI95-00351-01AI95-00351-01>} Type Time_Offset represents the number of
minutes difference between the implementation-defined time zone used by
Calendar and another time zone.
@@ -46670,15 +46838,15 @@ Calendar and another time zone.
function UTC_Time_Offset (Date : Time := Clock) return Time_Offset;
42/3
- {AI95-00351-01AI95-00351-01} {AI05-0119-1AI05-0119-1}
- {AI05-0269-1AI05-0269-1} Returns, as a number of minutes, the
- result of subtracting the implementation-defined time zone of
- Calendar from UTC time, at the time Date. If the time zone of
- the Calendar implementation is unknown, then
+ {<AI95-00351-01AI95-00351-01>} {<AI05-0119-1AI05-0119-1>}
+ {<AI05-0269-1AI05-0269-1>} Returns, as a number of minutes,
+ the result of subtracting the implementation-defined time zone
+ of Calendar from UTC time, at the time Date. If the time zone
+ of the Calendar implementation is unknown, then
Unknown_Zone_Error is raised.
42.a.1/3
- Ramification: {AI05-0119-1AI05-0119-1} In North America, the
+ Ramification: {<AI05-0119-1AI05-0119-1>} In North America, the
result will be negative; in Europe, the result will be zero or
positive.
@@ -46705,7 +46873,7 @@ Calendar and another time zone.
Leap_Seconds : out Leap_Seconds_Count);
44/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
Returns the difference between Left and Right. Days is the
number of days of difference, Seconds is the remainder seconds
of difference excluding leap seconds, and Leap_Seconds is the
@@ -46726,7 +46894,7 @@ Calendar and another time zone.
function "+" (Left : Day_Count; Right : Time) return Time;
46/2
- {AI95-00351-01AI95-00351-01} Adds a number of days to a time
+ {<AI95-00351-01AI95-00351-01>} Adds a number of days to a time
value. Time_Error is raised if the result is not
representable as a value of type Time.
@@ -46734,15 +46902,15 @@ Calendar and another time zone.
function "-" (Left : Time; Right : Day_Count) return Time;
48/2
- {AI95-00351-01AI95-00351-01} Subtracts a number of days from a
- time value. Time_Error is raised if the result is not
+ {<AI95-00351-01AI95-00351-01>} Subtracts a number of days from
+ a time value. Time_Error is raised if the result is not
representable as a value of type Time.
49/2
function "-" (Left, Right : Time) return Day_Count;
50/2
- {AI95-00351-01AI95-00351-01} Subtracts two time values, and
+ {<AI95-00351-01AI95-00351-01>} Subtracts two time values, and
returns the number of days between them. This is the same
value that Difference would return in Days.
@@ -46750,7 +46918,7 @@ Calendar and another time zone.
function Day_of_Week (Date : Time) return Day_Name;
52/2
- {AI95-00351-01AI95-00351-01} Returns the day of the week for
+ {<AI95-00351-01AI95-00351-01>} Returns the day of the week for
Time. This is based on the Year, Month, and Day values of
Time.
@@ -46760,7 +46928,7 @@ Calendar and another time zone.
return Year_Number;
54/2
- {AI95-00427-01AI95-00427-01} Returns the year for Date, as
+ {<AI95-00427-01AI95-00427-01>} Returns the year for Date, as
appropriate for the specified time zone offset.
55/2
@@ -46769,7 +46937,7 @@ Calendar and another time zone.
return Month_Number;
56/2
- {AI95-00427-01AI95-00427-01} Returns the month for Date, as
+ {<AI95-00427-01AI95-00427-01>} Returns the month for Date, as
appropriate for the specified time zone offset.
57/2
@@ -46778,8 +46946,8 @@ Calendar and another time zone.
return Day_Number;
58/2
- {AI95-00427-01AI95-00427-01} Returns the day number for Date,
- as appropriate for the specified time zone offset.
+ {<AI95-00427-01AI95-00427-01>} Returns the day number for
+ Date, as appropriate for the specified time zone offset.
59/2
function Hour (Date : Time;
@@ -46787,7 +46955,7 @@ Calendar and another time zone.
return Hour_Number;
60/2
- {AI95-00351-01AI95-00351-01} Returns the hour for Date, as
+ {<AI95-00351-01AI95-00351-01>} Returns the hour for Date, as
appropriate for the specified time zone offset.
61/2
@@ -46796,7 +46964,7 @@ Calendar and another time zone.
return Minute_Number;
62/2
- {AI95-00351-01AI95-00351-01} Returns the minute within the
+ {<AI95-00351-01AI95-00351-01>} Returns the minute within the
hour for Date, as appropriate for the specified time zone
offset.
@@ -46805,7 +46973,7 @@ Calendar and another time zone.
return Second_Number;
64/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
Returns the second within the hour and minute for Date.
65/2
@@ -46813,7 +46981,7 @@ Calendar and another time zone.
return Second_Duration;
66/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
Returns the fraction of second for Date (this has the same
accuracy as Day_Duration). The value returned is always less
than 1.0.
@@ -46826,7 +46994,7 @@ Calendar and another time zone.
return Day_Duration;
68/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
Returns a Day_Duration value for the combination of the given
Hour, Minute, Second, and Sub_Second. This value can be used
in Calendar.Time_Of as well as the argument to Calendar."+"
@@ -46842,8 +47010,8 @@ Calendar and another time zone.
Sub_Second : out Second_Duration);
70/3
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
- {AI05-0238-1AI05-0238-1} Splits Seconds into Hour, Minute,
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
+ {<AI05-0238-1AI05-0238-1>} Splits Seconds into Hour, Minute,
Second and Sub_Second in such a way that the resulting values
all belong to their respective subtypes. The value returned
in the Sub_Second parameter is always less than 1.0. If
@@ -46854,10 +47022,11 @@ Calendar and another time zone.
meets all of the requirements.
70.b/3
- Reason: {AI05-0238-1AI05-0238-1} If Seconds = 86400.0, one of
- the returned values would have to be out of its defined range
- (either Sub_Second = 1.0 or Hour = 24 with the other value
- being 0). This doesn't seem worth breaking the invariants.
+ Reason: {<AI05-0238-1AI05-0238-1>} If Seconds = 86400.0, one
+ of the returned values would have to be out of its defined
+ range (either Sub_Second = 1.0 or Hour = 24 with the other
+ value being 0). This doesn't seem worth breaking the
+ invariants.
71/2
function Time_Of (Year : Year_Number;
@@ -46872,16 +47041,16 @@ Calendar and another time zone.
return Time;
72/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01} If
- Leap_Second is False, returns a Time built from the date and
- time values, relative to the specified time zone offset. If
- Leap_Second is True, returns the Time that represents the time
- within the leap second that is one second later than the time
- specified by the other parameters. Time_Error is raised if
- the parameters do not form a proper date or time. If Time_Of
- is called with a Sub_Second value of 1.0, the value returned
- is equal to the value of Time_Of for the next second with a
- Sub_Second value of 0.0.
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
+ If Leap_Second is False, returns a Time built from the date
+ and time values, relative to the specified time zone offset.
+ If Leap_Second is True, returns the Time that represents the
+ time within the leap second that is one second later than the
+ time specified by the other parameters. Time_Error is raised
+ if the parameters do not form a proper date or time. If
+ Time_Of is called with a Sub_Second value of 1.0, the value
+ returned is equal to the value of Time_Of for the next second
+ with a Sub_Second value of 0.0.
72.a/2
Discussion: Time_Error should be raised if Leap_Second is
@@ -46903,16 +47072,16 @@ Calendar and another time zone.
return Time;
74/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01} If
- Leap_Second is False, returns a Time built from the date and
- time values, relative to the specified time zone offset. If
- Leap_Second is True, returns the Time that represents the time
- within the leap second that is one second later than the time
- specified by the other parameters. Time_Error is raised if
- the parameters do not form a proper date or time. If Time_Of
- is called with a Seconds value of 86_400.0, the value returned
- is equal to the value of Time_Of for the next day with a
- Seconds value of 0.0.
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
+ If Leap_Second is False, returns a Time built from the date
+ and time values, relative to the specified time zone offset.
+ If Leap_Second is True, returns the Time that represents the
+ time within the leap second that is one second later than the
+ time specified by the other parameters. Time_Error is raised
+ if the parameters do not form a proper date or time. If
+ Time_Of is called with a Seconds value of 86_400.0, the value
+ returned is equal to the value of Time_Of for the next day
+ with a Seconds value of 0.0.
75/2
procedure Split (Date : in Time;
@@ -46927,8 +47096,8 @@ Calendar and another time zone.
Time_Zone : in Time_Zones.Time_Offset := 0);
76/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01} If
- Date does not represent a time within a leap second, splits
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
+ If Date does not represent a time within a leap second, splits
Date into its constituent parts (Year, Month, Day, Hour,
Minute, Second, Sub_Second), relative to the specified time
zone offset, and sets Leap_Second to False. If Date
@@ -46950,7 +47119,7 @@ Calendar and another time zone.
Time_Zone : in Time_Zones.Time_Offset := 0);
78/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
Splits Date into its constituent parts (Year, Month, Day,
Hour, Minute, Second, Sub_Second), relative to the specified
time zone offset. The value returned in the Sub_Second
@@ -46966,8 +47135,8 @@ Calendar and another time zone.
Time_Zone : in Time_Zones.Time_Offset := 0);
80/2
- {AI95-00351-01AI95-00351-01} {AI95-00427-01AI95-00427-01} If
- Date does not represent a time within a leap second, splits
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00427-01AI95-00427-01>}
+ If Date does not represent a time within a leap second, splits
Date into its constituent parts (Year, Month, Day, Seconds),
relative to the specified time zone offset, and sets
Leap_Second to False. If Date represents a time within a leap
@@ -46983,8 +47152,8 @@ Calendar and another time zone.
Time_Zone : Time_Zones.Time_Offset := 0) return String;
82/2
- {AI95-00351-01AI95-00351-01} Returns a string form of the Date
- relative to the given Time_Zone. The format is
+ {<AI95-00351-01AI95-00351-01>} Returns a string form of the
+ Date relative to the given Time_Zone. The format is
"Year-Month-Day Hour:Minute:Second", where the Year is a
4-digit value, and all others are 2-digit values, of the
functions defined in Calendar and Calendar.Formatting,
@@ -47017,14 +47186,14 @@ Calendar and another time zone.
Time_Zone : Time_Zones.Time_Offset := 0) return Time;
84/2
- {AI95-00351-01AI95-00351-01} Returns a Time value for the
+ {<AI95-00351-01AI95-00351-01>} Returns a Time value for the
image given as Date, relative to the given time zone.
Constraint_Error is raised if the string is not formatted as
described for Image, or the function cannot interpret the
given string as a Time value.
84.a/3
- Discussion: {AI05-0005-1AI05-0005-1} The intent is that the
+ Discussion: {<AI05-0005-1AI05-0005-1>} The intent is that the
implementation enforce the same range rules on the string as
the appropriate function Time_Of, except for the hour, so
"cannot interpret the given string as a Time value" happens
@@ -47037,7 +47206,7 @@ Calendar and another time zone.
Include_Time_Fraction : Boolean := False) return String;
86/2
- {AI95-00351-01AI95-00351-01} Returns a string form of the
+ {<AI95-00351-01AI95-00351-01>} Returns a string form of the
Elapsed_Time. The format is "Hour:Minute:Second", where all
values are 2-digit values, including a leading zero, if
needed. The separators between the values are colons. If
@@ -47067,9 +47236,9 @@ Calendar and another time zone.
function Value (Elapsed_Time : String) return Duration;
88/2
- {AI95-00351-01AI95-00351-01} Returns a Duration value for the
- image given as Elapsed_Time. Constraint_Error is raised if
- the string is not formatted as described for Image, or the
+ {<AI95-00351-01AI95-00351-01>} Returns a Duration value for
+ the image given as Elapsed_Time. Constraint_Error is raised
+ if the string is not formatted as described for Image, or the
function cannot interpret the given string as a Duration
value.
@@ -47084,7 +47253,7 @@ Calendar and another time zone.
_Implementation Advice_
89/2
-{AI95-00351-01AI95-00351-01} An implementation should support leap
+{<AI95-00351-01AI95-00351-01>} An implementation should support leap
seconds if the target system supports them. If leap seconds are not
supported, Difference should return zero for Leap_Seconds, Split should
return False for Leap_Second, and Time_Of should raise Time_Error if
@@ -47115,7 +47284,7 @@ Leap_Second is True.
NOTES
90/2
- 38 {AI95-00351-01AI95-00351-01} The implementation-defined time
+ 38 {<AI95-00351-01AI95-00351-01>} The implementation-defined time
zone of package Calendar may, but need not, be the local time zone.
UTC_Time_Offset always returns the difference relative to the
implementation-defined time zone of package Calendar. If
@@ -47124,8 +47293,8 @@ Leap_Second is True.
time-base).
90.a/2
- Discussion: {AI95-00351-01AI95-00351-01} The time in the time
- zone known as Greenwich Mean Time (GMT) is generally very
+ Discussion: {<AI95-00351-01AI95-00351-01>} The time in the
+ time zone known as Greenwich Mean Time (GMT) is generally very
close to UTC time; for most purposes they can be treated the
same. GMT is the time based on the rotation of the Earth; UTC
is the time based on atomic clocks, with leap seconds
@@ -47135,7 +47304,7 @@ Leap_Second is True.
UTC.
91/2
- 39 {AI95-00351-01AI95-00351-01} Calling Split on the results of
+ 39 {<AI95-00351-01AI95-00351-01>} Calling Split on the results of
subtracting Duration(UTC_Time_Offset*60) from Clock provides the
components (hours, minutes, and so on) of the UTC time. In the
United States, for example, UTC_Time_Offset will generally be
@@ -47150,14 +47319,14 @@ Leap_Second is True.
_Extensions to Ada 95_
91.b/2
- {AI95-00351-01AI95-00351-01} {AI95-00428-01AI95-00428-01}
+ {<AI95-00351-01AI95-00351-01>} {<AI95-00428-01AI95-00428-01>}
Packages Calendar.Time_Zones, Calendar.Arithmetic, and
Calendar.Formatting are new.
_Inconsistencies With Ada 2005_
91.c/3
- {AI05-0238-1AI05-0238-1} Correction: Defined that Split for
+ {<AI05-0238-1AI05-0238-1>} Correction: Defined that Split for
Seconds raises Time_Error for a value of exactly 86400.0,
rather than breaking some invariant or raising some other
exception. Ada 2005 left this unspecified; a program that
@@ -47167,7 +47336,7 @@ Leap_Second is True.
_Wording Changes from Ada 2005_
91.d/3
- {AI05-0119-1AI05-0119-1} Correction: Clarified the sign of
+ {<AI05-0119-1AI05-0119-1>} Correction: Clarified the sign of
UTC_Time_Offset.
@@ -47194,7 +47363,7 @@ of control.]
_Examples_
3
-Example of a select statement:
+<Example of a select statement:>
4
select
@@ -47225,8 +47394,7 @@ File: aarm2012.info, Node: 9.7.1, Next: 9.7.2, Up:
9.7
1
[This form of the select_statement allows a combination of waiting for,
and selecting from, one or more alternatives. The selection may depend
-on conditions associated with each alternative of the selective_accept.
-]
+on conditions associated with each alternative of the selective_accept.]
_Syntax_
@@ -47273,7 +47441,7 @@ on conditions associated with each alternative of the
selective_accept.
* one or more delay_alternatives; or
11
- * an else part (the reserved word else followed by a
+ * an <else part> (the reserved word else followed by a
sequence_of_statements).
12
@@ -47293,17 +47461,17 @@ delay_until_statement (*note 9.6: S0228.)s for the
same time type.
_Dynamic Semantics_
14
-A select_alternative is said to be open if it is not immediately
+A select_alternative is said to be <open> if it is not immediately
preceded by a guard, or if the condition of its guard evaluates to True.
-It is said to be closed otherwise.
+It is said to be <closed> otherwise.
15
For the execution of a selective_accept, any guard conditions are
evaluated; open alternatives are thus determined. For an open
-delay_alternative, the delay_expression is also evaluated. Similarly,
+delay_alternative, the <delay_>expression is also evaluated. Similarly,
for an open accept_alternative for an entry of a family, the entry_index
is also evaluated. These evaluations are performed in an arbitrary
-order, except that a delay_expression or entry_index is not evaluated
+order, except that a <delay_>expression or entry_index is not evaluated
until after evaluating the corresponding condition, if any. Selection
and execution of one open alternative, or of the else part, then
completes the execution of the selective_accept; the rules for this
@@ -47319,8 +47487,8 @@ the selected call is removed from its entry queue and
the
handled_sequence_of_statements (*note 11.2: S0265.) (if any) of the
corresponding accept_statement is executed; after the rendezvous
completes any subsequent sequence_of_statements (*note 5.1: S0145.) of
-the alternative is executed. If no selection is immediately possible (in
-the above sense) and there is no else part, the task blocks until an
+the alternative is executed. If no selection is immediately possible
+(in the above sense) and there is no else part, the task blocks until an
open alternative can be selected.
17
@@ -47344,9 +47512,9 @@ performed as follows:
be selected; in particular, if all alternatives are closed.
20/3
- * {AI05-0299-1AI05-0299-1} An open terminate_alternative is selected
- if the conditions stated at the end of subclause *note 9.3:: are
- satisfied.
+ * {<AI05-0299-1AI05-0299-1>} An open terminate_alternative is
+ selected if the conditions stated at the end of subclause *note
+ 9.3:: are satisfied.
20.a
Ramification: In the absence of a requeue_statement, the
@@ -47374,7 +47542,7 @@ there is no else part.
_Examples_
23
-Example of a task body with a selective accept:
+<Example of a task body with a selective accept:>
24
task body Server is
@@ -47388,9 +47556,9 @@ Example of a task body with a selective accept:
Process_Work_Item(Current_Work_Item);
or
accept Shut_Down;
- exit; -- Premature shut down requested
+ exit; --< Premature shut down requested>
or
- terminate; -- Normal shutdown at end of scope
+ terminate; --< Normal shutdown at end of scope>
end select;
end loop;
end Server;
@@ -47410,11 +47578,11 @@ File: aarm2012.info, Node: 9.7.2, Next: 9.7.3,
Prev: 9.7.1, Up: 9.7
-----------------------
1/2
-{AI95-00345-01AI95-00345-01} [A timed_entry_call issues an entry call
+{<AI95-00345-01AI95-00345-01>} [A timed_entry_call issues an entry call
that is cancelled if the call (or a requeue-with-abort of the call) is
not selected before the expiration time is reached. A procedure call
may appear rather than an entry call for cases where the procedure might
-be implemented by an entry. ]
+be implemented by an entry. ]
_Syntax_
@@ -47427,20 +47595,20 @@ be implemented by an entry. ]
end select;
3/2
- {AI95-00345-01AI95-00345-01} entry_call_alternative ::=
+ {<AI95-00345-01AI95-00345-01>} entry_call_alternative ::=
procedure_or_entry_call [sequence_of_statements]
3.1/2
- {AI95-00345-01AI95-00345-01} procedure_or_entry_call ::=
+ {<AI95-00345-01AI95-00345-01>} procedure_or_entry_call ::=
procedure_call_statement | entry_call_statement
_Legality Rules_
3.2/2
-{AI95-00345-01AI95-00345-01} If a procedure_call_statement is used for a
-procedure_or_entry_call, the procedure_name or procedure_prefix of the
-procedure_call_statement shall statically denote an entry renamed as a
-procedure or (a view of) a primitive subprogram of a limited interface
+{<AI95-00345-01AI95-00345-01>} If a procedure_call_statement is used for
+a procedure_or_entry_call, the <procedure_>name or <procedure_>prefix of
+the procedure_call_statement shall statically denote an entry renamed as
+a procedure or (a view of) a primitive subprogram of a limited interface
whose first parameter is a controlling parameter (see *note 3.9.2::).
3.a/2
@@ -47460,18 +47628,18 @@ whose first parameter is a controlling parameter (see
*note 3.9.2::).
_Dynamic Semantics_
4/2
-{AI95-00345-01AI95-00345-01} For the execution of a timed_entry_call,
-the entry_name, procedure_name, or procedure_prefix, and any actual
-parameters are evaluated, as for a simple entry call (see *note 9.5.3::)
-or procedure call (see *note 6.4::). The expiration time (see *note
-9.6::) for the call is determined by evaluating the delay_expression of
-the delay_alternative. If the call is an entry call or a call on a
-procedure implemented by an entry, the entry call is then issued.
-Otherwise, the call proceeds as described in *note 6.4:: for a procedure
-call, followed by the sequence_of_statements (*note 5.1: S0145.) of the
-entry_call_alternative (*note 9.7.2: S0238.); the sequence_of_statements
-(*note 5.1: S0145.) of the delay_alternative (*note 9.7.1: S0235.) is
-ignored.
+{<AI95-00345-01AI95-00345-01>} For the execution of a timed_entry_call,
+the <entry_>name, <procedure_>name, or <procedure_>prefix, and any
+actual parameters are evaluated, as for a simple entry call (see *note
+9.5.3::) or procedure call (see *note 6.4::). The expiration time (see
+*note 9.6::) for the call is determined by evaluating the
+<delay_>expression of the delay_alternative. If the call is an entry
+call or a call on a procedure implemented by an entry, the entry call is
+then issued. Otherwise, the call proceeds as described in *note 6.4::
+for a procedure call, followed by the sequence_of_statements (*note 5.1:
+S0145.) of the entry_call_alternative (*note 9.7.2: S0238.); the
+sequence_of_statements (*note 5.1: S0145.) of the delay_alternative
+(*note 9.7.1: S0235.) is ignored.
5
If the call is queued (including due to a requeue-with-abort), and not
@@ -47483,32 +47651,32 @@ completes normally, the optional
sequence_of_statements (*note 5.1:
S0145.) of the entry_call_alternative (*note 9.7.2: S0238.) is executed.
5.a/2
- This paragraph was deleted.{AI95-00345-01AI95-00345-01}
+ <This paragraph was deleted.>{<AI95-00345-01AI95-00345-01>}
_Examples_
6
-Example of a timed entry call:
+<Example of a timed entry call:>
7
select
Controller.Request(Medium)(Some_Item);
or
delay 45.0;
- -- controller too busy, try something else
+ --< controller too busy, try something else>
end select;
_Wording Changes from Ada 83_
7.a/3
- {AI05-0299-1AI05-0299-1} This subclause comes before the one
+ {<AI05-0299-1AI05-0299-1>} This subclause comes before the one
for Conditional Entry Calls, so we can define conditional
entry calls in terms of timed entry calls.
_Incompatibilities With Ada 95_
7.b/3
- {AI95-00345-01AI95-00345-01} {AI05-0005-1AI05-0005-1} A
+ {<AI95-00345-01AI95-00345-01>} {<AI05-0005-1AI05-0005-1>} A
procedure call can be used as the entry_call_alternative in a
timed or conditional entry call, if the procedure might
actually be an entry. Since the fact that something is an
@@ -47525,7 +47693,7 @@ File: aarm2012.info, Node: 9.7.3, Next: 9.7.4, Prev:
9.7.2, Up: 9.7
-----------------------------
1/2
-{AI95-00345-01AI95-00345-01} [A conditional_entry_call issues an entry
+{<AI95-00345-01AI95-00345-01>} [A conditional_entry_call issues an entry
call that is then cancelled if it is not selected immediately (or if a
requeue-with-abort of the call is not selected immediately). A
procedure call may appear rather than an entry call for cases where the
@@ -47567,7 +47735,7 @@ as given after the reserved word else.
_Examples_
5
-Example of a conditional entry call:
+<Example of a conditional entry call:>
6
procedure Spin(R : in Resource) is
@@ -47577,7 +47745,7 @@ Example of a conditional entry call:
R.Seize;
return;
else
- null; -- busy waiting
+ null; --< busy waiting>
end select;
end loop;
end;
@@ -47585,7 +47753,7 @@ Example of a conditional entry call:
_Wording Changes from Ada 83_
6.a/3
- {AI05-0299-1AI05-0299-1} This subclause comes after the one
+ {<AI05-0299-1AI05-0299-1>} This subclause comes after the one
for Timed Entry Calls, so we can define conditional entry
calls in terms of timed entry calls. We do that so that an
"expiration time" is defined for both, thereby simplifying the
@@ -47616,7 +47784,7 @@ control upon completion of an entry call or the
expiration of a delay.]
sequence_of_statements]
4/2
- {AI95-00345-01AI95-00345-01} triggering_statement ::=
+ {<AI95-00345-01AI95-00345-01>} triggering_statement ::=
procedure_or_entry_call | delay_statement
5
@@ -47625,10 +47793,10 @@ control upon completion of an entry call or the
expiration of a delay.]
_Dynamic Semantics_
6/2
-{AI95-00345-01AI95-00345-01} For the execution of an asynchronous_select
-whose triggering_statement (*note 9.7.4: S0243.) is a
-procedure_or_entry_call, the entry_name, procedure_name, or
-procedure_prefix, and actual parameters are evaluated as for a simple
+{<AI95-00345-01AI95-00345-01>} For the execution of an
+asynchronous_select whose triggering_statement (*note 9.7.4: S0243.) is
+a procedure_or_entry_call, the <entry_>name, <procedure_>name, or
+<procedure_>prefix, and actual parameters are evaluated as for a simple
entry call (see *note 9.5.3::) or procedure call (see *note 6.4::). If
the call is an entry call or a call on a procedure implemented by an
entry, the entry call is issued. If the entry call is queued (or
@@ -47642,7 +47810,7 @@ is never started].
7
For the execution of an asynchronous_select whose triggering_statement
-(*note 9.7.4: S0243.) is a delay_statement, the delay_expression is
+(*note 9.7.4: S0243.) is a delay_statement, the <delay_>expression is
evaluated and the expiration time is determined, as for a normal
delay_statement. If the expiration time has not already passed, the
abortable_part is executed.
@@ -47693,7 +47861,7 @@ is executed after the abortable_part is left.
_Examples_
10
-Example of a main command loop for a command interpreter:
+<Example of a main command loop for a command interpreter:>
11
loop
@@ -47701,7 +47869,7 @@ Example of a main command loop for a command
interpreter:
Terminal.Wait_For_Interrupt;
Put_Line("Interrupted");
then abort
- -- This will be abandoned upon terminal interrupt
+ -- <This will be abandoned upon terminal interrupt>
Put_Line("-> ");
Get_Line(Command, Last);
Process_Command(Command(1..Last));
@@ -47709,21 +47877,21 @@ Example of a main command loop for a command
interpreter:
end loop;
12
-Example of a time-limited calculation:
+<Example of a time-limited calculation:>
13
select
delay 5.0;
Put_Line("Calculation does not converge");
then abort
- -- This calculation should finish in 5.0 seconds;
- -- if not, it is assumed to diverge.
+ -- <This calculation should finish in 5.0 seconds;>
+ -- < if not, it is assumed to diverge.>
Horribly_Complicated_Recursive_Function(X, Y);
end select;
14/4
-{AI12-0098-1AI12-0098-1} Note that these examples presume that there are
-abort completion points within the execution of the abortable_part.
+{<AI12-0098-1AI12-0098-1>} Note that these examples presume that there
+are abort completion points within the execution of the abortable_part.
_Extensions to Ada 83_
@@ -47733,7 +47901,7 @@ abort completion points within the execution of the
abortable_part.
_Extensions to Ada 95_
14.b/2
- {AI95-00345-01AI95-00345-01} A procedure can be used as the
+ {<AI95-00345-01AI95-00345-01>} A procedure can be used as the
triggering_statement (*note 9.7.4: S0243.) of an
asynchronous_select, if the procedure might actually be an
entry.
@@ -47753,40 +47921,40 @@ causes a sequence_of_statements (*note 5.1: S0145.)
to be aborted.]
_Syntax_
2
- abort_statement ::= abort task_name {, task_name};
+ abort_statement ::= abort <task_>name {, <task_>name};
_Name Resolution Rules_
3
-Each task_name is expected to be of any task type[; they need not all be
-of the same task type.]
+Each <task_>name is expected to be of any task type[; they need not all
+be of the same task type.]
_Dynamic Semantics_
4
-For the execution of an abort_statement, the given task_names are
-evaluated in an arbitrary order. Each named task is then aborted, which
-consists of making the task abnormal and aborting the execution of the
-corresponding task_body, unless it is already completed.
+For the execution of an abort_statement, the given <task_>names are
+evaluated in an arbitrary order. Each named task is then <aborted>,
+which consists of making the task <abnormal> and aborting the execution
+of the corresponding task_body, unless it is already completed.
4.a/2
- Ramification: {AI95-00114-01AI95-00114-01} Note that aborting
- those tasks is not defined to be an abort-deferred operation.
- Therefore, if one of the named tasks is the task executing the
- abort_statement, or if the task executing the abort_statement
- depends on one of the named tasks, then it is possible for the
- execution of the abort_statement to be aborted, thus leaving
- some of the tasks unaborted. This allows the implementation
- to use either a sequence of calls to an "abort task" run-time
- system primitive, or a single call to an "abort list of tasks"
- run-time system primitive.
+ Ramification: {<AI95-00114-01AI95-00114-01>} Note that
+ aborting those tasks is not defined to be an abort-deferred
+ operation. Therefore, if one of the named tasks is the task
+ executing the abort_statement, or if the task executing the
+ abort_statement depends on one of the named tasks, then it is
+ possible for the execution of the abort_statement to be
+ aborted, thus leaving some of the tasks unaborted. This
+ allows the implementation to use either a sequence of calls to
+ an "abort task" run-time system primitive, or a single call to
+ an "abort list of tasks" run-time system primitive.
5
-When the execution of a construct is aborted (including that of a
+When the execution of a construct is <aborted> (including that of a
task_body (*note 9.1: S0209.) or of a sequence_of_statements (*note 5.1:
S0145.)), the execution of every construct included within the aborted
execution is also aborted, except for executions included within the
-execution of an abort-deferred operation; the execution of an
+execution of an <abort-deferred> operation; the execution of an
abort-deferred operation continues to completion without being affected
by the abort; the following are the abort-deferred operations:
@@ -47857,9 +48025,9 @@ effects occur before the execution of the
abort_statement completes.
Other than for these immediate cases, the execution of a construct that
is aborted does not necessarily complete before the abort_statement
completes. However, the execution of the aborted construct completes no
-later than its next abort completion point (if any) that occurs outside
-of an abort-deferred operation; the following are abort completion
-points for an execution:
+later than its next <abort completion point> (if any) that occurs
+outside of an abort-deferred operation; the following are abort
+completion points for an execution:
16
* the point where the execution initiates the activation of another
@@ -47898,15 +48066,15 @@ points for an execution:
_Bounded (Run-Time) Errors_
20/3
-{AI05-0264-1AI05-0264-1} An attempt to execute an asynchronous_select as
-part of the execution of an abort-deferred operation is a bounded error.
-Similarly, an attempt to create a task that depends on a master that is
-included entirely within the execution of an abort-deferred operation is
-a bounded error. In both cases, Program_Error is raised if the error is
-detected by the implementation; otherwise, the operations proceed as
-they would outside an abort-deferred operation, except that an abort of
-the abortable_part or the created task might or might not have an
-effect.
+{<AI05-0264-1AI05-0264-1>} An attempt to execute an asynchronous_select
+as part of the execution of an abort-deferred operation is a bounded
+error. Similarly, an attempt to create a task that depends on a master
+that is included entirely within the execution of an abort-deferred
+operation is a bounded error. In both cases, Program_Error is raised if
+the error is detected by the implementation; otherwise, the operations
+proceed as they would outside an abort-deferred operation, except that
+an abort of the abortable_part or the created task might or might not
+have an effect.
20.a
Reason: An asynchronous_select relies on an abort of the
@@ -47930,9 +48098,9 @@ effect.
21
If an assignment operation completes prematurely due to an abort, the
-assignment is said to be disrupted; the target of the assignment or its
-parts can become abnormal, and certain subsequent uses of the object can
-be erroneous, as explained in *note 13.9.1::.
+assignment is said to be <disrupted>; the target of the assignment or
+its parts can become abnormal, and certain subsequent uses of the object
+can be erroneous, as explained in *note 13.9.1::.
NOTES
@@ -47951,8 +48119,8 @@ be erroneous, as explained in *note 13.9.1::.
_Wording Changes from Ada 83_
24.a/3
- {AI05-0299-1AI05-0299-1} This subclause has been rewritten to
- accommodate the concept of aborting the execution of a
+ {<AI05-0299-1AI05-0299-1>} This subclause has been rewritten
+ to accommodate the concept of aborting the execution of a
construct, rather than just of a task.
@@ -47970,9 +48138,9 @@ dereference)], the following attributes are defined:
2
T'Callable
Yields the value True when the task denoted by T is
- callable, and False otherwise; a task is callable unless
- it is completed or abnormal. The value of this attribute
- is of the predefined type Boolean.
+ <callable>, and False otherwise; a task is callable
+ unless it is completed or abnormal. The value of this
+ attribute is of the predefined type Boolean.
3
T'Terminated
@@ -47991,7 +48159,7 @@ the body of the task unit.
E'Count
Yields the number of calls presently queued on the entry
E of the current instance of the unit. The value of this
- attribute is of the type universal_integer.
+ attribute is of the type <universal_integer>.
NOTES
@@ -48023,10 +48191,10 @@ File: aarm2012.info, Node: 9.10, Next: 9.11, Prev:
9.9, Up: 9
_Static Semantics_
1/3
-{AI05-0009-1AI05-0009-1} {AI05-0201-1AI05-0201-1}
-{AI05-0229-1AI05-0229-1} {AI05-0295-1AI05-0295-1} If two different
+{<AI05-0009-1AI05-0009-1>} {<AI05-0201-1AI05-0201-1>}
+{<AI05-0229-1AI05-0229-1>} {<AI05-0295-1AI05-0295-1>} If two different
objects, including nonoverlapping parts of the same object, are
-independently addressable, they can be manipulated concurrently by two
+<independently addressable>, they can be manipulated concurrently by two
different tasks without synchronization. Any two nonoverlapping objects
are independently addressable if either object is specified as
independently addressable (see *note C.6::). Otherwise, two
@@ -48037,10 +48205,10 @@ Layout, Component_Size, Pack, Atomic, or Convention;
in this case it is
unspecified whether the parts are independently addressable.
1.a/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
1.b/3
- Implementation Note: {AI05-0229-1AI05-0229-1} Independent
+ Implementation Note: {<AI05-0229-1AI05-0229-1>} Independent
addressability is the only high level semantic effect of
aspect Pack. If two objects are independently addressable,
the implementation should allocate them in such a way that
@@ -48053,19 +48221,19 @@ unspecified whether the parts are independently
addressable.
generally not a good idea.
1.c/3
- {AI05-0229-1AI05-0229-1} Even if Pack or one of the other
+ {<AI05-0229-1AI05-0229-1>} Even if Pack or one of the other
above-mentioned aspects is specified, subcomponents should
still be updated independently if the hardware efficiently
supports it.
1.d/4
- Ramification: {AI05-0009-1AI05-0009-1}
- {AI05-0201-1AI05-0201-1} {AI12-0001-1AI12-0001-1} An atomic
- object (including atomic components) is always independently
- addressable from any other nonoverlapping object.
- Aspect_specifications and representation items cannot change
- that fact. Note, however, that the components of an atomic
- object are not necessarily atomic.
+ Ramification: {<AI05-0009-1AI05-0009-1>}
+ {<AI05-0201-1AI05-0201-1>} {<AI12-0001-1AI12-0001-1>} An
+ atomic object (including atomic components) is always
+ independently addressable from any other nonoverlapping
+ object. Aspect_specifications and representation items cannot
+ change that fact. Note, however, that the components of an
+ atomic object are not necessarily atomic.
_Dynamic Semantics_
@@ -48075,9 +48243,9 @@ another. However, task interactions can be used to
synchronize the
actions of two or more tasks to allow, for example, meaningful
communication by the direct updating and reading of variables shared
between the tasks.] The actions of two different tasks are synchronized
-in this sense when an action of one task signals an action of the other
-task; an action A1 is defined to signal an action A2 under the following
-circumstances:
+in this sense when an action of one task <signals> an action of the
+other task; an action A1 is defined to signal an action A2 under the
+following circumstances:
3
* If A1 and A2 are part of the execution of the same task, and the
@@ -48097,15 +48265,15 @@ circumstances:
waiting for the termination of the task;
6.1/3
- * {8652/00318652/0031} {AI95-00118-01AI95-00118-01}
- {AI05-0072-1AI05-0072-1} If A1 is the termination of a task T, and
- A2 is either an evaluation of the expression T'Terminated that
+ * {<8652/00318652/0031>} {<AI95-00118-01AI95-00118-01>}
+ {<AI05-0072-1AI05-0072-1>} If A1 is the termination of a task T,
+ and A2 is either an evaluation of the expression T'Terminated that
results in True, or a call to Ada.Task_Identification.Is_Terminated
with an actual parameter that identifies T and a result of True
(see *note C.7.1::);
7/3
- * {AI05-0262-1AI05-0262-1} If A1 is the action of issuing an entry
+ * {<AI05-0262-1AI05-0262-1>} If A1 is the action of issuing an entry
call, and A2 is part of the corresponding execution of the
appropriate entry_body or accept_statement;
@@ -48161,8 +48329,8 @@ circumstances:
Given an action of assigning to an object, and an action of reading or
updating a part of the same object (or of a neighboring object if the
two are not independently addressable), then the execution of the
-actions is erroneous unless the actions are sequential. Two actions are
-sequential if one of the following is true:
+actions is erroneous unless the actions are <sequential>. Two actions
+are sequential if one of the following is true:
12
* One action signals the other;
@@ -48196,7 +48364,7 @@ sequential if one of the following is true:
of protected procedures or entries.
15/3
-{AI05-0229-1AI05-0229-1} Aspect Atomic or aspect Atomic_Components may
+{<AI05-0229-1AI05-0229-1>} Aspect Atomic or aspect Atomic_Components may
also be specified to ensure that certain reads and updates are
sequential -- see *note C.6::.
@@ -48229,25 +48397,26 @@ sequential -- see *note C.6::.
_Wording Changes from Ada 95_
15.c/2
- {8652/00318652/0031} {AI95-00118-01AI95-00118-01} Corrigendum:
- Clarified that a task T2 can rely on values of variables that
- are updated by another task T1, if task T2 first verifies that
- T1'Terminated is True.
+ {<8652/00318652/0031>} {<AI95-00118-01AI95-00118-01>}
+ Corrigendum: Clarified that a task T2 can rely on values of
+ variables that are updated by another task T1, if task T2
+ first verifies that T1'Terminated is True.
_Wording Changes from Ada 2005_
15.d/3
- {AI05-0009-1AI05-0009-1} {AI05-0201-1AI05-0201-1} Correction:
- Revised the definition of independent addressability to
- exclude conforming representation clauses and to require that
- atomic and independent objects always have independent
- addressability. This should not change behavior that the user
- sees for any Ada program, so it is not an inconsistency.
+ {<AI05-0009-1AI05-0009-1>} {<AI05-0201-1AI05-0201-1>}
+ Correction: Revised the definition of independent
+ addressability to exclude conforming representation clauses
+ and to require that atomic and independent objects always have
+ independent addressability. This should not change behavior
+ that the user sees for any Ada program, so it is not an
+ inconsistency.
15.e/3
- {AI05-0072-1AI05-0072-1} Correction: Corrected the wording of
- AI95-00118-01 to actually say what was intended (as described
- above).
+ {<AI05-0072-1AI05-0072-1>} Correction: Corrected the wording
+ of AI95-00118-01 to actually say what was intended (as
+ described above).
File: aarm2012.info, Node: 9.11, Prev: 9.10, Up: 9
@@ -48267,11 +48436,11 @@ have the following structure:
task Producer;
3/2
- {AI95-00433-01AI95-00433-01} task body Producer is
- Person : Person_Name; -- see *note 3.10.1::
+ {<AI95-00433-01AI95-00433-01>} task body Producer is
+ Person : Person_Name; --< see *note 3.10.1::>
begin
loop
- ... -- simulate arrival of the next customer
+ ... --< simulate arrival of the next customer>
Buffer.Append_Wait(Person);
exit when Person = null;
end loop;
@@ -48284,32 +48453,32 @@ and the consuming task might have the following
structure:
task Consumer;
6/2
- {AI95-00433-01AI95-00433-01} task body Consumer is
+ {<AI95-00433-01AI95-00433-01>} task body Consumer is
Person : Person_Name;
begin
loop
Buffer.Remove_First_Wait(Person);
exit when Person = null;
- ... -- simulate serving a customer
+ ... --< simulate serving a customer>
end loop;
end Consumer;
7/2
-{AI95-00433-01AI95-00433-01} The buffer object contains an internal
+{<AI95-00433-01AI95-00433-01>} The buffer object contains an internal
array of person names managed in a round-robin fashion. The array has
two indices, an In_Index denoting the index for the next input person
name and an Out_Index denoting the index for the next output person
name.
7.1/2
-{AI95-00433-01AI95-00433-01} The Buffer is defined as an extension of
+{<AI95-00433-01AI95-00433-01>} The Buffer is defined as an extension of
the Synchronized_Queue interface (see *note 3.9.4::), and as such
promises to implement the abstraction defined by that interface. By
doing so, the Buffer can be passed to the Transfer class-wide operation
defined for objects of a type covered by Queue'Class.
8/2
- {AI95-00433-01AI95-00433-01} protected Buffer is new Synchronized_Queue
with -- see *note 3.9.4::
+ {<AI95-00433-01AI95-00433-01>} protected Buffer is new Synchronized_Queue
with --< see *note 3.9.4::>
entry Append_Wait(Person : in Person_Name);
entry Remove_First_Wait(Person : out Person_Name);
function Cur_Count return Natural;
@@ -48323,7 +48492,7 @@ defined for objects of a type covered by Queue'Class.
end Buffer;
9/2
- {AI95-00433-01AI95-00433-01} protected body Buffer is
+ {<AI95-00433-01AI95-00433-01>} protected body Buffer is
entry Append_Wait(Person : in Person_Name)
when Count < Pool'Length is
begin
@@ -48331,10 +48500,10 @@ defined for objects of a type covered by Queue'Class.
end Append_Wait;
9.1/2
- {AI95-00433-01AI95-00433-01} procedure Append(Person : in Person_Name)
is
+ {<AI95-00433-01AI95-00433-01>} procedure Append(Person : in
Person_Name) is
begin
if Count = Pool'Length then
- raise Queue_Error with "Buffer Full"; -- see *note 11.3::
+ raise Queue_Error with "Buffer Full"; --< see *note 11.3::>
end if;
Pool(In_Index) := Person;
In_Index := (In_Index mod Pool'Length) + 1;
@@ -48342,17 +48511,17 @@ defined for objects of a type covered by Queue'Class.
end Append;
10/2
- {AI95-00433-01AI95-00433-01} entry Remove_First_Wait(Person : out
Person_Name)
+ {<AI95-00433-01AI95-00433-01>} entry Remove_First_Wait(Person : out
Person_Name)
when Count > 0 is
begin
Remove_First(Person);
end Remove_First_Wait;
11/2
- {AI95-00433-01AI95-00433-01} procedure Remove_First(Person : out
Person_Name) is
+ {<AI95-00433-01AI95-00433-01>} procedure Remove_First(Person : out
Person_Name) is
begin
if Count = 0 then
- raise Queue_Error with "Buffer Empty"; -- see *note 11.3::
+ raise Queue_Error with "Buffer Empty"; --< see *note 11.3::>
end if;
Person := Pool(Out_Index);
Out_Index := (Out_Index mod Pool'Length) + 1;
@@ -48360,13 +48529,13 @@ defined for objects of a type covered by Queue'Class.
end Remove_First;
12/2
- {AI95-00433-01AI95-00433-01} function Cur_Count return Natural is
+ {<AI95-00433-01AI95-00433-01>} function Cur_Count return Natural is
begin
return Buffer.Count;
end Cur_Count;
13/2
- {AI95-00433-01AI95-00433-01} function Max_Count return Natural is
+ {<AI95-00433-01AI95-00433-01>} function Max_Count return Natural is
begin
return Pool'Length;
end Max_Count;
@@ -48379,19 +48548,19 @@ File: aarm2012.info, Node: 10, Next: 11, Prev: 9,
Up: Top
*******************************************
1/3
-{AI05-0299-1AI05-0299-1} [The overall structure of programs and the
+{<AI05-0299-1AI05-0299-1>} [The overall structure of programs and the
facilities for separate compilation are described in this clause. A
-program is a set of partitions, each of which may execute in a separate
-address space, possibly on a separate computer.
+<program> is a set of <partitions>, each of which may execute in a
+separate address space, possibly on a separate computer.
1.a
- Glossary entry: A program is a set of partitions, each of
+ Glossary entry: A <program> is a set of <partitions>, each of
which may execute in a separate address space, possibly on a
separate computer. A partition consists of a set of library
units.
1.b
- Glossary entry: A partition is a part of a program. Each
+ Glossary entry: A <partition> is a part of a program. Each
partition consists of a set of library units. Each partition
may run in a separate address space, possibly on a separate
computer. A program may contain just one partition. A
@@ -48399,15 +48568,15 @@ address space, possibly on a separate computer.
which can execute concurrently.
2
-As explained below, a partition is constructed from library units.
+As explained below, a partition is constructed from <library units>.
Syntactically, the declaration of a library unit is a library_item, as
is the body of a library unit. An implementation may support a concept
-of a program library (or simply, a "library"), which contains
-library_items and their subunits. Library units may be organized into a
+of a <program library> (or simply, a "library"), which contains
+library_items and their subunits. Library units may be organized into a
hierarchy of children, grandchildren, and so on.]
3/3
-{AI05-0299-1AI05-0299-1} This clause has two subclauses: *note 10.1::,
+{<AI05-0299-1AI05-0299-1>} This clause has two subclauses: *note 10.1::,
"*note 10.1:: Separate Compilation" discusses compile-time issues
related to separate compilation. *note 10.2::, "*note 10.2:: Program
Execution" discusses issues related to what is traditionally known as
@@ -48452,7 +48621,7 @@ Execution" discusses issues related to what is
traditionally known as
_Wording Changes from Ada 83_
3.f/3
- {AI05-0299-1AI05-0299-1} The clause organization mentioned
+ {<AI05-0299-1AI05-0299-1>} The clause organization mentioned
above is different from that of RM83.
* Menu:
@@ -48467,7 +48636,7 @@ File: aarm2012.info, Node: 10.1, Next: 10.2, Up: 10
=========================
1
-[ A program unit is either a package, a task unit, a protected unit, a
+[ A <program unit> is either a package, a task unit, a protected unit, a
protected entry, a generic unit, or an explicitly declared subprogram
other than an enumeration literal. Certain kinds of program units can
be separately compiled. Alternatively, they can appear physically
@@ -48504,8 +48673,8 @@ implementation-defined.
A library unit is a separately compiled program unit, and is always a
package, subprogram, or generic unit. Library units may have other
(logically nested) library units as children, and may have other program
-units physically nested within them. A root library unit, together with
-its children and grandchildren and so on, form a subsystem.
+units physically nested within them. A root library unit, together with
+its children and grandchildren and so on, form a <subsystem>.
_Implementation Permissions_
@@ -48561,9 +48730,9 @@ File: aarm2012.info, Node: 10.1.1, Next: 10.1.2, Up:
10.1
1
[A library_item is a compilation unit that is the declaration, body, or
renaming of a library unit. Each library unit (except Standard) has a
-parent unit, which is a library package or generic library package.] A
-library unit is a child of its parent unit. The root library units are
-the children of the predefined library package Standard.
+<parent unit>, which is a library package or generic library package.]
+A library unit is a <child> of its parent unit. The <root> library
+units are the children of the predefined library package Standard.
1.a
Ramification: Standard is a library unit.
@@ -48601,8 +48770,8 @@ the children of the predefined library package Standard.
parent_unit_name ::= name
8.1/2
- {AI95-00397-01AI95-00397-01} An overriding_indicator is not allowed
- in a subprogram_declaration, generic_instantiation, or
+ {<AI95-00397-01AI95-00397-01>} An overriding_indicator is not
+ allowed in a subprogram_declaration, generic_instantiation, or
subprogram_renaming_declaration that declares a library unit.
8.a.1/2
@@ -48612,15 +48781,15 @@ the children of the predefined library package
Standard.
overriding in that case would be confusing instead of helpful.
9
-A library unit is a program unit that is declared by a library_item.
+A <library unit> is a program unit that is declared by a library_item.
When a program unit is a library unit, the prefix "library" is used to
refer to it (or "generic library" if generic), as well as to its
declaration and body, as in "library procedure", "library package_body",
-or "generic library package". The term compilation unit is used to refer
-to a compilation_unit. When the meaning is clear from context, the term
-is also used to refer to the library_item of a compilation_unit or to
-the proper_body of a subunit [(that is, the compilation_unit without the
-context_clause and the separate (parent_unit_name))].
+or "generic library package". The term <compilation unit> is used to
+refer to a compilation_unit. When the meaning is clear from context,
+the term is also used to refer to the library_item of a compilation_unit
+or to the proper_body of a subunit [(that is, the compilation_unit
+without the context_clause and the separate (parent_unit_name))].
9.a
Discussion: In this example:
@@ -48647,15 +48816,15 @@ context_clause and the separate (parent_unit_name))].
decided not to.
10
-The parent declaration of a library_item (and of the library unit) is
+The <parent declaration> of a library_item (and of the library unit) is
the declaration denoted by the parent_unit_name (*note 10.1.1: S0252.),
if any, of the defining_program_unit_name (*note 6.1: S0169.) of the
-library_item. If there is no parent_unit_name (*note 10.1.1: S0252.),
+library_item. If there is no parent_unit_name (*note 10.1.1: S0252.),
the parent declaration is the declaration of Standard, the library_item
-is a root library_item, and the library unit (renaming) is a root
+is a <root> library_item, and the library unit (renaming) is a <root>
library unit (renaming). The declaration and body of Standard itself
-have no parent declaration. The parent unit of a library_item or library
-unit is the library unit declared by its parent declaration.
+have no parent declaration. The <parent unit> of a library_item or
+library unit is the library unit declared by its parent declaration.
10.a
Discussion: The declaration and body of Standard are presumed
@@ -48674,9 +48843,9 @@ unit is the library unit declared by its parent
declaration.
11
[The children of a library unit occur immediately within the declarative
-region of the declaration of the library unit.] The ancestors of a
+region of the declaration of the library unit.] The <ancestors> of a
library unit are itself, its parent, its parent's parent, and so on.
-[(Standard is an ancestor of every library unit.)] The descendant
+[(Standard is an ancestor of every library unit.)] The <descendant>
relation is the inverse of the ancestor relation.
11.a
@@ -48690,20 +48859,20 @@ relation is the inverse of the ancestor relation.
12
A library_unit_declaration or a library_unit_renaming_declaration (*note
-10.1.1: S0250.) is private if the declaration is immediately preceded by
-the reserved word private; it is otherwise public. A library unit is
-private or public according to its declaration. The public descendants
-of a library unit are the library unit itself, and the public
-descendants of its public children. Its other descendants are private
-descendants.
+10.1.1: S0250.) is <private> if the declaration is immediately preceded
+by the reserved word private; it is otherwise <public>. A library unit
+is private or public according to its declaration. The <public
+descendants> of a library unit are the library unit itself, and the
+public descendants of its public children. Its other descendants are
+<private descendants>.
12.a
Discussion: The first concept defined here is that a
library_item is either public or private (not in relation to
anything else -- it's just a property of the library unit).
The second concept is that a library_item is a public
- descendant or private descendant of a given ancestor. A given
- library_item can be a public descendant of one of its
+ descendant or private descendant <of a given ancestor>. A
+ given library_item can be a public descendant of one of its
ancestors, but a private descendant of some other ancestor.
12.b
@@ -48712,8 +48881,8 @@ descendants.
rules disallow the reserved word private on a body.
12.c
- Note that a private library unit is a public descendant of
- itself, but a private descendant of its parent. This is
+ Note that a private library unit is a <public> descendant of
+ itself, but a <private> descendant of its parent. This is
because it is visible outside itself -- its privateness means
that it is not visible outside its parent.
@@ -48753,41 +48922,42 @@ descendants.
their parent's declaration.)
12.1/2
-{AI95-00217-06AI95-00217-06} For each library package_declaration in the
-environment, there is an implicit declaration of a limited view of that
-library package. The limited view of a package contains:
+{<AI95-00217-06AI95-00217-06>} For each library package_declaration in
+the environment, there is an implicit declaration of a <limited view> of
+that library package. The limited view of a package contains:
12.2/3
- * {AI95-00217-06AI95-00217-06} {AI05-0129-1AI05-0129-1}
- {AI05-0262-1AI05-0262-1} For each package_declaration occurring
+ * {<AI95-00217-06AI95-00217-06>} {<AI05-0129-1AI05-0129-1>}
+ {<AI05-0262-1AI05-0262-1>} For each package_declaration occurring
immediately within the visible part, a declaration of the limited
view of that package, with the same defining_program_unit_name.
12.3/3
- * {AI95-00217-06AI95-00217-06} {AI95-00326-01AI95-00326-01}
- {AI05-0108-1AI05-0108-1} {AI05-0129-1AI05-0129-1}
- {AI05-0262-1AI05-0262-1} For each type_declaration occurring
+ * {<AI95-00217-06AI95-00217-06>} {<AI95-00326-01AI95-00326-01>}
+ {<AI05-0108-1AI05-0108-1>} {<AI05-0129-1AI05-0129-1>}
+ {<AI05-0262-1AI05-0262-1>} For each type_declaration occurring
immediately within the visible part that is not an
incomplete_type_declaration, an incomplete view of the type with no
discriminant_part; if the type_declaration is tagged, then the view
is a tagged incomplete view.
12.g.1/3
- Reason: {AI05-0108-1AI05-0108-1} The incomplete view of a type
- does not have a discriminant_part even if the type_declaration
- does have one. This is necessary because semantic analysis
- (and the associated dependence on with_clauses) would be
- necessary to determine the types of the discriminants.
+ Reason: {<AI05-0108-1AI05-0108-1>} The incomplete view of a
+ type does not have a discriminant_part even if the
+ type_declaration does have one. This is necessary because
+ semantic analysis (and the associated dependence on
+ with_clauses) would be necessary to determine the types of the
+ discriminants.
12.g.2/3
- {AI05-0129-1AI05-0129-1} No incomplete views of incomplete
+ {<AI05-0129-1AI05-0129-1>} No incomplete views of incomplete
types are included in the limited view. The rules of *note
3.10.1:: ensure that the completion of any visible incomplete
type is declared in the same visible part, so such an
incomplete view would simply be redundant.
12.g.3/2
- Discussion: {AI95-00217-06AI95-00217-06} The implementation
+ Discussion: {<AI95-00217-06AI95-00217-06>} The implementation
model of a limited view is that it can be determined solely
from the syntax of the source of the unit, without any
semantic analysis. That allows it to be created without the
@@ -48847,7 +49017,7 @@ name shall denote a library_item.
they wouldn't be particularly useful.
15/2
-{AI95-00217-06AI95-00217-06} A parent_unit_name [(which can be used
+{<AI95-00217-06AI95-00217-06>} A parent_unit_name [(which can be used
within a defining_program_unit_name of a library_item and in the
separate clause of a subunit)], and each of its prefixes, shall not
denote a renaming_declaration. [On the other hand, a name that denotes
@@ -48885,7 +49055,7 @@ renaming of a library unit.
packages.
17/3
-{AI05-0004-1AI05-0004-1} A child of a generic library package shall
+{<AI05-0004-1AI05-0004-1>} A child of a generic library package shall
either be itself a generic unit or be a renaming of some other child of
the same generic unit.
@@ -48894,13 +49064,13 @@ A child of a parent generic package shall be
instantiated or renamed
only within the declarative region of the parent generic.
19/2
-{AI95-00331-01AI95-00331-01} For each child C of some parent generic
-package P, there is a corresponding declaration C nested immediately
-within each instance of P. For the purposes of this rule, if a child C
-itself has a child D, each corresponding declaration for C has a
-corresponding child D. [The corresponding declaration for a child within
-an instance is visible only within the scope of a with_clause that
-mentions the (original) child generic unit.]
+{<AI95-00331-01AI95-00331-01>} For each child <C> of some parent generic
+package <P>, there is a corresponding declaration <C> nested immediately
+within each instance of <P>. For the purposes of this rule, if a child
+<C> itself has a child <D>, each corresponding declaration for <C> has a
+corresponding child <D>. [The corresponding declaration for a child
+within an instance is visible only within the scope of a with_clause
+that mentions the (original) child generic unit.]
19.a
Implementation Note: Within the child, like anything nested in
@@ -48930,7 +49100,7 @@ A library subprogram shall not override a primitive
subprogram.
Reason: This prevents certain obscure anomalies. For example,
if a library subprogram were to override a subprogram declared
in its parent package, then in a compilation unit that depends
- indirectly on the library subprogram, the library subprogram
+ <in>directly on the library subprogram, the library subprogram
could hide the overridden operation from all visibility, but
the library subprogram itself would not be visible.
@@ -48959,15 +49129,15 @@ renaming-as-declaration, not a renaming-as-body.
[There are two kinds of dependences among compilation units:]
24
- * [The semantic dependences (see below) are the ones needed to check
- the compile-time rules across compilation unit boundaries; a
+ * [The <semantic dependences> (see below) are the ones needed to
+ check the compile-time rules across compilation unit boundaries; a
compilation unit depends semantically on the other compilation
units needed to determine its legality. The visibility rules are
based on the semantic dependences.
25
- * The elaboration dependences (see *note 10.2::) determine the order
- of elaboration of library_items.]
+ * The <elaboration dependences> (see *note 10.2::) determine the
+ order of elaboration of library_items.]
25.a
Discussion: Don't confuse these kinds of dependences with the
@@ -48975,7 +49145,7 @@ renaming-as-declaration, not a renaming-as-body.
9.3::, "*note 9.3:: Task Dependence - Termination of Tasks".
26/2
-{AI95-00217-06AI95-00217-06} A library_item depends semantically upon
+{<AI95-00217-06AI95-00217-06>} A library_item depends semantically upon
its parent declaration. A subunit depends semantically upon its parent
body. A library_unit_body depends semantically upon the corresponding
library_unit_declaration, if any. The declaration of the limited view
@@ -49029,10 +49199,10 @@ relationship is transitive.
containing the type_declaration of interest.
26.h/2
- {AI95-00217-06AI95-00217-06} Unlike a full view of a package,
- a limited view does not depend semantically on units mentioned
- in with_clauses of the compilation_unit that defines the
- package. Formally, this is achieved by saying that the
+ {<AI95-00217-06AI95-00217-06>} Unlike a full view of a
+ package, a limited view does not depend semantically on units
+ mentioned in with_clauses of the compilation_unit that defines
+ the package. Formally, this is achieved by saying that the
limited view has an empty context_clause. This is necessary
so that they can be useful for their intended purpose:
allowing mutual dependences between packages. The lack of
@@ -49045,7 +49215,7 @@ relationship is transitive.
_Dynamic Semantics_
26.1/2
-{AI95-00217-06AI95-00217-06} The elaboration of the declaration of the
+{<AI95-00217-06AI95-00217-06>} The elaboration of the declaration of the
limited view of a package has no effect.
NOTES
@@ -49153,31 +49323,31 @@ limited view of a package has no effect.
_Examples_
29
-Examples of library units:
+<Examples of library units:>
30
- package Rational_Numbers.IO is -- public child of Rational_Numbers, see
*note 7.1::
+ package Rational_Numbers.IO is --< public child of Rational_Numbers, see
*note 7.1::>
procedure Put(R : in Rational);
procedure Get(R : out Rational);
end Rational_Numbers.IO;
31
private procedure Rational_Numbers.Reduce(R : in out Rational);
- -- private child of Rational_Numbers
+ --< private child of Rational_Numbers>
32
- with Rational_Numbers.Reduce; -- refer to a private child
+ with Rational_Numbers.Reduce; --< refer to a private child>
package body Rational_Numbers is
...
end Rational_Numbers;
33
with Rational_Numbers.IO; use Rational_Numbers;
- with Ada.Text_io; -- see *note A.10::
- procedure Main is -- a root library procedure
+ with Ada.Text_io; --< see *note A.10::>
+ procedure Main is --< a root library procedure>
R : Rational;
begin
- R := 5/3; -- construct a rational number, see *note
7.1::
+ R := 5/3; --< construct a rational number, see
*note 7.1::>
Ada.Text_IO.Put("The answer is: ");
IO.Put(R);
Ada.Text_IO.New_Line;
@@ -49186,21 +49356,21 @@ Examples of library units:
34
with Rational_Numbers.IO;
package Rational_IO renames Rational_Numbers.IO;
- -- a library unit renaming declaration
+ --< a library unit renaming declaration>
35
Each of the above library_items can be submitted to the compiler
separately.
35.a
- Discussion: Example of a generic package with children:
+ Discussion: <Example of a generic package with children:>
35.b
generic
type Element is private;
with function Image(E : Element) return String;
package Generic_Bags is
- type Bag is limited private; -- A bag of Elements.
+ type Bag is limited private; --< A bag of Elements.>
procedure Add(B : in out Bag; E : Element);
function Bag_Image(B : Bag) return String;
private
@@ -49210,12 +49380,12 @@ separately.
35.c
generic
package Generic_Bags.Generic_Iterators is
- ... -- various additional operations on Bags.
+ ... --< various additional operations on Bags.>
35.d
generic
with procedure Use_Element(E : in Element);
- -- Called once per bag element.
+ --< Called once per bag element.>
procedure Iterate(B : in Bag);
end Generic_Bags.Generic_Iterators;
@@ -49258,7 +49428,7 @@ separately.
procedure Append_Image(E : in Element) is
Im : constant String := Image(E);
begin
- if Last /= 0 then -- Insert a comma.
+ if Last /= 0 then --< Insert a comma.>
Last := Last + 1;
Buffer(Last) := ',';
end if;
@@ -49301,24 +49471,24 @@ separately.
_Extensions to Ada 95_
35.r/2
- {AI95-00217-06AI95-00217-06} The concept of a limited view is
- new. Combined with limited_with_clauses (see *note 10.1.2::),
- they facilitate construction of mutually recursive types in
- multiple packages.
+ {<AI95-00217-06AI95-00217-06>} The concept of a limited view
+ is new. Combined with limited_with_clauses (see *note
+ 10.1.2::), they facilitate construction of mutually recursive
+ types in multiple packages.
_Wording Changes from Ada 95_
35.s/2
- {AI95-00331-01AI95-00331-01} Clarified the wording so that a
+ {<AI95-00331-01AI95-00331-01>} Clarified the wording so that a
grandchild generic unit will work as expected.
_Wording Changes from Ada 2005_
35.t/3
- {AI05-0108-1AI05-0108-1} {AI05-0129-1AI05-0129-1} Correction:
- Clarified the wording so that it is clear that limited views
- of types never have discriminants and never are of incomplete
- types.
+ {<AI05-0108-1AI05-0108-1>} {<AI05-0129-1AI05-0129-1>}
+ Correction: Clarified the wording so that it is clear that
+ limited views of types never have discriminants and never are
+ of incomplete types.
File: aarm2012.info, Node: 10.1.2, Next: 10.1.3, Prev: 10.1.1, Up: 10.1
@@ -49341,16 +49511,16 @@ needed within a compilation unit.]
achieved this.)
1.b/2
- {AI95-00217-06AI95-00217-06} A ripple effect occurs when the
- legality of a compilation unit could be affected by adding or
- removing an otherwise unneeded with_clause on some compilation
- unit on which the unit depends, directly or indirectly. We
- try to avoid ripple effects because they make understanding
- and maintenance more difficult. However, ripple effects can
- occur because of direct visibility (as in child units); this
- seems impossible to eliminate. The ripple effect for
- with_clauses is somewhat similar to the Beaujolais effect (see
- *note 8.4::) for use_clauses, which we also try to avoid.
+ {<AI95-00217-06AI95-00217-06>} A <ripple effect> occurs when
+ the legality of a compilation unit could be affected by adding
+ or removing an otherwise unneeded with_clause on some
+ compilation unit on which the unit depends, directly or
+ indirectly. We try to avoid ripple effects because they make
+ understanding and maintenance more difficult. However, ripple
+ effects can occur because of direct visibility (as in child
+ units); this seems impossible to eliminate. The ripple effect
+ for with_clauses is somewhat similar to the Beaujolais effect
+ (see *note 8.4::) for use_clauses, which we also try to avoid.
_Syntax_
@@ -49361,25 +49531,25 @@ needed within a compilation unit.]
context_item ::= with_clause | use_clause
4/2
- {AI95-00217-06AI95-00217-06} {AI95-00262-01AI95-00262-01}
+ {<AI95-00217-06AI95-00217-06>} {<AI95-00262-01AI95-00262-01>}
with_clause ::= limited_with_clause | nonlimited_with_clause
4.1/2
- limited_with_clause ::= limited [private] with library_unit_
- name {, library_unit_name};
+ limited_with_clause ::= limited [private] with <library_unit_>
+ name {, <library_unit_>name};
4.2/2
- nonlimited_with_clause ::= [private] with library_unit_
- name {, library_unit_name};
+ nonlimited_with_clause ::= [private] with <library_unit_>
+ name {, <library_unit_>name};
4.a/2
- Discussion: {AI95-00217-06AI95-00217-06} A limited_with_clause
- makes a limited view of a unit visible.
+ Discussion: {<AI95-00217-06AI95-00217-06>} A
+ limited_with_clause makes a limited view of a unit visible.
4.b/2
- {AI95-00262-01AI95-00262-01} A with_clause containing the
- reserved word private is called a private with_clause. It can
- be thought of as making items visible only in the private
+ {<AI95-00262-01AI95-00262-01>} A with_clause containing the
+ reserved word private is called a <private with_clause>. It
+ can be thought of as making items visible only in the private
part, although it really makes items visible everywhere except
the visible part. It can be used both for documentation
purposes (to say that a unit is not used in the visible part),
@@ -49389,7 +49559,7 @@ needed within a compilation unit.]
_Name Resolution Rules_
5
-The scope of a with_clause that appears on a library_unit_declaration
+The <scope> of a with_clause that appears on a library_unit_declaration
(*note 10.1.1: S0249.) or library_unit_renaming_declaration (*note
10.1.1: S0250.) consists of the entire declarative region of the
declaration[, which includes all children and subunits]. The scope of a
@@ -49397,14 +49567,14 @@ with_clause that appears on a body consists of the
body[, which includes
all subunits].
5.a/2
- Discussion: {AI95-00262-01AI95-00262-01} Suppose a nonprivate
- with_clause of a public library unit mentions one of its
- private siblings. (This is only allowed on the body of the
- public library unit.) We considered making the scope of that
- with_clause not include the visible part of the public library
- unit. (This would only matter for a subprogram_body, since
- those are the only kinds of body that have a visible part, and
- only if the subprogram_body completes a
+ Discussion: {<AI95-00262-01AI95-00262-01>} Suppose a
+ nonprivate with_clause of a public library unit mentions one
+ of its private siblings. (This is only allowed on the body of
+ the public library unit.) We considered making the scope of
+ that with_clause not include the visible part of the public
+ library unit. (This would only matter for a subprogram_body,
+ since those are the only kinds of body that have a visible
+ part, and only if the subprogram_body completes a
subprogram_declaration, since otherwise the with_clause would
be illegal.) We did not put in such a rule for two reasons:
(1) It would complicate the wording of the rules, because we
@@ -49420,27 +49590,28 @@ all subunits].
though those are not in the scope of the with_clause.
6/2
-{AI95-00217-06AI95-00217-06} A library_item (and the corresponding
-library unit) is named in a with_clause if it is denoted by a
-library_unit_name in the with_clause. A library_item (and the
-corresponding library unit) is mentioned in a with_clause if it is named
-in the with_clause or if it is denoted by a prefix in the with_clause.
+{<AI95-00217-06AI95-00217-06>} A library_item (and the corresponding
+library unit) is <named> in a with_clause if it is denoted by a
+<library_unit_>name in the with_clause. A library_item (and the
+corresponding library unit) is <mentioned> in a with_clause if it is
+named in the with_clause or if it is denoted by a prefix in the
+with_clause.
6.a/3
- Discussion: {AI05-0299-1AI05-0299-1} With_clauses control the
- visibility of declarations or renamings of library units.
+ Discussion: {<AI05-0299-1AI05-0299-1>} With_clauses control
+ the visibility of declarations or renamings of library units.
Mentioning a root library unit in a with_clause makes its
declaration directly visible. Mentioning a nonroot library
unit makes its declaration visible. See Clause *note 8:: for
details.
6.b/2
- {AI95-00114-01AI95-00114-01} Note that this rule implies that
- "with A.B.C;" is almost equivalent to "with A, A.B, A.B.C;".
- The reason for making a with_clause apply to all the ancestor
- units is to avoid "visibility holes" -- situations in which an
- inner program unit is visible while an outer one is not.
- Visibility holes would cause semantic complexity and
+ {<AI95-00114-01AI95-00114-01>} Note that this rule implies
+ that "with A.B.C;" is almost equivalent to "with A, A.B,
+ A.B.C;". The reason for making a with_clause apply to all the
+ ancestor units is to avoid "visibility holes" -- situations in
+ which an inner program unit is visible while an outer one is
+ not. Visibility holes would cause semantic complexity and
implementation difficulty. (This is not exactly equivalent
because the latter with_clause names A and A.B, while the
previous one does not. Whether a unit is "named" does not
@@ -49456,31 +49627,31 @@ unit otherwise follows from its placement in the
environment.]
_Legality Rules_
8/2
-{AI95-00262-01AI95-00262-01} If a with_clause of a given
+{<AI95-00262-01AI95-00262-01>} If a with_clause of a given
compilation_unit mentions a private child of some library unit, then the
given compilation_unit shall be one of:
9/2
- * {AI95-00262-01AI95-00262-01} the declaration, body, or subunit of a
- private descendant of that library unit;
+ * {<AI95-00262-01AI95-00262-01>} the declaration, body, or subunit of
+ a private descendant of that library unit;
10/2
- * {AI95-00220-01AI95-00220-01} {AI95-00262-01AI95-00262-01} the body
- or subunit of a public descendant of that library unit, but not a
- subprogram body acting as a subprogram declaration (see *note
+ * {<AI95-00220-01AI95-00220-01>} {<AI95-00262-01AI95-00262-01>} the
+ body or subunit of a public descendant of that library unit, but
+ not a subprogram body acting as a subprogram declaration (see *note
10.1.4::); or
11/2
- * {AI95-00262-01AI95-00262-01} the declaration of a public descendant
- of that library unit, in which case the with_clause shall include
- the reserved word private.
+ * {<AI95-00262-01AI95-00262-01>} the declaration of a public
+ descendant of that library unit, in which case the with_clause
+ shall include the reserved word private.
11.a/2
- Reason: {AI95-00262-01AI95-00262-01} The purpose of this rule
- is to prevent a private child from being visible from outside
- the subsystem rooted at its parent. A private child can be
- semantically depended-on without violating this principle if
- it is used in a private with_clause.
+ Reason: {<AI95-00262-01AI95-00262-01>} The purpose of this
+ rule is to prevent a private child from being visible from
+ outside the subsystem rooted at its parent. A private child
+ can be semantically depended-on without violating this
+ principle if it is used in a private with_clause.
11.b
Discussion: This rule violates the one-pass context_clauses
@@ -49508,7 +49679,7 @@ given compilation_unit shall be one of:
end A.B.C.D;
11.h
- with A.B.C; -- (1)
+ with A.B.C; -- <(1)>
private package A.B.X is
end A.B.X;
@@ -49517,30 +49688,30 @@ given compilation_unit shall be one of:
end A.B.Y;
11.j
- with A.B.C; -- (2)
+ with A.B.C; -- <(2)>
package body A.B.Y is
end A.B.Y;
11.j.1/2
- private with A.B.C; -- (3)
+ private with A.B.C; -- <(3)>
package A.B.Z is
end A.B.Z;
11.k/2
- {AI95-00262-01AI95-00262-01} (1) is OK because it's a private
- child of A.B -- it would be illegal if we made A.B.X a public
- child of A.B. (2) is OK because it's the body of a child of
- A.B. (3) is OK because it's a child of A.B, and it is a
- private with_clause. It would be illegal to say "with A.B.C;"
- on any library_item whose name does not start with "A.B". Note
- that mentioning A.B.C.D in a with_clause automatically
- mentions A.B.C as well, so "with A.B.C.D;" is illegal in the
- same places as "with A.B.C;".
+ {<AI95-00262-01AI95-00262-01>} (1) is OK because it's a
+ private child of A.B -- it would be illegal if we made A.B.X a
+ public child of A.B. (2) is OK because it's the body of a
+ child of A.B. (3) is OK because it's a child of A.B, and it is
+ a private with_clause. It would be illegal to say "with
+ A.B.C;" on any library_item whose name does not start with
+ "A.B". Note that mentioning A.B.C.D in a with_clause
+ automatically mentions A.B.C as well, so "with A.B.C.D;" is
+ illegal in the same places as "with A.B.C;".
12/3
-{AI05-0005-1AI05-0005-1} {AI95-00262-01AI95-00262-01}
-{AI95-00262-01AI95-00262-01} {AI05-0077-1AI05-0077-1}
-{AI05-0122-1AI05-0122-1} A name denoting a library_item (or the
+{<AI05-0005-1AI05-0005-1>} {<AI95-00262-01AI95-00262-01>}
+{<AI95-00262-01AI95-00262-01>} {<AI05-0077-1AI05-0077-1>}
+{<AI05-0122-1AI05-0122-1>} A name denoting a library_item (or the
corresponding declaration for a child of a generic within an instance --
see *note 10.1.1::), if it is visible only due to being mentioned in one
or more with_clauses that include the reserved word private, shall
@@ -49567,7 +49738,7 @@ appear only within:
with_clause that does not include private.
16.b/3
- Reason: {AI05-0077-1AI05-0077-1} These rules make the
+ Reason: {<AI05-0077-1AI05-0077-1>} These rules make the
library_item visible anywhere that is not visible outside the
subsystem rooted at the compilation_unit having the private
with_clause, including private parts of packages nested in the
@@ -49609,7 +49780,7 @@ appear only within:
meant A.B, they still can say that.
17/2
-{AI95-00217-06AI95-00217-06} [A library_item mentioned in a
+{<AI95-00217-06AI95-00217-06>} [A library_item mentioned in a
limited_with_clause shall be the implicit declaration of the limited
view of a library package, not the declaration of a subprogram, generic
unit, generic instance, or a renaming.]
@@ -49620,12 +49791,12 @@ unit, generic instance, or a renaming.]
10.1.6::.
18/2
-{AI95-00217-06AI95-00217-06} {AI95-00412-01AI95-00412-01} A
+{<AI95-00217-06AI95-00217-06>} {<AI95-00412-01AI95-00412-01>} A
limited_with_clause shall not appear on a library_unit_body, subunit, or
library_unit_renaming_declaration (*note 10.1.1: S0250.).
18.a/2
- Reason: {AI95-00412-01AI95-00412-01} We don't allow a
+ Reason: {<AI95-00412-01AI95-00412-01>} We don't allow a
limited_with_clause on a library_unit_renaming_declaration
(*note 10.1.1: S0250.) because it would be useless and
therefore probably is a mistake. A renaming cannot appear in
@@ -49638,11 +49809,11 @@ library_unit_renaming_declaration (*note 10.1.1:
S0250.).
appear, so we simply make writing it illegal.
19/2
-{AI95-00217-06AI95-00217-06} A limited_with_clause that names a library
-package shall not appear:
+{<AI95-00217-06AI95-00217-06>} A limited_with_clause that names a
+library package shall not appear:
20/3
- * {AI95-00217-06AI95-00217-06} {AI05-0040-1AI05-0040-1} in the
+ * {<AI95-00217-06AI95-00217-06>} {<AI05-0040-1AI05-0040-1>} in the
context_clause for the explicit declaration of the named library
package or any of its descendants;
@@ -49670,7 +49841,7 @@ package shall not appear:
a dependence can be broken.
20.f/3
- {AI05-0040-1AI05-0040-1} The part about descendants catches
+ {<AI05-0040-1AI05-0040-1>} The part about descendants catches
examples like
20.g/3
@@ -49678,18 +49849,18 @@ package shall not appear:
package P.Child is ...
21/3
- * {AI95-00217-06AI95-00217-06} {AI05-0077-1AI05-0077-1}
- {AI05-0262-1AI05-0262-1} within a context_clause for a library_item
- that is within the scope of a nonlimited_with_clause that mentions
- the same library package; or
+ * {<AI95-00217-06AI95-00217-06>} {<AI05-0077-1AI05-0077-1>}
+ {<AI05-0262-1AI05-0262-1>} within a context_clause for a
+ library_item that is within the scope of a nonlimited_with_clause
+ that mentions the same library package; or
21.a.1/3
- Ramification: {AI05-0077-1AI05-0077-1} This applies to
+ Ramification: {<AI05-0077-1AI05-0077-1>} This applies to
nonlimited_with_clauses found in the same context_clause, as
well as nonlimited_with_clauses found on parent units.
21.a/3
- Reason: {AI05-0077-1AI05-0077-1} Such a limited_with_clause
+ Reason: {<AI05-0077-1AI05-0077-1>} Such a limited_with_clause
could have no effect, and would be confusing. If a
nonlimited_with_clause for the same package is inherited from
a parent unit or given in the context_clause, the full view is
@@ -49697,13 +49868,14 @@ package shall not appear:
limited view.
22/3
- * {AI95-00217-06AI95-00217-06} {AI05-0077-1AI05-0077-1}
- {AI05-0262-1AI05-0262-1} within a context_clause for a library_item
- that is within the scope of a use_clause that names an entity
- declared within the declarative region of the library package.
+ * {<AI95-00217-06AI95-00217-06>} {<AI05-0077-1AI05-0077-1>}
+ {<AI05-0262-1AI05-0262-1>} within a context_clause for a
+ library_item that is within the scope of a use_clause that names an
+ entity declared within the declarative region of the library
+ package.
22.a.1/3
- Ramification: {AI05-0077-1AI05-0077-1} This applies to
+ Ramification: {<AI05-0077-1AI05-0077-1>} This applies to
use_clauses found in the same context_clause, as well as
use_clauses found in (or on) parent units.
@@ -49717,7 +49889,7 @@ package shall not appear:
NOTES
23/2
- 3 {AI95-00217-06AI95-00217-06} A library_item mentioned in a
+ 3 {<AI95-00217-06AI95-00217-06>} A library_item mentioned in a
nonlimited_with_clause of a compilation unit is visible within the
compilation unit and hence acts just like an ordinary declaration.
Thus, within a compilation unit that mentions its declaration, the
@@ -49750,18 +49922,18 @@ package shall not appear:
_Examples_
24/2
- {AI95-00433-01AI95-00433-01} package Office is
+ {<AI95-00433-01AI95-00433-01>} package Office is
end Office;
25/2
- {AI95-00433-01AI95-00433-01} with Ada.Strings.Unbounded;
+ {<AI95-00433-01AI95-00433-01>} with Ada.Strings.Unbounded;
package Office.Locations is
type Location is new Ada.Strings.Unbounded.Unbounded_String;
end Office.Locations;
26/2
- {AI95-00433-01AI95-00433-01} limited with Office.Departments; -- types
are incomplete
- private with Office.Locations; -- only visible in private part
+ {<AI95-00433-01AI95-00433-01>} limited with Office.Departments; --<
types are incomplete>
+ private with Office.Locations; --< only visible in private part>
package Office.Employees is
type Employee is private;
@@ -49794,7 +49966,7 @@ package shall not appear:
end Office.Departments;
31/2
-{AI95-00433-01AI95-00433-01} The limited_with_clause may be used to
+{<AI95-00433-01AI95-00433-01>} The limited_with_clause may be used to
support mutually dependent abstractions that are split across multiple
packages. In this case, an employee is assigned to a department, and a
department has a manager who is an employee. If a with_clause with the
@@ -49839,7 +50011,7 @@ visible part of the first unit.
_Incompatibilities With Ada 95_
31.f/2
- {AI95-00220-01AI95-00220-01} Amendment Correction: A
+ {<AI95-00220-01AI95-00220-01>} Amendment Correction: A
subprogram body acting as a declaration cannot with a private
child unit. This would allow public export of types declared
in private child packages, and thus cannot be allowed. This
@@ -49849,13 +50021,13 @@ visible part of the first unit.
_Extensions to Ada 95_
31.g/2
- {AI95-00217-06AI95-00217-06} limited_with_clauses are new.
+ {<AI95-00217-06AI95-00217-06>} limited_with_clauses are new.
They make a limited view of a package visible, where all of
the types in the package are incomplete. They facilitate
construction of mutually recursive types in multiple packages.
31.h/3
- {AI95-00262-01AI95-00262-01} {AI05-0077-1AI05-0077-1} The
+ {<AI95-00262-01AI95-00262-01>} {<AI05-0077-1AI05-0077-1>} The
syntax rules for with_clause are modified to allow the
reserved word private. Private with_clauses do not allow the
use of their library_item in the visible part of their
@@ -49865,8 +50037,8 @@ visible part of the first unit.
_Incompatibilities With Ada 2005_
31.i/3
- {AI05-0040-1AI05-0040-1} Correction: Added missing rule that a
- limited with clause cannot name an ancestor unit. This is
+ {<AI05-0040-1AI05-0040-1>} Correction: Added missing rule that
+ a limited with clause cannot name an ancestor unit. This is
incompatible if an Ada 2005 program does this, but as this is
a new Ada 2005 feature and the unintentionally allowed
capability is not useful, the incompatibility is very unlikely
@@ -49875,14 +50047,14 @@ visible part of the first unit.
_Wording Changes from Ada 2005_
31.j/3
- {AI05-0077-1AI05-0077-1} Correction: Fixed wording so that we
- are not checking whether something in a context_clause is
+ {<AI05-0077-1AI05-0077-1>} Correction: Fixed wording so that
+ we are not checking whether something in a context_clause is
"within the scope of" something, as context_clauses are never
included in anything's scope. The intended meaning is
unchanged, however.
31.k/3
- {AI05-0122-1AI05-0122-1} Correction: Fixed wording so the
+ {<AI05-0122-1AI05-0122-1>} Correction: Fixed wording so the
rules for private with clauses also apply to "sprouted"
generic child units.
@@ -49906,7 +50078,7 @@ parent's body can be visible within the subunits.]
task_body_stub | protected_body_stub
3/3
- {AI95-00218-03AI95-00218-03} {AI05-0267-1AI05-0267-1}
+ {<AI95-00218-03AI95-00218-03>} {<AI05-0267-1AI05-0267-1>}
subprogram_body_stub ::=
[overriding_indicator]
subprogram_specification is separate
@@ -49918,17 +50090,17 @@ parent's body can be visible within the subunits.]
Compilation Units - Library Units".
4/3
- {AI05-0267-1AI05-0267-1} package_body_stub ::=
+ {<AI05-0267-1AI05-0267-1>} package_body_stub ::=
package body defining_identifier is separate
[aspect_specification];
5/3
- {AI05-0267-1AI05-0267-1} task_body_stub ::=
+ {<AI05-0267-1AI05-0267-1>} task_body_stub ::=
task body defining_identifier is separate
[aspect_specification];
6/3
- {AI05-0267-1AI05-0267-1} protected_body_stub ::=
+ {<AI05-0267-1AI05-0267-1>} protected_body_stub ::=
protected body defining_identifier is separate
[aspect_specification];
@@ -49938,15 +50110,15 @@ parent's body can be visible within the subunits.]
_Legality Rules_
8/2
-{AI95-00243-01AI95-00243-01} The parent body of a subunit is the body of
-the program unit denoted by its parent_unit_name. The term subunit is
-used to refer to a subunit and also to the proper_body of a subunit.
-The subunits of a program unit include any subunit that names that
-program unit as its parent, as well as any subunit that names such a
-subunit as its parent (recursively).
+{<AI95-00243-01AI95-00243-01>} The <parent body> of a subunit is the
+body of the program unit denoted by its parent_unit_name. The term
+<subunit> is used to refer to a subunit and also to the proper_body of a
+subunit. The <subunits of a program unit> include any subunit that
+names that program unit as its parent, as well as any subunit that names
+such a subunit as its parent (recursively).
8.a.1/2
- Reason: {AI95-00243-01AI95-00243-01} We want any rule that
+ Reason: {<AI95-00243-01AI95-00243-01>} We want any rule that
applies to a subunit to apply to a subunit of a subunit as
well.
@@ -49960,11 +50132,12 @@ defining_identifier as the subunit.
subunit is not a complete context.
10/3
-{AI05-0004-1AI05-0004-1} A package_body_stub shall be the completion of
-a package_declaration (*note 7.1: S0190.) or generic_package_declaration
-(*note 12.1: S0273.); a task_body_stub (*note 10.1.3: S0261.) shall be
-the completion of a task declaration; a protected_body_stub (*note
-10.1.3: S0262.) shall be the completion of a protected declaration.
+{<AI05-0004-1AI05-0004-1>} A package_body_stub shall be the completion
+of a package_declaration (*note 7.1: S0190.) or
+generic_package_declaration (*note 12.1: S0273.); a task_body_stub
+(*note 10.1.3: S0261.) shall be the completion of a task declaration; a
+protected_body_stub (*note 10.1.3: S0262.) shall be the completion of a
+protected declaration.
11
In contrast, a subprogram_body_stub need not be the completion of a
@@ -49972,7 +50145,7 @@ previous declaration, [in which case the _stub declares
the subprogram].
If the _stub is a completion, it shall be the completion of a
subprogram_declaration or generic_subprogram_declaration. The profile
of a subprogram_body_stub that completes a declaration shall conform
-fully to that of the declaration.
+fully to that of the declaration.
11.a
Discussion: The part about subprogram_body_stubs echoes the
@@ -49983,7 +50156,7 @@ fully to that of the declaration.
A subunit that corresponds to a body_stub shall be of the same kind
(package_, subprogram_, task_, or protected_) as the body_stub. The
profile of a subprogram_body subunit shall be fully conformant to that
-of the corresponding body_stub.
+of the corresponding body_stub.
13
A body_stub shall appear immediately within the declarative_part of a
@@ -50098,20 +50271,21 @@ the same):
_Extensions to Ada 95_
24.b/2
- {AI95-00218-03AI95-00218-03} An overriding_indicator (see
+ {<AI95-00218-03AI95-00218-03>} An overriding_indicator (see
*note 8.3.1::) is allowed on a subprogram stub.
_Wording Changes from Ada 95_
24.c/2
- {AI95-00243-01AI95-00243-01} Clarified that a subunit of a
+ {<AI95-00243-01AI95-00243-01>} Clarified that a subunit of a
subunit is still a subunit.
_Extensions to Ada 2005_
24.d/3
- {AI05-0267-1AI05-0267-1} An optional aspect_specification can
- be used in a body_stub. This is described in *note 13.1.1::.
+ {<AI05-0267-1AI05-0267-1>} An optional aspect_specification
+ can be used in a body_stub. This is described in *note
+ 13.1.1::.
File: aarm2012.info, Node: 10.1.4, Next: 10.1.5, Prev: 10.1.3, Up: 10.1
@@ -50121,11 +50295,11 @@ File: aarm2012.info, Node: 10.1.4, Next: 10.1.5,
Prev: 10.1.3, Up: 10.1
1
Each compilation unit submitted to the compiler is compiled in the
-context of an environment declarative_part (or simply, an environment),
-which is a conceptual declarative_part that forms the outermost
-declarative region of the context of any compilation. At run time, an
-environment forms the declarative_part of the body of the environment
-task of a partition (see *note 10.2::, "*note 10.2:: Program
+context of an <environment> declarative_part (or simply, an
+<environment>), which is a conceptual declarative_part that forms the
+outermost declarative region of the context of any compilation. At run
+time, an environment forms the declarative_part of the body of the
+environment task of a partition (see *note 10.2::, "*note 10.2:: Program
Execution").
1.a
@@ -50148,11 +50322,11 @@ needed to make declarations of library units visible
(see *note
10.1.2::).
3/2
-{AI95-00217-06AI95-00217-06} The mechanisms for creating an environment
-and for adding and replacing compilation units within an environment are
-implementation defined. The mechanisms for adding a compilation unit
-mentioned in a limited_with_clause to an environment are implementation
-defined.
+{<AI95-00217-06AI95-00217-06>} The mechanisms for creating an
+environment and for adding and replacing compilation units within an
+environment are implementation defined. The mechanisms for adding a
+compilation unit mentioned in a limited_with_clause to an environment
+are implementation defined.
3.a
Implementation defined: The mechanisms for creating an
@@ -50177,8 +50351,8 @@ defined.
_Name Resolution Rules_
4/3
-{8652/00328652/0032} {AI95-00192-01AI95-00192-01}
-{AI05-0264-1AI05-0264-1} If a library_unit_body that is a
+{<8652/00328652/0032>} {<AI95-00192-01AI95-00192-01>}
+{<AI05-0264-1AI05-0264-1>} If a library_unit_body that is a
subprogram_body is submitted to the compiler, it is interpreted only as
a completion if a library_unit_declaration with the same
defining_program_unit_name already exists in the environment for a
@@ -50214,7 +50388,7 @@ is interpreted as both the declaration and body of a
library subprogram.
5
When a compilation unit is compiled, all compilation units upon which it
depends semantically shall already exist in the environment; the set of
-these compilation units shall be consistent in the sense that the new
+these compilation units shall be <consistent> in the sense that the new
compilation unit shall not semantically depend (directly or indirectly)
on two different versions of the same compilation unit, nor on an
earlier version of itself.
@@ -50241,14 +50415,14 @@ earlier version of itself.
detect errors without looking at A's body.
5.d/3
- {AI05-0229-1AI05-0229-1} Similarly, the implementation has to
- be able to compile a call to a subprogram for which aspect
+ {<AI05-0229-1AI05-0229-1>} Similarly, the implementation has
+ to be able to compile a call to a subprogram for which aspect
Inline has been specified without seeing the body of that
subprogram -- inlining would not be achieved in this case, but
the call is still legal.
5.e/3
- {AI95-00217-06AI95-00217-06} {AI05-0005-1AI05-0005-1} The
+ {<AI95-00217-06AI95-00217-06>} {<AI05-0005-1AI05-0005-1>} The
consistency rule applies to limited views as well as the full
view of a compilation unit. That means that an implementation
needs a way to enforce consistency of limited views, not just
@@ -50257,13 +50431,13 @@ earlier version of itself.
_Implementation Permissions_
6/2
-{AI95-00217-06AI95-00217-06} The implementation may require that a
+{<AI95-00217-06AI95-00217-06>} The implementation may require that a
compilation unit be legal before it can be mentioned in a
limited_with_clause or it can be inserted into the environment.
7/3
-{AI95-00214-01AI95-00214-01} {AI05-0229-1AI05-0229-1} When a compilation
-unit that declares or renames a library unit is added to the
+{<AI95-00214-01AI95-00214-01>} {<AI05-0229-1AI05-0229-1>} When a
+compilation unit that declares or renames a library unit is added to the
environment, the implementation may remove from the environment any
preexisting library_item or subunit with the same full expanded name.
When a compilation unit that is a subunit or the body of a library unit
@@ -50280,7 +50454,7 @@ implementation may also remove any compilation unit
containing a call to
that subprogram.
7.a/3
- Ramification: {AI05-0005-1AI05-0005-1} The permissions given
+ Ramification: {<AI05-0005-1AI05-0005-1>} The permissions given
in this paragraph correspond to the traditional model, where
compilation units enter the environment by being compiled into
it, and the compiler checks their legality at that time. An
@@ -50307,7 +50481,7 @@ that subprogram.
triggered all this.
7.d/3
- {AI05-0229-1AI05-0229-1} An implementation may have other
+ {<AI05-0229-1AI05-0229-1>} An implementation may have other
modes in which compilation units in addition to the ones
mentioned above are removed. For example, an implementation
might inline subprogram calls without an explicit aspect
@@ -50317,17 +50491,17 @@ that subprogram.
user to resubmit them to the compiler.
7.d.1/2
- Discussion: {8652/01088652/0108} {AI95-00077-01AI95-00077-01}
- {AI95-00114-01AI95-00114-01} In the standard mode,
- implementations may only remove units from the environment for
- one of the reasons listed here, or in response to an explicit
- user command to modify the environment. It is not intended
- that the act of compiling a unit is one of the "mechanisms"
- for removing units other than those specified by this
- International Standard.
+ Discussion: {<8652/01088652/0108>}
+ {<AI95-00077-01AI95-00077-01>} {<AI95-00114-01AI95-00114-01>}
+ In the standard mode, implementations may only remove units
+ from the environment for one of the reasons listed here, or in
+ response to an explicit user command to modify the
+ environment. It is not intended that the act of compiling a
+ unit is one of the "mechanisms" for removing units other than
+ those specified by this International Standard.
7.e/2
- {AI95-00214-01AI95-00214-01} These rules are intended to
+ {<AI95-00214-01AI95-00214-01>} These rules are intended to
ensure that an implementation never need keep more than one
compilation unit with any full expanded name. In particular,
it is not necessary to be able to have a subunit and a child
@@ -50341,18 +50515,18 @@ that subprogram.
single compilation unit.
8.a/3
- Ramification: {AI05-0299-1AI05-0299-1} Note that Clause *note
- 1:: requires an implementation to detect illegal compilation
- units at compile time.
+ Ramification: {<AI05-0299-1AI05-0299-1>} Note that Clause
+ *note 1:: requires an implementation to detect illegal
+ compilation units at compile time.
9
- 6 An implementation may support a concept of a library, which
+ 6 An implementation may support a concept of a <library>, which
contains library_items. If multiple libraries are supported, the
implementation has to define how a single environment is
constructed when a compilation unit is submitted to the compiler.
Naming conflicts between different libraries might be resolved by
treating each library as the root of a hierarchy of child library
- units.
+ units.
9.a
Implementation Note: Alternatively, naming conflicts could be
@@ -50385,8 +50559,8 @@ that subprogram.
_Extensions to Ada 83_
10.b/2
- {AI95-00077-01AI95-00077-01} {AI95-00114-01AI95-00114-01} Ada
- 83 allowed implementations to require that the body of a
+ {<AI95-00077-01AI95-00077-01>} {<AI95-00114-01AI95-00114-01>}
+ Ada 83 allowed implementations to require that the body of a
generic unit be available when the instantiation is compiled;
that permission is dropped in Ada 95. This isn't really an
extension (it doesn't allow Ada users to write anything that
@@ -50397,19 +50571,19 @@ that subprogram.
_Wording Changes from Ada 95_
10.c/2
- {8652/00328652/0032} {AI95-00192-01AI95-00192-01} Corrigendum:
- The wording was clarified to ensure that a subprogram_body is
- not considered a completion of an instance of a generic
- subprogram.
+ {<8652/00328652/0032>} {<AI95-00192-01AI95-00192-01>}
+ Corrigendum: The wording was clarified to ensure that a
+ subprogram_body is not considered a completion of an instance
+ of a generic subprogram.
10.d/2
- {AI95-00214-01AI95-00214-01} The permissions to remove a unit
- from the environment were clarified to ensure that it is never
- necessary to keep multiple (sub)units with the same full
+ {<AI95-00214-01AI95-00214-01>} The permissions to remove a
+ unit from the environment were clarified to ensure that it is
+ never necessary to keep multiple (sub)units with the same full
expanded name in the environment.
10.e/2
- {AI95-00217-06AI95-00217-06} Units mentioned in a
+ {<AI95-00217-06AI95-00217-06>} Units mentioned in a
limited_with_clause were added to several rules; limited views
have the same presence in the environment as the corresponding
full views.
@@ -50427,8 +50601,8 @@ units, and compilations.]
_Name Resolution Rules_
2
-Certain pragmas are defined to be program unit pragmas. A name given as
-the argument of a program unit pragma shall resolve to denote the
+Certain pragmas are defined to be <program unit pragmas>. A name given
+as the argument of a program unit pragma shall resolve to denote the
declarations or renamings of one or more program units that occur
immediately within the declarative region or compilation in which the
pragma immediately occurs, or it shall resolve to denote the declaration
@@ -50460,7 +50634,7 @@ A program unit pragma shall appear in one of these
places:
library_unit_declaration.
5/1
- * {8652/00338652/0033} {AI95-00136-01AI95-00136-01} Immediately
+ * {<8652/00338652/0033>} {<AI95-00136-01AI95-00136-01>} Immediately
within the visible part of a program unit and before any nested
declaration (but not within a generic formal part), in which case
the argument, if any, shall be a direct_name that denotes the
@@ -50485,9 +50659,9 @@ A program unit pragma shall appear in one of these
places:
have to put the pragma inside.
7/3
-{AI05-0132-1AI05-0132-1} Certain program unit pragmas are defined to be
-library unit pragmas. If a library unit pragma applies to a program
-unit, the program unit shall be a library unit.
+{<AI05-0132-1AI05-0132-1>} Certain program unit pragmas are defined to
+be <library unit pragmas>. If a library unit pragma applies to a
+program unit, the program unit shall be a library unit.
7.a
Ramification: This, together with the rules for program unit
@@ -50501,14 +50675,14 @@ unit, the program unit shall be a library unit.
_Static Semantics_
7.1/1
-{8652/00348652/0034} {AI95-00041-01AI95-00041-01} A library unit pragma
-that applies to a generic unit does not apply to its instances, unless a
-specific rule for the pragma specifies the contrary.
+{<8652/00348652/0034>} {<AI95-00041-01AI95-00041-01>} A library unit
+pragma that applies to a generic unit does not apply to its instances,
+unless a specific rule for the pragma specifies the contrary.
_Post-Compilation Rules_
8
-Certain pragmas are defined to be configuration pragmas; they shall
+Certain pragmas are defined to be <configuration pragmas>; they shall
appear before the first compilation_unit of a compilation. [They are
generally used to select a partition-wide or system-wide option.] The
pragma applies to all compilation_units appearing in the compilation,
@@ -50518,7 +50692,7 @@ compilation_units compiled into the same environment.
_Implementation Permissions_
9/2
-{AI95-00212-01AI95-00212-01} An implementation may require that
+{<AI95-00212-01AI95-00212-01>} An implementation may require that
configuration pragmas that select partition-wide or system-wide options
be compiled when the environment contains no library_items other than
those of the predefined environment. In this case, the implementation
@@ -50528,7 +50702,7 @@ confirm the initially selected partition-wide or
system-wide options.
_Implementation Advice_
10/1
-{8652/00348652/0034} {AI95-00041-01AI95-00041-01} When applied to a
+{<8652/00348652/0034>} {<AI95-00041-01AI95-00041-01>} When applied to a
generic unit, a program unit pragma that is not a library unit pragma
should apply to each instance of the generic unit for which there is not
an overriding pragma applied directly to the instance.
@@ -50542,14 +50716,15 @@ an overriding pragma applied directly to the instance.
_Wording Changes from Ada 95_
10.b/2
- {8652/00338652/0033} {AI95-00136-01AI95-00136-01} Corrigendum:
- The wording was corrected to ensure that a program unit pragma
- cannot appear in private parts or generic formal parts.
+ {<8652/00338652/0033>} {<AI95-00136-01AI95-00136-01>}
+ Corrigendum: The wording was corrected to ensure that a
+ program unit pragma cannot appear in private parts or generic
+ formal parts.
10.c/2
- {8652/00348652/0034} {AI95-00041-01AI95-00041-01} Corrigendum:
- The wording was clarified to explain the meaning of program
- unit and library unit pragmas in generic units.
+ {<8652/00348652/0034>} {<AI95-00041-01AI95-00041-01>}
+ Corrigendum: The wording was clarified to explain the meaning
+ of program unit and library unit pragmas in generic units.
10.d/2
The Implementation Advice added by the Corrigendum was moved,
@@ -50558,7 +50733,7 @@ an overriding pragma applied directly to the instance.
Static Semantics rule.
10.e/2
- {AI95-00212-01AI95-00212-01} The permission to place
+ {<AI95-00212-01AI95-00212-01>} The permission to place
restrictions was clarified to:
10.f/2
@@ -50573,7 +50748,7 @@ an overriding pragma applied directly to the instance.
_Wording Changes from Ada 2005_
10.h/3
- {AI05-0132-1AI05-0132-1} Correction: A library unit pragma
+ {<AI05-0132-1AI05-0132-1>} Correction: A library unit pragma
must apply directly to a library unit, even if no name is
given in the pragma.
@@ -50592,7 +50767,7 @@ given here.]
_Static Semantics_
2/2
-{AI95-00217-06AI95-00217-06} {AI95-00312-01AI95-00312-01} Within the
+{<AI95-00217-06AI95-00217-06>} {<AI95-00312-01AI95-00312-01>} Within the
parent_unit_name at the beginning of an explicit library_item, and
within a nonlimited_with_clause, the only declarations that are visible
are those that are explicit library_items of the environment, and the
@@ -50620,7 +50795,7 @@ the implicit declaration of the limited view of a root
library package.
parent.
2.c.1/2
- {AI95-00217-06AI95-00217-06} Only compilation units defining
+ {<AI95-00217-06AI95-00217-06>} Only compilation units defining
limited views can be mentioned in a limited_with_clause, while
only compilation units defining full views (that is, the
explicit declarations) can be mentioned in a
@@ -50628,7 +50803,7 @@ the implicit declaration of the limited view of a root
library package.
in having two compilation units with the same defining name.
2.d/2
- This paragraph was deleted.{AI95-00312-01AI95-00312-01}
+ <This paragraph was deleted.>{<AI95-00312-01AI95-00312-01>}
3
Within a use_clause or pragma that is within a context_clause, each
@@ -50667,12 +50842,12 @@ immediately preceding library_item and each of its
ancestors is visible.
The ancestor root library_item is directly visible.
6/2
-{AI95-00312-01AI95-00312-01} Notwithstanding the rules of *note 4.1.3::,
-an expanded name in a with_clause, a pragma in a context_clause, or a
-pragma that appears at the place of a compilation unit may consist of a
-prefix that denotes a generic package and a selector_name that denotes a
-child of that generic package. [(The child is necessarily a generic
-unit; see *note 10.1.1::.)]
+{<AI95-00312-01AI95-00312-01>} Notwithstanding the rules of *note
+4.1.3::, an expanded name in a with_clause, a pragma in a
+context_clause, or a pragma that appears at the place of a compilation
+unit may consist of a prefix that denotes a generic package and a
+selector_name that denotes a child of that generic package. [(The child
+is necessarily a generic unit; see *note 10.1.1::.)]
6.a/2
Reason: This rule allows with A.B; and pragma Elaborate(A.B);
@@ -50705,12 +50880,12 @@ unit; see *note 10.1.1::.)]
_Wording Changes from Ada 95_
6.e/2
- {AI95-00217-06AI95-00217-06} Added separate visibility rules
+ {<AI95-00217-06AI95-00217-06>} Added separate visibility rules
for limited_with_clauses; the existing rules apply only to
nonlimited_with_clauses.
6.f/2
- {AI95-00312-01AI95-00312-01} Clarified that the name of a
+ {<AI95-00312-01AI95-00312-01>} Clarified that the name of a
generic child unit may appear in a pragma in a context_clause.
@@ -50720,8 +50895,8 @@ File: aarm2012.info, Node: 10.2, Prev: 10.1, Up: 10
======================
1
-An Ada program consists of a set of partitions[, which can execute in
-parallel with one another, possibly in a separate address space, and
+An Ada <program> consists of a set of <partitions>[, which can execute
+in parallel with one another, possibly in a separate address space, and
possibly on a separate computer.]
_Post-Compilation Rules_
@@ -50730,10 +50905,10 @@ possibly on a separate computer.]
A partition is a program or part of a program that can be invoked from
outside the Ada implementation. [For example, on many systems, a
partition might be an executable file generated by the system linker.]
-The user can explicitly assign library units to a partition. The
+The user can <explicitly assign> library units to a partition. The
assignment is done in an implementation-defined manner. The compilation
units included in a partition are those of the explicitly assigned
-library units, as well as other compilation units needed by those
+library units, as well as other compilation units <needed by> those
library units. The compilation units needed by a given compilation unit
are determined as follows (unless specified otherwise via an
implementation-defined pragma, or by some other implementation-defined
@@ -50778,7 +50953,7 @@ means):
corresponding library_unit_body;
6/2
- * {AI95-00217-06AI95-00217-06} If a compilation unit with stubs is
+ * {<AI95-00217-06AI95-00217-06>} If a compilation unit with stubs is
needed, then so are any corresponding subunits;
6.a
@@ -50786,7 +50961,7 @@ means):
replaced with the corresponding proper_bodies.
6.1/2
- * {AI95-00217-06AI95-00217-06} If the (implicit) declaration of the
+ * {<AI95-00217-06AI95-00217-06>} If the (implicit) declaration of the
limited view of a library package is needed, then so is the
explicit declaration of the library package.
@@ -50796,7 +50971,7 @@ means):
it in a with_clause.
6.c/2
- {AI95-00217-06AI95-00217-06} A package is included in a
+ {<AI95-00217-06AI95-00217-06>} A package is included in a
partition even if the only reference to it is in a
limited_with_clause. While this isn't strictly necessary (no
objects of types imported from such a unit can be created), it
@@ -50805,7 +50980,7 @@ means):
7
The user can optionally designate (in an implementation-defined manner)
-one subprogram as the main subprogram for the partition. A main
+one subprogram as the <main subprogram> for the partition. A main
subprogram, if specified, shall be a subprogram.
7.a
@@ -50839,9 +51014,9 @@ subprogram, if specified, shall be a subprogram.
other ones.
8
-Each partition has an anonymous environment task[, which is an implicit
-outermost task whose execution elaborates the library_items of the
-environment declarative_part, and then calls the main subprogram, if
+Each partition has an anonymous <environment task>[, which is an
+implicit outermost task whose execution elaborates the library_items of
+the environment declarative_part, and then calls the main subprogram, if
there is one. A partition's execution is that of its tasks.]
8.a
@@ -50854,7 +51029,7 @@ there is one. A partition's execution is that of its
tasks.]
9
[The order of elaboration of library units is determined primarily by
-the elaboration dependences.] There is an elaboration dependence of a
+the <elaboration dependences>.] There is an elaboration dependence of a
given library_item upon another if the given library_item or any of its
subunits depends semantically on the other library_item. In addition,
if a given library_item or any of its subunits has a pragma Elaborate or
@@ -50864,11 +51039,11 @@ other library unit, and, for Elaborate_All only, upon
each library_item
needed by the declaration of the other library unit.
9.a.1/2
- Discussion: {8652/01078652/0107} {AI95-00180-01AI95-00180-01}
- {AI95-00256-01AI95-00256-01} "Mentions" was used informally in
- the above rule; it was not intended to refer to the definition
- of mentions in *note 10.1.2::. It was changed to "names" to
- make this clear.
+ Discussion: {<8652/01078652/0107>}
+ {<AI95-00180-01AI95-00180-01>} {<AI95-00256-01AI95-00256-01>}
+ "Mentions" was used informally in the above rule; it was not
+ intended to refer to the definition of <mentions> in *note
+ 10.1.2::. It was changed to "names" to make this clear.
9.a
See above for a definition of which library_items are "needed
@@ -50890,15 +51065,15 @@ needed by the declaration of the other library unit.
The environment task for a partition has the following structure:
11
- task Environment_Task;
+ task <Environment_Task>;
12
- task body Environment_Task is
- ... (1) -- The environment declarative_part
- -- (that is, the sequence of library_items) goes here.
+ task body <Environment_Task> is
+ ... (1) --< The environment >declarative_part
+ --< (that is, the sequence of >library_item<s) goes here.>
begin
- ... (2) -- Call the main subprogram, if there is one.
- end Environment_Task;
+ ... (2) --< Call the main subprogram, if there is one.>
+ end <Environment_Task>;
12.a
Ramification: The name of the environment task is written in
@@ -50933,8 +51108,8 @@ in which they appear in the environment
declarative_part]:
the library_unit_body will depend on itself.
15/3
- * {AI05-0229-1AI05-0229-1} Any included library_unit_declaration for
- which aspect Elaborate_Body is True [(including when a pragma
+ * {<AI05-0229-1AI05-0229-1>} Any included library_unit_declaration
+ for which aspect Elaborate_Body is True [(including when a pragma
Elaborate_Body applies)] is immediately followed by its
library_unit_body, if included.
@@ -50945,7 +51120,7 @@ in which they appear in the environment
declarative_part]:
unit.
15.b/3
- Proof: {AI05-0229-1AI05-0229-1} Pragma Elaborate_Body sets
+ Proof: {<AI05-0229-1AI05-0229-1>} Pragma Elaborate_Body sets
aspect Elaborate_Body, see *note 10.2.1::.
16
@@ -50958,7 +51133,7 @@ in which they appear in the environment
declarative_part]:
17.a
Discussion: Normally, if two partitions contain the same
- compilation unit, they each contain a separate copy of that
+ compilation unit, they each contain a separate <copy> of that
compilation unit. See *note Annex E::, "*note Annex E::
Distributed Systems" for cases where two partitions share the
same copy of something.
@@ -51049,7 +51224,7 @@ in dynamic linking, or "load-and-go" systems.]
25
The execution of a program consists of the execution of a set of
-partitions. Further details are implementation defined. The execution
+partitions. Further details are implementation defined. The execution
of a partition starts with the execution of its environment task, ends
when the environment task terminates, and includes the executions of all
tasks of the partition. [The execution of the (implicit) task_body of
@@ -51081,7 +51256,7 @@ such tasks, and then finalizes any remaining objects of
the partition.]
Once the environment task has awaited the termination of all other tasks
of the partition, any further attempt to create a task (during
finalization) is a bounded error, and may result in the raising of
-Program_Error either upon creation or activation of the task. If such a
+Program_Error either upon creation or activation of the task. If such a
task is activated, it is not specified whether the task is awaited prior
to termination of the environment task.
@@ -51101,7 +51276,7 @@ the rules of the language.
suppose we compile the following:
27.b
- package A is -- Version 1.
+ package A is --< Version 1.>
...
end A;
@@ -51111,7 +51286,7 @@ the rules of the language.
end B;
27.d
- package A is -- Version 2.
+ package A is --< Version 2.>
...
end A;
@@ -51146,10 +51321,10 @@ the rules of the language.
_Implementation Permissions_
28/3
-{AI05-0299-1AI05-0299-1} The kind of partition described in this
-subclause is known as an active partition. An implementation is allowed
-to support other kinds of partitions, with implementation-defined
-semantics.
+{<AI05-0299-1AI05-0299-1>} The kind of partition described in this
+subclause is known as an <active> partition. An implementation is
+allowed to support other kinds of partitions, with
+implementation-defined semantics.
28.a
Implementation defined: The semantics of any nonactive
@@ -51198,7 +51373,7 @@ abort any dependent tasks.
30.b
The possibility of aborting them is not shown in the
- Environment_Task code above, because there is nowhere to put
+ <Environment_Task> code above, because there is nowhere to put
an exception_handler that can handle exceptions raised in both
the environment declarative_part and the main subprogram, such
that the dependent tasks can be aborted. If we put an
@@ -51306,11 +51481,11 @@ abort any dependent tasks.
_Wording Changes from Ada 95_
34.g/2
- {AI95-00256-01AI95-00256-01} The mistaken use of "mentions" in
- the elaboration dependence rule was fixed.
+ {<AI95-00256-01AI95-00256-01>} The mistaken use of "mentions"
+ in the elaboration dependence rule was fixed.
34.h/2
- {AI95-00217-06AI95-00217-06} The needs relationship was
+ {<AI95-00217-06AI95-00217-06>} The <needs> relationship was
extended to include limited views.
* Menu:
@@ -51373,13 +51548,13 @@ of library_items.]
The form of a pragma Preelaborate is as follows:
3
- pragma Preelaborate[(library_unit_name)];
+ pragma Preelaborate[(<library_unit_>name)];
4
A pragma Preelaborate is a library unit pragma.
4.1/2
- {AI95-00161-01AI95-00161-01} The form of a pragma
+ {<AI95-00161-01AI95-00161-01>} The form of a pragma
Preelaborable_Initialization is as follows:
4.2/2
@@ -51392,7 +51567,7 @@ An elaborable construct is preelaborable unless its
elaboration performs
any of the following actions:
5.a
- Ramification: A preelaborable construct can be elaborated
+ Ramification: A <preelaborable> construct can be elaborated
without using any information that is available only at run
time. Note that we don't try to prevent exceptions in
preelaborable constructs; if the implementation wishes to
@@ -51430,9 +51605,9 @@ any of the following actions:
preelaborated library units.
9/3
- * {AI95-00161-01AI95-00161-01} {AI05-0028-1AI05-0028-1} The creation
- of an object [(including a component)] that is initialized by
- default, if its type does not have preelaborable initialization.
+ * {<AI95-00161-01AI95-00161-01>} {<AI05-0028-1AI05-0028-1>} The
+ creation of an object [(including a component)] that is initialized
+ by default, if its type does not have preelaborable initialization.
Similarly, the evaluation of an extension_aggregate (*note 4.3.2:
S0111.) with an ancestor subtype_mark (*note 3.2.2: S0028.)
denoting a subtype of such a type.
@@ -51448,35 +51623,35 @@ any of the following actions:
forbidding nonnull statements.
9.c/2
- This paragraph was deleted.{AI95-00161-01AI95-00161-01}
+ <This paragraph was deleted.>{<AI95-00161-01AI95-00161-01>}
10/2
-{AI95-00403-01AI95-00403-01} A generic body is preelaborable only if
+{<AI95-00403-01AI95-00403-01>} A generic body is preelaborable only if
elaboration of a corresponding instance body would not perform any such
actions, presuming that:
10.1/3
- * {AI95-00403-01AI95-00403-01} {AI95-0028-1AI95-0028-1} the actual
- for each discriminated formal derived type, formal private type, or
- formal private extension declared within the formal part of the
- generic unit is a type that does not have preelaborable
+ * {<AI95-00403-01AI95-00403-01>} {<AI95-0028-1AI95-0028-1>} the
+ actual for each discriminated formal derived type, formal private
+ type, or formal private extension declared within the formal part
+ of the generic unit is a type that does not have preelaborable
initialization, unless pragma Preelaborable_Initialization has been
applied to the formal type;
10.2/2
- * {AI95-00403-01AI95-00403-01} the actual for each formal type is
+ * {<AI95-00403-01AI95-00403-01>} the actual for each formal type is
nonstatic;
10.3/2
- * {AI95-00403-01AI95-00403-01} the actual for each formal object is
+ * {<AI95-00403-01AI95-00403-01>} the actual for each formal object is
nonstatic; and
10.4/2
- * {AI95-00403-01AI95-00403-01} the actual for each formal subprogram
- is a user-defined subprogram.
+ * {<AI95-00403-01AI95-00403-01>} the actual for each formal
+ subprogram is a user-defined subprogram.
10.a.1/2
- Discussion: {AI95-00403-01AI95-00403-01} This is an
+ Discussion: {<AI95-00403-01AI95-00403-01>} This is an
"assume-the-worst" rule. The elaboration of a generic unit
doesn't perform any of the actions listed above, because its
sole effect is to establish that the generic can from now on
@@ -51496,20 +51671,20 @@ actions, presuming that:
would significantly reduce their usefulness.
11/3
-{8652/00358652/0035} {AI95-00002-01AI95-00002-01}
-{AI05-0034-1AI05-0034-1} {AI05-0243-1AI05-0243-1} A pragma Preelaborate
-(or pragma Pure -- see below) is used to specify that a library unit is
-preelaborated, namely that the Preelaborate aspect of the library unit
-is True; all compilation units of the library unit are preelaborated.
-The declaration and body of a preelaborated library unit, and all
-subunits that are elaborated as part of elaborating the library unit,
-shall be preelaborable. All compilation units of a preelaborated
-library unit shall depend semantically only on declared pure or
-preelaborated library_items. In addition to the places where Legality
-Rules normally apply (see *note 12.3::), these rules also apply in the
-private part of an instance of a generic unit. [ If a library unit is
-preelaborated, then its declaration, if any, and body, if any, are
-elaborated prior to all nonpreelaborated library_items of the
+{<8652/00358652/0035>} {<AI95-00002-01AI95-00002-01>}
+{<AI05-0034-1AI05-0034-1>} {<AI05-0243-1AI05-0243-1>} A pragma
+Preelaborate (or pragma Pure -- see below) is used to specify that a
+library unit is <preelaborated>, namely that the Preelaborate aspect of
+the library unit is True; all compilation units of the library unit are
+preelaborated. The declaration and body of a preelaborated library
+unit, and all subunits that are elaborated as part of elaborating the
+library unit, shall be preelaborable. All compilation units of a
+preelaborated library unit shall depend semantically only on declared
+pure or preelaborated library_items. In addition to the places where
+Legality Rules normally apply (see *note 12.3::), these rules also apply
+in the private part of an instance of a generic unit. [ If a library
+unit is preelaborated, then its declaration, if any, and body, if any,
+are elaborated prior to all nonpreelaborated library_items of the
partition.]
11.a
@@ -51517,8 +51692,8 @@ partition.]
formal private types and extensions.
11.a.1/1
- {8652/00358652/0035} {AI95-00002-01AI95-00002-01} Subunits of
- a preelaborated subprogram unit do not need to be
+ {<8652/00358652/0035>} {<AI95-00002-01AI95-00002-01>} Subunits
+ of a preelaborated subprogram unit do not need to be
preelaborable. This is needed in order to be consistent with
units nested in a subprogram body, which do not need to be
preelaborable even if the subprogram is preelaborated.
@@ -51531,11 +51706,11 @@ partition.]
elaboration is avoided for a given package.
11.1/2
-{AI95-00161-01AI95-00161-01} The following rules specify which entities
-have preelaborable initialization:
+{<AI95-00161-01AI95-00161-01>} The following rules specify which
+entities have <preelaborable initialization>:
11.2/3
- * {AI05-0028-1AI05-0028-1} The partial view of a private type or
+ * {<AI05-0028-1AI05-0028-1>} The partial view of a private type or
private extension, a protected type without entry_declarations, a
generic formal private type, or a generic formal derived type, has
preelaborable initialization if and only if the pragma
@@ -51552,28 +51727,28 @@ have preelaborable initialization:
has preelaborable initialization.
11.4/3
- * {AI05-0028-1AI05-0028-1} {AI05-0221-1AI05-0221-1} A derived type
- has preelaborable initialization if its parent type has
+ * {<AI05-0028-1AI05-0028-1>} {<AI05-0221-1AI05-0221-1>} A derived
+ type has preelaborable initialization if its parent type has
preelaborable initialization and if the noninherited components all
have preelaborable initialization. However, a controlled type with
an Initialize procedure that is not a null procedure does not have
preelaborable initialization.
11.5/2
- * {AI95-00161-01AI95-00161-01} {AI95-00345-01AI95-00345-01} A view of
- a type has preelaborable initialization if it is an elementary
- type, an array type whose component type has preelaborable
- initialization, a record type whose components all have
- preelaborable initialization, or an interface type.
+ * {<AI95-00161-01AI95-00161-01>} {<AI95-00345-01AI95-00345-01>} A
+ view of a type has preelaborable initialization if it is an
+ elementary type, an array type whose component type has
+ preelaborable initialization, a record type whose components all
+ have preelaborable initialization, or an interface type.
11.6/2
-{AI95-00161-01AI95-00161-01} A pragma Preelaborable_Initialization
+{<AI95-00161-01AI95-00161-01>} A pragma Preelaborable_Initialization
specifies that a type has preelaborable initialization. This pragma
shall appear in the visible part of a package or generic package.
11.7/3
-{AI95-00161-01AI95-00161-01} {AI95-00345-01AI95-00345-01}
-{AI05-0028-1AI05-0028-1} If the pragma appears in the first list of
+{<AI95-00161-01AI95-00161-01>} {<AI95-00345-01AI95-00345-01>}
+{<AI05-0028-1AI05-0028-1>} If the pragma appears in the first list of
basic_declarative_items of a package_specification, then the direct_name
shall denote the first subtype of a composite type, and the type shall
be declared immediately within the same package as the pragma. If the
@@ -51582,12 +51757,12 @@ view of the type shall have preelaborable
initialization. If the pragma
is applied to a protected type, the protected type shall not have
entries, and each component of the protected type shall have
preelaborable initialization. For any other composite type, the type
-shall have preelaborable initialization. In addition to the places where
-Legality Rules normally apply (see *note 12.3::), these rules apply also
-in the private part of an instance of a generic unit.
+shall have preelaborable initialization. In addition to the places
+where Legality Rules normally apply (see *note 12.3::), these rules
+apply also in the private part of an instance of a generic unit.
11.c/3
- Reason: {AI05-0028-1AI05-0028-1} The reason why we need the
+ Reason: {<AI05-0028-1AI05-0028-1>} The reason why we need the
pragma for private types, private extensions, and protected
types is fairly clear: the properties of the full view
determine whether the type has preelaborable initialization or
@@ -51601,7 +51776,7 @@ in the private part of an instance of a generic unit.
nasty override of Initialize.
11.8/2
-{AI95-00161-01AI95-00161-01} If the pragma appears in a
+{<AI95-00161-01AI95-00161-01>} If the pragma appears in a
generic_formal_part, then the direct_name shall denote a generic formal
private type or a generic formal derived type declared in the same
generic_formal_part as the pragma. In a generic_instantiation the
@@ -51633,7 +51808,7 @@ that include the given version.
The form of a pragma Pure is as follows:
14
- pragma Pure[(library_unit_name)];
+ pragma Pure[(<library_unit_>name)];
15
A pragma Pure is a library unit pragma.
@@ -51641,9 +51816,9 @@ that include the given version.
_Static Semantics_
15.1/3
-{AI95-00366-01AI95-00366-01} {AI05-0035-1AI05-0035-1} A pure compilation
-unit is a preelaborable compilation unit whose elaboration does not
-perform any of the following actions:
+{<AI95-00366-01AI95-00366-01>} {<AI05-0035-1AI05-0035-1>} A <pure>
+compilation unit is a preelaborable compilation unit whose elaboration
+does not perform any of the following actions:
15.2/2
* the elaboration of a variable declaration;
@@ -51655,7 +51830,7 @@ perform any of the following actions:
evaluates such an allocator;
15.a.1/3
- Reason: {AI05-0004-1AI05-0004-1} Such an allocator would
+ Reason: {<AI05-0004-1AI05-0004-1>} Such an allocator would
provide a backdoor way to get a global variable into a pure
unit, so it is prohibited. Most such allocators are illegal
anyway, as their type is required to have Storage_Size = 0
@@ -51672,22 +51847,22 @@ perform any of the following actions:
end record;
15.a.3/3
- Not_Const : constant Rec (Acc => new Integer'(2)); -- Illegal
in a pure unit.
+ Not_Const : constant Rec (Acc => new Integer'(2)); -- <Illegal
in a pure unit>.
15.a/3
- {AI05-0004-1AI05-0004-1} The second half of the rule is needed
- because aggregates can specify the default initialization of a
- private type or extension using <> or the ancestor subtype of
- an extension aggregate. The subtype of a component could use
- an allocator to initialize an access discriminant; the type
- still could have a pragma Preelaborable_Initialization given.
- Ada 95 did not allow such private types to have preelaborable
- initialization, so such a default initialization could not
- have occurred. Thus this rule is not incompatible with Ada
- 95.
+ {<AI05-0004-1AI05-0004-1>} The second half of the rule is
+ needed because aggregates can specify the default
+ initialization of a private type or extension using <> or the
+ ancestor subtype of an extension aggregate. The subtype of a
+ component could use an allocator to initialize an access
+ discriminant; the type still could have a pragma
+ Preelaborable_Initialization given. Ada 95 did not allow such
+ private types to have preelaborable initialization, so such a
+ default initialization could not have occurred. Thus this
+ rule is not incompatible with Ada 95.
15.4/3
- * {AI05-0035-1AI05-0035-1} the elaboration of the declaration of a
+ * {<AI05-0035-1AI05-0035-1>} the elaboration of the declaration of a
nonderived named access-to-variable type unless the Storage_Size of
the type has been specified by a static expression with value zero
or is defined by the language to be zero;
@@ -51697,7 +51872,7 @@ perform any of the following actions:
E.2.2::) has its Storage_Size defined to be zero.
15.c/2
- Reason: {AI95-00366-01AI95-00366-01} We disallow most named
+ Reason: {<AI95-00366-01AI95-00366-01>} We disallow most named
access-to-object types because an allocator has a side effect;
the pool constitutes variable data. We allow
access-to-subprogram types because they don't have allocators.
@@ -51708,7 +51883,7 @@ perform any of the following actions:
generic body) will raise Storage_Error.
15.5/3
- * {AI05-0035-1AI05-0035-1} the elaboration of the declaration of a
+ * {<AI05-0035-1AI05-0035-1>} the elaboration of the declaration of a
nonderived named access-to-constant type for which the Storage_Size
has been specified by an expression other than a static expression
with value zero.
@@ -51722,13 +51897,14 @@ perform any of the following actions:
count for the storage pool would represent state.
15.6/3
-{AI05-0035-1AI05-0035-1} A generic body is pure only if elaboration of a
-corresponding instance body would not perform any such actions presuming
-any composite formal types have nonvisible components whose default
-initialization evaluates an allocator of an access-to-variable type.
+{<AI05-0035-1AI05-0035-1>} A generic body is pure only if elaboration of
+a corresponding instance body would not perform any such actions
+presuming any composite formal types have nonvisible components whose
+default initialization evaluates an allocator of an access-to-variable
+type.
15.7/2
-{AI95-00366-01AI95-00366-01} The Storage_Size for an anonymous
+{<AI95-00366-01AI95-00366-01>} The Storage_Size for an anonymous
access-to-variable type declared at library level in a library unit that
is declared pure is defined to be zero.
@@ -51747,27 +51923,27 @@ is declared pure is defined to be zero.
_Legality Rules_
16/2
-This paragraph was deleted.{AI95-00366-01AI95-00366-01}
+<This paragraph was deleted.>{<AI95-00366-01AI95-00366-01>}
17/3
-{AI95-00366-01AI95-00366-01} {AI05-0034-1AI05-0034-1}
-{AI05-0035-1AI05-0035-1} {AI05-0243-1AI05-0243-1} A pragma Pure is used
-to specify that a library unit is declared pure, namely that the Pure
-aspect of the library unit is True; all compilation units of the library
-unit are declared pure. In addition, the limited view of any library
-package is declared pure. The declaration and body of a declared pure
-library unit, and all subunits that are elaborated as part of
-elaborating the library unit, shall be pure. All compilation units of a
-declared pure library unit shall depend semantically only on declared
-pure library_items. In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules also apply in the private
-part of an instance of a generic unit. Furthermore, the full view of
-any partial view declared in the visible part of a declared pure library
-unit that has any available stream attributes shall support external
-streaming (see *note 13.13.2::).
+{<AI95-00366-01AI95-00366-01>} {<AI05-0034-1AI05-0034-1>}
+{<AI05-0035-1AI05-0035-1>} {<AI05-0243-1AI05-0243-1>} A pragma Pure is
+used to specify that a library unit is <declared pure>, namely that the
+Pure aspect of the library unit is True; all compilation units of the
+library unit are declared pure. In addition, the limited view of any
+library package is declared pure. The declaration and body of a
+declared pure library unit, and all subunits that are elaborated as part
+of elaborating the library unit, shall be pure. All compilation units
+of a declared pure library unit shall depend semantically only on
+declared pure library_items. In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules also apply in the
+private part of an instance of a generic unit. Furthermore, the full
+view of any partial view declared in the visible part of a declared pure
+library unit that has any available stream attributes shall support
+external streaming (see *note 13.13.2::).
17.a/3
- This paragraph was deleted.{AI05-0243-1AI05-0243-1}
+ <This paragraph was deleted.>{<AI05-0243-1AI05-0243-1>}
17.b
Discussion: A declared-pure package is useful for defining
@@ -51782,19 +51958,19 @@ streaming (see *note 13.13.2::).
true of Ada 83's deferred constants.
17.d/2
- Ramification: {AI95-00366-01AI95-00366-01} Anonymous access
+ Ramification: {<AI95-00366-01AI95-00366-01>} Anonymous access
types are allowed.
17.d.1/3
- {AI05-0243-1AI05-0243-1} A limited view is not a library unit,
- so any rule that starts "declared pure library unit" does not
- apply to a limited view. In particular, the 3rd and last
- sentences never apply to limited views. However, a limited
- view is a library_item, so rules that discuss "declared pure
- library_items" do include limited views.
+ {<AI05-0243-1AI05-0243-1>} A limited view is not a library
+ unit, so any rule that starts "declared pure library unit"
+ does not apply to a limited view. In particular, the 3rd and
+ last sentences never apply to limited views. However, a
+ limited view is a library_item, so rules that discuss
+ "declared pure library_items" do include limited views.
17.e/2
- Reason: {AI95-00366-01AI95-00366-01} Ada 95 didn't allow any
+ Reason: {<AI95-00366-01AI95-00366-01>} Ada 95 didn't allow any
access types as these (including access-to-subprogram types)
cause trouble for *note Annex E::, "*note Annex E::
Distributed Systems", because such types allow access values
@@ -51820,9 +51996,10 @@ streaming (see *note 13.13.2::).
_Erroneous Execution_
17.1/4
-{AI12-0076-1AI12-0076-1} Execution is erroneous if some operation (other
-than the initialization or finalization of the object) modifies the
-value of a constant object declared at library-level in a pure package.
+{<AI12-0076-1AI12-0076-1>} Execution is erroneous if some operation
+(other than the initialization or finalization of the object) modifies
+the value of a constant object declared at library-level in a pure
+package.
17.g/4
Discussion: This could be accomplished via a self-referencing
@@ -51832,23 +52009,24 @@ value of a constant object declared at library-level
in a pure package.
_Implementation Permissions_
18/3
-{AI95-00366-01AI95-00366-01} {AI05-0219-1AI05-0219-1} If a library unit
-is declared pure, then the implementation is permitted to omit a call on
-a library-level subprogram of the library unit if the results are not
-needed after the call. In addition, the implementation may omit a call
-on such a subprogram and simply reuse the results produced by an earlier
-call on the same subprogram, provided that none of the parameters nor
-any object accessible via access values from the parameters have any
-part that is of a type whose full type is an immutably limited type, and
-the addresses and values of all by-reference actual parameters, the
-values of all by-copy-in actual parameters, and the values of all
-objects accessible via access values from the parameters, are the same
-as they were at the earlier call. [This permission applies even if the
-subprogram produces other side effects when called.]
+{<AI95-00366-01AI95-00366-01>} {<AI05-0219-1AI05-0219-1>} If a library
+unit is declared pure, then the implementation is permitted to omit a
+call on a library-level subprogram of the library unit if the results
+are not needed after the call. In addition, the implementation may omit
+a call on such a subprogram and simply reuse the results produced by an
+earlier call on the same subprogram, provided that none of the
+parameters nor any object accessible via access values from the
+parameters have any part that is of a type whose full type is an
+immutably limited type, and the addresses and values of all by-reference
+actual parameters, the values of all by-copy-in actual parameters, and
+the values of all objects accessible via access values from the
+parameters, are the same as they were at the earlier call. [This
+permission applies even if the subprogram produces other side effects
+when called.]
18.a/3
- Discussion: {AI95-00366-01AI95-00366-01}
- {AI05-0005-1AI05-0005-1} {AI05-0299-1AI05-0299-1} A
+ Discussion: {<AI95-00366-01AI95-00366-01>}
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0299-1AI05-0299-1>} A
declared-pure library_item has no variable state. Hence, a
call on one of its (nonnested) subprograms cannot normally
have side effects. Side effects are still possible via
@@ -51870,13 +52048,13 @@ subprogram produces other side effects when called.]
as follows:
20
- pragma Elaborate(library_unit_name{, library_unit_name});
+ pragma Elaborate(<library_unit_>name{, <library_unit_>name});
21
- pragma Elaborate_All(library_unit_name{, library_unit_name});
+ pragma Elaborate_All(<library_unit_>name{, <library_unit_>name});
22
- pragma Elaborate_Body[(library_unit_name)];
+ pragma Elaborate_Body[(<library_unit_>name)];
23
A pragma Elaborate or Elaborate_All is only allowed within a
@@ -51901,17 +52079,18 @@ subprogram produces other side effects when called.]
_Legality Rules_
25/3
-{AI05-0229-1AI05-0229-1} If the aspect Elaborate_Body is True for a
+{<AI05-0229-1AI05-0229-1>} If the aspect Elaborate_Body is True for a
declaration [(including when pragma Elaborate_Body applies)], then the
declaration requires a completion [(a body)].
25.a/3
- Proof: {AI05-0229-1AI05-0229-1} Pragma Elaborate_Body sets the
- aspect (see below).
+ Proof: {<AI05-0229-1AI05-0229-1>} Pragma Elaborate_Body sets
+ the aspect (see below).
25.1/2
-{AI95-00217-06AI95-00217-06} The library_unit_name of a pragma Elaborate
-or Elaborate_All shall denote a nonlimited view of a library unit.
+{<AI95-00217-06AI95-00217-06>} The <library_unit_>name of a pragma
+Elaborate or Elaborate_All shall denote a nonlimited view of a library
+unit.
25.b/2
Reason: These pragmas are intended to prevent elaboration
@@ -51924,10 +52103,10 @@ or Elaborate_All shall denote a nonlimited view of a
library unit.
_Static Semantics_
26/3
-{AI05-0229-1AI05-0229-1} [A pragma Elaborate specifies that the body of
-the named library unit is elaborated before the current library_item. A
-pragma Elaborate_All specifies that each library_item that is needed by
-the named library unit declaration is elaborated before the current
+{<AI05-0229-1AI05-0229-1>} [A pragma Elaborate specifies that the body
+of the named library unit is elaborated before the current library_item.
+A pragma Elaborate_All specifies that each library_item that is needed
+by the named library unit declaration is elaborated before the current
library_item.]
26.a
@@ -51935,11 +52114,11 @@ library_item.]
pragmas is given in *note 10.2::.
26.1/3
-{AI05-0229-1AI05-0229-1} A pragma Elaborate_Body sets the Elaborate_Body
-representation aspect of the library unit to which it applies to the
-value True. [If the Elaborate_Body aspect of a library unit is True,
-the body of the library unit is elaborated immediately after its
-declaration.]
+{<AI05-0229-1AI05-0229-1>} A pragma Elaborate_Body sets the
+Elaborate_Body representation aspect of the library unit to which it
+applies to the value True. [If the Elaborate_Body aspect of a library
+unit is True, the body of the library unit is elaborated immediately
+after its declaration.]
26.a.1/3
Proof: The official statement of the semantics of this aspect
@@ -51968,7 +52147,7 @@ declaration.]
26.d
Discussion: The visibility rules imply that each
- library_unit_name of a pragma Elaborate or Elaborate_All has
+ <library_unit_>name of a pragma Elaborate or Elaborate_All has
to denote a library unit mentioned by a previous with_clause
of the same context_clause.
@@ -51984,8 +52163,8 @@ declaration.]
nonpreelaborable children.
27.a/1
- Ramification: {8652/00358652/0035}
- {AI95-00002-01AI95-00002-01} But generally not
+ Ramification: {<8652/00358652/0035>}
+ {<AI95-00002-01AI95-00002-01>} But generally not
nonpreelaborated subunits. (Nonpreelaborated subunits of
subprograms are allowed as discussed above.)
@@ -51994,8 +52173,8 @@ declaration.]
children.
28.a/1
- Ramification: {8652/00358652/0035}
- {AI95-00002-01AI95-00002-01} But generally not impure
+ Ramification: {<8652/00358652/0035>}
+ {<AI95-00002-01AI95-00002-01>} But generally not impure
subunits. (Impure subunits of subprograms are allowed as
discussed above.)
@@ -52020,7 +52199,7 @@ declaration.]
_Incompatibilities With Ada 95_
28.e/2
- {AI95-00366-01AI95-00366-01} The requirement that a partial
+ {<AI95-00366-01AI95-00366-01>} The requirement that a partial
view with available stream attributes be externally streamable
can cause an incompatibility in rare cases. If there is a
limited tagged type declared in a pure package with available
@@ -52038,7 +52217,7 @@ declaration.]
as components in a nonlimited type).
28.f/2
- {AI95-00403-01AI95-00403-01} Amendment Correction: Added
+ {<AI95-00403-01AI95-00403-01>} Amendment Correction: Added
wording to cover missing cases for preelaborated generic
units. This is incompatible as a preelaborated unit could
have used a formal object to initialize a library-level
@@ -52050,14 +52229,14 @@ declaration.]
_Extensions to Ada 95_
28.g/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: The concept
- of preelaborable initialization and pragma
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: The
+ concept of preelaborable initialization and pragma
Preelaborable_Initialization are new. These allow more types
of objects to be created in preelaborable units, and fix holes
in the old rules.
28.h/2
- {AI95-00366-01AI95-00366-01} Access-to-subprogram types and
+ {<AI95-00366-01AI95-00366-01>} Access-to-subprogram types and
access-to-object types with a Storage_Size of 0 are allowed in
pure units. The permission to omit calls was adjusted
accordingly (which also fixes a hole in Ada 95, as access
@@ -52067,19 +52246,19 @@ declaration.]
_Wording Changes from Ada 95_
28.i/2
- {AI95-00002-01AI95-00002-01} Corrigendum: The wording was
+ {<AI95-00002-01AI95-00002-01>} Corrigendum: The wording was
changed so that subunits of a preelaborated subprogram are
also preelaborated.
28.j/2
- {AI95-00217-06AI95-00217-06} Disallowed pragma Elaborate and
+ {<AI95-00217-06AI95-00217-06>} Disallowed pragma Elaborate and
Elaborate_All for packages that are mentioned in a
limited_with_clause.
_Incompatibilities With Ada 2005_
28.k/3
- {AI05-0028-1AI05-0028-1} Correction: Corrected a serious
+ {<AI05-0028-1AI05-0028-1>} Correction: Corrected a serious
unintended incompatibility with Ada 95 in the new
preelaboration wording -- explicit initialization of objects
of types that don't have preelaborable initialization was not
@@ -52089,59 +52268,60 @@ declaration.]
restrictive rule (it would fail many ACATS tests if it did).
28.l/3
- {AI05-0035-1AI05-0035-1} Correction: Added an assume-the-worst
- rule for generic bodies (else they would never be checked for
- purity) and added the boilerplate so that the entire generic
- specification is rechecked. Also fixed wording to have
- consistent handling for subunits for Pure and Preelaborate.
- An Ada 95 program could have depended on marking a generic
- pure that was not really pure, although this would defeat the
- purpose of the categorization and likely cause problems with
- distributed programs.
+ {<AI05-0035-1AI05-0035-1>} Correction: Added an
+ assume-the-worst rule for generic bodies (else they would
+ never be checked for purity) and added the boilerplate so that
+ the entire generic specification is rechecked. Also fixed
+ wording to have consistent handling for subunits for Pure and
+ Preelaborate. An Ada 95 program could have depended on
+ marking a generic pure that was not really pure, although this
+ would defeat the purpose of the categorization and likely
+ cause problems with distributed programs.
_Extensions to Ada 2005_
28.m/3
- {AI05-0035-1AI05-0035-1} Correction: Adjusted wording so that
- a subunit can be pure (it is not a library_item, but it is a
- compilation unit).
+ {<AI05-0035-1AI05-0035-1>} Correction: Adjusted wording so
+ that a subunit can be pure (it is not a library_item, but it
+ is a compilation unit).
28.n/3
- {AI05-0035-1AI05-0035-1} Correction: Adjusted wording so that
- the rules for access types only apply to nonderived types
+ {<AI05-0035-1AI05-0035-1>} Correction: Adjusted wording so
+ that the rules for access types only apply to nonderived types
(derived types share their storage pool with their parent, so
if the parent access type is legal, so is any derived type.)
28.o/3
- {AI05-0229-1AI05-0229-1} Elaborate_Body is now an aspect, so
+ {<AI05-0229-1AI05-0229-1>} Elaborate_Body is now an aspect, so
it can be specified by an aspect_specification -- although the
pragma is still preferred by the Standard.
28.p/3
- {AI05-0243-1AI05-0243-1} Pure and Preelaborate are now
+ {<AI05-0243-1AI05-0243-1>} Pure and Preelaborate are now
aspects, so they can be specified by an aspect_specification
-- although the pragmas are still preferred by the Standard.
_Wording Changes from Ada 2005_
28.q/3
- {AI05-0034-1AI05-0034-1} Correction: Added wording so that a
+ {<AI05-0034-1AI05-0034-1>} Correction: Added wording so that a
limited view is always treated as pure, no matter what
categorization is used for the originating unit. This was
undefined in Ada 2005.
28.r/3
- {AI05-0028-1AI05-0028-1} {AI05-0221-1AI05-0221-1} Correction:
- Fixed minor issues with preelaborable initialization (PI):
- null Initialize procedures do not make a type non-PI; formal
- types with pragma PI can be assumed to have PI; formal
- extensions are assumed to not have PI; all composite types can
- have pragma PI (so that the possibility of hidden Initialize
- routines can be handled); added discriminants of a derived
- type are not considered in calculating PI.
+ {<AI05-0028-1AI05-0028-1>} {<AI05-0221-1AI05-0221-1>}
+ Correction: Fixed minor issues with preelaborable
+ initialization (PI): null Initialize procedures do not make a
+ type non-PI; formal types with pragma PI can be assumed to
+ have PI; formal extensions are assumed to not have PI; all
+ composite types can have pragma PI (so that the possibility of
+ hidden Initialize routines can be handled); added
+ discriminants of a derived type are not considered in
+ calculating PI.
28.s/3
- {AI05-0219-1AI05-0219-1} Correction: Clarified that the
+ {<AI05-0219-1AI05-0219-1>} Correction: Clarified that the
implementation permission to omit pure subprogram calls does
not apply if any part of the parameters or any designated
object has a part that is immutably limited. The old wording
@@ -52151,7 +52331,7 @@ declaration.]
_Wording Changes from Ada 2012_
28.t/4
- {AI12-0076-1AI12-0076-1} Corrigendum: Explicitly stated that
+ {<AI12-0076-1AI12-0076-1>} Corrigendum: Explicitly stated that
modifying a library-level constant in a pure package is
erroneous. We don't document this as inconsistent as
implementations certainly can still do whatever they were
@@ -52166,14 +52346,14 @@ File: aarm2012.info, Node: 11, Next: 12, Prev: 10,
Up: Top
*************
1/3
-{AI05-0299-1AI05-0299-1} [This clause defines the facilities for dealing
-with errors or other exceptional situations that arise during program
-execution.] An exception represents a kind of exceptional situation; an
-occurrence of such a situation (at run time) is called an exception
-occurrence. [ To raise an exception is to abandon normal program
-execution so as to draw attention to the fact that the corresponding
-situation has arisen. Performing some actions in response to the arising
-of an exception is called handling the exception. ]
+{<AI05-0299-1AI05-0299-1>} [This clause defines the facilities for
+dealing with errors or other exceptional situations that arise during
+program execution.] An <exception> represents a kind of exceptional
+situation; an occurrence of such a situation (at run time) is called an
+<exception occurrence>. [ To <raise> an exception is to abandon normal
+program execution so as to draw attention to the fact that the
+corresponding situation has arisen. Performing some actions in response
+to the arising of an exception is called <handling> the exception. ]
1.a
To be honest: ...or handling the exception occurrence.
@@ -52186,11 +52366,11 @@ of an exception is called handling the exception. ]
1.c
To be honest: When the meaning is clear from the context, we
- sometimes use "occurrence" as a short-hand for "exception
+ sometimes use "<occurrence>" as a short-hand for "exception
occurrence."
2/3
-{AI05-0043-1AI05-0043-1} {AI05-0258-1AI05-0258-1} [An
+{<AI05-0043-1AI05-0043-1>} {<AI05-0258-1AI05-0258-1>} [An
exception_declaration declares a name for an exception. An exception
can be raised explicitly (for example, by a raise_statement) or
implicitly (for example, by the failure of a language-defined check).
@@ -52215,7 +52395,7 @@ execution.]
_Wording Changes from Ada 2005_
2.b/3
- {AI05-0043-1AI05-0043-1} Correction: Generalized the
+ {<AI05-0043-1AI05-0043-1>} Correction: Generalized the
introductory description of how an exception can be raised so
that it does not appear to cover all of the cases.
@@ -52240,7 +52420,7 @@ An exception_declaration declares a name for an
exception.
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} exception_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} exception_declaration ::=
defining_identifier_list : exception
[aspect_specification];
@@ -52279,7 +52459,7 @@ many times the exception_declaration is elaborated.
partitions of a program.
4
-The predefined exceptions are the ones declared in the declaration of
+The <predefined> exceptions are the ones declared in the declaration of
package Standard: Constraint_Error, Program_Error, Storage_Error, and
Tasking_Error[; one of them is raised when a language-defined check
fails.]
@@ -52295,7 +52475,7 @@ The elaboration of an exception_declaration has no
effect.
6
The execution of any construct raises Storage_Error if there is
-insufficient storage for that execution. The amount of storage needed
+insufficient storage for that execution. The amount of storage needed
for the execution of constructs is unspecified.
6.a
@@ -52306,7 +52486,7 @@ for the execution of constructs is unspecified.
_Examples_
7
-Examples of user-defined exception declarations:
+<Examples of user-defined exception declarations:>
8
Singular : exception;
@@ -52339,8 +52519,8 @@ Examples of user-defined exception declarations:
_Extensions to Ada 2005_
8.c/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a exception_declaration. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a exception_declaration. This is described in
*note 13.1.1::.
@@ -52372,27 +52552,27 @@ exception_handler.]
choice_parameter_specification ::= defining_identifier
5
- exception_choice ::= exception_name | others
+ exception_choice ::= <exception_>name | others
5.a
- To be honest: "Handler" is an abbreviation for
+ To be honest: "<Handler>" is an abbreviation for
"exception_handler."
5.b/3
- {AI05-0299-1AI05-0299-1} Within this clause, we sometimes
- abbreviate "exception_choice" to "choice."
+ {<AI05-0299-1AI05-0299-1>} Within this clause, we sometimes
+ abbreviate "exception_choice" to "<choice>."
_Legality Rules_
5.1/4
-{AI12-0022-1AI12-0022-1} An exception_name of an exception_choice shall
-denote an exception.
+{<AI12-0022-1AI12-0022-1>} An <exception_>name of an exception_choice
+shall denote an exception.
6
-A choice with an exception_name covers the named exception. A choice
-with others covers all exceptions not named by previous choices of the
-same handled_sequence_of_statements (*note 11.2: S0265.). Two choices
-in different exception_handlers of the same
+A choice with an <exception_>name <covers> the named exception. A
+choice with others covers all exceptions not named by previous choices
+of the same handled_sequence_of_statements (*note 11.2: S0265.). Two
+choices in different exception_handlers of the same
handled_sequence_of_statements (*note 11.2: S0265.) shall not cover the
same exception.
@@ -52414,8 +52594,8 @@ A choice with others is allowed only for the last
handler of a
handled_sequence_of_statements and as the only choice of that handler.
8
-An exception_name of a choice shall not denote an exception declared in
-a generic formal package.
+An <exception_>name of a choice shall not denote an exception declared
+in a generic formal package.
8.a
Reason: This is because the compiler doesn't know the identity
@@ -52425,8 +52605,8 @@ a generic formal package.
_Static Semantics_
9
-A choice_parameter_specification declares a choice parameter, which is a
-constant object of type Exception_Occurrence (see *note 11.4.1::).
+A choice_parameter_specification declares a <choice parameter>, which is
+a constant object of type Exception_Occurrence (see *note 11.4.1::).
During the handling of an exception occurrence, the choice parameter, if
any, of the handler represents the exception occurrence that is being
handled.
@@ -52442,15 +52622,15 @@ by the sequence_of_statements (*note 5.1: S0145.).]
_Examples_
11
-Example of an exception handler:
+<Example of an exception handler:>
12
begin
- Open(File, In_File, "input.txt"); -- see *note A.8.2::
+ Open(File, In_File, "input.txt"); --< see *note A.8.2::>
exception
when E : Name_Error =>
Put("Cannot open input file : ");
- Put_Line(Exception_Message(E)); -- see *note 11.4.1::
+ Put_Line(Exception_Message(E)); --< see *note 11.4.1::>
raise;
end;
@@ -52461,7 +52641,7 @@ Example of an exception handler:
choice_parameter_specification.
12.b/2
- {AI95-00114-01AI95-00114-01} Different exception_choices of
+ {<AI95-00114-01AI95-00114-01>} Different exception_choices of
the same exception_handler may cover the same exception. This
allows for "when Numeric_Error | Constraint_Error =>" even
though Numeric_Error is a rename of Constraint_Error. This
@@ -52494,15 +52674,16 @@ File: aarm2012.info, Node: 11.3, Next: 11.4, Prev:
11.2, Up: 11
_Syntax_
2/2
- {AI95-00361-01AI95-00361-01} raise_statement ::= raise;
- | raise exception_name [with string_expression];
+ {<AI95-00361-01AI95-00361-01>} raise_statement ::= raise;
+ | raise <exception_>name [with <string_>expression];
2.1/4
- {AI12-0022-1AI12-0022-1} {AI12-0152-1AI12-0152-1} raise_expression
- ::= raise exception_name [with string_simple_expression]
+ {<AI12-0022-1AI12-0022-1>} {<AI12-0152-1AI12-0152-1>}
+ raise_expression ::= raise <exception_>name [with <string_>
+ simple_expression]
2.2/4
- {AI12-0152-1AI12-0152-1} If a raise_expression appears within the
+ {<AI12-0152-1AI12-0152-1>} If a raise_expression appears within the
expression of one of the following contexts, the raise_expression
shall appear within a pair of parentheses within the expression:
@@ -52622,41 +52803,41 @@ File: aarm2012.info, Node: 11.3, Next: 11.4, Prev:
11.2, Up: 11
_Legality Rules_
3/4
-{AI12-0022-1AI12-0022-1} {AI12-0159-1AI12-0159-1} The exception_name, if
-any, of a raise_statement or raise_expression shall denote an exception.
-A raise_statement with no exception_name (that is, a re-raise statement)
-shall be within a handler, but not within a body enclosed by that
-handler.
+{<AI12-0022-1AI12-0022-1>} {<AI12-0159-1AI12-0159-1>} The
+<exception_>name, if any, of a raise_statement or raise_expression shall
+denote an exception. A raise_statement with no <exception_>name (that
+is, a <re-raise statement>) shall be within a handler, but not within a
+body enclosed by that handler.
_Name Resolution Rules_
3.1/4
-{AI95-00361-01AI95-00361-01} {AI12-0022-1AI12-0022-1}
-{AI12-0152-1AI12-0152-1} The string_expression or
-string_simple_expression, if any, of a raise_statement or
+{<AI95-00361-01AI95-00361-01>} {<AI12-0022-1AI12-0022-1>}
+{<AI12-0152-1AI12-0152-1>} The <string_>expression or
+<string_>simple_expression, if any, of a raise_statement or
raise_expression is expected to be of type String.
3.2/4
-{AI12-0022-1AI12-0022-1} {AI12-0159-1AI12-0159-1} The expected type for
-a raise_expression shall be any single type.
+{<AI12-0022-1AI12-0022-1>} {<AI12-0159-1AI12-0159-1>} The expected type
+for a raise_expression shall be any single type.
_Dynamic Semantics_
4/4
-{AI95-00361-01AI95-00361-01} {AI12-0022-1AI12-0022-1}
-{AI12-0152-1AI12-0152-1} To raise an exception is to raise a new
-occurrence of that exception[, as explained in *note 11.4::]. For the
-execution of a raise_statement with an exception_name, the named
+{<AI95-00361-01AI95-00361-01>} {<AI12-0022-1AI12-0022-1>}
+{<AI12-0152-1AI12-0152-1>} To <raise an exception> is to raise a new
+occurrence of that exception[, as explained in *note 11.4::]. For the
+execution of a raise_statement with an <exception_>name, the named
exception is raised. Similarly, for the evaluation of a
raise_expression, the named exception is raised. [In both of these
-cases, if a string_expression or string_simple_expression is present,
-the expression is evaluated and its value is associated with the
-exception occurrence.] For the execution of a re-raise statement, the
-exception occurrence that caused transfer of control to the innermost
-enclosing handler is raised [again].
+cases, if a <string_>expression or <string_>simple_expression is
+present, the expression is evaluated and its value is associated with
+the exception occurrence.] For the execution of a re-raise statement,
+the exception occurrence that caused transfer of control to the
+innermost enclosing handler is raised [again].
4.a.1/2
- Proof: {AI95-00361-01AI95-00361-01} The definition of
+ Proof: {<AI95-00361-01AI95-00361-01>} The definition of
Exceptions.Exception_Message includes a statement that the
string is returned (see *note 11.4.1::). We describe the use
of the string here so that we don't have an unexplained
@@ -52671,23 +52852,23 @@ enclosing handler is raised [again].
NOTES
4.1/4
- 1 {AI12-0062-1AI12-0062-1} {AI12-0152-1AI12-0152-1}
- {AI12-0159-1AI12-0159-1} If the evaluation of a string_expression
- or string_simple_expression raises an exception, that exception is
- propagated instead of the one denoted by the exception_name of the
- raise_statement or raise_expression.
+ 1 {<AI12-0062-1AI12-0062-1>} {<AI12-0152-1AI12-0152-1>}
+ {<AI12-0159-1AI12-0159-1>} If the evaluation of a
+ <string_>expression or <string_>simple_expression raises an
+ exception, that exception is propagated instead of the one denoted
+ by the <exception_>name of the raise_statement or raise_expression.
_Examples_
5
-Examples of raise statements:
+<Examples of raise statements:>
6/2
- {AI95-00433-01AI95-00433-01} raise Ada.IO_Exceptions.Name_Error; -- see
*note A.13::
- raise Queue_Error with "Buffer Full"; -- see *note 9.11::
+ {<AI95-00433-01AI95-00433-01>} raise Ada.IO_Exceptions.Name_Error; --<
see *note A.13::>
+ raise Queue_Error with "Buffer Full"; --< see *note 9.11::>
7
- raise; -- re-raise the current exception
+ raise; --< re-raise the current exception>
_Wording Changes from Ada 83_
@@ -52702,18 +52883,18 @@ Examples of raise statements:
_Extensions to Ada 95_
7.b/2
- {AI95-00361-01AI95-00361-01} The syntax of a raise_statement
+ {<AI95-00361-01AI95-00361-01>} The syntax of a raise_statement
is extended to include a string message. This is more
convenient than calling Exceptions.Exception_Message
- (exception_name'Identity, string_expression), and should
+ (<exception_>name'Identity, <string_>expression), and should
encourage the use of message strings when raising exceptions.
_Extensions to Ada 2012_
7.c/4
- {AI12-0022-1AI12-0022-1} {AI12-0152-1AI12-0152-1}
- {AI12-0159-1AI12-0159-1} Corrigendum: The raise_expression is
- new. This construct is necessary to allow conversion of
+ {<AI12-0022-1AI12-0022-1>} {<AI12-0152-1AI12-0152-1>}
+ {<AI12-0159-1AI12-0159-1>} Corrigendum: The raise_expression
+ is new. This construct is necessary to allow conversion of
existing specifications to use preconditions and predicates
without changing the exceptions raised. It is considered
important enough to be added to Ada 2012 rather than waiting
@@ -52728,10 +52909,10 @@ File: aarm2012.info, Node: 11.4, Next: 11.5, Prev:
11.3, Up: 11
1
[When an exception occurrence is raised, normal program execution is
abandoned and control is transferred to an applicable exception_handler,
-if any. To handle an exception occurrence is to respond to the
-exceptional event. To propagate an exception occurrence is to raise it
-again in another context; that is, to fail to respond to the exceptional
-event in the present context.]
+if any. To <handle> an exception occurrence is to respond to the
+exceptional event. To <propagate> an exception occurrence is to raise
+it again in another context; that is, to fail to respond to the
+exceptional event in the present context.]
1.a
Ramification: In other words, if the execution of a given
@@ -52747,17 +52928,17 @@ event in the present context.]
_Dynamic Semantics_
2
-Within a given task, if the execution of construct a is defined by this
-International Standard to consist (in part) of the execution of
-construct b, then while b is executing, the execution of a is said to
-dynamically enclose the execution of b. The innermost dynamically
-enclosing execution of a given execution is the dynamically enclosing
-execution that started most recently.
+Within a given task, if the execution of construct <a> is defined by
+this International Standard to consist (in part) of the execution of
+construct <b>, then while <b> is executing, the execution of <a> is said
+to <dynamically enclose> the execution of <b>. The <innermost
+dynamically enclosing> execution of a given execution is the dynamically
+enclosing execution that started most recently.
2.a
- To be honest: If the execution of a dynamically encloses that
- of b, then we also say that the execution of b is included in
- the execution of a.
+ To be honest: If the execution of <a> dynamically encloses
+ that of <b>, then we also say that the execution of <b> is
+ <included in> the execution of <a>.
2.b
Ramification: Examples: The execution of an if_statement
@@ -52786,7 +52967,7 @@ execution that started most recently.
3
When an exception occurrence is raised by the execution of a given
-construct, the rest of the execution of that construct is abandoned;
+construct, the rest of the execution of that construct is <abandoned>;
that is, any portions of the execution that have not yet taken place are
not performed. The construct is first completed, and then left, as
explained in *note 7.6.1::. Then:
@@ -52814,17 +52995,17 @@ explained in *note 7.6.1::. Then:
covering the exception, the occurrence is handled by that handler;
6
- * Otherwise, the occurrence is propagated to the innermost
+ * Otherwise, the occurrence is <propagated> to the innermost
dynamically enclosing execution, which means that the occurrence is
raised again in that context.
6.a
- To be honest: As shorthands, we refer to the propagation of an
- exception, and the propagation by a construct, if the
+ To be honest: As shorthands, we refer to the <propagation of
+ an exception>, and the <propagation by a construct>, if the
execution of the construct propagates an exception occurrence.
7
-When an occurrence is handled by a given handler, the
+When an occurrence is <handled> by a given handler, the
choice_parameter_specification, if any, is first elaborated, which
creates the choice parameter and initializes it to the occurrence.
Then, the sequence_of_statements of the handler is executed; this
@@ -52832,11 +53013,11 @@ execution replaces the abandoned portion of the
execution of the
sequence_of_statements.
7.a/2
- Ramification: {AI95-00318-02AI95-00318-02} This "replacement"
- semantics implies that the handler can do pretty much anything
- the abandoned sequence could do; for example, in a function,
- the handler can execute a return statement that applies to the
- function.
+ Ramification: {<AI95-00318-02AI95-00318-02>} This
+ "replacement" semantics implies that the handler can do pretty
+ much anything the abandoned sequence could do; for example, in
+ a function, the handler can execute a return statement that
+ applies to the function.
7.b
Ramification: The rules for exceptions raised in library
@@ -52849,7 +53030,7 @@ sequence_of_statements.
then terminates abnormally, causing the partition to terminate
abnormally. Although abnormal termination of tasks is not
necessarily an error, abnormal termination of a partition due
- to an exception is an error.
+ to an exception <is> an error.
NOTES
@@ -52876,7 +53057,7 @@ File: aarm2012.info, Node: 11.4.1, Next: 11.4.2, Up:
11.4
The following language-defined library package exists:
2/2
- {AI95-00362-01AI95-00362-01} {AI95-00400-01AI95-00400-01}
{AI95-00438-01AI95-00438-01} with Ada.Streams;
+ {<AI95-00362-01AI95-00362-01>} {<AI95-00400-01AI95-00400-01>}
{<AI95-00438-01AI95-00438-01>} with Ada.Streams;
package Ada.Exceptions is
pragma Preelaborate(Exceptions);
type Exception_Id is private;
@@ -52888,39 +53069,39 @@ The following language-defined library package exists:
return Wide_Wide_String;
3/2
- {AI95-00362-01AI95-00362-01} type Exception_Occurrence is limited
private;
+ {<AI95-00362-01AI95-00362-01>} type Exception_Occurrence is limited
private;
pragma Preelaborable_Initialization(Exception_Occurrence);
type Exception_Occurrence_Access is access all Exception_Occurrence;
Null_Occurrence : constant Exception_Occurrence;
4/3
- {AI95-00329-01AI95-00329-01} {AI05-0229-1AI05-0229-1} procedure
Raise_Exception(E : in Exception_Id;
+ {<AI95-00329-01AI95-00329-01>} {<AI05-0229-1AI05-0229-1>} procedure
Raise_Exception(E : in Exception_Id;
Message : in String := "")
with No_Return;
function Exception_Message(X : Exception_Occurrence) return String;
procedure Reraise_Occurrence(X : in Exception_Occurrence);
5/2
- {AI95-00400-01AI95-00400-01} function Exception_Identity(X :
Exception_Occurrence)
+ {<AI95-00400-01AI95-00400-01>} function Exception_Identity(X :
Exception_Occurrence)
return Exception_Id;
function Exception_Name(X : Exception_Occurrence) return String;
- -- Same as Exception_Name(Exception_Identity(X)).
+ --< Same as Exception_Name(Exception_Identity(X)).>
function Wide_Exception_Name(X : Exception_Occurrence)
return Wide_String;
- -- Same as Wide_Exception_Name(Exception_Identity(X)).
+ --< Same as Wide_Exception_Name(Exception_Identity(X)).>
function Wide_Wide_Exception_Name(X : Exception_Occurrence)
return Wide_Wide_String;
- -- Same as Wide_Wide_Exception_Name(Exception_Identity(X)).
+ --< Same as Wide_Wide_Exception_Name(Exception_Identity(X)).>
function Exception_Information(X : Exception_Occurrence) return
String;
6/2
- {AI95-00438-01AI95-00438-01} procedure Save_Occurrence(Target : out
Exception_Occurrence;
+ {<AI95-00438-01AI95-00438-01>} procedure Save_Occurrence(Target : out
Exception_Occurrence;
Source : in Exception_Occurrence);
function Save_Occurrence(Source : Exception_Occurrence)
return Exception_Occurrence_Access;
6.1/2
- {AI95-00438-01AI95-00438-01} procedure Read_Exception_Occurrence
+ {<AI95-00438-01AI95-00438-01>} procedure Read_Exception_Occurrence
(Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Exception_Occurrence);
procedure Write_Exception_Occurrence
@@ -52928,12 +53109,12 @@ The following language-defined library package exists:
Item : in Exception_Occurrence);
6.2/2
- {AI95-00438-01AI95-00438-01} for Exception_Occurrence'Read use
Read_Exception_Occurrence;
+ {<AI95-00438-01AI95-00438-01>} for Exception_Occurrence'Read use
Read_Exception_Occurrence;
for Exception_Occurrence'Write use Write_Exception_Occurrence;
6.3/2
- {AI95-00438-01AI95-00438-01} private
- ... -- not specified by the language
+ {<AI95-00438-01AI95-00438-01>} private
+ ... --< not specified by the language>
end Ada.Exceptions;
7
@@ -52961,22 +53142,22 @@ E'Identity
then back to the first, where its identity is known.
10/2
-{AI95-00361-01AI95-00361-01} Raise_Exception raises a new occurrence of
-the identified exception.
+{<AI95-00361-01AI95-00361-01>} Raise_Exception raises a new occurrence
+of the identified exception.
10.1/4
-{AI95-00361-01AI95-00361-01} {AI95-00378-01AI95-00378-01}
-{AI05-0043-1AI05-0043-1} {AI05-0248-1AI05-0248-1}
-{AI12-0022-1AI12-0022-1} {AI12-0152-1AI12-0152-1} Exception_Message
+{<AI95-00361-01AI95-00361-01>} {<AI95-00378-01AI95-00378-01>}
+{<AI05-0043-1AI05-0043-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI12-0022-1AI12-0022-1>} {<AI12-0152-1AI12-0152-1>} Exception_Message
returns the message associated with the given Exception_Occurrence. For
an occurrence raised by a call to Raise_Exception, the message is the
Message parameter passed to Raise_Exception. For the occurrence raised
-by a raise_statement or raise_expression with an exception_name and a
-string_expression or string_simple_expression, the message is the
-string_expression or string_simple_expression. For the occurrence
-raised by a raise_statement or raise_expression with an exception_name
-but without a string_expression or string_simple_expression, the message
-is a string giving implementation-defined information about the
+by a raise_statement or raise_expression with an <exception_>name and a
+<string_>expression or <string_>simple_expression, the message is the
+<string_>expression or <string_>simple_expression. For the occurrence
+raised by a raise_statement or raise_expression with an <exception_>name
+but without a <string_>expression or <string_>simple_expression, the
+message is a string giving implementation-defined information about the
exception occurrence. For an occurrence originally raised in some other
manner (including by the failure of a language-defined check), the
message is an unspecified string. In all cases, Exception_Message
@@ -52987,7 +53168,7 @@ returns a string with lower bound 1.
Exception_Message.
10.a.1/3
- Discussion: {AI05-0043-1AI05-0043-1} There is Implementation
+ Discussion: {<AI05-0043-1AI05-0043-1>} There is Implementation
Advice about the contents of this string for language-defined
checks.
@@ -53001,10 +53182,10 @@ returns a string with lower bound 1.
is equivalent to this call to Raise_Exception:
10.e
- Raise_Exception(E'Identity, Message =>
implementation-defined-string);
+ Raise_Exception(E'Identity, Message =>
<implementation-defined-string>);
10.e.1/2
- {AI95-00361-01AI95-00361-01} Similarly, the raise_statement:
+ {<AI95-00361-01AI95-00361-01>} Similarly, the raise_statement:
10.e.2/2
raise E with "some information";
@@ -53016,7 +53197,7 @@ returns a string with lower bound 1.
Raise_Exception(E'Identity, Message => "some information");
10.2/2
-{AI95-00361-01AI95-00361-01} Reraise_Occurrence reraises the specified
+{<AI95-00361-01AI95-00361-01>} Reraise_Occurrence reraises the specified
exception occurrence.
10.f
@@ -53040,7 +53221,7 @@ Exception_Identity returns the identity of the
exception of the
occurrence.
12/2
-{AI95-00400-01AI95-00400-01} The Wide_Wide_Exception_Name functions
+{<AI95-00400-01AI95-00400-01>} The Wide_Wide_Exception_Name functions
return the full expanded name of the exception, in upper case, starting
with a root library unit. For an exception declared immediately within
package Standard, the defining_identifier (*note 3.1: S0022.) is
@@ -53064,13 +53245,13 @@ declared within an unnamed block_statement.
exception, not the name of the occurrence.
12.1/2
-{AI95-00400-01AI95-00400-01} The Exception_Name functions (respectively,
-Wide_Exception_Name) return the same sequence of graphic characters as
-that defined for Wide_Wide_Exception_Name, if all the graphic characters
-are defined in Character (respectively, Wide_Character); otherwise, the
-sequence of characters is implementation defined, but no shorter than
-that returned by Wide_Wide_Exception_Name for the same value of the
-argument.
+{<AI95-00400-01AI95-00400-01>} The Exception_Name functions
+(respectively, Wide_Exception_Name) return the same sequence of graphic
+characters as that defined for Wide_Wide_Exception_Name, if all the
+graphic characters are defined in Character (respectively,
+Wide_Character); otherwise, the sequence of characters is implementation
+defined, but no shorter than that returned by Wide_Wide_Exception_Name
+for the same value of the argument.
12.e/2
Implementation defined: The sequence of characters of the
@@ -53080,12 +53261,12 @@ argument.
defined in Character (respectively, Wide_Character).
12.2/2
-{AI95-00378-01AI95-00378-01} {AI95-00417-01AI95-00417-01} The string
+{<AI95-00378-01AI95-00378-01>} {<AI95-00417-01AI95-00417-01>} The string
returned by the Exception_Name, Wide_Exception_Name, and
Wide_Wide_Exception_Name functions has lower bound 1.
13/2
-{AI95-00378-01AI95-00378-01} Exception_Information returns
+{<AI95-00378-01AI95-00378-01>} Exception_Information returns
implementation-defined information about the exception occurrence. The
returned string has lower bound 1.
@@ -53094,7 +53275,7 @@ returned string has lower bound 1.
Exception_Information.
14/2
-{AI95-00241-01AI95-00241-01} {AI95-00446-01AI95-00446-01}
+{<AI95-00241-01AI95-00241-01>} {<AI95-00446-01AI95-00446-01>}
Reraise_Occurrence has no effect in the case of Null_Occurrence.
Raise_Exception and Exception_Name raise Constraint_Error for a Null_Id.
Exception_Message, Exception_Name, and Exception_Information raise
@@ -53102,12 +53283,12 @@ Constraint_Error for a Null_Occurrence.
Exception_Identity applied to
Null_Occurrence returns Null_Id.
14.a.1/2
- Ramification: {AI95-00241-01AI95-00241-01} Null_Occurrence can
- be tested for by comparing Exception_Identity(Occurrence) to
- Null_Id.
+ Ramification: {<AI95-00241-01AI95-00241-01>} Null_Occurrence
+ can be tested for by comparing Exception_Identity(Occurrence)
+ to Null_Id.
14.a.2/2
- Discussion: {AI95-00446-01AI95-00446-01} Raise_Exception was
+ Discussion: {<AI95-00446-01AI95-00446-01>} Raise_Exception was
changed so that it always raises an exception and thus can be
a No_Return procedure. A similar change was not made for
Reraise_Occurrence, as doing so was determined to be a
@@ -53133,7 +53314,7 @@ Unchecked_Deallocation.]
but simply save the Null_Occurrence.
15.1/2
-{AI95-00438-01AI95-00438-01} Write_Exception_Occurrence writes a
+{<AI95-00438-01AI95-00438-01>} Write_Exception_Occurrence writes a
representation of an exception occurrence to a stream;
Read_Exception_Occurrence reconstructs an exception occurrence from a
stream (including one written in a different partition).
@@ -53161,7 +53342,7 @@ stream (including one written in a different partition).
well as propagating exceptions across remote subprogram calls
in a distributed system (see *note E.4::).
-Paragraph 16 was deleted.
+<Paragraph 16 was deleted.>
_Implementation Permissions_
@@ -53273,7 +53454,7 @@ Exception_Message.
object of the type:
19.i
- Temp : Exception_Occurrence(10); -- for a 10-character message
+ Temp : Exception_Occurrence(10); --< for a 10-character message>
19.j
After finding the appropriate handler, the stack can be cut
@@ -53330,9 +53511,9 @@ Exception_Message.
limited record
case Kind is
when Normal =>
- ... -- space for 200 characters
+ ... --< space for 200 characters>
when As_Choice_Param =>
- ... -- pointer to heap string
+ ... --< pointer to heap string>
end case;
end record;
@@ -53369,7 +53550,7 @@ Exception_Message.
to subprograms for immediate error analysis.
19.w/2
- This paragraph was deleted.{AI95-00400-01AI95-00400-01}
+ <This paragraph was deleted.>{<AI95-00400-01AI95-00400-01>}
_Extensions to Ada 83_
@@ -53380,7 +53561,7 @@ Exception_Message.
_Inconsistencies With Ada 95_
19.y/2
- {AI95-00241-01AI95-00241-01} Amendment Correction:
+ {<AI95-00241-01AI95-00241-01>} Amendment Correction:
Exception_Identity of an Exception_Occurrence now is defined
to return Null_Id for Null_Occurrence, rather than raising
Constraint_Error. This provides a simple way to test for
@@ -53390,7 +53571,7 @@ Exception_Message.
Exception_Name instead.
19.z/2
- {AI95-00378-01AI95-00378-01} {AI95-00417-01AI95-00417-01}
+ {<AI95-00378-01AI95-00378-01>} {<AI95-00417-01AI95-00417-01>}
Amendment Correction: We now define the lower bound of the
string returned from [[Wide_]Wide_]Exception_Name,
Exception_Message, and Exception_Information. This makes
@@ -53403,7 +53584,7 @@ Exception_Message.
it should be very rare.
19.aa/2
- {AI95-00446-01AI95-00446-01} Amendment Correction:
+ {<AI95-00446-01AI95-00446-01>} Amendment Correction:
Raise_Exception now raises Constraint_Error if passed Null_Id.
This means that it always raises an exception, and thus we can
apply pragma No_Return to it. We expect that programs that
@@ -53415,21 +53596,21 @@ Exception_Message.
_Incompatibilities With Ada 95_
19.bb/3
- {AI95-00400-01AI95-00400-01} {AI95-00438-01AI95-00438-01}
- {AI05-0005-1AI05-0005-1} Functions Wide_Exception_Name and
+ {<AI95-00400-01AI95-00400-01>} {<AI95-00438-01AI95-00438-01>}
+ {<AI05-0005-1AI05-0005-1>} Functions Wide_Exception_Name and
Wide_Wide_Exception_Name, and procedures
Read_Exception_Occurrence and Write_Exception_Occurrence are
added to Exceptions. If Exceptions is referenced in a
- use_clause, and an entity E with the same defining_identifier
- as a new entity in Exceptions is defined in a package that is
- also referenced in a use_clause, the entity E may no longer be
- use-visible, resulting in errors. This should be rare and is
- easily fixed if it does occur.
+ use_clause, and an entity <E> with the same
+ defining_identifier as a new entity in Exceptions is defined
+ in a package that is also referenced in a use_clause, the
+ entity <E> may no longer be use-visible, resulting in errors.
+ This should be rare and is easily fixed if it does occur.
_Extensions to Ada 95_
19.cc/2
- {AI95-00362-01AI95-00362-01} The package Exceptions is
+ {<AI95-00362-01AI95-00362-01>} The package Exceptions is
preelaborated, and types Exception_Id and Exception_Occurrence
have preelaborable initialization, allowing this package to be
used in preelaborated units.
@@ -53437,19 +53618,20 @@ Exception_Message.
_Wording Changes from Ada 95_
19.dd/2
- {AI95-00361-01AI95-00361-01} The meaning of Exception_Message
- is reworded to reflect that the string can come from a
- raise_statement as well as a call of Raise_Exception.
+ {<AI95-00361-01AI95-00361-01>} The meaning of
+ Exception_Message is reworded to reflect that the string can
+ come from a raise_statement as well as a call of
+ Raise_Exception.
19.ee/2
- {AI95-00400-01AI95-00400-01} Added Wide_Exception_Name and
+ {<AI95-00400-01AI95-00400-01>} Added Wide_Exception_Name and
Wide_Wide_Exception_Name because identifiers can now contain
characters outside of Latin-1.
_Wording Changes from Ada 2005_
19.ff/3
- {AI05-0043-1AI05-0043-1} Correction: Added explicit wording
+ {<AI05-0043-1AI05-0043-1>} Correction: Added explicit wording
that the exception message for language-defined checks is
unspecified. The old wording appeared inclusive, but it was
not.
@@ -53461,16 +53643,16 @@ File: aarm2012.info, Node: 11.4.2, Next: 11.4.3,
Prev: 11.4.1, Up: 11.4
------------------------------------------
1/3
-{AI95-00286-01AI95-00286-01} {AI05-0274-1AI05-0274-1} Pragma Assert is
-used to assert the truth of a boolean expression at a point within a
+{<AI95-00286-01AI95-00286-01>} {<AI05-0274-1AI05-0274-1>} Pragma Assert
+is used to assert the truth of a boolean expression at a point within a
sequence of declarations or statements.
1.1/3
-{AI05-0274-1AI05-0274-1} Assert pragmas, subtype predicates (see *note
+{<AI05-0274-1AI05-0274-1>} Assert pragmas, subtype predicates (see *note
3.2.4::), preconditions and postconditions (see *note 6.1.1::), and type
invariants (see *note 7.3.2::) are collectively referred to as
-assertions; their boolean expressions are referred to as assertion
-expressions.
+<assertions>; their boolean expressions are referred to as <assertion
+expressions>.
1.a.1/3
Glossary entry: A predicate is an assertion that is expected
@@ -53500,47 +53682,48 @@ expressions.
run time at certain specified places.
1.2/3
-{AI05-0274-1AI05-0274-1} Pragma Assertion_Policy is used to control
+{<AI05-0274-1AI05-0274-1>} Pragma Assertion_Policy is used to control
whether assertions are to be ignored by the implementation, checked at
run time, or handled in some implementation-defined manner.
_Syntax_
2/2
- {AI95-00286-01AI95-00286-01} The form of a pragma Assert is as
+ {<AI95-00286-01AI95-00286-01>} The form of a pragma Assert is as
follows:
3/2
- pragma Assert([Check =>] boolean_expression[, [Message =>]
- string_expression]);
+ pragma Assert([Check =>] <boolean_>expression[, [Message =>]
+ <string_>expression]);
4/2
A pragma Assert is allowed at the place where a declarative_item or
a statement is allowed.
5/2
- {AI95-00286-01AI95-00286-01} The form of a pragma Assertion_Policy
- is as follows:
+ {<AI95-00286-01AI95-00286-01>} The form of a pragma
+ Assertion_Policy is as follows:
6/2
- pragma Assertion_Policy(policy_identifier);
+ pragma Assertion_Policy(<policy_>identifier);
6.1/3
- {AI05-0290-1AI05-0290-1} pragma Assertion_Policy(
- assertion_aspect_mark => policy_identifier
- {, assertion_aspect_mark => policy_identifier});
+ {<AI05-0290-1AI05-0290-1>} pragma Assertion_Policy(
+ <assertion_>aspect_mark => <policy_>identifier
+ {, <assertion_>aspect_mark => <policy_>identifier});
7/3
- {AI05-0290-1AI05-0290-1} A pragma Assertion_Policy is allowed only
- immediately within a declarative_part, immediately within a
+ {<AI05-0290-1AI05-0290-1>} A pragma Assertion_Policy is allowed
+ only immediately within a declarative_part, immediately within a
package_specification, or as a configuration pragma.
_Name Resolution Rules_
8/2
-{AI95-00286-01AI95-00286-01} The expected type for the
-boolean_expression of a pragma Assert is any boolean type. The expected
-type for the string_expression of a pragma Assert is type String.
+{<AI95-00286-01AI95-00286-01>} The expected type for the
+<boolean_>expression of a pragma Assert is any boolean type. The
+expected type for the <string_>expression of a pragma Assert is type
+String.
8.a/2
Reason: We allow any boolean type to be like if_statements and
@@ -53550,28 +53733,28 @@ type for the string_expression of a pragma Assert is
type String.
_Legality Rules_
9/3
-{AI95-00286-01AI95-00286-01} {AI05-0290-1AI05-0290-1} The
-assertion_aspect_mark of a pragma Assertion_Policy shall be one of
+{<AI95-00286-01AI95-00286-01>} {<AI05-0290-1AI05-0290-1>} The
+<assertion_>aspect_mark of a pragma Assertion_Policy shall be one of
Assert, Static_Predicate, Dynamic_Predicate, Pre, Pre'Class, Post,
Post'Class, Type_Invariant, Type_Invariant'Class, or some implementation
-defined aspect_mark. The policy_identifier shall be either Check,
+defined aspect_mark. The <policy_>identifier shall be either Check,
Ignore, or some implementation-defined identifier.
9.a/3
Implementation defined: Implementation-defined
- policy_identifiers and assertion_aspect_marks allowed in a
+ <policy_>identifiers and <assertion_>aspect_marks allowed in a
pragma Assertion_Policy.
_Static Semantics_
10/3
-{AI95-00286-01AI95-00286-01} {AI05-0290-1AI05-0290-1} A pragma
+{<AI95-00286-01AI95-00286-01>} {<AI05-0290-1AI05-0290-1>} A pragma
Assertion_Policy determines for each assertion aspect named in the
pragma_argument_associations whether assertions of the given aspect are
-to be enforced by a run-time check. The policy_identifier Check
+to be enforced by a run-time check. The <policy_>identifier Check
requires that assertion expressions of the given aspect be checked that
they evaluate to True at the points specified for the given aspect; the
-policy_identifier Ignore requires that the assertion expression not be
+<policy_>identifier Ignore requires that the assertion expression not be
evaluated at these points, and the run-time checks not be performed.
[Note that for subtype predicate aspects (see *note 3.2.4::), even when
the applicable Assertion_Policy is Ignore, the predicate will still be
@@ -53580,21 +53763,21 @@ and if static, will still have an effect on loop
iteration over the
subtype, and the selection of case_statement_alternatives and variants.]
10.1/3
-{AI05-0290-1AI05-0290-1} If no assertion_aspect_marks are specified in
-the pragma, the specified policy applies to all assertion aspects.
+{<AI05-0290-1AI05-0290-1>} If no <assertion_>aspect_marks are specified
+in the pragma, the specified policy applies to all assertion aspects.
10.2/3
-{AI05-0290-1AI05-0290-1} A pragma Assertion_Policy applies to the named
-assertion aspects in a specific region, and applies to all assertion
-expressions specified in that region. A pragma Assertion_Policy given
-in a declarative_part or immediately within a package_specification
-applies from the place of the pragma to the end of the innermost
-enclosing declarative region. The region for a pragma Assertion_Policy
-given as a configuration pragma is the declarative region for the entire
-compilation unit (or units) to which it applies.
+{<AI05-0290-1AI05-0290-1>} A pragma Assertion_Policy applies to the
+named assertion aspects in a specific region, and applies to all
+assertion expressions specified in that region. A pragma
+Assertion_Policy given in a declarative_part or immediately within a
+package_specification applies from the place of the pragma to the end of
+the innermost enclosing declarative region. The region for a pragma
+Assertion_Policy given as a configuration pragma is the declarative
+region for the entire compilation unit (or units) to which it applies.
10.3/3
-{AI05-0290-1AI05-0290-1} If a pragma Assertion_Policy applies to a
+{<AI05-0290-1AI05-0290-1>} If a pragma Assertion_Policy applies to a
generic_instantiation, then the pragma Assertion_Policy applies to the
entire instance.
@@ -53606,8 +53789,8 @@ entire instance.
occurring within the given instance.
10.4/3
-{AI05-0290-1AI05-0290-1} If multiple Assertion_Policy pragmas apply to a
-given construct for a given assertion aspect, the assertion policy is
+{<AI05-0290-1AI05-0290-1>} If multiple Assertion_Policy pragmas apply to
+a given construct for a given assertion aspect, the assertion policy is
determined by the one in the innermost enclosing region of a pragma
Assertion_Policy specifying a policy for the assertion aspect. If no
such Assertion_Policy pragma exists, the policy is implementation
@@ -53617,7 +53800,7 @@ defined.
Implementation defined: The default assertion policy.
11/2
-{AI95-00286-01AI95-00286-01} The following language-defined library
+{<AI95-00286-01AI95-00286-01>} The following language-defined library
package exists:
12/2
@@ -53635,18 +53818,18 @@ package exists:
end Ada.Assertions;
16/3
-{AI95-00286-01AI95-00286-01} {AI05-0290-1AI05-0290-1} A compilation unit
-containing a check for an assertion (including a pragma Assert) has a
-semantic dependence on the Assertions library unit.
+{<AI95-00286-01AI95-00286-01>} {<AI05-0290-1AI05-0290-1>} A compilation
+unit containing a check for an assertion (including a pragma Assert) has
+a semantic dependence on the Assertions library unit.
17/3
-This paragraph was deleted.{AI95-00286-01AI95-00286-01}
-{AI05-0290-1AI05-0290-1}
+<This paragraph was deleted.>{<AI95-00286-01AI95-00286-01>}
+{<AI05-0290-1AI05-0290-1>}
_Dynamic Semantics_
18/3
-{AI95-00286-01AI95-00286-01} {AI05-0290-1AI05-0290-1} If performing
+{<AI95-00286-01AI95-00286-01>} {<AI05-0290-1AI05-0290-1>} If performing
checks is required by the Assert assertion policy in effect at the place
of a pragma Assert, the elaboration of the pragma consists of evaluating
the boolean expression, and if the result is False, evaluating the
@@ -53655,7 +53838,7 @@ Assertions.Assertion_Error, with a message if the
Message argument is
provided.
19/2
-{AI95-00286-01AI95-00286-01} Calling the procedure Assertions.Assert
+{<AI95-00286-01AI95-00286-01>} Calling the procedure Assertions.Assert
without a Message parameter is equivalent to:
20/2
@@ -53664,7 +53847,7 @@ without a Message parameter is equivalent to:
end if;
21/2
-{AI95-00286-01AI95-00286-01} Calling the procedure Assertions.Assert
+{<AI95-00286-01AI95-00286-01>} Calling the procedure Assertions.Assert
with a Message parameter is equivalent to:
22/2
@@ -53673,13 +53856,13 @@ with a Message parameter is equivalent to:
end if;
23/2
-{AI95-00286-01AI95-00286-01} The procedures Assertions.Assert have these
-effects independently of the assertion policy in effect.
+{<AI95-00286-01AI95-00286-01>} The procedures Assertions.Assert have
+these effects independently of the assertion policy in effect.
_Bounded (Run-Time) Errors_
23.1/3
-{AI05-0274-1AI05-0274-1} It is a bounded error to invoke a potentially
+{<AI05-0274-1AI05-0274-1>} It is a bounded error to invoke a potentially
blocking operation (see *note 9.5.1::) during the evaluation of an
assertion expression associated with a call on, or return from, a
protected operation. If the bounded error is detected, Program_Error is
@@ -53690,8 +53873,8 @@ invoked within a protected action, it might result in
deadlock or a
_Implementation Permissions_
24/2
-{AI95-00286-01AI95-00286-01} Assertion_Error may be declared by renaming
-an implementation-defined exception from another package.
+{<AI95-00286-01AI95-00286-01>} Assertion_Error may be declared by
+renaming an implementation-defined exception from another package.
24.a/2
Reason: This permission is intended to allow implementations
@@ -53701,26 +53884,27 @@ an implementation-defined exception from another
package.
Exception_Name would return the wrong name.
25/2
-{AI95-00286-01AI95-00286-01} Implementations may define their own
+{<AI95-00286-01AI95-00286-01>} Implementations may define their own
assertion policies.
26/3
-{AI05-0274-1AI05-0274-1} If the result of a function call in an
+{<AI05-0274-1AI05-0274-1>} If the result of a function call in an
assertion is not needed to determine the value of the assertion
expression, an implementation is permitted to omit the function call.
[This permission applies even if the function has side effects.]
27/3
-{AI05-0274-1AI05-0274-1} An implementation need not allow the
+{<AI05-0274-1AI05-0274-1>} An implementation need not allow the
specification of an assertion expression if the evaluation of the
expression has a side effect such that an immediate reevaluation of the
expression could produce a different value. Similarly, an
implementation need not allow the specification of an assertion
expression that is checked as part of a call on or return from a
-callable entity C, if the evaluation of the expression has a side effect
-such that the evaluation of some other assertion expression associated
-with the same call of (or return from) C could produce a different value
-than it would if the first expression had not been evaluated.
+callable entity <C>, if the evaluation of the expression has a side
+effect such that the evaluation of some other assertion expression
+associated with the same call of (or return from) <C> could produce a
+different value than it would if the first expression had not been
+evaluated.
27.a/3
Ramification: This allows an implementation to reject such
@@ -53743,14 +53927,14 @@ than it would if the first expression had not been
evaluated.
at the start and end of the call. Specifically, a side effect
that alters a variable in a function called from a
precondition expression that changes the result of a
- postcondition expression of the same subprogram does not
+ postcondition expression of the same subprogram does <not>
trigger these rules unless it also changes the value of a
reevaluation of the precondition expression.
_Language Design Principles_
27.d/4
- {AI12-0005-1AI12-0005-1} Our intent is that any assertion
+ {<AI12-0005-1AI12-0005-1>} Our intent is that any assertion
expression that violates this ImplPerm is considered
pathological. We definitely want compilers to be able to
assume that if you evaluate an assertion expression once and
@@ -53765,8 +53949,8 @@ than it would if the first expression had not been
evaluated.
NOTES
28/2
- 3 {AI95-00286-01AI95-00286-01} Normally, the boolean expression in
- a pragma Assert should not call functions that have significant
+ 3 {<AI95-00286-01AI95-00286-01>} Normally, the boolean expression
+ in a pragma Assert should not call functions that have significant
side effects when the result of the expression is True, so that the
particular assertion policy in effect will not affect normal
operation of the program.
@@ -53774,13 +53958,13 @@ than it would if the first expression had not been
evaluated.
_Extensions to Ada 95_
28.a/2
- {AI95-00286-01AI95-00286-01} Pragmas Assert and
+ {<AI95-00286-01AI95-00286-01>} Pragmas Assert and
Assertion_Policy, and package Assertions are new.
_Incompatibilities With Ada 2005_
28.b/3
- {AI05-0274-1AI05-0274-1} There now is an Implementation
+ {<AI05-0274-1AI05-0274-1>} There now is an Implementation
Permission to reject an assertion expression that calls a
function that has a side effect such that an immediate
reevalution of the expression could produce a different value.
@@ -53790,13 +53974,13 @@ than it would if the first expression had not been
evaluated.
practice and it is considered a good thing, as the original
expression was tricky and probably was not portable (as order
of evaluation is unspecified within an expression). Moreover,
- no compiler is required to reject such expressions, so there
+ no compiler is <required> to reject such expressions, so there
is no need for any compiler to change behavior.
_Extensions to Ada 2005_
28.c/3
- {AI05-0290-1AI05-0290-1} Assertion_Policy pragmas are now
+ {<AI05-0290-1AI05-0290-1>} Assertion_Policy pragmas are now
allowed in more places and can specify behavior for individual
kinds of assertions.
@@ -53813,25 +53997,25 @@ Exception handling may be used to separate the
detection of an error
from the response to that error:
2/2
- {AI95-00433-01AI95-00433-01} package File_System is
+ {<AI95-00433-01AI95-00433-01>} package File_System is
type File_Handle is limited private;
3
File_Not_Found : exception;
procedure Open(F : in out File_Handle; Name : String);
- -- raises File_Not_Found if named file does not exist
+ --< raises File_Not_Found if named file does not exist>
4
End_Of_File : exception;
procedure Read(F : in out File_Handle; Data : out Data_Type);
- -- raises End_Of_File if the file is not open
+ --< raises End_Of_File if the file is not open>
5
...
end File_System;
6/2
- {AI95-00433-01AI95-00433-01} package body File_System is
+ {<AI95-00433-01AI95-00433-01>} package body File_System is
procedure Open(F : in out File_Handle; Name : String) is
begin
if File_Exists(Name) then
@@ -53864,7 +54048,7 @@ from the response to that error:
use Ada;
procedure Main is
begin
- ... -- call operations in File_System
+ ... --< call operations in File_System>
exception
when End_Of_File =>
Close(Some_File);
@@ -53891,7 +54075,7 @@ the exceptional situations arise from the same basic
causes.
_Wording Changes from Ada 83_
11.a/3
- {AI05-0299-1AI05-0299-1} The sections labeled "Exceptions
+ {<AI05-0299-1AI05-0299-1>} The sections labeled "Exceptions
Raised During ..." are subsumed by this subclause, and by
parts of Clause *note 9::.
@@ -53902,17 +54086,17 @@ File: aarm2012.info, Node: 11.5, Next: 11.6, Prev:
11.4, Up: 11
=======================
1/2
-{AI95-00224-01AI95-00224-01} Checking pragmas give instructions to an
-implementation on handling language-defined checks. A pragma Suppress
-gives permission to an implementation to omit certain language-defined
-checks, while a pragma Unsuppress revokes the permission to omit
-checks..
+{<AI95-00224-01AI95-00224-01>} <Checking pragmas> give instructions to
+an implementation on handling language-defined checks. A pragma
+Suppress gives permission to an implementation to omit certain
+language-defined checks, while a pragma Unsuppress revokes the
+permission to omit checks..
2/3
-{AI05-0264-1AI05-0264-1} A language-defined check (or simply, a "check")
-is one of the situations defined by this International Standard that
-requires a check to be made at run time to determine whether some
-condition is true. A check fails when the condition being checked is
+{<AI05-0264-1AI05-0264-1>} A <language-defined check> (or simply, a
+"check") is one of the situations defined by this International Standard
+that requires a check to be made at run time to determine whether some
+condition is true. A check <fails> when the condition being checked is
False, causing an exception to be raised.
2.a
@@ -53922,17 +54106,17 @@ False, causing an exception to be raised.
_Syntax_
3/2
- {AI95-00224-01AI95-00224-01} The forms of checking pragmas are as
+ {<AI95-00224-01AI95-00224-01>} The forms of checking pragmas are as
follows:
4/2
- {AI95-00224-01AI95-00224-01} pragma Suppress(identifier);
+ {<AI95-00224-01AI95-00224-01>} pragma Suppress(identifier);
4.1/2
- {AI95-00224-01AI95-00224-01} pragma Unsuppress(identifier);
+ {<AI95-00224-01AI95-00224-01>} pragma Unsuppress(identifier);
5/2
- {AI95-00224-01AI95-00224-01} A checking pragma is allowed only
+ {<AI95-00224-01AI95-00224-01>} A checking pragma is allowed only
immediately within a declarative_part, immediately within a
package_specification (*note 7.1: S0191.), or as a configuration
pragma.
@@ -53940,16 +54124,16 @@ False, causing an exception to be raised.
_Legality Rules_
6/2
-{AI95-00224-01AI95-00224-01} The identifier shall be the name of a
+{<AI95-00224-01AI95-00224-01>} The identifier shall be the name of a
check.
7/2
-This paragraph was deleted.{AI95-00224-01AI95-00224-01}
+<This paragraph was deleted.>{<AI95-00224-01AI95-00224-01>}
_Static Semantics_
7.1/2
-{AI95-00224-01AI95-00224-01} A checking pragma applies to the named
+{<AI95-00224-01AI95-00224-01>} A checking pragma applies to the named
check in a specific region, and applies to all entities in that region.
A checking pragma given in a declarative_part or immediately within a
package_specification applies from the place of the pragma to the end of
@@ -53958,38 +54142,39 @@ pragma given as a configuration pragma is the
declarative region for the
entire compilation unit (or units) to which it applies.
7.2/3
-{AI95-00224-01AI95-00224-01} {AI05-0229-1AI05-0229-1}
-{AI05-0290-1AI05-0290-1} If a checking pragma applies to a
+{<AI95-00224-01AI95-00224-01>} {<AI05-0229-1AI05-0229-1>}
+{<AI05-0290-1AI05-0290-1>} If a checking pragma applies to a
generic_instantiation, then the checking pragma also applies to the
entire instance.
7.a/3
- Ramification: {AI05-0290-1AI05-0290-1} This means that a
+ Ramification: {<AI05-0290-1AI05-0290-1>} This means that a
Suppress pragma that occurs in a scope enclosing the
declaration of a generic unit but not also enclosing the
declaration of a given instance of that generic unit will not
apply to constructs within the given instance.
8/2
-{AI95-00224-01AI95-00224-01} A pragma Suppress gives permission to an
+{<AI95-00224-01AI95-00224-01>} A pragma Suppress gives permission to an
implementation to omit the named check (or every check in the case of
-All_Checks) for any entities to which it applies. If permission has been
-given to suppress a given check, the check is said to be suppressed.
+All_Checks) for any entities to which it applies. If permission has
+been given to suppress a given check, the check is said to be
+<suppressed>.
8.a
Ramification: A check is suppressed even if the implementation
- chooses not to actually generate better code. This allows the
+ chooses not to actually generate better code. This allows the
implementation to raise Program_Error, for example, if the
erroneousness is detected.
8.1/2
-{AI95-00224-01AI95-00224-01} A pragma Unsuppress revokes the permission
-to omit the named check (or every check in the case of All_Checks) given
-by any pragma Suppress that applies at the point of the pragma
-Unsuppress. The permission is revoked for the region to which the
-pragma Unsuppress applies. If there is no such permission at the point
-of a pragma Unsuppress, then the pragma has no effect. A later pragma
-Suppress can renew the permission.
+{<AI95-00224-01AI95-00224-01>} A pragma Unsuppress revokes the
+permission to omit the named check (or every check in the case of
+All_Checks) given by any pragma Suppress that applies at the point of
+the pragma Unsuppress. The permission is revoked for the region to
+which the pragma Unsuppress applies. If there is no such permission at
+the point of a pragma Unsuppress, then the pragma has no effect. A
+later pragma Suppress can renew the permission.
9
The following are the language-defined checks:
@@ -53999,8 +54184,8 @@ The following are the language-defined checks:
exception Constraint_Error is raised upon failure.]
11/2
-{8652/00368652/0036} {AI95-00176-01AI95-00176-01}
-{AI95-00231-01AI95-00231-01} Access_Check
+{<8652/00368652/0036>} {<AI95-00176-01AI95-00176-01>}
+{<AI95-00231-01AI95-00231-01>} Access_Check
[When evaluating a dereference (explicit or implicit),
check that the value of the name is not null. When
converting to a subtype that excludes null, check that
@@ -54014,7 +54199,7 @@ Discriminant_Check
for the current discriminant values.]
13/2
-{AI95-00434-01AI95-00434-01} Division_Check
+{<AI95-00434-01AI95-00434-01>} Division_Check
[Check that the second operand is not zero for the
operations /, rem and mod.]
@@ -54066,11 +54251,11 @@ Tag_Check
exception Program_Error is raised upon failure.]
19.1/2
-{AI95-00280AI95-00280} Accessibility_Check
+{<AI95-00280AI95-00280>} Accessibility_Check
[Check the accessibility level of an entity or view.]
19.2/2
-{AI95-00280AI95-00280} Allocation_Check
+{<AI95-00280AI95-00280>} Allocation_Check
[For an allocator, check that the master of any tasks to
be created by the allocator is not yet completed or some
dependents have not yet terminated, and that the
@@ -54085,7 +54270,7 @@ Elaboration_Check
21/2
- This paragraph was deleted.{AI95-00280AI95-00280}
+ <This paragraph was deleted.>{<AI95-00280AI95-00280>}
22
* [The following check corresponds to situations in which the
@@ -54112,7 +54297,7 @@ Storage_Check
predefined exception is raised.]
25/3
-{AI05-0290-1AI05-0290-1} All_Checks
+{<AI05-0290-1AI05-0290-1>} All_Checks
Represents the union of all checks; suppressing
All_Checks suppresses all checks other than those
associated with assertions. In addition, an
@@ -54125,7 +54310,7 @@ Storage_Check
implementation-defined checks.
25.b/3
- To be honest: {AI05-0005-1AI05-0005-1} There are additional
+ To be honest: {<AI05-0005-1AI05-0005-1>} There are additional
checks defined in various Specialized Needs Annexes that are
not listed here. Nevertheless, they are included in
All_Checks and named in a Suppress pragma on implementations
@@ -54133,11 +54318,11 @@ Storage_Check
language-defined" in the index to find the complete list.
25.c/3
- Discussion: {AI05-0290-1AI05-0290-1} We don't want to say that
- assertions are suppressed, because we don't want the potential
- failure of an assertion to cause erroneous execution (see
- below). Thus they are excluded from the suppression part of
- the above rule and then handled with an implicit Ignore
+ Discussion: {<AI05-0290-1AI05-0290-1>} We don't want to say
+ that assertions are suppressed, because we don't want the
+ potential failure of an assertion to cause erroneous execution
+ (see below). Thus they are excluded from the suppression part
+ of the above rule and then handled with an implicit Ignore
policy.
_Erroneous Execution_
@@ -54149,16 +54334,16 @@ situation occurs, the execution of the program is
erroneous.
_Implementation Permissions_
27/2
-{AI95-00224-01AI95-00224-01} An implementation is allowed to place
+{<AI95-00224-01AI95-00224-01>} An implementation is allowed to place
restrictions on checking pragmas, subject only to the requirement that
pragma Unsuppress shall allow any check names supported by pragma
Suppress. An implementation is allowed to add additional check names,
-with implementation-defined semantics. When Overflow_Check has been
+with implementation-defined semantics. When Overflow_Check has been
suppressed, an implementation may also suppress an unspecified subset of
the Range_Checks.
27.a/2
- This paragraph was deleted.{AI95-00224-01AI95-00224-01}
+ <This paragraph was deleted.>{<AI95-00224-01AI95-00224-01>}
27.b
Implementation defined: Implementation-defined check names.
@@ -54170,9 +54355,9 @@ the Range_Checks.
are free).
27.1/2
-{AI95-00224-01AI95-00224-01} An implementation may support an additional
-parameter on pragma Unsuppress similar to the one allowed for pragma
-Suppress (see *note J.10::). The meaning of such a parameter is
+{<AI95-00224-01AI95-00224-01>} An implementation may support an
+additional parameter on pragma Unsuppress similar to the one allowed for
+pragma Suppress (see *note J.10::). The meaning of such a parameter is
implementation-defined.
27.c.1/2
@@ -54207,7 +54392,7 @@ have been suppressed.
reasons.
29.1/2
- 5 {AI95-00224-01AI95-00224-01} It is possible to give both a
+ 5 {<AI95-00224-01AI95-00224-01>} It is possible to give both a
pragma Suppress and Unsuppress for the same check immediately
within the same declarative_part. In that case, the last pragma
given determines whether or not the check is suppressed.
@@ -54218,11 +54403,11 @@ have been suppressed.
_Examples_
30/2
-{AI95-00224-01AI95-00224-01} Examples of suppressing and unsuppressing
-checks:
+{<AI95-00224-01AI95-00224-01>} <Examples of suppressing and
+unsuppressing checks:>
31/2
- {AI95-00224-01AI95-00224-01} pragma Suppress(Index_Check);
+ {<AI95-00224-01AI95-00224-01>} pragma Suppress(Index_Check);
pragma Unsuppress(Overflow_Check);
_Extensions to Ada 83_
@@ -54273,25 +54458,25 @@ checks:
_Extensions to Ada 95_
31.g/2
- {AI95-00224-01AI95-00224-01} Pragma Unsuppress is new.
+ {<AI95-00224-01AI95-00224-01>} Pragma Unsuppress is new.
31.h/2
- {AI95-00280-01AI95-00280-01} Allocation_Check was added to
+ {<AI95-00280-01AI95-00280-01>} Allocation_Check was added to
support suppressing the new check on allocators (see *note
4.8::).
_Wording Changes from Ada 95_
31.i/2
- {8652/00368652/0036} {AI95-00176-01AI95-00176-01}
- {AI95-00224-01AI95-00224-01} The description of Access_Check
+ {<8652/00368652/0036>} {<AI95-00176-01AI95-00176-01>}
+ {<AI95-00224-01AI95-00224-01>} The description of Access_Check
was corrected by the Corrigendum to include the discriminant
case. This change was then replaced by the more general
notion of checking conversions to subtypes that exclude null
in Ada 2005.
31.j/2
- {AI95-00224-01AI95-00224-01} The On parameter of pragma
+ {<AI95-00224-01AI95-00224-01>} The On parameter of pragma
Suppress was moved to Annex J (see *note J.10::). This
feature's effect is inherently nonportable, depending on the
implementation's model of computation. Compiler surveys
@@ -54304,23 +54489,23 @@ checks:
the meaning of Unsuppress with an On parameter.
31.k/2
- {AI95-00280-01AI95-00280-01} The order of the Program_Error
+ {<AI95-00280-01AI95-00280-01>} The order of the Program_Error
checks was corrected to be alphabetical.
_Wording Changes from Ada 2005_
31.l/4
- {AI05-0290-1AI05-0290-1} {AI12-0005-1AI12-0005-1} The effect
- of a checking pragma no longer applies inside an inlined
- subprogram body. While this could change the behavior of a
- program that depends on a check being suppressed in an inlined
- body, such a program is erroneous and thus no behavior can be
- depended upon anyway. It's also likely to be very rare. We
- make this change so that inlining has no effect on the meaning
- of the subprogram body (since inlining is never required, this
- is necessary in order to be able to reason about the body),
- and so that assertion policies and suppress work the same way
- for inlining.
+ {<AI05-0290-1AI05-0290-1>} {<AI12-0005-1AI12-0005-1>} The
+ effect of a checking pragma no longer applies inside an
+ inlined subprogram body. While this could change the behavior
+ of a program that depends on a check being suppressed in an
+ inlined body, such a program is erroneous and thus no behavior
+ can be depended upon anyway. It's also likely to be very
+ rare. We make this change so that inlining has no effect on
+ the meaning of the subprogram body (since inlining is never
+ required, this is necessary in order to be able to reason
+ about the body), and so that assertion policies and suppress
+ work the same way for inlining.
File: aarm2012.info, Node: 11.6, Prev: 11.5, Up: 11
@@ -54329,15 +54514,15 @@ File: aarm2012.info, Node: 11.6, Prev: 11.5, Up: 11
================================
1/3
-{AI05-0299-1AI05-0299-1} [ This subclause gives permission to the
+{<AI05-0299-1AI05-0299-1>} [ This subclause gives permission to the
implementation to perform certain "optimizations" that do not
necessarily preserve the canonical semantics.]
_Dynamic Semantics_
2/3
-{AI05-0299-1AI05-0299-1} The rest of this International Standard
-(outside this subclause) defines the canonical semantics of the
+{<AI05-0299-1AI05-0299-1>} The rest of this International Standard
+(outside this subclause) defines the <canonical semantics> of the
language. [The canonical semantics of a given (legal) program
determines a set of possible external effects that can result from the
execution of the program with given inputs.]
@@ -54348,7 +54533,7 @@ execution of the program with given inputs.]
nondeterminism is allowed by the canonical semantics.
2.b/3
- Discussion: {AI05-0299-1AI05-0299-1} The following parts of
+ Discussion: {<AI05-0299-1AI05-0299-1>} The following parts of
the canonical semantics are of particular interest to the
reader of this subclause:
@@ -54361,18 +54546,18 @@ execution of the program with given inputs.]
order.
2.e/3
- * {AI05-0299-1AI05-0299-1} Behavior in the presence of a
+ * {<AI05-0299-1AI05-0299-1>} Behavior in the presence of a
misuse of Unchecked_Deallocation, Unchecked_Access, or
imported or exported entity (see Clause *note 13::).
3/3
-{AI05-0299-1AI05-0299-1} [As explained in *note 1.1.3::, "*note 1.1.3::
-Conformity of an Implementation with the Standard", the external effect
-of a program is defined in terms of its interactions with its external
-environment. Hence, the implementation can perform any internal actions
-whatsoever, in any order or in parallel, so long as the external effect
-of the execution of the program is one that is allowed by the canonical
-semantics, or by the rules of this subclause.]
+{<AI05-0299-1AI05-0299-1>} [As explained in *note 1.1.3::, "*note
+1.1.3:: Conformity of an Implementation with the Standard", the external
+effect of a program is defined in terms of its interactions with its
+external environment. Hence, the implementation can perform any
+internal actions whatsoever, in any order or in parallel, so long as the
+external effect of the execution of the program is one that is allowed
+by the canonical semantics, or by the rules of this subclause.]
3.a
Ramification: Note that an optimization can change the
@@ -54393,16 +54578,16 @@ The following additional permissions are granted to
the implementation:
5
* An implementation need not always raise an exception when a
language-defined check fails. Instead, the operation that failed
- the check can simply yield an undefined result. The exception need
- be raised by the implementation only if, in the absence of raising
- it, the value of this undefined result would have some effect on
- the external interactions of the program. In determining this, the
- implementation shall not presume that an undefined result has a
- value that belongs to its subtype, nor even to the base range of
- its type, if scalar. [Having removed the raise of the exception,
- the canonical semantics will in general allow the implementation to
- omit the code for the check, and some or all of the operation
- itself.]
+ the check can simply yield an <undefined result>. The exception
+ need be raised by the implementation only if, in the absence of
+ raising it, the value of this undefined result would have some
+ effect on the external interactions of the program. In determining
+ this, the implementation shall not presume that an undefined result
+ has a value that belongs to its subtype, nor even to the base range
+ of its type, if scalar. [Having removed the raise of the
+ exception, the canonical semantics will in general allow the
+ implementation to omit the code for the check, and some or all of
+ the operation itself.]
5.a
Ramification: Even without this permission, an implementation
@@ -54463,7 +54648,7 @@ The following additional permissions are granted to the
implementation:
belongs to the subtype Str10, without even "looking."
6/3
- * {AI05-0229-1AI05-0229-1} If an exception is raised due to the
+ * {<AI05-0229-1AI05-0229-1>} If an exception is raised due to the
failure of a language-defined check, then upon reaching the
corresponding exception_handler (or the termination of the task, if
none), the external interactions that have occurred need reflect
@@ -54472,11 +54657,11 @@ The following additional permissions are granted to
the implementation:
possibly earlier (or later if the interactions are independent of
the result of the checked operation) than that defined by the
canonical semantics, but not within the execution of some
- abort-deferred operation or independent subprogram that does not
+ abort-deferred operation or <independent> subprogram that does not
dynamically enclose the execution of the construct whose check
- failed. An independent subprogram is one that is defined outside
+ failed. An independent subprogram is one that is defined outside
the library unit containing the construct whose check failed, and
- for which the Inline aspect is False. Any assignment that occurred
+ for which the Inline aspect is False. Any assignment that occurred
outside of such abort-deferred operations or independent
subprograms can be disrupted by the raising of the exception,
causing the object or its parts to become abnormal, and certain
@@ -54506,7 +54691,7 @@ The following additional permissions are granted to the
implementation:
write reliable programs?
6.d/3
- {AI05-0299-1AI05-0299-1} This subclause has two conflicting
+ {<AI05-0299-1AI05-0299-1>} This subclause has two conflicting
goals: to allow as much optimization as possible, and to make
program execution as predictable as possible (to ease the
writing of reliable programs). The rules given above
@@ -54516,7 +54701,7 @@ The following additional permissions are granted to the
implementation:
Consider the two extremes:
6.f/3
- {AI05-0299-1AI05-0299-1} The extreme conservative rule would
+ {<AI05-0299-1AI05-0299-1>} The extreme conservative rule would
be to delete this subclause entirely. The semantics of Ada
would be the canonical semantics. This achieves the best
predictability. It sounds like a disaster from the efficiency
@@ -54543,7 +54728,7 @@ The following additional permissions are granted to the
implementation:
predictability.
6.h/3
- {AI05-0299-1AI05-0299-1} The most important thing about this
+ {<AI05-0299-1AI05-0299-1>} The most important thing about this
subclause is that users understand what they can expect at run
time, and implementers understand what optimizations are
allowed. Any solution that makes this subclause contain rules
@@ -54563,7 +54748,7 @@ The following additional permissions are granted to the
implementation:
NOTES
7/3
- 6 {AI05-0299-1AI05-0299-1} The permissions granted by this
+ 6 {<AI05-0299-1AI05-0299-1>} The permissions granted by this
subclause can have an effect on the semantics of a program only if
the program fails a language-defined check.
@@ -54606,7 +54791,7 @@ The following additional permissions are granted to the
implementation:
avoid raising exceptions".
7.g/3
- {AI05-0299-1AI05-0299-1} We moved subclause *note 11.5::,
+ {<AI05-0299-1AI05-0299-1>} We moved subclause *note 11.5::,
"*note 11.5:: Suppressing Checks" from after 11.6 to before
11.6, in order to preserve the famous number "11.6" (given the
changes to earlier subclauses in Clause *note 11::).
@@ -54618,11 +54803,11 @@ File: aarm2012.info, Node: 12, Next: 13, Prev: 11,
Up: Top
****************
1
-A generic unit is a program unit that is either a generic subprogram or
-a generic package. A generic unit is a template[, which can be
+A <generic unit> is a program unit that is either a generic subprogram
+or a generic package. A generic unit is a <template>[, which can be
parameterized, and from which corresponding (nongeneric) subprograms or
packages can be obtained]. The resulting program units are said to be
-instances of the original generic unit.
+<instances> of the original generic unit.
1.a
Glossary entry: A generic unit is a template for a
@@ -54686,7 +54871,7 @@ package.]
generic_package_declaration
3/3
- {AI05-0183-1AI05-0183-1} generic_subprogram_declaration ::=
+ {<AI05-0183-1AI05-0183-1>} generic_subprogram_declaration ::=
generic_formal_part subprogram_specification
[aspect_specification];
@@ -54695,7 +54880,7 @@ package.]
generic_formal_part package_specification;
4.a/3
- Ramification: {AI05-0183-1AI05-0183-1} No syntax change is
+ Ramification: {<AI05-0183-1AI05-0183-1>} No syntax change is
needed here to allow an aspect_specification; a generic
package can have an aspect_specification because a
package_specification allows an aspect_specification.
@@ -54728,12 +54913,12 @@ package.]
_Static Semantics_
8/2
-{AI95-00434-01AI95-00434-01} A generic_declaration declares a generic
+{<AI95-00434-01AI95-00434-01>} A generic_declaration declares a generic
unit -- a generic package, generic procedure, or generic function, as
appropriate.
9
-An entity is a generic formal entity if it is declared by a
+An entity is a <generic formal> entity if it is declared by a
generic_formal_parameter_declaration. "Generic formal," or simply
"formal," is used as a prefix in referring to objects, subtypes (and
types), functions, procedures and packages, that are generic formal
@@ -54777,32 +54962,32 @@ The elaboration of a generic_declaration has no
effect.
_Examples_
14
-Examples of generic formal parts:
+<Examples of generic formal parts:>
15
- generic -- parameterless
+ generic --< parameterless >
16
generic
- Size : Natural; -- formal object
+ Size : Natural; --< formal object >
17
generic
- Length : Integer := 200; -- formal object with a default
expression
+ Length : Integer := 200; --< formal object with a default
expression>
18
- Area : Integer := Length*Length; -- formal object with a default
expression
+ Area : Integer := Length*Length; --< formal object with a default
expression>
19
generic
- type Item is private; -- formal type
- type Index is (<>); -- formal type
- type Row is array(Index range <>) of Item; -- formal type
- with function "<"(X, Y : Item) return Boolean; -- formal subprogram
+ type Item is private; --< formal type>
+ type Index is (<>); --< formal type>
+ type Row is array(Index range <>) of Item; --< formal type>
+ with function "<"(X, Y : Item) return Boolean; --< formal
subprogram >
20
-Examples of generic declarations declaring generic subprograms Exchange
-and Squaring:
+<Examples of generic declarations declaring generic subprograms Exchange
+and Squaring:>
21
generic
@@ -54816,7 +55001,7 @@ and Squaring:
function Squaring(X : Item) return Item;
23
-Example of a generic declaration declaring a generic package:
+<Example of a generic declaration declaring a generic package:>
24
generic
@@ -54845,7 +55030,7 @@ Example of a generic declaration declaring a generic
package:
_Wording Changes from Ada 83_
24.c/3
- {AI05-0299-1AI05-0299-1} The syntax for
+ {<AI05-0299-1AI05-0299-1>} The syntax for
generic_formal_parameter_declaration and
formal_type_definition is split up into more named categories.
The rules for these categories are moved to the appropriate
@@ -54861,8 +55046,8 @@ Example of a generic declaration declaring a generic
package:
_Extensions to Ada 2005_
24.d/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a generic_subprogram_declaration (as well as a
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a generic_subprogram_declaration (as well as a
generic_package_declaration). This is described in *note
13.1.1::.
@@ -54873,7 +55058,7 @@ File: aarm2012.info, Node: 12.2, Next: 12.3, Prev:
12.1, Up: 12
===================
1
-The body of a generic unit (a generic body) [is a template for the
+The body of a generic unit (a <generic body>) [is a template for the
instance bodies. The syntax of a generic body is identical to that of a
nongeneric body].
@@ -54900,11 +55085,11 @@ from then on be instantiated without failing the
Elaboration_Check.
_Examples_
4
-Example of a generic procedure body:
+<Example of a generic procedure body:>
5
- procedure Exchange(U, V : in out Elem) is -- see *note 12.1::
- T : Elem; -- the generic formal type
+ procedure Exchange(U, V : in out Elem) is --< see *note 12.1::>
+ T : Elem; --< the generic formal type>
begin
T := U;
U := V;
@@ -54912,23 +55097,23 @@ Example of a generic procedure body:
end Exchange;
6
-Example of a generic function body:
+<Example of a generic function body:>
7
- function Squaring(X : Item) return Item is -- see *note 12.1::
+ function Squaring(X : Item) return Item is --< see *note 12.1::>
begin
- return X*X; -- the formal operator "*"
+ return X*X; --< the formal operator "*">
end Squaring;
8
-Example of a generic package body:
+<Example of a generic package body:>
9
- package body On_Vectors is -- see *note 12.1::
+ package body On_Vectors is --< see *note 12.1::>
10
function Sum(A, B : Vector) return Vector is
- Result : Vector(A'Range); -- the formal type Vector
+ Result : Vector(A'Range); --< the formal type Vector>
Bias : constant Integer := B'First - A'First;
begin
if A'Length /= B'Length then
@@ -54937,17 +55122,17 @@ Example of a generic package body:
11
for N in A'Range loop
- Result(N) := Sum(A(N), B(N + Bias)); -- the formal function Sum
+ Result(N) := Sum(A(N), B(N + Bias)); --< the formal function Sum>
end loop;
return Result;
end Sum;
12
function Sigma(A : Vector) return Item is
- Total : Item := A(A'First); -- the formal type Item
+ Total : Item := A(A'First); --< the formal type Item>
begin
for N in A'First + 1 .. A'Last loop
- Total := Sum(Total, A(N)); -- the formal function Sum
+ Total := Sum(Total, A(N)); --< the formal function Sum>
end loop;
return Total;
end Sigma;
@@ -54965,17 +55150,17 @@ File: aarm2012.info, Node: 12.3, Next: 12.4, Prev:
12.2, Up: 12
_Language Design Principles_
1.a/3
- {AI05-0299-1AI05-0299-1} The legality of an instance should be
- determinable without looking at the generic body. Likewise,
- the legality of a generic body should be determinable without
- looking at any instances. Thus, the generic_declaration forms
- a contract between the body and the instances; if each obeys
- the rules with respect to the generic_declaration, then no
- legality problems will arise. This is really a special case
- of the "legality determinable via semantic dependences"
- Language Design Principle (see Clause *note 10::), given that
- a generic_instantiation does not depend semantically upon the
- generic body, nor vice-versa.
+ {<AI05-0299-1AI05-0299-1>} The legality of an instance should
+ be determinable without looking at the generic body.
+ Likewise, the legality of a generic body should be
+ determinable without looking at any instances. Thus, the
+ generic_declaration forms a contract between the body and the
+ instances; if each obeys the rules with respect to the
+ generic_declaration, then no legality problems will arise.
+ This is really a special case of the "legality determinable
+ via semantic dependences" Language Design Principle (see
+ Clause *note 10::), given that a generic_instantiation does
+ not depend semantically upon the generic body, nor vice-versa.
1.b
Run-time issues are another story. For example, whether
@@ -54987,18 +55172,18 @@ File: aarm2012.info, Node: 12.3, Next: 12.4, Prev:
12.2, Up: 12
_Syntax_
2/3
- {AI95-00218-03AI95-00218-03} {AI05-0183-1AI05-0183-1}
+ {<AI95-00218-03AI95-00218-03>} {<AI05-0183-1AI05-0183-1>}
generic_instantiation ::=
package defining_program_unit_name is
- new generic_package_name [generic_actual_part]
+ new <generic_package_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
procedure defining_program_unit_name is
- new generic_procedure_name [generic_actual_part]
+ new <generic_procedure_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
function defining_designator is
- new generic_function_name [generic_actual_part]
+ new <generic_function_>name [generic_actual_part]
[aspect_specification];
3
@@ -55007,22 +55192,22 @@ File: aarm2012.info, Node: 12.3, Next: 12.4, Prev:
12.2, Up: 12
4
generic_association ::=
- [generic_formal_parameter_selector_name =>]
+ [<generic_formal_parameter_>selector_name =>]
explicit_generic_actual_parameter
5
- explicit_generic_actual_parameter ::= expression | variable_name
- | subprogram_name | entry_name | subtype_mark
- | package_instance_name
+ explicit_generic_actual_parameter ::= expression | <variable_>name
+ | <subprogram_>name | <entry_>name | subtype_mark
+ | <package_instance_>name
6
- A generic_association is named or positional according to whether
- or not the generic_formal_parameter_selector_name (*note 4.1.3:
- S0099.) is specified. Any positional associations shall precede
- any named associations.
+ A generic_association is <named> or <positional> according to
+ whether or not the <generic_formal_parameter_>selector_name (*note
+ 4.1.3: S0099.) is specified. Any positional associations shall
+ precede any named associations.
7/3
-{AI05-0004-1AI05-0004-1} The generic actual parameter is either the
+{<AI05-0004-1AI05-0004-1>} The <generic actual parameter> is either the
explicit_generic_actual_parameter given in a generic_association (*note
12.3: S0278.) for each formal, or the corresponding default_expression
(*note 3.7: S0063.) or default_name (*note 12.6: S0300.) if no
@@ -55040,16 +55225,16 @@ unit of the corresponding kind [(generic package,
generic procedure, or
generic function, respectively)].
9/3
-{AI05-0118-1AI05-0118-1} The generic_formal_parameter_selector_name of a
-named generic_association shall denote a
+{<AI05-0118-1AI05-0118-1>} The <generic_formal_parameter_>selector_name
+of a named generic_association shall denote a
generic_formal_parameter_declaration of the generic unit being
instantiated. If two or more formal subprograms have the same defining
name, then named associations are not allowed for the corresponding
actuals.
9.1/3
-{AI05-0118-1AI05-0118-1} The generic_formal_parameter_declaration for a
-positional generic_association is the parameter with the corresponding
+{<AI05-0118-1AI05-0118-1>} The generic_formal_parameter_declaration for
+a positional generic_association is the parameter with the corresponding
position in the generic_formal_part of the generic unit being
instantiated.
@@ -55068,7 +55253,7 @@ Rules are not enforced; this rule does not apply when a
given rule
explicitly specifies otherwise.
11.a/2
- Reason: {AI95-00114-01AI95-00114-01} Since rules are checked
+ Reason: {<AI95-00114-01AI95-00114-01>} Since rules are checked
using the properties of the formals, and since these
properties do not always carry over to the actuals, we need to
check the rules again in the visible part of the instance.
@@ -55082,14 +55267,14 @@ explicitly specifies otherwise.
be obeyed in the instance.
11.a.1/3
- {AI05-0005-1AI05-0005-1} Ada 2012 addendum: Such Legality
+ {<AI05-0005-1AI05-0005-1>} Ada 2012 addendum: Such Legality
Rules are not as rare as the authors of Ada 95 hoped; there
are more than 30 of them known at this point. They are
indexed under "generic contract issue" and are associated with
the boilerplate "In addition to the places where Legality
Rules normally apply...". Indeed, there is only one known
rule where rechecking in the specification is needed and where
- rechecking in the private part is not wanted (it is in *note
+ rechecking in the private part is <not> wanted (it is in *note
3.4::, but even it needs rechecking when tagged types are
involved).
@@ -55098,7 +55283,7 @@ explicitly specifies otherwise.
without knowing anything about the actuals:
11.c/1
- * {8652/00958652/0095} {AI95-00034-01AI95-00034-01} A
+ * {<8652/00958652/0095>} {<AI95-00034-01AI95-00034-01>} A
formal derived subtype is constrained if and only if the
ancestor subtype is constrained. A formal array type is
constrained if and only if the declarations say so. A
@@ -55132,9 +55317,9 @@ explicitly specifies otherwise.
does not provide an applicable index constraint.
11.j/3
- * {AI05-0239-1AI05-0239-1} The profile of a formal
+ * {<AI05-0239-1AI05-0239-1>} The profile of a formal
subprogram is not subtype conformant with any other
- profile.
+ profile.
11.k
* A generic formal function is not static.
@@ -55159,13 +55344,13 @@ explicitly specifies otherwise.
not checked in the instance body.
11.p/3
- * {AI95-00402-01AI95-00402-01}
- {AI05-0093-1AI05-0093-1} A type with an access
- discriminant with a default_expression has to
- be immutably limited. In the generic body, the
- definition of immutably limited is adjusted in
- an assume-the-worst manner (thus the rule is
- checked that way).
+ * {<AI95-00402-01AI95-00402-01>}
+ {<AI05-0093-1AI05-0093-1>} A type with an
+ access discriminant with a default_expression
+ has to be immutably limited. In the generic
+ body, the definition of immutably limited is
+ adjusted in an assume-the-worst manner (thus
+ the rule is checked that way).
11.q
* In the declaration of a record extension, if
@@ -55182,8 +55367,8 @@ explicitly specifies otherwise.
assume-the-worst manner.
11.r.1/2
- {AI95-00402-01AI95-00402-01} The corrections made by the
- Corrigendum added a number of such rules, and the
+ {<AI95-00402-01AI95-00402-01>} The corrections made by
+ the Corrigendum added a number of such rules, and the
Amendment added many more. There doesn't seem to be much
value in repeating all of these rules here (as of this
writing, there are roughly 33 such rules). As noted
@@ -55216,7 +55401,7 @@ explicitly specifies otherwise.
11.v
* The rule forbidding two explicit homographs in the same
declarative region does not apply in an instance of a
- generic unit, except that it does apply in the
+ generic unit, except that it <does> apply in the
declaration of a record extension that appears in the
visible part of an instance.
@@ -55240,8 +55425,8 @@ explicitly specifies otherwise.
instantiations of the generic unit.
11.aa/3
- Ramification: {AI05-0299-1AI05-0299-1} The Legality Rules are
- described here, and the overloading rules were described
+ Ramification: {<AI05-0299-1AI05-0299-1>} The Legality Rules
+ are described here, and the overloading rules were described
earlier in this subclause. Presumably, every Static Semantic
Item is sucked in by one of those. Thus, we have covered all
the compile-time rules of the language. There is no need to
@@ -55261,7 +55446,7 @@ explicitly specifies otherwise.
package G1 is
type Extension is new Parent with
record
- C : Comp; -- Illegal!
+ C : Comp; --< Illegal!>
end record;
end G1;
@@ -55277,12 +55462,12 @@ explicitly specifies otherwise.
11.ff
generic
- type Parent is tagged limited private; -- Parent is limited.
+ type Parent is tagged limited private; --< Parent is
limited.>
type Comp is limited private;
package G2 is
type Extension is new Parent with
record
- C : Comp; -- OK.
+ C : Comp; --< OK.>
end record;
end G2;
@@ -55300,7 +55485,7 @@ explicitly specifies otherwise.
package Good_2 is new G2(Parent => Non_Limited_Tagged,
Comp => Non_Limited_Untagged);
package Bad is new G2(Parent => Non_Limited_Tagged,
- Comp => Limited_Untagged); -- Illegal!
+ Comp => Limited_Untagged); --<
Illegal!>
11.jj
The first instantiation is legal, because in the instance the
@@ -55339,8 +55524,9 @@ instance body, both at the place of the instantiation.
13
The instance is a copy of the text of the template. [Each use of a
formal parameter becomes (in the copy) a use of the actual, as explained
-below.] An instance of a generic package is a package, that of a generic
-procedure is a procedure, and that of a generic function is a function.
+below.] An instance of a generic package is a package, that of a
+generic procedure is a procedure, and that of a generic function is a
+function.
13.a
Ramification: An instance is a package or subprogram (because
@@ -55376,18 +55562,18 @@ procedure is a procedure, and that of a generic
function is a function.
the actual.
13.d/2
- {AI95-00442-01AI95-00442-01} Other properties of the copy (for
- example, staticness, categories to which types belong) are
- recalculated for each instance; this is implied by the fact
- that it's a copy.
+ {<AI95-00442-01AI95-00442-01>} Other properties of the copy
+ (for example, staticness, categories to which types belong)
+ are recalculated for each instance; this is implied by the
+ fact that it's a copy.
13.e/2
- {AI95-00317-01AI95-00317-01} Although the generic_formal_part
- is included in an instance, the declarations in the
- generic_formal_part are only visible outside the instance in
- the case of a generic formal package whose
- formal_package_actual_part includes one or more <> indicators
- -- see *note 12.7::.
+ {<AI95-00317-01AI95-00317-01>} Although the
+ generic_formal_part is included in an instance, the
+ declarations in the generic_formal_part are only visible
+ outside the instance in the case of a generic formal package
+ whose formal_package_actual_part includes one or more <>
+ indicators -- see *note 12.7::.
14
The interpretation of each construct within a generic declaration or
@@ -55474,7 +55660,7 @@ actual.
of the additional operations of the deeper type.
15.c/2
- {AI95-00114-01AI95-00114-01} A formal_type_declaration can
+ {<AI95-00114-01AI95-00114-01>} A formal_type_declaration can
contain discriminant_specifications, a
formal_subprogram_declaration can contain
parameter_specifications, and a formal_package_declaration can
@@ -55516,7 +55702,7 @@ actual.
type Formal is new T1;
package G is
type Derived_From_Formal is new Formal with record ... end
record;
- procedure Foo(X : in Derived_From_Formal); -- Does not
override anything.
+ procedure Foo(X : in Derived_From_Formal); --< Does not
override anything.>
end G;
15.j
@@ -55531,8 +55717,8 @@ actual.
Derived_From_Formal overrides the Foo inherited from T2.
15.m/1
- Implementation Note: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} For formal types, an
+ Implementation Note: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} For formal types, an
implementation that shares the code among multiple instances
of the same generic unit needs to beware that things like
parameter passing mechanisms (by-copy vs. by-reference) and
@@ -55573,8 +55759,8 @@ body of a new one can be executed by a call to an old
one.]
AI83-00398.
17.d/2
- {AI95-00442-01AI95-00442-01} Since an actual type is always in
- the category determined for the formal, the new subprograms
+ {<AI95-00442-01AI95-00442-01>} Since an actual type is always
+ in the category determined for the formal, the new subprograms
hide all of the copied ones, except for a declaration of "/="
that corresponds to an explicit declaration of "=". Such "/="
operators are special, because unlike other implicit
@@ -55613,9 +55799,9 @@ apply to the other kinds of overriding described in
*note 8.3::.
type Formal is new Ancestor with private;
package G is
type T is new Formal with null record;
- procedure P(X : in T); -- (1)
+ procedure P(X : in T); --< (1)>
private
- procedure Q(X : in T); -- (2)
+ procedure Q(X : in T); --< (2)>
end G;
18.d
@@ -55708,7 +55894,7 @@ object of mode in (see *note 12.4::).
22.c
package P is new G(A => Boolean, B => Boolean);
- -- All calls of P.Next are ambiguous.
+ --< All calls of P.Next are ambiguous.>
22.d
Ramification: The following example illustrates some of the
@@ -55717,16 +55903,16 @@ object of mode in (see *note 12.4::).
22.e
generic
type T1 is private;
- -- A predefined "=" operator is implicitly declared here:
- -- function "="(Left, Right : T1) return Boolean;
- -- Call this "="1.
+ --< A predefined "=" operator is implicitly declared here:>
+ --< function "="(Left, Right : T1) return Boolean;>
+ --< Call this "="1.>
package G is
- subtype S1 is T1; -- So we can get our hands on the type
from
- -- outside an instance.
+ subtype S1 is T1; --< So we can get our hands on the type
from>
+ --< outside an instance.>
type T2 is new T1;
- -- An inherited "=" operator is implicitly declared here:
- -- function "="(Left, Right : T2) return Boolean;
- -- Call this "="2.
+ --< An inherited "=" operator is implicitly declared here:>
+ --< function "="(Left, Right : T2) return Boolean;>
+ --< Call this "="2.>
22.f
T1_Obj : T1 := ...;
@@ -55741,21 +55927,21 @@ object of mode in (see *note 12.4::).
22.h
package P is
type My_Int is new Integer;
- -- A predefined "=" operator is implicitly declared here:
- -- function "="(Left, Right : My_Int) return Boolean;
- -- Call this "="3.
+ --< A predefined "=" operator is implicitly declared here:>
+ --< function "="(Left, Right : My_Int) return Boolean;>
+ --< Call this "="3.>
function "="(X, Y : My_Int) return Boolean;
- -- Call this "="4.
- -- "="3 is hidden from all visibility by "="4.
- -- Nonetheless, "="3 can "reemerge" in certain
circumstances.
+ --< Call this "="4.>
+ --< "="3 is hidden from all visibility by "="4.>
+ --< Nonetheless, "="3 can "reemerge" in certain
circumstances.>
end P;
use P;
...
- package I is new G(T1 => My_Int); -- "="5 is declared in I (see
below).
+ package I is new G(T1 => My_Int); --< "="5 is declared in I
(see below).>
use I;
22.i
- Another_T1_Obj : S1 := 13; -- Can't denote T1, but S1 will do.
+ Another_T1_Obj : S1 := 13; --< Can't denote T1, but S1 will do.>
Bool_3 : Boolean := Another_T1_Obj = Another_T1_Obj;
22.j
@@ -55793,20 +55979,20 @@ object of mode in (see *note 12.4::).
_Examples_
23
-Examples of generic instantiations (see *note 12.1::):
+<Examples of generic instantiations (see *note 12.1::):>
24
procedure Swap is new Exchange(Elem => Integer);
- procedure Swap is new Exchange(Character); -- Swap is overloaded
- function Square is new Squaring(Integer); -- "*" of Integer used by
default
+ procedure Swap is new Exchange(Character); --< Swap is overloaded >
+ function Square is new Squaring(Integer); --< "*" of Integer used by
default>
function Square is new Squaring(Item => Matrix, "*" => Matrix_Product);
- function Square is new Squaring(Matrix, Matrix_Product); -- same as
previous
+ function Square is new Squaring(Matrix, Matrix_Product); --< same as
previous >
25
package Int_Vectors is new On_Vectors(Integer, Table, "+");
26
-Examples of uses of instantiated units:
+<Examples of uses of instantiated units:>
27
Swap(A, B);
@@ -55814,11 +56000,11 @@ Examples of uses of instantiated units:
28
T : Table(1 .. 5) := (10, 20, 30, 40, 50);
- N : Integer := Int_Vectors.Sigma(T); -- 150 (see *note 12.2::, "*note
12.2:: Generic Bodies" for the body of Sigma)
+ N : Integer := Int_Vectors.Sigma(T); --< 150 (see *note 12.2::, "*note
12.2:: Generic Bodies" for the body of Sigma)>
29
use Int_Vectors;
- M : Integer := Sigma(T); -- 150
+ M : Integer := Sigma(T); --< 150>
_Inconsistencies With Ada 83_
@@ -55843,7 +56029,7 @@ Examples of uses of instantiated units:
29.c
The syntax rule for explicit_generic_actual_parameter is
- modified to allow a package_instance_name.
+ modified to allow a <package_instance_>name.
_Wording Changes from Ada 83_
@@ -55854,7 +56040,7 @@ Examples of uses of instantiated units:
because it is not of interest to the average user.
29.e/2
- {AI95-00114-01AI95-00114-01} The rule that "An explicit
+ {<AI95-00114-01AI95-00114-01>} The rule that "An explicit
explicit_generic_actual_parameter shall not be supplied more
than once for a given generic formal parameter" seems to be
missing from RM83, although it was clearly the intent.
@@ -55893,20 +56079,20 @@ Examples of uses of instantiated units:
_Extensions to Ada 95_
29.i/2
- {AI95-00218-03AI95-00218-03} An overriding_indicator (see
+ {<AI95-00218-03AI95-00218-03>} An overriding_indicator (see
*note 8.3.1::) is allowed on a subprogram instantiation.
_Extensions to Ada 2005_
29.j/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a generic_instantiation. This is described in
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a generic_instantiation. This is described in
*note 13.1.1::.
_Wording Changes from Ada 2005_
29.k/3
- {AI05-0118-1AI05-0118-1} Correction: Added a definition for
+ {<AI05-0118-1AI05-0118-1>} Correction: Added a definition for
positional parameters, as this is missing from Ada 95 and Ada
2005.
@@ -55934,8 +56120,8 @@ generic unit.]
_Syntax_
2/3
- {AI95-00423-01AI95-00423-01} {AI05-0005-1AI05-0005-1}
- {AI05-0183-1AI05-0183-1} formal_object_declaration ::=
+ {<AI95-00423-01AI95-00423-01>} {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0183-1AI05-0183-1>} formal_object_declaration ::=
defining_identifier_list : mode [null_exclusion]
subtype_mark [:= default_expression]
[aspect_specification];
@@ -55954,8 +56140,8 @@ For a generic formal object of mode in, the expected
type for the actual
is the type of the formal.
5/2
-{AI95-00423-01AI95-00423-01} For a generic formal object of mode in out,
-the type of the actual shall resolve to the type determined by the
+{<AI95-00423-01AI95-00423-01>} For a generic formal object of mode in
+out, the type of the actual shall resolve to the type determined by the
subtype_mark, or for a formal_object_declaration with an
access_definition, to a specific anonymous access type. If the
anonymous access type is an access-to-object type, the type of the
@@ -55963,7 +56149,7 @@ actual shall have the same designated type as that of
the
access_definition. If the anonymous access type is an
access-to-subprogram type, the type of the actual shall have a
designated profile which is type conformant with that of the
-access_definition.
+access_definition.
5.a
Reason: See the corresponding rule for
@@ -55991,46 +56177,46 @@ shall be a name that denotes a variable for which
renaming is allowed
To be honest: The part of this that requires an expression or
name is a Name Resolution Rule, but that's too pedantic to
worry about. (The part about denoting a variable, and
- renaming being allowed, is most certainly not a Name
+ renaming being allowed, is most certainly <not> a Name
Resolution Rule.)
8/2
-{AI95-00287-01AI95-00287-01} {AI95-00423-01AI95-00423-01} In the case
-where the type of the formal is defined by an access_definition, the
-type of the actual and the type of the formal:
+{<AI95-00287-01AI95-00287-01>} {<AI95-00423-01AI95-00423-01>} In the
+case where the type of the formal is defined by an access_definition,
+the type of the actual and the type of the formal:
8.1/2
- * {AI95-00423-01AI95-00423-01} shall both be access-to-object types
+ * {<AI95-00423-01AI95-00423-01>} shall both be access-to-object types
with statically matching designated subtypes and with both or
neither being access-to-constant types; or
8.2/2
- * {AI95-00423-01AI95-00423-01} shall both be access-to-subprogram
- types with subtype conformant designated profiles.
+ * {<AI95-00423-01AI95-00423-01>} shall both be access-to-subprogram
+ types with subtype conformant designated profiles.
8.3/2
-{AI95-00423-01AI95-00423-01} For a formal_object_declaration with a
+{<AI95-00423-01AI95-00423-01>} For a formal_object_declaration with a
null_exclusion or an access_definition that has a null_exclusion:
8.4/2
* if the actual matching the formal_object_declaration denotes the
- generic formal object of another generic unit G, and the
- instantiation containing the actual occurs within the body of G or
- within the body of a generic unit declared within the declarative
- region of G, then the declaration of the formal object of G shall
- have a null_exclusion;
+ generic formal object of another generic unit <G>, and the
+ instantiation containing the actual occurs within the body of <G>
+ or within the body of a generic unit declared within the
+ declarative region of <G>, then the declaration of the formal
+ object of <G> shall have a null_exclusion;
8.5/2
* otherwise, the subtype of the actual matching the
- formal_object_declaration shall exclude null. In addition to the
+ formal_object_declaration shall exclude null. In addition to the
places where Legality Rules normally apply (see *note 12.3::), this
rule applies also in the private part of an instance of a generic
unit.
8.a/2
- Reason: {AI95-00287-01AI95-00287-01}
- {AI95-00423-01AI95-00423-01} This rule prevents "lying". Null
- must never be the value of an object with an explicit
+ Reason: {<AI95-00287-01AI95-00287-01>}
+ {<AI95-00423-01AI95-00423-01>} This rule prevents "lying".
+ Null must never be the value of an object with an explicit
null_exclusion. The first bullet is an assume-the-worst rule
which prevents trouble in generic bodies (including bodies of
child units) when the subtype of the formal object excludes
@@ -56039,11 +56225,11 @@ null_exclusion or an access_definition that has a
null_exclusion:
_Static Semantics_
9/2
-{AI95-00255-01AI95-00255-01} {AI95-00423-01AI95-00423-01} A
+{<AI95-00255-01AI95-00255-01>} {<AI95-00423-01AI95-00423-01>} A
formal_object_declaration declares a generic formal object. The default
-mode is in. For a formal object of mode in, the nominal subtype is the
+mode is in. For a formal object of mode in, the nominal subtype is the
one denoted by the subtype_mark or access_definition in the declaration
-of the formal. For a formal object of mode in out, its type is
+of the formal. For a formal object of mode in out, its type is
determined by the subtype_mark or access_definition in the declaration;
its nominal subtype is nonstatic, even if the subtype_mark denotes a
static subtype; for a composite type, its nominal subtype is
@@ -56051,7 +56237,7 @@ unconstrained if the first subtype of the type is
unconstrained[, even
if the subtype_mark denotes a constrained subtype].
9.a/2
- Reason: {AI95-00255-01AI95-00255-01} We require that the
+ Reason: {<AI95-00255-01AI95-00255-01>} We require that the
subtype is unconstrained because a formal in out acts like a
renaming, and thus the given subtype is ignored for purposes
of matching; any value of the type can be passed. Thus we can
@@ -56062,20 +56248,21 @@ if the subtype_mark denotes a constrained subtype].
disappear due to an assignment to the whole object.
9.b/2
- Discussion: {AI95-00423-01AI95-00423-01} The two "even if"
+ Discussion: {<AI95-00423-01AI95-00423-01>} The two "even if"
clauses are OK even though they don't mention
access_definitions; an access subtype can neither be a static
subtype nor be a composite type.
10/2
-{AI95-00269-01AI95-00269-01} In an instance, a formal_object_declaration
-of mode in is a full constant declaration and declares a new stand-alone
-constant object whose initialization expression is the actual, whereas a
-formal_object_declaration of mode in out declares a view whose
-properties are identical to those of the actual.
+{<AI95-00269-01AI95-00269-01>} In an instance, a
+formal_object_declaration of mode in is a <full constant declaration>
+and declares a new stand-alone constant object whose initialization
+expression is the actual, whereas a formal_object_declaration of mode in
+out declares a view whose properties are identical to those of the
+actual.
10.a/2
- Ramification: {AI95-00287-01AI95-00287-01} These rules imply
+ Ramification: {<AI95-00287-01AI95-00287-01>} These rules imply
that generic formal objects of mode in are passed by copy (or
are built-in-place for a limited type), whereas generic formal
objects of mode in out are passed by reference.
@@ -56099,7 +56286,7 @@ properties are identical to those of the actual.
For the evaluation of a generic_association for a formal object of mode
in, a constant object is created, the value of the actual parameter is
converted to the nominal subtype of the formal object, and assigned to
-the object[, including any value adjustment -- see *note 7.6::].
+the object[, including any value adjustment -- see *note 7.6::].
11.a
Ramification: This includes evaluating the actual and doing a
@@ -56156,33 +56343,34 @@ the object[, including any value adjustment -- see
*note 7.6::].
_Extensions to Ada 95_
12.e/2
- {AI95-00287-01AI95-00287-01} A generic formal in object can
+ {<AI95-00287-01AI95-00287-01>} A generic formal in object can
have a limited type. The actual for such an object must be
built-in-place via a function_call or aggregate, see *note
7.5::.
12.f/2
- {AI95-00423-01AI95-00423-01} A generic formal object can have
- a null_exclusion or an anonymous access type.
+ {<AI95-00423-01AI95-00423-01>} A generic formal object can
+ have a null_exclusion or an anonymous access type.
_Wording Changes from Ada 95_
12.g/2
- {AI95-00255-01AI95-00255-01} Clarified that the nominal
+ {<AI95-00255-01AI95-00255-01>} Clarified that the nominal
subtype of a composite formal in out object is unconstrained
if the first subtype of the type is unconstrained.
12.h/2
- {AI95-00269-01AI95-00269-01} Clarified that a formal in object
- can be static when referenced from outside of the instance (by
- declaring such an object to be a full constant declaration).
+ {<AI95-00269-01AI95-00269-01>} Clarified that a formal in
+ object can be static when referenced from outside of the
+ instance (by declaring such an object to be a full constant
+ declaration).
_Extensions to Ada 2005_
12.i/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a formal_object_declaration. This is described in
- *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a formal_object_declaration. This is described
+ in *note 13.1.1::.
File: aarm2012.info, Node: 12.5, Next: 12.6, Prev: 12.4, Up: 12
@@ -56191,7 +56379,7 @@ File: aarm2012.info, Node: 12.5, Next: 12.6, Prev:
12.4, Up: 12
=================
1/2
-{AI95-00442-01AI95-00442-01} [A generic formal subtype can be used to
+{<AI95-00442-01AI95-00442-01>} [A generic formal subtype can be used to
pass to a generic unit a subtype whose type is in a certain category of
types.]
@@ -56208,23 +56396,23 @@ types.]
_Syntax_
2/3
- {AI05-0213-1AI05-0213-1} formal_type_declaration ::=
+ {<AI05-0213-1AI05-0213-1>} formal_type_declaration ::=
formal_complete_type_declaration
| formal_incomplete_type_declaration
2.1/3
- {AI05-0183-1AI05-0183-1} {AI05-0213-1AI05-0213-1}
+ {<AI05-0183-1AI05-0183-1>} {<AI05-0213-1AI05-0213-1>}
formal_complete_type_declaration ::=
type defining_identifier[discriminant_part] is
formal_type_definition
[aspect_specification];
2.2/3
- {AI05-0213-1AI05-0213-1} formal_incomplete_type_declaration ::=
+ {<AI05-0213-1AI05-0213-1>} formal_incomplete_type_declaration ::=
type defining_identifier[discriminant_part] [is tagged];
3/2
- {AI95-00251-01AI95-00251-01} formal_type_definition ::=
+ {<AI95-00251-01AI95-00251-01>} formal_type_definition ::=
formal_private_type_definition
| formal_derived_type_definition
| formal_discrete_type_definition
@@ -56241,7 +56429,7 @@ types.]
4
For a generic formal subtype, the actual shall be a subtype_mark; it
-denotes the (generic) actual subtype.
+denotes the <(generic) actual subtype>.
4.a
Ramification: When we say simply "formal" or "actual" (for a
@@ -56253,16 +56441,16 @@ denotes the (generic) actual subtype.
_Static Semantics_
5
-A formal_type_declaration declares a (generic) formal type, and its
-first subtype, the (generic) formal subtype.
+A formal_type_declaration declares a <(generic) formal type>, and its
+first subtype, the <(generic) formal subtype>.
5.a
Ramification: A subtype (other than the first subtype) of a
generic formal type is not a generic formal subtype.
6/3
-{AI95-00442-01AI95-00442-01} {AI05-0213-1AI05-0213-1} The form of a
-formal_type_definition determines a category (of types) to which the
+{<AI95-00442-01AI95-00442-01>} {<AI05-0213-1AI05-0213-1>} The form of a
+formal_type_definition <determines a category (of types)> to which the
formal type belongs. For a formal_private_type_definition the reserved
words tagged and limited indicate the category of types (see *note
12.5.1::). The reserved word tagged also plays this role in the case of
@@ -56279,7 +56467,7 @@ formal_discrete_type_definition defines a discrete
type, and so on.
harder to state clearly.
6.b/2
- {AI95-00442-01AI95-00442-01} We use "category' rather than
+ {<AI95-00442-01AI95-00442-01>} We use "category' rather than
"class" above, because the requirement that classes are closed
under derivation is not important here. Moreover, there are
interesting categories that are not closed under derivation.
@@ -56289,26 +56477,26 @@ formal_discrete_type_definition defines a discrete
type, and so on.
_Legality Rules_
7/2
-{AI95-00442-01AI95-00442-01} The actual type shall be in the category
+{<AI95-00442-01AI95-00442-01>} The actual type shall be in the category
determined for the formal.
7.a/2
- Ramification: {AI95-00442-01AI95-00442-01} For example, if the
- category determined for the formal is the category of all
+ Ramification: {<AI95-00442-01AI95-00442-01>} For example, if
+ the category determined for the formal is the category of all
discrete types, then the actual has to be discrete.
7.b/2
- {AI95-00442-01AI95-00442-01} Note that this rule does not
+ {<AI95-00442-01AI95-00442-01>} Note that this rule does not
require the actual to belong to every category to which the
formal belongs. For example, formal private types are in the
category of composite types, but the actual need not be
composite. Furthermore, one can imagine an infinite number of
categories that are just arbitrary sets of types (even though
we don't give them names, since they are uninteresting). We
- don't want this rule to apply to those categories.
+ don't want this rule to apply to <those> categories.
7.c/2
- {AI95-00114-01AI95-00114-01} {AI95-00442-01AI95-00442-01}
+ {<AI95-00114-01AI95-00114-01>} {<AI95-00442-01AI95-00442-01>}
"Limited" is not an "interesting" category, but "nonlimited"
is; it is legal to pass a nonlimited type to a limited formal
type, but not the other way around. The reserved word limited
@@ -56318,33 +56506,33 @@ determined for the formal.
and nonprivate actual types.
7.d/2
- {AI95-00442-01AI95-00442-01} It is legal to pass a class-wide
- subtype as the actual if it is in the right category, so long
- as the formal has unknown discriminants.
+ {<AI95-00442-01AI95-00442-01>} It is legal to pass a
+ class-wide subtype as the actual if it is in the right
+ category, so long as the formal has unknown discriminants.
_Static Semantics_
8/3
-{8652/00378652/0037} {AI95-00043-01AI95-00043-01}
-{AI95-00233-01AI95-00233-01} {AI95-00442-01AI95-00442-01}
-{AI05-0029-1AI05-0029-1} [The formal type also belongs to each category
-that contains the determined category.] The primitive subprograms of
-the type are as for any type in the determined category. For a formal
-type other than a formal derived type, these are the predefined
-operators of the type. For an elementary formal type, the predefined
-operators are implicitly declared immediately after the declaration of
-the formal type. For a composite formal type, the predefined operators
-are implicitly declared either immediately after the declaration of the
-formal type, or later immediately within the declarative region in which
-the type is declared according to the rules of *note 7.3.1::. In an
-instance, the copy of such an implicit declaration declares a view of
-the predefined operator of the actual type, even if this operator has
-been overridden for the actual type and even if it is never declared for
-the actual type. [The rules specific to formal derived types are given
-in *note 12.5.1::.]
+{<8652/00378652/0037>} {<AI95-00043-01AI95-00043-01>}
+{<AI95-00233-01AI95-00233-01>} {<AI95-00442-01AI95-00442-01>}
+{<AI05-0029-1AI05-0029-1>} [The formal type also belongs to each
+category that contains the determined category.] The primitive
+subprograms of the type are as for any type in the determined category.
+For a formal type other than a formal derived type, these are the
+predefined operators of the type. For an elementary formal type, the
+predefined operators are implicitly declared immediately after the
+declaration of the formal type. For a composite formal type, the
+predefined operators are implicitly declared either immediately after
+the declaration of the formal type, or later immediately within the
+declarative region in which the type is declared according to the rules
+of *note 7.3.1::. In an instance, the copy of such an implicit
+declaration declares a view of the predefined operator of the actual
+type, even if this operator has been overridden for the actual type and
+even if it is never declared for the actual type. [The rules specific
+to formal derived types are given in *note 12.5.1::.]
8.a/2
- Ramification: {AI95-00442-01AI95-00442-01} All properties of
+ Ramification: {<AI95-00442-01AI95-00442-01>} All properties of
the type are as for any type in the category. Some examples:
The primitive operations available are as defined by the
language for each category. The form of constraint applicable
@@ -56356,7 +56544,7 @@ in *note 12.5.1::.]
type is not.)
8.b/3
- Reason: {AI05-0029-1AI05-0029-1} The somewhat cryptic phrase
+ Reason: {<AI05-0029-1AI05-0029-1>} The somewhat cryptic phrase
"even if it is never declared" is intended to deal with the
following oddity:
@@ -56382,7 +56570,7 @@ in *note 12.5.1::.]
type C is array (Positive range <>) of Q.T;
8.f/3
- package I is new Q.G (C); -- Where is the predefined "=" for
C?
+ package I is new Q.G (C); --< Where is the predefined "="
for C?>
end R;
8.g/3
@@ -56419,7 +56607,7 @@ in *note 12.5.1::.]
_Examples_
11
-Examples of generic formal types:
+<Examples of generic formal types:>
12
type Item is private;
@@ -56435,13 +56623,13 @@ Examples of generic formal types:
type Table is array (Enum) of Item;
15
-Example of a generic formal part declaring a formal integer type:
+<Example of a generic formal part declaring a formal integer type:>
16
generic
type Rank is range <>;
First : Rank := Rank'First;
- Second : Rank := First + 1; -- the operator "+" of the type Rank
+ Second : Rank := First + 1; --< the operator "+" of the type Rank >
_Wording Changes from Ada 83_
@@ -56462,15 +56650,15 @@ Example of a generic formal part declaring a formal
integer type:
16.c
We no longer consider the multiplying operators that deliver a
- result of type universal_fixed to be predefined for the
+ result of type <universal_fixed> to be predefined for the
various types; there is only one of each in package Standard.
Therefore, we need not mention them here as RM83 had to.
_Wording Changes from Ada 95_
16.d/2
- {8652/00378652/0037} {AI95-00043-01AI95-00043-01}
- {AI95-00233-01AI95-00233-01} Corrigendum 1 corrected the
+ {<8652/00378652/0037>} {<AI95-00043-01AI95-00043-01>}
+ {<AI95-00233-01AI95-00233-01>} Corrigendum 1 corrected the
wording to properly define the location where operators are
defined for formal array types. The wording here was
inconsistent with that in *note 7.3.1::, "*note 7.3.1::
@@ -56479,32 +56667,32 @@ Example of a generic formal part declaring a formal
integer type:
revisions in *note 7.3.1::.
16.e/2
- {AI95-00251-01AI95-00251-01} Formal interface types are
+ {<AI95-00251-01AI95-00251-01>} Formal interface types are
defined; see *note 12.5.5::, "*note 12.5.5:: Formal Interface
Types".
16.f/2
- {AI95-00442-01AI95-00442-01} We use "determines a category"
+ {<AI95-00442-01AI95-00442-01>} We use "determines a category"
rather than class, since not all interesting properties form a
class.
_Extensions to Ada 2005_
16.g/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a formal_type_declaration. This is described in
- *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a formal_type_declaration. This is described
+ in *note 13.1.1::.
_Wording Changes from Ada 2005_
16.h/3
- {AI05-0029-1AI05-0029-1} Correction: Updated the wording to
+ {<AI05-0029-1AI05-0029-1>} Correction: Updated the wording to
acknowledge the possibility of operations that are never
declared for an actual type but still can be used inside of a
generic unit.
16.i/3
- {AI05-0213-1AI05-0213-1} {AI05-0299-1AI05-0299-1} Formal
+ {<AI05-0213-1AI05-0213-1>} {<AI05-0299-1AI05-0299-1>} Formal
incomplete types are added; these are documented as an
extension in the next subclause.
@@ -56523,7 +56711,7 @@ File: aarm2012.info, Node: 12.5.1, Next: 12.5.2, Up:
12.5
---------------------------------------
1/3
-{AI95-00442-01AI95-00442-01} {AI05-0213-1AI05-0213-1} [In its most
+{<AI95-00442-01AI95-00442-01>} {<AI05-0213-1AI05-0213-1>} [In its most
general form, the category determined for a formal private type is all
types, but the category can be restricted to only nonlimited types or to
only tagged types. Similarly, the category for a formal incomplete type
@@ -56533,14 +56721,14 @@ be frozen (see *note 13.14::). The category
determined for a formal
derived type is the derivation class rooted at the ancestor type.]
1.a/3
- Proof: {AI95-00442-01AI95-00442-01} {AI05-0213-1AI05-0213-1}
- The first two rules are given normatively below, and the third
- rule is given normatively in *note 12.5::; they are repeated
- here to give a capsule summary of what this subclause is
- about.
+ Proof: {<AI95-00442-01AI95-00442-01>}
+ {<AI05-0213-1AI05-0213-1>} The first two rules are given
+ normatively below, and the third rule is given normatively in
+ *note 12.5::; they are repeated here to give a capsule summary
+ of what this subclause is about.
1.b/3
- Ramification: {AI05-0213-1AI05-0213-1} Since the actual of a
+ Ramification: {<AI05-0213-1AI05-0213-1>} Since the actual of a
formal incomplete type does not need to be able to be frozen,
the actual can be an incomplete type or a partial view before
its completion.
@@ -56552,8 +56740,8 @@ derived type is the derivation class rooted at the
ancestor type.]
[[abstract] tagged] [limited] private
3/2
- {AI95-00251-01AI95-00251-01} {AI95-00419-01AI95-00419-01}
- {AI95-00443-01AI95-00443-01} formal_derived_type_definition ::=
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00419-01AI95-00419-01>}
+ {<AI95-00443-01AI95-00443-01>} formal_derived_type_definition ::=
[abstract] [limited | synchronized] new subtype_mark [[and
interface_list]with private]
@@ -56571,9 +56759,9 @@ it shall not include a default_expression for a
discriminant.
initial value.
5/3
-{AI95-00401-01AI95-00401-01} {AI95-00419-01AI95-00419-01}
-{AI95-00443-01AI95-00443-01} {AI05-0237-1AI05-0237-1} The ancestor
-subtype of a formal derived type is the subtype denoted by the
+{<AI95-00401-01AI95-00401-01>} {<AI95-00419-01AI95-00419-01>}
+{<AI95-00443-01AI95-00443-01>} {<AI05-0237-1AI05-0237-1>} The <ancestor
+subtype> of a formal derived type is the subtype denoted by the
subtype_mark of the formal_derived_type_definition. For a formal
derived type declaration, the reserved words with private shall appear
if and only if the ancestor type is a tagged type; in this case the
@@ -56593,7 +56781,7 @@ be a limited interface if the reserved word
synchronized appears.
necessarily a direct descendant.
5.b/3
- {AI95-00419-01AI95-00419-01} {AI05-0005-1AI05-0005-1} We
+ {<AI95-00419-01AI95-00419-01>} {<AI05-0005-1AI05-0005-1>} We
require the ancestor type to be limited when limited appears
so that we avoid oddities like limited integer types.
Normally, limited means "match anything" for a generic formal,
@@ -56605,7 +56793,7 @@ be a limited interface if the reserved word
synchronized appears.
part of the rule is redundant.
5.c/2
- {AI95-00443-01AI95-00443-01} We require that synchronized
+ {<AI95-00443-01AI95-00443-01>} We require that synchronized
appear if the ancestor or any of the progenitors are
synchronized, so that property is explicitly given in the
program text - it is not automatically inherited from the
@@ -56613,10 +56801,10 @@ be a limited interface if the reserved word
synchronized appears.
ancestor nor the progenitors are synchronized.
5.1/4
-{AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01}
-{AI95-00443-01AI95-00443-01} {AI05-0087-1AI05-0087-1}
-{AI12-0036-1AI12-0036-1} The actual type for a formal derived type shall
-be a descendant of [the ancestor type and] every progenitor of the
+{<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+{<AI95-00443-01AI95-00443-01>} {<AI05-0087-1AI05-0087-1>}
+{<AI12-0036-1AI12-0036-1>} The actual type for a formal derived type
+shall be a descendant of [the ancestor type and] every progenitor of the
formal type. If the formal type is nonlimited, the actual type shall be
nonlimited. The actual type for a formal derived type shall be tagged
if and only if the formal derived type is a private extension. If the
@@ -56629,7 +56817,7 @@ derived type, the actual type shall be a synchronized
tagged type.
part of the rule is redundant.
5.e/3
- Discussion: {AI05-0005-1AI05-0005-1} For a nonformal private
+ Discussion: {<AI05-0005-1AI05-0005-1>} For a nonformal private
extension, we require the partial view to be synchronized if
the full view is synchronized tagged. This does not apply to
a formal private extension -- it is OK if the formal is not
@@ -56646,7 +56834,7 @@ derived type, the actual type shall be a synchronized
tagged type.
can match any "concrete" actual tagged type.
5.f/3
- {AI05-0087-1AI05-0087-1} A type (including formal types)
+ {<AI05-0087-1AI05-0087-1>} A type (including formal types)
derived from a limited interface could be nonlimited; we do
not want a limited type derived from such an interface to
match a nonlimited formal derived type. Otherwise, we could
@@ -56654,7 +56842,7 @@ derived type, the actual type shall be a synchronized
tagged type.
case.
5.g/4
- {AI12-0036-1AI12-0036-1} If we allowed actual types that
+ {<AI12-0036-1AI12-0036-1>} If we allowed actual types that
differ from the kind of the formal derived type, we could
allow type conversions that would not be allowed outside of
the generic. That would be particularly problematical if the
@@ -56664,7 +56852,7 @@ derived type, the actual type shall be a synchronized
tagged type.
derived type that is not an extension.
6/3
-{AI05-0213-1AI05-0213-1} If a formal private or derived subtype is
+{<AI05-0213-1AI05-0213-1>} If a formal private or derived subtype is
definite, then the actual subtype shall also be definite.
6.a
@@ -56672,10 +56860,11 @@ definite, then the actual subtype shall also be
definite.
subtype, the actual can be either definite or indefinite.
6.1/3
-{AI05-0213-1AI05-0213-1} A formal_incomplete_type_declaration declares a
-formal incomplete type. The only view of a formal incomplete type is an
-incomplete view. [Thus, a formal incomplete type is subject to the same
-usage restrictions as any other incomplete type -- see *note 3.10.1::.]
+{<AI05-0213-1AI05-0213-1>} A formal_incomplete_type_declaration declares
+a formal incomplete type. The only view of a formal incomplete type is
+an incomplete view. [Thus, a formal incomplete type is subject to the
+same usage restrictions as any other incomplete type -- see *note
+3.10.1::.]
7
For a generic formal derived type with no discriminant_part:
@@ -56715,7 +56904,7 @@ For a generic formal derived type with no
discriminant_part:
requirements.
10.1/2
- * {AI95-00231-01AI95-00231-01} If the ancestor subtype is an access
+ * {<AI95-00231-01AI95-00231-01>} If the ancestor subtype is an access
subtype, the actual subtype shall exclude null if and only if the
ancestor subtype excludes null.
@@ -56729,9 +56918,9 @@ For a generic formal derived type with no
discriminant_part:
requirement to be reflected in the contract of the generic.
11/3
-{AI05-0213-1AI05-0213-1} The declaration of a formal derived type shall
-not have a known_discriminant_part. For a generic formal private or
-incomplete type with a known_discriminant_part:
+{<AI05-0213-1AI05-0213-1>} The declaration of a formal derived type
+shall not have a known_discriminant_part. For a generic formal private
+or incomplete type with a known_discriminant_part:
12
* The actual type shall be a type with the same number of
@@ -56743,7 +56932,7 @@ incomplete type with a known_discriminant_part:
14
* The subtype of each discriminant of the actual type shall
statically match the subtype of the corresponding discriminant of
- the formal type.
+ the formal type.
14.a
Reason: We considered defining the first and third rule to be
@@ -56758,20 +56947,20 @@ may, but need not, have discriminants, and may be
definite or
indefinite.]
15.1/4
-{AI12-0095-1AI12-0095-1} When enforcing Legality Rules, for the purposes
-of determining within a generic body whether a type is unconstrained in
-any partial view, a discriminated subtype is considered to have a
-constrained partial view if it is a descendant of an untagged generic
-formal private or derived type.
+{<AI12-0095-1AI12-0095-1>} When enforcing Legality Rules, for the
+purposes of determining within a generic body whether a type is
+unconstrained in any partial view, a discriminated subtype is considered
+to have a constrained partial view if it is a descendant of an untagged
+generic formal private or derived type.
_Static Semantics_
16/2
-{AI95-00442-01AI95-00442-01} The category determined for a formal
+{<AI95-00442-01AI95-00442-01>} The category determined for a formal
private type is as follows:
17/2
- Type Definition Determined Category
+ <Type Definition> <Determined Category>
limited private the category of all types
private the category of all nonlimited types
@@ -56783,10 +56972,10 @@ private type is as follows:
actual type may be abstract.]
18.1/3
-{AI05-0213-1AI05-0213-1} The category determined for a formal incomplete
-type is the category of all types, unless the formal_type_declaration
-includes the reserved word tagged; in this case, it is the category of
-all tagged types.
+{<AI05-0213-1AI05-0213-1>} The category determined for a formal
+incomplete type is the category of all types, unless the
+formal_type_declaration includes the reserved word tagged; in this case,
+it is the category of all tagged types.
19
A formal private or derived type is a private or derived type,
@@ -56795,7 +56984,7 @@ formal private or derived type is abstract if the
reserved word abstract
appears in its declaration.]
20/3
-{AI95-00233-01AI95-00233-01} {AI05-0110-1AI05-0110-1} For a formal
+{<AI95-00233-01AI95-00233-01>} {<AI05-0110-1AI05-0110-1>} For a formal
derived type, the characteristics (including components, but excluding
discriminants if there is a new discriminant_part), predefined
operators, and inherited user-defined primitive subprograms are
@@ -56805,24 +56994,25 @@ parent type and its progenitor types (see *note 3.4::
and *note
7.3.1::).
21/3
-{8652/00388652/0038} {AI95-00202AI95-00202} {AI95-00233-01AI95-00233-01}
-{AI95-00401-01AI95-00401-01} {AI05-0029-1AI05-0029-1}
-{AI05-0110-1AI05-0110-1} In an instance, the copy of an implicit
-declaration of a primitive subprogram of a formal derived type declares
-a view of the corresponding primitive subprogram of the ancestor or
-progenitor of the formal derived type, even if this primitive has been
-overridden for the actual type and even if it is never declared for the
-actual type. When the ancestor or progenitor of the formal derived type
-is itself a formal type, the copy of the implicit declaration declares a
-view of the corresponding copied operation of the ancestor or
-progenitor. [In the case of a formal private extension, however, the
-tag of the formal type is that of the actual type, so if the tag in a
-call is statically determined to be that of the formal type, the body
-executed will be that corresponding to the actual type.]
+{<8652/00388652/0038>} {<AI95-00202AI95-00202>}
+{<AI95-00233-01AI95-00233-01>} {<AI95-00401-01AI95-00401-01>}
+{<AI05-0029-1AI05-0029-1>} {<AI05-0110-1AI05-0110-1>} In an instance,
+the copy of an implicit declaration of a primitive subprogram of a
+formal derived type declares a view of the corresponding primitive
+subprogram of the ancestor or progenitor of the formal derived type,
+even if this primitive has been overridden for the actual type and even
+if it is never declared for the actual type. When the ancestor or
+progenitor of the formal derived type is itself a formal type, the copy
+of the implicit declaration declares a view of the corresponding copied
+operation of the ancestor or progenitor. [In the case of a formal
+private extension, however, the tag of the formal type is that of the
+actual type, so if the tag in a call is statically determined to be that
+of the formal type, the body executed will be that corresponding to the
+actual type.]
21.a/3
- Ramification: {AI95-00401-01AI95-00401-01}
- {AI05-0239-1AI05-0239-1} The above rule defining the
+ Ramification: {<AI95-00401-01AI95-00401-01>}
+ {<AI05-0239-1AI05-0239-1>} The above rule defining the
properties of primitive subprograms in an instance applies
even if the subprogram has been overridden or hidden for the
actual type. This rule is necessary for untagged types,
@@ -56838,7 +57028,7 @@ executed will be that corresponding to the actual type.]
type).
21.b/4
- To be honest: {AI12-0030-1AI12-0030-1} The availability of
+ To be honest: {<AI12-0030-1AI12-0030-1>} The availability of
stream attributes is not formally a characteristic of a type,
but it is still determined by the ancestor type for a formal
derived type in the same way as the characteristics are.
@@ -56850,13 +57040,13 @@ attribute is defined:
23/3
S'Definite
- {AI05-0264-1AI05-0264-1} S'Definite yields True if the
+ {<AI05-0264-1AI05-0264-1>} S'Definite yields True if the
actual subtype corresponding to S is definite; otherwise,
it yields False. The value of this attribute is of the
predefined type Boolean.
23.a/2
- Discussion: {AI95-00114-01AI95-00114-01} Whether an actual
+ Discussion: {<AI95-00114-01AI95-00114-01>} Whether an actual
subtype is definite or indefinite may have a major effect on
the algorithm used in a generic. For example, in a generic
I/O package, whether to use fixed-length or variable-length
@@ -56867,29 +57057,29 @@ S'Definite
_Dynamic Semantics_
23.1/3
-{AI95-00158-01AI95-00158-01} {AI05-0071-1AI05-0071-1} In the case where
-a formal type has unknown discriminants, and the actual type is a
-class-wide type T'Class:
+{<AI95-00158-01AI95-00158-01>} {<AI05-0071-1AI05-0071-1>} In the case
+where a formal type has unknown discriminants, and the actual type is a
+class-wide type <T>'Class:
23.2/2
- * {AI95-00158-01AI95-00158-01} For the purposes of defining the
+ * {<AI95-00158-01AI95-00158-01>} For the purposes of defining the
primitive operations of the formal type, each of the primitive
operations of the actual type is considered to be a subprogram
(with an intrinsic calling convention -- see *note 6.3.1::) whose
body consists of a dispatching call upon the corresponding
- operation of T, with its formal parameters as the actual
+ operation of <T>, with its formal parameters as the actual
parameters. If it is a function, the result of the dispatching
call is returned.
23.3/2
- * {AI95-00158-01AI95-00158-01} If the corresponding operation of T
- has no controlling formal parameters, then the controlling tag
+ * {<AI95-00158-01AI95-00158-01>} If the corresponding operation of
+ <T> has no controlling formal parameters, then the controlling tag
value is determined by the context of the call, according to the
rules for tag-indeterminate calls (see *note 3.9.2:: and *note
5.2::). In the case where the tag would be statically determined
to be that of the formal type, the call raises Program_Error. If
such a function is renamed, any call on the renaming raises
- Program_Error.
+ Program_Error.
23.b/2
Discussion: As it states in *note 6.3.1::, the convention of
@@ -56906,7 +57096,7 @@ class-wide type T'Class:
23.d/2
generic
type NT(<>) is new T with private;
- -- Assume T has operation "function Empty return T;"
+ -- <Assume T has operation ">function Empty return T;<">
package G is
procedure Test(X : in out NT);
end G;
@@ -56915,14 +57105,14 @@ class-wide type T'Class:
package body G is
procedure Test(X : in out NT) is
begin
- X := Empty; -- Dispatching based on X'Tag takes
- -- place if actual is class-wide.
+ X := Empty; -- <Dispatching based on X'Tag takes>
+ -- <place if actual is class-wide.>
declare
Y : NT := Empty;
- -- If actual is class-wide, this raises
Program_Error
- -- as there is no tag provided by context.
+ -- <If actual is class-wide, this raises
Program_Error>
+ -- <as there is no tag provided by context.>
begin
- X := Y; -- We never get this far.
+ X := Y; -- <We never get this far.>
end;
end Test;
end G;
@@ -56934,9 +57124,9 @@ class-wide type T'Class:
NOTES
24/2
- 9 {AI95-00442-01AI95-00442-01} In accordance with the general rule
- that the actual type shall belong to the category determined for
- the formal (see *note 12.5::, "*note 12.5:: Formal Types"):
+ 9 {<AI95-00442-01AI95-00442-01>} In accordance with the general
+ rule that the actual type shall belong to the category determined
+ for the formal (see *note 12.5::, "*note 12.5:: Formal Types"):
25
* If the formal type is nonlimited, then so shall be the actual;
@@ -56984,9 +57174,9 @@ class-wide type T'Class:
_Extensions to Ada 95_
28.c/2
- {AI95-00251-01AI95-00251-01} {AI95-00401-01AI95-00401-01}
- {AI95-00419-01AI95-00419-01} {AI95-00443-01AI95-00443-01} A
- generic formal derived type can include progenitors
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00401-01AI95-00401-01>}
+ {<AI95-00419-01AI95-00419-01>} {<AI95-00443-01AI95-00443-01>}
+ A generic formal derived type can include progenitors
(interfaces) as well as a primary ancestor. It also may
include limited to indicate that it is a limited type, and
synchronized to indicate that it is a synchronized type.
@@ -56994,61 +57184,61 @@ class-wide type T'Class:
_Wording Changes from Ada 95_
28.d/2
- {8652/00388652/0038} {AI95-00202-01AI95-00202-01} Corrigendum:
- Corrected wording to define the operations that are inherited
- when the ancestor of a formal type is itself a formal type to
- avoid anomalies.
+ {<8652/00388652/0038>} {<AI95-00202-01AI95-00202-01>}
+ Corrigendum: Corrected wording to define the operations that
+ are inherited when the ancestor of a formal type is itself a
+ formal type to avoid anomalies.
28.e/2
- {AI95-00158-01AI95-00158-01} Added a semantic description of
+ {<AI95-00158-01AI95-00158-01>} Added a semantic description of
the meaning of operations of an actual class-wide type, as
such a type does not have primitive operations of its own.
28.f/2
- {AI95-00231-01AI95-00231-01} Added a matching rule for access
- subtypes that exclude null.
+ {<AI95-00231-01AI95-00231-01>} Added a matching rule for
+ access subtypes that exclude null.
28.g/2
- {AI95-00233-01AI95-00233-01} The wording for the declaration
+ {<AI95-00233-01AI95-00233-01>} The wording for the declaration
of implicit operations is corrected to be consistent with
*note 7.3.1:: as modified by Corrigendum 1.
28.h/2
- {AI95-00442-01AI95-00442-01} We change to "determines a
+ {<AI95-00442-01AI95-00442-01>} We change to "determines a
category" as that is the new terminology (it avoids confusion,
since not all interesting properties form a class).
_Incompatibilities With Ada 2005_
28.i/3
- {AI05-0087-1AI05-0087-1} Correction: Added wording to prevent
- a limited type from being passed to a nonlimited formal
- derived type. While this was allowed, it would break the
- contract for the limited type, so hopefully no programs
+ {<AI05-0087-1AI05-0087-1>} Correction: Added wording to
+ prevent a limited type from being passed to a nonlimited
+ formal derived type. While this was allowed, it would break
+ the contract for the limited type, so hopefully no programs
actually depend on that.
_Extensions to Ada 2005_
28.j/3
- {AI05-0213-1AI05-0213-1} Formal incomplete types are a new
+ {<AI05-0213-1AI05-0213-1>} Formal incomplete types are a new
kind of generic formal; these can be instantiated with
incomplete types and unfrozen private types.
_Wording Changes from Ada 2005_
28.k/3
- {AI05-0029-1AI05-0029-1} Correction: Updated the wording to
+ {<AI05-0029-1AI05-0029-1>} Correction: Updated the wording to
acknowledge the possibility of operations that are never
declared for an actual type but still can be used inside of a
generic unit.
28.l/3
- {AI05-0071-1AI05-0071-1} Correction: Fixed hole that failed to
- define what happened for "=" for an untagged private type
+ {<AI05-0071-1AI05-0071-1>} Correction: Fixed hole that failed
+ to define what happened for "=" for an untagged private type
whose actual is class-wide.
28.m/3
- {AI05-0110-1AI05-0110-1} Correction: Revised the wording for
+ {<AI05-0110-1AI05-0110-1>} Correction: Revised the wording for
inheritance of characteristics and operations of formal
derived types to be reuse the rules as defined for derived
types; this should eliminate holes in the wording which have
@@ -57056,7 +57246,7 @@ class-wide type T'Class:
four previous times).
28.n/3
- {AI05-0237-1AI05-0237-1} Correction: Added missing rule for
+ {<AI05-0237-1AI05-0237-1>} Correction: Added missing rule for
the ancestors of formal derived types. The added rule would
formally be incompatible, but since it would be impossible to
instantiate any such generic, this cannot happen outside of
@@ -57065,8 +57255,8 @@ class-wide type T'Class:
_Incompatibilities With Ada 2012_
28.o/4
- {AI12-0036-1AI12-0036-1} Corrigendum: Added a requirement that
- a tagged type only match a formal derived type that is a
+ {<AI12-0036-1AI12-0036-1>} Corrigendum: Added a requirement
+ that a tagged type only match a formal derived type that is a
private extension. This is necessary to prevent type
conversions that would not be allowed outside of the generic.
We expect that this will be rare, as it only can happen if the
@@ -57077,7 +57267,7 @@ class-wide type T'Class:
_Wording Changes from Ada 2012_
28.p/4
- {AI12-0095-1AI12-0095-1} Corrigendum: The assume the worst
+ {<AI12-0095-1AI12-0095-1>} Corrigendum: The assume the worst
rule for determining within a generic body whether a type is
unconstrained in any partial view was moved here. While
AI05-0041-1 added it to *note 3.10.2::, it's also needed (at
@@ -57091,22 +57281,22 @@ File: aarm2012.info, Node: 12.5.2, Next: 12.5.3,
Prev: 12.5.1, Up: 12.5
--------------------------
1/2
-{AI95-00442-01AI95-00442-01} A formal scalar type is one defined by any
-of the formal_type_definitions in this subclause. [The category
+{<AI95-00442-01AI95-00442-01>} A <formal scalar type> is one defined by
+any of the formal_type_definitions in this subclause. [The category
determined for a formal scalar type is the category of all discrete,
signed integer, modular, floating point, ordinary fixed point, or
decimal types.]
1.a/2
- Proof: {AI95-00442-01AI95-00442-01} The second rule follows
+ Proof: {<AI95-00442-01AI95-00442-01>} The second rule follows
from the rule in *note 12.5:: that says that the category is
determined by the one given in the name of the syntax
production. The effect of the rule is repeated here to give a
capsule summary of what this subclause is about.
1.b/2
- Ramification: {AI95-00442-01AI95-00442-01} The "category of a
- type" includes any classes that the type belongs to.
+ Ramification: {<AI95-00442-01AI95-00442-01>} The "category of
+ a type" includes any classes that the type belongs to.
_Syntax_
@@ -57155,7 +57345,7 @@ numeric type.
_Wording Changes from Ada 95_
9.a/2
- {AI95-00442-01AI95-00442-01} We change to "determines a
+ {<AI95-00442-01AI95-00442-01>} We change to "determines a
category" as that is the new terminology (it avoids confusion,
since not all interesting properties form a class).
@@ -57166,15 +57356,15 @@ File: aarm2012.info, Node: 12.5.3, Next: 12.5.4,
Prev: 12.5.2, Up: 12.5
-------------------------
1/2
-{AI95-00442-01AI95-00442-01} [The category determined for a formal array
-type is the category of all array types.]
+{<AI95-00442-01AI95-00442-01>} [The category determined for a formal
+array type is the category of all array types.]
1.a/2
- Proof: {AI95-00442-01AI95-00442-01} This rule follows from the
- rule in *note 12.5:: that says that the category is determined
- by the one given in the name of the syntax production. The
- effect of the rule is repeated here to give a capsule summary
- of what this subclause is about.
+ Proof: {<AI95-00442-01AI95-00442-01>} This rule follows from
+ the rule in *note 12.5:: that says that the category is
+ determined by the one given in the name of the syntax
+ production. The effect of the rule is repeated here to give a
+ capsule summary of what this subclause is about.
_Syntax_
@@ -57204,11 +57394,11 @@ following conditions:
6
* For each index position, the index types shall be the same, and the
index subtypes (if unconstrained), or the index ranges (if
- constrained), shall statically match (see *note 4.9.1::).
+ constrained), shall statically match (see *note 4.9.1::).
7
* The component subtypes of the formal and actual array types shall
- statically match.
+ statically match.
8
* If the formal type has aliased components, then so shall the
@@ -57222,10 +57412,10 @@ following conditions:
_Examples_
9
-Example of formal array types:
+<Example of formal array types:>
10
- -- given the generic package
+ --< given the generic package >
11
generic
@@ -57238,21 +57428,21 @@ Example of formal array types:
end P;
12
- -- and the types
+ --< and the types >
13
type Mix is array (Color range <>) of Boolean;
type Option is array (Color) of Boolean;
14
- -- then Mix can match Vector and Option can match Table
+ --< then Mix can match Vector and Option can match Table >
15
package R is new P(Item => Boolean, Index => Color,
Vector => Mix, Table => Option);
16
- -- Note that Mix cannot match Table and Option cannot match Vector
+ --< Note that Mix cannot match Table and Option cannot match Vector>
_Incompatibilities With Ada 83_
@@ -57268,7 +57458,7 @@ Example of formal array types:
_Wording Changes from Ada 95_
16.b/2
- {AI95-00442-01AI95-00442-01} We change to "determines a
+ {<AI95-00442-01AI95-00442-01>} We change to "determines a
category" as that is the new terminology (it avoids confusion,
since not all interesting properties form a class).
@@ -57279,15 +57469,15 @@ File: aarm2012.info, Node: 12.5.4, Next: 12.5.5,
Prev: 12.5.3, Up: 12.5
--------------------------
1/2
-{AI95-00442-01AI95-00442-01} [The category determined for a formal
+{<AI95-00442-01AI95-00442-01>} [The category determined for a formal
access type is the category of all access types.]
1.a/2
- Proof: {AI95-00442-01AI95-00442-01} This rule follows from the
- rule in *note 12.5:: that says that the category is determined
- by the one given in the name of the syntax production. The
- effect of the rule is repeated here to give a capsule summary
- of what this subclause is about.
+ Proof: {<AI95-00442-01AI95-00442-01>} This rule follows from
+ the rule in *note 12.5:: that says that the category is
+ determined by the one given in the name of the syntax
+ production. The effect of the rule is repeated here to give a
+ capsule summary of what this subclause is about.
_Syntax_
@@ -57298,15 +57488,15 @@ access type is the category of all access types.]
3
For a formal access-to-object type, the designated subtypes of the
-formal and actual types shall statically match.
+formal and actual types shall statically match.
4/2
-{AI95-00231-01AI95-00231-01} If and only if the general_access_modifier
-constant applies to the formal, the actual shall be an
-access-to-constant type. If the general_access_modifier all applies to
-the formal, then the actual shall be a general access-to-variable type
-(see *note 3.10::). If and only if the formal subtype excludes null,
-the actual subtype shall exclude null.
+{<AI95-00231-01AI95-00231-01>} If and only if the
+general_access_modifier constant applies to the formal, the actual shall
+be an access-to-constant type. If the general_access_modifier all
+applies to the formal, then the actual shall be a general
+access-to-variable type (see *note 3.10::). If and only if the formal
+subtype excludes null, the actual subtype shall exclude null.
4.a
Ramification: If no _modifier applies to the formal, then the
@@ -57314,14 +57504,14 @@ the actual subtype shall exclude null.
access-to-variable type.
4.a.1/1
- Reason: {8652/01098652/0109} {AI95-00025-01AI95-00025-01}
+ Reason: {<8652/01098652/0109>} {<AI95-00025-01AI95-00025-01>}
Matching an access-to-variable to a formal access-to-constant
type cannot be allowed. If it were allowed, it would be
possible to create an access-to-variable value designating a
constant.
4.b/2
- {AI95-00231-01AI95-00231-01} We require that the "excludes
+ {<AI95-00231-01AI95-00231-01>} We require that the "excludes
null" property match, because it would be difficult to write a
correct generic for a formal access type without knowing this
property. Many typical algorithms and techniques will not
@@ -57334,17 +57524,17 @@ the actual subtype shall exclude null.
be reflected in the contract of the generic.
5/3
-{AI05-0239-1AI05-0239-1} {AI05-0288-1AI05-0288-1} For a formal
+{<AI05-0239-1AI05-0239-1>} {<AI05-0288-1AI05-0288-1>} For a formal
access-to-subprogram subtype, the designated profiles of the formal and
-the actual shall be subtype conformant.
+the actual shall be subtype conformant.
_Examples_
6
-Example of formal access types:
+<Example of formal access types:>
7
- -- the formal types of the generic package
+ --< the formal types of the generic package >
8
generic
@@ -57355,7 +57545,7 @@ Example of formal access types:
end P;
9
- -- can be matched by the actual types
+ --< can be matched by the actual types >
10
type Car;
@@ -57370,7 +57560,7 @@ Example of formal access types:
end record;
12
- -- in the following generic instantiation
+ --< in the following generic instantiation >
13
package R is new P(Node => Car, Link => Car_Name);
@@ -57394,18 +57584,18 @@ Example of formal access types:
_Wording Changes from Ada 95_
13.c/2
- {AI95-00231-01AI95-00231-01} Added a matching rule for
+ {<AI95-00231-01AI95-00231-01>} Added a matching rule for
subtypes that exclude null.
13.d/2
- {AI95-00442-01AI95-00442-01} We change to "determines a
+ {<AI95-00442-01AI95-00442-01>} We change to "determines a
category" as that is the new terminology (it avoids confusion,
since not all interesting properties form a class).
_Incompatibilities With Ada 2005_
13.e/3
- {AI05-0288-1AI05-0288-1} Correction: Matching of formal
+ {<AI05-0288-1AI05-0288-1>} Correction: Matching of formal
access-to-subprogram types now uses subtype conformance rather
than mode conformance, which is needed to plug a hole. This
could cause some instantiations legal in Ada 95 and Ada 2005
@@ -57423,16 +57613,16 @@ File: aarm2012.info, Node: 12.5.5, Prev: 12.5.4,
Up: 12.5
-----------------------------
1/2
-{AI95-00251-01AI95-00251-01} {AI95-00442-01AI95-00442-01} [The category
-determined for a formal interface type is the category of all interface
-types.]
+{<AI95-00251-01AI95-00251-01>} {<AI95-00442-01AI95-00442-01>} [The
+category determined for a formal interface type is the category of all
+interface types.]
1.a/2
- Proof: {AI95-00442-01AI95-00442-01} This rule follows from the
- rule in *note 12.5:: that says that the category is determined
- by the one given in the name of the syntax production. The
- effect of the rule is repeated here to give a capsule summary
- of what this subclause is about.
+ Proof: {<AI95-00442-01AI95-00442-01>} This rule follows from
+ the rule in *note 12.5:: that says that the category is
+ determined by the one given in the name of the syntax
+ production. The effect of the rule is repeated here to give a
+ capsule summary of what this subclause is about.
1.b/2
Ramification: Here we're taking advantage of our switch in
@@ -57444,17 +57634,17 @@ types.]
_Syntax_
2/2
- {AI95-00251-01AI95-00251-01} formal_interface_type_definition ::=
+ {<AI95-00251-01AI95-00251-01>} formal_interface_type_definition ::=
interface_type_definition
_Legality Rules_
3/2
-{AI95-00251AI95-00251} {AI95-00401AI95-00401} The actual type shall be a
-descendant of every progenitor of the formal type.
+{<AI95-00251AI95-00251>} {<AI95-00401AI95-00401>} The actual type shall
+be a descendant of every progenitor of the formal type.
4/2
-{AI95-00345AI95-00345} The actual type shall be a limited, task,
+{<AI95-00345AI95-00345>} The actual type shall be a limited, task,
protected, or synchronized interface if and only if the formal type is
also, respectively, a limited, task, protected, or synchronized
interface.
@@ -57467,10 +57657,10 @@ interface.
_Examples_
5/2
- {AI95-00433-01AI95-00433-01} type Root_Work_Item is tagged private;
+ {<AI95-00433-01AI95-00433-01>} type Root_Work_Item is tagged private;
6/2
- {AI95-00433-01AI95-00433-01} generic
+ {<AI95-00433-01AI95-00433-01>} generic
type Managed_Task is task interface;
type Work_Item(<>) is new Root_Work_Item with private;
package Server_Manager is
@@ -57480,16 +57670,16 @@ interface.
end Server_Manager;
7/2
-{AI95-00433-01AI95-00433-01} This generic allows an application to
+{<AI95-00433-01AI95-00433-01>} This generic allows an application to
establish a standard interface that all tasks need to implement so they
can be managed appropriately by an application-specific scheduler.
_Extensions to Ada 95_
7.a/2
- {AI95-00251-01AI95-00251-01} {AI95-00345-01AI95-00345-01}
- {AI95-00401-01AI95-00401-01} {AI95-00442-01AI95-00442-01} The
- formal interface type is new.
+ {<AI95-00251-01AI95-00251-01>} {<AI95-00345-01AI95-00345-01>}
+ {<AI95-00401-01AI95-00401-01>} {<AI95-00442-01AI95-00442-01>}
+ The formal interface type is new.
File: aarm2012.info, Node: 12.6, Next: 12.7, Prev: 12.5, Up: 12
@@ -57510,31 +57700,31 @@ unit.]
_Syntax_
2/2
- {AI95-00260-02AI95-00260-02} formal_subprogram_declaration ::=
+ {<AI95-00260-02AI95-00260-02>} formal_subprogram_declaration ::=
formal_concrete_subprogram_declaration
| formal_abstract_subprogram_declaration
2.1/3
- {AI95-00260-02AI95-00260-02} {AI05-0183-1AI05-0183-1}
+ {<AI95-00260-02AI95-00260-02>} {<AI05-0183-1AI05-0183-1>}
formal_concrete_subprogram_declaration ::=
with subprogram_specification [is subprogram_default]
[aspect_specification];
2.2/3
- {AI95-00260-02AI95-00260-02} {AI05-0183-1AI05-0183-1}
+ {<AI95-00260-02AI95-00260-02>} {<AI05-0183-1AI05-0183-1>}
formal_abstract_subprogram_declaration ::=
with subprogram_specification is abstract [subprogram_default]
[aspect_specification];
3/2
- {AI95-00348-01AI95-00348-01} subprogram_default ::=
+ {<AI95-00348-01AI95-00348-01>} subprogram_default ::=
default_name | <> | null
4
default_name ::= name
4.1/2
- {AI95-00260-02AI95-00260-02} {AI95-00348-01AI95-00348-01} A
+ {<AI95-00260-02AI95-00260-02>} {<AI95-00348-01AI95-00348-01>} A
subprogram_default of null shall not be specified for a formal
function or for a formal_abstract_subprogram_declaration.
@@ -57560,7 +57750,7 @@ The expected profile for the default_name, if any, is
that of the formal
subprogram.
5.a/3
- Ramification: {AI05-0299-1AI05-0299-1} This rule, unlike
+ Ramification: {<AI05-0299-1AI05-0299-1>} This rule, unlike
others in this subclause, is observed at compile time of the
generic_declaration.
@@ -57576,35 +57766,35 @@ that of the formal subprogram.
_Legality Rules_
7/3
-{AI05-0239-1AI05-0239-1} The profiles of the formal and any named
-default shall be mode conformant.
+{<AI05-0239-1AI05-0239-1>} The profiles of the formal and any named
+default shall be mode conformant.
7.a/3
- Ramification: {AI05-0299-1AI05-0299-1} This rule, unlike
+ Ramification: {<AI05-0299-1AI05-0299-1>} This rule, unlike
others in this subclause, is checked at compile time of the
generic_declaration.
8/3
-{AI05-0239-1AI05-0239-1} The profiles of the formal and actual shall be
-mode conformant.
+{<AI05-0239-1AI05-0239-1>} The profiles of the formal and actual shall
+be mode conformant.
8.1/2
-{AI95-00423-01AI95-00423-01} For a parameter or result subtype of a
+{<AI95-00423-01AI95-00423-01>} For a parameter or result subtype of a
formal_subprogram_declaration that has an explicit null_exclusion:
8.2/2
* if the actual matching the formal_subprogram_declaration denotes a
- generic formal object of another generic unit G, and the
+ generic formal object of another generic unit <G>, and the
instantiation containing the actual that occurs within the body of
- a generic unit G or within the body of a generic unit declared
- within the declarative region of the generic unit G, then the
+ a generic unit <G> or within the body of a generic unit declared
+ within the declarative region of the generic unit <G>, then the
corresponding parameter or result type of the formal subprogram of
- G shall have a null_exclusion;
+ <G> shall have a null_exclusion;
8.3/2
* otherwise, the subtype of the corresponding parameter or result
type of the actual matching the formal_subprogram_declaration shall
- exclude null. In addition to the places where Legality Rules
+ exclude null. In addition to the places where Legality Rules
normally apply (see *note 12.3::), this rule applies also in the
private part of an instance of a generic unit.
@@ -57617,18 +57807,18 @@ formal_subprogram_declaration that has an explicit
null_exclusion:
implicitly.
8.4/3
-{AI95-00260-02AI95-00260-02} {AI05-0296-1AI05-0296-1} If a formal
+{<AI95-00260-02AI95-00260-02>} {<AI05-0296-1AI05-0296-1>} If a formal
parameter of a formal_abstract_subprogram_declaration (*note 12.6:
-S0298.) is of a specific tagged type T or of an anonymous access type
-designating a specific tagged type T, T is called a controlling type of
-the formal_abstract_subprogram_declaration (*note 12.6: S0298.).
-Similarly, if the result of a formal_abstract_subprogram_declaration
-(*note 12.6: S0298.) for a function is of a specific tagged type T or of
-an anonymous access type designating a specific tagged type T, T is
-called a controlling type of the formal_abstract_subprogram_declaration
-(*note 12.6: S0298.). A formal_abstract_subprogram_declaration (*note
-12.6: S0298.) shall have exactly one controlling type, and that type
-shall not be incomplete.
+S0298.) is of a specific tagged type <T> or of an anonymous access type
+designating a specific tagged type <T>, <T> is called a <controlling
+type> of the formal_abstract_subprogram_declaration (*note 12.6:
+S0298.). Similarly, if the result of a
+formal_abstract_subprogram_declaration (*note 12.6: S0298.) for a
+function is of a specific tagged type <T> or of an anonymous access type
+designating a specific tagged type <T>, <T> is called a controlling type
+of the formal_abstract_subprogram_declaration (*note 12.6: S0298.). A
+formal_abstract_subprogram_declaration (*note 12.6: S0298.) shall have
+exactly one controlling type, and that type shall not be incomplete.
8.b/2
Ramification: The specific tagged type could be any of a
@@ -57642,11 +57832,11 @@ shall not be incomplete.
8.c/2
We informally call a subprogram declared by a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) an
- abstract formal subprogram, but we do not use this term in
- normative wording. (We do use it often in these notes.)
+ <abstract formal subprogram>, but we do not use this term in
+ normative wording. (We do use it often in these notes.)
8.5/2
-{AI95-00260-02AI95-00260-02} The actual subprogram for a
+{<AI95-00260-02AI95-00260-02>} The actual subprogram for a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) shall be a
dispatching operation of the controlling type or of the actual type
corresponding to the controlling type.
@@ -57689,7 +57879,7 @@ corresponding to the controlling type.
8.j/2
generic
type NT(<>) is new T with private;
- -- Presume that T has the following primitive operation:
+ -- <Presume that T has the following primitive operation:>
-- with procedure Bar (Obj : in T);
package Gr ...
@@ -57743,54 +57933,54 @@ a function or procedure, never an entry.
renamed view.
9.1/3
-{AI05-0071-1AI05-0071-1} {AI05-0131-1AI05-0131-1} If a subtype_mark in
-the profile of the formal_subprogram_declaration denotes a formal
+{<AI05-0071-1AI05-0071-1>} {<AI05-0131-1AI05-0131-1>} If a subtype_mark
+in the profile of the formal_subprogram_declaration denotes a formal
private or formal derived type and the actual type for this formal type
-is a class-wide type T'Class, then for the purposes of resolving the
+is a class-wide type <T>'Class, then for the purposes of resolving the
corresponding actual subprogram at the point of the instantiation,
certain implicit declarations may be available as possible resolutions
as follows:
9.2/3
- For each primitive subprogram of T that is directly visible at
- the point of the instantiation, and that has at least one
+ For each primitive subprogram of <T> that is directly visible
+ at the point of the instantiation, and that has at least one
controlling formal parameter, a corresponding implicitly
declared subprogram with the same defining name, and having
- the same profile as the primitive subprogram except that T is
- systematically replaced by T'Class in the types of its
+ the same profile as the primitive subprogram except that <T>
+ is systematically replaced by <T>'Class in the types of its
profile, is potentially use-visible. The body of such a
subprogram is as defined in *note 12.5.1:: for primitive
subprograms of a formal type when the actual type is
class-wide.
9.b/3
- Reason: {AI05-0071-1AI05-0071-1} {AI05-0131-1AI05-0131-1} This
- gives the same capabilities to formal subprograms as those
- that primitive operations of the formal type have when the
- actual type is class-wide. We do not want to discourage the
- use of explicit declarations for (formal) subprograms!
+ Reason: {<AI05-0071-1AI05-0071-1>} {<AI05-0131-1AI05-0131-1>}
+ This gives the same capabilities to formal subprograms as
+ those that primitive operations of the formal type have when
+ the actual type is class-wide. We do not want to discourage
+ the use of explicit declarations for (formal) subprograms!
9.c/3
- Implementation Note: {AI05-0071-1AI05-0071-1}
- {AI05-0131-1AI05-0131-1} Although the above wording seems to
+ Implementation Note: {<AI05-0071-1AI05-0071-1>}
+ {<AI05-0131-1AI05-0131-1>} Although the above wording seems to
require constructing implicit versions of all of the primitive
- subprograms of type T, it should be clear that a compiler only
- needs to consider those that could possibly resolve to the
- corresponding actual subprogram. For instance, if the formal
- subprogram is a procedure with two parameters, and the actual
- subprogram name is Bar (either given explicitly or by
+ subprograms of type <T>, it should be clear that a compiler
+ only needs to consider those that could possibly resolve to
+ the corresponding actual subprogram. For instance, if the
+ formal subprogram is a procedure with two parameters, and the
+ actual subprogram name is Bar (either given explicitly or by
default), the compiler need not consider primitives that are
functions, that have the wrong number of parameters, that have
defining names other than Bar, and so on; thus it does not
need to construct implicit declarations for those primitives.
9.d/3
- Ramification: {AI05-0071-1AI05-0071-1}
- {AI05-0131-1AI05-0131-1} Functions that only have a
+ Ramification: {<AI05-0071-1AI05-0071-1>}
+ {<AI05-0131-1AI05-0131-1>} Functions that only have a
controlling result and do not have a controlling parameter of
- T are not covered by this rule, as any call would be required
- to raise Program_Error by *note 12.5.1::. It is better to
- detect the error earlier than at run time.
+ <T> are not covered by this rule, as any call would be
+ required to raise Program_Error by *note 12.5.1::. It is
+ better to detect the error earlier than at run time.
10
If a generic unit has a subprogram_default specified by a box, and the
@@ -57799,16 +57989,16 @@ explicit actual parameter that is a usage name
identical to the defining
name of the formal.
10.1/2
-{AI95-00348-01AI95-00348-01} If a generic unit has a subprogram_default
-specified by the reserved word null, and the corresponding actual
-parameter is omitted, then it is equivalent to an explicit actual
-parameter that is a null procedure having the profile given in the
-formal_subprogram_declaration (*note 12.6: S0296.).
+{<AI95-00348-01AI95-00348-01>} If a generic unit has a
+subprogram_default specified by the reserved word null, and the
+corresponding actual parameter is omitted, then it is equivalent to an
+explicit actual parameter that is a null procedure having the profile
+given in the formal_subprogram_declaration (*note 12.6: S0296.).
10.2/2
-{AI95-00260-02AI95-00260-02} The subprogram declared by a
+{<AI95-00260-02AI95-00260-02>} The subprogram declared by a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) with a
-controlling type T is a dispatching operation of type T.
+controlling type <T> is a dispatching operation of type <T>.
10.a/2
Reason: This is necessary to trigger all of the dispatching
@@ -57858,20 +58048,20 @@ controlling type T is a dispatching operation of type
T.
equivalent explicit actual parameter.
16/2
- 18 {AI95-00260-02AI95-00260-02} The actual subprogram cannot be
+ 18 {<AI95-00260-02AI95-00260-02>} The actual subprogram cannot be
abstract unless the formal subprogram is a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) (see
*note 3.9.3::).
16.1/2
- 19 {AI95-00260-02AI95-00260-02} The subprogram declared by a
+ 19 {<AI95-00260-02AI95-00260-02>} The subprogram declared by a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) is an
abstract subprogram. All calls on a subprogram declared by a
formal_abstract_subprogram_declaration (*note 12.6: S0298.) must be
dispatching calls. See *note 3.9.3::.
16.2/2
- 20 {AI95-00348-01AI95-00348-01} A null procedure as a subprogram
+ 20 {<AI95-00348-01AI95-00348-01>} A null procedure as a subprogram
default has convention Intrinsic (see *note 6.3.1::).
16.a.1/2
@@ -57881,20 +58071,20 @@ controlling type T is a dispatching operation of type
T.
_Examples_
17
-Examples of generic formal subprograms:
+<Examples of generic formal subprograms:>
18/2
- {AI95-00433-01AI95-00433-01} with function "+"(X, Y : Item) return Item
is <>;
+ {<AI95-00433-01AI95-00433-01>} with function "+"(X, Y : Item) return Item
is <>;
with function Image(X : Enum) return String is Enum'Image;
with procedure Update is Default_Update;
- with procedure Pre_Action(X : in Item) is null; -- defaults to no action
+ with procedure Pre_Action(X : in Item) is null; --< defaults to no
action>
with procedure Write(S : not null access Root_Stream_Type'Class;
Desc : Descriptor)
- is abstract Descriptor'Write; -- see *note 13.13.2::
- -- Dispatching operation on Descriptor with default
+ is abstract Descriptor'Write; --< see *note
13.13.2::>
+ --< Dispatching operation on Descriptor with default>
19
- -- given the generic procedure declaration
+ --< given the generic procedure declaration >
20
generic
@@ -57902,13 +58092,13 @@ Examples of generic formal subprograms:
procedure Iterate(Seq : in Item_Sequence);
21
- -- and the procedure
+ --< and the procedure >
22
procedure Put_Item(X : in Item);
23
- -- the following instantiation is possible
+ --< the following instantiation is possible >
24
procedure Put_List is new Iterate(Action => Put_Item);
@@ -57916,48 +58106,48 @@ Examples of generic formal subprograms:
_Extensions to Ada 95_
24.a/2
- {AI95-00260-02AI95-00260-02} The
+ {<AI95-00260-02AI95-00260-02>} The
formal_abstract_subprogram_declaration is new. It allows the
passing of dispatching operations to generic units.
24.b/2
- {AI95-00348-01AI95-00348-01} The formal subprogram default of
- null is new. It allows the default of a generic procedure to
- do nothing, such as for passing a debugging routine.
+ {<AI95-00348-01AI95-00348-01>} The formal subprogram default
+ of null is new. It allows the default of a generic procedure
+ to do nothing, such as for passing a debugging routine.
_Wording Changes from Ada 95_
24.c/2
- {AI95-00423-01AI95-00423-01} Added matching rules for
+ {<AI95-00423-01AI95-00423-01>} Added matching rules for
null_exclusions.
_Incompatibilities With Ada 2005_
24.d/3
- {AI05-0296-1AI05-0296-1} It is now illegal to declare a formal
- abstract subprogram whose controlling type is incomplete. It
- was never intended to allow that, and such a type would have
- to come from outside of the generic unit in Ada 2005, so it is
- unlikely to be useful. Moreover, a dispatching call on the
- subprogram is likely to fail in many implementations. So it
- is very unlikely that any code will need to be changed because
- of this new rule.
+ {<AI05-0296-1AI05-0296-1>} It is now illegal to declare a
+ formal abstract subprogram whose controlling type is
+ incomplete. It was never intended to allow that, and such a
+ type would have to come from outside of the generic unit in
+ Ada 2005, so it is unlikely to be useful. Moreover, a
+ dispatching call on the subprogram is likely to fail in many
+ implementations. So it is very unlikely that any code will
+ need to be changed because of this new rule.
_Extensions to Ada 2005_
24.e/3
- {AI05-0071-1AI05-0071-1} {AI05-0131-1AI05-0131-1} Correction:
- Added construction of implicit subprograms for primitives of
- class-wide actual types, to make it possible to import
- subprograms via formal subprograms as well as by implicit
- primitive operations of a formal type. (This is a Correction
- as it is very important for the usability of indefinite
- containers when instantiated with class-wide types; thus we
- want Ada 2005 implementations to support it.)
+ {<AI05-0071-1AI05-0071-1>} {<AI05-0131-1AI05-0131-1>}
+ Correction: Added construction of implicit subprograms for
+ primitives of class-wide actual types, to make it possible to
+ import subprograms via formal subprograms as well as by
+ implicit primitive operations of a formal type. (This is a
+ Correction as it is very important for the usability of
+ indefinite containers when instantiated with class-wide types;
+ thus we want Ada 2005 implementations to support it.)
24.f/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a formal_concrete_subprogram_declaration and a
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a formal_concrete_subprogram_declaration and a
formal_abstract_subprogram_declaration. This is described in
*note 13.1.1::.
@@ -57976,51 +58166,51 @@ package has to be an instance of that generic
package.]
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} formal_package_declaration ::=
- with package defining_identifier is new generic_package_name
- formal_package_actual_part
+ {<AI05-0183-1AI05-0183-1>} formal_package_declaration ::=
+ with package defining_identifier is new <generic_package_>
+ name formal_package_actual_part
[aspect_specification];
3/2
- {AI95-00317-01AI95-00317-01} formal_package_actual_part ::=
+ {<AI95-00317-01AI95-00317-01>} formal_package_actual_part ::=
([others =>] <>)
| [generic_actual_part]
| (formal_package_association {,
formal_package_association} [, others => <>])
3.1/2
- {AI95-00317-01AI95-00317-01} formal_package_association ::=
+ {<AI95-00317-01AI95-00317-01>} formal_package_association ::=
generic_association
- | generic_formal_parameter_selector_name => <>
+ | <generic_formal_parameter_>selector_name => <>
3.2/2
- {AI95-00317-01AI95-00317-01} Any positional
+ {<AI95-00317-01AI95-00317-01>} Any positional
formal_package_associations shall precede any named
formal_package_associations.
_Legality Rules_
4
-The generic_package_name shall denote a generic package (the template
-for the formal package); the formal package is an instance of the
-template.
+The <generic_package_>name shall denote a generic package (the
+<template> for the formal package); the formal package is an instance of
+the template.
4.1/3
-{AI05-0025-1AI05-0025-1} The generic_formal_parameter_selector_name of a
-formal_package_association shall denote a
+{<AI05-0025-1AI05-0025-1>} The <generic_formal_parameter_>selector_name
+of a formal_package_association shall denote a
generic_formal_parameter_declaration of the template. If two or more
formal subprograms of the template have the same defining name, then
named associations are not allowed for the corresponding actuals.
4.2/3
-{AI95-00398-01AI95-00398-01} A formal_package_actual_part shall contain
-at most one formal_package_association for each formal parameter. If
-the formal_package_actual_part does not include "others => <>", each
-formal parameter without an association shall have a default_expression
-or subprogram_default.
+{<AI95-00398-01AI95-00398-01>} A formal_package_actual_part shall
+contain at most one formal_package_association for each formal
+parameter. If the formal_package_actual_part does not include "others
+=> <>", each formal parameter without an association shall have a
+default_expression or subprogram_default.
4.3/3
-{AI05-0200-1AI05-0200-1} The rules for matching between
+{<AI05-0200-1AI05-0200-1>} The rules for matching between
formal_package_associations and the generic formals of the template are
as follows:
@@ -58031,26 +58221,26 @@ as follows:
the template.
4.5/3
- * If a formal_package_association for a formal type T of the template
- is given by <>, then the formal_package_association for any other
- generic_formal_parameter_declaration of the template that mentions
- T directly or indirectly must be given by <> as well.
+ * If a formal_package_association for a formal type <T> of the
+ template is given by <>, then the formal_package_association for
+ any other generic_formal_parameter_declaration of the template that
+ mentions <T> directly or indirectly must be given by <> as well.
4.a/3
- Discussion: {AI05-0200-1AI05-0200-1} The above rule is simple
- to state, though it does not reflect the fact that the formal
- package functions like an instantiation of a special kind,
- where each box association for a
- generic_formal_parameter_declaration F is replaced with a new
- entity F' that has the same characteristics as F: if F is a
- formal discrete type then F' is a discrete type, if F is a
- formal subprogram then F' is a subprogram with a similar
- signature, etc. In practice this is achieved by making the
- association into a copy of the declaration of the generic
- formal.
+ Discussion: {<AI05-0200-1AI05-0200-1>} The above rule is
+ simple to state, though it does not reflect the fact that the
+ formal package functions like an instantiation of a special
+ kind, where each box association for a
+ generic_formal_parameter_declaration <F> is replaced with a
+ new entity <F>' that has the same characteristics as <F>: if
+ <F> is a formal discrete type then <F>' is a discrete type, if
+ <F> is a formal subprogram then <F>' is a subprogram with a
+ similar signature, etc. In practice this is achieved by
+ making the association into a copy of the declaration of the
+ generic formal.
5/2
-{AI95-00317-01AI95-00317-01} The actual shall be an instance of the
+{<AI95-00317-01AI95-00317-01>} The actual shall be an instance of the
template. If the formal_package_actual_part is (<>) or (others => <>),
[then the actual may be any instance of the template]; otherwise,
certain of the actual parameters of the actual instance shall match the
@@ -58058,22 +58248,23 @@ corresponding actual parameters of the formal
package, determined as
follows:
5.1/2
- * {AI95-00317-01AI95-00317-01} If the formal_package_actual_part
+ * {<AI95-00317-01AI95-00317-01>} If the formal_package_actual_part
(*note 12.7: S0302.) includes generic_associations as well as
associations with <>, then only the actual parameters specified
explicitly with generic_associations are required to match;
5.2/2
- * {AI95-00317-01AI95-00317-01} Otherwise, all actual parameters shall
- match[, whether any actual parameter is given explicitly or by
- default].
+ * {<AI95-00317-01AI95-00317-01>} Otherwise, all actual parameters
+ shall match[, whether any actual parameter is given explicitly or
+ by default].
5.3/2
-{AI95-00317-01AI95-00317-01} The rules for matching of actual parameters
-between the actual instance and the formal package are as follows:
+{<AI95-00317-01AI95-00317-01>} The rules for matching of actual
+parameters between the actual instance and the formal package are as
+follows:
6/2
- * {AI95-00317-01AI95-00317-01} For a formal object of mode in, the
+ * {<AI95-00317-01AI95-00317-01>} For a formal object of mode in, the
actuals match if they are static expressions with the same value,
or if they statically denote the same constant, or if they are both
the literal null.
@@ -58085,15 +58276,15 @@ between the actual instance and the formal package
are as follows:
7
* For a formal subtype, the actuals match if they denote statically
- matching subtypes.
+ matching subtypes.
8
* For other kinds of formals, the actuals match if they statically
denote the same entity.
8.1/1
-{8652/00398652/0039} {AI95-00213-01AI95-00213-01} For the purposes of
-matching, any actual parameter that is the name of a formal object of
+{<8652/00398652/0039>} {<AI95-00213-01AI95-00213-01>} For the purposes
+of matching, any actual parameter that is the name of a formal object of
mode in is replaced by the formal object's actual expression
(recursively).
@@ -58103,7 +58294,7 @@ mode in is replaced by the formal object's actual
expression
A formal_package_declaration declares a generic formal package.
10/2
-{AI95-00317-01AI95-00317-01} The visible part of a formal package
+{<AI95-00317-01AI95-00317-01>} The visible part of a formal package
includes the first list of basic_declarative_items of the
package_specification (*note 7.1: S0191.). In addition, for each actual
parameter that is not required to match, a copy of the declaration of
@@ -58114,7 +58305,7 @@ subprograms of the formal type are also included in the
visible part of
the formal package.
10.a/2
- Ramification: {AI95-00317-01AI95-00317-01} If the
+ Ramification: {<AI95-00317-01AI95-00317-01>} If the
formal_package_actual_part is (<>), then the declarations that
occur immediately within the generic_formal_part of the
template for the formal package are visible outside the formal
@@ -58124,7 +58315,7 @@ the formal package.
(but not the others) are made visible.
10.b/3
- Reason: {AI05-0005-1AI05-0005-1} We always want either the
+ Reason: {<AI05-0005-1AI05-0005-1>} We always want either the
actuals or the formals of an instance to be nameable from
outside, but never both. If both were nameable, one would get
some funny anomalies since they denote the same entity, but,
@@ -58141,28 +58332,28 @@ the formal package.
package as an actual to another generic formal package.
11/2
-{AI95-00317-01AI95-00317-01} For the purposes of matching, if the actual
-instance A is itself a formal package, then the actual parameters of A
-are those specified explicitly or implicitly in the
-formal_package_actual_part for A, plus, for those not specified, the
+{<AI95-00317-01AI95-00317-01>} For the purposes of matching, if the
+actual instance <A> is itself a formal package, then the actual
+parameters of <A> are those specified explicitly or implicitly in the
+formal_package_actual_part for <A>, plus, for those not specified, the
copies of the formal parameters of the template included in the visible
-part of A.
+part of <A>.
_Examples_
12/2
-{AI95-00433-01AI95-00433-01} Example of a generic package with formal
-package parameters:
+{<AI95-00433-01AI95-00433-01>} <Example of a generic package with formal
+package parameters:>
13/2
- with Ada.Containers.Ordered_Maps; -- see *note A.18.6::
+ with Ada.Containers.Ordered_Maps; --< see *note A.18.6::>
generic
with package Mapping_1 is new Ada.Containers.Ordered_Maps(<>);
with package Mapping_2 is new Ada.Containers.Ordered_Maps
(Key_Type => Mapping_1.Element_Type,
others => <>);
package Ordered_Join is
- -- Provide a "join" between two mappings
+ --< Provide a "join" between two mappings>
14/2
subtype Key_Type is Mapping_1.Key_Type;
@@ -58176,8 +58367,8 @@ package parameters:
end Ordered_Join;
17/2
-{AI95-00433-01AI95-00433-01} Example of an instantiation of a package
-with formal packages:
+{<AI95-00433-01AI95-00433-01>} <Example of an instantiation of a package
+with formal packages:>
18/2
with Ada.Containers.Ordered_Maps;
@@ -58217,21 +58408,22 @@ with formal packages:
_Extensions to Ada 95_
25.b/2
- {AI95-00317-01AI95-00317-01} {AI95-00398-01AI95-00398-01} It's
- now allowed to mix actuals of a formal package that are
+ {<AI95-00317-01AI95-00317-01>} {<AI95-00398-01AI95-00398-01>}
+ It's now allowed to mix actuals of a formal package that are
specified with those that are not specified.
_Wording Changes from Ada 95_
25.c/2
- {8652/00398652/0039} {AI95-00213-01AI95-00213-01} Corrigendum:
- Corrected the description of formal package matching to say
- that formal parameters are always replaced by their actual
- parameters (recursively). This matches the actual practice of
- compilers, as the ACATS has always required this behavior.
+ {<8652/00398652/0039>} {<AI95-00213-01AI95-00213-01>}
+ Corrigendum: Corrected the description of formal package
+ matching to say that formal parameters are always replaced by
+ their actual parameters (recursively). This matches the
+ actual practice of compilers, as the ACATS has always required
+ this behavior.
25.d/2
- {AI95-00317-01AI95-00317-01} The description of which
+ {<AI95-00317-01AI95-00317-01>} The description of which
operations are visible in a formal package has been clarified.
We also specify how matching is done when the actual is a
formal package.
@@ -58239,23 +58431,23 @@ with formal packages:
_Incompatibilities With Ada 2005_
25.e/3
- {AI05-0025-1AI05-0025-1} {AI05-0200-1AI05-0200-1} Correction:
- Added missing rules for parameters of generic formal package
- that parallel those in *note 12.3::, as well as some specific
- to <> parameters. These are technically incompatibilities
- because generic formal package parameters that Ada 95 and Ada
- 2005 would have considered legal now have to be rejected. But
- this should not be an issue in practice as such formal
- parameters could not have matched any actual generics. And it
- is quite likely that implementations already enforce some of
- these rules.
+ {<AI05-0025-1AI05-0025-1>} {<AI05-0200-1AI05-0200-1>}
+ Correction: Added missing rules for parameters of generic
+ formal package that parallel those in *note 12.3::, as well as
+ some specific to <> parameters. These are technically
+ incompatibilities because generic formal package parameters
+ that Ada 95 and Ada 2005 would have considered legal now have
+ to be rejected. But this should not be an issue in practice
+ as such formal parameters could not have matched any actual
+ generics. And it is quite likely that implementations already
+ enforce some of these rules.
_Extensions to Ada 2005_
25.f/3
- {AI05-0183-1AI05-0183-1} An optional aspect_specification can
- be used in a formal_package_declaration. This is described in
- *note 13.1.1::.
+ {<AI05-0183-1AI05-0183-1>} An optional aspect_specification
+ can be used in a formal_package_declaration. This is
+ described in *note 13.1.1::.
File: aarm2012.info, Node: 12.8, Prev: 12.7, Up: 12
@@ -58271,7 +58463,7 @@ elements are provided as generic formal parameters.
_Examples_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3
generic
@@ -58371,15 +58563,15 @@ File: aarm2012.info, Node: 13, Next: Annex A,
Prev: 12, Up: Top
************************
1/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0299-1AI05-0299-1} [This clause describes features for querying
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0299-1AI05-0299-1>} [This clause describes features for querying
and controlling certain aspects of entities and for interfacing to
hardware.]
_Wording Changes from Ada 83_
1.a/3
- {AI05-0299-1AI05-0299-1} The subclauses of this clause have
+ {<AI05-0299-1AI05-0299-1>} The subclauses of this clause have
been reorganized. This was necessary to preserve a logical
order, given the new Ada 95 semantics given in this section.
@@ -58407,17 +58599,17 @@ File: aarm2012.info, Node: 13.1, Next: 13.2, Up: 13
===========================================
0.1/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0295-1AI05-0295-1} [Two kinds of aspects of entities can be
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0295-1AI05-0295-1>} [Two kinds of aspects of entities can be
specified: representation aspects and operational aspects.
Representation aspects affect how the types and other entities of the
language are to be mapped onto the underlying machine. Operational
aspects determine other properties of entities.]
0.2/3
-{AI05-0183-1AI05-0183-1} {AI05-0295-1AI05-0295-1} [Either kind of aspect
-of an entity may be specified by means of an aspect_specification (see
-*note 13.1.1::), which is an optional element of most kinds of
+{<AI05-0183-1AI05-0183-1>} {<AI05-0295-1AI05-0295-1>} [Either kind of
+aspect of an entity may be specified by means of an aspect_specification
+(see *note 13.1.1::), which is an optional element of most kinds of
declarations and applies to the entity or entities being declared.
Aspects may also be specified by certain other constructs occurring
subsequent to the declaration of the affected entity: a representation
@@ -58426,22 +58618,23 @@ operational aspect value may be specified by means of
an operational
item.]
1/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} There are six kinds of
-representation items: attribute_definition_clause (*note 13.3: S0310.)s
-for representation attributes, enumeration_representation_clause (*note
-13.4: S0311.)s, record_representation_clause (*note 13.5.1: S0313.)s,
-at_clauses, component_clauses, and representation pragmas. [ They can
-be provided to give more efficient representation or to interface with
-features that are outside the domain of the language (for example,
-peripheral hardware). ]
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} There are six
+kinds of <representation items>: attribute_definition_clause (*note
+13.3: S0310.)s for representation attributes,
+enumeration_representation_clause (*note 13.4: S0311.)s,
+record_representation_clause (*note 13.5.1: S0313.)s, at_clauses,
+component_clauses, and <representation pragmas>. [ They can be provided
+to give more efficient representation or to interface with features that
+are outside the domain of the language (for example, peripheral
+hardware). ]
1.1/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} An operational item is
-an attribute_definition_clause for an operational attribute.
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} An <operational
+item> is an attribute_definition_clause for an operational attribute.
1.2/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} [An operational item
-or a representation item applies to an entity identified by a
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} [An operational
+item or a representation item applies to an entity identified by a
local_name, which denotes an entity declared local to the current
declarative region, or a library unit declared immediately preceding a
representation pragma in a compilation.]
@@ -58449,8 +58642,8 @@ representation pragma in a compilation.]
_Language Design Principles_
1.a/3
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- {AI05-0295-1AI05-0295-1} Representation aspects are intended
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ {<AI05-0295-1AI05-0295-1>} Representation aspects are intended
to refer to properties that need to be known before the
compiler can generate code to create or access an entity. For
instance, the size of an object needs to be known before the
@@ -58461,7 +58654,7 @@ representation pragma in a compilation.]
aspects have stricter rules as to when they can be specified.
1.a.1/3
- {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1}
+ {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>}
Confirming the value of an aspect should never change the
semantics of the aspect. Thus Size = 8 (for example) means
the same thing whether it was specified with a representation
@@ -58476,8 +58669,8 @@ representation pragma in a compilation.]
_Syntax_
2/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} aspect_clause ::=
- attribute_definition_clause
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} aspect_clause
+ ::= attribute_definition_clause
| enumeration_representation_clause
| record_representation_clause
| at_clause
@@ -58485,32 +58678,32 @@ representation pragma in a compilation.]
3
local_name ::= direct_name
| direct_name'attribute_designator
- | library_unit_name
+ | <library_unit_>name
4/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} A representation
- pragma is allowed only at places where an aspect_clause or
- compilation_unit is allowed.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} A
+ representation pragma is allowed only at places where an
+ aspect_clause or compilation_unit is allowed.
_Name Resolution Rules_
5/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} In an operational item
-or representation item, if the local_name is a direct_name, then it
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} In an operational
+item or representation item, if the local_name is a direct_name, then it
shall resolve to denote a declaration (or, in the case of a pragma, one
or more declarations) that occurs immediately within the same
declarative region as the item. If the local_name has an
attribute_designator, then it shall resolve to denote an
implementation-defined component (see *note 13.5.1::) or a class-wide
type implicitly declared immediately within the same declarative region
-as the item. A local_name that is a library_unit_name (only permitted
+as the item. A local_name that is a <library_unit_>name (only permitted
in a representation pragma) shall resolve to denote the library_item
that immediately precedes (except for other pragmas) the representation
pragma.
5.a/1
- Reason: {8652/00098652/0009} {AI95-00137-01AI95-00137-01} This
- is a Name Resolution Rule, because we don't want an
+ Reason: {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ This is a Name Resolution Rule, because we don't want an
operational or representation item for X to be ambiguous just
because there's another X declared in an outer declarative
region. It doesn't make much difference, since most
@@ -58518,31 +58711,31 @@ pragma.
and type and subtype names can't be overloaded.
5.b/1
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} The visibility rules imply that
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} The visibility rules imply that
the declaration has to occur before the operational or
representation item.
5.c/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} For objects,
- this implies that operational or representation items can be
- applied only to stand-alone objects.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} For
+ objects, this implies that operational or representation items
+ can be applied only to stand-alone objects.
_Legality Rules_
6/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} The local_name of an
-aspect_clause or representation pragma shall statically denote an entity
-(or, in the case of a pragma, one or more entities) declared immediately
-preceding it in a compilation, or within the same declarative_part
-(*note 3.11: S0086.), package_specification (*note 7.1: S0191.),
-task_definition (*note 9.1: S0207.), protected_definition (*note 9.4:
-S0212.), or record_definition (*note 3.8: S0067.) as the representation
-or operational item. If a local_name denotes a [local] callable entity,
-it may do so through a [local] subprogram_renaming_declaration (*note
-8.5.4: S0203.) [(as a way to resolve ambiguity in the presence of
-overloading)]; otherwise, the local_name shall not denote a
-renaming_declaration (*note 8.5: S0199.).
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} The local_name of
+an aspect_clause or representation pragma shall statically denote an
+entity (or, in the case of a pragma, one or more entities) declared
+immediately preceding it in a compilation, or within the same
+declarative_part (*note 3.11: S0086.), package_specification (*note 7.1:
+S0191.), task_definition (*note 9.1: S0207.), protected_definition
+(*note 9.4: S0212.), or record_definition (*note 3.8: S0067.) as the
+representation or operational item. If a local_name denotes a [local]
+callable entity, it may do so through a [local]
+subprogram_renaming_declaration (*note 8.5.4: S0203.) [(as a way to
+resolve ambiguity in the presence of overloading)]; otherwise, the
+local_name shall not denote a renaming_declaration (*note 8.5: S0199.).
6.a
Ramification: The "statically denote" part implies that it is
@@ -58572,20 +58765,21 @@ renaming_declaration (*note 8.5: S0199.).
Representation Clauses".
7/2
-{AI95-00291-02AI95-00291-02} The representation of an object consists of
-a certain number of bits (the size of the object). For an object of an
-elementary type, these are the bits that are normally read or updated by
-the machine code when loading, storing, or operating-on the value of the
-object. For an object of a composite type, these are the bits reserved
-for this object, and include bits occupied by subcomponents of the
-object. If the size of an object is greater than that of its subtype,
-the additional bits are padding bits. For an elementary object, these
-padding bits are normally read and updated along with the others. For a
-composite object, padding bits might not be read or updated in any given
-composite operation, depending on the implementation.
+{<AI95-00291-02AI95-00291-02>} The <representation> of an object
+consists of a certain number of bits (the <size> of the object). For an
+object of an elementary type, these are the bits that are normally read
+or updated by the machine code when loading, storing, or operating-on
+the value of the object. For an object of a composite type, these are
+the bits reserved for this object, and include bits occupied by
+subcomponents of the object. If the size of an object is greater than
+that of its subtype, the additional bits are padding bits. For an
+elementary object, these padding bits are normally read and updated
+along with the others. For a composite object, padding bits might not
+be read or updated in any given composite operation, depending on the
+implementation.
7.a/2
- To be honest: {AI95-00291-02AI95-00291-02} Discontiguous
+ To be honest: {<AI95-00291-02AI95-00291-02>} Discontiguous
representations are allowed, but the ones we're interested in
here are generally contiguous sequences of bits. For a
discontiguous representation, the size doesn't necessarily
@@ -58593,7 +58787,7 @@ composite operation, depending on the implementation.
amount of space taken in the address space for the object).
7.a.1/2
- Discussion: {AI95-00291-02AI95-00291-02} In the case of
+ Discussion: {<AI95-00291-02AI95-00291-02>} In the case of
composite objects, we want the implementation to have the
flexibility to either do operations component-by-component, or
with a block operation covering all of the bits. We carefully
@@ -58604,7 +58798,7 @@ composite operation, depending on the implementation.
same object.
7.a.2/2
- {AI95-00291-02AI95-00291-02} In the case of a properly
+ {<AI95-00291-02AI95-00291-02>} In the case of a properly
aligned, contiguous object whose size is a multiple of the
storage unit size, no other bits should be read or updated as
part of operating on the object. We don't say this
@@ -58621,7 +58815,7 @@ composite operation, depending on the implementation.
representation in some cases but not others:
7.c/3
- {AI05-0229-1AI05-0229-1} subtype S is Integer range 1..256;
+ {<AI05-0229-1AI05-0229-1>} subtype S is Integer range 1..256;
type A is array(Natural range 1..4) of S
with Pack;
X : S := 3;
@@ -58645,7 +58839,7 @@ composite operation, depending on the implementation.
padding bits are not either all zero, or a sign extension.
7.g/3
- Ramification: {AI05-0229-1AI05-0229-1} For example, suppose
+ Ramification: {<AI05-0229-1AI05-0229-1>} For example, suppose
S'Size = 2, and an object X is of subtype S. If the machine
code typically uses a 32-bit load instruction to load the
value of X, then X'Size should be 32, even though 30 bits of
@@ -58667,25 +58861,27 @@ composite operation, depending on the implementation.
considered to be more concrete.
8/3
-{AI05-0112-1AI05-0112-1} {AI05-0295-1AI05-0295-1} A representation item
-directly specifies a representation aspect of the entity denoted by the
-local_name, except in the case of a type-related representation item,
-whose local_name shall denote a first subtype, and which directly
-specifies an aspect of the subtype's type. A representation item that
-names a subtype is either subtype-specific (Size and Alignment clauses)
-or type-related (all others). [Subtype-specific aspects may differ for
-different subtypes of the same type.]
+{<AI05-0112-1AI05-0112-1>} {<AI05-0295-1AI05-0295-1>} A representation
+item <directly specifies> a <representation aspect> of the entity
+denoted by the local_name, except in the case of a type-related
+representation item, whose local_name shall denote a first subtype, and
+which directly specifies an aspect of the subtype's type. A
+representation item that names a subtype is either <subtype-specific>
+(Size and Alignment clauses) or <type-related> (all others).
+[Subtype-specific aspects may differ for different subtypes of the same
+type.]
8.a
- To be honest: Type-related and subtype-specific are defined
- likewise for the corresponding aspects of representation.
+ To be honest: <Type-related> and <subtype-specific> are
+ defined likewise for the corresponding aspects of
+ representation.
8.b
To be honest: Some representation items directly specify more
than one aspect.
8.c/3
- Discussion: {AI05-0229-1AI05-0229-1} For example, a pragma
+ Discussion: {<AI05-0229-1AI05-0229-1>} For example, a pragma
Export (see *note J.15.5::) specifies the convention of an
entity, and also specifies that it is exported. Such items
are obsolescent; directly specifying the associated aspects is
@@ -58705,7 +58901,7 @@ different subtypes of the same type.]
At Clauses", and *note J.8::, "*note J.8:: Mod Clauses".
8.e.1/3
- {AI05-0112-1AI05-0112-1} We give a default naming for
+ {<AI05-0112-1AI05-0112-1>} We give a default naming for
representation aspects of representation pragmas so we don't
have to do that for every pragma. Operational and
representation attributes are given a default naming in *note
@@ -58726,8 +58922,8 @@ different subtypes of the same type.]
* Component_Size clause
8.j/1
- * This paragraph was deleted.{8652/00098652/0009}
- {AI95-00137-01AI95-00137-01}
+ * <This paragraph was deleted.>{<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>}
8.k
* Small clause
@@ -58742,23 +58938,23 @@ different subtypes of the same type.]
* Storage_Size clause
8.n.1/2
- * {AI95-00270-01AI95-00270-01} Stream_Size clause
+ * {<AI95-00270-01AI95-00270-01>} Stream_Size clause
8.o/1
- * This paragraph was deleted.{8652/00098652/0009}
- {AI95-00137-01AI95-00137-01}
+ * <This paragraph was deleted.>{<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>}
8.p/1
- * This paragraph was deleted.{8652/00098652/0009}
- {AI95-00137-01AI95-00137-01}
+ * <This paragraph was deleted.>{<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>}
8.q/1
- * This paragraph was deleted.{8652/00098652/0009}
- {AI95-00137-01AI95-00137-01}
+ * <This paragraph was deleted.>{<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>}
8.r/1
- * This paragraph was deleted.{8652/00098652/0009}
- {AI95-00137-01AI95-00137-01}
+ * <This paragraph was deleted.>{<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>}
8.s
* Machine_Radix clause
@@ -58771,11 +58967,11 @@ different subtypes of the same type.]
type)
8.v/3
- * {AI05-0009-1AI05-0009-1} pragmas Atomic, Independent, and
- Volatile (when applied to a type)
+ * {<AI05-0009-1AI05-0009-1>} pragmas Atomic, Independent,
+ and Volatile (when applied to a type)
8.w/3
- * {AI05-0009-1AI05-0009-1} pragmas Atomic_Components,
+ * {<AI05-0009-1AI05-0009-1>} pragmas Atomic_Components,
Independent_Components, and Volatile_Components (when
applied to a type)
@@ -58814,7 +59010,7 @@ different subtypes of the same type.]
a component)
8.hh/3
- * {AI05-0009-1AI05-0009-1} pragmas Atomic_Components,
+ * {<AI05-0009-1AI05-0009-1>} pragmas Atomic_Components,
Independent_Components, and Volatile_Components (when
applied to an array object)
@@ -58825,27 +59021,27 @@ different subtypes of the same type.]
* pragma Asynchronous (applies to procedures)
8.kk/2
- * {AI95-00414-01AI95-00414-01} pragma No_Return (applies to
- subprograms)
+ * {<AI95-00414-01AI95-00414-01>} pragma No_Return (applies
+ to subprograms)
8.ll/3
- {AI05-0229-1AI05-0229-1} While an aspect_specification is not
- a representation item, a similar categorization applies to the
- aspect that corresponds to each of these representation items
- (along with aspects that do not have associated representation
- items).
+ {<AI05-0229-1AI05-0229-1>} While an aspect_specification is
+ not a representation item, a similar categorization applies to
+ the aspect that corresponds to each of these representation
+ items (along with aspects that do not have associated
+ representation items).
8.1/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0183-1AI05-0183-1} An operational item directly specifies an
-operational aspect of the entity denoted by the local_name, except in
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0183-1AI05-0183-1>} An operational item <directly specifies> an
+<operational aspect> of the entity denoted by the local_name, except in
the case of a type-related operational item, whose local_name shall
denote a first subtype, and which directly specifies an aspect of the
-type of the subtype.
+type of the subtype.
8.mm/1
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} The following operational items
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} The following operational items
are type-related:
8.nn/1
@@ -58864,14 +59060,14 @@ type of the subtype.
* Output clause
9/4
-{AI05-0183-1AI05-0183-1} {AI12-0116-1AI12-0116-1} A representation item
-that directly specifies an aspect of a subtype or type shall appear
+{<AI05-0183-1AI05-0183-1>} {<AI12-0116-1AI12-0116-1>} A representation
+item that directly specifies an aspect of a subtype or type shall appear
after the type is completely defined (see *note 3.11.1::), and before
the subtype or type is frozen (see *note 13.14::).
9.a/1
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} The fact that a representation
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} The fact that a representation
item (or operational item, see next paragraph) that directly
specifies an aspect of an entity is required to appear before
the entity is frozen prevents changing the representation of
@@ -58879,14 +59075,14 @@ the subtype or type is frozen (see *note 13.14::).
representation to be known.
9.b/4
- This paragraph was deleted.{AI05-0183-1AI05-0183-1}
- {AI12-0116-1AI12-0116-1}
+ <This paragraph was deleted.>{<AI05-0183-1AI05-0183-1>}
+ {<AI12-0116-1AI12-0116-1>}
9.1/4
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0183-1AI05-0183-1} {AI12-0116-1AI12-0116-1} An operational item
-that directly specifies an aspect of an entity shall appear before the
-entity is frozen (see *note 13.14::).
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0183-1AI05-0183-1>} {<AI12-0116-1AI12-0116-1>} An operational
+item that directly specifies an aspect of an entity shall appear before
+the entity is frozen (see *note 13.14::).
9.c/1
Ramification: Unlike representation items, operational items
@@ -58895,20 +59091,20 @@ entity is frozen (see *note 13.14::).
determine their legality.
9.2/4
-{AI12-0116-1AI12-0116-1} If a representation item, operational item, or
-aspect_specification is given that directly specifies an aspect of an
+{<AI12-0116-1AI12-0116-1>} If a representation item, operational item,
+or aspect_specification is given that directly specifies an aspect of an
entity, then it is illegal to give another representation item,
operational item, or aspect_specification that directly specifies the
same aspect of the entity.
9.c.1/4
- Ramification: {AI12-0116-1AI12-0116-1} This rule applies to
+ Ramification: {<AI12-0116-1AI12-0116-1>} This rule applies to
all aspects, not just those that are operational aspects or
representation aspects. For instance, it applies to subtype
predicates and type invariants.
9.c.2/4
- To be honest: {AI12-0116-1AI12-0116-1} This rule is also
+ To be honest: {<AI12-0116-1AI12-0116-1>} This rule is also
intended to cover other ways to specify representation
aspects, such as obsolescent pragma Priority. Priority is not
a representation pragma, and as such is neither a
@@ -58918,8 +59114,8 @@ same aspect of the entity.
solely to support obsolescent features.
9.3/4
-{AI05-0106-1AI05-0106-1} {AI05-0295-1AI05-0295-1}
-{AI12-0116-1AI12-0116-1} Unless otherwise specified, it is illegal to
+{<AI05-0106-1AI05-0106-1>} {<AI05-0295-1AI05-0295-1>}
+{<AI12-0116-1AI12-0116-1>} Unless otherwise specified, it is illegal to
specify an operational or representation aspect of a generic formal
parameter.
@@ -58938,7 +59134,7 @@ parameter.
rules.
10/4
-{AI05-0295-1AI05-0295-1} {AI12-0109-1AI12-0109-1} For an untagged
+{<AI05-0295-1AI05-0295-1>} {<AI12-0109-1AI12-0109-1>} For an untagged
derived type, it is illegal to specify a type-related representation
aspect if the parent type is a by-reference type, or has any
user-defined primitive subprograms. Similarly, it is illegal to specify
@@ -58946,15 +59142,15 @@ a nonconfirming type-related representation aspect
for an untagged
by-reference type after one or more types have been derived from it.
10.a/3
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} {AI05-0295-1AI05-0295-1} On the
- other hand, subtype-specific representation aspects may be
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} {<AI05-0295-1AI05-0295-1>} On
+ the other hand, subtype-specific representation aspects may be
specified for the first subtype of such a type, as can
operational aspects.
10.b/4
- Reason: {AI05-0229-1AI05-0229-1} {AI05-0295-1AI05-0295-1}
- {AI12-0109-1AI12-0109-1} The reason for forbidding
+ Reason: {<AI05-0229-1AI05-0229-1>} {<AI05-0295-1AI05-0295-1>}
+ {<AI12-0109-1AI12-0109-1>} The reason for forbidding
specification of type-related representation aspects on
untagged by-reference types is because a change of
representation is impossible when passing by reference (to an
@@ -58976,7 +59172,7 @@ by-reference type after one or more types have been
derived from it.
extension part, but not of the parent part.
10.c/4
- Discussion: {AI12-0109-1AI12-0109-1} "By-reference type"
+ Discussion: {<AI12-0109-1AI12-0109-1>} "By-reference type"
usually cannot be used in Legality Rules, as it is privacy
breaking. Our use here is privacy breaking, but we're stuck
with it for compatibility reasons. Since representation
@@ -58987,17 +59183,18 @@ by-reference type after one or more types have been
derived from it.
which is clearly privacy breaking.
11/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} {8652/00118652/0011}
-{AI95-00117-01AI95-00117-01} {AI95-00326-01AI95-00326-01}
-{AI05-0295-1AI05-0295-1} Operational and representation aspects of a
-generic formal parameter are the same as those of the actual.
-Operational and representation aspects are the same for all views of a
-type. Specification of a type-related representation aspect is not
-allowed for a descendant of a generic formal untagged type.
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<8652/00118652/0011>} {<AI95-00117-01AI95-00117-01>}
+{<AI95-00326-01AI95-00326-01>} {<AI05-0295-1AI05-0295-1>} Operational
+and representation aspects of a generic formal parameter are the same as
+those of the actual. Operational and representation aspects are the
+same for all views of a type. Specification of a type-related
+representation aspect is not allowed for a descendant of a generic
+formal untagged type.
11.a/3
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} {AI05-0295-1AI05-0295-1}
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} {<AI05-0295-1AI05-0295-1>}
Specifying representation aspects is allowed for types whose
subcomponent types or index subtypes are generic formal types.
Specifying operational aspects and subtype-related
@@ -59005,14 +59202,14 @@ allowed for a descendant of a generic formal untagged
type.
formal types.
11.b/3
- Reason: {AI05-0295-1AI05-0295-1} Since it is not known whether
- a formal type has user-defined primitive subprograms,
+ Reason: {<AI05-0295-1AI05-0295-1>} Since it is not known
+ whether a formal type has user-defined primitive subprograms,
specifying type-related representation aspects for them is not
allowed, unless they are tagged (in which case only the
extension part is affected in any case).
11.c/2
- Ramification: {AI95-00326-01AI95-00326-01} All views of a
+ Ramification: {<AI95-00326-01AI95-00326-01>} All views of a
type, including the incomplete and partial views, have the
same operational and representation aspects. That's important
so that the properties don't change when changing views.
@@ -59021,7 +59218,7 @@ allowed for a descendant of a generic formal untagged
type.
the same.
11.d/3
- {AI05-0083-1AI05-0083-1} However, this does not apply to
+ {<AI05-0083-1AI05-0083-1>} However, this does not apply to
objects. Different views of an object can have different
representation aspects. For instance, an actual object passed
by reference and the associated formal parameter may have
@@ -59031,30 +59228,30 @@ allowed for a descendant of a generic formal untagged
type.
Alignments are always known at compile time.
12/3
-{AI05-0295-1AI05-0295-1} The specification of the Size aspect for a
+{<AI05-0295-1AI05-0295-1>} The specification of the Size aspect for a
given subtype, or the size or storage place for an object (including a
component) of a given subtype, shall allow for enough storage space to
accommodate any value of the subtype.
13/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0295-1AI05-0295-1} If a specification of a representation or
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0295-1AI05-0295-1>} If a specification of a representation or
operational aspect is not supported by the implementation, it is illegal
or raises an exception at run time.
13.1/3
-{AI95-00251-01AI95-00251-01} {AI05-0295-1AI05-0295-1} A type_declaration
-is illegal if it has one or more progenitors, and a nonconfirming value
-was specified for a representation aspect of an ancestor, and this
-conflicts with the representation of some other ancestor. The cases
-that cause conflicts are implementation defined.
+{<AI95-00251-01AI95-00251-01>} {<AI05-0295-1AI05-0295-1>} A
+type_declaration is illegal if it has one or more progenitors, and a
+nonconfirming value was specified for a representation aspect of an
+ancestor, and this conflicts with the representation of some other
+ancestor. The cases that cause conflicts are implementation defined.
13.a/2
Implementation defined: The cases that cause conflicts between
the representation of the ancestors of a type_declaration.
13.b/3
- Reason: {AI05-0295-1AI05-0295-1} This rule is needed because
+ Reason: {<AI05-0295-1AI05-0295-1>} This rule is needed because
it may be the case that only the combination of types in a
type declaration causes a conflict. Thus it is not possible,
in general, to reject the original representation item or
@@ -59089,14 +59286,14 @@ that cause conflicts are implementation defined.
end Pkg2;
13.f/3
- {AI05-0295-1AI05-0295-1} because the declarations of T and Ifc
- have a conflict in their representation items. This is
+ {<AI05-0295-1AI05-0295-1>} because the declarations of T and
+ Ifc have a conflict in their representation items. This is
clearly necessary (it's hard to imagine how Ifc'Class could
work with the tag at a location other than the one it is
expecting without introducing distributed overhead).
13.g/3
- {AI05-0295-1AI05-0295-1} Conflicts will usually involve
+ {<AI05-0295-1AI05-0295-1>} Conflicts will usually involve
implementation-defined attributes (for specifying the location
of the tag, for instance), although the example above shows
that doesn't have to be the case. For this reason, we didn't
@@ -59105,7 +59302,7 @@ that cause conflicts are implementation defined.
representation aspects it allows to be changed.
13.h/3
- Implementation Note: {AI05-0295-1AI05-0295-1} An
+ Implementation Note: {<AI05-0295-1AI05-0295-1>} An
implementation can only use this rule to reject
type_declarations where one of its ancestors had a
nonconfirming representation value specified. An
@@ -59116,11 +59313,11 @@ that cause conflicts are implementation defined.
14
If two subtypes statically match, then their subtype-specific aspects
-(Size and Alignment) are the same.
+(Size and Alignment) are the same.
14.a/3
- Reason: {AI05-0295-1AI05-0295-1} This is necessary because we
- allow (for example) conversion between access types whose
+ Reason: {<AI05-0295-1AI05-0295-1>} This is necessary because
+ we allow (for example) conversion between access types whose
designated subtypes statically match. Note that most aspects
(including the subtype-specific aspects Size and Alignment)
may not be specified for a nonfirst subtype. The only
@@ -59133,8 +59330,8 @@ If two subtypes statically match, then their
subtype-specific aspects
14.c/1
package P1 is
subtype S1 is Integer range 0..2**16-1;
- for S1'Size use 16; -- Illegal!
- -- S1'Size would be 16 by default.
+ for S1'Size use 16; --< Illegal!>
+ --< S1'Size would be 16 by default.>
type A1 is access all S1;
X1: A1;
end P1;
@@ -59142,13 +59339,13 @@ If two subtypes statically match, then their
subtype-specific aspects
14.d/1
package P2 is
subtype S2 is Integer range 0..2**16-1;
- for S2'Size use 32; -- Illegal!
+ for S2'Size use 32; --< Illegal!>
type A2 is access all S2;
X2: A2;
end P2;
14.e/3
- {AI05-0229-1AI05-0229-1} procedure Q is
+ {<AI05-0229-1AI05-0229-1>} procedure Q is
use P1, P2;
type Array1 is array(Integer range <>) of aliased S1
with Pack;
@@ -59181,8 +59378,8 @@ If two subtypes statically match, then their
subtype-specific aspects
The same issues apply to Alignment.
15/3
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI05-0009-1AI05-0009-1} {AI05-0295-1AI05-0295-1} A derived type
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI05-0009-1AI05-0009-1>} {<AI05-0295-1AI05-0295-1>} A derived type
inherits each type-related representation aspect of its parent type that
was directly specified before the declaration of the derived type, or
(in the case where the parent is derived) that was inherited by the
@@ -59208,7 +59405,7 @@ aspect of the type or subtype.
inheritance does not happen for that representation item.
15.b.1/3
- {AI05-0009-1AI05-0009-1} {AI05-0295-1AI05-0295-1} If an
+ {<AI05-0009-1AI05-0009-1>} {<AI05-0295-1AI05-0295-1>} If an
inherited aspect is confirmed by an aspect_specification or a
later representation item for a derived type, the confirming
specification does not override the inherited one. Thus the
@@ -59218,16 +59415,16 @@ aspect of the type or subtype.
values still apply to this type.
15.b.2/4
- {AI12-0109-1AI12-0109-1} If an aspect was specified by an
+ {<AI12-0109-1AI12-0109-1>} If an aspect was specified by an
aspect_specification and the parent type has not yet been
frozen, then the inherited aspect might not yet have been
resolved and evaluated. The implementation will need to have
a mechanism to handle such an aspect.
15.1/3
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI95-00444-01AI95-00444-01} {AI05-0183-1AI05-0183-1}
-{AI05-0295-1AI05-0295-1} In contrast, whether operational aspects are
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI95-00444-01AI95-00444-01>} {<AI05-0183-1AI05-0183-1>}
+{<AI05-0295-1AI05-0295-1>} In contrast, whether operational aspects are
inherited by a derived type depends on each specific aspect; unless
specified, an operational aspect is not inherited. When operational
aspects are inherited by a derived type, aspects that were directly
@@ -59245,7 +59442,7 @@ specifies the same aspect of the type.
operational item.
15.2/2
-{AI95-00444-01AI95-00444-01} When an aspect that is a subprogram is
+{<AI95-00444-01AI95-00444-01>} When an aspect that is a subprogram is
inherited, the derived type inherits the aspect in the same way that a
derived type inherits a user-defined primitive subprogram from its
parent (see *note 3.4::).
@@ -59258,7 +59455,7 @@ parent (see *note 3.4::).
Each aspect of representation of an entity is as follows:
17
- * If the aspect is specified for the entity, meaning that it is
+ * If the aspect is <specified> for the entity, meaning that it is
either directly specified or inherited, then that aspect of the
entity is as specified, except in the case of Storage_Size, which
specifies a minimum.
@@ -59273,8 +59470,8 @@ Each aspect of representation of an entity is as
follows:
chosen by default in an unspecified manner.
18.a/3
- Ramification: {8652/00098652/0009}
- {AI95-00137-01AI95-00137-01} {AI05-0295-1AI05-0295-1} Note
+ Ramification: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} {<AI05-0295-1AI05-0295-1>} Note
that specifying a representation aspect can affect the
semantics of the entity.
@@ -59289,56 +59486,57 @@ Each aspect of representation of an entity is as
follows:
record layout are type-related aspects.
18.d/3
- Ramification: {AI05-0083-1AI05-0083-1} As noted previously, in
- the case of an object, the entity mentioned in this text is a
- specific view of an object. That means that only references
+ Ramification: {<AI05-0083-1AI05-0083-1>} As noted previously,
+ in the case of an object, the entity mentioned in this text is
+ a specific view of an object. That means that only references
to the same view of an object that has a specified value for a
- representation aspect R necessarily have that value for the
- aspect R. The value of the aspect R for a different view of
- that object is unspecified. In particular, this means that
+ representation aspect <R> necessarily have that value for the
+ aspect <R>. The value of the aspect <R> for a different view
+ of that object is unspecified. In particular, this means that
the representation values for by-reference parameters is
unspecified; they do not have to be the same as those of the
underlying object.
18.1/1
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01} If an operational
-aspect is specified for an entity (meaning that it is either directly
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>} If an operational
+aspect is <specified> for an entity (meaning that it is either directly
specified or inherited), then that aspect of the entity is as specified.
Otherwise, the aspect of the entity has the default value for that
aspect.
18.2/3
-{AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} An
+{<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} An
aspect_specification or representation item that specifies a
representation aspect that would have been chosen in the absence of the
-aspect_specification or representation item is said to be confirming.
-The aspect value specified in this case is said to be a confirming
+aspect_specification or representation item is said to be <confirming>.
+The aspect value specified in this case is said to be a <confirming>
representation aspect value. Other values of the aspect are said to be
-nonconfirming, as are the aspect_specifications and representation items
-that specified them.
+<nonconfirming>, as are the aspect_specifications and representation
+items that specified them.
_Dynamic Semantics_
19/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} For the elaboration of
-an aspect_clause, any evaluable constructs within it are evaluated.
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} For the
+elaboration of an aspect_clause, any evaluable constructs within it are
+evaluated.
19.a/3
- Ramification: {AI05-0299-1AI05-0299-1} Elaboration of
+ Ramification: {<AI05-0299-1AI05-0299-1>} Elaboration of
representation pragmas is covered by the general rules for
pragmas in *note 2.8::.
_Implementation Permissions_
20/3
-{AI05-0295-1AI05-0295-1} An implementation may interpret representation
-aspects in an implementation-defined manner. An implementation may
-place implementation-defined restrictions on the specification of
-representation aspects. A recommended level of support is defined for
-the specification of representation aspects and related features in each
-subclause. These recommendations are changed to requirements for
-implementations that support the Systems Programming Annex (see *note
-C.2::, "*note C.2:: Required Representation Support").
+{<AI05-0295-1AI05-0295-1>} An implementation may interpret
+representation aspects in an implementation-defined manner. An
+implementation may place implementation-defined restrictions on the
+specification of representation aspects. A <recommended level of
+support> is defined for the specification of representation aspects and
+related features in each subclause. These recommendations are changed
+to requirements for implementations that support the Systems Programming
+Annex (see *note C.2::, "*note C.2:: Required Representation Support").
20.a/3
Implementation defined: The interpretation of each
@@ -59357,28 +59555,29 @@ C.2::, "*note C.2:: Required Representation Support").
example.
20.c.1/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} There is no
- such permission for operational aspects.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} There is
+ no such permission for operational aspects.
_Implementation Advice_
21/3
-{AI05-0295-1AI05-0295-1} The recommended level of support for the
+{<AI05-0295-1AI05-0295-1>} The recommended level of support for the
specification of all representation aspects is qualified as follows:
21.1/3
- * {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} A confirming
- specification for a representation aspect should be supported.
+ * {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} A
+ confirming specification for a representation aspect should be
+ supported.
21.a/3
- To be honest: {AI05-0295-1AI05-0295-1} A confirming
+ To be honest: {<AI05-0295-1AI05-0295-1>} A confirming
representation aspect value might not be possible for some
entities. For instance, consider an unconstrained array. The
size of such a type is implementation-defined, and might not
actually be a representable value, or might not be static.
22/3
- * {AI05-0295-1AI05-0295-1} An implementation need not support the
+ * {<AI05-0295-1AI05-0295-1>} An implementation need not support the
specification for a representation aspect that contains nonstatic
expressions, unless each nonstatic expression is a name that
statically denotes a constant declared before the entity.
@@ -59425,7 +59624,7 @@ specification of all representation aspects is
qualified as follows:
any) are all static constraints.
24/3
- * {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} An
+ * {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} An
implementation need not support specifying a nonconfirming
representation aspect value if it could cause an aliased object or
an object of a by-reference type to be allocated at a
@@ -59442,7 +59641,7 @@ specification of all representation aspects is
qualified as follows:
it's feasible.)
24.b/2
- Implementation Note: {AI95-00291-02AI95-00291-02} We want
+ Implementation Note: {<AI95-00291-02AI95-00291-02>} We want
subprograms to be able to assume the properties of the types
of their parameters inside of subprograms. While many objects
can be copied to allow this (and thus do not need
@@ -59454,7 +59653,7 @@ specification of all representation aspects is
qualified as follows:
component is passed as a parameter.
25/3
- * {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} An
+ * {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} An
implementation need not support specifying a nonconfirming
representation aspect value if it could cause an aliased object of
an elementary type to have a size other than that which would have
@@ -59466,7 +59665,7 @@ specification of all representation aspects is
qualified as follows:
than that assumed by users of the access type.
26/3
- * {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} An
+ * {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} An
implementation need not support specifying a nonconfirming
representation aspect value if it could cause an aliased object of
a composite type, or an object whose type is by-reference, to have
@@ -59485,29 +59684,29 @@ specification of all representation aspects is
qualified as follows:
suffices to correctly read and write the value of the object.
27/3
- * {AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} An
+ * {<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} An
implementation need not support specifying a nonconfirming
subtype-specific representation aspect value for an indefinite or
abstract subtype.
27.a/3
- Reason: {AI05-0295-1AI05-0295-1} Representation aspects are
+ Reason: {<AI05-0295-1AI05-0295-1>} Representation aspects are
often not well-defined for such types.
27.b/3
- Ramification: {AI95-00291-02AI95-00291-02}
- {AI05-0229-1AI05-0229-1} A type with the Pack aspect specified
- will typically not be packed so tightly as to disobey the
- above rules. A Component_Size clause or
+ Ramification: {<AI95-00291-02AI95-00291-02>}
+ {<AI05-0229-1AI05-0229-1>} A type with the Pack aspect
+ specified will typically not be packed so tightly as to
+ disobey the above rules. A Component_Size clause or
record_representation_clause will typically be illegal if it
disobeys the above rules. Atomic components have similar
restrictions (see *note C.6::, "*note C.6:: Shared Variable
Control").
28/3
-{AI95-00291-02AI95-00291-02} {AI05-0295-1AI05-0295-1} For purposes of
-these rules, the determination of whether specifying a representation
-aspect value for a type could cause an object to have some property is
+{<AI95-00291-02AI95-00291-02>} {<AI05-0295-1AI05-0295-1>} For purposes
+of these rules, the determination of whether specifying a representation
+aspect value for a type <could cause> an object to have some property is
based solely on the properties of the type itself, not on any available
information about how the type is used. In particular, it presumes that
minimally aligned objects of this type might be declared at some point.
@@ -59519,7 +59718,7 @@ minimally aligned objects of this type might be
declared at some point.
NOTES
29/3
- 1 {AI05-0229-1AI05-0229-1} Aspects that can be specified are
+ 1 {<AI05-0229-1AI05-0229-1>} Aspects that can be specified are
defined throughout this International Standard, and are summarized
in *note K.1::.
@@ -59538,24 +59737,24 @@ minimally aligned objects of this type might be
declared at some point.
_Extensions to Ada 83_
29.b/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Ada 95
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} Ada 95
allows additional aspect_clauses for objects.
_Wording Changes from Ada 83_
29.c/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} The syntax
- rule for type_representation_clause is removed; the right-hand
- side of that rule is moved up to where it was used, in
- aspect_clause. There are two references to "type
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} The
+ syntax rule for type_representation_clause is removed; the
+ right-hand side of that rule is moved up to where it was used,
+ in aspect_clause. There are two references to "type
representation clause" in RM83, both in Section 13; these have
been reworded. Also, the representation_clause has been
renamed the aspect_clause to reflect that it can be used to
control more than just representation aspects.
29.d/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- {AI95-00114-01AI95-00114-01} We have defined a new term
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ {<AI95-00114-01AI95-00114-01>} We have defined a new term
"representation item," which includes all representation
clauses and representation pragmas, as well as
component_clauses. This is convenient because the rules are
@@ -59592,37 +59791,39 @@ minimally aligned objects of this type might be
declared at some point.
_Extensions to Ada 95_
29.i/2
- {AI95-00291-02AI95-00291-02} Amendment Correction: Confirming
- representation items are defined, and the recommended level of
- support is now that they always be supported.
+ {<AI95-00291-02AI95-00291-02>} Amendment Correction:
+ Confirming representation items are defined, and the
+ recommended level of support is now that they always be
+ supported.
_Wording Changes from Ada 95_
29.j/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Added operational items in order to eliminate unnecessary
- restrictions and permissions on stream attributes. As part of
- this, representation_clause was renamed to aspect_clause.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Added operational items in order to eliminate
+ unnecessary restrictions and permissions on stream attributes.
+ As part of this, representation_clause was renamed to
+ aspect_clause.
29.k/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- {AI95-00326-01AI95-00326-01} Corrigendum: Added wording to say
- that the partial and full views have the same operational and
- representation aspects. Ada 2005 extends this to cover all
- views, including the incomplete view.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ {<AI95-00326-01AI95-00326-01>} Corrigendum: Added wording to
+ say that the partial and full views have the same operational
+ and representation aspects. Ada 2005 extends this to cover
+ all views, including the incomplete view.
29.l/2
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01} Corrigendum:
- Changed operational items to have inheritance specified for
- each such aspect.
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+ Corrigendum: Changed operational items to have inheritance
+ specified for each such aspect.
29.m/2
- {AI95-00251-01AI95-00251-01} Added wording to allow the
+ {<AI95-00251-01AI95-00251-01>} Added wording to allow the
rejection of types with progenitors that have conflicting
representation items.
29.n/2
- {AI95-00291-02AI95-00291-02} The description of the
+ {<AI95-00291-02AI95-00291-02>} The description of the
representation of an object was clarified (with great
difficulty reaching agreement). Added wording to say that
representation items on aliased and by-reference objects never
@@ -59632,20 +59833,20 @@ minimally aligned objects of this type might be
declared at some point.
reality.
29.o/3
- {AI95-00444-01AI95-00444-01} {AI05-0005-1AI05-0005-1} Added
- wording so that inheritance depends on whether operational
- items are visible rather than whether they occur before the
- declaration (we don't want to look into private parts). Also
- limited operational inheritance to untagged types to avoid
- anomalies with private extensions (this is not incompatible,
- no existing operational attribute used this capability). Also
- added wording to clearly define that subprogram inheritance
- works like derivation of subprograms.
+ {<AI95-00444-01AI95-00444-01>} {<AI05-0005-1AI05-0005-1>}
+ Added wording so that inheritance depends on whether
+ operational items are visible rather than whether they occur
+ before the declaration (we don't want to look into private
+ parts). Also limited operational inheritance to untagged
+ types to avoid anomalies with private extensions (this is not
+ incompatible, no existing operational attribute used this
+ capability). Also added wording to clearly define that
+ subprogram inheritance works like derivation of subprograms.
_Incompatibilities With Ada 2005_
29.p/3
- {AI05-0106-1AI05-0106-1} Correction: Specifying a
+ {<AI05-0106-1AI05-0106-1>} Correction: Specifying a
language-defined aspect for a generic formal parameter is no
longer allowed. Most aspects could not be specified on these
anyway; moreover, this was not allowed in Ada 83, so it is
@@ -59657,7 +59858,7 @@ minimally aligned objects of this type might be
declared at some point.
_Wording Changes from Ada 2005_
29.q/3
- {AI05-0009-1AI05-0009-1} Correction: Defined that overriding
+ {<AI05-0009-1AI05-0009-1>} Correction: Defined that overriding
of an representation aspect only happens for a nonconfirming
representation item. This prevents a derived type from being
considered to have only a confirming representation item when
@@ -59667,41 +59868,43 @@ minimally aligned objects of this type might be
declared at some point.
behavior.
29.r/3
- {AI05-0112-1AI05-0112-1} Correction: Defined a default naming
- for representation aspects that are representation pragmas.
+ {<AI05-0112-1AI05-0112-1>} Correction: Defined a default
+ naming for representation aspects that are representation
+ pragmas.
29.s/3
- {AI05-0183-1AI05-0183-1} Added text ensuring that the rules
+ {<AI05-0183-1AI05-0183-1>} Added text ensuring that the rules
for representational and operational items also apply
appropriately to aspect_specifications; generalized
operational aspects so that they can be defined for entities
other than types. Any extensions are documented elsewhere.
29.t/3
- {AI05-0295-1AI05-0295-1} Rewrote many rules to be in terms of
- "specifying a representation aspect" rather than use of a
- "representation item". This better separates how an aspect is
- specified from what rules apply to the value of the aspect.
+ {<AI05-0295-1AI05-0295-1>} Rewrote many rules to be in terms
+ of "specifying a representation aspect" rather than use of a
+ "representation item". This better separates <how> an aspect
+ is specified from <what> rules apply to the value of the
+ aspect.
_Incompatibilities With Ada 2012_
29.u/4
- {AI12-0109-1AI12-0109-1} Corrigendum: Added a rule that makes
- it illegal to specify a representation value after a type is
- derived from an untagged by-reference type. This restriction
- is incompatible, but since the implementation would have had
- to copy an object that does not allow copying in order to
- change the representation for any implicit or explicit
- conversion between the original and the derived type, it is
- unlikely that any program could exist without running into
- internal compiler errors or bogus results.
+ {<AI12-0109-1AI12-0109-1>} Corrigendum: Added a rule that
+ makes it illegal to specify a representation value after a
+ type is derived from an untagged by-reference type. This
+ restriction is incompatible, but since the implementation
+ would have had to copy an object that does not allow copying
+ in order to change the representation for any implicit or
+ explicit conversion between the original and the derived type,
+ it is unlikely that any program could exist without running
+ into internal compiler errors or bogus results.
_Wording Changes from Ada 2012_
29.v/4
- {AI12-0116-1AI12-0116-1} Corrigendum: Clarified that an aspect
- (any aspect) can be specified only once for an entity, no
- matter what means of specifying it are used. We did not
+ {<AI12-0116-1AI12-0116-1>} Corrigendum: Clarified that an
+ aspect (any aspect) can be specified only once for an entity,
+ no matter what means of specifying it are used. We did not
document this as an incompatibility as only aspects that are
neither operational nor representation could change behavior
and there is no known implementation of these new aspects that
@@ -59718,30 +59921,31 @@ File: aarm2012.info, Node: 13.1.1, Up: 13.1
----------------------------
1/3
-{AI05-0183-1AI05-0183-1} [Certain representation or operational aspects
-of an entity may be specified as part of its declaration using an
-aspect_specification, rather than using a separate representation or
+{<AI05-0183-1AI05-0183-1>} [Certain representation or operational
+aspects of an entity may be specified as part of its declaration using
+an aspect_specification, rather than using a separate representation or
operational item.] The declaration with the aspect_specification is
-termed the associated declaration.
+termed the <associated declaration>.
_Syntax_
2/3
- {AI05-0183-1AI05-0183-1} aspect_specification ::=
+ {<AI05-0183-1AI05-0183-1>} aspect_specification ::=
with aspect_mark [=> aspect_definition] {,
aspect_mark [=> aspect_definition] }
3/3
- {AI05-0183-1AI05-0183-1} aspect_mark ::= aspect_identifier['Class]
+ {<AI05-0183-1AI05-0183-1>} aspect_mark ::= <aspect_>
+ identifier['Class]
4/3
- {AI05-0183-1AI05-0183-1} aspect_definition ::= name | expression |
- identifier
+ {<AI05-0183-1AI05-0183-1>} aspect_definition ::= name |
+ expression | identifier
_Language Design Principles_
4.a/3
- {AI05-0183-1AI05-0183-1} {AI05-0267-1AI05-0267-1} The
+ {<AI05-0183-1AI05-0183-1>} {<AI05-0267-1AI05-0267-1>} The
aspect_specification is an optional element in most kinds of
declarations. Here is a list of all kinds of declarations and
an indication of whether or not they allow aspect clauses, and
@@ -59750,20 +59954,20 @@ termed the associated declaration.
followed by their subdivisions (which have indications).
4.b/4
- {AI12-0005-1AI12-0005-1} basic_declaration
+ {<AI12-0005-1AI12-0005-1>} basic_declaration
type_declaration
full_type_declaration
- type declaration syntax*
+ <type declaration syntax>*
task_type_declaration*
protected_type_declaration*
incomplete_type_declaration -- NO
- -- Incomplete type aspects cannot be read by an attribute
or specified by attribute_definition_clauses
- -- (the attribute name is illegal), so it would not make
sense to allow this in another way.
+ -- <Incomplete type aspects cannot be read by an
attribute or specified by attribute_definition_clauses >
+ -- <(the attribute name is illegal), so it would not make
sense to allow this in another way.>
private_type_declaration*
private_extension_declaration*
subtype_declaration*
object_declaration
- object declaration syntax*
+ <object declaration syntax>*
single_task_declaration*
single_protected_declaration*
number_declaration -- NO
@@ -59771,14 +59975,14 @@ termed the associated declaration.
abstract_subprogram_declaration*
null_procedure_declaration*
expression_function_declaration*
- package_declaration* -- via package_specification
+ package_declaration* -- <via> package_specification
renaming_declaration*
- -- There are no language-defined aspects that may be
specified
- -- on renames, but implementations might support some.
+ -- <There are no language-defined aspects that may be
specified>
+ -- <on renames, but implementations might support some.>
exception_declaration*
generic_declaration
generic_subprogram_declaration*
- generic_package_declaration* -- via package_specification
+ generic_package_declaration* -- <via> package_specification
generic_instantiation*
enumeration_literal_specification -- NO
discriminant_specification -- NO
@@ -59786,14 +59990,14 @@ termed the associated declaration.
loop_parameter_specification -- NO
iterator_specification -- NO
parameter_specification -- NO
- subprogram_body* -- - but language-defined aspects only if
there is no explicit specification
+ subprogram_body* -- < - but language-defined aspects only if
there is no explicit specification>
entry_declaration*
entry_index_specification -- NO
- subprogram_body_stub* -- - but language-defined aspects only
if there is no explicit specification
+ subprogram_body_stub* -- < - but language-defined aspects
only if there is no explicit specification>
choice_parameter_specification -- NO
generic_formal_parameter_declaration
- -- There are no language-defined aspects that may be
specified
- -- on generic formals, but implementations might support
some.
+ -- <There are no language-defined aspects that may be
specified>
+ -- <on generic formals, but implementations might support
some.>
formal_object_declaration*
formal_type_declaration*
formal_subprogram_declaration
@@ -59803,9 +60007,9 @@ termed the associated declaration.
extended_return_statement -- NO
4.c/3
- -- We also allow aspect_specifications on all kinds of bodies,
but are no language-defined aspects
- -- that may be specified on a body. These are allowed for
implementation-defined aspects.
- -- See above for subprogram bodies and stubs (as these can be
declarations).
+ -- <We also allow aspect_specifications on all kinds of bodies,
but are no language-defined aspects>
+ -- <that may be specified on a body. These are allowed for
implementation-defined aspects.>
+ -- <See above for subprogram bodies and stubs (as these can be
declarations).>
package_body*
task_body*
protected_body*
@@ -59814,10 +60018,10 @@ termed the associated declaration.
protected_body_stub*
4.d/3
- {AI05-0267-1AI05-0267-1} Syntactically, aspect_specifications
- generally are located at the end of declarations. When a
- declaration is all in one piece such as a
- null_procedure_declaration, object_declaration, or
+ {<AI05-0267-1AI05-0267-1>} Syntactically,
+ aspect_specifications generally are located at the end of
+ declarations. When a declaration is all in one piece such as
+ a null_procedure_declaration, object_declaration, or
generic_instantiation the aspect_specification goes at the end
of the declaration; it is then more visible and less likely to
interfere with the layout of the rest of the structure.
@@ -59834,8 +60038,8 @@ termed the associated declaration.
_Name Resolution Rules_
5/3
-{AI05-0183-1AI05-0183-1} An aspect_mark identifies an aspect of the
-entity defined by the associated declaration (the associated entity);
+{<AI05-0183-1AI05-0183-1>} An aspect_mark identifies an aspect of the
+entity defined by the associated declaration (the <associated entity>);
the aspect denotes an object, a value, an expression, a subprogram, or
some other kind of entity. If the aspect_mark identifies:
@@ -59865,12 +60069,12 @@ some other kind of entity. If the aspect_mark
identifies:
shall be one of the identifiers specific to the identified aspect.
11/3
-{AI05-0183-1AI05-0183-1} The usage names in an aspect_definition [ are
+{<AI05-0183-1AI05-0183-1>} The usage names in an aspect_definition [ are
not resolved at the point of the associated declaration, but rather] are
resolved at the end of the immediately enclosing declaration list.
12/3
-{AI05-0183-1AI05-0183-1} If the associated declaration is for a
+{<AI05-0183-1AI05-0183-1>} If the associated declaration is for a
subprogram or entry, the names of the formal parameters are directly
visible within the aspect_definition, as are certain attributes, as
specified elsewhere in this International Standard for the identified
@@ -59884,21 +60088,21 @@ subtype denotes the current instance of the subtype.
_Legality Rules_
13/3
-{AI05-0183-1AI05-0183-1} If the first freezing point of the associated
+{<AI05-0183-1AI05-0183-1>} If the first freezing point of the associated
entity comes before the end of the immediately enclosing declaration
list, then each usage name in the aspect_definition shall resolve to the
same entity at the first freezing point as it does at the end of the
immediately enclosing declaration list.
14/3
-{AI05-0183-1AI05-0183-1} At most one occurrence of each aspect_mark is
+{<AI05-0183-1AI05-0183-1>} At most one occurrence of each aspect_mark is
allowed within a single aspect_specification. The aspect identified by
the aspect_mark shall be an aspect that can be specified for the
associated entity (or view of the entity defined by the associated
declaration).
14.a/4
- Ramification: {AI12-0116-1AI12-0116-1} This rule prevents
+ Ramification: {<AI12-0116-1AI12-0116-1>} This rule prevents
multiple specifications in the same aspect_specification.
Rules in *note 13.1:: prevent multiple specifications in
different aspect_specifications (on different views of the
@@ -59908,18 +60112,18 @@ declaration).
aspects.
15/3
-{AI05-0183-1AI05-0183-1} The aspect_definition associated with a given
+{<AI05-0183-1AI05-0183-1>} The aspect_definition associated with a given
aspect_mark may be omitted only when the aspect_mark identifies an
aspect of a boolean type, in which case it is equivalent to the
aspect_definition being specified as True.
16/3
-{AI05-0183-1AI05-0183-1} If the aspect_mark includes 'Class, then the
+{<AI05-0183-1AI05-0183-1>} If the aspect_mark includes 'Class, then the
associated entity shall be a tagged type or a primitive subprogram of a
tagged type.
17/3
-{AI05-0183-1AI05-0183-1} {AI05-0267-1AI05-0267-1} There are no
+{<AI05-0183-1AI05-0183-1>} {<AI05-0267-1AI05-0267-1>} There are no
language-defined aspects that may be specified on a
renaming_declaration, a generic_formal_parameter_declaration, a subunit,
a package_body, a task_body, a protected_body, or a body_stub other than
@@ -59934,8 +60138,8 @@ a subprogram_body_stub.
the language.
18/4
-{AI05-0183-1AI05-0183-1} {AI05-0267-1AI05-0267-1}
-{AI12-0105-1AI12-0105-1} A language-defined aspect shall not be
+{<AI05-0183-1AI05-0183-1>} {<AI05-0267-1AI05-0267-1>}
+{<AI12-0105-1AI12-0105-1>} A language-defined aspect shall not be
specified in an aspect_specification given on a completion of a
subprogram or generic subprogram.
@@ -59953,32 +60157,33 @@ subprogram or generic subprogram.
declaration and body of a unit.
18.1/4
-{AI05-0183-1AI05-0183-1} {AI12-0138-1AI12-0138-1} If an aspect of a
+{<AI05-0183-1AI05-0183-1>} {<AI12-0138-1AI12-0138-1>} If an aspect of a
derived type is inherited from an ancestor type and has the boolean
value True, the inherited value shall not be overridden to have the
value False for the derived type, unless otherwise specified in this
International Standard.
18.2/4
-{AI12-0138-1AI12-0138-1} Certain type-related aspects are defined to be
-nonoverridable; all such aspects are specified using an
+{<AI12-0138-1AI12-0138-1>} Certain type-related aspects are defined to
+be <nonoverridable>; all such aspects are specified using an
aspect_definition that is a name.
18.3/4
-{AI12-0138-1AI12-0138-1} If a nonoverridable aspect is directly
-specified for a type T, then any explicit specification of that aspect
-for any other descendant of T shall be confirming; that is, the
-specified name shall match the inherited aspect, meaning that the
+{<AI12-0138-1AI12-0138-1>} If a nonoverridable aspect is directly
+specified for a type <T>, then any explicit specification of that aspect
+for any other descendant of <T> shall be <confirming>; that is, the
+specified name shall <match> the inherited aspect, meaning that the
specified name shall denote the same declarations as would the inherited
name.
18.4/4
-{AI12-0138-1AI12-0138-1} If a full type has a partial view, and a given
-nonoverridable aspect is allowed for both the full view and the partial
-view, then the given aspect for the partial view and the full view shall
-be the same: the aspect shall be directly specified only on the partial
-view; if the full type inherits the aspect, then a matching definition
-shall be specified (directly or by inheritance) for the partial view.
+{<AI12-0138-1AI12-0138-1>} If a full type has a partial view, and a
+given nonoverridable aspect is allowed for both the full view and the
+partial view, then the given aspect for the partial view and the full
+view shall be the same: the aspect shall be directly specified only on
+the partial view; if the full type inherits the aspect, then a matching
+definition shall be specified (directly or by inheritance) for the
+partial view.
18.b
Ramification: In order to enforce these rules without breaking
@@ -59989,12 +60194,13 @@ shall be specified (directly or by inheritance) for
the partial view.
descendants in that case).
18.5/4
-{AI12-0138-1AI12-0138-1} In addition to the places where Legality Rules
-normally apply (see *note 12.3::), these rules about nonoverridable
-aspects also apply in the private part of an instance of a generic unit.
+{<AI12-0138-1AI12-0138-1>} In addition to the places where Legality
+Rules normally apply (see *note 12.3::), these rules about
+nonoverridable aspects also apply in the private part of an instance of
+a generic unit.
18.6/4
-{AI12-0138-1AI12-0138-1} [The Default_Iterator, Iterator_Element,
+{<AI12-0138-1AI12-0138-1>} [The Default_Iterator, Iterator_Element,
Implicit_Dereference, Constant_Indexing, and Variable_Indexing aspects
are nonoverridable.]
@@ -60011,8 +60217,8 @@ are nonoverridable.]
_Static Semantics_
19/3
-{AI05-0183-1AI05-0183-1} Depending on which aspect is identified by the
-aspect_mark, an aspect_definition specifies:
+{<AI05-0183-1AI05-0183-1>} Depending on which aspect is identified by
+the aspect_mark, an aspect_definition specifies:
20/3
* a name that denotes a subprogram, object, or other kind of entity;
@@ -60026,13 +60232,13 @@ aspect_mark, an aspect_definition specifies:
* an identifier specific to the aspect.
23/3
-{AI05-0183-1AI05-0183-1} The identified aspect of the associated entity,
-or in some cases, the view of the entity defined by the declaration, is
-as specified by the aspect_definition (or by the default of True when
-boolean). Whether an aspect_specification applies to an entity or only
-to the particular view of the entity defined by the declaration is
-determined by the aspect_mark and the kind of entity. The following
-aspects are view specific:
+{<AI05-0183-1AI05-0183-1>} The identified aspect of the associated
+entity, or in some cases, the view of the entity defined by the
+declaration, is as specified by the aspect_definition (or by the default
+of True when boolean). Whether an aspect_specification <applies> to an
+entity or only to the particular view of the entity defined by the
+declaration is determined by the aspect_mark and the kind of entity.
+The following aspects are view specific:
24/3
* An aspect specified on an object_declaration;
@@ -60044,26 +60250,26 @@ aspects are view specific:
* An aspect specified on a renaming_declaration.
27/3
-{AI05-0183-1AI05-0183-1} All other aspect_specifications are associated
-with the entity, and apply to all views of the entity, unless otherwise
-specified in this International Standard.
+{<AI05-0183-1AI05-0183-1>} All other aspect_specifications are
+associated with the entity, and <apply> to all views of the entity,
+unless otherwise specified in this International Standard.
28/4
-{AI05-0183-1AI05-0183-1} {AI12-0106-1AI12-0106-1} If the aspect_mark
-includes 'Class (a class-wide aspect), then, unless specified otherwise
-for a particular class-wide aspect:
+{<AI05-0183-1AI05-0183-1>} {<AI12-0106-1AI12-0106-1>} If the aspect_mark
+includes 'Class (a <class-wide aspect>), then, unless specified
+otherwise for a particular class-wide aspect:
29/3
* if the associated entity is a tagged type, the specification
- applies to all descendants of the type;
+ <applies> to all descendants of the type;
30/3
* if the associated entity is a primitive subprogram of a tagged type
- T, the specification applies to the corresponding primitive
- subprogram of all descendants of T.
+ <T>, the specification <applies> to the corresponding primitive
+ subprogram of all descendants of <T>.
31/3
-{AI05-0183-1AI05-0183-1} {AI05-0229-1AI05-0229-1} All specifiable
+{<AI05-0183-1AI05-0183-1>} {<AI05-0229-1AI05-0229-1>} All specifiable
operational and representation attributes may be specified with an
aspect_specification instead of an attribute_definition_clause (see
*note 13.3::).
@@ -60074,15 +60280,16 @@ aspect_specification instead of an
attribute_definition_clause (see
attribute_designator of the attribute.
32/4
-{AI05-0229-1AI05-0229-1} {AI12-0154-1AI12-0154-1} Any aspect specified
-by a representation pragma or library unit pragma that has a local_name
-as its single argument may be specified by an aspect_specification, with
-the entity being the local_name. The aspect_definition is expected to
-be of type Boolean. The expression shall be static. Notwithstanding
-what this International Standard says elsewhere, the expression of an
-aspect that can be specified by a library unit pragma is resolved and
-evaluated at the point where it occurs in the aspect_specification[,
-rather than the first freezing point of the associated package].
+{<AI05-0229-1AI05-0229-1>} {<AI12-0154-1AI12-0154-1>} Any aspect
+specified by a representation pragma or library unit pragma that has a
+local_name as its single argument may be specified by an
+aspect_specification, with the entity being the local_name. The
+aspect_definition is expected to be of type Boolean. The expression
+shall be static. Notwithstanding what this International Standard says
+elsewhere, the expression of an aspect that can be specified by a
+library unit pragma is resolved and evaluated at the point where it
+occurs in the aspect_specification[, rather than the first freezing
+point of the associated package].
32.a/3
Ramification: The name of the aspect is the same as that of
@@ -60090,17 +60297,17 @@ rather than the first freezing point of the
associated package].
of the pragma.
33/3
-{AI05-0229-1AI05-0229-1} In addition, other operational and
+{<AI05-0229-1AI05-0229-1>} In addition, other operational and
representation aspects not associated with specifiable attributes or
representation pragmas may be specified, as specified elsewhere in this
International Standard.
34/4
-This paragraph was deleted.{AI05-0183-1AI05-0183-1}
-{AI12-0138-1AI12-0138-1}
+<This paragraph was deleted.>{<AI05-0183-1AI05-0183-1>}
+{<AI12-0138-1AI12-0138-1>}
35/3
-{AI05-0183-1AI05-0183-1} If a Legality Rule or Static Semantics rule
+{<AI05-0183-1AI05-0183-1>} If a Legality Rule or Static Semantics rule
only applies when a particular aspect has been specified, the aspect is
considered to have been specified only when the aspect_specification or
attribute_definition_clause is visible (see *note 8.3::) at the point of
@@ -60117,15 +60324,15 @@ the application of the rule.
type.
36/3
-{AI05-0183-1AI05-0183-1} Alternative legality and semantics rules may
+{<AI05-0183-1AI05-0183-1>} Alternative legality and semantics rules may
apply for particular aspects, as specified elsewhere in this
International Standard.
_Dynamic Semantics_
37/3
-{AI05-0183-1AI05-0183-1} At the freezing point of the associated entity,
-the aspect_specification is elaborated. The elaboration of the
+{<AI05-0183-1AI05-0183-1>} At the freezing point of the associated
+entity, the aspect_specification is elaborated. The elaboration of the
aspect_specification includes the evaluation of the name or expression,
if any, unless the aspect itself is an expression. If the corresponding
aspect represents an expression (as in a precondition), the elaboration
@@ -60136,7 +60343,7 @@ particular aspect.
_Implementation Permissions_
38/3
-{AI05-0183-1AI05-0183-1} Implementations may support
+{<AI05-0183-1AI05-0183-1>} Implementations may support
implementation-defined aspects. The aspect_specification for an
implementation-defined aspect may use an implementation-defined syntax
for the aspect_definition, and may follow implementation-defined
@@ -60159,13 +60366,13 @@ legality and semantics rules.
_Extensions to Ada 2005_
38.b/3
- {AI05-0183-1AI05-0183-1} {AI05-0229-1AI05-0229-1}
- {AI05-0267-1AI05-0267-1} Aspect specifications are new.
+ {<AI05-0183-1AI05-0183-1>} {<AI05-0229-1AI05-0229-1>}
+ {<AI05-0267-1AI05-0267-1>} Aspect specifications are new.
_Incompatibilities With Ada 2012_
38.c/4
- {AI12-0154-1AI12-0154-1} Corrigendum: Added a clarification
+ {<AI12-0154-1AI12-0154-1>} Corrigendum: Added a clarification
that aspects that correspond to library unit pragmas are
resolved and evaluated immediately. This is incompatible, as
a reference to an entity defined after the aspect will now be
@@ -60179,19 +60386,19 @@ legality and semantics rules.
_Wording Changes from Ada 2012_
38.d/4
- {AI125-0105-1AI125-0105-1} Corrigendum: Clarified the wording
- so that the restriction against language-defined aspects on
- subprogram completions includes completions that are
- expressions functions and null procedures.
+ {<AI125-0105-1AI125-0105-1>} Corrigendum: Clarified the
+ wording so that the restriction against language-defined
+ aspects on subprogram completions includes completions that
+ are expressions functions and null procedures.
38.e/4
- {AI125-0106-1AI125-0106-1} Corrigendum: Defined class-wide
+ {<AI125-0106-1AI125-0106-1>} Corrigendum: Defined class-wide
aspect for use in rules in *note 13.13.2::.
38.f/4
- {AI125-0138-1AI125-0138-1} Corrigendum: Added a definition of
- nonoverridable aspects. This is necessary to prevent generic
- contract problems with formal derived types.
+ {<AI125-0138-1AI125-0138-1>} Corrigendum: Added a definition
+ of nonoverridable aspects. This is necessary to prevent
+ generic contract problems with formal derived types.
File: aarm2012.info, Node: 13.2, Next: 13.3, Prev: 13.1, Up: 13
@@ -60200,21 +60407,21 @@ File: aarm2012.info, Node: 13.2, Next: 13.3, Prev:
13.1, Up: 13
=================
1/3
-{AI05-0229-1AI05-0229-1} [The Pack aspect having the value True
+{<AI05-0229-1AI05-0229-1>} [The Pack aspect having the value True
specifies that storage minimization should be the main criterion when
selecting the representation of a composite type.]
-Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Language Design Principles_
1.a/4
- {AI12-0001-1AI12-0001-1} If the default representation already
- uses minimal storage for a particular type, aspect Pack might
- not cause any representation change. It follows that aspect
- Pack should always be allowed, even when it has no effect on
- representation.
+ {<AI12-0001-1AI12-0001-1>} If the default representation
+ already uses minimal storage for a particular type, aspect
+ Pack might not cause any representation change. It follows
+ that aspect Pack should always be allowed, even when it has no
+ effect on representation.
1.b/4
As a consequence, the chosen representation for a packed type
@@ -60239,7 +60446,7 @@ Obsolescent Features".
_Static Semantics_
5/3
-{AI05-0229-1AI05-0229-1} For a full type declaration of a composite
+{<AI05-0229-1AI05-0229-1>} For a full type declaration of a composite
type, the following language-defined representation aspect may be
specified:
@@ -60247,9 +60454,9 @@ specified:
Pack
The type of aspect Pack is Boolean. When aspect Pack is
True for a type, the type (or the extension part) is said
- to be packed. For a type extension, the parent part is
+ to be <packed>. For a type extension, the parent part is
packed as for the parent type, and specifying Pack causes
- packing only of the extension part.
+ packing only of the extension part.
5.a/3
Aspect Description for Pack: Minimize storage when laying out
@@ -60261,7 +60468,7 @@ Pack
inheritance), the aspect is False.
5.b/3
- Ramification: {AI05-0229-1AI05-0229-1} The only high level
+ Ramification: {<AI05-0229-1AI05-0229-1>} The only high level
semantic effect of specifying the Pack aspect is potential
loss of independent addressability (see *note 9.10::, "*note
9.10:: Shared Variables").]
@@ -60279,7 +60486,7 @@ addressing calculations.
packed type should be minimized.
6.a/3
- Ramification: {AI05-0229-1AI05-0229-1} Specifying the Pack
+ Ramification: {<AI05-0229-1AI05-0229-1>} Specifying the Pack
aspect is for gaining space efficiency, possibly at the
expense of time. If more explicit control over representation
is desired, then a record_representation_clause, a
@@ -60287,16 +60494,16 @@ addressing calculations.
of, or in addition to, the Pack aspect.
6.1/4
-This paragraph was deleted.{AI95-00291-02AI95-00291-02}
-{AI12-0001-1AI12-0001-1}
+<This paragraph was deleted.>{<AI95-00291-02AI95-00291-02>}
+{<AI12-0001-1AI12-0001-1>}
7/3
-{AI05-0229-1AI05-0229-1} The recommended level of support for the Pack
+{<AI05-0229-1AI05-0229-1>} The recommended level of support for the Pack
aspect is:
7.1/4
- * {AI12-0001-1AI12-0001-1} Any component of a packed type that is of
- a by-reference type, that is specified as independently
+ * {<AI12-0001-1AI12-0001-1>} Any component of a packed type that is
+ of a by-reference type, that is specified as independently
addressable, or that contains an aliased part, shall be aligned
according to the alignment of its subtype.
@@ -60311,7 +60518,7 @@ aspect is:
Support will require the alignment to be ignored.
8/4
- * {AI12-0001-1AI12-0001-1} For a packed record type, the components
+ * {<AI12-0001-1AI12-0001-1>} For a packed record type, the components
should be packed as tightly as possible subject to the above
alignment requirements, the Sizes of the component subtypes, and
any record_representation_clause that applies to the type; the
@@ -60330,7 +60537,7 @@ aspect is:
1-bit gap (assuming the gap is needed anyway).
9/4
- * {AI05-0009-1AI05-0009-1} {AI12-0001-1AI12-0001-1} For a packed
+ * {<AI05-0009-1AI05-0009-1>} {<AI12-0001-1AI12-0001-1>} For a packed
array type, if the Size of the component subtype is less than or
equal to the word size, Component_Size should be less than or equal
to the Size of the component subtype, rounded up to the nearest
@@ -60338,7 +60545,7 @@ aspect is:
alignment requirements.
9.a/4
- This paragraph was deleted.{AI12-0001-1AI12-0001-1}
+ <This paragraph was deleted.>{<AI12-0001-1AI12-0001-1>}
9.b/3
Implementation Advice: The recommended level of support for
@@ -60347,8 +60554,8 @@ aspect is:
_Wording Changes from Ada 95_
9.c/3
- {AI95-00291-02AI95-00291-02} {AI05-0229-1AI05-0229-1} Added
- clarification that the Pack aspect can ignore alignment
+ {<AI95-00291-02AI95-00291-02>} {<AI05-0229-1AI05-0229-1>}
+ Added clarification that the Pack aspect can ignore alignment
requirements on types that don't have by-reference or aliased
parts. This was always intended, but there was no wording to
that effect.
@@ -60356,13 +60563,13 @@ aspect is:
_Extensions to Ada 2005_
9.d/3
- {AI05-0229-1AI05-0229-1} Aspect Pack is new; pragma Pack is
+ {<AI05-0229-1AI05-0229-1>} Aspect Pack is new; pragma Pack is
now obsolescent.
_Wording Changes from Ada 2005_
9.e/3
- {AI05-0009-1AI05-0009-1} Correction: Fixed so that the
+ {<AI05-0009-1AI05-0009-1>} Correction: Fixed so that the
presence or absence of a confirming Component_Size
representation clause does not change the meaning of the Pack
aspect.
@@ -60370,7 +60577,7 @@ aspect is:
_Wording Changes from Ada 2012_
9.f/4
- {AI12-0001-1AI12-0001-1} Corrigendum: Fixed so that the
+ {<AI12-0001-1AI12-0001-1>} Corrigendum: Fixed so that the
Recommended Level of Support does not require packing of
components for which such packing would violate other
representation items or aspects. This is not incompatible, as
@@ -60387,10 +60594,11 @@ File: aarm2012.info, Node: 13.3, Next: 13.4, Prev:
13.2, Up: 13
==============================================
1/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} [ The values of
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} [ The values of
certain implementation-dependent characteristics can be obtained by
-interrogating appropriate operational or representation attributes. Some
-of these attributes are specifiable via an attribute_definition_clause.]
+interrogating appropriate operational or representation attributes.
+Some of these attributes are specifiable via an
+attribute_definition_clause.]
_Language Design Principles_
@@ -60417,7 +60625,7 @@ the form with a name shall be used.
4
For an attribute_definition_clause that specifies an attribute that
denotes a value or an object, the expected type for the expression or
-name is that of the attribute. For an attribute_definition_clause that
+name is that of the attribute. For an attribute_definition_clause that
specifies an attribute that denotes a subprogram, the expected profile
for the name is the profile required for the attribute. For an
attribute_definition_clause that specifies an attribute that denotes
@@ -60426,9 +60634,9 @@ the appropriate kind.
4.a
Ramification: For example, the Size attribute is of type
- universal_integer. Therefore, the expected type for Y in "for
- X'Size use Y;" is universal_integer, which means that Y can be
- of any integer type.
+ <universal_integer>. Therefore, the expected type for Y in
+ "for X'Size use Y;" is <universal_integer>, which means that Y
+ can be of any integer type.
4.b
Discussion: For attributes that denote subprograms, the
@@ -60447,11 +60655,11 @@ the appropriate kind.
_Legality Rules_
5/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0183-1AI05-0183-1} An attribute_designator is allowed in an
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0183-1AI05-0183-1>} An attribute_designator is allowed in an
attribute_definition_clause only if this International Standard
explicitly allows it, or for an implementation-defined attribute if the
-implementation allows it. Each specifiable attribute constitutes an
+implementation allows it. Each specifiable attribute constitutes an
operational aspect or aspect of representation; the name of the aspect
is that of the attribute.
@@ -60475,7 +60683,7 @@ is that of the attribute.
For an attribute_definition_clause that specifies an attribute that
denotes a subprogram, the profile shall be mode conformant with the one
required for the attribute, and the convention shall be Ada. Additional
-requirements are defined for particular attributes.
+requirements are defined for particular attributes.
6.a
Ramification: This implies, for example, that if one writes:
@@ -60490,7 +60698,7 @@ requirements are defined for particular attributes.
_Static Semantics_
7/2
-{AI95-00270-01AI95-00270-01} A Size clause is an
+{<AI95-00270-01AI95-00270-01>} A <Size clause> is an
attribute_definition_clause whose attribute_designator is Size. Similar
definitions apply to the other specifiable attributes.
@@ -60500,8 +60708,8 @@ definitions apply to the other specifiable attributes.
type-related or subtype-specific attribute, respectively.
8
-A storage element is an addressable element of storage in the machine. A
-word is the largest amount of storage that can be conveniently and
+A <storage element> is an addressable element of storage in the machine.
+A <word> is the largest amount of storage that can be conveniently and
efficiently manipulated by the hardware, given the implementation's
run-time model. A word consists of an integral number of storage
elements.
@@ -60535,19 +60743,19 @@ elements.
addressable.
8.1/3
-{AI95-00133-01AI95-00133-01} {AI05-0092-1AI05-0092-1} A machine scalar
-is an amount of storage that can be conveniently and efficiently loaded,
-stored, or operated upon by the hardware. Machine scalars consist of an
-integral number of storage elements. The set of machine scalars is
-implementation defined, but includes at least the storage element and
-the word. Machine scalars are used to interpret component_clauses when
-the nondefault bit ordering applies.
+{<AI95-00133-01AI95-00133-01>} {<AI05-0092-1AI05-0092-1>} A <machine
+scalar> is an amount of storage that can be conveniently and efficiently
+loaded, stored, or operated upon by the hardware. Machine scalars
+consist of an integral number of storage elements. The set of machine
+scalars is implementation defined, but includes at least the storage
+element and the word. Machine scalars are used to interpret
+component_clauses when the nondefault bit ordering applies.
8.e.1/2
Implementation defined: The set of machine scalars.
8.f/3
- Ramification: {AI05-0092-1AI05-0092-1} A single storage
+ Ramification: {<AI05-0092-1AI05-0092-1>} A single storage
element is a machine scalar in all Ada implementations.
Similarly, a word is a machine scalar in all implementations
(although it might be the same as a storage element). An
@@ -60555,8 +60763,8 @@ the nondefault bit ordering applies.
sense on the target (a half-word, for instance).
9/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0191-1AI05-0191-1} The following representation attributes are
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0191-1AI05-0191-1>} The following representation attributes are
defined: Address, Alignment, Size, Storage_Size, Component_Size,
Has_Same_Storage, and Overlaps_Storage.
@@ -60577,7 +60785,7 @@ X'Address
endianness of the machine doesn't matter.
11.1/3
- {AI05-0095-1AI05-0095-1} The prefix of X'Address shall
+ {<AI05-0095-1AI05-0095-1>} The prefix of X'Address shall
not statically denote a subprogram that has convention
Intrinsic. X'Address raises Program_Error if X denotes a
subprogram that has convention Intrinsic.
@@ -60605,7 +60813,7 @@ X'Address
intimate knowledge of the run-time model.
12.d/3
- {AI05-0229-1AI05-0229-1} If the Address of an object is
+ {<AI05-0229-1AI05-0229-1>} If the Address of an object is
specified, any explicit or implicit initialization takes place
as usual, unless the Import aspect is also specified for the
object (in which case any necessary initialization is
@@ -60643,7 +60851,7 @@ X'Address
_Erroneous Execution_
13/3
-{AI05-0009-1AI05-0009-1} If an Address is specified, it is the
+{<AI05-0009-1AI05-0009-1>} If an Address is specified, it is the
programmer's responsibility to ensure that the address is valid and
appropriate for the entity and its use; otherwise, program execution is
erroneous.
@@ -60706,10 +60914,10 @@ The recommended level of support for the Address
attribute is:
subprograms.
18/2
- * This paragraph was deleted.{AI95-00291-02AI95-00291-02}
+ * <This paragraph was deleted.>{<AI95-00291-02AI95-00291-02>}
18.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
19
* If the Address of an object is specified, or it is imported or
@@ -60752,9 +60960,9 @@ The recommended level of support for the Address
attribute is:
_Wording Changes from Ada 2005_
21.c.1/3
- {AI05-0183-1AI05-0183-1} Defined that the names of aspects are
- the same as the name of the attribute; that gives a name to
- use in aspect_specifications (see *note 13.1.1::).
+ {<AI05-0183-1AI05-0183-1>} Defined that the names of aspects
+ are the same as the name of the attribute; that gives a name
+ to use in aspect_specifications (see *note 13.1.1::).
_Language Design Principles_
@@ -60781,21 +60989,23 @@ The recommended level of support for the Address
attribute is:
_Static Semantics_
22/2
-{AI95-00291-02AI95-00291-02} For a prefix X that denotes an object:
+{<AI95-00291-02AI95-00291-02>} For a prefix X that denotes an object:
23/2
X'Alignment
- {AI95-00291-02AI95-00291-02} The value of this attribute
- is of type universal_integer, and nonnegative; zero means
- that the object is not necessarily aligned on a storage
- element boundary. If X'Alignment is not zero, then X is
- aligned on a storage unit boundary and X'Address is an
- integral multiple of X'Alignment (that is, the Address
- modulo the Alignment is zero).
+ {<AI95-00291-02AI95-00291-02>} The value of this
+ attribute is of type <universal_integer>, and
+ nonnegative; zero means that the object is not
+ necessarily aligned on a storage element boundary. If
+ X'Alignment is not zero, then X is aligned on a storage
+ unit boundary and X'Address is an integral multiple of
+ X'Alignment (that is, the Address modulo the Alignment is
+ zero).
24/2
- This paragraph was deleted.{AI95-00291-02AI95-00291-02}
+ <This paragraph was
+ deleted.>{<AI95-00291-02AI95-00291-02>}
24.a
Ramification: The Alignment is passed by an allocator to the
@@ -60810,7 +61020,7 @@ X'Alignment
boundary.
25/2
- {AI95-00291-02AI95-00291-02} Alignment may be specified
+ {<AI95-00291-02AI95-00291-02>} Alignment may be specified
for [stand-alone] objects via an
attribute_definition_clause (*note 13.3: S0310.); the
expression of such a clause shall be static, and its
@@ -60822,25 +61032,27 @@ X'Alignment
26/2
- This paragraph was deleted.{AI95-00247-01AI95-00247-01}
+ <This paragraph was
+ deleted.>{<AI95-00247-01AI95-00247-01>}
26.1/2
-{AI95-00291-02AI95-00291-02} For every subtype S:
+{<AI95-00291-02AI95-00291-02>} For every subtype S:
26.2/2
S'Alignment
- {AI95-00291-02AI95-00291-02} The value of this attribute
- is of type universal_integer, and nonnegative.
+ {<AI95-00291-02AI95-00291-02>} The value of this
+ attribute is of type <universal_integer>, and
+ nonnegative.
26.3/2
- {AI95-00051-02AI95-00051-02} {AI95-00291-02AI95-00291-02}
- For an object X of subtype S, if S'Alignment is not zero,
- then X'Alignment is a nonzero integral multiple of
- S'Alignment unless specified otherwise by a
- representation item.
+ {<AI95-00051-02AI95-00051-02>}
+ {<AI95-00291-02AI95-00291-02>} For an object X of subtype
+ S, if S'Alignment is not zero, then X'Alignment is a
+ nonzero integral multiple of S'Alignment unless specified
+ otherwise by a representation item.
26.4/2
- {AI95-00291-02AI95-00291-02} Alignment may be specified
+ {<AI95-00291-02AI95-00291-02>} Alignment may be specified
for first subtypes via an attribute_definition_clause
(*note 13.3: S0310.); the expression of such a clause
shall be static, and its value nonnegative.
@@ -60861,15 +61073,16 @@ conflicts with the Alignment.
choose by default.
28/2
-{AI95-00051-02AI95-00051-02} {AI95-00291-02AI95-00291-02} For an object
-that is not allocated under control of the implementation, execution is
-erroneous if the object is not aligned according to its Alignment.
+{<AI95-00051-02AI95-00051-02>} {<AI95-00291-02AI95-00291-02>} For an
+object that is not allocated under control of the implementation,
+execution is erroneous if the object is not aligned according to its
+Alignment.
_Implementation Advice_
28.1/3
-{AI05-0116-1AI05-0116-1} For any tagged specific subtype S,
-S'Class'Alignment should equal S'Alignment.
+{<AI05-0116-1AI05-0116-1>} For any tagged specific subtype <S>,
+<S>'Class'Alignment should equal <S>'Alignment.
28.a/3
Reason: A tagged object should never be less aligned than the
@@ -60886,50 +61099,50 @@ S'Class'Alignment should equal S'Alignment.
smaller value for T'Class'Alignment.
28.a.1/3
- Implementation Advice: For any tagged specific subtype S,
- S'Class'Alignment should equal S'Alignment.
+ Implementation Advice: For any tagged specific subtype <S>,
+ <S>'Class'Alignment should equal <S>'Alignment.
29
The recommended level of support for the Alignment attribute for
subtypes is:
30/2
- * {AI95-00051-02AI95-00051-02} An implementation should support an
+ * {<AI95-00051-02AI95-00051-02>} An implementation should support an
Alignment clause for a discrete type, fixed point type, record
type, or array type, specifying an Alignment value that is zero or
a power of two, subject to the following:
31/2
- * {AI95-00051-02AI95-00051-02} An implementation need not support an
- Alignment clause for a signed integer type specifying an Alignment
- greater than the largest Alignment value that is ever chosen by
- default by the implementation for any signed integer type. A
- corresponding limitation may be imposed for modular integer types,
- fixed point types, enumeration types, record types, and array
- types.
+ * {<AI95-00051-02AI95-00051-02>} An implementation need not support
+ an Alignment clause for a signed integer type specifying an
+ Alignment greater than the largest Alignment value that is ever
+ chosen by default by the implementation for any signed integer
+ type. A corresponding limitation may be imposed for modular
+ integer types, fixed point types, enumeration types, record types,
+ and array types.
32/2
- * {AI95-00051-02AI95-00051-02} An implementation need not support a
+ * {<AI95-00051-02AI95-00051-02>} An implementation need not support a
nonconfirming Alignment clause which could enable the creation of
an object of an elementary type which cannot be easily loaded and
stored by available machine instructions.
32.1/2
- * {AI95-00291-02AI95-00291-02} An implementation need not support an
- Alignment specified for a derived tagged type which is not a
+ * {<AI95-00291-02AI95-00291-02>} An implementation need not support
+ an Alignment specified for a derived tagged type which is not a
multiple of the Alignment of the parent type. An implementation
need not support a nonconfirming Alignment specified for a derived
untagged by-reference type.
32.a/2
- Ramification: {AI95-00291-02AI95-00291-02} There is no
+ Ramification: {<AI95-00291-02AI95-00291-02>} There is no
recommendation to support any nonconfirming Alignment clauses
for types not mentioned above. Remember that *note 13.1::
requires support for confirming Alignment clauses for all
types.
32.b/3
- Implementation Note: {AI05-0116-1AI05-0116-1} An
+ Implementation Note: {<AI05-0116-1AI05-0116-1>} An
implementation that tries to support other alignments for
derived tagged types will need to allow inherited subprograms
to be passed objects that are less aligned than expected by
@@ -60943,7 +61156,7 @@ The recommended level of support for the Alignment
attribute for objects
is:
34/2
- * This paragraph was deleted.{AI95-00291-02AI95-00291-02}
+ * <This paragraph was deleted.>{<AI95-00291-02AI95-00291-02>}
35
* For stand-alone library-level objects of statically constrained
@@ -60952,12 +61165,12 @@ is:
likely to be supported for such objects, but not for subtypes.
35.1/2
- * {AI95-00291-02AI95-00291-02} For other objects, an implementation
+ * {<AI95-00291-02AI95-00291-02>} For other objects, an implementation
should at least support the alignments supported for their subtype,
subject to the following:
35.2/2
- * {AI95-00291-02AI95-00291-02} An implementation need not support
+ * {<AI95-00291-02AI95-00291-02>} An implementation need not support
Alignments specified for objects of a by-reference type or for
objects of types containing aliased subcomponents if the specified
Alignment is not a multiple of the Alignment of the subtype of the
@@ -60973,20 +61186,20 @@ is:
4 Alignment is a subtype-specific attribute.
37/2
- This paragraph was deleted.{AI95-00247-01AI95-00247-01}
+ <This paragraph was deleted.>{<AI95-00247-01AI95-00247-01>}
37.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
38/3
- 5 {AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} A
+ 5 {<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} A
component_clause, Component_Size clause, or specifying the Pack
aspect as True can override a specified Alignment.
38.a
Discussion: Most objects are allocated by the implementation;
for these, the implementation obeys the Alignment. The
- implementation is of course allowed to make an object more
+ implementation is of course allowed to make an object <more>
aligned than its Alignment requires -- an object whose
Alignment is 4 might just happen to land at an address that's
a multiple of 4096. For formal parameters, the implementation
@@ -61011,7 +61224,7 @@ is:
to the compiler due to separate compilation.
38.d/3
- {AI95-00114-01AI95-00114-01} {AI05-0229-1AI05-0229-1} The
+ {<AI95-00114-01AI95-00114-01>} {<AI05-0229-1AI05-0229-1>} The
Alignment of an object that is a component of a packed
composite object will usually be 0, to indicate that the
component is not necessarily aligned on a storage element
@@ -61102,7 +61315,7 @@ For a prefix X that denotes an object:
X'Size
Denotes the size in bits of the representation of the
object. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
40.a
Ramification: Note that Size is in bits even if Machine_Radix
@@ -61121,7 +61334,7 @@ X'Size
_Implementation Advice_
41.1/2
-{AI95-00051-02AI95-00051-02} The size of an array object should not
+{<AI95-00051-02AI95-00051-02>} The size of an array object should not
include its bounds.
41.a.1/2
@@ -61129,13 +61342,13 @@ include its bounds.
include its bounds.
42/2
-{AI95-00051-02AI95-00051-02} {AI95-00291-02AI95-00291-02} The
+{<AI95-00051-02AI95-00051-02>} {<AI95-00291-02AI95-00291-02>} The
recommended level of support for the Size attribute of objects is the
same as for subtypes (see below), except that only a confirming Size
clause need be supported for an aliased elementary object.
43/2
- * This paragraph was deleted.{AI95-00051-02AI95-00051-02}
+ * <This paragraph was deleted.>{<AI95-00051-02AI95-00051-02>}
_Static Semantics_
@@ -61160,9 +61373,9 @@ S'Size
48
If S is indefinite, the meaning is implementation
defined. The value of this attribute is of the type
- universal_integer. The Size of an object is at least as
- large as that of its subtype, unless the object's Size is
- determined by a Size clause, a component_clause, or a
+ <universal_integer>. The Size of an object is at least
+ as large as that of its subtype, unless the object's Size
+ is determined by a Size clause, a component_clause, or a
Component_Size clause. Size may be specified for first
subtypes via an attribute_definition_clause (*note 13.3:
S0310.); the expression of such a clause shall be static
@@ -61191,7 +61404,7 @@ S'Size
Component_Size clause applies).
48.f/3
- {AI05-0229-1AI05-0229-1} A component_clause or a
+ {<AI05-0229-1AI05-0229-1>} A component_clause or a
Component_Size clause can cause an object to be smaller than
its subtype's specified size. The aspect Pack cannot; if a
component subtype's size is specified, this limits how tightly
@@ -61213,7 +61426,7 @@ S'Size
48.i
type S is range 1..2;
for S'Size use 64;
-
+
48.j
I am not guaranteed that S'Base'Last >= 2**63-1, nor that
@@ -61228,12 +61441,12 @@ S'Size
48.l
type Big is range -2**63 .. 2**63 - 1;
subtype Small is Big range 1..1000;
-
+
48.m
Ramification: The Size of a large unconstrained subtype (e.g.
String'Size) is likely to raise Constraint_Error, since it is
- a nonstatic expression of type universal_integer that might
+ a nonstatic expression of type <universal_integer> that might
overflow the largest signed integer type. There is no
requirement that the largest integer type be able to represent
the size in bits of the largest possible object.
@@ -61250,7 +61463,7 @@ In an implementation, Boolean'Size shall be 1.
_Implementation Advice_
50/2
-{AI95-00051-02AI95-00051-02} If the Size of a subtype allows for
+{<AI95-00051-02AI95-00051-02>} If the Size of a subtype allows for
efficient independent addressability (see *note 9.10::) on the target
architecture, then the Size of the following objects of the subtype
should equal the Size of the subtype:
@@ -61289,7 +61502,7 @@ should equal the Size of the subtype:
may be rounded up to the nearest factor of the word size.
52.d/2
- Implementation Note: {AI95-00291-02AI95-00291-02} On most
+ Implementation Note: {<AI95-00291-02AI95-00291-02>} On most
machines, arrays don't contain gaps between elementary
components; if the Component_Size is greater than the Size of
the component subtype, the extra bits are generally considered
@@ -61300,7 +61513,7 @@ should equal the Size of the subtype:
generated code.
52.e/2
- {AI95-00291-02AI95-00291-02} For an array, any extra bits
+ {<AI95-00291-02AI95-00291-02>} For an array, any extra bits
stored for each elementary component will generally be part of
the component -- the whole point of storing extra bits is to
make loads and stores more efficient by avoiding the need to
@@ -61317,7 +61530,7 @@ layout of components.
should not affect the internal layout of components.
53.a/3
- Reason: {AI05-0229-1AI05-0229-1} That's what Pack aspects,
+ Reason: {<AI05-0229-1AI05-0229-1>} That's what Pack aspects,
record_representation_clauses, and Component_Size clauses are
for.
@@ -61340,12 +61553,12 @@ The recommended level of support for the Size
attribute of subtypes is:
55.b
For a two's-complement machine, this implies that for a static
signed integer subtype S, if all values of S are in the range
- 0 .. 2n-1, or all values of S are in the range -2n-1 ..
- 2n-1-1, for some n less than or equal to the word size, then
- S'Size should be <= the smallest such n. For a
+ 0 .. 2<n>-1, or all values of S are in the range -2<n-1> ..
+ 2<n-1>-1, for some <n> less than or equal to the word size,
+ then S'Size should be <= the smallest such <n>. For a
one's-complement machine, it is the same except that in the
- second range, the lower bound "-2n-1" is replaced by
- "-2n-1+1".
+ second range, the lower bound "-2<n-1>" is replaced by
+ "-2<n-1>+1".
55.c
If an integer subtype (whether signed or unsigned) contains no
@@ -61354,12 +61567,12 @@ The recommended level of support for the Size
attribute of subtypes is:
55.d
Typically, the implementation will choose to make the Size of
- a subtype be exactly the smallest such n. However, it might,
- for example, choose a biased representation, in which case it
- could choose a smaller value.
+ a subtype be exactly the smallest such <n>. However, it
+ might, for example, choose a biased representation, in which
+ case it could choose a smaller value.
55.e/3
- {AI05-0229-1AI05-0229-1} On most machines, it is in general
+ {<AI05-0229-1AI05-0229-1>} On most machines, it is in general
not a good idea to pack (parts of) multiple stand-alone
objects into the same storage element, because (1) it usually
doesn't save much space, and (2) it requires locking to
@@ -61401,14 +61614,14 @@ The recommended level of support for the Size
attribute of subtypes is:
55.i
Another reason for making the Size of an object bigger than
its subtype's Size is to support the run-time detection of
- uninitialized variables. The implementation might add an extra
- value to a discrete subtype that represents the uninitialized
- state, and check for this value on use. In some cases, the
- extra value will require an extra bit in the representation of
- the object. Such detection is not required by the language.
- If it is provided, the implementation has to be able to turn
- it off. For example, if the programmer gives a
- record_representation_clause or Component_Size clause that
+ uninitialized variables. The implementation might add an
+ extra value to a discrete subtype that represents the
+ uninitialized state, and check for this value on use. In some
+ cases, the extra value will require an extra bit in the
+ representation of the object. Such detection is not required
+ by the language. If it is provided, the implementation has to
+ be able to turn it off. For example, if the programmer gives
+ a record_representation_clause or Component_Size clause that
makes a component too small to allow the extra bit, then the
implementation will not be able to perform the checking (not
using this method, anyway).
@@ -61419,10 +61632,10 @@ The recommended level of support for the Size
attribute of subtypes is:
55.k
type Device_Register is range 0..2**8 - 1;
- for Device_Register'Size use 8; -- Confusing!
+ for Device_Register'Size use 8; --< Confusing!>
My_Device : Device_Register;
for My_Device'Address use To_Address(16#FF00#);
-
+
55.l
The programmer might think that My_Device'Size is 8, and that
@@ -61454,7 +61667,7 @@ The recommended level of support for the Size attribute
of subtypes is:
My_Device : Device_Register;
for My_Device'Size use 8;
for My_Device'Address use To_Address(16#FF00#);
-
+
55.p
If the implementation cannot accept 8-bit stand-alone objects,
@@ -61472,7 +61685,7 @@ The recommended level of support for the Size attribute
of subtypes is:
example, when passing to a C function, where the argument is
of the C type char* (that is, pointer to char), the C compiler
will generally expect a full word value, either on the stack,
- or in a register. It will not expect a single byte. Thus,
+ or in a register. It will <not> expect a single byte. Thus,
Size clauses for subtypes really have nothing to do with
passing parameters to foreign language subprograms.
@@ -61489,12 +61702,12 @@ The recommended level of support for the Size
attribute of subtypes is:
the stack.
56.1/2
- * {AI95-00051-02AI95-00051-02} An implementation should support a
+ * {<AI95-00051-02AI95-00051-02>} An implementation should support a
Size clause for a discrete type, fixed point type, record type, or
array type, subject to the following:
56.2/2
- * {AI95-00051-02AI95-00051-02} An implementation need not
+ * {<AI95-00051-02AI95-00051-02>} An implementation need not
support a Size clause for a signed integer type
specifying a Size greater than that of the largest signed
integer type supported by the implementation in the
@@ -61504,7 +61717,7 @@ The recommended level of support for the Size attribute
of subtypes is:
enumeration types, record types, and array types.
56.b/2
- Discussion: {AI95-00051-02AI95-00051-02} Note that the
+ Discussion: {<AI95-00051-02AI95-00051-02>} Note that the
"corresponding limitation" for a record or array type implies
that an implementation may impose some reasonable maximum size
for records and arrays (e.g. 2**32 bits), which is an upper
@@ -61514,25 +61727,25 @@ The recommended level of support for the Size
attribute of subtypes is:
supported for arrays.
56.b.1/3
- Ramification: {AI05-0155-1AI05-0155-1} Only Size clauses with
- a size greater than or equal to the Size that would be chosen
- by default may be safely presumed to be supported on nonstatic
- elementary subtypes. Implementations may choose to support
- smaller sizes, but only if the Size allows any value of the
- subtype to be represented, for any possible value of the
- bounds.
+ Ramification: {<AI05-0155-1AI05-0155-1>} Only Size clauses
+ with a size greater than or equal to the Size that would be
+ chosen by default may be safely presumed to be supported on
+ nonstatic elementary subtypes. Implementations may choose to
+ support smaller sizes, but only if the Size allows any value
+ of the subtype to be represented, for any possible value of
+ the bounds.
56.3/2
- * {AI95-00291-02AI95-00291-02} A nonconfirming size clause
- for the first subtype of a derived untagged by-reference
- type need not be supported.
+ * {<AI95-00291-02AI95-00291-02>} A nonconfirming size
+ clause for the first subtype of a derived untagged
+ by-reference type need not be supported.
56.c/2
Implementation Advice: The recommended level of support for
the Size attribute should be followed.
56.d/2
- Ramification: {AI95-00291-02AI95-00291-02} There is no
+ Ramification: {<AI95-00291-02AI95-00291-02>} There is no
recommendation to support any nonconfirming Size clauses for
types not mentioned above. Remember that *note 13.1::
requires support for confirming Size clauses for all types.
@@ -61543,14 +61756,14 @@ The recommended level of support for the Size
attribute of subtypes is:
6 Size is a subtype-specific attribute.
58/3
- 7 {AI05-0229-1AI05-0229-1} A component_clause or Component_Size
+ 7 {<AI05-0229-1AI05-0229-1>} A component_clause or Component_Size
clause can override a specified Size. Aspect Pack cannot.
_Inconsistencies With Ada 83_
58.a.1/2
- {AI95-00114-01AI95-00114-01} We specify the meaning of Size in
- much more detail than Ada 83. This is not technically an
+ {<AI95-00114-01AI95-00114-01>} We specify the meaning of Size
+ in much more detail than Ada 83. This is not technically an
inconsistency, but it is in practice, as most Ada 83 compilers
use a different definition for Size than is required here.
This should have been documented more explicitly during the
@@ -61572,9 +61785,9 @@ dereference)]:
60/3
T'Storage_Size
- {AI05-0229-1AI05-0229-1} Denotes the number of storage
+ {<AI05-0229-1AI05-0229-1>} Denotes the number of storage
elements reserved for the task. The value of this
- attribute is of the type universal_integer. The
+ attribute is of the type <universal_integer>. The
Storage_Size includes the size of the task's stack, if
any. The language does not specify whether or not it
includes other storage associated with the task (such as
@@ -61604,16 +61817,16 @@ T'Storage_Size
13.11::.
61/3
-{AI95-0229-1AI95-0229-1} [Aspect Storage_Size specifies the amount of
+{<AI95-0229-1AI95-0229-1>} [Aspect Storage_Size specifies the amount of
storage to be reserved for the execution of a task.]
-Paragraphs 62 through 65 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 62 through 65 were moved to *note Annex J::, "*note Annex
+J:: Obsolescent Features".>
_Static Semantics_
65.1/3
-{AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} For a task type
+{<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} For a task type
(including the anonymous type of a single_task_declaration), the
following language-defined representation aspect may be specified:
@@ -61632,8 +61845,8 @@ Storage_Size
65.b/3
Ramification: Note that the value of the Storage_Size aspect
- is an expression; it is not the value of an expression. The
- expression is evaluated for each object of the type (see
+ <is> an expression; it is not the <value> of an expression.
+ The expression is evaluated for each object of the type (see
below).
65.c/3
@@ -61643,13 +61856,13 @@ Storage_Size
_Legality Rules_
65.3/3
-{AI05-0229-1AI05-0229-1} The Storage_Size aspect shall not be specified
-for a task interface type.
+{<AI05-0229-1AI05-0229-1>} The Storage_Size aspect shall not be
+specified for a task interface type.
_Dynamic Semantics_
66/3
-{AI05-0229-1AI05-0229-1} When a task object is created, the expression
+{<AI05-0229-1AI05-0229-1>} When a task object is created, the expression
(if any) associated with the Storage_Size aspect of its type is
evaluated; the Storage_Size attribute of the newly created task object
is at least the value of the expression.
@@ -61663,7 +61876,7 @@ is at least the value of the expression.
normalize this to 0, or perhaps to a positive number.
66.b/3
- {AI05-0229-1AI05-0229-1} If the Storage_Size aspect is not
+ {<AI05-0229-1AI05-0229-1>} If the Storage_Size aspect is not
specified for the type of the task object, the value of the
Storage_Size attribute is unspecified.
@@ -61681,7 +61894,8 @@ implicit dereference)]:
69
X'Component_Size
Denotes the size in bits of components of the type of X.
- The value of this attribute is of type universal_integer.
+ The value of this attribute is of type
+ <universal_integer>.
70
Component_Size may be specified for array types via an
@@ -61714,20 +61928,20 @@ The recommended level of support for the
Component_Size attribute is:
are less than the Size of the component subtype.
73/3
- * {AI05-0229-1AI05-0229-1} An implementation should support specified
- Component_Sizes that are factors and multiples of the word size.
- For such Component_Sizes, the array should contain no gaps between
- components. For other Component_Sizes (if supported), the array
- should contain no gaps between components when Pack is also
- specified; the implementation should forbid this combination in
- cases where it cannot support a no-gaps representation.
+ * {<AI05-0229-1AI05-0229-1>} An implementation should support
+ specified Component_Sizes that are factors and multiples of the
+ word size. For such Component_Sizes, the array should contain no
+ gaps between components. For other Component_Sizes (if supported),
+ the array should contain no gaps between components when Pack is
+ also specified; the implementation should forbid this combination
+ in cases where it cannot support a no-gaps representation.
73.a/3
- Ramification: {AI05-0229-1AI05-0229-1} For example, if
+ Ramification: {<AI05-0229-1AI05-0229-1>} For example, if
Storage_Unit = 8, and Word_Size = 32, then the user is allowed
to specify a Component_Size of 1, 2, 4, 8, 16, and 32, with no
- gaps. In addition, n*32 is allowed for positive integers n,
- again with no gaps. If the implementation accepts
+ gaps. In addition, <n>*32 is allowed for positive integers
+ <n>, again with no gaps. If the implementation accepts
Component_Size = 3, then it might allocate 10 components per
word, with a 2-bit gap at the end of each word (unless Pack is
also specified), or it might not have any internal gaps at
@@ -61740,21 +61954,21 @@ The recommended level of support for the
Component_Size attribute is:
_Static Semantics_
73.1/3
-{AI05-0191-1AI05-0191-1} For a prefix X that denotes an object:
+{<AI05-0191-1AI05-0191-1>} For a prefix X that denotes an object:
73.2/4
X'Has_Same_Storage
- {AI05-0191-1AI05-0191-1} X'Has_Same_Storage denotes a
+ {<AI05-0191-1AI05-0191-1>} X'Has_Same_Storage denotes a
function with the following specification:
73.3/3
- function X'Has_Same_Storage (Arg : any_type)
+ function X'Has_Same_Storage (<Arg> : <any_type>)
return Boolean
73.4/4
- {AI05-0191-1AI05-0191-1} {AI05-0264-1AI05-0264-1}
- {AI12-0077-1AI12-0077-1} The actual parameter shall be a
- name that denotes an object. The object denoted by the
+ {<AI05-0191-1AI05-0191-1>} {<AI05-0264-1AI05-0264-1>}
+ {<AI12-0077-1AI12-0077-1>} The actual parameter shall be
+ a name that denotes an object. The object denoted by the
actual parameter can be of any type. This function
evaluates the names of the objects involved. It returns
True if the representation of the object denoted by the
@@ -61768,19 +61982,19 @@ X'Has_Same_Storage
the same length of memory.
73.5/3
-{AI05-0191-1AI05-0191-1} For a prefix X that denotes an object:
+{<AI05-0191-1AI05-0191-1>} For a prefix X that denotes an object:
73.6/3
X'Overlaps_Storage
- {AI05-0191-1AI05-0191-1} X'Overlaps_Storage denotes a
+ {<AI05-0191-1AI05-0191-1>} X'Overlaps_Storage denotes a
function with the following specification:
73.7/3
- function X'Overlaps_Storage (Arg : any_type)
+ function X'Overlaps_Storage (<Arg> : <any_type>)
return Boolean
73.8/3
- {AI05-0191-1AI05-0191-1} {AI05-0264-1AI05-0264-1} The
+ {<AI05-0191-1AI05-0191-1>} {<AI05-0264-1AI05-0264-1>} The
actual parameter shall be a name that denotes an object.
The object denoted by the actual parameter can be of any
type. This function evaluates the names of the objects
@@ -61792,28 +62006,28 @@ X'Overlaps_Storage
NOTES
73.9/3
- 8 {AI05-0191-1AI05-0191-1} X'Has_Same_Storage(Y) implies
+ 8 {<AI05-0191-1AI05-0191-1>} X'Has_Same_Storage(Y) implies
X'Overlaps_Storage(Y).
73.10/3
- 9 {AI05-0191-1AI05-0191-1} X'Has_Same_Storage(Y) and
+ 9 {<AI05-0191-1AI05-0191-1>} X'Has_Same_Storage(Y) and
X'Overlaps_Storage(Y) are not considered to be reads of X and Y.
_Static Semantics_
73.11/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0183-1AI05-0183-1} The following type-related operational
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0183-1AI05-0183-1>} The following type-related operational
attribute is defined: External_Tag.
74/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} For every subtype S of
-a tagged type T (specific or class-wide):
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} For every subtype
+S of a tagged type <T> (specific or class-wide):
75/3
S'External_Tag
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01}
- {AI05-0092-1AI05-0092-1} S'External_Tag denotes an
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+ {<AI05-0092-1AI05-0092-1>} S'External_Tag denotes an
external string representation for S'Tag; it is of the
predefined type String. External_Tag may be specified
for a specific tagged type via an
@@ -61835,10 +62049,10 @@ S'External_Tag
_Dynamic Semantics_
75.1/3
-{AI05-0113-1AI05-0113-1} If a user-specified external tag S'External_Tag
-is the same as T'External_Tag for some other tagged type declared by a
-different declaration in the partition, Program_Error is raised by the
-elaboration of the attribute_definition_clause.
+{<AI05-0113-1AI05-0113-1>} If a user-specified external tag
+S'External_Tag is the same as T'External_Tag for some other tagged type
+declared by a different declaration in the partition, Program_Error is
+raised by the elaboration of the attribute_definition_clause.
75.c/3
Ramification: This rule does not depend on the visibility of
@@ -61898,7 +62112,7 @@ in the two partitions.
which it depends).
76.d/2
- {AI95-00114-01AI95-00114-01} We use a String rather than a
+ {<AI95-00114-01AI95-00114-01>} We use a String rather than a
Stream_Element_Array to represent an external tag for
portability.
@@ -61910,9 +62124,10 @@ in the two partitions.
_Implementation Permissions_
76.1/3
-{AI05-0113-1AI05-0113-1} If a user-specified external tag S'External_Tag
-is the same as T'External_Tag for some other tagged type declared by a
-different declaration in the partition, the partition may be rejected.
+{<AI05-0113-1AI05-0113-1>} If a user-specified external tag
+S'External_Tag is the same as T'External_Tag for some other tagged type
+declared by a different declaration in the partition, the partition may
+be rejected.
76.f/3
Ramification: This is, in general, a post-compilation check.
@@ -61927,7 +62142,7 @@ different declaration in the partition, the partition
may be rejected.
NOTES
77/2
- 10 {AI95-00270-01AI95-00270-01} The following language-defined
+ 10 {<AI95-00270-01AI95-00270-01>} The following language-defined
attributes are specifiable, at least for some of the kinds of
entities to which they apply: Address, Alignment, Bit_Order,
Component_Size, External_Tag, Input, Machine_Radix, Output, Read,
@@ -61951,7 +62166,7 @@ different declaration in the partition, the partition
may be rejected.
_Examples_
79
-Examples of attribute definition clauses:
+<Examples of attribute definition clauses:>
80
Byte : constant := 8;
@@ -61970,18 +62185,18 @@ Examples of attribute definition clauses:
for Short'Size use 15;
83
- for Car_Name'Storage_Size use -- specify access type's storage pool size
- 2000*((Car'Size/System.Storage_Unit) +1); -- approximately 2000
cars
+ for Car_Name'Storage_Size use --< specify access type's storage pool size>
+ 2000*((Car'Size/System.Storage_Unit) +1); --< approximately 2000
cars>
84/2
- {AI95-00441-01AI95-00441-01} function My_Input(Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
+ {<AI95-00441-01AI95-00441-01>} function My_Input(Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
return T;
- for T'Input use My_Input; -- see *note 13.13.2::
+ for T'Input use My_Input; --< see *note 13.13.2::>
NOTES
85
- 12 Notes on the examples: In the Size clause for Short, fifteen
+ 12 <Notes on the examples:> In the Size clause for Short, fifteen
bits is the minimum necessary, since the type definition requires
Short'Small <= 2**(-7).
@@ -62000,7 +62215,7 @@ Examples of attribute definition clauses:
this rule was stated in the text.
85.c/2
- {AI95-00114-01AI95-00114-01} In Ada 83, the relationship
+ {<AI95-00114-01AI95-00114-01>} In Ada 83, the relationship
between a aspect_clause specifying a certain aspect and an
attribute that queried that aspect was unclear. In Ada 95,
they are the same, except for certain explicit exceptions.
@@ -62008,22 +62223,23 @@ Examples of attribute definition clauses:
_Wording Changes from Ada 95_
85.d/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Added wording to specify for each attribute whether it is an
- operational or representation attribute.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Added wording to specify for each attribute
+ whether it is an operational or representation attribute.
85.e/2
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01} Corrigendum:
- Added wording to specify that External_Tag is never inherited.
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+ Corrigendum: Added wording to specify that External_Tag is
+ never inherited.
85.f/2
- {AI95-00051-01AI95-00051-01} {AI95-00291-01AI95-00291-01}
+ {<AI95-00051-01AI95-00051-01>} {<AI95-00291-01AI95-00291-01>}
Adjusted the Recommended Level of Support for Alignment to
eliminate nonsense requirements and to ensure that useful
capabilities are required.
85.g/2
- {AI95-00051-01AI95-00051-01} {AI95-00291-01AI95-00291-01}
+ {<AI95-00051-01AI95-00051-01>} {<AI95-00291-01AI95-00291-01>}
Adjusted the Recommended Level of Support for Size to
eliminate nonsense requirements and to ensure that useful
capabilities are required. Also eliminated any dependence on
@@ -62031,11 +62247,11 @@ Examples of attribute definition clauses:
item should not affect the semantics).
85.h/2
- {AI95-00133-01AI95-00133-01} Added the definition of machine
+ {<AI95-00133-01AI95-00133-01>} Added the definition of machine
scalar.
85.i/2
- {AI95-00247-01AI95-00247-01} Removed the requirement that
+ {<AI95-00247-01AI95-00247-01>} Removed the requirement that
specified alignments for a composite type cannot override
those for their components, because it was never intended to
apply to components whose location was specified with a
@@ -62044,31 +62260,31 @@ Examples of attribute definition clauses:
the composite types.
85.j/2
- {AI95-00291-02AI95-00291-02} Removed recommended level of
+ {<AI95-00291-02AI95-00291-02>} Removed recommended level of
support rules about types with by-reference and aliased parts,
because there are now blanket rules covering all recommended
level of support rules.
85.k/2
- {AI95-00291-02AI95-00291-02} Split the definition of Alignment
- for subtypes and for objects. This simplified the wording and
- eliminated confusion about which rules applied to objects,
- which applied to subtypes, and which applied to both.
+ {<AI95-00291-02AI95-00291-02>} Split the definition of
+ Alignment for subtypes and for objects. This simplified the
+ wording and eliminated confusion about which rules applied to
+ objects, which applied to subtypes, and which applied to both.
_Inconsistencies With Ada 2005_
85.l/3
- {AI95-0095-1AI95-0095-1} Correction: An address attribute with
- a prefix of a generic formal subprogram whose actual parameter
- has convention Intrinsic now raises Program_Error. Since it
- is unlikely that such an attribute would have done anything
- useful (a subprogram with convention Intrinsic is not expected
- to have a normal subprogram body), it is highly unlikely that
- any existing programs would notice the difference, and any
- that do probably are buggy.
+ {<AI95-0095-1AI95-0095-1>} Correction: An address attribute
+ with a prefix of a generic formal subprogram whose actual
+ parameter has convention Intrinsic now raises Program_Error.
+ Since it is unlikely that such an attribute would have done
+ anything useful (a subprogram with convention Intrinsic is not
+ expected to have a normal subprogram body), it is highly
+ unlikely that any existing programs would notice the
+ difference, and any that do probably are buggy.
85.m/3
- {AI95-0113-1AI95-0113-1} Correction: User-specified external
+ {<AI95-0113-1AI95-0113-1>} Correction: User-specified external
tags that conflict with other external tags raise
Program_Error (or are optionally illegal). This was legal and
did not raise an exception in the past, although the effects
@@ -62080,8 +62296,8 @@ Examples of attribute definition clauses:
_Incompatibilities With Ada 2005_
85.n/3
- {AI05-0095-1AI05-0095-1} Correction: An address attribute with
- a prefix of a subprogram with convention Intrinsic is now
+ {<AI05-0095-1AI05-0095-1>} Correction: An address attribute
+ with a prefix of a subprogram with convention Intrinsic is now
illegal. Such attributes are very unlikely to have provided a
useful answer (the intended meaning of convention Intrinsic is
that there is no actual subprogram body for the operation), so
@@ -62091,30 +62307,30 @@ Examples of attribute definition clauses:
_Extensions to Ada 2005_
85.o/3
- {AI05-0191-1AI05-0191-1} Attributes Has_Same_Storage and
+ {<AI05-0191-1AI05-0191-1>} Attributes Has_Same_Storage and
Overlaps_Storage are new.
85.p/3
- {AI05-0229-1AI05-0229-1} Aspect Storage_Size is new; pragma
+ {<AI05-0229-1AI05-0229-1>} Aspect Storage_Size is new; pragma
Storage_Size is now obsolescent, joining attribute
Storage_Size for task types.
_Wording Changes from Ada 2005_
85.q/3
- {AI05-0009-1AI05-0009-1} Correction: Improved the description
- of erroneous execution for address clauses to make it clear
- that specifying an address inappropriate for the entity will
- lead to erroneous execution.
+ {<AI05-0009-1AI05-0009-1>} Correction: Improved the
+ description of erroneous execution for address clauses to make
+ it clear that specifying an address inappropriate for the
+ entity will lead to erroneous execution.
85.r/3
- {AI05-0116-1AI05-0116-1} Correction: Added Implementation
+ {<AI05-0116-1AI05-0116-1>} Correction: Added Implementation
Advice for the alignment of class-wide types.
_Wording Changes from Ada 2012_
85.s/4
- {AI12-0070-1AI12-0070-1} Corrigendum: Clarified the behavior
+ {<AI12-0070-1AI12-0070-1>} Corrigendum: Clarified the behavior
of Has_Same_Storage when 'Size = 0.
@@ -62131,7 +62347,7 @@ enumeration literals.]
2
enumeration_representation_clause ::=
- for first_subtype_local_name use enumeration_aggregate;
+ for <first_subtype_>local_name use enumeration_aggregate;
3
enumeration_aggregate ::= array_aggregate
@@ -62152,7 +62368,7 @@ expected to be of any integer type.
_Legality Rules_
5
-The first_subtype_local_name of an enumeration_representation_clause
+The <first_subtype_>local_name of an enumeration_representation_clause
shall denote an enumeration subtype.
5.a
@@ -62160,11 +62376,12 @@ shall denote an enumeration subtype.
the local_name is required to denote a first subtype.
6/2
-{AI95-00287-01AI95-00287-01} Each component of the array_aggregate shall
-be given by an expression rather than a <>. The expressions given in
-the array_aggregate shall be static, and shall specify distinct integer
-codes for each value of the enumeration type; the associated integer
-codes shall satisfy the predefined ordering relation of the type.
+{<AI95-00287-01AI95-00287-01>} Each component of the array_aggregate
+shall be given by an expression rather than a <>. The expressions given
+in the array_aggregate shall be static, and shall specify distinct
+integer codes for each value of the enumeration type; the associated
+integer codes shall satisfy the predefined ordering relation of the
+type.
6.a
Reason: Each value of the enumeration type has to be given an
@@ -62178,8 +62395,8 @@ codes shall satisfy the predefined ordering relation of
the type.
_Static Semantics_
7
-An enumeration_representation_clause specifies the coding aspect of
-representation. The coding consists of the internal code for each
+An enumeration_representation_clause specifies the <coding> aspect of
+representation. The coding consists of the <internal code> for each
enumeration literal, that is, the integral value used internally to
represent each literal.
@@ -62243,13 +62460,13 @@ is:
NOTES
11/3
- 13 {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- {AI05-0299-1AI05-0299-1} Unchecked_Conversion may be used to query
- the internal codes used for an enumeration type. The attributes of
- the type, such as Succ, Pred, and Pos, are unaffected by the
- enumeration_representation_clause. For example, Pos always returns
- the position number, not the internal integer code that might have
- been specified in an enumeration_representation_clause.
+ 13 {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ {<AI05-0299-1AI05-0299-1>} Unchecked_Conversion may be used to
+ query the internal codes used for an enumeration type. The
+ attributes of the type, such as Succ, Pred, and Pos, are unaffected
+ by the enumeration_representation_clause. For example, Pos always
+ returns the position number, <not> the internal integer code that
+ might have been specified in an enumeration_representation_clause.
11.a
Discussion: Suppose the enumeration type in question is
@@ -62262,7 +62479,7 @@ is:
for S2 use (Red => 10, Green => 20, Blue => 30);
11.c/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} The
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} The
enumeration_representation_clause has to specify values for
all enumerals, even ones that are not in S2 (such as Blue).
The Base attribute can be used to get at these values. For
@@ -62270,7 +62487,7 @@ is:
11.d
for I in S2'Base loop
- ... -- When I equals Blue, the internal code is 30.
+ ... --< When I equals Blue, the internal code is 30.>
end loop;
11.e
@@ -62280,7 +62497,7 @@ is:
_Examples_
12
-Example of an enumeration representation clause:
+<Example of an enumeration representation clause:>
13
type Mix_Code is (ADD, SUB, MUL, LDA, STA, STZ);
@@ -62293,10 +62510,11 @@ Example of an enumeration representation clause:
14.a
As in other similar contexts, Ada 95 allows expressions of any
- integer type, not just expressions of type universal_integer,
- for the component expressions in the enumeration_aggregate.
- The preference rules for the predefined operators of
- root_integer eliminate any ambiguity.
+ integer type, not just expressions of type
+ <universal_integer>, for the component expressions in the
+ enumeration_aggregate. The preference rules for the
+ predefined operators of <root_integer> eliminate any
+ ambiguity.
14.b
For portability, we now require that the default coding for an
@@ -62306,14 +62524,14 @@ Example of an enumeration representation clause:
_Wording Changes from Ada 95_
14.c/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Updated to reflect that we no longer have something called
- representation_clause.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Updated to reflect that we no longer have
+ something called representation_clause.
14.d/2
- {AI95-00287-01AI95-00287-01} Added wording to prevent the use
- of <> in a enumeration_representation_clause. (<> is newly
- added to array_aggregates.)
+ {<AI95-00287-01AI95-00287-01>} Added wording to prevent the
+ use of <> in a enumeration_representation_clause. (<> is
+ newly added to array_aggregates.)
File: aarm2012.info, Node: 13.5, Next: 13.6, Prev: 13.4, Up: 13
@@ -62322,8 +62540,8 @@ File: aarm2012.info, Node: 13.5, Next: 13.6, Prev:
13.4, Up: 13
==================
1
-The (record) layout aspect of representation consists of the storage
-places for some or all components, that is, storage place attributes of
+The <(record) layout> aspect of representation consists of the <storage
+places> for some or all components, that is, storage place attributes of
the components. The layout can be specified with a
record_representation_clause (*note 13.5.1: S0313.).
@@ -62342,12 +62560,12 @@ File: aarm2012.info, Node: 13.5.1, Next: 13.5.2,
Up: 13.5
1
[A record_representation_clause specifies the storage representation of
records and record extensions, that is, the order, position, and size of
-components (including discriminants, if any). ]
+components (including discriminants, if any). ]
_Language Design Principles_
1.a/2
- {AI95-00114-01AI95-00114-01} It should be feasible for an
+ {<AI95-00114-01AI95-00114-01>} It should be feasible for an
implementation to use negative offsets in the representation
of composite types. However, no implementation should be
forced to support negative offsets. Therefore, in the
@@ -62358,23 +62576,23 @@ components (including discriminants, if any). ]
2
record_representation_clause ::=
- for first_subtype_local_name use
+ for <first_subtype_>local_name use
record [mod_clause]
{component_clause}
end record;
3
component_clause ::=
- component_local_name at position range first_bit .. last_bit;
+ <component_>local_name at position range first_bit .. last_bit;
4
- position ::= static_expression
+ position ::= <static_>expression
5
- first_bit ::= static_simple_expression
+ first_bit ::= <static_>simple_expression
6
- last_bit ::= static_simple_expression
+ last_bit ::= <static_>simple_expression
6.a
Reason: First_bit and last_bit need to be simple_expression
@@ -62393,7 +62611,7 @@ type.
_Legality Rules_
8/2
-{AI95-00436-01AI95-00436-01} The first_subtype_local_name of a
+{<AI95-00436-01AI95-00436-01>} The <first_subtype_>local_name of a
record_representation_clause shall denote a specific record or record
extension subtype.
@@ -62402,10 +62620,10 @@ extension subtype.
the local_name is required to denote a first subtype.
9
-If the component_local_name is a direct_name, the local_name shall
+If the <component_>local_name is a direct_name, the local_name shall
denote a component of the type. For a record extension, the component
shall not be inherited, and shall not be a discriminant that corresponds
-to a discriminant of the parent type. If the component_local_name
+to a discriminant of the parent type. If the <component_>local_name
(*note 13.1: S0306.) has an attribute_designator (*note 4.1.4: S0101.),
the direct_name (*note 4.1: S0092.) of the local_name (*note 13.1:
S0306.) shall denote either the declaration of the type or a component
@@ -62422,7 +62640,7 @@ last_bit shall be no less than first_bit - 1.
is allowed if X can fit in zero bits.
10.1/2
-{AI95-00133-01AI95-00133-01} If the nondefault bit ordering applies to
+{<AI95-00133-01AI95-00133-01>} If the nondefault bit ordering applies to
the type, then either:
10.2/2
@@ -62443,31 +62661,32 @@ distinct variants of the same variant_part.
12
A name that denotes a component of a type is not allowed within a
record_representation_clause for the type, except as the
-component_local_name of a component_clause.
+<component_>local_name of a component_clause.
12.a
Reason: It might seem strange to make the
record_representation_clause part of the declarative region,
and then disallow mentions of the components within almost all
of the record_representation_clause. The alternative would be
- to treat the component_local_name like a formal parameter name
- in a subprogram call (in terms of visibility). However, this
- rule would imply slightly different semantics, because (given
- the actual rule) the components can hide other declarations.
- This was the rule in Ada 83, and we see no reason to change
- it. The following, for example, was and is illegal:
+ to treat the <component_>local_name like a formal parameter
+ name in a subprogram call (in terms of visibility). However,
+ this rule would imply slightly different semantics, because
+ (given the actual rule) the components can hide other
+ declarations. This was the rule in Ada 83, and we see no
+ reason to change it. The following, for example, was and is
+ illegal:
12.b
type T is
record
X : Integer;
end record;
- X : constant := 31; -- Same defining name as the component.
+ X : constant := 31; --< Same defining name as the component.>
for T use
record
- X at 0 range 0..X; -- Illegal!
+ X at 0 range 0..X; --< Illegal!>
end record;
-
+
12.c
The component X hides the named number X throughout the
@@ -62476,8 +62695,8 @@ component_local_name of a component_clause.
_Static Semantics_
13/2
-{AI95-00133-01AI95-00133-01} A record_representation_clause (without the
-mod_clause) specifies the layout.
+{<AI95-00133-01AI95-00133-01>} A record_representation_clause (without
+the mod_clause) specifies the layout.
13.a/3
Aspect Description for Layout (record): Layout of record
@@ -62488,14 +62707,14 @@ mod_clause) specifies the layout.
Aspect Description for Record layout: See Layout.
13.1/2
-{AI95-00133-01AI95-00133-01} If the default bit ordering applies to the
-type, the position, first_bit, and last_bit of each component_clause
+{<AI95-00133-01AI95-00133-01>} If the default bit ordering applies to
+the type, the position, first_bit, and last_bit of each component_clause
directly specify the position and size of the corresponding component.
13.2/3
-{AI95-00133-01AI95-00133-01} {AI05-0264-1AI05-0264-1} If the nondefault
-bit ordering applies to the type, then the layout is determined as
-follows:
+{<AI95-00133-01AI95-00133-01>} {<AI05-0264-1AI05-0264-1>} If the
+nondefault bit ordering applies to the type, then the layout is
+determined as follows:
13.3/2
* the component_clauses for which the value of last_bit is greater
@@ -62512,7 +62731,7 @@ follows:
offsets in this machine scalar.
13.c/2
- This paragraph was deleted.{AI95-00133-01AI95-00133-01}
+ <This paragraph was deleted.>{<AI95-00133-01AI95-00133-01>}
13.d
Ramification: A component_clause also determines the value of
@@ -62575,7 +62794,7 @@ explicitly in the record_representation_clause (*note
13.5.1: S0313.).
The recommended level of support for record_representation_clauses is:
17.1/2
- * {AI95-00133-01AI95-00133-01} An implementation should support
+ * {<AI95-00133-01AI95-00133-01>} An implementation should support
machine scalars that correspond to all of the integer, floating
point, and address formats supported by the machine.
@@ -62591,7 +62810,7 @@ The recommended level of support for
record_representation_clauses is:
that obeys the Alignment of the component subtype.
20/2
- * {AI95-00133-01AI95-00133-01} For a component with a subtype whose
+ * {<AI95-00133-01AI95-00133-01>} For a component with a subtype whose
Size is less than the word size, any storage place that does not
cross an aligned word boundary should be supported.
@@ -62645,14 +62864,14 @@ The recommended level of support for
record_representation_clauses is:
23.a
Ramification: The visibility rules prevent the name of a
component of the type from appearing in a
- record_representation_clause at any place except for the
- component_local_name of a component_clause. However, since
+ record_representation_clause at any place <except> for the
+ <component_>local_name of a component_clause. However, since
the record_representation_clause is part of the declarative
region of the type declaration, the component names hide outer
homographs throughout.
23.b/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} A
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} A
record_representation_clause cannot be given for a protected
type, even though protected types, like record types, have
components. The primary reason for this rule is that there is
@@ -62671,10 +62890,10 @@ The recommended level of support for
record_representation_clauses is:
_Examples_
24
-Example of specifying the layout of a record type:
+<Example of specifying the layout of a record type:>
25
- Word : constant := 4; -- storage element is byte, 4 bytes per word
+ Word : constant := 4; --< storage element is byte, 4 bytes per word>
26
type State is (A,M,W,P);
@@ -62702,10 +62921,10 @@ Example of specifying the layout of a record type:
for Program_Status_Word use
record
System_Mask at 0*Word range 0 .. 7;
- Protection_Key at 0*Word range 10 .. 11; -- bits 8,9 unused
+ Protection_Key at 0*Word range 10 .. 11; --< bits 8,9 unused>
Machine_State at 0*Word range 12 .. 15;
Interrupt_Cause at 0*Word range 16 .. 31;
- Ilc at 1*Word range 0 .. 1; -- second word
+ Ilc at 1*Word range 0 .. 1; --< second word>
Cc at 1*Word range 2 .. 3;
Program_Mask at 1*Word range 4 .. 7;
Inst_Address at 1*Word range 8 .. 31;
@@ -62718,7 +62937,7 @@ Example of specifying the layout of a record type:
NOTES
31
- 15 Note on the example: The record_representation_clause defines
+ 15 <Note on the example:> The record_representation_clause defines
the record layout. The Size clause guarantees that (at least)
eight storage elements are used for objects of the type. The
Alignment clause guarantees that aliased, imported, or exported
@@ -62744,21 +62963,21 @@ Example of specifying the layout of a record type:
_Incompatibilities With Ada 95_
31.d/2
- {AI95-00133-01AI95-00133-01} Amendment Correction: The meaning
- of a record_representation_clause for the nondefault bit order
- is now clearly defined. Thus, such clauses can be portably
- written. In order to do that though, the equivalence of bit 1
- in word 1 to bit 9 in word 0 (for a machine with Storage_Unit
- = 8) had to be dropped for the nondefault bit order. Any
- record_representation_clauses which depends on that
- equivalence will break (although such code would imply a
+ {<AI95-00133-01AI95-00133-01>} Amendment Correction: The
+ meaning of a record_representation_clause for the nondefault
+ bit order is now clearly defined. Thus, such clauses can be
+ portably written. In order to do that though, the equivalence
+ of bit 1 in word 1 to bit 9 in word 0 (for a machine with
+ Storage_Unit = 8) had to be dropped for the nondefault bit
+ order. Any record_representation_clauses which depends on
+ that equivalence will break (although such code would imply a
noncontiguous representation for a component, and it seems
unlikely that compilers were supporting that anyway).
_Extensions to Ada 95_
31.e/2
- {AI95-00436-01AI95-00436-01} Amendment Correction: The
+ {<AI95-00436-01AI95-00436-01>} Amendment Correction: The
undocumented (and likely unintentional) incompatibility with
Ada 83 caused by not allowing record_representation_clauses on
limited record types is removed.
@@ -62772,8 +62991,8 @@ File: aarm2012.info, Node: 13.5.2, Next: 13.5.3,
Prev: 13.5.1, Up: 13.5
_Static Semantics_
1
-For a component C of a composite, non-array object R, the storage place
-attributes are defined:
+For a component C of a composite, non-array object R, the <storage place
+attributes> are defined:
1.a
Ramification: The storage place attributes are not
@@ -62782,16 +63001,16 @@ attributes are defined:
2/2
R.C'Position
- {AI95-00133-01AI95-00133-01} If the nondefault bit
+ {<AI95-00133-01AI95-00133-01>} If the nondefault bit
ordering applies to the composite type, and if a
component_clause specifies the placement of C, denotes
the value given for the position of the component_clause;
otherwise, denotes the same value as R.C'Address -
R'Address. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
2.a/2
- Ramification: {AI95-00133-01AI95-00133-01} Thus, for the
+ Ramification: {<AI95-00133-01AI95-00133-01>} Thus, for the
default bit order, R.C'Position is the offset of C in storage
elements from the beginning of the object, where the first
storage element of an object is numbered zero. R'Address +
@@ -62806,7 +63025,7 @@ R.C'Position
3/2
R.C'First_Bit
- {AI95-00133-01AI95-00133-01} If the nondefault bit
+ {<AI95-00133-01AI95-00133-01>} If the nondefault bit
ordering applies to the composite type, and if a
component_clause specifies the placement of C, denotes
the value given for the first_bit of the
@@ -62815,21 +63034,22 @@ R.C'First_Bit
of the first bit occupied by C. This offset is measured
in bits. The first bit of a storage element is numbered
zero. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
4/2
R.C'Last_Bit
- {AI95-00133-01AI95-00133-01} If the nondefault bit
+ {<AI95-00133-01AI95-00133-01>} If the nondefault bit
ordering applies to the composite type, and if a
component_clause specifies the placement of C, denotes
the value given for the last_bit of the component_clause;
otherwise, denotes the offset, from the start of the
first of the storage elements occupied by C, of the last
bit occupied by C. This offset is measured in bits. The
- value of this attribute is of the type universal_integer.
+ value of this attribute is of the type
+ <universal_integer>.
4.a/2
- Ramification: {AI95-00114-01AI95-00114-01} The ordering of
+ Ramification: {<AI95-00114-01AI95-00114-01>} The ordering of
bits in a storage element is defined in *note 13.5.3::, "*note
13.5.3:: Bit Ordering".
@@ -62875,12 +63095,12 @@ attributes.
_Incompatibilities With Ada 95_
5.c/2
- {AI95-00133-01AI95-00133-01} Amendment Correction: The meaning
- of the storage place attributes for the nondefault bit order
- is now clearly defined, and can be different than that given
- by strictly following the Ada 95 wording. Any code which
- depends on the original Ada 95 values for a type using the
- nondefault bit order where they are different will break.
+ {<AI95-00133-01AI95-00133-01>} Amendment Correction: The
+ meaning of the storage place attributes for the nondefault bit
+ order is now clearly defined, and can be different than that
+ given by strictly following the Ada 95 wording. Any code
+ which depends on the original Ada 95 values for a type using
+ the nondefault bit order where they are different will break.
File: aarm2012.info, Node: 13.5.3, Prev: 13.5.2, Up: 13.5
@@ -62901,7 +63121,7 @@ place attributes.]
used for that purpose in some situations.
1.b/2
- {AI95-00114-01AI95-00114-01} We can't require all
+ {<AI95-00114-01AI95-00114-01>} We can't require all
implementations on a given machine to use the same bit
ordering by default; if the user cares, a Bit_Order
attribute_definition_clause can be used to force all
@@ -62911,10 +63131,10 @@ place attributes.]
2
A bit ordering is a method of interpreting the meaning of the storage
-place attributes. High_Order_First [(known in the vernacular as "big
+place attributes. High_Order_First [(known in the vernacular as "big
endian")] means that the first bit of a storage element (bit 0) is the
most significant bit (interpreting the sequence of bits that represent a
-component as an unsigned integer value). Low_Order_First [(known in the
+component as an unsigned integer value). Low_Order_First [(known in the
vernacular as "little endian")] means the opposite: the first bit is the
least significant.
@@ -62924,8 +63144,8 @@ For every specific record subtype S, the following
attribute is defined:
4
S'Bit_Order
Denotes the bit ordering for the type of S. The value of
- this attribute is of type System.Bit_Order. Bit_Order may
- be specified for specific record types via an
+ this attribute is of type System.Bit_Order. Bit_Order
+ may be specified for specific record types via an
attribute_definition_clause; the expression of such a
clause shall be static.
@@ -62937,7 +63157,7 @@ S'Bit_Order
If Word_Size = Storage_Unit, the default bit ordering is implementation
defined. If Word_Size > Storage_Unit, the default bit ordering is the
same as the ordering of storage elements in a word, when interpreted as
-an integer.
+an integer.
5.a
Implementation defined: If Word_Size = Storage_Unit, the
@@ -62970,19 +63190,20 @@ according to the bit ordering of the type.
The recommended level of support for the nondefault bit ordering is:
8/2
- * {AI95-00133-01AI95-00133-01} The implementation should support the
- nondefault bit ordering in addition to the default bit ordering.
+ * {<AI95-00133-01AI95-00133-01>} The implementation should support
+ the nondefault bit ordering in addition to the default bit
+ ordering.
8.a/2
- Ramification: {AI95-00133-01AI95-00133-01} The implementation
- should support both bit orderings. Implementations are
- required to support storage positions that cross storage
- element boundaries when Word_Size > Storage_Unit but the
- definition of the storage place attributes for the nondefault
- bit order ensures that such storage positions will not be
- split into two or three pieces. Thus, there is no significant
- implementation burden to supporting the nondefault bit order,
- given that the set of machine scalars is
+ Ramification: {<AI95-00133-01AI95-00133-01>} The
+ implementation should support both bit orderings.
+ Implementations are required to support storage positions that
+ cross storage element boundaries when Word_Size > Storage_Unit
+ but the definition of the storage place attributes for the
+ nondefault bit order ensures that such storage positions will
+ not be split into two or three pieces. Thus, there is no
+ significant implementation burden to supporting the nondefault
+ bit order, given that the set of machine scalars is
implementation-defined.
8.b/2
@@ -62992,10 +63213,10 @@ The recommended level of support for the nondefault
bit ordering is:
NOTES
9/2
- 16 {AI95-00133-01AI95-00133-01} Bit_Order clauses make it possible
- to write record_representation_clauses that can be ported between
- machines having different bit ordering. They do not guarantee
- transparent exchange of data between such machines.
+ 16 {<AI95-00133-01AI95-00133-01>} Bit_Order clauses make it
+ possible to write record_representation_clauses that can be ported
+ between machines having different bit ordering. They do not
+ guarantee transparent exchange of data between such machines.
_Extensions to Ada 83_
@@ -63005,7 +63226,7 @@ The recommended level of support for the nondefault bit
ordering is:
_Wording Changes from Ada 95_
9.b/2
- {AI95-00133-01AI95-00133-01} We now suggest that all
+ {<AI95-00133-01AI95-00133-01>} We now suggest that all
implementations support the nondefault bit order.
@@ -63015,7 +63236,7 @@ File: aarm2012.info, Node: 13.6, Next: 13.7, Prev:
13.5, Up: 13
=============================
1/3
-{AI05-0229-1AI05-0229-1} [ A type_conversion (see *note 4.6::) can be
+{<AI05-0229-1AI05-0229-1>} [ A type_conversion (see *note 4.6::) can be
used to convert between two different representations of the same array
or record. To convert an array from one representation to another, two
array types need to be declared with matching component subtypes, and
@@ -63038,17 +63259,17 @@ effect a change in representation.]
_Examples_
3
-Example of change of representation:
+<Example of change of representation:>
4
- -- Packed_Descriptor and Descriptor are two different types
- -- with identical characteristics, apart from their
- -- representation
+ --< Packed_Descriptor and Descriptor are two different types>
+ --< with identical characteristics, apart from their>
+ --< representation>
5
type Descriptor is
record
- -- components of a descriptor
+ --< components of a descriptor>
end record;
6
@@ -63057,19 +63278,19 @@ Example of change of representation:
7
for Packed_Descriptor use
record
- -- component clauses for some or for all components
+ --< component clauses for some or for all components>
end record;
8
- -- Change of representation can now be accomplished by explicit type
conversions:
+ <-- Change of representation can now be accomplished by explicit type
conversions:>
9
D : Descriptor;
P : Packed_Descriptor;
10
- P := Packed_Descriptor(D); -- pack D
- D := Descriptor(P); -- unpack P
+ P := Packed_Descriptor(D); --< pack D>
+ D := Descriptor(P); --< unpack P>
File: aarm2012.info, Node: 13.7, Next: 13.8, Prev: 13.6, Up: 13
@@ -63092,49 +63313,49 @@ The following language-defined library package exists:
package System.
3/2
- {AI95-00362-01AI95-00362-01} package System is
+ {<AI95-00362-01AI95-00362-01>} package System is
pragma Pure(System);
4
- type Name is implementation-defined-enumeration-type;
- System_Name : constant Name := implementation-defined;
+ type Name is <implementation-defined-enumeration-type>;
+ System_Name : constant Name := <implementation-defined>;
5
- -- System-Dependent Named Numbers:
+ --< System-Dependent Named Numbers:>
6
- Min_Int : constant := root_integer'First;
- Max_Int : constant := root_integer'Last;
+ Min_Int : constant := <root_integer>'First;
+ Max_Int : constant := <root_integer>'Last;
7
- Max_Binary_Modulus : constant := implementation-defined;
- Max_Nonbinary_Modulus : constant := implementation-defined;
+ Max_Binary_Modulus : constant := <implementation-defined>;
+ Max_Nonbinary_Modulus : constant := <implementation-defined>;
8
- Max_Base_Digits : constant := root_real'Digits;
- Max_Digits : constant := implementation-defined;
+ Max_Base_Digits : constant := <root_real>'Digits;
+ Max_Digits : constant := <implementation-defined>;
9
- Max_Mantissa : constant := implementation-defined;
- Fine_Delta : constant := implementation-defined;
+ Max_Mantissa : constant := <implementation-defined>;
+ Fine_Delta : constant := <implementation-defined>;
10
- Tick : constant := implementation-defined;
+ Tick : constant := <implementation-defined>;
11
- -- Storage-related Declarations:
+ --< Storage-related Declarations:>
12
- type Address is implementation-defined;
+ type Address is <implementation-defined>;
Null_Address : constant Address;
13
- Storage_Unit : constant := implementation-defined;
- Word_Size : constant := implementation-defined * Storage_Unit;
- Memory_Size : constant := implementation-defined;
+ Storage_Unit : constant := <implementation-defined>;
+ Word_Size : constant := <implementation-defined> * Storage_Unit;
+ Memory_Size : constant := <implementation-defined>;
14/3
- {AI05-0229-1AI05-0229-1} -- Address Comparison:
+ {<AI05-0229-1AI05-0229-1>} --< Address Comparison:>
function "<" (Left, Right : Address) return Boolean
with Convention => Intrinsic;
function "<="(Left, Right : Address) return Boolean
@@ -63146,18 +63367,18 @@ The following language-defined library package exists:
function "=" (Left, Right : Address) return Boolean
with Convention => Intrinsic;
-- function "/=" (Left, Right : Address) return Boolean;
- -- "/=" is implicitly defined
+ --< "/=" is implicitly defined>
15/2
- {AI95-00221-01AI95-00221-01} -- Other System-Dependent Declarations:
+ {<AI95-00221-01AI95-00221-01>} --< Other System-Dependent
Declarations:>
type Bit_Order is (High_Order_First, Low_Order_First);
- Default_Bit_Order : constant Bit_Order := implementation-defined;
+ Default_Bit_Order : constant Bit_Order := <implementation-defined>;
16
- -- Priority-related declarations (see *note D.1::):
- subtype Any_Priority is Integer range implementation-defined;
+ --< Priority-related declarations (see *note D.1::):>
+ subtype Any_Priority is Integer range <implementation-defined>;
subtype Priority is Any_Priority range Any_Priority'First ..
- implementation-defined;
+ <implementation-defined>;
subtype Interrupt_Priority is Any_Priority range Priority'Last+1 ..
Any_Priority'Last;
@@ -63167,7 +63388,7 @@ The following language-defined library package exists:
18
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System;
19
@@ -63176,8 +63397,8 @@ alternative machine configurations handled by the
implementation.
System_Name represents the current machine configuration.
20
-The named numbers Fine_Delta and Tick are of the type universal_real;
-the others are of the type universal_integer.
+The named numbers Fine_Delta and Tick are of the type <universal_real>;
+the others are of the type <universal_integer>.
21
The meanings of the named numbers are:
@@ -63289,11 +63510,11 @@ Memory_Size
Memory_Size is not very useful.
34/2
-{AI95-00161-01AI95-00161-01} Address is a definite, nonlimited type with
-preelaborable initialization (see *note 10.2.1::). Address represents
-machine addresses capable of addressing individual storage elements.
-Null_Address is an address that is distinct from the address of any
-object or program unit.
+{<AI95-00161-01AI95-00161-01>} Address is a definite, nonlimited type
+with preelaborable initialization (see *note 10.2.1::). Address
+represents machine addresses capable of addressing individual storage
+elements. Null_Address is an address that is distinct from the address
+of any object or program unit.
34.a
Ramification: The implementation has to ensure that there is
@@ -63310,21 +63531,21 @@ object or program unit.
declare uninitialized address variables.
34.d/2
- Ramification: {AI95-00161-01AI95-00161-01} If System.Address
+ Ramification: {<AI95-00161-01AI95-00161-01>} If System.Address
is defined as a private type (as suggested below), it might be
necessary to add a pragma Preelaborable_Initialization to the
specification of System in order that Address have
preelaborable initialization as required.
35/2
-{AI95-00221-01AI95-00221-01} Default_Bit_Order shall be a static
+{<AI95-00221-01AI95-00221-01>} Default_Bit_Order shall be a static
constant. See *note 13.5.3:: for an explanation of Bit_Order and
Default_Bit_Order.
_Implementation Permissions_
36/2
-{AI95-00362-01AI95-00362-01} An implementation may add additional
+{<AI95-00362-01AI95-00362-01>} An implementation may add additional
implementation-defined declarations to package System and its children.
[However, it is usually better for the implementation to provide
additional functionality via implementation-defined children of System.]
@@ -63333,7 +63554,7 @@ additional functionality via implementation-defined
children of System.]
Ramification: The declarations in package System and its
children can be implicit. For example, since Address is not
limited, the predefined "=" and "/=" operations are probably
- sufficient. However, the implementation is not required to
+ sufficient. However, the implementation is not <required> to
use the predefined "=".
_Implementation Advice_
@@ -63420,7 +63641,7 @@ Address should be a private type.
_Extensions to Ada 95_
38.e/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Type
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Type
Address is defined to have preelaborable initialization, so
that it can be used without restriction in preelaborated
units. (If Address is defined to be a private type, as
@@ -63429,13 +63650,13 @@ Address should be a private type.
unnecessary portability issue.)
38.f/2
- {AI95-00221-01AI95-00221-01} Amendment Correction:
+ {<AI95-00221-01AI95-00221-01>} Amendment Correction:
Default_Bit_Order is now a static constant.
38.g/2
- {AI95-00362-01AI95-00362-01} Package System is now Pure, so it
- can be portably used in more places. (Ada 95 allowed it to be
- Pure, but did not require that.)
+ {<AI95-00362-01AI95-00362-01>} Package System is now Pure, so
+ it can be portably used in more places. (Ada 95 allowed it to
+ be Pure, but did not require that.)
* Menu:
@@ -63454,27 +63675,27 @@ File: aarm2012.info, Node: 13.7.1, Next: 13.7.2,
Up: 13.7
The following language-defined library package exists:
2/2
- {AI95-00362-01AI95-00362-01} package System.Storage_Elements is
+ {<AI95-00362-01AI95-00362-01>} package System.Storage_Elements is
pragma Pure(Storage_Elements);
3
- type Storage_Offset is range implementation-defined;
+ type Storage_Offset is range <implementation-defined>;
4
subtype Storage_Count is Storage_Offset range 0..Storage_Offset'Last;
5
- type Storage_Element is mod implementation-defined;
+ type Storage_Element is mod <implementation-defined>;
for Storage_Element'Size use Storage_Unit;
type Storage_Array is array
(Storage_Offset range <>) of aliased Storage_Element;
for Storage_Array'Component_Size use Storage_Unit;
6
- -- Address Arithmetic:
+ --< Address Arithmetic:>
7/3
- {AI05-0229-1AI05-0229-1} function "+"(Left : Address; Right :
Storage_Offset) return Address
+ {<AI05-0229-1AI05-0229-1>} function "+"(Left : Address; Right :
Storage_Offset) return Address
with Convention => Intrinsic;
function "+"(Left : Storage_Offset; Right : Address) return Address
with Convention => Intrinsic;
@@ -63484,26 +63705,27 @@ The following language-defined library package exists:
with Convention => Intrinsic;
8/3
- {AI05-0229-1AI05-0229-1} function "mod"(Left : Address; Right :
Storage_Offset)
+ {<AI05-0229-1AI05-0229-1>} function "mod"(Left : Address; Right :
Storage_Offset)
return Storage_Offset
with Convention => Intrinsic;
9
- -- Conversion to/from integers:
+ --< Conversion to/from integers:>
10/3
- {AI05-0229-1AI05-0229-1} type Integer_Address is
implementation-defined;
+ {<AI05-0229-1AI05-0229-1>} type Integer_Address is
<implementation-defined>;
function To_Address(Value : Integer_Address) return Address
with Convention => Intrinsic;
function To_Integer(Value : Address) return Integer_Address
with Convention => Intrinsic;
11/3
- {AI05-0229-1AI05-0229-1} end System.Storage_Elements;
+ {<AI05-0229-1AI05-0229-1>} end System.Storage_Elements;
11.a/3
- Reason: {AI05-0229-1AI05-0229-1} The Convention aspects imply
- that the attribute Access is not allowed for those operations.
+ Reason: {<AI05-0229-1AI05-0229-1>} The Convention aspects
+ imply that the attribute Access is not allowed for those
+ operations.
11.b
The mod function is needed so that the definition of Alignment
@@ -63518,7 +63740,7 @@ The following language-defined library package exists:
12
Storage_Element represents a storage element. Storage_Offset represents
an offset in storage elements. Storage_Count represents a number of
-storage elements. Storage_Array represents a contiguous sequence of
+storage elements. Storage_Array represents a contiguous sequence of
storage elements.
12.a
@@ -63529,7 +63751,7 @@ storage elements.
some situations.
12.b/2
- This paragraph was deleted.{AI95-00114-01AI95-00114-01}
+ <This paragraph was deleted.>{<AI95-00114-01AI95-00114-01>}
13
Integer_Address is a [(signed or modular)] integer subtype. To_Address
@@ -63542,7 +63764,7 @@ Storage_Offset'Last shall be greater than or equal to
Integer'Last or
the largest possible storage offset, whichever is smaller.
Storage_Offset'First shall be <= (-Storage_Offset'Last).
-Paragraph 15 was deleted.
+<Paragraph 15 was deleted.>
_Implementation Advice_
@@ -63587,7 +63809,7 @@ Operations that do not make sense should raise
Program_Error.
_Extensions to Ada 95_
16.d/2
- {AI95-00362-01AI95-00362-01} Package System.Storage_Elements
+ {<AI95-00362-01AI95-00362-01>} Package System.Storage_Elements
is now Pure, so it can be portably used in more places. (Ada
95 allowed it to be Pure, but did not require that.)
@@ -63609,17 +63831,17 @@ The following language-defined generic library
package exists:
pragma Preelaborate(Address_To_Access_Conversions);
3/3
- {AI05-0229-1AI05-0229-1} type Object_Pointer is access all Object;
+ {<AI05-0229-1AI05-0229-1>} type Object_Pointer is access all Object;
function To_Pointer(Value : Address) return Object_Pointer
with Convention => Intrinsic;
function To_Address(Value : Object_Pointer) return Address
with Convention => Intrinsic;
4/3
- {AI05-0229-1AI05-0229-1} end System.Address_To_Access_Conversions;
+ {<AI05-0229-1AI05-0229-1>} end System.Address_To_Access_Conversions;
5/2
-{AI95-00230-01AI95-00230-01} The To_Pointer and To_Address subprograms
+{<AI95-00230-01AI95-00230-01>} The To_Pointer and To_Address subprograms
convert back and forth between values of types Object_Pointer and
Address. To_Pointer(X'Address) is equal to X'Unchecked_Access for any X
that allows Unchecked_Access. To_Pointer(Null_Address) returns null.
@@ -63628,10 +63850,10 @@ returns Null_Address. To_Address(Y), where Y /=
null, returns
Y.all'Address.
5.a/3
- Discussion: {AI95-00114-01AI95-00114-01}
- {AI05-0005-1AI05-0005-1} The programmer should ensure that the
- address passed to To_Pointer is either Null_Address, or the
- address of an object of type Object. (If Object is not a
+ Discussion: {<AI95-00114-01AI95-00114-01>}
+ {<AI05-0005-1AI05-0005-1>} The programmer should ensure that
+ the address passed to To_Pointer is either Null_Address, or
+ the address of an object of type Object. (If Object is not a
by-reference type, the object ought to be aliased; recall that
the Address attribute is not required to provide a useful
result for other objects.) Otherwise, the behavior of the
@@ -63765,9 +63987,10 @@ implementation is not required to provide package
System.Machine_Code.
specifying register conventions and calling conventions.
10/2
- 19 {AI95-00318-02AI95-00318-02} Machine code functions are exempt
- from the rule that a return statement is required. In fact, return
- statements are forbidden, since only code_statements are allowed.
+ 19 {<AI95-00318-02AI95-00318-02>} Machine code functions are
+ exempt from the rule that a return statement is required. In fact,
+ return statements are forbidden, since only code_statements are
+ allowed.
10.a
Discussion: The idea is that the author of a machine code
@@ -63786,19 +64009,19 @@ implementation is not required to provide package
System.Machine_Code.
_Examples_
12
-Example of a code statement:
+<Example of a code statement:>
13/3
- {AI05-0229-1AI05-0229-1} M : Mask;
+ {<AI05-0229-1AI05-0229-1>} M : Mask;
procedure Set_Mask
with Inline;
14
procedure Set_Mask is
- use System.Machine_Code; -- assume "with System.Machine_Code;" appears
somewhere above
+ use System.Machine_Code; --< assume "with System.Machine_Code;" appears
somewhere above>
begin
SI_Format'(Code => SSM, B => M'Base_Reg, D => M'Disp);
- -- Base_Reg and Disp are implementation-defined attributes
+ --< Base_Reg and Disp are implementation-defined attributes>
end Set_Mask;
_Extensions to Ada 83_
@@ -63831,7 +64054,7 @@ of the generic function Unchecked_Conversion.]
The following language-defined generic library function exists:
3/3
- {AI05-0229-1AI05-0229-1} generic
+ {<AI05-0229-1AI05-0229-1>} generic
type Source(<>) is limited private;
type Target(<>) is limited private;
function Ada.Unchecked_Conversion(S : Source) return Target
@@ -63839,9 +64062,9 @@ The following language-defined generic library function
exists:
pragma Pure(Ada.Unchecked_Conversion);
3.a/3
- Reason: {AI05-0229-1AI05-0229-1} The aspect Convention implies
- that the attribute Access is not allowed for instances of
- Unchecked_Conversion.
+ Reason: {<AI05-0229-1AI05-0229-1>} The aspect Convention
+ implies that the attribute Access is not allowed for instances
+ of Unchecked_Conversion.
_Dynamic Semantics_
@@ -63866,7 +64089,7 @@ representation is the same as that of the source object
S:
be known at compile time.
7/3
- * {AI05-0078-1AI05-0078-1} S'Alignment is a multiple of
+ * {<AI05-0078-1AI05-0078-1>} S'Alignment is a multiple of
Target'Alignment or Target'Alignment is zero.
8
@@ -63880,7 +64103,7 @@ representation is the same as that of the source object
S:
target subtype.
11/2
-{AI95-00426-01AI95-00426-01} Otherwise, if the result type is scalar,
+{<AI95-00426-01AI95-00426-01>} Otherwise, if the result type is scalar,
the result of the function is implementation defined, and can have an
invalid representation (see *note 13.9.1::). If the result type is
nonscalar, the effect is implementation defined; in particular, the
@@ -63897,7 +64120,7 @@ result can be abnormal (see *note 13.9.1::).
defined by the language.
11.a.1/2
- Reason: {AI95-00426-01AI95-00426-01} Note the difference
+ Reason: {<AI95-00426-01AI95-00426-01>} Note the difference
between these sentences; the first only says that the bits
returned are implementation defined, while the latter allows
any effect. The difference is because scalar objects should
@@ -63907,18 +64130,18 @@ result can be abnormal (see *note 13.9.1::).
Unchecked_Conversion.
11.a.2/2
- Ramification: {AI95-00426-01AI95-00426-01} Whenever unchecked
- conversions are used, it is the programmer's responsibility to
- ensure that these conversions maintain the properties that are
- guaranteed by the language for objects of the target type.
- For nonscalar types, this requires the user to understand the
- underlying run-time model of the implementation. The
- execution of a program that violates these properties by means
- of unchecked conversions returning a nonscalar type is
- erroneous. Properties of scalar types can be checked by using
- the Valid attribute (see *note 13.9.2::); programs can avoid
- violating properties of the type (and erroneous execution) by
- careful use of this attribute.
+ Ramification: {<AI95-00426-01AI95-00426-01>} Whenever
+ unchecked conversions are used, it is the programmer's
+ responsibility to ensure that these conversions maintain the
+ properties that are guaranteed by the language for objects of
+ the target type. For nonscalar types, this requires the user
+ to understand the underlying run-time model of the
+ implementation. The execution of a program that violates
+ these properties by means of unchecked conversions returning a
+ nonscalar type is erroneous. Properties of scalar types can
+ be checked by using the Valid attribute (see *note 13.9.2::);
+ programs can avoid violating properties of the type (and
+ erroneous execution) by careful use of this attribute.
11.b
An instance of Unchecked_Conversion can be applied to an
@@ -63949,9 +64172,9 @@ An implementation may place restrictions on
Unchecked_Conversion.
_Implementation Advice_
14/2
-{AI95-00051-02AI95-00051-02} Since the Size of an array object generally
-does not include its bounds, the bounds should not be part of the
-converted data.
+{<AI95-00051-02AI95-00051-02>} Since the Size of an array object
+generally does not include its bounds, the bounds should not be part of
+the converted data.
14.a.1/2
Implementation Advice: Since the Size of an array object
@@ -63989,14 +64212,14 @@ unless required by the target environment.
The recommended level of support for unchecked conversions is:
17/3
- * {AI05-0299-1AI05-0299-1} Unchecked conversions should be supported
- and should be reversible in the cases where this subclause defines
- the result. To enable meaningful use of unchecked conversion, a
- contiguous representation should be used for elementary subtypes,
- for statically constrained array subtypes whose component subtype
- is one of the subtypes described in this paragraph, and for record
- subtypes without discriminants whose component subtypes are
- described in this paragraph.
+ * {<AI05-0299-1AI05-0299-1>} Unchecked conversions should be
+ supported and should be reversible in the cases where this
+ subclause defines the result. To enable meaningful use of
+ unchecked conversion, a contiguous representation should be used
+ for elementary subtypes, for statically constrained array subtypes
+ whose component subtype is one of the subtypes described in this
+ paragraph, and for record subtypes without discriminants whose
+ component subtypes are described in this paragraph.
17.a/2
Implementation Advice: The recommended level of support for
@@ -64005,19 +64228,19 @@ The recommended level of support for unchecked
conversions is:
_Wording Changes from Ada 95_
17.b/2
- {AI95-00051-02AI95-00051-02} The implementation advice about
+ {<AI95-00051-02AI95-00051-02>} The implementation advice about
the size of array objects was moved to 13.3 so that all of the
advice about Size is in one place.
17.c/2
- {AI95-00426-01AI95-00426-01} Clarified that the result of
+ {<AI95-00426-01AI95-00426-01>} Clarified that the result of
Unchecked_Conversion for scalar types can be invalid, but not
abnormal.
_Wording Changes from Ada 2005_
17.d/3
- {AI05-0078-1AI05-0078-1} Correction: Relaxed the alignment
+ {<AI05-0078-1AI05-0078-1>} Correction: Relaxed the alignment
requirement slightly, giving a defined result in more cases.
* Menu:
@@ -64033,13 +64256,13 @@ File: aarm2012.info, Node: 13.9.1, Next: 13.9.2,
Up: 13.9
1
Certain actions that can potentially lead to erroneous execution are not
-directly erroneous, but instead can cause objects to become abnormal.
+directly erroneous, but instead can cause objects to become <abnormal>.
Subsequent uses of abnormal objects can be erroneous.
2
-A scalar object can have an invalid representation, which means that the
-object's representation does not represent any value of the object's
-subtype. The primary cause of invalid representations is uninitialized
+A scalar object can have an <invalid representation>, which means that
+the object's representation does not represent any value of the object's
+subtype. The primary cause of invalid representations is uninitialized
variables.
3
@@ -64051,9 +64274,9 @@ subclause.
4
When an object is first created, and any explicit or default
initializations have been performed, the object and all of its parts are
-in the normal state. Subsequent operations generally leave them normal.
-However, an object or part of an object can become abnormal in the
-following ways:
+in the <normal> state. Subsequent operations generally leave them
+normal. However, an object or part of an object can become <abnormal>
+in the following ways:
5
* An assignment to the object is disrupted due to an abort (see *note
@@ -64061,7 +64284,7 @@ following ways:
11.6::).
6/2
- * {AI95-00426-01AI95-00426-01} The object is not scalar, and is
+ * {<AI95-00426-01AI95-00426-01>} The object is not scalar, and is
passed to an in out or out parameter of an imported procedure, the
Read procedure of an instance of Sequential_IO, Direct_IO, or
Storage_IO, or the stream attribute T'Read, if after return from
@@ -64069,7 +64292,7 @@ following ways:
represent a value of the parameter's subtype.
6.1/2
- * {AI95-00426-01AI95-00426-01} The object is the return object of a
+ * {<AI95-00426-01AI95-00426-01>} The object is the return object of a
function call of a nonscalar type, and the function is an imported
function, an instance of Unchecked_Conversion, or the stream
attribute T'Input, if after return from the function the
@@ -64089,7 +64312,7 @@ following ways:
without any possibility of abnormal objects.
6.2/2
-{AI95-00426-01AI95-00426-01} [For an imported object, it is the
+{<AI95-00426-01AI95-00426-01>} [For an imported object, it is the
programmer's responsibility to ensure that the object remains in a
normal state.]
@@ -64111,7 +64334,7 @@ abnormal object, or to evaluate a prefix that denotes
an abnormal
object.
8.a/2
- This paragraph was deleted.{AI95-00114-01AI95-00114-01}
+ <This paragraph was deleted.>{<AI95-00114-01AI95-00114-01>}
8.b
Ramification: The in out or out parameter case does not apply
@@ -64119,7 +64342,7 @@ object.
rather than abnormal, in this case.
8.c/2
- Reason: {AI95-00114-01AI95-00114-01} The reason we allow
+ Reason: {<AI95-00114-01AI95-00114-01>} The reason we allow
access objects, and objects containing subcomponents of an
access type, to become abnormal is because the correctness of
an access value cannot necessarily be determined merely by
@@ -64140,20 +64363,20 @@ object.
9
If the representation of a scalar object does not represent a value of
the object's subtype (perhaps because the object was not initialized),
-the object is said to have an invalid representation. It is a bounded
-error to evaluate the value of such an object. If the error is detected,
-either Constraint_Error or Program_Error is raised. Otherwise,
-execution continues using the invalid representation. The rules of the
-language outside this subclause assume that all objects have valid
-representations. The semantics of operations on invalid representations
-are as follows:
+the object is said to have an <invalid representation>. It is a bounded
+error to evaluate the value of such an object. If the error is
+detected, either Constraint_Error or Program_Error is raised.
+Otherwise, execution continues using the invalid representation. The
+rules of the language outside this subclause assume that all objects
+have valid representations. The semantics of operations on invalid
+representations are as follows:
9.a
Discussion: The AARM is more explicit about what happens when
the value of the case expression is an invalid representation.
9.b/2
- Ramification: {AI95-00426-01AI95-00426-01} This includes the
+ Ramification: {<AI95-00426-01AI95-00426-01>} This includes the
result object of functions, including the result of
Unchecked_Conversion, T'Input, and imported functions.
@@ -64169,7 +64392,7 @@ are as follows:
becoming abnormal.
11.a/2
- Implementation Note: {AI95-00426-01AI95-00426-01} This means
+ Implementation Note: {<AI95-00426-01AI95-00426-01>} This means
that the implementation must take care not to use an invalid
representation in a way that might cause erroneous execution.
For instance, the exception mandated for case_statements must
@@ -64181,20 +64404,20 @@ are as follows:
_Erroneous Execution_
12/3
-{AI95-00167-01AI95-00167-01} {AI05-0279-1AI05-0279-1} A call to an
+{<AI95-00167-01AI95-00167-01>} {<AI05-0279-1AI05-0279-1>} A call to an
imported function or an instance of Unchecked_Conversion is erroneous if
the result is scalar, the result object has an invalid representation,
and the result is used other than as the expression of an
-assignment_statement or an object_declaration, as the object_name of an
-object_renaming_declaration, or as the prefix of a Valid attribute. If
-such a result object is used as the source of an assignment, and the
+assignment_statement or an object_declaration, as the <object_>name of
+an object_renaming_declaration, or as the prefix of a Valid attribute.
+If such a result object is used as the source of an assignment, and the
assigned value is an invalid representation for the target of the
assignment, then any use of the target object prior to a further
assignment to the target object, other than as the prefix of a Valid
attribute reference, is erroneous.
12.a/2
- Ramification: {AI95-00167-01AI95-00167-01} In a typical
+ Ramification: {<AI95-00167-01AI95-00167-01>} In a typical
implementation, every bit pattern that fits in an object of a
signed integer subtype will represent a value of the type, if
not of the subtype. However, for an enumeration or floating
@@ -64206,14 +64429,15 @@ attribute reference, is erroneous.
representation should be equal to itself, a representation
that is in between the internal codes of two enumeration
literals should behave accordingly when passed to comparison
- operators and membership tests, etc. We considered requiring
- such sensible behavior, but it resulted in too much arcane
- verbiage, and since implementations have little incentive to
- behave irrationally, such verbiage is not important to have.
+ operators and membership tests, etc. We considered
+ <requiring> such sensible behavior, but it resulted in too
+ much arcane verbiage, and since implementations have little
+ incentive to behave irrationally, such verbiage is not
+ important to have.
12.b/2
- {AI95-00167-01AI95-00167-01} If a stand-alone scalar object is
- initialized to a an in-range value, then the implementation
+ {<AI95-00167-01AI95-00167-01>} If a stand-alone scalar object
+ is initialized to a an in-range value, then the implementation
can take advantage of the fact that the use of any
out-of-range value has to be erroneous. Such an out-of-range
value can be produced only by things like unchecked
@@ -64227,20 +64451,20 @@ attribute reference, is erroneous.
Consider the following example:
12.d/2
- {AI95-00167-01AI95-00167-01} type My_Int is range 0..99;
+ {<AI95-00167-01AI95-00167-01>} type My_Int is range 0..99;
function Safe_Convert is new Unchecked_Conversion(My_Int,
Integer);
function Unsafe_Convert is new Unchecked_Conversion(My_Int,
Positive);
- X : Positive := Safe_Convert(0); -- Raises Constraint_Error.
- Y : Positive := Unsafe_Convert(0); -- Bounded Error, may be
invalid.
- B : Boolean := Y'Valid; -- OK, B = False.
- Z : Positive := Y+1; -- Erroneous to use Y.
+ X : Positive := Safe_Convert(0); --< Raises Constraint_Error.>
+ Y : Positive := Unsafe_Convert(0); --< Bounded Error, may be
invalid.>
+ B : Boolean := Y'Valid; --< OK, B = False.>
+ Z : Positive := Y+1; --< Erroneous to use Y.>
12.e/2
- {AI95-00167-01AI95-00167-01} {AI95-00426-01AI95-00426-01} The
- call to Unsafe_Convert is a bounded error, which might raise
- Constraint_Error, Program_Error, or return an invalid value.
- Moreover, if an exception is not raised, most uses of that
- invalid value (including the use of Y) cause erroneous
+ {<AI95-00167-01AI95-00167-01>} {<AI95-00426-01AI95-00426-01>}
+ The call to Unsafe_Convert is a bounded error, which might
+ raise Constraint_Error, Program_Error, or return an invalid
+ value. Moreover, if an exception is not raised, most uses of
+ that invalid value (including the use of Y) cause erroneous
execution. The call to Safe_Convert is not erroneous. The
result object is an object of subtype Integer containing the
value 0. The assignment to X is required to do a constraint
@@ -64249,20 +64473,21 @@ attribute reference, is erroneous.
language rules.
12.e.1/2
- {AI95-00167-01AI95-00167-01} {AI95-00426-01AI95-00426-01} The
- reason for delaying erroneous execution until the object is
- used is so that the invalid representation can be tested for
- validity using the Valid attribute (see *note 13.9.2::)
+ {<AI95-00167-01AI95-00167-01>} {<AI95-00426-01AI95-00426-01>}
+ The reason for delaying erroneous execution until the object
+ is used is so that the invalid representation can be tested
+ for validity using the Valid attribute (see *note 13.9.2::)
without causing execution to become erroneous. Note that this
delay does not imply an exception will not be raised; an
implementation could treat both conversions in the example in
the same way and raise Constraint_Error.
12.e.2/3
- {AI05-0279-1AI05-0279-1} The rules are defined in terms of the
- result object, and thus the name used to reference that object
- is irrelevant. That is why we don't need any special rules to
- describe what happens when the function result is renamed.
+ {<AI05-0279-1AI05-0279-1>} The rules are defined in terms of
+ the result object, and thus the name used to reference that
+ object is irrelevant. That is why we don't need any special
+ rules to describe what happens when the function result is
+ renamed.
12.f
Implementation Note: If an implementation wants to have a
@@ -64291,8 +64516,8 @@ attribute reference, is erroneous.
composite operand with an invalid scalar subcomponent.
13/3
-{AI05-0054-2AI05-0054-2} The dereference of an access value is erroneous
-if it does not designate an object of an appropriate type or a
+{<AI05-0054-2AI05-0054-2>} The dereference of an access value is
+erroneous if it does not designate an object of an appropriate type or a
subprogram with an appropriate profile, if it designates a nonexistent
object, or if it is an access-to-variable value that designates a
constant object and it did not originate from an attribute_reference
@@ -64307,7 +64532,7 @@ Unchecked_Conversion.]
interfacing to other languages can also cause the problem.
13.b/3
- {AI05-0054-2AI05-0054-2} We permit the use of
+ {<AI05-0054-2AI05-0054-2>} We permit the use of
access-to-variable values that designate constant objects so
long as they originate from an aliased variable view of a
controlled or immutably limited constant, such as during the
@@ -64338,20 +64563,20 @@ Unchecked_Conversion.]
_Wording Changes from Ada 95_
14.c/2
- {AI95-00167-01AI95-00167-01} The description of erroneous
+ {<AI95-00167-01AI95-00167-01>} The description of erroneous
execution for Unchecked_Conversion and imported objects was
tightened up so that using the Valid attribute to test such a
value is not erroneous.
14.d/2
- {AI95-00426-01AI95-00426-01} Clarified the definition of
+ {<AI95-00426-01AI95-00426-01>} Clarified the definition of
objects that can become abnormal; made sure that all of the
possibilities are included.
_Wording Changes from Ada 2005_
14.e/3
- {AI05-0054-2AI05-0054-2} Correction: Common programming
+ {<AI05-0054-2AI05-0054-2>} Correction: Common programming
techniques such as squirreling away an access to a controlled
object during initialization and using a self-referencing
discriminant (the so-called "Rosen trick") no longer are
@@ -64362,7 +64587,7 @@ Unchecked_Conversion.]
change will be slight.
14.f/3
- {AI05-0279-1AI05-0279-1} Correction: The description of
+ {<AI05-0279-1AI05-0279-1>} Correction: The description of
erroneous execution for Unchecked_Conversion and imported
objects was adjusted to clarify that renaming such an object
is not, by itself, erroneous.
@@ -64386,12 +64611,12 @@ dereference)], the following attribute is defined:
3/4
X'Valid
- {AI05-0153-3AI05-0153-3} {AI12-0071-1AI12-0071-1} Yields
- True if and only if the object denoted by X is normal,
- has a valid representation, and then, if the preceding
- conditions hold, the value of X also satisfies the
- predicates of the nominal subtype of X. The value of this
- attribute is of the predefined type Boolean.
+ {<AI05-0153-3AI05-0153-3>} {<AI12-0071-1AI12-0071-1>}
+ Yields True if and only if the object denoted by X is
+ normal, has a valid representation, and then, if the
+ preceding conditions hold, the value of X also satisfies
+ the predicates of the nominal subtype of X. The value of
+ this attribute is of the predefined type Boolean.
3.a
Ramification: Having checked that X'Valid is True, it is safe
@@ -64429,7 +64654,7 @@ X'Valid
* use of an object whose Address has been specified.
12/4
- 23 {AI12-0071-1AI12-0071-1} Determining whether X is normal and
+ 23 {<AI12-0071-1AI12-0071-1>} Determining whether X is normal and
has a valid representation as part of the evaluation of X'Valid is
not considered to include an evaluation of X; hence, it is not an
error to check the validity of an object that is invalid or
@@ -64438,7 +64663,7 @@ X'Valid
has been determined that X has a valid representation.
13/4
- {AI12-0071-1AI12-0071-1} If X is volatile, the evaluation of
+ {<AI12-0071-1AI12-0071-1>} If X is volatile, the evaluation of
X'Valid is considered a read of X.
13.a/4
@@ -64448,12 +64673,13 @@ X'Valid
subtypes as the value of the object is required.
14/2
- 24 {AI95-00426-01AI95-00426-01} The Valid attribute may be used to
- check the result of calling an instance of Unchecked_Conversion (or
- any other operation that can return invalid values). However, an
- exception handler should also be provided because implementations
- are permitted to raise Constraint_Error or Program_Error if they
- detect the use of an invalid representation (see *note 13.9.1::).
+ 24 {<AI95-00426-01AI95-00426-01>} The Valid attribute may be used
+ to check the result of calling an instance of Unchecked_Conversion
+ (or any other operation that can return invalid values). However,
+ an exception handler should also be provided because
+ implementations are permitted to raise Constraint_Error or
+ Program_Error if they detect the use of an invalid representation
+ (see *note 13.9.1::).
14.a
Ramification: If X is of an enumeration type with a
@@ -64476,7 +64702,7 @@ X'Valid
subcomponents.
14.c/2
- This paragraph was deleted.{AI95-00114-01AI95-00114-01}
+ <This paragraph was deleted.>{<AI95-00114-01AI95-00114-01>}
_Extensions to Ada 83_
@@ -64486,7 +64712,7 @@ X'Valid
_Wording Changes from Ada 95_
14.e/2
- {AI95-00426-01AI95-00426-01} Added a note explaining that
+ {<AI95-00426-01AI95-00426-01>} Added a note explaining that
handlers for Constraint_Error and Program_Error are needed in
the general case of testing for validity. (An implementation
could document cases where these are not necessary, but there
@@ -64495,14 +64721,14 @@ X'Valid
_Wording Changes from Ada 2005_
14.f/3
- {AI05-0153-3AI05-0153-3} The validity check now also includes
- a check of the predicate aspects (see *note 3.2.4::), if any,
- of the subtype of the object.
+ {<AI05-0153-3AI05-0153-3>} The validity check now also
+ includes a check of the predicate aspects (see *note 3.2.4::),
+ if any, of the subtype of the object.
_Wording Changes from Ada 2012_
14.g/4
- {AI12-0071-1AI12-0071-1} Corrigendum: Updated wording of the
+ {<AI12-0071-1AI12-0071-1>} Corrigendum: Updated wording of the
attributes X'Valid to use the new term "satisfies the
predicates" (see *note 3.2.4::). Also updated the notes to
make sense when evaluating predicates and testing validity of
@@ -64531,10 +64757,10 @@ X'Unchecked_Access
3.10.2::) apply also to X'Unchecked_Access, except that,
for the purposes of accessibility rules and checks, it is
as if X were declared immediately within a library
- package.
+ package.
3.a/3
- Ramification: {AI05-0005-1AI05-0005-1} We say "rules and
+ Ramification: {<AI05-0005-1AI05-0005-1>} We say "rules and
semantics" here so that library-level accessibility applies to
the value created by X'Unchecked_Access as well as to the
checks needed for the attribute itself. This means that any
@@ -64567,7 +64793,7 @@ X'Unchecked_Access
26 There is no Unchecked_Access attribute for subprograms.
5.a/2
- Reason: {AI95-00254-01AI95-00254-01} Such an attribute would
+ Reason: {<AI95-00254-01AI95-00254-01>} Such an attribute would
allow unsafe "downward closures", where an access value
designating a more nested subprogram is passed to a less
nested subprogram. (Anonymous access-to-subprogram parameters
@@ -64606,10 +64832,10 @@ Unchecked_Deallocation return storage to the pool.
Several access types
can share the same pool.]
2/2
-{AI95-00435-01AI95-00435-01} [A storage pool is a variable of a type in
-the class rooted at Root_Storage_Pool, which is an abstract limited
-controlled type. By default, the implementation chooses a standard
-storage pool for each access-to-object type. The user may define new
+{<AI95-00435-01AI95-00435-01>} [A storage pool is a variable of a type
+in the class rooted at Root_Storage_Pool, which is an abstract limited
+controlled type. By default, the implementation chooses a <standard
+storage pool> for each access-to-object type. The user may define new
pool types, and may override the choice of pool for an access-to-object
type by specifying Storage_Pool for the type.]
@@ -64658,7 +64884,7 @@ The following language-defined library package exists:
pragma Preelaborate(System.Storage_Pools);
6/2
- {AI95-00161-01AI95-00161-01} type Root_Storage_Pool is
+ {<AI95-00161-01AI95-00161-01>} type Root_Storage_Pool is
abstract new Ada.Finalization.Limited_Controlled with private;
pragma Preelaborable_Initialization(Root_Storage_Pool);
@@ -64682,7 +64908,7 @@ The following language-defined library package exists:
10
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Storage_Pools;
10.a
@@ -64691,9 +64917,9 @@ The following language-defined library package exists:
needed, it can be ignored.
11
-A storage pool type (or pool type) is a descendant of Root_Storage_Pool.
-The elements of a storage pool are the objects allocated in the pool by
-allocators.
+A <storage pool type> (or <pool type>) is a descendant of
+Root_Storage_Pool. The <elements> of a storage pool are the objects
+allocated in the pool by allocators.
11.a
Discussion: In most cases, an element corresponds to a single
@@ -64702,8 +64928,8 @@ allocators.
memory block with a given pool element.
12/2
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI95-00435-01AI95-00435-01} For every access-to-object subtype S, the
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI95-00435-01AI95-00435-01>} For every access-to-object subtype S, the
following representation attributes are defined:
13
@@ -64717,7 +64943,7 @@ S'Storage_Size
Storage_Size(S'Storage_Pool)[, which is intended to be a
measure of the number of storage elements reserved for
the pool.] The type of this attribute is
- universal_integer.
+ <universal_integer>.
14.a
Ramification: Storage_Size is also defined for task subtypes
@@ -64743,12 +64969,12 @@ S0310.); the name in a Storage_Pool clause shall
denote a variable.
for allocations for an access type.
16/3
-{AI05-0107-1AI05-0107-1} {AI05-0111-3AI05-0111-3}
-{AI05-0116-1AI05-0116-1} An allocator of a type T that does not support
-subpools allocates storage from T's storage pool. If the storage pool
-is a user-defined object, then the storage is allocated by calling
-Allocate as described below. Allocators for types that support subpools
-are described in *note 13.11.4::.
+{<AI05-0107-1AI05-0107-1>} {<AI05-0111-3AI05-0111-3>}
+{<AI05-0116-1AI05-0116-1>} An allocator of a type <T> that does not
+support subpools allocates storage from <T>'s storage pool. If the
+storage pool is a user-defined object, then the storage is allocated by
+calling Allocate as described below. Allocators for types that support
+subpools are described in *note 13.11.4::.
16.a
Ramification: If the implementation chooses to represent the
@@ -64759,30 +64985,31 @@ are described in *note 13.11.4::.
calling the specified Allocate procedure.
16.b/3
- This paragraph was deleted.{AI05-0107-1AI05-0107-1}
+ <This paragraph was deleted.>{<AI05-0107-1AI05-0107-1>}
16.b.1/1
- {8652/01118652/0111} {AI95-00103-01AI95-00103-01} If D (the
- designated type of T) includes subcomponents of other access
- types, they will be allocated from the storage pools for those
- types, even if those allocators are executed as part of the
- allocator of T (as part of the initialization of the object).
- For instance, an access-to-task type TT may allocate the data
- structures used to implement the task value from other storage
- pools. (In particular, the task stack does not necessarily
- need to be allocated from the storage pool for TT.)
+ {<8652/01118652/0111>} {<AI95-00103-01AI95-00103-01>} If <D>
+ (the designated type of <T>) includes subcomponents of other
+ access types, they will be allocated from the storage pools
+ for those types, even if those allocators are executed as part
+ of the allocator of <T> (as part of the initialization of the
+ object). For instance, an access-to-task type <TT> may
+ allocate the data structures used to implement the task value
+ from other storage pools. (In particular, the task stack does
+ not necessarily need to be allocated from the storage pool for
+ <TT>.)
17
If Storage_Pool is not specified for a type defined by an
access_to_object_definition, then the implementation chooses a standard
-storage pool for it in an implementation-defined manner. In this case,
+storage pool for it in an implementation-defined manner. In this case,
the exception Storage_Error is raised by an allocator if there is not
enough storage. It is implementation defined whether or not the
implementation provides user-accessible names for the standard pool
type(s).
17.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
17.a.1/2
Discussion: The manner of choosing a storage pool is covered
@@ -64794,11 +65021,12 @@ type(s).
provides user-accessible names for the standard pool type(s).
17.c/2
- Ramification: {AI95-00230-01AI95-00230-01} An access-to-object
- type defined by a derived_type_definition inherits its pool
- from its parent type, so all access-to-object types in the
- same derivation class share the same pool. Hence the "defined
- by an access_to_object_definition" wording above.
+ Ramification: {<AI95-00230-01AI95-00230-01>} An
+ access-to-object type defined by a derived_type_definition
+ inherits its pool from its parent type, so all
+ access-to-object types in the same derivation class share the
+ same pool. Hence the "defined by an
+ access_to_object_definition" wording above.
17.d
There is no requirement that all storage pools be implemented
@@ -64806,19 +65034,19 @@ type(s).
returns a pointer to a contiguous block of memory).
18/4
-{AI12-0043-1AI12-0043-1} If Storage_Size is specified for an access type
-T, an implementation-defined pool P is used for the type. The
-Storage_Size of P is at least that requested, and the storage for P is
-reclaimed when the master containing the declaration of the access type
-is left. If the implementation cannot satisfy the request, Storage_Error
-is raised at the freezing point of type T. The storage pool P is used
-only for allocators returning type T or other access types specified to
-use T'Storage_Pool. Storage_Error is raised by an allocator returning
-such a type if the storage space of P is exhausted (additional memory is
-not allocated).
+{<AI12-0043-1AI12-0043-1>} If Storage_Size is specified for an access
+type <T>, an implementation-defined pool <P> is used for the type. The
+Storage_Size of <P> is at least that requested, and the storage for <P>
+is reclaimed when the master containing the declaration of the access
+type is left. If the implementation cannot satisfy the request,
+Storage_Error is raised at the freezing point of type <T>. The storage
+pool <P> is used only for allocators returning type <T> or other access
+types specified to use <T>'Storage_Pool. Storage_Error is raised by an
+allocator returning such a type if the storage space of <P> is exhausted
+(additional memory is not allocated).
18.1/4
-{AI12-0043-1AI12-0043-1} If neither Storage_Pool nor Storage_Size are
+{<AI12-0043-1AI12-0043-1>} If neither Storage_Pool nor Storage_Size are
specified, then the meaning of Storage_Size is implementation defined.
18.a/2
@@ -64879,13 +65107,13 @@ in any other manner, then the program execution is
erroneous.
_Implementation Requirements_
21.1/3
-{AI05-0107-1AI05-0107-1} {AI05-0262-1AI05-0262-1} The Allocate procedure
-of a user-defined storage pool object P may be called by the
-implementation only to allocate storage for a type T whose pool is P,
-only at the following points:
+{<AI05-0107-1AI05-0107-1>} {<AI05-0262-1AI05-0262-1>} The Allocate
+procedure of a user-defined storage pool object <P> may be called by the
+implementation only to allocate storage for a type <T> whose pool is
+<P>, only at the following points:
21.2/3
- * During the execution of an allocator of type T;
+ * During the execution of an allocator of type <T>;
21.a/3
Ramification: This includes during the evaluation of the
@@ -64896,7 +65124,7 @@ only at the following points:
21.3/3
* During the execution of a return statement for a function whose
- result is built-in-place in the result of an allocator of type T;
+ result is built-in-place in the result of an allocator of type <T>;
21.b/3
Reason: We need this bullet as well as the preceding one in
@@ -64908,7 +65136,7 @@ only at the following points:
21.4/3
* During the execution of an assignment operation with a target of an
- allocated object of type T with a part that has an unconstrained
+ allocated object of type <T> with a part that has an unconstrained
discriminated subtype with defaults.
21.c/3
@@ -64923,20 +65151,21 @@ only at the following points:
allowed and are not bound by any of the rules found here.
21.5/3
-{AI05-0107-1AI05-0107-1} {AI05-0116-1AI05-0116-1}
-{AI05-0193-1AI05-0193-1} {AI05-0262-1AI05-0262-1}
-{AI05-0269-1AI05-0269-1} For each of the calls of Allocate described
-above, P (equivalent to T'Storage_Pool) is passed as the Pool parameter.
-The Size_In_Storage_Elements parameter indicates the number of storage
-elements to be allocated, and is no more than
-D'Max_Size_In_Storage_Elements, where D is the designated subtype of T.
-The Alignment parameter is a nonzero integral multiple of D'Alignment if
-D is a specific type, and otherwise is a nonzero integral multiple of
-the alignment of the specific type identified by the tag of the object
-being created; it is unspecified if there is no such value. The
-Alignment parameter is no more than D'Max_Alignment_For_Allocation. The
-result returned in the Storage_Address parameter is used as the address
-of the allocated storage, which is a contiguous block of memory of
+{<AI05-0107-1AI05-0107-1>} {<AI05-0116-1AI05-0116-1>}
+{<AI05-0193-1AI05-0193-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0269-1AI05-0269-1>} For each of the calls of Allocate described
+above, <P> (equivalent to <T>'Storage_Pool) is passed as the Pool
+parameter. The Size_In_Storage_Elements parameter indicates the number
+of storage elements to be allocated, and is no more than
+<D>'Max_Size_In_Storage_Elements, where <D> is the designated subtype of
+<T>. The Alignment parameter is a nonzero integral multiple of
+<D>'Alignment if <D> is a specific type, and otherwise is a nonzero
+integral multiple of the alignment of the specific type identified by
+the tag of the object being created; it is unspecified if there is no
+such value. The Alignment parameter is no more than
+<D>'Max_Alignment_For_Allocation. The result returned in the
+Storage_Address parameter is used as the address of the allocated
+storage, which is a contiguous block of memory of
Size_In_Storage_Elements storage elements. [Any exception propagated by
Allocate is propagated by the construct that contained the call.]
@@ -64950,8 +65179,8 @@ Allocate is propagated by the construct that contained
the call.]
if the alignment of the specific type is zero.
21.6/3
-{AI05-0107-1AI05-0107-1} The number of calls to Allocate needed to
-implement an allocator for any particular type is unspecified. The
+{<AI05-0107-1AI05-0107-1>} The number of calls to Allocate needed to
+implement an allocator for any particular type is unspecified. The
number of calls to Deallocate needed to implement an instance of
Unchecked_Deallocation (see *note 13.11.2::) for any particular object
is the same as the number of Allocate calls for that object.
@@ -64962,10 +65191,10 @@ is the same as the number of Allocate calls for that
object.
calls to Deallocate.
21.h/3
- To be honest: {AI05-0005-1AI05-0005-1} The number of calls to
- Deallocate from all sources for an object always will be the
- same as the number of calls to Allocate from all sources for
- that object. However, in unusual cases, not all of those
+ To be honest: {<AI05-0005-1AI05-0005-1>} The number of calls
+ to Deallocate from all sources for an object always will be
+ the same as the number of calls to Allocate from all sources
+ for that object. However, in unusual cases, not all of those
Deallocate calls may be made by an instance of
Unchecked_Deallocation. Specifically, in the unusual case of
assigning to an object of a mutable variant record type such
@@ -64975,24 +65204,24 @@ is the same as the number of Allocate calls for that
object.
21.i/3
Ramification: We do not define the relative order of multiple
calls used to deallocate the same object -- that is, if the
- allocator allocated two pieces x and y, then an instance of
- Unchecked_Deallocation might deallocate x and then y, or it
- might deallocate y and then x.
+ allocator allocated two pieces <x> and <y>, then an instance
+ of Unchecked_Deallocation might deallocate <x> and then <y>,
+ or it might deallocate <y> and then <x>.
21.7/3
-{AI05-0107-1AI05-0107-1} The Deallocate procedure of a user-defined
-storage pool object P may be called by the implementation to deallocate
-storage for a type T whose pool is P only at the places when an Allocate
-call is allowed for P, during the execution of an instance of
-Unchecked_Deallocation for T, or as part of the finalization of the
-collection of T. For such a call of Deallocate, P (equivalent to
-T'Storage_Pool) is passed as the Pool parameter. The value of the
-Storage_Address parameter for a call to Deallocate is the value returned
-in the Storage_Address parameter of the corresponding successful call to
-Allocate. The values of the Size_In_Storage_Elements and Alignment
-parameters are the same values passed to the corresponding Allocate
-call. Any exception propagated by Deallocate is propagated by the
-construct that contained the call.
+{<AI05-0107-1AI05-0107-1>} The Deallocate procedure of a user-defined
+storage pool object <P> may be called by the implementation to
+deallocate storage for a type <T> whose pool is <P> only at the places
+when an Allocate call is allowed for <P>, during the execution of an
+instance of Unchecked_Deallocation for <T>, or as part of the
+finalization of the collection of <T>. For such a call of Deallocate,
+<P> (equivalent to <T>'Storage_Pool) is passed as the Pool parameter.
+The value of the Storage_Address parameter for a call to Deallocate is
+the value returned in the Storage_Address parameter of the corresponding
+successful call to Allocate. The values of the Size_In_Storage_Elements
+and Alignment parameters are the same values passed to the corresponding
+Allocate call. Any exception propagated by Deallocate is propagated by
+the construct that contained the call.
21.j/3
Reason: We allow Deallocate to be called anywhere that
@@ -65015,7 +65244,7 @@ implementation shall document how the standard storage
pool is chosen,
and how storage is allocated by standard storage pools.
22.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
22.b/2
Documentation Requirement: The set of values that a
@@ -65084,24 +65313,24 @@ of individual objects.
particular number of allocations that is guaranteed to fail.
25/2
-{AI95-00230-01AI95-00230-01} The storage pool used for an allocator of
+{<AI95-00230-01AI95-00230-01>} The storage pool used for an allocator of
an anonymous access type should be determined as follows:
25.1/2
- * {AI95-00230-01AI95-00230-01} {AI95-00416-01AI95-00416-01} If the
- allocator is defining a coextension (see *note 3.10.2::) of an
+ * {<AI95-00230-01AI95-00230-01>} {<AI95-00416-01AI95-00416-01>} If
+ the allocator is defining a coextension (see *note 3.10.2::) of an
object being created by an outer allocator, then the storage pool
used for the outer allocator should also be used for the
coextension;
25.2/2
- * {AI95-00230-01AI95-00230-01} For other access discriminants and
+ * {<AI95-00230-01AI95-00230-01>} For other access discriminants and
access parameters, the storage pool should be created at the point
of the allocator, and be reclaimed when the allocated object
becomes inaccessible;
25.3/3
- * {AI05-0051-1AI05-0051-1} If the allocator defines the result of a
+ * {<AI05-0051-1AI05-0051-1>} If the allocator defines the result of a
function with an access result, the storage pool is determined as
though the allocator were in place of the call of the function. If
the call is the operand of a type conversion, the storage pool is
@@ -65110,7 +65339,7 @@ an anonymous access type should be determined as
follows:
this rule is applied recursively;
25.4/2
- * {AI95-00230-01AI95-00230-01} Otherwise, a default storage pool
+ * {<AI95-00230-01AI95-00230-01>} Otherwise, a default storage pool
should be created at the point where the anonymous access type is
elaborated; such a storage pool need not support deallocation of
individual objects.
@@ -65125,7 +65354,7 @@ an anonymous access type should be determined as
follows:
objects.
25.a/2
- Implementation Note: {AI95-00230-01AI95-00230-01} For access
+ Implementation Note: {<AI95-00230-01AI95-00230-01>} For access
parameters and access discriminants, the "storage pool" for an
anonymous access type would not normally exist as a separate
entity. Instead, the designated object of the allocator would
@@ -65136,7 +65365,7 @@ an anonymous access type should be determined as
follows:
aggregates is typically managed.
25.b/2
- {AI95-00230-01AI95-00230-01} For other sorts of anonymous
+ {<AI95-00230-01AI95-00230-01>} For other sorts of anonymous
access types, this implementation is not possible in general,
as the accessibility of the anonymous access type is that of
its declaration, while the allocator could be more nested. In
@@ -65246,34 +65475,34 @@ pool.
will probably not work.
38/3
-{AI05-0111-3AI05-0111-3} As usual, a derivative of Root_Storage_Pool may
-define additional operations. For example, consider the
+{<AI05-0111-3AI05-0111-3>} As usual, a derivative of Root_Storage_Pool
+may define additional operations. For example, consider the
Mark_Release_Pool_Type defined in *note 13.11.6::, that has two
additional operations, Mark and Release, the following is a possible
use:
39/3
- {8652/00418652/0041} {AI95-00066-01AI95-00066-01}
{AI05-0111-3AI05-0111-3} type Mark_Release_Pool_Type
+ {<8652/00418652/0041>} {<AI95-00066-01AI95-00066-01>}
{<AI05-0111-3AI05-0111-3>} type Mark_Release_Pool_Type
(Pool_Size : Storage_Elements.Storage_Count)
is new Subpools.Root_Storage_Pool_With_Subpools with private;
- -- As defined in package MR_Pool, see *note 13.11.6::
+ -- <As defined in package MR_Pool, see *note 13.11.6::>
40
...
41/3
- {AI05-0111-3AI05-0111-3} Our_Pool : Mark_Release_Pool_Type (Pool_Size =>
2000);
- My_Mark : MR_Pool.Subpool_Handle; -- See *note 13.11.6::
+ {<AI05-0111-3AI05-0111-3>} Our_Pool : Mark_Release_Pool_Type (Pool_Size
=> 2000);
+ My_Mark : MR_Pool.Subpool_Handle; -- <See *note 13.11.6::>
42/3
- {AI05-0111-3AI05-0111-3} type Acc is access ...;
+ {<AI05-0111-3AI05-0111-3>} type Acc is access ...;
for Acc'Storage_Pool use Our_Pool;
...
43/3
- {AI05-0111-3AI05-0111-3} My_Mark := Mark(Our_Pool);
- ... -- Allocate objects using "new (My_Mark) Designated(...)".
- Release(My_Mark); -- Finalize objects and reclaim storage.
+ {<AI05-0111-3AI05-0111-3>} My_Mark := Mark(Our_Pool);
+ ... --< Allocate objects using "new (My_Mark) Designated(...)".>
+ Release(My_Mark); --< Finalize objects and reclaim storage.>
_Extensions to Ada 83_
@@ -65283,7 +65512,7 @@ use:
_Wording Changes from Ada 83_
43.b/3
- {AI05-0005-1AI05-0005-1} {AI05-0190-1AI05-0190-1} Ada 83
+ {<AI05-0005-1AI05-0005-1>} {<AI05-0190-1AI05-0190-1>} Ada 83
originally introduced the concept called a "collection," which
is similar to what we call a storage pool. All access types
in the same derivation class share the same collection. Ada
@@ -65303,7 +65532,7 @@ use:
_Incompatibilities With Ada 95_
43.d/2
- {AI95-00435-01AI95-00435-01} Amendment Correction: Storage
+ {<AI95-00435-01AI95-00435-01>} Amendment Correction: Storage
pools (and Storage_Size) are not defined for
access-to-subprogram types. The original Ada 95 wording
defined the attributes, but said nothing about their values.
@@ -65315,7 +65544,7 @@ use:
_Extensions to Ada 95_
43.e/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added
pragma Preelaborable_Initialization to type Root_Storage_Pool,
so that extensions of it can be used to declare
default-initialized objects in preelaborated units.
@@ -65323,12 +65552,12 @@ use:
_Wording Changes from Ada 95_
43.f/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Added wording to specify that these are representation
- attributes.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Added wording to specify that these are
+ representation attributes.
43.g/2
- {AI95-00230-01AI95-00230-01} {AI95-00416-01AI95-00416-01}
+ {<AI95-00230-01AI95-00230-01>} {<AI95-00416-01AI95-00416-01>}
Added wording to clarify that an allocator for a coextension
nested inside an outer allocator shares the pool with the
outer allocator.
@@ -65336,27 +65565,27 @@ use:
_Wording Changes from Ada 2005_
43.h/3
- {AI05-0051-1AI05-0051-1} Correction: Added the missing
+ {<AI05-0051-1AI05-0051-1>} Correction: Added the missing
definition of the storage pool of an allocator for an
anonymous access result type.
43.i/3
- {AI05-0107-1AI05-0107-1} Correction: Clarified when an
+ {<AI05-0107-1AI05-0107-1>} Correction: Clarified when an
implementation is allowed to call Allocate and Deallocate, and
the requirements on such calls.
43.j/3
- {AI05-0111-3AI05-0111-3} Added wording to support subpools and
- refer to the subpool example, see *note 13.11.4::.
+ {<AI05-0111-3AI05-0111-3>} Added wording to support subpools
+ and refer to the subpool example, see *note 13.11.4::.
43.k/3
- {AI05-0116-1AI05-0116-1} Correction: Added wording to specify
- that the alignment for an allocator with a class-wide
+ {<AI05-0116-1AI05-0116-1>} Correction: Added wording to
+ specify that the alignment for an allocator with a class-wide
designated type comes from the specific type that is
allocated.
43.l/3
- {AI05-0193-1AI05-0193-1} Added wording to allow larger
+ {<AI05-0193-1AI05-0193-1>} Added wording to allow larger
alignments for calls to Allocate made by allocators, up to
Max_Alignment_For_Allocation. This eases implementation in
some cases.
@@ -65364,7 +65593,7 @@ use:
_Wording Changes from Ada 2012_
43.m/4
- {AI12-0043-1AI12-0043-1} Corrigendum: Tightened up the
+ {<AI12-0043-1AI12-0043-1>} Corrigendum: Tightened up the
description of the implementation-defined pool used when
Storage_Size is specified. This is not intended to change any
implementation.
@@ -65385,24 +65614,25 @@ File: aarm2012.info, Node: 13.11.1, Next: 13.11.2,
Up: 13.11
-------------------------------------
1/3
-{AI05-0193-1AI05-0193-1} [The Max_Size_In_Storage_Elements and
+{<AI05-0193-1AI05-0193-1>} [The Max_Size_In_Storage_Elements and
Max_Alignment_For_Allocation attributes may be useful in writing
user-defined pool types.]
_Static Semantics_
2/3
-{AI05-0193-1AI05-0193-1} For every subtype S, the following attributes
+{<AI05-0193-1AI05-0193-1>} For every subtype S, the following attributes
are defined:
3/3
S'Max_Size_In_Storage_Elements
- {AI95-00256-01AI95-00256-01} {AI95-00416-01AI95-00416-01}
- {AI05-0193-1AI05-0193-1} Denotes the maximum value for
- Size_In_Storage_Elements that could be requested by the
- implementation via Allocate for an access type whose
- designated subtype is S. The value of this attribute is
- of type universal_integer.
+ {<AI95-00256-01AI95-00256-01>}
+ {<AI95-00416-01AI95-00416-01>} {<AI05-0193-1AI05-0193-1>}
+ Denotes the maximum value for Size_In_Storage_Elements
+ that could be requested by the implementation via
+ Allocate for an access type whose designated subtype is
+ S. The value of this attribute is of type
+ <universal_integer>.
3.a
Ramification: If S is an unconstrained array subtype, or an
@@ -65411,21 +65641,21 @@ S'Max_Size_In_Storage_Elements
4/3
S'Max_Alignment_For_Allocation
- {AI05-0193-1AI05-0193-1} Denotes the maximum value for
+ {<AI05-0193-1AI05-0193-1>} Denotes the maximum value for
Alignment that could be requested by the implementation
via Allocate for an access type whose designated subtype
is S. The value of this attribute is of type
- universal_integer.
+ <universal_integer>.
5/3
-{AI05-0193-1AI05-0193-1} For a type with access discriminants, if the
+{<AI05-0193-1AI05-0193-1>} For a type with access discriminants, if the
implementation allocates space for a coextension in the same pool as
that of the object having the access discriminant, then these attributes
account for any calls on Allocate that could be performed to provide
space for such coextensions.
5.a/3
- Reason: {AI05-0193-1AI05-0193-1} The values of these
+ Reason: {<AI05-0193-1AI05-0193-1>} The values of these
attributes should reflect only the calls that might be made to
the pool specified for an access type with designated type S.
Thus, if the coextensions would normally be allocated from a
@@ -65436,7 +65666,7 @@ space for such coextensions.
used to allocate the coextensions.
5.b/3
- Ramification: {AI05-0193-1AI05-0193-1} Coextensions of
+ Ramification: {<AI05-0193-1AI05-0193-1>} Coextensions of
coextensions of this type (and so on) are included in the
values of these attributes if they are allocated from the same
pool.
@@ -65444,14 +65674,14 @@ space for such coextensions.
_Wording Changes from Ada 95_
5.c/2
- {AI95-00256-01AI95-00256-01} Corrected the wording so that a
+ {<AI95-00256-01AI95-00256-01>} Corrected the wording so that a
fortune-telling compiler that can see the future execution of
the program is not required.
_Extensions to Ada 2005_
5.d/3
- {AI05-0193-1AI05-0193-1} The Max_Alignment_For_Allocation
+ {<AI05-0193-1AI05-0193-1>} The Max_Alignment_For_Allocation
attribute is new.
@@ -65471,7 +65701,7 @@ procedure Unchecked_Deallocation.]
The following language-defined generic library procedure exists:
3/3
- {AI05-0229-1AI05-0229-1} generic
+ {<AI05-0229-1AI05-0229-1>} generic
type Object(<>) is limited private;
type Name is access Object;
procedure Ada.Unchecked_Deallocation(X : in out Name)
@@ -65479,19 +65709,20 @@ The following language-defined generic library
procedure exists:
pragma Preelaborate(Ada.Unchecked_Deallocation);
3.a/3
- Reason: {AI05-0229-1AI05-0229-1} The aspect Convention implies
- that the attribute Access is not allowed for instances of
- Unchecked_Deallocation.
+ Reason: {<AI05-0229-1AI05-0229-1>} The aspect Convention
+ implies that the attribute Access is not allowed for instances
+ of Unchecked_Deallocation.
_Legality Rules_
3.1/3
-{AI05-0157-1AI05-0157-1} A call on an instance of Unchecked_Deallocation
-is illegal if the actual access type of the instance is a type for which
-the Storage_Size has been specified by a static expression with value
-zero or is defined by the language to be zero. In addition to the places
-where Legality Rules normally apply (see *note 12.3::), this rule
-applies also in the private part of an instance of a generic unit.
+{<AI05-0157-1AI05-0157-1>} A call on an instance of
+Unchecked_Deallocation is illegal if the actual access type of the
+instance is a type for which the Storage_Size has been specified by a
+static expression with value zero or is defined by the language to be
+zero. In addition to the places where Legality Rules normally apply
+(see *note 12.3::), this rule applies also in the private part of an
+instance of a generic unit.
3.b/3
Discussion: This rule is the same as the rule for allocators.
@@ -65508,7 +65739,7 @@ Given an instance of Unchecked_Deallocation declared as
follows:
5
procedure Free is
new Ada.Unchecked_Deallocation(
- object_subtype_name, access_to_variable_subtype_name);
+ <object_subtype_name>, <access_to_variable_subtype_name>);
6
Procedure Free has the following effect:
@@ -65520,10 +65751,10 @@ Procedure Free has the following effect:
2. Free(X), when X is already equal to null, has no effect.
9/3
- 3. {AI95-00416-01AI95-00416-01} {AI05-0107-1AI05-0107-1} Free(X),
- when X is not equal to null first performs finalization of the
- object designated by X (and any coextensions of the object -- see
- *note 3.10.2::), as described in *note 7.6.1::. It then
+ 3. {<AI95-00416-01AI95-00416-01>} {<AI05-0107-1AI05-0107-1>}
+ Free(X), when X is not equal to null first performs finalization of
+ the object designated by X (and any coextensions of the object --
+ see *note 3.10.2::), as described in *note 7.6.1::. It then
deallocates the storage occupied by the object designated by X (and
any coextensions). If the storage pool is a user-defined object,
then the storage is deallocated by calling Deallocate as described
@@ -65531,11 +65762,11 @@ Procedure Free has the following effect:
freed contains tasks, the object might not be deallocated.
9.a/3
- Ramification: {AI05-0107-1AI05-0107-1} Free calls only the
+ Ramification: {<AI05-0107-1AI05-0107-1>} Free calls only the
specified Deallocate procedure to do deallocation.
10/4
-{AI95-00416-01AI95-00416-01} {AI12-0148-1AI12-0148-1} After the
+{<AI95-00416-01AI95-00416-01>} {<AI12-0148-1AI12-0148-1>} After the
finalization step of Free(X), the object designated by X, and any
subcomponents (and coextensions) thereof, no longer exist; their storage
can be reused for other purposes.
@@ -65576,8 +65807,8 @@ task) is not reclaimed prior to task termination.
Ramification: The storage might never be reclaimed.
15.1/4
-{AI12-0148-1AI12-0148-1} An access value that designates a nonexistent
-object is called a dangling reference.
+{<AI12-0148-1AI12-0148-1>} An access value that designates a nonexistent
+object is called a <dangling reference>.
15.b/4
Discussion: These can result from use of
@@ -65588,11 +65819,11 @@ object is called a dangling reference.
precedence.
15.2/4
-{AI12-0148-1AI12-0148-1} [If a dangling reference is dereferenced
+{<AI12-0148-1AI12-0148-1>} [If a dangling reference is dereferenced
(implicitly or explicitly), execution is erroneous (see below).] If
there is no explicit or implicit dereference, then it is a bounded error
to evaluate an expression whose result is a dangling reference. If the
-error is detected, either Constraint_Error or Program_Error is raised.
+error is detected, either Constraint_Error or Program_Error is raised.
Otherwise, execution proceeds normally, but with the possibility that
the access value designates some other existing object.
@@ -65638,16 +65869,16 @@ the access value designates some other existing
object.
_Erroneous Execution_
16/3
-{AI05-0033-1AI05-0033-1} {AI05-0262-1AI05-0262-1} Evaluating a name that
-denotes a nonexistent object, or a protected subprogram or subprogram
-renaming whose associated object (if any) is nonexistent, is erroneous.
-The execution of a call to an instance of Unchecked_Deallocation is
-erroneous if the object was created other than by an allocator for an
-access type whose pool is Name'Storage_Pool.
+{<AI05-0033-1AI05-0033-1>} {<AI05-0262-1AI05-0262-1>} Evaluating a name
+that denotes a nonexistent object, or a protected subprogram or
+subprogram renaming whose associated object (if any) is nonexistent, is
+erroneous. The execution of a call to an instance of
+Unchecked_Deallocation is erroneous if the object was created other than
+by an allocator for an access type whose pool is Name'Storage_Pool.
16.a/3
- Reason: {AI05-0033-1AI05-0033-1} {AI05-0262-1AI05-0262-1} The
- part about a protected subprogram is intended to cover the
+ Reason: {<AI05-0033-1AI05-0033-1>} {<AI05-0262-1AI05-0262-1>}
+ The part about a protected subprogram is intended to cover the
case of an access-to-protected-subprogram where the associated
object has been deallocated. The part about a subprogram
renaming is intended to cover the case of a renaming of a
@@ -65657,7 +65888,7 @@ access type whose pool is Name'Storage_Pool.
deallocated.
16.b/3
- Ramification: {AI05-0157-1AI05-0157-1} This text does not
+ Ramification: {<AI05-0157-1AI05-0157-1>} This text does not
cover the case of a name that contains a null access value, as
null does not denote an object (rather than denoting a
nonexistent object).
@@ -65673,16 +65904,17 @@ For a standard storage pool, Free should actually
reclaim the storage.
storage.
17.a/2
- Ramification: {AI95-00114-01AI95-00114-01} This is not a
+ Ramification: {<AI95-00114-01AI95-00114-01>} This is not a
testable property, since we do not know how much storage is
used by a given pool element, nor whether fragmentation can
occur.
17.1/3
-{AI05-0157-1AI05-0157-1} A call on an instance of Unchecked_Deallocation
-with a nonnull access value should raise Program_Error if the actual
-access type of the instance is a type for which the Storage_Size has
-been specified to be zero or is defined by the language to be zero.
+{<AI05-0157-1AI05-0157-1>} A call on an instance of
+Unchecked_Deallocation with a nonnull access value should raise
+Program_Error if the actual access type of the instance is a type for
+which the Storage_Size has been specified to be zero or is defined by
+the language to be zero.
17.a.1/3
Implementation Advice: A call on an instance of
@@ -65714,7 +65946,7 @@ been specified to be zero or is defined by the language
to be zero.
_Wording Changes from Ada 95_
19.a/2
- {AI95-00416-01AI95-00416-01} The rules for coextensions are
+ {<AI95-00416-01AI95-00416-01>} The rules for coextensions are
clarified (mainly by adding that term). In theory, this
reflects no change from Ada 95 (coextensions existed in Ada
95, they just didn't have a name).
@@ -65722,21 +65954,21 @@ been specified to be zero or is defined by the
language to be zero.
_Wording Changes from Ada 2005_
19.b/3
- {AI05-0033-1AI05-0033-1} Correction: Added a rule that using
+ {<AI05-0033-1AI05-0033-1>} Correction: Added a rule that using
an access-to-protected-subprogram is erroneous if the
associated object no longer exists. It is hard to imagine an
alternative meaning here, and this has no effect on correct
programs.
19.c/3
- {AI05-0107-1AI05-0107-1} Correction: Moved the requirements on
- an implementation-generated call to Deallocate to *note
+ {<AI05-0107-1AI05-0107-1>} Correction: Moved the requirements
+ on an implementation-generated call to Deallocate to *note
13.11::, in order to put all of the rules associated with
implementation-generated calls to Allocate and Deallocate
together.
19.d/3
- {AI05-0157-1AI05-0157-1} Correction: Added wording so that
+ {<AI05-0157-1AI05-0157-1>} Correction: Added wording so that
calling an instance of Unchecked_Deallocation is treated
similarly to allocators for access types where allocators
would be banned.
@@ -65744,7 +65976,7 @@ been specified to be zero or is defined by the language
to be zero.
_Inconsistencies With Ada 2012_
19.e/4
- {AI12-0148-1AI12-0148-1} Corrigendum: Defined a "dangling
+ {<AI12-0148-1AI12-0148-1>} Corrigendum: Defined a "dangling
reference", and specified that a dangling reference might
designate some other existing object. This allows simple
implementations of access values and reuse of object memory
@@ -65761,7 +65993,7 @@ been specified to be zero or is defined by the language
to be zero.
the Standard with actual practice.
19.f/4
- {AI12-0148-1AI12-0148-1} A side effect of this change is to
+ {<AI12-0148-1AI12-0148-1>} A side effect of this change is to
allow an Ada implementation to detect dangling references in
more places. This does not require any Ada implementation to
change, and if the implementation does change, it just means
@@ -65770,7 +66002,7 @@ been specified to be zero or is defined by the language
to be zero.
_Wording Changes from Ada 2012_
19.g/4
- {AI12-0148-1AI12-0148-1} Corrigendum: Clarified that
+ {<AI12-0148-1AI12-0148-1>} Corrigendum: Clarified that
deallocated objects cease to exist after finalization but
before Deallocate is called. This is necessary to prevent
erroneous execution from being triggered by the rules in *note
@@ -65784,7 +66016,7 @@ File: aarm2012.info, Node: 13.11.3, Next: 13.11.4,
Prev: 13.11.2, Up: 13.11
-----------------------------
1/4
-{AI05-0229-1AI05-0229-1} {AI12-0003-1AI12-0003-1} [Pragma and aspect
+{<AI05-0229-1AI05-0229-1>} {<AI12-0003-1AI12-0003-1>} [Pragma and aspect
Default_Storage_Pool specify the storage pool that will be used in the
absence of an explicit specification of a storage pool or storage size
for an access type.]
@@ -65792,19 +66024,19 @@ for an access type.]
_Syntax_
2/3
- {AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} The form of a
+ {<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} The form of a
pragma Default_Storage_Pool is as follows:
3/3
- {AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} pragma
+ {<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} pragma
Default_Storage_Pool (storage_pool_indicator);
3.1/4
- {AI05-0190-1AI05-0190-1} {AI12-0003-1AI12-0003-1}
- storage_pool_indicator ::= storage_pool_name | null | Standard
+ {<AI05-0190-1AI05-0190-1>} {<AI12-0003-1AI12-0003-1>}
+ storage_pool_indicator ::= <storage_pool_>name | null | Standard
3.2/3
- {AI05-0190-1AI05-0190-1} A pragma Default_Storage_Pool is allowed
+ {<AI05-0190-1AI05-0190-1>} A pragma Default_Storage_Pool is allowed
immediately within the visible part of a package_specification,
immediately within a declarative_part, or as a configuration
pragma.
@@ -65812,17 +66044,17 @@ for an access type.]
_Name Resolution Rules_
3.3/3
-{AI05-0190-1AI05-0190-1} The storage_pool_name is expected to be of type
-Root_Storage_Pool'Class.
+{<AI05-0190-1AI05-0190-1>} The <storage_pool_>name is expected to be of
+type Root_Storage_Pool'Class.
_Legality Rules_
4/3
-{AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} The storage_pool_name
-shall denote a variable.
+{<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} The
+<storage_pool_>name shall denote a variable.
4.1/4
-{AI12-0003-1AI12-0003-1} The Standard storage_pool_indicator is an
+{<AI12-0003-1AI12-0003-1>} The Standard storage_pool_indicator is an
identifier specific to a pragma (see *note 2.8::) and does not denote
any declaration. If the storage_pool_indicator is Standard, then there
shall not be a declaration with defining_identifier Standard that is
@@ -65853,19 +66085,20 @@ Standard itself.
defining_identifier Standard.
4.2/4
-{AI05-0190-1AI05-0190-1} {AI12-0003-1AI12-0003-1} If the pragma is used
-as a configuration pragma, the storage_pool_indicator shall be either
-null or Standard, and it defines the default pool to be the given
-storage_pool_indicator within all applicable compilation units (see
-*note 10.1.5::), except within the immediate scope of another pragma
-Default_Storage_Pool. Otherwise, [the pragma occurs immediately within
-a sequence of declarations, and] it defines the default pool within the
-immediate scope of the pragma to be the given storage_pool_indicator,
-except within the immediate scope of a later pragma
-Default_Storage_Pool. [Thus, an inner pragma overrides an outer one.]
+{<AI05-0190-1AI05-0190-1>} {<AI12-0003-1AI12-0003-1>} If the pragma is
+used as a configuration pragma, the storage_pool_indicator shall be
+either null or Standard, and it defines the <default pool> to be the
+given storage_pool_indicator within all applicable compilation units
+(see *note 10.1.5::), except within the immediate scope of another
+pragma Default_Storage_Pool. Otherwise, [the pragma occurs immediately
+within a sequence of declarations, and] it defines the default pool
+within the immediate scope of the pragma to be the given
+storage_pool_indicator, except within the immediate scope of a later
+pragma Default_Storage_Pool. [Thus, an inner pragma overrides an outer
+one.]
4.3/4
-{AI05-0190-1AI05-0190-1} {AI05-0262-1AI05-0262-1} A pragma
+{<AI05-0190-1AI05-0190-1>} {<AI05-0262-1AI05-0262-1>} A pragma
Default_Storage_Pool shall not be used as a configuration pragma that
applies to a compilation unit that is within the immediate scope of
another pragma Default_Storage_Pool.
@@ -65880,7 +66113,7 @@ another pragma Default_Storage_Pool.
end Parent;
4.c/3
- pragma Default_Storage_Pool(...); -- Illegal!
+ pragma Default_Storage_Pool(...); --< Illegal!>
package Parent.Child is
...
end Parent.Child;
@@ -65892,13 +66125,13 @@ another pragma Default_Storage_Pool.
_Static Semantics_
5/4
-{AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1}
-{AI12-0003-1AI12-0003-1} The language-defined aspect
+{<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>}
+{<AI12-0003-1AI12-0003-1>} The language-defined aspect
Default_Storage_Pool may be specified for a generic instance; it defines
the default pool for access types within an instance. .
5.1/4
-{AI12-0003-1AI12-0003-1} The Default_Storage_Pool aspect may be
+{<AI12-0003-1AI12-0003-1>} The Default_Storage_Pool aspect may be
specified as Standard, which is an identifier specific to an aspect (see
*note 13.1.1::) and defines the default pool to be Standard. In this
case, there shall not be a declaration with defining_identifier Standard
@@ -65906,7 +66139,7 @@ that is immediately visible at the point of the aspect
specification,
other than package Standard itself.
5.2/4
-{AI12-0003-1AI12-0003-1} Otherwise, the expected type for the
+{<AI12-0003-1AI12-0003-1>} Otherwise, the expected type for the
Default_Storage_Pool aspect is Root_Storage_Pool'Class and the
aspect_definition shall be a name that denotes a variable. This aspect
overrides any Default_Storage_Pool pragma that might apply to the
@@ -65918,7 +66151,7 @@ instance is that defined for the generic unit.
pool for a generic instance.
5.3/4
-{AI12-0136-1AI12-0136-1} The effect of specifying the aspect
+{<AI12-0136-1AI12-0136-1>} The effect of specifying the aspect
Default_Storage_Pool on an instance of a language-defined generic unit
is implementation-defined.
@@ -65928,42 +66161,43 @@ is implementation-defined.
generic unit.
6/3
-{AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} For nonderived access
-types declared in places where the default pool is defined by the pragma
-or aspect, their Storage_Pool or Storage_Size attribute is determined as
-follows, unless Storage_Pool or Storage_Size is specified for the type:
+{<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} For nonderived
+access types declared in places where the default pool is defined by the
+pragma or aspect, their Storage_Pool or Storage_Size attribute is
+determined as follows, unless Storage_Pool or Storage_Size is specified
+for the type:
6.1/3
- * {AI05-0190-1AI05-0190-1} If the default pool is null, the
+ * {<AI05-0190-1AI05-0190-1>} If the default pool is null, the
Storage_Size attribute is defined by the language to be zero.
[Therefore, an allocator for such a type is illegal.]
6.2/4
- * {AI05-0190-1AI05-0190-1} {AI12-0003-1AI12-0003-1} If the default
- pool is neither null nor Standard, the Storage_Pool attribute is
- that pool.
+ * {<AI05-0190-1AI05-0190-1>} {<AI12-0003-1AI12-0003-1>} If the
+ default pool is neither null nor Standard, the Storage_Pool
+ attribute is that pool.
6.3/4
-{AI05-0190-1AI05-0190-1} {AI12-0003-1AI12-0003-1} Otherwise (including
-when the default pool is specified as Standard), the standard storage
-pool is used for the type as described in *note 13.11::.
+{<AI05-0190-1AI05-0190-1>} {<AI12-0003-1AI12-0003-1>} Otherwise
+(including when the default pool is specified as Standard), the standard
+storage pool is used for the type as described in *note 13.11::.
6.a/3
- Ramification: {AI05-0190-1AI05-0190-1}
- {AI05-0229-1AI05-0229-1} Default_Storage_Pool is the only way
- to specify the storage pool for an anonymous access type.
+ Ramification: {<AI05-0190-1AI05-0190-1>}
+ {<AI05-0229-1AI05-0229-1>} Default_Storage_Pool is the only
+ way to specify the storage pool for an anonymous access type.
6.b/3
- {AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} Note that
- coextensions should be allocated in the same pool (or on the
- stack) as the outer object (see *note 13.11::); the
+ {<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} Note
+ that coextensions should be allocated in the same pool (or on
+ the stack) as the outer object (see *note 13.11::); the
Storage_Pool of the access discriminant (and hence the
Default_Storage_Pool) is supposed to be ignored for
coextensions. This matches the required finalization point
for coextensions.
6.b.1/3
- {AI05-0190-1AI05-0190-1} The default storage pool for an
+ {<AI05-0190-1AI05-0190-1>} The default storage pool for an
allocator that occurs within an instance of a generic is
defined by the Default_Storage_Pool aspect of the
instantiation (if specified), or by the Default_Storage_Pool
@@ -65971,7 +66205,7 @@ pool is used for the type as described in *note 13.11::.
pragma that applies to the instantiation is irrelevant.
6.b.2/3
- {AI05-0190-1AI05-0190-1} It is possible to specify the
+ {<AI05-0190-1AI05-0190-1>} It is possible to specify the
Default_Storage_Pool aspect for an instantiation such that
allocations will fail. For example, the generic unit might be
expecting a pool that supports certain sizes and alignments,
@@ -65979,44 +66213,44 @@ pool is used for the type as described in *note
13.11::.
the programmer's responsibility to get this right.
6.b.3/3
- {AI05-0190-1AI05-0190-1} The semantics of the
+ {<AI05-0190-1AI05-0190-1>} The semantics of the
Default_Storage_Pool aspect are similar to passing a pool
object as a generic formal, and putting pragma
Default_Storage_Pool at the top of the generic's visible part,
specifying that formal.
7/3
-This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+<This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
_Implementation Permissions_
8/3
-{AI05-0190-1AI05-0190-1} {AI05-0229-1AI05-0229-1} An object created by
-an allocator that is passed as the actual parameter to an access
+{<AI05-0190-1AI05-0190-1>} {<AI05-0229-1AI05-0229-1>} An object created
+by an allocator that is passed as the actual parameter to an access
parameter may be allocated on the stack, and automatically reclaimed,
regardless of the default pool.
8.a/3
- Discussion: {AI05-0190-1AI05-0190-1} This matches the required
- finalization point for such an allocated object.
+ Discussion: {<AI05-0190-1AI05-0190-1>} This matches the
+ required finalization point for such an allocated object.
NOTES
9/3
- 32 {AI05-0190-1AI05-0190-1} Default_Storage_Pool may be used with
- restrictions No_Coextensions and No_Access_Parameter_Allocators
- (see *note H.4::) to ensure that all allocators use the default
- pool.
+ 32 {<AI05-0190-1AI05-0190-1>} Default_Storage_Pool may be used
+ with restrictions No_Coextensions and
+ No_Access_Parameter_Allocators (see *note H.4::) to ensure that all
+ allocators use the default pool.
_Wording Changes from Ada 83_
9.a/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
_Incompatibilities With Ada 2005_
9.b/3
- {AI05-0229-1AI05-0229-1} Pragma Controlled has been dropped
+ {<AI05-0229-1AI05-0229-1>} Pragma Controlled has been dropped
from Ada, as it has no effect in any known Ada implementations
and it seems to promise capabilities not expected in Ada
implementations. This is usually not an incompatibility, as
@@ -66033,13 +66267,14 @@ regardless of the default pool.
_Extensions to Ada 2005_
9.c/4
- {AI05-0190-1AI05-0190-1} {AI12-0005-1AI12-0005-1} The pragma
- Default_Storage_Pool and aspect Default_Storage_Pool are new.
+ {<AI05-0190-1AI05-0190-1>} {<AI12-0005-1AI12-0005-1>} The
+ pragma Default_Storage_Pool and aspect Default_Storage_Pool
+ are new.
_Wording Changes from Ada 2005_
9.d/3
- {AI05-0229-1AI05-0229-1} The entire discussion of garbage
+ {<AI05-0229-1AI05-0229-1>} The entire discussion of garbage
collection (and especially that of controlled objects) is
deleted. Ada 2012 provides subpools (see *note 13.11.4::) for
storage management of objects, including controlled objects, a
@@ -66053,13 +66288,13 @@ regardless of the default pool.
_Extensions to Ada 2012_
9.e/4
- {AI05-0003-1AI05-0003-1} Corrigendum: The
+ {<AI05-0003-1AI05-0003-1>} Corrigendum: The
storage_pool_indicator Standard is new.
_Wording Changes from Ada 2012_
9.f/4
- {AI12-0136-1AI12-0136-1} Corrigendum: We now explicitly say
+ {<AI12-0136-1AI12-0136-1>} Corrigendum: We now explicitly say
that the behavior of language-defined generic units when given
the Default_Storage_Pool aspect is implementation-defined.
Portable code cannot rely on such a package using a particular
@@ -66072,8 +66307,8 @@ File: aarm2012.info, Node: 13.11.4, Next: 13.11.5,
Prev: 13.11.3, Up: 13.11
------------------------
1/3
-{AI05-0111-3AI05-0111-3} This subclause defines a package to support the
-partitioning of a storage pool into subpools. A subpool may be
+{<AI05-0111-3AI05-0111-3>} This subclause defines a package to support
+the partitioning of a storage pool into subpools. A subpool may be
specified as the default to be used for allocation from the associated
storage pool, or a particular subpool may be specified as part of an
allocator (see *note 4.8::).
@@ -66081,8 +66316,8 @@ allocator (see *note 4.8::).
_Static Semantics_
2/3
-{AI05-0111-3AI05-0111-3} The following language-defined library package
-exists:
+{<AI05-0111-3AI05-0111-3>} The following language-defined library
+package exists:
3/3
package System.Storage_Pools.Subpools is
@@ -66104,7 +66339,7 @@ exists:
return not null Subpool_Handle is abstract;
8/3
- {AI05-0252-1AI05-0252-1} -- The following operations are intended for
pool implementers:
+ {<AI05-0252-1AI05-0252-1>} -- <The following operations are intended
for pool implementers:>
9/3
function Pool_of_Subpool (Subpool : not null Subpool_Handle)
@@ -66131,7 +66366,7 @@ exists:
with Pre'Class => Pool_of_Subpool(Subpool) = Pool'Access;
13/3
- {AI05-0298-1AI05-0298-1} function Default_Subpool_for_Pool (
+ {<AI05-0298-1AI05-0298-1>} function Default_Subpool_for_Pool (
Pool : in out Root_Storage_Pool_With_Subpools)
return not null Subpool_Handle;
@@ -66152,28 +66387,29 @@ exists:
Alignment : in Storage_Elements.Storage_Count) is null;
16/3
- {AI05-0298-1AI05-0298-1} overriding
+ {<AI05-0298-1AI05-0298-1>} overriding
function Storage_Size (Pool : Root_Storage_Pool_With_Subpools)
return Storage_Elements.Storage_Count
is (Storage_Elements.Storage_Count'Last);
17/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Storage_Pools.Subpools;
18/3
-{AI05-0111-3AI05-0111-3} A subpool is a separately reclaimable portion
-of a storage pool, identified by an object of type Subpool_Handle (a
-subpool handle). A subpool handle also identifies the enclosing storage
-pool, a storage pool that supports subpools, which is a storage pool
-whose type is descended from Root_Storage_Pool_With_Subpools. A subpool
-is created by calling Create_Subpool or a similar constructor; the
-constructor returns the subpool handle.
+{<AI05-0111-3AI05-0111-3>} A <subpool> is a separately reclaimable
+portion of a storage pool, identified by an object of type
+Subpool_Handle (a <subpool handle>). A subpool handle also identifies
+the enclosing storage pool, a <storage pool that supports subpools>,
+which is a storage pool whose type is descended from
+Root_Storage_Pool_With_Subpools. A subpool is created by calling
+Create_Subpool or a similar constructor; the constructor returns the
+subpool handle.
19/3
-{AI05-0111-3AI05-0111-3} {AI05-0269-1AI05-0269-1} A subpool object is an
-object of a type descended from Root_Subpool. [Typically, subpool
+{<AI05-0111-3AI05-0111-3>} {<AI05-0269-1AI05-0269-1>} A <subpool object>
+is an object of a type descended from Root_Subpool. [Typically, subpool
objects are managed by the containing storage pool; only the handles
need be exposed to clients of the storage pool. Subpool objects are
designated by subpool handles, and are the run-time representation of a
@@ -66184,10 +66420,10 @@ subpool.]
because the declaration of Subpool_Handle says so.
20/4
-{AI05-0111-3AI05-0111-3} {AI05-0145-1AI05-0145-1} Each subpool belongs
-to a single storage pool [(which will always be a pool that supports
-subpools)]. An access to the pool that a subpool belongs to can be
-obtained by calling Pool_of_Subpool with the subpool handle.
+{<AI05-0111-3AI05-0111-3>} {<AI05-0145-1AI05-0145-1>} Each subpool
+<belongs> to a single storage pool [(which will always be a pool that
+supports subpools)]. An access to the pool that a subpool belongs to
+can be obtained by calling Pool_of_Subpool with the subpool handle.
Set_Pool_of_Subpool causes the subpool of the subpool handle to belong
to the given pool[; this is intended to be called from subpool
constructors like Create_Subpool.] Set_Pool_of_Subpool propagates
@@ -66201,14 +66437,14 @@ Pool_of_Subpool returns null.
overridden by the pool implementer.
21/3
-{AI05-0111-3AI05-0111-3} When an allocator for a type whose storage pool
-supports subpools is evaluated, a call is made on Allocate_From_Subpool
-passing in a Subpool_Handle, in addition to the parameters as defined
-for calls on Allocate (see *note 13.11::). The subpool designated by
-the subpool_handle_name is used, if specified in an allocator.
-Otherwise, Default_Subpool_for_Pool of the Pool is used to provide a
-subpool handle. All requirements on the Allocate procedure also apply
-to Allocate_from_Subpool.
+{<AI05-0111-3AI05-0111-3>} When an allocator for a type whose storage
+pool supports subpools is evaluated, a call is made on
+Allocate_From_Subpool passing in a Subpool_Handle, in addition to the
+parameters as defined for calls on Allocate (see *note 13.11::). The
+subpool designated by the <subpool_handle_>name is used, if specified in
+an allocator. Otherwise, Default_Subpool_for_Pool of the Pool is used
+to provide a subpool handle. All requirements on the Allocate procedure
+also apply to Allocate_from_Subpool.
21.a/3
Discussion: Deallocate_Subpool is expected to do whatever is
@@ -66226,28 +66462,28 @@ to Allocate_from_Subpool.
_Legality Rules_
22/3
-{AI05-0111-3AI05-0111-3} If a storage pool that supports subpools is
+{<AI05-0111-3AI05-0111-3>} If a storage pool that supports subpools is
specified as the Storage_Pool for an access type, the access type is
-called a subpool access type. A subpool access type shall be a
+called a <subpool access type>. A subpool access type shall be a
pool-specific access type.
23/3
-{AI05-0111-3AI05-0111-3} {AI05-0252-1AI05-0252-1} The accessibility
+{<AI05-0111-3AI05-0111-3>} {<AI05-0252-1AI05-0252-1>} The accessibility
level of a subpool access type shall not be statically deeper than that
of the storage pool object. If the specified storage pool object is a
storage pool that supports subpools, then the name that denotes the
object shall not denote part of a formal parameter, nor shall it denote
part of a dereference of a value of a non-library-level general access
-type. In addition to the places where Legality Rules normally apply (see
-*note 12.3::), these rules also apply in the private part of an instance
-of a generic unit.
+type. In addition to the places where Legality Rules normally apply
+(see *note 12.3::), these rules also apply in the private part of an
+instance of a generic unit.
_Dynamic Semantics_
24/3
-{AI05-0111-3AI05-0111-3} {AI05-0252-1AI05-0252-1} When an access type
-with a specified storage pool is frozen (see *note 13.14::), if the tag
-of the storage pool object identifies a storage pool that supports
+{<AI05-0111-3AI05-0111-3>} {<AI05-0252-1AI05-0252-1>} When an access
+type with a specified storage pool is frozen (see *note 13.14::), if the
+tag of the storage pool object identifies a storage pool that supports
subpools, the following checks are made:
25/3
@@ -66260,7 +66496,7 @@ subpools, the following checks are made:
of the storage pool object.
27/3
-{AI05-0252-1AI05-0252-1} Program_Error is raised if either of these
+{<AI05-0252-1AI05-0252-1>} Program_Error is raised if either of these
checks fail.
27.a/3
@@ -66281,7 +66517,7 @@ checks fail.
likely to occur in practice.
28/3
-{AI05-0111-3AI05-0111-3} A call to Subpools.Allocate(P, Addr, Size,
+{<AI05-0111-3AI05-0111-3>} A call to Subpools.Allocate(P, Addr, Size,
Align) does the following:
29/3
@@ -66292,8 +66528,8 @@ Align) does the following:
(Root_Storage_Pool_With_Subpools'Class(P)));
30/3
-{AI05-0111-3AI05-0111-3} An allocator that allocates in a subpool raises
-Program_Error if the allocated object has task parts.
+{<AI05-0111-3AI05-0111-3>} An allocator that allocates in a subpool
+raises Program_Error if the allocated object has task parts.
30.a/3
Reason: This is to ease implementation. We envision relaxing
@@ -66303,13 +66539,13 @@ Program_Error if the allocated object has task parts.
that is both useful, and surely feasible to implement.
31/3
-{AI05-0111-3AI05-0111-3} Unless overridden, Default_Subpool_for_Pool
+{<AI05-0111-3AI05-0111-3>} Unless overridden, Default_Subpool_for_Pool
propagates Program_Error.
_Erroneous Execution_
31.1/4
-{AI12-0142-1AI12-0142-1} If Allocate_From_Subpool does not meet one or
+{<AI12-0142-1AI12-0142-1>} If Allocate_From_Subpool does not meet one or
more of the requirements on the Allocate procedure as given in the
Erroneous Execution rules of *note 13.11::, then the program execution
is erroneous.
@@ -66317,11 +66553,11 @@ is erroneous.
_Implementation Permissions_
32/3
-{AI05-0111-3AI05-0111-3} When an allocator for a type whose storage pool
-is of type Root_Storage_Pool'Class is evaluated, but supports subpools,
-the implementation may call Allocate rather than Allocate_From_Subpool.
-[This will have the same effect, so long as Allocate has not been
-overridden.]
+{<AI05-0111-3AI05-0111-3>} When an allocator for a type whose storage
+pool is of type Root_Storage_Pool'Class is evaluated, but supports
+subpools, the implementation may call Allocate rather than
+Allocate_From_Subpool. [This will have the same effect, so long as
+Allocate has not been overridden.]
32.a/3
Reason: This ensures either of two implementation models are
@@ -66349,8 +66585,8 @@ overridden.]
NOTES
33/3
- 33 {AI05-0111-3AI05-0111-3} A user-defined storage pool type that
- supports subpools can be implemented by extending the
+ 33 {<AI05-0111-3AI05-0111-3>} A user-defined storage pool type
+ that supports subpools can be implemented by extending the
Root_Storage_Pool_With_Subpools type, and overriding the primitive
subprograms Create_Subpool, Allocate_From_Subpool, and
Deallocate_Subpool. Create_Subpool should call Set_Pool_Of_Subpool
@@ -66361,13 +66597,13 @@ overridden.]
the pool.
34/3
- 34 {AI05-0111-3AI05-0111-3} A user-defined storage pool type that
- supports subpools may define additional subpool constructors
+ 34 {<AI05-0111-3AI05-0111-3>} A user-defined storage pool type
+ that supports subpools may define additional subpool constructors
similar to Create_Subpool (these typically will have additional
parameters).
35/3
- 35 {AI05-0111-3AI05-0111-3} The pool implementor should override
+ 35 {<AI05-0111-3AI05-0111-3>} The pool implementor should override
Default_Subpool_For_Pool if the pool is to support a default
subpool for the pool. The implementor can override Deallocate if
individual object reclamation is to be supported, and can override
@@ -66383,13 +66619,13 @@ overridden.]
_Extensions to Ada 2005_
35.a/3
- {AI05-0111-3AI05-0111-3} {AI05-0252-1AI05-0252-1} Subpools and
- the package System.Storage_Pools.Subpools are new.
+ {<AI05-0111-3AI05-0111-3>} {<AI05-0252-1AI05-0252-1>} Subpools
+ and the package System.Storage_Pools.Subpools are new.
_Wording Changes from Ada 2012_
35.b/4
- {AI12-0142-1AI12-0142-1} Corrigendum: Clarified that an
+ {<AI12-0142-1AI12-0142-1>} Corrigendum: Clarified that an
incorrect implementation of Allocate_From_Subpool causes
execution to become erroneous. The wording already said that
the requirements of Allocate apply to Allocate_From_Subpool,
@@ -66397,7 +66633,7 @@ overridden.]
requirements also apply.
35.c/4
- {AI12-0145-1AI12-0145-1} Corrigendum: Clarified that
+ {<AI12-0145-1AI12-0145-1>} Corrigendum: Clarified that
Pool_of_Subpool returns null if Set_Pool_of_Subpool has not
been called. As that can be inferred from the definition, and
all known existing implementations return null in this case,
@@ -66411,13 +66647,13 @@ File: aarm2012.info, Node: 13.11.5, Next: 13.11.6,
Prev: 13.11.4, Up: 13.11
---------------------------
1/3
-{AI05-0111-3AI05-0111-3} A subpool may be explicitly deallocated using
+{<AI05-0111-3AI05-0111-3>} A subpool may be explicitly deallocated using
Unchecked_Deallocate_Subpool.
_Static Semantics_
2/3
-{AI05-0111-3AI05-0111-3} The following language-defined library
+{<AI05-0111-3AI05-0111-3>} The following language-defined library
procedure exists:
3/3
@@ -66426,12 +66662,12 @@ procedure exists:
(Subpool : in out System.Storage_Pools.Subpools.Subpool_Handle);
4/3
-{AI05-0111-3AI05-0111-3} If Subpool is null, a call on
+{<AI05-0111-3AI05-0111-3>} If Subpool is null, a call on
Unchecked_Deallocate_Subpool has no effect. Otherwise, the subpool is
finalized, and Subpool is set to null.
5/3
-{AI05-0111-3AI05-0111-3} Finalization of a subpool has the following
+{<AI05-0111-3AI05-0111-3>} Finalization of a subpool has the following
effects:
6/3
@@ -66442,7 +66678,7 @@ effects:
finalized in an arbitrary order;
7.1/4
- * {AI12-0148-1AI12-0148-1} All of the objects allocated from the
+ * {<AI12-0148-1AI12-0148-1>} All of the objects allocated from the
subpool cease to exist;
8/3
@@ -66452,7 +66688,7 @@ effects:
Deallocate_Subpool(Pool_of_Subpool(Subpool).all, Subpool);
10/3
-{AI05-0111-3AI05-0111-3} Finalization of a
+{<AI05-0111-3AI05-0111-3>} Finalization of a
Root_Storage_Pool_With_Subpools object finalizes all subpools that
belong to that pool that have not yet been finalized.
@@ -66488,15 +66724,16 @@ belong to that pool that have not yet been finalized.
_Extensions to Ada 2005_
10.f/3
- {AI05-0111-3AI05-0111-3} Unchecked_Deallocate_Subpool is new.
+ {<AI05-0111-3AI05-0111-3>} Unchecked_Deallocate_Subpool is
+ new.
_Wording Changes from Ada 2012_
10.g/4
- {AI12-0148-1AI12-0148-1} Corrigendum: Added missing wording to
- state that the objects cease to exist after the completion of
- finalization. This is formally an inconsistency (it would be
- possible to depend on the fact that objects finalized by
+ {<AI12-0148-1AI12-0148-1>} Corrigendum: Added missing wording
+ to state that the objects cease to exist after the completion
+ of finalization. This is formally an inconsistency (it would
+ be possible to depend on the fact that objects finalized by
Unchecked_Deallocate_Subpool still exist), but that violates
every sane expectation for a procedure called "Deallocate"
something.
@@ -66510,8 +66747,8 @@ File: aarm2012.info, Node: 13.11.6, Prev: 13.11.5,
Up: 13.11
_Examples_
1/3
-{AI05-0111-3AI05-0111-3} The following example is a simple but complete
-implementation of the classic Mark/Release pool using subpools:
+{<AI05-0111-3AI05-0111-3>} The following example is a simple but
+complete implementation of the classic Mark/Release pool using subpools:
2/3
with System.Storage_Pools.Subpools;
@@ -66521,14 +66758,14 @@ implementation of the classic Mark/Release pool using
subpools:
3/3
use System.Storage_Pools;
- -- For uses of Subpools.
+ -- <For uses of Subpools.>
use System.Storage_Elements;
- -- For uses of Storage_Count and Storage_Array.
+ -- <For uses of Storage_Count and Storage_Array.>
4/3
- -- Mark and Release work in a stack fashion, and allocations are not
allowed
- -- from a subpool other than the one at the top of the stack. This is
also
- -- the default pool.
+ -- <Mark and Release work in a stack fashion, and allocations are not
allowed>
+ -- <from a subpool other than the one at the top of the stack. This is
also>
+ -- <the default pool.>
5/3
subtype Subpool_Handle is Subpools.Subpool_Handle;
@@ -66556,7 +66793,7 @@ implementation of the classic Mark/Release pool using
subpools:
type Subpool_Array is array (Subpool_Indexes) of aliased MR_Subpool;
11/4
- {AI05-0298-1AI05-0298-1} {AI12-0134-1AI12-0134-1} type
Mark_Release_Pool_Type (Pool_Size : Storage_Count) is new
+ {<AI05-0298-1AI05-0298-1>} {<AI12-0134-1AI12-0134-1>} type
Mark_Release_Pool_Type (Pool_Size : Storage_Count) is new
Subpools.Root_Storage_Pool_With_Subpools with record
Storage : Storage_Array (0 .. Pool_Size);
Next_Allocation : Storage_Count := 0;
@@ -66565,7 +66802,7 @@ implementation of the classic Mark/Release pool using
subpools:
end record;
12/3
- {AI05-0298-1AI05-0298-1} overriding
+ {<AI05-0298-1AI05-0298-1>} overriding
function Create_Subpool (Pool : in out Mark_Release_Pool_Type)
return not null Subpool_Handle;
@@ -66589,7 +66826,7 @@ implementation of the classic Mark/Release pool using
subpools:
Subpool : in out Subpool_Handle);
16/3
- {AI05-0298-1AI05-0298-1} overriding
+ {<AI05-0298-1AI05-0298-1>} overriding
function Default_Subpool_for_Pool (Pool : in out
Mark_Release_Pool_Type)
return not null Subpool_Handle;
@@ -66598,7 +66835,7 @@ implementation of the classic Mark/Release pool using
subpools:
procedure Initialize (Pool : in out Mark_Release_Pool_Type);
18/3
- -- We don't need Finalize.
+ -- <We don't need Finalize.>
19/3
end MR_Pool;
@@ -66607,11 +66844,11 @@ implementation of the classic Mark/Release pool using
subpools:
package body MR_Pool is
21/3
- {AI05-0298-1AI05-0298-1} use type Subpool_Handle;
+ {<AI05-0298-1AI05-0298-1>} use type Subpool_Handle;
22/3
- {AI05-0298-1AI05-0298-1} procedure Initialize (Pool : in out
Mark_Release_Pool_Type) is
- -- Initialize the first default subpool.
+ {<AI05-0298-1AI05-0298-1>} procedure Initialize (Pool : in out
Mark_Release_Pool_Type) is
+ -- <Initialize the first default subpool.>
begin
Pool.Markers(1).Start := 1;
Subpools.Set_Pool_of_Subpool
@@ -66621,15 +66858,15 @@ implementation of the classic Mark/Release pool using
subpools:
23/3
function Create_Subpool (Pool : in out Mark_Release_Pool_Type)
return not null Subpool_Handle is
- -- Mark the current allocation location.
+ -- <Mark the current allocation location.>
begin
if Pool.Current_Pool = Subpool_Indexes'Last then
- raise Storage_Error; -- No more subpools.
+ raise Storage_Error; -- <No more subpools.>
end if;
- Pool.Current_Pool := Pool.Current_Pool + 1; -- Move to the next
subpool
+ Pool.Current_Pool := Pool.Current_Pool + 1; -- <Move to the next
subpool>
24/3
- {AI05-0298-1AI05-0298-1} return Result : constant not null
Subpool_Handle :=
+ {<AI05-0298-1AI05-0298-1>} return Result : constant not null
Subpool_Handle :=
Pool.Markers(Pool.Current_Pool)'Unchecked_Access
do
Pool.Markers(Pool.Current_Pool).Start := Pool.Next_Allocation;
@@ -66638,17 +66875,17 @@ implementation of the classic Mark/Release pool using
subpools:
end Create_Subpool;
25/3
- {AI05-0298-1AI05-0298-1} procedure Deallocate_Subpool (
+ {<AI05-0298-1AI05-0298-1>} procedure Deallocate_Subpool (
Pool : in out Mark_Release_Pool_Type;
Subpool : in out Subpool_Handle) is
begin
if Subpool /= Pool.Markers(Pool.Current_Pool)'Unchecked_Access then
- raise Program_Error; -- Only the last marked subpool can be
released.
+ raise Program_Error; -- <Only the last marked subpool can be
released.>
end if;
if Pool.Current_Pool /= 1 then
Pool.Next_Allocation := Pool.Markers(Pool.Current_Pool).Start;
- Pool.Current_Pool := Pool.Current_Pool - 1; -- Move to the
previous subpool
- else -- Reinitialize the default subpool:
+ Pool.Current_Pool := Pool.Current_Pool - 1; -- <Move to the
previous subpool>
+ else -- <Reinitialize the default subpool:>
Pool.Next_Allocation := 1;
Subpools.Set_Pool_of_Subpool
(Pool.Markers(1)'Unchecked_Access, Pool);
@@ -66656,7 +66893,7 @@ implementation of the classic Mark/Release pool using
subpools:
end Deallocate_Subpool;
26/3
- {AI05-0298-1AI05-0298-1} function Default_Subpool_for_Pool (Pool : in
out Mark_Release_Pool_Type)
+ {<AI05-0298-1AI05-0298-1>} function Default_Subpool_for_Pool (Pool :
in out Mark_Release_Pool_Type)
return not null Subpool_Handle is
begin
return Pool.Markers(Pool.Current_Pool)'Unchecked_Access;
@@ -66671,20 +66908,20 @@ implementation of the classic Mark/Release pool using
subpools:
Subpool : not null Subpool_Handle) is
begin
if Subpool /= Pool.Markers(Pool.Current_Pool)'Unchecked_Access then
- raise Program_Error; -- Only the last marked subpool can be used
for allocations.
+ raise Program_Error; -- <Only the last marked subpool can be
used for allocations.>
end if;
28/4
- {AI12-0080-1AI12-0080-1} -- Check for the maximum supported
alignment, which is the alignment of the storage area:
+ {<AI12-0080-1AI12-0080-1>} -- <Check for the maximum supported
alignment, which is the alignment of the storage area:>
if Alignment > Pool.Storage'Alignment then
raise Program_Error;
end if;
- -- Correct the alignment if necessary:
+ -- <Correct the alignment if necessary:>
Pool.Next_Allocation := Pool.Next_Allocation +
((-Pool.Next_Allocation) mod Alignment);
if Pool.Next_Allocation + Size_In_Storage_Elements >
Pool.Pool_Size then
- raise Storage_Error; -- Out of space.
+ raise Storage_Error; -- <Out of space.>
end if;
Storage_Address := Pool.Storage (Pool.Next_Allocation)'Address;
Pool.Next_Allocation :=
@@ -66697,7 +66934,7 @@ implementation of the classic Mark/Release pool using
subpools:
_Wording Changes from Ada 2005_
29.a/3
- {AI05-0111-3AI05-0111-3} This example of subpools is new.
+ {<AI05-0111-3AI05-0111-3>} This example of subpools is new.
File: aarm2012.info, Node: 13.12, Next: 13.13, Prev: 13.11, Up: 13
@@ -66706,7 +66943,7 @@ File: aarm2012.info, Node: 13.12, Next: 13.13, Prev:
13.11, Up: 13
============================================
1/3
-{AI05-0246-1AI05-0246-1} [A pragma Restrictions expresses the user's
+{<AI05-0246-1AI05-0246-1>} [A pragma Restrictions expresses the user's
intent to abide by certain restrictions. A pragma Profile expresses the
user's intent to abide by a set of Restrictions or other specified
run-time policies. These may facilitate the construction of simpler
@@ -66721,12 +66958,13 @@ run-time environments.]
pragma Restrictions(restriction{, restriction});
4/2
- {AI95-00381-01AI95-00381-01} restriction ::= restriction_identifier
- | restriction_parameter_identifier =>
+ {<AI95-00381-01AI95-00381-01>} restriction ::= <restriction_>
+ identifier
+ | <restriction_parameter_>identifier =>
restriction_parameter_argument
4.1/2
- {AI95-00381-01AI95-00381-01} restriction_parameter_argument ::=
+ {<AI95-00381-01AI95-00381-01>} restriction_parameter_argument ::=
name | expression
_Name Resolution Rules_
@@ -66742,27 +66980,27 @@ Unless otherwise specified for a particular
restriction, the expression
shall be static, and its value shall be nonnegative.
7.a/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
-Paragraph 7 was deleted.
+<Paragraph 7 was deleted.>
_Post-Compilation Rules_
8/3
-{AI05-0013-1AI05-0013-1} A pragma Restrictions is a configuration
+{<AI05-0013-1AI05-0013-1>} A pragma Restrictions is a configuration
pragma. If a pragma Restrictions applies to any compilation unit
included in the partition, this may impose either (or both) of two kinds
of requirements, as specified for the particular restriction:
8.1/3
- * {AI05-0013-1AI05-0013-1} A restriction may impose requirements on
+ * {<AI05-0013-1AI05-0013-1>} A restriction may impose requirements on
some or all of the units comprising the partition. Unless
otherwise specified for a particular restriction, such a
requirement applies to all of the units comprising the partition
and is enforced via a post-compilation check.
8.2/3
- * {AI05-0013-1AI05-0013-1} A restriction may impose requirements on
+ * {<AI05-0013-1AI05-0013-1>} A restriction may impose requirements on
the run-time behavior of the program, as indicated by the
specification of run-time behavior associated with a violation of
the requirement.
@@ -66772,22 +67010,22 @@ of requirements, as specified for the particular
restriction:
post-compilation check needed for the requirement.
8.3/1
-{8652/00428652/0042} {AI95-00130-01AI95-00130-01} For the purpose of
+{<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>} For the purpose of
checking whether a partition contains constructs that violate any
restriction (unless specified otherwise for a particular restriction):
8.4/1
- * {8652/00428652/0042} {AI95-00130-01AI95-00130-01} Generic instances
- are logically expanded at the point of instantiation;
+ * {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>} Generic
+ instances are logically expanded at the point of instantiation;
8.5/1
- * {8652/00428652/0042} {AI95-00130-01AI95-00130-01} If an object of a
- type is declared or allocated and not explicitly initialized, then
- all expressions appearing in the definition for the type and any of
- its ancestors are presumed to be used;
+ * {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>} If an object
+ of a type is declared or allocated and not explicitly initialized,
+ then all expressions appearing in the definition for the type and
+ any of its ancestors are presumed to be used;
8.6/1
- * {8652/00428652/0042} {AI95-00130-01AI95-00130-01} A
+ * {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>} A
default_expression for a formal parameter or a generic formal
object is considered to be used if and only if the corresponding
actual parameter is not provided in a given call or instantiation.
@@ -66795,7 +67033,7 @@ restriction (unless specified otherwise for a
particular restriction):
_Implementation Permissions_
8.7/3
-{AI05-0269-1AI05-0269-1} An implementation may provide
+{<AI05-0269-1AI05-0269-1>} An implementation may provide
implementation-defined restrictions; the identifier for an
implementation-defined restriction shall differ from those of the
language-defined restrictions.
@@ -66821,52 +67059,53 @@ implementation defined.
not enforce them at all.
9.1/1
-{8652/00428652/0042} {AI95-00130-01AI95-00130-01} An implementation is
-permitted to omit restriction checks for code that is recognized at
+{<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>} An implementation
+is permitted to omit restriction checks for code that is recognized at
compile time to be unreachable and for which no code is generated.
9.2/1
-{8652/00438652/0043} {AI95-00190-01AI95-00190-01} Whenever enforcement
-of a restriction is not required prior to execution, an implementation
-may nevertheless enforce the restriction prior to execution of a
-partition to which the restriction applies, provided that every
-execution of the partition would violate the restriction.
+{<8652/00438652/0043>} {<AI95-00190-01AI95-00190-01>} Whenever
+enforcement of a restriction is not required prior to execution, an
+implementation may nevertheless enforce the restriction prior to
+execution of a partition to which the restriction applies, provided that
+every execution of the partition would violate the restriction.
_Syntax_
10/3
- {AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The form of a
- pragma Profile is as follows:
+ {<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The form
+ of a pragma Profile is as follows:
11/3
- pragma Profile (profile_identifier {, profile_
+ pragma Profile (<profile_>identifier {, <profile_>
pragma_argument_association});
_Legality Rules_
12/3
-{AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The
-profile_identifier shall be the name of a usage profile. The semantics
-of any profile_pragma_argument_association (*note 2.8: S0020.)s are
-defined by the usage profile specified by the profile_identifier.
+{<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The
+<profile_>identifier shall be the name of a usage profile. The
+semantics of any <profile_>pragma_argument_association (*note 2.8:
+S0020.)s are defined by the usage profile specified by the
+<profile_>identifier.
_Static Semantics_
13/3
-{AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} A profile is
+{<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} A profile is
equivalent to the set of configuration pragmas that is defined for each
usage profile.
_Post-Compilation Rules_
14/3
-{AI95-00249-01AI95-00249-01} A pragma Profile is a configuration pragma.
-There may be more than one pragma Profile for a partition.
+{<AI95-00249-01AI95-00249-01>} A pragma Profile is a configuration
+pragma. There may be more than one pragma Profile for a partition.
_Implementation Permissions_
15/3
-{AI05-0269-1AI05-0269-1} An implementation may provide
+{<AI05-0269-1AI05-0269-1>} An implementation may provide
implementation-defined usage profiles; the identifier for an
implementation-defined usage profile shall differ from those of the
language-defined usage profiles.
@@ -66878,7 +67117,7 @@ language-defined usage profiles.
NOTES
16/2
- 36 {AI95-00347-01AI95-00347-01} Restrictions intended to
+ 36 {<AI95-00347-01AI95-00347-01>} Restrictions intended to
facilitate the construction of efficient tasking run-time systems
are defined in *note D.7::. Restrictions intended for use when
constructing high integrity systems are defined in *note H.4::.
@@ -66904,37 +67143,37 @@ language-defined usage profiles.
_Extensions to Ada 95_
17.c/3
- {AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} Pragma
- Profile is new; it was moved here by Ada 2012 and renamed to a
- "usage profile" but was otherwise unchanged.
+ {<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>}
+ Pragma Profile is new; it was moved here by Ada 2012 and
+ renamed to a "usage profile" but was otherwise unchanged.
_Wording Changes from Ada 95_
17.d/2
- {8652/00428652/0042} {AI95-00130-01AI95-00130-01} Corrigendum:
- Corrected the wording so that restrictions are checked inside
- of generic instantiations and in default expressions. Since
- not making these checks would violate the purpose of
- restrictions, we are not documenting this as an
+ {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>}
+ Corrigendum: Corrected the wording so that restrictions are
+ checked inside of generic instantiations and in default
+ expressions. Since not making these checks would violate the
+ purpose of restrictions, we are not documenting this as an
incompatibility.
17.e/2
- {8652/00438652/0043} {AI95-00190-01AI95-00190-01} Corrigendum:
- Added a permission that restrictions can be enforced at
- compile-time. While this is technically incompatible,
- documenting it as such would be unnecessarily alarming - there
- should not be any programs depending on the runtime failure of
- restrictions.
+ {<8652/00438652/0043>} {<AI95-00190-01AI95-00190-01>}
+ Corrigendum: Added a permission that restrictions can be
+ enforced at compile-time. While this is technically
+ incompatible, documenting it as such would be unnecessarily
+ alarming - there should not be any programs depending on the
+ runtime failure of restrictions.
17.f/2
- {AI95-00381-01AI95-00381-01} The syntax of a
+ {<AI95-00381-01AI95-00381-01>} The syntax of a
restriction_parameter_argument has been defined to better
support restriction No_Dependence (see *note 13.12.1::).
_Wording Changes from Ada 2005_
17.g/3
- {AI05-0013-1AI05-0013-1} Correction: When restrictions are
+ {<AI05-0013-1AI05-0013-1>} Correction: When restrictions are
checked has been clarified.
* Menu:
@@ -66950,33 +67189,33 @@ File: aarm2012.info, Node: 13.12.1, Up: 13.12
_Static Semantics_
1/2
-{AI95-00257-01AI95-00257-01} The following restriction_identifiers are
-language defined (additional restrictions are defined in the Specialized
-Needs Annexes):
+{<AI95-00257-01AI95-00257-01>} The following <restriction_>identifiers
+are language defined (additional restrictions are defined in the
+Specialized Needs Annexes):
1.1/3
-{AI05-0241-1AI05-0241-1} No_Implementation_Aspect_Specifications
+{<AI05-0241-1AI05-0241-1>} No_Implementation_Aspect_Specifications
There are no implementation-defined aspects specified by
an aspect_specification. This restriction applies only
to the current compilation or environment, not the entire
partition.
1.a/3
- Discussion: {AI05-0241-1AI05-0241-1} This restriction (as well
- as others below) applies only to the current compilation,
+ Discussion: {<AI05-0241-1AI05-0241-1>} This restriction (as
+ well as others below) applies only to the current compilation,
because it is likely that the runtime (and possibly
user-written low-level code) will need to use
implementation-defined aspects. But a partition-wide
restriction applies everywhere, including the runtime.
2/2
-{AI95-00257-01AI95-00257-01} No_Implementation_Attributes
+{<AI95-00257-01AI95-00257-01>} No_Implementation_Attributes
There are no implementation-defined attributes. This
restriction applies only to the current compilation or
environment, not the entire partition.
2.1/3
-{AI05-0246-1AI05-0246-1} {AI05-0269-1AI05-0269-1}
+{<AI05-0246-1AI05-0246-1>} {<AI05-0269-1AI05-0269-1>}
No_Implementation_Identifiers
There are no usage names that denote declarations with
implementation-defined identifiers that occur within
@@ -67052,13 +67291,13 @@ No_Implementation_Identifiers
or environment, not the entire partition.
3/2
-{AI95-00257-01AI95-00257-01} No_Implementation_Pragmas
+{<AI95-00257-01AI95-00257-01>} No_Implementation_Pragmas
There are no implementation-defined pragmas or pragma
arguments. This restriction applies only to the current
compilation or environment, not the entire partition.
3.1/3
-{AI05-0242-1AI05-0242-1} No_Implementation_Units
+{<AI05-0242-1AI05-0242-1>} No_Implementation_Units
There is no mention in the context_clause of any
implementation-defined descendants of packages Ada,
Interfaces, or System. This restriction applies only to
@@ -67066,7 +67305,7 @@ No_Implementation_Identifiers
partition.
4/3
-{AI95-00368-01AI95-00368-01} {AI05-0229-1AI05-0229-1}
+{<AI95-00368-01AI95-00368-01>} {<AI05-0229-1AI05-0229-1>}
No_Obsolescent_Features
There is no use of language features defined in Annex J.
It is implementation defined whether uses of the
@@ -67091,38 +67330,38 @@ No_Obsolescent_Features
implement these renames.
4.d/3
- {AI05-0229-1AI05-0229-1} The pragmas have the same
+ {<AI05-0229-1AI05-0229-1>} The pragmas have the same
functionality as the corresponding aspect (unlike the typical
obsolescent feature), and rejecting them could be a
significant portability problem for existing code.
5/3
-{AI95-00381-01AI95-00381-01} {AI05-0241-1AI05-0241-1} The following
-restriction_parameter_identifiers are language defined:
+{<AI95-00381-01AI95-00381-01>} {<AI05-0241-1AI05-0241-1>} The following
+<restriction_parameter_>identifiers are language defined:
6/2
-{AI95-00381-01AI95-00381-01} No_Dependence
+{<AI95-00381-01AI95-00381-01>} No_Dependence
Specifies a library unit on which there are no semantic
dependences.
6.1/3
-{AI05-0241-1AI05-0241-1} No_Specification_of_Aspect
+{<AI05-0241-1AI05-0241-1>} No_Specification_of_Aspect
Identifies an aspect for which no aspect_specification,
attribute_definition_clause, or pragma is given.
6.2/3
-{AI05-0272-1AI05-0272-1} No_Use_Of_Attribute
+{<AI05-0272-1AI05-0272-1>} No_Use_Of_Attribute
Identifies an attribute for which no attribute_reference
or attribute_definition_clause is given.
6.3/3
-{AI05-0272-1AI05-0272-1} No_Use_Of_Pragma
+{<AI05-0272-1AI05-0272-1>} No_Use_Of_Pragma
Identifies a pragma which is not to be used.
_Legality Rules_
7/2
-{AI95-00381-01AI95-00381-01} The restriction_parameter_argument of a
+{<AI95-00381-01AI95-00381-01>} The restriction_parameter_argument of a
No_Dependence restriction shall be a name; the name shall have the form
of a full expanded name of a library unit, but need not denote a unit
present in the environment.
@@ -67131,7 +67370,7 @@ present in the environment.
Ramification: This name is not resolved.
7.1/3
-{AI05-0241-1AI05-0241-1} The restriction_parameter_argument of a
+{<AI05-0241-1AI05-0241-1>} The restriction_parameter_argument of a
No_Specification_of_Aspect restriction shall be an identifier; this is
an identifier specific to a pragma (see *note 2.8::) and does not denote
any declaration.
@@ -67145,7 +67384,7 @@ any declaration.
implementation.
7.2/3
-{AI05-0272-1AI05-0272-1} The restriction_parameter_argument of a
+{<AI05-0272-1AI05-0272-1>} The restriction_parameter_argument of a
No_Use_Of_Attribute restriction shall be an identifier or one of the
reserved words Access, Delta, Digits, Mod, or Range; this is an
identifier specific to a pragma.
@@ -67159,7 +67398,7 @@ identifier specific to a pragma.
nothing at all on another implementation.
7.3/3
-{AI05-0272-1AI05-0272-1} The restriction_parameter_argument of a
+{<AI05-0272-1AI05-0272-1>} The restriction_parameter_argument of a
No_Use_Of_Pragma restriction shall be an identifier or the reserved word
Interface; this is an identifier specific to a pragma.
@@ -67174,7 +67413,7 @@ Interface; this is an identifier specific to a pragma.
_Post-Compilation Rules_
8/3
-{AI95-00381-01AI95-00381-01} {AI05-0241-1AI05-0241-1} No compilation
+{<AI95-00381-01AI95-00381-01>} {<AI05-0241-1AI05-0241-1>} No compilation
unit included in the partition shall depend semantically on the library
unit identified by the name of a No_Dependence restriction.
@@ -67188,19 +67427,20 @@ unit identified by the name of a No_Dependence
restriction.
_Static Semantics_
9/3
-{AI05-0246-1AI05-0246-1} The following profile_identifier is language
-defined:
+{<AI05-0246-1AI05-0246-1>} The following <profile_>identifier is
+language defined:
10/3
-{AI05-0246-1AI05-0246-1} No_Implementation_Extensions
+{<AI05-0246-1AI05-0246-1>} No_Implementation_Extensions
11/3
-{AI05-0246-1AI05-0246-1} For usage profile No_Implementation_Extensions,
-there shall be no profile_pragma_argument_associations.
+{<AI05-0246-1AI05-0246-1>} For usage profile
+No_Implementation_Extensions, there shall be no
+<profile_>pragma_argument_associations.
12/3
-{AI05-0246-1AI05-0246-1} The No_Implementation_Extensions usage profile
-is equivalent to the following restrictions:
+{<AI05-0246-1AI05-0246-1>} The No_Implementation_Extensions usage
+profile is equivalent to the following restrictions:
13/3
No_Implementation_Aspect_Specifications,
@@ -67212,27 +67452,28 @@ is equivalent to the following restrictions:
_Extensions to Ada 95_
13.a/2
- {AI95-00257-01AI95-00257-01} {AI95-00368-01AI95-00368-01}
+ {<AI95-00257-01AI95-00257-01>} {<AI95-00368-01AI95-00368-01>}
Restrictions No_Implementation_Attributes,
No_Implementation_Pragmas, and No_Obsolescent_Features are
new.
13.b/2
- {AI95-00381-01AI95-00381-01} Restriction No_Dependence is new.
+ {<AI95-00381-01AI95-00381-01>} Restriction No_Dependence is
+ new.
_Extensions to Ada 2005_
13.c/3
- {AI05-0241-1AI05-0241-1} {AI05-0242-1AI05-0242-1}
- {AI05-0246-1AI05-0246-1} {AI05-0272-1AI05-0272-1} Restrictions
- No_Implementation_Aspect_Specifications,
+ {<AI05-0241-1AI05-0241-1>} {<AI05-0242-1AI05-0242-1>}
+ {<AI05-0246-1AI05-0246-1>} {<AI05-0272-1AI05-0272-1>}
+ Restrictions No_Implementation_Aspect_Specifications,
No_Implementation_Identifiers, No_Implementation_Units,
No_Specification_of_Aspect, No_Use_of_Attribute, and
No_Use_of_Pragma are new.
13.d/3
- {AI05-0246-1AI05-0246-1} Profile No_Implementation_Extensions
- is new.
+ {<AI05-0246-1AI05-0246-1>} Profile
+ No_Implementation_Extensions is new.
File: aarm2012.info, Node: 13.13, Next: 13.14, Prev: 13.12, Up: 13
@@ -67241,9 +67482,9 @@ File: aarm2012.info, Node: 13.13, Next: 13.14, Prev:
13.12, Up: 13
=============
1
-A stream is a sequence of elements comprising values from possibly
+A <stream> is a sequence of elements comprising values from possibly
different types and allowing sequential access to these values. A
-stream type is a type in the class whose root type is
+<stream type> is a type in the class whose root type is
Streams.Root_Stream_Type. A stream type may be implemented in various
ways, such as an external sequential file, an internal buffer, or a
network channel.
@@ -67292,12 +67533,12 @@ can call the Read and Write attributes of other
types.)
pragma Pure(Streams);
3/2
- {AI95-00161-01AI95-00161-01} type Root_Stream_Type is abstract tagged
limited private;
+ {<AI95-00161-01AI95-00161-01>} type Root_Stream_Type is abstract
tagged limited private;
pragma Preelaborable_Initialization(Root_Stream_Type);
4/1
- {8652/00448652/0044} {AI95-00181-01AI95-00181-01} type Stream_Element
is mod implementation-defined;
- type Stream_Element_Offset is range implementation-defined;
+ {<8652/00448652/0044>} {<AI95-00181-01AI95-00181-01>} type
Stream_Element is mod <implementation-defined>;
+ type Stream_Element_Offset is range <implementation-defined>;
subtype Stream_Element_Count is
Stream_Element_Offset range 0..Stream_Element_Offset'Last;
type Stream_Element_Array is
@@ -67316,11 +67557,11 @@ can call the Read and Write attributes of other
types.)
7
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Streams;
8/2
-{AI95-00227-01AI95-00227-01} The Read operation transfers stream
+{<AI95-00227-01AI95-00227-01>} The Read operation transfers stream
elements from the specified stream to fill the array Item. Elements are
transferred until Item'Length elements have been transferred, or until
the end of the stream is reached. If any elements are transferred, the
@@ -67332,14 +67573,15 @@ Item'Last only if the end of the stream is reached.
The Write operation appends Item to the specified stream.
9.a/2
- Discussion: {AI95-00114-01AI95-00114-01} The index subtype of
- Stream_Element_Array is Stream_Element_Offset because we wish
- to allow maximum flexibility. Most Stream_Element_Arrays will
- probably have a lower bound of 0 or 1, but other lower bounds,
- including negative ones, make sense in some situations.
+ Discussion: {<AI95-00114-01AI95-00114-01>} The index subtype
+ of Stream_Element_Array is Stream_Element_Offset because we
+ wish to allow maximum flexibility. Most Stream_Element_Arrays
+ will probably have a lower bound of 0 or 1, but other lower
+ bounds, including negative ones, make sense in some
+ situations.
9.b/3
- {AI95-00114-01AI95-00114-01} {AI05-0005-1AI05-0005-1} Note
+ {<AI95-00114-01AI95-00114-01>} {<AI05-0005-1AI05-0005-1>} Note
that there are some language-defined subprograms that fill
part of a Stream_Element_Array, and return the index of the
last element filled as a Stream_Element_Offset. The Read
@@ -67355,12 +67597,12 @@ The Write operation appends Item to the specified
stream.
_Implementation Permissions_
9.1/1
-{8652/00448652/0044} {AI95-00181-01AI95-00181-01} If Stream_Element'Size
-is not a multiple of System.Storage_Unit, then the components of
-Stream_Element_Array need not be aliased.
+{<8652/00448652/0044>} {<AI95-00181-01AI95-00181-01>} If
+Stream_Element'Size is not a multiple of System.Storage_Unit, then the
+components of Stream_Element_Array need not be aliased.
9.b.1/2
- Ramification: {AI95-00114-01AI95-00114-01} If the
+ Ramification: {<AI95-00114-01AI95-00114-01>} If the
Stream_Element'Size is less than the size of
System.Storage_Unit, then components of Stream_Element_Array
need not be aliased. This is necessary as the components of
@@ -67375,7 +67617,7 @@ Stream_Element_Array need not be aliased.
Root_Stream_Type.
11/2
- 39 {AI95-00227-01AI95-00227-01} If the end of stream has been
+ 39 {<AI95-00227-01AI95-00227-01>} If the end of stream has been
reached, and Item'First is Stream_Element_Offset'First, Read will
raise Constraint_Error.
@@ -67386,17 +67628,18 @@ Stream_Element_Array need not be aliased.
_Extensions to Ada 95_
11.b/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added
pragma Preelaborable_Initialization to type Root_Stream_Type.
_Wording Changes from Ada 95_
11.c/2
- {8652/00448652/0044} {AI95-00181-01AI95-00181-01} Corrigendum:
- Stream elements are aliased presuming that makes sense.
+ {<8652/00448652/0044>} {<AI95-00181-01AI95-00181-01>}
+ Corrigendum: Stream elements are aliased presuming that makes
+ sense.
11.d/2
- {AI95-00227-01AI95-00227-01} Fixed the wording for Read to
+ {<AI95-00227-01AI95-00227-01>} Fixed the wording for Read to
properly define the result in Last when no stream elements are
transfered.
@@ -67407,31 +67650,32 @@ File: aarm2012.info, Node: 13.13.2, Prev: 13.13.1,
Up: 13.13
----------------------------------
1/3
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01}
-{AI05-0183-1AI05-0183-1} The type-related operational attributes Write,
-Read, Output, and Input convert values to a stream of elements and
-reconstruct values from a stream.
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+{<AI05-0183-1AI05-0183-1>} The type-related operational attributes
+Write, Read, Output, and Input convert values to a stream of elements
+and reconstruct values from a stream.
_Static Semantics_
1.1/2
-{AI95-00270-01AI95-00270-01} For every subtype S of an elementary type
-T, the following representation attribute is defined:
+{<AI95-00270-01AI95-00270-01>} For every subtype S of an elementary type
+<T>, the following representation attribute is defined:
1.2/3
S'Stream_Size
- {AI95-00270-01AI95-00270-01} {AI05-0194-1AI05-0194-1}
+ {<AI95-00270-01AI95-00270-01>} {<AI05-0194-1AI05-0194-1>}
Denotes the number of bits read from or written to a
stream by the default implementations of S'Read and
S'Write. Hence, the number of stream elements required
- per item of elementary type T is:
+ per item of elementary type <T> is:
1.3/2
- T'Stream_Size / Ada.Streams.Stream_Element'Size
+ <T>'Stream_Size / Ada.Streams.Stream_Element'Size
1.4/2
- The value of this attribute is of type universal_integer
- and is a multiple of Stream_Element'Size.
+ The value of this attribute is of type
+ <universal_integer> and is a multiple of
+ Stream_Element'Size.
1.5/2
Stream_Size may be specified for first subtypes via an
@@ -67448,7 +67692,7 @@ S'Stream_Size
13.1::).
1.c/3
- Ramification: {AI05-0194-1AI05-0194-1} The value of
+ Ramification: {<AI05-0194-1AI05-0194-1>} The value of
S'Stream_Size is unaffected by the presence or absence of any
attribute_definition_clauses or aspect_specifications
specifying the Read or Write attributes of any ancestor of S.
@@ -67459,11 +67703,11 @@ S'Stream_Size
_Implementation Advice_
1.6/2
-{AI95-00270-01AI95-00270-01} If not specified, the value of Stream_Size
-for an elementary type should be the number of bits that corresponds to
-the minimum number of stream elements required by the first subtype of
-the type, rounded up to the nearest factor or multiple of the word size
-that is also a multiple of the stream element size.
+{<AI95-00270-01AI95-00270-01>} If not specified, the value of
+Stream_Size for an elementary type should be the number of bits that
+corresponds to the minimum number of stream elements required by the
+first subtype of the type, rounded up to the nearest factor or multiple
+of the word size that is also a multiple of the stream element size.
1.d/2
Implementation Advice: If not specified, the value of
@@ -67474,7 +67718,7 @@ that is also a multiple of the stream element size.
multiple of the stream element size.
1.e/2
- Reason: {AI95-00270-01AI95-00270-01} This is Implementation
+ Reason: {<AI95-00270-01AI95-00270-01>} This is Implementation
Advice because we want to allow implementations to remain
compatible with their Ada 95 implementations, which may have a
different handling of the number of stream elements. Users
@@ -67482,14 +67726,14 @@ that is also a multiple of the stream element size.
of stream elements.
1.7/2
-{AI95-00270-01AI95-00270-01} The recommended level of support for the
+{<AI95-00270-01AI95-00270-01>} The recommended level of support for the
Stream_Size attribute is:
1.8/2
- * {AI95-00270-01AI95-00270-01} A Stream_Size clause should be
- supported for a discrete or fixed point type T if the specified
+ * {<AI95-00270-01AI95-00270-01>} A Stream_Size clause should be
+ supported for a discrete or fixed point type <T> if the specified
Stream_Size is a multiple of Stream_Element'Size and is no less
- than the size of the first subtype of T, and no greater than the
+ than the size of the first subtype of <T>, and no greater than the
size of the largest type of the same elementary class (signed
integer, modular integer, enumeration, ordinary fixed point, or
decimal fixed point).
@@ -67518,7 +67762,7 @@ Stream_Size attribute is:
_Static Semantics_
2
-For every subtype S of a specific type T, the following attributes are
+For every subtype S of a specific type <T>, the following attributes are
defined.
3
@@ -67527,12 +67771,12 @@ S'Write
specification:
4/2
- {AI95-00441-01AI95-00441-01} procedure S'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Write(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
5
- S'Write writes the value of Item to Stream.
+ S'Write writes the value of <Item> to <Stream>.
6
S'Read
@@ -67540,53 +67784,53 @@ S'Read
specification:
7/2
- {AI95-00441-01AI95-00441-01} procedure S'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Read(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>)
8
- S'Read reads the value of Item from Stream.
+ S'Read reads the value of <Item> from <Stream>.
8.1/3
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI95-00444-01AI95-00444-01} {AI05-0192-1AI05-0192-1} For an untagged
-derived type, the Write (resp. Read) attribute is inherited according
-to the rules given in *note 13.1:: if the attribute is [specified and]
-available for the parent type at the point where T is declared. For a
-tagged derived type, these attributes are not inherited, but rather the
-default implementations are used.
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI95-00444-01AI95-00444-01>} {<AI05-0192-1AI05-0192-1>} For an
+untagged derived type, the Write (resp. Read) attribute is inherited
+according to the rules given in *note 13.1:: if the attribute is
+[specified and] available for the parent type at the point where <T> is
+declared. For a tagged derived type, these attributes are not
+inherited, but rather the default implementations are used.
8.a.1/3
- Proof: {AI05-0192-1AI05-0192-1} The inheritance rules of *note
- 13.1:: say that only specified or inherited aspects are
+ Proof: {<AI05-0192-1AI05-0192-1>} The inheritance rules of
+ *note 13.1:: say that only specified or inherited aspects are
inherited; we mention it again here as a clarification.
8.2/2
-{AI95-00444-01AI95-00444-01} The default implementations of the Write
+{<AI95-00444-01AI95-00444-01>} The default implementations of the Write
and Read attributes, where available, execute as follows:
9/3
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI95-00195-01AI95-00195-01} {AI95-00251-01AI95-00251-01}
-{AI95-00270-01AI95-00270-01} {AI05-0139-2AI05-0139-2} For elementary
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI95-00195-01AI95-00195-01>} {<AI95-00251-01AI95-00251-01>}
+{<AI95-00270-01AI95-00270-01>} {<AI05-0139-2AI05-0139-2>} For elementary
types, Read reads (and Write writes) the number of stream elements
-implied by the Stream_Size for the type T; the representation of those
+implied by the Stream_Size for the type <T>; the representation of those
stream elements is implementation defined. For composite types, the
Write or Read attribute for each component is called in canonical order,
which is last dimension varying fastest for an array (unless the
convention of the array is Fortran, in which case it is first dimension
varying fastest), and positional aggregate order for a record. Bounds
-are not included in the stream if T is an array type. If T is a
+are not included in the stream if <T> is an array type. If <T> is a
discriminated type, discriminants are included only if they have
-defaults. If T is a tagged type, the tag is not included. For type
+defaults. If <T> is a tagged type, the tag is not included. For type
extensions, the Write or Read attribute for the parent type is called,
followed by the Write or Read attribute of each component of the
extension part, in canonical order. For a limited type extension, if
-the attribute of the parent type or any progenitor type of T is
-available anywhere within the immediate scope of T, and the attribute of
-the parent type or the type of any of the extension components is not
-available at the freezing point of T, then the attribute of T shall be
-directly specified.
+the attribute of the parent type or any progenitor type of <T> is
+available anywhere within the immediate scope of <T>, and the attribute
+of the parent type or the type of any of the extension components is not
+available at the freezing point of <T>, then the attribute of <T> shall
+be directly specified.
9.a/2
Implementation defined: The contents of the stream elements
@@ -67594,15 +67838,15 @@ directly specified.
elementary types.
9.1/3
-{AI05-0023-1AI05-0023-1} {AI05-0264-1AI05-0264-1} If T is a
+{<AI05-0023-1AI05-0023-1>} {<AI05-0264-1AI05-0264-1>} If <T> is a
discriminated type and its discriminants have defaults, then S'Read
-first reads the discriminants from the stream without modifying Item.
-S'Read then creates an object of type T constrained by these
+first reads the discriminants from the stream without modifying <Item>.
+S'Read then creates an object of type <T> constrained by these
discriminants. The value of this object is then converted to the
-subtype of Item and is assigned to Item. Finally, the Read attribute
-for each nondiscriminant component of Item is called in canonical order
-as described above. Normal default initialization and finalization take
-place for the created object.
+subtype of <Item> and is assigned to <Item>. Finally, the Read
+attribute for each nondiscriminant component of <Item> is called in
+canonical order as described above. Normal default initialization and
+finalization take place for the created object.
9.b
Reason: A discriminant with a default value is treated simply
@@ -67616,20 +67860,20 @@ place for the created object.
by 'Read. A tag is like a discriminant without a default.
9.b.1/1
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01} For limited
- type extensions, we must have a definition of 'Read and 'Write
- if the parent type has one, as it is possible to make a
- dispatching call through the attributes. The rule is designed
- to automatically do the right thing in as many cases as
- possible.
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>} For
+ limited type extensions, we must have a definition of 'Read
+ and 'Write if the parent type has one, as it is possible to
+ make a dispatching call through the attributes. The rule is
+ designed to automatically do the right thing in as many cases
+ as possible.
9.b.2/1
- {AI95-00251-01AI95-00251-01} Similarly, a type that has a
+ {<AI95-00251-01AI95-00251-01>} Similarly, a type that has a
progenitor with an available attribute must also have that
attribute, for the same reason.
9.b.3/3
- {AI05-0023-1AI05-0023-1} The semantics of S'Read for a
+ {<AI05-0023-1AI05-0023-1>} The semantics of S'Read for a
discriminated type with defaults involves an anonymous object
so that the point of required initialization and finalization
is well-defined, especially for objects that change shape and
@@ -67638,7 +67882,7 @@ place for the created object.
Permissions below).
9.c/2
- Ramification: {AI95-00195-01AI95-00195-01} For a composite
+ Ramification: {<AI95-00195-01AI95-00195-01>} For a composite
object, the subprogram denoted by the Write or Read attribute
of each component is called, whether it is the default or is
user-specified. Implementations are allowed to optimize these
@@ -67646,17 +67890,18 @@ place for the created object.
are preserved.
9.2/3
-{AI95-00270-01AI95-00270-01} {AI05-0264-1AI05-0264-1} Constraint_Error
-is raised by the predefined Write attribute if the value of the
-elementary item is outside the range of values representable using
-Stream_Size bits. For a signed integer type, an enumeration type, or a
-fixed point type, the range is unsigned only if the integer code for the
-lower bound of the first subtype is nonnegative, and a (symmetric)
-signed range that covers all values of the first subtype would require
-more than Stream_Size bits; otherwise, the range is signed.
+{<AI95-00270-01AI95-00270-01>} {<AI05-0264-1AI05-0264-1>}
+Constraint_Error is raised by the predefined Write attribute if the
+value of the elementary item is outside the range of values
+representable using Stream_Size bits. For a signed integer type, an
+enumeration type, or a fixed point type, the range is unsigned only if
+the integer code for the lower bound of the first subtype is
+nonnegative, and a (symmetric) signed range that covers all values of
+the first subtype would require more than Stream_Size bits; otherwise,
+the range is signed.
10
-For every subtype S'Class of a class-wide type T'Class:
+For every subtype S'Class of a class-wide type <T>'Class:
11
S'Class'Write
@@ -67664,9 +67909,9 @@ S'Class'Write
specification:
12/2
- {AI95-00441-01AI95-00441-01} procedure S'Class'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Class'Write(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
13
Dispatches to the subprogram denoted by the Write
@@ -67679,9 +67924,9 @@ S'Class'Read
specification:
15/2
- {AI95-00441-01AI95-00441-01} procedure S'Class'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T'Class)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Class'Read(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>'Class)
16
Dispatches to the subprogram denoted by the Read
@@ -67694,12 +67939,12 @@ S'Class'Read
in a generic, we don't necessarily know at compile time
whether a given type is specific or class-wide.
-Paragraph 17 was deleted.
+<Paragraph 17 was deleted.>
_Static Semantics_
18
-For every subtype S of a specific type T, the following attributes are
+For every subtype S of a specific type <T>, the following attributes are
defined.
19
@@ -67708,13 +67953,13 @@ S'Output
specification:
20/2
- {AI95-00441-01AI95-00441-01} procedure S'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Output(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
21
- S'Output writes the value of Item to Stream, including
- any bounds or discriminants.
+ S'Output writes the value of <Item> to <Stream>,
+ including any bounds or discriminants.
21.a
Ramification: Note that the bounds are included even for an
@@ -67726,71 +67971,71 @@ S'Input
specification:
23/2
- {AI95-00441-01AI95-00441-01} function S'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T
+ {<AI95-00441-01AI95-00441-01>} function S'Input(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>
24
- S'Input reads and returns one value from Stream, using
+ S'Input reads and returns one value from <Stream>, using
any bounds or discriminants written by a corresponding
S'Output to determine how much to read.
25/3
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI95-00444-01AI95-00444-01} {AI05-0192-1AI05-0192-1} For an untagged
-derived type, the Output (resp. Input) attribute is inherited according
-to the rules given in *note 13.1:: if the attribute is [specified and]
-available for the parent type at the point where T is declared. For a
-tagged derived type, these attributes are not inherited, but rather the
-default implementations are used.
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI95-00444-01AI95-00444-01>} {<AI05-0192-1AI05-0192-1>} For an
+untagged derived type, the Output (resp. Input) attribute is inherited
+according to the rules given in *note 13.1:: if the attribute is
+[specified and] available for the parent type at the point where <T> is
+declared. For a tagged derived type, these attributes are not
+inherited, but rather the default implementations are used.
25.a/3
- Proof: {AI05-0192-1AI05-0192-1} See the note following the
+ Proof: {<AI05-0192-1AI05-0192-1>} See the note following the
inheritance rules for the Write attribute, above.
25.1/2
-{AI95-00444-01AI95-00444-01} The default implementations of the Output
+{<AI95-00444-01AI95-00444-01>} The default implementations of the Output
and Input attributes, where available, execute as follows:
26/3
- * {AI05-0269-1AI05-0269-1} If T is an array type, S'Output first
- writes the bounds, and S'Input first reads the bounds. If T has
+ * {<AI05-0269-1AI05-0269-1>} If <T> is an array type, S'Output first
+ writes the bounds, and S'Input first reads the bounds. If <T> has
discriminants without defaults, S'Output first writes the
discriminants (using the Write attribute of the discriminant type
for each), and S'Input first reads the discriminants (using the
Read attribute of the discriminant type for each).
27/3
- * {AI95-00195-01AI95-00195-01} {AI05-0023-1AI05-0023-1} S'Output then
- calls S'Write to write the value of Item to the stream. S'Input
- then creates an object of type T, with the bounds or (when without
- defaults) the discriminants, if any, taken from the stream, passes
- it to S'Read, and returns the value of the object. If T has
- discriminants, then this object is unconstrained if and only the
- discriminants have defaults. Normal default initialization and
- finalization take place for this object (see *note 3.3.1::, *note
- 7.6::, and *note 7.6.1::).
+ * {<AI95-00195-01AI95-00195-01>} {<AI05-0023-1AI05-0023-1>} S'Output
+ then calls S'Write to write the value of <Item> to the stream.
+ S'Input then creates an object of type <T>, with the bounds or
+ (when without defaults) the discriminants, if any, taken from the
+ stream, passes it to S'Read, and returns the value of the object.
+ If <T> has discriminants, then this object is unconstrained if and
+ only the discriminants have defaults. Normal default
+ initialization and finalization take place for this object (see
+ *note 3.3.1::, *note 7.6::, and *note 7.6.1::).
27.1/2
-{AI95-00251-01AI95-00251-01} If T is an abstract type, then S'Input is
-an abstract function.
+{<AI95-00251-01AI95-00251-01>} If <T> is an abstract type, then S'Input
+is an abstract function.
27.a/2
- Ramification: For an abstract type T, S'Input can be called in
- a dispatching call, or passed to an abstract formal
+ Ramification: For an abstract type <T>, S'Input can be called
+ in a dispatching call, or passed to an abstract formal
subprogram. But it cannot be used in nondispatching contexts,
because we don't allow objects of abstract types to exist.
The designation of this function as abstract has no impact on
- descendants of T, as T'Input is not inherited for tagged
+ descendants of <T>, as <T>'Input is not inherited for tagged
types, but rather recreated (and the default implementation of
- T'Input calls T'Read, not the parent type's T'Input). Note
- that T'Input cannot be specified in this case, as any function
- with the proper profile is necessarily abstract, and
+ <T>'Input calls <T>'Read, not the parent type's <T>'Input).
+ Note that <T>'Input cannot be specified in this case, as any
+ function with the proper profile is necessarily abstract, and
specifying abstract subprograms in an
attribute_definition_clause is illegal.
28
-For every subtype S'Class of a class-wide type T'Class:
+For every subtype S'Class of a class-wide type <T>'Class:
29
S'Class'Output
@@ -67798,21 +68043,22 @@ S'Class'Output
specification:
30/2
- {AI95-00441-01AI95-00441-01} procedure S'Class'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ {<AI95-00441-01AI95-00441-01>} procedure S'Class'Output(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
31/2
- {AI95-00344-01AI95-00344-01} First writes the external
- tag of Item to Stream (by calling String'Output(Stream,
- Tags.External_Tag(Item'Tag)) -- see *note 3.9::) and then
- dispatches to the subprogram denoted by the Output
- attribute of the specific type identified by the tag.
- Tag_Error is raised if the tag of Item identifies a type
- declared at an accessibility level deeper than that of S.
+ {<AI95-00344-01AI95-00344-01>} First writes the external
+ tag of <Item> to <Stream> (by calling
+ String'Output(<Stream>, Tags.External_Tag(<Item>'Tag)) --
+ see *note 3.9::) and then dispatches to the subprogram
+ denoted by the Output attribute of the specific type
+ identified by the tag. Tag_Error is raised if the tag of
+ Item identifies a type declared at an accessibility level
+ deeper than that of S.
31.a/2
- Reason: {AI95-00344-01AI95-00344-01} We raise Tag_Error here
+ Reason: {<AI95-00344-01AI95-00344-01>} We raise Tag_Error here
for nested types as such a type cannot be successfully read
with S'Class'Input, and it doesn't make sense to allow writing
a value that cannot be read.
@@ -67823,33 +68069,34 @@ S'Class'Input
specification:
33/2
- {AI95-00441-01AI95-00441-01} function S'Class'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T'Class
+ {<AI95-00441-01AI95-00441-01>} function S'Class'Input(
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>'Class
34/3
- {AI95-00279-01AI95-00279-01} {AI95-00344-01AI95-00344-01}
- {AI05-0109-1AI05-0109-1} First reads the external tag
- from Stream and determines the corresponding internal tag
- (by calling Tags.Descendant_Tag(String'Input(Stream),
- S'Tag) which might raise Tag_Error -- see *note 3.9::)
- and then dispatches to the subprogram denoted by the
- Input attribute of the specific type identified by the
- internal tag; returns that result. If the specific type
+ {<AI95-00279-01AI95-00279-01>}
+ {<AI95-00344-01AI95-00344-01>} {<AI05-0109-1AI05-0109-1>}
+ First reads the external tag from <Stream> and determines
+ the corresponding internal tag (by calling
+ Tags.Descendant_Tag(String'Input(<Stream>), S'Tag) which
+ might raise Tag_Error -- see *note 3.9::) and then
+ dispatches to the subprogram denoted by the Input
+ attribute of the specific type identified by the internal
+ tag; returns that result. If the specific type
identified by the internal tag is abstract,
Constraint_Error is raised.
34.a/3
- Ramification: {AI05-0109-1AI05-0109-1} Descendant_Tag will
+ Ramification: {<AI05-0109-1AI05-0109-1>} Descendant_Tag will
ensure that the tag it returns is covered by T'Class;
Tag_Error will be raised if it would not cover T'Class.
35/3
-{AI95-00195-01AI95-00195-01} {AI05-0228-1AI05-0228-1} In the default
+{<AI95-00195-01AI95-00195-01>} {<AI05-0228-1AI05-0228-1>} In the default
implementation of Read and Input for a composite type, for each scalar
component that is a discriminant or that has an implicit initial value,
a check is made that the value returned by Read for the component
-belongs to its subtype. Constraint_Error is raised if this check fails.
+belongs to its subtype. Constraint_Error is raised if this check fails.
For other scalar components, no check is made. For each component that
is of an access type, if the implementation can detect that the value
returned by Read for the component is not a value of its subtype,
@@ -67863,63 +68110,64 @@ of the actual parameter. Constraint_Error is raised
if this check
fails.
35.a/3
- Reason: {AI05-0228-1AI05-0228-1} The check for scalar
+ Reason: {<AI05-0228-1AI05-0228-1>} The check for scalar
components that have an implicit initial value is to preserve
our Language Design Principle that all objects that have an
implicit initial value do not become "deinitialized".
35.b/3
- Ramification: {AI05-0228-1AI05-0228-1} A scalar component can
- have an implicit initial value if it has a default_expression,
- if the component's type has the Default_Value aspect
- specified, or if the component is that of an array type that
- has the Default_Component_Value aspect specified.
+ Ramification: {<AI05-0228-1AI05-0228-1>} A scalar component
+ can have an implicit initial value if it has a
+ default_expression, if the component's type has the
+ Default_Value aspect specified, or if the component is that of
+ an array type that has the Default_Component_Value aspect
+ specified.
35.c/3
- To be honest: {AI05-0228-1AI05-0228-1} An implementation
+ To be honest: {<AI05-0228-1AI05-0228-1>} An implementation
should always be able to detect the error for a null value
read into a component of an access subtype with a null
exclusion; the "if the implementation can detect" is intended
to cover nonnull access values.
36/2
-{AI95-00195-01AI95-00195-01} It is unspecified at which point and in
+{<AI95-00195-01AI95-00195-01>} It is unspecified at which point and in
which order these checks are performed. In particular, if
Constraint_Error is raised due to the failure of one of these checks, it
is unspecified how many stream elements have been read from the stream.
37/1
-{8652/00458652/0045} {AI95-00132-01AI95-00132-01} In the default
+{<8652/00458652/0045>} {<AI95-00132-01AI95-00132-01>} In the default
implementation of Read and Input for a type, End_Error is raised if the
end of the stream is reached before the reading of a value of the type
is completed.
38/4
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01}
-{AI95-00195-01AI95-00195-01} {AI95-00251-01AI95-00251-01}
-{AI05-0039-1AI05-0039-1} {AI12-0106-1AI12-0106-1}
-{AI12-0121-1AI12-0121-1} The stream-oriented attributes may be specified
-for any type via an attribute_definition_clause. [Alternatively, each
-of the specific stream-oriented attributes may be specified using an
-aspect_specification on any type_declaration, with the aspect name being
-the corresponding attribute name.] Each of the class-wide
-stream-oriented attributes may be specified using an
-aspect_specification for a tagged type T using the name of the
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+{<AI95-00195-01AI95-00195-01>} {<AI95-00251-01AI95-00251-01>}
+{<AI05-0039-1AI05-0039-1>} {<AI12-0106-1AI12-0106-1>}
+{<AI12-0121-1AI12-0121-1>} The stream-oriented attributes may be
+specified for any type via an attribute_definition_clause.
+[Alternatively, each of the specific stream-oriented attributes may be
+specified using an aspect_specification on any type_declaration, with
+the aspect name being the corresponding attribute name.] Each of the
+class-wide stream-oriented attributes may be specified using an
+aspect_specification for a tagged type <T> using the name of the
stream-oriented attribute followed by 'Class; such class-wide aspects do
-not apply to other descendants of T.
+not apply to other descendants of <T>.
38.a/4
- Reason: {AI95-00195-01AI95-00195-01} {AI12-0106-1AI12-0106-1}
- We need the last sentence to override the blanket rule given
- in *note 13.1.1:: that aspect'Class applies to the type and
- all descendants.
+ Reason: {<AI95-00195-01AI95-00195-01>}
+ {<AI12-0106-1AI12-0106-1>} We need the last sentence to
+ override the blanket rule given in *note 13.1.1:: that
+ aspect'Class applies to the type and all descendants.
38.a.1/2
- This paragraph was deleted.{8652/00408652/0040}
- {AI95-00108-01AI95-00108-01} {AI95-00195-01AI95-00195-01}
+ <This paragraph was deleted.>{<8652/00408652/0040>}
+ {<AI95-00108-01AI95-00108-01>} {<AI95-00195-01AI95-00195-01>}
38.a.2/4
- Proof: {AI12-0121-1AI12-0121-1} *note 13.1.1:: says that all
+ Proof: {<AI12-0121-1AI12-0121-1>} *note 13.1.1:: says that all
operational attributes can be specified with an
aspect_specification.
@@ -67944,7 +68192,7 @@ not apply to other descendants of T.
given type, including any bounds and discriminants.
38.1/4
-{AI12-0121-1AI12-0121-1} The subprogram name given in such an
+{<AI12-0121-1AI12-0121-1>} The subprogram name given in such an
attribute_definition_clause (*note 13.3: S0310.) or aspect_specification
(*note 13.1.1: S0307.) shall statically denote a subprogram that is not
an abstract subprogram. Furthermore, if a specific stream-oriented
@@ -67953,7 +68201,7 @@ in the attribute_definition_clause or
aspect_specification shall
statically denote a null procedure.
38.b/2
- Discussion: {AI95-00251-01AI95-00251-01} Stream attributes
+ Discussion: {<AI95-00251-01AI95-00251-01>} Stream attributes
(other than Input) are always null procedures for interface
types (they have no components). We need to allow explicit
setting of the Read and Write attributes in order that the
@@ -67991,7 +68239,7 @@ statically denote a null procedure.
special rule for that.
38.f/2
- Discussion: {AI95-00195-01AI95-00195-01} Limited types
+ Discussion: {<AI95-00195-01AI95-00195-01>} Limited types
generally do not have default implementations of the
stream-oriented attributes. The rules defining when a
stream-oriented attribute is available (see below) determine
@@ -68021,25 +68269,25 @@ statically denote a null procedure.
discriminants.
39/2
-{AI95-00195-01AI95-00195-01} A stream-oriented attribute for a subtype
-of a specific type T is available at places where one of the following
-conditions is true:
+{<AI95-00195-01AI95-00195-01>} A stream-oriented attribute for a subtype
+of a specific type <T> is <available> at places where one of the
+following conditions is true:
40/2
- * T is nonlimited.
+ * <T> is nonlimited.
41/2
- * The attribute_designator is Read (resp. Write) and T is a limited
- record extension, and the attribute Read (resp. Write) is
- available for the parent type of T and for the types of all of the
- extension components.
+ * The attribute_designator is Read (resp. Write) and <T> is a
+ limited record extension, and the attribute Read (resp. Write) is
+ available for the parent type of <T> and for the types of all of
+ the extension components.
41.a/2
Reason: In this case, the language provides a well-defined
default implementation, which we want to be able to call.
42/2
- * T is a limited untagged derived type, and the attribute was
+ * <T> is a limited untagged derived type, and the attribute was
inherited for the type.
42.a/2
@@ -68048,9 +68296,9 @@ conditions is true:
attributes.
43/2
- * The attribute_designator is Input (resp. Output), and T is a
+ * The attribute_designator is Input (resp. Output), and <T> is a
limited type, and the attribute Read (resp. Write) is available
- for T.
+ for <T>.
43.a/2
Reason: The default implementation of Input and Output are
@@ -68071,12 +68319,12 @@ conditions is true:
(see *note 8.3::).
45/2
-{AI95-00195-01AI95-00195-01} A stream-oriented attribute for a subtype
-of a class-wide type T'Class is available at places where one of the
+{<AI95-00195-01AI95-00195-01>} A stream-oriented attribute for a subtype
+of a class-wide type <T>'Class is available at places where one of the
following conditions is true:
46/2
- * T is nonlimited;
+ * <T> is nonlimited;
47/2
* the attribute has been specified via an
@@ -68084,9 +68332,9 @@ following conditions is true:
visible; or
48/2
- * the corresponding attribute of T is available, provided that if T
- has a partial view, the corresponding attribute is available at the
- end of the visible part where T is declared.
+ * the corresponding attribute of <T> is available, provided that if
+ <T> has a partial view, the corresponding attribute is available at
+ the end of the visible part where <T> is declared.
48.a/2
Reason: The rules are stricter for class-wide attributes
@@ -68099,11 +68347,11 @@ following conditions is true:
significant limitation.
49/4
-{AI95-00195-01AI95-00195-01} {AI12-0030-1AI12-0030-1} An
+{<AI95-00195-01AI95-00195-01>} {<AI12-0030-1AI12-0030-1>} An
attribute_reference for one of the stream-oriented attributes is illegal
unless the attribute is available at the place of the
-attribute_reference. Furthermore, an attribute_reference for T'Input is
-illegal if T is an abstract type. In addition to the places where
+attribute_reference. Furthermore, an attribute_reference for <T>'Input
+is illegal if <T> is an abstract type. In addition to the places where
Legality Rules normally apply (see *note 12.3::), these rules also apply
in the private part of an instance of a generic unit.
@@ -68115,17 +68363,18 @@ in the private part of an instance of a generic unit.
private types.
49.b/2
- T'Input is available for abstract types so that T'Class'Input
- is available. But we certainly don't want to allow calls that
- could create an object of an abstract type. Remember that
- T'Class is never abstract, so the above legality rule doesn't
- apply to it. We don't have to discuss whether the attribute
- is specified, as it cannot be: any function returning the type
- would have to be abstract, and we do not allow specifying an
- attribute with an abstract subprogram.
+ <T>'Input is available for abstract types so that
+ <T>'Class'Input is available. But we certainly don't want to
+ allow calls that could create an object of an abstract type.
+ Remember that <T>'Class is never abstract, so the above
+ legality rule doesn't apply to it. We don't have to discuss
+ whether the attribute is specified, as it cannot be: any
+ function returning the type would have to be abstract, and we
+ do not allow specifying an attribute with an abstract
+ subprogram.
49.c/4
- To be honest: {AI12-0030-1AI12-0030-1} "These rules apply"
+ To be honest: {<AI12-0030-1AI12-0030-1>} "These rules apply"
refers to just this paragraph and not to the rest of the rules
in this section. This rule probably should have been a
Legality Rule, but the word "illegal" should key the reader
@@ -68133,15 +68382,15 @@ in the private part of an instance of a generic unit.
heading it occurs.
49.1/4
-{AI12-0030-1AI12-0030-1} Unless inherited from a parent type, if any,
+{<AI12-0030-1AI12-0030-1>} Unless inherited from a parent type, if any,
for an untagged type having a task, protected, or explicitly limited
record part, the default implementation of each of the Read, Write,
Input, and Output attributes raises Program_Error and performs no other
action.
49.d/4
- Discussion: {AI12-0030-1AI12-0030-1} It might seem that there
- is no need to specify the behavior of the default
+ Discussion: {<AI12-0030-1AI12-0030-1>} It might seem that
+ there is no need to specify the behavior of the default
implementation of a streaming attribute of, for example, a
task type because there is no way that it can be invoked. It
is possible, however, to construct an example where such a
@@ -68154,22 +68403,22 @@ action.
and the specification was therefore not inherited).
50/3
-{AI95-00195-01AI95-00195-01} {AI05-0192-1AI05-0192-1} In the
+{<AI95-00195-01AI95-00195-01>} {<AI05-0192-1AI05-0192-1>} In the
parameter_and_result_profiles for the default implementations of the
stream-oriented attributes, the subtype of the Item parameter is the
-base subtype of T if T is a scalar type, and the first subtype
+base subtype of <T> if <T> is a scalar type, and the first subtype
otherwise. The same rule applies to the result of the Input attribute.
50.a/3
- Discussion: {AI05-0192-1AI05-0192-1} An inherited stream
+ Discussion: {<AI05-0192-1AI05-0192-1>} An inherited stream
attribute has a profile as determined by the rules for
inheriting primitive subprograms (see *note 13.1:: and *note
3.4::).
51/3
-{AI95-00195-01AI95-00195-01} {AI05-0007-1AI05-0007-1} For an
+{<AI95-00195-01AI95-00195-01>} {<AI05-0007-1AI05-0007-1>} For an
attribute_definition_clause specifying one of these attributes, the
-subtype of the Item parameter shall be the first subtype or the base
+subtype of the <Item> parameter shall be the first subtype or the base
subtype if scalar, and the first subtype if not scalar. The same rule
applies to the result of the Input function.
@@ -68186,10 +68435,10 @@ applies to the result of the Input function.
definition of the scalar type.
52/3
-{AI95-00366-01AI95-00366-01} {AI05-0065-1AI05-0065-1} [A type is said to
-support external streaming if Read and Write attributes are provided for
-sending values of such a type between active partitions, with Write
-marshalling the representation, and Read unmarshalling the
+{<AI95-00366-01AI95-00366-01>} {<AI05-0065-1AI05-0065-1>} [A type is
+said to <support external streaming> if Read and Write attributes are
+provided for sending values of such a type between active partitions,
+with Write marshalling the representation, and Read unmarshalling the
representation.] A limited type supports external streaming only if it
has available Read and Write attributes. A type with a part that is of
a nonremote access type supports external streaming only if that access
@@ -68207,7 +68456,7 @@ support external streaming.
_Erroneous Execution_
53/2
-{AI95-00279-01AI95-00279-01} {AI95-00344-01AI95-00344-01} If the
+{<AI95-00279-01AI95-00279-01>} {<AI95-00344-01AI95-00344-01>} If the
internal tag returned by Descendant_Tag to T'Class'Input identifies a
type that is not library-level and whose tag has not been created, or
does not exist in the partition at the time of the call, execution is
@@ -68222,14 +68471,14 @@ erroneous.
_Implementation Requirements_
54/1
-{8652/00408652/0040} {AI95-00108-01AI95-00108-01} For every subtype S of
-a language-defined nonlimited specific type T, the output generated by
-S'Output or S'Write shall be readable by S'Input or S'Read,
+{<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>} For every subtype
+<S> of a language-defined nonlimited specific type <T>, the output
+generated by S'Output or S'Write shall be readable by S'Input or S'Read,
respectively. This rule applies across partitions if the implementation
conforms to the Distributed Systems Annex.
55/3
-{AI95-00195-01AI95-00195-01} {AI05-0092-1AI05-0092-1} If
+{<AI95-00195-01AI95-00195-01>} {<AI05-0092-1AI05-0092-1>} If
Constraint_Error is raised during a call to Read because of failure of
one the above checks, the implementation shall ensure that the
discriminants of the actual parameter of Read are not modified.
@@ -68237,7 +68486,7 @@ discriminants of the actual parameter of Read are not
modified.
_Implementation Permissions_
56/3
-{AI95-00195-01AI95-00195-01} {AI05-0092-1AI05-0092-1} The number of
+{<AI95-00195-01AI95-00195-01>} {<AI05-0092-1AI05-0092-1>} The number of
calls performed by the predefined implementation of the stream-oriented
attributes on the Read and Write operations of the stream type is
unspecified. An implementation may take advantage of this permission to
@@ -68249,25 +68498,25 @@ in the program text, possibly through a generic
instantiation (see *note
12.3::).
56.1/3
-{AI05-0023-1AI05-0023-1} {AI05-0264-1AI05-0264-1} If T is a
+{<AI05-0023-1AI05-0023-1>} {<AI05-0264-1AI05-0264-1>} If <T> is a
discriminated type and its discriminants have defaults, then in two
cases an execution of the default implementation of S'Read is not
-required to create an anonymous object of type T: If the discriminant
+required to create an anonymous object of type <T>: If the discriminant
values that are read in are equal to the corresponding discriminant
-values of Item, then no object of type T need be created and Item may be
-used instead. If they are not equal and Item is a constrained variable,
-then Constraint_Error may be raised at that point, before any further
-values are read from the stream and before the object of type T is
-created.
+values of <Item>, then no object of type <T> need be created and <Item>
+may be used instead. If they are not equal and <Item> is a constrained
+variable, then Constraint_Error may be raised at that point, before any
+further values are read from the stream and before the object of type
+<T> is created.
56.2/3
-{AI05-0023-1AI05-0023-1} A default implementation of S'Input that calls
-the default implementation of S'Read may create a constrained anonymous
-object with discriminants that match those in the stream.
+{<AI05-0023-1AI05-0023-1>} A default implementation of S'Input that
+calls the default implementation of S'Read may create a constrained
+anonymous object with discriminants that match those in the stream.
56.a/3
Implementation Note: This allows the combined executions of
- S'Input and S'Read to create one object of type T instead of
+ S'Input and S'Read to create one object of type <T> instead of
two. If this option is exercised, then:
56.b/3
@@ -68275,7 +68524,7 @@ object with discriminants that match those in the
stream.
not S'Read.
56.c/3
- * S'Input declares an object of type T constrained by the
+ * S'Input declares an object of type <T> constrained by the
discriminants read from the stream, not an unconstrained
object.
@@ -68285,17 +68534,17 @@ object with discriminants that match those in the
stream.
56.e/3
* The permissions of the preceding paragraph then apply and
- no object of type T need be created by the execution of
+ no object of type <T> need be created by the execution of
S'Read.
NOTES
57
- 40 For a definite subtype S of a type T, only T'Write and T'Read
- are needed to pass an arbitrary value of the subtype through a
- stream. For an indefinite subtype S of a type T, T'Output and
- T'Input will normally be needed, since T'Write and T'Read do not
- pass bounds, discriminants, or tags.
+ 40 For a definite subtype S of a type <T>, only <T>'Write and
+ <T>'Read are needed to pass an arbitrary value of the subtype
+ through a stream. For an indefinite subtype S of a type <T>,
+ <T>'Output and <T>'Input will normally be needed, since <T>'Write
+ and <T>'Read do not pass bounds, discriminants, or tags.
58
41 User-specified attributes of S'Class are not inherited by other
@@ -68304,34 +68553,34 @@ object with discriminants that match those in the
stream.
_Examples_
59
-Example of user-defined Write attribute:
+<Example of user-defined Write attribute:>
60/2
- {AI95-00441-01AI95-00441-01} procedure My_Write(
+ {<AI95-00441-01AI95-00441-01>} procedure My_Write(
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Item : My_Integer'Base);
for My_Integer'Write use My_Write;
60.a
- Discussion: Example of network input/output using input output
- attributes:
+ Discussion: <Example of network input/output using input
+ output attributes:>
60.b
with Ada.Streams; use Ada.Streams;
generic
type Msg_Type(<>) is private;
package Network_IO is
- -- Connect/Disconnect are used to establish the stream
+ --< Connect/Disconnect are used to establish the stream>
procedure Connect(...);
procedure Disconnect(...);
60.c
- -- Send/Receive transfer messages across the network
+ --< Send/Receive transfer messages across the network>
procedure Send(X : in Msg_Type);
function Receive return Msg_Type;
private
type Network_Stream is new Root_Stream_Type with ...
- procedure Read(...); -- define Read/Write for
Network_Stream
+ procedure Read(...); --< define Read/Write for
Network_Stream>
procedure Write(...);
end Network_IO;
@@ -68359,38 +68608,38 @@ Example of user-defined Write attribute:
_Inconsistencies With Ada 95_
60.g/2
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01} Corrigendum:
- Clarified how the default implementation for stream attributes
- is determined (eliminating conflicting language). The new
- wording provides that attributes for type extensions are
- created by composing the parent's attribute with those for the
- extension components if any. If a program was written
- assuming that the extension components were not included in
- the stream (as in original Ada 95), it would fail to work in
- the language as corrected by the Corrigendum.
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+ Corrigendum: Clarified how the default implementation for
+ stream attributes is determined (eliminating conflicting
+ language). The new wording provides that attributes for type
+ extensions are created by composing the parent's attribute
+ with those for the extension components if any. If a program
+ was written assuming that the extension components were not
+ included in the stream (as in original Ada 95), it would fail
+ to work in the language as corrected by the Corrigendum.
60.h/2
- {AI95-00195-01AI95-00195-01} Amendment Correction: Explicitly
- provided a permission that the number of calls to the
- underlying stream Read and Write operations may differ from
- the number determined by the canonical operations. If Ada 95
- code somehow depended on the number of calls to Read or Write,
- it could fail with an Ada 2005 implementation. Such code is
- likely to be very rare; moreover, such code is really wrong,
- as the permission applies to Ada 95 as well.
+ {<AI95-00195-01AI95-00195-01>} Amendment Correction:
+ Explicitly provided a permission that the number of calls to
+ the underlying stream Read and Write operations may differ
+ from the number determined by the canonical operations. If
+ Ada 95 code somehow depended on the number of calls to Read or
+ Write, it could fail with an Ada 2005 implementation. Such
+ code is likely to be very rare; moreover, such code is really
+ wrong, as the permission applies to Ada 95 as well.
_Extensions to Ada 95_
60.i/2
- {AI95-00270-01AI95-00270-01} The Stream_Size attribute is new.
- It allows specifying the number of bits that will be streamed
- for a type. The Implementation Advice involving this also was
- changed; this is not incompatible because Implementation
- Advice does not have to be followed.
+ {<AI95-00270-01AI95-00270-01>} The Stream_Size attribute is
+ new. It allows specifying the number of bits that will be
+ streamed for a type. The Implementation Advice involving this
+ also was changed; this is not incompatible because
+ Implementation Advice does not have to be followed.
60.j/2
- {8652/00408652/0040} {AI95-00108-01AI95-00108-01}
- {AI95-00195-01AI95-00195-01} {AI95-00444-01AI95-00444-01}
+ {<8652/00408652/0040>} {<AI95-00108-01AI95-00108-01>}
+ {<AI95-00195-01AI95-00195-01>} {<AI95-00444-01AI95-00444-01>}
Corrigendum: Limited types may have default constructed
attributes if all of the parent and (for extensions) extension
components have available attributes. Ada 2005 adds the
@@ -68400,33 +68649,33 @@ Example of user-defined Write attribute:
_Wording Changes from Ada 95_
60.k/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Added wording to specify that these are operational
- attributes.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Added wording to specify that these are
+ operational attributes.
60.l/2
- {8652/00458652/0045} {AI95-00132-01AI95-00132-01} Corrigendum:
- Clarified that End_Error is raised by the default
+ {<8652/00458652/0045>} {<AI95-00132-01AI95-00132-01>}
+ Corrigendum: Clarified that End_Error is raised by the default
implementation of Read and Input if the end of the stream is
reached. (The result could have been abnormal without this
clarification, thus this is not an inconsistency, as the
programmer could not have depended on the previous behavior.)
60.m/2
- {AI95-00195-01AI95-00195-01} Clarified that the default
+ {<AI95-00195-01AI95-00195-01>} Clarified that the default
implementation of S'Input does normal initialization on the
object that it passes to S'Read.
60.n/2
- {AI95-00195-01AI95-00195-01} Explicitly stated that what is
+ {<AI95-00195-01AI95-00195-01>} Explicitly stated that what is
read from a stream when a required check fails is unspecified.
60.o/2
- {AI95-00251-01AI95-00251-01} Defined availability and default
- implementations for types with progenitors.
+ {<AI95-00251-01AI95-00251-01>} Defined availability and
+ default implementations for types with progenitors.
60.p/2
- {AI95-00279-01AI95-00279-01} Specified that Constraint_Error
+ {<AI95-00279-01AI95-00279-01>} Specified that Constraint_Error
is raised if the internal tag retrieved for S'Class'Input is
for some type not covered by S'Class or is abstract. We also
explicitly state that the program is erroneous if the tag has
@@ -68436,20 +68685,20 @@ Example of user-defined Write attribute:
not considered an inconsistency.)
60.q/2
- {AI95-00344-01AI95-00344-01} Added wording to support nested
+ {<AI95-00344-01AI95-00344-01>} Added wording to support nested
type extensions. S'Input and S'Output always raise Tag_Error
for such extensions, and such extensions were not permitted in
Ada 95, so this is neither an extension nor an
incompatibility.
60.r/2
- {AI95-00366-01AI95-00366-01} Defined supports external
- streaming to put all of the rules about "good" stream
+ {<AI95-00366-01AI95-00366-01>} Defined <supports external
+ streaming> to put all of the rules about "good" stream
attributes in one place. This is used for distribution and
for defining pragma Pure.
60.s/2
- {AI95-00441-01AI95-00441-01} Added the not null qualifier to
+ {<AI95-00441-01AI95-00441-01>} Added the not null qualifier to
the first parameter of all of the stream attributes, so that
the semantics doesn't change between Ada 95 and Ada 2005.
This change is compatible, because mode conformance is
@@ -68457,7 +68706,7 @@ Example of user-defined Write attribute:
null_exclusions are not considered for mode conformance.
60.t/2
- {AI95-00444-01AI95-00444-01} Improved the wording to make it
+ {<AI95-00444-01AI95-00444-01>} Improved the wording to make it
clear that we don't define the default implementations of
attributes that cannot be called (that is, aren't
"available"). Also clarified when inheritance takes place.
@@ -68465,17 +68714,18 @@ Example of user-defined Write attribute:
_Incompatibilities With Ada 2005_
60.u/3
- {AI05-0039-1AI05-0039-1} Correction: Added a requirement that
- stream attributes be specified by a static subprogram name
- rather than a dynamic expression. Expressions cannot provide
- any useful functionality because of the freezing rules, and
- the possibility of them complicates implementations. Only
- pathological programs should be affected.
+ {<AI05-0039-1AI05-0039-1>} Correction: Added a requirement
+ that stream attributes be specified by a static subprogram
+ name rather than a dynamic expression. Expressions cannot
+ provide any useful functionality because of the freezing
+ rules, and the possibility of them complicates
+ implementations. Only pathological programs should be
+ affected.
_Extensions to Ada 2005_
60.v/3
- {AI05-0007-1AI05-0007-1} Correction: Stream attributes for
+ {<AI05-0007-1AI05-0007-1>} Correction: Stream attributes for
scalar types can be specified with subprograms that take the
first subtype as well as the base type. This eliminates
confusion about which subtype is appropriate for attributes
@@ -68485,45 +68735,46 @@ Example of user-defined Write attribute:
_Wording Changes from Ada 2005_
60.w/3
- {AI05-0023-1AI05-0023-1} Correction: Corrected the definition
- of the default version S'Read and S'Input to be well-defined
- if S is a discriminated type with defaulted discriminants and
- some components require initialization and/or finalizations.
+ {<AI05-0023-1AI05-0023-1>} Correction: Corrected the
+ definition of the default version S'Read and S'Input to be
+ well-defined if S is a discriminated type with defaulted
+ discriminants and some components require initialization
+ and/or finalizations.
60.x/3
- {AI05-0065-1AI05-0065-1} Correction: Defined remote access
+ {<AI05-0065-1AI05-0065-1>} Correction: Defined remote access
types to support external streaming, since that is their
purpose.
60.y/3
- {AI05-0109-1AI05-0109-1} Correction: Removed a misleading
+ {<AI05-0109-1AI05-0109-1>} Correction: Removed a misleading
phrase which implies that Constraint_Error is raised for
internal tags of the wrong type, when Tag_Error should be
raised for such tags.
60.z/3
- {AI05-0139-2AI05-0139-2} Clarified that arrays with convention
- Fortran are written in column-major order, rather then
- row-major order. This is necessary in order that streaming of
- Fortran arrays is efficient.
+ {<AI05-0139-2AI05-0139-2>} Clarified that arrays with
+ convention Fortran are written in column-major order, rather
+ then row-major order. This is necessary in order that
+ streaming of Fortran arrays is efficient.
60.aa/3
- {AI05-0192-1AI05-0192-1} Correction: Clarified that the
+ {<AI05-0192-1AI05-0192-1>} Correction: Clarified that the
profile of an inherited stream attribute is as defined for an
inherited primitive subprogram, while the default
implementation of the same attribute might have a different
profile.
60.bb/3
- {AI05-0194-1AI05-0194-1} Correction: Clarified that
+ {<AI05-0194-1AI05-0194-1>} Correction: Clarified that
Stream_Size has no effect on and is not effected by
user-defined stream attributes.
_Extensions to Ada 2012_
60.cc/4
- {AI12-0106-1AI12-0106-1} Corrigendum: Defined how to specify a
- class-wide stream-oriented attribute using an
+ {<AI12-0106-1AI12-0106-1>} Corrigendum: Defined how to specify
+ a class-wide stream-oriented attribute using an
aspect_specification. It was always intended that this was
possible, but the method was not clear, as a class-wide type
never has an explicit declaration.
@@ -68531,7 +68782,7 @@ Example of user-defined Write attribute:
_Wording Changes from Ada 2012_
60.dd/4
- {AI12-0030-1AI12-0030-1} Corrigendum: Defined the runtime
+ {<AI12-0030-1AI12-0030-1>} Corrigendum: Defined the runtime
effect of stream attributes for untagged limited types, as
there is a weird corner case where they can be called. We
don't specify this as an inconsistency, as it doesn't make
@@ -68539,8 +68790,8 @@ Example of user-defined Write attribute:
been done with that, so it should not exist in any programs.
60.ee/4
- {AI12-0106-1AI12-0106-1} Corrigendum: Clarified that the same
- Legality Rules apply when a stream-oriented attribute is
+ {<AI12-0106-1AI12-0106-1>} Corrigendum: Clarified that the
+ same Legality Rules apply when a stream-oriented attribute is
specified via an aspect_specification as applied when it is
specified via an attribute_definition_clause.
@@ -68551,12 +68802,12 @@ File: aarm2012.info, Node: 13.14, Prev: 13.13, Up:
13
====================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause defines a place in the program
-text where each declared entity becomes "frozen." A use of an entity,
-such as a reference to it by name, or (for a type) an expression of the
-type, causes freezing of the entity in some contexts, as described
-below. The Legality Rules forbid certain kinds of uses of an entity in
-the region of text where it is frozen.]
+{<AI05-0299-1AI05-0299-1>} [This subclause defines a place in the
+program text where each declared entity becomes "frozen." A use of an
+entity, such as a reference to it by name, or (for a type) an expression
+of the type, causes freezing of the entity in some contexts, as
+described below. The Legality Rules forbid certain kinds of uses of an
+entity in the region of text where it is frozen.]
1.a
Reason: This concept has two purposes: a compile-time one and
@@ -68591,9 +68842,9 @@ the region of text where it is frozen.]
ensure that this information has been calculated by the time
it is used. For example, suppose the initial value of a
constant is the result of a function call that takes a
- parameter of type T. In order to pass that parameter, the size
- of type T has to be known. If T is composite, that size might
- be known only at run time.
+ parameter of type <T>. In order to pass that parameter, the
+ size of type <T> has to be known. If <T> is composite, that
+ size might be known only at run time.
1.d
(Note that in these discussions, words like "before" and
@@ -68630,7 +68881,7 @@ the region of text where it is frozen.]
possible.
1.j/3
- {AI05-0005-1AI05-0005-1} Similar issues arise for incomplete
+ {<AI05-0005-1AI05-0005-1>} Similar issues arise for incomplete
types. However, we do not use freezing to prevent premature
access; incomplete types have different, more severe,
restrictions. Similar issues also arise for subprograms,
@@ -68674,9 +68925,9 @@ the region of text where it is frozen.]
Compilers should never be required to detect erroneousness or
exceptions at compile time (although it's very nice if they
do). This implies that we should not require code-generation
- for a nonstatic expression of type T too early, even if we can
- prove that that expression will be erroneous, or will raise an
- exception.
+ for a nonstatic expression of type <T> too early, even if we
+ can prove that that expression will be erroneous, or will
+ raise an exception.
1.p
Here's an example (modified from AI83-00039, Example 3):
@@ -68688,7 +68939,7 @@ the region of text where it is frozen.]
end record;
function F return T;
function G(X : T) return Boolean;
- Y : Boolean := G(F); -- doesn't force T in Ada 83
+ Y : Boolean := G(F); --< doesn't force T in Ada 83>
for T use
record
...
@@ -68706,7 +68957,7 @@ the region of text where it is frozen.]
type T is private;
function F return T;
function G(X : T) return Boolean;
- Y : Boolean := G(F); -- doesn't force T in Ada 83
+ Y : Boolean := G(F); --< doesn't force T in Ada 83>
private
type T is
record
@@ -68719,7 +68970,7 @@ the region of text where it is frozen.]
compiler-generated dope; this dope would be initialized at the
place of the full type declaration. However, the generated
code for the function calls would most likely allocate a temp
- of the size specified by the dope before checking for
+ of the size specified by the dope <before> checking for
Program_Error. That dope would contain uninitialized junk,
resulting in disaster. To avoid doing that, the compiler
would have to determine, at compile time, that the expression
@@ -68741,11 +68992,11 @@ the region of text where it is frozen.]
item or a full_type_declaration).
2
-The freezing of an entity occurs at one or more places (freezing points)
-in the program text where the representation for the entity has to be
-fully determined. Each entity is frozen from its first freezing point
-to the end of the program text (given the ordering of compilation units
-defined in *note 10.1.4::).
+The <freezing> of an entity occurs at one or more places (<freezing
+points>) in the program text where the representation for the entity has
+to be fully determined. Each entity is frozen from its first freezing
+point to the end of the program text (given the ordering of compilation
+units defined in *note 10.1.4::).
2.a
Ramification: The "representation" for a subprogram includes
@@ -68755,23 +69006,23 @@ defined in *note 10.1.4::).
nor its address if a link-name is used to reference the body.
2.1/3
-{AI05-0019-1AI05-0019-1} {AI05-0299-1AI05-0299-1} This subclause also
-defines a place in the program text where the profile of each declared
-callable entity becomes frozen. A use of a callable entity causes
-freezing of its profile in some contexts, as described below. At the
-place where the profile of a callable entity becomes frozen, the entity
-itself becomes frozen.
+{<AI05-0019-1AI05-0019-1>} {<AI05-0299-1AI05-0299-1>} This subclause
+also defines a place in the program text where the profile of each
+declared callable entity becomes <frozen>. A use of a callable entity
+causes freezing of its profile in some contexts, as described below. At
+the place where the profile of a callable entity becomes frozen, the
+entity itself becomes frozen.
3/4
-{8652/00148652/0014} {AI05-0017-1AI05-0017-1} {AI05-0019-1AI05-0019-1}
-{AI12-0103-1AI12-0103-1} The end of a declarative_part, protected_body,
-or a declaration of a library package or generic library package, causes
-freezing of each entity and profile declared within it, except for
-incomplete types. A proper_body, body_stub, or entry_body causes
-freezing of each entity and profile declared before it within the same
-declarative_part that is not an incomplete type; it only causes freezing
-of an incomplete type if the body is within the immediate scope of the
-incomplete type.
+{<8652/00148652/0014>} {<AI05-0017-1AI05-0017-1>}
+{<AI05-0019-1AI05-0019-1>} {<AI12-0103-1AI12-0103-1>} The end of a
+declarative_part, protected_body, or a declaration of a library package
+or generic library package, causes <freezing> of each entity and profile
+declared within it, except for incomplete types. A proper_body,
+body_stub, or entry_body causes freezing of each entity and profile
+declared before it within the same declarative_part that is not an
+incomplete type; it only causes freezing of an incomplete type if the
+body is within the immediate scope of the incomplete type.
3.a
Discussion: This is worded carefully to handle nested packages
@@ -68780,7 +69031,7 @@ incomplete type.
construct.
3.b/3
- {AI05-0017-1AI05-0017-1} An incomplete type declared in the
+ {<AI05-0017-1AI05-0017-1>} An incomplete type declared in the
private part of a library package_specification can be
completed in the body. For other incomplete types (and in the
bodies of library packages), the completion of the type will
@@ -68788,16 +69039,16 @@ incomplete type.
that will freeze the incomplete view as well.
3.b.1/3
- {AI05-0017-1AI05-0017-1} The reason we have to worry about
+ {<AI05-0017-1AI05-0017-1>} The reason we have to worry about
freezing of incomplete types is to prevent premature uses of
the types in dispatching calls. Such uses may need access to
the tag of the type, and the type has to be frozen to know
where the tag is stored.
3.c/3
- Ramification: {AI05-0229-1AI05-0229-1} The part about bodies
- does not say immediately within. A renaming-as-body does not
- have this property. Nor does an imported body
+ Ramification: {<AI05-0229-1AI05-0229-1>} The part about bodies
+ does not say <immediately> within. A renaming-as-body does
+ not have this property. Nor does an imported body
3.d
Reason: The reason bodies cause freezing is because we want
@@ -68819,15 +69070,15 @@ incomplete type.
containing declarative_part.
3.f/4
- {AI05-0177-1AI05-0177-1} {AI12-0103-1AI12-0103-1} Note that
- null_procedure_declarations and
+ {<AI05-0177-1AI05-0177-1>} {<AI12-0103-1AI12-0103-1>} Note
+ that null_procedure_declarations and
expression_function_declarations (even when those are used as
completions), as well as generic_instantiations and
renames-as-bodies do not necessarily cause freezing; each have
their own specific rules.
3.g/4
- Ramification: {AI12-0103-1AI12-0103-1} Note that the rule
+ Ramification: {<AI12-0103-1AI12-0103-1>} Note that the rule
about proper bodies being freezing only applies in
declarative_parts. All of the kinds of bodies (see *note
3.11.1:: - keep in mind the difference from bodys) that are
@@ -68835,11 +69086,11 @@ incomplete type.
rules, so they don't need to be covered by the above rule.
4/1
-{8652/00468652/0046} {AI95-00106-01AI95-00106-01} A construct that
-(explicitly or implicitly) references an entity can cause the freezing
-of the entity, as defined by subsequent paragraphs. At the place where a
-construct causes freezing, each name, expression, implicit_dereference[,
-or range] within the construct causes freezing:
+{<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>} A construct that
+(explicitly or implicitly) references an entity can cause the <freezing>
+of the entity, as defined by subsequent paragraphs. At the place where
+a construct causes freezing, each name, expression,
+implicit_dereference[, or range] within the construct causes freezing:
4.a
Ramification: Note that in the sense of this paragraph, a
@@ -68847,27 +69098,28 @@ or range] within the construct causes freezing:
type.
5/3
- * {AI05-0213-1AI05-0213-1} The occurrence of a generic_instantiation
- causes freezing, except that a name which is a generic actual
- parameter whose corresponding generic formal parameter is a formal
- incomplete type (see *note 12.5.1::) does not cause freezing. In
- addition, if a parameter of the instantiation is defaulted, the
- default_expression or default_name for that parameter causes
- freezing.
+ * {<AI05-0213-1AI05-0213-1>} The occurrence of a
+ generic_instantiation causes freezing, except that a name which is
+ a generic actual parameter whose corresponding generic formal
+ parameter is a formal incomplete type (see *note 12.5.1::) does not
+ cause freezing. In addition, if a parameter of the instantiation
+ is defaulted, the default_expression or default_name for that
+ parameter causes freezing.
5.a/3
- Ramification: {AI05-0213-1AI05-0213-1} Thus, an actual
+ Ramification: {<AI05-0213-1AI05-0213-1>} Thus, an actual
parameter corresponding to a formal incomplete type parameter
may denote an incomplete or private type which is not
completely defined at the point of the generic_instantiation.
5.1/4
- * {AI12-0103-1AI12-0103-1} {AI12-0157-1AI12-0157-1} At the occurrence
- of an expression_function_declaration that is a completion, the
- return expression of the expression function causes freezing.
+ * {<AI12-0103-1AI12-0103-1>} {<AI12-0157-1AI12-0157-1>} At the
+ occurrence of an expression_function_declaration that is a
+ completion, the return expression of the expression function causes
+ freezing.
5.b/4
- Reason: {AI12-0103-1AI12-0103-1} This rule prevents calls
+ Reason: {<AI12-0103-1AI12-0103-1>} This rule prevents calls
through access values to an expression that might have
unfrozen parts. Typically, elaboration checks and other
freezing rules prevent this, but in this case the completion
@@ -68875,10 +69127,10 @@ or range] within the construct causes freezing:
itself freeze anything that precedes it.
5.2/4
- * {AI12-0132-1AI12-0132-1} {AI12-0157-1AI12-0157-1} At the occurrence
- of a renames-as-body whose callable_entity_name denotes an
- expression function, the return expression of the expression
- function causes freezing.
+ * {<AI12-0132-1AI12-0132-1>} {<AI12-0157-1AI12-0157-1>} At the
+ occurrence of a renames-as-body whose <callable_entity_>name
+ denotes an expression function, the return expression of the
+ expression function causes freezing.
6
* The occurrence of an object_declaration that has no corresponding
@@ -68899,16 +69151,16 @@ or range] within the construct causes freezing:
its dispatching operations.
7.b/2
- {AI95-00251-01AI95-00251-01} The declaration of a private
+ {<AI95-00251-01AI95-00251-01>} The declaration of a private
extension does not cause freezing. The freezing is deferred
until the full type declaration, which will necessarily be for
a record extension, task, or protected type (the latter only
for a limited private extension derived from an interface).
7.1/2
- * {AI95-00251-01AI95-00251-01} The declaration of a record extension,
- interface type, task unit, or protected unit causes freezing of any
- progenitor types specified in the declaration.
+ * {<AI95-00251-01AI95-00251-01>} The declaration of a record
+ extension, interface type, task unit, or protected unit causes
+ freezing of any progenitor types specified in the declaration.
7.b.1/2
Reason: This rule has the same purpose as the one above:
@@ -68925,34 +69177,34 @@ or range] within the construct causes freezing:
freezing of the interface type.
7.2/3
- * {AI05-0183-1AI05-0183-1} At the freezing point of the entity
+ * {<AI05-0183-1AI05-0183-1>} At the freezing point of the entity
associated with an aspect_specification, any expressions or names
within the aspect_specification cause freezing. Any static
expressions within an aspect_specification also cause freezing at
the end of the immediately enclosing declaration list.
8/4
-{8652/00468652/0046} {AI95-00106-01AI95-00106-01}
-{AI05-0177-1AI05-0177-1} {AI05-0183-1AI05-0183-1}
-{AI05-0157-1AI05-0157-1} A static expression (other than within an
-aspect_specification) causes freezing where it occurs. An object name or
-nonstatic expression causes freezing where it occurs, unless the name or
-expression is part of a default_expression, a default_name, the return
-expression of an expression function, an aspect_specification, or a
-per-object expression of a component's constraint, in which case, the
+{<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>}
+{<AI05-0177-1AI05-0177-1>} {<AI05-0183-1AI05-0183-1>}
+{<AI05-0157-1AI05-0157-1>} A static expression (other than within an
+aspect_specification) causes freezing where it occurs. An object name
+or nonstatic expression causes freezing where it occurs, unless the name
+or expression is part of a default_expression, a default_name, the
+return expression of an expression function, an aspect_specification, or
+a per-object expression of a component's constraint, in which case, the
freezing occurs later as part of another construct or at the freezing
point of an associated entity.
8.1/3
-{8652/00468652/0046} {AI95-00106-01AI95-00106-01}
-{AI05-0019-1AI05-0019-1} An implicit call freezes the same entities and
-profiles that would be frozen by an explicit call. This is true even if
-the implicit call is removed via implementation permissions.
+{<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>}
+{<AI05-0019-1AI05-0019-1>} An implicit call freezes the same entities
+and profiles that would be frozen by an explicit call. This is true
+even if the implicit call is removed via implementation permissions.
8.2/1
-{8652/00468652/0046} {AI95-00106-01AI95-00106-01} If an expression is
-implicitly converted to a type or subtype T, then at the place where the
-expression causes freezing, T is frozen.
+{<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>} If an expression
+is implicitly converted to a type or subtype <T>, then at the place
+where the expression causes freezing, <T> is frozen.
9
The following rules define which entities are frozen at the place where
@@ -69004,16 +69256,16 @@ a construct causes freezing:
of the name T, hence no forcing occurrence of T.
10.1/4
- * {AI05-0019-1AI05-0019-1} {AI05-0177-1AI05-0177-1}
- {AI12-0157-1AI12-0157-1} At the place where a function call causes
- freezing, the profile of the function is frozen. Furthermore, if a
- parameter of the call is defaulted, the default_expression for that
- parameter causes freezing. If the function call is to an
- expression function, the return expression of the expression
- function causes freezing.
+ * {<AI05-0019-1AI05-0019-1>} {<AI05-0177-1AI05-0177-1>}
+ {<AI12-0157-1AI12-0157-1>} At the place where a function call
+ causes freezing, the profile of the function is frozen.
+ Furthermore, if a parameter of the call is defaulted, the
+ default_expression for that parameter causes freezing. If the
+ function call is to an expression function, the return expression
+ of the expression function causes freezing.
10.e/3
- Reason: {AI05-0019-1AI05-0019-1} This is the important rule
+ Reason: {<AI05-0019-1AI05-0019-1>} This is the important rule
for profile freezing: a call freezes the profile. That's
because generating the call will need to know how the
parameters are passed, and that will require knowing details
@@ -69028,17 +69280,17 @@ a construct causes freezing:
part.
10.g/4
- Ramification: {AI05-0177-1AI05-0177-1}
- {AI12-0103-1AI12-0103-1} {AI12-0157-1AI12-0157-1} Freezing of
- the return expression of an expression function only needs to
- be considered when the expression function is in the same
+ Ramification: {<AI05-0177-1AI05-0177-1>}
+ {<AI12-0103-1AI12-0103-1>} {<AI12-0157-1AI12-0157-1>} Freezing
+ of the return expression of an expression function only needs
+ to be considered when the expression function is in the same
compilation unit and there are no intervening bodys; the end
of a declarative_part or library package freezes everything in
it, and a body freezes everything declared before it.
10.2/4
- * {AI05-0019-1AI05-0019-1} {AI05-0177-1AI05-0177-1}
- {AI05-0296-1AI05-0296-1} {AI12-0157-1AI12-0157-1} At the place
+ * {<AI05-0019-1AI05-0019-1>} {<AI05-0177-1AI05-0177-1>}
+ {<AI05-0296-1AI05-0296-1>} {<AI12-0157-1AI12-0157-1>} At the place
where a generic_instantiation causes freezing of a callable entity,
the profile of that entity is frozen unless the formal subprogram
corresponding to the callable entity has a parameter or result of a
@@ -69052,7 +69304,7 @@ a construct causes freezing:
and (for an expression function) expression.
10.3/4
- * {AI05-0177-1AI05-0177-1} {AI12-0157-1AI12-0157-1} At the place
+ * {<AI05-0177-1AI05-0177-1>} {<AI12-0157-1AI12-0157-1>} At the place
where a use of the Access or Unchecked_Access attribute whose
prefix denotes an expression function causes freezing, the return
expression of the expression function causes freezing.
@@ -69069,16 +69321,16 @@ a construct causes freezing:
10.l/3
function Foo (A : in Natural) return Natural is
- (A + Flub'Size); -- The expression is not frozen here.
+ (A + Flub'Size); -- <The expression is not frozen here.>
10.m/4
- {AI12-0005-1AI12-0005-1} type Bar is access function (A : in
Natural) return Natural;
+ {<AI12-0005-1AI12-0005-1>} type Bar is access function (A :
in Natural) return Natural;
10.n/3
- P : Bar := Foo'Access; -- (A)
+ P : Bar := Foo'Access; -- <(A)>
10.o/3
- Val : Natural := P.all(5); -- (B)
+ Val : Natural := P.all(5); -- <(B)>
10.p/3
end Pack;
@@ -69095,18 +69347,18 @@ a construct causes freezing:
nominal subtype associated with the name is frozen.
11.a/2
- Ramification: {AI95-00114-01AI95-00114-01} This only matters
+ Ramification: {<AI95-00114-01AI95-00114-01>} This only matters
in the presence of deferred constants or access types; an
object_declaration other than a deferred constant declaration
causes freezing of the nominal subtype, plus all component
junk.
11.b/1
- This paragraph was deleted.{8652/00468652/0046}
- {AI95-00106-01AI95-00106-01}
+ <This paragraph was deleted.>{<8652/00468652/0046>}
+ {<AI95-00106-01AI95-00106-01>}
11.1/1
- * {8652/00468652/0046} {AI95-00106-01AI95-00106-01} At the place
+ * {<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>} At the place
where an implicit_dereference causes freezing, the nominal subtype
associated with the implicit_dereference is frozen.
@@ -69146,7 +69398,7 @@ a construct causes freezing:
type A1 is access Boolean;
type A2 is new A1;
type A3 is new A2;
- X : A3 := new Boolean; -- Don't know what pool yet!
+ X : A3 := new Boolean; --< Don't know what pool yet!>
for A1'Storage_Pool use F.all;
end P;
@@ -69155,20 +69407,20 @@ a construct causes freezing:
parent's pool.
14/3
- * {AI05-0019-1AI05-0019-1} At the place where a profile is frozen,
+ * {<AI05-0019-1AI05-0019-1>} At the place where a profile is frozen,
each subtype of the profile is frozen. If the corresponding
callable entity is a member of an entry family, the index subtype
of the family is frozen.
14.a/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
15
- * At the place where a subtype is frozen, its type is frozen. At the
+ * At the place where a subtype is frozen, its type is frozen. At the
place where a type is frozen, any expressions or names within the
full type definition cause freezing; the first subtype, and any
component subtypes, index subtypes, and parent subtype of the type
- are frozen as well. For a specific tagged type, the corresponding
+ are frozen as well. For a specific tagged type, the corresponding
class-wide type is frozen as well. For a class-wide type, the
corresponding specific type is frozen as well.
@@ -69183,11 +69435,11 @@ a construct causes freezing:
subtype.
15.1/3
- * {AI95-00341-01AI95-00341-01} {AI05-0019-1AI05-0019-1} At the place
- where a specific tagged type is frozen, the primitive subprograms
- of the type are frozen. At the place where a type is frozen, any
- subprogram named in an attribute_definition_clause for the type is
- frozen.
+ * {<AI95-00341-01AI95-00341-01>} {<AI05-0019-1AI05-0019-1>} At the
+ place where a specific tagged type is frozen, the primitive
+ subprograms of the type are frozen. At the place where a type is
+ frozen, any subprogram named in an attribute_definition_clause for
+ the type is frozen.
15.c/2
Reason: We have a language design principle that all of the
@@ -69203,7 +69455,7 @@ a construct causes freezing:
point).
15.e/3
- Discussion: {AI05-0019-1AI05-0019-1} The second sentence is
+ Discussion: {<AI05-0019-1AI05-0019-1>} The second sentence is
the rule that makes it possible to check that only subprograms
with convention Ada are specified in
attribute_definition_clauses without jumping through hoops.
@@ -69220,16 +69472,16 @@ shall occur before the type is frozen (see *note
3.9.2::).]
we want to allow tagged type descriptors to be static
(allocated statically, and initialized to link-time-known
symbols). Suppose T2 inherits primitive P from T1, and then
- overrides P. Suppose P is called before the declaration of the
- overriding P. What should it dispatch to? If the answer is
- the new P, we've violated the first principle above. If the
- answer is the old P, we've violated the second principle. (A
- call to the new one necessarily raises Program_Error, but
+ overrides P. Suppose P is called <before> the declaration of
+ the overriding P. What should it dispatch to? If the answer
+ is the new P, we've violated the first principle above. If
+ the answer is the old P, we've violated the second principle.
+ (A call to the new one necessarily raises Program_Error, but
that's beside the point.)
16.b
- Note that a call upon a dispatching operation of type T will
- freeze T.
+ Note that a call upon a dispatching operation of type <T> will
+ freeze <T>.
16.c
We considered applying this rule to all derived types, for
@@ -69239,11 +69491,11 @@ shall occur before the type is frozen (see *note
3.9.2::).]
confusing).
16.d/3
- To be honest: {AI05-0222-1AI05-0222-1} This rule only applies
- to "original" declarations and not to the completion of a
- primitive subprogram, even though a completion is technically
- an explicit declaration, and it may declare a primitive
- subprogram.
+ To be honest: {<AI05-0222-1AI05-0222-1>} This rule only
+ applies to "original" declarations and not to the completion
+ of a primitive subprogram, even though a completion is
+ technically an explicit declaration, and it may declare a
+ primitive subprogram.
17
[A type shall be completely defined before it is frozen (see *note
@@ -69254,32 +69506,33 @@ shall occur before the type is frozen (see *note
3.9.2::).]
the constant is frozen (see *note 7.4::).]
18.a/3
- Proof: {AI95-00114-01AI95-00114-01} {AI05-0299-1AI05-0299-1}
- The above Legality Rules are stated "officially" in the
- referenced subclauses.
+ Proof: {<AI95-00114-01AI95-00114-01>}
+ {<AI05-0299-1AI05-0299-1>} The above Legality Rules are stated
+ "officially" in the referenced subclauses.
19/1
-{8652/00098652/0009} {AI95-00137-01AI95-00137-01} An operational or
+{<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} An operational or
representation item that directly specifies an aspect of an entity shall
appear before the entity is frozen (see *note 13.1::).
19.a/1
- Discussion: {8652/00098652/0009} {AI95-00137-01AI95-00137-01}
- From RM83-13.1(7). The wording here forbids freezing within
- the aspect_clause itself, which was not true of the Ada 83
- wording. The wording of this rule is carefully written to
- work properly for type-related representation items. For
- example, an enumeration_representation_clause (*note 13.4:
- S0311.) is illegal after the type is frozen, even though the
- _clause refers to the first subtype.
+ Discussion: {<8652/00098652/0009>}
+ {<AI95-00137-01AI95-00137-01>} From RM83-13.1(7). The wording
+ here forbids freezing within the aspect_clause itself, which
+ was not true of the Ada 83 wording. The wording of this rule
+ is carefully written to work properly for type-related
+ representation items. For example, an
+ enumeration_representation_clause (*note 13.4: S0311.) is
+ illegal after the type is frozen, even though the _clause
+ refers to the first subtype.
19.a.1/2
- {AI95-00114-01AI95-00114-01} The above Legality Rule is stated
- for types and subtypes in *note 13.1::, but the rule here
- covers all other entities as well.
+ {<AI95-00114-01AI95-00114-01>} The above Legality Rule is
+ stated for types and subtypes in *note 13.1::, but the rule
+ here covers all other entities as well.
19.b/2
- This paragraph was deleted.{AI95-00114-01AI95-00114-01}
+ <This paragraph was deleted.>{<AI95-00114-01AI95-00114-01>}
19.c
Discussion: Here's an example that illustrates when freezing
@@ -69301,20 +69554,20 @@ appear before the entity is frozen (see *note 13.1::).
place. Similarly, since the elaboration of R does not
evaluate the default_expression "F = F", there is no need to
freeze the types involved at that point. However, the
- declaration of X does need to freeze these things. Note that
- even if component C did not exist, the elaboration of the
+ declaration of X <does> need to freeze these things. Note
+ that even if component C did not exist, the elaboration of the
declaration of X would still need information about T -- even
though D is not of type T, its default_expression requires
that information.
19.f/3
- Ramification: {AI05-0299-1AI05-0299-1} Although we define
+ Ramification: {<AI05-0299-1AI05-0299-1>} Although we define
freezing in terms of the program text as a whole (i.e. after
applying the rules of Clause *note 10::), the freezing rules
actually have no effect beyond compilation unit boundaries.
19.g/3
- Reason: {AI05-0299-1AI05-0299-1} That is important, because
+ Reason: {<AI05-0299-1AI05-0299-1>} That is important, because
Clause *note 10:: allows some implementation definedness in
the order of things, and we don't want the freezing rules to
be implementation defined.
@@ -69328,7 +69581,7 @@ appear before the entity is frozen (see *note 13.1::).
19.i
Implementation Note: An implementation may choose to generate
code for default_expressions and default_names in line at the
- place of use. Alternatively, an implementation may choose to
+ place of use. Alternatively, an implementation may choose to
generate thunks (subprograms implicitly generated by the
compiler) for evaluation of defaults. Thunk generation
cannot, in general, be done at the place of the declaration
@@ -69356,15 +69609,15 @@ appear before the entity is frozen (see *note 13.1::).
unrecognized pragmas.
19.l/1
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} An
- aspect_clause for an entity should most certainly not be a
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>} An
+ aspect_clause for an entity should most certainly <not> be a
freezing point for the entity.
_Dynamic Semantics_
20/2
-{AI95-00279-01AI95-00279-01} The tag (see *note 3.9::) of a tagged type
-T is created at the point where T is frozen.
+{<AI95-00279-01AI95-00279-01>} The tag (see *note 3.9::) of a tagged
+type T is created at the point where T is frozen.
_Incompatibilities With Ada 83_
@@ -69384,7 +69637,7 @@ T is created at the point where T is frozen.
20.c
type A is array(Integer range 1..10) of Boolean;
subtype S is Integer range A'Range;
- -- not forcing for A
+ --< not forcing for A>
20.d
Occurrences within pragmas can cause freezing in Ada 95.
@@ -69403,8 +69656,8 @@ T is created at the point where T is frozen.
type T is tagged limited private;
generic
type T2 is
- new T with private; -- Does not freeze T
- -- in Ada 95.
+ new T with private; --< Does not freeze T>
+ --< in Ada 95.>
package Inner is
...
end Inner;
@@ -69478,7 +69731,7 @@ T is created at the point where T is frozen.
useful.
20.o/2
- * {AI95-00114-01AI95-00114-01} Ada 83 had a case where an
+ * {<AI95-00114-01AI95-00114-01>} Ada 83 had a case where an
aspect_clause had a strong effect on the semantics of the
program -- 'Small. This caused certain semantic
anomalies. There are more cases in Ada 95, because the
@@ -69487,8 +69740,8 @@ T is created at the point where T is frozen.
_Incompatibilities With Ada 95_
20.p/2
- {8652/00468652/0046} {AI95-00106-01AI95-00106-01}
- {AI95-00341-01AI95-00341-01} Corrigendum: Various freezing
+ {<8652/00468652/0046>} {<AI95-00106-01AI95-00106-01>}
+ {<AI95-00341-01AI95-00341-01>} Corrigendum: Various freezing
rules were added to fix holes in the rules. Most importantly,
implicit calls are now freezing, which make some
representation clauses illegal in Ada 2005 that were legal
@@ -69501,61 +69754,61 @@ T is created at the point where T is frozen.
_Wording Changes from Ada 95_
20.q/2
- {8652/00098652/0009} {AI95-00137-01AI95-00137-01} Corrigendum:
- Added wording to specify that both operational and
- representation attributes must be specified before the type is
- frozen.
+ {<8652/00098652/0009>} {<AI95-00137-01AI95-00137-01>}
+ Corrigendum: Added wording to specify that both operational
+ and representation attributes must be specified before the
+ type is frozen.
20.r/2
- {AI95-00251-01AI95-00251-01} Added wording that declaring a
+ {<AI95-00251-01AI95-00251-01>} Added wording that declaring a
specific descendant of an interface type freezes the interface
type.
20.s/2
- {AI95-00279-01AI95-00279-01} Added wording that defines when a
- tag is created for a type (at the freezing point of the type).
- This is used to specify checking for uncreated tags (see *note
- 3.9::).
+ {<AI95-00279-01AI95-00279-01>} Added wording that defines when
+ a tag is created for a type (at the freezing point of the
+ type). This is used to specify checking for uncreated tags
+ (see *note 3.9::).
_Incompatibilities With Ada 2005_
20.t/3
- {AI05-0019-1AI05-0019-1} Correction: Separated the freezing of
- the profile from the rest of a subprogram, in order to reduce
- the impact of the Ada 95 incompatibility noted above. (The
- effects were much more limiting than expected.)
+ {<AI05-0019-1AI05-0019-1>} Correction: Separated the freezing
+ of the profile from the rest of a subprogram, in order to
+ reduce the impact of the Ada 95 incompatibility noted above.
+ (The effects were much more limiting than expected.)
_Wording Changes from Ada 2005_
20.u/3
- {AI05-0017-1AI05-0017-1} Correction: Reworded so that
+ {<AI05-0017-1AI05-0017-1>} Correction: Reworded so that
incomplete types with a deferred completion aren't prematurely
frozen.
20.v/3
- {AI05-0177-1AI05-0177-1} Added freezing rules for expression
+ {<AI05-0177-1AI05-0177-1>} Added freezing rules for expression
functions; these are frozen at the point of call, not the
point of declaration, like default expressions.
20.w/3
- {AI05-0183-1AI05-0183-1} Added freezing rules for
+ {<AI05-0183-1AI05-0183-1>} Added freezing rules for
aspect_specifications; these are frozen at the freezing point
of the associated entity, not the point of declaration.
20.x/3
- {AI05-0213-1AI05-0213-1} Added freezing rules for formal
+ {<AI05-0213-1AI05-0213-1>} Added freezing rules for formal
incomplete types; the corresponding actual is not frozen.
_Wording Changes from Ada 2012_
20.y/4
- {AI12-0103-1AI12-0103-1} {AI12-0132-1AI12-0132-1} Corrigendum:
- Clarified when and what an expression_function_declaration
- that is a completion or that is the target of a
- renames-as-body freezes. This is formally an incompatibility,
- but as all known implementations freeze expression functions
- more aggressively than allowed by either the old or new
- wording, practically this will be an extension.
+ {<AI12-0103-1AI12-0103-1>} {<AI12-0132-1AI12-0132-1>}
+ Corrigendum: Clarified when and what an
+ expression_function_declaration that is a completion or that
+ is the target of a renames-as-body freezes. This is formally
+ an incompatibility, but as all known implementations freeze
+ expression functions more aggressively than allowed by either
+ the old or new wording, practically this will be an extension.
File: aarm2012.info, Node: Annex A, Next: Annex B, Prev: 13, Up: Top
@@ -69569,12 +69822,12 @@ provided by every implementation. There are three
root library units:
Ada, Interfaces, and System; other library units are children of these:]
2/3
-{8652/00478652/0047} {AI95-00081-01AI95-00081-01}
-{AI95-00424-01AI95-00424-01} {AI05-0001-1AI05-0001-1}
-{AI05-0049-1AI05-0049-1} {AI05-0069-1AI05-0069-1}
-{AI05-0111-3AI05-0111-3} {AI05-0136-1AI05-0136-1}
-{AI05-0137-1AI05-0137-1} {AI05-0166-1AI05-0166-1}
-{AI05-0168-1AI05-0168-1}
+{<8652/00478652/0047>} {<AI95-00081-01AI95-00081-01>}
+{<AI95-00424-01AI95-00424-01>} {<AI05-0001-1AI05-0001-1>}
+{<AI05-0049-1AI05-0049-1>} {<AI05-0069-1AI05-0069-1>}
+{<AI05-0111-3AI05-0111-3>} {<AI05-0136-1AI05-0136-1>}
+{<AI05-0137-1AI05-0137-1>} {<AI05-0166-1AI05-0166-1>}
+{<AI05-0168-1AI05-0168-1>}
[Standard -- *note A.1::
@@ -69619,9 +69872,9 @@ Ada, Interfaces, and System; other library units are
children of these:]
Indefinite_Ordered_Maps -- *note A.18.14::
Indefinite_Ordered_Sets -- *note A.18.16::
Indefinite_Vectors -- *note
- A.18.11::Standard (...continued)
- Ada (...continued)
- Containers (...continued)
+ A.18.11::Standard (<...continued>)
+ Ada (<...continued>)
+ Containers (<...continued>)
Multiway_Trees -- *note A.18.10::
Ordered_Maps -- *note A.18.6::
Ordered_Sets -- *note A.18.9::
@@ -69660,8 +69913,8 @@ Ada, Interfaces, and System; other library units are
children of these:]
IO_Exceptions -- *note A.13::
Iterator_Interfaces -- *note 5.5.1::
Locales -- *note A.19::
- Standard (...continued)
- Ada (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
Numerics -- *note A.5::
Complex_Arrays -- *note G.3.2::
Complex_Elementary_Functions -- *note G.1.2::
@@ -69709,9 +69962,9 @@ Ada, Interfaces, and System; other library units are
children of these:]
Strings -- *note A.4.11::
Wide_Strings -- *note A.4.11::
Wide_Wide_Strings -- *note A.4.11::
- Standard (...continued)
- Ada (...continued)
- Strings (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
+ Strings (<...continued>)
Wide_Bounded -- *note A.4.7::
Wide_Equal_Case_Insensitive
-- *note A.4.7::
@@ -69760,8 +70013,8 @@ Ada, Interfaces, and System; other library units are
children of these:]
Synchronous_Barriers -- *note D.10.1::
Synchronous_Task_Control -- *note D.10::
EDF -- *note D.10::
- Standard (...continued)
- Ada (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
Tags -- *note 3.9::
Generic_Dispatching_Constructor -- *note 3.9::
Task_Attributes -- *note C.7.2::
@@ -69825,8 +70078,8 @@ Ada, Interfaces, and System; other library units are
children of these:]
_Implementation Requirements_
3/4
-{AI95-00434-01AI95-00434-01} {AI12-0052-1AI12-0052-1}
-{AI12-0114-1AI12-0114-1} The implementation shall ensure that each
+{<AI95-00434-01AI95-00434-01>} {<AI12-0052-1AI12-0052-1>}
+{<AI12-0114-1AI12-0114-1>} The implementation shall ensure that each
language-defined subprogram is reentrant in the sense that concurrent
calls on any language-defined subprogram perform as specified, so long
as all objects that are denoted by parameters that could be passed by
@@ -69834,13 +70087,13 @@ reference or designated by parameters of an access
type are
nonoverlapping.
3.a.1/4
- Ramification: {AI12-0052-1AI12-0052-1}
- {AI12-0114-1AI12-0114-1} So long as the parameters are
+ Ramification: {<AI12-0052-1AI12-0052-1>}
+ {<AI12-0114-1AI12-0114-1>} So long as the parameters are
disjoint, concurrent calls on the same language-defined
subprogram, and concurrent calls on two different
language-defined subprograms are required to work. But
concurrent calls operating on overlapping objects (be they of
- the same or different language-defined subprograms) are not
+ the same or different language-defined subprograms) are <not>
required to work (being an erroneous use of shared variables)
unless both subprograms are required to pass the associated
parameter by-copy.
@@ -69860,7 +70113,7 @@ nonoverlapping.
language defined generic library package.
3.b.1/4
- Ramification: {AI12-0052-1AI12-0052-1} This rule applies to
+ Ramification: {<AI12-0052-1AI12-0052-1>} This rule applies to
all language-defined subprograms, including those defined in
packages that manage some global state (like environment
variables or the current directory). Unless specified above,
@@ -69869,13 +70122,13 @@ nonoverlapping.
state is not considered.
3.c/4
- {AI12-0052-1AI12-0052-1} The rule implies that any data local
- to the private part or body of the package (including global
- state as described above) has to be somehow protected against
- simultaneous access.
+ {<AI12-0052-1AI12-0052-1>} The rule implies that any data
+ local to the private part or body of the package (including
+ global state as described above) has to be somehow protected
+ against simultaneous access.
3.1/4
-{AI12-0052-1AI12-0052-1} {AI12-0159-1AI12-0159-1} For the purpose of
+{<AI12-0052-1AI12-0052-1>} {<AI12-0159-1AI12-0159-1>} For the purpose of
determining whether concurrent calls on text input-output subprograms
are required to perform as specified above, when calling a subprogram
within Text_IO or its children that implicitly operates on one of the
@@ -69883,7 +70136,7 @@ default input-output files, the subprogram is
considered to have a
parameter of Current_Input or Current_Output (as appropriate).
3.2/3
-{AI05-0048-1AI05-0048-1} If a descendant of a language-defined tagged
+{<AI05-0048-1AI05-0048-1>} If a descendant of a language-defined tagged
type is declared, the implementation shall ensure that each inherited
language-defined subprogram behaves as described in this International
Standard. In particular, overriding a language-defined subprogram shall
@@ -69925,43 +70178,44 @@ language-defined library units (other than Standard).
_Wording Changes from Ada 95_
4.d/2
- {8652/00478652/0047} {AI95-00081-01AI95-00081-01} Corrigendum:
- Units missing from the list of predefined units were added.
+ {<8652/00478652/0047>} {<AI95-00081-01AI95-00081-01>}
+ Corrigendum: Units missing from the list of predefined units
+ were added.
4.e/2
- {AI95-00424-01AI95-00424-01} Added new units to the list of
+ {<AI95-00424-01AI95-00424-01>} Added new units to the list of
predefined units.
_Wording Changes from Ada 2005_
4.f/3
- {AI05-0048-1AI05-0048-1} Correction: Added wording to ban
+ {<AI05-0048-1AI05-0048-1>} Correction: Added wording to ban
redispatching unless it is explicitly required, in order to
safeguard portability when overriding language-defined
routines.
4.g/3
- {AI05-0060-1AI05-0060-1} {AI05-0206-1AI05-0206-1} Correction:
- Added a permission to omit pragma Remote_Types from
- language-defined units if Annex E is not supported. This was
- later removed, as a better method of supporting the reason is
- now available. Note that this requires all implementations to
- provide minimal support for the Remote_Types categorization
+ {<AI05-0060-1AI05-0060-1>} {<AI05-0206-1AI05-0206-1>}
+ Correction: Added a permission to omit pragma Remote_Types
+ from language-defined units if Annex E is not supported. This
+ was later removed, as a better method of supporting the reason
+ is now available. Note that this requires all implementations
+ to provide minimal support for the Remote_Types categorization
even if Annex E is not supported; being unable to compile
language-defined units is not allowed.
4.h/3
- {AI05-0001-1AI05-0001-1} {AI05-0049-1AI05-0049-1}
- {AI05-0069-1AI05-0069-1} {AI05-0111-3AI05-0111-3}
- {AI05-0136-1AI05-0136-1} {AI05-0137-1AI05-0137-1}
- {AI05-0166-1AI05-0166-1} {AI05-0168-1AI05-0168-1} Added
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0049-1AI05-0049-1>}
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0111-3AI05-0111-3>}
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0137-1AI05-0137-1>}
+ {<AI05-0166-1AI05-0166-1>} {<AI05-0168-1AI05-0168-1>} Added
various new units to the list of predefined units.
_Wording Changes from Ada 2012_
4.h.1/4
- {AI12-0052-1AI12-0052-1} {AI12-0114-1AI12-0114-1}
- {AI12-0159-1AI12-0159-1} Corrigendum: The rules requiring
+ {<AI12-0052-1AI12-0052-1>} {<AI12-0114-1AI12-0114-1>}
+ {<AI12-0159-1AI12-0159-1>} Corrigendum: The rules requiring
concurrent access of language-defined subprograms were
expanded to include implicit Text_IO objects, overlapping
objects designated by parameters of an access type, and
@@ -69999,16 +70253,17 @@ A.1 The Package Standard
========================
1/3
-{AI05-0299-1AI05-0299-1} This subclause outlines the specification of
+{<AI05-0299-1AI05-0299-1>} This subclause outlines the specification of
the package Standard containing all predefined identifiers in the
-language. The corresponding package body is not specified by the
+language. The corresponding package body is not specified by the
language.
2
The operators that are predefined for the types declared in the package
Standard are given in comments since they are implicitly declared.
-Italics are used for pseudo-names of anonymous types (such as root_real)
-and for undefined information (such as implementation-defined).
+Italics are used for pseudo-names of anonymous types (such as
+<root_real>) and for undefined information (such as
+<implementation-defined>).
2.a
Ramification: All of the predefined operators are of
@@ -70032,10 +70287,10 @@ The library package Standard has the following
declaration:
type Boolean is (False, True);
6
- -- The predefined relational operators for this type are as follows:
+ --< The predefined relational operators for this type are as follows:>
7/1
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} -- function "="
(Left, Right : Boolean'Base) return Boolean;
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>} -- function "="
(Left, Right : Boolean'Base) return Boolean;
-- function "/=" (Left, Right : Boolean'Base) return Boolean;
-- function "<" (Left, Right : Boolean'Base) return Boolean;
-- function "<=" (Left, Right : Boolean'Base) return Boolean;
@@ -70043,30 +70298,30 @@ The library package Standard has the following
declaration:
-- function ">=" (Left, Right : Boolean'Base) return Boolean;
8
- -- The predefined logical operators and the predefined logical
- -- negation operator are as follows:
+ --< The predefined logical operators and the predefined logical>
+ --< negation operator are as follows:>
9/1
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} -- function "and"
(Left, Right : Boolean'Base) return Boolean'Base;
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>} -- function
"and" (Left, Right : Boolean'Base) return Boolean'Base;
-- function "or" (Left, Right : Boolean'Base) return Boolean'Base;
-- function "xor" (Left, Right : Boolean'Base) return Boolean'Base;
10/1
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} -- function "not"
(Right : Boolean'Base) return Boolean'Base;
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>} -- function
"not" (Right : Boolean'Base) return Boolean'Base;
11/2
- {AI95-00434-01AI95-00434-01} -- The integer type root_integer and the
- -- corresponding universal type universal_integer are predefined.
+ {<AI95-00434-01AI95-00434-01>} --< The integer type root_integer and
the>
+ --< corresponding universal type universal_integer are predefined.>
12
- type Integer is range implementation-defined;
+ type Integer is range <implementation-defined>;
13
subtype Natural is Integer range 0 .. Integer'Last;
subtype Positive is Integer range 1 .. Integer'Last;
14
- -- The predefined operators for type Integer are as follows:
+ --< The predefined operators for type Integer are as follows:>
15
-- function "=" (Left, Right : Integer'Base) return Boolean;
@@ -70094,22 +70349,22 @@ The library package Standard has the following
declaration:
-- return Integer'Base;
19
- -- The specification of each operator for the type
- -- root_integer, or for any additional predefined integer
- -- type, is obtained by replacing Integer by the name of the type
- -- in the specification of the corresponding operator of the type
- -- Integer. The right operand of the exponentiation operator
- -- remains as subtype Natural.
+ --< The specification of each operator for the type>
+ --< root_integer, or for any additional predefined integer>
+ --< type, is obtained by replacing Integer by the name of the type>
+ --< in the specification of the corresponding operator of the type>
+ --< Integer. The right operand of the exponentiation operator>
+ --< remains as subtype Natural.>
20/2
- {AI95-00434-01AI95-00434-01} -- The floating point type root_real and
the
- -- corresponding universal type universal_real are predefined.
+ {<AI95-00434-01AI95-00434-01>} --< The floating point type root_real
and the>
+ --< corresponding universal type universal_real are predefined.>
21
- type Float is digits implementation-defined;
+ type Float is digits <implementation-defined>;
22
- -- The predefined operators for this type are as follows:
+ --< The predefined operators for this type are as follows:>
23
-- function "=" (Left, Right : Float) return Boolean;
@@ -70134,138 +70389,138 @@ The library package Standard has the following
declaration:
-- function "**" (Left : Float; Right : Integer'Base) return Float;
27
- -- The specification of each operator for the type root_real, or for
- -- any additional predefined floating point type, is obtained by
- -- replacing Float by the name of the type in the specification of the
- -- corresponding operator of the type Float.
+ --< The specification of each operator for the type root_real, or for>
+ --< any additional predefined floating point type, is obtained by>
+ --< replacing Float by the name of the type in the specification of
the>
+ --< corresponding operator of the type Float.>
28
- -- In addition, the following operators are predefined for the root
- -- numeric types:
+ --< In addition, the following operators are predefined for the root>
+ --< numeric types:>
29
- function "*" (Left : root_integer; Right : root_real)
- return root_real;
+ function "*" (Left : <root_integer>; Right : <root_real>)
+ return <root_real>;
30
- function "*" (Left : root_real; Right : root_integer)
- return root_real;
+ function "*" (Left : <root_real>; Right : <root_integer>)
+ return <root_real>;
31
- function "/" (Left : root_real; Right : root_integer)
- return root_real;
+ function "/" (Left : <root_real>; Right : <root_integer>)
+ return <root_real>;
32
- -- The type universal_fixed is predefined.
- -- The only multiplying operators defined between
- -- fixed point types are
+ --< The type universal_fixed is predefined.>
+ --< The only multiplying operators defined between>
+ --< fixed point types are>
33
- function "*" (Left : universal_fixed; Right : universal_fixed)
- return universal_fixed;
+ function "*" (Left : <universal_fixed>; Right : <universal_fixed>)
+ return <universal_fixed>;
34
- function "/" (Left : universal_fixed; Right : universal_fixed)
- return universal_fixed;
+ function "/" (Left : <universal_fixed>; Right : <universal_fixed>)
+ return <universal_fixed>;
34.1/2
- {AI95-00230-01AI95-00230-01} -- The type universal_access is
predefined.
- -- The following equality operators are predefined:
+ {<AI95-00230-01AI95-00230-01>} --< The type universal_access is
predefined.>
+ --< The following equality operators are predefined:>
34.2/2
- {AI95-00230-01AI95-00230-01} function "=" (Left, Right:
universal_access) return Boolean;
- function "/=" (Left, Right: universal_access) return Boolean;
+ {<AI95-00230-01AI95-00230-01>} function "=" (Left, Right:
<universal_access>) return Boolean;
+ function "/=" (Left, Right: <universal_access>) return Boolean;
35/3
- {AI95-00415-01AI95-00415-01} {AI05-0181-1AI05-0181-1}
{AI05-0248-1AI05-0248-1} -- The declaration of type Character is based on
the standard ISO 8859-1 character set.
+ {<AI95-00415-01AI95-00415-01>} {<AI05-0181-1AI05-0181-1>}
{<AI05-0248-1AI05-0248-1>} --< The declaration of type Character is based
on the standard ISO 8859-1 character set.>
- -- There are no character literals corresponding to the positions
for control characters.
- -- They are indicated in italics in this definition. See *note
3.5.2::.
+ --< There are no character literals corresponding to the positions
for control characters.>
+ --< They are indicated in italics in this definition. See *note
3.5.2::.>
type Character is
- (nul, soh, stx, etx, eot, enq, ack, bel, --0
(16#00#) .. 7 (16#07#)
- bs, ht, lf, vt, ff, cr, so, si, --8 (16#08#) .. 15
(16#0F#)
+ (<nul>, <soh>, <stx>, <etx>, <eot>, <enq>, <ack>,
<bel>, --<0 (16#00#) .. 7 (16#07#)>
+ <bs>, <ht>, <lf>, <vt>, <ff>, <cr>, <so>, <si>,
--<8 (16#08#) .. 15 (16#0F#)>
- dle, dc1, dc2, dc3, dc4, nak, syn, etb, --16
(16#10#) .. 23 (16#17#)
- can, em, sub, esc, fs, gs, rs, us, --24 (16#18#) ..
31 (16#1F#)
+ <dle>, <dc1>, <dc2>, <dc3>, <dc4>, <nak>, <syn>,
<etb>, --<16 (16#10#) .. 23 (16#17#)>
+ <can>, <em>, <sub>, <esc>, <fs>, <gs>, <rs>, <us>,
--<24 (16#18#) .. 31 (16#1F#)>
- ' ', '!', '"', '#', '$', '%', '&', ''', --32
(16#20#) .. 39 (16#27#)
- '(', ')', '*', '+', ',', '-', '.', '/', --40
(16#28#) .. 47 (16#2F#)
+ ' ', '!', '"', '#', '$', '%', '&', ''', --<32
(16#20#) .. 39 (16#27#)>
+ '(', ')', '*', '+', ',', '-', '.', '/', --<40
(16#28#) .. 47 (16#2F#)>
- '0', '1', '2', '3', '4', '5', '6', '7', --48
(16#30#) .. 55 (16#37#)
- '8', '9', ':', ';', '<', '=', '>', '?', --56
(16#38#) .. 63 (16#3F#)
+ '0', '1', '2', '3', '4', '5', '6', '7', --<48
(16#30#) .. 55 (16#37#)>
+ '8', '9', ':', ';', '<', '=', '>', '?', --<56
(16#38#) .. 63 (16#3F#)>
- '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', --64
(16#40#) .. 71 (16#47#)
- 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', --72
(16#48#) .. 79 (16#4F#)
+ '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', --<64
(16#40#) .. 71 (16#47#)>
+ 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', --<72
(16#48#) .. 79 (16#4F#)>
- 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', --80
(16#50#) .. 87 (16#57#)
- 'X', 'Y', 'Z', '[', '\', ']', '^', '_', --88
(16#58#) .. 95 (16#5F#)
+ 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', --<80
(16#50#) .. 87 (16#57#)>
+ 'X', 'Y', 'Z', '[', '\', ']', '^', '_', --<88
(16#58#) .. 95 (16#5F#)>
- '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', --96
(16#60#) .. 103 (16#67#)
- 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', --104
(16#68#) .. 111 (16#6F#)
+ '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', --<96
(16#60#) .. 103 (16#67#)>
+ 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', --<104
(16#68#) .. 111 (16#6F#)>
- 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', --112
(16#70#) .. 119 (16#77#)
- 'x', 'y', 'z', '{', '|', '}', '~', del, --120
(16#78#) .. 127 (16#7F#)
+ 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', --<112
(16#70#) .. 119 (16#77#)>
+ 'x', 'y', 'z', '{', '|', '}', '~', <del>, --<120
(16#78#) .. 127 (16#7F#)>
- reserved_128, reserved_129, bph, nbh, --128 (16#80#)
.. 131 (16#83#)
- reserved_132, nel, ssa, esa, --132 (16#84#) .. 135
(16#87#)
- hts, htj, vts, pld, plu, ri, ss2, ss3, --136
(16#88#) .. 143 (16#8F#)
+ <reserved_128>, <reserved_129>, <bph>, <nbh>, --<128
(16#80#) .. 131 (16#83#)>
+ <reserved_132>, <nel>, <ssa>, <esa>, --<132
(16#84#) .. 135 (16#87#)>
+ <hts>, <htj>, <vts>, <pld>, <plu>, <ri>, <ss2>,
<ss3>, --<136 (16#88#) .. 143 (16#8F#)>
- dcs, pu1, pu2, sts, cch, mw, spa, epa, --144
(16#90#) .. 151 (16#97#)
- sos, reserved_153, sci, csi, --152 (16#98#) .. 155
(16#9B#)
- st, osc, pm, apc, --156 (16#9C#) .. 159 (16#9F#)
+ <dcs>, <pu1>, <pu2>, <sts>, <cch>, <mw>, <spa>,
<epa>, --<144 (16#90#) .. 151 (16#97#)>
+ <sos>, <reserved_153>, <sci>, <csi>, --<152
(16#98#) .. 155 (16#9B#)>
+ <st>, <osc>, <pm>, <apc>, --<156 (16#9C#) ..
159 (16#9F#)>
- ' ', '�', '�', '�', '�', '�', '�', '�', --160
(16#A0#) .. 167 (16#A7#)
- '�', '�', '�', '�', --168 (16#A8#) .. 171
(16#AB#)
- �', soft_hyphen, '�', '�', --172 (16#AC#) .. 175
(16#AF#)
+ ' ', '�', '�', '�', '�', '�', '�', '�', --<160
(16#A0#) .. 167 (16#A7#)>
+ '�', '�', '�', '�', --<168 (16#A8#) .. 171
(16#AB#)>
+ �', <soft_hyphen>, '�', '�', --<172 (16#AC#) ..
175 (16#AF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --176
(16#B0#) .. 183 (16#B7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --184
(16#B8#) .. 191 (16#BF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<176
(16#B0#) .. 183 (16#B7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<184
(16#B8#) .. 191 (16#BF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --192
(16#C0#) .. 199 (16#C7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --200
(16#C8#) .. 207 (16#CF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<192
(16#C0#) .. 199 (16#C7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<200
(16#C8#) .. 207 (16#CF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --208
(16#D0#) .. 215 (16#D7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --216
(16#D8#) .. 223 (16#DF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<208
(16#D0#) .. 215 (16#D7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<216
(16#D8#) .. 223 (16#DF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --224
(16#E0#) .. 231 (16#E7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --232
(16#E8#) .. 239 (16#EF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<224
(16#E0#) .. 231 (16#E7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<232
(16#E8#) .. 239 (16#EF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --240
(16#F0#) .. 247 (16#F7#)
- '�', '�', '�', '�', '�', '�', '�', '�');--248
(16#F8#) .. 255 (16#FF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<240
(16#F0#) .. 247 (16#F7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�');--<248
(16#F8#) .. 255 (16#FF#)>
36
- -- The predefined operators for the type Character are the same as for
- -- any enumeration type.
+ --< The predefined operators for the type Character are the same as
for>
+ --< any enumeration type.>
36.1/3
- {AI95-00395-01AI95-00395-01} {AI05-0266-1AI05-0266-1} -- The
declaration of type Wide_Character is based on the standard ISO/IEC 10646:2011
BMP character
- -- set. The first 256 positions have the same contents as type
Character. See *note 3.5.2::.
+ {<AI95-00395-01AI95-00395-01>} {<AI05-0266-1AI05-0266-1>} --< The
declaration of type Wide_Character is based on the standard ISO/IEC 10646:2011
BMP character>
+ --< set. The first 256 positions have the same contents as type
Character. See *note 3.5.2::.>
- type Wide_Character is (nul, soh ... Hex_0000FFFE, Hex_0000FFFF);
+ type Wide_Character is (<nul>, <soh> ... <Hex_0000FFFE>,
<Hex_0000FFFF>);
36.2/3
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
{AI05-0266-1AI05-0266-1} -- The declaration of type Wide_Wide_Character is
based on the full
- -- ISO/IEC 10646:2011 character set. The first 65536 positions have the
- -- same contents as type Wide_Character. See *note 3.5.2::.
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
{<AI05-0266-1AI05-0266-1>} --< The declaration of type Wide_Wide_Character
is based on the full>
+ --< ISO/IEC 10646:2011 character set. The first 65536 positions have
the>
+ --< same contents as type Wide_Character. See *note 3.5.2::.>
- type Wide_Wide_Character is (nul, soh ... Hex_7FFFFFFE, Hex_7FFFFFFF);
+ type Wide_Wide_Character is (<nul>, <soh> ... <Hex_7FFFFFFE>,
<Hex_7FFFFFFF>);
for Wide_Wide_Character'Size use 32;
36.3/2
- package ASCII is ... end ASCII; --Obsolescent; see *note J.5::
-
+ package ASCII is ... end ASCII; --<Obsolescent; see *note J.5::>
+
37/3
- {AI05-0229-1AI05-0229-1} -- Predefined string types:
+ {<AI05-0229-1AI05-0229-1>} --< Predefined string types:>
type String is array(Positive range <>) of Character
with Pack;
38
- -- The predefined operators for this type are as follows:
+ --< The predefined operators for this type are as follows:>
39
-- function "=" (Left, Right: String) return Boolean;
@@ -70282,29 +70537,29 @@ The library package Standard has the following
declaration:
-- function "&" (Left: Character; Right: Character) return String;
41/3
- {AI05-0229-1AI05-0229-1} type Wide_String is array(Positive range <>)
of Wide_Character
+ {<AI05-0229-1AI05-0229-1>} type Wide_String is array(Positive range
<>) of Wide_Character
with Pack;
42
- -- The predefined operators for this type correspond to those for
String.
+ --< The predefined operators for this type correspond to those for
String.>
42.1/3
- {AI95-00285-01AI95-00285-01} {AI05-0229-1AI05-0229-1} type
Wide_Wide_String is array (Positive range <>)
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0229-1AI05-0229-1>} type
Wide_Wide_String is array (Positive range <>)
of Wide_Wide_Character
with Pack;
42.2/2
- {AI95-00285-01AI95-00285-01} -- The predefined operators for this type
correspond to those for String.
+ {<AI95-00285-01AI95-00285-01>} --< The predefined operators for this
type correspond to those for String.>
43
- type Duration is delta implementation-defined range
implementation-defined;
+ type Duration is delta <implementation-defined> range
<implementation-defined>;
44
- -- The predefined operators for the type Duration are the same as
for
- -- any fixed point type.
+ --< The predefined operators for the type Duration are the same as
for>
+ --< any fixed point type.>
45
- -- The predefined exceptions:
+ --< The predefined exceptions:>
46
Constraint_Error: exception;
@@ -70324,7 +70579,7 @@ Standard has no private part.
private part then it would be visible to all of them.
49/2
-{AI95-00285-01AI95-00285-01} In each of the types Character,
+{<AI95-00285-01AI95-00285-01>} In each of the types Character,
Wide_Character, and Wide_Wide_Character, the character literals for the
space character (position 32) and the non-breaking space character
(position 160) correspond to different values. Unless indicated
@@ -70455,7 +70710,7 @@ types, then the names should end with "Float" as in
"Long_Float".
_Extensions to Ada 95_
56.h/2
- {AI95-00285-01AI95-00285-01} Types Wide_Wide_Character and
+ {<AI95-00285-01AI95-00285-01>} Types Wide_Wide_Character and
Wide_Wide_String are new.
56.i/2
@@ -70463,20 +70718,20 @@ types, then the names should end with "Float" as in
"Long_Float".
are documented in *note 3.5.2:: and *note 3.6.3::.
56.j/2
- {AI95-00230-01AI95-00230-01} Type universal_access and the
+ {<AI95-00230-01AI95-00230-01>} Type <universal_access> and the
equality operations for it are new.
_Wording Changes from Ada 95_
56.k/2
- {8652/00288652/0028} {AI95-00145-01AI95-00145-01} Corrigendum:
- Corrected the parameter type for the Boolean operators
- declared in Standard..
+ {<8652/00288652/0028>} {<AI95-00145-01AI95-00145-01>}
+ Corrigendum: Corrected the parameter type for the Boolean
+ operators declared in Standard..
_Wording Changes from Ada 2005_
56.l/3
- {AI05-0181-1AI05-0181-1} Correction: Since soft_hyphen
+ {<AI05-0181-1AI05-0181-1>} Correction: Since soft_hyphen
(position 173) is defined to be nongraphic, gave it a name.
56.m/3
@@ -70535,7 +70790,7 @@ In the standard mode, it is illegal to compile a child
of package Ada.
_Extensions to Ada 83_
4.e/3
- {AI05-0299-1AI05-0299-1} This subclause is new to Ada 95.
+ {<AI05-0299-1AI05-0299-1>} This subclause is new to Ada 95.
File: aarm2012.info, Node: A.3, Next: A.4, Prev: A.2, Up: Annex A
@@ -70544,9 +70799,9 @@ A.3 Character Handling
======================
1/3
-{AI95-00285-01AI95-00285-01} {AI05-0243-1AI05-0243-1}
-{AI05-0299-1AI05-0299-1} This subclause presents the packages related to
-character processing: an empty declared pure package Characters and
+{<AI95-00285-01AI95-00285-01>} {<AI05-0243-1AI05-0243-1>}
+{<AI05-0299-1AI05-0299-1>} This subclause presents the packages related
+to character processing: an empty declared pure package Characters and
child packages Characters.Handling and Characters.Latin_1. The package
Characters.Handling provides classification and conversion functions for
Character data, and some simple functions for dealing with
@@ -70557,12 +70812,12 @@ type Character.
_Extensions to Ada 83_
1.a/3
- {AI05-0299-1AI05-0299-1} This subclause is new to Ada 95.
+ {<AI05-0299-1AI05-0299-1>} This subclause is new to Ada 95.
_Wording Changes from Ada 95_
1.b/2
- {AI95-00285-01AI95-00285-01} Included Wide_Wide_Character in
+ {<AI95-00285-01AI95-00285-01>} Included Wide_Wide_Character in
this description; the individual changes are documented as
extensions as needed.
@@ -70592,8 +70847,8 @@ The library package Characters has the following
declaration:
end Ada.Characters;
3/2
-{AI95-00395-01AI95-00395-01} The library package Wide_Characters has the
-following declaration:
+{<AI95-00395-01AI95-00395-01>} The library package Wide_Characters has
+the following declaration:
4/2
package Ada.Wide_Characters is
@@ -70601,7 +70856,7 @@ following declaration:
end Ada.Wide_Characters;
5/2
-{AI95-00395-01AI95-00395-01} The library package Wide_Wide_Characters
+{<AI95-00395-01AI95-00395-01>} The library package Wide_Wide_Characters
has the following declaration:
6/2
@@ -70612,7 +70867,7 @@ has the following declaration:
_Implementation Advice_
7/3
-{AI95-00395-01AI95-00395-01} {AI05-0185-1AI05-0185-1} If an
+{<AI95-00395-01AI95-00395-01>} {<AI05-0185-1AI05-0185-1>} If an
implementation chooses to provide implementation-defined operations on
Wide_Character or Wide_String (such as collating and sorting, etc.) it
should do so by providing child units of Wide_Characters. Similarly if
@@ -70629,8 +70884,8 @@ child units of Wide_Wide_Characters.
_Extensions to Ada 95_
7.b/2
- {AI95-00395-01AI95-00395-01} The packages Wide_Characters and
- Wide_Wide_Characters are new.
+ {<AI95-00395-01AI95-00395-01>} The packages Wide_Characters
+ and Wide_Wide_Characters are new.
File: aarm2012.info, Node: A.3.2, Next: A.3.3, Prev: A.3.1, Up: A.3
@@ -70644,15 +70899,15 @@ A.3.2 The Package Characters.Handling
The library package Characters.Handling has the following declaration:
2/2
- {AI95-00362-01AI95-00362-01} {AI95-00395-01AI95-00395-01} with
Ada.Characters.Conversions;
+ {<AI95-00362-01AI95-00362-01>} {<AI95-00395-01AI95-00395-01>} with
Ada.Characters.Conversions;
package Ada.Characters.Handling is
pragma Pure(Handling);
3
- --Character classification functions
+ --<Character classification functions>
4/3
- {AI05-0185-1AI05-0185-1} function Is_Control (Item : in
Character) return Boolean;
+ {<AI05-0185-1AI05-0185-1>} function Is_Control (Item : in
Character) return Boolean;
function Is_Graphic (Item : in Character) return Boolean;
function Is_Letter (Item : in Character) return Boolean;
function Is_Lower (Item : in Character) return Boolean;
@@ -70671,7 +70926,7 @@ The library package Characters.Handling has the
following declaration:
function Is_Space (Item : in Character) return Boolean;
5
- --Conversion functions for Character and String
+ --<Conversion functions for Character and String>
6
function To_Lower (Item : in Character) return Character;
@@ -70684,7 +70939,7 @@ The library package Characters.Handling has the
following declaration:
function To_Basic (Item : in String) return String;
8
- --Classifications of and conversions between Character and ISO 646
+ --<Classifications of and conversions between Character and ISO 646>
9
subtype ISO_646 is
@@ -70705,16 +70960,16 @@ The library package Characters.Handling has the
following declaration:
return String;
13/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01} -- The
functions Is_Character, Is_String, To_Character, To_String, To_Wide_Character,
- -- and To_Wide_String are obsolescent; see *note J.14::.
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>} --< The
functions Is_Character, Is_String, To_Character, To_String, To_Wide_Character,>
+ --< and To_Wide_String are obsolescent; see *note J.14::.>
- Paragraphs 14 through 18 were deleted.
+ <Paragraphs 14 through 18 were deleted.>
19
end Ada.Characters.Handling;
19.a/2
- Discussion: {AI95-00395-01AI95-00395-01} The with_clause for
+ Discussion: {<AI95-00395-01AI95-00395-01>} The with_clause for
Ada.Characters.Conversions is needed for the definition of the
obsolescent functions (see *note J.14::). It would be odd to
put this clause into *note J.14:: as it was not present in Ada
@@ -70733,46 +70988,47 @@ parameter, Item, and returns a Boolean result.
22
Is_Control
- True if Item is a control character. A control character
- is a character whose position is in one of the ranges
- 0..31 or 127..159.
+ True if Item is a control character. A <control
+ character> is a character whose position is in one of the
+ ranges 0..31 or 127..159.
23
Is_Graphic
- True if Item is a graphic character. A graphic character
- is a character whose position is in one of the ranges
- 32..126 or 160..255.
+ True if Item is a graphic character. A <graphic
+ character> is a character whose position is in one of the
+ ranges 32..126 or 160..255.
24
Is_Letter
- True if Item is a letter. A letter is a character that
+ True if Item is a letter. A <letter> is a character that
is in one of the ranges 'A'..'Z' or 'a'..'z', or whose
position is in one of the ranges 192..214, 216..246, or
248..255.
25
Is_Lower
- True if Item is a lower-case letter. A lower-case letter
- is a character that is in the range 'a'..'z', or whose
- position is in one of the ranges 223..246 or 248..255.
+ True if Item is a lower-case letter. A <lower-case
+ letter> is a character that is in the range 'a'..'z', or
+ whose position is in one of the ranges 223..246 or
+ 248..255.
26
Is_Upper
- True if Item is an upper-case letter. An upper-case
- letter is a character that is in the range 'A'..'Z' or
+ True if Item is an upper-case letter. An <upper-case
+ letter> is a character that is in the range 'A'..'Z' or
whose position is in one of the ranges 192..214 or 216..
222.
27
Is_Basic
- True if Item is a basic letter. A basic letter is a
+ True if Item is a basic letter. A <basic letter> is a
character that is in one of the ranges 'A'..'Z' and
'a'..'z', or that is one of the following: '�', '�', '�',
'�', '�', '�', or '�'.
28
Is_Digit
- True if Item is a decimal digit. A decimal digit is a
+ True if Item is a decimal digit. A <decimal digit> is a
character in the range '0'..'9'.
29
@@ -70781,45 +71037,45 @@ Is_Decimal_Digit
30
Is_Hexadecimal_Digit
- True if Item is a hexadecimal digit. A hexadecimal digit
- is a character that is either a decimal digit or that is
- in one of the ranges 'A' .. 'F' or 'a' .. 'f'.
+ True if Item is a hexadecimal digit. A <hexadecimal
+ digit> is a character that is either a decimal digit or
+ that is in one of the ranges 'A' .. 'F' or 'a' .. 'f'.
31
Is_Alphanumeric
True if Item is an alphanumeric character. An
- alphanumeric character is a character that is either a
+ <alphanumeric character> is a character that is either a
letter or a decimal digit.
32
Is_Special
- True if Item is a special graphic character. A special
- graphic character is a graphic character that is not
+ True if Item is a special graphic character. A <special
+ graphic character> is a graphic character that is not
alphanumeric.
32.1/3
-{AI05-0185-1AI05-0185-1} Is_Line_Terminator
+{<AI05-0185-1AI05-0185-1>} Is_Line_Terminator
True if Item is a character with position 10 .. 13
(Line_Feed, Line_Tabulation, Form_Feed, Carriage_Return)
or 133 (Next_Line).
32.2/3
-{AI05-0185-1AI05-0185-1} Is_Mark
+{<AI05-0185-1AI05-0185-1>} Is_Mark
Never True (no value of type Character has categories
Mark, Non-Spacing or Mark, Spacing Combining).
32.3/3
-{AI05-0185-1AI05-0185-1} Is_Other_Format
+{<AI05-0185-1AI05-0185-1>} Is_Other_Format
True if Item is a character with position 173
(Soft_Hyphen).
32.4/3
-{AI05-0185-1AI05-0185-1} Is_Punctuation_Connector
+{<AI05-0185-1AI05-0185-1>} Is_Punctuation_Connector
True if Item is a character with position 95 ('_', known
as Low_Line or Underscore).
32.5/3
-{AI05-0185-1AI05-0185-1} Is_Space
+{<AI05-0185-1AI05-0185-1>} Is_Space
True if Item is a character with position 32 (' ') or 160
(No_Break_Space).
@@ -70881,7 +71137,7 @@ To_ISO_646
1..Item'Length and each of whose elements is given by
To_ISO_646 of the corresponding element in Item.
-Paragraphs 42 through 49 were deleted.
+<Paragraphs 42 through 49 were deleted.>
NOTES
@@ -70926,8 +71182,8 @@ Paragraphs 42 through 49 were deleted.
but not both.
60/3
- 7 {AI05-0114-1AI05-0114-1} There are certain characters which are
- defined to be lower case letters by ISO 10646 and are therefore
+ 7 {<AI05-0114-1AI05-0114-1>} There are certain characters which
+ are defined to be lower case letters by ISO 10646 and are therefore
allowed in identifiers, but are not considered lower case letters
by Ada.Characters.Handling.
@@ -70949,38 +71205,39 @@ Paragraphs 42 through 49 were deleted.
_Extensions to Ada 95_
60.c/2
- {AI95-00362-01AI95-00362-01} Characters.Handling is now Pure,
- so it can be used in pure units.
+ {<AI95-00362-01AI95-00362-01>} Characters.Handling is now
+ Pure, so it can be used in pure units.
_Incompatibilities With Ada 2005_
60.d/3
- {AI05-0185-1AI05-0185-1} Added additional classification
+ {<AI05-0185-1AI05-0185-1>} Added additional classification
routines so that Characters.Handling has all of the routines
available in Wide_Characters.Handling. If Characters.Handling
- is referenced in a use_clause, and an entity E with a
+ is referenced in a use_clause, and an entity <E> with a
defining_identifier that is the same as one of the new
functions is defined in a package that is also referenced in a
- use_clause, the entity E may no longer be use-visible,
+ use_clause, the entity <E> may no longer be use-visible,
resulting in errors. This should be rare and is easily fixed
if it does occur.
_Wording Changes from Ada 95_
60.e/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01} The
- conversion functions are made obsolescent; a more complete set
- is available in Characters.Conversions -- see *note A.3.4::.
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+ The conversion functions are made obsolescent; a more complete
+ set is available in Characters.Conversions -- see *note
+ A.3.4::.
60.f/3
- {AI95-00285-01AI95-00285-01} {AI05-0248-1AI05-0248-1} We no
- longer talk about localized character sets; these are a
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0248-1AI05-0248-1>} We
+ no longer talk about localized character sets; these are a
nonstandard mode, which is none of our business.
_Wording Changes from Ada 2005_
60.g/3
- {AI05-0114-1AI05-0114-1} Correction: Added a note to clarify
+ {<AI05-0114-1AI05-0114-1>} Correction: Added a note to clarify
that these functions don't have any relationship to the
characters allowed in identifiers.
@@ -71012,7 +71269,7 @@ The library package Characters.Latin_1 has the
following declaration:
pragma Pure(Latin_1);
4
- -- Control characters:
+ --< Control characters:>
5
NUL : constant Character := Character'Val(0);
@@ -71051,87 +71308,87 @@ The library package Characters.Latin_1 has the
following declaration:
US : constant Character := Character'Val(31);
7
- -- ISO 646 graphic characters:
+ --< ISO 646 graphic characters:>
8
- Space : constant Character := ' '; --
Character'Val(32)
- Exclamation : constant Character := '!'; --
Character'Val(33)
- Quotation : constant Character := '"'; --
Character'Val(34)
- Number_Sign : constant Character := '#'; --
Character'Val(35)
- Dollar_Sign : constant Character := '$'; --
Character'Val(36)
- Percent_Sign : constant Character := '%'; --
Character'Val(37)
- Ampersand : constant Character := '&'; --
Character'Val(38)
- Apostrophe : constant Character := '''; --
Character'Val(39)
- Left_Parenthesis : constant Character := '('; --
Character'Val(40)
- Right_Parenthesis : constant Character := ')'; --
Character'Val(41)
- Asterisk : constant Character := '*'; --
Character'Val(42)
- Plus_Sign : constant Character := '+'; --
Character'Val(43)
- Comma : constant Character := ','; --
Character'Val(44)
- Hyphen : constant Character := '-'; --
Character'Val(45)
+ Space : constant Character := ' '; --<
Character'Val(32)>
+ Exclamation : constant Character := '!'; --<
Character'Val(33)>
+ Quotation : constant Character := '"'; --<
Character'Val(34)>
+ Number_Sign : constant Character := '#'; --<
Character'Val(35)>
+ Dollar_Sign : constant Character := '$'; --<
Character'Val(36)>
+ Percent_Sign : constant Character := '%'; --<
Character'Val(37)>
+ Ampersand : constant Character := '&'; --<
Character'Val(38)>
+ Apostrophe : constant Character := '''; --<
Character'Val(39)>
+ Left_Parenthesis : constant Character := '('; --<
Character'Val(40)>
+ Right_Parenthesis : constant Character := ')'; --<
Character'Val(41)>
+ Asterisk : constant Character := '*'; --<
Character'Val(42)>
+ Plus_Sign : constant Character := '+'; --<
Character'Val(43)>
+ Comma : constant Character := ','; --<
Character'Val(44)>
+ Hyphen : constant Character := '-'; --<
Character'Val(45)>
Minus_Sign : Character renames Hyphen;
- Full_Stop : constant Character := '.'; --
Character'Val(46)
- Solidus : constant Character := '/'; --
Character'Val(47)
+ Full_Stop : constant Character := '.'; --<
Character'Val(46)>
+ Solidus : constant Character := '/'; --<
Character'Val(47)>
9
- -- Decimal digits '0' though '9' are at positions 48 through 57
+ --< Decimal digits '0' though '9' are at positions 48 through 57>
10
- Colon : constant Character := ':'; --
Character'Val(58)
- Semicolon : constant Character := ';'; --
Character'Val(59)
- Less_Than_Sign : constant Character := '<'; --
Character'Val(60)
- Equals_Sign : constant Character := '='; --
Character'Val(61)
- Greater_Than_Sign : constant Character := '>'; --
Character'Val(62)
- Question : constant Character := '?'; --
Character'Val(63)
- Commercial_At : constant Character := '@'; --
Character'Val(64)
+ Colon : constant Character := ':'; --<
Character'Val(58)>
+ Semicolon : constant Character := ';'; --<
Character'Val(59)>
+ Less_Than_Sign : constant Character := '<'; --<
Character'Val(60)>
+ Equals_Sign : constant Character := '='; --<
Character'Val(61)>
+ Greater_Than_Sign : constant Character := '>'; --<
Character'Val(62)>
+ Question : constant Character := '?'; --<
Character'Val(63)>
+ Commercial_At : constant Character := '@'; --<
Character'Val(64)>
11
- -- Letters 'A' through 'Z' are at positions 65 through 90
+ --< Letters 'A' through 'Z' are at positions 65 through 90>
12
- Left_Square_Bracket : constant Character := '['; --
Character'Val(91)
- Reverse_Solidus : constant Character := '\'; --
Character'Val(92)
- Right_Square_Bracket : constant Character := ']'; --
Character'Val(93)
- Circumflex : constant Character := '^'; --
Character'Val(94)
- Low_Line : constant Character := '_'; --
Character'Val(95)
+ Left_Square_Bracket : constant Character := '['; --<
Character'Val(91)>
+ Reverse_Solidus : constant Character := '\'; --<
Character'Val(92)>
+ Right_Square_Bracket : constant Character := ']'; --<
Character'Val(93)>
+ Circumflex : constant Character := '^'; --<
Character'Val(94)>
+ Low_Line : constant Character := '_'; --<
Character'Val(95)>
13
- Grave : constant Character := '`'; --
Character'Val(96)
- LC_A : constant Character := 'a'; --
Character'Val(97)
- LC_B : constant Character := 'b'; --
Character'Val(98)
- LC_C : constant Character := 'c'; --
Character'Val(99)
- LC_D : constant Character := 'd'; --
Character'Val(100)
- LC_E : constant Character := 'e'; --
Character'Val(101)
- LC_F : constant Character := 'f'; --
Character'Val(102)
- LC_G : constant Character := 'g'; --
Character'Val(103)
- LC_H : constant Character := 'h'; --
Character'Val(104)
- LC_I : constant Character := 'i'; --
Character'Val(105)
- LC_J : constant Character := 'j'; --
Character'Val(106)
- LC_K : constant Character := 'k'; --
Character'Val(107)
- LC_L : constant Character := 'l'; --
Character'Val(108)
- LC_M : constant Character := 'm'; --
Character'Val(109)
- LC_N : constant Character := 'n'; --
Character'Val(110)
- LC_O : constant Character := 'o'; --
Character'Val(111)
+ Grave : constant Character := '`'; --<
Character'Val(96)>
+ LC_A : constant Character := 'a'; --<
Character'Val(97)>
+ LC_B : constant Character := 'b'; --<
Character'Val(98)>
+ LC_C : constant Character := 'c'; --<
Character'Val(99)>
+ LC_D : constant Character := 'd'; --<
Character'Val(100)>
+ LC_E : constant Character := 'e'; --<
Character'Val(101)>
+ LC_F : constant Character := 'f'; --<
Character'Val(102)>
+ LC_G : constant Character := 'g'; --<
Character'Val(103)>
+ LC_H : constant Character := 'h'; --<
Character'Val(104)>
+ LC_I : constant Character := 'i'; --<
Character'Val(105)>
+ LC_J : constant Character := 'j'; --<
Character'Val(106)>
+ LC_K : constant Character := 'k'; --<
Character'Val(107)>
+ LC_L : constant Character := 'l'; --<
Character'Val(108)>
+ LC_M : constant Character := 'm'; --<
Character'Val(109)>
+ LC_N : constant Character := 'n'; --<
Character'Val(110)>
+ LC_O : constant Character := 'o'; --<
Character'Val(111)>
14
- LC_P : constant Character := 'p'; --
Character'Val(112)
- LC_Q : constant Character := 'q'; --
Character'Val(113)
- LC_R : constant Character := 'r'; --
Character'Val(114)
- LC_S : constant Character := 's'; --
Character'Val(115)
- LC_T : constant Character := 't'; --
Character'Val(116)
- LC_U : constant Character := 'u'; --
Character'Val(117)
- LC_V : constant Character := 'v'; --
Character'Val(118)
- LC_W : constant Character := 'w'; --
Character'Val(119)
- LC_X : constant Character := 'x'; --
Character'Val(120)
- LC_Y : constant Character := 'y'; --
Character'Val(121)
- LC_Z : constant Character := 'z'; --
Character'Val(122)
- Left_Curly_Bracket : constant Character := '{'; --
Character'Val(123)
- Vertical_Line : constant Character := '|'; --
Character'Val(124)
- Right_Curly_Bracket : constant Character := '}'; --
Character'Val(125)
- Tilde : constant Character := '~'; --
Character'Val(126)
+ LC_P : constant Character := 'p'; --<
Character'Val(112)>
+ LC_Q : constant Character := 'q'; --<
Character'Val(113)>
+ LC_R : constant Character := 'r'; --<
Character'Val(114)>
+ LC_S : constant Character := 's'; --<
Character'Val(115)>
+ LC_T : constant Character := 't'; --<
Character'Val(116)>
+ LC_U : constant Character := 'u'; --<
Character'Val(117)>
+ LC_V : constant Character := 'v'; --<
Character'Val(118)>
+ LC_W : constant Character := 'w'; --<
Character'Val(119)>
+ LC_X : constant Character := 'x'; --<
Character'Val(120)>
+ LC_Y : constant Character := 'y'; --<
Character'Val(121)>
+ LC_Z : constant Character := 'z'; --<
Character'Val(122)>
+ Left_Curly_Bracket : constant Character := '{'; --<
Character'Val(123)>
+ Vertical_Line : constant Character := '|'; --<
Character'Val(124)>
+ Right_Curly_Bracket : constant Character := '}'; --<
Character'Val(125)>
+ Tilde : constant Character := '~'; --<
Character'Val(126)>
DEL : constant Character := Character'Val(127);
15
- -- ISO 6429 control characters:
+ --< ISO 6429 control characters:>
16
IS4 : Character renames FS;
@@ -71178,124 +71435,124 @@ The library package Characters.Latin_1 has the
following declaration:
APC : constant Character := Character'Val(159);
20
- -- Other graphic characters:
+ --< Other graphic characters:>
21/3
- {AI05-0181-1AI05-0181-1} -- Character positions 160 (16#A0#) .. 175
(16#AF#):
- No_Break_Space : constant Character := ' ';
--Character'Val(160)
+ {<AI05-0181-1AI05-0181-1>} --< Character positions 160 (16#A0#) .. 175
(16#AF#):>
+ No_Break_Space : constant Character := ' ';
--<Character'Val(160)>
NBSP : Character renames No_Break_Space;
- Inverted_Exclamation : constant Character := '�';
--Character'Val(161)
- Cent_Sign : constant Character := '�';
--Character'Val(162)
- Pound_Sign : constant Character := '�';
--Character'Val(163)
- Currency_Sign : constant Character := '�';
--Character'Val(164)
- Yen_Sign : constant Character := '�';
--Character'Val(165)
- Broken_Bar : constant Character := '�';
--Character'Val(166)
- Section_Sign : constant Character := '�';
--Character'Val(167)
- Diaeresis : constant Character := '�';
--Character'Val(168)
- Copyright_Sign : constant Character := '�';
--Character'Val(169)
- Feminine_Ordinal_Indicator : constant Character := '�';
--Character'Val(170)
- Left_Angle_Quotation : constant Character := '�';
--Character'Val(171)
- Not_Sign : constant Character := '�';
--Character'Val(172)
+ Inverted_Exclamation : constant Character := '�';
--<Character'Val(161)>
+ Cent_Sign : constant Character := '�';
--<Character'Val(162)>
+ Pound_Sign : constant Character := '�';
--<Character'Val(163)>
+ Currency_Sign : constant Character := '�';
--<Character'Val(164)>
+ Yen_Sign : constant Character := '�';
--<Character'Val(165)>
+ Broken_Bar : constant Character := '�';
--<Character'Val(166)>
+ Section_Sign : constant Character := '�';
--<Character'Val(167)>
+ Diaeresis : constant Character := '�';
--<Character'Val(168)>
+ Copyright_Sign : constant Character := '�';
--<Character'Val(169)>
+ Feminine_Ordinal_Indicator : constant Character := '�';
--<Character'Val(170)>
+ Left_Angle_Quotation : constant Character := '�';
--<Character'Val(171)>
+ Not_Sign : constant Character := '�';
--<Character'Val(172)>
Soft_Hyphen : constant Character := Character'Val(173);
- Registered_Trade_Mark_Sign : constant Character := '�';
--Character'Val(174)
- Macron : constant Character := '�';
--Character'Val(175)
+ Registered_Trade_Mark_Sign : constant Character := '�';
--<Character'Val(174)>
+ Macron : constant Character := '�';
--<Character'Val(175)>
22
- -- Character positions 176 (16#B0#) .. 191 (16#BF#):
- Degree_Sign : constant Character := '�';
--Character'Val(176)
+ --< Character positions 176 (16#B0#) .. 191 (16#BF#):>
+ Degree_Sign : constant Character := '�';
--<Character'Val(176)>
Ring_Above : Character renames Degree_Sign;
- Plus_Minus_Sign : constant Character := '�';
--Character'Val(177)
- Superscript_Two : constant Character := '�';
--Character'Val(178)
- Superscript_Three : constant Character := '�';
--Character'Val(179)
- Acute : constant Character := '�';
--Character'Val(180)
- Micro_Sign : constant Character := '�';
--Character'Val(181)
- Pilcrow_Sign : constant Character := '�';
--Character'Val(182)
+ Plus_Minus_Sign : constant Character := '�';
--<Character'Val(177)>
+ Superscript_Two : constant Character := '�';
--<Character'Val(178)>
+ Superscript_Three : constant Character := '�';
--<Character'Val(179)>
+ Acute : constant Character := '�';
--<Character'Val(180)>
+ Micro_Sign : constant Character := '�';
--<Character'Val(181)>
+ Pilcrow_Sign : constant Character := '�';
--<Character'Val(182)>
Paragraph_Sign : Character renames Pilcrow_Sign;
- Middle_Dot : constant Character := '�';
--Character'Val(183)
- Cedilla : constant Character := '�';
--Character'Val(184)
- Superscript_One : constant Character := '�';
--Character'Val(185)
- Masculine_Ordinal_Indicator: constant Character := '�';
--Character'Val(186)
- Right_Angle_Quotation : constant Character := '�';
--Character'Val(187)
- Fraction_One_Quarter : constant Character := '�';
--Character'Val(188)
- Fraction_One_Half : constant Character := '�';
--Character'Val(189)
- Fraction_Three_Quarters : constant Character := '�';
--Character'Val(190)
- Inverted_Question : constant Character := '�';
--Character'Val(191)
+ Middle_Dot : constant Character := '�';
--<Character'Val(183)>
+ Cedilla : constant Character := '�';
--<Character'Val(184)>
+ Superscript_One : constant Character := '�';
--<Character'Val(185)>
+ Masculine_Ordinal_Indicator: constant Character := '�';
--<Character'Val(186)>
+ Right_Angle_Quotation : constant Character := '�';
--<Character'Val(187)>
+ Fraction_One_Quarter : constant Character := '�';
--<Character'Val(188)>
+ Fraction_One_Half : constant Character := '�';
--<Character'Val(189)>
+ Fraction_Three_Quarters : constant Character := '�';
--<Character'Val(190)>
+ Inverted_Question : constant Character := '�';
--<Character'Val(191)>
23
- -- Character positions 192 (16#C0#) .. 207 (16#CF#):
- UC_A_Grave : constant Character := '�';
--Character'Val(192)
- UC_A_Acute : constant Character := '�';
--Character'Val(193)
- UC_A_Circumflex : constant Character := '�';
--Character'Val(194)
- UC_A_Tilde : constant Character := '�';
--Character'Val(195)
- UC_A_Diaeresis : constant Character := '�';
--Character'Val(196)
- UC_A_Ring : constant Character := '�';
--Character'Val(197)
- UC_AE_Diphthong : constant Character := '�';
--Character'Val(198)
- UC_C_Cedilla : constant Character := '�';
--Character'Val(199)
- UC_E_Grave : constant Character := '�';
--Character'Val(200)
- UC_E_Acute : constant Character := '�';
--Character'Val(201)
- UC_E_Circumflex : constant Character := '�';
--Character'Val(202)
- UC_E_Diaeresis : constant Character := '�';
--Character'Val(203)
- UC_I_Grave : constant Character := '�';
--Character'Val(204)
- UC_I_Acute : constant Character := '�';
--Character'Val(205)
- UC_I_Circumflex : constant Character := '�';
--Character'Val(206)
- UC_I_Diaeresis : constant Character := '�';
--Character'Val(207)
+ --< Character positions 192 (16#C0#) .. 207 (16#CF#):>
+ UC_A_Grave : constant Character := '�';
--<Character'Val(192)>
+ UC_A_Acute : constant Character := '�';
--<Character'Val(193)>
+ UC_A_Circumflex : constant Character := '�';
--<Character'Val(194)>
+ UC_A_Tilde : constant Character := '�';
--<Character'Val(195)>
+ UC_A_Diaeresis : constant Character := '�';
--<Character'Val(196)>
+ UC_A_Ring : constant Character := '�';
--<Character'Val(197)>
+ UC_AE_Diphthong : constant Character := '�';
--<Character'Val(198)>
+ UC_C_Cedilla : constant Character := '�';
--<Character'Val(199)>
+ UC_E_Grave : constant Character := '�';
--<Character'Val(200)>
+ UC_E_Acute : constant Character := '�';
--<Character'Val(201)>
+ UC_E_Circumflex : constant Character := '�';
--<Character'Val(202)>
+ UC_E_Diaeresis : constant Character := '�';
--<Character'Val(203)>
+ UC_I_Grave : constant Character := '�';
--<Character'Val(204)>
+ UC_I_Acute : constant Character := '�';
--<Character'Val(205)>
+ UC_I_Circumflex : constant Character := '�';
--<Character'Val(206)>
+ UC_I_Diaeresis : constant Character := '�';
--<Character'Val(207)>
24
- -- Character positions 208 (16#D0#) .. 223 (16#DF#):
- UC_Icelandic_Eth : constant Character := '�';
--Character'Val(208)
- UC_N_Tilde : constant Character := '�';
--Character'Val(209)
- UC_O_Grave : constant Character := '�';
--Character'Val(210)
- UC_O_Acute : constant Character := '�';
--Character'Val(211)
- UC_O_Circumflex : constant Character := '�';
--Character'Val(212)
- UC_O_Tilde : constant Character := '�';
--Character'Val(213)
- UC_O_Diaeresis : constant Character := '�';
--Character'Val(214)
- Multiplication_Sign : constant Character := '�';
--Character'Val(215)
- UC_O_Oblique_Stroke : constant Character := '�';
--Character'Val(216)
- UC_U_Grave : constant Character := '�';
--Character'Val(217)
- UC_U_Acute : constant Character := '�';
--Character'Val(218)
- UC_U_Circumflex : constant Character := '�';
--Character'Val(219)
- UC_U_Diaeresis : constant Character := '�';
--Character'Val(220)
- UC_Y_Acute : constant Character := '�';
--Character'Val(221)
- UC_Icelandic_Thorn : constant Character := '�';
--Character'Val(222)
- LC_German_Sharp_S : constant Character := '�';
--Character'Val(223)
+ --< Character positions 208 (16#D0#) .. 223 (16#DF#):>
+ UC_Icelandic_Eth : constant Character := '�';
--<Character'Val(208)>
+ UC_N_Tilde : constant Character := '�';
--<Character'Val(209)>
+ UC_O_Grave : constant Character := '�';
--<Character'Val(210)>
+ UC_O_Acute : constant Character := '�';
--<Character'Val(211)>
+ UC_O_Circumflex : constant Character := '�';
--<Character'Val(212)>
+ UC_O_Tilde : constant Character := '�';
--<Character'Val(213)>
+ UC_O_Diaeresis : constant Character := '�';
--<Character'Val(214)>
+ Multiplication_Sign : constant Character := '�';
--<Character'Val(215)>
+ UC_O_Oblique_Stroke : constant Character := '�';
--<Character'Val(216)>
+ UC_U_Grave : constant Character := '�';
--<Character'Val(217)>
+ UC_U_Acute : constant Character := '�';
--<Character'Val(218)>
+ UC_U_Circumflex : constant Character := '�';
--<Character'Val(219)>
+ UC_U_Diaeresis : constant Character := '�';
--<Character'Val(220)>
+ UC_Y_Acute : constant Character := '�';
--<Character'Val(221)>
+ UC_Icelandic_Thorn : constant Character := '�';
--<Character'Val(222)>
+ LC_German_Sharp_S : constant Character := '�';
--<Character'Val(223)>
25
- -- Character positions 224 (16#E0#) .. 239 (16#EF#):
- LC_A_Grave : constant Character := '�';
--Character'Val(224)
- LC_A_Acute : constant Character := '�';
--Character'Val(225)
- LC_A_Circumflex : constant Character := '�';
--Character'Val(226)
- LC_A_Tilde : constant Character := '�';
--Character'Val(227)
- LC_A_Diaeresis : constant Character := '�';
--Character'Val(228)
- LC_A_Ring : constant Character := '�';
--Character'Val(229)
- LC_AE_Diphthong : constant Character := '�';
--Character'Val(230)
- LC_C_Cedilla : constant Character := '�';
--Character'Val(231)
- LC_E_Grave : constant Character := '�';
--Character'Val(232)
- LC_E_Acute : constant Character := '�';
--Character'Val(233)
- LC_E_Circumflex : constant Character := '�';
--Character'Val(234)
- LC_E_Diaeresis : constant Character := '�';
--Character'Val(235)
- LC_I_Grave : constant Character := '�';
--Character'Val(236)
- LC_I_Acute : constant Character := '�';
--Character'Val(237)
- LC_I_Circumflex : constant Character := '�';
--Character'Val(238)
- LC_I_Diaeresis : constant Character := '�';
--Character'Val(239)
+ --< Character positions 224 (16#E0#) .. 239 (16#EF#):>
+ LC_A_Grave : constant Character := '�';
--<Character'Val(224)>
+ LC_A_Acute : constant Character := '�';
--<Character'Val(225)>
+ LC_A_Circumflex : constant Character := '�';
--<Character'Val(226)>
+ LC_A_Tilde : constant Character := '�';
--<Character'Val(227)>
+ LC_A_Diaeresis : constant Character := '�';
--<Character'Val(228)>
+ LC_A_Ring : constant Character := '�';
--<Character'Val(229)>
+ LC_AE_Diphthong : constant Character := '�';
--<Character'Val(230)>
+ LC_C_Cedilla : constant Character := '�';
--<Character'Val(231)>
+ LC_E_Grave : constant Character := '�';
--<Character'Val(232)>
+ LC_E_Acute : constant Character := '�';
--<Character'Val(233)>
+ LC_E_Circumflex : constant Character := '�';
--<Character'Val(234)>
+ LC_E_Diaeresis : constant Character := '�';
--<Character'Val(235)>
+ LC_I_Grave : constant Character := '�';
--<Character'Val(236)>
+ LC_I_Acute : constant Character := '�';
--<Character'Val(237)>
+ LC_I_Circumflex : constant Character := '�';
--<Character'Val(238)>
+ LC_I_Diaeresis : constant Character := '�';
--<Character'Val(239)>
26
- -- Character positions 240 (16#F0#) .. 255 (16#FF#):
- LC_Icelandic_Eth : constant Character := '�';
--Character'Val(240)
- LC_N_Tilde : constant Character := '�';
--Character'Val(241)
- LC_O_Grave : constant Character := '�';
--Character'Val(242)
- LC_O_Acute : constant Character := '�';
--Character'Val(243)
- LC_O_Circumflex : constant Character := '�';
--Character'Val(244)
- LC_O_Tilde : constant Character := '�';
--Character'Val(245)
- LC_O_Diaeresis : constant Character := '�';
--Character'Val(246)
- Division_Sign : constant Character := '�';
--Character'Val(247)
- LC_O_Oblique_Stroke : constant Character := '�';
--Character'Val(248)
- LC_U_Grave : constant Character := '�';
--Character'Val(249)
- LC_U_Acute : constant Character := '�';
--Character'Val(250)
- LC_U_Circumflex : constant Character := '�';
--Character'Val(251)
- LC_U_Diaeresis : constant Character := '�';
--Character'Val(252)
- LC_Y_Acute : constant Character := '�';
--Character'Val(253)
- LC_Icelandic_Thorn : constant Character := '�';
--Character'Val(254)
- LC_Y_Diaeresis : constant Character := '�';
--Character'Val(255)
+ --< Character positions 240 (16#F0#) .. 255 (16#FF#):>
+ LC_Icelandic_Eth : constant Character := '�';
--<Character'Val(240)>
+ LC_N_Tilde : constant Character := '�';
--<Character'Val(241)>
+ LC_O_Grave : constant Character := '�';
--<Character'Val(242)>
+ LC_O_Acute : constant Character := '�';
--<Character'Val(243)>
+ LC_O_Circumflex : constant Character := '�';
--<Character'Val(244)>
+ LC_O_Tilde : constant Character := '�';
--<Character'Val(245)>
+ LC_O_Diaeresis : constant Character := '�';
--<Character'Val(246)>
+ Division_Sign : constant Character := '�';
--<Character'Val(247)>
+ LC_O_Oblique_Stroke : constant Character := '�';
--<Character'Val(248)>
+ LC_U_Grave : constant Character := '�';
--<Character'Val(249)>
+ LC_U_Acute : constant Character := '�';
--<Character'Val(250)>
+ LC_U_Circumflex : constant Character := '�';
--<Character'Val(251)>
+ LC_U_Diaeresis : constant Character := '�';
--<Character'Val(252)>
+ LC_Y_Acute : constant Character := '�';
--<Character'Val(253)>
+ LC_Icelandic_Thorn : constant Character := '�';
--<Character'Val(254)>
+ LC_Y_Diaeresis : constant Character := '�';
--<Character'Val(255)>
end Ada.Characters.Latin_1;
_Implementation Permissions_
@@ -71308,7 +71565,7 @@ set or other character sets.
_Wording Changes from Ada 2005_
27.a/3
- {AI05-0181-1AI05-0181-1} Correction: Soft_Hyphen is not a
+ {<AI05-0181-1AI05-0181-1>} Correction: Soft_Hyphen is not a
graphic character, and thus a character literal for it is
illegal. So we have to use the position value. This makes no
semantic change to users of the constant.
@@ -71322,8 +71579,8 @@ A.3.4 The Package Characters.Conversions
_Static Semantics_
1/2
-{AI95-00395-01AI95-00395-01} The library package Characters.Conversions
-has the following declaration:
+{<AI95-00395-01AI95-00395-01>} The library package
+Characters.Conversions has the following declaration:
2/2
package Ada.Characters.Conversions is
@@ -71375,7 +71632,7 @@ has the following declaration:
end Ada.Characters.Conversions;
7/2
-{AI95-00395-01AI95-00395-01} The functions in package
+{<AI95-00395-01AI95-00395-01>} The functions in package
Characters.Conversions test Wide_Wide_Character or Wide_Character values
for membership in Wide_Character or Character, or convert between
corresponding characters of Wide_Wide_Character, Wide_Character, and
@@ -71385,14 +71642,14 @@ Character.
function Is_Character (Item : in Wide_Character) return Boolean;
9/2
- {AI95-00395-01AI95-00395-01} Returns True if
+ {<AI95-00395-01AI95-00395-01>} Returns True if
Wide_Character'Pos(Item) <= Character'Pos(Character'Last).
10/2
function Is_Character (Item : in Wide_Wide_Character) return Boolean;
11/2
- {AI95-00395-01AI95-00395-01} Returns True if
+ {<AI95-00395-01AI95-00395-01>} Returns True if
Wide_Wide_Character'Pos(Item) <=
Character'Pos(Character'Last).
@@ -71400,7 +71657,7 @@ Character.
function Is_Wide_Character (Item : in Wide_Wide_Character) return Boolean;
13/2
- {AI95-00395-01AI95-00395-01} Returns True if
+ {<AI95-00395-01AI95-00395-01>} Returns True if
Wide_Wide_Character'Pos(Item) <=
Wide_Character'Pos(Wide_Character'Last).
@@ -71409,14 +71666,14 @@ Character.
function Is_String (Item : in Wide_Wide_String) return Boolean;
15/2
- {AI95-00395-01AI95-00395-01} Returns True if
+ {<AI95-00395-01AI95-00395-01>} Returns True if
Is_Character(Item(I)) is True for each I in Item'Range.
16/2
function Is_Wide_String (Item : in Wide_Wide_String) return Boolean;
17/2
- {AI95-00395-01AI95-00395-01} Returns True if
+ {<AI95-00395-01AI95-00395-01>} Returns True if
Is_Wide_Character(Item(I)) is True for each I in Item'Range.
18/2
@@ -71426,7 +71683,7 @@ Character.
Substitute : in Character := ' ') return Character;
19/2
- {AI95-00395-01AI95-00395-01} Returns the Character
+ {<AI95-00395-01AI95-00395-01>} Returns the Character
corresponding to Item if Is_Character(Item), and returns the
Substitute Character otherwise.
@@ -71434,8 +71691,8 @@ Character.
function To_Wide_Character (Item : in Character) return Wide_Character;
21/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_Character X such
- that Character'Pos(Item) = Wide_Character'Pos (X).
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_Character X
+ such that Character'Pos(Item) = Wide_Character'Pos (X).
22/2
function To_Wide_Character (Item : in Wide_Wide_Character;
@@ -71443,7 +71700,7 @@ Character.
return Wide_Character;
23/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_Character
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_Character
corresponding to Item if Is_Wide_Character(Item), and returns
the Substitute Wide_Character otherwise.
@@ -71452,16 +71709,16 @@ Character.
return Wide_Wide_Character;
25/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_Wide_Character X
- such that Character'Pos(Item) = Wide_Wide_Character'Pos (X).
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_Wide_Character
+ X such that Character'Pos(Item) = Wide_Wide_Character'Pos (X).
26/2
function To_Wide_Wide_Character (Item : in Wide_Character)
return Wide_Wide_Character;
27/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_Wide_Character X
- such that Wide_Character'Pos(Item) = Wide_Wide_Character'Pos
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_Wide_Character
+ X such that Wide_Character'Pos(Item) = Wide_Wide_Character'Pos
(X).
28/2
@@ -71471,15 +71728,15 @@ Character.
Substitute : in Character := ' ') return String;
29/2
- {AI95-00395-01AI95-00395-01} Returns the String whose range is
- 1..Item'Length and each of whose elements is given by
+ {<AI95-00395-01AI95-00395-01>} Returns the String whose range
+ is 1..Item'Length and each of whose elements is given by
To_Character of the corresponding element in Item.
30/2
function To_Wide_String (Item : in String) return Wide_String;
31/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_String whose
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_String whose
range is 1..Item'Length and each of whose elements is given by
To_Wide_Character of the corresponding element in Item.
@@ -71489,7 +71746,7 @@ Character.
return Wide_String;
33/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_String whose
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_String whose
range is 1..Item'Length and each of whose elements is given by
To_Wide_Character of the corresponding element in Item with
the given Substitute Wide_Character.
@@ -71500,7 +71757,7 @@ Character.
return Wide_Wide_String;
35/2
- {AI95-00395-01AI95-00395-01} Returns the Wide_Wide_String
+ {<AI95-00395-01AI95-00395-01>} Returns the Wide_Wide_String
whose range is 1..Item'Length and each of whose elements is
given by To_Wide_Wide_Character of the corresponding element
in Item.
@@ -71508,7 +71765,7 @@ Character.
_Extensions to Ada 95_
35.a/2
- {AI95-00395-01AI95-00395-01} The package
+ {<AI95-00395-01AI95-00395-01>} The package
Characters.Conversions is new, replacing functions previously
found in Characters.Handling.
@@ -71519,22 +71776,22 @@ A.3.5 The Package Wide_Characters.Handling
------------------------------------------
1/3
-{AI05-0185-1AI05-0185-1} The package Wide_Characters.Handling provides
+{<AI05-0185-1AI05-0185-1>} The package Wide_Characters.Handling provides
operations for classifying Wide_Characters and case folding for
Wide_Characters.
_Static Semantics_
2/3
-{AI05-0185-1AI05-0185-1} The library package Wide_Characters.Handling
+{<AI05-0185-1AI05-0185-1>} The library package Wide_Characters.Handling
has the following declaration:
3/3
- {AI05-0185-1AI05-0185-1} {AI05-0266-1AI05-0266-1} package
Ada.Wide_Characters.Handling is
+ {<AI05-0185-1AI05-0185-1>} {<AI05-0266-1AI05-0266-1>} package
Ada.Wide_Characters.Handling is
pragma Pure(Handling);
4/3
- {AI05-0266-1AI05-0266-1} function Character_Set_Version return String;
+ {<AI05-0266-1AI05-0266-1>} function Character_Set_Version return
String;
5/3
function Is_Control (Item : Wide_Character) return Boolean;
@@ -71594,14 +71851,14 @@ has the following declaration:
end Ada.Wide_Characters.Handling;
23/3
-{AI05-0185-1AI05-0185-1} The subprograms defined in
+{<AI05-0185-1AI05-0185-1>} The subprograms defined in
Wide_Characters.Handling are locale independent.
24/3
function Character_Set_Version return String;
25/3
- {AI05-0266-1AI05-0266-1} Returns an implementation-defined
+ {<AI05-0266-1AI05-0266-1>} Returns an implementation-defined
identifier that identifies the version of the character set
standard that is used for categorizing characters by the
implementation.
@@ -71610,7 +71867,7 @@ Wide_Characters.Handling are locale independent.
function Is_Control (Item : Wide_Character) return Boolean;
27/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as other_control; otherwise
returns False.
@@ -71618,7 +71875,7 @@ Wide_Characters.Handling are locale independent.
function Is_Letter (Item : Wide_Character) return Boolean;
29/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as letter_uppercase,
letter_lowercase, letter_titlecase, letter_modifier,
letter_other, or number_letter; otherwise returns False.
@@ -71627,7 +71884,7 @@ Wide_Characters.Handling are locale independent.
function Is_Lower (Item : Wide_Character) return Boolean;
31/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as letter_lowercase;
otherwise returns False.
@@ -71635,7 +71892,7 @@ Wide_Characters.Handling are locale independent.
function Is_Upper (Item : Wide_Character) return Boolean;
33/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as letter_uppercase;
otherwise returns False.
@@ -71643,7 +71900,7 @@ Wide_Characters.Handling are locale independent.
function Is_Digit (Item : Wide_Character) return Boolean;
35/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as number_decimal; otherwise
returns False.
@@ -71651,7 +71908,7 @@ Wide_Characters.Handling are locale independent.
function Is_Hexadecimal_Digit (Item : Wide_Character) return Boolean;
37/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as number_decimal, or is in
the range 'A' .. 'F' or 'a' .. 'f'; otherwise returns False.
@@ -71659,7 +71916,7 @@ Wide_Characters.Handling are locale independent.
function Is_Alphanumeric (Item : Wide_Character) return Boolean;
39/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as letter_uppercase,
letter_lowercase, letter_titlecase, letter_modifier,
letter_other, number_letter, or number_decimal; otherwise
@@ -71669,7 +71926,7 @@ Wide_Characters.Handling are locale independent.
function Is_Special (Item : Wide_Character) return Boolean;
41/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as graphic_character, but
not categorized as letter_uppercase, letter_lowercase,
letter_titlecase, letter_modifier, letter_other,
@@ -71679,7 +71936,7 @@ Wide_Characters.Handling are locale independent.
function Is_Line_Terminator (Item : Wide_Character) return Boolean;
43/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as separator_line or
separator_paragraph, or if Item is a conventional line
terminator character (Line_Feed, Line_Tabulation, Form_Feed,
@@ -71689,7 +71946,7 @@ Wide_Characters.Handling are locale independent.
function Is_Mark (Item : Wide_Character) return Boolean;
45/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as mark_non_spacing or
mark_spacing_combining; otherwise returns False.
@@ -71697,7 +71954,7 @@ Wide_Characters.Handling are locale independent.
function Is_Other_Format (Item : Wide_Character) return Boolean;
47/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as other_format; otherwise
returns False.
@@ -71705,7 +71962,7 @@ Wide_Characters.Handling are locale independent.
function Is_Punctuation_Connector (Item : Wide_Character) return Boolean;
49/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as punctuation_connector;
otherwise returns False.
@@ -71713,7 +71970,7 @@ Wide_Characters.Handling are locale independent.
function Is_Space (Item : Wide_Character) return Boolean;
51/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as separator_space;
otherwise returns False.
@@ -71721,7 +71978,7 @@ Wide_Characters.Handling are locale independent.
function Is_Graphic (Item : Wide_Character) return Boolean;
53/3
- {AI05-0185-1AI05-0185-1} Returns True if the Wide_Character
+ {<AI05-0185-1AI05-0185-1>} Returns True if the Wide_Character
designated by Item is categorized as graphic_character;
otherwise returns False.
@@ -71729,13 +71986,13 @@ Wide_Characters.Handling are locale independent.
function To_Lower (Item : Wide_Character) return Wide_Character;
55/3
- {AI05-0185-1AI05-0185-1} {AI05-0266-1AI05-0266-1}
- {AI05-0299-1AI05-0299-1} Returns the Simple Lowercase Mapping
- as defined by documents referenced in the note in Clause 1 of
- ISO/IEC 10646:2011 of the Wide_Character designated by Item.
- If the Simple Lowercase Mapping does not exist for the
- Wide_Character designated by Item, then the value of Item is
- returned.
+ {<AI05-0185-1AI05-0185-1>} {<AI05-0266-1AI05-0266-1>}
+ {<AI05-0299-1AI05-0299-1>} Returns the Simple Lowercase
+ Mapping as defined by documents referenced in the note in
+ Clause 1 of ISO/IEC 10646:2011 of the Wide_Character
+ designated by Item. If the Simple Lowercase Mapping does not
+ exist for the Wide_Character designated by Item, then the
+ value of Item is returned.
55.a/3
Discussion: The case mappings come from Unicode as ISO/IEC
@@ -71746,7 +72003,7 @@ Wide_Characters.Handling are locale independent.
function To_Lower (Item : Wide_String) return Wide_String;
57/3
- {AI05-0185-1AI05-0185-1} Returns the result of applying the
+ {<AI05-0185-1AI05-0185-1>} Returns the result of applying the
To_Lower conversion to each Wide_Character element of the
Wide_String designated by Item. The result is the null
Wide_String if the value of the formal parameter is the null
@@ -71756,19 +72013,19 @@ Wide_Characters.Handling are locale independent.
function To_Upper (Item : Wide_Character) return Wide_Character;
59/3
- {AI05-0185-1AI05-0185-1} {AI05-0266-1AI05-0266-1}
- {AI05-0299-1AI05-0299-1} Returns the Simple Uppercase Mapping
- as defined by documents referenced in the note in Clause 1 of
- ISO/IEC 10646:2011 of the Wide_Character designated by Item.
- If the Simple Uppercase Mapping does not exist for the
- Wide_Character designated by Item, then the value of Item is
- returned.
+ {<AI05-0185-1AI05-0185-1>} {<AI05-0266-1AI05-0266-1>}
+ {<AI05-0299-1AI05-0299-1>} Returns the Simple Uppercase
+ Mapping as defined by documents referenced in the note in
+ Clause 1 of ISO/IEC 10646:2011 of the Wide_Character
+ designated by Item. If the Simple Uppercase Mapping does not
+ exist for the Wide_Character designated by Item, then the
+ value of Item is returned.
60/3
function To_Upper (Item : Wide_String) return Wide_String;
61/3
- {AI05-0185-1AI05-0185-1} Returns the result of applying the
+ {<AI05-0185-1AI05-0185-1>} Returns the result of applying the
To_Upper conversion to each Wide_Character element of the
Wide_String designated by Item. The result is the null
Wide_String if the value of the formal parameter is the null
@@ -71777,7 +72034,7 @@ Wide_Characters.Handling are locale independent.
_Implementation Advice_
62/3
-{AI05-0266-1AI05-0266-1} The string returned by Character_Set_Version
+{<AI05-0266-1AI05-0266-1>} The string returned by Character_Set_Version
should include either "10646:" or "Unicode".
62.a.1/3
@@ -71801,12 +72058,12 @@ should include either "10646:" or "Unicode".
NOTES
63/3
- 8 {AI05-0266-1AI05-0266-1} The results returned by these functions
- may depend on which particular version of the 10646 standard is
- supported by the implementation (see *note 2.1::).
+ 8 {<AI05-0266-1AI05-0266-1>} The results returned by these
+ functions may depend on which particular version of the 10646
+ standard is supported by the implementation (see *note 2.1::).
64/3
- 9 {AI05-0286-1AI05-0286-1} The case insensitive equality
+ 9 {<AI05-0286-1AI05-0286-1>} The case insensitive equality
comparison routines provided in *note A.4.10::, "*note A.4.10::
String Comparison" are also available for wide strings (see *note
A.4.7::).
@@ -71814,8 +72071,8 @@ should include either "10646:" or "Unicode".
_Extensions to Ada 2005_
64.a/3
- {AI05-0185-1AI05-0185-1} {AI05-0266-1AI05-0266-1} The package
- Wide_Characters.Handling is new.
+ {<AI05-0185-1AI05-0185-1>} {<AI05-0266-1AI05-0266-1>} The
+ package Wide_Characters.Handling is new.
File: aarm2012.info, Node: A.3.6, Prev: A.3.5, Up: A.3
@@ -71824,7 +72081,7 @@ A.3.6 The Package Wide_Wide_Characters.Handling
-----------------------------------------------
1/3
-{AI05-0185-1AI05-0185-1} The package Wide_Wide_Characters.Handling has
+{<AI05-0185-1AI05-0185-1>} The package Wide_Wide_Characters.Handling has
the same contents as Wide_Characters.Handling except that each
occurrence of Wide_Character is replaced by Wide_Wide_Character, and
each occurrence of Wide_String is replaced by Wide_Wide_String.
@@ -71832,7 +72089,7 @@ each occurrence of Wide_String is replaced by
Wide_Wide_String.
_Extensions to Ada 2005_
1.a/3
- {AI05-0185-1AI05-0185-1} The package
+ {<AI05-0185-1AI05-0185-1>} The package
Wide_Wide_Characters.Handling is new.
@@ -71842,7 +72099,7 @@ A.4 String Handling
===================
1/3
-{AI95-00285-01AI95-00285-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00285-01AI95-00285-01>} {<AI05-0299-1AI05-0299-1>} This subclause
presents the specifications of the package Strings and several child
packages, which provide facilities for dealing with string data.
Fixed-length, bounded-length, and unbounded-length strings are
@@ -71855,13 +72112,13 @@ inserting, overwriting, and deleting of substrings).
_Extensions to Ada 83_
1.a/3
- {AI05-0299-1AI05-0299-1} This subclause is new to Ada 95.
+ {<AI05-0299-1AI05-0299-1>} This subclause is new to Ada 95.
_Wording Changes from Ada 95_
1.b/2
- {AI95-00285-01AI95-00285-01} Included Wide_Wide_String in this
- description; the individual changes are documented as
+ {<AI95-00285-01AI95-00285-01>} Included Wide_Wide_String in
+ this description; the individual changes are documented as
extensions as needed.
* Menu:
@@ -71898,7 +72155,7 @@ The library package Strings has the following
declaration:
pragma Pure(Strings);
4/2
- {AI95-00285-01AI95-00285-01} Space : constant Character := '
';
+ {<AI95-00285-01AI95-00285-01>} Space : constant Character :=
' ';
Wide_Space : constant Wide_Character := ' ';
Wide_Wide_Space : constant Wide_Wide_Character := ' ';
@@ -71916,13 +72173,13 @@ The library package Strings has the following
declaration:
_Incompatibilities With Ada 95_
6.a/3
- {AI95-00285-01AI95-00285-01} {AI05-0005-1AI05-0005-1} Constant
- Wide_Wide_Space is added to Ada.Strings. If Ada.Strings is
- referenced in a use_clause, and an entity E with a
- defining_identifier of Wide_Wide_Space is defined in a package
- that is also referenced in a use_clause, the entity E may no
- longer be use-visible, resulting in errors. This should be
- rare and is easily fixed if it does occur.
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0005-1AI05-0005-1>}
+ Constant Wide_Wide_Space is added to Ada.Strings. If
+ Ada.Strings is referenced in a use_clause, and an entity <E>
+ with a defining_identifier of Wide_Wide_Space is defined in a
+ package that is also referenced in a use_clause, the entity
+ <E> may no longer be use-visible, resulting in errors. This
+ should be rare and is easily fixed if it does occur.
File: aarm2012.info, Node: A.4.2, Next: A.4.3, Prev: A.4.1, Up: A.4
@@ -71940,11 +72197,11 @@ entities needed for character sets and
character-to-character mappings.
The library package Strings.Maps has the following declaration:
3/2
- {AI95-00362-01AI95-00362-01} package Ada.Strings.Maps is
+ {<AI95-00362-01AI95-00362-01>} package Ada.Strings.Maps is
pragma Pure(Maps);
4/2
- {AI95-00161-01AI95-00161-01} -- Representation for a set of character
values:
+ {<AI95-00161-01AI95-00161-01>} --< Representation for a set of
character values:>
type Character_Set is private;
pragma Preelaborable_Initialization(Character_Set);
@@ -71957,7 +72214,7 @@ The library package Strings.Maps has the following
declaration:
Low : Character;
High : Character;
end record;
- -- Represents Character range Low..High
+ -- <Represents Character range Low..High>
7
type Character_Ranges is array (Positive range <>) of Character_Range;
@@ -71997,7 +72254,7 @@ The library package Strings.Maps has the following
declaration:
return Boolean renames Is_Subset;
16
- -- Alternative representation for a set of character values:
+ --< Alternative representation for a set of character values:>
subtype Character_Sequence is String;
17
@@ -72010,7 +72267,7 @@ The library package Strings.Maps has the following
declaration:
function To_Sequence (Set : in Character_Set) return
Character_Sequence;
20/2
- {AI95-00161-01AI95-00161-01} -- Representation for a character to
character mapping:
+ {<AI95-00161-01AI95-00161-01>} --< Representation for a character to
character mapping:>
type Character_Mapping is private;
pragma Preelaborable_Initialization(Character_Mapping);
@@ -72038,7 +72295,7 @@ The library package Strings.Maps has the following
declaration:
26
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Maps;
27
@@ -72059,7 +72316,7 @@ corresponding to Obj(I) for I in Obj'Range.
function To_Set (Ranges : in Character_Ranges) return Character_Set;
32/3
- {AI05-0264-1AI05-0264-1} If Ranges'Length=0 then Null_Set is
+ {<AI05-0264-1AI05-0264-1>} If Ranges'Length=0 then Null_Set is
returned; otherwise, the returned value represents the set
corresponding to Ranges.
@@ -72074,7 +72331,7 @@ corresponding to Obj(I) for I in Obj'Range.
function To_Ranges (Set : in Character_Set) return Character_Ranges;
36/3
- {AI05-0264-1AI05-0264-1} If Set = Null_Set, then an empty
+ {<AI05-0264-1AI05-0264-1>} If Set = Null_Set, then an empty
Character_Ranges array is returned; otherwise, the shortest
array of contiguous ranges of Character values in Set, in
increasing order of Low, is returned.
@@ -72165,8 +72422,8 @@ the operator. "-"(Left, Right) is equivalent to
"and"(Left,
Element maps with respect to the mapping represented by Map.
54
-A character C matches a pattern character P with respect to a given
-Character_Mapping value Map if Value(Map, C) = P. A string S matches a
+A character C <matches> a pattern character P with respect to a given
+Character_Mapping value Map if Value(Map, C) = P. A string S <matches> a
pattern string P with respect to a given Character_Mapping if their
lengths are the same and if each character in S matches its
corresponding character in the pattern string P.
@@ -72214,14 +72471,14 @@ parameters whose type is Character_Mapping.
function To_Range (Map : in Character_Mapping) return Character_Sequence;
63/1
- {8652/00488652/0048} {AI95-00151-01AI95-00151-01} To_Range
+ {<8652/00488652/0048>} {<AI95-00151-01AI95-00151-01>} To_Range
returns the Character_Sequence value R, such that if D =
To_Domain(Map), then R has the same bounds as D, and D(I) maps
to R(I) for each I in D'Range.
64
An object F of type Character_Mapping_Function maps a Character value C
-to the Character value F.all(C), which is said to match C with respect
+to the Character value F.all(C), which is said to <match> C with respect
to mapping function F.
NOTES
@@ -72249,21 +72506,22 @@ To_Mapping("ABCD", "ZZAB") returns a
Character_Mapping that maps 'A' and
_Extensions to Ada 95_
67.a/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added
pragma Preelaborable_Initialization to types Character_Set and
Character_Mapping, so that they can be used to declare
default-initialized objects in preelaborated units.
67.b/2
- {AI95-00362-01AI95-00362-01} Strings.Maps is now Pure, so it
+ {<AI95-00362-01AI95-00362-01>} Strings.Maps is now Pure, so it
can be used in pure units.
_Wording Changes from Ada 95_
67.c/2
- {8652/00488652/0048} {AI95-00151-01AI95-00151-01} Corrigendum:
- Corrected the definition of the range of the result of
- To_Range, since the Ada 95 definition makes no sense.
+ {<8652/00488652/0048>} {<AI95-00151-01AI95-00151-01>}
+ Corrigendum: Corrected the definition of the range of the
+ result of To_Range, since the Ada 95 definition makes no
+ sense.
File: aarm2012.info, Node: A.4.3, Next: A.4.4, Prev: A.4.2, Up: A.4
@@ -72284,8 +72542,8 @@ For each function that returns a String, the lower
bound of the returned
value is 1.
2.a/2
- Discussion: {AI95-00114-01AI95-00114-01} Most operations that
- yield a String are provided both as a function and as a
+ Discussion: {<AI95-00114-01AI95-00114-01>} Most operations
+ that yield a String are provided both as a function and as a
procedure. The functional form is possibly a more aesthetic
style but may introduce overhead due to extra copying or
dynamic memory usage in some implementations. Thus a
@@ -72313,7 +72571,7 @@ The library package Strings.Fixed has the following
declaration:
pragma Preelaborate(Fixed);
6
- -- "Copy" procedure for strings of possibly different lengths
+ --< "Copy" procedure for strings of possibly different lengths>
7
procedure Move (Source : in String;
@@ -72323,10 +72581,10 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
8
- -- Search subprograms
+ --< Search subprograms>
8.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -72334,7 +72592,7 @@ The library package Strings.Fixed has the following
declaration:
return Natural;
8.2/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -72357,7 +72615,7 @@ The library package Strings.Fixed has the following
declaration:
return Natural;
10.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership := Inside;
@@ -72372,7 +72630,7 @@ The library package Strings.Fixed has the following
declaration:
return Natural;
11.1/2
- {AI95-00301-01AI95-00301-01} function Index_Non_Blank (Source : in
String;
+ {<AI95-00301-01AI95-00301-01>} function Index_Non_Blank (Source : in
String;
From : in Positive;
Going : in Direction := Forward)
return Natural;
@@ -72401,7 +72659,7 @@ The library package Strings.Fixed has the following
declaration:
return Natural;
15.1/3
- {AI05-0031-1AI05-0031-1} procedure Find_Token (Source : in String;
+ {<AI05-0031-1AI05-0031-1>} procedure Find_Token (Source : in String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership;
@@ -72416,7 +72674,7 @@ The library package Strings.Fixed has the following
declaration:
Last : out Natural);
17
- -- String translation subprograms
+ --< String translation subprograms>
18
function Translate (Source : in String;
@@ -72437,7 +72695,7 @@ The library package Strings.Fixed has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
22
- -- String transformation subprograms
+ --< String transformation subprograms>
23
function Replace_Slice (Source : in String;
@@ -72493,7 +72751,7 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
31
- --String selector subprograms
+ --<String selector subprograms>
function Trim (Source : in String;
Side : in Trim_End)
return String;
@@ -72542,7 +72800,7 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
39
- --String constructor functions
+ --<String constructor functions>
40
function "*" (Left : in Natural;
@@ -72566,10 +72824,10 @@ The effects of the above subprograms are as follows.
Pad : in Character := Space);
45/3
- {AI05-0264-1AI05-0264-1} The Move procedure copies characters
- from Source to Target. If Source has the same length as
- Target, then the effect is to assign Source to Target. If
- Source is shorter than Target, then:
+ {<AI05-0264-1AI05-0264-1>} The Move procedure copies
+ characters from Source to Target. If Source has the same
+ length as Target, then the effect is to assign Source to
+ Target. If Source is shorter than Target, then:
46
* If Justify=Left, then Source is copied into the first
@@ -72645,7 +72903,7 @@ The effects of the above subprograms are as follows.
return Natural;
56.2/3
- {AI95-00301-01AI95-00301-01} {AI05-0056-1AI05-0056-1} Each
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0056-1AI05-0056-1>} Each
Index function searches, starting from From, for a slice of
Source, with length Pattern'Length, that matches Pattern with
respect to Mapping; the parameter Going indicates the
@@ -72674,8 +72932,8 @@ The effects of the above subprograms are as follows.
parameter that is a Character_Mapping.
56.e/3
- {AI05-0056-1AI05-0056-1} The language does not define when the
- Pattern_Error check is made. (That's because many common
+ {<AI05-0056-1AI05-0056-1>} The language does not define when
+ the Pattern_Error check is made. (That's because many common
searching implementations require a nonempty pattern) That
means that the result for a call like Index ("", "") could be
0 or could raise Pattern_Error. Similarly, in the call Index
@@ -72697,19 +72955,19 @@ The effects of the above subprograms are as follows.
return Natural;
58/2
- {AI95-00301-01AI95-00301-01} If Going = Forward, returns
+ {<AI95-00301-01AI95-00301-01>} If Going = Forward, returns
58.1/2
Index (Source, Pattern, Source'First, Forward, Mapping);
58.2/3
- {AI05-0264-1AI05-0264-1} otherwise, returns
+ {<AI05-0264-1AI05-0264-1>} otherwise, returns
58.3/2
Index (Source, Pattern, Source'Last, Backward, Mapping);
58.a/2
- This paragraph was deleted.There is no default value for the
+ <This paragraph was deleted.>There is no default value for the
Mapping parameter that is a Character_Mapping_Function; if
there were, a call would be ambiguous since there is also a
default for the Mapping parameter that is a Character_Mapping.
@@ -72723,11 +72981,11 @@ The effects of the above subprograms are as follows.
return Natural;
58.5/3
- {AI95-00301-01AI95-00301-01} {AI05-0056-1AI05-0056-1} Index
- searches for the first or last occurrence of any of a set of
- characters (when Test=Inside), or any of the complement of a
- set of characters (when Test=Outside). If Source is the null
- string, Index returns 0; otherwise, if From is not in
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0056-1AI05-0056-1>}
+ Index searches for the first or last occurrence of any of a
+ set of characters (when Test=Inside), or any of the complement
+ of a set of characters (when Test=Outside). If Source is the
+ null string, Index returns 0; otherwise, if From is not in
Source'Range, then Index_Error is propagated. Otherwise, it
returns the smallest index I >= From (if Going=Forward) or the
largest index I <= From (if Going=Backward) such that
@@ -72742,13 +73000,13 @@ The effects of the above subprograms are as follows.
return Natural;
60/2
- {AI95-00301-01AI95-00301-01} If Going = Forward, returns
+ {<AI95-00301-01AI95-00301-01>} If Going = Forward, returns
60.1/2
Index (Source, Set, Source'First, Test, Forward);
60.2/3
- {AI05-0264-1AI05-0264-1} otherwise, returns
+ {<AI05-0264-1AI05-0264-1>} otherwise, returns
60.3/2
Index (Source, Set, Source'Last, Test, Backward);
@@ -72760,7 +73018,7 @@ The effects of the above subprograms are as follows.
return Natural;
60.5/2
- {AI95-00301-01AI95-00301-01} Returns Index (Source,
+ {<AI95-00301-01AI95-00301-01>} Returns Index (Source,
Maps.To_Set(Space), From, Outside, Going);
61
@@ -72816,8 +73074,8 @@ The effects of the above subprograms are as follows.
Last : out Natural);
66.2/3
- {AI05-0031-1AI05-0031-1} If Source is not the null string and
- From is not in Source'Range, then Index_Error is raised.
+ {<AI05-0031-1AI05-0031-1>} If Source is not the null string
+ and From is not in Source'Range, then Index_Error is raised.
Otherwise, First is set to the index of the first character in
Source(From .. Source'Last) that satisfies the Test
condition. Last is set to the largest index such that all
@@ -72834,14 +73092,14 @@ The effects of the above subprograms are as follows.
Last : out Natural);
68/3
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01}
- {AI05-0031-1AI05-0031-1} Equivalent to Find_Token (Source,
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ {<AI05-0031-1AI05-0031-1>} Equivalent to Find_Token (Source,
Set, Source'First, Test, First, Last).
68.a/3
- Ramification: {AI05-0031-1AI05-0031-1} If Source'First is not
- in Positive, which can only happen for an empty string, this
- will raise Constraint_Error.
+ Ramification: {<AI05-0031-1AI05-0031-1>} If Source'First is
+ not in Positive, which can only happen for an empty string,
+ this will raise Constraint_Error.
69
function Translate (Source : in String;
@@ -72875,19 +73133,19 @@ The effects of the above subprograms are as follows.
return String;
74/1
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} If Low >
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>} If Low >
Source'Last+1, or High < Source'First-1, then Index_Error is
propagated. Otherwise:
74.1/1
- * {8652/00498652/0049} {AI95-00128-01AI95-00128-01} If High
- >= Low, then the returned string comprises
+ * {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>} If
+ High >= Low, then the returned string comprises
Source(Source'First..Low-1) & By &
Source(High+1..Source'Last), but with lower bound 1.
74.2/1
- * {8652/00498652/0049} {AI95-00128-01AI95-00128-01} If High
- < Low, then the returned string is Insert(Source,
+ * {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>} If
+ High < Low, then the returned string is Insert(Source,
Before=>Low, New_Item=>By).
75
@@ -72910,7 +73168,7 @@ The effects of the above subprograms are as follows.
return String;
78/3
- {AI05-0264-1AI05-0264-1} Propagates Index_Error if Before is
+ {<AI05-0264-1AI05-0264-1>} Propagates Index_Error if Before is
not in Source'First .. Source'Last+1; otherwise, returns
Source(Source'First..Before-1) & New_Item &
Source(Before..Source'Last), but with lower bound 1.
@@ -72932,9 +73190,9 @@ The effects of the above subprograms are as follows.
return String;
82/3
- {AI05-0264-1AI05-0264-1} Propagates Index_Error if Position is
- not in Source'First .. Source'Last+1; otherwise, returns the
- string obtained from Source by consecutively replacing
+ {<AI05-0264-1AI05-0264-1>} Propagates Index_Error if Position
+ is not in Source'First .. Source'Last+1; otherwise, returns
+ the string obtained from Source by consecutively replacing
characters starting at Position with corresponding characters
from New_Item. If the end of Source is reached before the
characters in New_Item are exhausted, the remaining characters
@@ -72957,8 +73215,8 @@ The effects of the above subprograms are as follows.
return String;
86/3
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01}
- {AI05-0264-1AI05-0264-1} If From <= Through, the returned
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ {<AI05-0264-1AI05-0264-1>} If From <= Through, the returned
string is Replace_Slice(Source, From, Through, ""); otherwise,
it is Source with lower bound 1.
@@ -73023,10 +73281,10 @@ The effects of the above subprograms are as follows.
return String;
98/3
- {AI05-0264-1AI05-0264-1} Returns a string of length Count. If
- Count <= Source'Length, the string comprises the first Count
- characters of Source. Otherwise, its contents are Source
- concatenated with Count-Source'Length Pad characters.
+ {<AI05-0264-1AI05-0264-1>} Returns a string of length Count.
+ If Count <= Source'Length, the string comprises the first
+ Count characters of Source. Otherwise, its contents are
+ Source concatenated with Count-Source'Length Pad characters.
99
procedure Head (Source : in out String;
@@ -73045,8 +73303,8 @@ The effects of the above subprograms are as follows.
return String;
102/3
- {AI05-0264-1AI05-0264-1} Returns a string of length Count. If
- Count <= Source'Length, the string comprises the last Count
+ {<AI05-0264-1AI05-0264-1>} Returns a string of length Count.
+ If Count <= Source'Length, the string comprises the last Count
characters of Source. Otherwise, its contents are
Count-Source'Length Pad characters concatenated with Source.
@@ -73068,7 +73326,7 @@ The effects of the above subprograms are as follows.
Right : in String) return String;
106/1
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} These
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>} These
functions replicate a character or string a specified number
of times. The first function returns a string whose length is
Left and each of whose elements is Right. The second function
@@ -73079,7 +73337,7 @@ The effects of the above subprograms are as follows.
NOTES
107/3
- 12 {AI05-0264-1AI05-0264-1} In the Index and Count functions
+ 12 {<AI05-0264-1AI05-0264-1>} In the Index and Count functions
taking Pattern and Mapping parameters, the actual String parameter
passed to Pattern should comprise characters occurring as target
characters of the mapping. Otherwise, the pattern will not match.
@@ -73095,43 +73353,43 @@ The effects of the above subprograms are as follows.
_Incompatibilities With Ada 95_
109.a/3
- {AI95-00301-01AI95-00301-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0005-1AI05-0005-1>}
Overloaded versions of Index and Index_Non_Blank are added to
Strings.Fixed. If Strings.Fixed is referenced in a
- use_clause, and an entity E with a defining_identifier of
+ use_clause, and an entity <E> with a defining_identifier of
Index or Index_Non_Blank is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Wording Changes from Ada 95_
109.b/2
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} Corrigendum:
- Clarified that Find_Token may raise Constraint_Error if
- Source'First is not in Positive (which is only possible for a
- null string).
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ Corrigendum: Clarified that Find_Token may raise
+ Constraint_Error if Source'First is not in Positive (which is
+ only possible for a null string).
109.c/2
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} Corrigendum:
- Clarified that Replace_Slice, Delete, and "*" always return a
- string with lower bound 1.
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ Corrigendum: Clarified that Replace_Slice, Delete, and "*"
+ always return a string with lower bound 1.
_Incompatibilities With Ada 2005_
109.d/3
- {AI05-0031-1AI05-0031-1} An overloaded version of Find_Token
+ {<AI05-0031-1AI05-0031-1>} An overloaded version of Find_Token
is added to Strings.Fixed. If Strings.Fixed is referenced in
- a use_clause, and an entity E with a defining_identifier of
+ a use_clause, and an entity <E> with a defining_identifier of
Find_Token is defined in a package that is also referenced in
- a use_clause, the entity E may no longer be use-visible,
+ a use_clause, the entity <E> may no longer be use-visible,
resulting in errors. This should be rare and is easily fixed
if it does occur.
_Wording Changes from Ada 2005_
109.e/3
- {AI05-0056-1AI05-0056-1} Correction: Clarified that Index
+ {<AI05-0056-1AI05-0056-1>} Correction: Clarified that Index
never raises Index_Error if the source string is null.
@@ -73177,7 +73435,7 @@ The library package Strings.Bounded has the following
declaration:
4
generic
- Max : Positive; -- Maximum length of a Bounded_String
+ Max : Positive; --< Maximum length of a Bounded_String>
package Generic_Bounded_Length is
5
@@ -73196,7 +73454,7 @@ The library package Strings.Bounded has the following
declaration:
function Length (Source : in Bounded_String) return Length_Range;
10
- -- Conversion, Concatenation, and Selection functions
+ --< Conversion, Concatenation, and Selection functions>
11
function To_Bounded_String (Source : in String;
@@ -73207,7 +73465,7 @@ The library package Strings.Bounded has the following
declaration:
function To_String (Source : in Bounded_String) return String;
12.1/2
- {AI95-00301-01AI95-00301-01} procedure Set_Bounded_String
+ {<AI95-00301-01AI95-00301-01>} procedure Set_Bounded_String
(Target : out Bounded_String;
Source : in String;
Drop : in Truncation := Error);
@@ -73293,14 +73551,14 @@ The library package Strings.Bounded has the following
declaration:
return String;
28.1/2
- {AI95-00301-01AI95-00301-01} function Bounded_Slice
+ {<AI95-00301-01AI95-00301-01>} function Bounded_Slice
(Source : in Bounded_String;
Low : in Positive;
High : in Natural)
return Bounded_String;
28.2/2
- {AI95-00301-01AI95-00301-01} procedure Bounded_Slice
+ {<AI95-00301-01AI95-00301-01>} procedure Bounded_Slice
(Source : in Bounded_String;
Target : out Bounded_String;
Low : in Positive;
@@ -73360,10 +73618,10 @@ The library package Strings.Bounded has the following
declaration:
return Boolean;
43/2
- {AI95-00301-01AI95-00301-01} -- Search subprograms
+ {<AI95-00301-01AI95-00301-01>} --< Search subprograms>
43.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Bounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Bounded_String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -73371,7 +73629,7 @@ The library package Strings.Bounded has the following
declaration:
return Natural;
43.2/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Bounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Bounded_String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -73394,7 +73652,7 @@ The library package Strings.Bounded has the following
declaration:
return Natural;
45.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Bounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Bounded_String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership := Inside;
@@ -73409,7 +73667,7 @@ The library package Strings.Bounded has the following
declaration:
return Natural;
46.1/2
- {AI95-00301-01AI95-00301-01} function Index_Non_Blank (Source : in
Bounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index_Non_Blank (Source :
in Bounded_String;
From : in Positive;
Going : in Direction := Forward)
return Natural;
@@ -73438,7 +73696,7 @@ The library package Strings.Bounded has the following
declaration:
return Natural;
50.1/3
- {AI05-0031-1AI05-0031-1} procedure Find_Token (Source : in
Bounded_String;
+ {<AI05-0031-1AI05-0031-1>} procedure Find_Token (Source : in
Bounded_String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership;
@@ -73453,7 +73711,7 @@ The library package Strings.Bounded has the following
declaration:
Last : out Natural);
52
- -- String translation subprograms
+ --< String translation subprograms>
53
function Translate (Source : in Bounded_String;
@@ -73474,7 +73732,7 @@ The library package Strings.Bounded has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
57
- -- String transformation subprograms
+ --< String transformation subprograms>
58
function Replace_Slice (Source : in Bounded_String;
@@ -73529,7 +73787,7 @@ The library package Strings.Bounded has the following
declaration:
Through : in Natural);
66
- --String selector subprograms
+ --<String selector subprograms>
67
function Trim (Source : in Bounded_String;
@@ -73576,7 +73834,7 @@ The library package Strings.Bounded has the following
declaration:
Drop : in Truncation := Error);
74
- --String constructor subprograms
+ --<String constructor subprograms>
75
function "*" (Left : in Natural;
@@ -73613,15 +73871,15 @@ The library package Strings.Bounded has the following
declaration:
81
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Generic_Bounded_Length;
82
end Ada.Strings.Bounded;
82.a.1/2
- This paragraph was deleted.{8652/00978652/0097}
- {AI95-00115-01AI95-00115-01} {AI95-00344-01AI95-00344-01}
+ <This paragraph was deleted.>{<8652/00978652/0097>}
+ {<AI95-00115-01AI95-00115-01>} {<AI95-00344-01AI95-00344-01>}
83
Null_Bounded_String represents the null string. If an object of type
@@ -73641,9 +73899,9 @@ the same value as Null_Bounded_String.
return Bounded_String;
87/3
- {AI05-0264-1AI05-0264-1} If Source'Length <= Max_Length, then
- this function returns a Bounded_String that represents Source.
- Otherwise, the effect depends on the value of Drop:
+ {<AI05-0264-1AI05-0264-1>} If Source'Length <= Max_Length,
+ then this function returns a Bounded_String that represents
+ Source. Otherwise, the effect depends on the value of Drop:
88
* If Drop=Left, then the result is a Bounded_String that
@@ -73673,7 +73931,7 @@ the same value as Null_Bounded_String.
Drop : in Truncation := Error);
92.2/2
- {AI95-00301-01AI95-00301-01} Equivalent to Target :=
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Target :=
To_Bounded_String (Source, Drop);
93
@@ -73719,8 +73977,8 @@ Append function, with Error as the Drop parameter.
return String;
101/1
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01}
- {AI95-00238-01AI95-00238-01} Returns the slice at positions
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ {<AI95-00238-01AI95-00238-01>} Returns the slice at positions
Low through High in the string represented by Source;
propagates Index_Error if Low > Length(Source)+1 or High >
Length(Source). The bounds of the returned string are Low and
@@ -73734,7 +73992,7 @@ Append function, with Error as the Drop parameter.
return Bounded_String;
101.2/2
- {AI95-00301-01AI95-00301-01} Returns the slice at positions
+ {<AI95-00301-01AI95-00301-01>} Returns the slice at positions
Low through High in the string represented by Source as a
bounded string; propagates Index_Error if Low >
Length(Source)+1 or High > Length(Source).
@@ -73747,7 +74005,7 @@ Append function, with Error as the Drop parameter.
High : in Natural);
101.4/2
- {AI95-00301-01AI95-00301-01} Equivalent to Target :=
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Target :=
Bounded_Slice (Source, Low, High);
102
@@ -73773,7 +74031,7 @@ strings applied to the string represented by the
original value of the
parameter.
105/1
-{8652/00498652/0049} {AI95-00128-01AI95-00128-01} Each of the
+{<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>} Each of the
transformation subprograms (Replace_Slice, Insert, Overwrite, Delete),
selector subprograms (Trim, Head, Tail), and constructor functions ("*")
has an effect based on its corresponding subprogram in Strings.Fixed,
@@ -73787,10 +74045,10 @@ corresponding function in
Strings.Bounded.Generic_Bounded_Length is
applied, with the result assigned into the Source parameter.
105.a/2
- Ramification: {AI95-00114-01AI95-00114-01} The "/=" operations
- between Bounded_String and String, and between String and
- Bounded_String, are automatically defined based on the
- corresponding "=" operations.
+ Ramification: {<AI95-00114-01AI95-00114-01>} The "/="
+ operations between Bounded_String and String, and between
+ String and Bounded_String, are automatically defined based on
+ the corresponding "=" operations.
_Implementation Advice_
@@ -73815,7 +74073,7 @@ and dynamic allocation.
106.c
type Bounded_String is
record
- Data : Bounded_String_Internals; -- Unconstrained
+ Data : Bounded_String_Internals; --< Unconstrained>
end record;
106.d
@@ -73826,49 +74084,50 @@ and dynamic allocation.
_Inconsistencies With Ada 95_
106.e/2
- {AI95-00238-01AI95-00238-01} Amendment Correction: The bounds
- of the string returned from Slice are now defined. This is
- technically an inconsistency; if a program depended on some
- other lower bound for the string returned from Slice, it could
- fail when compiled with Ada 2005. Such code is not portable
- even between Ada 95 implementations, so it should be very
- rare.
+ {<AI95-00238-01AI95-00238-01>} Amendment Correction: The
+ bounds of the string returned from Slice are now defined.
+ This is technically an inconsistency; if a program depended on
+ some other lower bound for the string returned from Slice, it
+ could fail when compiled with Ada 2005. Such code is not
+ portable even between Ada 95 implementations, so it should be
+ very rare.
_Incompatibilities With Ada 95_
106.f/3
- {AI95-00301-01AI95-00301-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0005-1AI05-0005-1>}
Procedure Set_Bounded_String, two Bounded_Slice subprograms,
and overloaded versions of Index and Index_Non_Blank are added
to Strings.Bounded.Generic_Bounded_Length. If an instance of
Generic_Bounded_Length is referenced in a use_clause, and an
- entity E with the defining_identifier as a new entity in
+ entity <E> with the defining_identifier as a new entity in
Generic_Bounded_Length is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Wording Changes from Ada 95_
106.g/2
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} Corrigendum:
- Corrected the conditions for which Slice raises Index_Error.
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ Corrigendum: Corrected the conditions for which Slice raises
+ Index_Error.
106.h/2
- {8652/00498652/0049} {AI95-00128-01AI95-00128-01} Corrigendum:
- Clarified the meaning of transformation, selector, and
- constructor subprograms by describing the effects of
- procedures and functions separately.
+ {<8652/00498652/0049>} {<AI95-00128-01AI95-00128-01>}
+ Corrigendum: Clarified the meaning of transformation,
+ selector, and constructor subprograms by describing the
+ effects of procedures and functions separately.
_Incompatibilities With Ada 2005_
106.i/3
- {AI05-0031-1AI05-0031-1} An overloaded version of Find_Token
+ {<AI05-0031-1AI05-0031-1>} An overloaded version of Find_Token
is added to Strings.Bounded.Generic_Bounded_Length. If an
instance of Generic_Bounded_Length is referenced in a
- use_clause, and an entity E with a defining_identifier of
+ use_clause, and an entity <E> with a defining_identifier of
Find_Token is defined in a package that is also referenced in
- a use_clause, the entity E may no longer be use-visible,
+ a use_clause, the entity <E> may no longer be use-visible,
resulting in errors. This should be rare and is easily fixed
if it does occur.
@@ -73908,7 +74167,7 @@ The library package Strings.Unbounded has the following
declaration:
pragma Preelaborate(Unbounded);
4/2
- {AI95-00161-01AI95-00161-01} type Unbounded_String is private;
+ {<AI95-00161-01AI95-00161-01>} type Unbounded_String is private;
pragma Preelaborable_Initialization(Unbounded_String);
5
@@ -73922,7 +74181,7 @@ The library package Strings.Unbounded has the following
declaration:
procedure Free (X : in out String_Access);
8
- -- Conversion, Concatenation, and Selection functions
+ --< Conversion, Concatenation, and Selection functions>
9
function To_Unbounded_String (Source : in String)
@@ -73936,7 +74195,7 @@ The library package Strings.Unbounded has the following
declaration:
function To_String (Source : in Unbounded_String) return String;
11.1/2
- {AI95-00301-01AI95-00301-01} procedure Set_Unbounded_String
+ {<AI95-00301-01AI95-00301-01>} procedure Set_Unbounded_String
(Target : out Unbounded_String;
Source : in String);
@@ -73989,14 +74248,14 @@ The library package Strings.Unbounded has the
following declaration:
return String;
22.1/2
- {AI95-00301-01AI95-00301-01} function Unbounded_Slice
+ {<AI95-00301-01AI95-00301-01>} function Unbounded_Slice
(Source : in Unbounded_String;
Low : in Positive;
High : in Natural)
return Unbounded_String;
22.2/2
- {AI95-00301-01AI95-00301-01} procedure Unbounded_Slice
+ {<AI95-00301-01AI95-00301-01>} procedure Unbounded_Slice
(Source : in Unbounded_String;
Target : out Unbounded_String;
Low : in Positive;
@@ -74058,10 +74317,10 @@ The library package Strings.Unbounded has the
following declaration:
return Boolean;
38
- -- Search subprograms
+ --< Search subprograms>
38.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Unbounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Unbounded_String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -74069,7 +74328,7 @@ The library package Strings.Unbounded has the following
declaration:
return Natural;
38.2/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Unbounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Unbounded_String;
Pattern : in String;
From : in Positive;
Going : in Direction := Forward;
@@ -74092,7 +74351,7 @@ The library package Strings.Unbounded has the following
declaration:
return Natural;
40.1/2
- {AI95-00301-01AI95-00301-01} function Index (Source : in
Unbounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index (Source : in
Unbounded_String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership := Inside;
@@ -74106,7 +74365,7 @@ The library package Strings.Unbounded has the following
declaration:
Going : in Direction := Forward) return Natural;
41.1/2
- {AI95-00301-01AI95-00301-01} function Index_Non_Blank (Source : in
Unbounded_String;
+ {<AI95-00301-01AI95-00301-01>} function Index_Non_Blank (Source : in
Unbounded_String;
From : in Positive;
Going : in Direction := Forward)
return Natural;
@@ -74135,7 +74394,7 @@ The library package Strings.Unbounded has the following
declaration:
return Natural;
45.1/3
- {AI05-0031-1AI05-0031-1} procedure Find_Token (Source : in
Unbounded_String;
+ {<AI05-0031-1AI05-0031-1>} procedure Find_Token (Source : in
Unbounded_String;
Set : in Maps.Character_Set;
From : in Positive;
Test : in Membership;
@@ -74150,7 +74409,7 @@ The library package Strings.Unbounded has the following
declaration:
Last : out Natural);
47
- -- String translation subprograms
+ --< String translation subprograms>
48
function Translate (Source : in Unbounded_String;
@@ -74171,7 +74430,7 @@ The library package Strings.Unbounded has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
52
- -- String transformation subprograms
+ --< String transformation subprograms>
53
function Replace_Slice (Source : in Unbounded_String;
@@ -74278,11 +74537,11 @@ The library package Strings.Unbounded has the
following declaration:
72
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Unbounded;
72.1/2
-{AI95-00360-01AI95-00360-01} The type Unbounded_String needs
+{<AI95-00360-01AI95-00360-01>} The type Unbounded_String needs
finalization (see *note 7.6::).
73
@@ -74317,7 +74576,7 @@ by Source. To_String and To_Unbounded_String are
related as follows:
= U.
79.1/2
-{AI95-00301-01AI95-00301-01} The procedure Set_Unbounded_String sets
+{<AI95-00301-01AI95-00301-01>} The procedure Set_Unbounded_String sets
Target to an Unbounded_String that represents Source.
80
@@ -74337,7 +74596,7 @@ The Element, Replace_Element, and Slice subprograms
have the same effect
as the corresponding bounded-length string subprograms.
82.1/3
-{AI95-00301-01AI95-00301-01} {AI05-0262-1AI05-0262-1} The function
+{<AI95-00301-01AI95-00301-01>} {<AI05-0262-1AI05-0262-1>} The function
Unbounded_Slice returns the slice at positions Low through High in the
string represented by Source as an Unbounded_String. The procedure
Unbounded_Slice sets Target to the Unbounded_String representing the
@@ -74384,14 +74643,14 @@ No storage associated with an Unbounded_String object
shall be lost upon
assignment or scope exit.
88.a/2
- Implementation Note: {AI95-00301-01AI95-00301-01} A sample
+ Implementation Note: {<AI95-00301-01AI95-00301-01>} A sample
implementation of the private part of the package and several
of the subprograms appears in the Ada 95 Rationale.
_Incompatibilities With Ada 95_
88.b/2
- {AI95-00360-01AI95-00360-01} Amendment Correction: Type
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction: Type
Unbounded_String is defined to need finalization. If the
restriction No_Nested_Finalization (see *note D.7::) applies
to the partition, and Unbounded_String does not have a
@@ -74401,21 +74660,21 @@ assignment or scope exit.
part in Unbounded_String, and thus would be illegal.
88.c/3
- {AI95-00301-01AI95-00301-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0005-1AI05-0005-1>}
Procedure Set_Unbounded_String, two Unbounded_Slice
subprograms, and overloaded versions of Index and
Index_Non_Blank are added to Strings.Unbounded. If
Strings.Unbounded is referenced in a use_clause, and an entity
- E with the same defining_identifier as a new entity in
+ <E> with the same defining_identifier as a new entity in
Strings.Unbounded is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Extensions to Ada 95_
88.d/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added a
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added a
pragma Preelaborable_Initialization to type Unbounded_String,
so that it can be used to declare default-initialized objects
in preelaborated units.
@@ -74423,13 +74682,13 @@ assignment or scope exit.
_Incompatibilities With Ada 2005_
88.e/3
- {AI05-0031-1AI05-0031-1} An overloaded version of Find_Token
+ {<AI05-0031-1AI05-0031-1>} An overloaded version of Find_Token
is added to Strings.Unbounded. If Strings.Unbounded is
- referenced in a use_clause, and an entity E with a
+ referenced in a use_clause, and an entity <E> with a
defining_identifier of Find_Token is defined in a package that
- is also referenced in a use_clause, the entity E may no longer
- be use-visible, resulting in errors. This should be rare and
- is easily fixed if it does occur.
+ is also referenced in a use_clause, the entity <E> may no
+ longer be use-visible, resulting in errors. This should be
+ rare and is easily fixed if it does occur.
File: aarm2012.info, Node: A.4.6, Next: A.4.7, Prev: A.4.5, Up: A.4
@@ -74455,7 +74714,7 @@ The library package Strings.Maps.Constants has the
following
declaration:
3/2
- {AI95-00362-01AI95-00362-01} package Ada.Strings.Maps.Constants is
+ {<AI95-00362-01AI95-00362-01>} package Ada.Strings.Maps.Constants is
pragma Pure(Constants);
4
@@ -74473,15 +74732,15 @@ declaration:
5
Lower_Case_Map : constant Character_Mapping;
- --Maps to lower case for letters, else identity
+ --<Maps to lower case for letters, else identity>
Upper_Case_Map : constant Character_Mapping;
- --Maps to upper case for letters, else identity
+ --<Maps to upper case for letters, else identity>
Basic_Map : constant Character_Mapping;
- --Maps to basic letter for letters, else identity
+ --<Maps to basic letter for letters, else identity>
6
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Maps.Constants;
7
@@ -74492,8 +74751,8 @@ A.3.2::).
NOTES
8/3
- 15 {AI05-0114-1AI05-0114-1} There are certain characters which are
- defined to be lower case letters by ISO 10646 and are therefore
+ 15 {<AI05-0114-1AI05-0114-1>} There are certain characters which
+ are defined to be lower case letters by ISO 10646 and are therefore
allowed in identifiers, but are not considered lower case letters
by Ada.Strings.Maps.Constants.
@@ -74506,13 +74765,13 @@ A.3.2::).
_Extensions to Ada 95_
8.b/2
- {AI95-00362-01AI95-00362-01} Strings.Maps.Constants is now
+ {<AI95-00362-01AI95-00362-01>} Strings.Maps.Constants is now
Pure, so it can be used in pure units.
_Wording Changes from Ada 2005_
8.c/3
- {AI05-0114-1AI05-0114-1} Correction: Added a note to clarify
+ {<AI05-0114-1AI05-0114-1>} Correction: Added a note to clarify
that these constants don't have any relationship to the
characters allowed in identifiers.
@@ -74523,7 +74782,7 @@ A.4.7 Wide_String Handling
--------------------------
1/3
-{AI95-00302-03AI95-00302-03} {AI05-0286-1AI05-0286-1} Facilities for
+{<AI95-00302-03AI95-00302-03>} {<AI05-0286-1AI05-0286-1>} Facilities for
handling strings of Wide_Character elements are found in the packages
Strings.Wide_Maps, Strings.Wide_Fixed, Strings.Wide_Bounded,
Strings.Wide_Unbounded, and Strings.Wide_Maps.Wide_Constants, and in the
@@ -74538,7 +74797,7 @@ Strings.Wide_Fixed.Wide_Equal_Case_Insensitive,
Strings.Wide_Bounded.Wide_Equal_Case_Insensitive, and
Strings.Wide_Unbounded.Wide_Equal_Case_Insensitive. They provide the
same string-handling operations as the corresponding packages and
-functions for strings of Character elements.
+functions for strings of Character elements.
_Static Semantics_
@@ -74550,7 +74809,7 @@ The package Strings.Wide_Maps has the following
declaration.
pragma Preelaborate(Wide_Maps);
4/2
- {AI95-00161-01AI95-00161-01} -- Representation for a set of
Wide_Character values:
+ {<AI95-00161-01AI95-00161-01>} --< Representation for a set of
Wide_Character values:>
type Wide_Character_Set is private;
pragma Preelaborable_Initialization(Wide_Character_Set);
@@ -74563,7 +74822,7 @@ The package Strings.Wide_Maps has the following
declaration.
Low : Wide_Character;
High : Wide_Character;
end record;
- -- Represents Wide_Character range Low..High
+ -- <Represents Wide_Character range Low..High>
7
type Wide_Character_Ranges is array (Positive range <>)
@@ -74612,7 +74871,7 @@ The package Strings.Wide_Maps has the following
declaration.
return Boolean renames Is_Subset;
16
- -- Alternative representation for a set of Wide_Character values:
+ --< Alternative representation for a set of Wide_Character values:>
subtype Wide_Character_Sequence is Wide_String;
17
@@ -74628,7 +74887,7 @@ The package Strings.Wide_Maps has the following
declaration.
return Wide_Character_Sequence;
20/2
- {AI95-00161-01AI95-00161-01} -- Representation for a Wide_Character to
Wide_Character mapping:
+ {<AI95-00161-01AI95-00161-01>} --< Representation for a Wide_Character
to Wide_Character mapping:>
type Wide_Character_Mapping is private;
pragma Preelaborable_Initialization(Wide_Character_Mapping);
@@ -74658,7 +74917,7 @@ The package Strings.Wide_Maps has the following
declaration.
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Wide_Maps;
28
@@ -74667,12 +74926,12 @@ Strings.Wide_Bounded, and Strings.Wide_Unbounded
identifies
Strings.Wide_Maps instead of Strings.Maps.
28.1/3
-{AI05-0223-1AI05-0223-1} Types Wide_Character_Set and
+{<AI05-0223-1AI05-0223-1>} Types Wide_Character_Set and
Wide_Character_Mapping need finalization.
29/3
-{AI95-00302-03AI95-00302-03} {AI05-0286-1AI05-0286-1} For each of the
-packages Strings.Fixed, Strings.Bounded, Strings.Unbounded, and
+{<AI95-00302-03AI95-00302-03>} {<AI05-0286-1AI05-0286-1>} For each of
+the packages Strings.Fixed, Strings.Bounded, Strings.Unbounded, and
Strings.Maps.Constants, and for library functions Strings.Hash,
Strings.Fixed.Hash, Strings.Bounded.Hash, Strings.Unbounded.Hash,
Strings.Hash_Case_Insensitive, Strings.Fixed.Hash_Case_Insensitive,
@@ -74717,7 +74976,7 @@ package or function has the same contents except that
* To_Wide_String replaces To_String
40.1/2
- * {AI95-00301-01AI95-00301-01} Set_Bounded_Wide_String replaces
+ * {<AI95-00301-01AI95-00301-01>} Set_Bounded_Wide_String replaces
Set_Bounded_String
41
@@ -74733,7 +74992,7 @@ package or function has the same contents except that
* To_Unbounded_Wide_String replaces To_Unbounded_String
44.1/2
- * {AI95-00301-01AI95-00301-01} Set_Unbounded_Wide_String replaces
+ * {<AI95-00301-01AI95-00301-01>} Set_Unbounded_Wide_String replaces
Set_Unbounded_String
45
@@ -74741,12 +75000,12 @@ The following additional declaration is present in
Strings.Wide_Maps.Wide_Constants:
46/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01} Character_Set :
constant Wide_Maps.Wide_Character_Set;
- --Contains each Wide_Character value WC such that
- --Characters.Conversions.Is_Character(WC) is True
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
Character_Set : constant Wide_Maps.Wide_Character_Set;
+ --<Contains each Wide_Character value WC such that>
+ --<Characters.Conversions.Is_Character(WC) is True>
46.1/2
-{AI95-00395-01AI95-00395-01} Each Wide_Character_Set constant in the
+{<AI95-00395-01AI95-00395-01>} Each Wide_Character_Set constant in the
package Strings.Wide_Maps.Wide_Constants contains no values outside the
Character portion of Wide_Character. Similarly, each
Wide_Character_Mapping constant in this package is the identity mapping
@@ -74754,7 +75013,7 @@ when applied to any element outside the Character
portion of
Wide_Character.
46.2/2
-{AI95-00362-01AI95-00362-01} Pragma Pure is replaced by pragma
+{<AI95-00362-01AI95-00362-01>} Pragma Pure is replaced by pragma
Preelaborate in Strings.Wide_Maps.Wide_Constants.
NOTES
@@ -74767,19 +75026,19 @@ Preelaborate in Strings.Wide_Maps.Wide_Constants.
_Incompatibilities With Ada 95_
48.a/2
- {AI95-00301-01AI95-00301-01} Various new operations are added
- to Strings.Wide_Fixed, Strings.Wide_Bounded, and
+ {<AI95-00301-01AI95-00301-01>} Various new operations are
+ added to Strings.Wide_Fixed, Strings.Wide_Bounded, and
Strings.Wide_Unbounded. If one of these packages is
- referenced in a use_clause, and an entity E with the same
+ referenced in a use_clause, and an entity <E> with the same
defining_identifier as a new entity is defined in a package
- that is also referenced in a use_clause, the entity E may no
+ that is also referenced in a use_clause, the entity <E> may no
longer be use-visible, resulting in errors. This should be
rare and is easily fixed if it does occur.
_Extensions to Ada 95_
48.b/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added
pragma Preelaborable_Initialization to types
Wide_Character_Set and Wide_Character_Mapping, so that they
can be used to declare default-initialized objects in
@@ -74788,30 +75047,30 @@ Preelaborate in Strings.Wide_Maps.Wide_Constants.
_Wording Changes from Ada 95_
48.c/2
- {AI95-00285-01AI95-00285-01} Corrected the description of
+ {<AI95-00285-01AI95-00285-01>} Corrected the description of
Character_Set.
48.d/2
- {AI95-00302-03AI95-00302-03} Added wide versions of
+ {<AI95-00302-03AI95-00302-03>} Added wide versions of
Strings.Hash and Strings.Unbounded.Hash.
48.e/2
- {AI95-00362-01AI95-00362-01} Added wording so that
+ {<AI95-00362-01AI95-00362-01>} Added wording so that
Strings.Wide_Maps.Wide_Constants does not change to Pure.
48.f/2
- {AI95-00395-01AI95-00395-01} The second Note is now normative
- text, since there is no way to derive it from the other rules.
- It's a little weird given the use of Unicode character
- classifications in Ada 2005; but changing it would be
- inconsistent with Ada 95 and a one-to-one mapping isn't
+ {<AI95-00395-01AI95-00395-01>} The second Note is now
+ normative text, since there is no way to derive it from the
+ other rules. It's a little weird given the use of Unicode
+ character classifications in Ada 2005; but changing it would
+ be inconsistent with Ada 95 and a one-to-one mapping isn't
necessarily correct anyway.
_Extensions to Ada 2005_
48.g/3
- {AI05-0286-1AI05-0286-1} The case insenstive library functions
- (Strings.Wide_Equal_Case_Insensitive,
+ {<AI05-0286-1AI05-0286-1>} The case insenstive library
+ functions (Strings.Wide_Equal_Case_Insensitive,
Strings.Wide_Fixed.Wide_Equal_Case_Insensitive,
Strings.Wide_Bounded.Wide_Equal_Case_Insensitive,
Strings.Wide_Unbounded.Wide_Equal_Case_Insensitive,
@@ -74823,7 +75082,7 @@ Preelaborate in Strings.Wide_Maps.Wide_Constants.
_Wording Changes from Ada 2005_
48.h/3
- {AI05-0223-1AI05-0223-1} Correction: Identified
+ {<AI05-0223-1AI05-0223-1>} Correction: Identified
Wide_Character_Set and Wide_Character_Mapping as needing
finalization. It is likely that they are implemented with a
controlled type, so this change is unlikely to make any
@@ -74836,8 +75095,8 @@ A.4.8 Wide_Wide_String Handling
-------------------------------
1/3
-{AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01}
-{AI05-0286-1AI05-0286-1} Facilities for handling strings of
+{<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+{<AI05-0286-1AI05-0286-1>} Facilities for handling strings of
Wide_Wide_Character elements are found in the packages
Strings.Wide_Wide_Maps, Strings.Wide_Wide_Fixed,
Strings.Wide_Wide_Bounded, Strings.Wide_Wide_Unbounded, and
@@ -74854,20 +75113,20 @@
Strings.Wide_Wide_Fixed.Wide_Wide_Equal_Case_Insensitive,
Strings.Wide_Wide_Bounded.Wide_Wide_Equal_Case_Insensitive, and
Strings.Wide_Wide_Unbounded.Wide_Wide_Equal_Case_Insensitive. They
provide the same string-handling operations as the corresponding
-packages and functions for strings of Character elements.
+packages and functions for strings of Character elements.
_Static Semantics_
2/2
-{AI95-00285-01AI95-00285-01} The library package Strings.Wide_Wide_Maps
-has the following declaration.
+{<AI95-00285-01AI95-00285-01>} The library package
+Strings.Wide_Wide_Maps has the following declaration.
3/2
package Ada.Strings.Wide_Wide_Maps is
pragma Preelaborate(Wide_Wide_Maps);
4/2
- -- Representation for a set of Wide_Wide_Character values:
+ -- <Representation for a set of Wide_Wide_Character values:>
type Wide_Wide_Character_Set is private;
pragma Preelaborable_Initialization(Wide_Wide_Character_Set);
@@ -74880,7 +75139,7 @@ has the following declaration.
Low : Wide_Wide_Character;
High : Wide_Wide_Character;
end record;
- -- Represents Wide_Wide_Character range Low..High
+ -- <Represents Wide_Wide_Character range Low..High>
7/2
type Wide_Wide_Character_Ranges is array (Positive range <>)
@@ -74929,7 +75188,7 @@ has the following declaration.
return Boolean renames Is_Subset;
16/2
- -- Alternative representation for a set of Wide_Wide_Character values:
+ -- <Alternative representation for a set of Wide_Wide_Character
values:>
subtype Wide_Wide_Character_Sequence is Wide_Wide_String;
17/2
@@ -74945,8 +75204,8 @@ has the following declaration.
return Wide_Wide_Character_Sequence;
20/2
- -- Representation for a Wide_Wide_Character to Wide_Wide_Character
- -- mapping:
+ -- <Representation for a Wide_Wide_Character to Wide_Wide_Character>
+ -- <mapping:>
type Wide_Wide_Character_Mapping is private;
pragma Preelaborable_Initialization(Wide_Wide_Character_Mapping);
@@ -74977,22 +75236,22 @@ has the following declaration.
27/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Wide_Wide_Maps;
28/2
-{AI95-00285-01AI95-00285-01} The context clause for each of the packages
-Strings.Wide_Wide_Fixed, Strings.Wide_Wide_Bounded, and
+{<AI95-00285-01AI95-00285-01>} The context clause for each of the
+packages Strings.Wide_Wide_Fixed, Strings.Wide_Wide_Bounded, and
Strings.Wide_Wide_Unbounded identifies Strings.Wide_Wide_Maps instead of
Strings.Maps.
28.1/3
-{AI05-0223-1AI05-0223-1} Types Wide_Wide_Character_Set and
+{<AI05-0223-1AI05-0223-1>} Types Wide_Wide_Character_Set and
Wide_Wide_Character_Mapping need finalization.
29/3
-{AI95-00285-01AI95-00285-01} {AI05-0286-1AI05-0286-1} For each of the
-packages Strings.Fixed, Strings.Bounded, Strings.Unbounded, and
+{<AI95-00285-01AI95-00285-01>} {<AI05-0286-1AI05-0286-1>} For each of
+the packages Strings.Fixed, Strings.Bounded, Strings.Unbounded, and
Strings.Maps.Constants, and for library functions Strings.Hash,
Strings.Fixed.Hash, Strings.Bounded.Hash, Strings.Unbounded.Hash,
Strings.Hash_Case_Insensitive, Strings.Fixed.Hash_Case_Insensitive,
@@ -75038,8 +75297,8 @@ string package or function has the same contents except
that
* To_Wide_Wide_String replaces To_String
41/2
- * {AI95-00301-01AI95-00301-01} Set_Bounded_Wide_Wide_String replaces
- Set_Bounded_String
+ * {<AI95-00301-01AI95-00301-01>} Set_Bounded_Wide_Wide_String
+ replaces Set_Bounded_String
42/2
* Unbounded_Wide_Wide_String replaces Unbounded_String
@@ -75054,24 +75313,24 @@ string package or function has the same contents
except that
* To_Unbounded_Wide_Wide_String replaces To_Unbounded_String
46/2
- * {AI95-00301-01AI95-00301-01} Set_Unbounded_Wide_Wide_String
+ * {<AI95-00301-01AI95-00301-01>} Set_Unbounded_Wide_Wide_String
replaces Set_Unbounded_String
47/2
-{AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01} The following
-additional declarations are present in
+{<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>} The
+following additional declarations are present in
Strings.Wide_Wide_Maps.Wide_Wide_Constants:
48/2
Character_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set;
- -- Contains each Wide_Wide_Character value WWC such that
- -- Characters.Conversions.Is_Character(WWC) is True
+ -- <Contains each Wide_Wide_Character value WWC such that>
+ -- <Characters.Conversions.Is_Character(WWC) is True>
Wide_Character_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set;
- -- Contains each Wide_Wide_Character value WWC such that
- -- Characters.Conversions.Is_Wide_Character(WWC) is True
+ -- <Contains each Wide_Wide_Character value WWC such that>
+ -- <Characters.Conversions.Is_Wide_Character(WWC) is True>
49/2
-{AI95-00395-01AI95-00395-01} Each Wide_Wide_Character_Set constant in
+{<AI95-00395-01AI95-00395-01>} Each Wide_Wide_Character_Set constant in
the package Strings.Wide_Wide_Maps.Wide_Wide_Constants contains no
values outside the Character portion of Wide_Wide_Character. Similarly,
each Wide_Wide_Character_Mapping constant in this package is the
@@ -75079,13 +75338,13 @@ identity mapping when applied to any element outside
the Character
portion of Wide_Wide_Character.
50/2
-{AI95-00395-01AI95-00395-01} Pragma Pure is replaced by pragma
+{<AI95-00395-01AI95-00395-01>} Pragma Pure is replaced by pragma
Preelaborate in Strings.Wide_Wide_Maps.Wide_Wide_Constants.
NOTES
51/2
- 17 {AI95-00285-01AI95-00285-01} If a null
+ 17 {<AI95-00285-01AI95-00285-01>} If a null
Wide_Wide_Character_Mapping_Function is passed to any of the
Wide_Wide_String handling subprograms, Constraint_Error is
propagated.
@@ -75093,10 +75352,10 @@ Preelaborate in
Strings.Wide_Wide_Maps.Wide_Wide_Constants.
_Extensions to Ada 95_
51.a/2
- {AI95-00285-01AI95-00285-01} {AI95-00395-01AI95-00395-01} The
- double-wide string-handling packages (Strings.Wide_Wide_Maps,
- Strings.Wide_Wide_Fixed, Strings.Wide_Wide_Bounded,
- Strings.Wide_Wide_Unbounded, and
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00395-01AI95-00395-01>}
+ The double-wide string-handling packages
+ (Strings.Wide_Wide_Maps, Strings.Wide_Wide_Fixed,
+ Strings.Wide_Wide_Bounded, Strings.Wide_Wide_Unbounded, and
Strings.Wide_Wide_Maps.Wide_Wide_Constants), and functions
Strings.Wide_Wide_Hash and
Strings.Wide_Wide_Unbounded.Wide_Wide_Hash are new.
@@ -75104,8 +75363,8 @@ Preelaborate in
Strings.Wide_Wide_Maps.Wide_Wide_Constants.
_Extensions to Ada 2005_
51.b/3
- {AI05-0286-1AI05-0286-1} The case insenstive library functions
- (Strings.Wide_Wide_Equal_Case_Insensitive,
+ {<AI05-0286-1AI05-0286-1>} The case insenstive library
+ functions (Strings.Wide_Wide_Equal_Case_Insensitive,
Strings.Wide_Wide_Fixed.Wide_Wide_Equal_Case_Insensitive,
Strings.Wide_Wide_Bounded.Wide_Wide_Equal_Case_Insensitive,
Strings.Wide_Wide_Unbounded.Wide_Wide_Equal_Case_Insensitive,
@@ -75118,7 +75377,7 @@ Preelaborate in
Strings.Wide_Wide_Maps.Wide_Wide_Constants.
_Wording Changes from Ada 2005_
51.c/3
- {AI05-0223-1AI05-0223-1} Correction: Identified
+ {<AI05-0223-1AI05-0223-1>} Correction: Identified
Wide_Wide_Character_Set and Wide_Wide_Character_Mapping as
needing finalization. It is likely that they are implemented
with a controlled type, so this change is unlikely to make any
@@ -75133,37 +75392,37 @@ A.4.9 String Hashing
_Static Semantics_
1/2
-{AI95-00302-03AI95-00302-03} The library function Strings.Hash has the
+{<AI95-00302-03AI95-00302-03>} The library function Strings.Hash has the
following declaration:
2/3
- {AI05-0298-1AI05-0298-1} with Ada.Containers;
+ {<AI05-0298-1AI05-0298-1>} with Ada.Containers;
function Ada.Strings.Hash (Key : String) return Containers.Hash_Type;
pragma Pure(Ada.Strings.Hash);
3/2
Returns an implementation-defined value which is a function of
- the value of Key. If A and B are strings such that A equals
- B, Hash(A) equals Hash(B).
+ the value of Key. If <A> and <B> are strings such that <A>
+ equals <B>, Hash(<A>) equals Hash(<B>).
3.a/2
Implementation defined: The values returned by Strings.Hash.
4/2
-{AI95-00302-03AI95-00302-03} The library function Strings.Fixed.Hash has
-the following declaration:
+{<AI95-00302-03AI95-00302-03>} The library function Strings.Fixed.Hash
+has the following declaration:
5/3
- {AI05-0298-1AI05-0298-1} with Ada.Containers, Ada.Strings.Hash;
+ {<AI05-0298-1AI05-0298-1>} with Ada.Containers, Ada.Strings.Hash;
function Ada.Strings.Fixed.Hash (Key : String) return Containers.Hash_Type
renames Ada.Strings.Hash;
6/2
-{AI95-00302-03AI95-00302-03} The generic library function
+{<AI95-00302-03AI95-00302-03>} The generic library function
Strings.Bounded.Hash has the following declaration:
7/3
- {AI05-0298-1AI05-0298-1} with Ada.Containers;
+ {<AI05-0298-1AI05-0298-1>} with Ada.Containers;
generic
with package Bounded is
new Ada.Strings.Bounded.Generic_Bounded_Length (<>);
@@ -75172,26 +75431,26 @@ Strings.Bounded.Hash has the following declaration:
pragma Preelaborate(Ada.Strings.Bounded.Hash);
8/3
- {AI05-0001-1AI05-0001-1} Equivalent to Strings.Hash
+ {<AI05-0001-1AI05-0001-1>} Equivalent to Strings.Hash
(Bounded.To_String (Key));
9/2
-{AI95-00302-03AI95-00302-03} The library function Strings.Unbounded.Hash
-has the following declaration:
+{<AI95-00302-03AI95-00302-03>} The library function
+Strings.Unbounded.Hash has the following declaration:
10/3
- {AI05-0298-1AI05-0298-1} with Ada.Containers;
+ {<AI05-0298-1AI05-0298-1>} with Ada.Containers;
function Ada.Strings.Unbounded.Hash (Key : Unbounded_String)
return Containers.Hash_Type;
pragma Preelaborate(Ada.Strings.Unbounded.Hash);
11/3
- {AI05-0001-1AI05-0001-1} Equivalent to Strings.Hash (To_String
- (Key));
+ {<AI05-0001-1AI05-0001-1>} Equivalent to Strings.Hash
+ (To_String (Key));
11.1/3
-{AI05-0001-1AI05-0001-1} {AI05-0298-1AI05-0298-1} The library function
-Strings.Hash_Case_Insensitive has the following declaration:
+{<AI05-0001-1AI05-0001-1>} {<AI05-0298-1AI05-0298-1>} The library
+function Strings.Hash_Case_Insensitive has the following declaration:
11.2/3
with Ada.Containers;
@@ -75207,8 +75466,9 @@ Strings.Hash_Case_Insensitive has the following
declaration:
Hash_Case_Insensitive(B).
11.4/3
-{AI05-0001-1AI05-0001-1} {AI05-0298-1AI05-0298-1} The library function
-Strings.Fixed.Hash_Case_Insensitive has the following declaration:
+{<AI05-0001-1AI05-0001-1>} {<AI05-0298-1AI05-0298-1>} The library
+function Strings.Fixed.Hash_Case_Insensitive has the following
+declaration:
11.5/3
with Ada.Containers, Ada.Strings.Hash_Case_Insensitive;
@@ -75216,8 +75476,8 @@ Strings.Fixed.Hash_Case_Insensitive has the following
declaration:
return Containers.Hash_Type renames Ada.Strings.Hash_Case_Insensitive;
11.6/3
-{AI05-0001-1AI05-0001-1} {AI05-0298-1AI05-0298-1} The generic library
-function Strings.Bounded.Hash_Case_Insensitive has the following
+{<AI05-0001-1AI05-0001-1>} {<AI05-0298-1AI05-0298-1>} The generic
+library function Strings.Bounded.Hash_Case_Insensitive has the following
declaration:
11.7/3
@@ -75234,8 +75494,9 @@ declaration:
(Key));
11.9/3
-{AI05-0001-1AI05-0001-1} {AI05-0298-1AI05-0298-1} The library function
-Strings.Unbounded.Hash_Case_Insensitive has the following declaration:
+{<AI05-0001-1AI05-0001-1>} {<AI05-0298-1AI05-0298-1>} The library
+function Strings.Unbounded.Hash_Case_Insensitive has the following
+declaration:
11.10/3
with Ada.Containers;
@@ -75249,7 +75510,7 @@ Strings.Unbounded.Hash_Case_Insensitive has the
following declaration:
_Implementation Advice_
12/2
-{AI95-00302-03AI95-00302-03} The Hash functions should be good hash
+{<AI95-00302-03AI95-00302-03>} The Hash functions should be good hash
functions, returning a wide spread of values for different string
values. It should be unlikely for similar strings to return the same
value.
@@ -75267,14 +75528,14 @@ value.
_Extensions to Ada 95_
12.c/2
- {AI95-00302-03AI95-00302-03} The Strings.Hash,
+ {<AI95-00302-03AI95-00302-03>} The Strings.Hash,
Strings.Fixed.Hash, Strings.Bounded.Hash, and
Strings.Unbounded.Hash functions are new.
_Extensions to Ada 2005_
12.d/3
- {AI05-0001-1AI05-0001-1} The Strings.Hash_Case_Insensitive,
+ {<AI05-0001-1AI05-0001-1>} The Strings.Hash_Case_Insensitive,
Strings.Fixed.Hash_Case_Insensitive,
Strings.Bounded.Hash_Case_Insensitive, and
Strings.Unbounded.Hash_Case_Insensitive functions are new.
@@ -75288,8 +75549,8 @@ A.4.10 String Comparison
_Static Semantics_
1/3
-{AI05-0001-1AI05-0001-1} {AI05-0286-1AI05-0286-1}
-{AI05-0298-1AI05-0298-1} The library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0286-1AI05-0286-1>}
+{<AI05-0298-1AI05-0298-1>} The library function
Strings.Equal_Case_Insensitive has the following declaration:
2/3
@@ -75306,7 +75567,7 @@ Strings.Equal_Case_Insensitive has the following
declaration:
whether two identifiers are the same.
3.a/3
- Discussion: {AI05-0286-1AI05-0286-1} For String, this is
+ Discussion: {<AI05-0286-1AI05-0286-1>} For String, this is
equivalent to converting to lower case and comparing. Not so
for other string types. For Wide_Strings and
Wide_Wide_Strings, note that this result is a more accurate
@@ -75319,8 +75580,8 @@ Strings.Equal_Case_Insensitive has the following
declaration:
case conversion to lower case.
4/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The library function
Strings.Fixed.Equal_Case_Insensitive has the following declaration:
5/3
@@ -75330,8 +75591,8 @@ Strings.Fixed.Equal_Case_Insensitive has the following
declaration:
renames Ada.Strings.Equal_Case_Insensitive;
6/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The generic library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The generic library function
Strings.Bounded.Equal_Case_Insensitive has the following declaration:
7/3
@@ -75347,8 +75608,8 @@ Strings.Bounded.Equal_Case_Insensitive has the
following declaration:
(Bounded.To_String (Left), Bounded.To_String (Right));
9/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The library function
Strings.Unbounded.Equal_Case_Insensitive has the following declaration:
10/3
@@ -75361,8 +75622,8 @@ Strings.Unbounded.Equal_Case_Insensitive has the
following declaration:
(Left), To_String (Right));
12/3
-{AI05-0001-1AI05-0001-1} {AI05-0298-1AI05-0298-1} The library function
-Strings.Less_Case_Insensitive has the following declaration:
+{<AI05-0001-1AI05-0001-1>} {<AI05-0298-1AI05-0298-1>} The library
+function Strings.Less_Case_Insensitive has the following declaration:
13/3
function Ada.Strings.Less_Case_Insensitive (Left, Right : String)
@@ -75374,8 +75635,8 @@ Strings.Less_Case_Insensitive has the following
declaration:
converted to lower case.
15/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The library function
Strings.Fixed.Less_Case_Insensitive has the following declaration:
16/3
@@ -75385,8 +75646,8 @@ Strings.Fixed.Less_Case_Insensitive has the following
declaration:
renames Ada.Strings.Less_Case_Insensitive;
17/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The generic library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The generic library function
Strings.Bounded.Less_Case_Insensitive has the following declaration:
18/3
@@ -75402,8 +75663,8 @@ Strings.Bounded.Less_Case_Insensitive has the following
declaration:
(Left), Bounded.To_String (Right));
20/3
-{AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
-{AI05-0298-1AI05-0298-1} The library function
+{<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0298-1AI05-0298-1>} The library function
Strings.Unbounded.Less_Case_Insensitive has the following declaration:
21/3
@@ -75418,7 +75679,7 @@ Strings.Unbounded.Less_Case_Insensitive has the
following declaration:
_Extensions to Ada 2005_
22.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0286-1AI05-0286-1} The
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0286-1AI05-0286-1>} The
Strings.Equal_Case_Insensitive,
Strings.Fixed.Equal_Case_Insensitive,
Strings.Bounded.Equal_Case_Insensitive,
@@ -75435,7 +75696,7 @@ A.4.11 String Encoding
----------------------
1/3
-{AI05-0137-2AI05-0137-2} Facilities for encoding, decoding, and
+{<AI05-0137-2AI05-0137-2>} Facilities for encoding, decoding, and
converting strings in various character encoding schemes are provided by
packages Strings.UTF_Encoding, Strings.UTF_Encoding.Conversions,
Strings.UTF_Encoding.Strings, Strings.UTF_Encoding.Wide_Strings, and
@@ -75444,15 +75705,15 @@ Strings.UTF_Encoding.Wide_Wide_Strings.
_Static Semantics_
2/3
-{AI05-0137-2AI05-0137-2} The encoding library packages have the
+{<AI05-0137-2AI05-0137-2>} The encoding library packages have the
following declarations:
3/3
- {AI05-0137-2AI05-0137-2} package Ada.Strings.UTF_Encoding is
+ {<AI05-0137-2AI05-0137-2>} package Ada.Strings.UTF_Encoding is
pragma Pure (UTF_Encoding);
4/3
- -- Declarations common to the string encoding packages
+ -- <Declarations common to the string encoding packages>
type Encoding_Scheme is (UTF_8, UTF_16BE, UTF_16LE);
5/3
@@ -75496,11 +75757,11 @@ following declarations:
end Ada.Strings.UTF_Encoding;
15/3
- {AI05-0137-2AI05-0137-2} package Ada.Strings.UTF_Encoding.Conversions is
+ {<AI05-0137-2AI05-0137-2>} package Ada.Strings.UTF_Encoding.Conversions is
pragma Pure (Conversions);
16/3
- -- Conversions between various encoding schemes
+ -- <Conversions between various encoding schemes>
function Convert (Item : UTF_String;
Input_Scheme : Encoding_Scheme;
Output_Scheme : Encoding_Scheme;
@@ -75530,11 +75791,11 @@ following declarations:
end Ada.Strings.UTF_Encoding.Conversions;
22/3
- {AI05-0137-2AI05-0137-2} package Ada.Strings.UTF_Encoding.Strings is
+ {<AI05-0137-2AI05-0137-2>} package Ada.Strings.UTF_Encoding.Strings is
pragma Pure (Strings);
23/3
- -- Encoding / decoding between String and various encoding schemes
+ -- <Encoding / decoding between String and various encoding schemes>
function Encode (Item : String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -75562,11 +75823,11 @@ following declarations:
end Ada.Strings.UTF_Encoding.Strings;
30/3
- {AI05-0137-2AI05-0137-2} package Ada.Strings.UTF_Encoding.Wide_Strings is
+ {<AI05-0137-2AI05-0137-2>} package Ada.Strings.UTF_Encoding.Wide_Strings
is
pragma Pure (Wide_Strings);
31/3
- -- Encoding / decoding between Wide_String and various encoding schemes
+ -- <Encoding / decoding between Wide_String and various encoding
schemes>
function Encode (Item : Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -75594,11 +75855,11 @@ following declarations:
end Ada.Strings.UTF_Encoding.Wide_Strings;
38/3
- {AI05-0137-2AI05-0137-2} package
Ada.Strings.UTF_Encoding.Wide_Wide_Strings is
+ {<AI05-0137-2AI05-0137-2>} package
Ada.Strings.UTF_Encoding.Wide_Wide_Strings is
pragma Pure (Wide_Wide_Strings);
39/3
- -- Encoding / decoding between Wide_Wide_String and various encoding
schemes
+ -- <Encoding / decoding between Wide_Wide_String and various encoding
schemes>
function Encode (Item : Wide_Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -75626,7 +75887,7 @@ following declarations:
end Ada.Strings.UTF_Encoding.Wide_Wide_Strings;
46/3
-{AI05-0137-2AI05-0137-2} {AI05-0262-1AI05-0262-1} The type
+{<AI05-0137-2AI05-0137-2>} {<AI05-0262-1AI05-0262-1>} The type
Encoding_Scheme defines encoding schemes. UTF_8 corresponds to the
UTF-8 encoding scheme defined by Annex D of ISO/IEC 10646. UTF_16BE
corresponds to the UTF-16 encoding scheme defined by Annex C of ISO/IEC
@@ -75634,7 +75895,7 @@ corresponds to the UTF-16 encoding scheme defined by
Annex C of ISO/IEC
encoding scheme in 8 bit, little-endian order.
47/3
-{AI05-0137-2AI05-0137-2} The subtype UTF_String is used to represent a
+{<AI05-0137-2AI05-0137-2>} The subtype UTF_String is used to represent a
String of 8-bit values containing a sequence of values encoded in one of
three ways (UTF-8, UTF-16BE, or UTF-16LE). The subtype UTF_8_String is
used to represent a String of 8-bit values containing a sequence of
@@ -75643,12 +75904,12 @@ represent a Wide_String of 16-bit values containing a
sequence of values
encoded in UTF-16.
48/3
-{AI05-0137-2AI05-0137-2} {AI05-0262-1AI05-0262-1} The BOM_8, BOM_16BE,
-BOM_16LE, and BOM_16 constants correspond to values used at the start of
-a string to indicate the encoding.
+{<AI05-0137-2AI05-0137-2>} {<AI05-0262-1AI05-0262-1>} The BOM_8,
+BOM_16BE, BOM_16LE, and BOM_16 constants correspond to values used at
+the start of a string to indicate the encoding.
49/3
-{AI05-0262-1AI05-0262-1} {AI05-0269-1AI05-0269-1} Each of the Encode
+{<AI05-0262-1AI05-0262-1>} {<AI05-0269-1AI05-0269-1>} Each of the Encode
functions takes a String, Wide_String, or Wide_Wide_String Item
parameter that is assumed to be an array of unencoded characters. Each
of the Convert functions takes a UTF_String, UTF_8_String, or
@@ -75658,8 +75919,8 @@ encoding scheme required by the function or specified
by its
Input_Scheme parameter.
50/3
-{AI05-0137-2AI05-0137-2} {AI05-0262-1AI05-0262-1}
-{AI05-0269-1AI05-0269-1} Each of the Convert and Encode functions
+{<AI05-0137-2AI05-0137-2>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0269-1AI05-0269-1>} Each of the Convert and Encode functions
returns a UTF_String, UTF_8_String, or UTF_16_String value whose
characters have position values that correspond to the encoding of the
Item parameter according to the encoding scheme required by the function
@@ -75669,7 +75930,7 @@ string if the Output_BOM parameter is set to True. The
lower bound of
the returned string is 1.
51/3
-{AI05-0137-2AI05-0137-2} {AI05-0262-1AI05-0262-1} Each of the Decode
+{<AI05-0137-2AI05-0137-2>} {<AI05-0262-1AI05-0262-1>} Each of the Decode
functions takes a UTF_String, UTF_8_String, or UTF_16_String Item
parameter which is assumed to contain characters whose position values
correspond to a valid encoding sequence according to the encoding scheme
@@ -75678,35 +75939,35 @@ returns the corresponding String, Wide_String, or
Wide_Wide_String
value. The lower bound of the returned string is 1.
52/3
-{AI05-0137-2AI05-0137-2} {AI05-0262-1AI05-0262-1} For each of the
+{<AI05-0137-2AI05-0137-2>} {<AI05-0262-1AI05-0262-1>} For each of the
Convert and Decode functions, an initial BOM in the input that matches
the expected encoding scheme is ignored, and a different initial BOM
causes Encoding_Error to be propagated.
53/3
-{AI05-0137-2AI05-0137-2} The exception Encoding_Error is also propagated
-in the following situations:
+{<AI05-0137-2AI05-0137-2>} The exception Encoding_Error is also
+propagated in the following situations:
54/4
- * {AI12-0088-1AI12-0088-1} By a Convert or Decode function when a UTF
- encoded string contains an invalid encoding sequence.
+ * {<AI12-0088-1AI12-0088-1>} By a Convert or Decode function when a
+ UTF encoded string contains an invalid encoding sequence.
54.a/4
- To be honest: {AI12-0088-1AI12-0088-1} An overlong encoding is
- not invalid for the purposes of this check, and this does not
- depend on the character set version in use. Some recent
+ To be honest: {<AI12-0088-1AI12-0088-1>} An overlong encoding
+ is not invalid for the purposes of this check, and this does
+ not depend on the character set version in use. Some recent
character set standards declare overlong encodings to be
invalid; it would be unnecessary and unfriendly to users for
Convert or Decode to raise an exception for an overlong
encoding.
55/4
- * {AI12-0088-1AI12-0088-1} By a Convert or Decode function when the
+ * {<AI12-0088-1AI12-0088-1>} By a Convert or Decode function when the
expected encoding is UTF-16BE or UTF-16LE and the input string has
an odd length.
56/3
- * {AI05-0262-1AI05-0262-1} By a Decode function yielding a String
+ * {<AI05-0262-1AI05-0262-1>} By a Decode function yielding a String
when the decoding of a sequence results in a code point whose value
exceeds 16#FF#.
@@ -75715,27 +75976,28 @@ in the following situations:
sequence results in a code point whose value exceeds 16#FFFF#.
58/3
- * {AI05-0262-1AI05-0262-1} By an Encode function taking a Wide_String
- as input when an invalid character appears in the input. In
- particular, the characters whose position is in the range 16#D800#
- .. 16#DFFF# are invalid because they conflict with UTF-16
- surrogate encodings, and the characters whose position is 16#FFFE#
- or 16#FFFF# are also invalid because they conflict with BOM codes.
+ * {<AI05-0262-1AI05-0262-1>} By an Encode function taking a
+ Wide_String as input when an invalid character appears in the
+ input. In particular, the characters whose position is in the
+ range 16#D800# .. 16#DFFF# are invalid because they conflict with
+ UTF-16 surrogate encodings, and the characters whose position is
+ 16#FFFE# or 16#FFFF# are also invalid because they conflict with
+ BOM codes.
59/3
- {AI05-0137-2AI05-0137-2} function Encoding (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Encoding (Item : UTF_String;
Default : Encoding_Scheme := UTF_8)
return Encoding_Scheme;
60/3
- {AI05-0137-2AI05-0137-2} {AI05-0269-1AI05-0269-1} Inspects a
- UTF_String value to determine whether it starts with a BOM for
- UTF-8, UTF-16BE, or UTF_16LE. If so, returns the scheme
+ {<AI05-0137-2AI05-0137-2>} {<AI05-0269-1AI05-0269-1>} Inspects
+ a UTF_String value to determine whether it starts with a BOM
+ for UTF-8, UTF-16BE, or UTF_16LE. If so, returns the scheme
corresponding to the BOM; otherwise, returns the value of
Default.
61/3
- {AI05-0137-2AI05-0137-2} function Convert (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Convert (Item : UTF_String;
Input_Scheme : Encoding_Scheme;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -75746,7 +76008,7 @@ in the following situations:
one of these three schemes as specified by Output_Scheme.
63/3
- {AI05-0137-2AI05-0137-2} function Convert (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Convert (Item : UTF_String;
Input_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False)
return UTF_16_Wide_String;
@@ -75757,7 +76019,7 @@ in the following situations:
UTF-16.
65/3
- {AI05-0137-2AI05-0137-2} function Convert (Item : UTF_8_String;
+ {<AI05-0137-2AI05-0137-2>} function Convert (Item : UTF_8_String;
Output_BOM : Boolean := False)
return UTF_16_Wide_String;
@@ -75766,7 +76028,7 @@ in the following situations:
encoded in UTF-16.
67/3
- {AI05-0137-2AI05-0137-2} function Convert (Item :
UTF_16_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Convert (Item :
UTF_16_Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -75776,7 +76038,7 @@ in the following situations:
Output_Scheme.
69/3
- {AI05-0137-2AI05-0137-2} function Convert (Item :
UTF_16_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Convert (Item :
UTF_16_Wide_String;
Output_BOM : Boolean := False) return UTF_8_String;
70/3
@@ -75784,30 +76046,30 @@ in the following situations:
encoded in UTF-8.
71/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
72/3
- {AI05-0262-1AI05-0262-1} Returns the value of Item encoded in
- UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
+ {<AI05-0262-1AI05-0262-1>} Returns the value of Item encoded
+ in UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
73/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : String;
Output_BOM : Boolean := False) return UTF_8_String;
74/3
Returns the value of Item encoded in UTF-8.
75/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : String;
Output_BOM : Boolean := False) return
UTF_16_Wide_String;
76/3
Returns the value of Item encoded in UTF_16.
77/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_String;
Input_Scheme : Encoding_Scheme) return String;
78/3
@@ -75815,44 +76077,44 @@ in the following situations:
UTF-8, UTF-16LE, or UTF-16BE as specified by Input_Scheme.
79/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_8_String) return
String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_8_String) return
String;
80/3
Returns the result of decoding Item, which is encoded in
UTF-8.
81/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_16_Wide_String)
return String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_16_Wide_String)
return String;
82/3
Returns the result of decoding Item, which is encoded in
UTF-16.
83/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
84/3
- {AI05-0262-1AI05-0262-1} Returns the value of Item encoded in
- UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
+ {<AI05-0262-1AI05-0262-1>} Returns the value of Item encoded
+ in UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
85/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : Wide_String;
Output_BOM : Boolean := False) return UTF_8_String;
86/3
Returns the value of Item encoded in UTF-8.
87/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : Wide_String;
Output_BOM : Boolean := False) return
UTF_16_Wide_String;
88/3
Returns the value of Item encoded in UTF_16.
89/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_String;
Input_Scheme : Encoding_Scheme) return Wide_String;
90/3
@@ -75860,44 +76122,44 @@ in the following situations:
UTF-8, UTF-16LE, or UTF-16BE as specified by Input_Scheme.
91/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_8_String) return
Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_8_String) return
Wide_String;
92/3
Returns the result of decoding Item, which is encoded in
UTF-8.
93/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_16_Wide_String)
return Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_16_Wide_String)
return Wide_String;
94/3
Returns the result of decoding Item, which is encoded in
UTF-16.
95/3
- {AI05-0137-2AI05-0137-2} function Encode (Item :
Wide_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item :
Wide_Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
96/3
- {AI05-0262-1AI05-0262-1} Returns the value of Item encoded in
- UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
+ {<AI05-0262-1AI05-0262-1>} Returns the value of Item encoded
+ in UTF-8, UTF-16LE, or UTF-16BE as specified by Output_Scheme.
97/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : Wide_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : Wide_Wide_String;
Output_BOM : Boolean := False) return UTF_8_String;
98/3
Returns the value of Item encoded in UTF-8.
99/3
- {AI05-0137-2AI05-0137-2} function Encode (Item : Wide_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Encode (Item : Wide_Wide_String;
Output_BOM : Boolean := False) return
UTF_16_Wide_String;
100/3
Returns the value of Item encoded in UTF_16.
101/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_String;
Input_Scheme : Encoding_Scheme) return Wide_Wide_String;
102/3
@@ -75905,14 +76167,14 @@ in the following situations:
UTF-8, UTF-16LE, or UTF-16BE as specified by Input_Scheme.
103/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_8_String) return
Wide_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_8_String) return
Wide_Wide_String;
104/3
Returns the result of decoding Item, which is encoded in
UTF-8.
105/3
- {AI05-0137-2AI05-0137-2} function Decode (Item : UTF_16_Wide_String)
return Wide_Wide_String;
+ {<AI05-0137-2AI05-0137-2>} function Decode (Item : UTF_16_Wide_String)
return Wide_Wide_String;
106/3
Returns the result of decoding Item, which is encoded in
@@ -75921,7 +76183,7 @@ in the following situations:
_Implementation Advice_
107/3
-{AI05-0137-2AI05-0137-2} If an implementation supports other encoding
+{<AI05-0137-2AI05-0137-2>} If an implementation supports other encoding
schemes, another similar child of Ada.Strings should be defined.
107.a.1/3
@@ -75932,18 +76194,19 @@ schemes, another similar child of Ada.Strings should
be defined.
NOTES
108/3
- 18 {AI05-0137-2AI05-0137-2} A BOM (Byte-Order Mark, code position
- 16#FEFF#) can be included in a file or other entity to indicate the
- encoding; it is skipped when decoding. Typically, only the first
- line of a file or other entity contains a BOM. When decoding, the
- Encoding function can be called on the first line to determine the
- encoding; this encoding will then be used in subsequent calls to
- Decode to convert all of the lines to an internal format.
+ 18 {<AI05-0137-2AI05-0137-2>} A BOM (Byte-Order Mark, code
+ position 16#FEFF#) can be included in a file or other entity to
+ indicate the encoding; it is skipped when decoding. Typically,
+ only the first line of a file or other entity contains a BOM. When
+ decoding, the Encoding function can be called on the first line to
+ determine the encoding; this encoding will then be used in
+ subsequent calls to Decode to convert all of the lines to an
+ internal format.
_Extensions to Ada 2005_
108.a/3
- {AI05-0137-2AI05-0137-2} The packages Strings.UTF_Encoding,
+ {<AI05-0137-2AI05-0137-2>} The packages Strings.UTF_Encoding,
Strings.UTF_Encoding.Conversions,
Strings.UTF_Encoding.Strings,
Strings.UTF_Encoding.Wide_Strings, and
@@ -75952,8 +76215,8 @@ schemes, another similar child of Ada.Strings should be
defined.
_Wording Changes from Ada 2012_
108.b/4
- {AI12-0088-1AI12-0088-1} Corrigendum: Fixed the omission that
- Convert routines make the same checks on input as Decode
+ {<AI12-0088-1AI12-0088-1>} Corrigendum: Fixed the omission
+ that Convert routines make the same checks on input as Decode
routines.
@@ -75974,10 +76237,10 @@ Annex G::, "*note Annex G:: Numerics".
_Static Semantics_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3/2
- {AI95-00388-01AI95-00388-01} package Ada.Numerics is
+ {<AI95-00388-01AI95-00388-01>} package Ada.Numerics is
pragma Pure(Numerics);
Argument_Error : exception;
Pi : constant :=
@@ -76014,8 +76277,8 @@ of significant digits.
_Extensions to Ada 95_
5.c/2
- {AI95-00388-01AI95-00388-01} The alternative declaration of PI
- is new.
+ {<AI95-00388-01AI95-00388-01>} The alternative declaration of
+ PI is new.
* Menu:
@@ -76050,7 +76313,7 @@ the following declaration:
3
generic
type Float_Type is digits <>;
-
+
package Ada.Numerics.Generic_Elementary_Functions is
pragma Pure(Generic_Elementary_Functions);
@@ -76103,11 +76366,11 @@ the following declaration:
end Ada.Numerics.Generic_Elementary_Functions;
9/1
-{8652/00208652/0020} {AI95-00126-01AI95-00126-01} The library package
-Numerics.Elementary_Functions is declared pure and defines the same
-subprograms as Numerics.Generic_Elementary_Functions, except that the
-predefined type Float is systematically substituted for Float_Type'Base
-throughout. Nongeneric equivalents of
+{<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>} The library
+package Numerics.Elementary_Functions is declared pure and defines the
+same subprograms as Numerics.Generic_Elementary_Functions, except that
+the predefined type Float is systematically substituted for
+Float_Type'Base throughout. Nongeneric equivalents of
Numerics.Generic_Elementary_Functions for each of the other predefined
floating point types are defined similarly, with the names
Numerics.Short_Elementary_Functions, Numerics.Long_Elementary_Functions,
@@ -76139,29 +76402,29 @@ imply the principal branch:
13
* The result of the Arcsin function is in the quadrant containing the
- point (1.0, x), where x is the value of the parameter X. This
+ point (1.0, <x>), where <x> is the value of the parameter X. This
quadrant is I or IV; thus, the range of the Arcsin function is
approximately -PI/2.0 to PI/2.0 (-Cycle/4.0 to Cycle/4.0, if the
parameter Cycle is specified).
14
* The result of the Arccos function is in the quadrant containing the
- point (x, 1.0), where x is the value of the parameter X. This
+ point (<x>, 1.0), where <x> is the value of the parameter X. This
quadrant is I or II; thus, the Arccos function ranges from 0.0 to
approximately PI (Cycle/2.0, if the parameter Cycle is specified).
15
* The results of the Arctan and Arccot functions are in the quadrant
- containing the point (x, y), where x and y are the values of the
- parameters X and Y, respectively. This may be any quadrant (I
- through IV) when the parameter X (resp., Y) of Arctan (resp.,
+ containing the point (<x>, <y>), where <x> and <y> are the values
+ of the parameters X and Y, respectively. This may be any quadrant
+ (I through IV) when the parameter X (resp., Y) of Arctan (resp.,
Arccot) is specified, but it is restricted to quadrants I and IV
(resp., I and II) when that parameter is omitted. Thus, the range
when that parameter is specified is approximately -PI to PI
(-Cycle/2.0 to Cycle/2.0, if the parameter Cycle is specified);
when omitted, the range of Arctan (resp., Arccot) is that of Arcsin
- (resp., Arccos), as given above. When the point (x, y) lies on the
- negative x-axis, the result approximates
+ (resp., Arccos), as given above. When the point (<x>, <y>) lies on
+ the negative x-axis, the result approximates
16
* PI (resp., -PI) when the sign of the parameter Y is positive
@@ -76242,7 +76505,7 @@ cases, provided that Float_Type'Machine_Overflows is
True:
34
[Constraint_Error can also be raised when a finite result overflows (see
-*note G.2.4::); this may occur for parameter values sufficiently near
+*note G.2.4::); this may occur for parameter values sufficiently <near>
poles, and, in the case of some of the functions, for parameter values
with sufficiently large magnitudes.] When Float_Type'Machine_Overflows
is False, the result at poles is unspecified.
@@ -76293,8 +76556,8 @@ Float_Type.
37
In the following cases, evaluation of an elementary function shall yield
-the prescribed result, provided that the preceding rules do not call for
-an exception to be raised:
+the <prescribed result>, provided that the preceding rules do not call
+for an exception to be raised:
38
* When the parameter X has the value zero, the Sqrt, Sin, Arcsin,
@@ -76333,15 +76596,16 @@ When Float_Type'Signed_Zeros is True, the sign of a
zero result shall be
as follows:
45
- * A prescribed zero result delivered at the origin by one of the odd
- functions (Sin, Arcsin, Sinh, Arcsinh, Tan, Arctan or Arccot as a
- function of Y when X is fixed and positive, Tanh, and Arctanh) has
- the sign of the parameter X (Y, in the case of Arctan or Arccot).
+ * A prescribed zero result delivered <at the origin> by one of the
+ odd functions (Sin, Arcsin, Sinh, Arcsinh, Tan, Arctan or Arccot as
+ a function of Y when X is fixed and positive, Tanh, and Arctanh)
+ has the sign of the parameter X (Y, in the case of Arctan or
+ Arccot).
46
- * A prescribed zero result delivered by one of the odd functions away
- from the origin, or by some other elementary function, has an
- implementation-defined sign.
+ * A prescribed zero result delivered by one of the odd functions
+ <away from the origin>, or by some other elementary function, has
+ an implementation-defined sign.
46.a
Implementation defined: The sign of a zero result from some of
@@ -76415,9 +76679,9 @@ type.
_Wording Changes from Ada 95_
48.i/2
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01} Corrigendum:
- Explicitly stated that the nongeneric equivalents of
- Generic_Elementary_Functions are pure.
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>}
+ Corrigendum: Explicitly stated that the nongeneric equivalents
+ of Generic_Elementary_Functions are pure.
File: aarm2012.info, Node: A.5.2, Next: A.5.3, Prev: A.5.1, Up: A.5
@@ -76431,7 +76695,7 @@ are provided in the package Numerics.Float_Random; the
generic package
Numerics.Discrete_Random provides similar facilities for the generation
of pseudo-random integers and pseudo-random values of enumeration types.
For brevity, pseudo-random values of any of these types are called
-random numbers.
+<random numbers>.
2
Some of the facilities provided are basic to all applications of random
@@ -76464,7 +76728,7 @@ The library package Numerics.Float_Random has the
following declaration:
package Ada.Numerics.Float_Random is
6
- -- Basic facilities
+ -- <Basic facilities>
7
type Generator is limited private;
@@ -76479,7 +76743,7 @@ The library package Numerics.Float_Random has the
following declaration:
procedure Reset (Gen : in Generator);
10
- -- Advanced facilities
+ -- <Advanced facilities>
11
type State is private;
@@ -76491,7 +76755,7 @@ The library package Numerics.Float_Random has the
following declaration:
From_State : in State);
13
- Max_Image_Width : constant := implementation-defined integer value;
+ Max_Image_Width : constant := <implementation-defined integer value>;
14
function Image (Of_State : State) return String;
@@ -76499,25 +76763,25 @@ The library package Numerics.Float_Random has the
following declaration:
15
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Numerics.Float_Random;
15.1/2
-{AI95-00360-01AI95-00360-01} The type Generator needs finalization (see
-*note 7.6::).
+{<AI95-00360-01AI95-00360-01>} The type Generator needs finalization
+(see *note 7.6::).
16
The generic library package Numerics.Discrete_Random has the following
declaration:
17
-
+
generic
type Result_Subtype is (<>);
package Ada.Numerics.Discrete_Random is
18
- -- Basic facilities
+ -- <Basic facilities>
19
type Generator is limited private;
@@ -76531,7 +76795,7 @@ declaration:
procedure Reset (Gen : in Generator);
22
- -- Advanced facilities
+ -- <Advanced facilities>
23
type State is private;
@@ -76543,7 +76807,7 @@ declaration:
From_State : in State);
25
- Max_Image_Width : constant := implementation-defined integer value;
+ Max_Image_Width : constant := <implementation-defined integer value>;
26
function Image (Of_State : State) return String;
@@ -76551,7 +76815,7 @@ declaration:
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Numerics.Discrete_Random;
27.a
@@ -76563,8 +76827,8 @@ declaration:
Numerics.Discrete_Random.Max_Image_Width.
27.c/1
- Implementation Note: {8652/00978652/0097}
- {AI95-00115-01AI95-00115-01} The following is a possible
+ Implementation Note: {<8652/00978652/0097>}
+ {<AI95-00115-01AI95-00115-01>} The following is a possible
implementation of the private part of Numerics.Float_Random
(assuming the presence of "with Ada.Finalization;" as a
context clause):
@@ -76579,8 +76843,8 @@ declaration:
procedure Finalize (G : in out Generator);
27.d.1/2
- {8652/00978652/0097} {AI95-00115-01AI95-00115-01}
- {AI95-00344-01AI95-00344-01}
+ {<8652/00978652/0097>} {<AI95-00115-01AI95-00115-01>}
+ {<AI95-00344-01AI95-00344-01>}
Numerics.Discrete_Random.Generator also can be implemented
this way.
@@ -76592,15 +76856,15 @@ declaration:
declared pure.
27.1/2
-{AI95-00360-01AI95-00360-01} The type Generator needs finalization (see
-*note 7.6::) in every instantiation of Numerics.Discrete_Random.
+{<AI95-00360-01AI95-00360-01>} The type Generator needs finalization
+(see *note 7.6::) in every instantiation of Numerics.Discrete_Random.
28
An object of the limited private type Generator is associated with a
sequence of random numbers. Each generator has a hidden (internal)
state, which the operations on generators use to determine the position
-in the associated sequence. All generators are implicitly initialized to
-an unspecified state that does not vary from one program execution to
+in the associated sequence. All generators are implicitly initialized
+to an unspecified state that does not vary from one program execution to
another; they may also be explicitly initialized, or reinitialized, to a
time-dependent state, to a previously saved state, or to a state
uniquely denoted by an integer value.
@@ -76611,14 +76875,14 @@ uniquely denoted by an integer value.
purposes.
29/3
-{AI05-0280-1AI05-0280-1} An object of the private type State can be used
-to hold the internal state of a generator. Such objects are only needed
-if the application is designed to save and restore generator states or
-to examine or manufacture them. The implicit initial value of type
-State corresponds to the implicit initial value of all generators.
+{<AI05-0280-1AI05-0280-1>} An object of the private type State can be
+used to hold the internal state of a generator. Such objects are only
+needed if the application is designed to save and restore generator
+states or to examine or manufacture them. The implicit initial value of
+type State corresponds to the implicit initial value of all generators.
29.a/3
- Discussion: {AI05-0280-1AI05-0280-1} All generators are
+ Discussion: {<AI05-0280-1AI05-0280-1>} All generators are
implicitly initialized to the same unchanging value, and using
Reset on a default initialized object of type State will
produce a generator with that same value.
@@ -76644,7 +76908,7 @@ generators and states are defined below.
generic formal subtype Result_Subtype.
32.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
32.a.1/2
Discussion: The algorithm is the subject of a Documentation
@@ -76665,8 +76929,8 @@ generators and states are defined below.
Sets the state of the specified generator to one that is an
unspecified function of the value of the parameter Initiator
(or to a time-dependent state, if only a generator parameter
- is specified). The latter form of the procedure is known as
- the time-dependent Reset procedure.
+ is specified). The latter form of the procedure is known as
+ the <time-dependent Reset procedure>.
34.a
Implementation Note: The time-dependent Reset procedure can be
@@ -76710,12 +76974,13 @@ Instantiation of Numerics.Discrete_Random with a
subtype having a null
range raises Constraint_Error.
40/1
-This paragraph was deleted.{8652/00508652/0050} {AI95-00089AI95-00089}
+<This paragraph was deleted.>{<8652/00508652/0050>}
+{<AI95-00089AI95-00089>}
_Bounded (Run-Time) Errors_
40.1/1
-{8652/00508652/0050} {AI95-00089AI95-00089} It is a bounded error to
+{<8652/00508652/0050>} {<AI95-00089AI95-00089>} It is a bounded error to
invoke Value with a string that is not the image of any generator state.
If the error is detected, Constraint_Error or Program_Error is raised.
Otherwise, a call to Reset with the resulting state will produce a
@@ -76765,7 +77030,7 @@ initiate different sequences, and it shall document the
nature of the
strings that Value will accept without raising Constraint_Error.
45.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
45.b/2
Documentation Requirement: The minimum time interval between
@@ -76849,7 +77114,7 @@ initiator value.
1.0 can be obtained by the transformation
53/2
- {AI95-00434-01AI95-00434-01} -Log(Random(G) + Float'Model_Small)
+ {<AI95-00434-01AI95-00434-01>} -Log(Random(G) + Float'Model_Small)
54
where Log comes from Numerics.Elementary_Functions (see *note
@@ -76861,7 +77126,7 @@ initiator value.
_Examples_
55
-Example of a program that plays a simulated dice game:
+<Example of a program that plays a simulated dice game:>
56
with Ada.Numerics.Discrete_Random;
@@ -76873,16 +77138,16 @@ Example of a program that plays a simulated dice game:
G : Generator;
D : Dice;
begin
- Reset (G); -- Start the generator in a unique state in each run
+ Reset (G); -- <Start the generator in a unique state in each run>
loop
- -- Roll a pair of dice; sum and process the results
+ -- <Roll a pair of dice; sum and process the results>
D := Random(G) + Random(G);
...
end loop;
end Dice_Game;
57
-Example of a program that simulates coin tosses:
+<Example of a program that simulates coin tosses:>
58
with Ada.Numerics.Discrete_Random;
@@ -76892,9 +77157,9 @@ Example of a program that simulates coin tosses:
use Random_Coin;
G : Generator;
begin
- Reset (G); -- Start the generator in a unique state in each run
+ Reset (G); -- <Start the generator in a unique state in each run>
loop
- -- Toss a coin and process the result
+ -- <Toss a coin and process the result>
case Random(G) is
when Heads =>
...
@@ -76906,8 +77171,8 @@ Example of a program that simulates coin tosses:
end Flip_A_Coin;
59
-Example of a parallel simulation of a physical system, with a separate
-generator of event probabilities in each task:
+<Example of a parallel simulation of a physical system, with a separate
+generator of event probabilities in each task:>
60
with Ada.Numerics.Float_Random;
@@ -76932,17 +77197,17 @@ generator of event probabilities in each task:
end loop;
end Worker;
begin
- -- Initialize the generators in the Worker tasks to different states
+ -- <Initialize the generators in the Worker tasks to different states>
for I in W'Range loop
W(I).Initialize_Generator (I);
end loop;
- ... -- Wait for the Worker tasks to terminate
+ ... -- <Wait for the Worker tasks to terminate>
end Parallel_Simulation;
NOTES
61
- 22 Notes on the last example: Although each Worker task
+ 22 <Notes on the last example:> Although each Worker task
initializes its generator to a different state, those states will
be the same in every execution of the program. The generator
states can be initialized uniquely in each program execution by
@@ -76955,7 +77220,7 @@ generator of event probabilities in each task:
_Incompatibilities With Ada 95_
61.a/2
- {AI95-00360-01AI95-00360-01} Amendment Correction: Type
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction: Type
Generator in Numerics.Float_Random and in an instance of
Numerics.Discrete_Random is defined to need finalization. If
the restriction No_Nested_Finalization (see *note D.7::)
@@ -76968,8 +77233,8 @@ generator of event probabilities in each task:
_Wording Changes from Ada 95_
61.b/3
- {8652/00508652/0050} {AI95-00089-01AI95-00089-01}
- {AI05-0005-1AI05-0005-1} Corrigendum: Made the passing of an
+ {<8652/00508652/0050>} {<AI95-00089-01AI95-00089-01>}
+ {<AI05-0005-1AI05-0005-1>} Corrigendum: Made the passing of an
incorrect Image of a generator a bounded error, as it might
not be practical to check for problems (if a generator
consists of several related values).
@@ -76977,7 +77242,7 @@ generator of event probabilities in each task:
_Wording Changes from Ada 2005_
61.c/3
- {AI05-0280-1AI05-0280-1} Correction: Specified the implicit
+ {<AI05-0280-1AI05-0280-1>} Correction: Specified the implicit
initial value for (sub)type State. This was unspecified in
Ada 95 and Ada 2005, so a program depending on some other
initial value is very unlikely and certainly was not portable.
@@ -76995,63 +77260,63 @@ A.5.3 Attributes of Floating Point Types
_Static Semantics_
1
-The following representation-oriented attributes are defined for every
-subtype S of a floating point type T.
+The following <representation-oriented attributes> are defined for every
+subtype S of a floating point type <T>.
2
S'Machine_Radix
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>.
3
The values of other representation-oriented attributes of a floating
point subtype, and of the "primitive function" attributes of a floating
point subtype described later, are defined in terms of a particular
-representation of nonzero values called the canonical form. The
-canonical form (for the type T) is the form
- � mantissa � T'Machine_Radixexponent
+representation of nonzero values called the <canonical form>. The
+canonical form (for the type <T>) is the form
+ � <mantissa> � <T>'Machine_Radix<exponent>
where
4
- * mantissa is a fraction in the number base T'Machine_Radix, the
+ * <mantissa> is a fraction in the number base <T>'Machine_Radix, the
first digit of which is nonzero, and
5
- * exponent is an integer.
+ * <exponent> is an integer.
6
S'Machine_Mantissa
- Yields the largest value of p such that every value
- expressible in the canonical form (for the type T),
- having a p-digit mantissa and an exponent between
- T'Machine_Emin and T'Machine_Emax, is a machine number
- (see *note 3.5.7::) of the type T. This attribute yields
- a value of the type universal_integer.
+ Yields the largest value of <p> such that every value
+ expressible in the canonical form (for the type <T>),
+ having a <p>-digit <mantissa> and an <exponent> between
+ <T>'Machine_Emin and <T>'Machine_Emax, is a machine
+ number (see *note 3.5.7::) of the type <T>. This
+ attribute yields a value of the type <universal_integer>.
6.a
Ramification: Values of a type held in an extended register
are, in general, not machine numbers of the type, since they
cannot be expressed in the canonical form with a sufficiently
- short mantissa.
+ short <mantissa>.
7
S'Machine_Emin
- Yields the smallest (most negative) value of exponent
+ Yields the smallest (most negative) value of <exponent>
such that every value expressible in the canonical form
- (for the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer.
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>.
8
S'Machine_Emax
- Yields the largest (most positive) value of exponent such
- that every value expressible in the canonical form (for
- the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer.
+ Yields the largest (most positive) value of <exponent>
+ such that every value expressible in the canonical form
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>.
8.a
Ramification: Note that the above definitions do not determine
@@ -77063,22 +77328,22 @@ S'Machine_Emax
S'Denorm
Yields the value True if every value expressible in the
form
- � mantissa � T'Machine_RadixT'Machine_Emin
- where mantissa is a nonzero T'Machine_Mantissa-digit
- fraction in the number base T'Machine_Radix, the first
+ � <mantissa> � <T>'Machine_Radix<T>'Machine_Emin
+ where <mantissa> is a nonzero <T>'Machine_Mantissa-digit
+ fraction in the number base <T>'Machine_Radix, the first
digit of which is zero, is a machine number (see *note
- 3.5.7::) of the type T; yields the value False otherwise.
- The value of this attribute is of the predefined type
- Boolean.
+ 3.5.7::) of the type <T>; yields the value False
+ otherwise. The value of this attribute is of the
+ predefined type Boolean.
10
The values described by the formula in the definition of S'Denorm are
-called denormalized numbers. A nonzero machine number that is not a
-denormalized number is a normalized number. A normalized number x of a
-given type T is said to be represented in canonical form when it is
-expressed in the canonical form (for the type T) with a mantissa having
-T'Machine_Mantissa digits; the resulting form is the canonical-form
-representation of x.
+called <denormalized numbers>. A nonzero machine number that is not a
+denormalized number is a <normalized number>. A normalized number <x>
+of a given type <T> is said to be <represented in canonical form> when
+it is expressed in the canonical form (for the type <T>) with a
+<mantissa> having <T>'Machine_Mantissa digits; the resulting form is the
+<canonical-form representation> of <x>.
10.a
Discussion: The intent is that S'Denorm be True when such
@@ -77090,7 +77355,7 @@ representation of x.
S'Machine_Rounds
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean.
@@ -77124,42 +77389,43 @@ S'Machine_Overflows
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean.
13
S'Signed_Zeros
Yields the value True if the hardware representation for
- the type T has the capability of representing both
+ the type <T> has the capability of representing both
positively and negatively signed zeros, these being
generated and used by the predefined operations of the
- type T as specified in IEC 559:1989; yields the value
+ type <T> as specified in IEC 559:1989; yields the value
False otherwise. The value of this attribute is of the
predefined type Boolean.
14
-For every value x of a floating point type T, the normalized exponent of
-x is defined as follows:
+For every value <x> of a floating point type <T>, the <normalized
+exponent> of <x> is defined as follows:
15
* the normalized exponent of zero is (by convention) zero;
16
- * for nonzero x, the normalized exponent of x is the unique integer k
- such that T'Machine_Radixk-1 <= |x| < T'Machine_Radixk.
+ * for nonzero <x>, the normalized exponent of <x> is the unique
+ integer <k> such that <T>'Machine_Radix<k>-1 <= |<x>| <
+ <T>'Machine_Radix<k>.
16.a
- Ramification: The normalized exponent of a normalized number x
- is the value of exponent in the canonical-form representation
- of x.
+ Ramification: The normalized exponent of a normalized number
+ <x> is the value of <exponent> in the canonical-form
+ representation of <x>.
16.b
The normalized exponent of a denormalized number is less than
- the value of T'Machine_Emin.
+ the value of <T>'Machine_Emin.
17
-The following primitive function attributes are defined for any subtype
-S of a floating point type T.
+The following <primitive function attributes> are defined for any
+subtype S of a floating point type <T>.
18
S'Exponent
@@ -77167,11 +77433,11 @@ S'Exponent
specification:
19
- function S'Exponent (X : T)
- return universal_integer
+ function S'Exponent (<X> : <T>)
+ return <universal_integer>
20
- The function yields the normalized exponent of X.
+ The function yields the normalized exponent of <X>.
21
S'Fraction
@@ -77179,31 +77445,32 @@ S'Fraction
specification:
22
- function S'Fraction (X : T)
- return T
+ function S'Fraction (<X> : <T>)
+ return <T>
23
- The function yields the value X � T'Machine_Radix-k,
- where k is the normalized exponent of X. A zero result[,
- which can only occur when X is zero,] has the sign of X.
+ The function yields the value <X> �
+ <T>'Machine_Radix-<k>, where <k> is the normalized
+ exponent of <X>. A zero result[, which can only occur
+ when <X> is zero,] has the sign of <X>.
23.a
- Discussion: Informally, when X is a normalized number, the
- result is the value obtained by replacing the exponent by zero
- in the canonical-form representation of X.
+ Discussion: Informally, when <X> is a normalized number, the
+ result is the value obtained by replacing the <exponent> by
+ zero in the canonical-form representation of <X>.
23.b
- Ramification: Except when X is zero, the magnitude of the
+ Ramification: Except when <X> is zero, the magnitude of the
result is greater than or equal to the reciprocal of
- T'Machine_Radix and less than one; consequently, the result is
- always a normalized number, even when X is a denormalized
+ <T>'Machine_Radix and less than one; consequently, the result
+ is always a normalized number, even when <X> is a denormalized
number.
23.c
- Implementation Note: When X is a denormalized number, the
- result is the value obtained by replacing the exponent by zero
- in the canonical-form representation of the result of scaling
- X up sufficiently to normalize it.
+ Implementation Note: When <X> is a denormalized number, the
+ result is the value obtained by replacing the <exponent> by
+ zero in the canonical-form representation of the result of
+ scaling <X> up sufficiently to normalize it.
24
S'Compose
@@ -77211,30 +77478,32 @@ S'Compose
specification:
25
- function S'Compose (Fraction : T;
- Exponent : universal_integer)
- return T
+ function S'Compose (<Fraction> : <T>;
+ <Exponent> : <universal_integer>)
+ return <T>
26
- Let v be the value Fraction � T'Machine_RadixExponent-k,
- where k is the normalized exponent of Fraction. If v is
- a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of Fraction when S'Signed_Zeros is True.
+ Let <v> be the value <Fraction> �
+ <T>'Machine_Radix<Exponent>-<k>, where <k> is the
+ normalized exponent of <Fraction>. If <v> is a machine
+ number of the type <T>, or if |<v>| >= <T>'Model_Small,
+ the function yields <v>; otherwise, it yields either one
+ of the machine numbers of the type <T> adjacent to <v>.
+ Constraint_Error is optionally raised if <v> is outside
+ the base range of S. A zero result has the sign of
+ <Fraction> when S'Signed_Zeros is True.
26.a
- Discussion: Informally, when Fraction and v are both
+ Discussion: Informally, when <Fraction> and <v> are both
normalized numbers, the result is the value obtained by
- replacing the exponent by Exponent in the canonical-form
- representation of Fraction.
+ replacing the <exponent> by <Exponent> in the canonical-form
+ representation of <Fraction>.
26.b
- Ramification: If Exponent is less than T'Machine_Emin and
- Fraction is nonzero, the result is either zero, T'Model_Small,
- or (if T'Denorm is True) a denormalized number.
+ Ramification: If <Exponent> is less than <T>'Machine_Emin and
+ <Fraction> is nonzero, the result is either zero,
+ <T>'Model_Small, or (if <T>'Denorm is True) a denormalized
+ number.
27
S'Scaling
@@ -77242,29 +77511,30 @@ S'Scaling
specification:
28
- function S'Scaling (X : T;
- Adjustment : universal_integer)
- return T
+ function S'Scaling (<X> : <T>;
+ <Adjustment> : <universal_integer>)
+ return <T>
29
- Let v be the value X � T'Machine_RadixAdjustment. If v
- is a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of X when S'Signed_Zeros is True.
+ Let <v> be the value <X> � <T>'Machine_Radix<Adjustment>.
+ If <v> is a machine number of the type <T>, or if |<v>|
+ >= <T>'Model_Small, the function yields <v>; otherwise,
+ it yields either one of the machine numbers of the type
+ <T> adjacent to <v>. Constraint_Error is optionally
+ raised if <v> is outside the base range of S. A zero
+ result has the sign of <X> when S'Signed_Zeros is True.
29.a
- Discussion: Informally, when X and v are both normalized
+ Discussion: Informally, when <X> and <v> are both normalized
numbers, the result is the value obtained by increasing the
- exponent by Adjustment in the canonical-form representation of
- X.
+ <exponent> by <Adjustment> in the canonical-form
+ representation of <X>.
29.b
- Ramification: If Adjustment is sufficiently small (i.e.,
+ Ramification: If <Adjustment> is sufficiently small (i.e.,
sufficiently negative), the result is either zero,
- T'Model_Small, or (if T'Denorm is True) a denormalized number.
+ <T>'Model_Small, or (if <T>'Denorm is True) a denormalized
+ number.
30
S'Floor
@@ -77272,14 +77542,14 @@ S'Floor
specification:
31
- function S'Floor (X : T)
- return T
+ function S'Floor (<X> : <T>)
+ return <T>
32
- The function yields the value 'floor(X)', i.e., the
+ The function yields the value 'floor(<X>)', i.e., the
largest (most positive) integral value less than or equal
- to X. When X is zero, the result has the sign of X; a
- zero result otherwise has a positive sign.
+ to <X>. When <X> is zero, the result has the sign of
+ <X>; a zero result otherwise has a positive sign.
33
S'Ceiling
@@ -77287,14 +77557,14 @@ S'Ceiling
specification:
34
- function S'Ceiling (X : T)
- return T
+ function S'Ceiling (<X> : <T>)
+ return <T>
35
- The function yields the value 'ceiling(X)', i.e., the
+ The function yields the value 'ceiling(<X>)', i.e., the
smallest (most negative) integral value greater than or
- equal to X. When X is zero, the result has the sign of X;
- a zero result otherwise has a negative sign when
+ equal to <X>. When <X> is zero, the result has the sign
+ of <X>; a zero result otherwise has a negative sign when
S'Signed_Zeros is True.
36
@@ -77303,14 +77573,14 @@ S'Rounding
specification:
37
- function S'Rounding (X : T)
- return T
+ function S'Rounding (<X> : <T>)
+ return <T>
38
- The function yields the integral value nearest to X,
- rounding away from zero if X lies exactly halfway between
- two integers. A zero result has the sign of X when
- S'Signed_Zeros is True.
+ The function yields the integral value nearest to <X>,
+ rounding away from zero if <X> lies exactly halfway
+ between two integers. A zero result has the sign of <X>
+ when S'Signed_Zeros is True.
39
S'Unbiased_Rounding
@@ -77318,29 +77588,29 @@ S'Unbiased_Rounding
specification:
40
- function S'Unbiased_Rounding (X : T)
- return T
+ function S'Unbiased_Rounding (<X> : <T>)
+ return <T>
41
- The function yields the integral value nearest to X,
- rounding toward the even integer if X lies exactly
+ The function yields the integral value nearest to <X>,
+ rounding toward the even integer if <X> lies exactly
halfway between two integers. A zero result has the sign
- of X when S'Signed_Zeros is True.
+ of <X> when S'Signed_Zeros is True.
41.1/2
S'Machine_Rounding
- {AI95-00267-01AI95-00267-01} S'Machine_Rounding denotes a
- function with the following specification:
+ {<AI95-00267-01AI95-00267-01>} S'Machine_Rounding denotes
+ a function with the following specification:
41.2/2
- function S'Machine_Rounding (X : T)
- return T
+ function S'Machine_Rounding (<X> : <T>)
+ return <T>
41.3/2
- The function yields the integral value nearest to X. If X
- lies exactly halfway between two integers, one of those
- integers is returned, but which of them is returned is
- unspecified. A zero result has the sign of X when
+ The function yields the integral value nearest to <X>.
+ If <X> lies exactly halfway between two integers, one of
+ those integers is returned, but which of them is returned
+ is unspecified. A zero result has the sign of <X> when
S'Signed_Zeros is True. This function provides access to
the rounding behavior which is most efficient on the
target processor.
@@ -77359,13 +77629,13 @@ S'Truncation
specification:
43
- function S'Truncation (X : T)
- return T
+ function S'Truncation (<X> : <T>)
+ return <T>
44
- The function yields the value 'ceiling(X)' when X is
- negative, and 'floor(X)' otherwise. A zero result has
- the sign of X when S'Signed_Zeros is True.
+ The function yields the value 'ceiling(<X>)' when <X> is
+ negative, and 'floor(<X>)' otherwise. A zero result has
+ the sign of <X> when S'Signed_Zeros is True.
45
S'Remainder
@@ -77373,27 +77643,27 @@ S'Remainder
specification:
46
- function S'Remainder (X, Y : T)
- return T
+ function S'Remainder (<X>, <Y> : <T>)
+ return <T>
47
- For nonzero Y, let v be the value X - n � Y, where n is
- the integer nearest to the exact value of X/Y; if |n -
- X/Y| = 1/2, then n is chosen to be even. If v is a
- machine number of the type T, the function yields v;
- otherwise, it yields zero. Constraint_Error is raised if
- Y is zero. A zero result has the sign of X when
- S'Signed_Zeros is True.
+ For nonzero <Y>, let <v> be the value <X> - <n> � <Y>,
+ where <n> is the integer nearest to the exact value of
+ <X>/<Y>; if |<n> - <X>/<Y>| = 1/2, then <n> is chosen to
+ be even. If <v> is a machine number of the type <T>, the
+ function yields <v>; otherwise, it yields zero.
+ Constraint_Error is raised if <Y> is zero. A zero result
+ has the sign of <X> when S'Signed_Zeros is True.
47.a
Ramification: The magnitude of the result is less than or
- equal to one-half the magnitude of Y.
+ equal to one-half the magnitude of <Y>.
47.b
- Discussion: Given machine numbers X and Y of the type T, v is
- necessarily a machine number of the type T, except when Y is
- in the neighborhood of zero, X is sufficiently close to a
- multiple of Y, and T'Denorm is False.
+ Discussion: Given machine numbers <X> and <Y> of the type <T>,
+ <v> is necessarily a machine number of the type <T>, except
+ when <Y> is in the neighborhood of zero, <X> is sufficiently
+ close to a multiple of <Y>, and <T>'Denorm is False.
48
S'Adjacent
@@ -77401,23 +77671,23 @@ S'Adjacent
specification:
49
- function S'Adjacent (X, Towards : T)
- return T
+ function S'Adjacent (<X>, <Towards> : <T>)
+ return <T>
50
- If Towards = X, the function yields X; otherwise, it
- yields the machine number of the type T adjacent to X in
- the direction of Towards, if that machine number exists.
- If the result would be outside the base range of S,
- Constraint_Error is raised. When T'Signed_Zeros is True,
- a zero result has the sign of X. When Towards is zero,
- its sign has no bearing on the result.
+ If <Towards> = <X>, the function yields <X>; otherwise,
+ it yields the machine number of the type <T> adjacent to
+ <X> in the direction of <Towards>, if that machine number
+ exists. If the result would be outside the base range of
+ S, Constraint_Error is raised. When <T>'Signed_Zeros is
+ True, a zero result has the sign of <X>. When <Towards>
+ is zero, its sign has no bearing on the result.
50.a
Ramification: The value of S'Adjacent(0.0, 1.0) is the
- smallest normalized positive number of the type T when
- T'Denorm is False and the smallest denormalized positive
- number of the type T when T'Denorm is True.
+ smallest normalized positive number of the type <T> when
+ <T>'Denorm is False and the smallest denormalized positive
+ number of the type <T> when <T>'Denorm is True.
51
S'Copy_Sign
@@ -77425,16 +77695,16 @@ S'Copy_Sign
specification:
52
- function S'Copy_Sign (Value, Sign : T)
- return T
+ function S'Copy_Sign (<Value>, <Sign> : <T>)
+ return <T>
53
- If the value of Value is nonzero, the function yields a
- result whose magnitude is that of Value and whose sign is
- that of Sign; otherwise, it yields the value zero.
+ If the value of <Value> is nonzero, the function yields a
+ result whose magnitude is that of <Value> and whose sign
+ is that of <Sign>; otherwise, it yields the value zero.
Constraint_Error is optionally raised if the result is
outside the base range of S. A zero result has the sign
- of Sign when S'Signed_Zeros is True.
+ of <Sign> when S'Signed_Zeros is True.
53.a
Discussion: S'Copy_Sign is provided for convenience in
@@ -77443,10 +77713,10 @@ S'Copy_Sign
S'Signed_Zeros is True, it is also instrumental in determining
the sign of a zero quantity, when required. (Because negative
and positive zeros compare equal in systems conforming to IEC
- 559:1989, a negative zero does not appear to be negative when
- compared to zero.) The sign determination is accomplished by
- transferring the sign of the zero quantity to a nonzero
- quantity and then testing for a negative result.
+ 559:1989, a negative zero does <not> appear to be negative
+ when compared to zero.) The sign determination is
+ accomplished by transferring the sign of the zero quantity to
+ a nonzero quantity and then testing for a negative result.
54
S'Leading_Part
@@ -77454,39 +77724,40 @@ S'Leading_Part
specification:
55
- function S'Leading_Part (X : T;
- Radix_Digits : universal_integer)
- return T
+ function S'Leading_Part (<X> : <T>;
+ <Radix_Digits> :
<universal_integer>)
+ return <T>
56
- Let v be the value T'Machine_Radixk-Radix_Digits, where k
- is the normalized exponent of X. The function yields the
- value
+ Let <v> be the value <T>'Machine_Radix<k>-<Radix_Digits>,
+ where <k> is the normalized exponent of <X>. The
+ function yields the value
57
- * 'floor(X/v)' � v, when X is nonnegative and
- Radix_Digits is positive;
+ * 'floor(<X>/<v>)' � <v>, when <X> is nonnegative and
+ <Radix_Digits> is positive;
58
- * 'ceiling(X/v)' � v, when X is negative and
- Radix_Digits is positive.
+ * 'ceiling(<X>/<v>)' � <v>, when <X> is negative and
+ <Radix_Digits> is positive.
59
- Constraint_Error is raised when Radix_Digits is zero or
- negative. A zero result[, which can only occur when X is
- zero,] has the sign of X.
+ Constraint_Error is raised when <Radix_Digits> is zero or
+ negative. A zero result[, which can only occur when <X>
+ is zero,] has the sign of <X>.
59.a
- Discussion: Informally, if X is nonzero, the result is the
+ Discussion: Informally, if <X> is nonzero, the result is the
value obtained by retaining only the specified number of
- (leading) significant digits of X (in the machine radix),
+ (leading) significant digits of <X> (in the machine radix),
setting all other digits to zero.
59.b
Implementation Note: The result can be obtained by first
- scaling X up, if necessary to normalize it, then masking the
+ scaling <X> up, if necessary to normalize it, then masking the
mantissa so as to retain only the specified number of leading
- digits, then scaling the result back down if X was scaled up.
+ digits, then scaling the result back down if <X> was scaled
+ up.
60
S'Machine
@@ -77494,21 +77765,21 @@ S'Machine
specification:
61
- function S'Machine (X : T)
- return T
+ function S'Machine (<X> : <T>)
+ return <T>
62
- If X is a machine number of the type T, the function
- yields X; otherwise, it yields the value obtained by
- rounding or truncating X to either one of the adjacent
- machine numbers of the type T. Constraint_Error is raised
- if rounding or truncating X to the precision of the
- machine numbers results in a value outside the base range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True.
+ If <X> is a machine number of the type <T>, the function
+ yields <X>; otherwise, it yields the value obtained by
+ rounding or truncating <X> to either one of the adjacent
+ machine numbers of the type <T>. Constraint_Error is
+ raised if rounding or truncating <X> to the precision of
+ the machine numbers results in a value outside the base
+ range of S. A zero result has the sign of <X> when
+ S'Signed_Zeros is True.
62.a/3
- Discussion: {AI05-0005-1AI05-0005-1} All of the primitive
+ Discussion: {<AI05-0005-1AI05-0005-1>} All of the primitive
function attributes except Rounding and Machine correspond to
subprograms in the Generic_Primitive_Functions generic package
that was proposed as a separate ISO standard (ISO/IEC DIS
@@ -77543,54 +77814,55 @@ S'Machine
operations.
63
-The following model-oriented attributes are defined for any subtype S of
-a floating point type T.
+The following <model-oriented attributes> are defined for any subtype S
+of a floating point type <T>.
64
S'Model_Mantissa
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to 'ceiling(d � log(10) /
- log(T'Machine_Radix))' + 1, where d is the requested
- decimal precision of T, and less than or equal to the
- value of T'Machine_Mantissa. See *note G.2.2:: for
+ than or equal to 'ceiling(<d> � log(10) /
+ log(<T>'Machine_Radix))' + 1, where <d> is the requested
+ decimal precision of <T>, and less than or equal to the
+ value of <T>'Machine_Mantissa. See *note G.2.2:: for
further requirements that apply to implementations
supporting the Numerics Annex. The value of this
- attribute is of the type universal_integer.
+ attribute is of the type <universal_integer>.
65
S'Model_Emin
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to the value of T'Machine_Emin. See *note
- G.2.2:: for further requirements that apply to
+ than or equal to the value of <T>'Machine_Emin. See
+ *note G.2.2:: for further requirements that apply to
implementations supporting the Numerics Annex. The value
- of this attribute is of the type universal_integer.
+ of this attribute is of the type <universal_integer>.
66
S'Model_Epsilon
- Yields the value T'Machine_Radix1 - T'Model_Mantissa.
+ Yields the value <T>'Machine_Radix1 - <T>'Model_Mantissa.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
66.a
Discussion: In most implementations, this attribute yields the
absolute value of the difference between one and the smallest
- machine number of the type T above one which, when added to
+ machine number of the type <T> above one which, when added to
one, yields a machine number different from one. Further
discussion can be found in *note G.2.2::.
67
S'Model_Small
- Yields the value T'Machine_RadixT'Model_Emin - 1. The
- value of this attribute is of the type universal_real.
+ Yields the value <T>'Machine_Radix<T>'Model_Emin - 1.
+ The value of this attribute is of the type
+ <universal_real>.
67.a
Discussion: In most implementations, this attribute yields the
- smallest positive normalized number of the type T, i.e. the
+ smallest positive normalized number of the type <T>, i.e. the
number corresponding to the positive underflow threshold. In
some implementations employing a radix-complement
- representation for the type T, the positive underflow
+ representation for the type <T>, the positive underflow
threshold is closer to zero than is the negative underflow
threshold, with the consequence that the smallest positive
normalized number does not coincide with the positive
@@ -77603,8 +77875,8 @@ S'Model
specification:
69
- function S'Model (X : T)
- return T
+ function S'Model (<X> : <T>)
+ return <T>
70
If the Numerics Annex is not supported, the meaning of
@@ -77615,22 +77887,22 @@ S'Model
71
S'Safe_First
Yields the lower bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
72
S'Safe_Last
Yields the upper bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
72.a
Discussion: A predefined floating point arithmetic operation
@@ -77694,8 +77966,8 @@ S'Safe_Last
_Extensions to Ada 95_
72.i/2
- {AI95-00388-01AI95-00388-01} The Machine_Rounding attribute is
- new.
+ {<AI95-00388-01AI95-00388-01>} The Machine_Rounding attribute
+ is new.
File: aarm2012.info, Node: A.5.4, Prev: A.5.3, Up: A.5
@@ -77706,20 +77978,20 @@ A.5.4 Attributes of Fixed Point Types
_Static Semantics_
1
-The following representation-oriented attributes are defined for every
-subtype S of a fixed point type T.
+The following <representation-oriented> attributes are defined for every
+subtype S of a fixed point type <T>.
2
S'Machine_Radix
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>.
3
S'Machine_Rounds
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean.
@@ -77728,7 +78000,7 @@ S'Machine_Overflows
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean.
_Incompatibilities With Ada 83_
@@ -77757,7 +78029,7 @@ A.6 Input-Output
================
1/2
-{AI95-00285-01AI95-00285-01} [ Input-output is provided through
+{<AI95-00285-01AI95-00285-01>} [ Input-output is provided through
language-defined packages, each of which is a child of the root package
Ada. The generic packages Sequential_IO and Direct_IO define
input-output operations applicable to files containing elements of a
@@ -77795,7 +78067,7 @@ by the predefined input-output packages.]
_Wording Changes from Ada 95_
1.d/2
- {AI95-00285-01AI95-00285-01} Included package
+ {<AI95-00285-01AI95-00285-01>} Included package
Wide_Wide_Text_IO in this description.
@@ -77808,21 +78080,21 @@ A.7 External Files and File Objects
1
Values input from the external environment of the program, or output to
-the external environment, are considered to occupy external files. An
+the external environment, are considered to occupy <external files>. An
external file can be anything external to the program that can produce a
value to be read or receive a value to be written. An external file is
-identified by a string (the name). A second string (the form) gives
+identified by a string (the <name>). A second string (the <form>) gives
further system-dependent characteristics that may be associated with the
file, such as the physical organization or access rights. The
conventions governing the interpretation of such strings shall be
documented.
2/3
-{AI05-0299-1AI05-0299-1} Input and output operations are expressed as
-operations on objects of some file type, rather than directly in terms
-of the external files. In the remainder of this clause, the term file
-is always used to refer to a file object; the term external file is used
-otherwise.
+{<AI05-0299-1AI05-0299-1>} Input and output operations are expressed as
+operations on objects of some <file type>, rather than directly in terms
+of the external files. In the remainder of this clause, the term <file>
+is always used to refer to a file object; the term <external file> is
+used otherwise.
3
Input-output for sequential files of values of a single element type is
@@ -77835,7 +78107,7 @@ elements, as well as the operations applicable to these
files, such as
the Open, Read, and Write procedures.
4/2
-{AI95-00285-01AI95-00285-01} Input-output for direct access files is
+{<AI95-00285-01AI95-00285-01>} Input-output for direct access files is
likewise defined by a generic package called Direct_IO. Input-output in
human-readable form is defined by the (nongeneric) packages Text_IO for
Character and String data, Wide_Text_IO for Wide_Character and
@@ -77847,21 +78119,21 @@ means of the (nongeneric) package Streams.Stream_IO.
5
Before input or output operations can be performed on a file, the file
first has to be associated with an external file. While such an
-association is in effect, the file is said to be open, and otherwise the
-file is said to be closed.
+association is in effect, the file is said to be <open>, and otherwise
+the file is said to be <closed>.
6
The language does not define what happens to external files after the
completion of the main program and all the library tasks (in particular,
-if corresponding files have not been closed). The effect of input-output
-for access types is unspecified.
+if corresponding files have not been closed). The effect of
+input-output for access types is unspecified.
7
-An open file has a current mode, which is a value of one of the
+An open file has a <current mode>, which is a value of one of the
following enumeration types:
8
- type File_Mode is (In_File, Inout_File, Out_File); -- for Direct_IO
+ type File_Mode is (In_File, Inout_File, Out_File); --< for Direct_IO>
9
These values correspond respectively to the cases where only
@@ -77869,8 +78141,8 @@ following enumeration types:
performed.
10/2
- {AI95-00285-01AI95-00285-01} type File_Mode is (In_File, Out_File,
Append_File);
- -- for Sequential_IO, Text_IO, Wide_Text_IO, Wide_Wide_Text_IO, and
Stream_IO
+ {<AI95-00285-01AI95-00285-01>} type File_Mode is (In_File, Out_File,
Append_File);
+ --< for Sequential_IO, Text_IO, Wide_Text_IO, Wide_Wide_Text_IO, and
Stream_IO>
11
These values correspond respectively to the cases where only
@@ -77880,24 +78152,24 @@ following enumeration types:
The mode of a file can be changed.
13/2
-{AI95-00285-01AI95-00285-01} Several file management operations are
+{<AI95-00285-01AI95-00285-01>} Several file management operations are
common to Sequential_IO, Direct_IO, Text_IO, Wide_Text_IO, and
Wide_Wide_Text_IO. These operations are described in subclause *note
A.8.2:: for sequential and direct files. Any additional effects
concerning text input-output are described in subclause *note A.10.2::.
14/3
-{AI05-0299-1AI05-0299-1} The exceptions that can be propagated by the
+{<AI05-0299-1AI05-0299-1>} The exceptions that can be propagated by the
execution of an input-output subprogram are defined in the package
IO_Exceptions; the situations in which they can be propagated are
described following the description of the subprogram (and in subclause
-*note A.13::). The exceptions Storage_Error and Program_Error may be
+*note A.13::). The exceptions Storage_Error and Program_Error may be
propagated. (Program_Error can only be propagated due to errors made by
the caller of the subprogram.) Finally, exceptions can be propagated in
certain implementation-defined situations.
14.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
14.b/2
Discussion: The last sentence here is referring to the
@@ -77908,9 +78180,9 @@ certain implementation-defined situations.
NOTES
15/2
- 23 {AI95-00285-01AI95-00285-01} Each instantiation of the generic
- packages Sequential_IO and Direct_IO declares a different type
- File_Type. In the case of Text_IO, Wide_Text_IO,
+ 23 {<AI95-00285-01AI95-00285-01>} Each instantiation of the
+ generic packages Sequential_IO and Direct_IO declares a different
+ type File_Type. In the case of Text_IO, Wide_Text_IO,
Wide_Wide_Text_IO, and Streams.Stream_IO, the corresponding type
File_Type is unique.
@@ -77923,7 +78195,7 @@ certain implementation-defined situations.
_Wording Changes from Ada 95_
16.a/2
- {AI95-00285-01AI95-00285-01} Included package
+ {<AI95-00285-01AI95-00285-01>} Included package
Wide_Wide_Text_IO in this description.
@@ -77935,13 +78207,13 @@ A.8 Sequential and Direct Files
_Static Semantics_
1/2
-{AI95-00283-01AI95-00283-01} Two kinds of access to external files are
-defined in this subclause: sequential access and direct access. The
+{<AI95-00283-01AI95-00283-01>} Two kinds of access to external files are
+defined in this subclause: <sequential access> and <direct access>. The
corresponding file types and the associated operations are provided by
the generic packages Sequential_IO and Direct_IO. A file object to be
-used for sequential access is called a sequential file, and one to be
-used for direct access is called a direct file. Access to stream files
-is described in *note A.12.1::.
+used for sequential access is called a <sequential file>, and one to be
+used for direct access is called a <direct file>. Access to <stream
+file>s is described in *note A.12.1::.
2
For sequential access, the file is viewed as a sequence of values that
@@ -77981,22 +78253,22 @@ transfer to the file starts after the last element of
the file.
For direct access, the file is viewed as a set of elements occupying
consecutive positions in linear order; a value can be transferred to or
from an element of the file at any selected position. The position of
-an element is specified by its index, which is a number, greater than
+an element is specified by its <index>, which is a number, greater than
zero, of the implementation-defined integer type Count. The first
element, if any, has index one; the index of the last element, if any,
-is called the current size; the current size is zero if there are no
+is called the <current size>; the current size is zero if there are no
elements. The current size is a property of the external file.
4
-An open direct file has a current index, which is the index that will be
-used by the next read or write operation. When a direct file is opened,
-the current index is set to one. The current index of a direct file is
-a property of a file object, not of an external file.
+An open direct file has a <current index>, which is the index that will
+be used by the next read or write operation. When a direct file is
+opened, the current index is set to one. The current index of a direct
+file is a property of a file object, not of an external file.
_Wording Changes from Ada 95_
4.a/2
- {AI95-00283-01AI95-00283-01} Italicized "stream file" to
+ {<AI95-00283-01AI95-00283-01>} Italicized "stream file" to
clarify that this is another kind of file.
* Menu:
@@ -78031,7 +78303,7 @@ The generic library package Sequential_IO has the
following declaration:
type File_Mode is (In_File, Out_File, Append_File);
5
- -- File management
+ <-- File management>
6
procedure Create(File : in out File_Type;
@@ -78060,10 +78332,10 @@ The generic library package Sequential_IO has the
following declaration:
function Is_Open(File : in File_Type) return Boolean;
10.1/4
- {AI12-0130-1AI12-0130-1} procedure Flush (File : in File_Type);
+ {<AI12-0130-1AI12-0130-1>} procedure Flush (File : in File_Type);
11
- -- Input and output operations
+ --< Input and output operations>
12
procedure Read (File : in File_Type; Item : out Element_Type);
@@ -78073,7 +78345,7 @@ The generic library package Sequential_IO has the
following declaration:
function End_Of_File(File : in File_Type) return Boolean;
14
- -- Exceptions
+ --< Exceptions>
15
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -78086,12 +78358,12 @@ The generic library package Sequential_IO has the
following declaration:
16
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Sequential_IO;
17/2
-{AI95-00360-01AI95-00360-01} The type File_Type needs finalization (see
-*note 7.6::) in every instantiation of Sequential_IO.
+{<AI95-00360-01AI95-00360-01>} The type File_Type needs finalization
+(see *note 7.6::) in every instantiation of Sequential_IO.
_Incompatibilities With Ada 83_
@@ -78103,13 +78375,13 @@ The generic library package Sequential_IO has the
following declaration:
different effect in Ada 95.
17.a.1/2
- This paragraph was deleted.{8652/00978652/0097}
- {AI95-00115-01AI95-00115-01} {AI95-00344-01AI95-00344-01}
+ <This paragraph was deleted.>{<8652/00978652/0097>}
+ {<AI95-00115-01AI95-00115-01>} {<AI95-00344-01AI95-00344-01>}
_Incompatibilities With Ada 95_
17.b/2
- {AI95-00360-01AI95-00360-01} Amendment Correction: File_Type
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction: File_Type
in an instance of Sequential_IO is defined to need
finalization. If the restriction No_Nested_Finalization (see
*note D.7::) applies to the partition, and File_Type does not
@@ -78122,7 +78394,7 @@ The generic library package Sequential_IO has the
following declaration:
_Incompatibilities With Ada 2012_
17.c/4
- {AI12-0130-1AI12-0130-1} Corrigendum: The Flush procedure is
+ {<AI12-0130-1AI12-0130-1>} Corrigendum: The Flush procedure is
newly added to Ada.Sequential_IO. If an instance of
Ada.Sequential_IO is referenced in a use_clause, and a
procedure Flush is defined in some other package that is also
@@ -78147,23 +78419,23 @@ additional effects described in subclause *note
A.10.2::.
2
procedure Create(File : in out File_Type;
- Mode : in File_Mode := default_mode;
+ Mode : in File_Mode := <default_mode>;
Name : in String := "";
Form : in String := "");
3/2
- {AI95-00283-01AI95-00283-01} Establishes a new external file,
- with the given name and form, and associates this external
- file with the given file. The given file is left open. The
- current mode of the given file is set to the given access
- mode. The default access mode is the mode Out_File for
+ {<AI95-00283-01AI95-00283-01>} Establishes a new external
+ file, with the given name and form, and associates this
+ external file with the given file. The given file is left
+ open. The current mode of the given file is set to the given
+ access mode. The default access mode is the mode Out_File for
sequential, stream, and text input-output; it is the mode
Inout_File for direct input-output. For direct access, the
size of the created file is implementation defined.
3.a/4
- Ramification: {AI12-0005-1AI12-0005-1} For a direct file, the
- initial value of current index is 1 (see *note A.8::).
+ Ramification: {<AI12-0005-1AI12-0005-1>} For a direct file,
+ the initial value of current index is 1 (see *note A.8::).
4
A null string for Name specifies an external file that is not
@@ -78194,8 +78466,8 @@ additional effects described in subclause *note
A.10.2::.
open.
7.a/4
- Ramification: {AI12-0005-1AI12-0005-1} For a direct file, the
- initial value of current index is 1 (see *note A.8::).
+ Ramification: {<AI12-0005-1AI12-0005-1>} For a direct file,
+ the initial value of current index is 1 (see *note A.8::).
8
The exception Status_Error is propagated if the given file is
@@ -78244,7 +78516,7 @@ additional effects described in subclause *note
A.10.2::.
procedure Reset(File : in out File_Type);
16/2
- {AI95-00085-01AI95-00085-01} Resets the given file so that
+ {<AI95-00085-01AI95-00085-01>} Resets the given file so that
reading from its elements can be restarted from the beginning
of the external file (for modes In_File and Inout_File), and
so that writing to its elements can be restarted at the
@@ -78283,12 +78555,12 @@ additional effects described in subclause *note
A.10.2::.
function Name(File : in File_Type) return String;
22/2
- {AI95-00248-01AI95-00248-01} Returns a string which uniquely
+ {<AI95-00248-01AI95-00248-01>} Returns a string which uniquely
identifies the external file currently associated with the
given file (and may thus be used in an Open operation).
22.a/2
- Discussion: {AI95-00248-01AI95-00248-01} Retrieving the full
+ Discussion: {<AI95-00248-01AI95-00248-01>} Retrieving the full
path can be accomplished by passing the result of Name to
Directories.Full_Name (see *note A.16::). It is important to
drop the requirement on Name, as the only way to accomplish
@@ -78323,12 +78595,12 @@ additional effects described in subclause *note
A.10.2::.
function Is_Open(File : in File_Type) return Boolean;
28/3
- {AI05-0264-1AI05-0264-1} Returns True if the file is open
+ {<AI05-0264-1AI05-0264-1>} Returns True if the file is open
(that is, if it is associated with an external file);
otherwise, returns False.
28.1/4
- {AI12-0130-1AI12-0130-1} procedure Flush(File : in File_Type);
+ {<AI12-0130-1AI12-0130-1>} procedure Flush(File : in File_Type);
28.2/4
The Flush procedure synchronizes the external file with the
@@ -78353,26 +78625,26 @@ restriction should be documented.
_Wording Changes from Ada 95_
29.a/2
- {AI95-00085-01AI95-00085-01} Clarified that Reset affects and
- depends on the external file.
+ {<AI95-00085-01AI95-00085-01>} Clarified that Reset affects
+ and depends on the external file.
29.b/2
- {AI95-00248-01AI95-00248-01} Removed the requirement for Name
- to return a full path; this is now accomplished by
+ {<AI95-00248-01AI95-00248-01>} Removed the requirement for
+ Name to return a full path; this is now accomplished by
Directories.Full_Name(Name(File)) (see *note A.16::). This is
not documented as an inconsistency, because there is no
requirement for implementations to change -- the Ada 95
behavior is still allowed, it just is no longer required.
29.c/2
- {AI95-00283-01AI95-00283-01} Added text to specify the default
- mode for a stream file.
+ {<AI95-00283-01AI95-00283-01>} Added text to specify the
+ default mode for a stream file.
_Wording Changes from Ada 2012_
29.d/4
- {AI12-0130-1AI12-0130-1} Procedure Flush is now defined here,
- so it can be used for all of the I/O packages.
+ {<AI12-0130-1AI12-0130-1>} Procedure Flush is now defined
+ here, so it can be used for all of the I/O packages.
File: aarm2012.info, Node: A.8.3, Next: A.8.4, Prev: A.8.2, Up: A.8
@@ -78447,7 +78719,7 @@ these operations is attempted for a file that is not
open.
function End_Of_File(File : in File_Type) return Boolean;
9/3
- {AI05-0264-1AI05-0264-1} Operates on a file of mode In_File.
+ {<AI05-0264-1AI05-0264-1>} Operates on a file of mode In_File.
Returns True if no more elements can be read from the given
file; otherwise, returns False.
@@ -78477,11 +78749,11 @@ The generic library package Direct_IO has the
following declaration:
4
type File_Mode is (In_File, Inout_File, Out_File);
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
5
- -- File management
+ --< File management>
6
procedure Create(File : in out File_Type;
@@ -78510,10 +78782,10 @@ The generic library package Direct_IO has the
following declaration:
function Is_Open(File : in File_Type) return Boolean;
10.1/4
- {AI12-0130-1AI12-0130-1} procedure Flush (File : in File_Type);
+ {<AI12-0130-1AI12-0130-1>} procedure Flush (File : in File_Type);
11
- -- Input and output operations
+ --< Input and output operations>
12
procedure Read (File : in File_Type; Item : out Element_Type;
@@ -78536,7 +78808,7 @@ The generic library package Direct_IO has the following
declaration:
function End_Of_File(File : in File_Type) return Boolean;
17
- -- Exceptions
+ --< Exceptions>
18
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -78549,7 +78821,7 @@ The generic library package Direct_IO has the following
declaration:
19
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Direct_IO;
19.a
@@ -78559,17 +78831,17 @@ The generic library package Direct_IO has the
following declaration:
uninitialized variables of the type.
20/2
-{AI95-00360-01AI95-00360-01} The type File_Type needs finalization (see
-*note 7.6::) in every instantiation of Direct_IO.
+{<AI95-00360-01AI95-00360-01>} The type File_Type needs finalization
+(see *note 7.6::) in every instantiation of Direct_IO.
20.a.1/2
- This paragraph was deleted.{8652/00978652/0097}
- {AI95-00115-01AI95-00115-01} {AI95-00344-01AI95-00344-01}
+ <This paragraph was deleted.>{<8652/00978652/0097>}
+ {<AI95-00115-01AI95-00115-01>} {<AI95-00344-01AI95-00344-01>}
_Incompatibilities With Ada 95_
20.a/2
- {AI95-00360-01AI95-00360-01} Amendment Correction: File_Type
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction: File_Type
in an instance of Direct_IO is defined to need finalization.
If the restriction No_Nested_Finalization (see *note D.7::)
applies to the partition, and File_Type does not have a
@@ -78581,7 +78853,7 @@ The generic library package Direct_IO has the following
declaration:
_Incompatibilities With Ada 2012_
20.b/4
- {AI12-0130-1AI12-0130-1} Corrigendum: The Flush procedure is
+ {<AI12-0130-1AI12-0130-1>} Corrigendum: The Flush procedure is
newly added to Ada.Direct_IO. If an instance of Ada.Direct_IO
is referenced in a use_clause, and a procedure Flush is
defined in some other package that is also referenced in a
@@ -78669,8 +78941,8 @@ these operations is attempted for a file that is not
open.
function End_Of_File(File : in File_Type) return Boolean;
15/3
- {AI05-0264-1AI05-0264-1} Operates on a file of mode In_File or
- Inout_File. Returns True if the current index exceeds the
+ {<AI05-0264-1AI05-0264-1>} Operates on a file of mode In_File
+ or Inout_File. Returns True if the current index exceeds the
size of the external file; otherwise, returns False.
16
@@ -78723,12 +78995,12 @@ The generic library package Storage_IO has the
following declaration:
4
Buffer_Size : constant System.Storage_Elements.Storage_Count :=
- implementation-defined;
+ <implementation-defined>;
subtype Buffer_Type is
System.Storage_Elements.Storage_Array(1..Buffer_Size);
5
- -- Input and output operations
+ --< Input and output operations>
6
procedure Read (Buffer : in Buffer_Type; Item : out Element_Type);
@@ -78737,7 +79009,7 @@ The generic library package Storage_IO has the
following declaration:
procedure Write(Buffer : out Buffer_Type; Item : in Element_Type);
8
- -- Exceptions
+ --< Exceptions>
9
Data_Error : exception renames IO_Exceptions.Data_Error;
@@ -78777,7 +79049,7 @@ file.
_Extensions to Ada 83_
11.a/3
- {AI05-0005-1AI05-0005-1} Storage_IO is new in Ada 95.
+ {<AI05-0005-1AI05-0005-1>} Storage_IO is new in Ada 95.
File: aarm2012.info, Node: A.10, Next: A.11, Prev: A.9, Up: Annex A
@@ -78788,28 +79060,29 @@ A.10 Text Input-Output
_Static Semantics_
1/3
-{AI05-0299-1AI05-0299-1} This subclause describes the package Text_IO,
+{<AI05-0299-1AI05-0299-1>} This subclause describes the package Text_IO,
which provides facilities for input and output in human-readable form.
Each file is read or written sequentially, as a sequence of characters
grouped into lines, and as a sequence of lines grouped into pages. The
specification of the package is given below in subclause *note A.10.1::.
2/3
-{AI05-0299-1AI05-0299-1} The facilities for file management given above,
-in subclauses *note A.8.2:: and *note A.8.3::, are available for text
-input-output. In place of Read and Write, however, there are procedures
-Get and Put that input values of suitable types from text files, and
-output values to them. These values are provided to the Put procedures,
-and returned by the Get procedures, in a parameter Item. Several
-overloaded procedures of these names exist, for different types of Item.
-These Get procedures analyze the input sequences of characters based on
-lexical elements (see Clause *note 2::) and return the corresponding
-values; the Put procedures output the given values as appropriate
-lexical elements. Procedures Get and Put are also available that input
-and output individual characters treated as character values rather than
-as lexical elements. Related to character input are procedures to look
-ahead at the next character without reading it, and to read a character
-"immediately" without waiting for an end-of-line to signal availability.
+{<AI05-0299-1AI05-0299-1>} The facilities for file management given
+above, in subclauses *note A.8.2:: and *note A.8.3::, are available for
+text input-output. In place of Read and Write, however, there are
+procedures Get and Put that input values of suitable types from text
+files, and output values to them. These values are provided to the Put
+procedures, and returned by the Get procedures, in a parameter Item.
+Several overloaded procedures of these names exist, for different types
+of Item. These Get procedures analyze the input sequences of characters
+based on lexical elements (see Clause *note 2::) and return the
+corresponding values; the Put procedures output the given values as
+appropriate lexical elements. Procedures Get and Put are also available
+that input and output individual characters treated as character values
+rather than as lexical elements. Related to character input are
+procedures to look ahead at the next character without reading it, and
+to read a character "immediately" without waiting for an end-of-line to
+signal availability.
3
In addition to the procedures Get and Put for numeric and enumeration
@@ -78838,10 +79111,10 @@ and the current default output file.
standard input, standard output, and standard error files.
5.a.1/1
- Implementation Note: {8652/01138652/0113}
- {AI95-00087-01AI95-00087-01} The default input file and
+ Implementation Note: {<8652/01138652/0113>}
+ {<AI95-00087-01AI95-00087-01>} The default input file and
default output file are not the names of distinct file
- objects, but rather the role played by one or more (other)
+ objects, but rather the <role> played by one or more (other)
file object(s). Thus, they generally will be implemented as
accesses to another file object. An implementation that
implements them by copying them is incorrect.
@@ -78856,14 +79129,14 @@ provided to change the current default error file.
7
From a logical point of view, a text file is a sequence of pages, a page
is a sequence of lines, and a line is a sequence of characters; the end
-of a line is marked by a line terminator; the end of a page is marked by
-the combination of a line terminator immediately followed by a page
-terminator; and the end of a file is marked by the combination of a line
-terminator immediately followed by a page terminator and then a file
-terminator. Terminators are generated during output; either by calls of
-procedures provided expressly for that purpose; or implicitly as part of
-other operations, for example, when a bounded line length, a bounded
-page length, or both, have been specified for a file.
+of a line is marked by a <line terminator>; the end of a page is marked
+by the combination of a line terminator immediately followed by a <page
+terminator>; and the end of a file is marked by the combination of a
+line terminator immediately followed by a page terminator and then a
+<file terminator>. Terminators are generated during output; either by
+calls of procedures provided expressly for that purpose; or implicitly
+as part of other operations, for example, when a bounded line length, a
+bounded page length, or both, have been specified for a file.
8
The actual nature of terminators is not defined by the language and
@@ -78874,11 +79147,11 @@ characters. Whether they are characters (and if so
which ones) in any
particular implementation need not concern a user who neither explicitly
outputs nor explicitly inputs control characters. The effect of input
(Get) or output (Put) of control characters (other than horizontal
-tabulation) is not specified by the language.
+tabulation) is not specified by the language.
9
The characters of a line are numbered, starting from one; the number of
-a character is called its column number. For a line terminator, a
+a character is called its <column number>. For a line terminator, a
column number is also defined: it is one more than the number of
characters in the line. The lines of a page, and the pages of a file,
are similarly numbered. The current column number is the column number
@@ -78889,13 +79162,13 @@ subtype Positive_Count of the type Count (by
convention, the value zero
of the type Count is used to indicate special conditions).
10
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
11
-For an output file or an append file, a maximum line length can be
-specified and a maximum page length can be specified. If a value to be
-output cannot fit on the current line, for a specified maximum line
+For an output file or an append file, a <maximum line length> can be
+specified and a <maximum page length> can be specified. If a value to
+be output cannot fit on the current line, for a specified maximum line
length, then a new line is automatically started before the value is
output; if, further, this new line cannot fit on the current page, for a
specified maximum page length, then a new page is automatically started
@@ -78949,19 +79222,19 @@ The library package Text_IO has the following
declaration:
type File_Mode is (In_File, Out_File, Append_File);
5
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
- Unbounded : constant Count := 0; -- line and page length
+ Unbounded : constant Count := 0; --< line and page length>
6
- subtype Field is Integer range 0 .. implementation-defined;
+ subtype Field is Integer range 0 .. <implementation-defined>;
subtype Number_Base is Integer range 2 .. 16;
7
type Type_Set is (Lower_Case, Upper_Case);
8
- -- File Management
+ --< File Management>
9
procedure Create (File : in out File_Type;
@@ -78990,7 +79263,7 @@ The library package Text_IO has the following
declaration:
function Is_Open(File : in File_Type) return Boolean;
14
- -- Control of default input and output files
+ --< Control of default input and output files>
15
procedure Set_Input (File : in File_Type);
@@ -79021,12 +79294,12 @@ The library package Text_IO has the following
declaration:
function Current_Error return File_Access;
21/1
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} --Buffer control
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>} --<Buffer control>
procedure Flush (File : in File_Type);
procedure Flush;
22
- -- Specification of line and page lengths
+ --< Specification of line and page lengths>
23
procedure Set_Line_Length(File : in File_Type; To : in Count);
@@ -79045,7 +79318,7 @@ The library package Text_IO has the following
declaration:
function Page_Length return Count;
27
- -- Column, Line, and Page Control
+ --< Column, Line, and Page Control>
28
procedure New_Line (File : in File_Type;
@@ -79098,7 +79371,7 @@ The library package Text_IO has the following
declaration:
function Page return Positive_Count;
40
- -- Character Input-Output
+ --< Character Input-Output>
41
procedure Get(File : in File_Type; Item : out Character);
@@ -79128,7 +79401,7 @@ The library package Text_IO has the following
declaration:
Available : out Boolean);
46
- -- String Input-Output
+ --< String Input-Output>
47
procedure Get(File : in File_Type; Item : out String);
@@ -79145,7 +79418,7 @@ The library package Text_IO has the following
declaration:
procedure Get_Line(Item : out String; Last : out Natural);
49.1/2
- {AI95-00301-01AI95-00301-01} function Get_Line(File : in File_Type)
return String;
+ {<AI95-00301-01AI95-00301-01>} function Get_Line(File : in File_Type)
return String;
function Get_Line return String;
50
@@ -79153,7 +79426,7 @@ The library package Text_IO has the following
declaration:
procedure Put_Line(Item : in String);
51
- -- Generic packages for Input-Output of Integer Types
+ --< Generic packages for Input-Output of Integer Types>
52
generic
@@ -79224,7 +79497,7 @@ The library package Text_IO has the following
declaration:
end Modular_IO;
62
- -- Generic packages for Input-Output of Real Types
+ --< Generic packages for Input-Output of Real Types>
63
generic
@@ -79341,7 +79614,7 @@ The library package Text_IO has the following
declaration:
end Decimal_IO;
78
- -- Generic package for Input-Output of Enumeration Types
+ --< Generic package for Input-Output of Enumeration Types>
79
generic
@@ -79376,7 +79649,7 @@ The library package Text_IO has the following
declaration:
end Enumeration_IO;
84
- -- Exceptions
+ --< Exceptions>
85
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -79388,12 +79661,12 @@ The library package Text_IO has the following
declaration:
Data_Error : exception renames IO_Exceptions.Data_Error;
Layout_Error : exception renames IO_Exceptions.Layout_Error;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Text_IO;
86/2
-{AI95-00360-01AI95-00360-01} The type File_Type needs finalization (see
-*note 7.6::).
+{<AI95-00360-01AI95-00360-01>} The type File_Type needs finalization
+(see *note 7.6::).
_Incompatibilities With Ada 83_
@@ -79411,7 +79684,7 @@ The library package Text_IO has the following
declaration:
_Incompatibilities With Ada 95_
86.c/2
- {AI95-00360-01AI95-00360-01} Amendment Correction:
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction:
Text_IO.File_Type is defined to need finalization. If the
restriction No_Nested_Finalization (see *note D.7::) applies
to the partition, and File_Type does not have a controlled
@@ -79423,12 +79696,12 @@ The library package Text_IO has the following
declaration:
_Wording Changes from Ada 95_
86.d/2
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} Corrigendum:
- Corrected the parameter mode of Flush; otherwise it could not
- be used on Standard_Output.
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>}
+ Corrigendum: Corrected the parameter mode of Flush; otherwise
+ it could not be used on Standard_Output.
86.e/2
- {AI95-00301-01AI95-00301-01} The Text_IO.Get_Line functions
+ {<AI95-00301-01AI95-00301-01>} The Text_IO.Get_Line functions
are new; they are described in *note A.10.7::, "*note A.10.7::
Input-Output of Characters and Strings".
@@ -79575,8 +79848,8 @@ application-dependent error-related text is to be
output.
function Standard_Error return File_Access;
12/1
- {8652/00528652/0052} {AI95-00194-01AI95-00194-01} Returns the
- standard error file (see *note A.10::), or an access value
+ {<8652/00528652/0052>} {<AI95-00194-01AI95-00194-01>} Returns
+ the standard error file (see *note A.10::), or an access value
designating the standard error file, respectively.
13
@@ -79609,17 +79882,17 @@ program execution are implementation defined.
designating the current default error file, respectively.
20/1
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} procedure Flush (File :
in File_Type);
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>} procedure Flush
(File : in File_Type);
procedure Flush;
21/4
- {AI12-0130-1AI12-0130-1} [The effect of Flush is the same as
+ {<AI12-0130-1AI12-0130-1>} [The effect of Flush is the same as
the corresponding subprogram in Sequential_IO (see *note
A.8.2::).] If File is not explicitly specified,
Current_Output is used.
21.a/4
- Discussion: {AI12-0052-1AI12-0052-1} For the purpose of
+ Discussion: {<AI12-0052-1AI12-0052-1>} For the purpose of
determining whether concurrent calls on text input-output
subprograms are required to perform as specified, subprograms
that implicitly operate on one of the default input-output
@@ -79634,20 +79907,20 @@ program execution are implementation defined.
_Erroneous Execution_
22/1
-{8652/00538652/0053} {AI95-00063-01AI95-00063-01} The execution of a
+{<8652/00538652/0053>} {<AI95-00063-01AI95-00063-01>} The execution of a
program is erroneous if it invokes an operation on a current default
input, default output, or default error file, and if the corresponding
file object is closed or no longer exists.
22.a.1/1
- Ramification: {8652/00538652/0053}
- {AI95-00063-01AI95-00063-01} Closing a default file, then
+ Ramification: {<8652/00538652/0053>}
+ {<AI95-00063-01AI95-00063-01>} Closing a default file, then
setting the default file to another open file before accessing
it is not erroneous.
23/1
-This paragraph was deleted.{8652/00538652/0053}
-{AI95-00063-01AI95-00063-01}
+<This paragraph was deleted.>{<8652/00538652/0053>}
+{<AI95-00063-01AI95-00063-01>}
NOTES
@@ -79664,25 +79937,26 @@ This paragraph was deleted.{8652/00538652/0053}
_Wording Changes from Ada 95_
25.a/2
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} Corrigendum:
- Corrected the parameter mode of Flush; otherwise it could not
- be used on Standard_Output.
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>}
+ Corrigendum: Corrected the parameter mode of Flush; otherwise
+ it could not be used on Standard_Output.
25.b/2
- {8652/00528652/0052} {AI95-00194-01AI95-00194-01} Corrigendum:
- Corrected Standard_Error so it refers to the correct file.
+ {<8652/00528652/0052>} {<AI95-00194-01AI95-00194-01>}
+ Corrigendum: Corrected Standard_Error so it refers to the
+ correct file.
25.c/2
- {8652/00538652/0053} {AI95-00063-01AI95-00063-01} Corrigendum:
- Clarified that execution is erroneous only when a closed
- default file is accessed.
+ {<8652/00538652/0053>} {<AI95-00063-01AI95-00063-01>}
+ Corrigendum: Clarified that execution is erroneous only when a
+ closed default file is accessed.
_Wording Changes from Ada 2012_
25.d/4
- {AI12-0130-1AI12-0130-1} Corrigendum: Moved the definition of
- Flush to *note A.8.2::, as all input-output packages now have
- it.
+ {<AI12-0130-1AI12-0130-1>} Corrigendum: Moved the definition
+ of Flush to *note A.8.2::, as all input-output packages now
+ have it.
File: aarm2012.info, Node: A.10.4, Next: A.10.5, Prev: A.10.3, Up: A.10
@@ -79829,7 +80103,7 @@ used is not open.
function End_Of_Line return Boolean;
13/3
- {AI05-0264-1AI05-0264-1} Operates on a file of mode In_File.
+ {<AI05-0264-1AI05-0264-1>} Operates on a file of mode In_File.
Returns True if a line terminator or a file terminator is
next; otherwise, returns False.
@@ -79874,7 +80148,7 @@ used is not open.
function End_Of_Page return Boolean;
22/3
- {AI05-0264-1AI05-0264-1} Operates on a file of mode In_File.
+ {<AI05-0264-1AI05-0264-1>} Operates on a file of mode In_File.
Returns True if the combination of a line terminator and a
page terminator is next, or if a file terminator is next;
otherwise, returns False.
@@ -79888,7 +80162,7 @@ used is not open.
function End_Of_File return Boolean;
25/3
- {AI05-0264-1AI05-0264-1} Operates on a file of mode In_File.
+ {<AI05-0264-1AI05-0264-1>} Operates on a file of mode In_File.
Returns True if a file terminator is next, or if the
combination of a line, a page, and a file terminator is next;
otherwise, returns False.
@@ -79954,9 +80228,9 @@ file is the current output file.
If the file mode is Out_File or Append_File:
37/3
- * {AI05-0038-1AI05-0038-1} If the value specified by To is
- greater than the current line number, has the effect of
- repeatedly calling New_Line (with a spacing of one),
+ * {<AI05-0038-1AI05-0038-1>} If the value specified by To
+ is greater than the current line number, has the effect
+ of repeatedly calling New_Line (with a spacing of one),
until the current line number equals the specified value.
If the value specified by To is equal to the current line
number, there is no effect. If the value specified by To
@@ -80036,7 +80310,7 @@ exception Layout_Error if the corresponding number
exceeds Count'Last.
_Inconsistencies With Ada 2005_
52.a/3
- {AI05-0038-1AI05-0038-1} Correction: Fixed a glitch in
+ {<AI05-0038-1AI05-0038-1>} Correction: Fixed a glitch in
Set_Line such that we could have called New_Line(0), which
would have to raise Constraint_Error. It's now defined to
work. The bug occurred in Ada 95 and Ada 2005. It's very
@@ -80084,19 +80358,19 @@ considerations apply to the procedures Get_Line,
Put_Line, and Set_Col.
4
Several Get and Put procedures, for numeric and enumeration types, have
-format parameters which specify field lengths; these parameters are of
+<format> parameters which specify field lengths; these parameters are of
the nonnegative subtype Field of the type Integer.
5/2
-{AI95-00223-01AI95-00223-01} Input-output of enumeration values uses the
-syntax of the corresponding lexical elements. Any Get procedure for an
-enumeration type begins by skipping any leading blanks, or line or page
-terminators. A blank is defined as a space or a horizontal tabulation
-character. Next, characters are input only so long as the sequence
-input is an initial sequence of an identifier or of a character literal
-(in particular, input ceases when a line terminator is encountered).
-The character or line terminator that causes input to cease remains
-available for subsequent input.
+{<AI95-00223-01AI95-00223-01>} Input-output of enumeration values uses
+the syntax of the corresponding lexical elements. Any Get procedure for
+an enumeration type begins by skipping any leading blanks, or line or
+page terminators. A <blank> is defined as a space or a horizontal
+tabulation character. Next, characters are input only so long as the
+sequence input is an initial sequence of an identifier or of a character
+literal (in particular, input ceases when a line terminator is
+encountered). The character or line terminator that causes input to
+cease remains available for subsequent input.
6
For a numeric type, the Get procedures have a format parameter called
@@ -80163,22 +80437,22 @@ transferred: they are shown only to reveal the layout
and spaces.
Get(N);
13
- -- Characters at input Sequence input Value of N
+ <-- Characters at input Sequence input Value of N>
- -- bb-12535b -12535 -12535
- -- bb12_535e1b 12_535e1 125350
- -- bb12_535e; 12_535e (none) Data_Error raised
+ <-- bb-12535b -12535 -12535>
+ <-- bb12_535e1b 12_535e1 125350>
+ <-- bb12_535e; 12_535e (none) Data_Error raised>
14
Example of overridden width parameter:
15
- Put(Item => -23, Width => 2); -- "-23"
+ Put(Item => -23, Width => 2); --< "-23">
_Wording Changes from Ada 95_
15.a/2
- {AI95-00223-01AI95-00223-01} Removed conflicting text
+ {<AI95-00223-01AI95-00223-01>} Removed conflicting text
describing the skipping of blanks for a Get procedure.
@@ -80224,14 +80498,14 @@ For an item of type Character the following
procedures are provided:
End_Of_Line : out Boolean);
8/3
- {AI05-0038-1AI05-0038-1} {AI05-0264-1AI05-0264-1} Status_Error
- is propagated if the file is not open. Mode_Error is
- propagated if the mode of the file is not In_File. Sets
- End_Of_Line to True if at end of line, including if at end of
- page or at end of file; in each of these cases the value of
- Item is not specified. Otherwise, End_Of_Line is set to False
- and Item is set to the next character (without consuming it)
- from the file.
+ {<AI05-0038-1AI05-0038-1>} {<AI05-0264-1AI05-0264-1>}
+ Status_Error is propagated if the file is not open.
+ Mode_Error is propagated if the mode of the file is not
+ In_File. Sets End_Of_Line to True if at end of line,
+ including if at end of page or at end of file; in each of
+ these cases the value of Item is not specified. Otherwise,
+ End_Of_Line is set to False and Item is set to the next
+ character (without consuming it) from the file.
9
procedure Get_Immediate(File : in File_Type;
@@ -80239,7 +80513,7 @@ For an item of type Character the following procedures
are provided:
procedure Get_Immediate(Item : out Character);
10/3
- {AI05-0038-1AI05-0038-1} Reads the next character, either
+ {<AI05-0038-1AI05-0038-1>} Reads the next character, either
control or graphic, from the specified File or the default
input file. Status_Error is propagated if the file is not
open. Mode_Error is propagated if the mode of the file is not
@@ -80255,19 +80529,19 @@ For an item of type Character the following
procedures are provided:
Available : out Boolean);
12/3
- {AI05-0038-1AI05-0038-1} If a character, either control or
+ {<AI05-0038-1AI05-0038-1>} If a character, either control or
graphic, is available from the specified File or the default
input file, then the character is read; Available is True and
Item contains the value of this character. If a character is
not available, then Available is False and the value of Item
- is not specified. Status_Error is propagated if the file is
+ is not specified. Status_Error is propagated if the file is
not open. Mode_Error is propagated if the mode of the file is
not In_File. End_Error is propagated if at the end of the
file. The current column, line and page numbers for the file
are not affected.
13/2
-{AI95-00301-01AI95-00301-01} For an item of type String the following
+{<AI95-00301-01AI95-00301-01>} For an item of type String the following
subprograms are provided:
14
@@ -80295,7 +80569,7 @@ subprograms are provided:
function Get_Line return String;
17.2/2
- {AI95-00301-01AI95-00301-01} Returns a result string
+ {<AI95-00301-01AI95-00301-01>} Returns a result string
constructed by reading successive characters from the
specified input file, and assigning them to successive
characters of the result string. The result string has a
@@ -80304,15 +80578,15 @@ subprograms are provided:
met; Skip_Line is then (in effect) called with a spacing of 1.
17.3/2
- {AI95-00301-01AI95-00301-01} Constraint_Error is raised if the
- length of the line exceeds Positive'Last; in this case, the
- line number and page number are unchanged, and the column
+ {<AI95-00301-01AI95-00301-01>} Constraint_Error is raised if
+ the length of the line exceeds Positive'Last; in this case,
+ the line number and page number are unchanged, and the column
number is unspecified but no less than it was before the call.
The exception End_Error is propagated if an attempt is made to
skip a file terminator.
17.a/2
- Ramification: {AI95-00301-01AI95-00301-01} Precisely what is
+ Ramification: {<AI95-00301-01AI95-00301-01>} Precisely what is
left in the file is unspecified if Constraint_Error is raised
because the line doesn't fit in a String; it should be
consistent with column number. This allows implementers to
@@ -80332,7 +80606,7 @@ subprograms are provided:
Reading stops if the end of the string is met. Reading also
stops if the end of the line is met before meeting the end of
the string; in this case Skip_Line is (in effect) called with
- a spacing of 1. The values of characters not assigned are not
+ a spacing of 1. The values of characters not assigned are not
specified.
20
@@ -80392,7 +80666,7 @@ Get_Immediate.
_Incompatibilities With Ada 95_
26.a/3
- {AI95-00301-01AI95-00301-01} {AI05-0005-1AI05-0005-1} The
+ {<AI95-00301-01AI95-00301-01>} {<AI05-0005-1AI05-0005-1>} The
Get_Line functions are added to Ada.Text_IO. If Ada.Text_IO is
referenced in a use_clause, and a function Get_Line is defined
in a package that is also referenced in a use_clause, the
@@ -80403,13 +80677,13 @@ Get_Immediate.
_Extensions to Ada 95_
26.b/2
- {AI95-00301-01AI95-00301-01} The Text_IO.Get_Line functions
+ {<AI95-00301-01AI95-00301-01>} The Text_IO.Get_Line functions
are new.
_Wording Changes from Ada 2005_
26.c/3
- {AI05-0038-1AI05-0038-1} Correction: Added missing wording
+ {<AI05-0038-1AI05-0038-1>} Correction: Added missing wording
about raising Status_Error to Look_Ahead and Get_Immediate.
@@ -80469,7 +80743,7 @@ The following procedures are provided:
corresponds to the sequence input.
10/3
- {AI05-0038-1AI05-0038-1} The exception Data_Error is
+ {<AI05-0038-1AI05-0038-1>} The exception Data_Error is
propagated if the sequence of characters read does not form a
legal integer literal or if the value obtained is not of the
subtype Num.
@@ -80548,25 +80822,25 @@ The nongeneric equivalent packages may, but need not,
be actual
instantiations of the generic package for the appropriate predefined
type.
-Paragraphs 24 and 25 were deleted.
+<Paragraphs 24 and 25 were deleted.>
_Examples_
26/3
- {AI05-0298-1AI05-0298-1} subtype Byte_Int is Integer range -127 .. 127;
+ {<AI05-0298-1AI05-0298-1>} subtype Byte_Int is Integer range -127 .. 127;
package Int_IO is new Integer_IO(Byte_Int); use Int_IO;
- -- default format used at instantiation,
- -- Default_Width = 4, Default_Base = 10
+ --< default format used at instantiation,>
+ --< Default_Width = 4, Default_Base = 10>
27
- Put(126); -- "b126"
- Put(-126, 7); -- "bbb-126"
- Put(126, Width => 13, Base => 2); -- "bbb2#1111110#"
+ Put(126); --< "b126">
+ Put(-126, 7); --< "bbb-126">
+ Put(126, Width => 13, Base => 2); --< "bbb2#1111110#">
_Inconsistencies With Ada 2005_
27.a/3
- {AI05-0038-1AI05-0038-1} Correction: Changed wording to make
+ {<AI05-0038-1AI05-0038-1>} Correction: Changed wording to make
Integer_IO and Modular_IO raise Data_Error in the same way
when the bounds of the subtype are exceeded. There is no
value to different behavior, and all surveyed compilers
@@ -80775,7 +81049,7 @@ An implementation may extend Get [and Put] for floating
point types to
support special values such as infinities and NaNs.
35.a/3
- Discussion: {AI05-0005-1AI05-0005-1} See also the similar
+ Discussion: {<AI05-0005-1AI05-0005-1>} See also the similar
permission for the Wide_Wide_Value, Wide_Value, and Value
attributes in *note 3.5::.
@@ -80815,19 +81089,19 @@ type.
_Examples_
40/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
41
package Real_IO is new Float_IO(Real); use Real_IO;
- -- default format used at instantiation, Default_Exp = 3
+ --< default format used at instantiation, Default_Exp = 3>
42
- X : Real := -123.4567; -- digits 8 (see *note 3.5.7::)
+ X : Real := -123.4567; --< digits 8 (see *note 3.5.7::)>
43
- Put(X); -- default format "-1.2345670E+02"
- Put(X, Fore => 5, Aft => 3, Exp => 2); -- "bbb-1.235E+2"
- Put(X, 5, 3, 0); -- "b-123.457"
+ Put(X); <-- default format> <"-1.2345670E+02">
+ Put(X, Fore => 5, Aft => 3, Exp => 2); <-- "bbb-1.235E+2">
+ Put(X, 5, 3, 0); <-- "b-123.457">
File: aarm2012.info, Node: A.10.10, Next: A.10.11, Prev: A.10.9, Up: A.10
@@ -80904,15 +81178,15 @@ The following procedures are provided:
modified by the Width and Set parameters.
11.a/3
- Discussion: {AI05-0005-1AI05-0005-1} For a character type, the
- literal might be a Wide_Wide_Character, Wide_Character, or a
- control character. Whatever Image does for these things is
+ Discussion: {<AI05-0005-1AI05-0005-1>} For a character type,
+ the literal might be a Wide_Wide_Character, Wide_Character, or
+ a control character. Whatever Image does for these things is
appropriate here, too.
11.b/3
- {AI05-0036-1AI05-0036-1} The "characters produced" defines the
- "characters to be output" in the sense of *note A.10.6::, so a
- result that cannot fit on any bounded line will raise
+ {<AI05-0036-1AI05-0036-1>} The "characters produced" defines
+ the "characters to be output" in the sense of *note A.10.6::,
+ so a result that cannot fit on any bounded line will raise
Layout_Error.
12
@@ -80934,7 +81208,7 @@ The following procedures are provided:
subtype Enum.
14.a/3
- To be honest: {AI05-0005-1AI05-0005-1} For a character type,
+ To be honest: {<AI05-0005-1AI05-0005-1>} For a character type,
it is permissible for the implementation to make Get do the
inverse of what Put does, in the case of wide and wide_wide
character_literals and control characters.
@@ -80950,7 +81224,7 @@ The following procedures are provided:
length of the given string as the value for Width.
17/1
-{8652/00548652/0054} {AI95-00007-01AI95-00007-01} Although the
+{<8652/00548652/0054>} {<AI95-00007-01AI95-00007-01>} Although the
specification of the generic package Enumeration_IO would allow
instantiation for an integer type, this is not the intended purpose of
this generic package, and the effect of such instantiations is not
@@ -80963,11 +81237,11 @@ defined by the language.
for enumeration values. Thus
19
- Ada.Text_IO.Put('A'); -- outputs the character A
+ Ada.Text_IO.Put('A'); --< outputs the character A>
20
package Char_IO is new Ada.Text_IO.Enumeration_IO(Character);
- Char_IO.Put('A'); -- outputs the character 'A', between
apostrophes
+ Char_IO.Put('A'); --< outputs the character 'A', between
apostrophes>
21
37 The type Boolean is an enumeration type, hence Enumeration_IO
@@ -80976,9 +81250,9 @@ defined by the language.
_Wording Changes from Ada 95_
21.a/2
- {8652/00548652/0054} {AI95-00007-01AI95-00007-01} Corrigendum:
- Corrected the wording to say Enumeration_IO can be
- instantiated with an integer type, not a float type.
+ {<8652/00548652/0054>} {<AI95-00007-01AI95-00007-01>}
+ Corrigendum: Corrected the wording to say Enumeration_IO can
+ be instantiated with an integer type, not a float type.
File: aarm2012.info, Node: A.10.11, Next: A.10.12, Prev: A.10.10, Up: A.10
@@ -80987,13 +81261,13 @@ A.10.11 Input-Output for Bounded Strings
----------------------------------------
1/2
-{AI95-00428-01AI95-00428-01} The package Text_IO.Bounded_IO provides
+{<AI95-00428-01AI95-00428-01>} The package Text_IO.Bounded_IO provides
input-output in human-readable form for Bounded_Strings.
_Static Semantics_
2/2
-{AI95-00428-01AI95-00428-01} The generic library package
+{<AI95-00428-01AI95-00428-01>} The generic library package
Text_IO.Bounded_IO has the following declaration:
3/2
@@ -81042,7 +81316,7 @@ Text_IO.Bounded_IO has the following declaration:
end Ada.Text_IO.Bounded_IO;
13/2
-{AI95-00428-01AI95-00428-01} For an item of type Bounded_String, the
+{<AI95-00428-01AI95-00428-01>} For an item of type Bounded_String, the
following subprograms are provided:
14/2
@@ -81051,15 +81325,15 @@ following subprograms are provided:
Item : in Bounded.Bounded_String);
15/2
- {AI95-00428-01AI95-00428-01} Equivalent to Text_IO.Put (File,
- Bounded.To_String(Item));
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Text_IO.Put
+ (File, Bounded.To_String(Item));
16/2
procedure Put
(Item : in Bounded.Bounded_String);
17/2
- {AI95-00428-01AI95-00428-01} Equivalent to Text_IO.Put
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Text_IO.Put
(Bounded.To_String(Item));
18/2
@@ -81068,7 +81342,7 @@ following subprograms are provided:
Item : in Bounded.Bounded_String);
19/2
- {AI95-00428-01AI95-00428-01} Equivalent to Text_IO.Put_Line
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Text_IO.Put_Line
(File, Bounded.To_String(Item));
20/2
@@ -81076,7 +81350,7 @@ following subprograms are provided:
(Item : in Bounded.Bounded_String);
21/2
- {AI95-00428-01AI95-00428-01} Equivalent to Text_IO.Put_Line
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Text_IO.Put_Line
(Bounded.To_String(Item));
22/2
@@ -81085,7 +81359,7 @@ following subprograms are provided:
return Bounded.Bounded_String;
23/2
- {AI95-00428-01AI95-00428-01} Returns
+ {<AI95-00428-01AI95-00428-01>} Returns
Bounded.To_Bounded_String(Text_IO.Get_Line(File));
24/2
@@ -81093,7 +81367,7 @@ following subprograms are provided:
return Bounded.Bounded_String;
25/2
- {AI95-00428-01AI95-00428-01} Returns
+ {<AI95-00428-01AI95-00428-01>} Returns
Bounded.To_Bounded_String(Text_IO.Get_Line);
26/2
@@ -81101,7 +81375,7 @@ following subprograms are provided:
(File : in File_Type; Item : out Bounded.Bounded_String);
27/2
- {AI95-00428-01AI95-00428-01} Equivalent to Item := Get_Line
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Item := Get_Line
(File);
28/2
@@ -81109,12 +81383,12 @@ following subprograms are provided:
(Item : out Bounded.Bounded_String);
29/2
- {AI95-00428-01AI95-00428-01} Equivalent to Item := Get_Line;
+ {<AI95-00428-01AI95-00428-01>} Equivalent to Item := Get_Line;
_Extensions to Ada 95_
29.a/2
- {AI95-00428-01AI95-00428-01} Package Text_IO.Bounded_IO is
+ {<AI95-00428-01AI95-00428-01>} Package Text_IO.Bounded_IO is
new.
@@ -81124,13 +81398,13 @@ A.10.12 Input-Output for Unbounded Strings
------------------------------------------
1/2
-{AI95-00301-01AI95-00301-01} The package Text_IO.Unbounded_IO provides
+{<AI95-00301-01AI95-00301-01>} The package Text_IO.Unbounded_IO provides
input-output in human-readable form for Unbounded_Strings.
_Static Semantics_
2/2
-{AI95-00301-01AI95-00301-01} The library package Text_IO.Unbounded_IO
+{<AI95-00301-01AI95-00301-01>} The library package Text_IO.Unbounded_IO
has the following declaration:
3/2
@@ -81176,7 +81450,7 @@ has the following declaration:
end Ada.Text_IO.Unbounded_IO;
13/2
-{AI95-00301-01AI95-00301-01} For an item of type Unbounded_String, the
+{<AI95-00301-01AI95-00301-01>} For an item of type Unbounded_String, the
following subprograms are provided:
14/2
@@ -81185,15 +81459,15 @@ following subprograms are provided:
Item : in Strings.Unbounded.Unbounded_String);
15/2
- {AI95-00301-01AI95-00301-01} Equivalent to Text_IO.Put (File,
- Strings.Unbounded.To_String(Item));
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Text_IO.Put
+ (File, Strings.Unbounded.To_String(Item));
16/2
procedure Put
(Item : in Strings.Unbounded.Unbounded_String);
17/2
- {AI95-00301-01AI95-00301-01} Equivalent to Text_IO.Put
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Text_IO.Put
(Strings.Unbounded.To_String(Item));
18/2
@@ -81202,7 +81476,7 @@ following subprograms are provided:
Item : in Strings.Unbounded.Unbounded_String);
19/2
- {AI95-00301-01AI95-00301-01} Equivalent to Text_IO.Put_Line
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Text_IO.Put_Line
(File, Strings.Unbounded.To_String(Item));
20/2
@@ -81210,7 +81484,7 @@ following subprograms are provided:
(Item : in Strings.Unbounded.Unbounded_String);
21/2
- {AI95-00301-01AI95-00301-01} Equivalent to Text_IO.Put_Line
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Text_IO.Put_Line
(Strings.Unbounded.To_String(Item));
22/2
@@ -81219,7 +81493,7 @@ following subprograms are provided:
return Strings.Unbounded.Unbounded_String;
23/2
- {AI95-00301-01AI95-00301-01} Returns
+ {<AI95-00301-01AI95-00301-01>} Returns
Strings.Unbounded.To_Unbounded_String(Text_IO.Get_Line(File));
24/2
@@ -81227,7 +81501,7 @@ following subprograms are provided:
return Strings.Unbounded.Unbounded_String;
25/2
- {AI95-00301-01AI95-00301-01} Returns
+ {<AI95-00301-01AI95-00301-01>} Returns
Strings.Unbounded.To_Unbounded_String(Text_IO.Get_Line);
26/2
@@ -81235,7 +81509,7 @@ following subprograms are provided:
(File : in File_Type; Item : out Strings.Unbounded.Unbounded_String);
27/2
- {AI95-00301-01AI95-00301-01} Equivalent to Item := Get_Line
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Item := Get_Line
(File);
28/2
@@ -81243,12 +81517,12 @@ following subprograms are provided:
(Item : out Strings.Unbounded.Unbounded_String);
29/2
- {AI95-00301-01AI95-00301-01} Equivalent to Item := Get_Line;
+ {<AI95-00301-01AI95-00301-01>} Equivalent to Item := Get_Line;
_Extensions to Ada 95_
29.a/2
- {AI95-00301-01AI95-00301-01} Package Text_IO.Unbounded_IO is
+ {<AI95-00301-01AI95-00301-01>} Package Text_IO.Unbounded_IO is
new.
@@ -81258,7 +81532,7 @@ A.11 Wide Text Input-Output and Wide Wide Text
Input-Output
===========================================================
1/2
-{AI95-00285-01AI95-00285-01} The packages Wide_Text_IO and
+{<AI95-00285-01AI95-00285-01>} The packages Wide_Text_IO and
Wide_Wide_Text_IO provide facilities for input and output in
human-readable form. Each file is read or written sequentially, as a
sequence of wide characters (or wide wide characters) grouped into
@@ -81267,7 +81541,7 @@ lines, and as a sequence of lines grouped into pages.
_Static Semantics_
2/2
-{AI95-00285-01AI95-00285-01} {AI95-00301-01AI95-00301-01} The
+{<AI95-00285-01AI95-00285-01>} {<AI95-00301-01AI95-00301-01>} The
specification of package Wide_Text_IO is the same as that for Text_IO,
except that in each Get, Look_Ahead, Get_Immediate, Get_Line, Put, and
Put_Line subprogram, any occurrence of Character is replaced by
@@ -81279,21 +81553,21 @@ Ada.Long_Integer_Wide_Text_IO, Ada.Float_Wide_Text_IO,
Ada.Long_Float_Wide_Text_IO.
3/2
-{AI95-00285-01AI95-00285-01} {AI95-00301-01AI95-00301-01} The
+{<AI95-00285-01AI95-00285-01>} {<AI95-00301-01AI95-00301-01>} The
specification of package Wide_Wide_Text_IO is the same as that for
Text_IO, except that in each Get, Look_Ahead, Get_Immediate, Get_Line,
Put, and Put_Line subprogram, any occurrence of Character is replaced by
Wide_Wide_Character, and any occurrence of String is replaced by
-Wide_Wide_String. Nongeneric equivalents of Wide_Wide_Text_IO.Integer_IO
-and Wide_Wide_Text_IO.Float_IO are provided (as for Text_IO) for each
-predefined numeric type, with names such as
+Wide_Wide_String. Nongeneric equivalents of
+Wide_Wide_Text_IO.Integer_IO and Wide_Wide_Text_IO.Float_IO are provided
+(as for Text_IO) for each predefined numeric type, with names such as
Ada.Integer_Wide_Wide_Text_IO, Ada.Long_Integer_Wide_Wide_Text_IO,
Ada.Float_Wide_Wide_Text_IO, Ada.Long_Float_Wide_Wide_Text_IO.
4/3
-{AI95-00285-01AI95-00285-01} {AI95-00428-01AI95-00428-01}
-{AI05-0004-1AI05-0004-1} {AI05-0092-1AI05-0092-1} The specification of
-package Wide_Text_IO.Wide_Bounded_IO is the same as that for
+{<AI95-00285-01AI95-00285-01>} {<AI95-00428-01AI95-00428-01>}
+{<AI05-0004-1AI05-0004-1>} {<AI05-0092-1AI05-0092-1>} The specification
+of package Wide_Text_IO.Wide_Bounded_IO is the same as that for
Text_IO.Bounded_IO, except that any occurrence of Bounded_String is
replaced by Bounded_Wide_String, and any occurrence of package Bounded
is replaced by Wide_Bounded. The specification of package
@@ -81303,13 +81577,13 @@ replaced by Bounded_Wide_Wide_String, and any
occurrence of package
Bounded is replaced by Wide_Wide_Bounded.
4.a/3
- To be honest: {AI05-0005-1AI05-0005-1} "package Bounded"
+ To be honest: {<AI05-0005-1AI05-0005-1>} "package Bounded"
refers to both the package Ada.Strings.Bounded and the formal
package parameter named Bounded.
5/3
-{AI95-00285-01AI95-00285-01} {AI95-00301-01AI95-00301-01}
-{AI05-0092-1AI05-0092-1} The specification of package
+{<AI95-00285-01AI95-00285-01>} {<AI95-00301-01AI95-00301-01>}
+{<AI05-0092-1AI05-0092-1>} The specification of package
Wide_Text_IO.Wide_Unbounded_IO is the same as that for
Text_IO.Unbounded_IO, except that any occurrence of Unbounded_String is
replaced by Unbounded_Wide_String, and any occurrence of package
@@ -81328,24 +81602,24 @@ Unbounded is replaced by Wide_Wide_Unbounded.
_Extensions to Ada 95_
5.b/2
- {AI95-00285-01AI95-00285-01} Package Wide_Wide_Text_IO is new.
- Be glad it wasn't called Double_Wide_Text_IO (for use in
+ {<AI95-00285-01AI95-00285-01>} Package Wide_Wide_Text_IO is
+ new. Be glad it wasn't called Double_Wide_Text_IO (for use in
trailer parks) or Really_Wide_Text_IO.
5.c/2
- {AI95-00301-01AI95-00301-01} Packages
+ {<AI95-00301-01AI95-00301-01>} Packages
Wide_Text_IO.Wide_Unbounded_IO and
Wide_Wide_Text_IO.Wide_Wide_Unbounded_IO are also new.
5.d/2
- {AI95-00428-01AI95-00428-01} Packages
+ {<AI95-00428-01AI95-00428-01>} Packages
Wide_Text_IO.Wide_Bounded_IO and
Wide_Wide_Text_IO.Wide_Wide_Bounded_IO are new as well.
_Wording Changes from Ada 2005_
5.e/3
- {AI05-0092-1AI05-0092-1} Correction: Corrected the names of
+ {<AI05-0092-1AI05-0092-1>} Correction: Corrected the names of
various entities in the above description. Since the
previously named entities don't exist and the intent is
obvious, this is just considered a presentation change.
@@ -81357,7 +81631,7 @@ A.12 Stream Input-Output
========================
1/2
-{AI95-00285-01AI95-00285-01} The packages Streams.Stream_IO,
+{<AI95-00285-01AI95-00285-01>} The packages Streams.Stream_IO,
Text_IO.Text_Streams, Wide_Text_IO.Text_Streams, and
Wide_Wide_Text_IO.Text_Streams provide stream-oriented operations on
files.
@@ -81365,7 +81639,7 @@ files.
_Wording Changes from Ada 95_
1.a/2
- {AI95-00285-01AI95-00285-01} Included package
+ {<AI95-00285-01AI95-00285-01>} Included package
Wide_Wide_Text_IO.Text_Streams in this description.
* Menu:
@@ -81395,7 +81669,7 @@ discussion of streams.
_Static Semantics_
1.1/1
-{8652/00558652/0055} {AI95-00026-01AI95-00026-01} The elements of a
+{<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} The elements of a
stream file are stream elements. If positioning is supported for the
specified external file, a current index and current size are maintained
for the file as described in *note A.8::. If positioning is not
@@ -81410,7 +81684,7 @@ implementation defined.
The library package Streams.Stream_IO has the following declaration:
3/3
- {AI05-0283-1AI05-0283-1} with Ada.IO_Exceptions;
+ {<AI05-0283-1AI05-0283-1>} with Ada.IO_Exceptions;
package Ada.Streams.Stream_IO is
pragma Preelaborate(Stream_IO);
@@ -81418,16 +81692,16 @@ The library package Streams.Stream_IO has the
following declaration:
type Stream_Access is access all Root_Stream_Type'Class;
5/4
- {AI12-0102-1AI12-0102-1} type File_Type is limited private;
+ {<AI12-0102-1AI12-0102-1>} type File_Type is limited private;
pragma Preelaborable_Initialization(File_Type);
6
type File_Mode is (In_File, Out_File, Append_File);
7
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
- -- Index into file, in stream elements.
+ -- <Index into file, in stream elements.>
8
procedure Create (File : in out File_Type;
@@ -81458,13 +81732,13 @@ The library package Streams.Stream_IO has the
following declaration:
13
function Stream (File : in File_Type) return Stream_Access;
- -- Return stream access for use with T'Input and T'Output
+ -- <Return stream access for use with T'Input and T'Output>
14/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
15
- -- Read array of stream elements from file
+ -- <Read array of stream elements from file>
procedure Read (File : in File_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset;
@@ -81476,10 +81750,10 @@ The library package Streams.Stream_IO has the
following declaration:
Last : out Stream_Element_Offset);
17/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
18
- -- Write array of stream elements into file
+ -- <Write array of stream elements into file>
procedure Write (File : in File_Type;
Item : in Stream_Element_Array;
To : in Positive_Count);
@@ -81489,10 +81763,10 @@ The library package Streams.Stream_IO has the
following declaration:
Item : in Stream_Element_Array);
20/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
21
- -- Operations on position within file
+ -- <Operations on position within file>
22
procedure Set_Index(File : in File_Type; To : in Positive_Count);
@@ -81505,10 +81779,10 @@ The library package Streams.Stream_IO has the
following declaration:
procedure Set_Mode(File : in out File_Type; Mode : in File_Mode);
25/1
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} procedure
Flush(File : in File_Type);
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>} procedure
Flush(File : in File_Type);
26
- -- exceptions
+ -- <exceptions>
Status_Error : exception renames IO_Exceptions.Status_Error;
Mode_Error : exception renames IO_Exceptions.Mode_Error;
Name_Error : exception renames IO_Exceptions.Name_Error;
@@ -81519,54 +81793,54 @@ The library package Streams.Stream_IO has the
following declaration:
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Streams.Stream_IO;
27.1/2
-{AI95-00360-01AI95-00360-01} The type File_Type needs finalization (see
-*note 7.6::).
+{<AI95-00360-01AI95-00360-01>} The type File_Type needs finalization
+(see *note 7.6::).
28/4
-{AI95-00283-01AI95-00283-01} {AI12-0130-1AI12-0130-1} The subprograms
-given in subclause *note A.8.2:: for the control of external files
-(Create, Open, Close, Delete, Reset, Mode, Name, Form, Is_Open, and
-Flush) are available for stream files.
+{<AI95-00283-01AI95-00283-01>} {<AI12-0130-1AI12-0130-1>} The
+subprograms given in subclause *note A.8.2:: for the control of external
+files (Create, Open, Close, Delete, Reset, Mode, Name, Form, Is_Open,
+and Flush) are available for stream files.
28.1/2
-{AI95-00283-01AI95-00283-01} The End_Of_File function:
+{<AI95-00283-01AI95-00283-01>} The End_Of_File function:
28.2/2
* Propagates Mode_Error if the mode of the file is not In_File;
28.3/3
- * {AI05-0264-1AI05-0264-1} If positioning is supported for the given
- external file, the function returns True if the current index
+ * {<AI05-0264-1AI05-0264-1>} If positioning is supported for the
+ given external file, the function returns True if the current index
exceeds the size of the external file; otherwise, it returns False;
28.4/3
- * {AI05-0264-1AI05-0264-1} If positioning is not supported for the
+ * {<AI05-0264-1AI05-0264-1>} If positioning is not supported for the
given external file, the function returns True if no more elements
can be read from the given file; otherwise, it returns False.
28.5/2
-{8652/00558652/0055} {AI95-00026-01AI95-00026-01}
-{AI95-00085-01AI95-00085-01} The Set_Mode procedure sets the mode of the
-file. If the new mode is Append_File, the file is positioned to its
+{<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>}
+{<AI95-00085-01AI95-00085-01>} The Set_Mode procedure sets the mode of
+the file. If the new mode is Append_File, the file is positioned to its
end; otherwise, the position in the file is unchanged.
28.6/4
-This paragraph was deleted.{8652/00558652/0055}
-{AI95-00026-01AI95-00026-01} {AI12-0130-1AI12-0130-1}
+<This paragraph was deleted.>{<8652/00558652/0055>}
+{<AI95-00026-01AI95-00026-01>} {<AI12-0130-1AI12-0130-1>}
29/1
-{8652/00568652/0056} {AI95-00001-01AI95-00001-01} The Stream function
-returns a Stream_Access result from a File_Type object, thus allowing
-the stream-oriented attributes Read, Write, Input, and Output to be used
-on the same file for multiple types. Stream propagates Status_Error if
-File is not open.
+{<8652/00568652/0056>} {<AI95-00001-01AI95-00001-01>} The Stream
+function returns a Stream_Access result from a File_Type object, thus
+allowing the stream-oriented attributes Read, Write, Input, and Output
+to be used on the same file for multiple types. Stream propagates
+Status_Error if File is not open.
30/2
-{AI95-00256-01AI95-00256-01} The procedures Read and Write are
+{<AI95-00256-01AI95-00256-01>} The procedures Read and Write are
equivalent to the corresponding operations in the package Streams. Read
propagates Mode_Error if the mode of File is not In_File. Write
propagates Mode_Error if the mode of File is not Out_File or
@@ -81578,49 +81852,49 @@ starts reading at the current index, and Write
without a Positive_Count
parameter starts writing at the current index.
30.1/1
-{8652/00558652/0055} {AI95-00026-01AI95-00026-01} The Size function
+{<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} The Size function
returns the current size of the file.
31/1
-{8652/00558652/0055} {AI95-00026-01AI95-00026-01} The Index function
+{<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} The Index function
returns the current index.
31.a/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
32
The Set_Index procedure sets the current index to the specified value.
32.1/1
-{8652/00558652/0055} {AI95-00026-01AI95-00026-01} If positioning is
+{<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} If positioning is
supported for the external file, the current index is maintained as
follows:
32.2/1
- * {8652/00558652/0055} {AI95-00026-01AI95-00026-01} For Open and
+ * {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} For Open and
Create, if the Mode parameter is Append_File, the current index is
set to the current size of the file plus one; otherwise, the
current index is set to one.
32.3/1
- * {8652/00558652/0055} {AI95-00026-01AI95-00026-01} For Reset, if the
- Mode parameter is Append_File, or no Mode parameter is given and
- the current mode is Append_File, the current index is set to the
- current size of the file plus one; otherwise, the current index is
- set to one.
+ * {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} For Reset, if
+ the Mode parameter is Append_File, or no Mode parameter is given
+ and the current mode is Append_File, the current index is set to
+ the current size of the file plus one; otherwise, the current index
+ is set to one.
32.4/1
- * {8652/00558652/0055} {AI95-00026-01AI95-00026-01} For Set_Mode, if
- the new mode is Append_File, the current index is set to current
+ * {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} For Set_Mode,
+ if the new mode is Append_File, the current index is set to current
size plus one; otherwise, the current index is unchanged.
32.5/1
- * {8652/00558652/0055} {AI95-00026-01AI95-00026-01} For Read and
+ * {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} For Read and
Write without a Positive_Count parameter, the current index is
incremented by the number of stream elements read or written.
32.6/1
- * {8652/00558652/0055} {AI95-00026-01AI95-00026-01} For Read and
+ * {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>} For Read and
Write with a Positive_Count parameter, the value of the current
index is set to the value of the Positive_Count parameter plus the
number of stream elements read or written.
@@ -81631,7 +81905,7 @@ or Set_Index propagates Use_Error. Similarly, a call
of Read or Write
with a Positive_Count parameter propagates Use_Error.
33.a/2
- Implementation Note: {AI95-00085-01AI95-00085-01} It is
+ Implementation Note: {<AI95-00085-01AI95-00085-01>} It is
permissible for an implementation to implement mode
Append_File using the Unix append mode (the O_APPEND bit).
Such an implementation does not support positioning when the
@@ -81646,12 +81920,12 @@ with a Positive_Count parameter propagates Use_Error.
semantics (that is, always write at the end, even when
explicitly commanded to write somewhere else).
-Paragraphs 34 through 36 were deleted.
+<Paragraphs 34 through 36 were deleted.>
_Erroneous Execution_
36.1/1
-{8652/00568652/0056} {AI95-00001-01AI95-00001-01} If the File_Type
+{<8652/00568652/0056>} {<AI95-00001-01AI95-00001-01>} If the File_Type
object passed to the Stream function is later closed or finalized, and
the stream-oriented attributes are subsequently called (explicitly or
implicitly) on the Stream_Access value returned by Stream, execution is
@@ -81669,7 +81943,7 @@ again after it had been closed.
_Inconsistencies With Ada 95_
36.a/3
- {AI95-00283-01AI95-00283-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00283-01AI95-00283-01>} {<AI05-0005-1AI05-0005-1>}
Amendment Correction: The description of the subprograms for
managing files was corrected so that they do not require
truncation of the external file -- a stream file is not a
@@ -81687,7 +81961,7 @@ again after it had been closed.
_Incompatibilities With Ada 95_
36.b/2
- {AI95-00360-01AI95-00360-01} Amendment Correction:
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction:
Stream_IO.File_Type is defined to need finalization. If the
restriction No_Nested_Finalization (see *note D.7::) applies
to the partition, and File_Type does not have a controlled
@@ -81699,40 +81973,40 @@ again after it had been closed.
_Wording Changes from Ada 95_
36.c/2
- {8652/00518652/0051} {AI95-00057-01AI95-00057-01} Corrigendum:
- Corrected the parameter mode of Flush; otherwise it could not
- be used on Standard_Output.
+ {<8652/00518652/0051>} {<AI95-00057-01AI95-00057-01>}
+ Corrigendum: Corrected the parameter mode of Flush; otherwise
+ it could not be used on Standard_Output.
36.d/2
- {8652/00558652/0055} {AI95-00026-01AI95-00026-01}
- {AI95-00256-01AI95-00256-01} Corrigendum: Added wording to
+ {<8652/00558652/0055>} {<AI95-00026-01AI95-00026-01>}
+ {<AI95-00256-01AI95-00256-01>} Corrigendum: Added wording to
describe the effects of the various operations on the current
index. The Amendment adds an explanation of the use of
current index for Read and Write.
36.e/2
- {8652/00568652/0056} {AI95-00001-01AI95-00001-01} Corrigendum:
- Clarified that Stream can raise Status_Error, and clarified
- that using a Stream_Access whose file has been closed is
- erroneous.
+ {<8652/00568652/0056>} {<AI95-00001-01AI95-00001-01>}
+ Corrigendum: Clarified that Stream can raise Status_Error, and
+ clarified that using a Stream_Access whose file has been
+ closed is erroneous.
36.f/2
- {AI95-00085-01AI95-00085-01} Clarified that Set_Mode can be
+ {<AI95-00085-01AI95-00085-01>} Clarified that Set_Mode can be
called with the current mode.
_Extensions to Ada 2005_
36.g/3
- {AI05-0283-1AI05-0283-1} Package Ada.Streams.Stream_IO is now
- preelaborated, allowing it to be used in more contexts
- (including in distributed systems). Note that it is not a
+ {<AI05-0283-1AI05-0283-1>} Package Ada.Streams.Stream_IO is
+ now preelaborated, allowing it to be used in more contexts
+ (including in distributed systems). Note that it is <not> a
remote types package; File_Type objects cannot be passed
between partitions.
_Extensions to Ada 2012_
36.h/4
- {AI12-0102-1AI12-0102-1} Corrigendum: Type
+ {<AI12-0102-1AI12-0102-1>} Corrigendum: Type
Ada.Streams.Stream_IO.File_Type now has preelaborable
initialization. This allows declaring library-level file
objects in preelaborable packages (an oversight from the
@@ -81741,7 +82015,7 @@ again after it had been closed.
_Wording Changes from Ada 2012_
36.i/4
- {AI12-0130-1AI12-0130-1} Corrigendum: The definition of the
+ {<AI12-0130-1AI12-0130-1>} Corrigendum: The definition of the
Flush procedure was moved to *note A.8.2::, so that it could
be shared by all of the I/O packages.
@@ -81822,13 +82096,14 @@ A.12.4 The Package Wide_Wide_Text_IO.Text_Streams
-------------------------------------------------
1/2
-{AI95-00285-01AI95-00285-01} The package Wide_Wide_Text_IO.Text_Streams
-provides a function for treating a wide wide text file as a stream.
+{<AI95-00285-01AI95-00285-01>} The package
+Wide_Wide_Text_IO.Text_Streams provides a function for treating a wide
+wide text file as a stream.
_Static Semantics_
2/2
-{AI95-00285-01AI95-00285-01} The library package
+{<AI95-00285-01AI95-00285-01>} The library package
Wide_Wide_Text_IO.Text_Streams has the following declaration:
3/2
@@ -81841,13 +82116,13 @@ Wide_Wide_Text_IO.Text_Streams has the following
declaration:
end Ada.Wide_Wide_Text_IO.Text_Streams;
5/2
-{AI95-00285-01AI95-00285-01} The Stream function has the same effect as
-the corresponding function in Streams.Stream_IO.
+{<AI95-00285-01AI95-00285-01>} The Stream function has the same effect
+as the corresponding function in Streams.Stream_IO.
_Extensions to Ada 95_
5.a/2
- {AI95-00285-01AI95-00285-01} Package
+ {<AI95-00285-01AI95-00285-01>} Package
Wide_Wide_Text_IO.Text_Streams is new.
@@ -81944,12 +82219,13 @@ respectively (excluding the unbounded cases). It is
also propagated by
an attempt to Put too many characters to a string.
14.1/3
-{AI05-0262-1AI05-0262-1} These exceptions are also propagated by various
-other language-defined packages and operations, see the definition of
-those entities for other reasons that these exceptions are propagated.
+{<AI05-0262-1AI05-0262-1>} These exceptions are also propagated by
+various other language-defined packages and operations, see the
+definition of those entities for other reasons that these exceptions are
+propagated.
14.a/3
- Reason: {AI05-0299-1AI05-0299-1} This subclause is based in
+ Reason: {<AI05-0299-1AI05-0299-1>} This subclause is based in
Ada 95. Later versions of Ada (starting with Technical
Corrigendum 1) have added a number of additional places and
reasons that cause these exceptions. In particular, TC1 says
@@ -81993,7 +82269,7 @@ subtype.
cannot be interpreted as a value of the required subtype, but this is
not detected and Data_Error is not propagated, then the resulting value
can be abnormal, and subsequent references to the value can lead to
-erroneous execution, as explained in *note 13.9.1::. ]
+erroneous execution, as explained in *note 13.9.1::. ]
File: aarm2012.info, Node: A.14, Next: A.15, Prev: A.13, Up: Annex A
@@ -82013,8 +82289,8 @@ supported by the implementation, the following effects
are defined:
and page numbers of any other file object.
3/1
- * This paragraph was deleted.{8652/00578652/0057}
- {AI95-00050-01AI95-00050-01}
+ * <This paragraph was deleted.>{<8652/00578652/0057>}
+ {<AI95-00050-01AI95-00050-01>}
4
* For direct and stream files, the current index is a property of
@@ -82031,9 +82307,9 @@ All other effects are identical.
_Wording Changes from Ada 95_
6.a/2
- {8652/00578652/0057} {AI95-00050-01AI95-00050-01} Corrigendum:
- Removed the incorrect statement that the external files
- associated with the standard input, standard output, and
+ {<8652/00578652/0057>} {<AI95-00050-01AI95-00050-01>}
+ Corrigendum: Removed the incorrect statement that the external
+ files associated with the standard input, standard output, and
standard error files are distinct.
@@ -82071,7 +82347,7 @@ The library package Ada.Command_Line has the following
declaration:
function Command_Name return String;
7
- type Exit_Status is implementation-defined integer type;
+ type Exit_Status is <implementation-defined integer type>;
8
Success : constant Exit_Status;
@@ -82082,7 +82358,7 @@ The library package Ada.Command_Line has the following
declaration:
10
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Command_Line;
@@ -82090,11 +82366,11 @@ The library package Ada.Command_Line has the
following declaration:
function Argument_Count return Natural;
12/3
- {AI05-0264-1AI05-0264-1} If the external execution environment
- supports passing arguments to a program, then Argument_Count
- returns the number of arguments passed to the program invoking
- the function. Otherwise, it returns 0. The meaning of
- "number of arguments" is implementation defined.
+ {<AI05-0264-1AI05-0264-1>} If the external execution
+ environment supports passing arguments to a program, then
+ Argument_Count returns the number of arguments passed to the
+ program invoking the function. Otherwise, it returns 0. The
+ meaning of "number of arguments" is implementation defined.
13
function Argument (Number : in Positive) return String;
@@ -82103,7 +82379,7 @@ The library package Ada.Command_Line has the following
declaration:
If the external execution environment supports passing
arguments to a program, then Argument returns an
implementation-defined value corresponding to the argument at
- relative position Number. If Number is outside the range
+ relative position Number. If Number is outside the range
1..Argument_Count, then Constraint_Error is propagated.
14.a
@@ -82115,14 +82391,14 @@ The library package Ada.Command_Line has the
following declaration:
function Command_Name return String;
16/3
- {AI05-0264-1AI05-0264-1} If the external execution environment
- supports passing arguments to a program, then Command_Name
- returns an implementation-defined value corresponding to the
- name of the command invoking the program; otherwise,
- Command_Name returns the null string.
+ {<AI05-0264-1AI05-0264-1>} If the external execution
+ environment supports passing arguments to a program, then
+ Command_Name returns an implementation-defined value
+ corresponding to the name of the command invoking the program;
+ otherwise, Command_Name returns the null string.
16.1/1
- type Exit_Status is implementation-defined integer type;
+ type Exit_Status is <implementation-defined integer type>;
17
The type Exit_Status represents the range of exit status
@@ -82170,7 +82446,7 @@ environment.
_Extensions to Ada 83_
22.b/3
- {AI05-0299-1AI05-0299-1} This subclause is new in Ada 95.
+ {<AI05-0299-1AI05-0299-1>} This subclause is new in Ada 95.
File: aarm2012.info, Node: A.16, Next: A.17, Prev: A.15, Up: Annex A
@@ -82179,11 +82455,11 @@ A.16 The Package Directories
============================
1/2
-{AI95-00248-01AI95-00248-01} The package Directories provides operations
-for manipulating files and directories, and their names.
+{<AI95-00248-01AI95-00248-01>} The package Directories provides
+operations for manipulating files and directories, and their names.
1.a/3
- Discussion: {AI05-0299-1AI05-0299-1} The notes for this
+ Discussion: {<AI05-0299-1AI05-0299-1>} The notes for this
subclause contain the expected interpretations of some of the
operations on various target systems. "Unix" refers to the
UNIX� operating system, and in most cases also covers
@@ -82194,7 +82470,7 @@ for manipulating files and directories, and their names.
_Static Semantics_
2/2
-{AI95-00248-01AI95-00248-01} The library package Directories has the
+{<AI95-00248-01AI95-00248-01>} The library package Directories has the
following declaration:
3/2
@@ -82203,7 +82479,7 @@ following declaration:
package Ada.Directories is
4/2
- -- Directory and file operations:
+ -- <Directory and file operations:>
5/2
function Current_Directory return String;
@@ -82237,7 +82513,7 @@ following declaration:
Form : in String := "");
14/2
- -- File and directory name operations:
+ -- <File and directory name operations:>
15/2
function Full_Name (Name : in String) return String;
@@ -82260,20 +82536,20 @@ following declaration:
Extension : in String := "") return
String;
20.1/3
- {AI05-0049-1AI05-0049-1} type Name_Case_Kind is
+ {<AI05-0049-1AI05-0049-1>} type Name_Case_Kind is
(Unknown, Case_Sensitive, Case_Insensitive, Case_Preserving);
20.2/3
- {AI05-0049-1AI05-0049-1} function Name_Case_Equivalence (Name : in
String) return Name_Case_Kind;
+ {<AI05-0049-1AI05-0049-1>} function Name_Case_Equivalence (Name : in
String) return Name_Case_Kind;
21/2
- -- File and directory queries:
+ -- <File and directory queries:>
22/2
type File_Kind is (Directory, Ordinary_File, Special_File);
23/2
- type File_Size is range 0 .. implementation-defined;
+ type File_Size is range 0 .. <implementation-defined>;
24/2
function Exists (Name : in String) return Boolean;
@@ -82288,7 +82564,7 @@ following declaration:
function Modification_Time (Name : in String) return Ada.Calendar.Time;
28/2
- -- Directory searching:
+ -- <Directory searching:>
29/2
type Directory_Entry_Type is limited private;
@@ -82324,7 +82600,7 @@ following declaration:
Directory_Entry : in Directory_Entry_Type));
37/2
- -- Operations on Directory Entries:
+ -- <Operations on Directory Entries:>
38/2
function Simple_Name (Directory_Entry : in Directory_Entry_Type)
@@ -82353,17 +82629,17 @@ following declaration:
Device_Error : exception renames Ada.IO_Exceptions.Device_Error;
44/3
- {AI05-0092-1AI05-0092-1} private
- ... -- not specified by the language
+ {<AI05-0092-1AI05-0092-1>} private
+ ... -- <not specified by the language>
end Ada.Directories;
45/2
-{AI95-00248-01AI95-00248-01} External files may be classified as
-directories, special files, or ordinary files. A directory is an
+{<AI95-00248-01AI95-00248-01>} External files may be classified as
+directories, special files, or ordinary files. A <directory> is an
external file that is a container for files on the target system. A
-special file is an external file that cannot be created or read by a
+<special file> is an external file that cannot be created or read by a
predefined Ada input-output package. External files that are not
-special files or directories are called ordinary files.
+special files or directories are called <ordinary files>.
45.a/2
Ramification: A directory is an external file, although it may
@@ -82379,26 +82655,26 @@ special files or directories are called ordinary
files.
read soft links, such links are still special files.
46/2
-{AI95-00248-01AI95-00248-01} A file name is a string identifying an
-external file. Similarly, a directory name is a string identifying a
+{<AI95-00248-01AI95-00248-01>} A <file name> is a string identifying an
+external file. Similarly, a <directory name> is a string identifying a
directory. The interpretation of file names and directory names is
-implementation-defined.
+implementation-defined.
46.a/2
Implementation defined: The interpretation of file names and
directory names.
47/2
-{AI95-00248-01AI95-00248-01} The full name of an external file is a full
-specification of the name of the file. If the external environment
+{<AI95-00248-01AI95-00248-01>} The <full name> of an external file is a
+full specification of the name of the file. If the external environment
allows alternative specifications of the name (for example,
abbreviations), the full name should not use such alternatives. A full
name typically will include the names of all of the directories that
-contain the item. The simple name of an external file is the name of
+contain the item. The <simple name> of an external file is the name of
the item, not including any containing directory names. Unless
otherwise specified, a file name or directory name parameter in a call
to a predefined Ada input-output subprogram can be a full name, a simple
-name, or any other form of name supported by the implementation.
+name, or any other form of name supported by the implementation.
47.a/2
Discussion: The full name on Unix is a complete path to the
@@ -82416,9 +82692,10 @@ name, or any other form of name supported by the
implementation.
simple name.
48/2
-{AI95-00248-01AI95-00248-01} The default directory is the directory that
-is used if a directory or file name is not a full name (that is, when
-the name does not fully identify all of the containing directories).
+{<AI95-00248-01AI95-00248-01>} The <default directory> is the directory
+that is used if a directory or file name is not a full name (that is,
+when the name does not fully identify all of the containing
+directories).
48.a/2
Discussion: The default directory is the one maintained by the
@@ -82427,17 +82704,17 @@ the name does not fully identify all of the
containing directories).
drive; implementations should use the natural implementation.
49/2
-{AI95-00248-01AI95-00248-01} A directory entry is a single item in a
+{<AI95-00248-01AI95-00248-01>} A <directory entry> is a single item in a
directory, identifying a single external file (including directories and
-special files).
+special files).
50/2
-{AI95-00248-01AI95-00248-01} For each function that returns a string,
+{<AI95-00248-01AI95-00248-01>} For each function that returns a string,
the lower bound of the returned value is 1.
51/2
-{AI95-00248-01AI95-00248-01} The following file and directory operations
-are provided:
+{<AI95-00248-01AI95-00248-01>} The following file and directory
+operations are provided:
52/2
function Current_Directory return String;
@@ -82480,7 +82757,7 @@ are provided:
procedure Delete_Directory (Directory : in String);
59/3
- {AI05-0231-1AI05-0231-1} Deletes an existing empty directory
+ {<AI05-0231-1AI05-0231-1>} Deletes an existing empty directory
with name Directory. The exception Name_Error is propagated
if the string given as Directory does not identify an existing
directory. The exception Use_Error is propagated if the
@@ -82493,8 +82770,8 @@ are provided:
Form : in String := "");
61/3
- {AI05-0271-1AI05-0271-1} Creates zero or more directories with
- name New_Directory. Each nonexistent directory named by
+ {<AI05-0271-1AI05-0271-1>} Creates zero or more directories
+ with name New_Directory. Each nonexistent directory named by
New_Directory is created.[ For example, on a typical Unix
system, Create_Path ("/usr/me/my"); would create directory
"me" in directory "usr", then create directory "my" in
@@ -82542,7 +82819,7 @@ are provided:
procedure Rename (Old_Name, New_Name : in String);
67/3
- {AI05-0231-1AI05-0231-1} Renames an existing external file
+ {<AI05-0231-1AI05-0231-1>} Renames an existing external file
(including directories) with name Old_Name to New_Name. The
exception Name_Error is propagated if the string given as
Old_Name does not identify an existing external file or if the
@@ -82564,12 +82841,12 @@ are provided:
instance, MoveFile can be used to implement Rename.
68/3
- {AI05-0092-1AI05-0092-1} procedure Copy_File (Source_Name,
+ {<AI05-0092-1AI05-0092-1>} procedure Copy_File (Source_Name,
Target_Name : in String;
Form : in String := "");
69/3
- {AI05-0271-1AI05-0271-1} Copies the contents of the existing
+ {<AI05-0271-1AI05-0271-1>} Copies the contents of the existing
external file with name Source_Name to an external file with
name Target_Name. The resulting external file is a duplicate
of the source external file. The Form parameter can be used
@@ -82593,7 +82870,7 @@ are provided:
raised.
70/2
-{AI95-00248-01AI95-00248-01} The following file and directory name
+{<AI95-00248-01AI95-00248-01>} The following file and directory name
operations are provided:
71/2
@@ -82687,16 +82964,17 @@ operations are provided:
Extension : in String := "") return String;
82/3
- {AI05-0264-1AI05-0264-1} Returns the name of the external file
- with the specified Containing_Directory, Name, and Extension.
- If Extension is the null string, then Name is interpreted as a
- simple name; otherwise, Name is interpreted as a base name.
- The exception Name_Error is propagated if the string given as
- Containing_Directory is not null and does not allow the
- identification of a directory, or if the string given as
- Extension is not null and is not a possible extension, or if
- the string given as Name is not a possible simple name (if
- Extension is null) or base name (if Extension is nonnull).
+ {<AI05-0264-1AI05-0264-1>} Returns the name of the external
+ file with the specified Containing_Directory, Name, and
+ Extension. If Extension is the null string, then Name is
+ interpreted as a simple name; otherwise, Name is interpreted
+ as a base name. The exception Name_Error is propagated if the
+ string given as Containing_Directory is not null and does not
+ allow the identification of a directory, or if the string
+ given as Extension is not null and is not a possible
+ extension, or if the string given as Name is not a possible
+ simple name (if Extension is null) or base name (if Extension
+ is nonnull).
82.a/2
Ramification: The above definition implies that if the
@@ -82719,12 +82997,12 @@ operations are provided:
problem with file names generated by a program.)
82.1/3
- {AI05-0049-1AI05-0049-1} function Name_Case_Equivalence (Name : in
String) return Name_Case_Kind;
+ {<AI05-0049-1AI05-0049-1>} function Name_Case_Equivalence (Name : in
String) return Name_Case_Kind;
82.2/3
- {AI05-0049-1AI05-0049-1} {AI05-0248-1AI05-0248-1} Returns the
- file name equivalence rule for the directory containing Name.
- Raises Name_Error if Name is not a full name. Returns
+ {<AI05-0049-1AI05-0049-1>} {<AI05-0248-1AI05-0248-1>} Returns
+ the file name equivalence rule for the directory containing
+ Name. Raises Name_Error if Name is not a full name. Returns
Case_Sensitive if file names that differ only in the case of
letters are considered different names. If file names that
differ only in the case of letters are considered the same
@@ -82743,7 +83021,7 @@ operations are provided:
(such as could be the case for network files).
83/2
-{AI95-00248-01AI95-00248-01} The following file and directory queries
+{<AI95-00248-01AI95-00248-01>} The following file and directory queries
and types are provided:
84/2
@@ -82754,7 +83032,7 @@ and types are provided:
an external file or directory.
86/2
- type File_Size is range 0 .. implementation-defined;
+ type File_Size is range 0 .. <implementation-defined>;
87/2
The type File_Size represents the size of an external file.
@@ -82825,7 +83103,7 @@ and types are provided:
Directories.Modification_Time for a directory or special file.
96/2
-{AI95-00248-01AI95-00248-01} The following directory searching
+{<AI95-00248-01AI95-00248-01>} The following directory searching
operations and types are provided:
97/2
@@ -82867,7 +83145,7 @@ operations and types are provided:
Filter : in Filter_Type := (others => True));
104/3
- {AI05-0092-1AI05-0092-1} {AI05-0262-1AI05-0262-1} Starts a
+ {<AI05-0092-1AI05-0092-1>} {<AI05-0262-1AI05-0262-1>} Starts a
search in the directory named by Directory for entries
matching Pattern and Filter. Pattern represents a pattern for
matching file names. If Pattern is the null string, all items
@@ -82916,10 +83194,10 @@ operations and types are provided:
Directory_Entry : out Directory_Entry_Type);
110/3
- {AI05-0262-1AI05-0262-1} Returns the next Directory_Entry for
- the search described by Search that matches the pattern and
- filter. If no further matches are available, Status_Error is
- raised. It is implementation-defined as to whether the
+ {<AI05-0262-1AI05-0262-1>} Returns the next Directory_Entry
+ for the search described by Search that matches the pattern
+ and filter. If no further matches are available, Status_Error
+ is raised. It is implementation-defined as to whether the
results returned by this subprogram are altered if the
contents of the directory are altered while the Search object
is valid (for example, by another program). The exception
@@ -82941,10 +83219,10 @@ operations and types are provided:
Directory_Entry : in Directory_Entry_Type));
112/3
- {AI05-0092-1AI05-0092-1} {AI05-0262-1AI05-0262-1} Searches in
- the directory named by Directory for entries matching Pattern
- and Filter. The subprogram designated by Process is called
- with each matching entry in turn. Pattern represents a
+ {<AI05-0092-1AI05-0092-1>} {<AI05-0262-1AI05-0262-1>} Searches
+ in the directory named by Directory for entries matching
+ Pattern and Filter. The subprogram designated by Process is
+ called with each matching entry in turn. Pattern represents a
pattern for matching file names. If Pattern is the null
string, all items in the directory are matched; otherwise, the
interpretation of Pattern is implementation-defined. Only
@@ -83050,8 +83328,8 @@ functions in a child package Directories.Information to
retrieve it.
124.c/2
package Ada.Directories.Information is
- -- System-specific directory information.
- -- Version for the Microsoft� Windows� operating system.
+ -- <System-specific directory information.>
+ -- <Version for the Microsoft� Windows� operating system.>
124.d/2
function Creation_Time (Name : in String) return
Ada.Calendar.Time;
@@ -83064,8 +83342,8 @@ functions in a child package Directories.Information to
retrieve it.
124.g/2
function Needs_Archiving (Name : in String) return Boolean;
- -- This generally means that the file needs to be
backed up.
- -- The flag is only cleared by backup programs.
+ -- <This generally means that the file needs to be
backed up.>
+ -- <The flag is only cleared by backup programs.>
124.h/2
function Is_Compressed (Name : in String) return Boolean;
@@ -83104,8 +83382,8 @@ functions in a child package Directories.Information to
retrieve it.
124.s/2
function Needs_Archiving (Directory_Entry : in
Directory_Entry_Type) return Boolean;
- -- This generally means that the file needs to be
backed up.
- -- The flag is only cleared by backup programs.
+ -- <This generally means that the file needs to be
backed up.>
+ -- <The flag is only cleared by backup programs.>
124.t/2
function Is_Compressed (Directory_Entry : in
Directory_Entry_Type) return Boolean;
@@ -83132,7 +83410,7 @@ functions in a child package Directories.Information to
retrieve it.
function Is_Not_Indexed (Directory_Entry : in
Directory_Entry_Type) return Boolean;
124.bb/2
- -- Additional implementation-defined subprograms allowed
here.
+ -- <Additional implementation-defined subprograms allowed
here.>
end Ada.Directories.Information;
124.cc/2
@@ -83142,8 +83420,8 @@ functions in a child package Directories.Information to
retrieve it.
124.dd/2
package Ada.Directories.Information is
- -- System-specific directory information.
- -- Unix and similar systems version.
+ -- <System-specific directory information.>
+ -- <Unix and similar systems version.>
124.ee/2
function Last_Access_Time (Name : in String) return
Ada.Calendar.Time;
@@ -83166,15 +83444,15 @@ functions in a child package Directories.Information
to retrieve it.
124.jj/2
function Owner (Name : in String) return String;
- -- Returns the image of the User_Id. If a definition of
User_Id
- -- is available, an implementation-defined version of
Owner
- -- returning User_Id should also be defined.
+ -- <Returns the image of the User_Id. If a definition
of User_Id>
+ -- <is available, an implementation-defined version of
Owner>
+ -- <returning User_Id should also be defined.>
124.kk/3
- {AI05-0005-1AI05-0005-1} function Group (Name : in String)
return String;
- -- Returns the image of the Group_Id. If a definition
of Group_Id
- -- is available, an implementation-defined version of
Group
- -- returning Group_Id should also be defined.
+ {<AI05-0005-1AI05-0005-1>} function Group (Name : in
String) return String;
+ -- <Returns the image of the Group_Id. If a definition
of Group_Id>
+ -- <is available, an implementation-defined version of
Group>
+ -- <returning Group_Id should also be defined.>
124.ll/2
function Is_Block_Special_File (Name : in String) return
Boolean;
@@ -83205,11 +83483,11 @@ functions in a child package Directories.Information
to retrieve it.
124.tt/2
function Owner (Directory_Entry : in Directory_Entry_Type)
return String;
- -- See Owner above.
+ -- <See Owner above.>
124.uu/2
function Group (Directory_Entry : in Directory_Entry_Type)
return String;
- -- See Group above.
+ -- <See Group above.>
124.vv/2
function Is_Block_Special_File (Directory_Entry : in
Directory_Entry_Type)
@@ -83230,7 +83508,7 @@ functions in a child package Directories.Information to
retrieve it.
function Is_Socket (Directory_Entry : in
Directory_Entry_Type) return Boolean;
124.aaa/2
- -- Additional implementation-defined subprograms allowed
here.
+ -- <Additional implementation-defined subprograms allowed
here.>
end Ada.Directories.Information;
124.bbb/2
@@ -83240,9 +83518,9 @@ functions in a child package Directories.Information to
retrieve it.
other targets as similar to these as possible.
125/3
-{AI05-0231-1AI05-0231-1} Start_Search and Search should raise Name_Error
-if Pattern is malformed, but not if it could represent a file in the
-directory but does not actually do so.
+{<AI05-0231-1AI05-0231-1>} Start_Search and Search should raise
+Name_Error if Pattern is malformed, but not if it could represent a file
+in the directory but does not actually do so.
125.a/3
Implementation Advice: Directories.Start_Search and
@@ -83323,13 +83601,13 @@ simple names and New_Name does not identify an
existing external file.
_Extensions to Ada 95_
131.c/2
- {AI95-00248-01AI95-00248-01} Package Ada.Directories is new.
+ {<AI95-00248-01AI95-00248-01>} Package Ada.Directories is new.
_Inconsistencies With Ada 2005_
131.d/3
- {AI05-0231-1AI05-0231-1} Correction: Clarified when and which
- exceptions are raised for Start_Search, Search,
+ {<AI05-0231-1AI05-0231-1>} Correction: Clarified when and
+ which exceptions are raised for Start_Search, Search,
Delete_Directory, and Rename. If an implementation followed
the original incorrect wording, it might raise Use_Error
instead of Name_Error for Start_Search and Search, Name_Error
@@ -83344,19 +83622,19 @@ simple names and New_Name does not identify an
existing external file.
_Incompatibilities With Ada 2005_
131.e/3
- {AI05-0049-1AI05-0049-1} A new enumeration type Name_Case_Kind
- and a new function Name_Case_Equivalence is added to
- Directories. If Directories is referenced in a use_clause,
- and an entity E with a defining_identifier of one of the new
- entities is defined in a package that is also referenced in a
- use_clause, the entity E may no longer be use-visible,
- resulting in errors. This should be rare and is easily fixed
- if it does occur.
+ {<AI05-0049-1AI05-0049-1>} A new enumeration type
+ Name_Case_Kind and a new function Name_Case_Equivalence is
+ added to Directories. If Directories is referenced in a
+ use_clause, and an entity <E> with a defining_identifier of
+ one of the new entities is defined in a package that is also
+ referenced in a use_clause, the entity <E> may no longer be
+ use-visible, resulting in errors. This should be rare and is
+ easily fixed if it does occur.
_Wording Changes from Ada 2005_
131.f/3
- {AI05-0271-1AI05-0271-1} Correction: We now explicitly say
+ {<AI05-0271-1AI05-0271-1>} Correction: We now explicitly say
that the behavior of Create_Path and Copy_File is unspecified
when Use_Error is raised. Nothing has changed here, as the
behavior was (implicitly) unspecified in the 2007 Amendment.
@@ -83372,7 +83650,7 @@ A.16.1 The Package Directories.Hierarchical_File_Names
------------------------------------------------------
1/3
-{AI05-0049-1AI05-0049-1} The library package
+{<AI05-0049-1AI05-0049-1>} The library package
Directories.Hierarchical_File_Names is an optional package providing
operations for file name construction and decomposition for targets with
hierarchical file naming.
@@ -83380,7 +83658,7 @@ hierarchical file naming.
_Static Semantics_
2/3
-{AI05-0049-1AI05-0049-1} If provided, the library package
+{<AI05-0049-1AI05-0049-1>} If provided, the library package
Directories.Hierarchical_File_Names has the following declaration:
3/3
@@ -83427,7 +83705,7 @@ Directories.Hierarchical_File_Names has the following
declaration:
end Ada.Directories.Hierarchical_File_Names;
16/3
-{AI05-0049-1AI05-0049-1} {AI05-0269-1AI05-0269-1} In addition to the
+{<AI05-0049-1AI05-0049-1>} {<AI05-0269-1AI05-0269-1>} In addition to the
operations provided in package Directories.Hierarchical_File_Names, the
operations in package Directories can be used with hierarchical file
names. In particular, functions Full_Name, Base_Name, and Extension
@@ -83487,8 +83765,8 @@ provide additional capabilities for hierarchical file
names.
function Is_Relative_Name (Name : in String) return Boolean;
28/3
- {AI05-0049-1AI05-0049-1} {AI05-0269-1AI05-0269-1} Returns True
- if Name allows the identification of an external file
+ {<AI05-0049-1AI05-0049-1>} {<AI05-0269-1AI05-0269-1>} Returns
+ True if Name allows the identification of an external file
(including directories and special files) but is not a full
name, and returns False otherwise.
@@ -83501,13 +83779,14 @@ provide additional capabilities for hierarchical file
names.
function Initial_Directory (Name : in String) return String;
30/3
- {AI05-0049-1AI05-0049-1} {AI05-0248-1AI05-0248-1} Returns the
- leftmost directory part in Name. [That is, it returns a root
- directory name (for a full name), or one of a parent directory
- name, a current directory name, or a simple name (for a
- relative name).] The exception Name_Error is propagated if
- the string given as Name does not allow the identification of
- an external file (including directories and special files).
+ {<AI05-0049-1AI05-0049-1>} {<AI05-0248-1AI05-0248-1>} Returns
+ the leftmost directory part in Name. [That is, it returns a
+ root directory name (for a full name), or one of a parent
+ directory name, a current directory name, or a simple name
+ (for a relative name).] The exception Name_Error is
+ propagated if the string given as Name does not allow the
+ identification of an external file (including directories and
+ special files).
31/3
function Relative_Name (Name : in String) return String;
@@ -83573,7 +83852,7 @@ provide additional capabilities for hierarchical file
names.
Containing_Directory(Rel(N)) = Leftmost Rel(N-1),
Containing_Directory(Full(N)) = Leftmost Full(N-1),
Else if N = 1, raise Name_Error.
-
+
35.f/3
Similarly,
@@ -83583,7 +83862,7 @@ provide additional capabilities for hierarchical file
names.
Relative_Name(Rel(N)) = Rightmost Rel(N-1),
Relative_Name(Full(N)) = Rightmost Full(N-1),
Else if N = 1, raise Name_Error.
-
+
35.h/3
Finally, for Compose (ignoring the extension here):
@@ -83592,7 +83871,7 @@ provide additional capabilities for hierarchical file
names.
Compose (Directory => Full(N), Relative_Name => Rel(M)) =>
Full(N+M)
Compose (Directory => Rel(N), Relative_Name => Rel(M)) =>
Rel(N+M)
Name_Error if Relative_Name is a Full(M).
-
+
35.j/3
We didn't try to write wording to reflect these details of
@@ -83601,7 +83880,7 @@ provide additional capabilities for hierarchical file
names.
_Implementation Advice_
36/3
-{AI05-0049-1AI05-0049-1} Directories.Hierarchical_File_Names should be
+{<AI05-0049-1AI05-0049-1>} Directories.Hierarchical_File_Names should be
provided for systems with hierarchical file naming, and should not be
provided on other systems.
@@ -83618,7 +83897,7 @@ provided on other systems.
NOTES
37/3
- 46 {AI05-0049-1AI05-0049-1} These operations operate on file
+ 46 {<AI05-0049-1AI05-0049-1>} These operations operate on file
names, not external files. The files identified by these
operations do not need to exist. Name_Error is raised only as
specified or if the file name is malformed and cannot possibly
@@ -83626,10 +83905,10 @@ provided on other systems.
their parameters.
38/3
- 47 {AI05-0049-1AI05-0049-1} Containing_Directory raises Use_Error
- if Name does not have a containing directory, including when any of
- Is_Simple_Name, Is_Root_Directory_Name, Is_Parent_Directory_Name,
- or Is_Current_Directory_Name are True.
+ 47 {<AI05-0049-1AI05-0049-1>} Containing_Directory raises
+ Use_Error if Name does not have a containing directory, including
+ when any of Is_Simple_Name, Is_Root_Directory_Name,
+ Is_Parent_Directory_Name, or Is_Current_Directory_Name are True.
38.a/3
Ramification: In particular, the default directory is not used
@@ -83644,7 +83923,7 @@ provided on other systems.
_Extensions to Ada 2005_
38.b/3
- {AI05-0049-1AI05-0049-1} Package
+ {<AI05-0049-1AI05-0049-1>} Package
Ada.Directories.Hierarchical_File_Names is new.
@@ -83654,11 +83933,11 @@ A.17 The Package Environment_Variables
======================================
1/2
-{AI95-00370-01AI95-00370-01} The package Environment_Variables allows a
-program to read or modify environment variables. Environment variables
-are name-value pairs, where both the name and value are strings. The
-definition of what constitutes an environment variable, and the meaning
-of the name and value, are implementation defined.
+{<AI95-00370-01AI95-00370-01>} The package Environment_Variables allows
+a program to read or modify environment variables. Environment
+variables are name-value pairs, where both the name and value are
+strings. The definition of what constitutes an <environment variable>,
+and the meaning of the name and value, are implementation defined.
1.a/2
Implementation defined: The definition and meaning of an
@@ -83667,7 +83946,7 @@ of the name and value, are implementation defined.
_Static Semantics_
2/2
-{AI95-00370-01AI95-00370-01} The library package Environment_Variables
+{<AI95-00370-01AI95-00370-01>} The library package Environment_Variables
has the following declaration:
3/2
@@ -83678,7 +83957,7 @@ has the following declaration:
function Value (Name : in String) return String;
4.1/3
- {AI05-0285-1AI05-0285-1} function Value (Name : in String; Default :
in String) return String;
+ {<AI05-0285-1AI05-0285-1>} function Value (Name : in String; Default :
in String) return String;
5/2
function Exists (Name : in String) return Boolean;
@@ -83691,7 +83970,7 @@ has the following declaration:
procedure Clear;
8/3
- {AI05-0248-1AI05-0248-1} procedure Iterate
+ {<AI05-0248-1AI05-0248-1>} procedure Iterate
(Process : not null access procedure (Name, Value : in String));
9/2
@@ -83701,7 +83980,7 @@ has the following declaration:
function Value (Name : in String) return String;
11/2
- {AI95-00370-01AI95-00370-01} If the external execution
+ {<AI95-00370-01AI95-00370-01>} If the external execution
environment supports environment variables, then Value returns
the value of the environment variable with the given name. If
no environment variable with the given name exists, then
@@ -83713,30 +83992,31 @@ has the following declaration:
function Value (Name : in String; Default : in String) return String;
11.2/3
- {AI05-0285-1AI05-0285-1} If the external execution environment
- supports environment variables and an environment variable
- with the given name currently exists, then Value returns its
- value; otherwise, it returns Default.
+ {<AI05-0285-1AI05-0285-1>} If the external execution
+ environment supports environment variables and an environment
+ variable with the given name currently exists, then Value
+ returns its value; otherwise, it returns Default.
12/2
function Exists (Name : in String) return Boolean;
13/3
- {AI95-00370-01AI95-00370-01} {AI05-0264-1AI05-0264-1} If the
- external execution environment supports environment variables
- and an environment variable with the given name currently
- exists, then Exists returns True; otherwise, it returns False.
+ {<AI95-00370-01AI95-00370-01>} {<AI05-0264-1AI05-0264-1>} If
+ the external execution environment supports environment
+ variables and an environment variable with the given name
+ currently exists, then Exists returns True; otherwise, it
+ returns False.
14/2
procedure Set (Name : in String; Value : in String);
15/3
- {AI95-00370-01AI95-00370-01} {AI05-0264-1AI05-0264-1} If the
- external execution environment supports environment variables,
- then Set first clears any existing environment variable with
- the given name, and then defines a single new environment
- variable with the given name and value. Otherwise,
- Program_Error is propagated.
+ {<AI95-00370-01AI95-00370-01>} {<AI05-0264-1AI05-0264-1>} If
+ the external execution environment supports environment
+ variables, then Set first clears any existing environment
+ variable with the given name, and then defines a single new
+ environment variable with the given name and value.
+ Otherwise, Program_Error is propagated.
16/2
If implementation-defined circumstances prohibit the
@@ -83760,32 +84040,32 @@ has the following declaration:
procedure Clear (Name : in String);
19/3
- {AI95-00370-01AI95-00370-01} {AI05-0264-1AI05-0264-1}
- {AI05-0269-1AI05-0269-1} If the external execution environment
- supports environment variables, then Clear deletes all
- existing environment variables with the given name.
+ {<AI95-00370-01AI95-00370-01>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0269-1AI05-0269-1>} If the external execution
+ environment supports environment variables, then Clear deletes
+ all existing environment variables with the given name.
Otherwise, Program_Error is propagated.
20/2
procedure Clear;
21/3
- {AI95-00370-01AI95-00370-01} {AI05-0264-1AI05-0264-1} If the
- external execution environment supports environment variables,
- then Clear deletes all existing environment variables.
- Otherwise, Program_Error is propagated.
+ {<AI95-00370-01AI95-00370-01>} {<AI05-0264-1AI05-0264-1>} If
+ the external execution environment supports environment
+ variables, then Clear deletes all existing environment
+ variables. Otherwise, Program_Error is propagated.
22/3
- {AI05-0248-1AI05-0248-1} procedure Iterate
+ {<AI05-0248-1AI05-0248-1>} procedure Iterate
(Process : not null access procedure (Name, Value : in String));
23/3
- {AI95-00370-01AI95-00370-01} {AI05-0264-1AI05-0264-1} If the
- external execution environment supports environment variables,
- then Iterate calls the subprogram designated by Process for
- each existing environment variable, passing the name and value
- of that environment variable. Otherwise, Program_Error is
- propagated.
+ {<AI95-00370-01AI95-00370-01>} {<AI05-0264-1AI05-0264-1>} If
+ the external execution environment supports environment
+ variables, then Iterate calls the subprogram designated by
+ Process for each existing environment variable, passing the
+ name and value of that environment variable. Otherwise,
+ Program_Error is propagated.
24/2
If several environment variables exist that have the same
@@ -83794,9 +84074,9 @@ has the following declaration:
_Bounded (Run-Time) Errors_
25/2
-{AI95-00370-01AI95-00370-01} It is a bounded error to call Value if more
-than one environment variable exists with the given name; the possible
-outcomes are that:
+{<AI95-00370-01AI95-00370-01>} It is a bounded error to call Value if
+more than one environment variable exists with the given name; the
+possible outcomes are that:
26/2
* one of the values is returned, and that same value is returned in
@@ -83808,8 +84088,8 @@ outcomes are that:
_Erroneous Execution_
28/2
-{AI95-00370-01AI95-00370-01} Making calls to the procedures Set or Clear
-concurrently with calls to any subprogram of package
+{<AI95-00370-01AI95-00370-01>} Making calls to the procedures Set or
+Clear concurrently with calls to any subprogram of package
Environment_Variables, or to any instantiation of Iterate, results in
erroneous execution.
@@ -83821,7 +84101,7 @@ execution.
_Documentation Requirements_
30/2
-{AI95-00370-01AI95-00370-01} An implementation shall document how the
+{<AI95-00370-01AI95-00370-01>} An implementation shall document how the
operations of this package behave if environment variables are changed
by external mechanisms (for instance, calling operating system
services).
@@ -83834,8 +84114,8 @@ services).
_Implementation Permissions_
31/2
-{AI95-00370-01AI95-00370-01} An implementation running on a system that
-does not support environment variables is permitted to define the
+{<AI95-00370-01AI95-00370-01>} An implementation running on a system
+that does not support environment variables is permitted to define the
operations of package Environment_Variables with the semantics
corresponding to the case where the external execution environment does
support environment variables. In this case, it shall provide a
@@ -83845,7 +84125,7 @@ the execution of a partition.
_Implementation Advice_
32/2
-{AI95-00370-01AI95-00370-01} If the execution environment supports
+{<AI95-00370-01AI95-00370-01>} If the execution environment supports
subprocesses, the currently defined environment variables should be used
to initialize the environment variables of a subprocess.
@@ -83870,17 +84150,17 @@ environment variables.
_Extensions to Ada 95_
33.b/2
- {AI95-00370-01AI95-00370-01} Package Environment_Variables is
- new.
+ {<AI95-00370-01AI95-00370-01>} Package Environment_Variables
+ is new.
_Incompatibilities With Ada 2005_
33.c/3
- {AI05-0285-1AI05-0285-1} A new overloaded function Value is
+ {<AI05-0285-1AI05-0285-1>} A new overloaded function Value is
added to Environment_Variables. If Environment_Variables is
- referenced in a use_clause, and an entity E with the name
+ referenced in a use_clause, and an entity <E> with the name
Value is defined in a package that is also referenced in a
- use_clause, the entity E may no longer be use-visible,
+ use_clause, the entity <E> may no longer be use-visible,
resulting in errors. This should be rare and is easily fixed
if it does occur.
@@ -83891,8 +84171,8 @@ A.18 Containers
===============
1/2
-{AI95-00302-03AI95-00302-03} This clause presents the specifications of
-the package Containers and several child packages, which provide
+{<AI95-00302-03AI95-00302-03>} This clause presents the specifications
+of the package Containers and several child packages, which provide
facilities for storing collections of elements.
1.a.1/3
@@ -83902,12 +84182,12 @@ facilities for storing collections of elements.
children of package Ada.Containers (see *note A.18.1::).
2/2
-{AI95-00302-03AI95-00302-03} A variety of sequence and associative
-containers are provided. Each container includes a cursor type. A
+{<AI95-00302-03AI95-00302-03>} A variety of sequence and associative
+containers are provided. Each container includes a <cursor> type. A
cursor is a reference to an element within a container. Many operations
on cursors are common to all of the containers. A cursor referencing an
element in a container is considered to be overlapping with the
-container object itself.
+container object itself.
2.a/2
Reason: The last sentence is intended to clarify that
@@ -83916,44 +84196,44 @@ container object itself.
rules of Annex A.
3/2
-{AI95-00302-03AI95-00302-03} Within this clause we provide
+{<AI95-00302-03AI95-00302-03>} Within this clause we provide
Implementation Advice for the desired average or worst case time
complexity of certain operations on a container. This advice is
-expressed using the Landau symbol O(X). Presuming f is some function of
-a length parameter N and t(N) is the time the operation takes (on
+expressed using the Landau symbol <O>(X). Presuming f is some function
+of a length parameter N and t(N) is the time the operation takes (on
average or worst case, as specified) for the length N, a complexity of
-O(f(N)) means that there exists a finite A such that for any N,
+<O>(f(N)) means that there exists a finite A such that for any N,
t(N)/f(N) < A.
3.a/2
Discussion: Of course, an implementation can do better than a
- specified O(f(N)): for example, O(1) meets the requirements
- for O(log N).
+ specified <O>(f(N)): for example, <O>(1) meets the
+ requirements for <O>(log N).
3.b/2
This concept seems to have as many names as there are authors.
We used "Landau symbol" because that's what our reference
does. But we'd also seen this referred as big-O notation
- (sometimes written as big-oh), and as Bachmann notation.
+ (sometimes written as <big-oh>), and as Bachmann notation.
Whatever the name, it always has the above definition.
4/2
-If the advice suggests that the complexity should be less than O(f(N)),
-then for any arbitrarily small positive real D, there should exist a
-positive integer M such that for all N > M, t(N)/f(N) < D.
+If the advice suggests that the complexity should be less than
+<O>(f(N)), then for any arbitrarily small positive real D, there should
+exist a positive integer M such that for all N > M, t(N)/f(N) < D.
5/3
-{AI05-0001-1AI05-0001-1} {AI05-0044-1AI05-0044-1} When a formal function
-is used to provide an ordering for a container, it is generally required
-to define a strict weak ordering. A function "<" defines a strict weak
-ordering if it is irreflexive, asymmetric, transitive, and in addition,
-if x < y for any values x and y, then for all other values z, (x < z) or
-(z < y).
+{<AI05-0001-1AI05-0001-1>} {<AI05-0044-1AI05-0044-1>} When a formal
+function is used to provide an ordering for a container, it is generally
+required to define a strict weak ordering. A function "<" defines a
+<strict weak ordering> if it is irreflexive, asymmetric, transitive, and
+in addition, if <x> < <y> for any values <x> and <y>, then for all other
+values <z>, (<x> < <z>) or (<z> < <y>).
_Language Design Principles_
5.a/3
- {AI95-00302-03AI95-00302-03} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0299-1AI05-0299-1>} This
subclause provides a number of useful containers for Ada.
Only the most useful containers are provided. Ones that are
relatively easy to code, redundant, or rarely used are omitted
@@ -83987,31 +84267,31 @@ if x < y for any values x and y, then for all other
values z, (x < z) or
containing any nonlimited type;
5.h/3
- * {AI05-0136-1AI05-0136-1} Hashed Sets of any nonlimited
+ * {<AI05-0136-1AI05-0136-1>} Hashed Sets of any nonlimited
hashable type;
5.i/3
- * {AI05-0136-1AI05-0136-1} Ordered Sets of any nonlimited
+ * {<AI05-0136-1AI05-0136-1>} Ordered Sets of any nonlimited
ordered type;
5.i.1/3
- * {AI05-0136-1AI05-0136-1} Multiway Trees of any nonlimited
- type;
+ * {<AI05-0136-1AI05-0136-1>} Multiway Trees of any
+ nonlimited type;
5.i.2/3
- * {AI05-0069-1AI05-0069-1} Holders of any (indefinite)
+ * {<AI05-0069-1AI05-0069-1>} Holders of any (indefinite)
nonlimited type;
5.i.3/3
- * {AI05-0159-1AI05-0159-1} Synchronized queues of any
+ * {<AI05-0159-1AI05-0159-1>} Synchronized queues of any
definite nonlimited type; and
5.i.4/3
- * {AI05-0159-1AI05-0159-1} Priority queues of any definite
- nonlimited type.
+ * {<AI05-0159-1AI05-0159-1>} Priority queues of any
+ definite nonlimited type.
5.j/3
- {AI05-0001-1AI05-0001-1} Separate versions for definite and
+ {<AI05-0001-1AI05-0001-1>} Separate versions for definite and
indefinite element types are provided, as those for definite
types can be implemented more efficiently. Similarly, a
separate bounded version is provided in order to give more
@@ -84069,7 +84349,7 @@ if x < y for any values x and y, then for all other
values z, (x < z) or
prevents the abstraction from breaking unexpectedly.
5.q.1/3
- * {AI05-0048-1AI05-0048-1} Redispatching is not allowed
+ * {<AI05-0048-1AI05-0048-1>} Redispatching is not allowed
(unless it is required). That means that overriding a
container operation will not change the behavior of any
other predefined container operation. This provides a
@@ -84134,26 +84414,26 @@ if x < y for any values x and y, then for all other
values z, (x < z) or
_Static Semantics_
6/4
-{AI12-0035-1AI12-0035-1} Certain subprograms declared within instances
+{<AI12-0035-1AI12-0035-1>} Certain subprograms declared within instances
of some of the generic packages presented in this clause are said to
-perform indefinite insertion. These subprograms are those corresponding
-(in the sense of the copying described in subclause *note 12.3::) to
-subprograms that have formal parameters of a generic formal indefinite
-type and that are identified as performing indefinite insertion in the
-subclause defining the generic package.
+<perform indefinite insertion>. These subprograms are those
+corresponding (in the sense of the copying described in subclause *note
+12.3::) to subprograms that have formal parameters of a generic formal
+indefinite type and that are identified as performing indefinite
+insertion in the subclause defining the generic package.
7/4
-{AI12-0035-1AI12-0035-1} If a subprogram performs indefinite insertion,
-then certain run-time checks are performed as part of a call to the
-subprogram; if any of these checks fail, then the resulting exception is
-propagated to the caller and the container is not modified by the call.
-These checks are performed for each parameter corresponding (in the
-sense of the copying described in *note 12.3::) to a parameter in the
-corresponding generic whose type is a generic formal indefinite type.
-The checks performed for a given parameter are those checks explicitly
-specified in subclause *note 4.8:: that would be performed as part of
-the evaluation of an initialized allocator whose access type is declared
-immediately within the instance, where:
+{<AI12-0035-1AI12-0035-1>} If a subprogram performs indefinite
+insertion, then certain run-time checks are performed as part of a call
+to the subprogram; if any of these checks fail, then the resulting
+exception is propagated to the caller and the container is not modified
+by the call. These checks are performed for each parameter
+corresponding (in the sense of the copying described in *note 12.3::) to
+a parameter in the corresponding generic whose type is a generic formal
+indefinite type. The checks performed for a given parameter are those
+checks explicitly specified in subclause *note 4.8:: that would be
+performed as part of the evaluation of an initialized allocator whose
+access type is declared immediately within the instance, where:
8/4
* the value of the qualified_expression is that of the parameter; and
@@ -84180,34 +84460,34 @@ immediately within the instance, where:
10.b/4
Implementation Note: These rules have a dual purpose. Mainly,
- we are requiring checks needed to prevent dangling references.
- As a side effect, we are also allowing checks needed to permit
- an implementation of a container generic to make use of access
- types in a straightforward way. As an example of the second
- purpose, suppose that an implementation does declare such an
- access type and suppose further that the finalization of the
- collection of the access type has started. These rules allow
- Program_Error to be propagated in this case (as specified in
- *note 4.8::); this is necessary to allow an all-Ada
- implementation of these packages.
+ we are <requiring> checks needed to prevent dangling
+ references. As a side effect, we are also <allowing> checks
+ needed to permit an implementation of a container generic to
+ make use of access types in a straightforward way. As an
+ example of the second purpose, suppose that an implementation
+ does declare such an access type and suppose further that the
+ finalization of the collection of the access type has started.
+ These rules allow Program_Error to be propagated in this case
+ (as specified in *note 4.8::); this is necessary to allow an
+ all-Ada implementation of these packages.
_Extensions to Ada 95_
10.c/3
- {AI95-00302-03AI95-00302-03} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. It just provides an introduction to the
following subclauses.
_Wording Changes from Ada 2005_
10.d/3
- {AI05-0044-1AI05-0044-1} Correction: Added a definition of
+ {<AI05-0044-1AI05-0044-1>} Correction: Added a definition of
strict weak ordering.
_Wording Changes from Ada 2012_
10.e/4
- {AI05-0035-1AI05-0035-1} Corrigendum: Added a definition of
+ {<AI05-0035-1AI05-0035-1>} Corrigendum: Added a definition of
"performs indefinite insertion". This is used in other
subclauses and any resulting inconsistencies are documented
there.
@@ -84254,13 +84534,13 @@ A.18.1 The Package Containers
-----------------------------
1/2
-{AI95-00302-03AI95-00302-03} The package Containers is the root of the
+{<AI95-00302-03AI95-00302-03>} The package Containers is the root of the
containers subsystem.
_Static Semantics_
2/2
-{AI95-00302-03AI95-00302-03} The library package Containers has the
+{<AI95-00302-03AI95-00302-03>} The library package Containers has the
following declaration:
3/2
@@ -84268,19 +84548,19 @@ following declaration:
pragma Pure(Containers);
4/2
- type Hash_Type is mod implementation-defined;
+ type Hash_Type is mod <implementation-defined>;
5/2
- type Count_Type is range 0 .. implementation-defined;
+ type Count_Type is range 0 .. <implementation-defined>;
5.1/3
- {AI05-0001-1AI05-0001-1} Capacity_Error : exception;
+ {<AI05-0001-1AI05-0001-1>} Capacity_Error : exception;
6/2
end Ada.Containers;
7/2
-{AI95-00302-03AI95-00302-03} Hash_Type represents the range of the
+{<AI95-00302-03AI95-00302-03>} Hash_Type represents the range of the
result of a hash function. Count_Type represents the (potential or
actual) number of elements of a container.
@@ -84290,14 +84570,14 @@ actual) number of elements of a container.
Containers.Count_Type'Last.
7.1/3
-{AI05-0262-1AI05-0262-1} Capacity_Error is raised when the capacity of a
-container is exceeded.
+{<AI05-0262-1AI05-0262-1>} Capacity_Error is raised when the capacity of
+a container is exceeded.
_Implementation Advice_
8/2
-{AI95-00302-03AI95-00302-03} Hash_Type'Modulus should be at least 2**32.
-Count_Type'Last should be at least 2**31-1.
+{<AI95-00302-03AI95-00302-03>} Hash_Type'Modulus should be at least
+2**32. Count_Type'Last should be at least 2**31-1.
8.a/2
Implementation Advice: Containers.Hash_Type'Modulus should be
@@ -84313,15 +84593,15 @@ Count_Type'Last should be at least 2**31-1.
_Extensions to Ada 95_
8.c/2
- {AI95-00302-03AI95-00302-03} The package Containers is new.
+ {<AI95-00302-03AI95-00302-03>} The package Containers is new.
_Incompatibilities With Ada 2005_
8.d/3
- {AI05-0001-1AI05-0001-1} Exception Capacity_Error is added to
- Containers. If Containers is referenced in a use_clause, and
- an entity with the name Capacity_Error is defined in a package
- that is also referenced in a use_clause, the entity
+ {<AI05-0001-1AI05-0001-1>} Exception Capacity_Error is added
+ to Containers. If Containers is referenced in a use_clause,
+ and an entity with the name Capacity_Error is defined in a
+ package that is also referenced in a use_clause, the entity
Capacity_Error may no longer be use-visible, resulting in
errors. This should be rare and is easily fixed if it does
occur.
@@ -84338,12 +84618,12 @@ types Vector and Cursor, and a set of operations for
each type. A
vector container allows insertion and deletion at any position, but it
is specifically optimized for insertion and deletion at the high end
(the end with the higher index) of the container. A vector container
-also provides random access to its elements.
+also provides random access to its elements.
2/2
A vector container behaves conceptually as an array that expands as
-necessary as items are inserted. The length of a vector is the number
-of elements that the vector contains. The capacity of a vector is the
+necessary as items are inserted. The <length> of a vector is the number
+of elements that the vector contains. The <capacity> of a vector is the
maximum number of elements that can be inserted into the vector prior to
it being automatically expanded.
@@ -84353,7 +84633,7 @@ generic formal type. The first element of a vector
always has its index
value equal to the lower bound of the formal type.
4/2
-A vector container may contain empty elements. Empty elements do not
+A vector container may contain <empty elements>. Empty elements do not
have a specified value.
4.a/2
@@ -84371,11 +84651,11 @@ have a specified value.
_Static Semantics_
5/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Vectors has the following declaration:
6/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Index_Type is range <>;
type Element_Type is private;
@@ -84393,7 +84673,7 @@ Containers.Vectors has the following declaration:
No_Index : constant Extended_Index := Extended_Index'First;
8/3
- {AI05-0212-1AI05-0212-1} type Vector is tagged private
+ {<AI05-0212-1AI05-0212-1>} type Vector is tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
@@ -84411,10 +84691,10 @@ Containers.Vectors has the following declaration:
No_Element : constant Cursor;
11.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
11.2/3
- {AI05-0212-1AI05-0212-1} package Vector_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Vector_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
12/2
@@ -84513,39 +84793,39 @@ Containers.Vectors has the following declaration:
(Element : in out Element_Type));
34.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
34.2/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
34.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Vector;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Vector;
Index : in Index_Type)
return Constant_Reference_Type;
34.4/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Vector;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Vector;
Index : in Index_Type)
return Reference_Type;
34.5/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Vector;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Vector;
Position : in Cursor)
return Constant_Reference_Type;
34.6/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Vector;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Vector;
Position : in Cursor)
return Reference_Type;
34.7/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Vector;
Source : in Vector);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Vector;
Source : in Vector);
34.8/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Vector; Capacity :
Count_Type := 0)
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Vector; Capacity :
Count_Type := 0)
return Vector;
35/2
@@ -84717,7 +84997,7 @@ Containers.Vectors has the following declaration:
Item : Element_Type) return Boolean;
72/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
73/2
procedure Iterate
@@ -84730,11 +85010,11 @@ Containers.Vectors has the following declaration:
Process : not null access procedure (Position : in Cursor));
74.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Vector)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
74.2/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Vector;
Start : in Cursor)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Vector;
Start : in Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
75/2
@@ -84760,19 +85040,20 @@ Containers.Vectors has the following declaration:
private
81/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
82/2
end Ada.Containers.Vectors;
83/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function "=" on Element_Type values is expected to define a reflexive
-and symmetric relationship and return the same result value each time it
-is called with a particular pair of values. If it behaves in some other
-manner, the functions defined to use it return an unspecified value.
-The exact arguments and number of calls of this generic formal function
-by the functions defined to use it are unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function "=" on Element_Type values is expected to define a
+reflexive and symmetric relationship and return the same result value
+each time it is called with a particular pair of values. If it behaves
+in some other manner, the functions defined to use it return an
+unspecified value. The exact arguments and number of calls of this
+generic formal function by the functions defined to use it are
+unspecified.
83.a/2
Ramification: The "functions defined to use it" are Find,
@@ -84791,28 +85072,28 @@ by the functions defined to use it are unspecified.
is bad.
84/2
-{AI95-00302-03AI95-00302-03} The type Vector is used to represent
+{<AI95-00302-03AI95-00302-03>} The type Vector is used to represent
vectors. The type Vector needs finalization (see *note 7.6::).
85/2
-{AI95-00302-03AI95-00302-03} Empty_Vector represents the empty vector
+{<AI95-00302-03AI95-00302-03>} Empty_Vector represents the empty vector
object. It has a length of 0. If an object of type Vector is not
otherwise initialized, it is initialized to the same value as
Empty_Vector.
86/2
-{AI95-00302-03AI95-00302-03} No_Element represents a cursor that
+{<AI95-00302-03AI95-00302-03>} No_Element represents a cursor that
designates no element. If an object of type Cursor is not otherwise
initialized, it is initialized to the same value as No_Element.
87/2
-{AI95-00302-03AI95-00302-03} The predefined "=" operator for type Cursor
-returns True if both cursors are No_Element, or designate the same
-element in the same container.
+{<AI95-00302-03AI95-00302-03>} The predefined "=" operator for type
+Cursor returns True if both cursors are No_Element, or designate the
+same element in the same container.
88/2
-{AI95-00302-03AI95-00302-03} Execution of the default implementation of
-the Input, Output, Read, or Write attribute of type Cursor raises
+{<AI95-00302-03AI95-00302-03>} Execution of the default implementation
+of the Input, Output, Read, or Write attribute of type Cursor raises
Program_Error.
88.a/2
@@ -84824,14 +85105,14 @@ Program_Error.
specified if there is a need to support streaming.
88.1/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Vector'Write for a
-Vector object V writes Length(V) elements of the vector to the stream.
-It also may write additional information about the vector.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Vector'Write for a
+Vector object <V> writes Length(<V>) elements of the vector to the
+stream. It also may write additional information about the vector.
88.2/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Vector'Read reads the
-representation of a vector from the stream, and assigns to Item a vector
-with the same length and elements as was written by Vector'Write.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Vector'Read reads
+the representation of a vector from the stream, and assigns to <Item> a
+vector with the same length and elements as was written by Vector'Write.
88.b/3
Implementation Note: The Standard requires streaming of all
@@ -84849,7 +85130,7 @@ with the same length and elements as was written by
Vector'Write.
see *note A.18.19::.
89/2
-{AI95-00302-03AI95-00302-03} No_Index represents a position that does
+{<AI95-00302-03AI95-00302-03>} No_Index represents a position that does
not correspond to any element. The subtype Extended_Index includes the
indices covered by Index_Type plus the value No_Index and, if it exists,
the successor to the Index_Type'Last.
@@ -84863,7 +85144,7 @@ the successor to the Index_Type'Last.
empty vector).
89.1/3
-{AI05-0001-1AI05-0001-1} If an operation attempts to modify the vector
+{<AI05-0001-1AI05-0001-1>} If an operation attempts to modify the vector
such that the position of the last element would be greater than
Index_Type'Last, then the operation propagates Constraint_Error.
@@ -84873,7 +85154,7 @@ Index_Type'Last, then the operation propagates
Constraint_Error.
type of the index subtype.
90/2
-{AI95-00302-03AI95-00302-03} [Some operations of this generic package
+{<AI95-00302-03AI95-00302-03>} [Some operations of this generic package
have access-to-subprogram parameters. To ensure such operations are
well-defined, they guard against certain actions by the designated
subprogram. In particular, some operations check for "tampering with
@@ -84883,13 +85164,13 @@ elements" of a container because they depend on
elements of the
container not being replaced.]
91/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with cursors
-of a vector object V if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+cursors> of a vector object <V> if:
92/2
- * it inserts or deletes elements of V, that is, it calls the Insert,
- Insert_Space, Clear, Delete, or Set_Length procedures with V as a
- parameter; or
+ * it inserts or deletes elements of <V>, that is, it calls the
+ Insert, Insert_Space, Clear, Delete, or Set_Length procedures with
+ <V> as a parameter; or
92.a/2
To be honest: Operations which are defined to be equivalent to
@@ -84898,11 +85179,11 @@ of a vector object V if:
definition are included.
93/2
- * it finalizes V; or
+ * it finalizes <V>; or
93.1/3
- * {AI05-0001-1AI05-0001-1} it calls the Assign procedure with V as
- the Target parameter; or
+ * {<AI05-0001-1AI05-0001-1>} it calls the Assign procedure with <V>
+ as the Target parameter; or
93.a.1/3
Ramification: We don't need to explicitly mention
@@ -84911,23 +85192,23 @@ of a vector object V if:
already defined as tampering with cursors.
94/2
- * it calls the Move procedure with V as a parameter.
+ * it calls the Move procedure with <V> as a parameter.
94.a/2
Discussion: Swap, Sort, and Merge copy elements rather than
reordering them, so they don't tamper with cursors.
95/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with
-elements of a vector object V if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+elements> of a vector object <V> if:
96/2
- * it tampers with cursors of V; or
+ * it tampers with cursors of <V>; or
97/2
- * it replaces one or more elements of V, that is, it calls the
+ * it replaces one or more elements of <V>, that is, it calls the
Replace_Element, Reverse_Elements, or Swap procedures or the Sort
- or Merge procedures of an instance of Generic_Sorting with V as a
+ or Merge procedures of an instance of Generic_Sorting with <V> as a
parameter.
97.a/2
@@ -84938,15 +85219,16 @@ elements of a vector object V if:
so Update_Element does not cause a problem.
97.1/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-cursors is prohibited for a particular vector object V, Program_Error is
-propagated by a call of any language-defined subprogram that is defined
-to tamper with the cursors of V, leaving V unmodified. Similarly, when
-tampering with elements is prohibited for a particular vector object V,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with cursors is <prohibited> for a particular vector object <V>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the elements of V [(or tamper with the
-cursors of V)], leaving V unmodified. These checks are made before any
-other defined behavior of the body of the language-defined subprogram.
+that is defined to tamper with the cursors of <V>, leaving <V>
+unmodified. Similarly, when tampering with elements is <prohibited> for
+a particular vector object <V>, Program_Error is propagated by a call of
+any language-defined subprogram that is defined to tamper with the
+elements of <V> [(or tamper with the cursors of <V>)], leaving <V>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
97.b/3
Proof: Tampering with elements includes tampering with
@@ -84957,12 +85239,12 @@ other defined behavior of the body of the
language-defined subprogram.
function Has_Element (Position : Cursor) return Boolean;
97.3/3
- {AI05-0212-1AI05-0212-1} Returns True if Position designates
+ {<AI05-0212-1AI05-0212-1>} Returns True if Position designates
an element, and returns False otherwise.
97.c/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0212-1AI05-0212-1} This function might not detect
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0212-1AI05-0212-1>} This function might not detect
cursors that designate deleted elements; such cursors are
invalid (see below) and the result of calling Has_Element with
an invalid cursor is unspecified (but not erroneous).
@@ -84971,15 +85253,15 @@ other defined behavior of the body of the
language-defined subprogram.
function "=" (Left, Right : Vector) return Boolean;
99/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If Left
- and Right denote the same vector object, then the function
- returns True. If Left and Right have different lengths, then
- the function returns False. Otherwise, it compares each
- element in Left to the corresponding element in Right using
- the generic formal equality operator. If any such comparison
- returns False, the function returns False; otherwise, it
- returns True. Any exception raised during evaluation of
- element equality is propagated.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ Left and Right denote the same vector object, then the
+ function returns True. If Left and Right have different
+ lengths, then the function returns False. Otherwise, it
+ compares each element in Left to the corresponding element in
+ Right using the generic formal equality operator. If any such
+ comparison returns False, the function returns False;
+ otherwise, it returns True. Any exception raised during
+ evaluation of element equality is propagated.
99.a/2
Implementation Note: This wording describes the canonical
@@ -84995,8 +85277,8 @@ other defined behavior of the body of the
language-defined subprogram.
function To_Vector (Length : Count_Type) return Vector;
101/2
- {AI95-00302-03AI95-00302-03} Returns a vector with a length of
- Length, filled with empty elements.
+ {<AI95-00302-03AI95-00302-03>} Returns a vector with a length
+ of Length, filled with empty elements.
102/2
function To_Vector
@@ -85004,15 +85286,15 @@ other defined behavior of the body of the
language-defined subprogram.
Length : Count_Type) return Vector;
103/2
- {AI95-00302-03AI95-00302-03} Returns a vector with a length of
- Length, filled with elements initialized to the value
+ {<AI95-00302-03AI95-00302-03>} Returns a vector with a length
+ of Length, filled with elements initialized to the value
New_Item.
104/2
function "&" (Left, Right : Vector) return Vector;
105/2
- {AI95-00302-03AI95-00302-03} Returns a vector comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a vector comprising the
elements of Left followed by the elements of Right.
106/2
@@ -85020,7 +85302,7 @@ other defined behavior of the body of the
language-defined subprogram.
Right : Element_Type) return Vector;
107/2
- {AI95-00302-03AI95-00302-03} Returns a vector comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a vector comprising the
elements of Left followed by the element Right.
108/2
@@ -85028,21 +85310,21 @@ other defined behavior of the body of the
language-defined subprogram.
Right : Vector) return Vector;
109/2
- {AI95-00302-03AI95-00302-03} Returns a vector comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a vector comprising the
element Left followed by the elements of Right.
110/2
function "&" (Left, Right : Element_Type) return Vector;
111/2
- {AI95-00302-03AI95-00302-03} Returns a vector comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a vector comprising the
element Left followed by the element Right.
112/2
function Capacity (Container : Vector) return Count_Type;
113/2
- {AI95-00302-03AI95-00302-03} Returns the capacity of
+ {<AI95-00302-03AI95-00302-03>} Returns the capacity of
Container.
114/2
@@ -85050,8 +85332,8 @@ other defined behavior of the body of the
language-defined subprogram.
Capacity : in Count_Type);
115/3
- {AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1}
- {AI05-0264-1AI05-0264-1} If the capacity of Container is
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>}
+ {<AI05-0264-1AI05-0264-1>} If the capacity of Container is
already greater than or equal to Capacity, then
Reserve_Capacity has no effect. Otherwise, Reserve_Capacity
allocates additional storage as necessary to ensure that the
@@ -85091,15 +85373,15 @@ other defined behavior of the body of the
language-defined subprogram.
function Length (Container : Vector) return Count_Type;
117/2
- {AI95-00302-03AI95-00302-03} Returns the number of elements in
- Container.
+ {<AI95-00302-03AI95-00302-03>} Returns the number of elements
+ in Container.
118/2
procedure Set_Length (Container : in out Vector;
Length : in Count_Type);
119/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Length is larger than the capacity of Container, Set_Length
calls Reserve_Capacity (Container, Length), then sets the
length of the Container to Length. If Length is greater than
@@ -85117,14 +85399,14 @@ other defined behavior of the body of the
language-defined subprogram.
function Is_Empty (Container : Vector) return Boolean;
121/2
- {AI95-00302-03AI95-00302-03} Equivalent to Length (Container)
- = 0.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Length
+ (Container) = 0.
122/2
procedure Clear (Container : in out Vector);
123/2
- {AI95-00302-03AI95-00302-03} Removes all the elements from
+ {<AI95-00302-03AI95-00302-03>} Removes all the elements from
Container. The capacity of Container does not change.
124/2
@@ -85132,7 +85414,7 @@ other defined behavior of the body of the
language-defined subprogram.
Index : Extended_Index) return Cursor;
125/2
- {AI95-00302-03AI95-00302-03} If Index is not in the range
+ {<AI95-00302-03AI95-00302-03>} If Index is not in the range
First_Index (Container) .. Last_Index (Container), then
No_Element is returned. Otherwise, a cursor designating the
element at position Index in Container is returned.
@@ -85141,7 +85423,7 @@ other defined behavior of the body of the
language-defined subprogram.
function To_Index (Position : Cursor) return Extended_Index;
127/2
- {AI95-00302-03AI95-00302-03} If Position is No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position is No_Element,
No_Index is returned. Otherwise, the index (within its
containing vector) of the element designated by Position is
returned.
@@ -85161,7 +85443,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Element_Type;
129/2
- {AI95-00302-03AI95-00302-03} If Index is not in the range
+ {<AI95-00302-03AI95-00302-03>} If Index is not in the range
First_Index (Container) .. Last_Index (Container), then
Constraint_Error is propagated. Otherwise, Element returns
the element at position Index.
@@ -85170,7 +85452,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Element (Position : Cursor) return Element_Type;
131/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. Otherwise, Element
returns the element designated by Position.
@@ -85180,13 +85462,13 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Element_Type);
133/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If Index
- is not in the range First_Index (Container) .. Last_Index
- (Container), then Constraint_Error is propagated. Otherwise,
- Replace_Element assigns the value New_Item to the element at
- position Index. Any exception raised during the assignment is
- propagated. The element at position Index is not an empty
- element after successful call to Replace_Element.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ Index is not in the range First_Index (Container) ..
+ Last_Index (Container), then Constraint_Error is propagated.
+ Otherwise, Replace_Element assigns the value New_Item to the
+ element at position Index. Any exception raised during the
+ assignment is propagated. The element at position Index is
+ not an empty element after successful call to Replace_Element.
134/2
procedure Replace_Element (Container : in out Vector;
@@ -85194,7 +85476,7 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Element_Type);
135/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
@@ -85204,7 +85486,7 @@ other defined behavior of the body of the
language-defined subprogram.
after successful call to Replace_Element.
135.a/3
- Ramification: {AI05-0212-1AI05-0212-1} Replace_Element,
+ Ramification: {<AI05-0212-1AI05-0212-1>} Replace_Element,
Update_Element, and Reference are the only ways that an
element can change from empty to nonempty. Also see the note
following Update_Element.
@@ -85216,17 +85498,17 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in Element_Type));
137/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} If Index
- is not in the range First_Index (Container) .. Last_Index
- (Container), then Constraint_Error is propagated. Otherwise,
- Query_Element calls Process.all with the element at position
- Index as the argument. Tampering with the elements of
- Container is prohibited during the execution of the call on
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>} If
+ Index is not in the range First_Index (Container) ..
+ Last_Index (Container), then Constraint_Error is propagated.
+ Otherwise, Query_Element calls Process.all with the element at
+ position Index as the argument. Tampering with the elements
+ of Container is prohibited during the execution of the call on
Process.all. Any exception raised by Process.all is
propagated.
137.a/2
- Reason: {AI05-0005-1AI05-0005-1} The "tamper with the
+ Reason: {<AI05-0005-1AI05-0005-1>} The "tamper with the
elements" check is intended to prevent the Element parameter
of Process from being replaced or deleted outside of Process.
The check prevents data loss (if Element_Type is passed by
@@ -85239,8 +85521,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in Element_Type));
139/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated. Otherwise, Query_Element
calls Process.all with the element designated by Position as
the argument. Tampering with the elements of the vector that
@@ -85255,14 +85537,14 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in out Element_Type));
141/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} If Index
- is not in the range First_Index (Container) .. Last_Index
- (Container), then Constraint_Error is propagated. Otherwise,
- Update_Element calls Process.all with the element at position
- Index as the argument. Tampering with the elements of
- Container is prohibited during the execution of the call on
- Process.all. Any exception raised by Process.all is
- propagated.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>} If
+ Index is not in the range First_Index (Container) ..
+ Last_Index (Container), then Constraint_Error is propagated.
+ Otherwise, Update_Element calls Process.all with the element
+ at position Index as the argument. Tampering with the
+ elements of Container is prohibited during the execution of
+ the call on Process.all. Any exception raised by Process.all
+ is propagated.
142/2
If Element_Type is unconstrained and definite, then the actual
@@ -85289,8 +85571,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in out Element_Type));
145/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated; if Position does not designate
an element in Container, then Program_Error is propagated.
Otherwise, Update_Element calls Process.all with the element
@@ -85317,8 +85599,8 @@ other defined behavior of the body of the
language-defined subprogram.
with Implicit_Dereference => Element;
147.3/3
- {AI05-0212-1AI05-0212-1} The types Constant_Reference_Type and
- Reference_Type need finalization.
+ {<AI05-0212-1AI05-0212-1>} The types Constant_Reference_Type
+ and Reference_Type need finalization.
147.4/3
The default initialization of an object of type
@@ -85340,15 +85622,15 @@ other defined behavior of the body of the
language-defined subprogram.
return Constant_Reference_Type;
147.6/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a vector given an
index value.
147.7/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Index is
- not in the range First_Index (Container) .. Last_Index
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If Index
+ is not in the range First_Index (Container) .. Last_Index
(Container), then Constraint_Error is propagated. Otherwise,
Constant_Reference returns an object whose discriminant is an
access value that designates the element at position Index.
@@ -85362,15 +85644,15 @@ other defined behavior of the body of the
language-defined subprogram.
return Reference_Type;
147.9/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a
vector given an index value.
147.10/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Index is
- not in the range First_Index (Container) .. Last_Index
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If Index
+ is not in the range First_Index (Container) .. Last_Index
(Container), then Constraint_Error is propagated. Otherwise,
Reference returns an object whose discriminant is an access
value that designates the element at position Index.
@@ -85388,22 +85670,22 @@ other defined behavior of the body of the
language-defined subprogram.
return Constant_Reference_Type;
147.13/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a vector given a
cursor.
147.14/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Constant_Reference
- returns an object whose discriminant is an access value that
- designates the element designated by Position. Tampering with
- the elements of Container is prohibited while the object
- returned by Constant_Reference exists and has not been
- finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Constant_Reference returns an object whose discriminant is an
+ access value that designates the element designated by
+ Position. Tampering with the elements of Container is
+ prohibited while the object returned by Constant_Reference
+ exists and has not been finalized.
147.15/3
function Reference (Container : aliased in out Vector;
@@ -85411,21 +85693,22 @@ other defined behavior of the body of the
language-defined subprogram.
return Reference_Type;
147.16/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a
vector given a cursor.
147.17/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Reference returns an
- object whose discriminant is an access value that designates
- the element designated by Position. Tampering with the
- elements of Container is prohibited while the object returned
- by Reference exists and has not been finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Reference returns an object whose discriminant is an access
+ value that designates the element designated by Position.
+ Tampering with the elements of Container is prohibited while
+ the object returned by Reference exists and has not been
+ finalized.
147.18/3
The element designated by Position is not an empty element
@@ -85435,17 +85718,17 @@ other defined behavior of the body of the
language-defined subprogram.
procedure Assign (Target : in out Vector; Source : in Vector);
147.20/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} If Target denotes the same object as
- Source, the operation has no effect. If the length of Source
- is greater than the capacity of Target, Reserve_Capacity
- (Target, Length (Source)) is called. The elements of Source
- are then copied to Target as for an assignment_statement
- assigning Source to Target (this includes setting the length
- of Target to be that of Source).
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} If Target denotes the same object
+ as Source, the operation has no effect. If the length of
+ Source is greater than the capacity of Target,
+ Reserve_Capacity (Target, Length (Source)) is called. The
+ elements of Source are then copied to Target as for an
+ assignment_statement assigning Source to Target (this includes
+ setting the length of Target to be that of Source).
147.b/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the bounded vector container. For an
unbounded vector, Assign(A, B) and A := B behave identically.
For a bounded vector, := will raise an exception if the
@@ -85457,7 +85740,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Vector;
147.22/3
- {AI05-0001-1AI05-0001-1} Returns a vector whose elements are
+ {<AI05-0001-1AI05-0001-1>} Returns a vector whose elements are
initialized from the corresponding elements of Source. If
Capacity is 0, then the vector capacity is the length of
Source; if Capacity is equal to or greater than the length of
@@ -85469,9 +85752,9 @@ other defined behavior of the body of the
language-defined subprogram.
Source : in out Vector);
149/3
- {AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1}
- {AI05-0248-1AI05-0248-1} If Target denotes the same object as
- Source, then the operation has no effect. Otherwise, Move
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>}
+ {<AI05-0248-1AI05-0248-1>} If Target denotes the same object
+ as Source, then the operation has no effect. Otherwise, Move
first calls Reserve_Capacity (Target, Length (Source)) and
then Clear (Target); then, each element from Source is removed
from Source and inserted into Target in the original order.
@@ -85491,18 +85774,18 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Vector);
151/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Length(New_Item) is 0, then Insert does
- nothing. Otherwise, it computes the new length NL as the sum
- of the current length and Length (New_Item); if the value of
- Last appropriate for length NL would be greater than
+ nothing. Otherwise, it computes the new length <NL> as the
+ sum of the current length and Length (New_Item); if the value
+ of Last appropriate for length <NL> would be greater than
Index_Type'Last, then Constraint_Error is propagated.
152/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert slides the elements in the range
Before .. Last_Index (Container) up by Length(New_Item)
positions, and then copies the elements of New_Item to the
@@ -85522,7 +85805,7 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Vector);
154/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Before is not No_Element, and does not designate an element in
Container, then Program_Error is propagated. Otherwise, if
Length(New_Item) is 0, then Insert does nothing. If Before is
@@ -85546,12 +85829,13 @@ other defined behavior of the body of the
language-defined subprogram.
Position : out Cursor);
156/2
- {AI95-00302-03AI95-00302-03} If Before is not No_Element, and
- does not designate an element in Container, then Program_Error
- is propagated. If Before equals No_Element, then let T be
- Last_Index (Container) + 1; otherwise, let T be To_Index
- (Before). Insert (Container, T, New_Item) is called, and then
- Position is set to To_Cursor (Container, T).
+ {<AI95-00302-03AI95-00302-03>} If Before is not No_Element,
+ and does not designate an element in Container, then
+ Program_Error is propagated. If Before equals No_Element,
+ then let <T> be Last_Index (Container) + 1; otherwise, let <T>
+ be To_Index (Before). Insert (Container, <T>, New_Item) is
+ called, and then Position is set to To_Cursor (Container,
+ <T>).
156.a/2
Discussion: The messy wording is needed because Before is
@@ -85566,8 +85850,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
158/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- Before, To_Vector (New_Item, Count));
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, Before, To_Vector (New_Item, Count));
159/2
procedure Insert (Container : in out Vector;
@@ -85576,8 +85860,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
160/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- Before, To_Vector (New_Item, Count));
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, Before, To_Vector (New_Item, Count));
161/2
procedure Insert (Container : in out Vector;
@@ -85587,11 +85871,11 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
162/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- Before, To_Vector (New_Item, Count), Position);
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, Before, To_Vector (New_Item, Count), Position);
162.a/3
- Ramification: {AI05-0257-1AI05-0257-1} If Count equals 0,
+ Ramification: {<AI05-0257-1AI05-0257-1>} If Count equals 0,
Position will designate the element designated by Before,
rather than a newly inserted element. Otherwise, Position
will designate the first newly inserted element.
@@ -85602,18 +85886,18 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
164/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Count is 0, then Insert does nothing.
- Otherwise, it computes the new length NL as the sum of the
+ Otherwise, it computes the new length <NL> as the sum of the
current length and Count; if the value of Last appropriate for
- length NL would be greater than Index_Type'Last, then
+ length <NL> would be greater than Index_Type'Last, then
Constraint_Error is propagated.
165/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert slides the elements in the range
Before .. Last_Index (Container) up by Count positions, and
then inserts elements that are initialized by default (see
@@ -85626,12 +85910,13 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
167/2
- {AI95-00302-03AI95-00302-03} If Before is not No_Element, and
- does not designate an element in Container, then Program_Error
- is propagated. If Before equals No_Element, then let T be
- Last_Index (Container) + 1; otherwise, let T be To_Index
- (Before). Insert (Container, T, Count) is called, and then
- Position is set to To_Cursor (Container, T).
+ {<AI95-00302-03AI95-00302-03>} If Before is not No_Element,
+ and does not designate an element in Container, then
+ Program_Error is propagated. If Before equals No_Element,
+ then let <T> be Last_Index (Container) + 1; otherwise, let <T>
+ be To_Index (Before). Insert (Container, <T>, Count) is
+ called, and then Position is set to To_Cursor (Container,
+ <T>).
167.a/2
Reason: This routine exists mainly to ease conversion between
@@ -85640,12 +85925,12 @@ other defined behavior of the body of the
language-defined subprogram.
expensive for some element types.
168/4
- {AI12-0080-1AI12-0080-1} procedure Prepend (Container : in out Vector;
+ {<AI12-0080-1AI12-0080-1>} procedure Prepend (Container : in out Vector;
New_Item : in Vector);
169/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- First_Index (Container), New_Item).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, First_Index (Container), New_Item).
170/2
procedure Prepend (Container : in out Vector;
@@ -85653,16 +85938,16 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
171/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- First_Index (Container), New_Item, Count).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, First_Index (Container), New_Item, Count).
172/2
procedure Append (Container : in out Vector;
New_Item : in Vector);
173/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- Last_Index (Container) + 1, New_Item).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, Last_Index (Container) + 1, New_Item).
174/2
procedure Append (Container : in out Vector;
@@ -85670,8 +85955,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
175/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- Last_Index (Container) + 1, New_Item, Count).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, Last_Index (Container) + 1, New_Item, Count).
176/2
procedure Insert_Space (Container : in out Vector;
@@ -85679,18 +85964,18 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
177/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Count is 0, then Insert_Space does nothing.
- Otherwise, it computes the new length NL as the sum of the
+ Otherwise, it computes the new length <NL> as the sum of the
current length and Count; if the value of Last appropriate for
- length NL would be greater than Index_Type'Last, then
+ length <NL> would be greater than Index_Type'Last, then
Constraint_Error is propagated.
178/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert_Space slides the elements in the
range Before .. Last_Index (Container) up by Count positions,
and then inserts empty elements in the positions starting at
@@ -85703,12 +85988,13 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
180/2
- {AI95-00302-03AI95-00302-03} If Before is not No_Element, and
- does not designate an element in Container, then Program_Error
- is propagated. If Before equals No_Element, then let T be
- Last_Index (Container) + 1; otherwise, let T be To_Index
- (Before). Insert_Space (Container, T, Count) is called, and
- then Position is set to To_Cursor (Container, T).
+ {<AI95-00302-03AI95-00302-03>} If Before is not No_Element,
+ and does not designate an element in Container, then
+ Program_Error is propagated. If Before equals No_Element,
+ then let <T> be Last_Index (Container) + 1; otherwise, let <T>
+ be To_Index (Before). Insert_Space (Container, <T>, Count) is
+ called, and then Position is set to To_Cursor (Container,
+ <T>).
181/2
procedure Delete (Container : in out Vector;
@@ -85716,13 +86002,13 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
182/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If Index
- is not in the range First_Index (Container) .. Last_Index
- (Container) + 1, then Constraint_Error is propagated. If
- Count is 0, Delete has no effect. Otherwise, Delete slides
- the elements (if any) starting at position Index + Count down
- to Index. Any exception raised during element assignment is
- propagated.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ Index is not in the range First_Index (Container) ..
+ Last_Index (Container) + 1, then Constraint_Error is
+ propagated. If Count is 0, Delete has no effect. Otherwise,
+ Delete slides the elements (if any) starting at position Index
+ + Count down to Index. Any exception raised during element
+ assignment is propagated.
182.a/2
Ramification: If Index + Count >= Last_Index(Container), this
@@ -85735,7 +86021,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
184/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. If Position does not
designate an element in Container, then Program_Error is
propagated. Otherwise, Delete (Container, To_Index
@@ -85747,25 +86033,25 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
186/2
- {AI95-00302-03AI95-00302-03} Equivalent to Delete (Container,
- First_Index (Container), Count).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Delete
+ (Container, First_Index (Container), Count).
187/2
procedure Delete_Last (Container : in out Vector;
Count : in Count_Type := 1);
188/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Length (Container) <= Count, then Delete_Last is equivalent to
Clear (Container). Otherwise, it is equivalent to Delete
(Container, Index_Type'Val(Index_Type'Pos(Last_Index
(Container)) - Count + 1), Count).
189/2
- {AI05-0092-1AI05-0092-1} procedure Reverse_Elements (Container : in out
Vector);
+ {<AI05-0092-1AI05-0092-1>} procedure Reverse_Elements (Container : in out
Vector);
190/2
- {AI95-00302-03AI95-00302-03} Reorders the elements of
+ {<AI95-00302-03AI95-00302-03>} Reorders the elements of
Container in reverse order.
190.a/2
@@ -85778,7 +86064,7 @@ other defined behavior of the body of the
language-defined subprogram.
I, J : in Index_Type);
192/2
- {AI95-00302-03AI95-00302-03} If either I or J is not in the
+ {<AI95-00302-03AI95-00302-03>} If either I or J is not in the
range First_Index (Container) .. Last_Index (Container), then
Constraint_Error is propagated. Otherwise, Swap exchanges the
values of the elements at positions I and J.
@@ -85793,7 +86079,7 @@ other defined behavior of the body of the
language-defined subprogram.
I, J : in Cursor);
194/2
- {AI95-00302-03AI95-00302-03} If either I or J is No_Element,
+ {<AI95-00302-03AI95-00302-03>} If either I or J is No_Element,
then Constraint_Error is propagated. If either I or J do not
designate an element in Container, then Program_Error is
propagated. Otherwise, Swap exchanges the values of the
@@ -85814,7 +86100,7 @@ other defined behavior of the body of the
language-defined subprogram.
function First_Index (Container : Vector) return Index_Type;
196/2
- {AI95-00302-03AI95-00302-03} Returns the value
+ {<AI95-00302-03AI95-00302-03>} Returns the value
Index_Type'First.
196.a/2
@@ -85826,7 +86112,7 @@ other defined behavior of the body of the
language-defined subprogram.
function First (Container : Vector) return Cursor;
198/2
- {AI95-00302-03AI95-00302-03} If Container is empty, First
+ {<AI95-00302-03AI95-00302-03>} If Container is empty, First
returns No_Element. Otherwise, it returns a cursor that
designates the first element in Container.
@@ -85834,22 +86120,22 @@ other defined behavior of the body of the
language-defined subprogram.
function First_Element (Container : Vector) return Element_Type;
200/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Container,
- First_Index (Container)).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element
+ (Container, First_Index (Container)).
201/2
function Last_Index (Container : Vector) return Extended_Index;
202/2
- {AI95-00302-03AI95-00302-03} If Container is empty, Last_Index
- returns No_Index. Otherwise, it returns the position of the
- last element in Container.
+ {<AI95-00302-03AI95-00302-03>} If Container is empty,
+ Last_Index returns No_Index. Otherwise, it returns the
+ position of the last element in Container.
203/2
function Last (Container : Vector) return Cursor;
204/2
- {AI95-00302-03AI95-00302-03} If Container is empty, Last
+ {<AI95-00302-03AI95-00302-03>} If Container is empty, Last
returns No_Element. Otherwise, it returns a cursor that
designates the last element in Container.
@@ -85857,15 +86143,15 @@ other defined behavior of the body of the
language-defined subprogram.
function Last_Element (Container : Vector) return Element_Type;
206/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Container,
- Last_Index (Container)).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element
+ (Container, Last_Index (Container)).
207/2
function Next (Position : Cursor) return Cursor;
208/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element or
- designates the last element of the container, then Next
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element
+ or designates the last element of the container, then Next
returns the value No_Element. Otherwise, it returns a cursor
that designates the element with index To_Index (Position) + 1
in the same vector as Position.
@@ -85874,24 +86160,24 @@ other defined behavior of the body of the
language-defined subprogram.
procedure Next (Position : in out Cursor);
210/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position := Next
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position := Next
(Position).
211/2
function Previous (Position : Cursor) return Cursor;
212/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element or
- designates the first element of the container, then Previous
- returns the value No_Element. Otherwise, it returns a cursor
- that designates the element with index To_Index (Position) - 1
- in the same vector as Position.
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element
+ or designates the first element of the container, then
+ Previous returns the value No_Element. Otherwise, it returns
+ a cursor that designates the element with index To_Index
+ (Position) - 1 in the same vector as Position.
213/2
procedure Previous (Position : in out Cursor);
214/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position :=
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position :=
Previous (Position).
215/2
@@ -85901,7 +86187,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Extended_Index;
216/2
- {AI95-00302-03AI95-00302-03} Searches the elements of
+ {<AI95-00302-03AI95-00302-03>} Searches the elements of
Container for an element equal to Item (using the generic
formal equality operator). The search starts at position
Index and proceeds towards Last_Index (Container). If no
@@ -85916,7 +86202,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
218/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position is not No_Element, and does not designate an element
in Container, then Program_Error is propagated. Otherwise,
Find searches the elements of Container for an element equal
@@ -85935,7 +86221,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Extended_Index;
220/2
- {AI95-00302-03AI95-00302-03} Searches the elements of
+ {<AI95-00302-03AI95-00302-03>} Searches the elements of
Container for an element equal to Item (using the generic
formal equality operator). The search starts at position
Index or, if Index is greater than Last_Index (Container), at
@@ -85951,7 +86237,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
222/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position is not No_Element, and does not designate an element
in Container, then Program_Error is propagated. Otherwise,
Reverse_Find searches the elements of Container for an element
@@ -85968,10 +86254,10 @@ other defined behavior of the body of the
language-defined subprogram.
Item : Element_Type) return Boolean;
224/2
- {AI95-00302-03AI95-00302-03} Equivalent to Has_Element (Find
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Has_Element (Find
(Container, Item)).
- Paragraphs 225 and 226 were moved above.
+ <Paragraphs 225 and 226 were moved above.>
227/2
procedure Iterate
@@ -85979,9 +86265,9 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
228/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} Invokes
- Process.all with a cursor that designates each element in
- Container, in index order. Tampering with the cursors of
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>}
+ Invokes Process.all with a cursor that designates each element
+ in Container, in index order. Tampering with the cursors of
Container is prohibited during the execution of a call on
Process.all. Any exception raised by Process.all is
propagated.
@@ -86014,36 +86300,38 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
230/3
- {AI95-00302-03AI95-00302-03} {AI05-0212-1AI05-0212-1} Iterates
- over the elements in Container as per procedure Iterate,
- except that elements are traversed in reverse index order.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0212-1AI05-0212-1>}
+ Iterates over the elements in Container as per procedure
+ Iterate, except that elements are traversed in reverse index
+ order.
230.1/3
function Iterate (Container : in Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
230.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns a reversible iterator
- object (see *note 5.5.1::) that will generate a value for a
- loop parameter (see *note 5.5.2::) designating each node in
- Container, starting with the first node and moving the cursor
- as per the Next function when used as a forward iterator, and
- starting with the last node and moving the cursor as per the
- Previous function when used as a reverse iterator. Tampering
- with the cursors of Container is prohibited while the iterator
- object exists (in particular, in the sequence_of_statements of
- the loop_statement whose iterator_specification denotes this
- object). The iterator object needs finalization.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns a reversible
+ iterator object (see *note 5.5.1::) that will generate a value
+ for a loop parameter (see *note 5.5.2::) designating each node
+ in Container, starting with the first node and moving the
+ cursor as per the Next function when used as a forward
+ iterator, and starting with the last node and moving the
+ cursor as per the Previous function when used as a reverse
+ iterator. Tampering with the cursors of Container is
+ prohibited while the iterator object exists (in particular, in
+ the sequence_of_statements of the loop_statement whose
+ iterator_specification denotes this object). The iterator
+ object needs finalization.
230.3/3
function Iterate (Container : in Vector; Start : in Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class;
230.4/3
- {AI05-0212-1AI05-0212-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} {AI05-0269-1AI05-0269-1} If Start is
- not No_Element and does not designate an item in Container,
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} {<AI05-0269-1AI05-0269-1>} If Start
+ is not No_Element and does not designate an item in Container,
then Program_Error is propagated. If Start is No_Element,
then Constraint_Error is propagated. Otherwise, Iterate
returns a reversible iterator object (see *note 5.5.1::) that
@@ -86071,29 +86359,30 @@ other defined behavior of the body of the
language-defined subprogram.
parameter and Stop is the cursor that you want to stop at).
231/3
-{AI05-0044-1AI05-0044-1} {AI05-0262-1AI05-0262-1} The actual function
-for the generic formal function "<" of Generic_Sorting 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 *note A.18::); it should not modify Container. If the actual for
-"<" behaves in some other manner, the behavior of the subprograms of
-Generic_Sorting are unspecified. The number of times the subprograms of
-Generic_Sorting call "<" is unspecified.
+{<AI05-0044-1AI05-0044-1>} {<AI05-0262-1AI05-0262-1>} The actual
+function for the generic formal function "<" of Generic_Sorting 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 *note A.18::); it should not modify
+Container. If the actual for "<" behaves in some other manner, the
+behavior of the subprograms of Generic_Sorting are unspecified. The
+number of times the subprograms of Generic_Sorting call "<" is
+unspecified.
232/2
function Is_Sorted (Container : Vector) return Boolean;
233/2
- {AI95-00302-03AI95-00302-03} Returns True if the elements are
- sorted smallest first as determined by the generic formal "<"
- operator; otherwise, Is_Sorted returns False. Any exception
- raised during evaluation of "<" is propagated.
+ {<AI95-00302-03AI95-00302-03>} Returns True if the elements
+ are sorted smallest first as determined by the generic formal
+ "<" operator; otherwise, Is_Sorted returns False. Any
+ exception raised during evaluation of "<" is propagated.
234/2
procedure Sort (Container : in out Vector);
235/2
- {AI95-00302-03AI95-00302-03} Reorders the elements of
+ {<AI95-00302-03AI95-00302-03>} Reorders the elements of
Container such that the elements are sorted smallest first as
determined by the generic formal "<" operator provided. Any
exception raised during evaluation of "<" is propagated.
@@ -86122,7 +86411,7 @@ Generic_Sorting call "<" is unspecified.
Source : in out Vector);
237/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>} If
Source is empty, then Merge does nothing. If Source and
Target are the same nonempty container object, then
Program_Error is propagated. Otherwise, Merge removes
@@ -86154,13 +86443,13 @@ Generic_Sorting call "<" is unspecified.
_Bounded (Run-Time) Errors_
238/3
-{AI95-00302-03AI95-00302-03} {AI05-0212-1AI05-0212-1} Reading the value
-of an empty element by calling Element, Query_Element, Update_Element,
-Constant_Reference, Reference, Swap, Is_Sorted, Sort, Merge, "=", Find,
-or Reverse_Find is a bounded error. The implementation may treat the
-element as having any normal value (see *note 13.9.1::) of the element
-type, or raise Constraint_Error or Program_Error before modifying the
-vector.
+{<AI95-00302-03AI95-00302-03>} {<AI05-0212-1AI05-0212-1>} Reading the
+value of an empty element by calling Element, Query_Element,
+Update_Element, Constant_Reference, Reference, Swap, Is_Sorted, Sort,
+Merge, "=", Find, or Reverse_Find is a bounded error. The
+implementation may treat the element as having any normal value (see
+*note 13.9.1::) of the element type, or raise Constraint_Error or
+Program_Error before modifying the vector.
238.a/2
Ramification: For instance, a default initialized element
@@ -86180,23 +86469,23 @@ vector.
operations listed above.
239/2
-{AI95-00302-03AI95-00302-03} Calling Merge in an instance of
+{<AI95-00302-03AI95-00302-03>} Calling Merge in an instance of
Generic_Sorting with either Source or Target not ordered smallest first
using the provided generic formal "<" operator is a bounded error.
Either Program_Error is raised after Target is updated as described for
Merge, or the operation works as defined.
239.1/3
-{AI05-0022-1AI05-0022-1} {AI05-0248-1AI05-0248-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of this package, to tamper with
-elements of any Vector parameter of the operation. Either Program_Error
-is raised, or the operation works as defined on the value of the Vector
-either prior to, or subsequent to, some or all of the modifications to
-the Vector.
+{<AI05-0022-1AI05-0022-1>} {<AI05-0248-1AI05-0248-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of this package, to
+tamper with elements of any Vector parameter of the operation. Either
+Program_Error is raised, or the operation works as defined on the value
+of the Vector either prior to, or subsequent to, some or all of the
+modifications to the Vector.
239.2/3
-{AI05-0027-1AI05-0027-1} It is a bounded error to call any subprogram
+{<AI05-0027-1AI05-0027-1>} It is a bounded error to call any subprogram
declared in the visible part of Containers.Vectors when the associated
container has been finalized. If the operation takes Container as an in
out parameter, then it raises Constraint_Error or Program_Error.
@@ -86204,8 +86493,8 @@ Otherwise, the operation either proceeds as it would
for an empty
container, or it raises Constraint_Error or Program_Error.
240/2
-{AI95-00302-03AI95-00302-03} A Cursor value is ambiguous if any of the
-following have occurred since it was created:
+{<AI95-00302-03AI95-00302-03>} A Cursor value is <ambiguous> if any of
+the following have occurred since it was created:
241/2
* Insert, Insert_Space, or Delete has been called on the vector that
@@ -86220,7 +86509,7 @@ following have occurred since it was created:
or to the Reverse_Elements procedure.
243/2
-{AI95-00302-03AI95-00302-03} It is a bounded error to call any
+{<AI95-00302-03AI95-00302-03>} It is a bounded error to call any
subprogram other than "=" or Has_Element declared in Containers.Vectors
with an ambiguous (but not invalid, see below) cursor parameter.
Possible results are:
@@ -86243,7 +86532,7 @@ Possible results are:
occurs that moves the elements in the internal array including
the designated ones. After such an operation, the cursor
probably still designates an element (although it might not
- after a deletion), but it is a different element. That
+ after a deletion), but it is a <different> element. That
violates the definition of cursor -- it designates a
particular element.
@@ -86261,7 +86550,7 @@ Possible results are:
_Erroneous Execution_
248/2
-{AI95-00302-03AI95-00302-03} A Cursor value is invalid if any of the
+{<AI95-00302-03AI95-00302-03>} A Cursor value is <invalid> if any of the
following have occurred since it was created:
249/2
@@ -86269,7 +86558,7 @@ following have occurred since it was created:
finalized;
249.1/3
- * {AI05-0160-1AI05-0160-1} The vector that contains the element it
+ * {<AI05-0160-1AI05-0160-1>} The vector that contains the element it
designates has been used as the Target of a call to Assign, or as
the target of an assignment_statement;
@@ -86278,22 +86567,22 @@ following have occurred since it was created:
as the Source or Target of a call to Move;] or
250.a/3
- Proof: {AI05-0001-1AI05-0001-1} Move has been reworded in
+ Proof: {<AI05-0001-1AI05-0001-1>} Move has been reworded in
terms of Assign and Clear, which are covered by other bullets,
so this text is redundant.
251/3
- * {AI05-0160-1AI05-0160-1} {AI05-0262-1AI05-0262-1} The element it
- designates has been deleted or removed from the vector that
+ * {<AI05-0160-1AI05-0160-1>} {<AI05-0262-1AI05-0262-1>} The element
+ it designates has been deleted or removed from the vector that
previously contained the element.
251.a/3
- Ramification: {AI05-0160-1AI05-0160-1} An element can be
+ Ramification: {<AI05-0160-1AI05-0160-1>} An element can be
removed via calls to Set_Length, Clear, and Merge; and
indirectly via calls to Assign and Move.
252/2
-{AI95-00302-03AI95-00302-03} The result of "=" or Has_Element is
+{<AI95-00302-03AI95-00302-03>} The result of "=" or Has_Element is
unspecified if it is called with an invalid cursor parameter. Execution
is erroneous if any other subprogram declared in Containers.Vectors is
called with an invalid cursor parameter.
@@ -86305,10 +86594,10 @@ called with an invalid cursor parameter.
instance, cursor values survive the appending of new elements.
252.1/3
-{AI05-0212-1AI05-0212-1} Execution is erroneous if the vector associated
-with the result of a call to Reference or Constant_Reference is
-finalized before the result object returned by the call to Reference or
-Constant_Reference is finalized.
+{<AI05-0212-1AI05-0212-1>} Execution is erroneous if the vector
+associated with the result of a call to Reference or Constant_Reference
+is finalized before the result object returned by the call to Reference
+or Constant_Reference is finalized.
252.b/3
Reason: Each object of Reference_Type and
@@ -86327,93 +86616,94 @@ Constant_Reference is finalized.
_Implementation Requirements_
253/2
-{AI95-00302-03AI95-00302-03} No storage associated with a vector object
-shall be lost upon assignment or scope exit.
+{<AI95-00302-03AI95-00302-03>} No storage associated with a vector
+object shall be lost upon assignment or scope exit.
254/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The execution of
-an assignment_statement for a vector shall have the effect of copying
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The execution
+of an assignment_statement for a vector shall have the effect of copying
the elements from the source vector object to the target vector object
and changing the length of the target object to that of the source
object.
254.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a Vector is a "deep" copy; that is the elements are copied as
- well as the data structures. We say "effect of" in order to
- allow the implementation to avoid copying elements immediately
- if it wishes. For instance, an implementation that avoided
- copying until one of the containers is modified would be
- allowed. (Note that such an implementation would be require
- care, as Query_Element and Constant_Reference both could be
- used to access an element which later needs to be reallocated
- while the parameter or reference still exists, potentially
- leaving the parameter or reference pointing at the wrong
- element.)
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a Vector is a "deep" copy; that is the elements are copied
+ as well as the data structures. We say "effect of" in order
+ to allow the implementation to avoid copying elements
+ immediately if it wishes. For instance, an implementation
+ that avoided copying until one of the containers is modified
+ would be allowed. (Note that such an implementation would be
+ require care, as Query_Element and Constant_Reference both
+ could be used to access an element which later needs to be
+ reallocated while the parameter or reference still exists,
+ potentially leaving the parameter or reference pointing at the
+ wrong element.)
_Implementation Advice_
255/2
-{AI95-00302-03AI95-00302-03} Containers.Vectors should be implemented
-similarly to an array. In particular, if the length of a vector is N,
+{<AI95-00302-03AI95-00302-03>} Containers.Vectors should be implemented
+similarly to an array. In particular, if the length of a vector is <N>,
then
256/2
- * the worst-case time complexity of Element should be O(log N);
+ * the worst-case time complexity of Element should be <O>(log <N>);
256.a/2
Implementation Advice: The worst-case time complexity of
- Element for Containers.Vector should be O(log N).
+ Element for Containers.Vector should be <O>(log <N>).
257/2
- * the worst-case time complexity of Append with Count=1 when N is
- less than the capacity of the vector should be O(log N); and
+ * the worst-case time complexity of Append with Count=1 when <N> is
+ less than the capacity of the vector should be <O>(log <N>); and
257.a/2
Implementation Advice: The worst-case time complexity of
- Append with Count = 1 when N is less than the capacity for
- Containers.Vector should be O(log N).
+ Append with Count = 1 when <N> is less than the capacity for
+ Containers.Vector should be <O>(log <N>).
258/2
* the worst-case time complexity of Prepend with Count=1 and
- Delete_First with Count=1 should be O(N log N).
+ Delete_First with Count=1 should be <O>(<N> log <N>).
258.a/2
Implementation Advice: The worst-case time complexity of
Prepend with Count = 1 and Delete_First with Count=1 for
- Containers.Vectors should be O(N log N).
+ Containers.Vectors should be <O>(<N> log <N>).
258.b/2
Reason: We do not mean to overly constrain implementation
strategies here. However, it is important for portability
that the performance of large containers has roughly the same
factors on different implementations. If a program is moved
- to an implementation that takes O(N) time to access elements,
- that program could be unusable when the vectors are large. We
- allow O(log N) access because the proportionality constant and
- caching effects are likely to be larger than the log factor,
- and we don't want to discourage innovative implementations.
+ to an implementation that takes <O>(<N>) time to access
+ elements, that program could be unusable when the vectors are
+ large. We allow <O>(log <N>) access because the
+ proportionality constant and caching effects are likely to be
+ larger than the log factor, and we don't want to discourage
+ innovative implementations.
259/2
-{AI95-00302-03AI95-00302-03} The worst-case time complexity of a call on
-procedure Sort of an instance of Containers.Vectors.Generic_Sorting
-should be O(N**2), and the average time complexity should be better than
-O(N**2).
+{<AI95-00302-03AI95-00302-03>} The worst-case time complexity of a call
+on procedure Sort of an instance of Containers.Vectors.Generic_Sorting
+should be <O>(<N>**2), and the average time complexity should be better
+than <O>(<N>**2).
259.a/2
Implementation Advice: The worst-case time complexity of a
call on procedure Sort of an instance of
- Containers.Vectors.Generic_Sorting should be O(N**2), and the
- average time complexity should be better than O(N**2).
+ Containers.Vectors.Generic_Sorting should be <O>(<N>**2), and
+ the average time complexity should be better than <O>(<N>**2).
259.b/2
Ramification: In other words, we're requiring the use of a
- better than O(N**2) sorting algorithm, such as Quicksort. No
- bubble sorts allowed!
+ better than <O>(<N>**2) sorting algorithm, such as Quicksort.
+ No bubble sorts allowed!
260/2
-{AI95-00302-03AI95-00302-03} Containers.Vectors.Generic_Sorting.Sort and
-Containers.Vectors.Generic_Sorting.Merge should minimize copying of
+{<AI95-00302-03AI95-00302-03>} Containers.Vectors.Generic_Sorting.Sort
+and Containers.Vectors.Generic_Sorting.Merge should minimize copying of
elements.
260.a/2
@@ -86429,7 +86719,7 @@ elements.
would not meet this advice, for instance.
261/2
-{AI95-00302-03AI95-00302-03} Move should not copy elements, and should
+{<AI95-00302-03AI95-00302-03>} Move should not copy elements, and should
minimize copying of internal data structures.
261.a/2
@@ -86443,9 +86733,9 @@ minimize copying of internal data structures.
the Source vector to the Target vector.
262/2
-{AI95-00302-03AI95-00302-03} If an exception is propagated from a vector
-operation, no storage should be lost, nor any elements removed from a
-vector unless specified by the operation.
+{<AI95-00302-03AI95-00302-03>} If an exception is propagated from a
+vector operation, no storage should be lost, nor any elements removed
+from a vector unless specified by the operation.
262.a/2
Implementation Advice: If an exception is propagated from a
@@ -86480,71 +86770,71 @@ vector unless specified by the operation.
_Extensions to Ada 95_
264.b/2
- {AI95-00302-03AI95-00302-03} The package Containers.Vectors is
- new.
+ {<AI95-00302-03AI95-00302-03>} The package Containers.Vectors
+ is new.
_Incompatibilities With Ada 2005_
264.c/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Vectors. If an instance of Containers.Vectors
- is referenced in a use_clause, and an entity E with the same
- defining_identifier as a new entity in Containers.Vectors is
- defined in a package that is also referenced in a use_clause,
- the entity E may no longer be use-visible, resulting in
- errors. This should be rare and is easily fixed if it does
- occur.
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Vectors. If an instance of
+ Containers.Vectors is referenced in a use_clause, and an
+ entity <E> with the same defining_identifier as a new entity
+ in Containers.Vectors is defined in a package that is also
+ referenced in a use_clause, the entity <E> may no longer be
+ use-visible, resulting in errors. This should be rare and is
+ easily fixed if it does occur.
_Extensions to Ada 2005_
264.d/3
- {AI05-0212-1AI05-0212-1} Added iterator, reference, and
+ {<AI05-0212-1AI05-0212-1>} Added iterator, reference, and
indexing support to make vector containers more convenient to
use.
_Wording Changes from Ada 2005_
264.e/3
- {AI05-0001-1AI05-0001-1} Generalized the definition of
+ {<AI05-0001-1AI05-0001-1>} Generalized the definition of
Reserve_Capacity and Move. Specified which elements are
read/written by stream attributes.
264.f/3
- {AI05-0022-1AI05-0022-1} Correction: Added a Bounded
+ {<AI05-0022-1AI05-0022-1>} Correction: Added a Bounded
(Run-Time) Error to cover tampering by generic actual
subprograms.
264.g/3
- {AI05-0027-1AI05-0027-1} Correction: Added a Bounded
+ {<AI05-0027-1AI05-0027-1>} Correction: Added a Bounded
(Run-Time) Error to cover access to finalized vector
containers.
264.h/3
- {AI05-0044-1AI05-0044-1} Correction: Redefined "<" actuals to
- require a strict weak ordering; the old definition allowed
+ {<AI05-0044-1AI05-0044-1>} Correction: Redefined "<" actuals
+ to require a strict weak ordering; the old definition allowed
indeterminant comparisons that would not have worked in a
container.
264.i/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
264.j/3
- {AI05-0160-1AI05-0160-1} Correction: Revised the definition of
- invalid cursors to cover missing (and new) cases.
+ {<AI05-0160-1AI05-0160-1>} Correction: Revised the definition
+ of invalid cursors to cover missing (and new) cases.
264.k/3
- {AI05-0265-1AI05-0265-1} Correction: Defined when a container
- prohibits tampering in order to more clearly define where the
- check is made and the exception raised.
+ {<AI05-0265-1AI05-0265-1>} Correction: Defined when a
+ container prohibits tampering in order to more clearly define
+ where the check is made and the exception raised.
_Wording Changes from Ada 2012_
264.l/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.3, Next: A.18.4, Prev: A.18.2, Up: A.18
@@ -86553,14 +86843,14 @@ A.18.3 The Generic Package
Containers.Doubly_Linked_Lists
---------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Doubly_Linked_Lists provides private types List and Cursor,
and a set of operations for each type. A list container is optimized
-for insertion and deletion at any position.
+for insertion and deletion at any position.
2/2
-{AI95-00302-03AI95-00302-03} A doubly-linked list container object
-manages a linked list of internal nodes, each of which contains an
+{<AI95-00302-03AI95-00302-03>} A doubly-linked list container object
+manages a linked list of internal <nodes>, each of which contains an
element and pointers to the next (successor) and previous (predecessor)
internal nodes. A cursor designates a particular node within a list
(and by extension the element contained in that node). A cursor keeps
@@ -86568,17 +86858,17 @@ designating the same node (and element) as long as
the node is part of
the container, even if the node is moved in the container.
3/2
-{AI95-00302-03AI95-00302-03} The length of a list is the number of
+{<AI95-00302-03AI95-00302-03>} The <length> of a list is the number of
elements it contains.
_Static Semantics_
4/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Doubly_Linked_Lists has the following declaration:
5/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Element_Type is private;
with function "=" (Left, Right : Element_Type)
@@ -86588,7 +86878,7 @@ Containers.Doubly_Linked_Lists has the following
declaration:
pragma Remote_Types(Doubly_Linked_Lists);
6/3
- {AI05-0212-1AI05-0212-1} type List is tagged private
+ {<AI05-0212-1AI05-0212-1>} type List is tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
@@ -86606,10 +86896,10 @@ Containers.Doubly_Linked_Lists has the following
declaration:
No_Element : constant Cursor;
9.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
9.2/3
- {AI05-0212-1AI05-0212-1} package List_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package List_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
10/2
@@ -86646,29 +86936,29 @@ Containers.Doubly_Linked_Lists has the following
declaration:
(Element : in out Element_Type));
17.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
17.2/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
17.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in List;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in List;
Position : in Cursor)
return Constant_Reference_Type;
17.4/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out List;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out List;
Position : in Cursor)
return Reference_Type;
17.5/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out List;
Source : in List);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out List;
Source : in List);
17.6/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : List) return List;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : List) return List;
18/2
procedure Move (Target : in out List;
@@ -86786,7 +87076,7 @@ Containers.Doubly_Linked_Lists has the following
declaration:
Item : Element_Type) return Boolean;
44/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
45/2
procedure Iterate
@@ -86799,11 +87089,11 @@ Containers.Doubly_Linked_Lists has the following
declaration:
Process : not null access procedure (Position : in Cursor));
46.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in List)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in List)
return List_Iterator_Interfaces.Reversible_Iterator'Class;
46.2/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in List; Start
: in Cursor)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in List;
Start : in Cursor)
return List_Iterator_Interfaces.Reversible_Iterator'Class;
47/2
@@ -86829,20 +87119,20 @@ Containers.Doubly_Linked_Lists has the following
declaration:
private
53/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
54/2
end Ada.Containers.Doubly_Linked_Lists;
55/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function "=" on Element_Type values is expected to define a reflexive
-and symmetric relationship and return the same result value each time it
-is called with a particular pair of values. If it behaves in some other
-manner, the functions Find, Reverse_Find, and "=" on list values return
-an unspecified value. The exact arguments and number of calls of this
-generic formal function by the functions Find, Reverse_Find, and "=" on
-list values are unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function "=" on Element_Type values is expected to define a
+reflexive and symmetric relationship and return the same result value
+each time it is called with a particular pair of values. If it behaves
+in some other manner, the functions Find, Reverse_Find, and "=" on list
+values return an unspecified value. The exact arguments and number of
+calls of this generic formal function by the functions Find,
+Reverse_Find, and "=" on list values are unspecified.
55.a/2
Ramification: If the actual function for "=" is not symmetric
@@ -86856,28 +87146,28 @@ list values are unspecified.
aren't expected to use "=").
56/2
-{AI95-00302-03AI95-00302-03} The type List is used to represent lists.
+{<AI95-00302-03AI95-00302-03>} The type List is used to represent lists.
The type List needs finalization (see *note 7.6::).
57/2
-{AI95-00302-03AI95-00302-03} Empty_List represents the empty List
+{<AI95-00302-03AI95-00302-03>} Empty_List represents the empty List
object. It has a length of 0. If an object of type List is not
otherwise initialized, it is initialized to the same value as
Empty_List.
58/2
-{AI95-00302-03AI95-00302-03} No_Element represents a cursor that
+{<AI95-00302-03AI95-00302-03>} No_Element represents a cursor that
designates no element. If an object of type Cursor is not otherwise
initialized, it is initialized to the same value as No_Element.
59/2
-{AI95-00302-03AI95-00302-03} The predefined "=" operator for type Cursor
-returns True if both cursors are No_Element, or designate the same
-element in the same container.
+{<AI95-00302-03AI95-00302-03>} The predefined "=" operator for type
+Cursor returns True if both cursors are No_Element, or designate the
+same element in the same container.
60/2
-{AI95-00302-03AI95-00302-03} Execution of the default implementation of
-the Input, Output, Read, or Write attribute of type Cursor raises
+{<AI95-00302-03AI95-00302-03>} Execution of the default implementation
+of the Input, Output, Read, or Write attribute of type Cursor raises
Program_Error.
60.a/2
@@ -86889,14 +87179,14 @@ Program_Error.
specified if there is a need to support streaming.
60.1/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} List'Write for a List
-object L writes Length(L) elements of the list to the stream. It also
-may write additional information about the list.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} List'Write for a
+List object <L> writes Length(<L>) elements of the list to the stream.
+It also may write additional information about the list.
60.2/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} List'Read reads the
-representation of a list from the stream, and assigns to Item a list
-with the same length and elements as was written by List'Write.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} List'Read reads
+the representation of a list from the stream, and assigns to <Item> a
+list with the same length and elements as was written by List'Write.
60.b/3
Ramification: Streaming more elements than the container
@@ -86904,7 +87194,7 @@ with the same length and elements as was written by
List'Write.
rule, see the Implementation Note in *note A.18.2::.
61/2
-{AI95-00302-03AI95-00302-03} [Some operations of this generic package
+{<AI95-00302-03AI95-00302-03>} [Some operations of this generic package
have access-to-subprogram parameters. To ensure such operations are
well-defined, they guard against certain actions by the designated
subprogram. In particular, some operations check for "tampering with
@@ -86914,12 +87204,13 @@ elements" of a container because they depend on
elements of the
container not being replaced.]
62/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with cursors
-of a list object L if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+cursors> of a list object <L> if:
63/2
- * it inserts or deletes elements of L, that is, it calls the Insert,
- Clear, Delete, or Delete_Last procedures with L as a parameter; or
+ * it inserts or deletes elements of <L>, that is, it calls the
+ Insert, Clear, Delete, or Delete_Last procedures with <L> as a
+ parameter; or
63.a/2
To be honest: Operations which are defined to be equivalent to
@@ -86928,17 +87219,17 @@ of a list object L if:
definition are included.
64/2
- * it reorders the elements of L, that is, it calls the Splice,
+ * it reorders the elements of <L>, that is, it calls the Splice,
Swap_Links, or Reverse_Elements procedures or the Sort or Merge
- procedures of an instance of Generic_Sorting with L as a parameter;
- or
+ procedures of an instance of Generic_Sorting with <L> as a
+ parameter; or
65/2
- * it finalizes L; or
+ * it finalizes <L>; or
65.1/3
- * {AI05-0001-1AI05-0001-1} it calls the Assign procedure with L as
- the Target parameter; or
+ * {<AI05-0001-1AI05-0001-1>} it calls the Assign procedure with <L>
+ as the Target parameter; or
65.a.1/3
Ramification: We don't need to explicitly mention
@@ -86947,22 +87238,22 @@ of a list object L if:
already defined as tampering with cursors.
66/2
- * it calls the Move procedure with L as a parameter.
+ * it calls the Move procedure with <L> as a parameter.
66.a/2
Reason: Swap copies elements rather than reordering them, so
it doesn't tamper with cursors.
67/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with
-elements of a list object L if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+elements> of a list object <L> if:
68/2
- * it tampers with cursors of L; or
+ * it tampers with cursors of <L>; or
69/2
- * it replaces one or more elements of L, that is, it calls the
- Replace_Element or Swap procedures with L as a parameter.
+ * it replaces one or more elements of <L>, that is, it calls the
+ Replace_Element or Swap procedures with <L> as a parameter.
69.a/2
Reason: Complete replacement of an element can cause its
@@ -86972,15 +87263,16 @@ elements of a list object L if:
so Update_Element does not cause a problem.
69.1/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-cursors is prohibited for a particular list object L, Program_Error is
-propagated by a call of any language-defined subprogram that is defined
-to tamper with the cursors of L, leaving L unmodified. Similarly, when
-tampering with elements is prohibited for a particular list object L,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with cursors is <prohibited> for a particular list object <L>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the elements of L [(or tamper with the
-cursors of L)], leaving L unmodified. These checks are made before any
-other defined behavior of the body of the language-defined subprogram.
+that is defined to tamper with the cursors of <L>, leaving <L>
+unmodified. Similarly, when tampering with elements is <prohibited> for
+a particular list object <L>, Program_Error is propagated by a call of
+any language-defined subprogram that is defined to tamper with the
+elements of <L> [(or tamper with the cursors of <L>)], leaving <L>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
69.b/3
Proof: Tampering with elements includes tampering with
@@ -86991,12 +87283,12 @@ other defined behavior of the body of the
language-defined subprogram.
function Has_Element (Position : Cursor) return Boolean;
69.3/3
- {AI05-0212-1AI05-0212-1} Returns True if Position designates
+ {<AI05-0212-1AI05-0212-1>} Returns True if Position designates
an element, and returns False otherwise.
69.c/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0212-1AI05-0212-1} This function might not detect
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0212-1AI05-0212-1>} This function might not detect
cursors that designate deleted elements; such cursors are
invalid (see below) and the result of calling Has_Element with
an invalid cursor is unspecified (but not erroneous).
@@ -87005,8 +87297,8 @@ other defined behavior of the body of the
language-defined subprogram.
function "=" (Left, Right : List) return Boolean;
71/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If Left
- and Right denote the same list object, then the function
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ Left and Right denote the same list object, then the function
returns True. If Left and Right have different lengths, then
the function returns False. Otherwise, it compares each
element in Left to the corresponding element in Right using
@@ -87029,28 +87321,28 @@ other defined behavior of the body of the
language-defined subprogram.
function Length (Container : List) return Count_Type;
73/2
- {AI95-00302-03AI95-00302-03} Returns the number of elements in
- Container.
+ {<AI95-00302-03AI95-00302-03>} Returns the number of elements
+ in Container.
74/2
function Is_Empty (Container : List) return Boolean;
75/2
- {AI95-00302-03AI95-00302-03} Equivalent to Length (Container)
- = 0.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Length
+ (Container) = 0.
76/2
procedure Clear (Container : in out List);
77/2
- {AI95-00302-03AI95-00302-03} Removes all the elements from
+ {<AI95-00302-03AI95-00302-03>} Removes all the elements from
Container.
78/2
function Element (Position : Cursor) return Element_Type;
79/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. Otherwise, Element
returns the element designated by Position.
@@ -87060,7 +87352,7 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Element_Type);
81/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
@@ -87073,8 +87365,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in Element_Type));
83/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated. Otherwise, Query_Element
calls Process.all with the element designated by Position as
the argument. Tampering with the elements of the list that
@@ -87089,8 +87381,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in out Element_Type));
85/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated; if Position does not designate
an element in Container, then Program_Error is propagated.
Otherwise, Update_Element calls Process.all with the element
@@ -87118,8 +87410,8 @@ other defined behavior of the body of the
language-defined subprogram.
with Implicit_Dereference => Element;
86.3/3
- {AI05-0212-1AI05-0212-1} The types Constant_Reference_Type and
- Reference_Type need finalization.
+ {<AI05-0212-1AI05-0212-1>} The types Constant_Reference_Type
+ and Reference_Type need finalization.
86.4/3
The default initialization of an object of type
@@ -87141,22 +87433,22 @@ other defined behavior of the body of the
language-defined subprogram.
return Constant_Reference_Type;
86.6/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a list given a
cursor.
86.7/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Constant_Reference
- returns an object whose discriminant is an access value that
- designates the element designated by Position. Tampering with
- the elements of Container is prohibited while the object
- returned by Constant_Reference exists and has not been
- finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Constant_Reference returns an object whose discriminant is an
+ access value that designates the element designated by
+ Position. Tampering with the elements of Container is
+ prohibited while the object returned by Constant_Reference
+ exists and has not been finalized.
86.8/3
function Reference (Container : aliased in out List;
@@ -87164,34 +87456,35 @@ other defined behavior of the body of the
language-defined subprogram.
return Reference_Type;
86.9/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a list
given a cursor.
86.10/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Reference returns an
- object whose discriminant is an access value that designates
- the element designated by Position. Tampering with the
- elements of Container is prohibited while the object returned
- by Reference exists and has not been finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Reference returns an object whose discriminant is an access
+ value that designates the element designated by Position.
+ Tampering with the elements of Container is prohibited while
+ the object returned by Reference exists and has not been
+ finalized.
86.11/3
procedure Assign (Target : in out List; Source : in List);
86.12/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, the operation has no
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, the operation has no
effect. Otherwise, the elements of Source are copied to
Target as for an assignment_statement assigning Source to
Target.
86.c/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the bounded list container. For an
unbounded list, Assign(A, B) and A := B behave identically.
For a bounded list, := will raise an exception if the
@@ -87202,7 +87495,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Copy (Source : List) return List;
86.14/3
- {AI05-0001-1AI05-0001-1} Returns a list whose elements match
+ {<AI05-0001-1AI05-0001-1>} Returns a list whose elements match
the elements of Source.
87/2
@@ -87210,11 +87503,11 @@ other defined behavior of the body of the
language-defined subprogram.
Source : in out List);
88/3
- {AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1}
- {AI05-0248-1AI05-0248-1} {AI05-0262-1AI05-0262-1} If Target
- denotes the same object as Source, then the operation has no
- effect. Otherwise, the operation is equivalent to Assign
- (Target, Source) followed by Clear (Source).
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>}
+ {<AI05-0248-1AI05-0248-1>} {<AI05-0262-1AI05-0262-1>} If
+ Target denotes the same object as Source, then the operation
+ has no effect. Otherwise, the operation is equivalent to
+ Assign (Target, Source) followed by Clear (Source).
89/2
procedure Insert (Container : in out List;
@@ -87223,13 +87516,14 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
90/2
- {AI95-00302-03AI95-00302-03} If Before is not No_Element, and
- does not designate an element in Container, then Program_Error
- is propagated. Otherwise, Insert inserts Count copies of
- New_Item prior to the element designated by Before. If Before
- equals No_Element, the new elements are inserted after the
- last node (if any). Any exception raised during allocation of
- internal storage is propagated, and Container is not modified.
+ {<AI95-00302-03AI95-00302-03>} If Before is not No_Element,
+ and does not designate an element in Container, then
+ Program_Error is propagated. Otherwise, Insert inserts Count
+ copies of New_Item prior to the element designated by Before.
+ If Before equals No_Element, the new elements are inserted
+ after the last node (if any). Any exception raised during
+ allocation of internal storage is propagated, and Container is
+ not modified.
90.a/2
Ramification: The check on Before checks that the cursor does
@@ -87248,7 +87542,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
92/3
- {AI95-00302-03AI95-00302-03} {AI05-0257-1AI05-0257-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0257-1AI05-0257-1>} If
Before is not No_Element, and does not designate an element in
Container, then Program_Error is propagated. Otherwise,
Insert allocates Count copies of New_Item, and inserts them
@@ -87267,7 +87561,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
94/3
- {AI95-00302-03AI95-00302-03} {AI05-0257-1AI05-0257-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0257-1AI05-0257-1>} If
Before is not No_Element, and does not designate an element in
Container, then Program_Error is propagated. Otherwise,
Insert inserts Count new elements prior to the element
@@ -87285,8 +87579,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
96/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- First (Container), New_Item, Count).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, First (Container), New_Item, Count).
97/2
procedure Append (Container : in out List;
@@ -87294,8 +87588,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
98/2
- {AI95-00302-03AI95-00302-03} Equivalent to Insert (Container,
- No_Element, New_Item, Count).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Insert
+ (Container, No_Element, New_Item, Count).
99/2
procedure Delete (Container : in out List;
@@ -87303,7 +87597,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
100/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position equals No_Element, then Constraint_Error is
propagated. If Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
@@ -87318,7 +87612,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
102/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>} If
Length (Container) <= Count, then Delete_First is equivalent
to Clear (Container). Otherwise, it removes the first Count
nodes from Container.
@@ -87328,7 +87622,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
104/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Length (Container) <= Count, then Delete_Last is equivalent to
Clear (Container). Otherwise, it removes the last Count nodes
from Container.
@@ -87337,7 +87631,7 @@ other defined behavior of the body of the
language-defined subprogram.
procedure Reverse_Elements (Container : in out List);
106/2
- {AI95-00302-03AI95-00302-03} Reorders the elements of
+ {<AI95-00302-03AI95-00302-03>} Reorders the elements of
Container in reverse order.
106.a/2
@@ -87351,7 +87645,7 @@ other defined behavior of the body of the
language-defined subprogram.
I, J : in Cursor);
108/2
- {AI95-00302-03AI95-00302-03} If either I or J is No_Element,
+ {<AI95-00302-03AI95-00302-03>} If either I or J is No_Element,
then Constraint_Error is propagated. If either I or J do not
designate an element in Container, then Program_Error is
propagated. Otherwise, Swap exchanges the values of the
@@ -87373,7 +87667,7 @@ other defined behavior of the body of the
language-defined subprogram.
I, J : in Cursor);
110/2
- {AI95-00302-03AI95-00302-03} If either I or J is No_Element,
+ {<AI95-00302-03AI95-00302-03>} If either I or J is No_Element,
then Constraint_Error is propagated. If either I or J do not
designate an element in Container, then Program_Error is
propagated. Otherwise, Swap_Links exchanges the nodes
@@ -87392,16 +87686,16 @@ other defined behavior of the body of the
language-defined subprogram.
Source : in out List);
112/2
- {AI95-00302-03AI95-00302-03} If Before is not No_Element, and
- does not designate an element in Target, then Program_Error is
- propagated. Otherwise, if Source denotes the same object as
- Target, the operation has no effect. Otherwise, Splice
- reorders elements such that they are removed from Source and
- moved to Target, immediately prior to Before. If Before
- equals No_Element, the nodes of Source are spliced after the
- last node of Target. The length of Target is incremented by
- the number of nodes in Source, and the length of Source is set
- to 0.
+ {<AI95-00302-03AI95-00302-03>} If Before is not No_Element,
+ and does not designate an element in Target, then
+ Program_Error is propagated. Otherwise, if Source denotes the
+ same object as Target, the operation has no effect.
+ Otherwise, Splice reorders elements such that they are removed
+ from Source and moved to Target, immediately prior to Before.
+ If Before equals No_Element, the nodes of Source are spliced
+ after the last node of Target. The length of Target is
+ incremented by the number of nodes in Source, and the length
+ of Source is set to 0.
113/2
procedure Splice (Target : in out List;
@@ -87410,7 +87704,7 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in out Cursor);
114/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position is No_Element, then Constraint_Error is propagated.
If Before does not equal No_Element, and does not designate an
element in Target, then Program_Error is propagated. If
@@ -87439,7 +87733,7 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in Cursor);
116/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position is No_Element, then Constraint_Error is propagated.
If Before does not equal No_Element, and does not designate an
element in Container, then Program_Error is propagated. If
@@ -87454,7 +87748,7 @@ other defined behavior of the body of the
language-defined subprogram.
function First (Container : List) return Cursor;
118/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, First returns the value No_Element.
Otherwise, it returns a cursor that designates the first node
in Container.
@@ -87463,14 +87757,14 @@ other defined behavior of the body of the
language-defined subprogram.
function First_Element (Container : List) return Element_Type;
120/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (First
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (First
(Container)).
121/2
function Last (Container : List) return Cursor;
122/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, Last returns the value No_Element.
Otherwise, it returns a cursor that designates the last node
in Container.
@@ -87479,15 +87773,15 @@ other defined behavior of the body of the
language-defined subprogram.
function Last_Element (Container : List) return Element_Type;
124/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Last
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Last
(Container)).
125/2
function Next (Position : Cursor) return Cursor;
126/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element or
- designates the last element of the container, then Next
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element
+ or designates the last element of the container, then Next
returns the value No_Element. Otherwise, it returns a cursor
that designates the successor of the element designated by
Position.
@@ -87496,24 +87790,24 @@ other defined behavior of the body of the
language-defined subprogram.
function Previous (Position : Cursor) return Cursor;
128/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element or
- designates the first element of the container, then Previous
- returns the value No_Element. Otherwise, it returns a cursor
- that designates the predecessor of the element designated by
- Position.
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element
+ or designates the first element of the container, then
+ Previous returns the value No_Element. Otherwise, it returns
+ a cursor that designates the predecessor of the element
+ designated by Position.
129/2
procedure Next (Position : in out Cursor);
130/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position := Next
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position := Next
(Position).
131/2
procedure Previous (Position : in out Cursor);
132/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position :=
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position :=
Previous (Position).
133/2
@@ -87523,7 +87817,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
134/2
- {AI95-00302-03AI95-00302-03} If Position is not No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position is not No_Element,
and does not designate an element in Container, then
Program_Error is propagated. Find searches the elements of
Container for an element equal to Item (using the generic
@@ -87541,7 +87835,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
136/2
- {AI95-00302-03AI95-00302-03} If Position is not No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position is not No_Element,
and does not designate an element in Container, then
Program_Error is propagated. Find searches the elements of
Container for an element equal to Item (using the generic
@@ -87557,10 +87851,10 @@ other defined behavior of the body of the
language-defined subprogram.
Item : Element_Type) return Boolean;
138/2
- {AI95-00302-03AI95-00302-03} Equivalent to Find (Container,
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Find (Container,
Item) /= No_Element.
- Paragraphs 139 and 140 were moved above.
+ <Paragraphs 139 and 140 were moved above.>
141/2
procedure Iterate
@@ -87568,11 +87862,11 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
142/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} Iterate
- calls Process.all with a cursor that designates each node in
- Container, starting with the first node and moving the cursor
- as per the Next function. Tampering with the cursors of
- Container is prohibited during the execution of a call on
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>}
+ Iterate calls Process.all with a cursor that designates each
+ node in Container, starting with the first node and moving the
+ cursor as per the Next function. Tampering with the cursors
+ of Container is prohibited during the execution of a call on
Process.all. Any exception raised by Process.all is
propagated.
@@ -87596,10 +87890,10 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
144/3
- {AI95-00302-03AI95-00302-03} {AI05-0212-1AI05-0212-1} Iterates
- over the nodes in Container as per procedure Iterate, except
- that elements are traversed in reverse order, starting with
- the last node and moving the cursor as per the Previous
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0212-1AI05-0212-1>}
+ Iterates over the nodes in Container as per procedure Iterate,
+ except that elements are traversed in reverse order, starting
+ with the last node and moving the cursor as per the Previous
function.
144.1/3
@@ -87607,27 +87901,28 @@ other defined behavior of the body of the
language-defined subprogram.
return List_Iterator_Interfaces.Reversible_Iterator'Class;
144.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns a reversible iterator
- object (see *note 5.5.1::) that will generate a value for a
- loop parameter (see *note 5.5.2::) designating each node in
- Container, starting with the first node and moving the cursor
- as per the Next function when used as a forward iterator, and
- starting with the last node and moving the cursor as per the
- Previous function when used as a reverse iterator. Tampering
- with the cursors of Container is prohibited while the iterator
- object exists (in particular, in the sequence_of_statements of
- the loop_statement whose iterator_specification denotes this
- object). The iterator object needs finalization.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns a reversible
+ iterator object (see *note 5.5.1::) that will generate a value
+ for a loop parameter (see *note 5.5.2::) designating each node
+ in Container, starting with the first node and moving the
+ cursor as per the Next function when used as a forward
+ iterator, and starting with the last node and moving the
+ cursor as per the Previous function when used as a reverse
+ iterator. Tampering with the cursors of Container is
+ prohibited while the iterator object exists (in particular, in
+ the sequence_of_statements of the loop_statement whose
+ iterator_specification denotes this object). The iterator
+ object needs finalization.
144.3/3
function Iterate (Container : in List; Start : in Cursor)
return List_Iterator_Interfaces.Reversible_Iterator'Class;
144.4/3
- {AI05-0212-1AI05-0212-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} {AI05-0269-1AI05-0269-1} If Start is
- not No_Element and does not designate an item in Container,
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} {<AI05-0269-1AI05-0269-1>} If Start
+ is not No_Element and does not designate an item in Container,
then Program_Error is propagated. If Start is No_Element,
then Constraint_Error is propagated. Otherwise, Iterate
returns a reversible iterator object (see *note 5.5.1::) that
@@ -87655,29 +87950,30 @@ other defined behavior of the body of the
language-defined subprogram.
parameter and Stop is the cursor that you want to stop at).
145/3
-{AI05-0044-1AI05-0044-1} {AI05-0262-1AI05-0262-1} The actual function
-for the generic formal function "<" of Generic_Sorting 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 *note A.18::); it should not modify Container. If the actual for
-"<" behaves in some other manner, the behavior of the subprograms of
-Generic_Sorting are unspecified. The number of times the subprograms of
-Generic_Sorting call "<" is unspecified.
+{<AI05-0044-1AI05-0044-1>} {<AI05-0262-1AI05-0262-1>} The actual
+function for the generic formal function "<" of Generic_Sorting 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 *note A.18::); it should not modify
+Container. If the actual for "<" behaves in some other manner, the
+behavior of the subprograms of Generic_Sorting are unspecified. The
+number of times the subprograms of Generic_Sorting call "<" is
+unspecified.
146/2
function Is_Sorted (Container : List) return Boolean;
147/2
- {AI95-00302-03AI95-00302-03} Returns True if the elements are
- sorted smallest first as determined by the generic formal "<"
- operator; otherwise, Is_Sorted returns False. Any exception
- raised during evaluation of "<" is propagated.
+ {<AI95-00302-03AI95-00302-03>} Returns True if the elements
+ are sorted smallest first as determined by the generic formal
+ "<" operator; otherwise, Is_Sorted returns False. Any
+ exception raised during evaluation of "<" is propagated.
148/2
procedure Sort (Container : in out List);
149/2
- {AI95-00302-03AI95-00302-03} Reorders the nodes of Container
+ {<AI95-00302-03AI95-00302-03>} Reorders the nodes of Container
such that the elements are sorted smallest first as determined
by the generic formal "<" operator provided. The sort is
stable. Any exception raised during evaluation of "<" is
@@ -87699,7 +87995,7 @@ Generic_Sorting call "<" is unspecified.
Source : in out List);
151/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>} If
Source is empty, then Merge does nothing. If Source and
Target are the same nonempty container object, then
Program_Error is propagated. Otherwise, Merge removes
@@ -87721,23 +88017,23 @@ Generic_Sorting call "<" is unspecified.
_Bounded (Run-Time) Errors_
152/2
-{AI95-00302-03AI95-00302-03} Calling Merge in an instance of
+{<AI95-00302-03AI95-00302-03>} Calling Merge in an instance of
Generic_Sorting with either Source or Target not ordered smallest first
using the provided generic formal "<" operator is a bounded error.
Either Program_Error is raised after Target is updated as described for
Merge, or the operation works as defined.
152.1/3
-{AI05-0022-1AI05-0022-1} {AI05-0248-1AI05-0248-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of this package, to tamper with
-elements of any List parameter of the operation. Either Program_Error
-is raised, or the operation works as defined on the value of the List
-either prior to, or subsequent to, some or all of the modifications to
-the List.
+{<AI05-0022-1AI05-0022-1>} {<AI05-0248-1AI05-0248-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of this package, to
+tamper with elements of any List parameter of the operation. Either
+Program_Error is raised, or the operation works as defined on the value
+of the List either prior to, or subsequent to, some or all of the
+modifications to the List.
152.2/3
-{AI05-0027-1AI05-0027-1} It is a bounded error to call any subprogram
+{<AI05-0027-1AI05-0027-1>} It is a bounded error to call any subprogram
declared in the visible part of Containers.Doubly_Linked_Lists when the
associated container has been finalized. If the operation takes
Container as an in out parameter, then it raises Constraint_Error or
@@ -87747,7 +88043,7 @@ an empty container, or it raises Constraint_Error or
Program_Error.
_Erroneous Execution_
153/2
-{AI95-00302-03AI95-00302-03} A Cursor value is invalid if any of the
+{<AI95-00302-03AI95-00302-03>} A Cursor value is <invalid> if any of the
following have occurred since it was created:
154/2
@@ -87755,7 +88051,7 @@ following have occurred since it was created:
finalized;
154.1/3
- * {AI05-0160-1AI05-0160-1} The list that contains the element it
+ * {<AI05-0160-1AI05-0160-1>} The list that contains the element it
designates has been used as the Target of a call to Assign, or as
the target of an assignment_statement;
@@ -87764,35 +88060,35 @@ following have occurred since it was created:
the Source or Target of a call to Move;] or
155.a/3
- Proof: {AI05-0001-1AI05-0001-1} Move has been reworded in
+ Proof: {<AI05-0001-1AI05-0001-1>} Move has been reworded in
terms of Assign and Clear, which are covered by other bullets,
so this text is redundant.
156/3
- * {AI05-0160-1AI05-0160-1} {AI05-0262-1AI05-0262-1} The element it
- designates has been removed from the list that previously contained
- the element.
+ * {<AI05-0160-1AI05-0160-1>} {<AI05-0262-1AI05-0262-1>} The element
+ it designates has been removed from the list that previously
+ contained the element.
156.a/3
- To be honest: {AI05-0160-1AI05-0160-1} The cursor modified by
- the four parameter Splice is not invalid, even though the
+ To be honest: {<AI05-0160-1AI05-0160-1>} The cursor modified
+ by the four parameter Splice is not invalid, even though the
element it designates has been removed from the source list,
because that cursor has been modified to designate that
element in the target list - the cursor no longer designates
an element in the source list.
156.b/3
- Ramification: {AI05-0160-1AI05-0160-1} This can happen
+ Ramification: {<AI05-0160-1AI05-0160-1>} This can happen
directly via calls to Delete, Delete_Last, Clear, Splice with
a Source parameter, and Merge; and indirectly via calls to
Delete_First, Assign, and Move.
157/2
-{AI95-00302-03AI95-00302-03} The result of "=" or Has_Element is
+{<AI95-00302-03AI95-00302-03>} The result of "=" or Has_Element is
unspecified if it is called with an invalid cursor parameter. Execution
is erroneous if any other subprogram declared in
Containers.Doubly_Linked_Lists is called with an invalid cursor
-parameter.
+parameter.
157.a/2
Discussion: The list above is intended to be exhaustive. In
@@ -87808,7 +88104,7 @@ parameter.
detected.
157.1/3
-{AI05-0212-1AI05-0212-1} Execution is erroneous if the list associated
+{<AI05-0212-1AI05-0212-1>} Execution is erroneous if the list associated
with the result of a call to Reference or Constant_Reference is
finalized before the result object returned by the call to Reference or
Constant_Reference is finalized.
@@ -87830,18 +88126,18 @@ Constant_Reference is finalized.
_Implementation Requirements_
158/2
-{AI95-00302-03AI95-00302-03} No storage associated with a doubly-linked
-List object shall be lost upon assignment or scope exit.
+{<AI95-00302-03AI95-00302-03>} No storage associated with a
+doubly-linked List object shall be lost upon assignment or scope exit.
159/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The execution of
-an assignment_statement for a list shall have the effect of copying the
-elements from the source list object to the target list object and
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The execution
+of an assignment_statement for a list shall have the effect of copying
+the elements from the source list object to the target list object and
changing the length of the target object to that of the source object.
159.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a List is a "deep" copy; that is the elements are copied as
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a List is a "deep" copy; that is the elements are copied as
well as the data structures. We say "effect of" in order to
allow the implementation to avoid copying elements immediately
if it wishes. For instance, an implementation that avoided
@@ -87852,46 +88148,47 @@ changing the length of the target object to that of
the source object.
_Implementation Advice_
160/2
-{AI95-00302-03AI95-00302-03} Containers.Doubly_Linked_Lists should be
-implemented similarly to a linked list. In particular, if N is the
+{<AI95-00302-03AI95-00302-03>} Containers.Doubly_Linked_Lists should be
+implemented similarly to a linked list. In particular, if <N> is the
length of a list, then the worst-case time complexity of Element, Insert
-with Count=1, and Delete with Count=1 should be O(log N).
+with Count=1, and Delete with Count=1 should be <O>(log <N>).
160.a/2
Implementation Advice: The worst-case time complexity of
Element, Insert with Count=1, and Delete with Count=1 for
- Containers.Doubly_Linked_Lists should be O(log N).
+ Containers.Doubly_Linked_Lists should be <O>(log <N>).
160.b/2
Reason: We do not mean to overly constrain implementation
strategies here. However, it is important for portability
that the performance of large containers has roughly the same
factors on different implementations. If a program is moved
- to an implementation that takes O(N) time to access elements,
- that program could be unusable when the lists are large. We
- allow O(log N) access because the proportionality constant and
- caching effects are likely to be larger than the log factor,
- and we don't want to discourage innovative implementations.
+ to an implementation that takes <O>(<N>) time to access
+ elements, that program could be unusable when the lists are
+ large. We allow <O>(log <N>) access because the
+ proportionality constant and caching effects are likely to be
+ larger than the log factor, and we don't want to discourage
+ innovative implementations.
161/2
-{AI95-00302-03AI95-00302-03} The worst-case time complexity of a call on
-procedure Sort of an instance of
-Containers.Doubly_Linked_Lists.Generic_Sorting should be O(N**2), and
-the average time complexity should be better than O(N**2).
+{<AI95-00302-03AI95-00302-03>} The worst-case time complexity of a call
+on procedure Sort of an instance of
+Containers.Doubly_Linked_Lists.Generic_Sorting should be <O>(<N>**2),
+and the average time complexity should be better than <O>(<N>**2).
161.a/2
Implementation Advice: A call on procedure Sort of an instance
of Containers.Doubly_Linked_Lists.Generic_Sorting should have
- an average time complexity better than O(N**2) and worst case
- no worse than O(N**2).
+ an average time complexity better than <O>(<N>**2) and worst
+ case no worse than <O>(<N>**2).
161.b/2
Ramification: In other words, we're requiring the use of a
- better than O(N**2) sorting algorithm, such as Quicksort. No
- bubble sorts allowed!
+ better than <O>(<N>**2) sorting algorithm, such as Quicksort.
+ No bubble sorts allowed!
162/2
-{AI95-00302-03AI95-00302-03} Move should not copy elements, and should
+{<AI95-00302-03AI95-00302-03>} Move should not copy elements, and should
minimize copying of internal data structures.
162.a/2
@@ -87905,7 +88202,7 @@ minimize copying of internal data structures.
the Source container to the Target container.
163/2
-{AI95-00302-03AI95-00302-03} If an exception is propagated from a list
+{<AI95-00302-03AI95-00302-03>} If an exception is propagated from a list
operation, no storage should be lost, nor any elements removed from a
list unless specified by the operation.
@@ -87923,7 +88220,7 @@ list unless specified by the operation.
NOTES
164/2
- 50 {AI95-00302-03AI95-00302-03} Sorting a list never copies
+ 50 {<AI95-00302-03AI95-00302-03>} Sorting a list never copies
elements, and is a stable sort (equal elements remain in the
original order). This is different than sorting an array or
vector, which may need to copy elements, and is probably not a
@@ -87932,84 +88229,85 @@ list unless specified by the operation.
_Extensions to Ada 95_
164.a/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Doubly_Linked_Lists is new.
_Inconsistencies With Ada 2005_
164.b/3
- {AI05-0248-1AI05-0248-1} {AI05-0257-1AI05-0257-1} Correction:
- The Insert versions that return a Position parameter are now
- defined to return Position = Before if Count = 0. This was
- unspecified for Ada 2005; so this will only be inconsistent if
- an implementation did something else and a program depended on
- that something else -- this should be very rare.
+ {<AI05-0248-1AI05-0248-1>} {<AI05-0257-1AI05-0257-1>}
+ Correction: The Insert versions that return a Position
+ parameter are now defined to return Position = Before if Count
+ = 0. This was unspecified for Ada 2005; so this will only be
+ inconsistent if an implementation did something else and a
+ program depended on that something else -- this should be very
+ rare.
_Incompatibilities With Ada 2005_
164.c/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Doubly_Linked_Lists. If an instance of
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Doubly_Linked_Lists. If an instance of
Containers.Doubly_Linked_Lists is referenced in a use_clause,
- and an entity E with the same defining_identifier as a new
+ and an entity <E> with the same defining_identifier as a new
entity in Containers.Doubly_Linked_Lists is defined in a
- package that is also referenced in a use_clause, the entity E
- may no longer be use-visible, resulting in errors. This
+ package that is also referenced in a use_clause, the entity
+ <E> may no longer be use-visible, resulting in errors. This
should be rare and is easily fixed if it does occur.
_Extensions to Ada 2005_
164.d/3
- {AI05-0212-1AI05-0212-1} Added iterator, reference, and
+ {<AI05-0212-1AI05-0212-1>} Added iterator, reference, and
indexing support to make list containers more convenient to
use.
_Wording Changes from Ada 2005_
164.e/3
- {AI05-0001-1AI05-0001-1} Generalized the definition of Move.
+ {<AI05-0001-1AI05-0001-1>} Generalized the definition of Move.
Specified which elements are read/written by stream
attributes.
164.f/3
- {AI05-0022-1AI05-0022-1} Correction: Added a Bounded
+ {<AI05-0022-1AI05-0022-1>} Correction: Added a Bounded
(Run-Time) Error to cover tampering by generic actual
subprograms.
164.g/3
- {AI05-0027-1AI05-0027-1} Correction: Added a Bounded
+ {<AI05-0027-1AI05-0027-1>} Correction: Added a Bounded
(Run-Time) Error to cover access to finalized list containers.
164.h/3
- {AI05-0044-1AI05-0044-1} Correction: Redefined "<" actuals to
- require a strict weak ordering; the old definition allowed
+ {<AI05-0044-1AI05-0044-1>} Correction: Redefined "<" actuals
+ to require a strict weak ordering; the old definition allowed
indeterminant comparisons that would not have worked in a
container.
164.i/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
164.j/3
- {AI05-0160-1AI05-0160-1} Correction: Revised the definition of
- invalid cursors to cover missing (and new) cases.
+ {<AI05-0160-1AI05-0160-1>} Correction: Revised the definition
+ of invalid cursors to cover missing (and new) cases.
164.k/3
- {AI05-0257-1AI05-0257-1} Correction: Added missing wording to
- describe the Position after Inserting 0 elements.
+ {<AI05-0257-1AI05-0257-1>} Correction: Added missing wording
+ to describe the Position after Inserting 0 elements.
164.l/3
- {AI05-0265-1AI05-0265-1} Correction: Defined when a container
- prohibits tampering in order to more clearly define where the
- check is made and the exception raised.
+ {<AI05-0265-1AI05-0265-1>} Correction: Defined when a
+ container prohibits tampering in order to more clearly define
+ where the check is made and the exception raised.
_Wording Changes from Ada 2012_
164.m/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.4, Next: A.18.5, Prev: A.18.3, Up: A.18
@@ -88018,7 +88316,7 @@ A.18.4 Maps
-----------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic packages
+{<AI95-00302-03AI95-00302-03>} The language-defined generic packages
Containers.Hashed_Maps and Containers.Ordered_Maps provide private types
Map and Cursor, and a set of operations for each type. A map container
allows an arbitrary type to be used as a key to find the element
@@ -88026,7 +88324,7 @@ associated with that key. A hashed map uses a hash
function to organize
the keys, while an ordered map orders the keys per a specified relation.
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00302-03AI95-00302-03>} {<AI05-0299-1AI05-0299-1>} This subclause
describes the declarations that are common to both kinds of maps. See
*note A.18.5:: for a description of the semantics specific to
Containers.Hashed_Maps and *note A.18.6:: for a description of the
@@ -88035,13 +88333,14 @@ semantics specific to Containers.Ordered_Maps.
_Static Semantics_
3/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function "=" on Element_Type values is expected to define a reflexive
-and symmetric relationship and return the same result value each time it
-is called with a particular pair of values. If it behaves in some other
-manner, the function "=" on map values returns an unspecified value.
-The exact arguments and number of calls of this generic formal function
-by the function "=" on map values are unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function "=" on Element_Type values is expected to define a
+reflexive and symmetric relationship and return the same result value
+each time it is called with a particular pair of values. If it behaves
+in some other manner, the function "=" on map values returns an
+unspecified value. The exact arguments and number of calls of this
+generic formal function by the function "=" on map values are
+unspecified.
3.a/2
Ramification: If the actual function for "=" is not symmetric
@@ -88055,44 +88354,44 @@ by the function "=" on map values are unspecified.
"=").
4/2
-{AI95-00302-03AI95-00302-03} The type Map is used to represent maps.
+{<AI95-00302-03AI95-00302-03>} The type Map is used to represent maps.
The type Map needs finalization (see *note 7.6::).
5/2
-{AI95-00302-03AI95-00302-03} A map contains pairs of keys and elements,
-called nodes. Map cursors designate nodes, but also can be thought of
-as designating an element (the element contained in the node) for
-consistency with the other containers. There exists an equivalence
+{<AI95-00302-03AI95-00302-03>} A map contains pairs of keys and
+elements, called <nodes>. Map cursors designate nodes, but also can be
+thought of as designating an element (the element contained in the node)
+for consistency with the other containers. There exists an equivalence
relation on keys, whose definition is different for hashed maps and
ordered maps. A map never contains two or more nodes with equivalent
-keys. The length of a map is the number of nodes it contains.
+keys. The <length> of a map is the number of nodes it contains.
6/2
-{AI95-00302-03AI95-00302-03} Each nonempty map has two particular nodes
-called the first node and the last node (which may be the same). Each
-node except for the last node has a successor node. If there are no
-other intervening operations, starting with the first node and
-repeatedly going to the successor node will visit each node in the map
-exactly once until the last node is reached. The exact definition of
-these terms is different for hashed maps and ordered maps.
+{<AI95-00302-03AI95-00302-03>} Each nonempty map has two particular
+nodes called the <first node> and the <last node> (which may be the
+same). Each node except for the last node has a <successor node>. If
+there are no other intervening operations, starting with the first node
+and repeatedly going to the successor node will visit each node in the
+map exactly once until the last node is reached. The exact definition
+of these terms is different for hashed maps and ordered maps.
7/2
-{AI95-00302-03AI95-00302-03} [Some operations of these generic packages
-have access-to-subprogram parameters. To ensure such operations are
-well-defined, they guard against certain actions by the designated
-subprogram. In particular, some operations check for "tampering with
-cursors" of a container because they depend on the set of elements of
-the container remaining constant, and others check for "tampering with
-elements" of a container because they depend on elements of the
-container not being replaced.]
+{<AI95-00302-03AI95-00302-03>} [Some operations of these generic
+packages have access-to-subprogram parameters. To ensure such
+operations are well-defined, they guard against certain actions by the
+designated subprogram. In particular, some operations check for
+"tampering with cursors" of a container because they depend on the set
+of elements of the container remaining constant, and others check for
+"tampering with elements" of a container because they depend on elements
+of the container not being replaced.]
8/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with cursors
-of a map object M if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+cursors> of a map object <M> if:
9/2
- * it inserts or deletes elements of M, that is, it calls the Insert,
- Include, Clear, Delete, or Exclude procedures with M as a
+ * it inserts or deletes elements of <M>, that is, it calls the
+ Insert, Include, Clear, Delete, or Exclude procedures with <M> as a
parameter; or
9.a/2
@@ -88102,11 +88401,11 @@ of a map object M if:
definition are included.
10/2
- * it finalizes M; or
+ * it finalizes <M>; or
10.1/3
- * {AI05-0001-1AI05-0001-1} it calls the Assign procedure with M as
- the Target parameter; or
+ * {<AI05-0001-1AI05-0001-1>} it calls the Assign procedure with <M>
+ as the Target parameter; or
10.a/3
Ramification: We don't need to explicitly mention
@@ -88115,26 +88414,26 @@ of a map object M if:
already defined as tampering with cursors.
11/2
- * it calls the Move procedure with M as a parameter; or
+ * it calls the Move procedure with <M> as a parameter; or
12/2
* it calls one of the operations defined to tamper with the cursors
- of M.
+ of <M>.
12.a/2
Ramification: Replace only modifies a key and element rather
than rehashing, so it does not tamper with cursors.
13/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with
-elements of a map object M if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+elements> of a map object <M> if:
14/2
- * it tampers with cursors of M; or
+ * it tampers with cursors of <M>; or
15/2
- * it replaces one or more elements of M, that is, it calls the
- Replace or Replace_Element procedures with M as a parameter.
+ * it replaces one or more elements of <M>, that is, it calls the
+ Replace or Replace_Element procedures with <M> as a parameter.
15.a/2
Reason: Complete replacement of an element can cause its
@@ -88144,15 +88443,16 @@ elements of a map object M if:
so Update_Element does not cause a problem.
15.1/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-cursors is prohibited for a particular map object M, Program_Error is
-propagated by a call of any language-defined subprogram that is defined
-to tamper with the cursors of M, leaving M unmodified. Similarly, when
-tampering with elements is prohibited for a particular map object M,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with cursors is <prohibited> for a particular map object <M>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the elements of M [(or tamper with the
-cursors of M)], leaving M unmodified. These checks are made before any
-other defined behavior of the body of the language-defined subprogram.
+that is defined to tamper with the cursors of <M>, leaving <M>
+unmodified. Similarly, when tampering with elements is <prohibited> for
+a particular map object <M>, Program_Error is propagated by a call of
+any language-defined subprogram that is defined to tamper with the
+elements of <M> [(or tamper with the cursors of <M>)], leaving <M>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
15.b/3
Proof: Tampering with elements includes tampering with
@@ -88160,23 +88460,23 @@ other defined behavior of the body of the
language-defined subprogram.
sentence.
16/2
-{AI95-00302-03AI95-00302-03} Empty_Map represents the empty Map object.
-It has a length of 0. If an object of type Map is not otherwise
-initialized, it is initialized to the same value as Empty_Map.
+{<AI95-00302-03AI95-00302-03>} Empty_Map represents the empty Map
+object. It has a length of 0. If an object of type Map is not
+otherwise initialized, it is initialized to the same value as Empty_Map.
17/2
-{AI95-00302-03AI95-00302-03} No_Element represents a cursor that
+{<AI95-00302-03AI95-00302-03>} No_Element represents a cursor that
designates no node. If an object of type Cursor is not otherwise
initialized, it is initialized to the same value as No_Element.
18/2
-{AI95-00302-03AI95-00302-03} The predefined "=" operator for type Cursor
-returns True if both cursors are No_Element, or designate the same
-element in the same container.
+{<AI95-00302-03AI95-00302-03>} The predefined "=" operator for type
+Cursor returns True if both cursors are No_Element, or designate the
+same element in the same container.
19/2
-{AI95-00302-03AI95-00302-03} Execution of the default implementation of
-the Input, Output, Read, or Write attribute of type Cursor raises
+{<AI95-00302-03AI95-00302-03>} Execution of the default implementation
+of the Input, Output, Read, or Write attribute of type Cursor raises
Program_Error.
19.a/2
@@ -88188,14 +88488,14 @@ Program_Error.
specified if there is a need to support streaming.
19.1/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Map'Write for a Map
-object M writes Length(M) elements of the map to the stream. It also
-may write additional information about the map.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Map'Write for a
+Map object <M> writes Length(<M>) elements of the map to the stream. It
+also may write additional information about the map.
19.2/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Map'Read reads the
-representation of a map from the stream, and assigns to Item a map with
-the same length and elements as was written by Map'Write.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Map'Read reads the
+representation of a map from the stream, and assigns to <Item> a map
+with the same length and elements as was written by Map'Write.
19.b/3
Ramification: Streaming more elements than the container
@@ -88206,12 +88506,12 @@ the same length and elements as was written by
Map'Write.
function Has_Element (Position : Cursor) return Boolean;
19.4/3
- {AI05-0212-1AI05-0212-1} Returns True if Position designates
+ {<AI05-0212-1AI05-0212-1>} Returns True if Position designates
an element, and returns False otherwise.
19.c/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0212-1AI05-0212-1} This function might not detect
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0212-1AI05-0212-1>} This function might not detect
cursors that designate deleted elements; such cursors are
invalid (see below) and the result of calling Has_Element with
an invalid cursor is unspecified (but not erroneous).
@@ -88220,19 +88520,19 @@ the same length and elements as was written by
Map'Write.
function "=" (Left, Right : Map) return Boolean;
21/2
- {AI95-00302-03AI95-00302-03} If Left and Right denote the same
- map object, then the function returns True. If Left and Right
- have different lengths, then the function returns False.
- Otherwise, for each key K in Left, the function returns False
- if:
+ {<AI95-00302-03AI95-00302-03>} If Left and Right denote the
+ same map object, then the function returns True. If Left and
+ Right have different lengths, then the function returns False.
+ Otherwise, for each key <K> in Left, the function returns
+ False if:
22/2
- * a key equivalent to K is not present in Right; or
+ * a key equivalent to <K> is not present in Right; or
23/2
- * the element associated with K in Left is not equal to the
- element associated with K in Right (using the generic
- formal equality operator for elements).
+ * the element associated with <K> in Left is not equal to
+ the element associated with <K> in Right (using the
+ generic formal equality operator for elements).
24/2
If the function has not returned a result after checking all
@@ -88254,28 +88554,28 @@ the same length and elements as was written by
Map'Write.
function Length (Container : Map) return Count_Type;
26/2
- {AI95-00302-03AI95-00302-03} Returns the number of nodes in
+ {<AI95-00302-03AI95-00302-03>} Returns the number of nodes in
Container.
27/2
function Is_Empty (Container : Map) return Boolean;
28/2
- {AI95-00302-03AI95-00302-03} Equivalent to Length (Container)
- = 0.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Length
+ (Container) = 0.
29/2
procedure Clear (Container : in out Map);
30/2
- {AI95-00302-03AI95-00302-03} Removes all the nodes from
+ {<AI95-00302-03AI95-00302-03>} Removes all the nodes from
Container.
31/2
function Key (Position : Cursor) return Key_Type;
32/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. Otherwise, Key returns
the key component of the node designated by Position.
@@ -88283,7 +88583,7 @@ the same length and elements as was written by
Map'Write.
function Element (Position : Cursor) return Element_Type;
34/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. Otherwise, Element
returns the element component of the node designated by
Position.
@@ -88294,7 +88594,7 @@ the same length and elements as was written by
Map'Write.
New_Item : in Element_Type);
36/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
@@ -88308,8 +88608,8 @@ the same length and elements as was written by
Map'Write.
Element : in Element_Type));
38/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated. Otherwise, Query_Element
calls Process.all with the key and element from the node
designated by Position as the arguments. Tampering with the
@@ -88326,8 +88626,8 @@ the same length and elements as was written by
Map'Write.
Element : in out Element_Type));
40/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated; if Position does not designate
an element in Container, then Program_Error is propagated.
Otherwise, Update_Element calls Process.all with the key and
@@ -88355,8 +88655,8 @@ the same length and elements as was written by
Map'Write.
with Implicit_Dereference => Element;
41.3/3
- {AI05-0212-1AI05-0212-1} The types Constant_Reference_Type and
- Reference_Type need finalization.
+ {<AI05-0212-1AI05-0212-1>} The types Constant_Reference_Type
+ and Reference_Type need finalization.
41.4/3
The default initialization of an object of type
@@ -88378,22 +88678,22 @@ the same length and elements as was written by
Map'Write.
return Constant_Reference_Type;
41.6/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a map given a
cursor.
41.7/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Constant_Reference
- returns an object whose discriminant is an access value that
- designates the element designated by Position. Tampering with
- the elements of Container is prohibited while the object
- returned by Constant_Reference exists and has not been
- finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Constant_Reference returns an object whose discriminant is an
+ access value that designates the element designated by
+ Position. Tampering with the elements of Container is
+ prohibited while the object returned by Constant_Reference
+ exists and has not been finalized.
41.8/3
function Reference (Container : aliased in out Map;
@@ -88401,21 +88701,22 @@ the same length and elements as was written by
Map'Write.
return Reference_Type;
41.9/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a map
given a cursor.
41.10/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Reference returns an
- object whose discriminant is an access value that designates
- the element designated by Position. Tampering with the
- elements of Container is prohibited while the object returned
- by Reference exists and has not been finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Reference returns an object whose discriminant is an access
+ value that designates the element designated by Position.
+ Tampering with the elements of Container is prohibited while
+ the object returned by Reference exists and has not been
+ finalized.
41.11/3
function Constant_Reference (Container : aliased in Map;
@@ -88423,7 +88724,7 @@ the same length and elements as was written by
Map'Write.
return Constant_Reference_Type;
41.12/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a map given a key
@@ -88439,7 +88740,7 @@ the same length and elements as was written by
Map'Write.
return Reference_Type;
41.15/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a map
@@ -88452,14 +88753,14 @@ the same length and elements as was written by
Map'Write.
procedure Assign (Target : in out Map; Source : in Map);
41.18/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, the operation has no
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, the operation has no
effect. Otherwise, the key/element pairs of Source are copied
to Target as for an assignment_statement assigning Source to
Target.
41.c/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the bounded map containers. For an
unbounded map, Assign(A, B) and A := B behave identically.
For a bounded map, := will raise an exception if the container
@@ -88471,11 +88772,11 @@ the same length and elements as was written by
Map'Write.
Source : in out Map);
43/3
- {AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1}
- {AI05-0248-1AI05-0248-1} {AI05-0262-1AI05-0262-1} If Target
- denotes the same object as Source, then the operation has no
- effect. Otherwise, the operation is equivalent to Assign
- (Target, Source) followed by Clear (Source).
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>}
+ {<AI05-0248-1AI05-0248-1>} {<AI05-0262-1AI05-0262-1>} If
+ Target denotes the same object as Source, then the operation
+ has no effect. Otherwise, the operation is equivalent to
+ Assign (Target, Source) followed by Clear (Source).
44/2
procedure Insert (Container : in out Map;
@@ -88485,7 +88786,7 @@ the same length and elements as was written by
Map'Write.
Inserted : out Boolean);
45/2
- {AI95-00302-03AI95-00302-03} Insert checks if a node with a
+ {<AI95-00302-03AI95-00302-03>} Insert checks if a node with a
key equivalent to Key is already present in Container. If a
match is found, Inserted is set to False and Position
designates the element with the matching key. Otherwise,
@@ -88502,10 +88803,10 @@ the same length and elements as was written by
Map'Write.
Inserted : out Boolean);
47/2
- {AI95-00302-03AI95-00302-03} Insert inserts Key into Container
- as per the five-parameter Insert, with the difference that an
- element initialized by default (see *note 3.3.1::) is
- inserted.
+ {<AI95-00302-03AI95-00302-03>} Insert inserts Key into
+ Container as per the five-parameter Insert, with the
+ difference that an element initialized by default (see *note
+ 3.3.1::) is inserted.
48/2
procedure Insert (Container : in out Map;
@@ -88513,7 +88814,7 @@ the same length and elements as was written by
Map'Write.
New_Item : in Element_Type);
49/2
- {AI95-00302-03AI95-00302-03} Insert inserts Key and New_Item
+ {<AI95-00302-03AI95-00302-03>} Insert inserts Key and New_Item
into Container as per the five-parameter Insert, with the
difference that if a node with a key equivalent to Key is
already in the map, then Constraint_Error is propagated.
@@ -88540,9 +88841,9 @@ the same length and elements as was written by
Map'Write.
New_Item : in Element_Type);
51/2
- {AI95-00302-03AI95-00302-03} Include inserts Key and New_Item
- into Container as per the five-parameter Insert, with the
- difference that if a node with a key equivalent to Key is
+ {<AI95-00302-03AI95-00302-03>} Include inserts Key and
+ New_Item into Container as per the five-parameter Insert, with
+ the difference that if a node with a key equivalent to Key is
already in the map, then this operation assigns Key and
New_Item to the matching node. Any exception raised during
assignment is propagated.
@@ -88570,7 +88871,7 @@ the same length and elements as was written by
Map'Write.
New_Item : in Element_Type);
53/2
- {AI95-00302-03AI95-00302-03} Replace checks if a node with a
+ {<AI95-00302-03AI95-00302-03>} Replace checks if a node with a
key equivalent to Key is present in Container. If a match is
found, Replace assigns Key and New_Item to the matching node;
otherwise, Constraint_Error is propagated.
@@ -88587,7 +88888,7 @@ the same length and elements as was written by
Map'Write.
Key : in Key_Type);
55/2
- {AI95-00302-03AI95-00302-03} Exclude checks if a node with a
+ {<AI95-00302-03AI95-00302-03>} Exclude checks if a node with a
key equivalent to Key is present in Container. If a match is
found, Exclude removes the node from the map.
@@ -88600,7 +88901,7 @@ the same length and elements as was written by
Map'Write.
Key : in Key_Type);
57/2
- {AI95-00302-03AI95-00302-03} Delete checks if a node with a
+ {<AI95-00302-03AI95-00302-03>} Delete checks if a node with a
key equivalent to Key is present in Container. If a match is
found, Delete removes the node from the map; otherwise,
Constraint_Error is propagated.
@@ -88610,7 +88911,7 @@ the same length and elements as was written by
Map'Write.
Position : in out Cursor);
59/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. If Position does not
designate an element in Container, then Program_Error is
propagated. Otherwise, Delete removes the node designated by
@@ -88630,7 +88931,7 @@ the same length and elements as was written by
Map'Write.
function First (Container : Map) return Cursor;
61/2
- {AI95-00302-03AI95-00302-03} If Length (Container) = 0, then
+ {<AI95-00302-03AI95-00302-03>} If Length (Container) = 0, then
First returns No_Element. Otherwise, First returns a cursor
that designates the first node in Container.
@@ -88638,16 +88939,17 @@ the same length and elements as was written by
Map'Write.
function Next (Position : Cursor) return Cursor;
63/2
- {AI95-00302-03AI95-00302-03} Returns a cursor that designates
- the successor of the node designated by Position. If Position
- designates the last node, then No_Element is returned. If
- Position equals No_Element, then No_Element is returned.
+ {<AI95-00302-03AI95-00302-03>} Returns a cursor that
+ designates the successor of the node designated by Position.
+ If Position designates the last node, then No_Element is
+ returned. If Position equals No_Element, then No_Element is
+ returned.
64/2
procedure Next (Position : in out Cursor);
65/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position := Next
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position := Next
(Position).
66/2
@@ -88655,7 +88957,7 @@ the same length and elements as was written by
Map'Write.
Key : Key_Type) return Cursor;
67/2
- {AI95-00302-03AI95-00302-03} If Length (Container) equals 0,
+ {<AI95-00302-03AI95-00302-03>} If Length (Container) equals 0,
then Find returns No_Element. Otherwise, Find checks if a
node with a key equivalent to Key is present in Container. If
a match is found, a cursor designating the matching node is
@@ -88666,7 +88968,7 @@ the same length and elements as was written by
Map'Write.
Key : Key_Type) return Element_Type;
69/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Find
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Find
(Container, Key)).
70/2
@@ -88674,10 +88976,10 @@ the same length and elements as was written by
Map'Write.
Key : Key_Type) return Boolean;
71/2
- {AI95-00302-03AI95-00302-03} Equivalent to Find (Container,
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Find (Container,
Key) /= No_Element.
- Paragraphs 72 and 73 were moved above.
+ <Paragraphs 72 and 73 were moved above.>
74/2
procedure Iterate
@@ -88685,12 +88987,12 @@ the same length and elements as was written by
Map'Write.
Process : not null access procedure (Position : in Cursor));
75/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} Iterate
- calls Process.all with a cursor that designates each node in
- Container, starting with the first node and moving the cursor
- according to the successor relation. Tampering with the
- cursors of Container is prohibited during the execution of a
- call on Process.all. Any exception raised by Process.all is
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>}
+ Iterate calls Process.all with a cursor that designates each
+ node in Container, starting with the first node and moving the
+ cursor according to the successor relation. Tampering with
+ the cursors of Container is prohibited during the execution of
+ a call on Process.all. Any exception raised by Process.all is
propagated.
75.a/2
@@ -88705,15 +89007,16 @@ the same length and elements as was written by
Map'Write.
_Bounded (Run-Time) Errors_
75.1/3
-{AI05-0022-1AI05-0022-1} {AI05-0248-1AI05-0248-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of a map package, to tamper with
-elements of any map parameter of the operation. Either Program_Error is
-raised, or the operation works as defined on the value of the map either
-prior to, or subsequent to, some or all of the modifications to the map.
+{<AI05-0022-1AI05-0022-1>} {<AI05-0248-1AI05-0248-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of a map package, to
+tamper with elements of any map parameter of the operation. Either
+Program_Error is raised, or the operation works as defined on the value
+of the map either prior to, or subsequent to, some or all of the
+modifications to the map.
75.2/3
-{AI05-0027-1AI05-0027-1} It is a bounded error to call any subprogram
+{<AI05-0027-1AI05-0027-1>} It is a bounded error to call any subprogram
declared in the visible part of a map package when the associated
container has been finalized. If the operation takes Container as an in
out parameter, then it raises Constraint_Error or Program_Error.
@@ -88723,14 +89026,14 @@ container, or it raises Constraint_Error or
Program_Error.
_Erroneous Execution_
76/2
-{AI95-00302-03AI95-00302-03} A Cursor value is invalid if any of the
+{<AI95-00302-03AI95-00302-03>} A Cursor value is <invalid> if any of the
following have occurred since it was created:
77/2
* The map that contains the node it designates has been finalized;
77.1/3
- * {AI05-0160-1AI05-0160-1} The map that contains the node it
+ * {<AI05-0160-1AI05-0160-1>} The map that contains the node it
designates has been used as the Target of a call to Assign, or as
the target of an assignment_statement;
@@ -88739,12 +89042,12 @@ following have occurred since it was created:
Source or Target of a call to Move; or
79/3
- * {AI05-0160-1AI05-0160-1} {AI05-0262-1AI05-0262-1} The node it
+ * {<AI05-0160-1AI05-0160-1>} {<AI05-0262-1AI05-0262-1>} The node it
designates has been removed from the map that previously contained
the node.
79.a/3
- Ramification: {AI05-0160-1AI05-0160-1} This can happen
+ Ramification: {<AI05-0160-1AI05-0160-1>} This can happen
directly via calls to Clear, Exclude, and Delete.
80/2
@@ -88767,7 +89070,7 @@ Containers.Ordered_Maps is called with an invalid
cursor parameter.
detected.
80.1/3
-{AI05-0212-1AI05-0212-1} Execution is erroneous if the map associated
+{<AI05-0212-1AI05-0212-1>} Execution is erroneous if the map associated
with the result of a call to Reference or Constant_Reference is
finalized before the result object returned by the call to Reference or
Constant_Reference is finalized.
@@ -88789,18 +89092,18 @@ Constant_Reference is finalized.
_Implementation Requirements_
81/2
-{AI95-00302-03AI95-00302-03} No storage associated with a Map object
+{<AI95-00302-03AI95-00302-03>} No storage associated with a Map object
shall be lost upon assignment or scope exit.
82/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The execution of
-an assignment_statement for a map shall have the effect of copying the
-elements from the source map object to the target map object and
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The execution
+of an assignment_statement for a map shall have the effect of copying
+the elements from the source map object to the target map object and
changing the length of the target object to that of the source object.
82.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a Map is a "deep" copy; that is the elements are copied as
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a Map is a "deep" copy; that is the elements are copied as
well as the data structures. We say "effect of" in order to
allow the implementation to avoid copying elements immediately
if it wishes. For instance, an implementation that avoided
@@ -88811,7 +89114,7 @@ changing the length of the target object to that of the
source object.
_Implementation Advice_
83/2
-{AI95-00302-03AI95-00302-03} Move should not copy elements, and should
+{<AI95-00302-03AI95-00302-03>} Move should not copy elements, and should
minimize copying of internal data structures.
83.a/2
@@ -88825,7 +89128,7 @@ minimize copying of internal data structures.
the Source container to the Target container.
84/2
-{AI95-00302-03AI95-00302-03} If an exception is propagated from a map
+{<AI95-00302-03AI95-00302-03>} If an exception is propagated from a map
operation, no storage should be lost, nor any elements removed from a
map unless specified by the operation.
@@ -88843,50 +89146,51 @@ map unless specified by the operation.
_Wording Changes from Ada 95_
84.c/2
- {AI95-00302-03AI95-00302-03} This description of maps is new;
- the extensions are documented with the specific packages.
+ {<AI95-00302-03AI95-00302-03>} This description of maps is
+ new; the extensions are documented with the specific packages.
_Extensions to Ada 2005_
84.d/3
- {AI05-0212-1AI05-0212-1} Added reference support to make map
+ {<AI05-0212-1AI05-0212-1>} Added reference support to make map
containers more convenient to use.
_Wording Changes from Ada 2005_
84.e/3
- {AI05-0001-1AI05-0001-1} Added procedure Assign; the extension
- and incompatibility is documented with the specific packages.
+ {<AI05-0001-1AI05-0001-1>} Added procedure Assign; the
+ extension and incompatibility is documented with the specific
+ packages.
84.f/3
- {AI05-0001-1AI05-0001-1} Generalized the definition of Move.
+ {<AI05-0001-1AI05-0001-1>} Generalized the definition of Move.
Specified which elements are read/written by stream
attributes.
84.g/3
- {AI05-0022-1AI05-0022-1} Correction: Added a Bounded
+ {<AI05-0022-1AI05-0022-1>} Correction: Added a Bounded
(Run-Time) Error to cover tampering by generic actual
subprograms.
84.h/3
- {AI05-0027-1AI05-0027-1} Correction: Added a Bounded
+ {<AI05-0027-1AI05-0027-1>} Correction: Added a Bounded
(Run-Time) Error to cover access to finalized map containers.
84.i/3
- {AI05-0160-1AI05-0160-1} Correction: Revised the definition of
- invalid cursors to cover missing (and new) cases.
+ {<AI05-0160-1AI05-0160-1>} Correction: Revised the definition
+ of invalid cursors to cover missing (and new) cases.
84.j/3
- {AI05-0265-1AI05-0265-1} Correction: Defined when a container
- prohibits tampering in order to more clearly define where the
- check is made and the exception raised.
+ {<AI05-0265-1AI05-0265-1>} Correction: Defined when a
+ container prohibits tampering in order to more clearly define
+ where the check is made and the exception raised.
_Wording Changes from Ada 2012_
84.k/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.5, Next: A.18.6, Prev: A.18.4, Up: A.18
@@ -88897,11 +89201,11 @@ A.18.5 The Generic Package Containers.Hashed_Maps
_Static Semantics_
1/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Hashed_Maps has the following declaration:
2/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Key_Type is private;
type Element_Type is private;
@@ -88915,7 +89219,7 @@ Containers.Hashed_Maps has the following declaration:
pragma Remote_Types(Hashed_Maps);
3/3
- {AI05-0212-1AI05-0212-1} type Map is tagged private
+ {<AI05-0212-1AI05-0212-1>} type Map is tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
@@ -88933,10 +89237,10 @@ Containers.Hashed_Maps has the following declaration:
No_Element : constant Cursor;
6.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
6.2/3
- {AI05-0212-1AI05-0212-1} package Map_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Map_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
7/2
@@ -88984,39 +89288,39 @@ Containers.Hashed_Maps has the following declaration:
Element : in out Element_Type));
17.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
17.2/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
17.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Map;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Map;
Position : in Cursor)
return Constant_Reference_Type;
17.4/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Map;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Map;
Position : in Cursor)
return Reference_Type;
17.5/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Map;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Map;
Key : in Key_Type)
return Constant_Reference_Type;
17.6/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Map;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Map;
Key : in Key_Type)
return Reference_Type;
17.7/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Map; Source
: in Map);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Map;
Source : in Map);
17.8/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Map; Capacity :
Count_Type := 0) return Map;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Map; Capacity :
Count_Type := 0) return Map;
18/2
procedure Move (Target : in out Map;
@@ -89087,7 +89391,7 @@ Containers.Hashed_Maps has the following declaration:
Key : Key_Type) return Boolean;
33/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
34/2
function Equivalent_Keys (Left, Right : Cursor)
@@ -89109,22 +89413,22 @@ Containers.Hashed_Maps has the following declaration:
Process : not null access procedure (Position : in Cursor));
37.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Map)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Map)
return Map_Iterator_Interfaces.Forward_Iterator'Class;
38/2
private
39/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
40/2
end Ada.Containers.Hashed_Maps;
41/2
-{AI95-00302-03AI95-00302-03} An object of type Map contains an
+{<AI95-00302-03AI95-00302-03>} An object of type Map contains an
expandable hash table, which is used to provide direct access to nodes.
-The capacity of an object of type Map is the maximum number of nodes
+The <capacity> of an object of type Map is the maximum number of nodes
that can be inserted into the hash table prior to it being automatically
expanded.
@@ -89134,9 +89438,9 @@ expanded.
linked lists hanging off of each bucket. Note that in that
implementation a cursor needs a back pointer to the Map object
to implement iteration; that could either be in the nodes, or
- in the cursor object. To provide an average O(1) access time,
- capacity would typically equal the number of buckets in such
- an implementation, so that the average bucket linked list
+ in the cursor object. To provide an average <O>(1) access
+ time, capacity would typically equal the number of buckets in
+ such an implementation, so that the average bucket linked list
length would be no more than 1.0.
41.b/2
@@ -89145,17 +89449,17 @@ expanded.
that they are hashed in.
42/2
-{AI95-00302-03AI95-00302-03} Two keys K1 and K2 are defined to be
-equivalent if Equivalent_Keys (K1, K2) returns True.
+{<AI95-00302-03AI95-00302-03>} Two keys <K1> and <K2> are defined to be
+<equivalent> if Equivalent_Keys (<K1>, <K2>) returns True.
43/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function Hash is expected to return the same value each time it is
-called with a particular key value. For any two equivalent key values,
-the actual for Hash is expected to return the same value. If the actual
-for Hash behaves in some other manner, the behavior of this package is
-unspecified. Which subprograms of this package call Hash, and how many
-times they call it, is unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function Hash is expected to return the same value each time it
+is called with a particular key value. For any two equivalent key
+values, the actual for Hash is expected to return the same value. If
+the actual for Hash behaves in some other manner, the behavior of this
+package is unspecified. Which subprograms of this package call Hash,
+and how many times they call it, is unspecified.
43.a/2
Implementation Note: The implementation is not required to
@@ -89171,14 +89475,14 @@ times they call it, is unspecified.
behavior is unspecified.
44/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function Equivalent_Keys on Key_Type values is expected to return the
-same value each time it is called with a particular pair of key values.
-It should define an equivalence relationship, that is, be reflexive,
-symmetric, and transitive. If the actual for Equivalent_Keys behaves in
-some other manner, the behavior of this package is unspecified. Which
-subprograms of this package call Equivalent_Keys, and how many times
-they call it, is unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function Equivalent_Keys on Key_Type values is expected to return
+the same value each time it is called with a particular pair of key
+values. It should define an equivalence relationship, that is, be
+reflexive, symmetric, and transitive. If the actual for Equivalent_Keys
+behaves in some other manner, the behavior of this package is
+unspecified. Which subprograms of this package call Equivalent_Keys,
+and how many times they call it, is unspecified.
44.a/2
Implementation Note: As with Hash, the implementation is not
@@ -89189,8 +89493,8 @@ they call it, is unspecified.
function), or the behavior is unspecified.
45/2
-{AI95-00302-03AI95-00302-03} If the value of a key stored in a node of a
-map is changed other than by an operation in this package such that at
+{<AI95-00302-03AI95-00302-03>} If the value of a key stored in a node of
+a map is changed other than by an operation in this package such that at
least one of Hash or Equivalent_Keys give different results, the
behavior of this package is unspecified.
@@ -89216,8 +89520,8 @@ behavior of this package is unspecified.
someone passing as Hash a random number generator.
46/2
-{AI95-00302-03AI95-00302-03} Which nodes are the first node and the last
-node of a map, and which node is the successor of a given node, are
+{<AI95-00302-03AI95-00302-03>} Which nodes are the first node and the
+last node of a map, and which node is the successor of a given node, are
unspecified, other than the general semantics described in *note
A.18.4::.
@@ -89232,7 +89536,7 @@ A.18.4::.
function Capacity (Container : Map) return Count_Type;
48/2
- {AI95-00302-03AI95-00302-03} Returns the capacity of
+ {<AI95-00302-03AI95-00302-03>} Returns the capacity of
Container.
49/2
@@ -89240,8 +89544,8 @@ A.18.4::.
Capacity : in Count_Type);
50/2
- {AI95-00302-03AI95-00302-03} Reserve_Capacity allocates a new
- hash table such that the length of the resulting map can
+ {<AI95-00302-03AI95-00302-03>} Reserve_Capacity allocates a
+ new hash table such that the length of the resulting map can
become at least the value Capacity without requiring an
additional call to Reserve_Capacity, and is large enough to
hold the current length of Container. Reserve_Capacity then
@@ -89263,8 +89567,8 @@ A.18.4::.
elements are inserted.
51.b/3
- {AI05-0005-1AI05-0005-1} While Reserve_Capacity can be used to
- reduce the capacity of a map, we do not specify whether an
+ {<AI05-0005-1AI05-0005-1>} While Reserve_Capacity can be used
+ to reduce the capacity of a map, we do not specify whether an
implementation actually supports reduction of the capacity.
Since the actual capacity can be anything greater than or
equal to Capacity, an implementation never has to reduce the
@@ -89279,7 +89583,7 @@ A.18.4::.
procedure Clear (Container : in out Map);
53/2
- {AI95-00302-03AI95-00302-03} In addition to the semantics
+ {<AI95-00302-03AI95-00302-03>} In addition to the semantics
described in *note A.18.4::, Clear does not affect the
capacity of Container.
@@ -89287,9 +89591,9 @@ A.18.4::.
procedure Assign (Target : in out Map; Source : in Map);
53.2/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} In addition
- to the semantics described in *note A.18.4::, if the length of
- Source is greater than the capacity of Target,
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} In
+ addition to the semantics described in *note A.18.4::, if the
+ length of Source is greater than the capacity of Target,
Reserve_Capacity (Target, Length (Source)) is called before
assigning any elements.
@@ -89297,12 +89601,12 @@ A.18.4::.
function Copy (Source : Map; Capacity : Count_Type := 0) return Map;
53.4/3
- {AI05-0001-1AI05-0001-1} Returns a map whose keys and elements
- are initialized from the keys and elements of 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 at least the specified value. Otherwise,
- the operation propagates Capacity_Error.
+ {<AI05-0001-1AI05-0001-1>} Returns a map whose keys and
+ elements are initialized from the keys and elements of 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 at least the specified value.
+ Otherwise, the operation propagates Capacity_Error.
53.a/2
Implementation Note: In:
@@ -89324,7 +89628,7 @@ A.18.4::.
Inserted : out Boolean);
55/2
- {AI95-00302-03AI95-00302-03} In addition to the semantics
+ {<AI95-00302-03AI95-00302-03>} In addition to the semantics
described in *note A.18.4::, if Length (Container) equals
Capacity (Container), then Insert first calls Reserve_Capacity
to increase the capacity of Container to some larger value.
@@ -89406,7 +89710,7 @@ A.18.4::.
return Boolean;
57/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Keys
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Equivalent_Keys
(Key (Left), Key (Right)).
58/2
@@ -89414,7 +89718,7 @@ A.18.4::.
Right : Key_Type) return Boolean;
59/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Keys
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Equivalent_Keys
(Key (Left), Right).
60/2
@@ -89422,7 +89726,7 @@ A.18.4::.
Right : Cursor) return Boolean;
61/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Keys
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Equivalent_Keys
(Left, Key (Right)).
61.1/3
@@ -89430,8 +89734,8 @@ A.18.4::.
return Map_Iterator_Interfaces.Forward_Iterator'Class;
61.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns an iterator object
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns an iterator object
(see *note 5.5.1::) that will generate a value for a loop
parameter (see *note 5.5.2::) designating each node in
Container, starting with the first node and moving the cursor
@@ -89444,61 +89748,61 @@ A.18.4::.
_Implementation Advice_
62/2
-{AI95-00302-03AI95-00302-03} If N is the length of a map, the average
-time complexity of the subprograms Element, Insert, Include, Replace,
-Delete, Exclude and Find that take a key parameter should be O(log N).
-The average time complexity of the subprograms that take a cursor
-parameter should be O(1). The average time complexity of
-Reserve_Capacity should be O(N).
+{<AI95-00302-03AI95-00302-03>} If <N> is the length of a map, the
+average time complexity of the subprograms Element, Insert, Include,
+Replace, Delete, Exclude and Find that take a key parameter should be
+<O>(log <N>). The average time complexity of the subprograms that take
+a cursor parameter should be <O>(1). The average time complexity of
+Reserve_Capacity should be <O>(<N>).
62.a/2
Implementation Advice: The average time complexity of Element,
Insert, Include, Replace, Delete, Exclude and Find operations
that take a key parameter for Containers.Hashed_Maps should be
- O(log N). The average time complexity of the subprograms of
- Containers.Hashed_Maps that take a cursor parameter should be
- O(1). The average time complexity of
- Containers.Hashed_Maps.Reserve_Capacity should be O(N).
+ <O>(log <N>). The average time complexity of the subprograms
+ of Containers.Hashed_Maps that take a cursor parameter should
+ be <O>(1). The average time complexity of
+ Containers.Hashed_Maps.Reserve_Capacity should be <O>(<N>).
62.b/2
Reason: We do not mean to overly constrain implementation
strategies here. However, it is important for portability
that the performance of large containers has roughly the same
factors on different implementations. If a program is moved
- to an implementation for which Find is O(N), that program
- could be unusable when the maps are large. We allow O(log N)
- access because the proportionality constant and caching
+ to an implementation for which Find is <O>(<N>), that program
+ could be unusable when the maps are large. We allow <O>(log
+ <N>) access because the proportionality constant and caching
effects are likely to be larger than the log factor, and we
don't want to discourage innovative implementations.
_Extensions to Ada 95_
62.c/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Hashed_Maps is new.
_Incompatibilities With Ada 2005_
62.d/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Hashed_Maps. If an instance of
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Hashed_Maps. If an instance of
Containers.Hashed_Maps is referenced in a use_clause, and an
- entity E with the same defining_identifier as a new entity in
- Containers.Hashed_Maps is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ entity <E> with the same defining_identifier as a new entity
+ in Containers.Hashed_Maps is defined in a package that is also
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Extensions to Ada 2005_
62.e/3
- {AI05-0212-1AI05-0212-1} Added iterator and indexing support
+ {<AI05-0212-1AI05-0212-1>} Added iterator and indexing support
to make hashed map containers more convenient to use.
_Wording Changes from Ada 2005_
62.f/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
@@ -89511,11 +89815,11 @@ A.18.6 The Generic Package Containers.Ordered_Maps
_Static Semantics_
1/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Ordered_Maps has the following declaration:
2/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Key_Type is private;
type Element_Type is private;
@@ -89529,7 +89833,7 @@ Containers.Ordered_Maps has the following declaration:
function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
4/3
- {AI05-0212-1AI05-0212-1} type Map is tagged private
+ {<AI05-0212-1AI05-0212-1>} type Map is tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
@@ -89547,10 +89851,10 @@ Containers.Ordered_Maps has the following declaration:
No_Element : constant Cursor;
7.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
7.2/3
- {AI05-0212-1AI05-0212-1} package Map_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Map_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
8/2
@@ -89591,39 +89895,39 @@ Containers.Ordered_Maps has the following declaration:
Element : in out Element_Type));
16.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
16.2/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
16.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Map;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Map;
Position : in Cursor)
return Constant_Reference_Type;
16.4/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Map;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Map;
Position : in Cursor)
return Reference_Type;
16.5/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Map;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Map;
Key : in Key_Type)
return Constant_Reference_Type;
16.6/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Map;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Map;
Key : in Key_Type)
return Reference_Type;
16.7/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Map; Source
: in Map);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Map;
Source : in Map);
16.8/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Map) return Map;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Map) return Map;
17/2
procedure Move (Target : in out Map;
@@ -89726,7 +90030,7 @@ Containers.Ordered_Maps has the following declaration:
Key : Key_Type) return Boolean;
43/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
44/2
function "<" (Left, Right : Cursor) return Boolean;
@@ -89757,30 +90061,30 @@ Containers.Ordered_Maps has the following declaration:
Process : not null access procedure (Position : in Cursor));
51.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Map)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Map)
return Map_Iterator_Interfaces.Reversible_Iterator'Class;
51.2/3
- {AI05-0262-1AI05-0262-1} function Iterate (Container : in Map; Start :
in Cursor)
+ {<AI05-0262-1AI05-0262-1>} function Iterate (Container : in Map; Start
: in Cursor)
return Map_Iterator_Interfaces.Reversible_Iterator'Class;
52/2
private
53/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
54/2
end Ada.Containers.Ordered_Maps;
55/2
-{AI95-00302-03AI95-00302-03} Two keys K1 and K2 are equivalent if both
-K1 < K2 and K2 < K1 return False, using the generic formal "<" operator
-for keys. Function Equivalent_Keys returns True if Left and Right are
-equivalent, and False otherwise.
+{<AI95-00302-03AI95-00302-03>} Two keys <K1> and <K2> are <equivalent>
+if both <K1> < <K2> and <K2> < <K1> return False, using the generic
+formal "<" operator for keys. Function Equivalent_Keys returns True if
+Left and Right are equivalent, and False otherwise.
56/3
-{AI95-00302-03AI95-00302-03} {AI05-0044-1AI05-0044-1} The actual
+{<AI95-00302-03AI95-00302-03>} {<AI05-0044-1AI05-0044-1>} The actual
function for the generic formal function "<" on Key_Type values is
expected to return the same value each time it is called with a
particular pair of key values. It should define a strict weak ordering
@@ -89802,7 +90106,7 @@ unspecified.
behavior is unspecified.
57/2
-{AI95-00302-03AI95-00302-03} If the value of a key stored in a map is
+{<AI95-00302-03AI95-00302-03>} If the value of a key stored in a map is
changed other than by an operation in this package such that at least
one of "<" or "=" give different results, the behavior of this package
is unspecified.
@@ -89832,28 +90136,29 @@ is unspecified.
that produces random answers.
58/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The first node of
-a nonempty map is the one whose key is less than the key of all the
-other nodes in the map. The last node of a nonempty map is the one
-whose key is greater than the key of all the other elements in the map.
-The successor of a node is the node with the smallest key that is larger
-than the key of the given node. The predecessor of a node is the node
-with the largest key that is smaller than the key of the given node.
-All comparisons are done using the generic formal "<" operator for keys.
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The <first
+node> of a nonempty map is the one whose key is less than the key of all
+the other nodes in the map. The <last node> of a nonempty map is the
+one whose key is greater than the key of all the other elements in the
+map. The <successor> of a node is the node with the smallest key that
+is larger than the key of the given node. The <predecessor> of a node
+is the node with the largest key that is smaller than the key of the
+given node. All comparisons are done using the generic formal "<"
+operator for keys.
58.1/3
function Copy (Source : Map) return Map;
58.2/3
- {AI05-0001-1AI05-0001-1} Returns a map whose keys and elements
- are initialized from the corresponding keys and elements of
- Source.
+ {<AI05-0001-1AI05-0001-1>} Returns a map whose keys and
+ elements are initialized from the corresponding keys and
+ elements of Source.
59/2
procedure Delete_First (Container : in out Map);
60/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, Delete_First has no effect. Otherwise,
the node designated by First (Container) is removed from
Container. Delete_First tampers with the cursors of
@@ -89863,7 +90168,7 @@ All comparisons are done using the generic formal "<"
operator for keys.
procedure Delete_Last (Container : in out Map);
62/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, Delete_Last has no effect. Otherwise, the
node designated by Last (Container) is removed from Container.
Delete_Last tampers with the cursors of Container.
@@ -89872,43 +90177,43 @@ All comparisons are done using the generic formal "<"
operator for keys.
function First_Element (Container : Map) return Element_Type;
64/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (First
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (First
(Container)).
65/2
function First_Key (Container : Map) return Key_Type;
66/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (First
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (First
(Container)).
67/2
function Last (Container : Map) return Cursor;
68/2
- {AI95-00302-03AI95-00302-03} Returns a cursor that designates
- the last node in Container. If Container is empty, returns
- No_Element.
+ {<AI95-00302-03AI95-00302-03>} Returns a cursor that
+ designates the last node in Container. If Container is empty,
+ returns No_Element.
69/2
function Last_Element (Container : Map) return Element_Type;
70/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Last
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Last
(Container)).
71/2
function Last_Key (Container : Map) return Key_Type;
72/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Last
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Last
(Container)).
73/2
function Previous (Position : Cursor) return Cursor;
74/3
- {AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} If
Position equals No_Element, then Previous returns No_Element.
Otherwise, Previous returns a cursor designating the
predecessor node of the one designated by Position. If
@@ -89919,7 +90224,7 @@ All comparisons are done using the generic formal "<"
operator for keys.
procedure Previous (Position : in out Cursor);
76/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position :=
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position :=
Previous (Position).
77/2
@@ -89927,10 +90232,10 @@ All comparisons are done using the generic formal "<"
operator for keys.
Key : Key_Type) return Cursor;
78/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} Floor
- searches for the last node whose key is not greater than Key,
- using the generic formal "<" operator for keys. If such a
- node is found, a cursor that designates it is returned.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ Floor searches for the last node whose key is not greater than
+ Key, using the generic formal "<" operator for keys. If such
+ a node is found, a cursor that designates it is returned.
Otherwise, No_Element is returned.
79/2
@@ -89938,49 +90243,53 @@ All comparisons are done using the generic formal "<"
operator for keys.
Key : Key_Type) return Cursor;
80/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} Ceiling
- searches for the first node whose key is not less than Key,
- using the generic formal "<" operator for keys. If such a
- node is found, a cursor that designates it is returned.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ Ceiling searches for the first node whose key is not less than
+ Key, using the generic formal "<" operator for keys. If such
+ a node is found, a cursor that designates it is returned.
Otherwise, No_Element is returned.
81/2
function "<" (Left, Right : Cursor) return Boolean;
82/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Left) < Key
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Left) < Key
(Right).
83/2
function ">" (Left, Right : Cursor) return Boolean;
84/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Right) < Key
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Right) < Key
(Left).
85/2
function "<" (Left : Cursor; Right : Key_Type) return Boolean;
86/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Left) < Right.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Left) <
+ Right.
87/2
function ">" (Left : Cursor; Right : Key_Type) return Boolean;
88/2
- {AI95-00302-03AI95-00302-03} Equivalent to Right < Key (Left).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Right < Key
+ (Left).
89/2
function "<" (Left : Key_Type; Right : Cursor) return Boolean;
90/2
- {AI95-00302-03AI95-00302-03} Equivalent to Left < Key (Right).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Left < Key
+ (Right).
91/2
function ">" (Left : Key_Type; Right : Cursor) return Boolean;
92/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Right) < Left.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Right) <
+ Left.
93/2
procedure Reverse_Iterate
@@ -89988,27 +90297,27 @@ All comparisons are done using the generic formal "<"
operator for keys.
Process : not null access procedure (Position : in Cursor));
94/3
- {AI95-00302-03AI95-00302-03} {AI05-0212-1AI05-0212-1} Iterates
- over the nodes in Container as per procedure Iterate, with the
- difference that the nodes are traversed in predecessor order,
- starting with the last node.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0212-1AI05-0212-1>}
+ Iterates over the nodes in Container as per procedure Iterate,
+ with the difference that the nodes are traversed in
+ predecessor order, starting with the last node.
94.1/3
function Iterate (Container : in Map)
return Map_Iterator_Interfaces.Reversible_Iterator'Class;
94.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns a reversible iterator
- object (see *note 5.5.1::) that will generate a value for a
- loop parameter (see *note 5.5.2::) designating each node in
- Container, starting with the first node and moving the cursor
- according to the successor relation when used as a forward
- iterator, and starting with the last node and moving the
- cursor according to the predecessor relation when used as a
- reverse iterator. Tampering with the cursors of Container is
- prohibited while the iterator object exists (in particular, in
- the sequence_of_statements of the loop_statement whose
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns a reversible
+ iterator object (see *note 5.5.1::) that will generate a value
+ for a loop parameter (see *note 5.5.2::) designating each node
+ in Container, starting with the first node and moving the
+ cursor according to the successor relation when used as a
+ forward iterator, and starting with the last node and moving
+ the cursor according to the predecessor relation when used as
+ a reverse iterator. Tampering with the cursors of Container
+ is prohibited while the iterator object exists (in particular,
+ in the sequence_of_statements of the loop_statement whose
iterator_specification denotes this object). The iterator
object needs finalization.
@@ -90017,8 +90326,8 @@ All comparisons are done using the generic formal "<"
operator for keys.
return Map_Iterator_Interfaces.Reversible_Iterator'Class;
94.4/3
- {AI05-0262-1AI05-0262-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} If Start is not No_Element and does
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} If Start is not No_Element and does
not designate an item in Container, then Program_Error is
propagated. If Start is No_Element, then Constraint_Error is
propagated. Otherwise, Iterate returns a reversible iterator
@@ -90049,72 +90358,72 @@ All comparisons are done using the generic formal "<"
operator for keys.
_Implementation Advice_
95/2
-{AI95-00302-03AI95-00302-03} If N is the length of a map, then the
+{<AI95-00302-03AI95-00302-03>} If <N> is the length of a map, then the
worst-case time complexity of the Element, Insert, Include, Replace,
Delete, Exclude and Find operations that take a key parameter should be
-O((log N)**2) or better. The worst-case time complexity of the
-subprograms that take a cursor parameter should be O(1).
+<O>((log <N>)**2) or better. The worst-case time complexity of the
+subprograms that take a cursor parameter should be <O>(1).
95.a/2
Implementation Advice: The worst-case time complexity of
Element, Insert, Include, Replace, Delete, Exclude and Find
operations that take a key parameter for
- Containers.Ordered_Maps should be O((log N)**2) or better.
+ Containers.Ordered_Maps should be <O>((log <N>)**2) or better.
The worst-case time complexity of the subprograms of
Containers.Ordered_Maps that take a cursor parameter should be
- O(1).
+ <O>(1).
95.b/2
Implementation Note: A balanced (red-black) tree for keys has
- O(log N) worst-case performance. Note that a O(N) worst-case
- implementation (like a list) would be wrong.
+ <O>(log <N>) worst-case performance. Note that a <O>(<N>)
+ worst-case implementation (like a list) would be wrong.
95.c/2
Reason: We do not mean to overly constrain implementation
strategies here. However, it is important for portability
that the performance of large containers has roughly the same
factors on different implementations. If a program is moved
- to an implementation that takes O(N) to find elements, that
- program could be unusable when the maps are large. We allow
- the extra log N factors because the proportionality constant
- and caching effects are likely to be larger than the log
- factor, and we don't want to discourage innovative
+ to an implementation that takes <O>(<N>) to find elements,
+ that program could be unusable when the maps are large. We
+ allow the extra log <N> factors because the proportionality
+ constant and caching effects are likely to be larger than the
+ log factor, and we don't want to discourage innovative
implementations.
_Extensions to Ada 95_
95.d/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Ordered_Maps is new.
_Incompatibilities With Ada 2005_
95.e/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Ordered_Maps. If an instance of
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Ordered_Maps. If an instance of
Containers.Ordered_Maps is referenced in a use_clause, and an
- entity E with the same defining_identifier as a new entity in
- Containers.Ordered_Maps is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
- use-visible, resulting in errors. This should be rare and is
- easily fixed if it does occur.
+ entity <E> with the same defining_identifier as a new entity
+ in Containers.Ordered_Maps is defined in a package that is
+ also referenced in a use_clause, the entity <E> may no longer
+ be use-visible, resulting in errors. This should be rare and
+ is easily fixed if it does occur.
_Extensions to Ada 2005_
95.f/3
- {AI05-0212-1AI05-0212-1} Added iterator and indexing support
+ {<AI05-0212-1AI05-0212-1>} Added iterator and indexing support
to make ordered map containers more convenient to use.
_Wording Changes from Ada 2005_
95.g/3
- {AI05-0044-1AI05-0044-1} Correction: Redefined "<" actuals to
- require a strict weak ordering; the old definition allowed
+ {<AI05-0044-1AI05-0044-1>} Correction: Redefined "<" actuals
+ to require a strict weak ordering; the old definition allowed
indeterminant comparisons that would not have worked in a
container.
95.h/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
@@ -90125,15 +90434,15 @@ A.18.7 Sets
-----------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic packages
+{<AI95-00302-03AI95-00302-03>} The language-defined generic packages
Containers.Hashed_Sets and Containers.Ordered_Sets provide private types
Set and Cursor, and a set of operations for each type. A set container
allows elements of an arbitrary type to be stored without duplication.
A hashed set uses a hash function to organize elements, while an ordered
-set orders its element per a specified relation.
+set orders its element per a specified relation.
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00302-03AI95-00302-03>} {<AI05-0299-1AI05-0299-1>} This subclause
describes the declarations that are common to both kinds of sets. See
*note A.18.8:: for a description of the semantics specific to
Containers.Hashed_Sets and *note A.18.9:: for a description of the
@@ -90142,13 +90451,14 @@ semantics specific to Containers.Ordered_Sets.
_Static Semantics_
3/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function "=" on Element_Type values is expected to define a reflexive
-and symmetric relationship and return the same result value each time it
-is called with a particular pair of values. If it behaves in some other
-manner, the function "=" on set values returns an unspecified value.
-The exact arguments and number of calls of this generic formal function
-by the function "=" on set values are unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function "=" on Element_Type values is expected to define a
+reflexive and symmetric relationship and return the same result value
+each time it is called with a particular pair of values. If it behaves
+in some other manner, the function "=" on set values returns an
+unspecified value. The exact arguments and number of calls of this
+generic formal function by the function "=" on set values are
+unspecified.
3.a/2
Ramification: If the actual function for "=" is not symmetric
@@ -90162,44 +90472,44 @@ by the function "=" on set values are unspecified.
"=").
4/2
-{AI95-00302-03AI95-00302-03} The type Set is used to represent sets.
+{<AI95-00302-03AI95-00302-03>} The type Set is used to represent sets.
The type Set needs finalization (see *note 7.6::).
5/2
-{AI95-00302-03AI95-00302-03} A set contains elements. Set cursors
+{<AI95-00302-03AI95-00302-03>} A set contains elements. Set cursors
designate elements. There exists an equivalence relation on elements,
whose definition is different for hashed sets and ordered sets. A set
-never contains two or more equivalent elements. The length of a set is
-the number of elements it contains.
+never contains two or more equivalent elements. The <length> of a set
+is the number of elements it contains.
6/2
-{AI95-00302-03AI95-00302-03} Each nonempty set has two particular
-elements called the first element and the last element (which may be the
-same). Each element except for the last element has a successor
-element. If there are no other intervening operations, starting with
+{<AI95-00302-03AI95-00302-03>} Each nonempty set has two particular
+elements called the <first element> and the <last element> (which may be
+the same). Each element except for the last element has a <successor
+element>. If there are no other intervening operations, starting with
the first element and repeatedly going to the successor element will
visit each element in the set exactly once until the last element is
reached. The exact definition of these terms is different for hashed
sets and ordered sets.
7/2
-{AI95-00302-03AI95-00302-03} [Some operations of these generic packages
-have access-to-subprogram parameters. To ensure such operations are
-well-defined, they guard against certain actions by the designated
-subprogram. In particular, some operations check for "tampering with
-cursors" of a container because they depend on the set of elements of
-the container remaining constant, and others check for "tampering with
-elements" of a container because they depend on elements of the
-container not being replaced.]
+{<AI95-00302-03AI95-00302-03>} [Some operations of these generic
+packages have access-to-subprogram parameters. To ensure such
+operations are well-defined, they guard against certain actions by the
+designated subprogram. In particular, some operations check for
+"tampering with cursors" of a container because they depend on the set
+of elements of the container remaining constant, and others check for
+"tampering with elements" of a container because they depend on elements
+of the container not being replaced.]
8/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with cursors
-of a set object S if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+cursors> of a set object <S> if:
9/2
- * it inserts or deletes elements of S, that is, it calls the Insert,
- Include, Clear, Delete, Exclude, or Replace_Element procedures with
- S as a parameter; or
+ * it inserts or deletes elements of <S>, that is, it calls the
+ Insert, Include, Clear, Delete, Exclude, or Replace_Element
+ procedures with <S> as a parameter; or
9.a/2
To be honest: Operations which are defined to be equivalent to
@@ -90215,11 +90525,11 @@ of a set object S if:
is defined in terms of Replace_Element.
10/2
- * it finalizes S; or
+ * it finalizes <S>; or
10.1/3
- * {AI05-0001-1AI05-0001-1} it calls the Assign procedure with S as
- the Target parameter; or
+ * {<AI05-0001-1AI05-0001-1>} it calls the Assign procedure with <S>
+ as the Target parameter; or
10.a/3
Ramification: We don't need to explicitly mention
@@ -90228,17 +90538,18 @@ of a set object S if:
already defined as tampering with cursors.
11/2
- * it calls the Move procedure with S as a parameter; or
+ * it calls the Move procedure with <S> as a parameter; or
12/2
- * it calls one of the operations defined to tamper with cursors of S.
+ * it calls one of the operations defined to tamper with cursors of
+ <S>.
13/2
-{AI95-00302-03AI95-00302-03} A subprogram is said to tamper with
-elements of a set object S if:
+{<AI95-00302-03AI95-00302-03>} A subprogram is said to <tamper with
+elements> of a set object <S> if:
14/2
- * it tampers with cursors of S.
+ * it tampers with cursors of <S>.
14.a/2
Reason: Complete replacement of an element can cause its
@@ -90255,15 +90566,16 @@ elements of a set object S if:
and Query_Element are consistent across all containers.
14.1/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-cursors is prohibited for a particular set object S, Program_Error is
-propagated by a call of any language-defined subprogram that is defined
-to tamper with the cursors of S, leaving S unmodified. Similarly, when
-tampering with elements is prohibited for a particular set object S,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with cursors is <prohibited> for a particular set object <S>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the elements of S [(or tamper with the
-cursors of S)], leaving S unmodified. These checks are made before any
-other defined behavior of the body of the language-defined subprogram.
+that is defined to tamper with the cursors of <S>, leaving <S>
+unmodified. Similarly, when tampering with elements is <prohibited> for
+a particular set object <S>, Program_Error is propagated by a call of
+any language-defined subprogram that is defined to tamper with the
+elements of <S> [(or tamper with the cursors of <S>)], leaving <S>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
14.c/3
Proof: Tampering with elements includes tampering with
@@ -90271,23 +90583,23 @@ other defined behavior of the body of the
language-defined subprogram.
sentence.
15/2
-{AI95-00302-03AI95-00302-03} Empty_Set represents the empty Set object.
-It has a length of 0. If an object of type Set is not otherwise
-initialized, it is initialized to the same value as Empty_Set.
+{<AI95-00302-03AI95-00302-03>} Empty_Set represents the empty Set
+object. It has a length of 0. If an object of type Set is not
+otherwise initialized, it is initialized to the same value as Empty_Set.
16/2
-{AI95-00302-03AI95-00302-03} No_Element represents a cursor that
+{<AI95-00302-03AI95-00302-03>} No_Element represents a cursor that
designates no element. If an object of type Cursor is not otherwise
initialized, it is initialized to the same value as No_Element.
17/2
-{AI95-00302-03AI95-00302-03} The predefined "=" operator for type Cursor
-returns True if both cursors are No_Element, or designate the same
-element in the same container.
+{<AI95-00302-03AI95-00302-03>} The predefined "=" operator for type
+Cursor returns True if both cursors are No_Element, or designate the
+same element in the same container.
18/2
-{AI95-00302-03AI95-00302-03} Execution of the default implementation of
-the Input, Output, Read, or Write attribute of type Cursor raises
+{<AI95-00302-03AI95-00302-03>} Execution of the default implementation
+of the Input, Output, Read, or Write attribute of type Cursor raises
Program_Error.
18.a/2
@@ -90299,14 +90611,14 @@ Program_Error.
specified if there is a need to support streaming.
18.1/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Set'Write for a Set
-object S writes Length(S) elements of the set to the stream. It also
-may write additional information about the set.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Set'Write for a
+Set object <S> writes Length(<S>) elements of the set to the stream. It
+also may write additional information about the set.
18.2/3
-{AI05-0001-1AI05-0001-1} {AI05-0262-1AI05-0262-1} Set'Read reads the
-representation of a set from the stream, and assigns to Item a set with
-the same length and elements as was written by Set'Write.
+{<AI05-0001-1AI05-0001-1>} {<AI05-0262-1AI05-0262-1>} Set'Read reads the
+representation of a set from the stream, and assigns to <Item> a set
+with the same length and elements as was written by Set'Write.
18.b/3
Ramification: Streaming more elements than the container
@@ -90317,12 +90629,12 @@ the same length and elements as was written by
Set'Write.
function Has_Element (Position : Cursor) return Boolean;
18.4/3
- {AI05-0212-1AI05-0212-1} Returns True if Position designates
+ {<AI05-0212-1AI05-0212-1>} Returns True if Position designates
an element, and returns False otherwise.
18.c/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0212-1AI05-0212-1} This function might not detect
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0212-1AI05-0212-1>} This function might not detect
cursors that designate deleted elements; such cursors are
invalid (see below) and the result of calling Has_Element with
an invalid cursor is unspecified (but not erroneous).
@@ -90331,11 +90643,11 @@ the same length and elements as was written by
Set'Write.
function "=" (Left, Right : Set) return Boolean;
20/2
- {AI95-00302-03AI95-00302-03} If Left and Right denote the same
- set object, then the function returns True. If Left and Right
- have different lengths, then the function returns False.
- Otherwise, for each element E in Left, the function returns
- False if an element equal to E (using the generic formal
+ {<AI95-00302-03AI95-00302-03>} If Left and Right denote the
+ same set object, then the function returns True. If Left and
+ Right have different lengths, then the function returns False.
+ Otherwise, for each element <E> in Left, the function returns
+ False if an element equal to <E> (using the generic formal
equality operator) is not present in Right. If the function
has not returned a result after checking all of the elements,
it returns True. Any exception raised during evaluation of
@@ -90355,11 +90667,11 @@ the same length and elements as was written by
Set'Write.
function Equivalent_Sets (Left, Right : Set) return Boolean;
22/2
- {AI95-00302-03AI95-00302-03} If Left and Right denote the same
- set object, then the function returns True. If Left and Right
- have different lengths, then the function returns False.
- Otherwise, for each element E in Left, the function returns
- False if an element equivalent to E is not present in Right.
+ {<AI95-00302-03AI95-00302-03>} If Left and Right denote the
+ same set object, then the function returns True. If Left and
+ Right have different lengths, then the function returns False.
+ Otherwise, for each element <E> in Left, the function returns
+ False if an element equivalent to <E> is not present in Right.
If the function has not returned a result after checking all
of the elements, it returns True. Any exception raised during
evaluation of element equivalence is propagated.
@@ -90368,35 +90680,35 @@ the same length and elements as was written by
Set'Write.
function To_Set (New_Item : Element_Type) return Set;
24/2
- {AI95-00302-03AI95-00302-03} Returns a set containing the
+ {<AI95-00302-03AI95-00302-03>} Returns a set containing the
single element New_Item.
25/2
function Length (Container : Set) return Count_Type;
26/2
- {AI95-00302-03AI95-00302-03} Returns the number of elements in
- Container.
+ {<AI95-00302-03AI95-00302-03>} Returns the number of elements
+ in Container.
27/2
function Is_Empty (Container : Set) return Boolean;
28/2
- {AI95-00302-03AI95-00302-03} Equivalent to Length (Container)
- = 0.
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Length
+ (Container) = 0.
29/2
procedure Clear (Container : in out Set);
30/2
- {AI95-00302-03AI95-00302-03} Removes all the elements from
+ {<AI95-00302-03AI95-00302-03>} Removes all the elements from
Container.
31/2
function Element (Position : Cursor) return Element_Type;
32/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. Otherwise, Element
returns the element designated by Position.
@@ -90406,7 +90718,7 @@ the same length and elements as was written by
Set'Write.
New_Item : in Element_Type);
34/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated; if Position does not
designate an element in Container, then Program_Error is
propagated. If an element equivalent to New_Item is already
@@ -90439,8 +90751,8 @@ the same length and elements as was written by
Set'Write.
Process : not null access procedure (Element : in Element_Type));
36/3
- {AI95-00302-03AI95-00302-03} {AI05-0021-1AI05-0021-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0021-1AI05-0021-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated. Otherwise, Query_Element
calls Process.all with the element designated by Position as
the argument. Tampering with the elements of the set that
@@ -90454,7 +90766,7 @@ the same length and elements as was written by
Set'Write.
with Implicit_Dereference => Element;
36.2/3
- {AI05-0212-1AI05-0212-1} The type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} The type Constant_Reference_Type
needs finalization.
36.3/3
@@ -90476,35 +90788,35 @@ the same length and elements as was written by
Set'Write.
return Constant_Reference_Type;
36.5/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a set given a
cursor.
36.6/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Constant_Reference
- returns an object whose discriminant is an access value that
- designates the element designated by Position. Tampering with
- the elements of Container is prohibited while the object
- returned by Constant_Reference exists and has not been
- finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Constant_Reference returns an object whose discriminant is an
+ access value that designates the element designated by
+ Position. Tampering with the elements of Container is
+ prohibited while the object returned by Constant_Reference
+ exists and has not been finalized.
36.7/3
procedure Assign (Target : in out Set; Source : in Set);
36.8/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, the operation has no
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, the operation has no
effect. Otherwise, the elements of Source are copied to
Target as for an assignment_statement assigning Source to
Target.
36.b/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the bounded set containers. For an
unbounded set, Assign(A, B) and A := B behave identically.
For a bounded set, := will raise an exception if the container
@@ -90516,11 +90828,11 @@ the same length and elements as was written by
Set'Write.
Source : in out Set);
38/3
- {AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1}
- {AI05-0248-1AI05-0248-1} {AI05-0262-1AI05-0262-1} If Target
- denotes the same object as Source, then the operation has no
- effect. Otherwise, the operation is equivalent to Assign
- (Target, Source) followed by Clear (Source).
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>}
+ {<AI05-0248-1AI05-0248-1>} {<AI05-0262-1AI05-0262-1>} If
+ Target denotes the same object as Source, then the operation
+ has no effect. Otherwise, the operation is equivalent to
+ Assign (Target, Source) followed by Clear (Source).
39/2
procedure Insert (Container : in out Set;
@@ -90529,7 +90841,7 @@ the same length and elements as was written by
Set'Write.
Inserted : out Boolean);
40/2
- {AI95-00302-03AI95-00302-03} Insert checks if an element
+ {<AI95-00302-03AI95-00302-03>} Insert checks if an element
equivalent to New_Item is already present in Container. If a
match is found, Inserted is set to False and Position
designates the matching element. Otherwise, Insert adds
@@ -90542,7 +90854,7 @@ the same length and elements as was written by
Set'Write.
New_Item : in Element_Type);
42/2
- {AI95-00302-03AI95-00302-03} Insert inserts New_Item into
+ {<AI95-00302-03AI95-00302-03>} Insert inserts New_Item into
Container as per the four-parameter Insert, with the
difference that if an element equivalent to New_Item is
already in the set, then Constraint_Error is propagated.
@@ -90568,7 +90880,7 @@ the same length and elements as was written by
Set'Write.
New_Item : in Element_Type);
44/2
- {AI95-00302-03AI95-00302-03} Include inserts New_Item into
+ {<AI95-00302-03AI95-00302-03>} Include inserts New_Item into
Container as per the four-parameter Insert, with the
difference that if an element equivalent to New_Item is
already in the set, then it is replaced. Any exception raised
@@ -90579,7 +90891,7 @@ the same length and elements as was written by
Set'Write.
New_Item : in Element_Type);
46/2
- {AI95-00302-03AI95-00302-03} Replace checks if an element
+ {<AI95-00302-03AI95-00302-03>} Replace checks if an element
equivalent to New_Item is already in the set. If a match is
found, that element is replaced with New_Item; otherwise,
Constraint_Error is propagated.
@@ -90589,7 +90901,7 @@ the same length and elements as was written by
Set'Write.
Item : in Element_Type);
48/2
- {AI95-00302-03AI95-00302-03} Exclude checks if an element
+ {<AI95-00302-03AI95-00302-03>} Exclude checks if an element
equivalent to Item is present in Container. If a match is
found, Exclude removes the element from the set.
@@ -90598,7 +90910,7 @@ the same length and elements as was written by
Set'Write.
Item : in Element_Type);
50/2
- {AI95-00302-03AI95-00302-03} Delete checks if an element
+ {<AI95-00302-03AI95-00302-03>} Delete checks if an element
equivalent to Item is present in Container. If a match is
found, Delete removes the element from the set; otherwise,
Constraint_Error is propagated.
@@ -90608,7 +90920,7 @@ the same length and elements as was written by
Set'Write.
Position : in out Cursor);
52/2
- {AI95-00302-03AI95-00302-03} If Position equals No_Element,
+ {<AI95-00302-03AI95-00302-03>} If Position equals No_Element,
then Constraint_Error is propagated. If Position does not
designate an element in Container, then Program_Error is
propagated. Otherwise, Delete removes the element designated
@@ -90629,7 +90941,7 @@ the same length and elements as was written by
Set'Write.
Source : in Set);
54/2
- {AI95-00302-03AI95-00302-03} Union inserts into Target the
+ {<AI95-00302-03AI95-00302-03>} Union inserts into Target the
elements of Source that are not equivalent to some element
already in Target.
@@ -90643,7 +90955,7 @@ the same length and elements as was written by
Set'Write.
function Union (Left, Right : Set) return Set;
56/2
- {AI95-00302-03AI95-00302-03} Returns a set comprising all of
+ {<AI95-00302-03AI95-00302-03>} Returns a set comprising all of
the elements of Left, and the elements of Right that are not
equivalent to some element of Left.
@@ -90652,7 +90964,7 @@ the same length and elements as was written by
Set'Write.
Source : in Set);
58/3
- {AI95-00302-03AI95-00302-03} {AI05-0004-1AI05-0004-1}
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0004-1AI05-0004-1>}
Intersection deletes from Target the elements of Target that
are not equivalent to some element of Source.
@@ -90666,25 +90978,25 @@ the same length and elements as was written by
Set'Write.
function Intersection (Left, Right : Set) return Set;
60/2
- {AI95-00302-03AI95-00302-03} Returns a set comprising all the
- elements of Left that are equivalent to the some element of
- Right.
+ {<AI95-00302-03AI95-00302-03>} Returns a set comprising all
+ the elements of Left that are equivalent to the some element
+ of Right.
61/2
procedure Difference (Target : in out Set;
Source : in Set);
62/2
- {AI95-00302-03AI95-00302-03} If Target denotes the same object
- as Source, then Difference clears Target. Otherwise, it
- deletes from Target the elements that are equivalent to some
- element of Source.
+ {<AI95-00302-03AI95-00302-03>} If Target denotes the same
+ object as Source, then Difference clears Target. Otherwise,
+ it deletes from Target the elements that are equivalent to
+ some element of Source.
63/2
function Difference (Left, Right : Set) return Set;
64/2
- {AI95-00302-03AI95-00302-03} Returns a set comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a set comprising the
elements of Left that are not equivalent to some element of
Right.
@@ -90693,8 +91005,8 @@ the same length and elements as was written by
Set'Write.
Source : in Set);
66/2
- {AI95-00302-03AI95-00302-03} If Target denotes the same object
- as Source, then Symmetric_Difference clears Target.
+ {<AI95-00302-03AI95-00302-03>} If Target denotes the same
+ object as Source, then Symmetric_Difference clears Target.
Otherwise, it deletes from Target the elements that are
equivalent to some element of Source, and inserts into Target
the elements of Source that are not equivalent to some element
@@ -90704,7 +91016,7 @@ the same length and elements as was written by
Set'Write.
function Symmetric_Difference (Left, Right : Set) return Set;
68/2
- {AI95-00302-03AI95-00302-03} Returns a set comprising the
+ {<AI95-00302-03AI95-00302-03>} Returns a set comprising the
elements of Left that are not equivalent to some element of
Right, and the elements of Right that are not equivalent to
some element of Left.
@@ -90713,9 +91025,9 @@ the same length and elements as was written by
Set'Write.
function Overlap (Left, Right : Set) return Boolean;
70/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If an
- element of Left is equivalent to some element of Right, then
- Overlap returns True. Otherwise, it returns False.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ an element of Left is equivalent to some element of Right,
+ then Overlap returns True. Otherwise, it returns False.
70.a/2
Discussion: This operation is commutative. If Overlap returns
@@ -90726,9 +91038,10 @@ the same length and elements as was written by
Set'Write.
Of_Set : Set) return Boolean;
72/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If an
- element of Subset is not equivalent to some element of Of_Set,
- then Is_Subset returns False. Otherwise, it returns True.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
+ an element of Subset is not equivalent to some element of
+ Of_Set, then Is_Subset returns False. Otherwise, it returns
+ True.
72.a/2
Discussion: This operation is not commutative, so we use
@@ -90739,7 +91052,7 @@ the same length and elements as was written by
Set'Write.
function First (Container : Set) return Cursor;
74/2
- {AI95-00302-03AI95-00302-03} If Length (Container) = 0, then
+ {<AI95-00302-03AI95-00302-03>} If Length (Container) = 0, then
First returns No_Element. Otherwise, First returns a cursor
that designates the first element in Container.
@@ -90747,29 +91060,29 @@ the same length and elements as was written by
Set'Write.
function Next (Position : Cursor) return Cursor;
76/2
- {AI95-00302-03AI95-00302-03} Returns a cursor that designates
- the successor of the element designated by Position. If
- Position designates the last element, then No_Element is
- returned. If Position equals No_Element, then No_Element is
- returned.
+ {<AI95-00302-03AI95-00302-03>} Returns a cursor that
+ designates the successor of the element designated by
+ Position. If Position designates the last element, then
+ No_Element is returned. If Position equals No_Element, then
+ No_Element is returned.
77/2
procedure Next (Position : in out Cursor);
78/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position := Next
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position := Next
(Position).
79/3
- This paragraph was deleted.{AI95-00302-03AI95-00302-03}
- {AI05-0004-1AI05-0004-1}
+ <This paragraph was deleted.>{<AI95-00302-03AI95-00302-03>}
+ {<AI05-0004-1AI05-0004-1>}
80/2
function Find (Container : Set;
Item : Element_Type) return Cursor;
81/2
- {AI95-00302-03AI95-00302-03} If Length (Container) equals 0,
+ {<AI95-00302-03AI95-00302-03>} If Length (Container) equals 0,
then Find returns No_Element. Otherwise, Find checks if an
element equivalent to Item is present in Container. If a
match is found, a cursor designating the matching element is
@@ -90780,10 +91093,10 @@ the same length and elements as was written by
Set'Write.
Item : Element_Type) return Boolean;
82.1/3
- {AI05-0004-1AI05-0004-1} Equivalent to Find (Container, Item)
- /= No_Element.
+ {<AI05-0004-1AI05-0004-1>} Equivalent to Find (Container,
+ Item) /= No_Element.
- Paragraphs 83 and 84 were moved above.
+ <Paragraphs 83 and 84 were moved above.>
85/2
procedure Iterate
@@ -90791,13 +91104,13 @@ the same length and elements as was written by
Set'Write.
Process : not null access procedure (Position : in Cursor));
86/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} Iterate
- calls Process.all with a cursor that designates each element
- in Container, starting with the first element and moving the
- cursor according to the successor relation. Tampering with
- the cursors of Container is prohibited during the execution of
- a call on Process.all. Any exception raised by Process.all is
- propagated.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>}
+ Iterate calls Process.all with a cursor that designates each
+ element in Container, starting with the first element and
+ moving the cursor according to the successor relation.
+ Tampering with the cursors of Container is prohibited during
+ the execution of a call on Process.all. Any exception raised
+ by Process.all is propagated.
86.a/2
Implementation Note: The "tamper with cursors" check takes
@@ -90809,7 +91122,7 @@ the same length and elements as was written by
Set'Write.
implementation of the check.
87/2
-{AI95-00302-03AI95-00302-03} Both Containers.Hashed_Set and
+{<AI95-00302-03AI95-00302-03>} Both Containers.Hashed_Set and
Containers.Ordered_Set declare a nested generic package Generic_Keys,
which provides operations that allow set manipulation in terms of a key
(typically, a portion of an element) instead of a complete element. The
@@ -90819,7 +91132,7 @@ with a particular element. The behavior of
Generic_Keys is unspecified
if Key behaves in some other manner.
88/2
-{AI95-00302-03AI95-00302-03} A key is expected to unambiguously
+{<AI95-00302-03AI95-00302-03>} A key is expected to unambiguously
determine a single equivalence class for elements. The behavior of
Generic_Keys is unspecified if the formal parameters of this package
behave in some other manner.
@@ -90828,11 +91141,11 @@ behave in some other manner.
function Key (Position : Cursor) return Key_Type;
90/2
- {AI95-00302-03AI95-00302-03} Equivalent to Key (Element
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Key (Element
(Position)).
91/2
-{AI95-00302-03AI95-00302-03} The subprograms in package Generic_Keys
+{<AI95-00302-03AI95-00302-03>} The subprograms in package Generic_Keys
named Contains, Find, Element, Delete, and Exclude, are equivalent to
the corresponding subprograms in the parent package, with the difference
that the Key parameter is used to locate an element in the set.
@@ -90843,7 +91156,7 @@ that the Key parameter is used to locate an element in
the set.
New_Item : in Element_Type);
93/2
- {AI95-00302-03AI95-00302-03} Equivalent to Replace_Element
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Replace_Element
(Container, Find (Container, Key), New_Item).
94/2
@@ -90854,20 +91167,20 @@ that the Key parameter is used to locate an element
in the set.
(Element : in out Element_Type));
95/3
- {AI95-00302-03AI95-00302-03} {AI05-0265-1AI05-0265-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0265-1AI05-0265-1>} If
Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
- Update_Element_Preserving_Key uses Key to save the key value K
- of the element designated by Position.
+ Update_Element_Preserving_Key uses Key to save the key value
+ <K> of the element designated by Position.
Update_Element_Preserving_Key then calls Process.all with that
element as the argument. Tampering with the elements of
Container is prohibited during the execution of the call on
Process.all. Any exception raised by Process.all is
propagated. After Process.all returns,
- Update_Element_Preserving_Key checks if K determines the same
- equivalence class as that for the new element; if not, the
- element is removed from the set and Program_Error is
+ Update_Element_Preserving_Key checks if <K> determines the
+ same equivalence class as that for the new element; if not,
+ the element is removed from the set and Program_Error is
propagated.
95.a/2
@@ -90891,7 +91204,7 @@ that the Key parameter is used to locate an element in
the set.
with Implicit_Dereference => Element;
96.2/3
- {AI05-0212-1AI05-0212-1} The type Reference_Type needs
+ {<AI05-0212-1AI05-0212-1>} The type Reference_Type needs
finalization.
96.3/3
@@ -90904,23 +91217,23 @@ that the Key parameter is used to locate an element
in the set.
return Reference_Type;
96.5/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Implicit_Dereference aspect)
provides a convenient way to gain read and write access to an
individual element of a set given a cursor.
96.6/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise,
- Reference_Preserving_Key uses Key to save the key value K;
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Reference_Preserving_Key uses Key to save the key value <K>;
then returns an object whose discriminant is an access value
that designates the element designated by Position. Tampering
with the elements of Container is prohibited while the object
returned by Reference_Preserving_Key exists and has not been
finalized. When the object returned by
- Reference_Preserving_Key is finalized, a check is made if K
+ Reference_Preserving_Key is finalized, a check is made if <K>
determines the same equivalence class as that for the new
element; if not, the element is removed from the set and
Program_Error is propagated.
@@ -90931,7 +91244,7 @@ that the Key parameter is used to locate an element in
the set.
return Constant_Reference_Type;
96.8/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Implicit_Dereference aspect)
provides a convenient way to gain read access to an individual
element of a set given a key value.
@@ -90946,7 +91259,7 @@ that the Key parameter is used to locate an element in
the set.
return Reference_Type;
96.11/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Implicit_Dereference aspect)
provides a convenient way to gain read and write access to an
individual element of a set given a key value.
@@ -90958,15 +91271,16 @@ that the Key parameter is used to locate an element
in the set.
_Bounded (Run-Time) Errors_
96.13/3
-{AI05-0022-1AI05-0022-1} {AI05-0248-1AI05-0248-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of a set package, to tamper with
-elements of any set parameter of the operation. Either Program_Error is
-raised, or the operation works as defined on the value of the set either
-prior to, or subsequent to, some or all of the modifications to the set.
+{<AI05-0022-1AI05-0022-1>} {<AI05-0248-1AI05-0248-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of a set package, to
+tamper with elements of any set parameter of the operation. Either
+Program_Error is raised, or the operation works as defined on the value
+of the set either prior to, or subsequent to, some or all of the
+modifications to the set.
96.14/3
-{AI05-0027-1AI05-0027-1} It is a bounded error to call any subprogram
+{<AI05-0027-1AI05-0027-1>} It is a bounded error to call any subprogram
declared in the visible part of a set package when the associated
container has been finalized. If the operation takes Container as an in
out parameter, then it raises Constraint_Error or Program_Error.
@@ -90976,14 +91290,14 @@ container, or it raises Constraint_Error or
Program_Error.
_Erroneous Execution_
97/2
-{AI95-00302-03AI95-00302-03} A Cursor value is invalid if any of the
+{<AI95-00302-03AI95-00302-03>} A Cursor value is <invalid> if any of the
following have occurred since it was created:
98/2
* The set that contains the element it designates has been finalized;
98.1/3
- * {AI05-0160-1AI05-0160-1} The set that contains the element it
+ * {<AI05-0160-1AI05-0160-1>} The set that contains the element it
designates has been used as the Target of a call to Assign, or as
the target of an assignment_statement;
@@ -90992,18 +91306,18 @@ following have occurred since it was created:
the Source or Target of a call to Move; or
100/3
- * {AI05-0160-1AI05-0160-1} {AI05-0262-1AI05-0262-1} The element it
- designates has been removed from the set that previously contained
- the element.
+ * {<AI05-0160-1AI05-0160-1>} {<AI05-0262-1AI05-0262-1>} The element
+ it designates has been removed from the set that previously
+ contained the element.
100.a/3
- Ramification: {AI05-0160-1AI05-0160-1} This can happen
+ Ramification: {<AI05-0160-1AI05-0160-1>} This can happen
directly via calls to Clear, Exclude, Delete, and
Update_Element_Preserving_Key, and indirectly via calls to
procedures Intersection, Difference, and Symmetric_Difference.
101/2
-{AI95-00302-03AI95-00302-03} The result of "=" or Has_Element is
+{<AI95-00302-03AI95-00302-03>} The result of "=" or Has_Element is
unspecified if these functions are called with an invalid cursor
parameter. Execution is erroneous if any other subprogram declared in
Containers.Hashed_Sets or Containers.Ordered_Sets is called with an
@@ -91023,7 +91337,7 @@ invalid cursor parameter.
detected.
101.1/3
-{AI05-0212-1AI05-0212-1} Execution is erroneous if the set associated
+{<AI05-0212-1AI05-0212-1>} Execution is erroneous if the set associated
with the result of a call to Reference or Constant_Reference is
finalized before the result object returned by the call to Reference or
Constant_Reference is finalized.
@@ -91045,18 +91359,18 @@ Constant_Reference is finalized.
_Implementation Requirements_
102/2
-{AI95-00302-03AI95-00302-03} No storage associated with a Set object
+{<AI95-00302-03AI95-00302-03>} No storage associated with a Set object
shall be lost upon assignment or scope exit.
103/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The execution of
-an assignment_statement for a set shall have the effect of copying the
-elements from the source set object to the target set object and
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The execution
+of an assignment_statement for a set shall have the effect of copying
+the elements from the source set object to the target set object and
changing the length of the target object to that of the source object.
103.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a Set is a "deep" copy; that is the elements are copied as
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a Set is a "deep" copy; that is the elements are copied as
well as the data structures. We say "effect of" in order to
allow the implementation to avoid copying elements immediately
if it wishes. For instance, an implementation that avoided
@@ -91067,7 +91381,7 @@ changing the length of the target object to that of the
source object.
_Implementation Advice_
104/2
-{AI95-00302-03AI95-00302-03} Move should not copy elements, and should
+{<AI95-00302-03AI95-00302-03>} Move should not copy elements, and should
minimize copying of internal data structures.
104.a/2
@@ -91080,7 +91394,7 @@ minimize copying of internal data structures.
the Source container to the Target container.
105/2
-{AI95-00302-03AI95-00302-03} If an exception is propagated from a set
+{<AI95-00302-03AI95-00302-03>} If an exception is propagated from a set
operation, no storage should be lost, nor any elements removed from a
set unless specified by the operation.
@@ -91098,50 +91412,51 @@ set unless specified by the operation.
_Wording Changes from Ada 95_
105.c/2
- {AI95-00302-03AI95-00302-03} This description of sets is new;
- the extensions are documented with the specific packages.
+ {<AI95-00302-03AI95-00302-03>} This description of sets is
+ new; the extensions are documented with the specific packages.
_Extensions to Ada 2005_
105.d/3
- {AI05-0212-1AI05-0212-1} Added reference support to make set
+ {<AI05-0212-1AI05-0212-1>} Added reference support to make set
containers more convenient to use.
_Wording Changes from Ada 2005_
105.e/3
- {AI05-0001-1AI05-0001-1} Added procedure Assign; the extension
- and incompatibility is documented with the specific packages.
+ {<AI05-0001-1AI05-0001-1>} Added procedure Assign; the
+ extension and incompatibility is documented with the specific
+ packages.
105.f/3
- {AI05-0001-1AI05-0001-1} Generalized the definition of Move.
+ {<AI05-0001-1AI05-0001-1>} Generalized the definition of Move.
Specified which elements are read/written by stream
attributes.
105.g/3
- {AI05-0022-1AI05-0022-1} Correction: Added a Bounded
+ {<AI05-0022-1AI05-0022-1>} Correction: Added a Bounded
(Run-Time) Error to cover tampering by generic actual
subprograms.
105.h/3
- {AI05-0027-1AI05-0027-1} Correction: Added a Bounded
+ {<AI05-0027-1AI05-0027-1>} Correction: Added a Bounded
(Run-Time) Error to cover access to finalized set containers.
105.i/3
- {AI05-0160-1AI05-0160-1} Correction: Revised the definition of
- invalid cursors to cover missing (and new) cases.
+ {<AI05-0160-1AI05-0160-1>} Correction: Revised the definition
+ of invalid cursors to cover missing (and new) cases.
105.j/3
- {AI05-0265-1AI05-0265-1} Correction: Defined when a container
- prohibits tampering in order to more clearly define where the
- check is made and the exception raised.
+ {<AI05-0265-1AI05-0265-1>} Correction: Defined when a
+ container prohibits tampering in order to more clearly define
+ where the check is made and the exception raised.
_Wording Changes from Ada 2012_
105.k/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.8, Next: A.18.9, Prev: A.18.7, Up: A.18
@@ -91152,11 +91467,11 @@ A.18.8 The Generic Package Containers.Hashed_Sets
_Static Semantics_
1/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Hashed_Sets has the following declaration:
2/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Element_Type is private;
with function Hash (Element : Element_Type) return Hash_Type;
@@ -91168,7 +91483,7 @@ Containers.Hashed_Sets has the following declaration:
pragma Remote_Types(Hashed_Sets);
3/3
- {AI05-0212-1AI05-0212-1} type Set is tagged private
+ {<AI05-0212-1AI05-0212-1>} type Set is tagged private
with Constant_Indexing => Constant_Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
@@ -91185,10 +91500,10 @@ Containers.Hashed_Sets has the following declaration:
No_Element : constant Cursor;
6.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
6.2/3
- {AI05-0212-1AI05-0212-1} package Set_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Set_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
7/2
@@ -91230,20 +91545,20 @@ Containers.Hashed_Sets has the following declaration:
Process : not null access procedure (Element : in Element_Type));
17.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
17.2/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Set;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Set;
Position : in Cursor)
return Constant_Reference_Type;
17.3/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Set; Source
: in Set);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Set;
Source : in Set);
17.4/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Set; Capacity :
Count_Type := 0) return Set;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Set; Capacity :
Count_Type := 0) return Set;
18/2
procedure Move (Target : in out Set;
@@ -91345,7 +91660,7 @@ Containers.Hashed_Sets has the following declaration:
Item : Element_Type) return Boolean;
45/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
46/2
function Equivalent_Elements (Left, Right : Cursor)
@@ -91367,7 +91682,7 @@ Containers.Hashed_Sets has the following declaration:
Process : not null access procedure (Position : in Cursor));
49.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Set)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Set)
return Set_Iterator_Interfaces.Forward_Iterator'Class;
50/2
@@ -91418,22 +91733,22 @@ Containers.Hashed_Sets has the following declaration:
(Element : in out Element_Type));
58.1/3
- {AI05-0212-1AI05-0212-1} type Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type
(Element : not null access Element_Type) is private
with Implicit_Dereference => Element;
58.2/3
- {AI05-0212-1AI05-0212-1} function Reference_Preserving_Key
(Container : aliased in out Set;
+ {<AI05-0212-1AI05-0212-1>} function Reference_Preserving_Key
(Container : aliased in out Set;
Position : in Cursor)
return Reference_Type;
58.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Set;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Set;
Key : in Key_Type)
return Constant_Reference_Type;
58.4/3
- {AI05-0212-1AI05-0212-1} function Reference_Preserving_Key
(Container : aliased in out Set;
+ {<AI05-0212-1AI05-0212-1>} function Reference_Preserving_Key
(Container : aliased in out Set;
Key : in Key_Type)
return Reference_Type;
@@ -91444,51 +91759,51 @@ Containers.Hashed_Sets has the following declaration:
private
61/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
62/2
end Ada.Containers.Hashed_Sets;
63/2
-{AI95-00302-03AI95-00302-03} An object of type Set contains an
+{<AI95-00302-03AI95-00302-03>} An object of type Set contains an
expandable hash table, which is used to provide direct access to
-elements. The capacity of an object of type Set is the maximum number
+elements. The <capacity> of an object of type Set is the maximum number
of elements that can be inserted into the hash table prior to it being
automatically expanded.
64/2
-{AI95-00302-03AI95-00302-03} Two elements E1 and E2 are defined to be
-equivalent if Equivalent_Elements (E1, E2) returns True.
+{<AI95-00302-03AI95-00302-03>} Two elements <E1> and <E2> are defined to
+be <equivalent> if Equivalent_Elements (<E1>, <E2>) returns True.
65/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function Hash is expected to return the same value each time it is
-called with a particular element value. For any two equivalent
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function Hash is expected to return the same value each time it
+is called with a particular element value. For any two equivalent
elements, the actual for Hash is expected to return the same value. If
the actual for Hash behaves in some other manner, the behavior of this
package is unspecified. Which subprograms of this package call Hash,
and how many times they call it, is unspecified.
66/2
-{AI95-00302-03AI95-00302-03} The actual function for the generic formal
-function Equivalent_Elements is expected to return the same value each
-time it is called with a particular pair of Element values. It should
-define an equivalence relationship, that is, be reflexive, symmetric,
-and transitive. If the actual for Equivalent_Elements behaves in some
-other manner, the behavior of this package is unspecified. Which
-subprograms of this package call Equivalent_Elements, and how many times
-they call it, is unspecified.
+{<AI95-00302-03AI95-00302-03>} The actual function for the generic
+formal function Equivalent_Elements is expected to return the same value
+each time it is called with a particular pair of Element values. It
+should define an equivalence relationship, that is, be reflexive,
+symmetric, and transitive. If the actual for Equivalent_Elements
+behaves in some other manner, the behavior of this package is
+unspecified. Which subprograms of this package call
+Equivalent_Elements, and how many times they call it, is unspecified.
66.1/3
-{AI05-0044-1AI05-0044-1} If the actual function for the generic formal
+{<AI05-0044-1AI05-0044-1>} If the actual function for the generic formal
function "=" returns True for any pair of nonequivalent elements, then
the behavior of the container function "=" is unspecified.
67/2
-{AI95-00302-03AI95-00302-03} If the value of an element stored in a set
-is changed other than by an operation in this package such that at least
-one of Hash or Equivalent_Elements give different results, the behavior
-of this package is unspecified.
+{<AI95-00302-03AI95-00302-03>} If the value of an element stored in a
+set is changed other than by an operation in this package such that at
+least one of Hash or Equivalent_Elements give different results, the
+behavior of this package is unspecified.
67.a/2
Discussion: See *note A.18.5::, "*note A.18.5:: The Generic
@@ -91498,7 +91813,7 @@ of this package is unspecified.
need to store elements, not key/element pairs.
68/2
-{AI95-00302-03AI95-00302-03} Which elements are the first element and
+{<AI95-00302-03AI95-00302-03>} Which elements are the first element and
the last element of a set, and which element is the successor of a given
element, are unspecified, other than the general semantics described in
*note A.18.7::.
@@ -91507,7 +91822,7 @@ element, are unspecified, other than the general
semantics described in
function Capacity (Container : Set) return Count_Type;
70/2
- {AI95-00302-03AI95-00302-03} Returns the capacity of
+ {<AI95-00302-03AI95-00302-03>} Returns the capacity of
Container.
71/2
@@ -91515,8 +91830,8 @@ element, are unspecified, other than the general
semantics described in
Capacity : in Count_Type);
72/2
- {AI95-00302-03AI95-00302-03} Reserve_Capacity allocates a new
- hash table such that the length of the resulting set can
+ {<AI95-00302-03AI95-00302-03>} Reserve_Capacity allocates a
+ new hash table such that the length of the resulting set can
become at least the value Capacity without requiring an
additional call to Reserve_Capacity, and is large enough to
hold the current length of Container. Reserve_Capacity then
@@ -91537,7 +91852,7 @@ element, are unspecified, other than the general
semantics described in
procedure Clear (Container : in out Set);
75/2
- {AI95-00302-03AI95-00302-03} In addition to the semantics
+ {<AI95-00302-03AI95-00302-03>} In addition to the semantics
described in *note A.18.7::, Clear does not affect the
capacity of Container.
@@ -91545,9 +91860,9 @@ element, are unspecified, other than the general
semantics described in
procedure Assign (Target : in out Set; Source : in Set);
75.2/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} In addition
- to the semantics described in *note A.18.7::, if the length of
- Source is greater than the capacity of Target,
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} In
+ addition to the semantics described in *note A.18.7::, if the
+ length of Source is greater than the capacity of Target,
Reserve_Capacity (Target, Length (Source)) is called before
assigning any elements.
@@ -91555,7 +91870,7 @@ element, are unspecified, other than the general
semantics described in
function Copy (Source : Set; Capacity : Count_Type := 0) return Set;
75.4/3
- {AI05-0001-1AI05-0001-1} Returns a set whose elements are
+ {<AI05-0001-1AI05-0001-1>} Returns a set whose elements are
initialized from the elements of 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
@@ -91569,7 +91884,7 @@ element, are unspecified, other than the general
semantics described in
Inserted : out Boolean);
77/2
- {AI95-00302-03AI95-00302-03} In addition to the semantics
+ {<AI95-00302-03AI95-00302-03>} In addition to the semantics
described in *note A.18.7::, if Length (Container) equals
Capacity (Container), then Insert first calls Reserve_Capacity
to increase the capacity of Container to some larger value.
@@ -91578,7 +91893,7 @@ element, are unspecified, other than the general
semantics described in
function First (Container : Set) return Cursor;
79/2
- {AI95-00302-03AI95-00302-03} If Length (Container) = 0, then
+ {<AI95-00302-03AI95-00302-03>} If Length (Container) = 0, then
First returns No_Element. Otherwise, First returns a cursor
that designates the first hashed element in Container.
@@ -91587,32 +91902,32 @@ element, are unspecified, other than the general
semantics described in
return Boolean;
81/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Elements
- (Element (Left), Element (Right)).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to
+ Equivalent_Elements (Element (Left), Element (Right)).
82/2
function Equivalent_Elements (Left : Cursor;
Right : Element_Type) return Boolean;
83/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Elements
- (Element (Left), Right).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to
+ Equivalent_Elements (Element (Left), Right).
84/2
function Equivalent_Elements (Left : Element_Type;
Right : Cursor) return Boolean;
85/2
- {AI95-00302-03AI95-00302-03} Equivalent to Equivalent_Elements
- (Left, Element (Right)).
+ {<AI95-00302-03AI95-00302-03>} Equivalent to
+ Equivalent_Elements (Left, Element (Right)).
85.1/3
function Iterate (Container : in Set)
return Set_Iterator_Interfaces.Forward_Iterator'Class;
85.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns an iterator object
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns an iterator object
(see *note 5.5.1::) that will generate a value for a loop
parameter (see *note 5.5.2::) designating each element in
Container, starting with the first element and moving the
@@ -91623,17 +91938,17 @@ element, are unspecified, other than the general
semantics described in
object). The iterator object needs finalization.
86/2
-{AI95-00302-03AI95-00302-03} For any element E, the actual function for
-the generic formal function Generic_Keys.Hash is expected to be such
-that Hash (E) = Generic_Keys.Hash (Key (E)). If the actuals for Key or
-Generic_Keys.Hash behave in some other manner, the behavior of
+{<AI95-00302-03AI95-00302-03>} For any element <E>, the actual function
+for the generic formal function Generic_Keys.Hash is expected to be such
+that Hash (<E>) = Generic_Keys.Hash (Key (<E>)). If the actuals for Key
+or Generic_Keys.Hash behave in some other manner, the behavior of
Generic_Keys is unspecified. Which subprograms of Generic_Keys call
Generic_Keys.Hash, and how many times they call it, is unspecified.
87/2
-{AI95-00302-03AI95-00302-03} For any two elements E1 and E2, the boolean
-values Equivalent_Elements (E1, E2) and Equivalent_Keys (Key (E1), Key
-(E2)) are expected to be equal. If the actuals for Key or
+{<AI95-00302-03AI95-00302-03>} For any two elements <E1> and <E2>, the
+boolean values Equivalent_Elements (<E1>, <E2>) and Equivalent_Keys (Key
+(<E1>), Key (<E2>)) are expected to be equal. If the actuals for Key or
Equivalent_Keys behave in some other manner, the behavior of
Generic_Keys is unspecified. Which subprograms of Generic_Keys call
Equivalent_Keys, and how many times they call it, is unspecified.
@@ -91641,24 +91956,24 @@ Equivalent_Keys, and how many times they call it, is
unspecified.
_Implementation Advice_
88/2
-{AI95-00302-03AI95-00302-03} If N is the length of a set, the average
-time complexity of the subprograms Insert, Include, Replace, Delete,
-Exclude and Find that take an element parameter should be O(log N). The
-average time complexity of the subprograms that take a cursor parameter
-should be O(1). The average time complexity of Reserve_Capacity should
-be O(N).
+{<AI95-00302-03AI95-00302-03>} If <N> is the length of a set, the
+average time complexity of the subprograms Insert, Include, Replace,
+Delete, Exclude and Find that take an element parameter should be
+<O>(log <N>). The average time complexity of the subprograms that take
+a cursor parameter should be <O>(1). The average time complexity of
+Reserve_Capacity should be <O>(<N>).
88.a/2
Implementation Advice: The average time complexity of the
Insert, Include, Replace, Delete, Exclude and Find operations
of Containers.Hashed_Sets that take an element parameter
- should be O(log N). The average time complexity of the
+ should be <O>(log <N>). The average time complexity of the
subprograms of Containers.Hashed_Sets that take a cursor
- parameter should be O(1). The average time complexity of
- Containers.Hashed_Sets.Reserve_Capacity should be O(N).
+ parameter should be <O>(1). The average time complexity of
+ Containers.Hashed_Sets.Reserve_Capacity should be <O>(<N>).
88.b/2
- Implementation Note: {AI95-00302-03AI95-00302-03} See *note
+ Implementation Note: {<AI95-00302-03AI95-00302-03>} See *note
A.18.5::, "*note A.18.5:: The Generic Package
Containers.Hashed_Maps" for implementation notes regarding
some of the operations of this package.
@@ -91666,36 +91981,36 @@ be O(N).
_Extensions to Ada 95_
88.c/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Hashed_Sets is new.
_Incompatibilities With Ada 2005_
88.d/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Hashed_Sets. If an instance of
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Hashed_Sets. If an instance of
Containers.Hashed_Sets is referenced in a use_clause, and an
- entity E with the same defining_identifier as a new entity in
- Containers.Hashed_Sets is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ entity <E> with the same defining_identifier as a new entity
+ in Containers.Hashed_Sets is defined in a package that is also
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Extensions to Ada 2005_
88.e/3
- {AI05-0212-1AI05-0212-1} Added iterator and indexing support
+ {<AI05-0212-1AI05-0212-1>} Added iterator and indexing support
to make hashed set containers more convenient to use.
_Wording Changes from Ada 2005_
88.f/3
- {AI05-0044-1AI05-0044-1} Correction: Added wording to require
- the formal function be such that equal elements are also
- equivalent.
+ {<AI05-0044-1AI05-0044-1>} Correction: Added wording to
+ require the formal function be such that equal elements are
+ also equivalent.
88.g/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
@@ -91708,11 +92023,11 @@ A.18.9 The Generic Package Containers.Ordered_Sets
_Static Semantics_
1/2
-{AI95-00302-03AI95-00302-03} The generic library package
+{<AI95-00302-03AI95-00302-03>} The generic library package
Containers.Ordered_Sets has the following declaration:
2/3
- {AI05-0084-1AI05-0084-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0084-1AI05-0084-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Element_Type is private;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
@@ -91725,7 +92040,7 @@ Containers.Ordered_Sets has the following declaration:
function Equivalent_Elements (Left, Right : Element_Type) return
Boolean;
4/3
- {AI05-0212-1AI05-0212-1} type Set is tagged private
+ {<AI05-0212-1AI05-0212-1>} type Set is tagged private
with Constant_Indexing => Constant_Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
@@ -91742,10 +92057,10 @@ Containers.Ordered_Sets has the following declaration:
No_Element : constant Cursor;
7.1/3
- {AI05-0212-1AI05-0212-1} function Has_Element (Position : Cursor)
return Boolean;
+ {<AI05-0212-1AI05-0212-1>} function Has_Element (Position : Cursor)
return Boolean;
7.2/3
- {AI05-0212-1AI05-0212-1} package Set_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Set_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
8/2
@@ -91780,20 +92095,20 @@ Containers.Ordered_Sets has the following declaration:
Process : not null access procedure (Element : in Element_Type));
16.1/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
16.2/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Set;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Set;
Position : in Cursor)
return Constant_Reference_Type;
16.3/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Set; Source
: in Set);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Set;
Source : in Set);
16.4/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Set) return Set;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Set) return Set;
17/2
procedure Move (Target : in out Set;
@@ -91927,7 +92242,7 @@ Containers.Ordered_Sets has the following declaration:
Item : Element_Type) return Boolean;
53/3
- This paragraph was deleted.{AI05-0212-1AI05-0212-1}
+ <This paragraph was deleted.>{<AI05-0212-1AI05-0212-1>}
54/2
function "<" (Left, Right : Cursor) return Boolean;
@@ -91962,11 +92277,11 @@ Containers.Ordered_Sets has the following declaration:
Process : not null access procedure (Position : in Cursor));
61.1/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Set)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Set)
return Set_Iterator_Interfaces.Reversible_Iterator'Class;
61.2/3
- {AI05-0262-1AI05-0262-1} function Iterate (Container : in Set; Start :
in Cursor)
+ {<AI05-0262-1AI05-0262-1>} function Iterate (Container : in Set; Start
: in Cursor)
return Set_Iterator_Interfaces.Reversible_Iterator'Class;
62/2
@@ -92029,22 +92344,22 @@ Containers.Ordered_Sets has the following declaration:
(Element : in out Element_Type));
73.1/3
- {AI05-0212-1AI05-0212-1} type Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type
(Element : not null access Element_Type) is private
with Implicit_Dereference => Element;
73.2/3
- {AI05-0212-1AI05-0212-1} function Reference_Preserving_Key
(Container : aliased in out Set;
+ {<AI05-0212-1AI05-0212-1>} function Reference_Preserving_Key
(Container : aliased in out Set;
Position : in Cursor)
return Reference_Type;
73.3/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Set;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Set;
Key : in Key_Type)
return Constant_Reference_Type;
73.4/3
- {AI05-0212-1AI05-0212-1} function Reference_Preserving_Key
(Container : aliased in out Set;
+ {<AI05-0212-1AI05-0212-1>} function Reference_Preserving_Key
(Container : aliased in out Set;
Key : in Key_Type)
return Reference_Type;
@@ -92055,19 +92370,19 @@ Containers.Ordered_Sets has the following declaration:
private
76/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
77/2
end Ada.Containers.Ordered_Sets;
78/2
-{AI95-00302-03AI95-00302-03} Two elements E1 and E2 are equivalent if
-both E1 < E2 and E2 < E1 return False, using the generic formal "<"
-operator for elements. Function Equivalent_Elements returns True if
-Left and Right are equivalent, and False otherwise.
+{<AI95-00302-03AI95-00302-03>} Two elements <E1> and <E2> are
+<equivalent> if both <E1> < <E2> and <E2> < <E1> return False, using the
+generic formal "<" operator for elements. Function Equivalent_Elements
+returns True if Left and Right are equivalent, and False otherwise.
79/3
-{AI95-00302-03AI95-00302-03} {AI05-0044-1AI05-0044-1} The actual
+{<AI95-00302-03AI95-00302-03>} {<AI05-0044-1AI05-0044-1>} The actual
function for the generic formal function "<" on Element_Type values is
expected to return the same value each time it is called with a
particular pair of key values. It should define a strict weak ordering
@@ -92077,15 +92392,15 @@ subprograms of this package call "<" and how many
times they call it, is
unspecified.
79.1/3
-{AI05-0044-1AI05-0044-1} If the actual function for the generic formal
+{<AI05-0044-1AI05-0044-1>} If the actual function for the generic formal
function "=" returns True for any pair of nonequivalent elements, then
the behavior of the container function "=" is unspecified.
80/2
-{AI95-00302-03AI95-00302-03} If the value of an element stored in a set
-is changed other than by an operation in this package such that at least
-one of "<" or "=" give different results, the behavior of this package
-is unspecified.
+{<AI95-00302-03AI95-00302-03>} If the value of an element stored in a
+set is changed other than by an operation in this package such that at
+least one of "<" or "=" give different results, the behavior of this
+package is unspecified.
80.a/2
Discussion: See *note A.18.6::, "*note A.18.6:: The Generic
@@ -92095,27 +92410,27 @@ is unspecified.
elements, not key/element pairs.
81/3
-{AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} The first element
-of a nonempty set is the one which is less than all the other elements
-in the set. The last element of a nonempty set is the one which is
-greater than all the other elements in the set. The successor of an
-element is the smallest element that is larger than the given element.
-The predecessor of an element is the largest element that is smaller
-than the given element. All comparisons are done using the generic
-formal "<" operator for elements.
+{<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} The <first
+element> of a nonempty set is the one which is less than all the other
+elements in the set. The <last element> of a nonempty set is the one
+which is greater than all the other elements in the set. The
+<successor> of an element is the smallest element that is larger than
+the given element. The <predecessor> of an element is the largest
+element that is smaller than the given element. All comparisons are
+done using the generic formal "<" operator for elements.
81.1/3
function Copy (Source : Set) return Set;
81.2/3
- {AI05-0001-1AI05-0001-1} Returns a set whose elements are
+ {<AI05-0001-1AI05-0001-1>} Returns a set whose elements are
initialized from the corresponding elements of Source.
82/2
procedure Delete_First (Container : in out Set);
83/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, Delete_First has no effect. Otherwise,
the element designated by First (Container) is removed from
Container. Delete_First tampers with the cursors of
@@ -92125,7 +92440,7 @@ formal "<" operator for elements.
procedure Delete_Last (Container : in out Set);
85/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>} If
Container is empty, Delete_Last has no effect. Otherwise, the
element designated by Last (Container) is removed from
Container. Delete_Last tampers with the cursors of Container.
@@ -92134,29 +92449,29 @@ formal "<" operator for elements.
function First_Element (Container : Set) return Element_Type;
87/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (First
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (First
(Container)).
88/2
function Last (Container : Set) return Cursor;
89/2
- {AI95-00302-03AI95-00302-03} Returns a cursor that designates
- the last element in Container. If Container is empty, returns
- No_Element.
+ {<AI95-00302-03AI95-00302-03>} Returns a cursor that
+ designates the last element in Container. If Container is
+ empty, returns No_Element.
90/2
function Last_Element (Container : Set) return Element_Type;
91/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Last
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Last
(Container)).
92/2
function Previous (Position : Cursor) return Cursor;
93/3
- {AI95-00302-03AI95-00302-03} {AI05-0262-1AI05-0262-1} If
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0262-1AI05-0262-1>} If
Position equals No_Element, then Previous returns No_Element.
Otherwise, Previous returns a cursor designating the
predecessor element of the one designated by Position. If
@@ -92167,7 +92482,7 @@ formal "<" operator for elements.
procedure Previous (Position : in out Cursor);
95/2
- {AI95-00302-03AI95-00302-03} Equivalent to Position :=
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Position :=
Previous (Position).
96/2
@@ -92175,61 +92490,61 @@ formal "<" operator for elements.
Item : Element_Type) return Cursor;
97/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} Floor
- searches for the last element which is not greater than Item.
- If such an element is found, a cursor that designates it is
- returned. Otherwise, No_Element is returned.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ Floor searches for the last element which is not greater than
+ Item. If such an element is found, a cursor that designates
+ it is returned. Otherwise, No_Element is returned.
98/2
function Ceiling (Container : Set;
Item : Element_Type) return Cursor;
99/3
- {AI95-00302-03AI95-00302-03} {AI05-0264-1AI05-0264-1} Ceiling
- searches for the first element which is not less than Item.
- If such an element is found, a cursor that designates it is
- returned. Otherwise, No_Element is returned.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0264-1AI05-0264-1>}
+ Ceiling searches for the first element which is not less than
+ Item. If such an element is found, a cursor that designates
+ it is returned. Otherwise, No_Element is returned.
100/2
function "<" (Left, Right : Cursor) return Boolean;
101/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Left) <
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Left) <
Element (Right).
102/2
function ">" (Left, Right : Cursor) return Boolean;
103/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Right) <
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Right) <
Element (Left).
104/2
function "<" (Left : Cursor; Right : Element_Type) return Boolean;
105/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Left) <
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Left) <
Right.
106/2
function ">" (Left : Cursor; Right : Element_Type) return Boolean;
107/2
- {AI95-00302-03AI95-00302-03} Equivalent to Right < Element
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Right < Element
(Left).
108/2
function "<" (Left : Element_Type; Right : Cursor) return Boolean;
109/2
- {AI95-00302-03AI95-00302-03} Equivalent to Left < Element
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Left < Element
(Right).
110/2
function ">" (Left : Element_Type; Right : Cursor) return Boolean;
111/2
- {AI95-00302-03AI95-00302-03} Equivalent to Element (Right) <
+ {<AI95-00302-03AI95-00302-03>} Equivalent to Element (Right) <
Left.
112/2
@@ -92238,27 +92553,27 @@ formal "<" operator for elements.
Process : not null access procedure (Position : in Cursor));
113/3
- {AI95-00302-03AI95-00302-03} {AI05-0212-1AI05-0212-1} Iterates
- over the elements in Container as per procedure Iterate, with
- the difference that the elements are traversed in predecessor
- order, starting with the last element.
+ {<AI95-00302-03AI95-00302-03>} {<AI05-0212-1AI05-0212-1>}
+ Iterates over the elements in Container as per procedure
+ Iterate, with the difference that the elements are traversed
+ in predecessor order, starting with the last element.
113.1/3
function Iterate (Container : in Set)
return Set_Iterator_Interfaces.Reversible_Iterator'Class;
113.2/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} Iterate returns a reversible iterator
- object (see *note 5.5.1::) that will generate a value for a
- loop parameter (see *note 5.5.2::) designating each element in
- Container, starting with the first element and moving the
- cursor according to the successor relation when used as a
- forward iterator, and starting with the last element and
- moving the cursor according to the predecessor relation when
- used as a reverse iterator. Tampering with the cursors of
- Container is prohibited while the iterator object exists (in
- particular, in the sequence_of_statements of the
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} Iterate returns a reversible
+ iterator object (see *note 5.5.1::) that will generate a value
+ for a loop parameter (see *note 5.5.2::) designating each
+ element in Container, starting with the first element and
+ moving the cursor according to the successor relation when
+ used as a forward iterator, and starting with the last element
+ and moving the cursor according to the predecessor relation
+ when used as a reverse iterator. Tampering with the cursors
+ of Container is prohibited while the iterator object exists
+ (in particular, in the sequence_of_statements of the
loop_statement whose iterator_specification denotes this
object). The iterator object needs finalization.
@@ -92267,8 +92582,8 @@ formal "<" operator for elements.
return Set_Iterator_Interfaces.Reversible_Iterator'Class;
113.4/3
- {AI05-0262-1AI05-0262-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} If Start is not No_Element and does
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} If Start is not No_Element and does
not designate an item in Container, then Program_Error is
propagated. If Start is No_Element, then Constraint_Error is
propagated. Otherwise, Iterate returns a reversible iterator
@@ -92297,15 +92612,15 @@ formal "<" operator for elements.
parameter and Stop is the cursor that you want to stop at).
114/2
-{AI95-00302-03AI95-00302-03} For any two elements E1 and E2, the boolean
-values (E1 < E2) and (Key(E1) < Key(E2)) are expected to be equal. If
-the actuals for Key or Generic_Keys."<" behave in some other manner, the
-behavior of this package is unspecified. Which subprograms of this
-package call Key and Generic_Keys."<", and how many times the functions
-are called, is unspecified.
+{<AI95-00302-03AI95-00302-03>} For any two elements <E1> and <E2>, the
+boolean values (<E1> < <E2>) and (Key(<E1>) < Key(<E2>)) are expected to
+be equal. If the actuals for Key or Generic_Keys."<" behave in some
+other manner, the behavior of this package is unspecified. Which
+subprograms of this package call Key and Generic_Keys."<", and how many
+times the functions are called, is unspecified.
115/2
-{AI95-00302-03AI95-00302-03} In addition to the semantics described in
+{<AI95-00302-03AI95-00302-03>} In addition to the semantics described in
*note A.18.7::, the subprograms in package Generic_Keys named Floor and
Ceiling, are equivalent to the corresponding subprograms in the parent
package, with the difference that the Key subprogram parameter is
@@ -92317,22 +92632,22 @@ False using the generic formal "<" operator, and
returns True otherwise.
_Implementation Advice_
116/2
-{AI95-00302-03AI95-00302-03} If N is the length of a set, then the
+{<AI95-00302-03AI95-00302-03>} If <N> is the length of a set, then the
worst-case time complexity of the Insert, Include, Replace, Delete,
Exclude and Find operations that take an element parameter should be
-O((log N)**2) or better. The worst-case time complexity of the
-subprograms that take a cursor parameter should be O(1).
+<O>((log <N>)**2) or better. The worst-case time complexity of the
+subprograms that take a cursor parameter should be <O>(1).
116.a/2
Implementation Advice: The worst-case time complexity of the
Insert, Include, Replace, Delete, Exclude and Find operations
of Containers.Ordered_Sets that take an element parameter
- should be O((log N)**2). The worst-case time complexity of
- the subprograms of Containers.Ordered_Sets that take a cursor
- parameter should be O(1).
+ should be <O>((log <N>)**2). The worst-case time complexity
+ of the subprograms of Containers.Ordered_Sets that take a
+ cursor parameter should be <O>(1).
116.b/2
- Implementation Note: {AI95-00302-03AI95-00302-03} See *note
+ Implementation Note: {<AI95-00302-03AI95-00302-03>} See *note
A.18.6::, "*note A.18.6:: The Generic Package
Containers.Ordered_Maps" for implementation notes regarding
some of the operations of this package.
@@ -92340,42 +92655,42 @@ subprograms that take a cursor parameter should be
O(1).
_Extensions to Ada 95_
116.c/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Ordered_Sets is new.
_Incompatibilities With Ada 2005_
116.d/3
- {AI05-0001-1AI05-0001-1} Subprograms Assign and Copy are added
- to Containers.Ordered_Sets. If an instance of
+ {<AI05-0001-1AI05-0001-1>} Subprograms Assign and Copy are
+ added to Containers.Ordered_Sets. If an instance of
Containers.Ordered_Sets is referenced in a use_clause, and an
- entity E with the same defining_identifier as a new entity in
- Containers.Ordered_Sets is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
- use-visible, resulting in errors. This should be rare and is
- easily fixed if it does occur.
+ entity <E> with the same defining_identifier as a new entity
+ in Containers.Ordered_Sets is defined in a package that is
+ also referenced in a use_clause, the entity <E> may no longer
+ be use-visible, resulting in errors. This should be rare and
+ is easily fixed if it does occur.
_Extensions to Ada 2005_
116.e/3
- {AI05-0212-1AI05-0212-1} Added iterator and indexing support
+ {<AI05-0212-1AI05-0212-1>} Added iterator and indexing support
to make ordered set containers more convenient to use.
_Wording Changes from Ada 2005_
116.f/3
- {AI05-0044-1AI05-0044-1} Correction: Added wording to require
- the formal function be such that equal elements are also
- equivalent.
+ {<AI05-0044-1AI05-0044-1>} Correction: Added wording to
+ require the formal function be such that equal elements are
+ also equivalent.
116.g/3
- {AI05-0044-1AI05-0044-1} Correction: Redefined "<" actuals to
- require a strict weak ordering; the old definition allowed
+ {<AI05-0044-1AI05-0044-1>} Correction: Redefined "<" actuals
+ to require a strict weak ordering; the old definition allowed
indeterminant comparisons that would not have worked in a
container.
116.h/3
- {AI05-0084-1AI05-0084-1} Correction: Added a pragma
+ {<AI05-0084-1AI05-0084-1>} Correction: Added a pragma
Remote_Types so that containers can be used in distributed
programs.
@@ -92386,53 +92701,53 @@ A.18.10 The Generic Package Containers.Multiway_Trees
-----------------------------------------------------
1/3
-{AI05-0136-1AI05-0136-1} The language-defined generic package
+{<AI05-0136-1AI05-0136-1>} The language-defined generic package
Containers.Multiway_Trees provides private types Tree and Cursor, and a
set of operations for each type. A multiway tree container is
well-suited to represent nested structures.
1.a/3
- Discussion: {AI05-0136-1AI05-0136-1} This tree just provides a
- basic structure, and make no promises about balancing or other
- automatic organization. In this sense, it is different than
- the indexed (Map, Set) forms. Rather, it provides a building
- block on which to construct more complex and more specialized
- tree containers.
+ Discussion: {<AI05-0136-1AI05-0136-1>} This tree just provides
+ a basic structure, and make no promises about balancing or
+ other automatic organization. In this sense, it is different
+ than the indexed (Map, Set) forms. Rather, it provides a
+ building block on which to construct more complex and more
+ specialized tree containers.
2/4
-{AI05-0136-1AI05-0136-1} {AI12-0078-1AI12-0078-1}
-{AI12-0159-1AI12-0159-1} A multiway tree container object manages a tree
-of nodes, consisting of a root node and a set of internal nodes; each
-internal node contains an element and pointers to the parent, first
-child, last child, next (successor) sibling, and previous (predecessor)
-sibling internal nodes. A cursor designates a particular node within a
-tree (and by extension the element contained in that node, if any). A
-cursor keeps designating the same node (and element) as long as the node
-is part of the container, even if the node is moved within the
-container.
+{<AI05-0136-1AI05-0136-1>} {<AI12-0078-1AI12-0078-1>}
+{<AI12-0159-1AI12-0159-1>} A multiway tree container object manages a
+tree of <nodes>, consisting of a <root node> and a set of <internal
+nodes>; each internal node contains an element and pointers to the
+parent, first child, last child, next (successor) sibling, and previous
+(predecessor) sibling internal nodes. A cursor designates a particular
+node within a tree (and by extension the element contained in that node,
+if any). A cursor keeps designating the same node (and element) as long
+as the node is part of the container, even if the node is moved within
+the container.
3/4
-{AI05-0136-1AI05-0136-1} {AI05-0269-1AI05-0269-1}
-{AI12-0078-1AI12-0078-1} A subtree is a particular node (which roots the
-subtree) and all of its child nodes (including all of the children of
-the child nodes, recursively). The root node is always present and has
-neither an associated element value nor any parent node; it has pointers
-to its first child and its last child, if any. The root node provides a
-place to add nodes to an otherwise empty tree and represents the base of
-the tree.
+{<AI05-0136-1AI05-0136-1>} {<AI05-0269-1AI05-0269-1>}
+{<AI12-0078-1AI12-0078-1>} A <subtree> is a particular node (which
+<roots the subtree>) and all of its child nodes (including all of the
+children of the child nodes, recursively). The root node is always
+present and has neither an associated element value nor any parent node;
+it has pointers to its first child and its last child, if any. The root
+node provides a place to add nodes to an otherwise empty tree and
+represents the base of the tree.
4/3
-{AI05-0136-1AI05-0136-1} {AI05-0269-1AI05-0269-1} A node that has no
-children is called a leaf node. The ancestors of a node are the node
-itself, its parent node, the parent of the parent node, and so on until
-a node with no parent is reached. Similarly, the descendants of a node
-are the node itself, its child nodes, the children of each child node,
-and so on.
+{<AI05-0136-1AI05-0136-1>} {<AI05-0269-1AI05-0269-1>} A node that has no
+children is called a <leaf node>. The <ancestors> of a node are the
+node itself, its parent node, the parent of the parent node, and so on
+until a node with no parent is reached. Similarly, the <descendants> of
+a node are the node itself, its child nodes, the children of each child
+node, and so on.
5/3
-{AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1}
-{AI05-0269-1AI05-0269-1} The nodes of a subtree can be visited in
-several different orders. For a depth-first order, after visiting a
+{<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0269-1AI05-0269-1>} The nodes of a subtree can be visited in
+several different orders. For a <depth-first order>, after visiting a
node, the nodes of its child list are each visited in depth-first order,
with each child node visited in natural order (first child to last
child).
@@ -92445,11 +92760,11 @@ child).
_Static Semantics_
6/3
-{AI05-0136-1AI05-0136-1} The generic library package
+{<AI05-0136-1AI05-0136-1>} The generic library package
Containers.Multiway_Trees has the following declaration:
7/3
- {AI05-0136-1AI05-0136-1} {AI05-0212-1AI05-0212-1} with
Ada.Iterator_Interfaces;
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0212-1AI05-0212-1>} with
Ada.Iterator_Interfaces;
generic
type Element_Type is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
@@ -92458,7 +92773,7 @@ Containers.Multiway_Trees has the following declaration:
pragma Remote_Types(Multiway_Trees);
8/3
- {AI05-0136-1AI05-0136-1} {AI05-0212-1AI05-0212-1} type Tree is tagged
private
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0212-1AI05-0212-1>} type Tree is
tagged private
with Constant_Indexing => Constant_Reference,
Variable_Indexing => Reference,
Default_Iterator => Iterate,
@@ -92479,7 +92794,7 @@ Containers.Multiway_Trees has the following declaration:
function Has_Element (Position : Cursor) return Boolean;
13/3
- {AI05-0212-1AI05-0212-1} package Tree_Iterator_Interfaces is new
+ {<AI05-0212-1AI05-0212-1>} package Tree_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
14/3
@@ -92534,21 +92849,21 @@ Containers.Multiway_Trees has the following
declaration:
(Element : in out Element_Type));
28/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
29/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
30/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Tree;
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Tree;
Position : in Cursor)
return Constant_Reference_Type;
31/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Tree;
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Tree;
Position : in Cursor)
return Reference_Type;
@@ -92580,12 +92895,12 @@ Containers.Multiway_Trees has the following
declaration:
return Cursor;
39/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} function
Find_In_Subtree (Position : Cursor;
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} function
Find_In_Subtree (Position : Cursor;
Item : Element_Type)
return Cursor;
40/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} function
Ancestor_Find (Position : Cursor;
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} function
Ancestor_Find (Position : Cursor;
Item : Element_Type)
return Cursor;
@@ -92604,11 +92919,11 @@ Containers.Multiway_Trees has the following
declaration:
Process : not null access procedure (Position : in Cursor));
44/3
- {AI05-0212-1AI05-0212-1} function Iterate (Container : in Tree)
+ {<AI05-0212-1AI05-0212-1>} function Iterate (Container : in Tree)
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
45/3
- {AI05-0212-1AI05-0212-1} function Iterate_Subtree (Position : in
Cursor)
+ {<AI05-0212-1AI05-0212-1>} function Iterate_Subtree (Position : in
Cursor)
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
46/3
@@ -92715,26 +93030,26 @@ Containers.Multiway_Trees has the following
declaration:
procedure Previous_Sibling (Position : in out Cursor);
68/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} procedure
Iterate_Children
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} procedure
Iterate_Children
(Parent : in Cursor;
Process : not null access procedure (Position : in Cursor));
69/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} procedure
Reverse_Iterate_Children
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} procedure
Reverse_Iterate_Children
(Parent : in Cursor;
Process : not null access procedure (Position : in Cursor));
70/3
- {AI05-0212-1AI05-0212-1} function Iterate_Children (Container : in
Tree; Parent : in Cursor)
+ {<AI05-0212-1AI05-0212-1>} function Iterate_Children (Container : in
Tree; Parent : in Cursor)
return Tree_Iterator_Interfaces.Reversible_Iterator'Class;
71/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Containers.Multiway_Trees;
72/3
-{AI05-0136-1AI05-0136-1} The actual function for the generic formal
+{<AI05-0136-1AI05-0136-1>} The actual function for the generic formal
function "=" on Element_Type values is expected to define a reflexive
and symmetric relationship and return the same result value each time it
is called with a particular pair of values. If it behaves in some other
@@ -92744,40 +93059,41 @@ calls of this generic formal function by the
functions Find,
Reverse_Find, Equal_Subtree, and "=" on tree values are unspecified.
73/3
-{AI05-0136-1AI05-0136-1} The type Tree is used to represent trees. The
-type Tree needs finalization (see *note 7.6::).
+{<AI05-0136-1AI05-0136-1>} The type Tree is used to represent trees.
+The type Tree needs finalization (see *note 7.6::).
74/3
-{AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} Empty_Tree represents
-the empty Tree object. It contains only the root node (Node_Count
-(Empty_Tree) returns 1). If an object of type Tree is not otherwise
-initialized, it is initialized to the same value as Empty_Tree.
+{<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} Empty_Tree
+represents the empty Tree object. It contains only the root node
+(Node_Count (Empty_Tree) returns 1). If an object of type Tree is not
+otherwise initialized, it is initialized to the same value as
+Empty_Tree.
75/3
-{AI05-0136-1AI05-0136-1} No_Element represents a cursor that designates
-no element. If an object of type Cursor is not otherwise initialized,
-it is initialized to the same value as No_Element.
+{<AI05-0136-1AI05-0136-1>} No_Element represents a cursor that
+designates no element. If an object of type Cursor is not otherwise
+initialized, it is initialized to the same value as No_Element.
76/3
-{AI05-0136-1AI05-0136-1} The predefined "=" operator for type Cursor
+{<AI05-0136-1AI05-0136-1>} The predefined "=" operator for type Cursor
returns True if both cursors are No_Element, or designate the same
element in the same container.
77/3
-{AI05-0136-1AI05-0136-1} Execution of the default implementation of the
-Input, Output, Read, or Write attribute of type Cursor raises
+{<AI05-0136-1AI05-0136-1>} Execution of the default implementation of
+the Input, Output, Read, or Write attribute of type Cursor raises
Program_Error.
78/3
-{AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
-{AI05-0262-1AI05-0262-1} Tree'Write for a Tree object T writes
-Node_Count(T) - 1 elements of the tree to the stream. It also may write
-additional information about the tree.
+{<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0262-1AI05-0262-1>} Tree'Write for a Tree object <T> writes
+Node_Count(<T>) - 1 elements of the tree to the stream. It also may
+write additional information about the tree.
79/3
-{AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
-{AI05-0262-1AI05-0262-1} Tree'Read reads the representation of a tree
-from the stream, and assigns to Item a tree with the same elements and
+{<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+{<AI05-0262-1AI05-0262-1>} Tree'Read reads the representation of a tree
+from the stream, and assigns to <Item> a tree with the same elements and
structure as was written by Tree'Write.
79.a/3
@@ -92786,7 +93102,7 @@ structure as was written by Tree'Write.
the Implementation Note in *note A.18.2::.
80/3
-{AI05-0136-1AI05-0136-1} [Some operations of this generic package have
+{<AI05-0136-1AI05-0136-1>} [Some operations of this generic package have
access-to-subprogram parameters. To ensure such operations are
well-defined, they guard against certain actions by the designated
subprogram. In particular, some operations check for "tampering with
@@ -92796,13 +93112,13 @@ elements" of a container because they depend on
elements of the
container not being replaced.]
81/3
-{AI05-0136-1AI05-0136-1} A subprogram is said to tamper with cursors of
-a tree object T if:
+{<AI05-0136-1AI05-0136-1>} A subprogram is said to <tamper with cursors>
+of a tree object <T> if:
82/3
- * it inserts or deletes elements of T, that is, it calls the Clear,
+ * it inserts or deletes elements of <T>, that is, it calls the Clear,
Delete_Leaf, Insert_Child, Delete_Children, Delete_Subtree, or
- Copy_Subtree procedures with T as a parameter; or
+ Copy_Subtree procedures with <T> as a parameter; or
82.a/3
To be honest: Operations which are defined to be equivalent to
@@ -92811,15 +93127,15 @@ a tree object T if:
definition are included.
83/3
- * {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} it reorders the
- elements of T, that is, it calls the Splice_Subtree or
- Splice_Children procedures with T as a parameter; or
+ * {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} it reorders
+ the elements of <T>, that is, it calls the Splice_Subtree or
+ Splice_Children procedures with <T> as a parameter; or
84/3
- * it finalizes T; or
+ * it finalizes <T>; or
85/3
- * it calls Assign with T as the Target parameter; or
+ * it calls Assign with <T> as the Target parameter; or
85.a.1/3
Ramification: We don't need to explicitly mention
@@ -92828,22 +93144,22 @@ a tree object T if:
already defined as tampering with cursors.
86/3
- * it calls the Move procedure with T as a parameter.
+ * it calls the Move procedure with <T> as a parameter.
86.a/3
Reason: Swap copies elements rather than reordering them, so
it doesn't tamper with cursors.
87/3
-{AI05-0136-1AI05-0136-1} A subprogram is said to tamper with elements of
-a tree object T if:
+{<AI05-0136-1AI05-0136-1>} A subprogram is said to <tamper with
+elements> of a tree object <T> if:
88/3
- * it tampers with cursors of T; or
+ * it tampers with cursors of <T>; or
89/3
- * it replaces one or more elements of T, that is, it calls the
- Replace_Element or Swap procedures with T as a parameter.
+ * it replaces one or more elements of <T>, that is, it calls the
+ Replace_Element or Swap procedures with <T> as a parameter.
89.a/3
Reason: Complete replacement of an element can cause its
@@ -92861,15 +93177,16 @@ a tree object T if:
already defined as tampering with the element.
90/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-cursors is prohibited for a particular tree object T, Program_Error is
-propagated by a call of any language-defined subprogram that is defined
-to tamper with the cursors of T, leaving T unmodified. Similarly, when
-tampering with elements is prohibited for a particular tree object T,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with cursors is <prohibited> for a particular tree object <T>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the elements of T [(or tamper with the
-cursors of T)], leaving T unmodified. These checks are made before any
-other defined behavior of the body of the language-defined subprogram.
+that is defined to tamper with the cursors of <T>, leaving <T>
+unmodified. Similarly, when tampering with elements is <prohibited> for
+a particular tree object <T>, Program_Error is propagated by a call of
+any language-defined subprogram that is defined to tamper with the
+elements of <T> [(or tamper with the cursors of <T>)], leaving <T>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
90.a/3
Proof: Tampering with elements includes tampering with
@@ -92885,8 +93202,8 @@ other defined behavior of the body of the
language-defined subprogram.
the cursor designates a root node or equals No_Element.]
92.a/3
- To be honest: {AI05-0005-1AI05-0005-1}
- {AI05-0136-1AI05-0136-1} This function might not detect
+ To be honest: {<AI05-0005-1AI05-0005-1>}
+ {<AI05-0136-1AI05-0136-1>} This function might not detect
cursors that designate deleted elements; such cursors are
invalid (see below) and the result of calling Has_Element with
an invalid cursor is unspecified (but not erroneous).
@@ -92896,8 +93213,8 @@ other defined behavior of the body of the
language-defined subprogram.
Right_Position: Cursor) return Boolean;
94/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} {AI05-0264-1AI05-0264-1} If
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0264-1AI05-0264-1>} If
Left_Position or Right_Position equals No_Element, propagates
Constraint_Error. If the number of child nodes of the element
designated by Left_Position is different from the number of
@@ -92941,9 +93258,9 @@ other defined behavior of the body of the
language-defined subprogram.
function "=" (Left, Right : Tree) return Boolean;
96/3
- {AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1} If Left and
- Right denote the same tree object, then the function returns
- True. Otherwise, it calls Equal_Subtree with cursors
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>} If Left
+ and Right denote the same tree object, then the function
+ returns True. Otherwise, it calls Equal_Subtree with cursors
designating the root nodes of Left and Right; the result is
returned. Any exception raised during the evaluation of
Equal_Subtree is propagated.
@@ -92957,7 +93274,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Node_Count (Container : Tree) return Count_Type;
98/3
- {AI05-0136-1AI05-0136-1} Node_Count returns the number of
+ {<AI05-0136-1AI05-0136-1>} Node_Count returns the number of
nodes in Container.
98.a/3
@@ -92969,17 +93286,17 @@ other defined behavior of the body of the
language-defined subprogram.
function Subtree_Node_Count (Position : Cursor) return Count_Type;
100/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Position
- is No_Element, Subtree_Node_Count returns 0; otherwise,
- Subtree_Node_Count returns the number of nodes in the subtree
- that is rooted by Position.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Position is No_Element, Subtree_Node_Count returns 0;
+ otherwise, Subtree_Node_Count returns the number of nodes in
+ the subtree that is rooted by Position.
101/3
function Is_Empty (Container : Tree) return Boolean;
102/3
- {AI05-0136-1AI05-0136-1} Equivalent to Node_Count (Container)
- = 1.
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Node_Count
+ (Container) = 1.
102.a/3
Ramification: An empty tree contains just the root node.
@@ -92988,9 +93305,9 @@ other defined behavior of the body of the
language-defined subprogram.
function Depth (Position : Cursor) return Count_Type;
104/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Position
- equals No_Element, Depth returns 0; otherwise, Depth returns
- the number of ancestor nodes of the node designated by
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Position equals No_Element, Depth returns 0; otherwise, Depth
+ returns the number of ancestor nodes of the node designated by
Position (including the node itself).
104.a/3
@@ -93000,7 +93317,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Is_Root (Position : Cursor) return Boolean;
106/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} Is_Root
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} Is_Root
returns True if the Position designates the root node of some
tree; and returns False otherwise.
@@ -93008,7 +93325,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Is_Leaf (Position : Cursor) return Boolean;
108/3
- {AI05-0136-1AI05-0136-1} Is_Leaf returns True if Position
+ {<AI05-0136-1AI05-0136-1>} Is_Leaf returns True if Position
designates a node that does not have any child nodes; and
returns False otherwise.
@@ -93022,8 +93339,8 @@ other defined behavior of the body of the
language-defined subprogram.
function Root (Container : Tree) return Cursor;
110/3
- {AI05-0136-1AI05-0136-1} Root returns a cursor that designates
- the root node of Container.
+ {<AI05-0136-1AI05-0136-1>} Root returns a cursor that
+ designates the root node of Container.
110.a/3
Ramification: There is always a root node, even in an empty
@@ -93033,7 +93350,7 @@ other defined behavior of the body of the
language-defined subprogram.
procedure Clear (Container : in out Tree);
112/3
- {AI05-0136-1AI05-0136-1} Removes all the elements from
+ {<AI05-0136-1AI05-0136-1>} Removes all the elements from
Container.
112.a/3
@@ -93044,7 +93361,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Element (Position : Cursor) return Element_Type;
114/3
- {AI05-0136-1AI05-0136-1} If Position equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} If Position equals No_Element, then
Constraint_Error is propagated; if Position designates the
root node of a tree, then Program_Error is propagated.
Otherwise, Element returns the element designated by Position.
@@ -93059,12 +93376,13 @@ other defined behavior of the body of the
language-defined subprogram.
New_Item : in Element_Type);
116/3
- {AI05-0136-1AI05-0136-1} {AI05-0264-1AI05-0264-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container (including
- if it designates the root node), then Program_Error is
- propagated. Otherwise, Replace_Element assigns the value
- New_Item to the element designated by Position.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0264-1AI05-0264-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container (including if it designates the root node), then
+ Program_Error is propagated. Otherwise, Replace_Element
+ assigns the value New_Item to the element designated by
+ Position.
117/3
procedure Query_Element
@@ -93072,12 +93390,12 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Element : in Element_Type));
118/3
- {AI05-0136-1AI05-0136-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position designates the root node of a tree, then
- Program_Error is propagated. Otherwise, Query_Element calls
- Process.all with the element designated by Position as the
- argument. Tampering with the elements of the tree that
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position designates the root node of a tree,
+ then Program_Error is propagated. Otherwise, Query_Element
+ calls Process.all with the element designated by Position as
+ the argument. Tampering with the elements of the tree that
contains the element designated by Position is prohibited
during the execution of the call on Process.all. Any
exception raised by Process.all is propagated.
@@ -93090,8 +93408,8 @@ other defined behavior of the body of the
language-defined subprogram.
(Element : in out Element_Type));
120/3
- {AI05-0136-1AI05-0136-1} {AI05-0264-1AI05-0264-1}
- {AI05-0265-1AI05-0265-1} If Position equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0265-1AI05-0265-1>} If Position equals No_Element, then
Constraint_Error is propagated; if Position does not designate
an element in Container (including if it designates the root
node), then Program_Error is propagated. Otherwise,
@@ -93120,8 +93438,8 @@ other defined behavior of the body of the
language-defined subprogram.
with Implicit_Dereference => Element;
124/3
- {AI05-0212-1AI05-0212-1} The types Constant_Reference_Type and
- Reference_Type need finalization.
+ {<AI05-0212-1AI05-0212-1>} The types Constant_Reference_Type
+ and Reference_Type need finalization.
125/3
The default initialization of an object of type
@@ -93143,22 +93461,22 @@ other defined behavior of the body of the
language-defined subprogram.
return Constant_Reference_Type;
127/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Constant_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read access to an individual element of a tree given a
cursor.
128/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Constant_Reference
- returns an object whose discriminant is an access value that
- designates the element designated by Position. Tampering with
- the elements of Container is prohibited while the object
- returned by Constant_Reference exists and has not been
- finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Constant_Reference returns an object whose discriminant is an
+ access value that designates the element designated by
+ Position. Tampering with the elements of Container is
+ prohibited while the object returned by Constant_Reference
+ exists and has not been finalized.
129/3
function Reference (Container : aliased in out Tree;
@@ -93166,28 +93484,29 @@ other defined behavior of the body of the
language-defined subprogram.
return Reference_Type;
130/3
- {AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} This
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} This
function (combined with the Variable_Indexing and
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to an individual element of a tree
given a cursor.
131/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container, then
- Program_Error is propagated. Otherwise, Reference returns an
- object whose discriminant is an access value that designates
- the element designated by Position. Tampering with the
- elements of Container is prohibited while the object returned
- by Reference exists and has not been finalized.
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container, then Program_Error is propagated. Otherwise,
+ Reference returns an object whose discriminant is an access
+ value that designates the element designated by Position.
+ Tampering with the elements of Container is prohibited while
+ the object returned by Reference exists and has not been
+ finalized.
132/3
procedure Assign (Target : in out Tree; Source : in Tree);
133/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, the operation has no
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, the operation has no
effect. Otherwise, the elements of Source are copied to
Target as for an assignment_statement assigning Source to
Target.
@@ -93199,7 +93518,7 @@ other defined behavior of the body of the
language-defined subprogram.
the Source element.
133.b/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the bounded tree container. For an
unbounded tree, Assign(A, B) and A := B behave identically.
For a bounded tree, := will raise an exception if the
@@ -93210,7 +93529,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Copy (Source : Tree) return Tree;
135/3
- {AI05-0136-1AI05-0136-1} Returns a tree with the same
+ {<AI05-0136-1AI05-0136-1>} Returns a tree with the same
structure as Source and whose elements are initialized from
the corresponding elements of Source.
@@ -93219,11 +93538,11 @@ other defined behavior of the body of the
language-defined subprogram.
Source : in out Tree);
137/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, then the operation has no
- effect. Otherwise, Move first calls Clear (Target). Then,
- the nodes other than the root node in Source are moved to
- Target (in the same positions). After Move completes,
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, then the operation
+ has no effect. Otherwise, Move first calls Clear (Target).
+ Then, the nodes other than the root node in Source are moved
+ to Target (in the same positions). After Move completes,
Node_Count (Target) is the number of nodes originally in
Source, and Node_Count (Source) is 1.
@@ -93232,15 +93551,15 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in out Cursor);
139/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Position
- equals No_Element, then Constraint_Error is propagated; if
- Position does not designate an element in Container (including
- if it designates the root node), then Program_Error is
- propagated. If the element designated by position has any
- child elements, then Constraint_Error is propagated.
- Otherwise, Delete_Leaf removes (from Container) the element
- designated by Position. Finally, Position is set to
- No_Element.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated; if Position does not designate an element in
+ Container (including if it designates the root node), then
+ Program_Error is propagated. If the element designated by
+ position has any child elements, then Constraint_Error is
+ propagated. Otherwise, Delete_Leaf removes (from Container)
+ the element designated by Position. Finally, Position is set
+ to No_Element.
139.a/3
Ramification: The check on Position checks that the cursor
@@ -93259,8 +93578,8 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in out Cursor);
141/3
- {AI05-0136-1AI05-0136-1} {AI05-0264-1AI05-0264-1}
- {AI05-0269-1AI05-0269-1} If Position equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0269-1AI05-0269-1>} If Position equals No_Element, then
Constraint_Error is propagated. If Position does not
designate an element in Container (including if it designates
the root node), then Program_Error is propagated. Otherwise,
@@ -93278,7 +93597,7 @@ other defined behavior of the body of the
language-defined subprogram.
I, J : in Cursor);
143/3
- {AI05-0136-1AI05-0136-1} If either I or J equals No_Element,
+ {<AI05-0136-1AI05-0136-1>} If either I or J equals No_Element,
then Constraint_Error is propagated. If either I or J do not
designate an element in Container (including if either
designates the root node), then Program_Error is propagated.
@@ -93307,7 +93626,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
145/3
- {AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1} Find
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>} Find
searches the elements of Container for an element equal to
Item (using the generic formal equality operator). The search
starts at the root node. The search traverses the tree in a
@@ -93321,8 +93640,8 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
147/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} If Position equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} If Position equals No_Element, then
Constraint_Error is propagated. Find_In_Subtree searches the
subtree rooted by Position for an element equal to Item (using
the generic formal equality operator). The search starts at
@@ -93343,27 +93662,27 @@ other defined behavior of the body of the
language-defined subprogram.
return Cursor;
149/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Position
- equals No_Element, then Constraint_Error is propagated.
- Otherwise, Ancestor_Find searches for an element equal to Item
- (using the generic formal equality operator). The search
- starts at the node designated by Position, and checks each
- ancestor proceeding toward the root of the subtree. If no
- equal element is found, then Ancestor_Find returns No_Element.
- Otherwise, it returns a cursor designating the first equal
- element encountered.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated. Otherwise, Ancestor_Find searches for an element
+ equal to Item (using the generic formal equality operator).
+ The search starts at the node designated by Position, and
+ checks each ancestor proceeding toward the root of the
+ subtree. If no equal element is found, then Ancestor_Find
+ returns No_Element. Otherwise, it returns a cursor
+ designating the first equal element encountered.
149.a/3
- Ramification: {AI05-0248-1AI05-0248-1} No_Element is returned
- if Position is the root node.
+ Ramification: {<AI05-0248-1AI05-0248-1>} No_Element is
+ returned if Position is the root node.
150/3
function Contains (Container : Tree;
Item : Element_Type) return Boolean;
151/3
- {AI05-0136-1AI05-0136-1} Equivalent to Find (Container, Item)
- /= No_Element.
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Find (Container,
+ Item) /= No_Element.
152/3
procedure Iterate
@@ -93371,8 +93690,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
153/4
- {AI05-0136-1AI05-0136-1} {AI05-0265-1AI05-0265-1}
- {AI12-0069-1AI12-0069-1} Iterate calls Process.all with a
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI12-0069-1AI12-0069-1>} Iterate calls Process.all with a
cursor that designates each element in Container, starting
from the root node and proceeding in a depth-first order.
Tampering with the cursors of Container is prohibited during
@@ -93403,8 +93722,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
155/4
- {AI05-0136-1AI05-0136-1} {AI05-0265-1AI05-0265-1}
- {AI12-0069-1AI12-0069-1} If Position equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI12-0069-1AI12-0069-1>} If Position equals No_Element, then
Constraint_Error is propagated. Otherwise, Iterate_Subtree
calls Process.all with a cursor that designates each element
in the subtree rooted by the node designated by Position,
@@ -93424,8 +93743,8 @@ other defined behavior of the body of the
language-defined subprogram.
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
157/4
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} {AI12-0069-1AI12-0069-1} Iterate
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} {<AI12-0069-1AI12-0069-1>} Iterate
returns an iterator object (see *note 5.5.1::) that will
generate a value for a loop parameter (see *note 5.5.2::)
designating each element in Container, starting from the root
@@ -93452,19 +93771,19 @@ other defined behavior of the body of the
language-defined subprogram.
return Tree_Iterator_Interfaces.Forward_Iterator'Class;
159/4
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
- {AI05-0269-1AI05-0269-1} {AI12-0069-1AI12-0069-1} If Position
- equals No_Element, then Constraint_Error is propagated.
- Otherwise, Iterate_Subtree returns an iterator object (see
- *note 5.5.1::) that will generate a value for a loop parameter
- (see *note 5.5.2::) designating each element in the subtree
- rooted by the node designated by Position, starting from the
- node designated by Position and proceeding in a depth-first
- order. If Position equals No_Element, then Constraint_Error
- is propagated. Tampering with the cursors of the container
- that contains the node designated by Position is prohibited
- while the iterator object exists (in particular, in the
- sequence_of_statements of the loop_statement whose
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
+ {<AI05-0269-1AI05-0269-1>} {<AI12-0069-1AI12-0069-1>} If
+ Position equals No_Element, then Constraint_Error is
+ propagated. Otherwise, Iterate_Subtree returns an iterator
+ object (see *note 5.5.1::) that will generate a value for a
+ loop parameter (see *note 5.5.2::) designating each element in
+ the subtree rooted by the node designated by Position,
+ starting from the node designated by Position and proceeding
+ in a depth-first order. If Position equals No_Element, then
+ Constraint_Error is propagated. Tampering with the cursors of
+ the container that contains the node designated by Position is
+ prohibited while the iterator object exists (in particular, in
+ the sequence_of_statements of the loop_statement whose
iterator_specification denotes this object). The iterator
object needs finalization.
@@ -93472,15 +93791,15 @@ other defined behavior of the body of the
language-defined subprogram.
function Child_Count (Parent : Cursor) return Count_Type;
161/3
- {AI05-0136-1AI05-0136-1} Child_Count returns the number of
+ {<AI05-0136-1AI05-0136-1>} Child_Count returns the number of
child nodes of the node designated by Parent.
162/3
function Child_Depth (Parent, Child : Cursor) return Count_Type;
163/3
- {AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1} If Child or
- Parent is equal to No_Element, then Constraint_Error is
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>} If Child
+ or Parent is equal to No_Element, then Constraint_Error is
propagated. Otherwise, Child_Depth returns the number of
ancestor nodes of Child (including Child itself), up to but
not including Parent; Program_Error is propagated if Parent is
@@ -93502,8 +93821,8 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
165/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} If Parent equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} If Parent equals No_Element, then
Constraint_Error is propagated. If Parent does not designate
a node in Container, then Program_Error is propagated. If
Before is not equal to No_Element, and does not designate a
@@ -93528,10 +93847,10 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
167/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0257-1AI05-0257-1} {AI05-0262-1AI05-0262-1} If Parent
- equals No_Element, then Constraint_Error is propagated. If
- Parent does not designate a node in Container, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0257-1AI05-0257-1>} {<AI05-0262-1AI05-0262-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
+ If Parent does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
No_Element, and does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
@@ -93556,10 +93875,10 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
169/3
- {AI05-0136-1AI05-0136-1} {AI05-0257-1AI05-0257-1}
- {AI05-0262-1AI05-0262-1} {AI05-0264-1AI05-0264-1} If Parent
- equals No_Element, then Constraint_Error is propagated. If
- Parent does not designate a node in Container, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0257-1AI05-0257-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0264-1AI05-0264-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
+ If Parent does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
No_Element, and does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
@@ -93584,7 +93903,7 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
171/3
- {AI05-0136-1AI05-0136-1} Equivalent to Insert_Child
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Insert_Child
(Container, Parent, First_Child (Container, Parent), New_Item,
Count).
@@ -93595,16 +93914,16 @@ other defined behavior of the body of the
language-defined subprogram.
Count : in Count_Type := 1);
173/3
- {AI05-0136-1AI05-0136-1} {AI05-0269-1AI05-0269-1} Equivalent
- to Insert_Child (Container, Parent, No_Element, New_Item,
- Count).
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0269-1AI05-0269-1>}
+ Equivalent to Insert_Child (Container, Parent, No_Element,
+ New_Item, Count).
174/3
procedure Delete_Children (Container : in out Tree;
Parent : in Cursor);
175/3
- {AI05-0136-1AI05-0136-1} If Parent equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} If Parent equals No_Element, then
Constraint_Error is propagated. If Parent does not designate
a node in Container, Program_Error is propagated. Otherwise,
Delete_Children removes (from Container) all of the
@@ -93622,8 +93941,8 @@ other defined behavior of the body of the
language-defined subprogram.
Source : in Cursor);
177/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} If Parent equals No_Element, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} If Parent equals No_Element, then
Constraint_Error is propagated. If Parent does not designate
a node in Target, then Program_Error is propagated. If Before
is not equal to No_Element, and does not designate a node in
@@ -93667,29 +93986,30 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in out Cursor);
179/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} {AI05-0269-1AI05-0269-1} If Parent
- equals No_Element, then Constraint_Error is propagated. If
- Parent does not designate a node in Target, then Program_Error
- is propagated. If Before is not equal to No_Element, and does
- not designate a node in Target, then Program_Error is
- propagated. If Before is not equal to No_Element, and Parent
- does not designate the parent node of the node designated by
- Before, then Constraint_Error is propagated. If Position
- equals No_Element, Constraint_Error is propagated. If
- Position does not designate a node in Source or designates a
- root node, then Program_Error is propagated. If Source
- denotes the same object as Target, then: if Position equals
- Before there is no effect; if Position designates an ancestor
- of Parent (including Parent itself), Constraint_Error is
- propagated; otherwise, the subtree rooted by the element
- designated by Position is moved to be a child of Parent. If
- Parent already has child nodes, then the moved nodes are
- inserted prior to the node designated by Before, or, if Before
- equals No_Element, the moved nodes are inserted after the last
- existing child node of Parent. In each of these cases,
- Position and the count of Target are unchanged, and the parent
- of the element designated by Position is set to Parent.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0269-1AI05-0269-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
+ If Parent does not designate a node in Target, then
+ Program_Error is propagated. If Before is not equal to
+ No_Element, and does not designate a node in Target, then
+ Program_Error is propagated. If Before is not equal to
+ No_Element, and Parent does not designate the parent node of
+ the node designated by Before, then Constraint_Error is
+ propagated. If Position equals No_Element, Constraint_Error
+ is propagated. If Position does not designate a node in
+ Source or designates a root node, then Program_Error is
+ propagated. If Source denotes the same object as Target,
+ then: if Position equals Before there is no effect; if
+ Position designates an ancestor of Parent (including Parent
+ itself), Constraint_Error is propagated; otherwise, the
+ subtree rooted by the element designated by Position is moved
+ to be a child of Parent. If Parent already has child nodes,
+ then the moved nodes are inserted prior to the node designated
+ by Before, or, if Before equals No_Element, the moved nodes
+ are inserted after the last existing child node of Parent. In
+ each of these cases, Position and the count of Target are
+ unchanged, and the parent of the element designated by
+ Position is set to Parent.
179.a/3
Reason: We can't allow moving the subtree of Position to a
@@ -93697,18 +94017,18 @@ other defined behavior of the body of the
language-defined subprogram.
will be part of the subtree being moved. The result would be
a circularly linked tree, or one with inaccessible nodes.
Thus we have to check Position against Parent, even though
- such a check is O(Depth(Source)).
+ such a check is <O>(Depth(Source)).
180/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} Otherwise
- (if Source does not denote the same object as Target), the
- subtree designated by Position is removed from Source and
- moved to Target. The subtree is inserted as a child of
- Parent. If Parent already has child nodes, then the moved
- nodes are inserted prior to the node designated by Before, or,
- if Before equals No_Element, the moved nodes are inserted
- after the last existing child node of Parent. In each of
- these cases, the count of Target is incremented by
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ Otherwise (if Source does not denote the same object as
+ Target), the subtree designated by Position is removed from
+ Source and moved to Target. The subtree is inserted as a
+ child of Parent. If Parent already has child nodes, then the
+ moved nodes are inserted prior to the node designated by
+ Before, or, if Before equals No_Element, the moved nodes are
+ inserted after the last existing child node of Parent. In
+ each of these cases, the count of Target is incremented by
Subtree_Node_Count (Position), and the count of Source is
decremented by Subtree_Node_Count (Position), Position is
updated to represent an element in Target.
@@ -93736,10 +94056,10 @@ other defined behavior of the body of the
language-defined subprogram.
Position : in Cursor);
182/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} {AI05-0269-1AI05-0269-1} If Parent
- equals No_Element, then Constraint_Error is propagated. If
- Parent does not designate a node in Container, then
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0269-1AI05-0269-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
+ If Parent does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
No_Element, and does not designate a node in Container, then
Program_Error is propagated. If Before is not equal to
@@ -93772,7 +94092,7 @@ other defined behavior of the body of the
language-defined subprogram.
Source_Parent : in Cursor);
184/3
- {AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1} If
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>} If
Target_Parent equals No_Element, then Constraint_Error is
propagated. If Target_Parent does not designate a node in
Target, then Program_Error is propagated. If Before is not
@@ -93793,14 +94113,14 @@ other defined behavior of the body of the
language-defined subprogram.
else
187/3
- * {AI05-0136-1AI05-0136-1} {AI05-0269-1AI05-0269-1} if
+ * {<AI05-0136-1AI05-0136-1>} {<AI05-0269-1AI05-0269-1>} if
Source_Parent is an ancestor of Target_Parent other than
Target_Parent itself, then Constraint_Error is
propagated; else
188/3
- * {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0269-1AI05-0269-1} the child elements (and the
+ * {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0269-1AI05-0269-1>} the child elements (and the
further descendants) of Source_Parent are moved to be
child elements of Target_Parent. If Target_Parent
already has child elements, then the moved elements are
@@ -93816,9 +94136,9 @@ other defined behavior of the body of the
language-defined subprogram.
of one of the subtrees being moved.
189/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0269-1AI05-0269-1} Otherwise (if Source does not denote
- the same object as Target), the child elements (and the
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0269-1AI05-0269-1>} Otherwise (if Source does not
+ denote the same object as Target), the child elements (and the
further descendants) of Source_Parent are removed from Source
and moved to Target. The child elements are inserted as
children of Target_Parent. If Target_Parent already has child
@@ -93845,9 +94165,9 @@ other defined behavior of the body of the
language-defined subprogram.
Source_Parent : in Cursor);
191/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1}
- {AI05-0262-1AI05-0262-1} {AI05-0264-1AI05-0264-1}
- {AI05-0269-1AI05-0269-1} If Target_Parent equals No_Element,
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>}
+ {<AI05-0262-1AI05-0262-1>} {<AI05-0264-1AI05-0264-1>}
+ {<AI05-0269-1AI05-0269-1>} If Target_Parent equals No_Element,
then Constraint_Error is propagated. If Target_Parent does
not designate a node in Container, then Program_Error is
propagated. If Before is not equal to No_Element, and does
@@ -93874,16 +94194,16 @@ other defined behavior of the body of the
language-defined subprogram.
function Parent (Position : Cursor) return Cursor;
193/3
- {AI05-0136-1AI05-0136-1} If Position is equal to No_Element or
- designates a root node, No_Element is returned. Otherwise, a
- cursor designating the parent node of the node designated by
+ {<AI05-0136-1AI05-0136-1>} If Position is equal to No_Element
+ or designates a root node, No_Element is returned. Otherwise,
+ a cursor designating the parent node of the node designated by
Position is returned.
194/3
function First_Child (Parent : Cursor) return Cursor;
195/3
- {AI05-0136-1AI05-0136-1} If Parent is equal to No_Element,
+ {<AI05-0136-1AI05-0136-1>} If Parent is equal to No_Element,
then Constraint_Error is propagated. Otherwise, First_Child
returns a cursor designating the first child node of the node
designated by Parent; if there is no such node, No_Element is
@@ -93893,14 +94213,14 @@ other defined behavior of the body of the
language-defined subprogram.
function First_Child_Element (Parent : Cursor) return Element_Type;
197/3
- {AI05-0136-1AI05-0136-1} Equivalent to Element (First_Child
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Element (First_Child
(Parent)).
198/3
function Last_Child (Parent : Cursor) return Cursor;
199/3
- {AI05-0136-1AI05-0136-1} If Parent is equal to No_Element,
+ {<AI05-0136-1AI05-0136-1>} If Parent is equal to No_Element,
then Constraint_Error is propagated. Otherwise, Last_Child
returns a cursor designating the last child node of the node
designated by Parent; if there is no such node, No_Element is
@@ -93910,14 +94230,14 @@ other defined behavior of the body of the
language-defined subprogram.
function Last_Child_Element (Parent : Cursor) return Element_Type;
201/3
- {AI05-0136-1AI05-0136-1} Equivalent to Element (Last_Child
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Element (Last_Child
(Parent)).
202/3
function Next_Sibling (Position : Cursor) return Cursor;
203/3
- {AI05-0136-1AI05-0136-1} If Position equals No_Element or
+ {<AI05-0136-1AI05-0136-1>} If Position equals No_Element or
designates the last child node of its parent, then
Next_Sibling returns the value No_Element. Otherwise, it
returns a cursor that designates the successor (with the same
@@ -93927,7 +94247,7 @@ other defined behavior of the body of the
language-defined subprogram.
function Previous_Sibling (Position : Cursor) return Cursor;
205/3
- {AI05-0136-1AI05-0136-1} If Position equals No_Element or
+ {<AI05-0136-1AI05-0136-1>} If Position equals No_Element or
designates the first child node of its parent, then
Previous_Sibling returns the value No_Element. Otherwise, it
returns a cursor that designates the predecessor (with the
@@ -93937,14 +94257,14 @@ other defined behavior of the body of the
language-defined subprogram.
procedure Next_Sibling (Position : in out Cursor);
207/3
- {AI05-0136-1AI05-0136-1} Equivalent to Position :=
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Position :=
Next_Sibling (Position);
208/3
procedure Previous_Sibling (Position : in out Cursor);
209/3
- {AI05-0136-1AI05-0136-1} Equivalent to Position :=
+ {<AI05-0136-1AI05-0136-1>} Equivalent to Position :=
Previous_Sibling (Position);
210/3
@@ -93953,8 +94273,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
211/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Parent
- equals No_Element, then Constraint_Error is propagated.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
212/3
Iterate_Children calls Process.all with a cursor that
@@ -93963,7 +94283,7 @@ other defined behavior of the body of the
language-defined subprogram.
function.
213/3
- {AI05-0265-1AI05-0265-1} Tampering with the cursors of the
+ {<AI05-0265-1AI05-0265-1>} Tampering with the cursors of the
tree containing Parent is prohibited during the execution of a
call on Process.all. Any exception raised by Process.all is
propagated.
@@ -93974,8 +94294,8 @@ other defined behavior of the body of the
language-defined subprogram.
Process : not null access procedure (Position : in Cursor));
215/3
- {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} If Parent
- equals No_Element, then Constraint_Error is propagated.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} If
+ Parent equals No_Element, then Constraint_Error is propagated.
216/3
Reverse_Iterate_Children calls Process.all with a cursor that
@@ -93984,7 +94304,7 @@ other defined behavior of the body of the
language-defined subprogram.
function.
217/3
- {AI05-0265-1AI05-0265-1} Tampering with the cursors of the
+ {<AI05-0265-1AI05-0265-1>} Tampering with the cursors of the
tree containing Parent is prohibited during the execution of a
call on Process.all. Any exception raised by Process.all is
propagated.
@@ -93994,7 +94314,7 @@ other defined behavior of the body of the
language-defined subprogram.
return Tree_Iterator_Interfaces.Reversible_Iterator'Class;
219/3
- {AI05-0212-1AI05-0212-1} {AI05-0265-1AI05-0265-1}
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0265-1AI05-0265-1>}
Iterate_Children returns a reversible iterator object (see
*note 5.5.1::) that will generate a value for a loop parameter
(see *note 5.5.2::) designating each child node of Parent. If
@@ -94014,16 +94334,16 @@ other defined behavior of the body of the
language-defined subprogram.
_Bounded (Run-Time) Errors_
220/3
-{AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of this package, to tamper with
-elements of any Tree parameter of the operation. Either Program_Error
-is raised, or the operation works as defined on the value of the Tree
-either prior to, or subsequent to, some or all of the modifications to
-the Tree.
+{<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of this package, to
+tamper with elements of any Tree parameter of the operation. Either
+Program_Error is raised, or the operation works as defined on the value
+of the Tree either prior to, or subsequent to, some or all of the
+modifications to the Tree.
221/3
-{AI05-0136-1AI05-0136-1} It is a bounded error to call any subprogram
+{<AI05-0136-1AI05-0136-1>} It is a bounded error to call any subprogram
declared in the visible part of Containers.Multiway_Trees when the
associated container has been finalized. If the operation takes
Container as an in out parameter, then it raises Constraint_Error or
@@ -94033,7 +94353,7 @@ an empty container, or it raises Constraint_Error or
Program_Error.
_Erroneous Execution_
222/3
-{AI05-0136-1AI05-0136-1} A Cursor value is invalid if any of the
+{<AI05-0136-1AI05-0136-1>} A Cursor value is <invalid> if any of the
following have occurred since it was created:
223/3
@@ -94082,7 +94402,7 @@ invalid cursor parameter.
detected.
228/3
-{AI05-0212-1AI05-0212-1} Execution is erroneous if the tree associated
+{<AI05-0212-1AI05-0212-1>} Execution is erroneous if the tree associated
with the result of a call to Reference or Constant_Reference is
finalized before the result object returned by the call to Reference or
Constant_Reference is finalized.
@@ -94104,19 +94424,19 @@ Constant_Reference is finalized.
_Implementation Requirements_
229/3
-{AI05-0136-1AI05-0136-1} No storage associated with a multiway tree
+{<AI05-0136-1AI05-0136-1>} No storage associated with a multiway tree
object shall be lost upon assignment or scope exit.
230/3
-{AI05-0136-1AI05-0136-1} {AI05-0262-1AI05-0262-1} The execution of an
-assignment_statement for a tree shall have the effect of copying the
+{<AI05-0136-1AI05-0136-1>} {<AI05-0262-1AI05-0262-1>} The execution of
+an assignment_statement for a tree shall have the effect of copying the
elements from the source tree object to the target tree object and
changing the node count of the target object to that of the source
object.
230.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a Tree is a "deep" copy; that is the elements are copied as
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a Tree is a "deep" copy; that is the elements are copied as
well the data structures. We say "effect of" in order to
allow the implementation to avoid copying elements immediately
if it wishes. For instance, an implementation that avoided
@@ -94127,32 +94447,34 @@ object.
_Implementation Advice_
231/3
-{AI05-0136-1AI05-0136-1} Containers.Multiway_Trees should be implemented
-similarly to a multiway tree. In particular, if N is the overall number
-of nodes for a particular tree, then the worst-case time complexity of
-Element, Parent, First_Child, Last_Child, Next_Sibling,
-Previous_Sibling, Insert_Child with Count=1, and Delete should be O(log
-N).
+{<AI05-0136-1AI05-0136-1>} Containers.Multiway_Trees should be
+implemented similarly to a multiway tree. In particular, if <N> is the
+overall number of nodes for a particular tree, then the worst-case time
+complexity of Element, Parent, First_Child, Last_Child, Next_Sibling,
+Previous_Sibling, Insert_Child with Count=1, and Delete should be
+<O>(log <N>).
231.a/3
Implementation Advice: The worst-case time complexity of the
Element, Parent, First_Child, Last_Child, Next_Sibling,
Previous_Sibling, Insert_Child with Count=1, and Delete
- operations of Containers.Multiway_Trees should be O(log N).
+ operations of Containers.Multiway_Trees should be <O>(log
+ <N>).
231.b/3
Reason: We do not mean to overly constrain implementation
strategies here. However, it is important for portability
that the performance of large containers has roughly the same
factors on different implementations. If a program is moved
- to an implementation that takes O(N) time to access elements,
- that program could be unusable when the trees are large. We
- allow O(log N) access because the proportionality constant and
- caching effects are likely to be larger than the log factor,
- and we don't want to discourage innovative implementations.
+ to an implementation that takes <O>(<N>) time to access
+ elements, that program could be unusable when the trees are
+ large. We allow <O>(log <N>) access because the
+ proportionality constant and caching effects are likely to be
+ larger than the log factor, and we don't want to discourage
+ innovative implementations.
232/3
-{AI05-0136-1AI05-0136-1} Move should not copy elements, and should
+{<AI05-0136-1AI05-0136-1>} Move should not copy elements, and should
minimize copying of internal data structures.
232.a/3
@@ -94166,7 +94488,7 @@ minimize copying of internal data structures.
the Source container to the Target container.
233/3
-{AI05-0136-1AI05-0136-1} If an exception is propagated from a tree
+{<AI05-0136-1AI05-0136-1>} If an exception is propagated from a tree
operation, no storage should be lost, nor any elements removed from a
tree unless specified by the operation.
@@ -94184,25 +94506,25 @@ tree unless specified by the operation.
_Extensions to Ada 2005_
233.c/3
- {AI05-0136-1AI05-0136-1} {AI05-0257-1AI05-0257-1}
- {AI05-0265-1AI05-0265-1} {AI05-0269-1AI05-0269-1} The generic
- package Containers.Multiway_Trees is new.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0257-1AI05-0257-1>}
+ {<AI05-0265-1AI05-0265-1>} {<AI05-0269-1AI05-0269-1>} The
+ generic package Containers.Multiway_Trees is new.
_Wording Changes from Ada 2012_
233.d/4
- {AI12-0069-1AI12-0069-1} Corrigendum: Fixed the function
+ {<AI12-0069-1AI12-0069-1>} Corrigendum: Fixed the function
Iterate so it is clear that the root node is never visited.
233.e/4
- {AI12-0078-1AI12-0078-1} Corrigendum: The definition of node
- is clarified so that it it doesn't appear to say all nodes
- have an element.
+ {<AI12-0078-1AI12-0078-1>} Corrigendum: The definition of
+ <node> is clarified so that it it doesn't appear to say all
+ nodes have an element.
233.f/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.11, Next: A.18.12, Prev: A.18.10, Up: A.18
@@ -94211,7 +94533,7 @@ A.18.11 The Generic Package
Containers.Indefinite_Vectors
---------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Vectors provides a private type Vector and a set
of operations. It provides the same operations as the package
Containers.Vectors (see *note A.18.2::), with the difference that the
@@ -94220,9 +94542,9 @@ generic formal Element_Type is indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Vectors has the same
-contents and semantics as Containers.Vectors except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package Containers.Indefinite_Vectors
+has the same contents and semantics as Containers.Vectors except:
3/2
* The generic formal Element_Type is indefinite.
@@ -94258,7 +94580,7 @@ contents and semantics as Containers.Vectors except:
unconstrained.
9/4
- * {AI12-0035-1AI12-0035-1} The operations "&", Append, Insert,
+ * {<AI12-0035-1AI12-0035-1>} The operations "&", Append, Insert,
Prepend, Replace_Element, and To_Vector that have a formal
parameter of type Element_Type perform indefinite insertion (see
*note A.18::).
@@ -94266,14 +94588,14 @@ contents and semantics as Containers.Vectors except:
_Extensions to Ada 95_
9.a/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Vectors is new.
_Inconsistencies With Ada 2012_
9.b/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely,
as it would require that the package was not implemented in
@@ -94292,7 +94614,7 @@ A.18.12 The Generic Package
Containers.Indefinite_Doubly_Linked_Lists
---------------------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Doubly_Linked_Lists provides private types List
and Cursor, and a set of operations for each type. It provides the same
operations as the package Containers.Doubly_Linked_Lists (see *note
@@ -94302,10 +94624,10 @@ indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Doubly_Linked_Lists
-has the same contents and semantics as Containers.Doubly_Linked_Lists
-except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package
+Containers.Indefinite_Doubly_Linked_Lists has the same contents and
+semantics as Containers.Doubly_Linked_Lists except:
3/2
* The generic formal Element_Type is indefinite.
@@ -94339,21 +94661,21 @@ except:
unconstrained.
8/4
- * {AI12-0035-1AI12-0035-1} The operations Append, Insert, Prepend,
+ * {<AI12-0035-1AI12-0035-1>} The operations Append, Insert, Prepend,
and Replace_Element that have a formal parameter of type
Element_Type perform indefinite insertion (see *note A.18::).
_Extensions to Ada 95_
8.a/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Doubly_Linked_Lists is new.
_Inconsistencies With Ada 2012_
8.b/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94366,7 +94688,7 @@ A.18.13 The Generic Package
Containers.Indefinite_Hashed_Maps
-------------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Hashed_Maps provides a map with the same
operations as the package Containers.Hashed_Maps (see *note A.18.5::),
with the difference that the generic formal types Key_Type and
@@ -94375,9 +94697,10 @@ Element_Type are indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Hashed_Maps has the
-same contents and semantics as Containers.Hashed_Maps except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package
+Containers.Indefinite_Hashed_Maps has the same contents and semantics as
+Containers.Hashed_Maps except:
3/2
* The generic formal Key_Type is indefinite.
@@ -94414,7 +94737,7 @@ same contents and semantics as Containers.Hashed_Maps
except:
unconstrained.
9/4
- * {AI12-0035-1AI12-0035-1} The operations Include, Insert, Replace,
+ * {<AI12-0035-1AI12-0035-1>} The operations Include, Insert, Replace,
and Replace_Element that have a formal parameter of type
Element_Type perform indefinite insertion (see *note A.18::).
@@ -94427,14 +94750,14 @@ same contents and semantics as Containers.Hashed_Maps
except:
_Extensions to Ada 95_
9.b/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Hashed_Maps is new.
_Inconsistencies With Ada 2012_
9.c/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94447,7 +94770,7 @@ A.18.14 The Generic Package
Containers.Indefinite_Ordered_Maps
--------------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Ordered_Maps provides a map with the same
operations as the package Containers.Ordered_Maps (see *note A.18.6::),
with the difference that the generic formal types Key_Type and
@@ -94456,9 +94779,10 @@ Element_Type are indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Ordered_Maps has the
-same contents and semantics as Containers.Ordered_Maps except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package
+Containers.Indefinite_Ordered_Maps has the same contents and semantics
+as Containers.Ordered_Maps except:
3/2
* The generic formal Key_Type is indefinite.
@@ -94495,7 +94819,7 @@ same contents and semantics as Containers.Ordered_Maps
except:
unconstrained.
9/4
- * {AI12-0035-1AI12-0035-1} The operations Include, Insert, Replace,
+ * {<AI12-0035-1AI12-0035-1>} The operations Include, Insert, Replace,
and Replace_Element that have a formal parameter of type
Element_Type perform indefinite insertion (see *note A.18::).
@@ -94508,14 +94832,14 @@ same contents and semantics as
Containers.Ordered_Maps except:
_Extensions to Ada 95_
9.b/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Ordered_Maps is new.
_Inconsistencies With Ada 2012_
9.c/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94528,7 +94852,7 @@ A.18.15 The Generic Package
Containers.Indefinite_Hashed_Sets
-------------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Hashed_Sets provides a set with the same
operations as the package Containers.Hashed_Sets (see *note A.18.8::),
with the difference that the generic formal type Element_Type is
@@ -94537,9 +94861,10 @@ indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Hashed_Sets has the
-same contents and semantics as Containers.Hashed_Sets except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package
+Containers.Indefinite_Hashed_Sets has the same contents and semantics as
+Containers.Hashed_Sets except:
3/2
* The generic formal Element_Type is indefinite.
@@ -94550,7 +94875,7 @@ same contents and semantics as Containers.Hashed_Sets
except:
Element_Type is unconstrained.
5/4
- * {AI12-0035-1AI12-0035-1} The operations Include, Insert, Replace,
+ * {<AI12-0035-1AI12-0035-1>} The operations Include, Insert, Replace,
Replace_Element, and To_Set that have a formal parameter of type
Element_Type perform indefinite insertion (see *note A.18::).
@@ -94563,14 +94888,14 @@ same contents and semantics as Containers.Hashed_Sets
except:
_Extensions to Ada 95_
5.b/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Hashed_Sets is new.
_Inconsistencies With Ada 2012_
5.c/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94583,7 +94908,7 @@ A.18.16 The Generic Package
Containers.Indefinite_Ordered_Sets
--------------------------------------------------------------
1/2
-{AI95-00302-03AI95-00302-03} The language-defined generic package
+{<AI95-00302-03AI95-00302-03>} The language-defined generic package
Containers.Indefinite_Ordered_Sets provides a set with the same
operations as the package Containers.Ordered_Sets (see *note A.18.9::),
with the difference that the generic formal type Element_Type is
@@ -94592,9 +94917,10 @@ indefinite.
_Static Semantics_
2/3
-{AI95-00302-03AI95-00302-03} {AI05-0092-1AI05-0092-1} The declaration of
-the generic library package Containers.Indefinite_Ordered_Sets has the
-same contents and semantics as Containers.Ordered_Sets except:
+{<AI95-00302-03AI95-00302-03>} {<AI05-0092-1AI05-0092-1>} The
+declaration of the generic library package
+Containers.Indefinite_Ordered_Sets has the same contents and semantics
+as Containers.Ordered_Sets except:
3/2
* The generic formal Element_Type is indefinite.
@@ -94605,7 +94931,7 @@ same contents and semantics as Containers.Ordered_Sets
except:
Element_Type is unconstrained.
5/4
- * {AI12-0035-1AI12-0035-1} The operations Include, Insert, Replace,
+ * {<AI12-0035-1AI12-0035-1>} The operations Include, Insert, Replace,
Replace_Element, and To_Set that have a formal parameter of type
Element_Type perform indefinite insertion (see *note A.18::).
@@ -94618,14 +94944,14 @@ same contents and semantics as
Containers.Ordered_Sets except:
_Extensions to Ada 95_
5.b/2
- {AI95-00302-03AI95-00302-03} The generic package
+ {<AI95-00302-03AI95-00302-03>} The generic package
Containers.Indefinite_Ordered_Sets is new.
_Inconsistencies With Ada 2012_
5.c/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94638,7 +94964,7 @@ A.18.17 The Generic Package
Containers.Indefinite_Multiway_Trees
----------------------------------------------------------------
1/3
-{AI05-0136-1AI05-0136-1} The language-defined generic package
+{<AI05-0136-1AI05-0136-1>} The language-defined generic package
Containers.Indefinite_Multiway_Trees provides a multiway tree with the
same operations as the package Containers.Multiway_Trees (see *note
A.18.10::), with the difference that the generic formal Element_Type is
@@ -94647,9 +94973,9 @@ indefinite.
_Static Semantics_
2/3
-{AI05-0136-1AI05-0136-1} The declaration of the generic library package
-Containers.Indefinite_Multiway_Trees has the same contents and semantics
-as Containers.Multiway_Trees except:
+{<AI05-0136-1AI05-0136-1>} The declaration of the generic library
+package Containers.Indefinite_Multiway_Trees has the same contents and
+semantics as Containers.Multiway_Trees except:
3/3
* The generic formal Element_Type is indefinite.
@@ -94684,21 +95010,22 @@ as Containers.Multiway_Trees except:
unconstrained.
8/4
- * {AI12-0035-1AI12-0035-1} The operations Append_Child, Insert_Child,
- Prepend_Child, and Replace_Element that have a formal parameter of
- type Element_Type perform indefinite insertion (see *note A.18::).
+ * {<AI12-0035-1AI12-0035-1>} The operations Append_Child,
+ Insert_Child, Prepend_Child, and Replace_Element that have a formal
+ parameter of type Element_Type perform indefinite insertion (see
+ *note A.18::).
_Extensions to Ada 2005_
8.a/3
- {AI05-0136-1AI05-0136-1} The generic package
+ {<AI05-0136-1AI05-0136-1>} The generic package
Containers.Indefinite_Multiway_Trees is new.
_Inconsistencies With Ada 2012_
8.b/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -94711,28 +95038,28 @@ A.18.18 The Generic Package
Containers.Indefinite_Holders
---------------------------------------------------------
1/3
-{AI05-0069-1AI05-0069-1} The language-defined generic package
+{<AI05-0069-1AI05-0069-1>} The language-defined generic package
Containers.Indefinite_Holders provides a private type Holder and a set
of operations for that type. A holder container holds a single element
of an indefinite type.
2/3
-{AI05-0069-1AI05-0069-1} A holder container allows the declaration of an
-object that can be used like an uninitialized variable or component of
-an indefinite type.
+{<AI05-0069-1AI05-0069-1>} A holder container allows the declaration of
+an object that can be used like an uninitialized variable or component
+of an indefinite type.
3/3
-{AI05-0069-1AI05-0069-1} A holder container may be empty. An empty
+{<AI05-0069-1AI05-0069-1>} A holder container may be <empty>. An empty
holder does not contain an element.
_Static Semantics_
4/3
-{AI05-0069-1AI05-0069-1} The generic library package
+{<AI05-0069-1AI05-0069-1>} The generic library package
Containers.Indefinite_Holders has the following declaration:
5/3
- {AI05-0069-1AI05-0069-1} {AI05-0084-1AI05-0084-1} generic
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0084-1AI05-0084-1>} generic
type Element_Type (<>) is private;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Indefinite_Holders is
@@ -94771,32 +95098,32 @@ Containers.Indefinite_Holders has the following
declaration:
Process : not null access procedure (Element : in Element_Type));
15/3
- {AI05-0069-1AI05-0069-1} {AI05-0248-1AI05-0248-1} procedure
Update_Element
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0248-1AI05-0248-1>} procedure
Update_Element
(Container : in out Holder;
Process : not null access procedure (Element : in out Element_Type));
16/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
17/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null
access Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null
access Element_Type) is private
with Implicit_Dereference => Element;
18/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container :
aliased in Holder)
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Holder)
return Constant_Reference_Type;
19/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in
out Holder)
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in
out Holder)
return Reference_Type;
20/3
- {AI05-0001-1AI05-0001-1} procedure Assign (Target : in out Holder;
Source : in Holder);
+ {<AI05-0001-1AI05-0001-1>} procedure Assign (Target : in out Holder;
Source : in Holder);
21/3
- {AI05-0001-1AI05-0001-1} function Copy (Source : Holder) return Holder;
+ {<AI05-0001-1AI05-0001-1>} function Copy (Source : Holder) return
Holder;
22/3
procedure Move (Target : in out Holder; Source : in out Holder);
@@ -94805,13 +95132,13 @@ Containers.Indefinite_Holders has the following
declaration:
private
24/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
25/3
end Ada.Containers.Indefinite_Holders;
26/3
-{AI05-0069-1AI05-0069-1} The actual function for the generic formal
+{<AI05-0069-1AI05-0069-1>} The actual function for the generic formal
function "=" on Element_Type values is expected to define a reflexive
and symmetric relationship and return the same result value each time it
is called with a particular pair of values. If it behaves in some other
@@ -94830,39 +95157,39 @@ by the function "=" on holder values are unspecified.
subprograms are not allowed to break if "=" is bad.
27/3
-{AI05-0069-1AI05-0069-1} The type Holder is used to represent holder
+{<AI05-0069-1AI05-0069-1>} The type Holder is used to represent holder
containers. The type Holder needs finalization (see *note 7.6::).
28/3
-{AI05-0069-1AI05-0069-1} Empty_Holder represents an empty holder object.
-If an object of type Holder is not otherwise initialized, it is
+{<AI05-0069-1AI05-0069-1>} Empty_Holder represents an empty holder
+object. If an object of type Holder is not otherwise initialized, it is
initialized to the same value as Empty_Holder.
29/3
-{AI05-0069-1AI05-0069-1} {AI05-0262-1AI05-0262-1} [Some operations of
-this generic package have access-to-subprogram parameters. To ensure
+{<AI05-0069-1AI05-0069-1>} {<AI05-0262-1AI05-0262-1>} [Some operations
+of this generic package have access-to-subprogram parameters. To ensure
such operations are well-defined, they guard against certain actions by
the designated subprogram. In particular, some operations check for
"tampering with the element" of a container because they depend on the
element of the container not being replaced.]
30/3
-{AI05-0069-1AI05-0069-1} {AI05-0262-1AI05-0262-1} A subprogram is said
-to tamper with the element of a holder object H if:
+{<AI05-0069-1AI05-0069-1>} {<AI05-0262-1AI05-0262-1>} A subprogram is
+said to <tamper with the element> of a holder object <H> if:
31/3
- * It clears the element contained by H, that is, it calls the Clear
- procedure with H as a parameter;
+ * It clears the element contained by <H>, that is, it calls the Clear
+ procedure with <H> as a parameter;
32/3
- * It replaces the element contained by H, that is, it calls the
- Replace_Element procedure with H as a parameter;
+ * It replaces the element contained by <H>, that is, it calls the
+ Replace_Element procedure with <H> as a parameter;
33/3
- * It calls the Move procedure with H as a parameter;
+ * It calls the Move procedure with <H> as a parameter;
34/3
- * It finalizes H.
+ * It finalizes <H>.
34.a/3
Reason: Complete replacement of an element can cause its
@@ -94872,18 +95199,18 @@ to tamper with the element of a holder object H if:
so Update_Element does not cause a problem.
35/4
-{AI05-0265-1AI05-0265-1} {AI12-0110-1AI12-0110-1} When tampering with
-the element is prohibited for a particular holder object H,
+{<AI05-0265-1AI05-0265-1>} {<AI12-0110-1AI12-0110-1>} When tampering
+with the element is <prohibited> for a particular holder object <H>,
Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the element of H, leaving H unmodified.
-These checks are made before any other defined behavior of the body of
-the language-defined subprogram.
+that is defined to tamper with the element of <H>, leaving <H>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
36/3
function "=" (Left, Right : Holder) return Boolean;
37/3
- {AI05-0069-1AI05-0069-1} If Left and Right denote the same
+ {<AI05-0069-1AI05-0069-1>} If Left and Right denote the same
holder object, then the function returns True. Otherwise, it
compares the element contained in Left to the element
contained in Right using the generic formal equality operator,
@@ -94901,29 +95228,30 @@ the language-defined subprogram.
function To_Holder (New_Item : Element_Type) return Holder;
39/4
- {AI05-0069-1AI05-0069-1} {AI12-0035-1AI12-0035-1} Returns a
- nonempty holder containing an element initialized to New_Item.
- To_Holder performs indefinite insertion (see *note A.18::).
+ {<AI05-0069-1AI05-0069-1>} {<AI12-0035-1AI12-0035-1>} Returns
+ a nonempty holder containing an element initialized to
+ New_Item. To_Holder performs indefinite insertion (see *note
+ A.18::).
40/3
function Is_Empty (Container : Holder) return Boolean;
41/3
- {AI05-0069-1AI05-0069-1} Returns True if Container is empty,
+ {<AI05-0069-1AI05-0069-1>} Returns True if Container is empty,
and False if it contains an element.
42/3
procedure Clear (Container : in out Holder);
43/3
- {AI05-0069-1AI05-0069-1} Removes the element from Container.
+ {<AI05-0069-1AI05-0069-1>} Removes the element from Container.
Container is empty after a successful Clear operation.
44/3
function Element (Container : Holder) return Element_Type;
45/3
- {AI05-0069-1AI05-0069-1} If Container is empty,
+ {<AI05-0069-1AI05-0069-1>} If Container is empty,
Constraint_Error is propagated. Otherwise, returns the
element stored in Container.
@@ -94932,7 +95260,7 @@ the language-defined subprogram.
New_Item : in Element_Type);
47/4
- {AI05-0069-1AI05-0069-1} {AI12-0035-1AI12-0035-1}
+ {<AI05-0069-1AI05-0069-1>} {<AI12-0035-1AI12-0035-1>}
Replace_Element assigns the value New_Item into Container,
replacing any preexisting content of Container;
Replace_Element performs indefinite insertion (see *note
@@ -94945,8 +95273,8 @@ the language-defined subprogram.
Process : not null access procedure (Element : in Element_Type));
49/3
- {AI05-0069-1AI05-0069-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} If Container is empty,
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} If Container is empty,
Constraint_Error is propagated. Otherwise, Query_Element
calls Process.all with the contained element as the argument.
Tampering with the element of Container is prohibited during
@@ -94954,21 +95282,21 @@ the language-defined subprogram.
raised by Process.all is propagated.
49.a/3
- Implementation Note: {AI05-0005-1AI05-0005-1} The "tamper with
- the element" check is intended to prevent the Element
+ Implementation Note: {<AI05-0005-1AI05-0005-1>} The "tamper
+ with the element" check is intended to prevent the Element
parameter of Process from being replaced or deleted outside of
Process. The check prevents data loss (if Element_Type is
passed by copy) or erroneous execution (if Element_Type is an
unconstrained type).
50/3
- {AI05-0069-1AI05-0069-1} {AI05-0248-1AI05-0248-1} procedure Update_Element
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0248-1AI05-0248-1>} procedure
Update_Element
(Container : in out Holder;
Process : not null access procedure (Element : in out Element_Type));
51/3
- {AI05-0069-1AI05-0069-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} If Container is empty,
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} If Container is empty,
Constraint_Error is propagated. Otherwise, Update_Element
calls Process.all with the contained element as the argument.
Tampering with the element of Container is prohibited during
@@ -94980,20 +95308,20 @@ the language-defined subprogram.
be constrained even if Element_Type is unconstrained.
52/3
- {AI05-0212-1AI05-0212-1} type Constant_Reference_Type
+ {<AI05-0212-1AI05-0212-1>} type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
53/3
- {AI05-0212-1AI05-0212-1} type Reference_Type (Element : not null access
Element_Type) is private
+ {<AI05-0212-1AI05-0212-1>} type Reference_Type (Element : not null access
Element_Type) is private
with Implicit_Dereference => Element;
54/3
- {AI05-0212-1AI05-0212-1} The types Constant_Reference_Type and
- Reference_Type need finalization.
+ {<AI05-0212-1AI05-0212-1>} The types Constant_Reference_Type
+ and Reference_Type need finalization.
55/3
- {AI05-0212-1AI05-0212-1} The default initialization of an
+ {<AI05-0212-1AI05-0212-1>} The default initialization of an
object of type Constant_Reference_Type or Reference_Type
propagates Program_Error.
@@ -95007,17 +95335,17 @@ the language-defined subprogram.
work, we define it to raise an exception.
56/3
- {AI05-0212-1AI05-0212-1} function Constant_Reference (Container : aliased
in Holder)
+ {<AI05-0212-1AI05-0212-1>} function Constant_Reference (Container :
aliased in Holder)
return Constant_Reference_Type;
57/3
- {AI05-0212-1AI05-0212-1} This function (combined with the
+ {<AI05-0212-1AI05-0212-1>} This function (combined with the
Implicit_Dereference aspect) provides a convenient way to gain
read access to the contained element of a holder container.
58/3
- {AI05-0212-1AI05-0212-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} If Container is empty,
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} If Container is empty,
Constraint_Error is propagated. Otherwise, Constant_Reference
returns an object whose discriminant is an access value that
designates the contained element. Tampering with the elements
@@ -95025,18 +95353,18 @@ the language-defined subprogram.
Constant_Reference exists and has not been finalized.
59/3
- {AI05-0212-1AI05-0212-1} function Reference (Container : aliased in out
Holder)
+ {<AI05-0212-1AI05-0212-1>} function Reference (Container : aliased in out
Holder)
return Reference_Type;
60/3
- {AI05-0212-1AI05-0212-1} This function (combined with the
+ {<AI05-0212-1AI05-0212-1>} This function (combined with the
Implicit_Dereference aspects) provides a convenient way to
gain read and write access to the contained element of a
holder container.
61/3
- {AI05-0212-1AI05-0212-1} {AI05-0262-1AI05-0262-1}
- {AI05-0265-1AI05-0265-1} If Container is empty,
+ {<AI05-0212-1AI05-0212-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0265-1AI05-0265-1>} If Container is empty,
Constraint_Error is propagated. Otherwise, Reference returns
an object whose discriminant is an access value that
designates the contained element. Tampering with the elements
@@ -95047,13 +95375,13 @@ the language-defined subprogram.
procedure Assign (Target : in out Holder; Source : in Holder);
63/3
- {AI05-0001-1AI05-0001-1} If Target denotes the same object as
- Source, the operation has no effect. If Source is empty,
+ {<AI05-0001-1AI05-0001-1>} If Target denotes the same object
+ as Source, the operation has no effect. If Source is empty,
Clear (Target) is called. Otherwise, Replace_Element (Target,
Element (Source)) is called.
63.a/3
- Discussion: {AI05-0005-1AI05-0005-1} This routine exists for
+ Discussion: {<AI05-0005-1AI05-0005-1>} This routine exists for
compatibility with the other containers. For a holder,
Assign(A, B) and A := B behave effectively the same. (Assign
Clears the Target, while := finalizes the Target, but these
@@ -95063,36 +95391,36 @@ the language-defined subprogram.
function Copy (Source : Holder) return Holder;
65/3
- {AI05-0001-1AI05-0001-1} If Source is empty, returns an empty
- holder container; otherwise, returns To_Holder (Element
+ {<AI05-0001-1AI05-0001-1>} If Source is empty, returns an
+ empty holder container; otherwise, returns To_Holder (Element
(Source)).
66/3
procedure Move (Target : in out Holder; Source : in out Holder);
67/3
- {AI05-0069-1AI05-0069-1} {AI05-0248-1AI05-0248-1} If Target
- denotes the same object as Source, then the operation has no
- effect. Otherwise, the element contained by Source (if any)
- is removed from Source and inserted into Target, replacing any
- preexisting content. Source is empty after a successful call
- to Move.
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0248-1AI05-0248-1>} If
+ Target denotes the same object as Source, then the operation
+ has no effect. Otherwise, the element contained by Source (if
+ any) is removed from Source and inserted into Target,
+ replacing any preexisting content. Source is empty after a
+ successful call to Move.
_Bounded (Run-Time) Errors_
68/3
-{AI05-0022-1AI05-0022-1} {AI05-0069-1AI05-0069-1}
-{AI05-0248-1AI05-0248-1} {AI05-0262-1AI05-0262-1} It is a bounded error
-for the actual function associated with a generic formal subprogram,
-when called as part of an operation of this package, to tamper with the
-element of any Holder parameter of the operation. Either Program_Error
-is raised, or the operation works as defined on the value of the Holder
-either prior to, or subsequent to, some or all of the modifications to
-the Holder.
+{<AI05-0022-1AI05-0022-1>} {<AI05-0069-1AI05-0069-1>}
+{<AI05-0248-1AI05-0248-1>} {<AI05-0262-1AI05-0262-1>} It is a bounded
+error for the actual function associated with a generic formal
+subprogram, when called as part of an operation of this package, to
+tamper with the element of any Holder parameter of the operation.
+Either Program_Error is raised, or the operation works as defined on the
+value of the Holder either prior to, or subsequent to, some or all of
+the modifications to the Holder.
69/3
-{AI05-0027-1AI05-0027-1} {AI05-0069-1AI05-0069-1} It is a bounded error
-to call any subprogram declared in the visible part of
+{<AI05-0027-1AI05-0027-1>} {<AI05-0069-1AI05-0069-1>} It is a bounded
+error to call any subprogram declared in the visible part of
Containers.Indefinite_Holders when the associated container has been
finalized. If the operation takes Container as an in out parameter,
then it raises Constraint_Error or Program_Error. Otherwise, the
@@ -95102,16 +95430,16 @@ raises Constraint_Error or Program_Error.
_Erroneous Execution_
70/3
-{AI05-0212-1AI05-0212-1} {AI05-0269-1AI05-0269-1} Execution is erroneous
-if the holder container associated with the result of a call to
-Reference or Constant_Reference is finalized before the result object
+{<AI05-0212-1AI05-0212-1>} {<AI05-0269-1AI05-0269-1>} Execution is
+erroneous if the holder container associated with the result of a call
+to Reference or Constant_Reference is finalized before the result object
returned by the call to Reference or Constant_Reference is finalized.
70.a/3
- Reason: {AI05-0212-1AI05-0212-1} Each object of Reference_Type
- and Constant_Reference_Type probably contains some reference
- to the originating container. If that container is
- prematurely finalized (which is only possible via
+ Reason: {<AI05-0212-1AI05-0212-1>} Each object of
+ Reference_Type and Constant_Reference_Type probably contains
+ some reference to the originating container. If that
+ container is prematurely finalized (which is only possible via
Unchecked_Deallocation, as accessibility checks prevent
passing a container to Reference that will not live as long as
the result), the finalization of the object of Reference_Type
@@ -95125,18 +95453,18 @@ returned by the call to Reference or
Constant_Reference is finalized.
_Implementation Requirements_
71/3
-{AI05-0069-1AI05-0069-1} No storage associated with a holder object
+{<AI05-0069-1AI05-0069-1>} No storage associated with a holder object
shall be lost upon assignment or scope exit.
72/3
-{AI05-0069-1AI05-0069-1} {AI05-0269-1AI05-0269-1} The execution of an
-assignment_statement for a holder container shall have the effect of
+{<AI05-0069-1AI05-0069-1>} {<AI05-0269-1AI05-0269-1>} The execution of
+an assignment_statement for a holder container shall have the effect of
copying the element (if any) from the source holder object to the target
holder object.
72.a/3
- Implementation Note: {AI05-0298-1AI05-0298-1} An assignment of
- a holder container is a "deep" copy; that is the element is
+ Implementation Note: {<AI05-0298-1AI05-0298-1>} An assignment
+ of a holder container is a "deep" copy; that is the element is
copied as well as any data structures. We say "effect of" in
order to allow the implementation to avoid copying the element
immediately if it wishes. For instance, an implementation
@@ -95147,8 +95475,9 @@ holder object.
_Implementation Advice_
73/3
-{AI05-0069-1AI05-0069-1} {AI05-0269-1AI05-0269-1} Move should not copy
-the element, and should minimize copying of internal data structures.
+{<AI05-0069-1AI05-0069-1>} {<AI05-0269-1AI05-0269-1>} Move should not
+copy the element, and should minimize copying of internal data
+structures.
73.a.1/3
Implementation Advice: Containers.Indefinite_Holders.Move
@@ -95161,7 +95490,7 @@ the element, and should minimize copying of internal
data structures.
the Source holder to the Target holder.
74/3
-{AI05-0069-1AI05-0069-1} {AI05-0269-1AI05-0269-1} If an exception is
+{<AI05-0069-1AI05-0069-1>} {<AI05-0269-1AI05-0269-1>} If an exception is
propagated from a holder operation, no storage should be lost, nor
should the element be removed from a holder container unless specified
by the operation.
@@ -95181,15 +95510,15 @@ by the operation.
_Extensions to Ada 2005_
74.b/3
- {AI05-0069-1AI05-0069-1} {AI05-0084-1AI05-0084-1}
- {AI05-0265-1AI05-0265-1} The generic package
+ {<AI05-0069-1AI05-0069-1>} {<AI05-0084-1AI05-0084-1>}
+ {<AI05-0265-1AI05-0265-1>} The generic package
Containers.Indefinite_Holders is new.
_Inconsistencies With Ada 2012_
74.c/4
- {AI12-0035-1AI12-0035-1} Corrigendum: Defined some routines to
- "perform indefinite insertion". This could mean that some
+ {<AI12-0035-1AI12-0035-1>} Corrigendum: Defined some routines
+ to "perform indefinite insertion". This could mean that some
calls to those routines would now raise Program_Error where
they previously worked. However, this is extremely unlikely;
see Inconsistencies With Ada 2012 in *note A.18.11:: for
@@ -95198,9 +95527,9 @@ by the operation.
_Wording Changes from Ada 2012_
74.d/4
- {AI12-0110-1AI12-0110-1} Corrigendum: Clarified that tampering
- checks precede all other checks made by a subprogram (but come
- after those associated with the call).
+ {<AI12-0110-1AI12-0110-1>} Corrigendum: Clarified that
+ tampering checks precede all other checks made by a subprogram
+ (but come after those associated with the call).
File: aarm2012.info, Node: A.18.19, Next: A.18.20, Prev: A.18.18, Up: A.18
@@ -95209,7 +95538,7 @@ A.18.19 The Generic Package Containers.Bounded_Vectors
------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-0001-1>} The language-defined generic package
Containers.Bounded_Vectors provides a private type Vector and a set of
operations. It provides the same operations as the package
Containers.Vectors (see *note A.18.2::), with the difference that the
@@ -95218,9 +95547,9 @@ maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Vectors has the same contents and semantics as
-Containers.Vectors except:
+{<AI05-0001-1AI05-0001-1>} The declaration of the generic library
+package Containers.Bounded_Vectors has the same contents and semantics
+as Containers.Vectors except:
3/3
* The pragma Preelaborate is replaced with pragma Pure.
@@ -95237,12 +95566,12 @@ Containers.Vectors except:
needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Vector
- 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.
+ Implementation Note: {<AI05-0212-1AI05-0212-1>} The type
+ Vector 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.
7/3
* In function Copy, if the Capacity parameter is equal to or greater
@@ -95260,11 +95589,12 @@ Containers.Vectors except:
_Bounded (Run-Time) Errors_
10/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-0265-1} It is a bounded error
-to assign from a bounded vector 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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-0265-1>} It is a bounded
+error to assign from a bounded vector 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.
10.a/3
Proof: Tampering with elements includes tampering with
@@ -95274,9 +95604,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
11/3
-{AI05-0265-1AI05-0265-1} When a bounded vector object V is finalized, if
-tampering with cursors is prohibited for V other than due to an
-assignment from another vector, then execution is erroneous.
+{<AI05-0265-1AI05-0265-1>} When a bounded vector object <V> is
+finalized, if tampering with cursors is prohibited for <V> other than
+due to an assignment from another vector, then execution is erroneous.
11.a/3
Reason: This is a tampering event, but since the
@@ -95294,33 +95624,33 @@ assignment from another vector, then execution is
erroneous.
_Implementation Requirements_
12/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Vectors and each instance of Containers.Bounded_Vectors, if
-the two instances meet the following conditions, then the output
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-0264-1>} For each instance
+of Containers.Vectors and each instance of Containers.Bounded_Vectors,
+if the two instances meet the following conditions, then the output
generated by the Vector'Output or Vector'Write subprograms of either
instance shall be readable by the Vector'Input or Vector'Read of the
other instance, respectively:
13/3
- * {AI05-0184-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
14/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
15/3
- * {AI05-0184-1AI05-0184-1} the preceding two conditions also hold for
- the Index_Type parameters of the instances.
+ * {<AI05-0184-1AI05-0184-1>} the preceding two conditions also hold
+ for the Index_Type parameters of the instances.
_Implementation Advice_
16/3
-{AI05-0001-1AI05-0001-1} Bounded vector objects should be implemented
+{<AI05-0001-1AI05-0001-1>} Bounded vector objects should be implemented
without implicit pointers or dynamic allocation.
16.a.1/3
@@ -95328,8 +95658,8 @@ without implicit pointers or dynamic allocation.
implemented without implicit pointers or dynamic allocation.
17/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-0001-1>} The implementation advice for procedure Move
+to minimize copying does not apply.
17.a.1/3
Implementation Advice: The implementation advice for procedure
@@ -95338,8 +95668,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
17.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Vectors is new.
@@ -95349,7 +95679,7 @@ A.18.20 The Generic Package
Containers.Bounded_Doubly_Linked_Lists
------------------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-0001-1>} The language-defined generic package
Containers.Bounded_Doubly_Linked_Lists provides a private type List and
a set of operations. It provides the same operations as the package
Containers.Doubly_Linked_Lists (see *note A.18.3::), with the difference
@@ -95358,8 +95688,8 @@ that the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Doubly_Linked_Lists has the same contents and
+{<AI05-0001-1AI05-0001-1>} The declaration of the generic library
+package Containers.Bounded_Doubly_Linked_Lists has the same contents and
semantics as Containers.Doubly_Linked_Lists except:
3/3
@@ -95377,7 +95707,7 @@ semantics as Containers.Doubly_Linked_Lists except:
needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type List
+ Implementation Note: {<AI05-0212-1AI05-0212-1>} The type List
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
@@ -95420,11 +95750,12 @@ semantics as Containers.Doubly_Linked_Lists except:
_Bounded (Run-Time) Errors_
14/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-0265-1} It is a bounded error
-to assign from a bounded list 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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-0265-1>} It is a bounded
+error to assign from a bounded list 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.
14.a/3
Proof: Tampering with elements includes tampering with
@@ -95434,9 +95765,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
15/3
-{AI05-0265-1AI05-0265-1} When a bounded list object L is finalized, if
-tampering with cursors is prohibited for L other than due to an
-assignment from another list, then execution is erroneous.
+{<AI05-0265-1AI05-0265-1>} When a bounded list object <L> is finalized,
+if tampering with cursors is prohibited for <L> other than due to an
+assignment from another list, then execution is erroneous.
15.a/3
Reason: This is a tampering event, but since the
@@ -95454,20 +95785,20 @@ assignment from another list, then execution is
erroneous.
_Implementation Requirements_
16/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Doubly_Linked_Lists and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-0264-1>} For each instance
+of Containers.Doubly_Linked_Lists and each instance of
Containers.Bounded_Doubly_Linked_Lists, if the two instances meet the
following conditions, then the output generated by the List'Output or
List'Write subprograms of either instance shall be readable by the
List'Input or List'Read of the other instance, respectively:
17/3
- * {AI05-0184-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
18/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
@@ -95476,7 +95807,7 @@ List'Input or List'Read of the other instance,
respectively:
_Implementation Advice_
19/3
-{AI05-0001-1AI05-0001-1} Bounded list objects should be implemented
+{<AI05-0001-1AI05-0001-1>} Bounded list objects should be implemented
without implicit pointers or dynamic allocation.
19.a.1/3
@@ -95484,8 +95815,8 @@ without implicit pointers or dynamic allocation.
implemented without implicit pointers or dynamic allocation.
20/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-0001-1>} The implementation advice for procedure Move
+to minimize copying does not apply.
20.a.1/3
Implementation Advice: The implementation advice for procedure
@@ -95494,8 +95825,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
20.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Doubly_Linked_Lists is new.
@@ -95505,7 +95836,7 @@ A.18.21 The Generic Package
Containers.Bounded_Hashed_Maps
----------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-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 *note A.18.5::), with the difference that
@@ -95514,9 +95845,9 @@ the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Hashed_Maps has the same contents and semantics as
-Containers.Hashed_Maps except:
+{<AI05-0001-1AI05-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.
@@ -95535,7 +95866,7 @@ Containers.Hashed_Maps except:
type Element_Type needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Map
+ Implementation Note: {<AI05-0212-1AI05-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
@@ -95571,25 +95902,26 @@ Containers.Hashed_Maps except:
Modulus : Hash_Type := 0) return Map;
14/3
- {AI05-0264-1AI05-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;
+ {<AI05-0264-1AI05-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-1AI05-0160-1} {AI05-0265-1AI05-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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-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
@@ -95599,9 +95931,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
16/3
-{AI05-0265-1AI05-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.
+{<AI05-0265-1AI05-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
@@ -95619,33 +95951,33 @@ assignment from another map, then execution is
erroneous.
_Implementation Requirements_
17/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Hashed_Maps and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-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-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
19/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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-1AI05-0184-1} the preceding two conditions also hold for
- the Key_Type parameters of the instances.
+ * {<AI05-0184-1AI05-0184-1>} the preceding two conditions also hold
+ for the Key_Type parameters of the instances.
_Implementation Advice_
21/3
-{AI05-0001-1AI05-0001-1} {AI05-0269-1AI05-0269-1} Bounded hashed map
+{<AI05-0001-1AI05-0001-1>} {<AI05-0269-1AI05-0269-1>} Bounded hashed map
objects should be implemented without implicit pointers or dynamic
allocation.
@@ -95654,8 +95986,8 @@ allocation.
implemented without implicit pointers or dynamic allocation.
22/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-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
@@ -95665,8 +95997,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
22.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Hashed_Maps is new.
@@ -95676,7 +96008,7 @@ A.18.22 The Generic Package
Containers.Bounded_Ordered_Maps
-----------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-0001-1>} The language-defined generic package
Containers.Bounded_Ordered_Maps provides a private type Map and a set of
operations. It provides the same operations as the package
Containers.Ordered_Maps (see *note A.18.6::), with the difference that
@@ -95685,9 +96017,9 @@ the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Ordered_Maps has the same contents and semantics as
-Containers.Ordered_Maps except:
+{<AI05-0001-1AI05-0001-1>} The declaration of the generic library
+package Containers.Bounded_Ordered_Maps has the same contents and
+semantics as Containers.Ordered_Maps except:
3/3
* The pragma Preelaborate is replaced with pragma Pure.
@@ -95704,7 +96036,7 @@ Containers.Ordered_Maps except:
type Element_Type needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Map
+ Implementation Note: {<AI05-0212-1AI05-0212-1>} The type Map
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
@@ -95736,11 +96068,12 @@ Containers.Ordered_Maps except:
_Bounded (Run-Time) Errors_
12/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-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.
12.a/3
Proof: Tampering with elements includes tampering with
@@ -95750,9 +96083,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
13/3
-{AI05-0265-1AI05-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.
+{<AI05-0265-1AI05-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.
13.a/3
Reason: This is a tampering event, but since the
@@ -95770,34 +96103,34 @@ assignment from another map, then execution is
erroneous.
_Implementation Requirements_
14/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Ordered_Maps and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-0264-1>} For each instance
+of Containers.Ordered_Maps and each instance of
Containers.Bounded_Ordered_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:
15/3
- * {AI05-0184-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
16/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
17/3
- * {AI05-0184-1AI05-0184-1} the preceding two conditions also hold for
- the Key_Type parameters of the instances.
+ * {<AI05-0184-1AI05-0184-1>} the preceding two conditions also hold
+ for the Key_Type parameters of the instances.
_Implementation Advice_
18/3
-{AI05-0001-1AI05-0001-1} {AI05-0269-1AI05-0269-1} Bounded ordered map
-objects should be implemented without implicit pointers or dynamic
+{<AI05-0001-1AI05-0001-1>} {<AI05-0269-1AI05-0269-1>} Bounded ordered
+map objects should be implemented without implicit pointers or dynamic
allocation.
18.a.1/3
@@ -95805,8 +96138,8 @@ allocation.
implemented without implicit pointers or dynamic allocation.
19/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-0001-1>} The implementation advice for procedure Move
+to minimize copying does not apply.
19.a.1/3
Implementation Advice: The implementation advice for procedure
@@ -95816,8 +96149,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
19.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Ordered_Maps is new.
@@ -95827,7 +96160,7 @@ A.18.23 The Generic Package
Containers.Bounded_Hashed_Sets
----------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-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 *note A.18.8::), with the difference that
@@ -95836,9 +96169,9 @@ the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Hashed_Sets has the same contents and semantics as
-Containers.Hashed_Sets except:
+{<AI05-0001-1AI05-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
* The pragma Preelaborate is replaced with pragma Pure.
@@ -95857,7 +96190,7 @@ Containers.Hashed_Sets except:
needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Set
+ Implementation Note: {<AI05-0212-1AI05-0212-1>} The type Set
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
@@ -95893,7 +96226,7 @@ Containers.Hashed_Sets except:
Modulus : Hash_Type := 0) return Set;
14/3
- {AI05-0264-1AI05-0264-1} Returns a set whose elements are
+ {<AI05-0264-1AI05-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
@@ -95907,11 +96240,12 @@ Containers.Hashed_Sets except:
_Bounded (Run-Time) Errors_
15/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-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.
15.a/3
Proof: Tampering with elements includes tampering with
@@ -95921,9 +96255,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
16/3
-{AI05-0265-1AI05-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.
+{<AI05-0265-1AI05-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.
16.a/3
Reason: This is a tampering event, but since the
@@ -95941,20 +96275,20 @@ assignment from another set, then execution is
erroneous.
_Implementation Requirements_
17/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Hashed_Sets and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-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:
18/3
- * {AI05-0184-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
19/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
@@ -95963,7 +96297,7 @@ Set'Read of the other instance, respectively:
_Implementation Advice_
20/3
-{AI05-0001-1AI05-0001-1} {AI05-0269-1AI05-0269-1} Bounded hashed set
+{<AI05-0001-1AI05-0001-1>} {<AI05-0269-1AI05-0269-1>} Bounded hashed set
objects should be implemented without implicit pointers or dynamic
allocation.
@@ -95972,8 +96306,8 @@ allocation.
implemented without implicit pointers or dynamic allocation.
21/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-0001-1>} The implementation advice for procedure Move
+to minimize copying does not apply.
21.a.1/3
Implementation Advice: The implementation advice for procedure
@@ -95983,8 +96317,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
21.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Hashed_Sets is new.
@@ -95994,7 +96328,7 @@ A.18.24 The Generic Package
Containers.Bounded_Ordered_Sets
-----------------------------------------------------------
1/3
-{AI05-0001-1AI05-0001-1} The language-defined generic package
+{<AI05-0001-1AI05-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 *note A.18.9::), with the difference that
@@ -96003,9 +96337,9 @@ the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0001-1AI05-0001-1} The declaration of the generic library package
-Containers.Bounded_Ordered_Sets has the same contents and semantics as
-Containers.Ordered_Sets except:
+{<AI05-0001-1AI05-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/3
* The pragma Preelaborate is replaced with pragma Pure.
@@ -96022,7 +96356,7 @@ Containers.Ordered_Sets except:
needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Set
+ Implementation Note: {<AI05-0212-1AI05-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
@@ -96055,11 +96389,12 @@ Containers.Ordered_Sets except:
_Bounded (Run-Time) Errors_
12/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-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
@@ -96069,9 +96404,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
13/3
-{AI05-0265-1AI05-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.
+{<AI05-0265-1AI05-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
@@ -96089,20 +96424,20 @@ assignment from another set, then execution is
erroneous.
_Implementation Requirements_
14/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Ordered_Sets and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-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-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
16/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
@@ -96111,8 +96446,8 @@ Set'Read of the other instance, respectively:
_Implementation Advice_
17/3
-{AI05-0001-1AI05-0001-1} {AI05-0269-1AI05-0269-1} Bounded ordered set
-objects should be implemented without implicit pointers or dynamic
+{<AI05-0001-1AI05-0001-1>} {<AI05-0269-1AI05-0269-1>} Bounded ordered
+set objects should be implemented without implicit pointers or dynamic
allocation.
17.a.1/3
@@ -96120,8 +96455,8 @@ allocation.
implemented without implicit pointers or dynamic allocation.
18/3
-{AI05-0001-1AI05-0001-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0001-1AI05-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
@@ -96131,8 +96466,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
18.a/3
- {AI05-0001-1AI05-0001-1} {AI05-0160-1AI05-0160-1}
- {AI05-0184-1AI05-0184-1} The generic package
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0160-1AI05-0160-1>}
+ {<AI05-0184-1AI05-0184-1>} The generic package
Containers.Bounded_Ordered_Sets is new.
@@ -96142,7 +96477,7 @@ A.18.25 The Generic Package
Containers.Bounded_Multiway_Trees
-------------------------------------------------------------
1/3
-{AI05-0136-1AI05-0136-1} The language-defined generic package
+{<AI05-0136-1AI05-0136-1>} The language-defined generic package
Containers.Bounded_Multiway_Trees provides a private type Tree and a set
of operations. It provides the same operations as the package
Containers.Multiway_Trees (see *note A.18.10::), with the difference
@@ -96151,9 +96486,9 @@ that the maximum storage is bounded.
_Static Semantics_
2/3
-{AI05-0136-1AI05-0136-1} The declaration of the generic library package
-Containers.Bounded_Multiway_Trees has the same contents and semantics as
-Containers.Multiway_Trees except:
+{<AI05-0136-1AI05-0136-1>} The declaration of the generic library
+package Containers.Bounded_Multiway_Trees has the same contents and
+semantics as Containers.Multiway_Trees except:
3/3
* The pragma Preelaborate is replaced with pragma Pure.
@@ -96170,7 +96505,7 @@ Containers.Multiway_Trees except:
needs finalization.
6.a/3
- Implementation Note: {AI05-0212-1AI05-0212-1} The type Tree
+ Implementation Note: {<AI05-0212-1AI05-0212-1>} The type Tree
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
@@ -96190,7 +96525,7 @@ Containers.Multiway_Trees except:
* Function Copy is declared as follows:
10/4
- {AI12-0056-1AI12-0056-1} function Copy (Source : Tree; Capacity :
Count_Type := 0)
+ {<AI12-0056-1AI12-0056-1>} function Copy (Source : Tree; Capacity :
Count_Type := 0)
return Tree;
11/3
@@ -96200,14 +96535,14 @@ Containers.Multiway_Trees except:
operation propagates Capacity_Error.
12/3
- * {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} In the
+ * {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} In the
five-parameter procedure Splice_Subtree, if Source is not the same
object as Target, and if the sum of Target.Count and
Subtree_Node_Count (Position) is greater than Target.Capacity, then
Splice_Subtree propagates Capacity_Error.
13/3
- * {AI05-0136-1AI05-0136-1} {AI05-0248-1AI05-0248-1} In the
+ * {<AI05-0136-1AI05-0136-1>} {<AI05-0248-1AI05-0248-1>} In the
five-parameter procedure Splice_Children, if Source is not the same
object as Target, and if the sum of Target.Count and
Subtree_Node_Count (Source_Parent)-1 is greater than
@@ -96216,11 +96551,12 @@ Containers.Multiway_Trees except:
_Bounded (Run-Time) Errors_
14/3
-{AI05-0160-1AI05-0160-1} {AI05-0265-1AI05-0265-1} It is a bounded error
-to assign from a bounded tree 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.
+{<AI05-0160-1AI05-0160-1>} {<AI05-0265-1AI05-0265-1>} It is a bounded
+error to assign from a bounded tree 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.
14.a/3
Proof: Tampering with elements includes tampering with
@@ -96230,9 +96566,9 @@ tampering with elements [or cursors], or execution
proceeds normally.
_Erroneous Execution_
15/3
-{AI05-0265-1AI05-0265-1} When a bounded tree object T is finalized, if
-tampering with cursors is prohibited for T other than due to an
-assignment from another tree, then execution is erroneous.
+{<AI05-0265-1AI05-0265-1>} When a bounded tree object <T> is finalized,
+if tampering with cursors is prohibited for <T> other than due to an
+assignment from another tree, then execution is erroneous.
15.a/3
Reason: This is a tampering event, but since the
@@ -96250,20 +96586,20 @@ assignment from another tree, then execution is
erroneous.
_Implementation Requirements_
16/3
-{AI05-0184-1AI05-0184-1} {AI05-0264-1AI05-0264-1} For each instance of
-Containers.Multiway_Trees and each instance of
+{<AI05-0184-1AI05-0184-1>} {<AI05-0264-1AI05-0264-1>} For each instance
+of Containers.Multiway_Trees and each instance of
Containers.Bounded_Multiway_Trees, if the two instances meet the
following conditions, then the output generated by the Tree'Output or
Tree'Write subprograms of either instance shall be readable by the
Tree'Input or Tree'Read of the other instance, respectively:
17/3
- * {AI05-0184-1AI05-0184-1} {AI05-0248-1AI05-0248-1} the Element_Type
- parameters of the two instances are statically matching subtypes of
- the same type; and
+ * {<AI05-0184-1AI05-0184-1>} {<AI05-0248-1AI05-0248-1>} the
+ Element_Type parameters of the two instances are statically
+ matching subtypes of the same type; and
18/3
- * {AI05-0184-1AI05-0184-1} the output generated by
+ * {<AI05-0184-1AI05-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
@@ -96272,7 +96608,7 @@ Tree'Input or Tree'Read of the other instance,
respectively:
_Implementation Advice_
19/3
-{AI05-0136-1AI05-0136-1} Bounded tree objects should be implemented
+{<AI05-0136-1AI05-0136-1>} Bounded tree objects should be implemented
without implicit pointers or dynamic allocation.
19.a.1/3
@@ -96280,8 +96616,8 @@ without implicit pointers or dynamic allocation.
implemented without implicit pointers or dynamic allocation.
20/3
-{AI05-0136-1AI05-0136-1} The implementation advice for procedure Move to
-minimize copying does not apply.
+{<AI05-0136-1AI05-0136-1>} The implementation advice for procedure Move
+to minimize copying does not apply.
20.a.1/3
Implementation Advice: The implementation advice for procedure
@@ -96290,8 +96626,8 @@ minimize copying does not apply.
_Extensions to Ada 2005_
20.a/3
- {AI05-0136-1AI05-0136-1} {AI05-0184-1AI05-0184-1} The generic
- package Containers.Bounded_Multiway_Trees is new.
+ {<AI05-0136-1AI05-0136-1>} {<AI05-0184-1AI05-0184-1>} The
+ generic package Containers.Bounded_Multiway_Trees is new.
File: aarm2012.info, Node: A.18.26, Next: A.18.27, Prev: A.18.25, Up: A.18
@@ -96300,7 +96636,7 @@ A.18.26 Array Sorting
---------------------
1/3
-{AI95-00302-03AI95-00302-03} {AI05-0001-1AI05-0001-1} The
+{<AI95-00302-03AI95-00302-03>} {<AI05-0001-1AI05-0001-1>} The
language-defined generic procedures Containers.Generic_Array_Sort,
Containers.Generic_Constrained_Array_Sort, and Containers.Generic_Sort
provide sorting on arbitrary array types.
@@ -96308,7 +96644,7 @@ provide sorting on arbitrary array types.
_Static Semantics_
2/2
-{AI95-00302-03AI95-00302-03} The generic library procedure
+{<AI95-00302-03AI95-00302-03>} The generic library procedure
Containers.Generic_Array_Sort has the following declaration:
3/2
@@ -96328,8 +96664,8 @@ Containers.Generic_Array_Sort has the following
declaration:
"<" is propagated.
5/3
- {AI05-0044-1AI05-0044-1} {AI05-0262-1AI05-0262-1} The actual
- function for the generic formal function "<" of
+ {<AI05-0044-1AI05-0044-1>} {<AI05-0262-1AI05-0262-1>} 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
@@ -96356,7 +96692,7 @@ Containers.Generic_Array_Sort has the following
declaration:
stability.
6/2
-{AI95-00302-03AI95-00302-03} The generic library procedure
+{<AI95-00302-03AI95-00302-03>} The generic library procedure
Containers.Generic_Constrained_Array_Sort has the following declaration:
7/2
@@ -96377,8 +96713,8 @@ Containers.Generic_Constrained_Array_Sort has the
following declaration:
"<" is propagated.
9/3
- {AI05-0044-1AI05-0044-1} {AI05-0262-1AI05-0262-1} The actual
- function for the generic formal function "<" of
+ {<AI05-0044-1AI05-0044-1>} {<AI05-0262-1AI05-0262-1>} 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
@@ -96389,11 +96725,11 @@ Containers.Generic_Constrained_Array_Sort has the
following declaration:
is unspecified.
9.1/3
-{AI05-0001-1AI05-0001-1} The generic library procedure
+{<AI05-0001-1AI05-0001-1>} The generic library procedure
Containers.Generic_Sort has the following declaration:
9.2/4
- {AI12-0056-1AI12-0056-1} generic
+ {<AI12-0056-1AI12-0056-1>} generic
type Index_Type is (<>);
with function Before (Left, Right : Index_Type) return Boolean;
with procedure Swap (Left, Right : in Index_Type);
@@ -96402,9 +96738,9 @@ Containers.Generic_Sort has the following declaration:
pragma Pure(Ada.Containers.Generic_Sort);
9.3/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} Reorders the
- elements of an indexable structure, over the range First ..
- Last, such that the elements are sorted in the ordering
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} Reorders
+ the elements of an indexable structure, over the range First
+ .. Last, such that the elements are sorted in the ordering
determined by the generic formal function Before; Before
should return True if Left is to be sorted before Right. The
generic formal Before compares the elements having the given
@@ -96427,25 +96763,25 @@ Containers.Generic_Sort has the following declaration:
_Implementation Advice_
10/2
-{AI95-00302-03AI95-00302-03} The worst-case time complexity of a call on
-an instance of Containers.Generic_Array_Sort or
-Containers.Generic_Constrained_Array_Sort should be O(N**2) or better,
-and the average time complexity should be better than O(N**2), where N
-is the length of the Container parameter.
+{<AI95-00302-03AI95-00302-03>} The worst-case time complexity of a call
+on an instance of Containers.Generic_Array_Sort or
+Containers.Generic_Constrained_Array_Sort should be <O>(<N>**2) or
+better, and the average time complexity should be better than
+<O>(<N>**2), where <N> is the length of the Container parameter.
10.a/2
Implementation Advice: Containers.Generic_Array_Sort and
Containers.Generic_Constrained_Array_Sort should have an
- average time complexity better than O(N**2) and worst case no
- worse than O(N**2).
+ average time complexity better than <O>(<N>**2) and worst case
+ no worse than <O>(<N>**2).
10.b/2
Discussion: In other words, we're requiring the use of a
- sorting algorithm better than O(N**2), such as Quicksort. No
- bubble sorts allowed!
+ sorting algorithm better than <O>(<N>**2), such as Quicksort.
+ No bubble sorts allowed!
11/2
-{AI95-00302-03AI95-00302-03} Containers.Generic_Array_Sort and
+{<AI95-00302-03AI95-00302-03>} Containers.Generic_Array_Sort and
Containers.Generic_Constrained_Array_Sort should minimize copying of
elements.
@@ -96462,18 +96798,18 @@ elements.
would not meet this advice, for instance.
12/3
-{AI05-0248-1AI05-0248-1} The worst-case time complexity of a call on an
-instance of Containers.Generic_Sort should be O(N**2) or better, and the
-average time complexity should be better than O(N**2), where N is the
-difference between the Last and First parameters plus 1.
+{<AI05-0248-1AI05-0248-1>} The worst-case time complexity of a call on
+an instance of Containers.Generic_Sort should be <O>(<N>**2) or better,
+and the average time complexity should be better than <O>(<N>**2), where
+<N> is the difference between the Last and First parameters plus 1.
12.a.1/3
Implementation Advice: Containers.Generic_Sort should have an
- average time complexity better than O(N**2) and worst case no
- worse than O(N**2).
+ average time complexity better than <O>(<N>**2) and worst case
+ no worse than <O>(<N>**2).
13/3
-{AI05-0248-1AI05-0248-1} Containers.Generic_Sort should minimize calls
+{<AI05-0248-1AI05-0248-1>} Containers.Generic_Sort should minimize calls
to the generic formal Swap.
13.a.1/3
@@ -96483,21 +96819,21 @@ to the generic formal Swap.
_Extensions to Ada 95_
13.a/2
- {AI95-00302-03AI95-00302-03} The generic procedures
+ {<AI95-00302-03AI95-00302-03>} The generic procedures
Containers.Generic_Array_Sort and
Containers.Generic_Constrained_Array_Sort are new.
_Extensions to Ada 2005_
13.b/3
- {AI05-0001-1AI05-0001-1} {AI05-0248-1AI05-0248-1} The generic
- procedure Containers.Generic_Sort is new.
+ {<AI05-0001-1AI05-0001-1>} {<AI05-0248-1AI05-0248-1>} The
+ generic procedure Containers.Generic_Sort is new.
_Wording Changes from Ada 2005_
13.c/3
- {AI05-0044-1AI05-0044-1} Correction: Redefined "<" actuals to
- require a strict weak ordering; the old definition allowed
+ {<AI05-0044-1AI05-0044-1>} Correction: Redefined "<" actuals
+ to require a strict weak ordering; the old definition allowed
indeterminant comparisons that would not have worked in a
sort.
@@ -96508,7 +96844,7 @@ A.18.27 The Generic Package
Containers.Synchronized_Queue_Interfaces
--------------------------------------------------------------------
1/3
-{AI05-0159-1AI05-0159-1} The language-defined generic package
+{<AI05-0159-1AI05-0159-1>} The language-defined generic package
Containers.Synchronized_Queue_Interfaces provides interface type Queue,
and a set of operations for that type. Interface Queue specifies a
first-in, first-out queue.
@@ -96516,7 +96852,7 @@ first-in, first-out queue.
_Static Semantics_
2/3
-{AI05-0159-1AI05-0159-1} The generic library package
+{<AI05-0159-1AI05-0159-1>} The generic library package
Containers.Synchronized_Queue_Interfaces has the following declaration:
3/3
@@ -96553,13 +96889,13 @@ Containers.Synchronized_Queue_Interfaces has the
following declaration:
New_Item : in Element_Type) is abstract;
10/3
- {AI05-0159-1AI05-0159-1} {AI05-0262-1AI05-0262-1}
- {AI05-0264-1AI05-0264-1} A queue type that implements this
- interface is allowed to have a bounded capacity. If the queue
- object has a bounded capacity, and the number of existing
- elements equals the capacity, then Enqueue blocks until
- storage becomes available; otherwise, Enqueue does not block.
- In any case, it then copies New_Item onto the queue.
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0262-1AI05-0262-1>}
+ {<AI05-0264-1AI05-0264-1>} A queue type that implements this
+ interface is allowed to have a bounded <capacity>. If the
+ queue object has a bounded capacity, and the number of
+ existing elements equals the capacity, then Enqueue blocks
+ until storage becomes available; otherwise, Enqueue does not
+ block. In any case, it then copies New_Item onto the queue.
11/3
procedure Dequeue
@@ -96567,29 +96903,29 @@ Containers.Synchronized_Queue_Interfaces has the
following declaration:
Element : out Element_Type) is abstract;
12/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} If the queue
- is empty, then Dequeue blocks until an item becomes available.
- In any case, it then assigns the element at the head of the
- queue to Element, and removes it from the queue.
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} If the
+ queue is empty, then Dequeue blocks until an item becomes
+ available. In any case, it then assigns the element at the
+ head of the queue to Element, and removes it from the queue.
13/3
function Current_Use (Container : Queue) return Count_Type is abstract;
14/3
- {AI05-0159-1AI05-0159-1} Returns the number of elements
+ {<AI05-0159-1AI05-0159-1>} Returns the number of elements
currently in the queue.
15/3
function Peak_Use (Container : Queue) return Count_Type is abstract;
16/3
- {AI05-0159-1AI05-0159-1} Returns the maximum number of
+ {<AI05-0159-1AI05-0159-1>} Returns the maximum number of
elements that have been in the queue at any one time.
NOTES
17/3
- 51 {AI05-0251-1AI05-0251-1} Unlike other language-defined
+ 51 {<AI05-0251-1AI05-0251-1>} Unlike other language-defined
containers, there are no queues whose element types are indefinite.
Elements of an indefinite type can be handled by defining the
element of the queue to be a holder container (see *note A.18.18::)
@@ -96613,8 +96949,9 @@ Containers.Synchronized_Queue_Interfaces has the
following declaration:
_Extensions to Ada 2005_
17.b/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} The generic
- package Containers.Synchronized_Queue_Interfaces is new.
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} The
+ generic package Containers.Synchronized_Queue_Interfaces is
+ new.
File: aarm2012.info, Node: A.18.28, Next: A.18.29, Prev: A.18.27, Up: A.18
@@ -96625,7 +96962,7 @@ A.18.28 The Generic Package
Containers.Unbounded_Synchronized_Queues
_Static Semantics_
1/3
-{AI05-0159-1AI05-0159-1} The language-defined generic package
+{<AI05-0159-1AI05-0159-1>} The language-defined generic package
Containers.Unbounded_Synchronized_Queues provides type Queue, which
implements the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
@@ -96641,7 +96978,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -96664,24 +97001,24 @@ Containers.Synchronized_Queue_Interfaces.Queue.
7/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
8/3
private
9/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
10/3
end Ada.Containers.Unbounded_Synchronized_Queues;
11/3
-{AI05-0159-1AI05-0159-1} The type Queue is used to represent task-safe
+{<AI05-0159-1AI05-0159-1>} The type Queue is used to represent task-safe
queues.
12/3
-{AI05-0159-1AI05-0159-1} The capacity for instances of type Queue is
+{<AI05-0159-1AI05-0159-1>} The capacity for instances of type Queue is
unbounded.
12.a/3
@@ -96703,7 +97040,7 @@ unbounded.
_Extensions to Ada 2005_
12.c/3
- {AI05-0159-1AI05-0159-1} The generic package
+ {<AI05-0159-1AI05-0159-1>} The generic package
Containers.Unbounded_Synchronized_Queues is new.
@@ -96715,7 +97052,7 @@ A.18.29 The Generic Package
Containers.Bounded_Synchronized_Queues
_Static Semantics_
1/3
-{AI05-0159-1AI05-0159-1} The language-defined generic package
+{<AI05-0159-1AI05-0159-1>} The language-defined generic package
Containers.Bounded_Synchronized_Queues provides type Queue, which
implements the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
@@ -96732,7 +97069,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -96756,20 +97093,20 @@ Containers.Synchronized_Queue_Interfaces.Queue.
7/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
8/3
private
9/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
10/3
end Ada.Containers.Bounded_Synchronized_Queues;
11/3
-{AI05-0159-1AI05-0159-1} The semantics are the same as for
+{<AI05-0159-1AI05-0159-1>} The semantics are the same as for
Unbounded_Synchronized_Queues, except:
12/3
@@ -96783,7 +97120,7 @@ Unbounded_Synchronized_Queues, except:
_Implementation Advice_
13/3
-{AI05-0159-1AI05-0159-1} Bounded queue objects should be implemented
+{<AI05-0159-1AI05-0159-1>} Bounded queue objects should be implemented
without implicit pointers or dynamic allocation.
13.a.1/3
@@ -96793,7 +97130,7 @@ without implicit pointers or dynamic allocation.
_Extensions to Ada 2005_
13.a/3
- {AI05-0159-1AI05-0159-1} The generic package
+ {<AI05-0159-1AI05-0159-1>} The generic package
Containers.Bounded_Synchronized_Queues is new.
@@ -96805,7 +97142,7 @@ A.18.30 The Generic Package
Containers.Unbounded_Priority_Queues
_Static Semantics_
1/3
-{AI05-0159-1AI05-0159-1} The language-defined generic package
+{<AI05-0159-1AI05-0159-1>} The language-defined generic package
Containers.Unbounded_Priority_Queues provides type Queue, which
implements the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
@@ -96826,7 +97163,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -96842,7 +97179,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
entry Dequeue (Element : out Queue_Interfaces.Element_Type);
6/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} not overriding
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} not overriding
procedure Dequeue_Only_High_Priority
(At_Least : in Queue_Priority;
Element : in out Queue_Interfaces.Element_Type;
@@ -96856,43 +97193,43 @@ Containers.Synchronized_Queue_Interfaces.Queue.
8/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
9/3
private
10/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
11/3
end Ada.Containers.Unbounded_Priority_Queues;
12/3
-{AI05-0159-1AI05-0159-1} The type Queue is used to represent task-safe
+{<AI05-0159-1AI05-0159-1>} The type Queue is used to represent task-safe
priority queues.
13/3
-{AI05-0159-1AI05-0159-1} The capacity for instances of type Queue is
+{<AI05-0159-1AI05-0159-1>} The capacity for instances of type Queue is
unbounded.
14/3
-{AI05-0159-1AI05-0159-1} Two elements E1 and E2 are equivalent if
-Before(Get_Priority(E1), Get_Priority(E2)) and Before(Get_Priority(E2),
-Get_Priority(E1)) both return False.
+{<AI05-0159-1AI05-0159-1>} Two elements <E1> and <E2> are equivalent if
+Before(Get_Priority(<E1>), Get_Priority(<E2>)) and
+Before(Get_Priority(<E2>), Get_Priority(<E1>)) both return False.
15/3
-{AI05-0159-1AI05-0159-1} {AI05-0248-1AI05-0248-1} The actual functions
-for Get_Priority and Before are expected to return the same value each
-time they are called with the same actuals, and should not modify their
-actuals. Before should define a strict weak ordering relationship (see
-*note A.18::). If the actual functions behave in some other manner, the
-behavior of Unbounded_Priority_Queues is unspecified.
+{<AI05-0159-1AI05-0159-1>} {<AI05-0248-1AI05-0248-1>} The actual
+functions for Get_Priority and Before are expected to return the same
+value each time they are called with the same actuals, and should not
+modify their actuals. Before should define a strict weak ordering
+relationship (see *note A.18::). If the actual functions behave in some
+other manner, the behavior of Unbounded_Priority_Queues is unspecified.
16/3
-{AI05-0159-1AI05-0159-1} Enqueue inserts an item according to the order
-specified by the Before function on the result of Get_Priority on the
-elements; Before should return True if Left is to be inserted before
+{<AI05-0159-1AI05-0159-1>} Enqueue inserts an item according to the
+order specified by the Before function on the result of Get_Priority on
+the elements; Before should return True if Left is to be inserted before
Right. If the queue already contains elements equivalent to New_Item,
then it is inserted after the existing equivalent elements.
@@ -96903,28 +97240,28 @@ then it is inserted after the existing equivalent
elements.
it is visibly protected.
17/3
-{AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1}
-{AI05-0262-1AI05-0262-1} For a call on Dequeue_Only_High_Priority, if
-the head of the nonempty queue is E, and the function Before(At_Least,
-Get_Priority(E)) returns False, then E is assigned to Element and then
-removed from the queue, and Success is set to True; otherwise, Success
-is set to False and Element is unchanged.
+{<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>}
+{<AI05-0262-1AI05-0262-1>} For a call on Dequeue_Only_High_Priority, if
+the head of the nonempty queue is <E>, and the function Before(At_Least,
+Get_Priority(<E>)) returns False, then <E> is assigned to Element and
+then removed from the queue, and Success is set to True; otherwise,
+Success is set to False and Element is unchanged.
17.a/3
- Ramification: {AI05-0251-1AI05-0251-1} Unlike Dequeue,
+ Ramification: {<AI05-0251-1AI05-0251-1>} Unlike Dequeue,
Dequeue_Only_High_Priority is not blocking; it always returns
immediately.
17.b/3
- Reason: {AI05-0251-1AI05-0251-1} The use of Before is
+ Reason: {<AI05-0251-1AI05-0251-1>} The use of Before is
"backwards" so that it acts like ">=" (it is defined similarly
to ">"); thus we dequeue only when it is False.
_Extensions to Ada 2005_
17.c/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} The generic
- package Containers.Unbounded_Priority_Queues is new.
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} The
+ generic package Containers.Unbounded_Priority_Queues is new.
File: aarm2012.info, Node: A.18.31, Next: A.18.32, Prev: A.18.30, Up: A.18
@@ -96935,7 +97272,7 @@ A.18.31 The Generic Package
Containers.Bounded_Priority_Queues
_Static Semantics_
1/3
-{AI05-0159-1AI05-0159-1} The language-defined generic package
+{<AI05-0159-1AI05-0159-1>} The language-defined generic package
Containers.Bounded_Priority_Queues provides type Queue, which implements
the interface type Containers.Synchronized_Queue_Interfaces.Queue.
@@ -96956,7 +97293,7 @@ the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -96973,7 +97310,7 @@ the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
entry Dequeue (Element : out Queue_Interfaces.Element_Type);
6/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} not overriding
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} not overriding
procedure Dequeue_Only_High_Priority
(At_Least : in Queue_Priority;
Element : in out Queue_Interfaces.Element_Type;
@@ -96987,20 +97324,20 @@ the interface type
Containers.Synchronized_Queue_Interfaces.Queue.
8/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
9/3
private
10/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
11/3
end Ada.Containers.Bounded_Priority_Queues;
12/3
-{AI05-0159-1AI05-0159-1} The semantics are the same as for
+{<AI05-0159-1AI05-0159-1>} The semantics are the same as for
Unbounded_Priority_Queues, except:
13/3
@@ -97014,7 +97351,7 @@ Unbounded_Priority_Queues, except:
_Implementation Advice_
14/3
-{AI05-0159-1AI05-0159-1} Bounded priority queue objects should be
+{<AI05-0159-1AI05-0159-1>} Bounded priority queue objects should be
implemented without implicit pointers or dynamic allocation.
14.a.1/3
@@ -97025,8 +97362,8 @@ implemented without implicit pointers or dynamic
allocation.
_Extensions to Ada 2005_
14.a/3
- {AI05-0159-1AI05-0159-1} {AI05-0251-1AI05-0251-1} The generic
- package Containers.Bounded_Priority_Queues is new.
+ {<AI05-0159-1AI05-0159-1>} {<AI05-0251-1AI05-0251-1>} The
+ generic package Containers.Bounded_Priority_Queues is new.
File: aarm2012.info, Node: A.18.32, Prev: A.18.31, Up: A.18
@@ -97037,7 +97374,7 @@ A.18.32 Example of Container Use
_Examples_
1/3
-{AI05-0212-1AI05-0212-1} The following example is an implementation of
+{<AI05-0212-1AI05-0212-1>} The following example is an implementation of
Dijkstra's shortest path algorithm in a directed graph with positive
distances. The graph is represented by a map from nodes to sets of
edges.
@@ -97057,8 +97394,8 @@ edges.
3/3
package Node_Maps is new Vectors (Node, Node);
- -- The algorithm builds a map to indicate the node used to reach a
given
- -- node in the shortest distance.
+ -- <The algorithm builds a map to indicate the node used to reach a
given>
+ -- <node in the shortest distance.>
4/3
package Adjacency_Lists is new Doubly_Linked_Lists (Edge);
@@ -97085,10 +97422,10 @@ edges.
is
use Adjacency_Lists, Node_Maps, Paths, Graphs;
Reached : array (Node) of Boolean := (others => False);
- -- The set of nodes whose shortest distance to the source is known.
+ -- <The set of nodes whose shortest distance to the source is
known.>
10/3
- {AI05-0299-1AI05-0299-1} Reached_From : array (Node) of Node;
+ {<AI05-0299-1AI05-0299-1>} Reached_From : array (Node) of Node;
So_Far : array (Node) of Distance := (others => Distance'Last);
The_Path : Paths.List := Paths.Empty_List;
Nearest_Distance : Distance;
@@ -97101,8 +97438,8 @@ edges.
Nearest_Distance := Distance'Last;
12/3
- -- Find closest node not reached yet, by iterating over all
nodes.
- -- A more efficient algorithm uses a priority queue for this
step.
+ -- <Find closest node not reached yet, by iterating over all
nodes.>
+ -- <A more efficient algorithm uses a priority queue for this
step.>
13/3
Next := Source;
@@ -97115,8 +97452,8 @@ edges.
end loop;
14/3
- {AI05-0299-1AI05-0299-1} if Nearest_Distance = Distance'Last then
- -- No next node found, graph is not connected
+ {<AI05-0299-1AI05-0299-1>} if Nearest_Distance = Distance'Last
then
+ -- <No next node found, graph is not connected>
return Paths.Empty_List;
15/3
@@ -97125,10 +97462,10 @@ edges.
end if;
16/3
- -- Update minimum distance to newly reachable nodes.
+ -- <Update minimum distance to newly reachable nodes.>
17/3
- {AI05-0299-1AI05-0299-1} for E of G (Next) loop
+ {<AI05-0299-1AI05-0299-1>} for E of G (Next) loop
if not Reached(E.To) then
Nearest_Distance := E.Length + So_Far(Next);
@@ -97142,7 +97479,7 @@ edges.
end loop;
19/3
- -- Rebuild path from target to source.
+ -- <Rebuild path from target to source.>
20/3
declare
@@ -97160,7 +97497,7 @@ edges.
end Shortest_Paths;
22/3
-{AI05-0212-1AI05-0212-1} Note that the effect of the Constant_Indexing
+{<AI05-0212-1AI05-0212-1>} Note that the effect of the Constant_Indexing
aspect (on type Vector) and the Implicit_Dereference aspect (on type
Reference_Type) is that
@@ -97168,13 +97505,13 @@ Reference_Type) is that
G (Next)
24/3
-{AI05-0212-1AI05-0212-1} is a convenient short hand for
+{<AI05-0212-1AI05-0212-1>} is a convenient short hand for
25/3
G.Constant_Reference (Next).Element.all
26/3
-{AI05-0212-1AI05-0212-1} Similarly, the effect of the loop:
+{<AI05-0212-1AI05-0212-1>} Similarly, the effect of the loop:
27/3
for E of G (Next) loop
@@ -97184,10 +97521,10 @@ Reference_Type) is that
end loop;
28/3
-{AI05-0212-1AI05-0212-1} is the same as:
+{<AI05-0212-1AI05-0212-1>} is the same as:
29/4
- {AI12-0080-1AI12-0080-1} for C in G (Next).Iterate loop
+ {<AI12-0080-1AI12-0080-1>} for C in G (Next).Iterate loop
declare
E : Edge renames G (Next)(C);
begin
@@ -97198,10 +97535,10 @@ Reference_Type) is that
end loop;
30/3
-{AI05-0212-1AI05-0212-1} which is the same as:
+{<AI05-0212-1AI05-0212-1>} which is the same as:
31/4
- {AI12-0080-1AI12-0080-1} declare
+ {<AI12-0080-1AI12-0080-1>} declare
L : Adjacency_Lists.List renames G (Next);
C : Adjacency_Lists.Cursor := L.First;
begin
@@ -97220,7 +97557,8 @@ Reference_Type) is that
_Wording Changes from Ada 2005_
31.a/3
- {AI05-0212-1AI05-0212-1} This example of container use is new.
+ {<AI05-0212-1AI05-0212-1>} This example of container use is
+ new.
File: aarm2012.info, Node: A.19, Prev: A.18, Up: Annex A
@@ -97229,14 +97567,15 @@ A.19 The Package Locales
========================
1/3
-{AI05-0127-2AI05-0127-2} {AI05-0248-1AI05-0248-1} A locale identifies a
-geopolitical place or region and its associated language, which can be
-used to determine other internationalization-related characteristics.
+{<AI05-0127-2AI05-0127-2>} {<AI05-0248-1AI05-0248-1>} A <locale>
+identifies a geopolitical place or region and its associated language,
+which can be used to determine other internationalization-related
+characteristics.
_Static Semantics_
2/3
-{AI05-0127-2AI05-0127-2} The library package Locales has the following
+{<AI05-0127-2AI05-0127-2>} The library package Locales has the following
declaration:
3/3
@@ -97245,7 +97584,7 @@ declaration:
pragma Remote_Types(Locales);
4/4
- {AI12-0037-1AI12-0037-1} type Language_Code is new String (1 .. 3)
+ {<AI12-0037-1AI12-0037-1>} type Language_Code is new String (1 .. 3)
with Dynamic_Predicate =>
(for all E of Language_Code => E in 'a' .. 'z');
type Country_Code is new String (1 .. 2)
@@ -97253,7 +97592,7 @@ declaration:
(for all E of Country_Code => E in 'A' .. 'Z');
4.a/4
- Discussion: {AI12-0037-1AI12-0037-1} These types are derived
+ Discussion: {<AI12-0037-1AI12-0037-1>} These types are derived
from type String so that they can easily be converted to or
from type String. That's important if one of these values
needs to be input or displayed (via Text_IO, perhaps). We use
@@ -97275,11 +97614,11 @@ declaration:
end Ada.Locales;
8/3
-{AI05-0127-2AI05-0127-2} {AI05-0233-1AI05-0233-1} The active locale is
-the locale associated with the partition of the current task.
+{<AI05-0127-2AI05-0127-2>} {<AI05-0233-1AI05-0233-1>} The <active
+locale> is the locale associated with the partition of the current task.
8.a/3
- Implementation Note: {AI05-0233-1AI05-0233-1} Some
+ Implementation Note: {<AI05-0233-1AI05-0233-1>} Some
environments define both a system locale and the locale of the
current user. For such environments, the active locale is
that of current user if any; otherwise (as in a partition
@@ -97287,7 +97626,7 @@ the locale associated with the partition of the current
task.
be used.
9/3
-{AI05-0127-2AI05-0127-2} Language_Code is a lower-case string
+{<AI05-0127-2AI05-0127-2>} Language_Code is a lower-case string
representation of an ISO 639-3 alpha-3 code that identifies a language.
9.a/3
@@ -97300,7 +97639,7 @@ representation of an ISO 639-3 alpha-3 code that
identifies a language.
include.
10/3
-{AI05-0127-2AI05-0127-2} Country_Code is an upper-case string
+{<AI05-0127-2AI05-0127-2>} Country_Code is an upper-case string
representation of an ISO 3166-1 alpha-2 code that identifies a country.
10.a/3
@@ -97312,13 +97651,13 @@ representation of an ISO 3166-1 alpha-2 code that
identifies a country.
language constants.
11/3
-{AI05-0127-2AI05-0127-2} {AI05-0248-1AI05-0248-1} Function Language
+{<AI05-0127-2AI05-0127-2>} {<AI05-0248-1AI05-0248-1>} Function Language
returns the code of the language associated with the active locale. If
the Language_Code associated with the active locale cannot be determined
from the environment, then Language returns Language_Unknown.
12/3
-{AI05-0127-2AI05-0127-2} {AI05-0248-1AI05-0248-1} Function Country
+{<AI05-0127-2AI05-0127-2>} {<AI05-0248-1AI05-0248-1>} Function Country
returns the code of the country associated with the active locale. If
the Country_Code associated with the active locale cannot be determined
from the environment, then Country returns Country_Unknown.
@@ -97326,14 +97665,14 @@ from the environment, then Country returns
Country_Unknown.
_Extensions to Ada 2005_
12.a/3
- {AI05-0127-2AI05-0127-2} {AI05-0233-1AI05-0233-1} Package
+ {<AI05-0127-2AI05-0127-2>} {<AI05-0233-1AI05-0233-1>} Package
Locales is new.
_Inconsistencies With Ada 2012_
12.b/4
- {AI12-0037-1AI12-0037-1} Corrigendum: Types Language_Code and
- Country_Code are defined with predicates rather than
+ {<AI12-0037-1AI12-0037-1>} Corrigendum: Types Language_Code
+ and Country_Code are defined with predicates rather than
constrained components so that they can be converted to/from
type String. This changes the exception raised from
Constraint_Error to Assertion_Error if an assignment is
@@ -97370,16 +97709,17 @@ packages for each of these languages.
_Implementation Requirements_
2/3
-{AI05-0229-1AI05-0229-1} {AI05-0262-1AI05-0262-1}
-{AI05-0299-1AI05-0299-1} Support for interfacing to any foreign language
-is optional. However, an implementation shall not provide any optional
-aspect, attribute, library unit, or pragma having the same name as an
-aspect, attribute, library unit, or pragma (respectively) specified in
-the subclauses of this Annex unless the provided construct is either as
-specified in those subclauses or is more limited in capability than that
-required by those subclauses. A program that attempts to use an
-unsupported capability of this Annex shall either be identified by the
-implementation before run time or shall raise an exception at run time.
+{<AI05-0229-1AI05-0229-1>} {<AI05-0262-1AI05-0262-1>}
+{<AI05-0299-1AI05-0299-1>} Support for interfacing to any foreign
+language is optional. However, an implementation shall not provide any
+optional aspect, attribute, library unit, or pragma having the same name
+as an aspect, attribute, library unit, or pragma (respectively)
+specified in the subclauses of this Annex unless the provided construct
+is either as specified in those subclauses or is more limited in
+capability than that required by those subclauses. A program that
+attempts to use an unsupported capability of this Annex shall either be
+identified by the implementation before run time or shall raise an
+exception at run time.
2.a/3
Discussion: The intent is that the same rules apply for the
@@ -97400,7 +97740,7 @@ implementation before run time or shall raise an
exception at run time.
_Wording Changes from Ada 2005_
2.d/3
- {AI05-0262-1AI05-0262-1} Moved the clarification that
+ {<AI05-0262-1AI05-0262-1>} Moved the clarification that
interfacing to foreign languages is optional and has the same
restrictions as a Specialized Needs Annex here.
@@ -97419,24 +97759,24 @@ B.1 Interfacing Aspects
=======================
0.1/3
-{AI05-0229-1AI05-0229-1} An interfacing aspect is a representation
+{<AI05-0229-1AI05-0229-1>} An <interfacing> aspect is a representation
aspect that is one of the aspects Import, Export, Link_Name,
External_Name, or Convention.
1/3
-{AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} Specifying the Import
-aspect to have the value True is used to import an entity defined in a
-foreign language into an Ada program, thus allowing a foreign-language
-subprogram to be called from Ada, or a foreign-language variable to be
-accessed from Ada. In contrast, specifying the Export aspect to have
-the value True is used to export an Ada entity to a foreign language,
-thus allowing an Ada subprogram to be called from a foreign language, or
-an Ada object to be accessed from a foreign language. The Import and
-Export aspects are intended primarily for objects and subprograms,
-although implementations are allowed to support other entities. The
-Link_Name and External_Name aspects are used to specify the link name
-and external name, respectively, to be used to identify imported or
-exported entities in the external environment.
+{<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} Specifying the
+Import aspect to have the value True is used to import an entity defined
+in a foreign language into an Ada program, thus allowing a
+foreign-language subprogram to be called from Ada, or a foreign-language
+variable to be accessed from Ada. In contrast, specifying the Export
+aspect to have the value True is used to export an Ada entity to a
+foreign language, thus allowing an Ada subprogram to be called from a
+foreign language, or an Ada object to be accessed from a foreign
+language. The Import and Export aspects are intended primarily for
+objects and subprograms, although implementations are allowed to support
+other entities. The Link_Name and External_Name aspects are used to
+specify the link name and external name, respectively, to be used to
+identify imported or exported entities in the external environment.
1.a/3
Aspect Description for Import: Entity is imported from another
@@ -97455,12 +97795,13 @@ exported entities in the external environment.
identify an imported or exported entity.
2/3
-{AI05-0229-1AI05-0229-1} The Convention aspect is used to indicate that
-an Ada entity should use the conventions of another language. It is
-intended primarily for types and "callback" subprograms. For example,
-"with Convention => Fortran" on the declaration of an array type Matrix
-implies that Matrix should be represented according to the conventions
-of the supported Fortran implementation, namely column-major order.
+{<AI05-0229-1AI05-0229-1>} The Convention aspect is used to indicate
+that an Ada entity should use the conventions of another language. It
+is intended primarily for types and "callback" subprograms. For
+example, "with Convention => Fortran" on the declaration of an array
+type Matrix implies that Matrix should be represented according to the
+conventions of the supported Fortran implementation, namely column-major
+order.
2.a/3
Aspect Description for Convention: Calling convention or other
@@ -97473,32 +97814,32 @@ needed when a given compilation unit is included in a
partition.
_Syntax_
4/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Linker_Options is as
- follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Linker_Options is
+ as follows:
- Paragraphs 5 through 7 were moved to *note Annex J::, "*note Annex
- J:: Obsolescent Features".
+ <Paragraphs 5 through 7 were moved to *note Annex J::, "*note Annex
+ J:: Obsolescent Features".>
8
- pragma Linker_Options(string_expression);
+ pragma Linker_Options(<string_>expression);
9
A pragma Linker_Options is allowed only at the place of a
declarative_item.
9.1/3
- This paragraph was deleted.{8652/00588652/0058}
- {AI95-00036-01AI95-00036-01} {AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<8652/00588652/0058>}
+ {<AI95-00036-01AI95-00036-01>} {<AI05-0229-1AI05-0229-1>}
_Name Resolution Rules_
9.2/3
-{AI05-0229-1AI05-0229-1} The Import and Export aspects are of type
+{<AI05-0229-1AI05-0229-1>} The Import and Export aspects are of type
Boolean.
10/3
-{AI05-0229-1AI05-0229-1} The Link_Name and External_Name aspects are of
-type String.
+{<AI05-0229-1AI05-0229-1>} The Link_Name and External_Name aspects are
+of type String.
10.a/3
Ramification: There is no language-defined support for
@@ -97509,20 +97850,20 @@ type String.
ambiguities.
10.1/3
-{AI05-0229-1AI05-0229-1} The expected type for the string_expression in
-pragma Linker_Options is String.
+{<AI05-0229-1AI05-0229-1>} The expected type for the <string_>expression
+in pragma Linker_Options is String.
_Legality Rules_
11/3
-{AI05-0229-1AI05-0229-1} The aspect Convention shall be specified by a
-convention_identifier which shall be the name of a convention. The
+{<AI05-0229-1AI05-0229-1>} The aspect Convention shall be specified by a
+<convention_>identifier which shall be the name of a <convention>. The
convention names are implementation defined, except for certain
language-defined ones, such as Ada and Intrinsic, as explained in *note
6.3.1::, "*note 6.3.1:: Conformance Rules". [Additional convention
names generally represent the calling conventions of foreign languages,
-language implementations, or specific run-time models.] The convention
-of a callable entity is its calling convention.
+language implementations, or specific run-time models.] The convention
+of a callable entity is its <calling convention>.
11.a
Implementation defined: Implementation-defined convention
@@ -97531,29 +97872,29 @@ of a callable entity is its calling convention.
11.b
Discussion: We considered representing the convention names
using an enumeration type declared in System. Then,
- convention_identifier would be changed to convention_name, and
- we would make its expected type be the enumeration type. We
- didn't do this because it seems to introduce extra complexity,
- and because the list of available languages is better
- represented as the list of children of package Interfaces -- a
- more open-ended sort of list.
+ <convention_>identifier would be changed to <convention_>name,
+ and we would make its expected type be the enumeration type.
+ We didn't do this because it seems to introduce extra
+ complexity, and because the list of available languages is
+ better represented as the list of children of package
+ Interfaces -- a more open-ended sort of list.
12
-If L is a convention_identifier for a language, then a type T is said to
-be compatible with convention L, (alternatively, is said to be an
-L-compatible type) if any of the following conditions are met:
+If <L> is a <convention_>identifier for a language, then a type T is
+said to be <compatible with convention L>, (alternatively, is said to be
+an <L-compatible type>) if any of the following conditions are met:
13
- * T is declared in a language interface package corresponding to L
- and is defined to be L-compatible (see *note B.3::, *note B.3.1::,
- *note B.3.2::, *note B.4::, *note B.5::),
+ * T is declared in a language interface package corresponding to <L>
+ and is defined to be <L>-compatible (see *note B.3::, *note
+ B.3.1::, *note B.3.2::, *note B.4::, *note B.5::),
14/3
- * {AI05-0229-1AI05-0229-1} Convention L has been specified for T, and
- T is eligible for convention L; that is:
+ * {<AI05-0229-1AI05-0229-1>} Convention <L> has been specified for T,
+ and T is <eligible for convention L>; that is:
14.1/4
- * {AI12-0135-1AI12-0135-1} T is an enumeration type such
+ * {<AI12-0135-1AI12-0135-1>} T is an enumeration type such
that all internal codes (whether assigned by default or
explicitly) are within an implementation-defined range
that includes at least the range of values 0 .. 2**15-1;
@@ -97561,28 +97902,28 @@ L-compatible type) if any of the following conditions
are met:
15
* T is an array type with either an unconstrained or
statically-constrained first subtype, and its component
- type is L-compatible,
+ type is <L>-compatible,
16
* T is a record type that has no discriminants and that
only has components with statically-constrained subtypes,
- and each component type is L-compatible,
+ and each component type is <L>-compatible,
17/3
- * {AI05-0002-1AI05-0002-1} T is an access-to-object type,
- its designated type is L-compatible, and its designated
+ * {<AI05-0002-1AI05-0002-1>} T is an access-to-object type,
+ its designated type is <L>-compatible, and its designated
subtype is not an unconstrained array subtype,
18
* T is an access-to-subprogram type, and its designated
profile's parameter and result types are all
- L-compatible.
+ <L>-compatible.
19
- * T is derived from an L-compatible type,
+ * T is derived from an <L>-compatible type,
20
- * The implementation permits T as an L-compatible type.
+ * The implementation permits T as an <L>-compatible type.
20.a
Discussion: For example, an implementation might permit
@@ -97590,32 +97931,32 @@ L-compatible type) if any of the following conditions
are met:
corresponds might be different in different environments.
21/3
-{AI05-0229-1AI05-0229-1} If the Convention aspect is specified for a
+{<AI05-0229-1AI05-0229-1>} If the Convention aspect is specified for a
type, then the type shall either be compatible with or eligible for the
specified convention.
21.a/3
- Ramification: {AI05-0229-1AI05-0229-1} If a type is derived
- from an L-compatible type, the derived type is by default
- L-compatible, but it is also permitted to specify the
+ Ramification: {<AI05-0229-1AI05-0229-1>} If a type is derived
+ from an <L>-compatible type, the derived type is by default
+ <L>-compatible, but it is also permitted to specify the
Convention aspect for the derived type.
21.b/3
- {AI05-0229-1AI05-0229-1} It is permitted to specify the
+ {<AI05-0229-1AI05-0229-1>} It is permitted to specify the
Convention aspect for an incomplete type, but in the complete
- declaration each component must be L-compatible.
+ declaration each component must be <L>-compatible.
21.c/3
- {AI05-0229-1AI05-0229-1} If each component of a record type is
- L-compatible, then the record type itself is only L-compatible
- if it has a specified Convention.
+ {<AI05-0229-1AI05-0229-1>} If each component of a record type
+ is <L>-compatible, then the record type itself is only
+ <L>-compatible if it has a specified Convention.
22/3
-{AI05-0229-1AI05-0229-1} Notwithstanding any rule to the contrary, a
+{<AI05-0229-1AI05-0229-1>} Notwithstanding any rule to the contrary, a
declaration with a True Import aspect shall not have a completion.
22.a/3
- Discussion: {AI05-0229-1AI05-0229-1} For declarations of
+ Discussion: {<AI05-0229-1AI05-0229-1>} For declarations of
deferred constants and subprograms, we explicitly mention that
no completion is allowed when aspect Import is True. For
other declarations that require completions, we ignore the
@@ -97626,9 +97967,9 @@ declaration with a True Import aspect shall not have a
completion.
normal completion is then not allowed for that declaration.
23/3
-{AI05-0229-1AI05-0229-1} An entity with a True Import aspect (or Export
-aspect) is said to be imported (respectively, exported). An entity
-shall not be both imported and exported.
+{<AI05-0229-1AI05-0229-1>} An entity with a True Import aspect (or
+Export aspect) is said to be <imported> (respectively, <exported>). An
+entity shall not be both imported and exported.
24
The declaration of an imported object shall not include an explicit
@@ -97639,7 +97980,7 @@ initialization expression. [Default initializations
are not performed.]
the Dynamics Semantics paragraphs below.
25/3
-{AI05-0229-1AI05-0229-1} The type of an imported or exported object
+{<AI05-0229-1AI05-0229-1>} The type of an imported or exported object
shall be compatible with the specified Convention aspect, if any.
25.a
@@ -97648,23 +97989,24 @@ shall be compatible with the specified Convention
aspect, if any.
of type Interfaces.C.int would be permitted.
26/3
-{AI05-0229-1AI05-0229-1} For an imported or exported subprogram, the
+{<AI05-0229-1AI05-0229-1>} For an imported or exported subprogram, the
result and parameter types shall each be compatible with the specified
Convention aspect, if any.
27/3
-{AI05-0229-1AI05-0229-1} The aspect_definition (if any) used to directly
-specify an Import, Export, External_Name, or Link_Name aspect shall be a
-static expression. The string_expression of a pragma Linker_Options
-shall be static. An External_Name or Link_Name aspect shall be
-specified only for an entity that is either imported or exported.
+{<AI05-0229-1AI05-0229-1>} The aspect_definition (if any) used to
+directly specify an Import, Export, External_Name, or Link_Name aspect
+shall be a static expression. The <string_>expression of a pragma
+Linker_Options shall be static. An External_Name or Link_Name aspect
+shall be specified only for an entity that is either imported or
+exported.
_Static Semantics_
-Paragraphs 28 and 29 were deleted.
+<Paragraphs 28 and 29 were deleted.>
30/3
-{AI05-0229-1AI05-0229-1} The Convention aspect represents the calling
+{<AI05-0229-1AI05-0229-1>} The Convention aspect represents the calling
convention or representation convention of the entity. For an
access-to-subprogram type, it represents the calling convention of
designated subprograms. In addition:
@@ -97685,12 +98027,12 @@ designated subprograms. In addition:
name, link name, or both may also be specified.
34
-An external name is a string value for the name used by a foreign
+An <external name> is a string value for the name used by a foreign
language program either for an entity that an Ada program imports, or
for referring to an entity that an Ada program exports.
35
-A link name is a string value for the name of an exported or imported
+A <link name> is a string value for the name of an exported or imported
entity, based on the conventions of the foreign language's compiler in
interfacing with the system's linker tool.
@@ -97730,7 +98072,7 @@ implementation defined.
_Dynamic Semantics_
38/3
-{AI05-0229-1AI05-0229-1} Notwithstanding what this International
+{<AI05-0229-1AI05-0229-1>} Notwithstanding what this International
Standard says elsewhere, the elaboration of a declaration with a True
Import aspect does not create the entity. Such an elaboration has no
other effect than to allow the defining name to denote the external
@@ -97739,13 +98081,14 @@ entity.
38.a
Ramification: This implies that default initializations are
skipped. (Explicit initializations are illegal.) For
- example, an imported access object is not initialized to null.
+ example, an imported access object is <not> initialized to
+ null.
38.b/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
38.c/3
- Discussion: {AI05-0229-1AI05-0229-1} This "notwithstanding"
+ Discussion: {<AI05-0229-1AI05-0229-1>} This "notwithstanding"
wording is better than saying "unless aspect Import is True"
on every definition of elaboration. It says we recognize the
contradiction, and this rule takes precedence.
@@ -97753,7 +98096,7 @@ entity.
_Erroneous Execution_
38.1/3
-{AI95-00320-01AI95-00320-01} {AI05-0229-1AI05-0229-1} It is the
+{<AI95-00320-01AI95-00320-01>} {<AI05-0229-1AI05-0229-1>} It is the
programmer's responsibility to ensure that the use of interfacing
aspects does not violate Ada semantics; otherwise, program execution is
erroneous.
@@ -97761,7 +98104,7 @@ erroneous.
_Implementation Advice_
39/3
-{AI05-0229-1AI05-0229-1} If an implementation supports Export for a
+{<AI05-0229-1AI05-0229-1>} If an implementation supports Export for a
given language, then it should also allow the main subprogram to be
written in that language. It should support some mechanism for invoking
the elaboration of the Ada library units included in the system, and for
@@ -97770,7 +98113,7 @@ the recommended mechanism is to provide two subprograms
whose link names
are "adainit" and "adafinal". Adainit should contain the elaboration
code for library units. Adafinal should contain the finalization code.
These subprograms should have no effect the second and subsequent time
-they are called.
+they are called.
39.a.1/3
Implementation Advice: If Export is supported for a language,
@@ -97785,9 +98128,9 @@ they are called.
subprogram, and adafinal after the last.
40/3
-{AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} Automatic elaboration
-of preelaborated packages should be provided when specifying the Export
-aspect as True is supported.
+{<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} Automatic
+elaboration of preelaborated packages should be provided when specifying
+the Export aspect as True is supported.
40.a.1/3
Implementation Advice: Automatic elaboration of preelaborated
@@ -97795,47 +98138,47 @@ aspect as True is supported.
as True is supported.
41/4
-{AI05-0229-1AI05-0229-1} {AI12-0135-1AI12-0135-1} For each supported
-convention L other than Intrinsic, an implementation should support
-specifying the Import and Export aspects for objects of L-compatible
-types and for subprograms, and the Convention aspect for L-eligible
+{<AI05-0229-1AI05-0229-1>} {<AI12-0135-1AI12-0135-1>} For each supported
+convention <L> other than Intrinsic, an implementation should support
+specifying the Import and Export aspects for objects of <L>-compatible
+types and for subprograms, and the Convention aspect for <L>-eligible
types and for subprograms, presuming the other language has
corresponding features. Specifying the Convention aspect need not be
supported for scalar types, other than enumeration types whose internal
codes fall within the range 0 .. 2**15-1.
41.a.1/3
- Implementation Advice: For each supported convention L other
+ Implementation Advice: For each supported convention <L> other
than Intrinsic, specifying the aspects Import and Export
- should be supported for objects of L-compatible types and for
- subprograms, and aspect Convention should be supported for
- L-eligible types and for subprograms.
+ should be supported for objects of <L>-compatible types and
+ for subprograms, and aspect Convention should be supported for
+ <L>-eligible types and for subprograms.
41.a/3
- Reason: {AI05-0229-1AI05-0229-1} Specifying aspect Convention
- is not necessary for scalar types, since the language
- interface packages declare scalar types corresponding to those
- provided by the respective foreign languages.
+ Reason: {<AI05-0229-1AI05-0229-1>} Specifying aspect
+ Convention is not necessary for scalar types, since the
+ language interface packages declare scalar types corresponding
+ to those provided by the respective foreign languages.
41.b/2
- Implementation Note: {AI95-00114-01AI95-00114-01} If an
+ Implementation Note: {<AI95-00114-01AI95-00114-01>} If an
implementation supports interfacing to the C++ entities not
supported by *note B.3::, it should do so via the convention
identifier C_Plus_Plus (in additional to any
C++-implementation-specific ones).
41.c/2
- Reason: {AI95-00114-01AI95-00114-01} The reason for giving the
- advice about C++ is to encourage uniformity among
+ Reason: {<AI95-00114-01AI95-00114-01>} The reason for giving
+ the advice about C++ is to encourage uniformity among
implementations, given that the name of the language is not
syntactically legal as an identifier.
NOTES
42/3
- 1 {AI05-0229-1AI05-0229-1} Implementations may place restrictions
- on interfacing aspects; for example, requiring each exported entity
- to be declared at the library level.
+ 1 {<AI05-0229-1AI05-0229-1>} Implementations may place
+ restrictions on interfacing aspects; for example, requiring each
+ exported entity to be declared at the library level.
42.a
Proof: Arbitrary restrictions are allowed by *note 13.1::.
@@ -97847,7 +98190,7 @@ codes fall within the range 0 .. 2**15-1.
conventions.
43/3
- 2 {AI05-0229-1AI05-0229-1} The Convention aspect in combination
+ 2 {<AI05-0229-1AI05-0229-1>} The Convention aspect in combination
with the Import aspect indicates the conventions for accessing
external entities. It is possible that the actual entity is
written in assembly language, but reflects the conventions of a
@@ -97856,18 +98199,18 @@ codes fall within the range 0 .. 2**15-1.
Ada compiler's calling conventions.
44/3
- 3 {AI05-0229-1AI05-0229-1} To obtain "call-back" to an Ada
+ 3 {<AI05-0229-1AI05-0229-1>} To obtain "call-back" to an Ada
subprogram from a foreign language environment, the Convention
aspect should be specified both for the access-to-subprogram type
and the specific subprogram(s) to which 'Access is applied.
- Paragraphs 45 and 46 were deleted.
+ <Paragraphs 45 and 46 were deleted.>
47
4 See also *note 13.8::, "*note 13.8:: Machine Code Insertions".
47.a/3
- Ramification: {AI05-0229-1AI05-0229-1} The Intrinsic
+ Ramification: {<AI05-0229-1AI05-0229-1>} The Intrinsic
convention (see *note 6.3.1::) implies that the entity is
somehow "built in" to the implementation. Thus, it generally
does not make sense for users to specify Intrinsic along with
@@ -97877,27 +98220,28 @@ codes fall within the range 0 .. 2**15-1.
Intrinsic.
47.b/3
- Discussion: {AI05-0229-1AI05-0229-1} There are many imaginable
- interfacing aspects that don't make any sense. For example,
- setting the Convention of a protected procedure to Ada is
- probably wrong. Rather than enumerating all such cases,
- however, we leave it up to implementations to decide what is
- sensible.
+ Discussion: {<AI05-0229-1AI05-0229-1>} There are many
+ imaginable interfacing aspects that don't make any sense. For
+ example, setting the Convention of a protected procedure to
+ Ada is probably wrong. Rather than enumerating all such
+ cases, however, we leave it up to implementations to decide
+ what is sensible.
48/3
- 5 {AI05-0229-1AI05-0229-1} If both External_Name and Link_Name are
- specified for a given entity, then the External_Name is ignored.
+ 5 {<AI05-0229-1AI05-0229-1>} If both External_Name and Link_Name
+ are specified for a given entity, then the External_Name is
+ ignored.
49/2
- This paragraph was deleted.{AI95-00320-01AI95-00320-01}
+ <This paragraph was deleted.>{<AI95-00320-01AI95-00320-01>}
_Examples_
50/4
-{AI12-0080-1AI12-0080-1} Example of interfacing aspects:
+{<AI12-0080-1AI12-0080-1>} <Example of interfacing aspects:>
51/3
- {AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} package Fortran_Library
is
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} package
Fortran_Library is
function Sqrt (X : Float) return Float
with Import => True, Convention => Fortran;
type Matrix is array (Natural range <>, Natural range <>) of Float
@@ -97916,29 +98260,29 @@ codes fall within the range 0 .. 2**15-1.
_Wording Changes from Ada 95_
51.b/2
- {8652/00588652/0058} {AI95-00036-01AI95-00036-01} Corrigendum:
- Clarified that pragmas Import and Export work like a
- subprogram call; parameters cannot be omitted unless named
- notation is used. (Reordering is still not permitted,
+ {<8652/00588652/0058>} {<AI95-00036-01AI95-00036-01>}
+ Corrigendum: Clarified that pragmas Import and Export work
+ like a subprogram call; parameters cannot be omitted unless
+ named notation is used. (Reordering is still not permitted,
however.)
51.c/2
- {AI95-00320-01AI95-00320-01} Added wording to say all bets are
- off if foreign code doesn't follow the semantics promised by
- the Ada specifications.
+ {<AI95-00320-01AI95-00320-01>} Added wording to say all bets
+ are off if foreign code doesn't follow the semantics promised
+ by the Ada specifications.
_Incompatibilities With Ada 2005_
51.d/3
- {AI05-0002-1AI05-0002-1} Correction: Access types that
+ {<AI05-0002-1AI05-0002-1>} Correction: Access types that
designate unconstrained arrays are no longer defined to be
- L-compatible. Such access-to-arrays require bounds
+ <L>-compatible. Such access-to-arrays require bounds
information, which is likely to be incompatible with a foreign
language. The change will allow (but not require) compilers
to reject bad uses, which probably will not work anyway. Note
that implementations can still support any type that it wants
- as L-compatible; such uses will not be portable, however. As
- such, there should be little existing code that will be
+ as <L>-compatible; such uses will not be portable, however.
+ As such, there should be little existing code that will be
impacted (compilers probably already rejected cases that could
not be translated, whether or not the language allowed doing
so formally).
@@ -97946,17 +98290,17 @@ codes fall within the range 0 .. 2**15-1.
_Extensions to Ada 2005_
51.e/3
- {AI05-0229-1AI05-0229-1} Aspects Convention, Import, Export,
+ {<AI05-0229-1AI05-0229-1>} Aspects Convention, Import, Export,
Link_Name, and External_Name are new; pragmas Convention,
Import, and Export are now obsolescent.
_Extensions to Ada 2012_
51.f/4
- {AI12-0135-1AI12-0135-1} Corrigendum: Added a suggestion that
- convention be supported for enumeration types. This will make
- the use of enumeration types portable for implementations that
- support interfacing to a particular language.
+ {<AI12-0135-1AI12-0135-1>} Corrigendum: Added a suggestion
+ that convention be supported for enumeration types. This will
+ make the use of enumeration types portable for implementations
+ that support interfacing to a particular language.
File: aarm2012.info, Node: B.2, Next: B.3, Prev: B.1, Up: Annex B
@@ -97981,27 +98325,27 @@ assembly language).
The library package Interfaces has the following skeletal declaration:
3
-
+
package Interfaces is
pragma Pure(Interfaces);
4
- type Integer_n is range -2**(n-1) .. 2**(n-1) - 1; --2's complement
+ type Integer_<n> is range -2**(<n>-1) .. 2**(<n>-1) - 1; --<2's
complement>
5
- type Unsigned_n is mod 2**n;
+ type Unsigned_<n> is mod 2**<n>;
6
- function Shift_Left (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Shift_Right (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Shift_Right_Arithmetic (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Rotate_Left (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Rotate_Right (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
+ function Shift_Left (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Shift_Right (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Shift_Right_Arithmetic (Value : Unsigned_<n>; Amount :
Natural)
+ return Unsigned_<n>;
+ function Rotate_Left (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Rotate_Right (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
...
end Interfaces;
@@ -98012,11 +98356,11 @@ An implementation shall provide the following
declarations in the
visible part of package Interfaces:
8
- * Signed and modular integer types of n bits, if supported by the
- target architecture, for each n that is at least the size of a
+ * Signed and modular integer types of <n> bits, if supported by the
+ target architecture, for each <n> that is at least the size of a
storage element and that is a factor of the word size. The names
- of these types are of the form Integer_n for the signed types, and
- Unsigned_n for the modular types;
+ of these types are of the form Integer_<n> for the signed types,
+ and Unsigned_<n> for the modular types;
8.a
Ramification: For example, for a typical 32-bit machine the
@@ -98059,7 +98403,7 @@ visible part of package Interfaces:
10.a
Implementation Note: The names for these floating point types
- are not specified. However, if IEEE arithmetic is supported,
+ are not specified. However, if IEEE arithmetic is supported,
then the names should be IEEE_Float_32 and IEEE_Float_64 for
single and double precision, respectively.
@@ -98075,11 +98419,11 @@ of Interfaces in addition to the ones defined above.
package Interfaces.
11.1/3
-{AI95-00204-01AI95-00204-01} {AI05-0229-1AI05-0229-1} A child package of
-package Interfaces with the name of a convention may be provided
-independently of whether the convention is supported by the Convention
-aspect and vice versa. Such a child package should contain any
-declarations that would be useful for interfacing to the language
+{<AI95-00204-01AI95-00204-01>} {<AI05-0229-1AI05-0229-1>} A child
+package of package Interfaces with the name of a convention may be
+provided independently of whether the convention is supported by the
+Convention aspect and vice versa. Such a child package should contain
+any declarations that would be useful for interfacing to the language
(implementation) represented by the convention. Any declarations useful
for interfacing to any language on the given hardware architecture
should be provided directly in Interfaces.
@@ -98094,15 +98438,15 @@ should be provided directly in Interfaces.
_Implementation Advice_
12/2
-This paragraph was deleted.{AI95-00204-01AI95-00204-01}
+<This paragraph was deleted.>{<AI95-00204-01AI95-00204-01>}
12.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
13/3
-{AI05-0299-1AI05-0299-1} An implementation supporting an interface to C,
-COBOL, or Fortran should provide the corresponding package or packages
-described in the following subclauses.
+{<AI05-0299-1AI05-0299-1>} An implementation supporting an interface to
+C, COBOL, or Fortran should provide the corresponding package or
+packages described in the following subclauses.
13.a.1/2
Implementation Advice: If an interface to C, COBOL, or Fortran
@@ -98123,14 +98467,14 @@ described in the following subclauses.
_Wording Changes from Ada 95_
13.c/2
- {AI95-00204-01AI95-00204-01} Clarified that interfacing to
+ {<AI95-00204-01AI95-00204-01>} Clarified that interfacing to
foreign languages is optional and has the same restrictions as
a Specialized Needs Annex.
_Wording Changes from Ada 2005_
13.d/3
- {AI05-0262-1AI05-0262-1} Move the restrictions on
+ {<AI05-0262-1AI05-0262-1>} Move the restrictions on
implementations of optional features to the start of this
Annex.
@@ -98141,17 +98485,17 @@ B.3 Interfacing with C and C++
==============================
1/4
-{8652/00598652/0059} {AI95-00131-01AI95-00131-01}
-{AI95-00376-01AI95-00376-01} {AI05-0229-1AI05-0229-1}
-{AI12-0028-1AI12-0028-1} The facilities relevant to interfacing with the
-C language and the corresponding subset of the C++ language are the
+{<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+{<AI95-00376-01AI95-00376-01>} {<AI05-0229-1AI05-0229-1>}
+{<AI12-0028-1AI12-0028-1>} The facilities relevant to interfacing with
+the C language and the corresponding subset of the C++ language are the
package Interfaces.C and its children, and support for specifying the
-Convention aspect with convention_identifiers C, C_Pass_By_Copy, and any
-of the C_Variadic_n conventions described below.
+Convention aspect with <convention_>identifiers C, C_Pass_By_Copy, and
+any of the C_Variadic_<n> conventions described below.
2/3
-{AI95-00376-01AI95-00376-01} {AI95-0262-1AI95-0262-1}
-{AI95-0299-1AI95-0299-1} The package Interfaces.C contains the basic
+{<AI95-00376-01AI95-00376-01>} {<AI95-0262-1AI95-0262-1>}
+{<AI95-0299-1AI95-0299-1>} The package Interfaces.C contains the basic
types, constants, and subprograms that allow an Ada program to pass
scalars and strings to C and C++ functions. When this subclause
mentions a C entity, the reference also applies to the corresponding
@@ -98167,62 +98511,62 @@ The library package Interfaces.C has the following
declaration:
pragma Pure(C);
5
- -- Declarations based on C's <limits.h>
+ <-- Declarations based on C's <limits.h>>
6
- CHAR_BIT : constant := implementation-defined; -- typically 8
- SCHAR_MIN : constant := implementation-defined; -- typically -128
- SCHAR_MAX : constant := implementation-defined; -- typically 127
- UCHAR_MAX : constant := implementation-defined; -- typically 255
+ CHAR_BIT : constant := <implementation-defined>; <-- typically 8>
+ SCHAR_MIN : constant := <implementation-defined>; <-- typically -128>
+ SCHAR_MAX : constant := <implementation-defined>; <-- typically 127>
+ UCHAR_MAX : constant := <implementation-defined>; <-- typically 255>
7
- -- Signed and Unsigned Integers
- type int is range implementation-defined;
- type short is range implementation-defined;
- type long is range implementation-defined;
+ <-- Signed and Unsigned Integers>
+ type int is range <implementation-defined>;
+ type short is range <implementation-defined>;
+ type long is range <implementation-defined>;
8
type signed_char is range SCHAR_MIN .. SCHAR_MAX;
for signed_char'Size use CHAR_BIT;
9
- type unsigned is mod implementation-defined;
- type unsigned_short is mod implementation-defined;
- type unsigned_long is mod implementation-defined;
+ type unsigned is mod <implementation-defined>;
+ type unsigned_short is mod <implementation-defined>;
+ type unsigned_long is mod <implementation-defined>;
10
type unsigned_char is mod (UCHAR_MAX+1);
for unsigned_char'Size use CHAR_BIT;
11
- subtype plain_char is implementation-defined;
+ subtype plain_char is <implementation-defined>;
12
- type ptrdiff_t is range implementation-defined;
+ type ptrdiff_t is range <implementation-defined>;
13
- type size_t is mod implementation-defined;
+ type size_t is mod <implementation-defined>;
14
- -- Floating Point
+ <-- Floating Point>
15
- type C_float is digits implementation-defined;
+ type C_float is digits <implementation-defined>;
16
- type double is digits implementation-defined;
+ type double is digits <implementation-defined>;
17
- type long_double is digits implementation-defined;
+ type long_double is digits <implementation-defined>;
18
- -- Characters and Strings
+ <-- Characters and Strings >
19
- type char is <implementation-defined character type>;
+ type char is <<implementation-defined character type>>;
20/1
- {8652/00608652/0060} {AI95-00037-01AI95-00037-01} nul : constant char
:= implementation-defined;
+ {<8652/00608652/0060>} {<AI95-00037-01AI95-00037-01>} nul : constant
char := <implementation-defined>;
21
function To_C (Item : in Character) return char;
@@ -98231,7 +98575,7 @@ The library package Interfaces.C has the following
declaration:
function To_Ada (Item : in char) return Character;
23/3
- {AI05-0229-1AI05-0229-1} {AI05-0269-1AI05-0269-1} type char_array is
array (size_t range <>) of aliased char
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0269-1AI05-0269-1>} type char_array
is array (size_t range <>) of aliased char
with Pack;
for char_array'Component_Size use CHAR_BIT;
@@ -98261,24 +98605,24 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
29
- -- Wide Character and Wide String
+ <-- Wide Character and Wide String>
30/1
- {8652/00608652/0060} {AI95-00037-01AI95-00037-01} type wchar_t is
<implementation-defined character type>;
+ {<8652/00608652/0060>} {<AI95-00037-01AI95-00037-01>} type wchar_t is
<<implementation-defined character type>>;
31/1
- {8652/00608652/0060} {AI95-00037-01AI95-00037-01} wide_nul : constant
wchar_t := implementation-defined;
+ {<8652/00608652/0060>} {<AI95-00037-01AI95-00037-01>} wide_nul :
constant wchar_t := <implementation-defined>;
32
function To_C (Item : in Wide_Character) return wchar_t;
function To_Ada (Item : in wchar_t ) return Wide_Character;
33/3
- {AI05-0229-1AI05-0229-1} type wchar_array is array (size_t range <>)
of aliased wchar_t
+ {<AI05-0229-1AI05-0229-1>} type wchar_array is array (size_t range <>)
of aliased wchar_t
with Pack;
34/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
35
function Is_Nul_Terminated (Item : in wchar_array) return Boolean;
@@ -98306,24 +98650,24 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
39.1/2
- {AI95-00285-01AI95-00285-01} -- ISO/IEC 10646:2003 compatible types
defined by ISO/IEC TR 19769:2004.
+ {<AI95-00285-01AI95-00285-01>} -- <ISO/IEC 10646:2003 compatible types
defined by ISO/IEC TR 19769:2004.>
39.2/2
- {AI95-00285-01AI95-00285-01} type char16_t is <implementation-defined
character type>;
+ {<AI95-00285-01AI95-00285-01>} type char16_t is
<<implementation-defined character type>>;
39.3/2
- char16_nul : constant char16_t := implementation-defined;
+ char16_nul : constant char16_t := <implementation-defined>;
39.4/2
function To_C (Item : in Wide_Character) return char16_t;
function To_Ada (Item : in char16_t) return Wide_Character;
39.5/3
- {AI05-0229-1AI05-0229-1} type char16_array is array (size_t range <>)
of aliased char16_t
+ {<AI05-0229-1AI05-0229-1>} type char16_array is array (size_t range
<>) of aliased char16_t
with Pack;
39.6/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
39.7/2
function Is_Nul_Terminated (Item : in char16_array) return Boolean;
@@ -98349,21 +98693,21 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
39.11/2
- {AI95-00285-01AI95-00285-01} type char32_t is <implementation-defined
character type>;
+ {<AI95-00285-01AI95-00285-01>} type char32_t is
<<implementation-defined character type>>;
39.12/2
- char32_nul : constant char32_t := implementation-defined;
+ char32_nul : constant char32_t := <implementation-defined>;
39.13/2
function To_C (Item : in Wide_Wide_Character) return char32_t;
function To_Ada (Item : in char32_t) return Wide_Wide_Character;
39.14/3
- {AI05-0229-1AI05-0229-1} type char32_array is array (size_t range <>)
of aliased char32_t
+ {<AI05-0229-1AI05-0229-1>} type char32_array is array (size_t range
<>) of aliased char32_t
with Pack;
39.15/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
39.16/2
function Is_Nul_Terminated (Item : in char32_array) return Boolean;
@@ -98402,7 +98746,7 @@ The library package Interfaces.C has the following
declaration:
Each of the types declared in Interfaces.C is C-compatible.
43/2
-{AI95-00285-01AI95-00285-01} The types int, short, long, unsigned,
+{<AI95-00285-01AI95-00285-01>} The types int, short, long, unsigned,
ptrdiff_t, size_t, double, char, wchar_t, char16_t, and char32_t
correspond respectively to the C types having the same names. The types
signed_char, unsigned_short, unsigned_long, unsigned_char, C_float, and
@@ -98431,9 +98775,9 @@ unsigned_char, depending on the C implementation.
Character and the C type char.
46.a.1/1
- Implementation Note: {8652/01148652/0114}
- {AI95-00038-01AI95-00038-01} The To_C and To_Ada functions map
- between corresponding characters, not necessarily between
+ Implementation Note: {<8652/01148652/0114>}
+ {<AI95-00038-01AI95-00038-01>} The To_C and To_Ada functions
+ map between corresponding characters, not necessarily between
characters with the same internal representation.
Corresponding characters are characters defined by the same
enumeration literal, if such exist; otherwise, the
@@ -98469,7 +98813,7 @@ unsigned_char, depending on the C implementation.
return String;
50/2
- {AI95-00258-01AI95-00258-01} The result of To_C is a
+ {<AI95-00258-01AI95-00258-01>} The result of To_C is a
char_array value of length Item'Length (if Append_Nul is
False) or Item'Length+1 (if Append_Nul is True). The lower
bound is 0. For each component Item(I), the corresponding
@@ -98505,8 +98849,7 @@ unsigned_char, depending on the C implementation.
To_C function) to a char, which is assigned to the
corresponding element of Target. If Append_Nul is True, nul
is then assigned to the next element of Target. In either
- case, Count is set to the number of Target elements assigned.
- If Target is not long enough, Constraint_Error is propagated.
+ case, Count is set to the number of Target elements assigned.
If Target is not long enough, Constraint_Error is propagated.
54
For procedure To_Ada, each element of Item (if Trim_Nul is
@@ -98514,7 +98857,7 @@ unsigned_char, depending on the C implementation.
Trim_Nul is True) is converted (via the To_Ada function) to a
Character, which is assigned to the corresponding element of
Target. Count is set to the number of Target elements
- assigned. If Target is not long enough, Constraint_Error is
+ assigned. If Target is not long enough, Constraint_Error is
propagated. If Trim_Nul is True and Item does not contain
nul, then Terminator_Error is propagated.
@@ -98562,7 +98905,7 @@ unsigned_char, depending on the C implementation.
function Is_Nul_Terminated (Item : in char16_array) return Boolean;
60.2/2
- {AI95-00285-01AI95-00285-01} The result of Is_Nul_Terminated
+ {<AI95-00285-01AI95-00285-01>} The result of Is_Nul_Terminated
is True if Item contains char16_nul, and is False otherwise.
60.3/2
@@ -98570,8 +98913,8 @@ unsigned_char, depending on the C implementation.
function To_Ada (Item : in char16_t ) return Wide_Character;
60.4/2
- {AI95-00285-01AI95-00285-01} To_C and To_Ada provide mappings
- between the Ada and C 16-bit character types.
+ {<AI95-00285-01AI95-00285-01>} To_C and To_Ada provide
+ mappings between the Ada and C 16-bit character types.
60.5/2
function To_C (Item : in Wide_String;
@@ -98593,7 +98936,7 @@ unsigned_char, depending on the C implementation.
Trim_Nul : in Boolean := True);
60.6/2
- {AI95-00285-01AI95-00285-01} The To_C and To_Ada subprograms
+ {<AI95-00285-01AI95-00285-01>} The To_C and To_Ada subprograms
that convert between Wide_String and char16_array have
analogous effects to the To_C and To_Ada subprograms that
convert between String and char_array, except that char16_nul
@@ -98603,7 +98946,7 @@ unsigned_char, depending on the C implementation.
function Is_Nul_Terminated (Item : in char32_array) return Boolean;
60.8/2
- {AI95-00285-01AI95-00285-01} The result of Is_Nul_Terminated
+ {<AI95-00285-01AI95-00285-01>} The result of Is_Nul_Terminated
is True if Item contains char16_nul, and is False otherwise.
60.9/2
@@ -98611,8 +98954,8 @@ unsigned_char, depending on the C implementation.
function To_Ada (Item : in char32_t ) return Wide_Wide_Character;
60.10/2
- {AI95-00285-01AI95-00285-01} To_C and To_Ada provide mappings
- between the Ada and C 32-bit character types.
+ {<AI95-00285-01AI95-00285-01>} To_C and To_Ada provide
+ mappings between the Ada and C 32-bit character types.
60.11/2
function To_C (Item : in Wide_Wide_String;
@@ -98634,7 +98977,7 @@ unsigned_char, depending on the C implementation.
Trim_Nul : in Boolean := True);
60.12/2
- {AI95-00285-01AI95-00285-01} The To_C and To_Ada subprograms
+ {<AI95-00285-01AI95-00285-01>} The To_C and To_Ada subprograms
that convert between Wide_Wide_String and char32_array have
analogous effects to the To_C and To_Ada subprograms that
convert between String and char_array, except that char32_nul
@@ -98691,50 +99034,52 @@ unsigned_char, depending on the C implementation.
Interface packages support calling such functions.
60.13/3
-{8652/00598652/0059} {AI95-00131-01AI95-00131-01}
-{AI05-0229-1AI05-0229-1} The Convention aspect with
-convention_identifier C_Pass_By_Copy shall only be specified for a type.
+{<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+{<AI05-0229-1AI05-0229-1>} The Convention aspect with
+<convention_>identifier C_Pass_By_Copy shall only be specified for a
+type.
60.14/2
-{8652/00598652/0059} {AI95-00131-01AI95-00131-01}
-{AI95-00216-01AI95-00216-01} The eligibility rules in *note B.1:: do not
-apply to convention C_Pass_By_Copy. Instead, a type T is eligible for
-convention C_Pass_By_Copy if T is an unchecked union type or if T is a
-record type that has no discriminants and that only has components with
-statically constrained subtypes, and each component is C-compatible.
+{<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+{<AI95-00216-01AI95-00216-01>} The eligibility rules in *note B.1:: do
+not apply to convention C_Pass_By_Copy. Instead, a type T is eligible
+for convention C_Pass_By_Copy if T is an unchecked union type or if T is
+a record type that has no discriminants and that only has components
+with statically constrained subtypes, and each component is
+C-compatible.
60.15/3
-{8652/00598652/0059} {AI95-00131-01AI95-00131-01}
-{AI05-0264-1AI05-0264-1} If a type is C_Pass_By_Copy-compatible, then it
-is also C-compatible.
+{<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+{<AI05-0264-1AI05-0264-1>} If a type is C_Pass_By_Copy-compatible, then
+it is also C-compatible.
60.16/4
-{AI12-0028-1AI12-0028-1} The identifiers C_Variadic_0, C_Variadic_1,
-C_Variadic_2, and so on are convention_identifiers. These conventions
-are said to be C_Variadic. The convention C_Variadic_n is the calling
-convention for a variadic C function taking n fixed parameters and then
-a variable number of additional parameters. The C_Variadic_n convention
-shall only be specified as the convention aspect for a subprogram, or
-for an access-to-subprogram type, having at least n parameters. A type
-is compatible with a C_Variadic convention if and only if the type is
-C-compatible.
+{<AI12-0028-1AI12-0028-1>} The identifiers C_Variadic_0, C_Variadic_1,
+C_Variadic_2, and so on are <convention_>identifiers. These conventions
+are said to be <C_Variadic>. The convention C_Variadic_<n> is the
+calling convention for a variadic C function taking <n> fixed parameters
+and then a variable number of additional parameters. The C_Variadic_<n>
+convention shall only be specified as the convention aspect for a
+subprogram, or for an access-to-subprogram type, having at least <n>
+parameters. A type is compatible with a C_Variadic convention if and
+only if the type is C-compatible.
60.h/4
- To be honest: It is implementation defined what the largest n
- in C_Variadic_n is supported. We don't say this because it
- complicates the wording and it is true for almost any
- convention_identifier (only Ada is required to be supported by
- the language, all others need to be documented in order for
+ To be honest: It is implementation defined what the largest
+ <n> in C_Variadic_<n> is supported. We don't say this because
+ it complicates the wording and it is true for almost any
+ <convention_>identifier (only Ada is required to be supported
+ by the language, all others need to be documented in order for
programmers to know that they are available).
_Implementation Requirements_
61/3
-{8652/00598652/0059} {AI95-00131-01AI95-00131-01}
-{AI05-0229-1AI05-0229-1} An implementation shall support specifying
-aspect Convention with a C convention_identifier for a C-eligible type
+{<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+{<AI05-0229-1AI05-0229-1>} An implementation shall support specifying
+aspect Convention with a C <convention_>identifier for a C-eligible type
(see *note B.1::). An implementation shall support specifying aspect
-Convention with a C_Pass_By_Copy convention_identifier for a
+Convention with a C_Pass_By_Copy <convention_>identifier for a
C_Pass_By_Copy-eligible type.
_Implementation Permissions_
@@ -98744,12 +99089,12 @@ An implementation may provide additional declarations
in the C interface
packages.
62.1/3
-{AI05-0002-1AI05-0002-1} {AI05-0229-1AI05-0229-1} An implementation need
-not support specifying the Convention aspect with convention_identifier
-C in the following cases:
+{<AI05-0002-1AI05-0002-1>} {<AI05-0229-1AI05-0229-1>} An implementation
+need not support specifying the Convention aspect with
+<convention_>identifier C in the following cases:
62.2/3
- * {AI05-0248-1AI05-0248-1} for a subprogram that has a parameter of
+ * {<AI05-0248-1AI05-0248-1>} for a subprogram that has a parameter of
an unconstrained array subtype, unless the Import aspect has the
value True for the subprogram;
@@ -98761,7 +99106,7 @@ C in the following cases:
subtype.
62.a/3
- Implementation Note: {AI05-0002-1AI05-0002-1} These rules
+ Implementation Note: {<AI05-0002-1AI05-0002-1>} These rules
ensure that an implementation never needs to create bounds for
an unconstrained array that originates in C (and thus does not
have bounds). An implementation can do so if it wishes, of
@@ -98773,8 +99118,8 @@ C in the following cases:
_Implementation Advice_
62.5/3
-{8652/00608652/0060} {AI95-00037-01AI95-00037-01}
-{AI95-00285-01AI95-00285-01} The constants nul, wide_nul, char16_nul,
+{<8652/00608652/0060>} {<AI95-00037-01AI95-00037-01>}
+{<AI95-00285-01AI95-00285-01>} The constants nul, wide_nul, char16_nul,
and char32_nul should have a representation of zero.
62.b/2
@@ -98797,10 +99142,10 @@ between Ada and C.
* An Ada function corresponds to a non-void C function.
65.1/4
- * {AI12-0135-1AI12-0135-1} An Ada enumeration type corresponds to a C
- enumeration type with corresponding enumeration literals having the
- same internal codes, provided the internal codes fall within the
- range of the C int type.
+ * {<AI12-0135-1AI12-0135-1>} An Ada enumeration type corresponds to a
+ C enumeration type with corresponding enumeration literals having
+ the same internal codes, provided the internal codes fall within
+ the range of the C int type.
66
* An Ada in scalar parameter is passed as a scalar argument to a C
@@ -98819,15 +99164,15 @@ between Ada and C.
copy is used to preserve by-copy semantics.
68.1/2
- * {8652/00598652/0059} {AI95-00131-01AI95-00131-01}
- {AI95-00343-01AI95-00343-01} An Ada parameter of a (record) type T
- of convention C_Pass_By_Copy, of mode in, is passed as a t argument
- to a C function, where t is the C struct corresponding to the Ada
- type T.
+ * {<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+ {<AI95-00343-01AI95-00343-01>} An Ada parameter of a (record) type
+ T of convention C_Pass_By_Copy, of mode in, is passed as a t
+ argument to a C function, where t is the C struct corresponding to
+ the Ada type T.
69/2
- * {8652/00598652/0059} {AI95-00131-01AI95-00131-01}
- {AI95-00343-01AI95-00343-01} An Ada parameter of a record type T,
+ * {<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+ {<AI95-00343-01AI95-00343-01>} An Ada parameter of a record type T,
of any mode, other than an in parameter of a type of convention
C_Pass_By_Copy, is passed as a t* argument to a C function, where t
is the C struct corresponding to the Ada type T.
@@ -98843,17 +99188,17 @@ between Ada and C.
designated subprogram's specification.
71.1/3
- * {AI05-0002-1AI05-0002-1} An Ada parameter of a private type is
+ * {<AI05-0002-1AI05-0002-1>} An Ada parameter of a private type is
passed as specified for the full view of the type.
71.2/3
- * {AI05-0002-1AI05-0002-1} The rules of correspondence given above
+ * {<AI05-0002-1AI05-0002-1>} The rules of correspondence given above
for parameters of mode in also apply to the return object of a
function.
71.3/3
-This paragraph was deleted.{AI95-00337-01AI95-00337-01}
-{AI05-0002-1AI05-0002-1}
+<This paragraph was deleted.>{<AI95-00337-01AI95-00337-01>}
+{<AI05-0002-1AI05-0002-1>}
71.a/2
Implementation Advice: If C interfacing is supported, the
@@ -98874,38 +99219,38 @@ This paragraph was
deleted.{AI95-00337-01AI95-00337-01}
size_t(Item_Type'Size/CHAR_BIT).
74/2
- This paragraph was deleted.{AI95-00216-01AI95-00216-01}
+ <This paragraph was deleted.>{<AI95-00216-01AI95-00216-01>}
75/4
- 8 {AI12-0028-1AI12-0028-1} A variadic C function can correspond to
- several Ada subprograms, taking various specific numbers and types
- of parameters.
+ 8 {<AI12-0028-1AI12-0028-1>} A variadic C function can correspond
+ to several Ada subprograms, taking various specific numbers and
+ types of parameters.
_Examples_
76
-Example of using the Interfaces.C package:
+<Example of using the Interfaces.C package:>
77
- --Calling the C Library Function strcpy
+ <--Calling the C Library Function strcpy>
with Interfaces.C;
procedure Test is
package C renames Interfaces.C;
use type C.char_array;
- -- Call <string.h>strcpy:
- -- C definition of strcpy: char *strcpy(char *s1, const char *s2);
- -- This function copies the string pointed to by s2 (including the
terminating null character)
- -- into the array pointed to by s1. If copying takes place between
objects that overlap,
- -- the behavior is undefined. The strcpy function returns the
value of s1.
+ <-- Call <string.h>strcpy:>
+ <-- C definition of strcpy: char *strcpy(char *s1, const char *s2);>
+ <-- This function copies the string pointed to by s2 (including the
terminating null character)>
+ <-- into the array pointed to by s1. If copying takes place
between objects that overlap, >
+ <-- the behavior is undefined. The strcpy function returns the
value of s1.>
78/3
- {AI05-0229-1AI05-0229-1} -- Note: since the C function's return value
is of no interest, the Ada interface is a procedure
+ {<AI05-0229-1AI05-0229-1>} <-- Note: since the C function's return
value is of no interest, the Ada interface is a procedure>
procedure Strcpy (Target : out C.char_array;
Source : in C.char_array)
with Import => True, Convention => C, External_Name => "strcpy";
79/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
80
Chars1 : C.char_array(1..20);
@@ -98919,7 +99264,7 @@ Example of using the Interfaces.C package:
Strcpy(Chars1, Chars2);
83
- -- Now Chars1(1..6) = "qwert" & C.Nul
+ <-- Now Chars1(1..6) = "qwert" & C.Nul>
84
end Test;
@@ -98927,54 +99272,54 @@ Example of using the Interfaces.C package:
_Incompatibilities With Ada 95_
84.a/3
- {AI95-00285-01AI95-00285-01} {AI05-0005-1AI05-0005-1} Types
- char16_t and char32_t and their related types and operations
- are added to Interfaces.C. If Interfaces.C is referenced in a
- use_clause, and an entity E with the same defining_identifier
- as a new entity in Interfaces.C is defined in a package that
- is also referenced in a use_clause, the entity E may no longer
- be use-visible, resulting in errors. This should be rare and
- is easily fixed if it does occur.
+ {<AI95-00285-01AI95-00285-01>} {<AI05-0005-1AI05-0005-1>}
+ Types char16_t and char32_t and their related types and
+ operations are added to Interfaces.C. If Interfaces.C is
+ referenced in a use_clause, and an entity <E> with the same
+ defining_identifier as a new entity in Interfaces.C is defined
+ in a package that is also referenced in a use_clause, the
+ entity <E> may no longer be use-visible, resulting in errors.
+ This should be rare and is easily fixed if it does occur.
_Extensions to Ada 95_
84.b/2
- {8652/00598652/0059} {AI95-00131-01AI95-00131-01} Corrigendum:
- Convention C_Pass_By_Copy is new.
+ {<8652/00598652/0059>} {<AI95-00131-01AI95-00131-01>}
+ Corrigendum: Convention C_Pass_By_Copy is new.
_Wording Changes from Ada 95_
84.c/2
- {8652/00608652/0060} {AI95-00037-01AI95-00037-01} Corrigendum:
- Clarified the intent for Nul and Wide_Nul.
+ {<8652/00608652/0060>} {<AI95-00037-01AI95-00037-01>}
+ Corrigendum: Clarified the intent for Nul and Wide_Nul.
84.d/2
- {AI95-00216-01AI95-00216-01} Specified that an unchecked union
- type (see *note B.3.3::) is eligible for convention
+ {<AI95-00216-01AI95-00216-01>} Specified that an unchecked
+ union type (see *note B.3.3::) is eligible for convention
C_Pass_By_Copy.
84.e/2
- {AI95-00258-01AI95-00258-01} Specified what happens if the
+ {<AI95-00258-01AI95-00258-01>} Specified what happens if the
To_C function tries to return a null string.
84.f/2
- {AI95-00337-01AI95-00337-01} Clarified that the interface
+ {<AI95-00337-01AI95-00337-01>} Clarified that the interface
correspondences also apply to private types whose full types
have the specified characteristics.
84.g/2
- {AI95-00343-01AI95-00343-01} Clarified that a type must have
+ {<AI95-00343-01AI95-00343-01>} Clarified that a type must have
convention C_Pass_By_Copy in order to be passed by copy (not
just a type that could have that convention).
84.h/2
- {AI95-00376-01AI95-00376-01} Added wording to make it clear
+ {<AI95-00376-01AI95-00376-01>} Added wording to make it clear
that these facilities can also be used with C++.
_Incompatibilities With Ada 2005_
84.i/3
- {AI05-0002-1AI05-0002-1} Correction: Added a definition of
+ {<AI05-0002-1AI05-0002-1>} Correction: Added a definition of
correspondences for function results. Also added wording to
make it clear that we do not expect the implementation to
conjure bounds for unconstrained arrays out of thin air.
@@ -98987,8 +99332,8 @@ Example of using the Interfaces.C package:
_Extensions to Ada 2012_
84.j/4
- {AI12-0028-1AI12-0028-1} Corrigendum: The
- convention_identifiers C_Variadic_0, C_Variadic_1, and so on
+ {<AI12-0028-1AI12-0028-1>} Corrigendum: The
+ <convention_>identifiers C_Variadic_0, C_Variadic_1, and so on
are new. These are classified as a correction as any
implementation can add such identifiers and it is important
that special conventions be available for variadic functions
@@ -98996,7 +99341,7 @@ Example of using the Interfaces.C package:
variadic C functions.
84.k/4
- {AI12-0135-1AI12-0135-1} Corrigendum: Defined the
+ {<AI12-0135-1AI12-0135-1>} Corrigendum: Defined the
correspondence between an Ada enumeration type and a C
enumeration type; implementations should support convention C
for enumeration types.
@@ -99014,13 +99359,13 @@ B.3.1 The Package Interfaces.C.Strings
--------------------------------------
1/3
-{AI05-0229-1AI05-0229-1} The package Interfaces.C.Strings declares types
-and subprograms allowing an Ada program to allocate, reference, update,
-and free C-style strings. In particular, the private type chars_ptr
-corresponds to a common use of "char *" in C programs, and an object of
-this type can be passed to a subprogram to which with Import => True,
-Convention => C has been specified, and for which "char *" is the type
-of the argument of the C function.
+{<AI05-0229-1AI05-0229-1>} The package Interfaces.C.Strings declares
+types and subprograms allowing an Ada program to allocate, reference,
+update, and free C-style strings. In particular, the private type
+chars_ptr corresponds to a common use of "char *" in C programs, and an
+object of this type can be passed to a subprogram to which with Import
+=> True, Convention => C has been specified, and for which "char *" is
+the type of the argument of the C function.
_Static Semantics_
@@ -99035,11 +99380,11 @@ The library package Interfaces.C.Strings has the
following declaration:
type char_array_access is access all char_array;
5/2
- {AI95-00161-01AI95-00161-01} type chars_ptr is private;
+ {<AI95-00161-01AI95-00161-01>} type chars_ptr is private;
pragma Preelaborable_Initialization(chars_ptr);
6/2
- {AI95-00276-01AI95-00276-01} type chars_ptr_array is array (size_t
range <>) of aliased chars_ptr;
+ {<AI95-00276-01AI95-00276-01>} type chars_ptr_array is array (size_t
range <>) of aliased chars_ptr;
7
Null_Ptr : constant chars_ptr;
@@ -99095,7 +99440,7 @@ The library package Interfaces.C.Strings has the
following declaration:
21
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Interfaces.C.Strings;
21.a
@@ -99130,8 +99475,8 @@ B.1::).
return chars_ptr;
24/3
- {8652/00618652/0061} {AI95-00140-01AI95-00140-01}
- {AI05-0264-1AI05-0264-1} If Item is null, then To_Chars_Ptr
+ {<8652/00618652/0061>} {<AI95-00140-01AI95-00140-01>}
+ {<AI05-0264-1AI05-0264-1>} If Item is null, then To_Chars_Ptr
returns Null_Ptr. If Item is not null, Nul_Check is True, and
Item.all does not contain nul, then the function propagates
Terminator_Error; otherwise, To_Chars_Ptr performs a pointer
@@ -99172,7 +99517,7 @@ B.1::).
function Value (Item : in chars_ptr) return char_array;
34/3
- {AI05-0264-1AI05-0264-1} If Item = Null_Ptr, then Value
+ {<AI05-0264-1AI05-0264-1>} If Item = Null_Ptr, then Value
propagates Dereference_Error. Otherwise, Value returns the
prefix of the array of chars pointed to by Item, up to and
including the first nul. The lower bound of the result is 0.
@@ -99184,8 +99529,8 @@ B.1::).
return char_array;
36/3
- {8652/00628652/0062} {AI95-00139-01AI95-00139-01}
- {AI05-0264-1AI05-0264-1} If Item = Null_Ptr, then Value
+ {<8652/00628652/0062>} {<AI95-00139-01AI95-00139-01>}
+ {<AI05-0264-1AI05-0264-1>} If Item = Null_Ptr, then Value
propagates Dereference_Error. Otherwise, Value returns the
shorter of two arrays, either the first Length chars pointed
to by Item, or Value(Item). The lower bound of the result is
@@ -99207,14 +99552,15 @@ B.1::).
return String;
40/1
- {8652/00638652/0063} {AI95-00177-01AI95-00177-01} Equivalent
- to To_Ada(Value(Item, Length) & nul, Trim_Nul=>True).
+ {<8652/00638652/0063>} {<AI95-00177-01AI95-00177-01>}
+ Equivalent to To_Ada(Value(Item, Length) & nul,
+ Trim_Nul=>True).
41
function Strlen (Item : in chars_ptr) return size_t;
42
- Returns Val'Length-1 where Val = Value(Item); propagates
+ Returns <Val>'Length-1 where <Val> = Value(Item); propagates
Dereference_Error if Item = Null_Ptr.
42.a
@@ -99236,8 +99582,8 @@ B.1::).
Check : Boolean := True);
44/1
- {8652/00648652/0064} {AI95-00039-01AI95-00039-01} If Item =
- Null_Ptr, then Update propagates Dereference_Error.
+ {<8652/00648652/0064>} {<AI95-00039-01AI95-00039-01>} If Item
+ = Null_Ptr, then Update propagates Dereference_Error.
Otherwise, this procedure updates the value pointed to by
Item, starting at position Offset, using Chars as the data to
be copied into the array. Overwriting the nul terminator, and
@@ -99271,12 +99617,12 @@ B.1::).
Check : in Boolean := True);
50/2
- {AI95-00242-01AI95-00242-01} Equivalent to Update(Item,
+ {<AI95-00242-01AI95-00242-01>} Equivalent to Update(Item,
Offset, To_C(Str, Append_Nul => False), Check).
50.a/2
- Discussion: {AI95-00242-01AI95-00242-01} To truncate the Item
- to the length of Str, use Update(Item, Offset, To_C(Str),
+ Discussion: {<AI95-00242-01AI95-00242-01>} To truncate the
+ Item to the length of Str, use Update(Item, Offset, To_C(Str),
Check) instead of Update(Item, Offset, Str, Check). Note that
when truncating Item, Item must be longer than Str.
@@ -99325,24 +99671,24 @@ equal to True would have propagated Update_Error.
_Inconsistencies With Ada 95_
60.a/2
- {AI95-00242-01AI95-00242-01} Amendment Correction: Update for
- a String parameter is now defined to not add a nul character.
- It did add a nul in Ada 95. This means that programs that
- used this behavior of Update to truncate a string will no
- longer work (the string will not be truncated). This change
- makes Update for a string consistent with Update for a
- char_array (no implicit nul is added to the end of a
+ {<AI95-00242-01AI95-00242-01>} Amendment Correction: Update
+ for a String parameter is now defined to not add a nul
+ character. It did add a nul in Ada 95. This means that
+ programs that used this behavior of Update to truncate a
+ string will no longer work (the string will not be truncated).
+ This change makes Update for a string consistent with Update
+ for a char_array (no implicit nul is added to the end of a
char_array).
_Extensions to Ada 95_
60.b/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added
pragma Preelaborable_Initialization to type chars_ptr, so that
it can be used in preelaborated units.
60.c/2
- {AI95-00276-01AI95-00276-01} Amendment Correction: The
+ {<AI95-00276-01AI95-00276-01>} Amendment Correction: The
components of chars_ptr_array are aliased so that it can be
used to instantiate Interfaces.C.Pointers (that is its
intended purpose, which is otherwise mysterious as it has no
@@ -99351,22 +99697,24 @@ equal to True would have propagated Update_Error.
_Wording Changes from Ada 95_
60.d/2
- {8652/00618652/0061} {AI95-00140-01AI95-00140-01} Corrigendum:
- Fixed the missing semantics of To_Char_Ptr when Nul_Check is
- False.
+ {<8652/00618652/0061>} {<AI95-00140-01AI95-00140-01>}
+ Corrigendum: Fixed the missing semantics of To_Char_Ptr when
+ Nul_Check is False.
60.e/2
- {8652/00628652/0062} {AI95-00139-01AI95-00139-01} Corrigendum:
- Fixed the missing semantics of Value when the Length is 0.
+ {<8652/00628652/0062>} {<AI95-00139-01AI95-00139-01>}
+ Corrigendum: Fixed the missing semantics of Value when the
+ Length is 0.
60.f/2
- {8652/00638652/0063} {AI95-00177-01AI95-00177-01} Corrigendum:
- Corrected the definition of Value to avoid raising
- Terminator_Error.
+ {<8652/00638652/0063>} {<AI95-00177-01AI95-00177-01>}
+ Corrigendum: Corrected the definition of Value to avoid
+ raising Terminator_Error.
60.g/2
- {8652/00648652/0064} {AI95-00039-01AI95-00039-01} Corrigendum:
- Fixed the missing semantics of Update when Item is Null_Ptr.
+ {<8652/00648652/0064>} {<AI95-00039-01AI95-00039-01>}
+ Corrigendum: Fixed the missing semantics of Update when Item
+ is Null_Ptr.
File: aarm2012.info, Node: B.3.2, Next: B.3.3, Prev: B.3.1, Up: B.3
@@ -99422,10 +99770,10 @@ declaration:
Pointer_Error : exception;
9
- -- C-style Pointer arithmetic
+ <-- C-style Pointer arithmetic>
10/3
- {AI05-0229-1AI05-0229-1} function "+" (Left : in Pointer; Right : in
ptrdiff_t) return Pointer
+ {<AI05-0229-1AI05-0229-1>} function "+" (Left : in Pointer; Right :
in ptrdiff_t) return Pointer
with Convention => Intrinsic;
function "+" (Left : in ptrdiff_t; Right : in Pointer) return Pointer
with Convention => Intrinsic;
@@ -99435,13 +99783,13 @@ declaration:
with Convention => Intrinsic;
11/3
- {AI05-0229-1AI05-0229-1} procedure Increment (Ref : in out Pointer)
+ {<AI05-0229-1AI05-0229-1>} procedure Increment (Ref : in out Pointer)
with Convention => Intrinsic;
procedure Decrement (Ref : in out Pointer)
with Convention => Intrinsic;
12/3
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
13
function Virtual_Length (Ref : in Pointer;
@@ -99615,7 +99963,7 @@ the array containing the Element designated by Target.
_Examples_
45
-Example of Interfaces.C.Pointers:
+<Example of Interfaces.C.Pointers:>
46
with Interfaces.C.Pointers;
@@ -99643,7 +99991,7 @@ Example of Interfaces.C.Pointers:
end if;
49/1
- {8652/00658652/0065} {AI95-00142-01AI95-00142-01} loop
+ {<8652/00658652/0065>} {<AI95-00142-01AI95-00142-01>} loop
Element := Source_Temp_Ptr.all;
Target_Temp_Ptr.all := Element;
exit when C."="(Element, C.nul);
@@ -99662,20 +100010,20 @@ B.3.3 Unchecked Union Types
---------------------------
1/3
-{AI95-00216-01AI95-00216-01} {AI05-0229-1AI05-0229-1}
-{AI05-0269-1AI05-0269-1} [Specifying aspect Unchecked_Union to have the
-value True defines an interface correspondence between a given
+{<AI95-00216-01AI95-00216-01>} {<AI05-0229-1AI05-0229-1>}
+{<AI05-0269-1AI05-0269-1>} [Specifying aspect Unchecked_Union to have
+the value True defines an interface correspondence between a given
discriminated type and some C union. The aspect requires that the
associated type shall be given a representation that allocates no space
for its discriminant(s).]
-Paragraphs 2 through 3 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 3 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
3.1/3
-{AI05-0229-1AI05-0229-1} For a discriminated record type having a
+{<AI05-0229-1AI05-0229-1>} For a discriminated record type having a
variant_part, the following language-defined representation aspect may
be specified:
@@ -99692,32 +100040,32 @@ Unchecked_Union
_Legality Rules_
-Paragraphs 4 and 5 were deleted.
+<Paragraphs 4 and 5 were deleted.>
6/3
-{AI95-00216-01AI95-00216-01} {AI05-0229-1AI05-0229-1} A type for which
-aspect Unchecked_Union is True is called an unchecked union type. A
-subtype of an unchecked union type is defined to be an unchecked union
-subtype. An object of an unchecked union type is defined to be an
-unchecked union object.
+{<AI95-00216-01AI95-00216-01>} {<AI05-0229-1AI05-0229-1>} A type for
+which aspect Unchecked_Union is True is called an <unchecked union
+type>. A subtype of an unchecked union type is defined to be an
+<unchecked union subtype>. An object of an unchecked union type is
+defined to be an <unchecked union object>.
7/2
-{AI95-00216-01AI95-00216-01} All component subtypes of an unchecked
+{<AI95-00216-01AI95-00216-01>} All component subtypes of an unchecked
union type shall be C-compatible.
8/2
-{AI95-00216-01AI95-00216-01} If a component subtype of an unchecked
+{<AI95-00216-01AI95-00216-01>} If a component subtype of an unchecked
union type is subject to a per-object constraint, then the component
subtype shall be an unchecked union subtype.
9/3
-{AI95-00216-01AI95-00216-01} {AI05-0026-1AI05-0026-1} Any name that
+{<AI95-00216-01AI95-00216-01>} {<AI05-0026-1AI05-0026-1>} Any name that
denotes a discriminant of an object of an unchecked union type shall
occur within the declarative region of the type, and shall not occur
within a record_representation_clause.
10/3
-{AI95-00216-01AI95-00216-01} {AI05-0026-1AI05-0026-1} The type of a
+{<AI95-00216-01AI95-00216-01>} {<AI05-0026-1AI05-0026-1>} The type of a
component declared in a variant_part of an unchecked union type shall
not need finalization. In addition to the places where Legality Rules
normally apply (see *note 12.3::), this rule also applies in the private
@@ -99729,19 +100077,19 @@ formal private type or formal private extension
declared within the
formal part of the generic unit.
10.a/3
- Reason: {AI05-0026-1AI05-0026-1} The last part is a classic
+ Reason: {<AI05-0026-1AI05-0026-1>} The last part is a classic
assume-the-worst rule that avoids dependence on the actuals in
a generic body. We did not include this in the definition of
"needs finalization" as it has a bad interaction with the use
of that term for the No_Nested_Finalization restriction.
11/2
-{AI95-00216-01AI95-00216-01} The completion of an incomplete or private
-type declaration having a known_discriminant_part shall not be an
-unchecked union type.
+{<AI95-00216-01AI95-00216-01>} The completion of an incomplete or
+private type declaration having a known_discriminant_part shall not be
+an unchecked union type.
12/2
-{AI95-00216-01AI95-00216-01} An unchecked union subtype shall only be
+{<AI95-00216-01AI95-00216-01>} An unchecked union subtype shall only be
passed as a generic actual parameter if the corresponding formal type
has no known discriminants or is an unchecked union type.
@@ -99755,19 +100103,19 @@ has no known discriminants or is an unchecked union
type.
_Static Semantics_
13/2
-{AI95-00216-01AI95-00216-01} An unchecked union type is eligible for
+{<AI95-00216-01AI95-00216-01>} An unchecked union type is eligible for
convention C.
14/2
-{AI95-00216-01AI95-00216-01} All objects of an unchecked union type have
-the same size.
+{<AI95-00216-01AI95-00216-01>} All objects of an unchecked union type
+have the same size.
15/2
-{AI95-00216-01AI95-00216-01} Discriminants of objects of an unchecked
+{<AI95-00216-01AI95-00216-01>} Discriminants of objects of an unchecked
union type are of size zero.
16/2
-{AI95-00216-01AI95-00216-01} Any check which would require reading a
+{<AI95-00216-01AI95-00216-01>} Any check which would require reading a
discriminant of an unchecked union object is suppressed (see *note
11.5::). These checks include:
@@ -99797,21 +100145,21 @@ discriminant of an unchecked union object is
suppressed (see *note
_Dynamic Semantics_
20/2
-{AI95-00216-01AI95-00216-01} A view of an unchecked union object
-(including a type conversion or function call) has inferable
-discriminants if it has a constrained nominal subtype, unless the object
-is a component of an enclosing unchecked union object that is subject to
-a per-object constraint and the enclosing object lacks inferable
-discriminants.
+{<AI95-00216-01AI95-00216-01>} A view of an unchecked union object
+(including a type conversion or function call) has <inferable
+discriminants> if it has a constrained nominal subtype, unless the
+object is a component of an enclosing unchecked union object that is
+subject to a per-object constraint and the enclosing object lacks
+inferable discriminants.
21/2
-{AI95-00216-01AI95-00216-01} An expression of an unchecked union type
+{<AI95-00216-01AI95-00216-01>} An expression of an unchecked union type
has inferable discriminants if it is either a name of an object with
inferable discriminants or a qualified expression whose subtype_mark
denotes a constrained subtype.
22/2
-{AI95-00216-01AI95-00216-01} Program_Error is raised in the following
+{<AI95-00216-01AI95-00216-01>} Program_Error is raised in the following
cases:
23/2
@@ -99842,18 +100190,18 @@ cases:
attribute of an unchecked union type if the type lacks default
discriminant values.
-Paragraph 29 was deleted.
+<Paragraph 29 was deleted.>
NOTES
30/2
- 11 {AI95-00216-01AI95-00216-01} The use of an unchecked union to
+ 11 {<AI95-00216-01AI95-00216-01>} The use of an unchecked union to
obtain the effect of an unchecked conversion results in erroneous
execution (see *note 11.5::). Execution of the following example
is erroneous even if Float'Size = Integer'Size:
31/3
- {AI05-0229-1AI05-0229-1} type T (Flag : Boolean := False) is
+ {<AI05-0229-1AI05-0229-1>} type T (Flag : Boolean := False) is
record
case Flag is
when False =>
@@ -99866,18 +100214,18 @@ Paragraph 29 was deleted.
32/2
X : T;
- Y : Integer := X.F2; -- erroneous
+ Y : Integer := X.F2; -- <erroneous>
_Extensions to Ada 95_
32.a/2
- {AI95-00216-01AI95-00216-01} Pragma Unchecked_Union is new.
+ {<AI95-00216-01AI95-00216-01>} Pragma Unchecked_Union is new.
_Incompatibilities With Ada 2005_
32.b/3
- {AI05-0026-1AI05-0026-1} Correction: The use of discriminants
- on Unchecked_Union types is now illegal in
+ {<AI05-0026-1AI05-0026-1>} Correction: The use of
+ discriminants on Unchecked_Union types is now illegal in
record_representation_clauses, as it makes no sense to specify
a position for something that is not supposed to exist. It is
very unlikely that this change will have any impact on
@@ -99886,15 +100234,15 @@ Paragraph 29 was deleted.
_Extensions to Ada 2005_
32.c/3
- {AI05-0229-1AI05-0229-1} Aspect Unchecked_Union is new; pragma
- Unchecked_Union is now obsolescent.
+ {<AI05-0229-1AI05-0229-1>} Aspect Unchecked_Union is new;
+ pragma Unchecked_Union is now obsolescent.
_Wording Changes from Ada 2005_
32.d/3
- {AI05-0026-1AI05-0026-1} Correction: Revised the rules to use
- the "needs finalization" definition, and eliminated generic
- contract issues.
+ {<AI05-0026-1AI05-0026-1>} Correction: Revised the rules to
+ use the "needs finalization" definition, and eliminated
+ generic contract issues.
File: aarm2012.info, Node: B.4, Next: B.5, Prev: B.3, Up: Annex B
@@ -99903,9 +100251,9 @@ B.4 Interfacing with COBOL
==========================
1/3
-{AI05-0229-1AI05-0229-1} The facilities relevant to interfacing with the
-COBOL language are the package Interfaces.COBOL and support for
-specifying the Convention aspect with convention_identifier COBOL.
+{<AI05-0229-1AI05-0229-1>} The facilities relevant to interfacing with
+the COBOL language are the package Interfaces.COBOL and support for
+specifying the Convention aspect with <convention_>identifier COBOL.
2
The COBOL interface package supplies several sets of facilities:
@@ -99936,36 +100284,36 @@ The library package Interfaces.COBOL has the
following declaration:
pragma Preelaborate(COBOL);
8
- -- Types and operations for internal data representations
+ <-- Types and operations for internal data representations>
9
- type Floating is digits implementation-defined;
- type Long_Floating is digits implementation-defined;
+ type Floating is digits <implementation-defined>;
+ type Long_Floating is digits <implementation-defined>;
10
- type Binary is range implementation-defined;
- type Long_Binary is range implementation-defined;
+ type Binary is range <implementation-defined>;
+ type Long_Binary is range <implementation-defined>;
11
- Max_Digits_Binary : constant := implementation-defined;
- Max_Digits_Long_Binary : constant := implementation-defined;
+ Max_Digits_Binary : constant := <implementation-defined>;
+ Max_Digits_Long_Binary : constant := <implementation-defined>;
12/3
- {AI05-0229-1AI05-0229-1} type Decimal_Element is mod
implementation-defined;
+ {<AI05-0229-1AI05-0229-1>} type Decimal_Element is mod
<implementation-defined>;
type Packed_Decimal is array (Positive range <>) of Decimal_Element
with Pack;
13
- type COBOL_Character is implementation-defined character type;
+ type COBOL_Character is <implementation-defined character type>;
14
- Ada_To_COBOL : array (Character) of COBOL_Character :=
implementation-defined;
+ Ada_To_COBOL : array (Character) of COBOL_Character :=
<implementation-defined>;
15
- COBOL_To_Ada : array (COBOL_Character) of Character :=
implementation-defined;
+ COBOL_To_Ada : array (COBOL_Character) of Character :=
<implementation-defined>;
16/3
- {AI05-0229-1AI05-0229-1} type Alphanumeric is array (Positive range
<>) of COBOL_Character
+ {<AI05-0229-1AI05-0229-1>} type Alphanumeric is array (Positive range
<>) of COBOL_Character
with Pack;
17
@@ -99983,11 +100331,11 @@ The library package Interfaces.COBOL has the
following declaration:
Last : out Natural);
20/3
- {AI05-0229-1AI05-0229-1} type Numeric is array (Positive range <>) of
COBOL_Character
+ {<AI05-0229-1AI05-0229-1>} type Numeric is array (Positive range <>)
of COBOL_Character
with Pack;
21
- -- Formats for COBOL data representations
+ <-- Formats for COBOL data representations>
22
type Display_Format is private;
@@ -100015,10 +100363,10 @@ The library package Interfaces.COBOL has the
following declaration:
Packed_Signed : constant Packed_Format;
28
- -- Types for external representation of COBOL binary data
+ <-- Types for external representation of COBOL binary data>
29/3
- {AI05-0229-1AI05-0229-1} type Byte is mod 2**COBOL_Character'Size;
+ {<AI05-0229-1AI05-0229-1>} type Byte is mod 2**COBOL_Character'Size;
type Byte_Array is array (Positive range <>) of Byte
with Pack;
@@ -100031,7 +100379,7 @@ The library package Interfaces.COBOL has the
following declaration:
package Decimal_Conversions is
32
- -- Display Formats: data values are represented as Numeric
+ <-- Display Formats: data values are represented as Numeric>
33
function Valid (Item : in Numeric;
@@ -100049,7 +100397,7 @@ The library package Interfaces.COBOL has the
following declaration:
Format : in Display_Format) return Numeric;
37
- -- Packed Formats: data values are represented as Packed_Decimal
+ <-- Packed Formats: data values are represented as Packed_Decimal>
38
function Valid (Item : in Packed_Decimal;
@@ -100067,7 +100415,7 @@ The library package Interfaces.COBOL has the
following declaration:
Format : in Packed_Format) return
Packed_Decimal;
42
- -- Binary Formats: external data values are represented as
Byte_Array
+ <-- Binary Formats: external data values are represented as
Byte_Array>
43
function Valid (Item : in Byte_Array;
@@ -100083,7 +100431,7 @@ The library package Interfaces.COBOL has the
following declaration:
Format : in Binary_Format) return Byte_Array;
46
- -- Internal Binary formats: data values are of type Binary or
Long_Binary
+ <-- Internal Binary formats: data values are of type Binary or
Long_Binary>
47
function To_Decimal (Item : in Binary) return Num;
@@ -100098,7 +100446,7 @@ The library package Interfaces.COBOL has the
following declaration:
50
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Interfaces.COBOL;
50.a/1
@@ -100150,8 +100498,8 @@ parameter.
Each of the procedures To_COBOL and To_Ada copies converted elements
from Item to Target, using the appropriate mapping (Ada_To_COBOL or
COBOL_To_Ada, respectively). The index in Target of the last element
-assigned is returned in Last (0 if Item is a null array). If Item'Length
-exceeds Target'Length, Constraint_Error is propagated.
+assigned is returned in Last (0 if Item is a null array). If
+Item'Length exceeds Target'Length, Constraint_Error is propagated.
59
Type Numeric corresponds to COBOL's numeric data category with display
@@ -100177,20 +100525,20 @@ implementation.
apply:
63/3
- * {8652/00668652/0066} {AI95-00071-01AI95-00071-01}
- {AI05-0264-1AI05-0264-1} Format=Unsigned: if Item
+ * {<8652/00668652/0066>} {<AI95-00071-01AI95-00071-01>}
+ {<AI05-0264-1AI05-0264-1>} Format=Unsigned: if Item
comprises one or more decimal digit characters, then
Valid returns True, else it returns False.
64/1
- * {8652/00668652/0066} {AI95-00071-01AI95-00071-01}
+ * {<8652/00668652/0066>} {<AI95-00071-01AI95-00071-01>}
Format=Leading_Separate: if Item comprises a single
occurrence of the plus or minus sign character, and then
one or more decimal digit characters, then Valid returns
True, else it returns False.
65/1
- * {8652/00668652/0066} {AI95-00071-01AI95-00071-01}
+ * {<8652/00668652/0066>} {<AI95-00071-01AI95-00071-01>}
Format=Trailing_Separate: if Item comprises one or more
decimal digit characters and finally a plus or minus sign
character, then Valid returns True, else it returns
@@ -100225,7 +100573,7 @@ implementation.
Format : in Display_Format) return Numeric;
71/1
- {8652/00678652/0067} {AI95-00072-01AI95-00072-01} This
+ {<8652/00678652/0067>} {<AI95-00072-01AI95-00072-01>} This
function returns the Numeric value for Item, represented in
accordance with Format. The length of the returned value is
Length(Format), and the lower bound is 1. Conversion_Error is
@@ -100264,7 +100612,7 @@ implementation.
Format : in Packed_Format) return Packed_Decimal;
79/1
- {8652/00678652/0067} {AI95-00072-01AI95-00072-01} This
+ {<8652/00678652/0067>} {<AI95-00072-01AI95-00072-01>} This
function returns the Packed_Decimal value for Item,
represented in accordance with Format. The length of the
returned value is Length(Format), and the lower bound is 1.
@@ -100307,7 +100655,7 @@ implementation.
Format : in Binary_Format) return Byte_Array;
87/1
- {8652/00678652/0067} {AI95-00072-01AI95-00072-01} This
+ {<8652/00678652/0067>} {<AI95-00072-01AI95-00072-01>} This
function returns the Byte_Array value for Item, represented in
accordance with Format. The length of the returned value is
Length(Format), and the lower bound is 1.
@@ -100403,7 +100751,7 @@ implementation.
(e.g., signed leading separate, etc.)
91.j/3
- {AI05-0229-1AI05-0229-1} The Convention of a record type may
+ {<AI05-0229-1AI05-0229-1>} The Convention of a record type may
be specified as COBOL to direct the compiler to choose a
COBOL-compatible representation for objects of the type.
@@ -100423,8 +100771,8 @@ implementation.
_Implementation Requirements_
92/3
-{AI05-0229-1AI05-0229-1} An implementation shall support specifying
-aspect Convention with a COBOL convention_identifier for a
+{<AI05-0229-1AI05-0229-1>} An implementation shall support specifying
+aspect Convention with a COBOL <convention>_identifier for a
COBOL-eligible type (see *note B.1::).
92.a
@@ -100479,7 +100827,7 @@ correspondences between Ada and COBOL.
NOTES
99/3
- 12 {AI05-0229-1AI05-0229-1} An implementation is not required to
+ 12 {<AI05-0229-1AI05-0229-1>} An implementation is not required to
support specifying aspect Convention for access types, nor is it
required to support specifying aspects Import, Export, or
Convention for functions.
@@ -100495,21 +100843,21 @@ correspondences between Ada and COBOL.
_Examples_
101
-Examples of Interfaces.COBOL:
+<Examples of Interfaces.COBOL:>
102
with Interfaces.COBOL;
procedure Test_Call is
103
- -- Calling a foreign COBOL program
- -- Assume that a COBOL program PROG has the following declaration
- -- in its LINKAGE section:
- -- 01 Parameter-Area
- -- 05 NAME PIC X(20).
- -- 05 SSN PIC X(9).
- -- 05 SALARY PIC 99999V99 USAGE COMP.
- -- The effect of PROG is to update SALARY based on some algorithm
+ <-- Calling a foreign COBOL program>
+ <-- Assume that a COBOL program PROG has the following declaration>
+ <-- in its LINKAGE section:>
+ <-- 01 Parameter-Area>
+ <-- 05 NAME PIC X(20).>
+ <-- 05 SSN PIC X(9).>
+ <-- 05 SALARY PIC 99999V99 USAGE COMP.>
+ <-- The effect of PROG is to update SALARY based on some algorithm>
104
package COBOL renames Interfaces.COBOL;
@@ -100518,16 +100866,16 @@ Examples of Interfaces.COBOL:
type Salary_Type is delta 0.01 digits 7;
106/3
- {AI05-0229-1AI05-0229-1} type COBOL_Record is
+ {<AI05-0229-1AI05-0229-1>} type COBOL_Record is
record
Name : COBOL.Numeric(1..20);
SSN : COBOL.Numeric(1..9);
- Salary : COBOL.Binary; -- Assume Binary = 32 bits
+ Salary : COBOL.Binary; <-- Assume Binary = 32 bits>
end record
with Convention => COBOL;
107/3
- {AI05-0229-1AI05-0229-1} procedure Prog (Item : in out COBOL_Record)
+ {<AI05-0229-1AI05-0229-1>} procedure Prog (Item : in out COBOL_Record)
with Import => True, Convention => COBOL;
108
@@ -100549,20 +100897,20 @@ Examples of Interfaces.COBOL:
111
with Interfaces.COBOL;
- with COBOL_Sequential_IO; -- Assumed to be supplied by implementation
+ with COBOL_Sequential_IO; <-- Assumed to be supplied by implementation>
procedure Test_External_Formats is
112
- -- Using data created by a COBOL program
- -- Assume that a COBOL program has created a sequential file with
- -- the following record structure, and that we need to
- -- process the records in an Ada program
- -- 01 EMPLOYEE-RECORD
- -- 05 NAME PIC X(20).
- -- 05 SSN PIC X(9).
- -- 05 SALARY PIC 99999V99 USAGE COMP.
- -- 05 ADJUST PIC S999V999 SIGN LEADING SEPARATE.
- -- The COMP data is binary (32 bits), high-order byte first
+ <-- Using data created by a COBOL program>
+ <-- Assume that a COBOL program has created a sequential file with>
+ <-- the following record structure, and that we need to>
+ <-- process the records in an Ada program>
+ <-- 01 EMPLOYEE-RECORD>
+ <-- 05 NAME PIC X(20).>
+ <-- 05 SSN PIC X(9).>
+ <-- 05 SALARY PIC 99999V99 USAGE COMP.>
+ <-- 05 ADJUST PIC S999V999 SIGN LEADING SEPARATE.>
+ <-- The COMP data is binary (32 bits), high-order byte first>
113
package COBOL renames Interfaces.COBOL;
@@ -100572,12 +100920,12 @@ Examples of Interfaces.COBOL:
type Adjustments_Type is delta 0.001 digits 6;
115/3
- {AI05-0229-1AI05-0229-1} type COBOL_Employee_Record_Type is --
External representation
+ {<AI05-0229-1AI05-0229-1>} type COBOL_Employee_Record_Type is <--
External representation>
record
Name : COBOL.Alphanumeric(1..20);
SSN : COBOL.Alphanumeric(1..9);
Salary : COBOL.Byte_Array(1..4);
- Adjust : COBOL.Numeric(1..7); -- Sign and 6 digits
+ Adjust : COBOL.Numeric(1..7); <-- Sign and 6 digits>
end record
with Convention => COBOL;
@@ -100590,7 +100938,7 @@ Examples of Interfaces.COBOL:
COBOL_File : File_Type;
118
- type Ada_Employee_Record_Type is -- Internal representation
+ type Ada_Employee_Record_Type is <-- Internal representation>
record
Name : String(1..20);
SSN : String(1..9);
@@ -100627,7 +100975,7 @@ Examples of Interfaces.COBOL:
To_Decimal(COBOL_Record.Salary, COBOL.High_Order_First);
Ada_Record.Adjust :=
To_Decimal(COBOL_Record.Adjust, COBOL.Leading_Separate);
- ... -- Process Ada_Record
+ ... <-- Process Ada_Record>
end loop;
exception
when End_Error => ...
@@ -100636,13 +100984,13 @@ Examples of Interfaces.COBOL:
_Wording Changes from Ada 95_
124.a/2
- {8652/00668652/0066} {AI95-00071-01AI95-00071-01} Corrigendum:
- Corrected the definition of Valid to match COBOL.
+ {<8652/00668652/0066>} {<AI95-00071-01AI95-00071-01>}
+ Corrigendum: Corrected the definition of Valid to match COBOL.
124.b/2
- {8652/00678652/0067} {AI95-00072-01AI95-00072-01} Corrigendum:
- Specified the bounds of the results of To_Display, To_Packed,
- and To_Binary.
+ {<8652/00678652/0067>} {<AI95-00072-01AI95-00072-01>}
+ Corrigendum: Specified the bounds of the results of
+ To_Display, To_Packed, and To_Binary.
File: aarm2012.info, Node: B.5, Prev: B.4, Up: Annex B
@@ -100651,9 +100999,9 @@ B.5 Interfacing with Fortran
============================
1/3
-{AI05-0229-1AI05-0229-1} The facilities relevant to interfacing with the
-Fortran language are the package Interfaces.Fortran and support for
-specifying the Convention aspect with convention_identifier Fortran.
+{<AI05-0229-1AI05-0229-1>} The facilities relevant to interfacing with
+the Fortran language are the package Interfaces.Fortran and support for
+specifying the Convention aspect with <convention_>identifier Fortran.
2
The package Interfaces.Fortran defines Ada types whose representations
@@ -100668,17 +101016,17 @@ used to pass objects between Ada and Fortran
programs.
The library package Interfaces.Fortran has the following declaration:
4
- with Ada.Numerics.Generic_Complex_Types; -- see *note G.1.1::
+ with Ada.Numerics.Generic_Complex_Types; <-- see *note G.1.1::>
pragma Elaborate_All(Ada.Numerics.Generic_Complex_Types);
package Interfaces.Fortran is
pragma Pure(Fortran);
5
- type Fortran_Integer is range implementation-defined;
+ type Fortran_Integer is range <implementation-defined>;
6
- type Real is digits implementation-defined;
- type Double_Precision is digits implementation-defined;
+ type Real is digits <implementation-defined>;
+ type Double_Precision is digits <implementation-defined>;
7
type Logical is new Boolean;
@@ -100696,10 +101044,10 @@ The library package Interfaces.Fortran has the
following declaration:
j : Imaginary renames Single_Precision_Complex_Types.j;
11
- type Character_Set is implementation-defined character type;
+ type Character_Set is <implementation-defined character type>;
12/3
- {AI05-0229-1AI05-0229-1} type Fortran_Character is array (Positive
range <>) of Character_Set
+ {<AI05-0229-1AI05-0229-1>} type Fortran_Character is array (Positive
range <>) of Character_Set
with Pack;
13
@@ -100750,8 +101098,8 @@ found in Interfaces.COBOL.
_Implementation Requirements_
20/3
-{AI05-0229-1AI05-0229-1} An implementation shall support specifying
-aspect Convention with a Fortran convention_identifier for a
+{<AI05-0229-1AI05-0229-1>} An implementation shall support specifying
+aspect Convention with a Fortran <convention>_identifier for a
Fortran-eligible type (see *note B.1::).
_Implementation Permissions_
@@ -100760,16 +101108,17 @@ Fortran-eligible type (see *note B.1::).
An implementation may add additional declarations to the Fortran
interface packages. For example, the Fortran interface package for an
implementation of Fortran 77 (ANSI X3.9-1978) that defines types like
-Integer*n, Real*n, Logical*n, and Complex*n may contain the declarations
-of types named Integer_Star_n, Real_Star_n, Logical_Star_n, and
-Complex_Star_n. (This convention should not apply to Character*n, for
-which the Ada analog is the constrained array subtype Fortran_Character
-(1..n).) Similarly, the Fortran interface package for an implementation
-of Fortran 90 that provides multiple kinds of intrinsic types, e.g.
-Integer (Kind=n), Real (Kind=n), Logical (Kind=n), Complex (Kind=n), and
-Character (Kind=n), may contain the declarations of types with the
-recommended names Integer_Kind_n, Real_Kind_n, Logical_Kind_n,
-Complex_Kind_n, and Character_Kind_n.
+Integer*<n>, Real*<n>, Logical*<n>, and Complex*<n> may contain the
+declarations of types named Integer_Star_<n>, Real_Star_<n>,
+Logical_Star_<n>, and Complex_Star_<n>. (This convention should not
+apply to Character*<n>, for which the Ada analog is the constrained
+array subtype Fortran_Character (1..<n>).) Similarly, the Fortran
+interface package for an implementation of Fortran 90 that provides
+multiple <kinds> of intrinsic types, e.g. Integer (Kind=<n>), Real
+(Kind=<n>), Logical (Kind=<n>), Complex (Kind=<n>), and Character
+(Kind=<n>), may contain the declarations of types with the recommended
+names Integer_Kind_<n>, Real_Kind_<n>, Logical_Kind_<n>,
+Complex_Kind_<n>, and Character_Kind_<n>.
21.a
Discussion: Implementations may add auxiliary declarations as
@@ -100823,7 +101172,7 @@ correspondences between Ada and Fortran:
_Examples_
28
-Example of Interfaces.Fortran:
+<Example of Interfaces.Fortran:>
29
with Interfaces.Fortran;
@@ -100831,12 +101180,12 @@ Example of Interfaces.Fortran:
procedure Ada_Application is
30/3
- {AI05-0229-1AI05-0229-1} type Fortran_Matrix is array (Integer range
<>,
+ {<AI05-0229-1AI05-0229-1>} type Fortran_Matrix is array (Integer range
<>,
Integer range <>) of Double_Precision
- with Convention => Fortran; -- stored in Fortran's
- -- column-major order
+ with Convention => Fortran; <-- stored in
Fortran's>
+ <-- column-major order>
procedure Invert (Rank : in Fortran_Integer; X : in out Fortran_Matrix)
- with Import => True, Convention => Fortran; -- a Fortran subroutine
+ with Import => True, Convention => Fortran; <-- a Fortran
subroutine>
31
Rank : constant Fortran_Integer := 100;
@@ -100889,7 +101238,7 @@ C.1 Access to Machine Operations
================================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies rules regarding
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies rules regarding
access to machine instructions from within an Ada program.]
1.a/2
@@ -100924,9 +101273,9 @@ target environment, including privileged
instructions, if any.
systems programs that run in privileged mode.
4/3
-{AI05-0229-1AI05-0229-1} The support for interfacing aspects (see *note
-Annex B::) should include interface to assembler; the default assembler
-should be associated with the convention identifier Assembler.
+{<AI05-0229-1AI05-0229-1>} The support for interfacing aspects (see
+*note Annex B::) should include interface to assembler; the default
+assembler should be associated with the convention identifier Assembler.
4.a/2
Implementation Advice: Interface to assembler should be
@@ -100971,7 +101320,7 @@ entities.
machine code insertions.
8/3
-{AI05-0229-1AI05-0229-1} The implementation shall document the
+{<AI05-0229-1AI05-0229-1>} The implementation shall document the
subprogram calling conventions associated with the convention
identifiers available for use with the Convention aspect (Ada and
Assembler, at a minimum), including register saving, exception
@@ -100988,7 +101337,7 @@ designator, if not, and the external link name used
for such a
subprogram.
9.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
9.b/2
Documentation Requirement: The mapping between the Link_Name
@@ -101016,7 +101365,7 @@ constructs. Examples of such instructions include:
and swap, decrement and test, enqueue/dequeue.
13
- * Standard numeric functions -- e.g., sin, log.
+ * Standard numeric functions -- e.g., <sin>, <log>.
14
* String manipulation operations -- e.g., translate and test.
@@ -101039,14 +101388,14 @@ C.2 Required Representation Support
===================================
1/3
-{AI95-00434-01AI95-00434-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00434-01AI95-00434-01>} {<AI05-0299-1AI05-0299-1>} This subclause
specifies minimal requirements on the support for representation items
and related features.
_Implementation Requirements_
2/3
-{AI05-0299-1AI05-0299-1} The implementation shall support at least the
+{<AI05-0299-1AI05-0299-1>} The implementation shall support at least the
functionality defined by the recommended levels of support in Clause
*note 13::.
@@ -101057,33 +101406,33 @@ C.3 Interrupt Support
=====================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies the language-defined
-model for hardware interrupts in addition to mechanisms for handling
-interrupts.]
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies the
+language-defined model for hardware interrupts in addition to mechanisms
+for handling interrupts.]
_Dynamic Semantics_
2
-[An interrupt represents a class of events that are detected by the
-hardware or the system software.] Interrupts are said to occur. An
-occurrence of an interrupt is separable into generation and delivery.
-Generation of an interrupt is the event in the underlying hardware or
-system that makes the interrupt available to the program. Delivery is
+[An <interrupt> represents a class of events that are detected by the
+hardware or the system software.] Interrupts are said to occur. An
+<occurrence> of an interrupt is separable into generation and
delivery.<Generation> of an interrupt is the event in the underlying hardware or
+system that makes the interrupt available to the program. <Delivery> is
the action that invokes part of the program as response to the interrupt
-occurrence. Between generation and delivery, the interrupt occurrence
-[(or interrupt)] is pending. Some or all interrupts may be blocked.
+occurrence. Between generation and delivery, the interrupt occurrence
+[(or interrupt)] is <pending>. Some or all interrupts may be <blocked>.
When an interrupt is blocked, all occurrences of that interrupt are
-prevented from being delivered. Certain interrupts are reserved. The
+prevented from being delivered. Certain interrupts are <reserved>. The
set of reserved interrupts is implementation defined. A reserved
interrupt is either an interrupt for which user-defined handlers are not
supported, or one which already has an attached handler by some other
-implementation-defined means. Program units can be connected to
+implementation-defined means. Program units can be connected to
nonreserved interrupts. While connected, the program unit is said to be
-attached to that interrupt. The execution of that program unit, the
-interrupt handler, is invoked upon delivery of the interrupt occurrence.
+<attached> to that interrupt. The execution of that program unit, the
+<interrupt handler>, is invoked upon delivery of the interrupt
+occurrence.
2.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
2.b
To be honest: As an obsolescent feature, interrupts may be
@@ -101101,7 +101450,7 @@ prevented from being delivered. Whether such
occurrences remain pending
or are lost is implementation defined.
5
-Each interrupt has a default treatment which determines the system's
+Each interrupt has a <default treatment> which determines the system's
response to an occurrence of that interrupt when no user-defined handler
is attached. The set of possible default treatments is implementation
defined, as is the method (if one exists) for configuring the default
@@ -101204,7 +101553,7 @@ The implementation shall document the following items:
_Implementation Permissions_
23/2
-{AI95-00434-01AI95-00434-01} If the underlying system or hardware does
+{<AI95-00434-01AI95-00434-01>} If the underlying system or hardware does
not allow interrupts to be blocked, then no blocking is required [as
part of the execution of subprograms of a protected object for which one
of its subprograms is an interrupt handler].
@@ -101237,7 +101586,7 @@ execution of interrupt handlers.
behavior of the implementation.
26/3
-{AI95-00434-01AI95-00434-01} {AI05-0299-1AI05-0299-1} Other forms of
+{<AI95-00434-01AI95-00434-01>} {<AI05-0299-1AI05-0299-1>} Other forms of
handlers are allowed to be supported, in which case the rules of this
subclause should be adhered to.
@@ -101248,7 +101597,7 @@ to vary from one occurrence of the same interrupt to
another.
_Implementation Advice_
28/2
-{AI95-00434-01AI95-00434-01} If the Ceiling_Locking policy is not in
+{<AI95-00434-01AI95-00434-01>} If the Ceiling_Locking policy is not in
effect, the implementation should provide means for the application to
specify which interrupts are to be blocked during protected actions, if
the underlying system allows for finer-grained control of interrupt
@@ -101292,13 +101641,13 @@ File: aarm2012.info, Node: C.3.1, Next: C.3.2,
Up: C.3
C.3.1 Protected Procedure Handlers
----------------------------------
-Paragraphs 1 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 1 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
6.1/3
-{AI05-0229-1AI05-0229-1} For a parameterless protected procedure, the
+{<AI05-0229-1AI05-0229-1>} For a parameterless protected procedure, the
following language-defined representation aspects may be specified:
6.2/3
@@ -101325,15 +101674,15 @@ Attach_Handler
_Legality Rules_
7/3
-{AI95-00434-01AI95-00434-01} {AI05-0033-1AI05-0033-1}
-{AI05-0229-1AI05-0229-1} If either the Attach_Handler or
+{<AI95-00434-01AI95-00434-01>} {<AI05-0033-1AI05-0033-1>}
+{<AI05-0229-1AI05-0229-1>} If either the Attach_Handler or
Interrupt_Handler aspect are specified for a protected procedure, the
corresponding protected_type_declaration (*note 9.4: S0210.) or
single_protected_declaration (*note 9.4: S0211.) shall be a
library-level declaration and shall not be declared within a generic
-body. In addition to the places where Legality Rules normally apply (see
-*note 12.3::), this rule also applies in the private part of an instance
-of a generic unit.
+body. In addition to the places where Legality Rules normally apply
+(see *note 12.3::), this rule also applies in the private part of an
+instance of a generic unit.
7.a
Discussion: In the case of a protected_type_declaration, an
@@ -101341,51 +101690,51 @@ of a generic unit.
library level.
7.b/3
- {AI05-0033-1AI05-0033-1} {AI05-0229-1AI05-0229-1} We cannot
- allow these aspects in protected declarations in a generic
- body, because legality rules are not checked for instance
- bodies, and these should not be allowed if the instance is not
- at the library level. The protected types can be declared in
- the private part if this is desired. Note that while the
- 'Access to use the handler would provide the check in the case
- of Interrupt_Handler, there is no other check for
+ {<AI05-0033-1AI05-0033-1>} {<AI05-0229-1AI05-0229-1>} We
+ cannot allow these aspects in protected declarations in a
+ generic body, because legality rules are not checked for
+ instance bodies, and these should not be allowed if the
+ instance is not at the library level. The protected types can
+ be declared in the private part if this is desired. Note that
+ while the 'Access to use the handler would provide the check
+ in the case of Interrupt_Handler, there is no other check for
Attach_Handler. Since these aspects are so similar, we want
the rules to be the same.
8/3
-This paragraph was deleted.{AI95-00253-01AI95-00253-01}
-{AI95-00303-01AI95-00303-01} {AI05-0033-1AI05-0033-1}
+<This paragraph was deleted.>{<AI95-00253-01AI95-00253-01>}
+{<AI95-00303-01AI95-00303-01>} {<AI05-0033-1AI05-0033-1>}
_Dynamic Semantics_
9/3
-{AI05-0229-1AI05-0229-1} If the Interrupt_Handler aspect of a protected
-procedure is True, then the procedure may be attached dynamically, as a
-handler, to interrupts (see *note C.3.2::). [Such procedures are
-allowed to be attached to multiple interrupts.]
+{<AI05-0229-1AI05-0229-1>} If the Interrupt_Handler aspect of a
+protected procedure is True, then the procedure may be attached
+dynamically, as a handler, to interrupts (see *note C.3.2::). [Such
+procedures are allowed to be attached to multiple interrupts.]
10/3
-{AI05-0229-1AI05-0229-1} The expression specified for the Attach_Handler
-aspect of a protected procedure P is evaluated as part of the creation
-of the protected object that contains P. The value of the expression
-identifies an interrupt. As part of the initialization of that object,
-P (the handler procedure) is attached to the identified interrupt. A
-check is made that the corresponding interrupt is not reserved.
-Program_Error is raised if the check fails, and the existing treatment
-for the interrupt is not affected.
+{<AI05-0229-1AI05-0229-1>} The expression specified for the
+Attach_Handler aspect of a protected procedure <P> is evaluated as part
+of the creation of the protected object that contains <P>. The value of
+the expression identifies an interrupt. As part of the initialization
+of that object, <P> (the <handler> procedure) is attached to the
+identified interrupt. A check is made that the corresponding interrupt
+is not reserved. Program_Error is raised if the check fails, and the
+existing treatment for the interrupt is not affected.
11/3
-{AI95-00434-01AI95-00434-01} {AI05-0229-1AI05-0229-1} If the
+{<AI95-00434-01AI95-00434-01>} {<AI05-0229-1AI05-0229-1>} If the
Ceiling_Locking policy (see *note D.3::) is in effect, then upon the
initialization of a protected object that contains a protected procedure
for which either the Attach_Handler aspect is specified or the
Interrupt_Handler aspect is True, a check is made that the initial
ceiling priority of the object is in the range of
-System.Interrupt_Priority. If the check fails, Program_Error is raised.
+System.Interrupt_Priority. If the check fails, Program_Error is raised.
12/3
-{8652/00688652/0068} {AI95-00121-01AI95-00121-01}
-{AI05-0229-1AI05-0229-1} When a protected object is finalized, for any
+{<8652/00688652/0068>} {<AI95-00121-01AI95-00121-01>}
+{<AI05-0229-1AI05-0229-1>} When a protected object is finalized, for any
of its procedures that are attached to interrupts, the handler is
detached. If the handler was attached by a procedure in the Interrupts
package or if no user handler was previously attached to the interrupt,
@@ -101395,18 +101744,19 @@ is the same as the one that was attached at the
time the protected
object was initialized, the previous handler is restored.
12.a/3
- Discussion: {8652/00688652/0068} {AI95-00121-01AI95-00121-01}
- {AI95-00303-01AI95-00303-01} {AI05-0229-1AI05-0229-1} If all
- protected objects for interrupt handlers are declared at the
- library level, the finalization discussed above occurs only as
- part of the finalization of all library-level packages in a
- partition. However, objects of a protected type containing
- procedures with an Attach_Handler aspect specified need not be
- at the library level. Thus, an implementation needs to be
- able to restore handlers during the execution of the program.
- (An object with an Interrupt_Handler aspect also need not be
- at the library level, but such a handler cannot be attached to
- an interrupt using the Interrupts package.)
+ Discussion: {<8652/00688652/0068>}
+ {<AI95-00121-01AI95-00121-01>} {<AI95-00303-01AI95-00303-01>}
+ {<AI05-0229-1AI05-0229-1>} If all protected objects for
+ interrupt handlers are declared at the library level, the
+ finalization discussed above occurs only as part of the
+ finalization of all library-level packages in a partition.
+ However, objects of a protected type containing procedures
+ with an Attach_Handler aspect specified need not be at the
+ library level. Thus, an implementation needs to be able to
+ restore handlers during the execution of the program. (An
+ object with an Interrupt_Handler aspect also need not be at
+ the library level, but such a handler cannot be attached to an
+ interrupt using the Interrupts package.)
13
When a handler is attached to an interrupt, the interrupt is blocked
@@ -101423,22 +101773,22 @@ is higher than the ceiling priority of the
corresponding protected
object, the execution of the program is erroneous.
14.1/3
-{8652/00688652/0068} {AI95-00121-01AI95-00121-01}
-{AI05-0229-1AI05-0229-1} If the handlers for a given interrupt attached
-via aspect Attach_Handler are not attached and detached in a stack-like
-(LIFO) order, program execution is erroneous. In particular, when a
-protected object is finalized, the execution is erroneous if any of the
-procedures of the protected object are attached to interrupts via aspect
-Attach_Handler and the most recently attached handler for the same
-interrupt is not the same as the one that was attached at the time the
-protected object was initialized.
+{<8652/00688652/0068>} {<AI95-00121-01AI95-00121-01>}
+{<AI05-0229-1AI05-0229-1>} If the handlers for a given interrupt
+attached via aspect Attach_Handler are not attached and detached in a
+stack-like (LIFO) order, program execution is erroneous. In particular,
+when a protected object is finalized, the execution is erroneous if any
+of the procedures of the protected object are attached to interrupts via
+aspect Attach_Handler and the most recently attached handler for the
+same interrupt is not the same as the one that was attached at the time
+the protected object was initialized.
14.a/3
- Discussion: {8652/00688652/0068} {AI95-00121-01AI95-00121-01}
- {AI05-0229-1AI05-0229-1} This simplifies implementation of the
- Attach_Handler aspect by not requiring a check that the
- current handler is the same as the one attached by the
- initialization of a protected object.
+ Discussion: {<8652/00688652/0068>}
+ {<AI95-00121-01AI95-00121-01>} {<AI05-0229-1AI05-0229-1>} This
+ simplifies implementation of the Attach_Handler aspect by not
+ requiring a check that the current handler is the same as the
+ one attached by the initialization of a protected object.
_Metrics_
@@ -101446,7 +101796,7 @@ protected object was initialized.
The following metric shall be documented by the implementation:
16/2
- * {AI95-00434-01AI95-00434-01} The worst-case overhead for an
+ * {<AI95-00434-01AI95-00434-01>} The worst-case overhead for an
interrupt handler that is a parameterless protected procedure, in
clock cycles. This is the execution time not directly attributable
to the handler procedure or the interrupted execution. It is
@@ -101472,7 +101822,7 @@ The following metric shall be documented by the
implementation:
_Implementation Permissions_
17/3
-{AI05-0229-1AI05-0229-1} When the aspects Attach_Handler or
+{<AI05-0229-1AI05-0229-1>} When the aspects Attach_Handler or
Interrupt_Handler are specified for a protected procedure, the
implementation is allowed to impose implementation-defined restrictions
on the corresponding protected_type_declaration (*note 9.4: S0210.) and
@@ -101500,13 +101850,13 @@ that protected procedure from a task.
hardware task calling the handler.
19/3
-{AI05-0229-1AI05-0229-1} Notwithstanding what this subclause says
+{<AI05-0229-1AI05-0229-1>} Notwithstanding what this subclause says
elsewhere, the Attach_Handler and Interrupt_Handler aspects are allowed
to be used for other, implementation defined, forms of interrupt
handlers.
19.a/3
- Ramification: {AI05-0229-1AI05-0229-1} For example, if an
+ Ramification: {<AI05-0229-1AI05-0229-1>} For example, if an
implementation wishes to allow interrupt handlers to have
parameters, it is allowed to do so via these aspects; it need
not invent implementation-defined aspects for the purpose.
@@ -101537,12 +101887,12 @@ implementation-defined restrictions before run time.
NOTES
22/3
- 4 {AI05-0229-1AI05-0229-1} The Attach_Handler aspect may provide
+ 4 {<AI05-0229-1AI05-0229-1>} The Attach_Handler aspect may provide
static attachment of handlers to interrupts if the implementation
supports preelaboration of protected objects. (See *note C.4::.)
23/2
- 5 {AI95-00434-01AI95-00434-01} A protected object that has a
+ 5 {<AI95-00434-01AI95-00434-01>} A protected object that has a
(protected) procedure attached to an interrupt should have a
ceiling priority at least as high as the highest processor priority
at which that interrupt will ever be delivered.
@@ -101560,7 +101910,7 @@ implementation-defined restrictions before run time.
_Incompatibilities With Ada 95_
25.a/2
- {AI95-00253-01AI95-00253-01} Amendment Correction: Corrected
+ {<AI95-00253-01AI95-00253-01>} Amendment Correction: Corrected
the wording so that the rules for the use of Attach_Handler
and Interrupt_Handler are identical. This means that uses of
pragma Interrupt_Handler outside of the target protected type
@@ -101569,12 +101919,13 @@ implementation-defined restrictions before run time.
_Wording Changes from Ada 95_
25.b/2
- {8652/00688652/0068} {AI95-00121-01AI95-00121-01} Corrigendum:
- Clarified the meaning of "the previous handler" when
- finalizing protected objects containing interrupt handlers.
+ {<8652/00688652/0068>} {<AI95-00121-01AI95-00121-01>}
+ Corrigendum: Clarified the meaning of "the previous handler"
+ when finalizing protected objects containing interrupt
+ handlers.
25.c/2
- {AI95-00303-01AI95-00303-01} Dropped the requirement that an
+ {<AI95-00303-01AI95-00303-01>} Dropped the requirement that an
object of a type containing an Interrupt_Handler pragma must
be declared at the library level. This was a generic contract
model violation. This change is not an extension, as an
@@ -101587,14 +101938,14 @@ implementation-defined restrictions before run time.
_Extensions to Ada 2005_
25.d/3
- {AI05-0229-1AI05-0229-1} Aspects Interrupt_Handler and
+ {<AI05-0229-1AI05-0229-1>} Aspects Interrupt_Handler and
Attach_Handler are new; pragmas Interrupt_Handler and
Attach_Handler are now obsolescent.
_Wording Changes from Ada 2005_
25.e/3
- {AI05-0033-1AI05-0033-1} Correction: Added missing generic
+ {<AI05-0033-1AI05-0033-1>} Correction: Added missing generic
contract wording for the aspects Attach_Handler and
Interrupt_Handler.
@@ -101610,15 +101961,15 @@ C.3.2 The Package Interrupts
The following language-defined packages exist:
2/3
- {AI05-0167-1AI05-0167-1} with System;
+ {<AI05-0167-1AI05-0167-1>} with System;
with System.Multiprocessors;
package Ada.Interrupts is
- type Interrupt_Id is implementation-defined;
+ type Interrupt_Id is <implementation-defined>;
type Parameterless_Handler is
access protected procedure;
3/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
4
function Is_Reserved (Interrupt : Interrupt_Id)
@@ -101652,21 +102003,21 @@ The following language-defined packages exist:
return System.Address;
10.1/3
- {AI05-0167-1AI05-0167-1} function Get_CPU (Interrupt : Interrupt_Id)
+ {<AI05-0167-1AI05-0167-1>} function Get_CPU (Interrupt : Interrupt_Id)
return System.Multiprocessors.CPU_Range;
11
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Interrupts;
12
package Ada.Interrupts.Names is
- implementation-defined : constant Interrupt_Id :=
- implementation-defined;
+ <implementation-defined> : constant Interrupt_Id :=
+ <implementation-defined>;
. . .
- implementation-defined : constant Interrupt_Id :=
- implementation-defined;
+ <implementation-defined> : constant Interrupt_Id :=
+ <implementation-defined>;
end Ada.Interrupts.Names;
_Dynamic Semantics_
@@ -101684,33 +102035,33 @@ The Is_Attached function returns True if and only
if a user-specified
interrupt handler is attached to the interrupt.
16/1
-{8652/00698652/0069} {AI95-00166-01AI95-00166-01} The Current_Handler
-function returns a value that represents the attached handler of the
-interrupt. If no user-defined handler is attached to the interrupt,
-Current_Handler returns null.
+{<8652/00698652/0069>} {<AI95-00166-01AI95-00166-01>} The
+Current_Handler function returns a value that represents the attached
+handler of the interrupt. If no user-defined handler is attached to the
+interrupt, Current_Handler returns null.
17/3
-{AI05-0229-1AI05-0229-1} The Attach_Handler procedure attaches the
+{<AI05-0229-1AI05-0229-1>} The Attach_Handler procedure attaches the
specified handler to the interrupt, overriding any existing treatment
(including a user handler) in effect for that interrupt. If New_Handler
-is null, the default treatment is restored. If New_Handler designates a
+is null, the default treatment is restored. If New_Handler designates a
protected procedure for which the aspect Interrupt_Handler is False,
Program_Error is raised. In this case, the operation does not modify
the existing interrupt treatment.
18/1
-{8652/00698652/0069} {AI95-00166-01AI95-00166-01} The Exchange_Handler
-procedure operates in the same manner as Attach_Handler with the
-addition that the value returned in Old_Handler designates the previous
-treatment for the specified interrupt. If the previous treatment is not
-a user-defined handler, null is returned.
+{<8652/00698652/0069>} {<AI95-00166-01AI95-00166-01>} The
+Exchange_Handler procedure operates in the same manner as Attach_Handler
+with the addition that the value returned in Old_Handler designates the
+previous treatment for the specified interrupt. If the previous
+treatment is not a user-defined handler, null is returned.
18.a
Ramification: Calling Attach_Handler or Exchange_Handler with
this value for New_Handler restores the previous handler.
18.a.1/1
- {8652/00698652/0069} {AI95-00166-01AI95-00166-01} If the
+ {<8652/00698652/0069>} {<AI95-00166-01AI95-00166-01>} If the
application uses only parameterless procedures as handlers
(other types of handlers may be provided by the
implementation, but are not required by the standard), then if
@@ -101727,25 +102078,25 @@ specified interrupt.
20
For all operations defined in this package that take a parameter of type
Interrupt_Id, with the exception of Is_Reserved and Reference, a check
-is made that the specified interrupt is not reserved. Program_Error is
+is made that the specified interrupt is not reserved. Program_Error is
raised if this check fails.
21/3
-{AI05-0229-1AI05-0229-1} If, by using the Attach_Handler,
+{<AI05-0229-1AI05-0229-1>} If, by using the Attach_Handler,
Detach_Handler, or Exchange_Handler procedures, an attempt is made to
detach a handler that was attached statically (using the aspect
Attach_Handler), the handler is not detached and Program_Error is
-raised.
+raised.
22/2
-{AI95-00434-01AI95-00434-01} The Reference function returns a value of
+{<AI95-00434-01AI95-00434-01>} The Reference function returns a value of
type System.Address that can be used to attach a task entry via an
address clause (see *note J.7.1::) to the interrupt specified by
Interrupt. This function raises Program_Error if attaching task entries
-to interrupts (or to this particular interrupt) is not supported.
+to interrupts (or to this particular interrupt) is not supported.
22.1/3
-{AI05-0153-3AI05-0153-3} The function Get_CPU returns the processor on
+{<AI05-0153-3AI05-0153-3>} The function Get_CPU returns the processor on
which the handler for Interrupt is executed. If the handler can execute
on more than one processor the value
System.Multiprocessors.Not_A_Specific_CPU is returned.
@@ -101759,7 +102110,7 @@ handler of the corresponding interrupt be undefined.
_Documentation Requirements_
24/3
-{AI95-00434-01AI95-00434-01} {AI05-0229-1AI05-0229-1} If the
+{<AI95-00434-01AI95-00434-01>} {<AI05-0229-1AI05-0229-1>} If the
Ceiling_Locking policy (see *note D.3::) is in effect, the
implementation shall document the default ceiling priority assigned to a
protected object that contains a protected procedure that specifies
@@ -101798,10 +102149,10 @@ as in the predefined package Interrupts.
_Examples_
27
-Example of interrupt handlers:
+<Example of interrupt handlers:>
28/3
- {AI05-0229-1AI05-0229-1} Device_Priority : constant
+ {<AI05-0229-1AI05-0229-1>} Device_Priority : constant
array (1..5) of System.Interrupt_Priority := ( ... );
protected type Device_Interface
(Int_Id : Ada.Interrupts.Interrupt_Id)
@@ -101819,18 +102170,19 @@ Example of interrupt handlers:
_Wording Changes from Ada 95_
28.a/2
- {8652/00698652/0069} {AI95-00166-01AI95-00166-01} Corrigendum:
- Clarified that the value returned by Current_Handler and
- Exchange_Handler for the default treatment is null.
+ {<8652/00698652/0069>} {<AI95-00166-01AI95-00166-01>}
+ Corrigendum: Clarified that the value returned by
+ Current_Handler and Exchange_Handler for the default treatment
+ is null.
_Incompatibilities With Ada 2005_
28.b/3
- {AI05-0167-1AI05-0167-1} Function Get_CPU is added to
+ {<AI05-0167-1AI05-0167-1>} Function Get_CPU is added to
Interrupts. If Interrupts is referenced in a use_clause, and
- an entity E with a defining_identifier of Get_CPU is defined
+ an entity <E> with a defining_identifier of Get_CPU is defined
in a package that is also referenced in a use_clause, the
- entity E may no longer be use-visible, resulting in errors.
+ entity <E> may no longer be use-visible, resulting in errors.
This should be rare and is easily fixed if it does occur.
@@ -101840,7 +102192,7 @@ C.4 Preelaboration Requirements
===============================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies additional
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies additional
implementation and documentation requirements for the Preelaborate
pragma (see *note 10.2.1::).]
@@ -101849,7 +102201,7 @@ pragma (see *note 10.2.1::).]
2
The implementation shall not incur any run-time overhead for the
elaboration checks of subprograms and protected_bodies declared in
-preelaborated library units.
+preelaborated library units.
3
The implementation shall not execute any memory write operations after
@@ -101857,8 +102209,8 @@ load time for the elaboration of constant objects
declared immediately
within the declarative region of a preelaborated library package, so
long as the subtype and initial expression (or default initial
expressions if initialized by default) of the object_declaration satisfy
-the following restrictions. The meaning of load time is implementation
-defined.
+the following restrictions. The meaning of <load time> is
+implementation defined.
3.a
Discussion: On systems where the image of the partition is
@@ -101873,7 +102225,7 @@ defined.
statically constrained subcomponents, if any;
4.1/2
- * {AI95-00161-01AI95-00161-01} no subtype_mark denotes a controlled
+ * {<AI95-00161-01AI95-00161-01>} no subtype_mark denotes a controlled
type, a private type, a private extension, a generic formal private
type, a generic formal derived type, or a descendant of such a
type;
@@ -101882,7 +102234,7 @@ defined.
Reason: For an implementation that uses the registration
method of finalization, a controlled object will require some
code executed to register the object at the appropriate point.
- The other types are those that might have a controlled
+ The other types are those that <might> have a controlled
component. None of these types were allowed in preelaborated
units in Ada 95. These types are covered by the
Implementation Advice, of course, so they should still execute
@@ -101924,7 +102276,7 @@ defined.
object_declaration can fail.
11.a/2
- Reason: {AI95-00114-01AI95-00114-01} The intent is that
+ Reason: {<AI95-00114-01AI95-00114-01>} The intent is that
aggregates all of whose scalar subcomponents are static and
all of whose access subcomponents are null, allocators for
access-to-constant types, or X'Access, will be supported with
@@ -101952,12 +102304,12 @@ restarted without reloading.
restarted without reloading.
13.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
13.b/2
- Discussion: {AI95-00114-01AI95-00114-01} This covers the issue
- of the run-time system itself being restartable, so that need
- not be a separate Documentation Requirement.
+ Discussion: {<AI95-00114-01AI95-00114-01>} This covers the
+ issue of the run-time system itself being restartable, so that
+ need not be a separate Documentation Requirement.
_Implementation Advice_
@@ -101975,7 +102327,7 @@ Requirements.
_Wording Changes from Ada 95_
14.b/2
- {AI95-00161-01AI95-00161-01} Added wording to exclude the
+ {<AI95-00161-01AI95-00161-01>} Added wording to exclude the
additional kinds of types allowed in preelaborated units from
the Implementation Requirements.
@@ -101986,19 +102338,19 @@ C.5 Aspect Discard_Names
========================
1/4
-{AI12-0072-1AI12-0072-1} [Specifying the aspect Discard_Names can be
+{<AI12-0072-1AI12-0072-1>} [Specifying the aspect Discard_Names can be
used to request a reduction in storage used for the names of entities
with runtime name text.]
_Static Semantics_
1.1/4
-{AI12-0072-1AI12-0072-1} An entity with runtime name text is a
+{<AI12-0072-1AI12-0072-1>} An entity with <runtime name text> is a
nonderived enumeration first subtype, a tagged first subtype, or an
exception.
1.2/4
-{AI12-0072-1AI12-0072-1} For an entity with runtime name text, the
+{<AI12-0072-1AI12-0072-1>} For an entity with runtime name text, the
following language-defined representation aspect may be specified:
1.3/4
@@ -102023,12 +102375,12 @@ Discard_Names
4
A pragma Discard_Names is allowed only immediately within a
declarative_part, immediately within a package_specification, or as
- a configuration pragma.
+ a configuration pragma.
_Legality Rules_
5/4
-{AI12-0072-1AI12-0072-1} The local_name (if present) shall denote an
+{<AI12-0072-1AI12-0072-1>} The local_name (if present) shall denote an
entity with runtime name text. The pragma specifies that the aspect
Discard_Names for the type or exception has the value True. Without a
local_name, the pragma specifies that all entities with runtime name
@@ -102040,7 +102392,7 @@ name text declared in the compilation unit have the
value True for the
aspect Discard_Names..
5.a/4
- Ramification: {AI12-0072-1AI12-0072-1} If the aspect is
+ Ramification: {<AI12-0072-1AI12-0072-1>} If the aspect is
specified for a type, then it is inherited by all descendants
of the type. The aspect cannot be specified as False on a
derived type (because specifying the aspect is not allowed on
@@ -102054,12 +102406,12 @@ If a local_name is given, then a pragma
Discard_Names is a
representation pragma.
6.a/4
- This paragraph was deleted.{AI05-0229-1AI05-0229-1}
- {AI12-0072-1AI12-0072-1}
+ <This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
+ {<AI12-0072-1AI12-0072-1>}
7/4
-{AI95-00285-01AI95-00285-01} {AI95-00400-01AI95-00400-01}
-{AI12-0072-1AI12-0072-1} If the aspect Discard_Names is True for an
+{<AI95-00285-01AI95-00285-01>} {<AI95-00400-01AI95-00400-01>}
+{<AI12-0072-1AI12-0072-1>} If the aspect Discard_Names is True for an
enumeration type, then the semantics of the Wide_Wide_Image and
Wide_Wide_Value attributes are implementation defined for that type[;
the semantics of Image, Wide_Image, Value, and Wide_Value are still
@@ -102085,7 +102437,7 @@ Exceptions.Wide_Wide_Exception_Name].
Image.
7.c/4
- {AI95-00285-01AI95-00285-01} {AI12-0072-1AI12-0072-1} The
+ {<AI95-00285-01AI95-00285-01>} {<AI12-0072-1AI12-0072-1>} The
semantics of S'Wide_Wide_Image and S'Wide_Wide_Value are
implementation defined for any subtype of an enumeration type
for which the aspect is True. (The pragma, if used, actually
@@ -102094,7 +102446,7 @@ Exceptions.Wide_Wide_Exception_Name].
_Implementation Advice_
8/4
-{AI12-0072-1AI12-0072-1} If the aspect Discard_Names is True for an
+{<AI12-0072-1AI12-0072-1>} If the aspect Discard_Names is True for an
entity, then the implementation should reduce the amount of storage used
for storing names associated with that entity.
@@ -102132,7 +102484,7 @@ for storing names associated with that entity.
_Wording Changes from Ada 95_
8.e/2
- {AI95-00285-01AI95-00285-01} {AI95-00400-01AI95-00400-01}
+ {<AI95-00285-01AI95-00285-01>} {<AI95-00400-01AI95-00400-01>}
Updated the wording to reflect that the double wide image and
value functions are now the master versions that the others
are defined from.
@@ -102140,7 +102492,7 @@ for storing names associated with that entity.
_Wording Changes from Ada 2012_
8.f/4
- {AI12-0072-1AI12-0072-1} Corrigendum: Defined the pragma in
+ {<AI12-0072-1AI12-0072-1>} Corrigendum: Defined the pragma in
terms of the aspect Discard_Names, and added a missing
definition of the meaning of the configuration pragma. This
is not intended to make any semantic change (Ada 2012 has an
@@ -102155,17 +102507,17 @@ C.6 Shared Variable Control
===========================
1/3
-{AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} [This subclause
+{<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} [This subclause
defines representation aspects that control the use of shared
variables.]
-Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
6.1/3
-{AI05-0229-1AI05-0229-1} For an object_declaration, a
+{<AI05-0229-1AI05-0229-1>} For an object_declaration, a
component_declaration, or a full_type_declaration, the following
representation aspects may be specified:
@@ -102194,7 +102546,7 @@ Volatile
or component is volatile.
6.5/3
-{AI05-0229-1AI05-0229-1} For a full_type_declaration of an array type
+{<AI05-0229-1AI05-0229-1>} For a full_type_declaration of an array type
(including the anonymous type of an object_declaration of an anonymous
array object), the following representation aspects may be specified:
@@ -102215,7 +102567,7 @@ Volatile_Components
components of an array type or object are volatile.
6.8/3
-{AI05-0229-1AI05-0229-1} For a full_type_declaration (including the
+{<AI05-0229-1AI05-0229-1>} For a full_type_declaration (including the
anonymous type of an object_declaration of an anonymous array object),
the following representation aspect may be specified:
@@ -102229,37 +102581,37 @@ Independent_Components
are independently addressable.
6.10/3
-{AI05-0229-1AI05-0229-1} If any of these aspects are directly specified,
-the aspect_definition shall be a static expression. If not specified
-(including by inheritance), each of these aspects is False.
+{<AI05-0229-1AI05-0229-1>} If any of these aspects are directly
+specified, the aspect_definition shall be a static expression. If not
+specified (including by inheritance), each of these aspects is False.
7/3
-{AI95-00272-01AI95-00272-01} {AI05-0229-1AI05-0229-1} An atomic type is
-one for which the aspect Atomic is True. An atomic object (including a
-component) is one for which the aspect Atomic is True, or a component of
-an array for which the aspect Atomic_Components is True for the
-associated type, or any object of an atomic type, other than objects
+{<AI95-00272-01AI95-00272-01>} {<AI05-0229-1AI05-0229-1>} An <atomic>
+type is one for which the aspect Atomic is True. An <atomic> object
+(including a component) is one for which the aspect Atomic is True, or a
+component of an array for which the aspect Atomic_Components is True for
+the associated type, or any object of an atomic type, other than objects
obtained by evaluating a slice.
7.a/2
- Ramification: {AI95-00272-01AI95-00272-01} A slice of an
+ Ramification: {<AI95-00272-01AI95-00272-01>} A slice of an
atomic array object is not itself atomic. That's necessary as
executing a read or write of a dynamic number of components in
a single instruction is not possible on many targets.
8/3
-{AI05-0229-1AI05-0229-1} A volatile type is one for which the aspect
-Volatile is True. A volatile object (including a component) is one for
-which the aspect Volatile is True, or a component of an array for which
-the aspect Volatile_Components is True for the associated type, or any
-object of a volatile type. In addition, every atomic type or object is
-also defined to be volatile. Finally, if an object is volatile, then so
-are all of its subcomponents [(the same does not apply to atomic)].
+{<AI05-0229-1AI05-0229-1>} A <volatile> type is one for which the aspect
+Volatile is True. A <volatile> object (including a component) is one
+for which the aspect Volatile is True, or a component of an array for
+which the aspect Volatile_Components is True for the associated type, or
+any object of a volatile type. In addition, every atomic type or object
+is also defined to be volatile. Finally, if an object is volatile, then
+so are all of its subcomponents [(the same does not apply to atomic)].
8.1/4
-{AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1}
-{AI12-0001-1AI12-0001-1} When True, the aspects Independent and
-Independent_Components specify as independently addressable the named
+{<AI05-0009-1AI05-0009-1>} {<AI05-0229-1AI05-0229-1>}
+{<AI12-0001-1AI12-0001-1>} When True, the aspects Independent and
+Independent_Components <specify as independently addressable> the named
object or component(s), or in the case of a type, all objects or
components of that type. All atomic objects and aliased objects are
considered to be specified as independently addressable.
@@ -102279,36 +102631,36 @@ considered to be specified as independently
addressable.
Standard says elsewhere (specifically, in the Recommended
Level of Support).
-Paragraph 9 was moved to *note Annex J::, "*note Annex J:: Obsolescent
-Features".
+<Paragraph 9 was moved to *note Annex J::, "*note Annex J:: Obsolescent
+Features".>
_Legality Rules_
9.1/3
-{AI05-0229-1AI05-0229-1} If aspect Independent_Components is specified
+{<AI05-0229-1AI05-0229-1>} If aspect Independent_Components is specified
for a full_type_declaration, the declaration shall be that of an array
or record type.
10/4
-{AI05-0229-1AI05-0229-1} {AI12-0001-1AI12-0001-1} It is illegal to
+{<AI05-0229-1AI05-0229-1>} {<AI12-0001-1AI12-0001-1>} It is illegal to
specify either of the aspects Atomic or Atomic_Components to have the
value True for an object or type if the implementation cannot support
the indivisible and independent reads and updates required by the aspect
(see below).
11/4
-{AI12-0001-1AI12-0001-1} It is illegal to specify the Size attribute of
-an atomic object, the Component_Size attribute for an array type with
+{<AI12-0001-1AI12-0001-1>} It is illegal to specify the Size attribute
+of an atomic object, the Component_Size attribute for an array type with
atomic components, or the layout attributes of an atomic component, in a
way that prevents the implementation from performing the required
indivisible and independent reads and updates.
12/3
-{AI05-0142-4AI05-0142-4} {AI05-0218-1AI05-0218-1} If an atomic object is
-passed as a parameter, then the formal parameter shall either have an
-atomic type or allow pass by copy. If an atomic object is used as an
-actual for a generic formal object of mode in out, then the type of the
-generic formal object shall be atomic. If the prefix of an
+{<AI05-0142-4AI05-0142-4>} {<AI05-0218-1AI05-0218-1>} If an atomic
+object is passed as a parameter, then the formal parameter shall either
+have an atomic type or allow pass by copy. If an atomic object is used
+as an actual for a generic formal object of mode in out, then the type
+of the generic formal object shall be atomic. If the prefix of an
attribute_reference for an Access attribute denotes an atomic object
[(including a component)], then the designated type of the resulting
access type shall be atomic. If an atomic type is used as an actual for
@@ -102317,18 +102669,18 @@ shall be atomic. Corresponding rules apply to
volatile objects and
types.
12.a/3
- Ramification: {AI05-0142-4AI05-0142-4} A formal parameter
+ Ramification: {<AI05-0142-4AI05-0142-4>} A formal parameter
allows pass by copy if it is not aliased and it is of a type
that allows pass by copy (that is, is not a by-reference
type).
12.1/3
-{AI05-0218-1AI05-0218-1} If a volatile type is used as an actual for a
+{<AI05-0218-1AI05-0218-1>} If a volatile type is used as an actual for a
generic formal array type, then the element type of the formal type
shall be volatile.
13/3
-{AI05-0229-1AI05-0229-1} If an aspect Volatile, Volatile_Components,
+{<AI05-0229-1AI05-0229-1>} If an aspect Volatile, Volatile_Components,
Atomic, or Atomic_Components is directly specified to have the value
True for a stand-alone constant object, then the aspect Import shall
also be specified as True for it.
@@ -102349,27 +102701,27 @@ also be specified as True for it.
it will not be altered.
13.c/3
- To be honest: {AI05-0218-1AI05-0218-1} Volatile_Components and
- Atomic_Components actually are aspects of the anonymous array
- type; this rule only applies when the aspect is specified
- directly on the constant object and not when the (named) array
- type has the aspect.
+ To be honest: {<AI05-0218-1AI05-0218-1>} Volatile_Components
+ and Atomic_Components actually are aspects of the anonymous
+ array type; this rule only applies when the aspect is
+ specified directly on the constant object and not when the
+ (named) array type has the aspect.
13.1/3
-{AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1} It is illegal to
+{<AI05-0009-1AI05-0009-1>} {<AI05-0229-1AI05-0229-1>} It is illegal to
specify the aspect Independent or Independent_Components as True for a
component, object or type if the implementation cannot provide the
independent addressability required by the aspect (see *note 9.10::).
13.2/3
-{AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1} It is illegal to
+{<AI05-0009-1AI05-0009-1>} {<AI05-0229-1AI05-0229-1>} It is illegal to
specify a representation aspect for a component, object or type for
which the aspect Independent or Independent_Components is True, in a way
that prevents the implementation from providing the independent
addressability required by the aspect.
-Paragraph 14 was moved to *note Annex J::, "*note Annex J:: Obsolescent
-Features".
+<Paragraph 14 was moved to *note Annex J::, "*note Annex J:: Obsolescent
+Features".>
_Dynamic Semantics_
@@ -102378,7 +102730,7 @@ For an atomic object (including an atomic component)
all reads and
updates of the object as a whole are indivisible.
16/3
-{AI05-0117-1AI05-0117-1} {AI05-0275-1AI05-0275-1} All tasks of the
+{<AI05-0117-1AI05-0117-1>} {<AI05-0275-1AI05-0275-1>} All tasks of the
program (on all processors) that read or update volatile variables see
the same order of updates to the variables. A use of an atomic variable
or other mechanism may be necessary to avoid erroneous execution and to
@@ -102386,13 +102738,13 @@ ensure that access to nonatomic volatile variables
is sequential (see
*note 9.10::).
16.a/3
- Implementation Note: {AI05-0117-1AI05-0117-1}
- {AI05-0275-1AI05-0275-1} To ensure this, on a multiprocessor,
- any read or update of an atomic object may require the use of
- an appropriate memory barrier.
+ Implementation Note: {<AI05-0117-1AI05-0117-1>}
+ {<AI05-0275-1AI05-0275-1>} To ensure this, on a
+ multiprocessor, any read or update of an atomic object may
+ require the use of an appropriate memory barrier.
16.b/3
- Discussion: {AI05-0275-1AI05-0275-1} From *note 9.10:: it
+ Discussion: {<AI05-0275-1AI05-0275-1>} From *note 9.10:: it
follows that (in non-erroneous programs) accesses to
variables, including those shared by multiple tasks, are
always sequential. This guarantees that no task will ever see
@@ -102401,15 +102753,15 @@ ensure that access to nonatomic volatile variables
is sequential (see
specifies that all tasks see the same order of updates.
16.c/3
- {AI05-0275-1AI05-0275-1} If for a shared variable X, a read of
- X occurs sequentially after an update of X, then the read will
- return the updated value if X is volatile or atomic, but may
- or or may not return the updated value if X is nonvolatile.
- For nonvolatile accesses, a signaling action is needed in
- order to share the updated value.
+ {<AI05-0275-1AI05-0275-1>} If for a shared variable <X>, a
+ read of <X> occurs sequentially after an update of <X>, then
+ the read will return the updated value if <X> is volatile or
+ atomic, but may or or may not return the updated value if <X>
+ is nonvolatile. For nonvolatile accesses, a signaling action
+ is needed in order to share the updated value.
16.d/3
- {AI05-0275-1AI05-0275-1} Because accesses to the same atomic
+ {<AI05-0275-1AI05-0275-1>} Because accesses to the same atomic
variable by different tasks establish a sequential order
between the actions of those tasks, implementations may be
required to emit memory barriers around such updates or use
@@ -102494,18 +102846,18 @@ or volatile objects other than those specified by
the program.
X; should not translate to V2:=X; V1:= X;
21/4
-This paragraph was deleted.{AI05-0229-1AI05-0229-1}
-{AI12-0001-1AI12-0001-1}
+<This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
+{<AI12-0001-1AI12-0001-1>}
21.a/4
- This paragraph was deleted.{AI05-0009-1AI05-0009-1}
- {AI12-0001-1AI12-0001-1}
+ <This paragraph was deleted.>{<AI05-0009-1AI05-0009-1>}
+ {<AI12-0001-1AI12-0001-1>}
_Implementation Advice_
22/2
-{AI95-00259-01AI95-00259-01} A load or store of a volatile object whose
-size is a multiple of System.Storage_Unit and whose alignment is
+{<AI95-00259-01AI95-00259-01>} A load or store of a volatile object
+whose size is a multiple of System.Storage_Unit and whose alignment is
nonzero, should be implemented by accessing exactly the bits of the
object and no others.
@@ -102532,8 +102884,9 @@ object and no others.
be documented.
23/2
-{AI95-00259-01AI95-00259-01} A load or store of an atomic object should,
-where possible, be implemented by a single load or store instruction.
+{<AI95-00259-01AI95-00259-01>} A load or store of an atomic object
+should, where possible, be implemented by a single load or store
+instruction.
23.a/2
Implementation Advice: A load or store of an atomic object
@@ -102547,7 +102900,7 @@ where possible, be implemented by a single load or
store instruction.
but can still be modified by an "external source."
25/4
- 10 {AI12-0001-1AI12-0001-1} Specifying the Pack aspect cannot
+ 10 {<AI12-0001-1AI12-0001-1>} Specifying the Pack aspect cannot
override the effect of specifying an Atomic or Atomic_Components
aspect.
@@ -102561,35 +102914,36 @@ where possible, be implemented by a single load or
store instruction.
_Wording Changes from Ada 95_
25.b/2
- {AI95-00259-01AI95-00259-01} Added Implementation Advice to
+ {<AI95-00259-01AI95-00259-01>} Added Implementation Advice to
clarify the meaning of Atomic and Volatile in machine terms.
The documentation that this advice applies will make the use
of Ada implementations more predictable for low-level (such as
device register) programming.
25.c/2
- {AI95-00272-01AI95-00272-01} Added wording to clarify that a
+ {<AI95-00272-01AI95-00272-01>} Added wording to clarify that a
slice of an object of an atomic type is not atomic, just like
a component of an atomic type is not (necessarily) atomic.
_Incompatibilities With Ada 2005_
25.d/3
- {AI05-0218-1AI05-0218-1} Correction: Plugged a hole involving
- volatile components of formal types when the formal type's
- component has a nonvolatile type. This was done by making
- certain actual types illegal for formal derived and formal
- array types; these types were allowed for Ada 95 and Ada 2005.
+ {<AI05-0218-1AI05-0218-1>} Correction: Plugged a hole
+ involving volatile components of formal types when the formal
+ type's component has a nonvolatile type. This was done by
+ making certain actual types illegal for formal derived and
+ formal array types; these types were allowed for Ada 95 and
+ Ada 2005.
_Extensions to Ada 2005_
25.e/3
- {AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1} Aspects
+ {<AI05-0009-1AI05-0009-1>} {<AI05-0229-1AI05-0229-1>} Aspects
Independent and Independent_Components are new; they eliminate
ambiguity about independent addressability.
25.f/3
- {AI05-0229-1AI05-0229-1} Aspects Atomic, Atomic_Components,
+ {<AI05-0229-1AI05-0229-1>} Aspects Atomic, Atomic_Components,
Volatile, and Volatile_Components are new; pragmas Atomic,
Atomic_Components, Volatile, and Volatile_Components are now
obsolescent.
@@ -102597,8 +102951,8 @@ where possible, be implemented by a single load or
store instruction.
_Wording Changes from Ada 2005_
25.g/3
- {AI05-0117-1AI05-0117-1} {AI05-0275-1AI05-0275-1} Revised the
- definition of volatile to eliminate overspecification and
+ {<AI05-0117-1AI05-0117-1>} {<AI05-0275-1AI05-0275-1>} Revised
+ the definition of volatile to eliminate overspecification and
simply focus on the root requirement (that all tasks see the
same view of volatile objects). This is not an inconsistency;
"memory" arguably includes on-chip caches so long as those are
@@ -102606,7 +102960,7 @@ where possible, be implemented by a single load or
store instruction.
program that could tell the difference.
25.h/3
- {AI05-0142-4AI05-0142-4} Added wording to take explicitly
+ {<AI05-0142-4AI05-0142-4>} Added wording to take explicitly
aliased parameters (see *note 6.1::) into account when
determining the legality of parameter passing of volatile and
atomic objects.
@@ -102614,7 +102968,7 @@ where possible, be implemented by a single load or
store instruction.
_Wording Changes from Ada 2012_
25.i/4
- {AI12-0001-1AI12-0001-1} Corrigendum: Clarified that aliased
+ {<AI12-0001-1AI12-0001-1>} Corrigendum: Clarified that aliased
objects are considered to be specified as independently
addressable, and also eliminated an unnecessary rule.
@@ -102625,16 +102979,17 @@ C.7 Task Information
====================
1/3
-{AI95-00266-02AI95-00266-02} {AI05-0299-1AI05-0299-1} [This subclause
-describes operations and attributes that can be used to obtain the
-identity of a task. In addition, a package that associates user-defined
-information with a task is defined. Finally, a package that associates
-termination procedures with a task or set of tasks is defined.]
+{<AI95-00266-02AI95-00266-02>} {<AI05-0299-1AI05-0299-1>} [This
+subclause describes operations and attributes that can be used to obtain
+the identity of a task. In addition, a package that associates
+user-defined information with a task is defined. Finally, a package
+that associates termination procedures with a task or set of tasks is
+defined.]
_Wording Changes from Ada 95_
1.a/3
- {AI95-00266-02AI95-00266-02} {AI05-0299-1AI05-0299-1} The
+ {<AI95-00266-02AI95-00266-02>} {<AI05-0299-1AI05-0299-1>} The
title and text here were updated to reflect the addition of
task termination procedures to this subclause.
@@ -102656,7 +103011,7 @@ C.7.1 The Package Task_Identification
The following language-defined library package exists:
2/2
- {AI95-00362-01AI95-00362-01} package Ada.Task_Identification is
+ {<AI95-00362-01AI95-00362-01>} package Ada.Task_Identification is
pragma Preelaborate(Task_Identification);
type Task_Id is private;
pragma Preelaborable_Initialization (Task_Id);
@@ -102664,17 +103019,17 @@ The following language-defined library package
exists:
function "=" (Left, Right : Task_Id) return Boolean;
3/3
- {8652/00708652/0070} {AI95-00101-01AI95-00101-01}
{AI05-0189-1AI05-0189-1} function Image (T : Task_Id)
return String;
+ {<8652/00708652/0070>} {<AI95-00101-01AI95-00101-01>}
{<AI05-0189-1AI05-0189-1>} function Image (T : Task_Id)
return String;
function Current_Task return Task_Id;
function Environment_Task return Task_Id;
procedure Abort_Task (T : in Task_Id);
4/3
- {AI05-0189-1AI05-0189-1} function Is_Terminated (T :
Task_Id) return Boolean;
+ {<AI05-0189-1AI05-0189-1>} function Is_Terminated (T :
Task_Id) return Boolean;
function Is_Callable (T : Task_Id) return Boolean;
function Activation_Is_Complete (T : Task_Id) return Boolean;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Task_Identification;
_Dynamic Semantics_
@@ -102701,7 +103056,7 @@ The function Current_Task returns a value that
identifies the calling
task.
8.1/3
-{AI05-0189-1AI05-0189-1} The function Environment_Task returns a value
+{<AI05-0189-1AI05-0189-1>} The function Environment_Task returns a value
that identifies the environment task.
9
@@ -102714,17 +103069,17 @@ The functions Is_Terminated and Is_Callable return
the value of the
corresponding attribute of the task identified by T.
10.a.1/1
- Ramification: {8652/01158652/0115}
- {AI95-00206-01AI95-00206-01} These routines can be called with
- an argument identifying the environment task. Is_Terminated
- will always be False for such a call, but Is_Callable (usually
- True) could be False if the environment task is waiting for
- the termination of dependent tasks. Thus, a dependent task
- can use Is_Callable to determine if the main subprogram has
- completed.
+ Ramification: {<8652/01158652/0115>}
+ {<AI95-00206-01AI95-00206-01>} These routines can be called
+ with an argument identifying the environment task.
+ Is_Terminated will always be False for such a call, but
+ Is_Callable (usually True) could be False if the environment
+ task is waiting for the termination of dependent tasks. Thus,
+ a dependent task can use Is_Callable to determine if the main
+ subprogram has completed.
10.1/3
-{AI05-0189-1AI05-0189-1} The function Activation_Is_Complete returns
+{<AI05-0189-1AI05-0189-1>} The function Activation_Is_Complete returns
True if the task identified by T has completed its activation (whether
successfully or not). It returns False otherwise. If T identifies the
environment task, Activation_Is_Complete returns True after the
@@ -102745,7 +103100,7 @@ attribute is defined:
14/3
E'Caller
- {AI05-0262-1AI05-0262-1} Yields a value of the type
+ {<AI05-0262-1AI05-0262-1>} Yields a value of the type
Task_Id that identifies the task whose call is now being
serviced. Use of this attribute is allowed only inside
an accept_statement, or entry_body after the
@@ -102762,10 +103117,11 @@ Abort_Task is a potentially blocking operation (see
*note 9.5.1::).
_Bounded (Run-Time) Errors_
17/3
-{AI95-00237-01AI95-00237-01} {AI05-0004-1AI05-0004-1} It is a bounded
-error to call the Current_Task function from an entry_body, interrupt
-handler, or finalization of a task attribute. Program_Error is raised,
-or an implementation-defined value of the type Task_Id is returned.
+{<AI95-00237-01AI95-00237-01>} {<AI05-0004-1AI05-0004-1>} It is a
+bounded error to call the Current_Task function from an entry_body,
+interrupt handler, or finalization of a task attribute. Program_Error
+is raised, or an implementation-defined value of the type Task_Id is
+returned.
17.a/2
Implementation defined: The value of Current_Task when in a
@@ -102778,9 +103134,10 @@ or an implementation-defined value of the type
Task_Id is returned.
the implementation.
17.c/2
- Ramification: {AI95-00237-01AI95-00237-01} An entry barrier is
- syntactically part of an entry_body, so a call to Current_Task
- from an entry barrier is also covered by this rule.
+ Ramification: {<AI95-00237-01AI95-00237-01>} An entry barrier
+ is syntactically part of an entry_body, so a call to
+ Current_Task from an entry barrier is also covered by this
+ rule.
_Erroneous Execution_
@@ -102797,7 +103154,7 @@ The implementation shall document the effect of
calling Current_Task
from an entry body or interrupt handler.
19.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
19.b/2
Documentation Requirement: The effect of calling Current_Task
@@ -102818,29 +103175,31 @@ from an entry body or interrupt handler.
_Extensions to Ada 95_
21.a/2
- {AI95-00362-01AI95-00362-01} Task_Identification is now
+ {<AI95-00362-01AI95-00362-01>} Task_Identification is now
preelaborated, so it can be used in preelaborated units.
_Wording Changes from Ada 95_
21.b/2
- {8652/00708652/0070} {AI95-00101-01AI95-00101-01} Corrigendum:
- Corrected the mode of the parameter to Abort_Task to in.
+ {<8652/00708652/0070>} {<AI95-00101-01AI95-00101-01>}
+ Corrigendum: Corrected the mode of the parameter to Abort_Task
+ to in.
21.c/2
- {AI95-00237-01AI95-00237-01} Corrected the wording to include
- finalization of a task attribute in the bounded error case; we
- don't want to specify which task does these operations.
+ {<AI95-00237-01AI95-00237-01>} Corrected the wording to
+ include finalization of a task attribute in the bounded error
+ case; we don't want to specify which task does these
+ operations.
_Incompatibilities With Ada 2005_
21.d/3
- {AI05-0189-1AI05-0189-1} Functions Environment_Task and
+ {<AI05-0189-1AI05-0189-1>} Functions Environment_Task and
Activation_Is_Complete are added to Task_Identification. If
Task_Identification is referenced in a use_clause, and an
- entity E with a defining_identifier of Environment_Task or
+ entity <E> with a defining_identifier of Environment_Task or
Activation_Is_Complete is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
@@ -102917,11 +103276,11 @@ the Val parameter is replaced with Initial_Value.
13
For all the operations declared in this package, Tasking_Error is raised
-if the task identified by T is terminated. Program_Error is raised if
+if the task identified by T is terminated. Program_Error is raised if
the value of T is Null_Task_Id.
13.1/2
-{AI95-00237-01AI95-00237-01} After a task has terminated, all of its
+{<AI95-00237-01AI95-00237-01>} After a task has terminated, all of its
attributes are finalized, unless they have been finalized earlier. When
the master of an instantiation of Ada.Task_Attributes is finalized, the
corresponding attribute of each task is finalized, unless it has been
@@ -102936,14 +103295,14 @@ finalized earlier.
13.b/2
Ramification: The task owning an attribute cannot, in general,
finalize that attribute. That's because the attributes are
- finalized after the task is terminated; moreover, a task may
+ finalized <after> the task is terminated; moreover, a task may
have attributes as soon as it is created; the task may never
even have been activated.
_Bounded (Run-Time) Errors_
13.2/1
-{8652/00718652/0071} {AI95-00165-01AI95-00165-01} If the package
+{<8652/00718652/0071>} {<AI95-00165-01AI95-00165-01>} If the package
Ada.Task_Attributes is instantiated with a controlled type and the
controlled type has user-defined Adjust or Finalize operations that in
turn access task attributes by any of the above operations, then a call
@@ -102969,8 +103328,8 @@ declared in this package and the corresponding task
object no longer
exists, the execution of the program is erroneous.
15.1/2
-{8652/00718652/0071} {AI95-00165-01AI95-00165-01}
-{AI95-00237-01AI95-00237-01} An access to a task attribute via a value
+{<8652/00718652/0071>} {<AI95-00165-01AI95-00165-01>}
+{<AI95-00237-01AI95-00237-01>} An access to a task attribute via a value
of type Attribute_Handle is erroneous if executed concurrently with
another such access or a call of any of the operations declared in
package Task_Attributes. An access to a task attribute is erroneous if
@@ -102995,12 +103354,12 @@ attribute.
_Implementation Requirements_
16/1
-{8652/00718652/0071} {AI95-00165-01AI95-00165-01} For a given attribute
-of a given task, the implementation shall perform the operations
-declared in this package atomically with respect to any of these
-operations of the same attribute of the same task. The granularity of
-any locking mechanism necessary to achieve such atomicity is
-implementation defined.
+{<8652/00718652/0071>} {<AI95-00165-01AI95-00165-01>} For a given
+attribute of a given task, the implementation shall perform the
+operations declared in this package atomically with respect to any of
+these operations of the same attribute of the same task. The
+granularity of any locking mechanism necessary to achieve such atomicity
+is implementation defined.
16.a.1/1
Implementation defined: Granularity of locking for
@@ -103012,7 +103371,7 @@ implementation defined.
be safely read and updated concurrently by multiple tasks.
17/2
-{AI95-00237-01AI95-00237-01} After task attributes are finalized, the
+{<AI95-00237-01AI95-00237-01>} After task attributes are finalized, the
implementation shall reclaim any storage associated with the attributes.
_Documentation Requirements_
@@ -103027,7 +103386,7 @@ In addition, if these limits can be configured, the
implementation shall
document how to configure them.
19.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
19.b/2
Documentation Requirement: For package Task_Attributes, limits
@@ -103037,7 +103396,7 @@ document how to configure them.
_Metrics_
20/2
-{AI95-00434-01AI95-00434-01} The implementation shall document the
+{<AI95-00434-01AI95-00434-01>} The implementation shall document the
following metrics: A task calling the following subprograms shall
execute at a sufficiently high priority as to not be preempted during
the measurement period. This period shall start just before issuing the
@@ -103071,7 +103430,7 @@ shall be measured:
equal to Initial_Value;
26/2
- * {AI95-00434-01AI95-00434-01} a call to Set_Value where the Val
+ * {<AI95-00434-01AI95-00434-01>} a call to Set_Value where the Val
parameter is not equal to Initial_Value and the old attribute value
is equal to Initial_Value;
@@ -103102,7 +103461,7 @@ rather than implicitly creating the object.
side effects.
28.b/2
- Implementation Note: {AI95-00114-01AI95-00114-01} This
+ Implementation Note: {<AI95-00114-01AI95-00114-01>} This
permission means that even though every task has every
attribute, storage need only be allocated for those attributes
for which function Reference has been invoked or set to a
@@ -103116,7 +103475,7 @@ the total storage size allocated for all the
attributes of a task.
_Implementation Advice_
30/2
-{AI95-00434-01AI95-00434-01} Some implementations are targeted to
+{<AI95-00434-01AI95-00434-01>} Some implementations are targeted to
domains in which memory use at run time must be completely
deterministic. For such implementations, it is recommended that the
storage for task attributes will be pre-allocated statically and not
@@ -103139,7 +103498,7 @@ for the others. In the latter case, N should be
documented.
work to meet without having to do things twice).
30.1/2
-{AI95-00237-01AI95-00237-01} Finalization of task attributes and
+{<AI95-00237-01AI95-00237-01>} Finalization of task attributes and
reclamation of associated storage should be performed as soon as
possible after task termination.
@@ -103149,14 +103508,15 @@ possible after task termination.
as possible after task termination.
30.d/2
- Reason: {AI95-00237-01AI95-00237-01} This is necessary because
- the normative wording only says that attributes are finalized
- "after" task termination. Without this advice, waiting until
- the instance is finalized would meet the requirements (it is
- after termination, but may be a very long time after
- termination). We can't say anything more specific than this,
- as we do not want to require the overhead of an interaction
- with the tasking system to be done at a specific point.
+ Reason: {<AI95-00237-01AI95-00237-01>} This is necessary
+ because the normative wording only says that attributes are
+ finalized "after" task termination. Without this advice,
+ waiting until the instance is finalized would meet the
+ requirements (it is after termination, but may be a very long
+ time after termination). We can't say anything more specific
+ than this, as we do not want to require the overhead of an
+ interaction with the tasking system to be done at a specific
+ point.
NOTES
@@ -103177,16 +103537,16 @@ possible after task termination.
_Wording Changes from Ada 95_
33.a/2
- {8652/00718652/0071} {AI95-00165-01AI95-00165-01} Corrigendum:
- Clarified that use of task attribute operations from within a
- task attribute operation (by an Adjust or Finalize call) is a
- bounded error, and that concurrent use of attribute handles is
- erroneous.
+ {<8652/00718652/0071>} {<AI95-00165-01AI95-00165-01>}
+ Corrigendum: Clarified that use of task attribute operations
+ from within a task attribute operation (by an Adjust or
+ Finalize call) is a bounded error, and that concurrent use of
+ attribute handles is erroneous.
33.b/2
- {AI95-00237-01AI95-00237-01} Clarified the wording so that the
- finalization takes place after the termination of the task or
- when the instance is finalized (whichever is sooner).
+ {<AI95-00237-01AI95-00237-01>} Clarified the wording so that
+ the finalization takes place after the termination of the task
+ or when the instance is finalized (whichever is sooner).
File: aarm2012.info, Node: C.7.3, Prev: C.7.2, Up: C.7
@@ -103197,7 +103557,7 @@ C.7.3 The Package Task_Termination
_Static Semantics_
1/2
-{AI95-00266-02AI95-00266-02} The following language-defined library
+{<AI95-00266-02AI95-00266-02>} The following language-defined library
package exists:
2/2
@@ -103233,10 +103593,10 @@ package exists:
_Dynamic Semantics_
8/3
-{AI95-00266-02AI95-00266-02} {AI05-0202-1AI05-0202-1} The type
+{<AI95-00266-02AI95-00266-02>} {<AI05-0202-1AI05-0202-1>} The type
Termination_Handler identifies a protected procedure to be executed by
the implementation when a task terminates. Such a protected procedure
-is called a handler. In all cases T identifies the task that is
+is called a <handler>. In all cases T identifies the task that is
terminating. If the task terminates due to completing the last
statement of its body, or as a result of waiting on a terminate
alternative, and the finalization of the task completes normally, then
@@ -103252,36 +103612,36 @@ Unhandled_Exception or Abnormal, and X is an
exception occurrence that
identifies the Program_Error exception.
9/2
-{AI95-00266-02AI95-00266-02} Each task has two termination handlers, a
-fall-back handler and a specific handler. The specific handler applies
-only to the task itself, while the fall-back handler applies only to the
-dependent tasks of the task. A handler is said to be set if it is
-associated with a nonnull value of type Termination_Handler, and cleared
-otherwise. When a task is created, its specific handler and fall-back
-handler are cleared.
+{<AI95-00266-02AI95-00266-02>} Each task has two termination handlers, a
+<fall-back handler> and a <specific handler>. The specific handler
+applies only to the task itself, while the fall-back handler applies
+only to the dependent tasks of the task. A handler is said to be <set>
+if it is associated with a nonnull value of type Termination_Handler,
+and <cleared> otherwise. When a task is created, its specific handler
+and fall-back handler are cleared.
10/3
-{AI95-00266-02AI95-00266-02} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00266-02AI95-00266-02>} {<AI05-0264-1AI05-0264-1>} The procedure
Set_Dependents_Fallback_Handler changes the fall-back handler for the
calling task: if Handler is null, that fall-back handler is cleared;
otherwise, it is set to be Handler.all. If a fall-back handler had
previously been set it is replaced.
11/3
-{AI95-00266-02AI95-00266-02} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00266-02AI95-00266-02>} {<AI05-0264-1AI05-0264-1>} The function
Current_Task_Fallback_Handler returns the fall-back handler that is
currently set for the calling task, if one is set; otherwise, it returns
null.
12/3
-{AI95-00266-02AI95-00266-02} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00266-02AI95-00266-02>} {<AI05-0264-1AI05-0264-1>} The procedure
Set_Specific_Handler changes the specific handler for the task
identified by T: if Handler is null, that specific handler is cleared;
otherwise, it is set to be Handler.all. If a specific handler had
previously been set it is replaced.
12.a/3
- Ramification: {AI05-0005-1AI05-0005-1} This package cannot
+ Ramification: {<AI05-0005-1AI05-0005-1>} This package cannot
portably be used to set a handler on the program as a whole.
It is possible to call Set_Specific_Handler with the
environment task's ID. But any call to the handler would
@@ -103294,52 +103654,53 @@ previously been set it is replaced.
be depended upon.
13/3
-{AI95-00266-02AI95-00266-02} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00266-02AI95-00266-02>} {<AI05-0264-1AI05-0264-1>} The function
Specific_Handler returns the specific handler that is currently set for
the task identified by T, if one is set; otherwise, it returns null.
14/2
-{AI95-00266-02AI95-00266-02} As part of the finalization of a task_body,
-after performing the actions specified in *note 7.6:: for finalization
-of a master, the specific handler for the task, if one is set, is
-executed. If the specific handler is cleared, a search for a fall-back
-handler proceeds by recursively following the master relationship for
-the task. If a task is found whose fall-back handler is set, that
-handler is executed; otherwise, no handler is executed.
+{<AI95-00266-02AI95-00266-02>} As part of the finalization of a
+task_body, after performing the actions specified in *note 7.6:: for
+finalization of a master, the specific handler for the task, if one is
+set, is executed. If the specific handler is cleared, a search for a
+fall-back handler proceeds by recursively following the master
+relationship for the task. If a task is found whose fall-back handler
+is set, that handler is executed; otherwise, no handler is executed.
15/2
-{AI95-00266-02AI95-00266-02} For Set_Specific_Handler or
+{<AI95-00266-02AI95-00266-02>} For Set_Specific_Handler or
Specific_Handler, Tasking_Error is raised if the task identified by T
has already terminated. Program_Error is raised if the value of T is
Ada.Task_Identification.Null_Task_Id.
16/2
-{AI95-00266-02AI95-00266-02} An exception propagated from a handler that
-is invoked as part of the termination of a task has no effect.
+{<AI95-00266-02AI95-00266-02>} An exception propagated from a handler
+that is invoked as part of the termination of a task has no effect.
_Erroneous Execution_
17/2
-{AI95-00266-02AI95-00266-02} For a call of Set_Specific_Handler or
+{<AI95-00266-02AI95-00266-02>} For a call of Set_Specific_Handler or
Specific_Handler, if the task identified by T no longer exists, the
execution of the program is erroneous.
_Extensions to Ada 95_
17.a/2
- {AI95-00266-02AI95-00266-02} Package Task_Termination is new.
+ {<AI95-00266-02AI95-00266-02>} Package Task_Termination is
+ new.
_Wording Changes from Ada 2005_
17.b/3
- {AI05-0202-1AI05-0202-1} Correction: Specified what is passed
- to the handler if the finalization of the task fails after it
- is completed. This was not specified at all in Ada 2005, so
- there is a possibility that some program depended on some
- other behavior of an implementation. But as this case is very
- unlikely (and only occurs when there is already a significant
- bug in the program - so should not occur in fielded systems),
- we're not listing this as an inconsistency.
+ {<AI05-0202-1AI05-0202-1>} Correction: Specified what is
+ passed to the handler if the finalization of the task fails
+ after it is completed. This was not specified at all in Ada
+ 2005, so there is a possibility that some program depended on
+ some other behavior of an implementation. But as this case is
+ very unlikely (and only occurs when there is already a
+ significant bug in the program - so should not occur in
+ fielded systems), we're not listing this as an inconsistency.
File: aarm2012.info, Node: Annex D, Next: Annex E, Prev: Annex C, Up: Top
@@ -103361,7 +103722,7 @@ configuration [of hardware or an underlying system]
supported by the
implementation, and shall document the details of that configuration.
2.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
2.a.1/2
Documentation Requirement: The details of the configuration
@@ -103456,17 +103817,17 @@ D.1 Task Priorities
===================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies the priority model
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies the priority model
for real-time systems. In addition, the methods for specifying
priorities are defined.]
-Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
6.1/3
-{AI05-0229-1AI05-0229-1} For a task type (including the anonymous type
+{<AI05-0229-1AI05-0229-1>} For a task type (including the anonymous type
of a single_task_declaration), protected type (including the anonymous
type of a single_protected_declaration), or subprogram, the following
language-defined representation aspects may be specified:
@@ -103494,10 +103855,10 @@ Interrupt_Priority
_Legality Rules_
7/3
-This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+<This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
8/3
-{AI05-0229-1AI05-0229-1} If the Priority aspect is specified for a
+{<AI05-0229-1AI05-0229-1>} If the Priority aspect is specified for a
subprogram, the expression shall be static, and its value shall be in
the range of System.Priority.
@@ -103506,7 +103867,7 @@ the range of System.Priority.
the environment task starts executing.
8.1/3
-{AI05-0229-1AI05-0229-1} At most one of the Priority and
+{<AI05-0229-1AI05-0229-1>} At most one of the Priority and
Interrupt_Priority aspects may be specified for a given entity.
8.b/3
@@ -103515,7 +103876,7 @@ Interrupt_Priority aspects may be specified for a
given entity.
specifications of a single representation aspect by any means.
8.2/3
-{AI05-0229-1AI05-0229-1} Neither of the Priority or Interrupt_Priority
+{<AI05-0229-1AI05-0229-1>} Neither of the Priority or Interrupt_Priority
aspects shall be specified for a synchronized interface type.
_Static Semantics_
@@ -103524,9 +103885,9 @@ aspects shall be specified for a synchronized
interface type.
The following declarations exist in package System:
10
- subtype Any_Priority is Integer range implementation-defined;
+ subtype Any_Priority is Integer range <implementation-defined>;
subtype Priority is Any_Priority
- range Any_Priority'First .. implementation-defined;
+ range Any_Priority'First .. <implementation-defined>;
subtype Interrupt_Priority is Any_Priority
range Priority'Last+1 .. Any_Priority'Last;
@@ -103546,26 +103907,26 @@ priority values below
System.Interrupt_Priority'First is specified by
the subtype System.Priority.]
13/3
-This paragraph was deleted.{AI05-0229-1AI05-0229-1}
+<This paragraph was deleted.>{<AI05-0229-1AI05-0229-1>}
_Dynamic Semantics_
14/3
-{AI05-0229-1AI05-0229-1} The Priority aspect has no effect if it is
+{<AI05-0229-1AI05-0229-1>} The Priority aspect has no effect if it is
specified for a subprogram other than the main subprogram; the Priority
value is not associated with any task.
15
-A task priority is an integer value that indicates a degree of urgency
+A <task priority> is an integer value that indicates a degree of urgency
and is the basis for resolving competing demands of tasks for resources.
Unless otherwise specified, whenever tasks compete for processors or
other implementation-defined resources, the resources are allocated to
-the task with the highest priority value. The base priority of a task
+the task with the highest priority value. The <base priority> of a task
is the priority with which it was created, or to which it was later set
by Dynamic_Priorities.Set_Priority (see *note D.5::). At all times, a
-task also has an active priority, which generally reflects its base
+task also has an <active priority>, which generally reflects its base
priority as well as any priority it inherits from other sources.
-Priority inheritance is the process by which the priority of a task or
+<Priority inheritance> is the process by which the priority of a task or
other entity (e.g. a protected object; see *note D.3::) is used in the
evaluation of another task's active priority.
@@ -103574,26 +103935,27 @@ evaluation of another task's active priority.
resources.
16/3
-{AI05-0229-1AI05-0229-1} The effect of specifying a Priority or
+{<AI05-0229-1AI05-0229-1>} The effect of specifying a Priority or
Interrupt_Priority aspect for a protected type or
single_protected_declaration is discussed in *note D.3::.
17/4
-{AI05-0229-1AI05-0229-1} {AI12-0081-1AI12-0081-1} The expression
+{<AI05-0229-1AI05-0229-1>} {<AI12-0081-1AI12-0081-1>} The expression
specified for the Priority or Interrupt_Priority aspect of a task type
is evaluated each time an object of the task type is created (see *note
9.1::). For the Priority aspect, the value of the expression is
converted to the subtype Priority; for the Interrupt_Priority aspect,
this value is converted to the subtype Any_Priority. The priority value
-is then associated with the task object.
+is then associated with the task object.
18/3
-{AI05-0229-1AI05-0229-1} Likewise, the priority value is associated with
-the environment task if the aspect is specified for the main subprogram.
+{<AI05-0229-1AI05-0229-1>} Likewise, the priority value is associated
+with the environment task if the aspect is specified for the main
+subprogram.
19/3
-{AI05-0229-1AI05-0229-1} The initial value of a task's base priority is
-specified by default or by means of a Priority or Interrupt_Priority
+{<AI05-0229-1AI05-0229-1>} The initial value of a task's base priority
+is specified by default or by means of a Priority or Interrupt_Priority
aspect. [After a task is created, its base priority can be changed only
by a call to Dynamic_Priorities.Set_Priority (see *note D.5::).] The
initial base priority of a task in the absence of an aspect is the base
@@ -103606,8 +103968,8 @@ used to determine the task's position in any queue
when Priority_Queuing
is specified (see *note D.4::).]
20/2
-{AI95-00357-01AI95-00357-01} At any time, the active priority of a task
-is the maximum of all the priorities the task is inheriting at that
+{<AI95-00357-01AI95-00357-01>} At any time, the active priority of a
+task is the maximum of all the priorities the task is inheriting at that
instant. For a task that is not held (see *note D.11::), its base
priority is a source of priority inheritance unless otherwise specified
for a particular task dispatching policy. Other sources of priority
@@ -103618,13 +103980,13 @@ inheritance are specified under the following
conditions:
define other sources of priority inheritance.
21/1
- * {8652/00728652/0072} {AI95-00092-01AI95-00092-01} During
+ * {<8652/00728652/0072>} {<AI95-00092-01AI95-00092-01>} During
activation, a task being activated inherits the active priority
that its activator (see *note 9.2::) had at the time the activation
was initiated.
22/1
- * {8652/00728652/0072} {AI95-00092-01AI95-00092-01} During
+ * {<8652/00728652/0072>} {<AI95-00092-01AI95-00092-01>} During
rendezvous, the task accepting the entry call inherits the priority
of the entry call (see *note 9.5.3:: and *note D.4::).
@@ -103658,12 +104020,12 @@ The range of System.Priority shall include at least
30 values.
instances described in this Annex for such re-evaluation.
29/3
- 6 {AI05-0248-1AI05-0248-1} An implementation may provide a
+ 6 {<AI05-0248-1AI05-0248-1>} An implementation may provide a
nonstandard mode in which tasks inherit priorities under conditions
other than those specified above.
29.a/3
- Ramification: {AI05-0229-1AI05-0229-1} The use of a Priority
+ Ramification: {<AI05-0229-1AI05-0229-1>} The use of a Priority
or Interrupt_Priority aspect does not require the package
System to be named in a with_clause for the enclosing
compilation_unit.
@@ -103686,27 +104048,28 @@ The range of System.Priority shall include at least
30 values.
_Wording Changes from Ada 95_
29.e/2
- {8652/00728652/0072} {AI95-00092-01AI95-00092-01} Corrigendum:
- Clarified that dynamic priority changes are not transitive -
- that is, they don't apply to tasks that are being activated by
- or in rendezvous with the task that had its priority changed.
+ {<8652/00728652/0072>} {<AI95-00092-01AI95-00092-01>}
+ Corrigendum: Clarified that dynamic priority changes are not
+ transitive - that is, they don't apply to tasks that are being
+ activated by or in rendezvous with the task that had its
+ priority changed.
29.f/2
- {AI95-00357-01AI95-00357-01} Generalized the definition of
+ {<AI95-00357-01AI95-00357-01>} Generalized the definition of
priority inheritance to take into account the differences
between the existing and new dispatching policies.
_Extensions to Ada 2005_
29.g/3
- {AI05-0229-1AI05-0229-1} Aspects Priority and
+ {<AI05-0229-1AI05-0229-1>} Aspects Priority and
Interrupt_Priority are new; pragmas Priority and
Interrupt_Priority are now obsolescent.
_Wording Changes from Ada 2012_
29.h/4
- {AI12-0081-1AI12-0081-1} Corrigendum: Clarified when the
+ {<AI12-0081-1AI12-0081-1>} Corrigendum: Clarified when the
Priority and Interrupt_Priority aspect expressions are
evaluated.
@@ -103717,14 +104080,14 @@ D.2 Priority Scheduling
=======================
1/3
-{AI95-00321-01AI95-00321-01} {AI05-0299-1AI05-0299-1} [This subclause
-describes the rules that determine which task is selected for execution
-when more than one task is ready (see *note 9::).]
+{<AI95-00321-01AI95-00321-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause describes the rules that determine which task is selected for
+execution when more than one task is ready (see *note 9::).]
_Wording Changes from Ada 95_
1.a/3
- {AI95-00321-01AI95-00321-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00321-01AI95-00321-01>} {<AI05-0299-1AI05-0299-1>} This
introduction is simplified in order to reflect the
rearrangement and expansion of this subclause.
@@ -103744,24 +104107,24 @@ D.2.1 The Task Dispatching Model
--------------------------------
1/2
-{AI95-00321-01AI95-00321-01} [The task dispatching model specifies task
-scheduling, based on conceptual priority-ordered ready queues.]
+{<AI95-00321-01AI95-00321-01>} [The task dispatching model specifies
+task scheduling, based on conceptual priority-ordered ready queues.]
_Static Semantics_
1.1/2
-{AI95-00355-01AI95-00355-01} The following language-defined library
+{<AI95-00355-01AI95-00355-01>} The following language-defined library
package exists:
1.2/3
- {AI05-0166-1AI05-0166-1} package Ada.Dispatching is
+ {<AI05-0166-1AI05-0166-1>} package Ada.Dispatching is
pragma Preelaborate(Dispatching);
1.3/3
- {AI05-0166-1AI05-0166-1} procedure Yield;
+ {<AI05-0166-1AI05-0166-1>} procedure Yield;
1.4/3
- {AI05-0166-1AI05-0166-1} Dispatching_Policy_Error : exception;
+ {<AI05-0166-1AI05-0166-1>} Dispatching_Policy_Error : exception;
end Ada.Dispatching;
1.5/2
@@ -103771,10 +104134,10 @@ concerned with task dispatching.
_Dynamic Semantics_
2/2
-{AI95-00321-01AI95-00321-01} A task can become a running task only if it
-is ready (see *note 9::) and the execution resources required by that
-task are available. Processors are allocated to tasks based on each
-task's active priority.
+{<AI95-00321-01AI95-00321-01>} A task can become a <running task> only
+if it is ready (see *note 9::) and the execution resources required by
+that task are available. Processors are allocated to tasks based on
+each task's active priority.
3
It is implementation defined whether, on a multiprocessor, a task that
@@ -103786,12 +104149,13 @@ is waiting for access to a protected object keeps
its processor busy.
processor busy.
4/2
-{AI95-00321-01AI95-00321-01} Task dispatching is the process by which
-one ready task is selected for execution on a processor. This selection
-is done at certain points during the execution of a task called task
-dispatching points. A task reaches a task dispatching point whenever it
-becomes blocked, and when it terminates. [Other task dispatching points
-are defined throughout this Annex for specific policies.]
+{<AI95-00321-01AI95-00321-01>} <Task dispatching> is the process by
+which one ready task is selected for execution on a processor. This
+selection is done at certain points during the execution of a task
+called <task dispatching points>. A task reaches a task dispatching
+point whenever it becomes blocked, and when it terminates. [Other task
+dispatching points are defined throughout this Annex for specific
+policies.]
4.a
Ramification: On multiprocessor systems, more than one task
@@ -103799,18 +104163,18 @@ are defined throughout this Annex for specific
policies.]
one processor, as explained below.
5/2
-{AI95-00321-01AI95-00321-01} Task dispatching policies are specified in
-terms of conceptual ready queues and task states. A ready queue is an
-ordered list of ready tasks. The first position in a queue is called
-the head of the queue, and the last position is called the tail of the
-queue. A task is ready if it is in a ready queue, or if it is running.
-Each processor has one ready queue for each priority value. At any
-instant, each ready queue of a processor contains exactly the set of
-tasks of that priority that are ready for execution on that processor,
-but are not running on any processor; that is, those tasks that are
-ready, are not running on any processor, and can be executed using that
-processor and other available resources. A task can be on the ready
-queues of more than one processor.
+{<AI95-00321-01AI95-00321-01>} <Task dispatching policies> are specified
+in terms of conceptual <ready queues> and task states. A ready queue is
+an ordered list of ready tasks. The first position in a queue is called
+the <head of the queue>, and the last position is called the <tail of
+the queue>. A task is <ready> if it is in a ready queue, or if it is
+running. Each processor has one ready queue for each priority value.
+At any instant, each ready queue of a processor contains exactly the set
+of tasks of that priority that are ready for execution on that
+processor, but are not running on any processor; that is, those tasks
+that are ready, are not running on any processor, and can be executed
+using that processor and other available resources. A task can be on
+the ready queues of more than one processor.
5.a
Discussion: The core language defines a ready task as one that
@@ -103818,36 +104182,36 @@ queues of more than one processor.
ready queues.
6/2
-{AI95-00321-01AI95-00321-01} Each processor also has one running task,
-which is the task currently being executed by that processor. Whenever
-a task running on a processor reaches a task dispatching point it goes
-back to one or more ready queues; a task (possibly the same task) is
-then selected to run on that processor. The task selected is the one at
-the head of the highest priority nonempty ready queue; this task is then
-removed from all ready queues to which it belongs.
+{<AI95-00321-01AI95-00321-01>} Each processor also has one <running
+task>, which is the task currently being executed by that processor.
+Whenever a task running on a processor reaches a task dispatching point
+it goes back to one or more ready queues; a task (possibly the same
+task) is then selected to run on that processor. The task selected is
+the one at the head of the highest priority nonempty ready queue; this
+task is then removed from all ready queues to which it belongs.
6.a
Discussion: There is always at least one task to run, if we
count the idle task.
7/3
-{AI95-00321-01AI95-00321-01} {AI05-0166-1AI05-0166-1} A call of Yield is
-a task dispatching point. Yield is a potentially blocking operation
-(see *note 9.5.1::).
+{<AI95-00321-01AI95-00321-01>} {<AI05-0166-1AI05-0166-1>} A call of
+Yield is a task dispatching point. Yield is a potentially blocking
+operation (see *note 9.5.1::).
7.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
8/2
-This paragraph was deleted.{AI95-00321-01AI95-00321-01}
+<This paragraph was deleted.>{<AI95-00321-01AI95-00321-01>}
8.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Implementation Permissions_
9/2
-{AI95-00321-01AI95-00321-01} An implementation is allowed to define
+{<AI95-00321-01AI95-00321-01>} An implementation is allowed to define
additional resources as execution resources, and to define the
corresponding allocation policies for them. Such resources may have an
implementation-defined effect on task dispatching.
@@ -103861,7 +104225,7 @@ An implementation may place implementation-defined
restrictions on tasks
whose active priority is in the Interrupt_Priority range.
10.a/3
- Ramification: {AI05-0229-1AI05-0229-1} For example, on some
+ Ramification: {<AI05-0229-1AI05-0229-1>} For example, on some
operating systems, it might be necessary to disallow them
altogether. This permission applies to tasks whose priority
is set to interrupt level for any reason: via an aspect, via a
@@ -103869,7 +104233,7 @@ whose active priority is in the Interrupt_Priority
range.
inheritance.
10.1/2
-{AI95-00321-01AI95-00321-01} [For optimization purposes,] an
+{<AI95-00321-01AI95-00321-01>} [For optimization purposes,] an
implementation may alter the points at which task dispatching occurs, in
an implementation-defined manner. However, a delay_statement always
corresponds to at least one task dispatching point.
@@ -103877,11 +104241,11 @@ corresponds to at least one task dispatching point.
NOTES
11/3
- 7 {AI05-0299-1AI05-0299-1} Clause *note 9:: specifies under which
- circumstances a task becomes ready. The ready state is affected by
- the rules for task activation and termination, delay statements,
- and entry calls. When a task is not ready, it is said to be
- blocked.
+ 7 {<AI05-0299-1AI05-0299-1>} Clause *note 9:: specifies under
+ which circumstances a task becomes ready. The ready state is
+ affected by the rules for task activation and termination, delay
+ statements, and entry calls. When a task is not ready, it is said
+ to be blocked.
12
8 An example of a possible implementation-defined execution
@@ -103915,7 +104279,7 @@ corresponds to at least one task dispatching point.
D.5::, "*note D.5:: Dynamic Priorities".
17/2
- 13 {AI95-00321-01AI95-00321-01} The setting of a task's base
+ 13 {<AI95-00321-01AI95-00321-01>} The setting of a task's base
priority as a result of a call to Set_Priority does not always take
effect immediately when Set_Priority is called. The effect of
setting the task's base priority is deferred while the affected
@@ -103924,7 +104288,7 @@ corresponds to at least one task dispatching point.
_Wording Changes from Ada 95_
17.a/3
- {AI95-00321-01AI95-00321-01} {AI05-0005-1AI05-0005-1} This
+ {<AI95-00321-01AI95-00321-01>} {<AI05-0005-1AI05-0005-1>} This
description is simplified to describe only the parts of the
dispatching model common to all policies. In particular,
rules about preemption are moved elsewhere. This makes it
@@ -103934,15 +104298,16 @@ corresponds to at least one task dispatching point.
_Incompatibilities With Ada 2005_
17.b/3
- {AI05-0166-1AI05-0166-1} Procedure Yield is added to
+ {<AI05-0166-1AI05-0166-1>} Procedure Yield is added to
Dispatching. If Dispatching is referenced in a use_clause,
- and an entity E with a defining_identifier of Yield is defined
- in a package that is also referenced in a use_clause, the
- entity E may no longer be use-visible, resulting in errors.
- This should be rare and is easily fixed if it does occur.
+ and an entity <E> with a defining_identifier of Yield is
+ defined in a package that is also referenced in a use_clause,
+ the entity <E> may no longer be use-visible, resulting in
+ errors. This should be rare and is easily fixed if it does
+ occur.
17.c/4
- {AI05-0166-1AI05-0166-1} {AI12-0005-1AI12-0005-1} Package
+ {<AI05-0166-1AI05-0166-1>} {<AI12-0005-1AI12-0005-1>} Package
Dispatching was a Pure package, but now is Preelaborated with
the addition of Yield. This is incompatible as Dispatching
can no longer be depended upon from a Pure package. This
@@ -103957,8 +104322,8 @@ D.2.2 Task Dispatching Pragmas
------------------------------
1/3
-{AI95-00355-01AI95-00355-01} {AI05-0299-1AI05-0299-1} [This subclause
-allows a single task dispatching policy to be defined for all
+{<AI95-00355-01AI95-00355-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause allows a single task dispatching policy to be defined for all
priorities, or the range of priorities to be split into subranges that
are assigned individual dispatching policies.]
@@ -103968,52 +104333,52 @@ are assigned individual dispatching policies.]
The form of a pragma Task_Dispatching_Policy is as follows:
3
- pragma Task_Dispatching_Policy(policy_identifier);
+ pragma Task_Dispatching_Policy(<policy_>identifier);
3.1/2
- {AI95-00355-01AI95-00355-01} The form of a pragma
+ {<AI95-00355-01AI95-00355-01>} The form of a pragma
Priority_Specific_Dispatching is as follows:
3.2/2
pragma Priority_Specific_Dispatching (
- policy_identifier, first_priority_expression, last_priority_
- expression);
+ <policy_>identifier, <first_priority_>expression,
+ <last_priority_>expression);
_Name Resolution Rules_
3.3/2
-{AI95-00355-01AI95-00355-01} The expected type for
-first_priority_expression and last_priority_expression is Integer.
+{<AI95-00355-01AI95-00355-01>} The expected type for
+<first_priority_>expression and <last_priority_>expression is Integer.
_Legality Rules_
4/2
-{AI95-00321-01AI95-00321-01} {AI95-00355-01AI95-00355-01} The
-policy_identifier used in a pragma Task_Dispatching_Policy shall be the
-name of a task dispatching policy.
+{<AI95-00321-01AI95-00321-01>} {<AI95-00355-01AI95-00355-01>} The
+<policy_>identifier used in a pragma Task_Dispatching_Policy shall be
+the name of a task dispatching policy.
4.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
4.1/2
-{AI95-00355-01AI95-00355-01} The policy_identifier used in a pragma
+{<AI95-00355-01AI95-00355-01>} The <policy_>identifier used in a pragma
Priority_Specific_Dispatching shall be the name of a task dispatching
policy.
4.2/2
-{AI95-00355-01AI95-00355-01} Both first_priority_expression and
-last_priority_expression shall be static expressions in the range of
-System.Any_Priority; last_priority_expression shall have a value greater
-than or equal to first_priority_expression.
+{<AI95-00355-01AI95-00355-01>} Both <first_priority_>expression and
+<last_priority_>expression shall be static expressions in the range of
+System.Any_Priority; <last_priority_>expression shall have a value
+greater than or equal to <first_priority_>expression.
_Static Semantics_
4.3/2
-{AI95-00355-01AI95-00355-01} Pragma Task_Dispatching_Policy specifies
+{<AI95-00355-01AI95-00355-01>} Pragma Task_Dispatching_Policy specifies
the single task dispatching policy.
4.4/2
-{AI95-00355-01AI95-00355-01} Pragma Priority_Specific_Dispatching
+{<AI95-00355-01AI95-00355-01>} Pragma Priority_Specific_Dispatching
specifies the task dispatching policy for the specified range of
priorities. Tasks with base priorities within the range of priorities
specified in a Priority_Specific_Dispatching pragma have their active
@@ -104023,7 +104388,7 @@ a Priority_Specific_Dispatching pragma are dispatched
according to the
specified dispatching policy.
4.b/2
- Reason: {AI95-00355-01AI95-00355-01} Each ready queue is
+ Reason: {<AI95-00355-01AI95-00355-01>} Each ready queue is
managed by exactly one policy. Anything else would be chaos.
The ready queue is determined by the active priority.
However, how the active priority is calculated is determined
@@ -104032,7 +104397,7 @@ specified dispatching policy.
determined by the policy of the base priority.
4.5/3
-{AI95-00355-01AI95-00355-01} {AI05-0262-1AI05-0262-1} If a partition
+{<AI95-00355-01AI95-00355-01>} {<AI05-0262-1AI05-0262-1>} If a partition
contains one or more Priority_Specific_Dispatching pragmas, the
dispatching policy for priorities not covered by any
Priority_Specific_Dispatching pragmas is FIFO_Within_Priorities.
@@ -104040,28 +104405,28 @@ Priority_Specific_Dispatching pragmas is
FIFO_Within_Priorities.
_Post-Compilation Rules_
5/2
-{AI95-00355-01AI95-00355-01} A Task_Dispatching_Policy pragma is a
+{<AI95-00355-01AI95-00355-01>} A Task_Dispatching_Policy pragma is a
configuration pragma. A Priority_Specific_Dispatching pragma is a
-configuration pragma.
+configuration pragma.
5.1/2
-{AI95-00355-01AI95-00355-01} The priority ranges specified in more than
-one Priority_Specific_Dispatching pragma within the same partition shall
-not be overlapping.
+{<AI95-00355-01AI95-00355-01>} The priority ranges specified in more
+than one Priority_Specific_Dispatching pragma within the same partition
+shall not be overlapping.
5.2/2
-{AI95-00355-01AI95-00355-01} If a partition contains one or more
+{<AI95-00355-01AI95-00355-01>} If a partition contains one or more
Priority_Specific_Dispatching pragmas it shall not contain a
Task_Dispatching_Policy pragma.
6/2
-This paragraph was deleted.{AI95-00333-01AI95-00333-01}
+<This paragraph was deleted.>{<AI95-00333-01AI95-00333-01>}
_Dynamic Semantics_
7/2
-{AI95-00355-01AI95-00355-01} [A task dispatching policy specifies the
-details of task dispatching that are not covered by the basic task
+{<AI95-00355-01AI95-00355-01>} [A <task dispatching policy> specifies
+the details of task dispatching that are not covered by the basic task
dispatching model. These rules govern when tasks are inserted into and
deleted from the ready queues.] A single task dispatching policy is
specified by a Task_Dispatching_Policy pragma. Pragma
@@ -104069,19 +104434,19 @@ Priority_Specific_Dispatching assigns distinct
dispatching policies to
subranges of System.Any_Priority.
7.1/2
-{AI95-00355-01AI95-00355-01} If neither pragma applies to any of the
+{<AI95-00355-01AI95-00355-01>} If neither pragma applies to any of the
program units comprising a partition, the task dispatching policy for
that partition is unspecified.
7.2/3
-{AI95-00355-01AI95-00355-01} {AI05-0262-1AI05-0262-1} If a partition
+{<AI95-00355-01AI95-00355-01>} {<AI05-0262-1AI05-0262-1>} If a partition
contains one or more Priority_Specific_Dispatching pragmas, a task
dispatching point occurs for the currently running task of a processor
whenever there is a nonempty ready queue for that processor with a
higher priority than the priority of the running task.
7.a/3
- Discussion: {AI05-0005-1AI05-0005-1} If we have priority
+ Discussion: {<AI05-0005-1AI05-0005-1>} If we have priority
specific dispatching then we want preemption across the entire
range of priorities. That prevents higher priority tasks from
being blocked by lower priority tasks that have a different
@@ -104093,7 +104458,7 @@ higher priority than the priority of the running task.
priority specific dispatching pragma.
7.3/2
-{AI95-00355-01AI95-00355-01} A task that has its base priority changed
+{<AI95-00355-01AI95-00355-01>} A task that has its base priority changed
may move from one dispatching policy to another. It is immediately
subject to the new dispatching policy.
@@ -104102,32 +104467,32 @@ subject to the new dispatching policy.
may be immediately preempted or dispatched, according the
rules of the new policy.
-Paragraphs 7 through 13 were moved to D.2.3.
+<Paragraphs 7 through 13 were moved to D.2.3.>
_Implementation Requirements_
14.1/2
-{AI95-00333-01AI95-00333-01} {AI95-00355-01AI95-00355-01} An
+{<AI95-00333-01AI95-00333-01>} {<AI95-00355-01AI95-00355-01>} An
implementation shall allow, for a single partition, both the locking
policy (see *note D.3::) to be specified as Ceiling_Locking and also one
or more Priority_Specific_Dispatching pragmas to be given.
_Documentation Requirements_
-Paragraphs 14 through 16 were moved to D.2.3.
+<Paragraphs 14 through 16 were moved to D.2.3.>
17.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Implementation Permissions_
18/2
-{AI95-00256-01AI95-00256-01} Implementations are allowed to define other
-task dispatching policies, but need not support more than one task
+{<AI95-00256-01AI95-00256-01>} Implementations are allowed to define
+other task dispatching policies, but need not support more than one task
dispatching policy per partition.
19/2
-{AI95-00355-01AI95-00355-01} An implementation need not support pragma
+{<AI95-00355-01AI95-00355-01>} An implementation need not support pragma
Priority_Specific_Dispatching if it is infeasible to support it in the
target environment.
@@ -104137,30 +104502,30 @@ target environment.
NOTES
- Paragraphs 19 through 21 were deleted.
+ <Paragraphs 19 through 21 were deleted.>
_Extensions to Ada 95_
22.a/2
- {AI95-00333-01AI95-00333-01} Amendment Correction: It is no
+ {<AI95-00333-01AI95-00333-01>} Amendment Correction: It is no
longer required to specify Ceiling_Locking with the
language-defined task dispatching policies; we only require
- that implementations allow them to be used together.
+ that implementations <allow> them to be used together.
22.b/3
- {AI95-00355-01AI95-00355-01} {AI05-0005-1AI05-0005-1} Pragma
- Priority_Specific_Dispatching is new; it allows the
+ {<AI95-00355-01AI95-00355-01>} {<AI05-0005-1AI05-0005-1>}
+ Pragma Priority_Specific_Dispatching is new; it allows the
specification of different policies for different priorities.
_Wording Changes from Ada 95_
22.c/2
- {AI95-00256-01AI95-00256-01} Clarified that an implementation
- need support only one task dispatching policy (of any kind,
- language-defined or otherwise) per partition.
+ {<AI95-00256-01AI95-00256-01>} Clarified that an
+ implementation need support only one task dispatching policy
+ (of any kind, language-defined or otherwise) per partition.
22.d/3
- {AI95-00321-01AI95-00321-01} {AI05-0005-1AI05-0005-1} This
+ {<AI95-00321-01AI95-00321-01>} {<AI05-0005-1AI05-0005-1>} This
description is simplified to describe only the rules for the
Task_Dispatching_Policy pragma that are common to all
policies. In particular, rules about preemption are moved
@@ -104174,24 +104539,24 @@ D.2.3 Preemptive Dispatching
----------------------------
1/3
-{AI95-00321-01AI95-00321-01} {AI05-0299-1AI05-0299-1} [This subclause
-defines a preemptive task dispatching policy.]
+{<AI95-00321-01AI95-00321-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause defines a preemptive task dispatching policy.]
_Static Semantics_
2/2
-{AI95-00355-01AI95-00355-01} The policy_identifier
+{<AI95-00355-01AI95-00355-01>} The <policy_>identifier
FIFO_Within_Priorities is a task dispatching policy.
_Dynamic Semantics_
3/2
-{AI95-00321-01AI95-00321-01} When FIFO_Within_Priorities is in effect,
+{<AI95-00321-01AI95-00321-01>} When FIFO_Within_Priorities is in effect,
modifications to the ready queues occur only as follows:
4/2
- * {AI95-00321-01AI95-00321-01} When a blocked task becomes ready, it
- is added at the tail of the ready queue for its active priority.
+ * {<AI95-00321-01AI95-00321-01>} When a blocked task becomes ready,
+ it is added at the tail of the ready queue for its active priority.
5/2
* When the active priority of a ready task that is not running
@@ -104217,21 +104582,21 @@ modifications to the ready queues occur only as
follows:
moves to the "delay queue", not to the ready queue.
8/2
-{AI95-00321-01AI95-00321-01} Each of the events specified above is a
+{<AI95-00321-01AI95-00321-01>} Each of the events specified above is a
task dispatching point (see *note D.2.1::).
9/2
-{AI95-00321-01AI95-00321-01} A task dispatching point occurs for the
+{<AI95-00321-01AI95-00321-01>} A task dispatching point occurs for the
currently running task of a processor whenever there is a nonempty ready
queue for that processor with a higher priority than the priority of the
-running task. The currently running task is said to be preempted and it
-is added at the head of the ready queue for its active priority.
+running task. The currently running task is said to be <preempted> and
+it is added at the head of the ready queue for its active priority.
_Implementation Requirements_
10/2
-{AI95-00333-01AI95-00333-01} An implementation shall allow, for a single
-partition, both the task dispatching policy to be specified as
+{<AI95-00333-01AI95-00333-01>} An implementation shall allow, for a
+single partition, both the task dispatching policy to be specified as
FIFO_Within_Priorities and also the locking policy (see *note D.3::) to
be specified as Ceiling_Locking.
@@ -104243,7 +104608,7 @@ be specified as Ceiling_Locking.
_Documentation Requirements_
11/2
-{AI95-00321-01AI95-00321-01} Priority inversion is the duration for
+{<AI95-00321-01AI95-00321-01>} <Priority inversion> is the duration for
which a task remains at the head of the highest priority nonempty ready
queue while the processor executes a lower priority task. The
implementation shall document:
@@ -104269,14 +104634,14 @@ implementation shall document:
NOTES
14/2
- 14 {AI95-00321-01AI95-00321-01} If the active priority of a
+ 14 {<AI95-00321-01AI95-00321-01>} If the active priority of a
running task is lowered due to loss of inherited priority (as it is
on completion of a protected operation) and there is a ready task
of the same active priority that is not running, the running task
continues to run (provided that there is no higher priority task).
15/2
- 15 {AI95-00321-01AI95-00321-01} Setting the base priority of a
+ 15 {<AI95-00321-01AI95-00321-01>} Setting the base priority of a
ready task causes the task to move to the tail of the queue for its
active priority, regardless of whether the active priority of the
task actually changes.
@@ -104284,17 +104649,17 @@ implementation shall document:
_Wording Changes from Ada 95_
15.a/2
- {AI95-00321-01AI95-00321-01} This subclause is new; it mainly
- consists of text that was found in *note D.2.1:: and *note
- D.2.2:: in Ada 95. This was separated out so the definition
- of additional policies was easier.
+ {<AI95-00321-01AI95-00321-01>} This subclause is new; it
+ mainly consists of text that was found in *note D.2.1:: and
+ *note D.2.2:: in Ada 95. This was separated out so the
+ definition of additional policies was easier.
15.b/2
- {AI95-00333-01AI95-00333-01} We require that implementations
+ {<AI95-00333-01AI95-00333-01>} We require that implementations
allow this policy and Ceiling_Locking together.
15.c/2
- {AI95-00355-01AI95-00355-01} We explicitly defined
+ {<AI95-00355-01AI95-00355-01>} We explicitly defined
FIFO_Within_Priorities to be a task dispatching policy.
@@ -104304,19 +104669,19 @@ D.2.4 Non-Preemptive Dispatching
--------------------------------
1/3
-{AI95-00298-01AI95-00298-01} {AI05-0299-1AI05-0299-1} [This subclause
-defines a non-preemptive task dispatching policy.]
+{<AI95-00298-01AI95-00298-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause defines a non-preemptive task dispatching policy.]
_Static Semantics_
2/2
-{AI95-00298-01AI95-00298-01} {AI95-00355-01AI95-00355-01} The
-policy_identifier Non_Preemptive_FIFO_Within_Priorities is a task
+{<AI95-00298-01AI95-00298-01>} {<AI95-00355-01AI95-00355-01>} The
+<policy_>identifier Non_Preemptive_FIFO_Within_Priorities is a task
dispatching policy.
2.1/3
-{AI05-0166-1AI05-0166-1} The following language-defined library package
-exists:
+{<AI05-0166-1AI05-0166-1>} The following language-defined library
+package exists:
2.2/3
package Ada.Dispatching.Non_Preemptive is
@@ -104326,7 +104691,7 @@ exists:
end Ada.Dispatching.Non_Preemptive;
2.3/3
-{AI05-0166-1AI05-0166-1} {AI05-0264-1AI05-0264-1} A call of
+{<AI05-0166-1AI05-0166-1>} {<AI05-0264-1AI05-0264-1>} A call of
Yield_To_Higher is a task dispatching point for this policy. If the
task at the head of the highest priority ready queue has a higher active
priority than the calling task, then the calling task is preempted.
@@ -104339,7 +104704,7 @@ priority than the calling task, then the calling task
is preempted.
nothing.
2.b/3
- Yield_To_Higher is not a potentially blocking operation; it
+ Yield_To_Higher is <not> a potentially blocking operation; it
can be used during a protected operation. That is allowed, as
under the predefined Ceiling_Locking policy any task with a
higher priority than the protected operation cannot call the
@@ -104350,8 +104715,8 @@ priority than the calling task, then the calling task
is preempted.
_Legality Rules_
3/2
-{AI95-00355-01AI95-00355-01} Non_Preemptive_FIFO_Within_Priorities shall
-not be specified as the policy_identifier of pragma
+{<AI95-00355-01AI95-00355-01>} Non_Preemptive_FIFO_Within_Priorities
+shall not be specified as the <policy_>identifier of pragma
Priority_Specific_Dispatching (see *note D.2.2::).
3.a/2
@@ -104364,12 +104729,13 @@ Priority_Specific_Dispatching (see *note D.2.2::).
_Dynamic Semantics_
4/2
-{AI95-00298-01AI95-00298-01} When Non_Preemptive_FIFO_Within_Priorities
-is in effect, modifications to the ready queues occur only as follows:
+{<AI95-00298-01AI95-00298-01>} When
+Non_Preemptive_FIFO_Within_Priorities is in effect, modifications to the
+ready queues occur only as follows:
5/2
- * {AI95-00298-01AI95-00298-01} When a blocked task becomes ready, it
- is added at the tail of the ready queue for its active priority.
+ * {<AI95-00298-01AI95-00298-01>} When a blocked task becomes ready,
+ it is added at the tail of the ready queue for its active priority.
6/2
* When the active priority of a ready task that is not running
@@ -104392,13 +104758,13 @@ is in effect, modifications to the ready queues
occur only as follows:
moves to the "delay queue", not to the ready queue.
9/3
-{AI05-0166-1AI05-0166-1} For this policy, blocking or termination of a
+{<AI05-0166-1AI05-0166-1>} For this policy, blocking or termination of a
task, a delay_statement, a call to Yield_To_Higher, and a call to
Yield_To_Same_Or_Higher or Yield are the only task dispatching points
-(see *note D.2.1::).
+(see *note D.2.1::).
9.a/3
- Ramification: {AI05-0166-1AI05-0166-1} A delay_statement is
+ Ramification: {<AI05-0166-1AI05-0166-1>} A delay_statement is
always a task dispatching point even if it is not blocking.
Similarly, a call to Yield_To_Higher is never blocking, but it
is a task dispatching point In each of these cases, they can
@@ -104409,8 +104775,8 @@ Yield_To_Same_Or_Higher or Yield are the only task
dispatching points
_Implementation Requirements_
10/2
-{AI95-00333-01AI95-00333-01} An implementation shall allow, for a single
-partition, both the task dispatching policy to be specified as
+{<AI95-00333-01AI95-00333-01>} An implementation shall allow, for a
+single partition, both the task dispatching policy to be specified as
Non_Preemptive_FIFO_Within_Priorities and also the locking policy (see
*note D.3::) to be specified as Ceiling_Locking.
@@ -104422,23 +104788,23 @@ Non_Preemptive_FIFO_Within_Priorities and also the
locking policy (see
_Implementation Permissions_
11/3
-{AI95-00298-01AI95-00298-01} {AI05-0229-1AI05-0229-1}
-{AI05-0269-1AI05-0269-1} Since implementations are allowed to round all
-ceiling priorities in subrange System.Priority to System.Priority'Last
-(see *note D.3::), an implementation may allow a task of a partition
-using the Non_Premptive_FIFO_Within_Priorities policy to execute within
-a protected object without raising its active priority provided the
-associated protected unit does not contain any subprograms with aspects
-Interrupt_Handler or Attach_Handler specified, nor does the unit have
-aspect Interrupt_Priority specified. When the locking policy (see *note
-D.3::) is Ceiling_Locking, an implementation taking advantage of this
-permission shall ensure that a call to Yield_to_Higher that occurs
-within a protected action uses the ceiling priority of the protected
-object (rather than the active priority of the task) when determining
-whether to preempt the task.
+{<AI95-00298-01AI95-00298-01>} {<AI05-0229-1AI05-0229-1>}
+{<AI05-0269-1AI05-0269-1>} Since implementations are allowed to round
+all ceiling priorities in subrange System.Priority to
+System.Priority'Last (see *note D.3::), an implementation may allow a
+task of a partition using the Non_Premptive_FIFO_Within_Priorities
+policy to execute within a protected object without raising its active
+priority provided the associated protected unit does not contain any
+subprograms with aspects Interrupt_Handler or Attach_Handler specified,
+nor does the unit have aspect Interrupt_Priority specified. When the
+locking policy (see *note D.3::) is Ceiling_Locking, an implementation
+taking advantage of this permission shall ensure that a call to
+Yield_to_Higher that occurs within a protected action uses the ceiling
+priority of the protected object (rather than the active priority of the
+task) when determining whether to preempt the task.
11.a.1/3
- Reason: {AI05-0269-1AI05-0269-1} We explicitly require that
+ Reason: {<AI05-0269-1AI05-0269-1>} We explicitly require that
the ceiling priority be used in calls to Yield_to_Higher in
order to prevent a risk of priority inversion and consequent
loss of mutual exclusion when Yield_to_Higher is used in a
@@ -104454,14 +104820,14 @@ whether to preempt the task.
_Extensions to Ada 95_
11.a/2
- {AI95-00298-01AI95-00298-01} {AI95-00355-01AI95-00355-01}
+ {<AI95-00298-01AI95-00298-01>} {<AI95-00355-01AI95-00355-01>}
Policy Non_Preemptive_FIFO_Within_Priorities is new.
_Extensions to Ada 2005_
11.b/3
- {AI05-0166-1AI05-0166-1} Package Dispatching.Non_Preemptive is
- new.
+ {<AI05-0166-1AI05-0166-1>} Package Dispatching.Non_Preemptive
+ is new.
File: aarm2012.info, Node: D.2.5, Next: D.2.6, Prev: D.2.4, Up: D.2
@@ -104470,18 +104836,18 @@ D.2.5 Round Robin Dispatching
-----------------------------
1/3
-{AI95-00355-01AI95-00355-01} {AI05-0299-1AI05-0299-1} [This subclause
-defines the task dispatching policy Round_Robin_Within_Priorities and
-the package Round_Robin.]
+{<AI95-00355-01AI95-00355-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause defines the task dispatching policy
+Round_Robin_Within_Priorities and the package Round_Robin.]
_Static Semantics_
2/2
-{AI95-00355-01AI95-00355-01} The policy_identifier
+{<AI95-00355-01AI95-00355-01>} The <policy>_identifier
Round_Robin_Within_Priorities is a task dispatching policy.
3/2
-{AI95-00355-01AI95-00355-01} The following language-defined library
+{<AI95-00355-01AI95-00355-01>} The following language-defined library
package exists:
4/2
@@ -104489,7 +104855,7 @@ package exists:
with Ada.Real_Time;
package Ada.Dispatching.Round_Robin is
Default_Quantum : constant Ada.Real_Time.Time_Span :=
- implementation-defined;
+ <implementation-defined>;
procedure Set_Quantum (Pri : in System.Priority;
Quantum : in Ada.Real_Time.Time_Span);
procedure Set_Quantum (Low, High : in System.Priority;
@@ -104504,7 +104870,7 @@ package exists:
Dispatching.Round_Robin.
5/2
-{AI95-00355-01AI95-00355-01} When task dispatching policy
+{<AI95-00355-01AI95-00355-01>} When task dispatching policy
Round_Robin_Within_Priorities is the single policy in effect for a
partition, each task with priority in the range of
System.Interrupt_Priority is dispatched according to policy
@@ -104513,29 +104879,29 @@ FIFO_Within_Priorities.
_Dynamic Semantics_
6/2
-{AI95-00355-01AI95-00355-01} The procedures Set_Quantum set the required
-Quantum value for a single priority level Pri or a range of priority
-levels Low .. High. If no quantum is set for a Round Robin priority
-level, Default_Quantum is used.
+{<AI95-00355-01AI95-00355-01>} The procedures Set_Quantum set the
+required Quantum value for a single priority level Pri or a range of
+priority levels Low .. High. If no quantum is set for a Round Robin
+priority level, Default_Quantum is used.
7/2
-{AI95-00355-01AI95-00355-01} The function Actual_Quantum returns the
+{<AI95-00355-01AI95-00355-01>} The function Actual_Quantum returns the
actual quantum used by the implementation for the priority level Pri.
8/3
-{AI95-00355-01AI95-00355-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00355-01AI95-00355-01>} {<AI05-0264-1AI05-0264-1>} The function
Is_Round_Robin returns True if priority Pri is covered by task
dispatching policy Round_Robin_Within_Priorities; otherwise, it returns
False.
9/2
-{AI95-00355-01AI95-00355-01} A call of Actual_Quantum or Set_Quantum
+{<AI95-00355-01AI95-00355-01>} A call of Actual_Quantum or Set_Quantum
raises exception Dispatching.Dispatching_Policy_Error if a predefined
policy other than Round_Robin_Within_Priorities applies to the specified
priority or any of the priorities in the specified range.
10/2
-{AI95-00355-01AI95-00355-01} For Round_Robin_Within_Priorities, the
+{<AI95-00355-01AI95-00355-01>} For Round_Robin_Within_Priorities, the
dispatching rules for FIFO_Within_Priorities apply with the following
additional rules:
@@ -104582,7 +104948,7 @@ additional rules:
_Implementation Requirements_
15/2
-{AI95-00333-01AI95-00333-01} {AI95-00355-01AI95-00355-01} An
+{<AI95-00333-01AI95-00333-01>} {<AI95-00355-01AI95-00355-01>} An
implementation shall allow, for a single partition, both the task
dispatching policy to be specified as Round_Robin_Within_Priorities and
also the locking policy (see *note D.3::) to be specified as
@@ -104596,7 +104962,7 @@ Ceiling_Locking.
_Documentation Requirements_
16/2
-{AI95-00355-01AI95-00355-01} An implementation shall document the
+{<AI95-00355-01AI95-00355-01>} An implementation shall document the
quantum values supported.
16.a.1/2
@@ -104604,7 +104970,7 @@ quantum values supported.
round robin dispatching.
17/2
-{AI95-00355-01AI95-00355-01} An implementation shall document the
+{<AI95-00355-01AI95-00355-01>} An implementation shall document the
accuracy with which it detects the exhaustion of the budget of a task.
17.a.1/2
@@ -104615,19 +104981,19 @@ accuracy with which it detects the exhaustion of
the budget of a task.
NOTES
18/2
- 16 {AI95-00355-01AI95-00355-01} Due to implementation constraints,
- the quantum value returned by Actual_Quantum might not be identical
- to that set with Set_Quantum.
+ 16 {<AI95-00355-01AI95-00355-01>} Due to implementation
+ constraints, the quantum value returned by Actual_Quantum might not
+ be identical to that set with Set_Quantum.
19/2
- 17 {AI95-00355-01AI95-00355-01} A task that executes continuously
- with an inherited priority will not be subject to round robin
- dispatching.
+ 17 {<AI95-00355-01AI95-00355-01>} A task that executes
+ continuously with an inherited priority will not be subject to
+ round robin dispatching.
_Extensions to Ada 95_
19.a/2
- {AI95-00355-01AI95-00355-01} Policy
+ {<AI95-00355-01AI95-00355-01>} Policy
Round_Robin_Within_Priorities and package
Dispatching.Round_Robin are new.
@@ -104638,20 +105004,20 @@ D.2.6 Earliest Deadline First Dispatching
-----------------------------------------
1/2
-{AI95-00357-01AI95-00357-01} The deadline of a task is an indication of
-the urgency of the task; it represents a point on an ideal physical time
-line. The deadline might affect how resources are allocated to the
+{<AI95-00357-01AI95-00357-01>} The deadline of a task is an indication
+of the urgency of the task; it represents a point on an ideal physical
+time line. The deadline might affect how resources are allocated to the
task.
2/3
-{AI95-00357-01AI95-00357-01} {AI05-0229-1AI05-0229-1}
-{AI05-0299-1AI05-0299-1} This subclause defines a package for
+{<AI95-00357-01AI95-00357-01>} {<AI05-0229-1AI05-0229-1>}
+{<AI05-0299-1AI05-0299-1>} This subclause defines a package for
representing the deadline of a task and a dispatching policy that
defines Earliest Deadline First (EDF) dispatching. An aspect is defined
to assign an initial deadline to a task.
2.a/3
- Discussion: {AI05-0229-1AI05-0229-1} This aspect is the only
+ Discussion: {<AI05-0229-1AI05-0229-1>} This aspect is the only
way of assigning an initial deadline to a task so that its
activation can be controlled by EDF scheduling. This is
similar to the way aspect Priority is used to give an initial
@@ -104660,7 +105026,7 @@ to assign an initial deadline to a task.
_Language Design Principles_
2.b/3
- {AI95-00357-01AI95-00357-01} {AI05-0299-1AI05-0299-1} To
+ {<AI95-00357-01AI95-00357-01>} {<AI05-0299-1AI05-0299-1>} To
predict the behavior of a multi-tasking program it is
necessary to control access to the processor which is
preemptive, and shared objects which are usually
@@ -104671,27 +105037,27 @@ to assign an initial deadline to a task.
notion of priority is used for processor dispatching and
preemption levels. With EDF and similar schemes priority is
used for preemption levels (only), with another measure used
- for dispatching. T.P. Baker showed (Real-Time Systems, March
- 1991, vol. 3, num. 1, Stack-Based Scheduling of Realtime
- Processes) that for EDF a newly released task should only
- preempt the currently running task if it has an earlier
+ for dispatching. T.P. Baker showed (<Real-Time Systems>,
+ March 1991, vol. 3, num. 1, <Stack-Based Scheduling of
+ Realtime Processes>) that for EDF a newly released task should
+ only preempt the currently running task if it has an earlier
deadline and a higher preemption level than any currently
"locked" protected object. The rules of this subclause
implement this scheme including the case where the newly
released task should execute before some existing tasks but
not preempt the currently executing task.
-Paragraphs 3 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 3 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
7/2
-{AI95-00357-01AI95-00357-01} The policy_identifier EDF_Across_Priorities
-is a task dispatching policy.
+{<AI95-00357-01AI95-00357-01>} The <policy_>identifier
+EDF_Across_Priorities is a task dispatching policy.
8/2
-{AI95-00357-01AI95-00357-01} The following language-defined library
+{<AI95-00357-01AI95-00357-01>} The following language-defined library
package exists:
9/2
@@ -104712,7 +105078,7 @@ package exists:
end Ada.Dispatching.EDF;
9.1/3
-{AI05-0229-1AI05-0229-1} For a task type (including the anonymous type
+{<AI05-0229-1AI05-0229-1>} For a task type (including the anonymous type
of a single_task_declaration) or subprogram, the following
language-defined representation aspect may be specified:
@@ -104728,21 +105094,21 @@ Relative_Deadline
_Legality Rules_
9.3/3
-{AI05-0229-1AI05-0229-1} The Relative_Deadline aspect shall not be
+{<AI05-0229-1AI05-0229-1>} The Relative_Deadline aspect shall not be
specified on a task interface type.
_Post-Compilation Rules_
10/2
-{AI95-00357-01AI95-00357-01} If the EDF_Across_Priorities policy is
+{<AI95-00357-01AI95-00357-01>} If the EDF_Across_Priorities policy is
specified for a partition, then the Ceiling_Locking policy (see *note
D.3::) shall also be specified for the partition.
11/2
-{AI95-00357-01AI95-00357-01} If the EDF_Across_Priorities policy appears
-in a Priority_Specific_Dispatching pragma (see *note D.2.2::) in a
-partition, then the Ceiling_Locking policy (see *note D.3::) shall also
-be specified for the partition.
+{<AI95-00357-01AI95-00357-01>} If the EDF_Across_Priorities policy
+appears in a Priority_Specific_Dispatching pragma (see *note D.2.2::) in
+a partition, then the Ceiling_Locking policy (see *note D.3::) shall
+also be specified for the partition.
11.a/2
Reason: Unlike the other language-defined dispatching
@@ -104755,12 +105121,12 @@ be specified for the partition.
_Dynamic Semantics_
12/3
-{AI95-00357-01AI95-00357-01} {AI05-0229-1AI05-0229-1} The
+{<AI95-00357-01AI95-00357-01>} {<AI05-0229-1AI05-0229-1>} The
Relative_Deadline aspect has no effect if it is specified for a
subprogram other than the main subprogram.
13/3
-{AI95-00357-01AI95-00357-01} {AI05-0229-1AI05-0229-1} The initial
+{<AI95-00357-01AI95-00357-01>} {<AI05-0229-1AI05-0229-1>} The initial
absolute deadline of a task for which aspect Relative_Deadline is
specified is the value of Real_Time.Clock + the expression that is the
value of the aspect, where this entire expression, including the call of
@@ -104776,39 +105142,40 @@ using the value of the Relative_Deadline aspect of
the main subprogram
so of course this rule applies to it.
14/2
-{AI95-00357-01AI95-00357-01} The procedure Set_Deadline changes the
+{<AI95-00357-01AI95-00357-01>} The procedure Set_Deadline changes the
absolute deadline of the task to D. The function Get_Deadline returns
the absolute deadline of the task.
15/2
-{AI95-00357-01AI95-00357-01} The procedure Delay_Until_And_Set_Deadline
-delays the calling task until time Delay_Until_Time. When the task
-becomes runnable again it will have deadline Delay_Until_Time +
-Deadline_Offset.
+{<AI95-00357-01AI95-00357-01>} The procedure
+Delay_Until_And_Set_Deadline delays the calling task until time
+Delay_Until_Time. When the task becomes runnable again it will have
+deadline Delay_Until_Time + Deadline_Offset.
16/2
-{AI95-00357-01AI95-00357-01} On a system with a single processor, the
+{<AI95-00357-01AI95-00357-01>} On a system with a single processor, the
setting of the deadline of a task to the new value occurs immediately at
the first point that is outside the execution of a protected action. If
the task is currently on a ready queue it is removed and re-entered on
to the ready queue determined by the rules defined below.
17/2
-{AI95-00357-01AI95-00357-01} When EDF_Across_Priorities is specified for
-priority range Low..High all ready queues in this range are ordered by
-deadline. The task at the head of a queue is the one with the earliest
-deadline.
+{<AI95-00357-01AI95-00357-01>} When EDF_Across_Priorities is specified
+for priority range <Low>..<High> all ready queues in this range are
+ordered by deadline. The task at the head of a queue is the one with
+the earliest deadline.
18/2
-{AI95-00357-01AI95-00357-01} A task dispatching point occurs for the
-currently running task T to which policy EDF_Across_Priorities applies:
+{<AI95-00357-01AI95-00357-01>} A task dispatching point occurs for the
+currently running task <T> to which policy EDF_Across_Priorities
+applies:
19/2
- * when a change to the deadline of T occurs;
+ * when a change to the deadline of <T> occurs;
20/2
- * there is a task on the ready queue for the active priority of T
- with a deadline earlier than the deadline of T; or
+ * there is a task on the ready queue for the active priority of <T>
+ with a deadline earlier than the deadline of <T>; or
21/2
* there is a nonempty ready queue for that processor with a higher
@@ -104819,37 +105186,37 @@ In these cases, the currently running task is said
to be preempted and
is returned to the ready queue for its active priority.
23/2
-{AI95-00357-01AI95-00357-01} For a task T to which policy
+{<AI95-00357-01AI95-00357-01>} For a task <T> to which policy
EDF_Across_Priorities applies, the base priority is not a source of
priority inheritance; the active priority when first activated or while
it is blocked is defined as the maximum of the following:
24/2
* the lowest priority in the range specified as EDF_Across_Priorities
- that includes the base priority of T;
+ that includes the base priority of <T>;
25/2
- * the priorities, if any, currently inherited by T;
+ * the priorities, if any, currently inherited by <T>;
26/3
- * {AI05-0055-1AI05-0055-1} the highest priority P, if any, less than
- the base priority of T such that one or more tasks are executing
- within a protected object with ceiling priority P and task T has an
- earlier deadline than all such tasks; and furthermore T has an
- earlier deadline than all other tasks on ready queues with
- priorities in the given EDF_Across_Priorities range that are
- strictly less than P.
+ * {<AI05-0055-1AI05-0055-1>} the highest priority <P>, if any, less
+ than the base priority of <T> such that one or more tasks are
+ executing within a protected object with ceiling priority <P> and
+ task <T> has an earlier deadline than all such tasks; and
+ furthermore <T> has an earlier deadline than all other tasks on
+ ready queues with priorities in the given EDF_Across_Priorities
+ range that are strictly less than <P>.
26.a/2
- Ramification: The active priority of T might be lower than its
- base priority.
+ Ramification: The active priority of <T> might be lower than
+ its base priority.
27/2
-{AI95-00357-01AI95-00357-01} When a task T is first activated or becomes
-unblocked, it is added to the ready queue corresponding to this active
-priority. Until it becomes blocked again, the active priority of T
-remains no less than this value; it will exceed this value only while it
-is inheriting a higher priority.
+{<AI95-00357-01AI95-00357-01>} When a task <T> is first activated or
+becomes unblocked, it is added to the ready queue corresponding to this
+active priority. Until it becomes blocked again, the active priority of
+<T> remains no less than this value; it will exceed this value only
+while it is inheriting a higher priority.
27.a/2
Discussion: These rules ensure that a task executing in a
@@ -104859,29 +105226,30 @@ is inheriting a higher priority.
define a new kind of protected object locking.
28/2
-{AI95-00357-01AI95-00357-01} When the setting of the base priority of a
-ready task takes effect and the new priority is in a range specified as
-EDF_Across_Priorities, the task is added to the ready queue
+{<AI95-00357-01AI95-00357-01>} When the setting of the base priority of
+a ready task takes effect and the new priority is in a range specified
+as EDF_Across_Priorities, the task is added to the ready queue
corresponding to its new active priority, as determined above.
29/2
-{AI95-00357-01AI95-00357-01} For all the operations defined in
+{<AI95-00357-01AI95-00357-01>} For all the operations defined in
Dispatching.EDF, Tasking_Error is raised if the task identified by T has
terminated. Program_Error is raised if the value of T is Null_Task_Id.
_Bounded (Run-Time) Errors_
30/2
-{AI95-00357-01AI95-00357-01} If EDF_Across_Priorities is specified for
-priority range Low..High, it is a bounded error to declare a protected
-object with ceiling priority Low or to assign the value Low to attribute
-'Priority. In either case either Program_Error is raised or the ceiling
-of the protected object is assigned the value Low+1.
+{<AI95-00357-01AI95-00357-01>} If EDF_Across_Priorities is specified for
+priority range <Low>..<High>, it is a bounded error to declare a
+protected object with ceiling priority <Low> or to assign the value
+<Low> to attribute 'Priority. In either case either Program_Error is
+raised or the ceiling of the protected object is assigned the value
+<Low>+1.
_Erroneous Execution_
31/2
-{AI95-00357-01AI95-00357-01} If a value of Task_Id is passed as a
+{<AI95-00357-01AI95-00357-01>} If a value of Task_Id is passed as a
parameter to any of the subprograms of this package and the
corresponding task object no longer exists, the execution of the program
is erroneous.
@@ -104889,7 +105257,7 @@ is erroneous.
_Documentation Requirements_
32/2
-{AI95-00357-01AI95-00357-01} On a multiprocessor, the implementation
+{<AI95-00357-01AI95-00357-01>} On a multiprocessor, the implementation
shall document any conditions that cause the completion of the setting
of the deadline of a task to be delayed later than what is specified for
a single processor.
@@ -104902,13 +105270,13 @@ a single processor.
NOTES
33/3
- 18 {AI95-00357-01AI95-00357-01} {AI05-0264-1AI05-0264-1} If two
- adjacent priority ranges, A..B and B+1..C are specified to have
- policy EDF_Across_Priorities, then this is not equivalent to this
- policy being specified for the single range, A..C.
+ 18 {<AI95-00357-01AI95-00357-01>} {<AI05-0264-1AI05-0264-1>} If
+ two adjacent priority ranges, <A>..<B> and <B>+1..<C> are specified
+ to have policy EDF_Across_Priorities, then this is not equivalent
+ to this policy being specified for the single range, <A>..<C>.
34/2
- 19 {AI95-00357-01AI95-00357-01} The above rules implement the
+ 19 {<AI95-00357-01AI95-00357-01>} The above rules implement the
preemption-level protocol (also called Stack Resource Policy
protocol) for resource sharing under EDF dispatching. The
preemption-level for a task is denoted by its base priority. The
@@ -104916,7 +105284,7 @@ a single processor.
follows the existing rules for ceiling locking.
34.a/2
- Implementation Note: {AI95-00357-01AI95-00357-01} An
+ Implementation Note: {<AI95-00357-01AI95-00357-01>} An
implementation may support additional dispatching policies by
replacing absolute deadline with an alternative measure of
urgency.
@@ -104924,19 +105292,19 @@ a single processor.
_Extensions to Ada 95_
34.b/2
- {AI95-00357-01AI95-00357-01} Policy EDF_Across_Priorities and
- package Dispatching.EDF are new.
+ {<AI95-00357-01AI95-00357-01>} Policy EDF_Across_Priorities
+ and package Dispatching.EDF are new.
_Extensions to Ada 2005_
34.c/3
- {AI05-0229-1AI05-0229-1} Aspect Relative_Deadline is new;
+ {<AI05-0229-1AI05-0229-1>} Aspect Relative_Deadline is new;
pragma Relative_Deadline is now obsolescent.
_Wording Changes from Ada 2005_
34.d/3
- {AI05-0055-1AI05-0055-1} Correction: Corrected definition of
+ {<AI05-0055-1AI05-0055-1>} Correction: Corrected definition of
active priority to avoid deadline inversion in an unusual
case.
@@ -104947,9 +105315,9 @@ D.3 Priority Ceiling Locking
============================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies the interactions
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies the interactions
between priority task scheduling and protected object ceilings. This
-interaction is based on the concept of the ceiling priority of a
+interaction is based on the concept of the <ceiling priority> of a
protected object.]
_Syntax_
@@ -104958,16 +105326,16 @@ protected object.]
The form of a pragma Locking_Policy is as follows:
3
- pragma Locking_Policy(policy_identifier);
+ pragma Locking_Policy(<policy_>identifier);
_Legality Rules_
4
-The policy_identifier shall either be Ceiling_Locking or an
+The <policy_>identifier shall either be Ceiling_Locking or an
implementation-defined identifier.
4.a
- Implementation defined: Implementation-defined policy_
+ Implementation defined: Implementation-defined <policy_>
identifiers allowed in a pragma Locking_Policy.
_Post-Compilation Rules_
@@ -104978,41 +105346,41 @@ A Locking_Policy pragma is a configuration pragma.
_Dynamic Semantics_
6/2
-{8652/00738652/0073} {AI95-00091-01AI95-00091-01}
-{AI95-00327-01AI95-00327-01} [A locking policy specifies the details of
-protected object locking. All protected objects have a priority. The
-locking policy specifies the meaning of the priority of a protected
+{<8652/00738652/0073>} {<AI95-00091-01AI95-00091-01>}
+{<AI95-00327-01AI95-00327-01>} [A locking policy specifies the details
+of protected object locking. All protected objects have a priority.
+The locking policy specifies the meaning of the priority of a protected
object, and the relationships between these priorities and task
priorities. In addition, the policy specifies the state of a task when
it executes a protected action, and how its active priority is affected
-by the locking.] The locking policy is specified by a Locking_Policy
+by the locking.] The <locking policy> is specified by a Locking_Policy
pragma. For implementation-defined locking policies, the meaning of the
priority of a protected object is implementation defined. If no
Locking_Policy pragma applies to any of the program units comprising a
partition, the locking policy for that partition, as well as the meaning
-of the priority of a protected object, are implementation defined.
+of the priority of a protected object, are implementation defined.
6.a/2
Implementation defined: The locking policy if no
Locking_Policy pragma applies to any unit of a partition.
6.1/3
-{AI95-00327-01AI95-00327-01} {AI05-0229-1AI05-0229-1} The expression
+{<AI95-00327-01AI95-00327-01>} {<AI05-0229-1AI05-0229-1>} The expression
specified for the Priority or Interrupt_Priority aspect (see *note
D.1::) is evaluated as part of the creation of the corresponding
protected object and converted to the subtype System.Any_Priority or
System.Interrupt_Priority, respectively. The value of the expression is
the initial priority of the corresponding protected object. If no
Priority or Interrupt_Priority aspect is specified for a protected
-object, the initial priority is specified by the locking policy.
+object, the initial priority is specified by the locking policy.
7
There is one predefined locking policy, Ceiling_Locking; this policy is
defined as follows:
8/3
- * {AI95-00327-01AI95-00327-01} {AI05-0229-1AI05-0229-1} Every
- protected object has a ceiling priority, which is determined by
+ * {<AI95-00327-01AI95-00327-01>} {<AI05-0229-1AI05-0229-1>} Every
+ protected object has a <ceiling priority>, which is determined by
either a Priority or Interrupt_Priority aspect as defined in *note
D.1::, or by assignment to the Priority attribute as described in
*note D.5.2::. The ceiling priority of a protected object (or
@@ -105021,25 +105389,25 @@ defined as follows:
object.
9/2
- * {AI95-00327-01AI95-00327-01} The initial ceiling priority of a
+ * {<AI95-00327-01AI95-00327-01>} The initial ceiling priority of a
protected object is equal to the initial priority for that object.
10/4
- * {AI95-00327-01AI95-00327-01} {AI05-0229-1AI05-0229-1}
- {AI12-0051-1AI12-0051-1} If an Interrupt_Handler or Attach_Handler
- aspect (see *note C.3.1::) is specified for a protected subprogram
- of a protected type that does not have either the Priority or
- Interrupt_Priority aspect specified, the initial priority of
- protected objects of that type is implementation defined, but in
- the range of the subtype System.Interrupt_Priority.
+ * {<AI95-00327-01AI95-00327-01>} {<AI05-0229-1AI05-0229-1>}
+ {<AI12-0051-1AI12-0051-1>} If an Interrupt_Handler or
+ Attach_Handler aspect (see *note C.3.1::) is specified for a
+ protected subprogram of a protected type that does not have either
+ the Priority or Interrupt_Priority aspect specified, the initial
+ priority of protected objects of that type is implementation
+ defined, but in the range of the subtype System.Interrupt_Priority.
10.a
Implementation defined: Default ceiling priorities.
11/3
- * {AI95-00327-01AI95-00327-01} {AI05-0229-1AI05-0229-1} If neither
- aspect Priority nor Interrupt_Priority is specified for a protected
- type, and no protected subprogram of the type has aspect
+ * {<AI95-00327-01AI95-00327-01>} {<AI05-0229-1AI05-0229-1>} If
+ neither aspect Priority nor Interrupt_Priority is specified for a
+ protected type, and no protected subprogram of the type has aspect
Interrupt_Handler or Attach_Handler specified, then the initial
priority of the corresponding protected object is
System.Priority'Last.
@@ -105056,10 +105424,10 @@ defined as follows:
_Bounded (Run-Time) Errors_
13.1/2
-{AI95-00327-01AI95-00327-01} Following any change of priority, it is a
+{<AI95-00327-01AI95-00327-01>} Following any change of priority, it is a
bounded error for the active priority of any task with a call queued on
an entry of a protected object to be higher than the ceiling priority of
-the protected object. In this case one of the following applies:
+the protected object. In this case one of the following applies:
13.2/2
* at any time prior to executing the entry body Program_Error is
@@ -105115,9 +105483,9 @@ of that subrange, uniformly.
crosses the boundary between normal and interrupt priorities.
15/2
-{AI95-00256-01AI95-00256-01} Implementations are allowed to define other
-locking policies, but need not support more than one locking policy per
-partition.
+{<AI95-00256-01AI95-00256-01>} Implementations are allowed to define
+other locking policies, but need not support more than one locking
+policy per partition.
16
[Since implementations are allowed to place restrictions on code that
@@ -105197,8 +105565,8 @@ implementation-defined locking policies.
_Extensions to Ada 95_
23.a/2
- {AI95-00327-01AI95-00327-01} All protected objects now have a
- priority, which is the value of the Priority attribute of
+ {<AI95-00327-01AI95-00327-01>} All protected objects now have
+ a priority, which is the value of the Priority attribute of
*note D.5.2::. How this value is interpreted depends on the
locking policy; for instance, the ceiling priority is derived
from this value when the locking policy is Ceiling_Locking.
@@ -105206,17 +105574,17 @@ implementation-defined locking policies.
_Wording Changes from Ada 95_
23.b/2
- {8652/00738652/0073} {AI95-00091-01AI95-00091-01} Corrigendum:
- Corrected the wording to reflect that pragma Locking_Policy
- cannot be inside of a program unit.
+ {<8652/00738652/0073>} {<AI95-00091-01AI95-00091-01>}
+ Corrigendum: Corrected the wording to reflect that pragma
+ Locking_Policy cannot be inside of a program unit.
23.c/2
- {AI95-00256-01AI95-00256-01} Clarified that an implementation
- need support only one locking policy (of any kind,
- language-defined or otherwise) per partition.
+ {<AI95-00256-01AI95-00256-01>} Clarified that an
+ implementation need support only one locking policy (of any
+ kind, language-defined or otherwise) per partition.
23.d/2
- {AI95-00327-01AI95-00327-01} The bounded error for the
+ {<AI95-00327-01AI95-00327-01>} The bounded error for the
priority of a task being higher than the ceiling of an object
it is currently in was moved here from *note D.5::, so that it
applies no matter how the situation arises.
@@ -105224,14 +105592,14 @@ implementation-defined locking policies.
_Wording Changes from Ada 2005_
23.e/3
- {AI05-0229-1AI05-0229-1} Revised to use aspects Priority and
+ {<AI05-0229-1AI05-0229-1>} Revised to use aspects Priority and
Interrupt_Priority as pragmas Priority and Interrupt_Priority
are now obsolescent.
_Wording Changes from Ada 2012_
23.f/4
- {AI12-0051-1AI12-0051-1} Corrigendum: Clarified that the
+ {<AI12-0051-1AI12-0051-1>} Corrigendum: Clarified that the
Priority aspect can be used to set the initial ceiling
priority of a protected object that contains an interrupt
handler.
@@ -105243,9 +105611,9 @@ D.4 Entry Queuing Policies
==========================
1/3
-{8652/00748652/0074} {AI95-00068-01AI95-00068-01}
-{AI05-0299-1AI05-0299-1} [ This subclause specifies a mechanism for a
-user to choose an entry queuing policy. It also defines two such
+{<8652/00748652/0074>} {<AI95-00068-01AI95-00068-01>}
+{<AI05-0299-1AI05-0299-1>} [ This subclause specifies a mechanism for a
+user to choose an entry <queuing policy>. It also defines two such
policies. Other policies are implementation defined.]
1.a
@@ -105258,13 +105626,13 @@ policies. Other policies are implementation
defined.]
The form of a pragma Queuing_Policy is as follows:
3
- pragma Queuing_Policy(policy_identifier);
+ pragma Queuing_Policy(<policy_>identifier);
_Legality Rules_
4
-The policy_identifier shall be either FIFO_Queuing, Priority_Queuing or
-an implementation-defined identifier.
+The <policy_>identifier shall be either FIFO_Queuing, Priority_Queuing
+or an implementation-defined identifier.
_Post-Compilation Rules_
@@ -105274,10 +105642,10 @@ A Queuing_Policy pragma is a configuration pragma.
_Dynamic Semantics_
6
-[A queuing policy governs the order in which tasks are queued for entry
-service, and the order in which different entry queues are considered
-for service.] The queuing policy is specified by a Queuing_Policy
-pragma.
+[A <queuing policy> governs the order in which tasks are queued for
+entry service, and the order in which different entry queues are
+considered for service.] The queuing policy is specified by a
+Queuing_Policy pragma.
6.a
Ramification: The queuing policy includes entry queuing order,
@@ -105286,7 +105654,7 @@ pragma.
more than one entry_barrier condition is True.
7/2
-{AI95-00355-01AI95-00355-01} Two queuing policies, FIFO_Queuing and
+{<AI95-00355-01AI95-00355-01>} Two queuing policies, FIFO_Queuing and
Priority_Queuing, are language defined. If no Queuing_Policy pragma
applies to any of the program units comprising the partition, the
queuing policy for that partition is FIFO_Queuing. The rules for this
@@ -105298,15 +105666,15 @@ The Priority_Queuing policy is defined as follows:
9
* The calls to an entry [(including a member of an entry family)] are
queued in an order consistent with the priorities of the calls.
- The priority of an entry call is initialized from the active
+ The <priority of an entry call> is initialized from the active
priority of the calling task at the time the call is made, but can
change later. Within the same priority, the order is consistent
with the calling (or requeuing, or priority setting) time (that is,
a FIFO order).
10/1
- * {8652/00758652/0075} {AI95-00205-01AI95-00205-01} After a call is
- first queued, changes to the active priority of a task do not
+ * {<8652/00758652/0075>} {<AI95-00205-01AI95-00205-01>} After a call
+ is first queued, changes to the active priority of a task do not
affect the priority of the call, unless the base priority of the
task is set while the task is blocked on an entry call.
@@ -105400,20 +105768,20 @@ The Priority_Queuing policy is defined as follows:
_Implementation Permissions_
15/2
-{AI95-00256-01AI95-00256-01} Implementations are allowed to define other
-queuing policies, but need not support more than one queuing policy per
-partition.
+{<AI95-00256-01AI95-00256-01>} Implementations are allowed to define
+other queuing policies, but need not support more than one queuing
+policy per partition.
15.a.1/2
- Discussion: {8652/01168652/0116} {AI95-00069-01AI95-00069-01}
- {AI95-00256-01AI95-00256-01} This rule is really redundant, as
- *note 10.1.5:: allows an implementation to limit the use of
- configuration pragmas to an empty environment. In that case,
- there would be no way to have multiple policies in a
- partition.
+ Discussion: {<8652/01168652/0116>}
+ {<AI95-00069-01AI95-00069-01>} {<AI95-00256-01AI95-00256-01>}
+ This rule is really redundant, as *note 10.1.5:: allows an
+ implementation to limit the use of configuration pragmas to an
+ empty environment. In that case, there would be no way to
+ have multiple policies in a partition.
15.1/2
-{AI95-00188-02AI95-00188-02} Implementations are allowed to defer the
+{<AI95-00188-02AI95-00188-02>} Implementations are allowed to defer the
reordering of entry queues following a change of base priority of a task
blocked on the entry call if it is not practical to reorder the queue
immediately.
@@ -105441,29 +105809,30 @@ implementation-defined queuing policies.
_Wording Changes from Ada 95_
16.b/2
- {8652/00748652/0074} {AI95-00068-01AI95-00068-01} Corrigendum:
- Corrected the number of queuing policies defined.
+ {<8652/00748652/0074>} {<AI95-00068-01AI95-00068-01>}
+ Corrigendum: Corrected the number of queuing policies defined.
16.c/2
- {8652/00758652/0075} {AI95-00205-01AI95-00205-01} Corrigendum:
- Corrected so that a call of Set_Priority in an abortable part
- does not change the priority of the triggering entry call.
+ {<8652/00758652/0075>} {<AI95-00205-01AI95-00205-01>}
+ Corrigendum: Corrected so that a call of Set_Priority in an
+ abortable part does not change the priority of the triggering
+ entry call.
16.d/2
- {AI95-00188-02AI95-00188-02} Added a permission to defer queue
- reordering when the base priority of a task is changed. This
- is a counterpart to stronger requirements on the
+ {<AI95-00188-02AI95-00188-02>} Added a permission to defer
+ queue reordering when the base priority of a task is changed.
+ This is a counterpart to stronger requirements on the
implementation of priority change.
16.e/2
- {AI95-00256-01AI95-00256-01} Clarified that an implementation
- need support only one queuing policy (of any kind,
- language-defined or otherwise) per partition.
+ {<AI95-00256-01AI95-00256-01>} Clarified that an
+ implementation need support only one queuing policy (of any
+ kind, language-defined or otherwise) per partition.
16.f/2
- {AI95-00355-01AI95-00355-01} Fixed wording to make clear that
- pragma never appears inside of a unit; rather it "applies to"
- the unit.
+ {<AI95-00355-01AI95-00355-01>} Fixed wording to make clear
+ that pragma never appears inside of a unit; rather it "applies
+ to" the unit.
File: aarm2012.info, Node: D.5, Next: D.6, Prev: D.4, Up: Annex D
@@ -105472,14 +105841,14 @@ D.5 Dynamic Priorities
======================
1/3
-{AI95-00327-01AI95-00327-01} {AI05-0299-1AI05-0299-1} [This subclause
-describes how the priority of an entity can be modified or queried at
-run time.]
+{<AI95-00327-01AI95-00327-01>} {<AI05-0299-1AI05-0299-1>} [This
+subclause describes how the priority of an entity can be modified or
+queried at run time.]
_Wording Changes from Ada 95_
1.a/3
- {AI95-00327-01AI95-00327-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00327-01AI95-00327-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is turned into two subclauses. This subclause
introduction is new.
@@ -105495,8 +105864,8 @@ D.5.1 Dynamic Priorities for Tasks
----------------------------------
1/3
-{AI05-0299-1AI05-0299-1} [This subclause describes how the base priority
-of a task can be modified or queried at run time.]
+{<AI05-0299-1AI05-0299-1>} [This subclause describes how the base
+priority of a task can be modified or queried at run time.]
_Static Semantics_
@@ -105504,8 +105873,8 @@ of a task can be modified or queried at run time.]
The following language-defined library package exists:
3/2
- {AI95-00362-01AI95-00362-01} with System;
- with Ada.Task_Identification; -- See *note C.7.1::
+ {<AI95-00362-01AI95-00362-01>} with System;
+ with Ada.Task_Identification; <-- See *note C.7.1::>
package Ada.Dynamic_Priorities is
pragma Preelaborate(Dynamic_Priorities);
@@ -105557,18 +105926,18 @@ Program_Error is raised by Set_Priority and
Get_Priority if T is equal
to Null_Task_Id.
10/2
-{AI95-00188-02AI95-00188-02} On a system with a single processor, the
-setting of the base priority of a task T to the new value occurs
-immediately at the first point when T is outside the execution of a
+{<AI95-00188-02AI95-00188-02>} On a system with a single processor, the
+setting of the base priority of a task <T> to the new value occurs
+immediately at the first point when <T> is outside the execution of a
protected action.
10.a/2
- Implementation Note: {AI95-00188-02AI95-00188-02} The priority
- change is immediate if the target task is on a delay queue or
- a ready queue outside of a protected action. However,
- consider when Set_Priority is called by a task T1 to set the
- priority of T2, if T2 is blocked, waiting on an entry call
- queued on a protected object, the entry queue needs to be
+ Implementation Note: {<AI95-00188-02AI95-00188-02>} The
+ priority change is immediate if the target task is on a delay
+ queue or a ready queue outside of a protected action.
+ However, consider when Set_Priority is called by a task T1 to
+ set the priority of T2, if T2 is blocked, waiting on an entry
+ call queued on a protected object, the entry queue needs to be
reordered. Since T1 might have a priority that is higher than
the ceiling of the protected object, T1 cannot, in general, do
the reordering. One way to implement this is to wake T2 up
@@ -105611,7 +105980,7 @@ protected action.
this won't help, because one would normally want the
third task to have high priority.
-Paragraph 11 was deleted.
+<Paragraph 11 was deleted.>
_Erroneous Execution_
@@ -105631,7 +106000,7 @@ program is erroneous.
_Documentation Requirements_
12.1/2
-{AI95-00188-02AI95-00188-02} On a multiprocessor, the implementation
+{<AI95-00188-02AI95-00188-02>} On a multiprocessor, the implementation
shall document any conditions that cause the completion of the setting
of the priority of a task to be delayed later than what is specified for
a single processor.
@@ -105661,7 +106030,7 @@ The implementation shall document the following
metric:
NOTES
15/2
- 26 {AI95-00321-01AI95-00321-01} Setting a task's base priority
+ 26 {<AI95-00321-01AI95-00321-01>} Setting a task's base priority
affects task dispatching. First, it can change the task's active
priority. Second, under the FIFO_Within_Priorities policy it
always causes the task to move to the tail of the ready queue
@@ -105688,7 +106057,7 @@ The implementation shall document the following
metric:
Predefined Language Environment".
18/3
- 29 {AI05-0092-1AI05-0092-1} The rule for when Tasking_Error is
+ 29 {<AI05-0092-1AI05-0092-1>} The rule for when Tasking_Error is
raised for Set_Priority or Get_Priority is different from the rule
for when Tasking_Error is raised on an entry call (see *note
9.5.3::). In particular, querying the priority of a completed or
@@ -105707,28 +106076,28 @@ The implementation shall document the following
metric:
_Extensions to Ada 95_
19.a/2
- {AI95-00188-02AI95-00188-02} Amendment Correction: Priority
+ {<AI95-00188-02AI95-00188-02>} Amendment Correction: Priority
changes are now required to be done immediately so long as the
target task is not on an entry queue.
19.b/2
- {AI95-00362-01AI95-00362-01} Dynamic_Priorities is now
+ {<AI95-00362-01AI95-00362-01>} Dynamic_Priorities is now
Preelaborated, so it can be used in preelaborated units.
_Wording Changes from Ada 95_
19.c/3
- {AI95-00327-01AI95-00327-01} {AI05-0299-1AI05-0299-1} This Ada
- 95 subclause was moved down a level. The paragraph numbers
- are the same as those for *note D.5:: in Ada 95.
+ {<AI95-00327-01AI95-00327-01>} {<AI05-0299-1AI05-0299-1>} This
+ Ada 95 subclause was moved down a level. The paragraph
+ numbers are the same as those for *note D.5:: in Ada 95.
19.d/2
- {AI95-00321-01AI95-00321-01} There is no "standard" policy
+ {<AI95-00321-01AI95-00321-01>} There is no "standard" policy
anymore, so that phrase was replaced by the name of a specific
policy in the notes.
19.e/2
- {AI95-00327-01AI95-00327-01} The bounded error for the
+ {<AI95-00327-01AI95-00327-01>} The bounded error for the
priority of a task being higher than the ceiling of an object
it is currently in was moved to *note D.3::, so that it
applies no matter how the situation arises.
@@ -105740,19 +106109,19 @@ D.5.2 Dynamic Priorities for Protected Objects
----------------------------------------------
1/3
-{AI95-00327-01AI95-00327-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00327-01AI95-00327-01>} {<AI05-0299-1AI05-0299-1>} This subclause
specifies how the priority of a protected object can be modified or
queried at run time.
_Static Semantics_
2/2
-{AI95-00327-01AI95-00327-01} The following attribute is defined for a
+{<AI95-00327-01AI95-00327-01>} The following attribute is defined for a
prefix P that denotes a protected object:
3/2
P'Priority
- {AI95-00327-01AI95-00327-01} Denotes a non-aliased
+ {<AI95-00327-01AI95-00327-01>} Denotes a non-aliased
component of the protected object P. This component is of
type System.Any_Priority and its value is the priority of
P. P'Priority denotes a variable if and only if P denotes
@@ -105760,30 +106129,30 @@ P'Priority
only within the body of P.
4/2
-{AI95-00327-01AI95-00327-01} The initial value of this attribute is the
-initial value of the priority of the protected object[, and can be
+{<AI95-00327-01AI95-00327-01>} The initial value of this attribute is
+the initial value of the priority of the protected object[, and can be
changed by an assignment].
_Dynamic Semantics_
5/3
-{AI95-00327-01AI95-00327-01} {AI05-0264-1AI05-0264-1} If the locking
+{<AI95-00327-01AI95-00327-01>} {<AI05-0264-1AI05-0264-1>} If the locking
policy Ceiling_Locking (see *note D.3::) is in effect, then the ceiling
-priority of a protected object P is set to the value of P'Priority at
-the end of each protected action of P.
+priority of a protected object <P> is set to the value of <P>'Priority
+at the end of each protected action of <P>.
6/3
-{AI95-00445-01AI95-00445-01} {AI05-0229-1AI05-0229-1} If the locking
-policy Ceiling_Locking is in effect, then for a protected object P with
-either an Attach_Handler or Interrupt_Handler aspect specified for one
-of its procedures, a check is made that the value to be assigned to
-P'Priority is in the range System.Interrupt_Priority. If the check
+{<AI95-00445-01AI95-00445-01>} {<AI05-0229-1AI05-0229-1>} If the locking
+policy Ceiling_Locking is in effect, then for a protected object <P>
+with either an Attach_Handler or Interrupt_Handler aspect specified for
+one of its procedures, a check is made that the value to be assigned to
+<P>'Priority is in the range System.Interrupt_Priority. If the check
fails, Program_Error is raised.
_Metrics_
7/2
-{AI95-00327-01AI95-00327-01} The implementation shall document the
+{<AI95-00327-01AI95-00327-01>} The implementation shall document the
following metric:
8/2
@@ -105815,7 +106184,7 @@ following metric:
NOTES
11/2
- 31 {AI95-00327-01AI95-00327-01} Since P'Priority is a normal
+ 31 {<AI95-00327-01AI95-00327-01>} Since P'Priority is a normal
variable, the value following an assignment to the attribute
immediately reflects the new value even though its impact on the
ceiling priority of P is postponed until completion of the
@@ -105824,8 +106193,8 @@ following metric:
_Extensions to Ada 95_
11.a/2
- {AI95-00327-01AI95-00327-01} {AI95-00445-01AI95-00445-01} The
- ability to dynamically change and query the priority of a
+ {<AI95-00327-01AI95-00327-01>} {<AI95-00445-01AI95-00445-01>}
+ The ability to dynamically change and query the priority of a
protected object is new.
@@ -105835,7 +106204,7 @@ D.6 Preemptive Abort
====================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies requirements on the
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies requirements on the
immediacy with which an aborted construct is completed.]
_Dynamic Semantics_
@@ -105853,7 +106222,7 @@ that cause the completion of an aborted construct to
be delayed later
than what is specified for a single processor.
3.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
3.b/2
Documentation Requirement: On a multiprocessor, any conditions
@@ -105879,7 +106248,7 @@ The implementation shall document the following
metrics:
that it is required for a single processor.
7/2
- * {AI95-00114-01AI95-00114-01} An upper bound on the execution time
+ * {<AI95-00114-01AI95-00114-01>} An upper bound on the execution time
of an asynchronous_select, in processor clock cycles. This is
measured between a point immediately before a task T1 executes a
protected operation Pr.Set that makes the condition of an
@@ -105940,37 +106309,37 @@ D.7 Tasking Restrictions
========================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause defines restrictions that can
+{<AI05-0299-1AI05-0299-1>} [This subclause defines restrictions that can
be used with a pragma Restrictions (see *note 13.12::) to facilitate the
construction of highly efficient tasking run-time systems.]
_Static Semantics_
2
-The following restriction_identifiers are language defined:
+The following <restriction_>identifiers are language defined:
3/3
-{AI05-0013-1AI05-0013-1} {AI05-0216-1AI05-0216-1} No_Task_Hierarchy
+{<AI05-0013-1AI05-0013-1>} {<AI05-0216-1AI05-0216-1>} No_Task_Hierarchy
No task depends on a master other than the library-level
master.
3.a/3
- Ramification: {AI05-0216-1AI05-0216-1} This is equivalent to
+ Ramification: {<AI05-0216-1AI05-0216-1>} This is equivalent to
saying "no task depends on a master other than the master that
is the execution of the body of the environment task of the
partition", but it is much easier to understand. This is a
post-compilation check, which can be checked at compile-time.
3.b/3
- {AI05-0013-1AI05-0013-1} This disallows any function returning
- an object with a task part or coextension, even if called at
- the library level, as such a task would temporarily depend on
- a nested master (the master of the return statement), which is
- disallowed by this restriction.
+ {<AI05-0013-1AI05-0013-1>} This disallows any function
+ returning an object with a task part or coextension, even if
+ called at the library level, as such a task would temporarily
+ depend on a nested master (the master of the return
+ statement), which is disallowed by this restriction.
4/3
-{8652/00428652/0042} {AI95-00130-01AI95-00130-01}
-{AI95-00360-01AI95-00360-01} {AI05-0013-1AI05-0013-1}
+{<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>}
+{<AI95-00360-01AI95-00360-01>} {<AI05-0013-1AI05-0013-1>}
No_Nested_Finalization
Objects of a type that needs finalization (see *note
7.6::) are declared only at library level. If an access
@@ -105980,11 +106349,11 @@ No_Nested_Finalization
or qualified_expression needs finalization.
4.a/1
- This paragraph was deleted.{8652/00428652/0042}
- {AI95-00130-01AI95-00130-01}
+ <This paragraph was deleted.>{<8652/00428652/0042>}
+ {<AI95-00130-01AI95-00130-01>}
4.b/3
- Ramification: {AI05-0013-1AI05-0013-1} The second sentence
+ Ramification: {<AI05-0013-1AI05-0013-1>} The second sentence
prevents the declaration of objects of access types which
would require nested finalization. It also prevents the
declarations of coextensions that need finalization in a
@@ -105994,7 +106363,7 @@ No_Nested_Finalization
view).
5/3
-{AI05-0211-1AI05-0211-1} No_Abort_Statements
+{<AI05-0211-1AI05-0211-1>} No_Abort_Statements
There are no abort_statements, and there is no use of a
name denoting Task_Identification.Abort_Task.
@@ -106009,7 +106378,7 @@ No_Task_Allocators
containing task subcomponents.
7.1/3
- {AI05-0224-1AI05-0224-1} In the case of an initialized
+ {<AI05-0224-1AI05-0224-1>} In the case of an initialized
allocator of an access type whose designated type is
class-wide and limited, a check is made that the specific
type of the allocated object has no task subcomponents.
@@ -106027,26 +106396,27 @@ No_Implicit_Heap_Allocations
heap storage allocation.
9/2
-{AI95-00327-01AI95-00327-01} No_Dynamic_Priorities
+{<AI95-00327-01AI95-00327-01>} No_Dynamic_Priorities
There are no semantic dependences on the package
Dynamic_Priorities, and no occurrences of the attribute
- Priority.
+ Priority.
10/3
-{AI95-00305-01AI95-00305-01} {AI95-00394-01AI95-00394-01}
-{AI05-0013-1AI05-0013-1} {AI05-0211-1AI05-0211-1} No_Dynamic_Attachment
+{<AI95-00305-01AI95-00305-01>} {<AI95-00394-01AI95-00394-01>}
+{<AI05-0013-1AI05-0013-1>} {<AI05-0211-1AI05-0211-1>}
+No_Dynamic_Attachment
There is no use of a name denoting any of the operations
defined in package Interrupts (Is_Reserved, Is_Attached,
Current_Handler, Attach_Handler, Exchange_Handler,
Detach_Handler, and Reference).
10.a/3
- Ramification: {AI05-0013-1AI05-0013-1} This includes 'Access
+ Ramification: {<AI05-0013-1AI05-0013-1>} This includes 'Access
and 'Address of any of these operations, as well as inherited
versions of these operations.
10.1/4
-{AI12-0055-1AI12-0055-1} No_Dynamic_CPU_Assignment
+{<AI12-0055-1AI12-0055-1>} No_Dynamic_CPU_Assignment
No task has the CPU aspect specified to be a non-static
expression. Each task (including the environment task)
that has the CPU aspect specified as Not_A_Specific_CPU
@@ -106078,22 +106448,22 @@ No_Implicit_Heap_Allocations
Not_A_Specific_CPU will execute.
10.2/3
-{AI95-00305-01AI95-00305-01} {AI05-0013-1AI05-0013-1}
+{<AI95-00305-01AI95-00305-01>} {<AI05-0013-1AI05-0013-1>}
No_Local_Protected_Objects
Protected objects are declared only at library level.
10.3/3
-{AI95-00297-01AI95-00297-01} {AI05-0013-1AI05-0013-1}
+{<AI95-00297-01AI95-00297-01>} {<AI05-0013-1AI05-0013-1>}
No_Local_Timing_Events
Timing_Events are declared only at library level.
10.4/2
-{AI95-00305-01AI95-00305-01} No_Protected_Type_Allocators
+{<AI95-00305-01AI95-00305-01>} No_Protected_Type_Allocators
There are no allocators for protected types or types
containing protected type subcomponents.
10.5/3
- {AI05-0224-1AI05-0224-1} In the case of an initialized
+ {<AI05-0224-1AI05-0224-1>} In the case of an initialized
allocator of an access type whose designated type is
class-wide and limited, a check is made that the specific
type of the allocated object has no protected
@@ -106101,28 +106471,29 @@ No_Local_Timing_Events
fails.
10.6/3
-{AI95-00305-01AI95-00305-01} {AI05-0211-1AI05-0211-1} No_Relative_Delay
+{<AI95-00305-01AI95-00305-01>} {<AI05-0211-1AI05-0211-1>}
+No_Relative_Delay
There are no delay_relative_statements, and there is no
use of a name that denotes the Timing_Events.Set_Handler
subprogram that has a Time_Span parameter.
10.7/3
-{AI95-00305-01AI95-00305-01} No_Requeue_Statements
+{<AI95-00305-01AI95-00305-01>} No_Requeue_Statements
There are no requeue_statements.
10.8/3
-{AI95-00305-01AI95-00305-01} No_Select_Statements
+{<AI95-00305-01AI95-00305-01>} No_Select_Statements
There are no select_statements.
10.9/3
-{AI95-00394-01AI95-00394-01} {AI05-0211-1AI05-0211-1}
+{<AI95-00394-01AI95-00394-01>} {<AI05-0211-1AI05-0211-1>}
No_Specific_Termination_Handlers
There is no use of a name denoting the
Set_Specific_Handler and Specific_Handler subprograms in
Task_Termination.
10.10/4
-{AI12-0117-1AI12-0117-1} No_Tasks_Unassigned_To_CPU
+{<AI12-0117-1AI12-0117-1>} No_Tasks_Unassigned_To_CPU
The CPU aspect is specified for the environment task. No
CPU aspect is specified to be statically equal to
Not_A_Specific_CPU. If aspect CPU is specified
@@ -106140,13 +106511,14 @@ No_Specific_Termination_Handlers
checks are needed.
10.11/3
-{AI95-00305-01AI95-00305-01} {AI05-0013-1AI05-0013-1} Simple_Barriers
+{<AI95-00305-01AI95-00305-01>} {<AI05-0013-1AI05-0013-1>}
+Simple_Barriers
The Boolean expression in each entry barrier is either a
static expression or a name that statically denotes a
component of the enclosing protected object.
11
-The following restriction_parameter_identifiers are language defined:
+The following <restriction_parameter_>identifiers are language defined:
12
Max_Select_Alternatives
@@ -106167,17 +106539,17 @@ Max_Protected_Entries
type. The bounds of every entry family of a protected
unit shall be static, or shall be defined by a
discriminant of a subtype whose corresponding bound is
- static.
+ static.
_Dynamic Semantics_
15/2
-{8652/00768652/0076} {AI95-00067-01AI95-00067-01}
-{AI95-00305-01AI95-00305-01} The following restriction_identifier is
+{<8652/00768652/0076>} {<AI95-00067-01AI95-00067-01>}
+{<AI95-00305-01AI95-00305-01>} The following <restriction_>identifier is
language defined:
15.1/2
-{AI95-00305-01AI95-00305-01} {AI95-00394-01AI95-00394-01}
+{<AI95-00305-01AI95-00305-01>} {<AI95-00394-01AI95-00394-01>}
No_Task_Termination
All tasks are nonterminating. It is
implementation-defined what happens if a task attempts to
@@ -106190,10 +106562,10 @@ No_Task_Termination
applies to a partition, what happens when a task terminates.
16
-The following restriction_parameter_identifiers are language defined:
+The following <restriction_parameter_>identifiers are language defined:
17/1
-{8652/00768652/0076} {AI95-00067-01AI95-00067-01}
+{<8652/00768652/0076>} {<AI95-00067-01AI95-00067-01>}
Max_Storage_At_Blocking
Specifies the maximum portion [(in storage elements)] of
a task's Storage_Size that can be retained by a blocked
@@ -106206,7 +106578,7 @@ Max_Storage_At_Blocking
Max_Storage_At_Blocking is violated.
18/1
-{8652/00768652/0076} {AI95-00067-01AI95-00067-01}
+{<8652/00768652/0076>} {<AI95-00067-01AI95-00067-01>}
Max_Asynchronous_Select_Nesting
Specifies the maximum dynamic nesting level of
asynchronous_selects. A value of zero prevents the use
@@ -106222,7 +106594,7 @@ Max_Asynchronous_Select_Nesting
Max_Asynchronous_Select_Nesting is violated.
19/1
-{8652/00768652/0076} {AI95-00067-01AI95-00067-01} Max_Tasks
+{<8652/00768652/0076>} {<AI95-00067-01AI95-00067-01>} Max_Tasks
Specifies the maximum number of task creations that may
be executed over the lifetime of a partition, not
counting the creation of the environment task. A value
@@ -106247,14 +106619,14 @@ Max_Asynchronous_Select_Nesting
Max_Tasks is violated.
19.1/2
-{AI95-00305-01AI95-00305-01} Max_Entry_Queue_Length
+{<AI95-00305-01AI95-00305-01>} Max_Entry_Queue_Length
Max_Entry_Queue_Length defines the maximum number of
calls that are queued on an entry. Violation of this
restriction results in the raising of Program_Error at
the point of the call or requeue.
19.2/3
-{AI05-0189-1AI05-0189-1} No_Standard_Allocators_After_Elaboration
+{<AI05-0189-1AI05-0189-1>} No_Standard_Allocators_After_Elaboration
Specifies that an allocator using a standard storage pool
(see *note 13.11::) shall not occur within a
parameterless library subprogram, nor within the
@@ -106264,8 +106636,8 @@ Max_Asynchronous_Select_Nesting
pool.
19.3/3
- {AI05-0189-1AI05-0189-1} {AI05-0262-1AI05-0262-1} At run
- time, Storage_Error is raised if an allocator using a
+ {<AI05-0189-1AI05-0189-1>} {<AI05-0262-1AI05-0262-1>} At
+ run time, Storage_Error is raised if an allocator using a
standard storage pool is evaluated after the elaboration
of the library_items of the partition has completed.
@@ -106299,10 +106671,10 @@ restrictions to produce a more efficient
implementation.
_Incompatibilities With Ada 95_
22.a/2
- {AI95-00360-01AI95-00360-01} Amendment Correction: The
+ {<AI95-00360-01AI95-00360-01>} Amendment Correction: The
No_Nested_Finalization is now defined in terms of types that
need finalization. These types include a variety of
- language-defined types that might be implemented with a
+ language-defined types that <might> be implemented with a
controlled type. If the restriction No_Nested_Finalization
(see *note D.7::) applies to the partition, and one of these
language-defined types does not have a controlled part, it
@@ -106314,8 +106686,8 @@ restrictions to produce a more efficient
implementation.
_Extensions to Ada 95_
22.b/2
- {AI95-00297-01AI95-00297-01} {AI95-00305-01AI95-00305-01}
- {AI95-00394-01AI95-00394-01} Restrictions
+ {<AI95-00297-01AI95-00297-01>} {<AI95-00305-01AI95-00305-01>}
+ {<AI95-00394-01AI95-00394-01>} Restrictions
No_Dynamic_Attachment, No_Local_Protected_Objects,
No_Protected_Type_Allocators, No_Local_Timing_Events,
No_Relative_Delay, No_Requeue_Statement, No_Select_Statements,
@@ -106326,28 +106698,28 @@ restrictions to produce a more efficient
implementation.
_Wording Changes from Ada 95_
22.c/2
- {8652/00428652/0042} {AI95-00130-01AI95-00130-01} Corrigendum:
- Clarified that No_Nested_Finalization covered task and
- protected parts as well.
+ {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>}
+ Corrigendum: Clarified that No_Nested_Finalization covered
+ task and protected parts as well.
22.d/2
- {8652/00768652/0076} {AI95-00067-01AI95-00067-01} Corrigendum:
- Changed the description of Max_Tasks and
+ {<8652/00768652/0076>} {<AI95-00067-01AI95-00067-01>}
+ Corrigendum: Changed the description of Max_Tasks and
Max_Asynchronous_Select_Nested to eliminate conflicts with the
High Integrity Annex (see *note H.4::).
22.e/2
- {AI95-00327-01AI95-00327-01} Added using of the new Priority
+ {<AI95-00327-01AI95-00327-01>} Added using of the new Priority
attribute to the restriction No_Dynamic_Priorities.
22.f/2
- {AI95-00394-01AI95-00394-01} Restriction
+ {<AI95-00394-01AI95-00394-01>} Restriction
No_Asynchronous_Control is now obsolescent.
_Incompatibilities With Ada 2005_
22.g/3
- {AI05-0013-1AI05-0013-1} Correction: Changed so that
+ {<AI05-0013-1AI05-0013-1>} Correction: Changed so that
coextensions of types that require nested finalization are
also prohibited; this is done by prohibiting allocators rather
than objects of specific access types. It seems unlikely that
@@ -106356,7 +106728,7 @@ restrictions to produce a more efficient
implementation.
will be affected by this change.
22.h/3
- {AI05-0211-1AI05-0211-1} Correction: The restriction
+ {<AI05-0211-1AI05-0211-1>} Correction: The restriction
No_Relative_Delay was changed to include the Timing_Events
routine that uses a relative delay. This means that a program
that uses that routine and this restriction will now be
@@ -106368,49 +106740,51 @@ restrictions to produce a more efficient
implementation.
be affected by this change.
22.i/3
- {AI05-0211-1AI05-0211-1} Correction: A number of restrictions
- were changed from "no calls" on some subprogram to "no use of
- a name that denotes" that subprogram. This closes a hole
- where renames, uses as the prefix of 'Access, and the like,
- would not be rejected by the restriction, possibly allowing
- backdoor access to the prohibited subprogram. A program that
- uses one of these restrictions and using such backdoor access
- will now be rejected; however, it is extremely unlikely that
- any program that relies on these restrictions would also use
- an end-run around the restriction, so it is expected that very
- few programs will be affected by this change.
+ {<AI05-0211-1AI05-0211-1>} Correction: A number of
+ restrictions were changed from "no calls" on some subprogram
+ to "no use of a name that denotes" that subprogram. This
+ closes a hole where renames, uses as the prefix of 'Access,
+ and the like, would not be rejected by the restriction,
+ possibly allowing backdoor access to the prohibited
+ subprogram. A program that uses one of these restrictions and
+ using such backdoor access will now be rejected; however, it
+ is extremely unlikely that any program that relies on these
+ restrictions would also use an end-run around the restriction,
+ so it is expected that very few programs will be affected by
+ this change.
_Extensions to Ada 2005_
22.j/3
- {AI05-0189-1AI05-0189-1} Restriction
+ {<AI05-0189-1AI05-0189-1>} Restriction
No_Standard_Allocators_After_Elaboration is newly added to
Ada.
_Wording Changes from Ada 2005_
22.k/3
- {AI05-0013-1AI05-0013-1} {AI05-0216-1AI05-0216-1} Correction:
- Improved the wording of various restrictions to make it
- clearer that they prohibit things that would otherwise be
- legal, and to word them as definitions, not Legality Rules;.
+ {<AI05-0013-1AI05-0013-1>} {<AI05-0216-1AI05-0216-1>}
+ Correction: Improved the wording of various restrictions to
+ make it clearer that they prohibit things that would otherwise
+ be legal, and to word them as definitions, not Legality
+ Rules;.
22.l/3
- {AI05-0192-1AI05-0192-1} Correction: Added wording to explain
- how No_Task_Allocators and No_Protected_Type_Allocators are
- checked for class-wide types. This might be an extension if
- the compiler assumed the worst in the past (it is now a
- runtime check).
+ {<AI05-0192-1AI05-0192-1>} Correction: Added wording to
+ explain how No_Task_Allocators and
+ No_Protected_Type_Allocators are checked for class-wide types.
+ This might be an extension if the compiler assumed the worst
+ in the past (it is now a runtime check).
_Extensions to Ada 2012_
22.m/4
- {AI12-0055-1AI12-0055-1} Corrigendum: Restriction
+ {<AI12-0055-1AI12-0055-1>} Corrigendum: Restriction
No_Dynamic_CPU_Assignment is newly added to Ada, for use as
part of the Ravenscar profile (see *note D.13::).
22.n/4
- {AI12-0117-1AI12-0117-1} Corrigendum: Restriction
+ {<AI12-0117-1AI12-0117-1>} Corrigendum: Restriction
No_Tasks_Unassigned_To_CPU is newly added to Ada; it ensures
that no task is running on an implementation-defined CPU so
that task scheduling can be analyzed.
@@ -106422,7 +106796,7 @@ D.8 Monotonic Time
==================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies a high-resolution,
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies a high-resolution,
monotonic clock package.]
_Static Semantics_
@@ -106437,7 +106811,7 @@ The following language-defined library package exists:
type Time is private;
Time_First : constant Time;
Time_Last : constant Time;
- Time_Unit : constant := implementation-defined-real-number;
+ Time_Unit : constant := <implementation-defined-real-number>;
5
type Time_Span is private;
@@ -106475,7 +106849,7 @@ The following language-defined library package exists:
function "abs"(Right : Time_Span) return Time_Span;
11/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
12
function "<" (Left, Right : Time_Span) return Boolean;
@@ -106488,14 +106862,14 @@ The following language-defined library package
exists:
function To_Time_Span (D : Duration) return Time_Span;
14/2
- {AI95-00386-01AI95-00386-01} function Nanoseconds (NS : Integer)
return Time_Span;
+ {<AI95-00386-01AI95-00386-01>} function Nanoseconds (NS : Integer)
return Time_Span;
function Microseconds (US : Integer) return Time_Span;
function Milliseconds (MS : Integer) return Time_Span;
function Seconds (S : Integer) return Time_Span;
function Minutes (M : Integer) return Time_Span;
15
- type Seconds_Count is range implementation-defined;
+ type Seconds_Count is range <implementation-defined>;
16
procedure Split(T : in Time; SC : out Seconds_Count; TS : out
Time_Span);
@@ -106503,16 +106877,16 @@ The following language-defined library package
exists:
17
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Real_Time;
17.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
18
-In this Annex, real time is defined to be the physical time as observed
-in the external environment. The type Time is a time type as defined by
-*note 9.6::; [values of this type may be used in a
+In this Annex, <real time> is defined to be the physical time as
+observed in the external environment. The type Time is a <time type> as
+defined by *note 9.6::; [values of this type may be used in a
delay_until_statement.] Values of this type represent segments of an
ideal time line. The set of values of the type Time corresponds
one-to-one with an implementation-defined range of mathematical
@@ -106536,8 +106910,8 @@ integers.
The Time value I represents the half-open real time interval that starts
with E+I*Time_Unit and is limited by E+(I+1)*Time_Unit, where Time_Unit
is an implementation-defined real number and E is an unspecified origin
-point, the epoch, that is the same for all values of the type Time. It
-is not specified by the language whether the time values are
+point, the <epoch>, that is the same for all values of the type Time.
+It is not specified by the language whether the time values are
synchronized with any standard time reference. [For example, E can
correspond to the time of system initialization or it can correspond to
the epoch of some time standard.]
@@ -106584,32 +106958,33 @@ Time_Unit is the smallest amount of real time
representable by the Time
type; it is expressed in seconds. Time_Span_Unit is the difference
between two successive values of the Time type. It is also the smallest
positive value of type Time_Span. Time_Unit and Time_Span_Unit
-represent the same real time duration. A clock tick is a real time
+represent the same real time duration. A <clock tick> is a real time
interval during which the clock value (as observed by calling the Clock
function) remains constant. Tick is the average length of such
intervals.
24/2
-{AI95-00432-01AI95-00432-01} The function To_Duration converts the value
-TS to a value of type Duration. Similarly, the function To_Time_Span
-converts the value D to a value of type Time_Span. For To_Duration, the
-result is rounded to the nearest value of type Duration (away from zero
-if exactly halfway between two values). If the result is outside the
-range of Duration, Constraint_Error is raised. For To_Time_Span, the
-value of D is first rounded to the nearest integral multiple of
-Time_Unit, away from zero if exactly halfway between two multiples. If
-the rounded value is outside the range of Time_Span, Constraint_Error is
-raised. Otherwise, the value is converted to the type Time_Span.
+{<AI95-00432-01AI95-00432-01>} The function To_Duration converts the
+value TS to a value of type Duration. Similarly, the function
+To_Time_Span converts the value D to a value of type Time_Span. For
+To_Duration, the result is rounded to the nearest value of type Duration
+(away from zero if exactly halfway between two values). If the result
+is outside the range of Duration, Constraint_Error is raised. For
+To_Time_Span, the value of D is first rounded to the nearest integral
+multiple of Time_Unit, away from zero if exactly halfway between two
+multiples. If the rounded value is outside the range of Time_Span,
+Constraint_Error is raised. Otherwise, the value is converted to the
+type Time_Span.
25
To_Duration(Time_Span_Zero) returns 0.0, and To_Time_Span(0.0) returns
Time_Span_Zero.
26/2
-{AI95-00386-01AI95-00386-01} {AI95-00432-01AI95-00432-01} The functions
-Nanoseconds, Microseconds, Milliseconds, Seconds, and Minutes convert
-the input parameter to a value of the type Time_Span. NS, US, MS, S,
-and M are interpreted as a number of nanoseconds, microseconds,
+{<AI95-00386-01AI95-00386-01>} {<AI95-00432-01AI95-00432-01>} The
+functions Nanoseconds, Microseconds, Milliseconds, Seconds, and Minutes
+convert the input parameter to a value of the type Time_Span. NS, US,
+MS, S, and M are interpreted as a number of nanoseconds, microseconds,
milliseconds, seconds, and minutes respectively. The input parameter is
first converted to seconds and rounded to the nearest integral multiple
of Time_Unit, away from zero if exactly halfway between two multiples.
@@ -106618,7 +106993,7 @@ is raised. Otherwise, the rounded value is converted
to the type
Time_Span.
26.a/2
- This paragraph was deleted.{AI95-00432-01AI95-00432-01}
+ <This paragraph was deleted.>{<AI95-00432-01AI95-00432-01>}
27
The effects of the operators on Time and Time_Span are as for the
@@ -106662,9 +107037,9 @@ Time_Span_Last shall be no less than 3600 seconds.
room for a two-microsecond resolution.
32
-A clock jump is the difference between two successive distinct values of
-the clock (as observed by calling the Clock function). There shall be
-no backward clock jumps.
+A <clock jump> is the difference between two successive distinct values
+of the clock (as observed by calling the Clock function). There shall
+be no backward clock jumps.
_Documentation Requirements_
@@ -106704,7 +107079,7 @@ frequency of synchronization, and the synchronization
method applied.
Real_Time with external time references.
36/3
-{AI05-0299-1AI05-0299-1} The implementation shall document any aspects
+{<AI05-0299-1AI05-0299-1>} The implementation shall document any aspects
of the external environment that could interfere with the clock behavior
as defined in this subclause.
@@ -106722,8 +107097,8 @@ as defined in this subclause.
_Metrics_
37/3
-{AI05-0299-1AI05-0299-1} For the purpose of the metrics defined in this
-subclause, real time is defined to be the International Atomic Time
+{<AI05-0299-1AI05-0299-1>} For the purpose of the metrics defined in
+this subclause, real time is defined to be the International Atomic Time
(TAI).
38
@@ -106738,7 +107113,7 @@ The implementation shall document the following
metrics:
* An upper bound on the size of a clock jump.
41
- * An upper bound on the drift rate of Clock with respect to real
+ * An upper bound on the <drift rate> of Clock with respect to real
time. This is a real number D such that
42
@@ -106841,7 +107216,7 @@ may mean highest accuracy or largest range.
NOTES
50/3
- 35 {AI05-0299-1AI05-0299-1} The rules in this subclause do not
+ 35 {<AI05-0299-1AI05-0299-1>} The rules in this subclause do not
imply that the implementation can protect the user from operator or
installation errors which could result in the clock being set
incorrectly.
@@ -106854,19 +107229,19 @@ may mean highest accuracy or largest range.
_Incompatibilities With Ada 95_
51.a/3
- {AI95-00386-01AI95-00386-01} {AI05-0005-1AI05-0005-1}
+ {<AI95-00386-01AI95-00386-01>} {<AI05-0005-1AI05-0005-1>}
Functions Seconds and Minutes are added to Real_Time. If
- Real_Time is referenced in a use_clause, and an entity E with
- a defining_identifier of Seconds or Minutes is defined in a
- package that is also referenced in a use_clause, the entity E
- may no longer be use-visible, resulting in errors. This
+ Real_Time is referenced in a use_clause, and an entity <E>
+ with a defining_identifier of Seconds or Minutes is defined in
+ a package that is also referenced in a use_clause, the entity
+ <E> may no longer be use-visible, resulting in errors. This
should be rare and is easily fixed if it does occur.
_Wording Changes from Ada 95_
51.b/2
- {AI95-00432-01AI95-00432-01} Added wording explaining how and
- when many of these functions can raise Constraint_Error.
+ {<AI95-00432-01AI95-00432-01>} Added wording explaining how
+ and when many of these functions can raise Constraint_Error.
While there always was an intent to raise Constraint_Error if
the values did not fit, there never was any wording to that
effect, and since Time_Span was a private type, the normal
@@ -106879,7 +107254,7 @@ D.9 Delay Accuracy
==================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause specifies performance
+{<AI05-0299-1AI05-0299-1>} [This subclause specifies performance
requirements for the delay_statement. The rules apply both to
delay_relative_statement (*note 9.6: S0229.) and to
delay_until_statement (*note 9.6: S0228.). Similarly, they apply
@@ -106909,7 +107284,7 @@ expiration time does not cause the calling task to be
blocked; it is
nevertheless a potentially blocking operation (see *note 9.5.1::).
6/3
-{AI05-0004-1AI05-0004-1} When a delay_statement appears in a
+{<AI05-0004-1AI05-0004-1>} When a delay_statement appears in a
delay_alternative of a timed_entry_call the selection of the entry call
is attempted, regardless of the specified expiration time. When a
delay_statement appears in a select_alternative, and a call is queued on
@@ -106941,7 +107316,7 @@ value of the delay expression of a
delay_until_statement and the value
of Real_Time.Clock, that causes the task to actually be blocked.
8.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
8.b/2
Documentation Requirement: The minimum difference between the
@@ -106967,13 +107342,13 @@ The implementation shall document the following
metrics:
Calendar.Clock.
12
- * An upper bound on the lateness of a delay_relative_statement, for a
- positive value of the delay expression, in a situation where the
+ * An upper bound on the <lateness> of a delay_relative_statement, for
+ a positive value of the delay expression, in a situation where the
task has sufficient priority to preempt the processor as soon as it
becomes ready, and does not need to wait for any other execution
resources. The upper bound is expressed as a function of the value
of the delay expression. The lateness is obtained by subtracting
- the value of the delay expression from the actual duration. The
+ the value of the delay expression from the <actual duration>. The
actual duration is measured from a point immediately before a task
executes the delay_statement to a point immediately after the task
resumes execution following this statement.
@@ -107004,7 +107379,7 @@ The implementation shall document the following
metrics:
_Wording Changes from Ada 95_
14.b/2
- {AI95-00355-01AI95-00355-01} The note about "voluntary
+ {<AI95-00355-01AI95-00355-01>} The note about "voluntary
round-robin', while still true, has been deleted as
potentially confusing as it is describing a different kind of
round-robin than is defined by the round-robin dispatching
@@ -107017,9 +107392,9 @@ D.10 Synchronous Task Control
=============================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause describes a language-defined
-private semaphore (suspension object), which can be used for two-stage
-suspend operations and as a simple building block for implementing
+{<AI05-0299-1AI05-0299-1>} [This subclause describes a language-defined
+private semaphore (suspension object), which can be used for <two-stage
+suspend> operations and as a simple building block for implementing
higher-level queues.]
_Static Semantics_
@@ -107028,7 +107403,7 @@ higher-level queues.]
The following language-defined package exists:
3/2
- {AI95-00362-01AI95-00362-01} package Ada.Synchronous_Task_Control is
+ {<AI95-00362-01AI95-00362-01>} package Ada.Synchronous_Task_Control is
pragma Preelaborate(Synchronous_Task_Control);
4
@@ -107038,22 +107413,23 @@ The following language-defined package exists:
function Current_State(S : Suspension_Object) return Boolean;
procedure Suspend_Until_True(S : in out Suspension_Object);
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Synchronous_Task_Control;
5
The type Suspension_Object is a by-reference type.
5.a/2
- Implementation Note: {AI95-00318-02AI95-00318-02} The
+ Implementation Note: {<AI95-00318-02AI95-00318-02>} The
implementation can ensure this by, for example, making the
full view an explicitly limited record type.
5.1/3
-{AI05-0168-1AI05-0168-1} The following language-defined package exists:
+{<AI05-0168-1AI05-0168-1>} The following language-defined package
+exists:
5.2/3
- {AI05-0168-1AI05-0168-1} package Ada.Synchronous_Task_Control.EDF is
+ {<AI05-0168-1AI05-0168-1>} package Ada.Synchronous_Task_Control.EDF is
procedure Suspend_Until_True_And_Set_Deadline
(S : in out Suspension_Object;
TS : in Ada.Real_Time.Time_Span);
@@ -107062,9 +107438,9 @@ The type Suspension_Object is a by-reference type.
_Dynamic Semantics_
6/2
-{AI95-00114-01AI95-00114-01} An object of the type Suspension_Object has
-two visible states: True and False. Upon initialization, its value is
-set to False.
+{<AI95-00114-01AI95-00114-01>} An object of the type Suspension_Object
+has two visible states: True and False. Upon initialization, its value
+is set to False.
6.a
Discussion: This object is assumed to be private to the
@@ -107074,7 +107450,7 @@ set to False.
state of this object.
7/2
-{AI95-00114-01AI95-00114-01} The operations Set_True and Set_False are
+{<AI95-00114-01AI95-00114-01>} The operations Set_True and Set_False are
atomic with respect to each other and with respect to
Suspend_Until_True; they set the state to True and False respectively.
@@ -107086,9 +107462,9 @@ Current_State returns the current state of the object.
operation returns.
9/2
-{AI95-00114-01AI95-00114-01} The procedure Suspend_Until_True blocks the
-calling task until the state of the object S is True; at that point the
-task becomes ready and the state of the object becomes False.
+{<AI95-00114-01AI95-00114-01>} The procedure Suspend_Until_True blocks
+the calling task until the state of the object S is True; at that point
+the task becomes ready and the state of the object becomes False.
10
Program_Error is raised upon calling Suspend_Until_True if another task
@@ -107096,7 +107472,7 @@ is already waiting on that suspension object.
Suspend_Until_True is a
potentially blocking operation (see *note 9.5.1::).
10.1/3
-{AI05-0168-1AI05-0168-1} {AI05-0269-1AI05-0269-1} The procedure
+{<AI05-0168-1AI05-0168-1>} {<AI05-0269-1AI05-0269-1>} The procedure
Suspend_Until_True_And_Set_Deadline blocks the calling task until the
state of the object S is True; at that point the task becomes ready with
a deadline of Ada.Real_Time.Clock + TS, and the state of the object
@@ -107115,20 +107491,20 @@ priority in the Interrupt_Priority range.
NOTES
12/3
- 37 {AI05-0168-1AI05-0168-1} More complex schemes, such as setting
- the deadline relative to when Set_True is called, can be programmed
- using a protected object.
+ 37 {<AI05-0168-1AI05-0168-1>} More complex schemes, such as
+ setting the deadline relative to when Set_True is called, can be
+ programmed using a protected object.
_Extensions to Ada 95_
12.a/2
- {AI95-00362-01AI95-00362-01} Synchronous_Task_Control is now
+ {<AI95-00362-01AI95-00362-01>} Synchronous_Task_Control is now
Preelaborated, so it can be used in preelaborated units.
_Extensions to Ada 2005_
12.b/3
- {AI05-0168-1AI05-0168-1} Child package
+ {<AI05-0168-1AI05-0168-1>} Child package
Ada.Synchronous_Task_Control.EDF is new.
* Menu:
@@ -107142,7 +107518,7 @@ D.10.1 Synchronous Barriers
---------------------------
1/3
-{AI05-0174-1AI05-0174-1} {AI05-0299-1AI05-0299-1} This subclause
+{<AI05-0174-1AI05-0174-1>} {<AI05-0299-1AI05-0299-1>} This subclause
introduces a language-defined package to synchronously release a group
of tasks after the number of blocked tasks reaches a specified count
value.
@@ -107150,15 +107526,15 @@ value.
_Static Semantics_
2/3
-{AI05-0174-1AI05-0174-1} The following language-defined library package
-exists:
+{<AI05-0174-1AI05-0174-1>} The following language-defined library
+package exists:
3/3
package Ada.Synchronous_Barriers is
pragma Preelaborate(Synchronous_Barriers);
4/3
- subtype Barrier_Limit is Positive range 1 .. implementation-defined;
+ subtype Barrier_Limit is Positive range 1 .. <implementation-defined>;
4.a.1/3
Implementation defined: The value of Barrier_Limit'Last in
@@ -107173,38 +107549,38 @@ exists:
7/3
private
- -- not specified by the language
+ -- <not specified by the language>
end Ada.Synchronous_Barriers;
8/3
-{AI05-0174-1AI05-0174-1} Type Synchronous_Barrier needs finalization
+{<AI05-0174-1AI05-0174-1>} Type Synchronous_Barrier needs finalization
(see *note 7.6::).
_Dynamic Semantics_
9/3
-{AI05-0174-1AI05-0174-1} Each call to Wait_For_Release blocks the
+{<AI05-0174-1AI05-0174-1>} Each call to Wait_For_Release blocks the
calling task until the number of blocked tasks associated with the
Synchronous_Barrier object is equal to Release_Threshold, at which time
all blocked tasks are released. Notified is set to True for one of the
released tasks, and set to False for all other released tasks.
10/3
-{AI05-0174-1AI05-0174-1} The mechanism for determining which task sets
+{<AI05-0174-1AI05-0174-1>} The mechanism for determining which task sets
Notified to True is implementation defined.
11/3
-{AI05-0174-1AI05-0174-1} Once all tasks have been released, a
+{<AI05-0174-1AI05-0174-1>} Once all tasks have been released, a
Synchronous_Barrier object may be reused to block another
Release_Threshold number of tasks.
12/3
-{AI05-0174-1AI05-0174-1} As the first step of the finalization of a
+{<AI05-0174-1AI05-0174-1>} As the first step of the finalization of a
Synchronous_Barrier, each blocked task is unblocked and Program_Error is
raised at the place of the call to Wait_For_Release.
13/3
-{AI05-0174-1AI05-0174-1} It is implementation defined whether an
+{<AI05-0174-1AI05-0174-1>} It is implementation defined whether an
abnormal task which is waiting on a Synchronous_Barrier object is
aborted immediately or aborted when the tasks waiting on the object are
released.
@@ -107214,22 +107590,23 @@ released.
on a Synchronous_Barrier is aborted.
14/3
-{AI05-0174-1AI05-0174-1} Wait_For_Release is a potentially blocking
+{<AI05-0174-1AI05-0174-1>} Wait_For_Release is a potentially blocking
operation (see *note 9.5.1::).
_Bounded (Run-Time) Errors_
15/3
-{AI05-0174-1AI05-0174-1} It is a bounded error to call Wait_For_Release
-on a Synchronous_Barrier object after that object is finalized. If the
-error is detected, Program_Error is raised. Otherwise, the call
-proceeds normally, which may leave a task blocked forever.
+{<AI05-0174-1AI05-0174-1>} It is a bounded error to call
+Wait_For_Release on a Synchronous_Barrier object after that object is
+finalized. If the error is detected, Program_Error is raised.
+Otherwise, the call proceeds normally, which may leave a task blocked
+forever.
_Extensions to Ada 2005_
15.a/3
- {AI05-0174-1AI05-0174-1} The package Ada.Synchronous_Barriers
- is new.
+ {<AI05-0174-1AI05-0174-1>} The package
+ Ada.Synchronous_Barriers is new.
File: aarm2012.info, Node: D.11, Next: D.12, Prev: D.10, Up: Annex D
@@ -107238,9 +107615,9 @@ D.11 Asynchronous Task Control
==============================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause introduces a language-defined
+{<AI05-0299-1AI05-0299-1>} [This subclause introduces a language-defined
package to do asynchronous suspend/resume on tasks. It uses a
-conceptual held priority value to represent the task's held state.]
+conceptual <held priority> value to represent the task's <held> state.]
_Static Semantics_
@@ -107248,7 +107625,7 @@ conceptual held priority value to represent the
task's held state.]
The following language-defined library package exists:
3/2
- {AI95-00362-01AI95-00362-01} with Ada.Task_Identification;
+ {<AI95-00362-01AI95-00362-01>} with Ada.Task_Identification;
package Ada.Asynchronous_Task_Control is
pragma Preelaborate(Asynchronous_Task_Control);
procedure Hold(T : in Ada.Task_Identification.Task_Id);
@@ -107260,10 +107637,10 @@ The following language-defined library package
exists:
_Dynamic Semantics_
4/2
-{AI95-00357-01AI95-00357-01} After the Hold operation has been applied
-to a task, the task becomes held. For each processor there is a
-conceptual idle task, which is always ready. The base priority of the
-idle task is below System.Any_Priority'First. The held priority is a
+{<AI95-00357-01AI95-00357-01>} After the Hold operation has been applied
+to a task, the task becomes <held>. For each processor there is a
+conceptual <idle task>, which is always ready. The base priority of the
+idle task is below System.Any_Priority'First. The <held priority> is a
constant of the type Integer whose value is below the base priority of
the idle task.
@@ -107273,7 +107650,7 @@ the idle task.
ready.
4.1/2
-{AI95-00357-01AI95-00357-01} For any priority below
+{<AI95-00357-01AI95-00357-01>} For any priority below
System.Any_Priority'First, the task dispatching policy is
FIFO_Within_Priorities.
@@ -107288,7 +107665,7 @@ FIFO_Within_Priorities.
that have only one policy (such as EDF_Across_Priorities).
5/2
-{AI95-00357-01AI95-00357-01} The Hold operation sets the state of T to
+{<AI95-00357-01AI95-00357-01>} The Hold operation sets the state of T to
held. For a held task, the active priority is reevaluated as if the
base priority of the task were the held priority.
@@ -107299,9 +107676,9 @@ base priority of the task were the held priority.
continues to execute until it leaves the protected action.
6/2
-{AI95-00357-01AI95-00357-01} The Continue operation resets the state of
-T to not-held; its active priority is then reevaluated as determined by
-the task dispatching policy associated with its base priority.
+{<AI95-00357-01AI95-00357-01>} The Continue operation resets the state
+of T to not-held; its active priority is then reevaluated as determined
+by the task dispatching policy associated with its base priority.
7
The Is_Held function returns True if and only if T is in the held state.
@@ -107312,7 +107689,7 @@ The Is_Held function returns True if and only if T is
in the held state.
8
As part of these operations, a check is made that the task identified by
-T is not terminated. Tasking_Error is raised if the check fails.
+T is not terminated. Tasking_Error is raised if the check fails.
Program_Error is raised if the value of T is Null_Task_Id.
_Erroneous Execution_
@@ -107377,14 +107754,14 @@ infeasible to support it in the target environment.
task is not affected.
18/1
- * {8652/00778652/0077} {AI95-00111-01AI95-00111-01} If a task
- becomes held while waiting in a selective_accept, and an entry
- call is issued to one of the open entries, the corresponding
- accept_alternative (*note 9.7.1: S0234.) executes. When the
- rendezvous completes, the active priority of the accepting
- task is lowered to the held priority (unless it is still
- inheriting from other sources), and the task does not execute
- until another Continue.
+ * {<8652/00778652/0077>} {<AI95-00111-01AI95-00111-01>} If a
+ task becomes held while waiting in a selective_accept, and an
+ entry call is issued to one of the open entries, the
+ corresponding accept_alternative (*note 9.7.1: S0234.)
+ executes. When the rendezvous completes, the active priority
+ of the accepting task is lowered to the held priority (unless
+ it is still inheriting from other sources), and the task does
+ not execute until another Continue.
19
* The same holds if the held task is the only task on a
@@ -107394,22 +107771,23 @@ infeasible to support it in the target environment.
_Extensions to Ada 95_
19.a/2
- {AI95-00362-01AI95-00362-01} Asynchronous_Task_Control is now
- Preelaborated, so it can be used in preelaborated units.
+ {<AI95-00362-01AI95-00362-01>} Asynchronous_Task_Control is
+ now Preelaborated, so it can be used in preelaborated units.
_Wording Changes from Ada 95_
19.b/2
- {8652/00778652/0077} {AI95-00111-01AI95-00111-01} Corrigendum:
- Corrected to eliminate the use of the undefined term "accept
- body".
+ {<8652/00778652/0077>} {<AI95-00111-01AI95-00111-01>}
+ Corrigendum: Corrected to eliminate the use of the undefined
+ term "accept body".
19.c/2
- {AI95-00357-01AI95-00357-01} The description of held tasks was
- changed to reflect that the calculation of active priorities
- depends on the dispatching policy of the base priority. Thus,
- the policy of the held priority was specified in order to
- avoid surprises (especially when using the EDF policy).
+ {<AI95-00357-01AI95-00357-01>} The description of held tasks
+ was changed to reflect that the calculation of active
+ priorities depends on the dispatching policy of the base
+ priority. Thus, the policy of the held priority was specified
+ in order to avoid surprises (especially when using the EDF
+ policy).
File: aarm2012.info, Node: D.12, Next: D.13, Prev: D.11, Up: Annex D
@@ -107418,8 +107796,9 @@ D.12 Other Optimizations and Determinism Rules
==============================================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause describes various requirements
-for improving the response and determinism in a real-time system.]
+{<AI05-0299-1AI05-0299-1>} [This subclause describes various
+requirements for improving the response and determinism in a real-time
+system.]
_Implementation Requirements_
@@ -107460,7 +107839,7 @@ for different interrupts or interrupt priority
levels, it should be
documented for each case.
5.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
5.b/2
Documentation Requirement: The upper bound on the duration of
@@ -107525,28 +107904,29 @@ D.13 The Ravenscar Profile
==========================
1/3
-{AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1}
-{AI05-0299-1AI05-0299-1} [This subclause defines the Ravenscar profile.]
+{<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>}
+{<AI05-0299-1AI05-0299-1>} [This subclause defines the Ravenscar
+profile.]
-Paragraphs 2 and 3 were moved to *note 13.12::, "*note 13.12:: Pragma
-Restrictions and Pragma Profile".
+<Paragraphs 2 and 3 were moved to *note 13.12::, "*note 13.12:: Pragma
+Restrictions and Pragma Profile".>
_Legality Rules_
4/3
-{AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The
-profile_identifier Ravenscar is a usage profile (see *note 13.12::).
+{<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The
+<profile_>identifier Ravenscar is a usage profile (see *note 13.12::).
For usage profile Ravenscar, there shall be no
-profile_pragma_argument_association (*note 2.8: S0020.)s.
+<profile_>pragma_argument_association (*note 2.8: S0020.)s.
_Static Semantics_
5/3
-{AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The usage profile
-Ravenscar is equivalent to the following set of pragmas:
+{<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The usage
+profile Ravenscar is equivalent to the following set of pragmas:
6/4
- {AI95-00249-01AI95-00249-01} {AI95-00297-01AI95-00297-01}
{AI95-00394-01AI95-00394-01} {AI05-0171-1AI05-0171-1} {AI05-0246-1AI05-0246-1}
{AI12-0055-1AI12-0055-1} {AI12-0073-1AI12-0073-1} pragma
Task_Dispatching_Policy (FIFO_Within_Priorities);
+ {<AI95-00249-01AI95-00249-01>} {<AI95-00297-01AI95-00297-01>}
{<AI95-00394-01AI95-00394-01>} {<AI05-0171-1AI05-0171-1>}
{<AI05-0246-1AI05-0246-1>} {<AI12-0055-1AI12-0055-1>}
{<AI12-0073-1AI12-0073-1>} pragma Task_Dispatching_Policy
(FIFO_Within_Priorities);
pragma Locking_Policy (Ceiling_Locking);
pragma Detect_Blocking;
pragma Restrictions (
@@ -107583,18 +107963,18 @@ Ravenscar is equivalent to the following set of
pragmas:
in widespread use, so we stick with existing practice, rather
than using a more descriptive name.
-Paragraph 7 was deleted.
+<Paragraph 7 was deleted.>
_Implementation Requirements_
8/4
-This paragraph was deleted.{AI05-0171-1AI05-0171-1}
-{AI05-0229-1AI05-0229-1} {AI12-0055-1AI12-0055-1}
+<This paragraph was deleted.>{<AI05-0171-1AI05-0171-1>}
+{<AI05-0229-1AI05-0229-1>} {<AI12-0055-1AI12-0055-1>}
_Implementation Advice_
9/3
-{AI05-0171-1AI05-0171-1} On a multiprocessor system, an implementation
+{<AI05-0171-1AI05-0171-1>} On a multiprocessor system, an implementation
should support a fully partitioned approach. Each processor should have
separate and disjoint ready queues.
@@ -107605,13 +107985,13 @@ separate and disjoint ready queues.
NOTES
10/3
- 42 {AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The
+ 42 {<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The
effect of the Max_Entry_Queue_Length => 1 restriction applies only
to protected entry queues due to the accompanying restriction of
Max_Task_Entries => 0.
11/4
- 43 {AI12-0055-1AI12-0055-1} When the Ravenscar profile is in
+ 43 {<AI12-0055-1AI12-0055-1>} When the Ravenscar profile is in
effect (via the effect of the No_Dynamic_CPU_Assignment
restriction), all of the tasks in the partition will execute on a
single CPU unless the programmer explicitly uses aspect CPU to
@@ -107620,7 +108000,7 @@ separate and disjoint ready queues.
longer apply.
12/4
- 44 {AI12-0055-1AI12-0055-1} It is not recommended to specify the
+ 44 {<AI12-0055-1AI12-0055-1>} It is not recommended to specify the
CPU of a task to be Not_A_Specific_CPU when the Ravenscar profile
is in effect. How a partition executes strongly depends on the
assignment of tasks to CPUs.
@@ -107628,28 +108008,28 @@ separate and disjoint ready queues.
_Extensions to Ada 95_
12.a/3
- {AI95-00249-01AI95-00249-01} {AI05-0246-1AI05-0246-1} The
+ {<AI95-00249-01AI95-00249-01>} {<AI05-0246-1AI05-0246-1>} The
Ravenscar profile is new; it was moved here by Ada 2012.
_Wording Changes from Ada 2005_
12.b/3
- {AI05-0171-1AI05-0171-1} How Ravenscar behaves on a
+ {<AI05-0171-1AI05-0171-1>} How Ravenscar behaves on a
multiprocessor system is now defined.
_Incompatibilities With Ada 2012_
12.c/4
- {AI05-0073-1AI05-0073-1} Corrigendum: The Ravenscar profile no
- longer allows the use of package Synchronous_Barriers, as this
- package violates the fundamental Ravenscar requirement that
- each waiting point can only block (and release) a single task.
- This is incompatible with the published Ada 2012 standard, but
- it is unlikely that any existing Ravenscar runtime ever
- usefully supported barriers.
+ {<AI05-0073-1AI05-0073-1>} Corrigendum: The Ravenscar profile
+ no longer allows the use of package Synchronous_Barriers, as
+ this package violates the fundamental Ravenscar requirement
+ that each waiting point can only block (and release) a single
+ task. This is incompatible with the published Ada 2012
+ standard, but it is unlikely that any existing Ravenscar
+ runtime ever usefully supported barriers.
12.d/4
- {AI05-0055-1AI05-0055-1} Corrigendum:The Ravenscar profile
+ {<AI05-0055-1AI05-0055-1>} Corrigendum:The Ravenscar profile
(via the effect of the new restriction
No_Dynamic_CPU_Assignment) no longer allows setting the CPU
aspect of a task to a non-static value. While this was
@@ -107666,13 +108046,13 @@ D.14 Execution Time
===================
1/3
-{AI95-00307-01AI95-00307-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00307-01AI95-00307-01>} {<AI05-0299-1AI05-0299-1>} This subclause
describes a language-defined package to measure execution time.
_Static Semantics_
2/2
-{AI95-00307-01AI95-00307-01} The following language-defined library
+{<AI95-00307-01AI95-00307-01>} The following language-defined library
package exists:
3/2
@@ -107684,7 +108064,7 @@ package exists:
type CPU_Time is private;
CPU_Time_First : constant CPU_Time;
CPU_Time_Last : constant CPU_Time;
- CPU_Time_Unit : constant := implementation-defined-real-number;
+ CPU_Time_Unit : constant := <implementation-defined-real-number>;
CPU_Tick : constant Time_Span;
5/2
@@ -107714,24 +108094,24 @@ package exists:
TS : Time_Span := Time_Span_Zero) return CPU_Time;
9.1/3
- {AI05-0170-1AI05-0170-1} Interrupt_Clocks_Supported : constant Boolean
:= implementation-defined;
+ {<AI05-0170-1AI05-0170-1>} Interrupt_Clocks_Supported : constant
Boolean := <implementation-defined>;
9.2/3
- {AI05-0170-1AI05-0170-1} Separate_Interrupt_Clocks_Supported :
constant Boolean :=
- implementation-defined;
+ {<AI05-0170-1AI05-0170-1>} Separate_Interrupt_Clocks_Supported :
constant Boolean :=
+ <implementation-defined>;
9.3/3
- {AI05-0170-1AI05-0170-1} function Clock_For_Interrupts return CPU_Time;
+ {<AI05-0170-1AI05-0170-1>} function Clock_For_Interrupts return
CPU_Time;
10/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Execution_Time;
11/3
-{AI95-00307-01AI95-00307-01} {AI05-0170-1AI05-0170-1}
-{AI05-0269-1AI05-0269-1} The execution time or CPU time of a given task
-is defined as the time spent by the system executing that task,
+{<AI95-00307-01AI95-00307-01>} {<AI05-0170-1AI05-0170-1>}
+{<AI05-0269-1AI05-0269-1>} The <execution time> or CPU time of a given
+task is defined as the time spent by the system executing that task,
including the time spent executing run-time or system services on its
behalf. The mechanism used to measure execution time is implementation
defined. The Boolean constant Interrupt_Clocks_Supported is set to True
@@ -107750,12 +108130,13 @@ handlers (see *note D.14.3::).
implementation-defined.
12/2
-{AI95-00307-01AI95-00307-01} The type CPU_Time represents the execution
-time of a task. The set of values of this type corresponds one-to-one
-with an implementation-defined range of mathematical integers.
+{<AI95-00307-01AI95-00307-01>} The type CPU_Time represents the
+execution time of a task. The set of values of this type corresponds
+one-to-one with an implementation-defined range of mathematical
+integers.
13/2
-{AI95-00307-01AI95-00307-01} The CPU_Time value I represents the
+{<AI95-00307-01AI95-00307-01>} The CPU_Time value I represents the
half-open execution-time interval that starts with I*CPU_Time_Unit and
is limited by (I+1)*CPU_Time_Unit, where CPU_Time_Unit is an
implementation-defined real number. For each task, the execution time
@@ -107768,34 +108149,34 @@ value is set to zero at the creation of the task.
activation of the task.
14/2
-{AI95-00307-01AI95-00307-01} CPU_Time_First and CPU_Time_Last are the
+{<AI95-00307-01AI95-00307-01>} CPU_Time_First and CPU_Time_Last are the
smallest and largest values of the CPU_Time type, respectively.
14.1/3
-{AI05-0170-1AI05-0170-1} The execution time value for the function
+{<AI05-0170-1AI05-0170-1>} The execution time value for the function
Clock_For_Interrupts is initialized to zero.
_Dynamic Semantics_
15/2
-{AI95-00307-01AI95-00307-01} CPU_Time_Unit is the smallest amount of
+{<AI95-00307-01AI95-00307-01>} CPU_Time_Unit is the smallest amount of
execution time representable by the CPU_Time type; it is expressed in
-seconds. A CPU clock tick is an execution time interval during which
+seconds. A <CPU clock tick> is an execution time interval during which
the clock value (as observed by calling the Clock function) remains
constant. CPU_Tick is the average length of such intervals.
16/2
-{AI95-00307-01AI95-00307-01} The effects of the operators on CPU_Time
+{<AI95-00307-01AI95-00307-01>} The effects of the operators on CPU_Time
and Time_Span are as for the operators defined for integer types.
17/2
-{AI95-00307-01AI95-00307-01} The function Clock returns the current
+{<AI95-00307-01AI95-00307-01>} The function Clock returns the current
execution time of the task identified by T; Tasking_Error is raised if
that task has terminated; Program_Error is raised if the value of T is
Task_Identification.Null_Task_Id.
18/2
-{AI95-00307-01AI95-00307-01} The effects of the Split and Time_Of
+{<AI95-00307-01AI95-00307-01>} The effects of the Split and Time_Of
operations are defined as follows, treating values of type CPU_Time,
Time_Span, and Seconds_Count as mathematical integers. The effect of
Split (T, SC, TS) is to set SC and TS to values such that
@@ -107804,7 +108185,7 @@ T*CPU_Time_Unit = SC*1.0 + TS*CPU_Time_Unit, and 0.0
<= TS*CPU_Time_Unit
T such that T*CPU_Time_Unit=SC*1.0 + TS*CPU_Time_Unit.
18.1/3
-{AI05-0170-1AI05-0170-1} The function Clock_For_Interrupts returns the
+{<AI05-0170-1AI05-0170-1>} The function Clock_For_Interrupts returns the
total cumulative time spent executing within all interrupt handlers.
This time is not allocated to any task execution time clock. If
Interrupt_Clocks_Supported is set to False the function raises
@@ -107813,13 +108194,14 @@ Program_Error.
_Erroneous Execution_
19/2
-{AI95-00307-01AI95-00307-01} For a call of Clock, if the task identified
-by T no longer exists, the execution of the program is erroneous.
+{<AI95-00307-01AI95-00307-01>} For a call of Clock, if the task
+identified by T no longer exists, the execution of the program is
+erroneous.
_Implementation Requirements_
20/2
-{AI95-00307-01AI95-00307-01} The range of CPU_Time values shall be
+{<AI95-00307-01AI95-00307-01>} The range of CPU_Time values shall be
sufficient to uniquely represent the range of execution times from the
task start-up to 50 years of execution time later. CPU_Tick shall be no
greater than 1 millisecond.
@@ -107827,7 +108209,7 @@ greater than 1 millisecond.
_Documentation Requirements_
21/2
-{AI95-00307-01AI95-00307-01} The implementation shall document the
+{<AI95-00307-01AI95-00307-01>} The implementation shall document the
values of CPU_Time_First, CPU_Time_Last, CPU_Time_Unit, and CPU_Tick.
21.a/2
@@ -107836,7 +108218,7 @@ values of CPU_Time_First, CPU_Time_Last,
CPU_Time_Unit, and CPU_Tick.
Execution_Time.
22/2
-{AI95-00307-01AI95-00307-01} The implementation shall document the
+{<AI95-00307-01AI95-00307-01>} The implementation shall document the
properties of the underlying mechanism used to measure execution times,
such as the range of values supported and any relevant aspects of the
underlying hardware or operating system facilities used.
@@ -107849,7 +108231,7 @@ underlying hardware or operating system facilities
used.
_Metrics_
23/2
-{AI95-00307-01AI95-00307-01} The implementation shall document the
+{<AI95-00307-01AI95-00307-01>} The implementation shall document the
following metrics:
24/2
@@ -107878,14 +108260,14 @@ following metrics:
_Implementation Permissions_
28/2
-{AI95-00307-01AI95-00307-01} Implementations targeted to machines with
+{<AI95-00307-01AI95-00307-01>} Implementations targeted to machines with
word size smaller than 32 bits need not support the full range and
granularity of the CPU_Time type.
_Implementation Advice_
29/2
-{AI95-00307-01AI95-00307-01} When appropriate, implementations should
+{<AI95-00307-01AI95-00307-01>} When appropriate, implementations should
provide configuration mechanisms to change the value of CPU_Tick.
29.a/2
@@ -107896,26 +108278,26 @@ provide configuration mechanisms to change the
value of CPU_Tick.
_Extensions to Ada 95_
29.b/2
- {AI95-00307-01AI95-00307-01} The package Execution_Time is
+ {<AI95-00307-01AI95-00307-01>} The package Execution_Time is
new.
_Incompatibilities With Ada 2005_
29.c/3
- {AI05-0170-1AI05-0170-1} Function Clock_For_Interrupts, and
+ {<AI05-0170-1AI05-0170-1>} Function Clock_For_Interrupts, and
constants Interrupt_Clocks_Supported and
Separate_Interrupt_Clocks_Supported are added to
Execution_Time. If Execution_Time is referenced in a
- use_clause, and an entity E with a defining_identifier of one
- of the added entities is defined in a package that is also
- referenced in a use_clause, the entity E may no longer be
+ use_clause, and an entity <E> with a defining_identifier of
+ one of the added entities is defined in a package that is also
+ referenced in a use_clause, the entity <E> may no longer be
use-visible, resulting in errors. This should be rare and is
easily fixed if it does occur.
_Wording Changes from Ada 2005_
29.d/3
- {AI05-0170-1AI05-0170-1} If Interrupt_Clocks_Supported is
+ {<AI05-0170-1AI05-0170-1>} If Interrupt_Clocks_Supported is
True, it is now possible to determine the execution time of
interrupt handlers. This is not an inconsistency, as not
charging any task for such time was a legitimate
@@ -107934,14 +108316,14 @@ D.14.1 Execution Time Timers
----------------------------
1/3
-{AI95-00307-01AI95-00307-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00307-01AI95-00307-01>} {<AI05-0299-1AI05-0299-1>} This subclause
describes a language-defined package that provides a facility for
calling a handler when a task has used a defined amount of CPU time.
_Static Semantics_
2/2
-{AI95-00307-01AI95-00307-01} The following language-defined library
+{<AI95-00307-01AI95-00307-01>} The following language-defined library
package exists:
3/2
@@ -107959,7 +108341,7 @@ package exists:
6/2
Min_Handler_Ceiling : constant System.Any_Priority :=
- implementation-defined;
+ <implementation-defined>;
7/2
procedure Set_Handler (TM : in out Timer;
@@ -107980,24 +108362,24 @@ package exists:
10/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Execution_Time.Timers;
11/2
-{AI95-00307-01AI95-00307-01} The type Timer represents an execution-time
-event for a single task and is capable of detecting execution-time
-overruns. The access discriminant T identifies the task concerned. The
-type Timer needs finalization (see *note 7.6::).
+{<AI95-00307-01AI95-00307-01>} The type Timer represents an
+execution-time event for a single task and is capable of detecting
+execution-time overruns. The access discriminant T identifies the task
+concerned. The type Timer needs finalization (see *note 7.6::).
12/2
-{AI95-00307-01AI95-00307-01} An object of type Timer is said to be set
-if it is associated with a nonnull value of type Timer_Handler and
-cleared otherwise. All Timer objects are initially cleared.
+{<AI95-00307-01AI95-00307-01>} An object of type Timer is said to be
+<set> if it is associated with a nonnull value of type Timer_Handler and
+<cleared> otherwise. All Timer objects are initially cleared.
13/2
-{AI95-00307-01AI95-00307-01} The type Timer_Handler identifies a
+{<AI95-00307-01AI95-00307-01>} The type Timer_Handler identifies a
protected procedure to be executed by the implementation when the timer
-expires. Such a protected procedure is called a handler.
+expires. Such a protected procedure is called a <handler>.
13.a/2
Discussion: Type Timer is tagged. This makes it possible to
@@ -108013,19 +108395,19 @@ expires. Such a protected procedure is called a
handler.
_Dynamic Semantics_
14/2
-{AI95-00307-01AI95-00307-01} When a Timer object is created, or upon the
-first call of a Set_Handler procedure with the timer as parameter, the
-resources required to operate an execution-time timer based on the
+{<AI95-00307-01AI95-00307-01>} When a Timer object is created, or upon
+the first call of a Set_Handler procedure with the timer as parameter,
+the resources required to operate an execution-time timer based on the
associated execution-time clock are allocated and initialized. If this
operation would exceed the available resources, Timer_Resource_Error is
raised.
15/3
-{AI95-00307-01AI95-00307-01} {AI05-0264-1AI05-0264-1} The procedures
+{<AI95-00307-01AI95-00307-01>} {<AI05-0264-1AI05-0264-1>} The procedures
Set_Handler associate the handler Handler with the timer TM: if Handler
is null, the timer is cleared; otherwise, it is set. The first
procedure Set_Handler loads the timer TM with an interval specified by
-the Time_Span parameter. In this mode, the timer TM expires when the
+the Time_Span parameter. In this mode, the timer TM <expires> when the
execution time of the task identified by TM.T.all has increased by
In_Time; if In_Time is less than or equal to zero, the timer expires
immediately. The second procedure Set_Handler loads the timer TM with
@@ -108045,63 +108427,63 @@ Set_Handler is called, the timer expires
immediately.
different task at that point).
16/2
-{AI95-00307-01AI95-00307-01} A call of a procedure Set_Handler for a
+{<AI95-00307-01AI95-00307-01>} A call of a procedure Set_Handler for a
timer that is already set replaces the handler and the (absolute or
relative) execution time; if Handler is not null, the timer remains set.
17/2
-{AI95-00307-01AI95-00307-01} When a timer expires, the associated
+{<AI95-00307-01AI95-00307-01>} When a timer expires, the associated
handler is executed, passing the timer as parameter. The initial action
of the execution of the handler is to clear the event.
18/3
-{AI95-00307-01AI95-00307-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00307-01AI95-00307-01>} {<AI05-0264-1AI05-0264-1>} The function
Current_Handler returns the handler associated with the timer TM if that
timer is set; otherwise, it returns null.
19/3
-{AI95-00307-01AI95-00307-01} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00307-01AI95-00307-01>} {<AI05-0264-1AI05-0264-1>} The procedure
Cancel_Handler clears the timer if it is set. Cancelled is assigned
True if the timer was set prior to it being cleared; otherwise, it is
assigned False.
20/3
-{AI95-00307-01AI95-00307-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00307-01AI95-00307-01>} {<AI05-0264-1AI05-0264-1>} The function
Time_Remaining returns the execution time interval that remains until
the timer TM would expire, if that timer is set; otherwise, it returns
Time_Span_Zero.
21/2
-{AI95-00307-01AI95-00307-01} The constant Min_Handler_Ceiling is the
+{<AI95-00307-01AI95-00307-01>} The constant Min_Handler_Ceiling is the
minimum ceiling priority required for a protected object with a handler
to ensure that no ceiling violation will occur when that handler is
invoked.
22/2
-{AI95-00307-01AI95-00307-01} As part of the finalization of an object of
-type Timer, the timer is cleared.
+{<AI95-00307-01AI95-00307-01>} As part of the finalization of an object
+of type Timer, the timer is cleared.
23/2
-{AI95-00307-01AI95-00307-01} For all the subprograms defined in this
+{<AI95-00307-01AI95-00307-01>} For all the subprograms defined in this
package, Tasking_Error is raised if the task identified by TM.T.all has
terminated, and Program_Error is raised if the value of TM.T.all is
Task_Identification.Null_Task_Id.
24/2
-{AI95-00307-01AI95-00307-01} An exception propagated from a handler
+{<AI95-00307-01AI95-00307-01>} An exception propagated from a handler
invoked as part of the expiration of a timer has no effect.
_Erroneous Execution_
25/2
-{AI95-00307-01AI95-00307-01} For a call of any of the subprograms
+{<AI95-00307-01AI95-00307-01>} For a call of any of the subprograms
defined in this package, if the task identified by TM.T.all no longer
exists, the execution of the program is erroneous.
_Implementation Requirements_
26/2
-{AI95-00307-01AI95-00307-01} For a given Timer object, the
+{<AI95-00307-01AI95-00307-01>} For a given Timer object, the
implementation shall perform the operations declared in this package
atomically with respect to any of these operations on the same Timer
object. The replacement of a handler by a call of Set_Handler shall be
@@ -108116,27 +108498,28 @@ performed atomically with respect to the execution
of the handler.
old event
27/2
-{AI95-00307-01AI95-00307-01} When an object of type Timer is finalized,
-the system resources used by the timer shall be deallocated.
+{<AI95-00307-01AI95-00307-01>} When an object of type Timer is
+finalized, the system resources used by the timer shall be deallocated.
_Implementation Permissions_
28/3
-{AI95-00307-01AI95-00307-01} {AI05-0264-1AI05-0264-1} Implementations
-may limit the number of timers that can be defined for each task. If
-this limit is exceeded, then Timer_Resource_Error is raised.
+{<AI95-00307-01AI95-00307-01>} {<AI05-0264-1AI05-0264-1>}
+Implementations may limit the number of timers that can be defined for
+each task. If this limit is exceeded, then Timer_Resource_Error is
+raised.
NOTES
29/2
- 45 {AI95-00307-01AI95-00307-01} A Timer_Handler can be associated
- with several Timer objects.
+ 45 {<AI95-00307-01AI95-00307-01>} A Timer_Handler can be
+ associated with several Timer objects.
_Extensions to Ada 95_
29.a/2
- {AI95-00307-01AI95-00307-01} The package Execution_Time.Timers
- is new.
+ {<AI95-00307-01AI95-00307-01>} The package
+ Execution_Time.Timers is new.
File: aarm2012.info, Node: D.14.2, Next: D.14.3, Prev: D.14.1, Up: D.14
@@ -108145,23 +108528,23 @@ D.14.2 Group Execution Time Budgets
-----------------------------------
1/3
-{AI95-00354-01AI95-00354-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00354-01AI95-00354-01>} {<AI05-0299-1AI05-0299-1>} This subclause
describes a language-defined package to assign execution time budgets to
groups of tasks.
_Static Semantics_
2/2
-{AI95-00354-01AI95-00354-01} The following language-defined library
+{<AI95-00354-01AI95-00354-01>} The following language-defined library
package exists:
3/3
- {AI05-0169-1AI05-0169-1} with System;
+ {<AI05-0169-1AI05-0169-1>} with System;
with System.Multiprocessors;
package Ada.Execution_Time.Group_Budgets is
4/3
- {AI05-0092-1AI05-0092-1} {AI05-0169-1AI05-0169-1} type Group_Budget(CPU
: System.Multiprocessors.CPU :=
+ {<AI05-0092-1AI05-0092-1>} {<AI05-0169-1AI05-0169-1>} type
Group_Budget(CPU : System.Multiprocessors.CPU :=
System.Multiprocessors.CPU'First)
is tagged limited private;
@@ -108175,7 +108558,7 @@ package exists:
7/2
Min_Handler_Ceiling : constant System.Any_Priority :=
- implementation-defined;
+ <implementation-defined>;
7.a.1/3
Implementation defined: The value of Min_Handler_Ceiling in
@@ -108211,29 +108594,29 @@ package exists:
12/2
private
- -- not specified by the language
+ -- <not specified by the language>
end Ada.Execution_Time.Group_Budgets;
13/2
-{AI95-00354-01AI95-00354-01} The type Group_Budget represents an
+{<AI95-00354-01AI95-00354-01>} The type Group_Budget represents an
execution time budget to be used by a group of tasks. The type
Group_Budget needs finalization (see *note 7.6::). A task can belong to
at most one group. Tasks of any priority can be added to a group.
14/2
-{AI95-00354-01AI95-00354-01} An object of type Group_Budget has an
-associated nonnegative value of type Time_Span known as its budget,
+{<AI95-00354-01AI95-00354-01>} An object of type Group_Budget has an
+associated nonnegative value of type Time_Span known as its <budget>,
which is initially Time_Span_Zero. The type Group_Budget_Handler
identifies a protected procedure to be executed by the implementation
-when the budget is exhausted, that is, reaches zero. Such a protected
-procedure is called a handler.
+when the budget is <exhausted>, that is, reaches zero. Such a protected
+procedure is called a <handler>.
15/2
-{AI95-00354-01AI95-00354-01} An object of type Group_Budget also
+{<AI95-00354-01AI95-00354-01>} An object of type Group_Budget also
includes a handler, which is a value of type Group_Budget_Handler. The
-handler of the object is said to be set if it is not null and cleared
-otherwise. The handler of all Group_Budget objects is initially
-cleared.
+handler of the object is said to be <set> if it is not null and
+<cleared> otherwise. The handler of all Group_Budget objects is
+initially cleared.
15.a/2
Discussion: Type Group_Budget is tagged. This makes it
@@ -108249,43 +108632,44 @@ cleared.
_Dynamic Semantics_
16/2
-{AI95-00354-01AI95-00354-01} The procedure Add_Task adds the task
+{<AI95-00354-01AI95-00354-01>} The procedure Add_Task adds the task
identified by T to the group GB; if that task is already a member of
some other group, Group_Budget_Error is raised.
17/2
-{AI95-00354-01AI95-00354-01} The procedure Remove_Task removes the task
-identified by T from the group GB; if that task is not a member of the
-group GB, Group_Budget_Error is raised. After successful execution of
-this procedure, the task is no longer a member of any group.
+{<AI95-00354-01AI95-00354-01>} The procedure Remove_Task removes the
+task identified by T from the group GB; if that task is not a member of
+the group GB, Group_Budget_Error is raised. After successful execution
+of this procedure, the task is no longer a member of any group.
18/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The function
Is_Member returns True if the task identified by T is a member of the
group GB; otherwise, it returns False.
19/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The function
Is_A_Group_Member returns True if the task identified by T is a member
of some group; otherwise, it returns False.
20/2
-{AI95-00354-01AI95-00354-01} The function Members returns an array of
+{<AI95-00354-01AI95-00354-01>} The function Members returns an array of
values of type Task_Identification.Task_Id identifying the members of
the group GB. The order of the components of the array is unspecified.
21/3
-{AI95-00354-01AI95-00354-01} {AI05-0092-1AI05-0092-1}
-{AI05-0169-1AI05-0169-1} The procedure Replenish loads the group budget
-GB with To as the Time_Span value. The exception Group_Budget_Error is
-raised if the Time_Span value To is nonpositive. Any execution on CPU
-of any member of the group of tasks results in the budget counting down,
-unless exhausted. When the budget becomes exhausted (reaches
-Time_Span_Zero), the associated handler is executed if the handler of
-group budget GB is set. Nevertheless, the tasks continue to execute.
+{<AI95-00354-01AI95-00354-01>} {<AI05-0092-1AI05-0092-1>}
+{<AI05-0169-1AI05-0169-1>} The procedure Replenish loads the group
+budget GB with To as the Time_Span value. The exception
+Group_Budget_Error is raised if the Time_Span value To is nonpositive.
+Any execution on CPU of any member of the group of tasks results in the
+budget counting down, unless exhausted. When the budget becomes
+exhausted (reaches Time_Span_Zero), the associated handler is executed
+if the handler of group budget GB is set. Nevertheless, the tasks
+continue to execute.
22/2
-{AI95-00354-01AI95-00354-01} The procedure Add modifies the budget of
+{<AI95-00354-01AI95-00354-01>} The procedure Add modifies the budget of
the group GB. A positive value for Interval increases the budget. A
negative value for Interval reduces the budget, but never below
Time_Span_Zero. A zero value for Interval has no effect. A call of
@@ -108294,80 +108678,80 @@ Time_Span_Zero causes the associated handler to be
executed if the
handler of the group budget GB is set.
23/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The function
Budget_Has_Expired returns True if the budget of group GB is exhausted
(equal to Time_Span_Zero); otherwise, it returns False.
24/2
-{AI95-00354-01AI95-00354-01} The function Budget_Remaining returns the
+{<AI95-00354-01AI95-00354-01>} The function Budget_Remaining returns the
remaining budget for the group GB. If the budget is exhausted it returns
Time_Span_Zero. This is the minimum value for a budget.
25/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The procedure
Set_Handler associates the handler Handler with the Group_Budget GB: if
Handler is null, the handler of Group_Budget is cleared; otherwise, it
is set.
26/2
-{AI95-00354-01AI95-00354-01} A call of Set_Handler for a Group_Budget
+{<AI95-00354-01AI95-00354-01>} A call of Set_Handler for a Group_Budget
that already has a handler set replaces the handler; if Handler is not
null, the handler for Group_Budget remains set.
27/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The function
Current_Handler returns the handler associated with the group budget GB
if the handler for that group budget is set; otherwise, it returns null.
28/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} The procedure
Cancel_Handler clears the handler for the group budget if it is set.
Cancelled is assigned True if the handler for the group budget was set
prior to it being cleared; otherwise, it is assigned False.
29/2
-{AI95-00354-01AI95-00354-01} The constant Min_Handler_Ceiling is the
+{<AI95-00354-01AI95-00354-01>} The constant Min_Handler_Ceiling is the
minimum ceiling priority required for a protected object with a handler
to ensure that no ceiling violation will occur when that handler is
invoked.
30/2
-{AI95-00354-01AI95-00354-01} The precision of the accounting of task
+{<AI95-00354-01AI95-00354-01>} The precision of the accounting of task
execution time to a Group_Budget is the same as that defined for
execution-time clocks from the parent package.
31/2
-{AI95-00354-01AI95-00354-01} As part of the finalization of an object of
-type Group_Budget all member tasks are removed from the group identified
-by that object.
+{<AI95-00354-01AI95-00354-01>} As part of the finalization of an object
+of type Group_Budget all member tasks are removed from the group
+identified by that object.
32/3
-{AI95-00354-01AI95-00354-01} {AI05-0264-1AI05-0264-1} If a task is a
+{<AI95-00354-01AI95-00354-01>} {<AI05-0264-1AI05-0264-1>} If a task is a
member of a Group_Budget when it terminates, then as part of the
finalization of the task it is removed from the group.
33/2
-{AI95-00354-01AI95-00354-01} For all the operations defined in this
+{<AI95-00354-01AI95-00354-01>} For all the operations defined in this
package, Tasking_Error is raised if the task identified by T has
terminated, and Program_Error is raised if the value of T is
Task_Identification.Null_Task_Id.
34/2
-{AI95-00354-01AI95-00354-01} An exception propagated from a handler
+{<AI95-00354-01AI95-00354-01>} An exception propagated from a handler
invoked when the budget of a group of tasks becomes exhausted has no
effect.
_Erroneous Execution_
35/2
-{AI95-00354-01AI95-00354-01} For a call of any of the subprograms
+{<AI95-00354-01AI95-00354-01>} For a call of any of the subprograms
defined in this package, if the task identified by T no longer exists,
the execution of the program is erroneous.
_Implementation Requirements_
36/2
-{AI95-00354-01AI95-00354-01} For a given Group_Budget object, the
+{<AI95-00354-01AI95-00354-01>} For a given Group_Budget object, the
implementation shall perform the operations declared in this package
atomically with respect to any of these operations on the same
Group_Budget object. The replacement of a handler, by a call of
@@ -108383,32 +108767,32 @@ of the handler.
NOTES
37/2
- 46 {AI95-00354-01AI95-00354-01} Clearing or setting of the handler
- of a group budget does not change the current value of the budget.
- Exhaustion or loading of a budget does not change whether the
- handler of the group budget is set or cleared.
+ 46 {<AI95-00354-01AI95-00354-01>} Clearing or setting of the
+ handler of a group budget does not change the current value of the
+ budget. Exhaustion or loading of a budget does not change whether
+ the handler of the group budget is set or cleared.
38/2
- 47 {AI95-00354-01AI95-00354-01} A Group_Budget_Handler can be
+ 47 {<AI95-00354-01AI95-00354-01>} A Group_Budget_Handler can be
associated with several Group_Budget objects.
_Extensions to Ada 95_
38.a/2
- {AI95-00354-01AI95-00354-01} The package
+ {<AI95-00354-01AI95-00354-01>} The package
Execution_Time.Group_Budgets is new.
_Inconsistencies With Ada 2005_
38.b/3
- {AI05-0169-1AI05-0169-1} A Group_Budget is now defined to work
- on a single processor. If an implementation managed to make
- this package work for programs running on a multiprocessor
- system, and a program depends on that fact, it could fail when
- ported to Ada 2012. We believe it is unlikely that such an
- implementation exists because of the difficulty of signalling
- other processors when the time reaches zero; in any case,
- depending on such an implementation is not portable.
+ {<AI05-0169-1AI05-0169-1>} A Group_Budget is now defined to
+ work on a single processor. If an implementation managed to
+ make this package work for programs running on a
+ multiprocessor system, and a program depends on that fact, it
+ could fail when ported to Ada 2012. We believe it is unlikely
+ that such an implementation exists because of the difficulty
+ of signalling other processors when the time reaches zero; in
+ any case, depending on such an implementation is not portable.
File: aarm2012.info, Node: D.14.3, Prev: D.14.2, Up: D.14
@@ -108417,15 +108801,15 @@ D.14.3 Execution Time of Interrupt Handlers
-------------------------------------------
1/3
-{AI05-0170-1AI05-0170-1} {AI05-0299-1AI05-0299-1} This subclause
+{<AI05-0170-1AI05-0170-1>} {<AI05-0299-1AI05-0299-1>} This subclause
describes a language-defined package to measure the execution time of
interrupt handlers.
_Static Semantics_
2/3
-{AI05-0170-1AI05-0170-1} The following language-defined library package
-exists:
+{<AI05-0170-1AI05-0170-1>} The following language-defined library
+package exists:
3/3
with Ada.Interrupts;
@@ -108437,7 +108821,7 @@ exists:
end Ada.Execution_Time.Interrupts;
4/3
-{AI05-0170-1AI05-0170-1} The execution time or CPU time of a given
+{<AI05-0170-1AI05-0170-1>} The execution time or CPU time of a given
interrupt Interrupt is defined as the time spent by the system executing
interrupt handlers identified by Interrupt, including the time spent
executing run-time or system services on its behalf. The mechanism used
@@ -108451,30 +108835,30 @@ task.
*note D.14::, so we don't repeat that requirement here.
5/3
-{AI05-0170-1AI05-0170-1} For each interrupt, the execution time value is
-initially set to zero.
+{<AI05-0170-1AI05-0170-1>} For each interrupt, the execution time value
+is initially set to zero.
_Dynamic Semantics_
6/3
-{AI05-0170-1AI05-0170-1} The function Clock returns the current
+{<AI05-0170-1AI05-0170-1>} The function Clock returns the current
cumulative execution time of the interrupt identified by Interrupt. If
Separate_Interrupt_Clocks_Supported is set to False the function raises
Program_Error.
7/3
-{AI05-0170-1AI05-0170-1} {AI05-0264-1AI05-0264-1} The function Supported
-returns True if the implementation is monitoring the execution time of
-the interrupt identified by Interrupt; otherwise, it returns False. For
-any Interrupt_Id Interrupt for which Supported(Interrupt) returns False,
-the function Clock(Interrupt) will return a value equal to
-Ada.Execution_Time.Time_Of(0).
+{<AI05-0170-1AI05-0170-1>} {<AI05-0264-1AI05-0264-1>} The function
+Supported returns True if the implementation is monitoring the execution
+time of the interrupt identified by Interrupt; otherwise, it returns
+False. For any Interrupt_Id Interrupt for which Supported(Interrupt)
+returns False, the function Clock(Interrupt) will return a value equal
+to Ada.Execution_Time.Time_Of(0).
_Extensions to Ada 2005_
7.a/3
- {AI05-0170-1AI05-0170-1} The package Execution_Time.Interrupts
- is new.
+ {<AI05-0170-1AI05-0170-1>} The package
+ Execution_Time.Interrupts is new.
File: aarm2012.info, Node: D.15, Next: D.16, Prev: D.14, Up: Annex D
@@ -108483,7 +108867,7 @@ D.15 Timing Events
==================
1/3
-{AI95-00297-01AI95-00297-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00297-01AI95-00297-01>} {<AI05-0299-1AI05-0299-1>} This subclause
describes a language-defined package to allow user-defined protected
procedures to be executed at a specified time without the need for a
task or a delay statement.
@@ -108491,7 +108875,7 @@ task or a delay statement.
_Static Semantics_
2/2
-{AI95-00297-01AI95-00297-01} The following language-defined library
+{<AI95-00297-01AI95-00297-01>} The following language-defined library
package exists:
3/2
@@ -108519,25 +108903,24 @@ package exists:
7/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Real_Time.Timing_Events;
8/2
-{AI95-00297-01AI95-00297-01} The type Timing_Event represents a time in
-the future when an event is to occur. The type Timing_Event needs
+{<AI95-00297-01AI95-00297-01>} The type Timing_Event represents a time
+in the future when an event is to occur. The type Timing_Event needs
finalization (see *note 7.6::).
9/2
-{AI95-00297-01AI95-00297-01} An object of type Timing_Event is said to
-be set if it is associated with a nonnull value of type
-Timing_Event_Handler and cleared otherwise. All Timing_Event objects
-are initially cleared.
+{<AI95-00297-01AI95-00297-01>} An object of type Timing_Event is said to
+be <set> if it is associated with a nonnull value of type
+Timing_Event_Handler and <cleared> otherwise. All Timing_Event objects
+are initially cleared.
10/2
-{AI95-00297-01AI95-00297-01} The type Timing_Event_Handler identifies a
-protected procedure to be executed by the implementation when the timing
-event occurs. Such a protected procedure is called a handler.
-
+{<AI95-00297-01AI95-00297-01>} The type Timing_Event_Handler identifies
+a protected procedure to be executed by the implementation when the
+timing event occurs. Such a protected procedure is called a <handler>.
10.a/2
Discussion: Type Timing_Event is tagged. This makes it
possible to share a handler between several events. In simple
@@ -108579,7 +108962,7 @@ event occurs. Such a protected procedure is called a
handler.
_Dynamic Semantics_
11/3
-{AI95-00297-01AI95-00297-01} {AI05-0264-1AI05-0264-1} The procedures
+{<AI95-00297-01AI95-00297-01>} {<AI05-0264-1AI05-0264-1>} The procedures
Set_Handler associate the handler Handler with the event Event: if
Handler is null, the event is cleared; otherwise, it is set. The first
procedure Set_Handler sets the execution time for the event to be
@@ -108587,16 +108970,16 @@ At_Time. The second procedure Set_Handler sets the
execution time for
the event to be Real_Time.Clock + In_Time.
12/2
-{AI95-00297-01AI95-00297-01} A call of a procedure Set_Handler for an
+{<AI95-00297-01AI95-00297-01>} A call of a procedure Set_Handler for an
event that is already set replaces the handler and the time of
execution; if Handler is not null, the event remains set.
13/2
-{AI95-00297-01AI95-00297-01} As soon as possible after the time set for
-the event, the handler is executed, passing the event as parameter. The
-handler is only executed if the timing event is in the set state at the
-time of execution. The initial action of the execution of the handler
-is to clear the event.
+{<AI95-00297-01AI95-00297-01>} As soon as possible after the time set
+for the event, the handler is executed, passing the event as parameter.
+The handler is only executed if the timing event is in the set state at
+the time of execution. The initial action of the execution of the
+handler is to clear the event.
13.a/2
Reason: The second sentence of this paragraph is because of a
@@ -108606,49 +108989,49 @@ is to clear the event.
parameter) and thus clear the handler.
14/2
-{AI95-00297-01AI95-00297-01} If the Ceiling_Locking policy (see *note
+{<AI95-00297-01AI95-00297-01>} If the Ceiling_Locking policy (see *note
D.3::) is in effect when a procedure Set_Handler is called, a check is
made that the ceiling priority of Handler.all is
Interrupt_Priority'Last. If the check fails, Program_Error is raised.
15/3
-{AI95-00297-01AI95-00297-01} {AI05-0094-1AI05-0094-1}
-{AI05-0264-1AI05-0264-1} If a procedure Set_Handler is called with zero
-or negative In_Time or with At_Time indicating a time in the past, then
-the handler is executed as soon as possible after the completion of the
-call of Set_Handler.
+{<AI95-00297-01AI95-00297-01>} {<AI05-0094-1AI05-0094-1>}
+{<AI05-0264-1AI05-0264-1>} If a procedure Set_Handler is called with
+zero or negative In_Time or with At_Time indicating a time in the past,
+then the handler is executed as soon as possible after the completion of
+the call of Set_Handler.
15.a/3
- Ramification: {AI05-0094-1AI05-0094-1} The handler will still
- be executed. Under no circumstances is a scheduled call of a
- handler lost.
+ Ramification: {<AI05-0094-1AI05-0094-1>} The handler will
+ still be executed. Under no circumstances is a scheduled call
+ of a handler lost.
15.b/3
- Discussion: {AI05-0094-1AI05-0094-1} We say "as soon as
+ Discussion: {<AI05-0094-1AI05-0094-1>} We say "as soon as
possible" so that we do not deadlock if we are executing the
handler when Set_Handler is called. In that case, the current
invocation of the handler must complete before the new handler
can start executing.
16/3
-{AI95-00297-01AI95-00297-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00297-01AI95-00297-01>} {<AI05-0264-1AI05-0264-1>} The function
Current_Handler returns the handler associated with the event Event if
that event is set; otherwise, it returns null.
17/3
-{AI95-00297-01AI95-00297-01} {AI05-0264-1AI05-0264-1} The procedure
+{<AI95-00297-01AI95-00297-01>} {<AI05-0264-1AI05-0264-1>} The procedure
Cancel_Handler clears the event if it is set. Cancelled is assigned
True if the event was set prior to it being cleared; otherwise, it is
assigned False.
18/3
-{AI95-00297-01AI95-00297-01} {AI05-0264-1AI05-0264-1} The function
+{<AI95-00297-01AI95-00297-01>} {<AI05-0264-1AI05-0264-1>} The function
Time_Of_Event returns the time of the event if the event is set;
otherwise, it returns Real_Time.Time_First.
19/2
-{AI95-00297-01AI95-00297-01} As part of the finalization of an object of
-type Timing_Event, the Timing_Event is cleared.
+{<AI95-00297-01AI95-00297-01>} As part of the finalization of an object
+of type Timing_Event, the Timing_Event is cleared.
19.a/2
Implementation Note: This is the only finalization defined by
@@ -108659,17 +109042,17 @@ type Timing_Event, the Timing_Event is cleared.
event from being triggered.
20/2
-{AI95-00297-01AI95-00297-01} If several timing events are set for the
+{<AI95-00297-01AI95-00297-01>} If several timing events are set for the
same time, they are executed in FIFO order of being set.
21/2
-{AI95-00297-01AI95-00297-01} An exception propagated from a handler
+{<AI95-00297-01AI95-00297-01>} An exception propagated from a handler
invoked by a timing event has no effect.
_Implementation Requirements_
22/2
-{AI95-00297-01AI95-00297-01} For a given Timing_Event object, the
+{<AI95-00297-01AI95-00297-01>} For a given Timing_Event object, the
implementation shall perform the operations declared in this package
atomically with respect to any of these operations on the same
Timing_Event object. The replacement of a handler by a call of
@@ -108687,11 +109070,11 @@ of the handler.
_Metrics_
23/2
-{AI95-00297-01AI95-00297-01} The implementation shall document the
+{<AI95-00297-01AI95-00297-01>} The implementation shall document the
following metric:
24/3
- * {AI05-0210-1AI05-0210-1} An upper bound on the lateness of the
+ * {<AI05-0210-1AI05-0210-1>} An upper bound on the lateness of the
execution of a handler. That is, the maximum time between the time
specified for the event and when a handler is actually invoked
assuming no other handler or task is executing during this
@@ -108703,7 +109086,7 @@ following metric:
_Implementation Advice_
25/2
-{AI95-00297-01AI95-00297-01} The protected handler procedure should be
+{<AI95-00297-01AI95-00297-01>} The protected handler procedure should be
executed directly by the real-time clock interrupt mechanism.
25.a/2
@@ -108714,24 +109097,24 @@ executed directly by the real-time clock interrupt
mechanism.
NOTES
26/2
- 48 {AI95-00297-01AI95-00297-01} Since a call of Set_Handler is not
- a potentially blocking operation, it can be called from within a
- handler.
+ 48 {<AI95-00297-01AI95-00297-01>} Since a call of Set_Handler is
+ not a potentially blocking operation, it can be called from within
+ a handler.
27/2
- 49 {AI95-00297-01AI95-00297-01} A Timing_Event_Handler can be
+ 49 {<AI95-00297-01AI95-00297-01>} A Timing_Event_Handler can be
associated with several Timing_Event objects.
_Extensions to Ada 95_
27.a/2
- {AI95-00297-01AI95-00297-01} The package
+ {<AI95-00297-01AI95-00297-01>} The package
Real_Time.Timing_Events is new.
_Wording Changes from Ada 2005_
27.b/3
- {AI05-0094-1AI05-0094-1} Correction: Reworded to eliminate a
+ {<AI05-0094-1AI05-0094-1>} Correction: Reworded to eliminate a
deadlock condition if the event time is in the past and a
handler is currently executing. This is technically an
inconsistency, but only if a program is depending on
@@ -108739,9 +109122,9 @@ executed directly by the real-time clock interrupt
mechanism.
be useful, we have not documented this as an inconsistency.
27.c/3
- {AI05-0210-1AI05-0210-1} Correction: Clarified the metric for
- lateness of a timing event to exclude interference from other
- handlers and tasks. This change might change the
+ {<AI05-0210-1AI05-0210-1>} Correction: Clarified the metric
+ for lateness of a timing event to exclude interference from
+ other handlers and tasks. This change might change the
documentation of an implementation, but not the implementation
itself, so there is no inconsistency.
@@ -108752,21 +109135,21 @@ D.16 Multiprocessor Implementation
==================================
1/3
-{AI05-0171-1AI05-0171-1} {AI05-0299-1AI05-0299-1} This subclause allows
-implementations on multiprocessor platforms to be configured.
+{<AI05-0171-1AI05-0171-1>} {<AI05-0299-1AI05-0299-1>} This subclause
+allows implementations on multiprocessor platforms to be configured.
_Static Semantics_
2/3
-{AI05-0171-1AI05-0171-1} The following language-defined library package
-exists:
+{<AI05-0171-1AI05-0171-1>} The following language-defined library
+package exists:
3/3
package System.Multiprocessors is
pragma Preelaborate(Multiprocessors);
4/3
- type CPU_Range is range 0 .. implementation-defined;
+ type CPU_Range is range 0 .. <implementation-defined>;
Not_A_Specific_CPU : constant CPU_Range := 0;
subtype CPU is CPU_Range range 1 .. CPU_Range'Last;
@@ -108779,12 +109162,12 @@ exists:
end System.Multiprocessors;
6/3
-{AI05-0171-1AI05-0171-1} A call of Number_Of_CPUs returns the number of
-processors available to the program. Within a given partition, each
+{<AI05-0171-1AI05-0171-1>} A call of Number_Of_CPUs returns the number
+of processors available to the program. Within a given partition, each
call on Number_Of_CPUs will return the same value.
7/3
-{AI05-0229-1AI05-0229-1} For a task type (including the anonymous type
+{<AI05-0229-1AI05-0229-1>} For a task type (including the anonymous type
of a single_task_declaration) or subprogram, the following
language-defined representation aspect may be specified:
@@ -108800,29 +109183,29 @@ CPU
_Legality Rules_
9/3
-{AI05-0171-1AI05-0171-1} {AI05-0229-1AI05-0229-1} If the CPU aspect is
-specified for a subprogram, the expression shall be static.
+{<AI05-0171-1AI05-0171-1>} {<AI05-0229-1AI05-0229-1>} If the CPU aspect
+is specified for a subprogram, the expression shall be static.
10/3
-{AI05-0229-1AI05-0229-1} The CPU aspect shall not be specified on a task
-interface type.
+{<AI05-0229-1AI05-0229-1>} The CPU aspect shall not be specified on a
+task interface type.
_Dynamic Semantics_
11/4
-{AI05-0171-1AI05-0171-1} {AI05-0229-1AI05-0229-1}
-{AI12-0081-1AI12-0081-1} The expression specified for the CPU aspect of
-a task type is evaluated each time an object of the task type is created
-(see *note 9.1::). The CPU value is then associated with the task
-object.
+{<AI05-0171-1AI05-0171-1>} {<AI05-0229-1AI05-0229-1>}
+{<AI12-0081-1AI12-0081-1>} The expression specified for the CPU aspect
+of a task type is evaluated each time an object of the task type is
+created (see *note 9.1::). The CPU value is then associated with the
+task object.
12/3
-{AI05-0171-1AI05-0171-1} {AI05-0229-1AI05-0229-1} The CPU aspect has no
-effect if it is specified for a subprogram other than the main
+{<AI05-0171-1AI05-0171-1>} {<AI05-0229-1AI05-0229-1>} The CPU aspect has
+no effect if it is specified for a subprogram other than the main
subprogram; the CPU value is not associated with any task.
13/3
-{AI05-0171-1AI05-0171-1} {AI05-0229-1AI05-0229-1} The CPU value is
+{<AI05-0171-1AI05-0171-1>} {<AI05-0229-1AI05-0229-1>} The CPU value is
associated with the environment task if the CPU aspect is specified for
the main subprogram. If the CPU aspect is not specified for the main
subprogram it is implementation defined on which processor the
@@ -108833,7 +109216,7 @@ environment task executes.
task executes in the absence of a value for the aspect CPU.
14/3
-{AI05-0171-1AI05-0171-1} {AI05-0264-1AI05-0264-1} The CPU value
+{<AI05-0171-1AI05-0171-1>} {<AI05-0264-1AI05-0264-1>} The CPU value
determines the processor on which the task will activate and execute;
the task is said to be assigned to that processor. If the CPU value is
Not_A_Specific_CPU, then the task is not assigned to a processor. A
@@ -108847,13 +109230,13 @@ task is defined to have failed, and it becomes a
completed task (see
_Extensions to Ada 2005_
14.a/3
- {AI05-0171-1AI05-0171-1} {AI05-0229-1AI05-0229-1} The package
- System.Multiprocessors and the CPU aspect are new.
+ {<AI05-0171-1AI05-0171-1>} {<AI05-0229-1AI05-0229-1>} The
+ package System.Multiprocessors and the CPU aspect are new.
_Wording Changes from Ada 2012_
14.b/4
- {AI12-0081-1AI12-0081-1} Corrigendum: Clarified when the CPU
+ {<AI12-0081-1AI12-0081-1>} Corrigendum: Clarified when the CPU
aspect expression is evaluated.
* Menu:
@@ -108867,15 +109250,15 @@ D.16.1 Multiprocessor Dispatching Domains
-----------------------------------------
1/3
-{AI05-0167-1AI05-0167-1} {AI05-0299-1AI05-0299-1} This subclause allows
-implementations on multiprocessor platforms to be partitioned into
-distinct dispatching domains during program startup.
+{<AI05-0167-1AI05-0167-1>} {<AI05-0299-1AI05-0299-1>} This subclause
+allows implementations on multiprocessor platforms to be partitioned
+into distinct dispatching domains during program startup.
_Static Semantics_
2/3
-{AI05-0167-1AI05-0167-1} The following language-defined library package
-exists:
+{<AI05-0167-1AI05-0167-1>} The following language-defined library
+package exists:
3/3
with Ada.Real_Time;
@@ -108892,22 +109275,22 @@ exists:
System_Dispatching_Domain : constant Dispatching_Domain;
7/4
- {AI12-0033-1AI12-0033-1} function Create (First : CPU; Last :
CPU_Range) return Dispatching_Domain;
+ {<AI12-0033-1AI12-0033-1>} function Create (First : CPU; Last :
CPU_Range) return Dispatching_Domain;
8/3
function Get_First_CPU (Domain : Dispatching_Domain) return CPU;
9/4
- {AI12-0033-1AI12-0033-1} function Get_Last_CPU (Domain :
Dispatching_Domain) return CPU_Range;
+ {<AI12-0033-1AI12-0033-1>} function Get_Last_CPU (Domain :
Dispatching_Domain) return CPU_Range;
9.1/4
- {AI12-0033-1AI12-0033-1} type CPU_Set is array(CPU range <>) of
Boolean;
+ {<AI12-0033-1AI12-0033-1>} type CPU_Set is array(CPU range <>) of
Boolean;
9.2/4
- {AI12-0033-1AI12-0033-1} function Create (Set : CPU_Set) return
Dispatching_Domain;
+ {<AI12-0033-1AI12-0033-1>} function Create (Set : CPU_Set) return
Dispatching_Domain;
9.3/4
- {AI12-0033-1AI12-0033-1} function Get_CPU_Set (Domain :
Dispatching_Domain) return CPU_Set;
+ {<AI12-0033-1AI12-0033-1>} function Get_CPU_Set (Domain :
Dispatching_Domain) return CPU_Set;
10/3
function Get_Dispatching_Domain
@@ -108940,20 +109323,20 @@ exists:
15/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Multiprocessors.Dispatching_Domains;
16/4
-{AI05-0167-1AI05-0167-1} {AI12-0082-1AI12-0082-1} A dispatching domain
-represents a set of processors on which a task may execute. Each
-processor is contained within exactly one dispatching domain. An object
-of type Dispatching_Domain identifies a dispatching domain.
+{<AI05-0167-1AI05-0167-1>} {<AI12-0082-1AI12-0082-1>} A <dispatching
+domain> represents a set of processors on which a task may execute.
+Each processor is contained within exactly one dispatching domain. An
+object of type Dispatching_Domain identifies a dispatching domain.
System_Dispatching_Domain identifies a domain that contains the
processor or processors on which the environment task executes. At
program start-up all processors are contained within this domain.
17/3
-{AI05-0167-1AI05-0167-1} For a task type (including the anonymous type
+{<AI05-0167-1AI05-0167-1>} For a task type (including the anonymous type
of a single_task_declaration), the following language-defined
representation aspect may be specified:
@@ -108972,13 +109355,13 @@ Dispatching_Domain
_Legality Rules_
19/3
-{AI05-0167-1AI05-0167-1} The Dispatching_Domain aspect shall not be
+{<AI05-0167-1AI05-0167-1>} The Dispatching_Domain aspect shall not be
specified for a task interface.
_Dynamic Semantics_
20/4
-{AI05-0167-1AI05-0167-1} {AI12-0033-1AI12-0033-1} The expression
+{<AI05-0167-1AI05-0167-1>} {<AI12-0033-1AI12-0033-1>} The expression
specified for the Dispatching_Domain aspect of a task type is evaluated
each time an object of the task type is created (see *note 9.1::). If
the identified dispatching domain is empty, then
@@ -108986,34 +109369,34 @@ Dispatching_Domain_Error is raised; otherwise the
newly created task is
assigned to the domain identified by the value of the expression.
21/3
-{AI05-0167-1AI05-0167-1} If a task is not explicitly assigned to any
+{<AI05-0167-1AI05-0167-1>} If a task is not explicitly assigned to any
domain, it is assigned to that of the activating task. A task always
executes on some CPU in its domain.
22/4
-{AI05-0167-1AI05-0167-1} {AI12-0082-1AI12-0082-1} If both the
+{<AI05-0167-1AI05-0167-1>} {<AI12-0082-1AI12-0082-1>} If both the
dispatching domain and CPU are specified for a task, and the CPU value
is not contained within the set of processors for the domain (and is not
Not_A_Specific_CPU), the activation of the task is defined to have
failed, and it becomes a completed task (see *note 9.2::).
23/4
-{AI05-0167-1AI05-0167-1} {AI12-0033-1AI12-0033-1} The function Create
-with First and Last parameters creates and returns a dispatching domain
-containing all the processors in the range First .. Last. The function
-Create with a Set parameter creates and returns a dispatching domain
-containing the processors for which Set(I) is True. These processors
-are removed from System_Dispatching_Domain. A call of Create will raise
-Dispatching_Domain_Error if any designated processor is not currently in
-System_Dispatching_Domain, or if the system cannot support a distinct
-domain over the processors identified, or if a processor has a task
-assigned to it, or if the allocation would leave
+{<AI05-0167-1AI05-0167-1>} {<AI12-0033-1AI12-0033-1>} The function
+Create with First and Last parameters creates and returns a dispatching
+domain containing all the processors in the range First .. Last. The
+function Create with a Set parameter creates and returns a dispatching
+domain containing the processors for which Set(I) is True. These
+processors are removed from System_Dispatching_Domain. A call of Create
+will raise Dispatching_Domain_Error if any designated processor is not
+currently in System_Dispatching_Domain, or if the system cannot support
+a distinct domain over the processors identified, or if a processor has
+a task assigned to it, or if the allocation would leave
System_Dispatching_Domain empty. A call of Create will raise
Dispatching_Domain_Error if the calling task is not the environment
task, or if Create is called after the call to the main subprogram.
24/4
-{AI05-0167-1AI05-0167-1} {AI12-0033-1AI12-0033-1} The function
+{<AI05-0167-1AI05-0167-1>} {<AI12-0033-1AI12-0033-1>} The function
Get_First_CPU returns the first CPU in Domain, or CPU'First if Domain is
empty; Get_Last_CPU returns the last CPU in Domain, or CPU_Range'First
if Domain is empty. The function Get_CPU_Set(D) returns an array whose
@@ -109022,13 +109405,13 @@ True values in the Set corresponding to the CPUs
that are in the given
Domain.
25/4
-{AI05-0167-1AI05-0167-1} {AI12-0082-1AI12-0082-1} The function
+{<AI05-0167-1AI05-0167-1>} {<AI12-0082-1AI12-0082-1>} The function
Get_Dispatching_Domain returns the dispatching domain on which the task
is assigned.
26/4
-{AI05-0167-1AI05-0167-1} {AI05-0278-1AI05-0278-1}
-{AI12-0033-1AI12-0033-1} A call of the procedure Assign_Task assigns
+{<AI05-0167-1AI05-0167-1>} {<AI05-0278-1AI05-0278-1>}
+{<AI12-0033-1AI12-0033-1>} A call of the procedure Assign_Task assigns
task T to the CPU within the dispatching domain Domain. Task T can now
execute only on CPU, unless CPU designates Not_A_Specific_CPU in which
case it can execute on any processor within Domain. The exception
@@ -109044,8 +109427,8 @@ Assigning a task already assigned to
System_Dispatching_Domain to that
domain has no effect.
27/4
-{AI05-0167-1AI05-0167-1} {AI05-0278-1AI05-0278-1}
-{AI12-0082-1AI12-0082-1} A call of procedure Set_CPU assigns task T to
+{<AI05-0167-1AI05-0167-1>} {<AI05-0278-1AI05-0278-1>}
+{<AI12-0082-1AI12-0082-1>} A call of procedure Set_CPU assigns task T to
the CPU. Task T can now execute only on CPU, unless CPU designates
Not_A_Specific_CPU, in which case it can execute on any processor within
its dispatching domain. The exception Dispatching_Domain_Error is
@@ -109058,12 +109441,12 @@ immediate if T is not inside a protected action,
otherwise the effect is
as soon as practical.
28/3
-{AI05-0167-1AI05-0167-1} The function Get_CPU returns the processor
+{<AI05-0167-1AI05-0167-1>} The function Get_CPU returns the processor
assigned to task T, or Not_A_Specific_CPU if the task is not assigned to
a processor.
29/4
-{AI05-0167-1AI05-0167-1} {AI12-0082-1AI12-0082-1} A call of
+{<AI05-0167-1AI05-0167-1>} {<AI12-0082-1AI12-0082-1>} A call of
Delay_Until_And_Set_CPU delays the calling task for the designated time
and then assigns the task to the specified processor when the delay
expires. The exception Dispatching_Domain_Error is propagated if P is
@@ -109073,15 +109456,15 @@ is not Not_A_Specific_CPU).
_Implementation Requirements_
30/3
-{AI05-0167-1AI05-0167-1} The implementation shall perform the operations
-Assign_Task, Set_CPU, Get_CPU and Delay_Until_And_Set_CPU atomically
-with respect to any of these operations on the same dispatching_domain,
-processor or task.
+{<AI05-0167-1AI05-0167-1>} The implementation shall perform the
+operations Assign_Task, Set_CPU, Get_CPU and Delay_Until_And_Set_CPU
+atomically with respect to any of these operations on the same
+dispatching_domain, processor or task.
30.1/4
-{AI12-0048-1AI12-0048-1} Any task that belongs to the system dispatching
-domain can execute on any CPU within that domain, unless the assignment
-of the task has been specified.
+{<AI12-0048-1AI12-0048-1>} Any task that belongs to the system
+dispatching domain can execute on any CPU within that domain, unless the
+assignment of the task has been specified.
30.a/4
Reason: This ensures that priorities and deadlines are
@@ -109110,7 +109493,7 @@ of the task has been specified.
_Implementation Advice_
31/3
-{AI05-0167-1AI05-0167-1} Each dispatching domain should have separate
+{<AI05-0167-1AI05-0167-1>} Each dispatching domain should have separate
and disjoint ready queues.
31.a/3
@@ -109118,7 +109501,7 @@ and disjoint ready queues.
separate and disjoint ready queues.
31.b/4
- To be honest: {AI12-0048-1AI12-0048-1} "Ready queue" here
+ To be honest: {<AI12-0048-1AI12-0048-1>} "Ready queue" here
doesn't mean the conceptual "ready queue" as defined in *note
D.2.1:: (one per processor); this rule is talking about the
ready queues used by the implementation.
@@ -109126,7 +109509,7 @@ and disjoint ready queues.
_Documentation Requirements_
32/3
-{AI05-0167-1AI05-0167-1} The implementation shall document the
+{<AI05-0167-1AI05-0167-1>} The implementation shall document the
processor(s) on which the clock interrupt is handled and hence where
delay queue and ready queue manipulations occur. For any Interrupt_Id
whose handler can execute on more than one processor the implementation
@@ -109140,23 +109523,23 @@ shall also document this set of processors.
_Implementation Permissions_
33/3
-{AI05-0167-1AI05-0167-1} An implementation may limit the number of
+{<AI05-0167-1AI05-0167-1>} An implementation may limit the number of
dispatching domains that can be created and raise
Dispatching_Domain_Error if an attempt is made to exceed this number.
_Extensions to Ada 2005_
33.a/3
- {AI05-0167-1AI05-0167-1} {AI05-0278-1AI05-0278-1} The package
- System.Multiprocessors.Dispatching_Domains and the aspect
- Dispatching_Domains are new.
+ {<AI05-0167-1AI05-0167-1>} {<AI05-0278-1AI05-0278-1>} The
+ package System.Multiprocessors.Dispatching_Domains and the
+ aspect Dispatching_Domains are new.
_Inconsistencies With Ada 2012_
33.b/4
- {AI12-0033-1AI12-0033-1} Corrigendum: We now explicitly allow
- empty dispatching domains, as it would be difficult to avoid
- declaring them when a system is configured at runtime.
+ {<AI12-0033-1AI12-0033-1>} Corrigendum: We now explicitly
+ allow empty dispatching domains, as it would be difficult to
+ avoid declaring them when a system is configured at runtime.
Therefore, assigning a task to an empty domain now raises
Dispatching_Domain_Error; creating such a domain should not
raise Dispatching_Domain_Error. If an implementation does
@@ -109169,7 +109552,7 @@ Dispatching_Domain_Error if an attempt is made to
exceed this number.
_Incompatibilities With Ada 2012_
33.c/4
- {AI05-0033-1AI05-0033-1} Corrigendum: The subtypes of the
+ {<AI05-0033-1AI05-0033-1>} Corrigendum: The subtypes of the
parameter or result of several routines were changed to
support empty domains. These changes will cause rules
requiring subtype conformance to fail on these routines (such
@@ -109177,21 +109560,21 @@ Dispatching_Domain_Error if an attempt is made to
exceed this number.
type CPU_Set and function Get_CPU_Set, along with an
overloaded Create are newly added to this package. If
Multiprocessors.Dispatching_Domains is referenced in a
- use_clause, and an entity E with the same defining_identifier
- as a new entity in this package is defined in a package that
- is also referenced in a use_clause, the entity E may no longer
- be use-visible, resulting in errors. This should be rare and
- is easily fixed if it does occur.
+ use_clause, and an entity <E> with the same
+ defining_identifier as a new entity in this package is defined
+ in a package that is also referenced in a use_clause, the
+ entity <E> may no longer be use-visible, resulting in errors.
+ This should be rare and is easily fixed if it does occur.
_Wording Changes from Ada 2012_
33.d/4
- {AI12-0048-1AI12-0048-1} Corrigendum: Added wording to clarify
- that all tasks can execute on all CPUs of the system
+ {<AI12-0048-1AI12-0048-1>} Corrigendum: Added wording to
+ clarify that all tasks can execute on all CPUs of the system
dispatching domain by default.
33.e/4
- {AI12-0082-1AI12-0082-1} Corrigndum: Added a definition to
+ {<AI12-0082-1AI12-0082-1>} Corrigndum: Added a definition to
clarify that a "dispatching domain" is a concept which is
identified by an object of type Dispatching_Domain; more than
one object might identify the same dispatching domain (for
@@ -109217,19 +109600,20 @@ part of a single Ada program.]
_Post-Compilation Rules_
2
-A distributed system is an interconnection of one or more processing
-nodes (a system resource that has both computational and storage
-capabilities), and zero or more storage nodes (a system resource that
+A <distributed system> is an interconnection of one or more <processing
+nodes> (a system resource that has both computational and storage
+capabilities), and zero or more <storage nodes> (a system resource that
has only storage capabilities, with the storage addressable by one or
more processing nodes).
3
-A distributed program comprises one or more partitions that execute
+A <distributed program> comprises one or more partitions that execute
independently (except when they communicate) in a distributed system.
4
The process of mapping the partitions of a program to the nodes in a
-distributed system is called configuring the partitions of the program.
+distributed system is called <configuring the partitions of the
+program>.
_Implementation Requirements_
@@ -109284,8 +109668,8 @@ or passive.]
_Post-Compilation Rules_
2
-An active partition is a partition as defined in *note 10.2::. A
-passive partition is a partition that has no thread of control of its
+An <active partition> is a partition as defined in *note 10.2::. A
+<passive partition> is a partition that has no thread of control of its
own, whose library units are all preelaborated, and whose data and
subprograms are accessible to one or more active partitions.
@@ -109310,9 +109694,9 @@ processing node.
5
The configuration of the partitions of a program onto a distributed
system shall be consistent with the possibility for data references or
-calls between the partitions implied by their semantic dependences. Any
+calls between the partitions implied by their semantic dependences. Any
reference to data or call of a subprogram across partitions is called a
-remote access.
+<remote access>.
5.a
Discussion: For example, an active partition that includes a
@@ -109343,12 +109727,12 @@ such partition.]
passive partitions.
7
-[An active partition terminates when its environment task terminates.]
-A partition becomes inaccessible if it terminates or if it is aborted.
-An active partition is aborted when its environment task is aborted. In
-addition, if a partition fails during its elaboration, it becomes
-inaccessible to other partitions. Other implementation-defined events
-can also result in a partition becoming inaccessible.
+[An active partition <terminates> when its environment task terminates.]
+A partition becomes <inaccessible> if it terminates or if it is
+<aborted>. An active partition is aborted when its environment task is
+aborted. In addition, if a partition fails during its elaboration, it
+becomes inaccessible to other partitions. Other implementation-defined
+events can also result in a partition becoming inaccessible.
7.a
Implementation defined: Any events that can result in a
@@ -109361,7 +109745,7 @@ attribute is defined:
9
D'Partition_Id
- Denotes a value of the type universal_integer that
+ Denotes a value of the type <universal_integer> that
identifies the partition in which D was elaborated. If D
denotes the declaration of a remote call interface
library unit (see *note E.2.3::) the given partition is
@@ -109370,9 +109754,9 @@ D'Partition_Id
_Bounded (Run-Time) Errors_
10/2
-{AI95-00226-01AI95-00226-01} It is a bounded error for there to be
+{<AI95-00226-01AI95-00226-01>} It is a bounded error for there to be
cyclic elaboration dependences between the active partitions of a single
-distributed program. The possible effects, in each of the partitions
+distributed program. The possible effects, in each of the partitions
involved, are deadlock during elaboration, or the raising of
Communication_Error or Program_Error.
@@ -109428,7 +109812,7 @@ terminate and are later reinvoked.
_Wording Changes from Ada 95_
16.a/2
- {AI95-00226-01AI95-00226-01} Corrected wording so that a
+ {<AI95-00226-01AI95-00226-01>} Corrected wording so that a
partition that has an elaboration problem will either deadlock
or raise an exception. While an Ada 95 implementation could
allow some partitions to continue to execute, they could be
@@ -109449,15 +109833,15 @@ category to ensure that the semantics of a
distributed program remain
close to the semantics for a nondistributed program.]
2/3
-{AI05-0243-1AI05-0243-1} A categorization pragma is a library unit
+{<AI05-0243-1AI05-0243-1>} A <categorization pragma> is a library unit
pragma (see *note 10.1.5::) that specifies a corresponding
-categorization aspect. A categorization aspect restricts the
+<categorization aspect>. A categorization aspect restricts the
declarations, child units, or semantic dependences of the library unit
-to which it applies. A categorized library unit is a library unit that
-has a categorization aspect that is True.
+to which it applies. A <categorized library unit> is a library unit
+that has a categorization aspect that is True.
3/3
-{AI05-0243-1AI05-0243-1} The pragmas Shared_Passive, Remote_Types, and
+{<AI05-0243-1AI05-0243-1>} The pragmas Shared_Passive, Remote_Types, and
Remote_Call_Interface are categorization pragmas, and the associated
aspects are categorization aspects. In addition, for the purposes of
this Annex, the aspect Pure (see *note 10.2.1::) is considered a
@@ -109465,29 +109849,29 @@ categorization aspect and the pragma Pure is
considered a categorization
pragma.
4/3
-{8652/00788652/0078} {AI95-00048-01AI95-00048-01}
-{AI05-0243-1AI05-0243-1} [ A library package or generic library package
-is called a shared passive library unit if the Shared_Passive aspect of
-the unit is True. A library package or generic library package is
-called a remote types library unit if the Remote_Types aspect of the
-unit is True. A library unit is called a remote call interface if the
-Remote_Call_Interface aspect of the unit is True.] A normal library unit
-is one for which no categorization aspect is True.
+{<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+{<AI05-0243-1AI05-0243-1>} [ A library package or generic library
+package is called a <shared passive> library unit if the Shared_Passive
+aspect of the unit is True. A library package or generic library
+package is called a <remote types> library unit if the Remote_Types
+aspect of the unit is True. A library unit is called a <remote call
+interface> if the Remote_Call_Interface aspect of the unit is True.] A
+<normal library unit> is one for which no categorization aspect is True.
4.a/3
- Proof: {AI05-0243-1AI05-0243-1} {AI05-0299-1AI05-0299-1} These
- terms (other than "normal library unit") are really defined in
- the following subclauses.
+ Proof: {<AI05-0243-1AI05-0243-1>} {<AI05-0299-1AI05-0299-1>}
+ These terms (other than "normal library unit") are really
+ defined in the following subclauses.
4.a.1/1
- Ramification: {8652/00788652/0078}
- {AI95-00048-01AI95-00048-01} A library subprogram can be a
+ Ramification: {<8652/00788652/0078>}
+ {<AI95-00048-01AI95-00048-01>} A library subprogram can be a
remote call interface, but it cannot be a remote types or
shared passive library unit.
5/3
-{AI05-0206-1AI05-0206-1} {AI05-0243-1AI05-0243-1}
-{AI05-0269-1AI05-0269-1} {AI05-0299-1AI05-0299-1} [The various
+{<AI05-0206-1AI05-0206-1>} {<AI05-0243-1AI05-0243-1>}
+{<AI05-0269-1AI05-0269-1>} {<AI05-0299-1AI05-0299-1>} [The various
categories of library units and the associated restrictions are
described in this and the following subclauses. The categories are
related hierarchically in that the library units of one category can
@@ -109499,9 +109883,10 @@ normal library units that are mentioned only in
private with clauses,
and all categories can depend on limited views.
6/3
-{AI05-0243-1AI05-0243-1} {AI05-0269-1AI05-0269-1} The overall hierarchy
-(including declared pure) is as follows, with a lower-numbered category
-being "earlier in the hierarchy" in the sense of the previous paragraph:
+{<AI05-0243-1AI05-0243-1>} {<AI05-0269-1AI05-0269-1>} The overall
+hierarchy (including declared pure) is as follows, with a lower-numbered
+category being "earlier in the hierarchy" in the sense of the previous
+paragraph:
6.1/3
1. Declared Pure
@@ -109518,14 +109903,14 @@ being "earlier in the hierarchy" in the sense of
the previous paragraph:
6.5/3
5. Normal (no restrictions)
-Paragraphs 7 through 11 were deleted.
+<Paragraphs 7 through 11 were deleted.>
12
Declared pure and shared passive library units are preelaborated. The
declaration of a remote types or remote call interface library unit is
required to be preelaborable. ]
-Paragraph 13 was deleted.
+<Paragraph 13 was deleted.>
_Implementation Permissions_
@@ -109535,27 +109920,27 @@ Implementations are allowed to define other
categorization pragmas.
_Wording Changes from Ada 95_
14.a/2
- {8652/00788652/0078} {AI95-00048-01AI95-00048-01} Corrigendum:
- Clarified that a library subprogram can be a remote call
- interface unit.
+ {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+ Corrigendum: Clarified that a library subprogram can be a
+ remote call interface unit.
14.b/2
- {8652/00798652/0079} {AI95-00208-01AI95-00208-01} Corrigendum:
- Removed the requirement that types be represented the same in
- all partitions, because it prevents the definition of
- heterogeneous distributed systems and goes much further than
- required.
+ {<8652/00798652/0079>} {<AI95-00208-01AI95-00208-01>}
+ Corrigendum: Removed the requirement that types be represented
+ the same in all partitions, because it prevents the definition
+ of heterogeneous distributed systems and goes much further
+ than required.
_Wording Changes from Ada 2005_
14.c/3
- {AI05-0206-1AI05-0206-1} {AI05-0299-1AI05-0299-1} We now allow
- private withs of preelaborated units in Remote Types and
+ {<AI05-0206-1AI05-0206-1>} {<AI05-0299-1AI05-0299-1>} We now
+ allow private withs of preelaborated units in Remote Types and
Remote Call Interface units; this is documented as an
extension in the subclauses where this is defined normatively.
14.d/3
- {AI05-0243-1AI05-0243-1} {AI05-0299-1AI05-0299-1} We have
+ {<AI05-0243-1AI05-0243-1>} {<AI05-0299-1AI05-0299-1>} We have
introduced categorization aspects; these are documented as
extensions in the subclauses where they actually are defined.
@@ -109593,13 +109978,13 @@ objects declared in the shared passive library
unit.]
The form of a pragma Shared_Passive is as follows:
3
- pragma Shared_Passive[(library_unit_name)];
+ pragma Shared_Passive[(<library_unit_>name)];
_Legality Rules_
4/3
-{AI05-0243-1AI05-0243-1} A pragma Shared_Passive is used to specify that
-a library unit is a shared passive library unit, namely that the
+{<AI05-0243-1AI05-0243-1>} A pragma Shared_Passive is used to specify
+that a library unit is a <shared passive library unit>, namely that the
Shared_Passive aspect of the library unit is True. The following
restrictions apply to such a library unit:
@@ -109621,7 +110006,7 @@ restrictions apply to such a library unit:
partition back to a task in some active partition.
6/3
- * {AI05-0243-1AI05-0243-1} it shall depend semantically only upon
+ * {<AI05-0243-1AI05-0243-1>} it shall depend semantically only upon
declared pure or shared passive library_items;
6.a
@@ -109632,13 +110017,13 @@ restrictions apply to such a library unit:
package.
6.b/3
- Ramification: {AI05-0243-1AI05-0243-1} We say library_item
+ Ramification: {<AI05-0243-1AI05-0243-1>} We say library_item
here, so that limited views are allowed; those are not library
units, but they are library_item.
7/4
- * {8652/00808652/0080} {AI95-00003-01AI95-00003-01}
- {AI12-0038-1AI12-0038-1} it shall not contain a library-level
+ * {<8652/00808652/0080>} {<AI95-00003-01AI95-00003-01>}
+ {<AI12-0038-1AI12-0038-1>} it shall not contain a library-level
declaration of an access type that designates a class-wide type,
nor a type with a part that is of a task type or protected type
with entry_declarations;
@@ -109650,7 +110035,7 @@ restrictions apply to such a library unit:
whose behalf the designated object was created.
7.1/4
- * {AI12-0038-1AI12-0038-1} it shall not contain a library-level
+ * {<AI12-0038-1AI12-0038-1>} it shall not contain a library-level
declaration that contains a name that denotes a type declared
within a declared-pure package, if that type has a part that is of
an access type; for the purposes of this rule, the parts considered
@@ -109697,22 +110082,22 @@ within a given program.
11
Notwithstanding the rule given in *note 10.2::, a compilation unit in a
-given partition does not need (in the sense of *note 10.2::) the shared
-passive library units on which it depends semantically to be included in
-that same partition; they will typically reside in separate passive
-partitions.
+given partition does not <need> (in the sense of *note 10.2::) the
+shared passive library units on which it depends semantically to be
+included in that same partition; they will typically reside in separate
+passive partitions.
_Wording Changes from Ada 95_
11.a/2
- {8652/00808652/0080} {AI95-00003-01AI95-00003-01} Corrigendum:
- Corrected the wording to allow access types in blocks in
- shared passive generic packages.
+ {<8652/00808652/0080>} {<AI95-00003-01AI95-00003-01>}
+ Corrigendum: Corrected the wording to allow access types in
+ blocks in shared passive generic packages.
_Extensions to Ada 2005_
11.b/3
- {AI05-0243-1AI05-0243-1} Shared_Passive is now a
+ {<AI05-0243-1AI05-0243-1>} Shared_Passive is now a
categorization aspect, so it can be specified by an
aspect_specification -- although the pragma is still preferred
by the Standard.
@@ -109720,7 +110105,7 @@ partitions.
_Incompatibilities With Ada 2012_
11.c/4
- {AI12-0038-1AI12-0038-1} Corrigendum: Uses of access types
+ {<AI12-0038-1AI12-0038-1>} Corrigendum: Uses of access types
declared in declared-pure units are not allowed in
library-level shared passive packages. These were allowed by
Ada 2005 and Ada 2012, but it is unlikely that they work
@@ -109754,13 +110139,13 @@ for use in communication between active partitions.]
The form of a pragma Remote_Types is as follows:
3
- pragma Remote_Types[(library_unit_name)];
+ pragma Remote_Types[(<library_unit_>name)];
_Legality Rules_
4/3
-{AI05-0243-1AI05-0243-1} A pragma Remote_Types is used to specify that a
-library unit is a remote types library unit, namely that the
+{<AI05-0243-1AI05-0243-1>} A pragma Remote_Types is used to specify that
+a library unit is a <remote types library unit>, namely that the
Remote_Types aspect of the library unit is True. The following
restrictions apply to the declaration of such a library unit:
@@ -109772,14 +110157,14 @@ restrictions apply to the declaration of such a
library unit:
* [it shall be preelaborable;]
6/3
- * {AI05-0206-1AI05-0206-1} {AI05-0243-1AI05-0243-1} it shall depend
- semantically only on declared pure library_items, shared passive
- library units, other remote types library units, or preelaborated
- normal library units that are mentioned only in private with
- clauses;
+ * {<AI05-0206-1AI05-0206-1>} {<AI05-0243-1AI05-0243-1>} it shall
+ depend semantically only on declared pure library_items, shared
+ passive library units, other remote types library units, or
+ preelaborated normal library units that are mentioned only in
+ private with clauses;
6.a/3
- Ramification: {AI05-0243-1AI05-0243-1} We say declared pure
+ Ramification: {<AI05-0243-1AI05-0243-1>} We say declared pure
library_item here, so that (all) limited views are allowed;
those are not library units, but they are declared pure
library_items.
@@ -109799,10 +110184,10 @@ restrictions apply to the declaration of such a
library unit:
being provided.
8/2
- * {AI95-00240-01AI95-00240-01} {AI95-00366-01AI95-00366-01} the full
- view of each type declared in the visible part of the library unit
- that has any available stream attributes shall support external
- streaming (see *note 13.13.2::).
+ * {<AI95-00240-01AI95-00240-01>} {<AI95-00366-01AI95-00366-01>} the
+ full view of each type declared in the visible part of the library
+ unit that has any available stream attributes shall support
+ external streaming (see *note 13.13.2::).
8.a
Reason: This is to prevent the use of the predefined Read and
@@ -109810,7 +110195,7 @@ restrictions apply to the declaration of such a
library unit:
Write attributes of a visible type.
8.b/2
- Ramification: {AI95-00366-01AI95-00366-01} Types that do not
+ Ramification: {<AI95-00366-01AI95-00366-01>} Types that do not
have available stream attributes are excluded from this rule;
that means that attributes do not need to be specified for
most limited types. It is only necessary to specify
@@ -109821,33 +110206,33 @@ restrictions apply to the declaration of such a
library unit:
type does not have specified attributes.
9/3
-{8652/00828652/0082} {AI95-00164-01AI95-00164-01}
-{AI05-0060-1AI05-0060-1} A named access type declared in the visible
+{<8652/00828652/0082>} {<AI95-00164-01AI95-00164-01>}
+{<AI05-0060-1AI05-0060-1>} A named access type declared in the visible
part of a remote types or remote call interface library unit is called a
-remote access type. Such a type shall be:
+<remote access type>. Such a type shall be:
9.1/1
- * {8652/00828652/0082} {AI95-00164-01AI95-00164-01} an
+ * {<8652/00828652/0082>} {<AI95-00164-01AI95-00164-01>} an
access-to-subprogram type, or
9.2/3
- * {8652/00828652/0082} {AI95-00164-01AI95-00164-01}
- {AI05-0060-1AI05-0060-1} a general access type that designates a
+ * {<8652/00828652/0082>} {<AI95-00164-01AI95-00164-01>}
+ {<AI05-0060-1AI05-0060-1>} a general access type that designates a
class-wide limited private type, a class-wide limited interface
type, or a class-wide private extension all of whose ancestors are
either private extensions, limited interface types, or limited
private types.
9.3/1
-{8652/00818652/0081} {AI95-00004-01AI95-00004-01} A type that is derived
-from a remote access type is also a remote access type.
+{<8652/00818652/0081>} {<AI95-00004-01AI95-00004-01>} A type that is
+derived from a remote access type is also a remote access type.
10
The following restrictions apply to the use of a remote
access-to-subprogram type:
11/2
- * {AI95-00431-01AI95-00431-01} A value of a remote
+ * {<AI95-00431-01AI95-00431-01>} A value of a remote
access-to-subprogram type shall be converted only to or from
another (subtype-conformant) remote access-to-subprogram type;
@@ -109861,9 +110246,9 @@ The following restrictions apply to the use of a
remote
access-to-class-wide type:
14/3
- * {8652/00838652/0083} {AI95-00047-01AI95-00047-01}
- {AI95-00240-01AI95-00240-01} {AI95-00366-01AI95-00366-01}
- {AI05-0060-1AI05-0060-1} {AI05-0101-1AI05-0101-1} The primitive
+ * {<8652/00838652/0083>} {<AI95-00047-01AI95-00047-01>}
+ {<AI95-00240-01AI95-00240-01>} {<AI95-00366-01AI95-00366-01>}
+ {<AI05-0060-1AI05-0060-1>} {<AI05-0101-1AI05-0101-1>} The primitive
subprograms of the corresponding specific type shall only have
access parameters if they are controlling formal parameters. The
primitive functions of the corresponding specific type shall only
@@ -109872,9 +110257,9 @@ access-to-class-wide type:
shall support external streaming (see *note 13.13.2::);
14.1/3
- * {AI05-0060-1AI05-0060-1} {AI05-0215-1AI05-0215-1}
- {AI05-0269-1AI05-0269-1} The corresponding specific type shall not
- have a primitive procedure with the Synchronization aspect
+ * {<AI05-0060-1AI05-0060-1>} {<AI05-0215-1AI05-0215-1>}
+ {<AI05-0269-1AI05-0269-1>} The corresponding specific type shall
+ not have a primitive procedure with the Synchronization aspect
specified unless the synchronization_kind is Optional (see *note
9.5::);
@@ -109883,7 +110268,7 @@ access-to-class-wide type:
converted only to another remote access-to-class-wide type;
16/4
- * {AI12-0034-1AI12-0034-1} A value of a remote access-to-class-wide
+ * {<AI12-0034-1AI12-0034-1>} A value of a remote access-to-class-wide
type shall be dereferenced (or implicitly converted to an anonymous
access type) only as part of a dispatching call to a primitive
operation of the designated type where the value designates a
@@ -109891,7 +110276,7 @@ access-to-class-wide type:
Remote Subprogram Calls");
16.a/4
- Ramification: {AI12-0034-1AI12-0034-1} Stream attributes of
+ Ramification: {<AI12-0034-1AI12-0034-1>} Stream attributes of
the designated type are not primitive operations of the
designated type, and thus remote calls to them are prohibited
by this rule. This is good, as the access parameter of a
@@ -109899,14 +110284,14 @@ access-to-class-wide type:
cannot be a parameter of a remote call.
16.1/3
- * {AI05-0101-1AI05-0101-1} A controlling access result value for a
+ * {<AI05-0101-1AI05-0101-1>} A controlling access result value for a
primitive function with any controlling operands of the
corresponding specific type shall either be explicitly converted to
a remote access-to-class-wide type or be part of a dispatching call
where the value designates a controlling operand of the call;
17/4
- * {AI95-00366-01AI95-00366-01} {AI12-0085-1AI12-0085-1} The
+ * {<AI95-00366-01AI95-00366-01>} {<AI12-0085-1AI12-0085-1>} The
Storage_Pool attribute is not defined for a remote
access-to-class-wide type; the expected type for an allocator shall
not be a remote access-to-class-wide type. A remote
@@ -109917,23 +110302,24 @@ access-to-class-wide type:
access-to-class-wide type.
17.a/3
- Reason: {AI05-0005-1AI05-0005-1} All of these restrictions are
- because there is no storage pool associated with a remote
+ Reason: {<AI05-0005-1AI05-0005-1>} All of these restrictions
+ are because there is no storage pool associated with a remote
access-to-class-wide type. The Storage_Size is defined to be
0 so that there is no conflict with the rules for pure units.
17.b/4
- Ramification: {AI12-0085-1AI12-0085-1} The prohibition against
- specifying the Storage_Size aspect for an access-to-class-wide
- type applies to any method of doing that, including via either
- a aspect_specification or an attribute_definition_clause.
+ Ramification: {<AI12-0085-1AI12-0085-1>} The prohibition
+ against specifying the Storage_Size aspect for an
+ access-to-class-wide type applies to any method of doing that,
+ including via either a aspect_specification or an
+ attribute_definition_clause.
_Erroneous Execution_
17.1/4
-{AI12-0076-1AI12-0076-1} Execution is erroneous if some operation (other
-than the initialization or finalization of the object) modifies the
-value of a constant object declared in the visible part of a remote
+{<AI12-0076-1AI12-0076-1>} Execution is erroneous if some operation
+(other than the initialization or finalization of the object) modifies
+the value of a constant object declared in the visible part of a remote
types package.
17.c/4
@@ -109952,12 +110338,12 @@ types package.
unmarshalling any levels of indirection.
19/3
- 6 {AI05-0060-1AI05-0060-1} The value of a remote
+ 6 {<AI05-0060-1AI05-0060-1>} The value of a remote
access-to-class-wide limited interface can designate an object of a
nonlimited type derived from the interface.
20/3
- 7 {AI05-0060-1AI05-0060-1} A remote access type may designate a
+ 7 {<AI05-0060-1AI05-0060-1>} A remote access type may designate a
class-wide synchronized, protected, or task interface type.
20.a/3
@@ -109967,7 +110353,7 @@ types package.
_Incompatibilities With Ada 95_
20.b/3
- {AI95-00240-01AI95-00240-01} {AI05-0248-1AI05-0248-1}
+ {<AI95-00240-01AI95-00240-01>} {<AI05-0248-1AI05-0248-1>}
Amendment Correction: The wording was changed from
"user-specified" to "available" read and write attributes.
(This was then further changed, see below.) This means that
@@ -109984,48 +110370,49 @@ types package.
_Extensions to Ada 95_
20.c/3
- {AI95-00366-01AI95-00366-01} {AI05-0005-1AI05-0005-1} Remote
- types that cannot be streamed (that is, have no available
- stream attributes) do not require the specification of stream
- attributes. This is necessary so that most extensions of
- Limited_Controlled do not need stream attributes defined
- (otherwise there would be a significant incompatibility, as
- Limited_Controlled would need stream attributes, and then all
- extensions of it also would need stream attributes).
+ {<AI95-00366-01AI95-00366-01>} {<AI05-0005-1AI05-0005-1>}
+ Remote types that cannot be streamed (that is, have no
+ available stream attributes) do not require the specification
+ of stream attributes. This is necessary so that most
+ extensions of Limited_Controlled do not need stream attributes
+ defined (otherwise there would be a significant
+ incompatibility, as Limited_Controlled would need stream
+ attributes, and then all extensions of it also would need
+ stream attributes).
_Wording Changes from Ada 95_
20.d/2
- {8652/00818652/0081} {AI95-00004-01AI95-00004-01} Corrigendum:
- Added missing wording so that a type derived from a remote
- access type is also a remote access type.
+ {<8652/00818652/0081>} {<AI95-00004-01AI95-00004-01>}
+ Corrigendum: Added missing wording so that a type derived from
+ a remote access type is also a remote access type.
20.e/2
- {8652/00838652/0083} {AI95-00047-01AI95-00047-01} Corrigendum:
- Clarified that user-defined Read and Write attributes are
- required for the primitive subprograms corresponding to a
- remote access-to-class-wide type.
+ {<8652/00838652/0083>} {<AI95-00047-01AI95-00047-01>}
+ Corrigendum: Clarified that user-defined Read and Write
+ attributes are required for the primitive subprograms
+ corresponding to a remote access-to-class-wide type.
20.f/2
- {8652/00828652/0082} {AI95-00164-01AI95-00164-01} Corrigendum:
- Added missing wording so that a remote access type can
- designate an appropriate private extension.
+ {<8652/00828652/0082>} {<AI95-00164-01AI95-00164-01>}
+ Corrigendum: Added missing wording so that a remote access
+ type can designate an appropriate private extension.
20.g/2
- {AI95-00366-01AI95-00366-01} Changed the wording to use the
- newly defined term type that supports external streaming, so
+ {<AI95-00366-01AI95-00366-01>} Changed the wording to use the
+ newly defined term <type that supports external streaming>, so
that various issues with access types in pure units and
implicitly declared attributes for type extensions are
properly handled.
20.h/2
- {AI95-00366-01AI95-00366-01} Defined Storage_Size to be 0 for
- remote access-to-class-wide types, rather than having it
+ {<AI95-00366-01AI95-00366-01>} Defined Storage_Size to be 0
+ for remote access-to-class-wide types, rather than having it
undefined. This eliminates issues with pure units requiring a
defined storage size.
20.i/2
- {AI95-00431-01AI95-00431-01} Corrected the wording so that a
+ {<AI95-00431-01AI95-00431-01>} Corrected the wording so that a
value of a local access-to-subprogram type cannot be converted
to a remote access-to-subprogram type, as intended (and
required by the ACATS).
@@ -110033,40 +110420,41 @@ types package.
_Incompatibilities With Ada 2005_
20.j/4
- {AI05-0101-1AI05-0101-1} {AI12-0005-1AI12-0005-1} Correction:
- Added rules for returning of remote access-to-class-wide
- types; this had been missed in the past. While programs that
- returned unstreamable types from RCI functions were legal, it
- is not clear what they could have done (as the results could
- not be marshalled). Similarly, RCI functions that return
- remote controlling access types could try to save those
- values, but it is unlikely that a compiler would know how to
- do that usefully. Thus, it seems unlikely that any real
- programs will be impacted by these changes.
+ {<AI05-0101-1AI05-0101-1>} {<AI12-0005-1AI12-0005-1>}
+ Correction: Added rules for returning of remote
+ access-to-class-wide types; this had been missed in the past.
+ While programs that returned unstreamable types from RCI
+ functions were legal, it is not clear what they could have
+ done (as the results could not be marshalled). Similarly, RCI
+ functions that return remote controlling access types could
+ try to save those values, but it is unlikely that a compiler
+ would know how to do that usefully. Thus, it seems unlikely
+ that any real programs will be impacted by these changes.
_Extensions to Ada 2005_
20.k/3
- {AI05-0060-1AI05-0060-1} Correction: Clarified that anonymous
- access types are never remote access types (and can be used in
- remote types units subject to the normal restrictions). Added
- wording to allow limited class-wide interfaces to be
- designated by remote access types.
+ {<AI05-0060-1AI05-0060-1>} Correction: Clarified that
+ anonymous access types are never remote access types (and can
+ be used in remote types units subject to the normal
+ restrictions). Added wording to allow limited class-wide
+ interfaces to be designated by remote access types.
20.l/3
- {AI05-0206-1AI05-0206-1} Added wording to allow private withs
- of preelaborated normal units in the specification of a remote
- types unit.
+ {<AI05-0206-1AI05-0206-1>} Added wording to allow private
+ withs of preelaborated normal units in the specification of a
+ remote types unit.
20.m/3
- {AI05-0243-1AI05-0243-1} Remote_Types is now a categorization
- aspect, so it can be specified by an aspect_specification --
- although the pragma is still preferred by the Standard.
+ {<AI05-0243-1AI05-0243-1>} Remote_Types is now a
+ categorization aspect, so it can be specified by an
+ aspect_specification -- although the pragma is still preferred
+ by the Standard.
_Wording Changes from Ada 2012_
20.n/4
- {AI12-0034-1AI12-0034-1} Corrigendum: Clarified that
+ {<AI12-0034-1AI12-0034-1>} Corrigendum: Clarified that
dispatching remote stream attribute calls are prohibited. We
don't document this as an incompatibility, as the stream
parameter cannot be marshalled for a remote call (it doesn't
@@ -110074,7 +110462,7 @@ types package.
program depends on this functionality.
20.o/4
- {AI12-0076-1AI12-0076-1} Corrigendum: Explicitly stated that
+ {<AI12-0076-1AI12-0076-1>} Corrigendum: Explicitly stated that
modifying a visible constant in a remote types package is
erroneous. We don't document this as inconsistent as
implementations certainly can still do whatever they were
@@ -110083,7 +110471,7 @@ types package.
we're just restoring the previous semantics.
20.p/4
- {AI12-0085-1AI12-0085-1} Corrigendum: Clarified that
+ {<AI12-0085-1AI12-0085-1>} Corrigendum: Clarified that
specifying the Storage_Pool or Storage_Size aspect for an
access-to-class-wide type is not allowed. The intent is
clear, and no implementation has ever allowed specifying the
@@ -110115,13 +110503,13 @@ partitions.]
The form of a pragma Remote_Call_Interface is as follows:
3
- pragma Remote_Call_Interface[(library_unit_name)];
+ pragma Remote_Call_Interface[(<library_unit_>name)];
4
The form of a pragma All_Calls_Remote is as follows:
5
- pragma All_Calls_Remote[(library_unit_name)];
+ pragma All_Calls_Remote[(<library_unit_>name)];
6
A pragma All_Calls_Remote is a library unit pragma.
@@ -110129,51 +110517,51 @@ partitions.]
_Legality Rules_
7/3
-{8652/00788652/0078} {AI95-00048-01AI95-00048-01}
-{AI05-0243-1AI05-0243-1} A pragma Remote_Call_Interface is used to
-specify that a library unit is a remote call interface (RCI), namely
+{<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+{<AI05-0243-1AI05-0243-1>} A pragma Remote_Call_Interface is used to
+specify that a library unit is a <remote call interface (RCI)>, namely
that the Remote_Call_Interface aspect of the library unit is True. A
subprogram declared in the visible part of such a library unit, or
-declared by such a library unit, is called a remote subprogram.
+declared by such a library unit, is called a <remote subprogram>.
7.a/3
Aspect Description for Remote_Call_Interface: Subprograms in a
given package may be used in remote procedure calls.
8/3
-{AI05-0206-1AI05-0206-1} {AI05-0243-1AI05-0243-1} The declaration of an
-RCI library unit shall be preelaborable (see *note 10.2.1::), and shall
-depend semantically only upon declared pure library_items, shared
+{<AI05-0206-1AI05-0206-1>} {<AI05-0243-1AI05-0243-1>} The declaration of
+an RCI library unit shall be preelaborable (see *note 10.2.1::), and
+shall depend semantically only upon declared pure library_items, shared
passive library units, remote types library units, other remote call
interface library units, or preelaborated normal library units that are
mentioned only in private with clauses.
8.a/3
- Ramification: {AI05-0243-1AI05-0243-1} We say declared pure
+ Ramification: {<AI05-0243-1AI05-0243-1>} We say declared pure
library_item here, so that (all) limited views are allowed;
those are not library units, but they are declared pure
library_items.
9/1
-{8652/00788652/0078} {AI95-00048-01AI95-00048-01} In addition, the
+{<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>} In addition, the
following restrictions apply to an RCI library unit:
10/1
- * {8652/00788652/0078} {AI95-00048-01AI95-00048-01} its visible part
- shall not contain the declaration of a variable;
+ * {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>} its visible
+ part shall not contain the declaration of a variable;
10.a/1
- Reason: {8652/00788652/0078} {AI95-00048-01AI95-00048-01}
+ Reason: {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
Remote call interface units do not provide remote data access.
A shared passive package has to be used for that.
11/1
- * {8652/00788652/0078} {AI95-00048-01AI95-00048-01} its visible part
- shall not contain the declaration of a limited type;
+ * {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>} its visible
+ part shall not contain the declaration of a limited type;
11.a/2
- Reason: {AI95-00240-01AI95-00240-01}
- {AI95-00366-01AI95-00366-01} We disallow the declaration of
+ Reason: {<AI95-00240-01AI95-00240-01>}
+ {<AI95-00366-01AI95-00366-01>} We disallow the declaration of
task and protected types, since calling an entry or a
protected subprogram implicitly passes an object of a limited
type (the target task or protected object). We disallow other
@@ -110184,8 +110572,8 @@ following restrictions apply to an RCI library unit:
remote calls).
12/1
- * {8652/00788652/0078} {AI95-00048-01AI95-00048-01} its visible part
- shall not contain a nested generic_declaration;
+ * {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>} its visible
+ part shall not contain a nested generic_declaration;
12.a
Reason: This is disallowed because the body of the nested
@@ -110195,21 +110583,21 @@ following restrictions apply to an RCI library unit:
supported.
13/3
- * {8652/00788652/0078} {AI95-00048-01AI95-00048-01}
- {AI05-0229-1AI05-0229-1} it shall not be, nor shall its visible
+ * {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+ {<AI05-0229-1AI05-0229-1>} it shall not be, nor shall its visible
part contain, the declaration of a subprogram for which aspect
Inline is True;
14/3
- * {8652/00788652/0078} {AI95-00048-01AI95-00048-01}
- {AI95-00240-01AI95-00240-01} {AI95-00366-01AI95-00366-01}
- {AI05-0101-1AI05-0101-1} it shall not be, nor shall its visible
+ * {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+ {<AI95-00240-01AI95-00240-01>} {<AI95-00366-01AI95-00366-01>}
+ {<AI05-0101-1AI05-0101-1>} it shall not be, nor shall its visible
part contain, a subprogram (or access-to-subprogram) declaration
whose profile has a parameter or result of a type that does not
support external streaming (see *note 13.13.2::);
14.a/3
- Ramification: {AI05-0101-1AI05-0101-1} No anonymous access
+ Ramification: {<AI05-0101-1AI05-0101-1>} No anonymous access
types support external streaming, so they are never allowed as
parameters or results of RCI subprograms.
@@ -110236,7 +110624,7 @@ following restrictions apply to an RCI library unit:
active partition.
16/3
-{AI05-0229-1AI05-0229-1} A pragma All_Calls_Remote sets the
+{<AI05-0229-1AI05-0229-1>} A pragma All_Calls_Remote sets the
All_Calls_Remote representation aspect of the library unit to which the
pragma applies to the value True. If the All_Calls_Remote aspect of a
library unit is True, the library unit shall be a remote call interface.
@@ -110256,8 +110644,8 @@ whose parent is also an RCI library unit shall be
assigned only to the
same partition as its parent.
17.a/1
- Implementation Note: {8652/00788652/0078}
- {AI95-00048-01AI95-00048-01} The declaration of an RCI unit,
+ Implementation Note: {<8652/00788652/0078>}
+ {<AI95-00048-01AI95-00048-01>} The declaration of an RCI unit,
with a calling-stub body, is automatically included in all
active partitions with compilation units that depend on it.
However the whole RCI library unit, including its (non-stub)
@@ -110266,48 +110654,50 @@ same partition as its parent.
18
Notwithstanding the rule given in *note 10.2::, a compilation unit in a
given partition that semantically depends on the declaration of an RCI
-library unit, needs (in the sense of *note 10.2::) only the declaration
-of the RCI library unit, not the body, to be included in that same
-partition. [Therefore, the body of an RCI library unit is included only
-in the partition to which the RCI library unit is explicitly assigned.]
+library unit, <needs> (in the sense of *note 10.2::) only the
+declaration of the RCI library unit, not the body, to be included in
+that same partition. [Therefore, the body of an RCI library unit is
+included only in the partition to which the RCI library unit is
+explicitly assigned.]
_Implementation Requirements_
19/4
-{8652/00788652/0078} {AI95-00048-01AI95-00048-01}
-{AI05-0229-1AI05-0229-1} {AI12-0031-1AI12-0031-1} If aspect
+{<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+{<AI05-0229-1AI05-0229-1>} {<AI12-0031-1AI12-0031-1>} If aspect
All_Calls_Remote is True for a given RCI library unit, then the
implementation shall route any of the following calls through the
Partition Communication Subsystem (PCS); see *note E.5:::
19.1/4
- * {AI12-0031-1AI12-0031-1} A direct call to a subprogram of the RCI
+ * {<AI12-0031-1AI12-0031-1>} A direct call to a subprogram of the RCI
unit from outside the declarative region of the unit;
19.2/4
- * {AI12-0031-1AI12-0031-1} An indirect call through a remote
+ * {<AI12-0031-1AI12-0031-1>} An indirect call through a remote
access-to-subprogram value that designates a subprogram of the RCI
unit;
19.3/4
- * {AI12-0031-1AI12-0031-1} A dispatching call with a controlling
+ * {<AI12-0031-1AI12-0031-1>} A dispatching call with a controlling
operand designated by a remote access-to-class-wide value whose tag
identifies a type declared in the RCI unit.
19.a/4
- Discussion: {8652/00788652/0078} {AI95-00048-01AI95-00048-01}
- {AI05-0229-1AI05-0229-1} {AI12-0031-1AI12-0031-1} When this
- aspect is False (or not used), it is presumed that most
- implementations will not make calls through the PCS if the
- call originates in the same partition as that of the RCI unit.
- When this aspect is True, all indirect or dispatching remote
- subprogram calls to the RCI unit and all direct calls from
- outside the subsystem rooted at the RCI unit are treated like
- calls from outside the partition, ensuring that the PCS is
- involved in all such calls (for debugging, redundancy, etc.).
+ Discussion: {<8652/00788652/0078>}
+ {<AI95-00048-01AI95-00048-01>} {<AI05-0229-1AI05-0229-1>}
+ {<AI12-0031-1AI12-0031-1>} When this aspect is False (or not
+ used), it is presumed that most implementations will not make
+ calls through the PCS if the call originates in the same
+ partition as that of the RCI unit. When this aspect is True,
+ all indirect or dispatching remote subprogram calls to the RCI
+ unit and all direct calls from outside the subsystem rooted at
+ the RCI unit are treated like calls from outside the
+ partition, ensuring that the PCS is involved in all such calls
+ (for debugging, redundancy, etc.).
19.b/4
- Reason: {AI12-0031-1AI12-0031-1} There is no point to force
+ Reason: {<AI12-0031-1AI12-0031-1>} There is no point to force
local direct calls (including calls from children) to go
through the PCS, since on the target system these calls are
always local, and all the units are in the same active
@@ -110316,7 +110706,7 @@ Partition Communication Subsystem (PCS); see *note
E.5:::
_Implementation Permissions_
20/3
-{AI05-0243-1AI05-0243-1} An implementation need not support the
+{<AI05-0243-1AI05-0243-1>} An implementation need not support the
Remote_Call_Interface pragma or aspect nor the All_Calls_Remote pragma.
[Explicit message-based communication between active partitions can be
supported as an alternative to RPC.]
@@ -110329,7 +110719,7 @@ supported as an alternative to RPC.]
_Incompatibilities With Ada 95_
20.b/3
- {AI95-00240-01AI95-00240-01} {AI05-0248-1AI05-0248-1}
+ {<AI95-00240-01AI95-00240-01>} {<AI05-0248-1AI05-0248-1>}
Amendment Correction: The wording was changed from
"user-specified" to "available" read and write attributes.
(This was then further changed, see below.) This means that a
@@ -110344,13 +110734,13 @@ supported as an alternative to RPC.]
_Wording Changes from Ada 95_
20.c/2
- {8652/00788652/0078} {AI95-00048-01AI95-00048-01} Corrigendum:
- Changed the wording to allow a library subprogram to be a
- remote call interface unit.
+ {<8652/00788652/0078>} {<AI95-00048-01AI95-00048-01>}
+ Corrigendum: Changed the wording to allow a library subprogram
+ to be a remote call interface unit.
20.d/2
- {AI95-00366-01AI95-00366-01} Changed the wording to use the
- newly defined term type that supports external streaming, so
+ {<AI95-00366-01AI95-00366-01>} Changed the wording to use the
+ newly defined term <type that supports external streaming>, so
that various issues with access types in pure units and
implicitly declared attributes for type extensions are
properly handled.
@@ -110358,7 +110748,7 @@ supported as an alternative to RPC.]
_Incompatibilities With Ada 2005_
20.e/3
- {AI05-0101-1AI05-0101-1} Correction: Added a rule to ensure
+ {<AI05-0101-1AI05-0101-1>} Correction: Added a rule to ensure
that function results are streamable; this was missing in
previous versions of Ada. While programs that returned
unstreamable types from RCI functions were legal, it is not
@@ -110369,18 +110759,18 @@ supported as an alternative to RPC.]
_Extensions to Ada 2005_
20.f/3
- {AI05-0206-1AI05-0206-1} Added wording to allow private withs
- of preelaborated normal units in the specification of a remote
- call interface unit.
+ {<AI05-0206-1AI05-0206-1>} Added wording to allow private
+ withs of preelaborated normal units in the specification of a
+ remote call interface unit.
20.g/3
- {AI05-0229-1AI05-0229-1} All_Calls_Remote is now a
+ {<AI05-0229-1AI05-0229-1>} All_Calls_Remote is now a
representation aspect, so it can be specified by an
aspect_specification -- although the pragma is still preferred
by the Standard.
20.h/3
- {AI05-0243-1AI05-0243-1} Remote_Call_Interface is now a
+ {<AI05-0243-1AI05-0243-1>} Remote_Call_Interface is now a
categorization aspect, so it can be specified by an
aspect_specification -- although the pragma is still preferred
by the Standard.
@@ -110388,10 +110778,10 @@ supported as an alternative to RPC.]
_Inconsistencies With Ada 2012_
20.i/4
- {AI12-0031-1AI12-0031-1} Corrigendum: Redefined when indirect
- and dispatching remote calls have to be remote for a unit for
- which the aspect All_Calls_Remote is True. With the new
- rules, a local target called indirectly or via dispatching
+ {<AI12-0031-1AI12-0031-1>} Corrigendum: Redefined when
+ indirect and dispatching remote calls have to be remote for a
+ unit for which the aspect All_Calls_Remote is True. With the
+ new rules, a local target called indirectly or via dispatching
will be routed through the PCS, while that was not necessarily
true in earlier Ada. If a program depended on local targets
not being routed through the PCS even when All_Calls_Remote is
@@ -110407,14 +110797,14 @@ E.3 Consistency of a Distributed System
=======================================
1/3
-{AI05-0299-1AI05-0299-1} [This subclause defines attributes and rules
+{<AI05-0299-1AI05-0299-1>} [This subclause defines attributes and rules
associated with verifying the consistency of a distributed program.]
_Language Design Principles_
1.a/3
- {AI05-0248-1AI05-0248-1} The rules guarantee that remote call
- interface and shared passive library units are consistent
+ {<AI05-0248-1AI05-0248-1>} The rules guarantee that remote
+ call interface and shared passive library units are consistent
among all partitions prior to the execution of a distributed
program, so that the semantics of the distributed program are
well defined.
@@ -110439,19 +110829,19 @@ P'Body_Version
unit.
5/1
-{8652/00848652/0084} {AI95-00104-01AI95-00104-01} The version of a
+{<8652/00848652/0084>} {<AI95-00104-01AI95-00104-01>} The <version> of a
compilation unit changes whenever the compilation unit changes in a
semantically significant way. This International Standard does not
define the exact meaning of "semantically significant". It is
unspecified whether there are other events (such as recompilation) that
-result in the version of a compilation unit changing.
+result in the version of a compilation unit changing.
5.a/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
5.1/1
-{8652/00848652/0084} {AI95-00104-01AI95-00104-01} If P is not a library
-unit, and P has no completion, then P'Body_Version returns the
+{<8652/00848652/0084>} {<AI95-00104-01AI95-00104-01>} If P is not a
+library unit, and P has no completion, then P'Body_Version returns the
Body_Version of the innermost program unit enclosing the declaration of
P. If P is a library unit, and P has no completion, then P'Body_Version
returns a value that is different from Body_Version of any version of P
@@ -110460,13 +110850,12 @@ that has a completion.
_Bounded (Run-Time) Errors_
6
-In a distributed program, a library unit is consistent if the same
+In a distributed program, a library unit is <consistent> if the same
version of its declaration is used throughout. It is a bounded error to
elaborate a partition of a distributed program that contains a
compilation unit that depends on a different version of the declaration
of a shared passive or RCI library unit than that included in the
-partition to which the shared passive or RCI library unit was assigned.
-As a result of this error, Program_Error can be raised in one or both
+partition to which the shared passive or RCI library unit was assigned.As a
result of this error, Program_Error can be raised in one or both
partitions during elaboration; in any case, the partitions become
inaccessible to one another.
@@ -110494,8 +110883,9 @@ inaccessible to one another.
_Wording Changes from Ada 95_
6.c/2
- {8652/00848652/0084} {AI95-00104-01AI95-00104-01} Corrigendum:
- Clarified the meaning of 'Version and 'Body_Version.
+ {<8652/00848652/0084>} {<AI95-00104-01AI95-00104-01>}
+ Corrigendum: Clarified the meaning of 'Version and
+ 'Body_Version.
File: aarm2012.info, Node: E.4, Next: E.5, Prev: E.3, Up: Annex E
@@ -110504,13 +110894,13 @@ E.4 Remote Subprogram Calls
===========================
1
-A remote subprogram call is a subprogram call that invokes the execution
-of a subprogram in another partition. The partition that originates the
-remote subprogram call is the calling partition, and the partition that
-executes the corresponding subprogram body is the called partition.
-Some remote procedure calls are allowed to return prior to the
-completion of subprogram execution. These are called asynchronous
-remote procedure calls.
+A <remote subprogram call> is a subprogram call that invokes the
+execution of a subprogram in another partition. The partition that
+originates the remote subprogram call is the <calling partition>, and
+the partition that executes the corresponding subprogram body is the
+<called partition>. Some remote procedure calls are allowed to return
+prior to the completion of subprogram execution. These are called
+<asynchronous remote procedure calls>.
2
There are three different ways of performing a remote subprogram call:
@@ -110528,15 +110918,15 @@ There are three different ways of performing a
remote subprogram call:
value of a remote access-to-class-wide type.
6
-The first way of calling corresponds to a static binding between the
+The first way of calling corresponds to a <static> binding between the
calling and the called partition. The latter two ways correspond to a
-dynamic binding between the calling and the called partition.
+<dynamic> binding between the calling and the called partition.
7/3
-{AI05-0101-1AI05-0101-1} Remote types library units (see *note E.2.2::)
-and remote call interface library units (see *note E.2.3::) define the
-remote subprograms or remote access types used for remote subprogram
-calls.
+{<AI05-0101-1AI05-0101-1>} Remote types library units (see *note
+E.2.2::) and remote call interface library units (see *note E.2.3::)
+define the remote subprograms or remote access types used for remote
+subprogram calls.
_Language Design Principles_
@@ -110559,26 +110949,26 @@ access-to-class-wide type, then all shall be.
For the execution of a remote subprogram call, subprogram parameters
(and later the results, if any) are passed using a stream-oriented
representation (see *note 13.13.1::) [which is suitable for transmission
-between partitions]. This action is called marshalling. Unmarshalling
-is the reverse action of reconstructing the parameters or results from
-the stream-oriented representation. [Marshalling is performed initially
-as part of the remote subprogram call in the calling partition;
-unmarshalling is done in the called partition. After the remote
-subprogram completes, marshalling is performed in the called partition,
-and finally unmarshalling is done in the calling partition.]
+between partitions]. This action is called <marshalling>.
+<Unmarshalling> is the reverse action of reconstructing the parameters
+or results from the stream-oriented representation. [Marshalling is
+performed initially as part of the remote subprogram call in the calling
+partition; unmarshalling is done in the called partition. After the
+remote subprogram completes, marshalling is performed in the called
+partition, and finally unmarshalling is done in the calling partition.]
10
-A calling stub is the sequence of code that replaces the subprogram body
-of a remotely called subprogram in the calling partition. A receiving
-stub is the sequence of code (the "wrapper") that receives a remote
-subprogram call on the called partition and invokes the appropriate
-subprogram body.
+A <calling stub> is the sequence of code that replaces the subprogram
+body of a remotely called subprogram in the calling partition. A
+<receiving stub> is the sequence of code (the "wrapper") that receives a
+remote subprogram call on the called partition and invokes the
+appropriate subprogram body.
10.a
- Discussion: The use of the term stub in this annex should not
- be confused with body_stub as defined in *note 10.1.3::. The
- term stub is used here because it is a commonly understood
- term when talking about the RPC paradigm.
+ Discussion: The use of the term <stub> in this annex should
+ not be confused with body_stub as defined in *note 10.1.3::.
+ The term <stub> is used here because it is a commonly
+ understood term when talking about the RPC paradigm.
11
Remote subprogram calls are executed at most once, that is, if the
@@ -110593,7 +110983,7 @@ before the procedure in the called partition returns.
13
If a construct containing a remote call is aborted, the remote
-subprogram call is cancelled. Whether the execution of the remote
+subprogram call is <cancelled>. Whether the execution of the remote
subprogram is immediately aborted as a result of the cancellation is
implementation defined.
@@ -110629,22 +111019,24 @@ All forms of remote subprogram calls are
potentially blocking operations
availability of shared resources to initiate the remote call.
18/1
-{8652/00858652/0085} {AI95-00215-01AI95-00215-01} In a remote subprogram
-call with a formal parameter of a class-wide type, a check is made that
-the tag of the actual parameter identifies a tagged type declared in a
-declared-pure or shared passive library unit, or in the visible part of
-a remote types or remote call interface library unit. Program_Error is
-raised if this check fails. In a remote function call which returns a
-class-wide type, the same check is made on the function result.
+{<8652/00858652/0085>} {<AI95-00215-01AI95-00215-01>} In a remote
+subprogram call with a formal parameter of a class-wide type, a check is
+made that the tag of the actual parameter identifies a tagged type
+declared in a declared-pure or shared passive library unit, or in the
+visible part of a remote types or remote call interface library unit.
+Program_Error is raised if this check fails. In a remote function call
+which returns a class-wide type, the same check is made on the function
+result.
18.a/1
- Discussion: {8652/00858652/0085} {AI95-00215-01AI95-00215-01}
- This check makes certain that the specific type passed or
- returned in an RPC satisfies the rules for a "communicable"
- type. Normally this is guaranteed by the compile-time
- restrictions on remote call interfaces. However, with
- class-wide types, it is possible to pass an object whose tag
- identifies a type declared outside the "safe" packages.
+ Discussion: {<8652/00858652/0085>}
+ {<AI95-00215-01AI95-00215-01>} This check makes certain that
+ the specific type passed or returned in an RPC satisfies the
+ rules for a "communicable" type. Normally this is guaranteed
+ by the compile-time restrictions on remote call interfaces.
+ However, with class-wide types, it is possible to pass an
+ object whose tag identifies a type declared outside the "safe"
+ packages.
18.b
This is considered an accessibility_check since only the types
@@ -110669,7 +111061,7 @@ designated by values of a remote access-to-class-wide
type, a check is
made [(in addition to the normal Tag_Check -- see *note 11.5::)] that
all the remote access-to-class-wide values originated from Access
attribute_references that were evaluated by tasks of the same active
-partition. Constraint_Error is raised if this check fails.
+partition. Constraint_Error is raised if this check fails.
19.a
Implementation Note: When a remote access-to-class-wide value
@@ -110725,21 +111117,21 @@ corresponding receiving stub shall be invoked by
the RPC-receiver.
in out parameters of the call.
20.g/3
- * {AI05-0229-1AI05-0229-1} It allocates (or reuses) a
+ * {<AI05-0229-1AI05-0229-1>} It allocates (or reuses) a
stream for the Result, unless an aspect Asynchronous is
specified as True for the procedure.
20.h/3
- * {AI05-0229-1AI05-0229-1} It calls Do_RPC unless an aspect
- Asynchronous is specified as True for the procedure in
- which case it calls Do_APC. An access value designating
- the message stream allocated and initialized above is
- passed as the Params parameter. An access value
+ * {<AI05-0229-1AI05-0229-1>} It calls Do_RPC unless an
+ aspect Asynchronous is specified as True for the
+ procedure in which case it calls Do_APC. An access value
+ designating the message stream allocated and initialized
+ above is passed as the Params parameter. An access value
designating the Result stream is passed as the Result
parameter.
20.i/3
- * {AI05-0229-1AI05-0229-1} If the aspect Asynchronous is
+ * {<AI05-0229-1AI05-0229-1>} If the aspect Asynchronous is
not specified for the procedure, Do_RPC blocks until a
reply message arrives, and then returns to the calling
stub. The stub returns after extracting from the Result
@@ -110834,11 +111226,11 @@ corresponding receiving stub shall be invoked by
the RPC-receiver.
controlling operands are checked for equality (a
Constraint_Error is raised if this check fails). The
partition ID value is used for the Partition parameter. An
- index into the tagged-type-descriptor is created. This index
- points to the receiving stub of the class-wide operation.
- This index and the index to the table (described above) are
- written to the stream. Then, the actual parameters are
- marshalled into the message stream. For a controlling
+ index into the <tagged-type-descriptor> is created. This
+ index points to the receiving stub of the class-wide
+ operation. This index and the index to the table (described
+ above) are written to the stream. Then, the actual parameters
+ are marshalled into the message stream. For a controlling
operand, only the access value designating the remote object
is required (the other two components are already present in
the other parameters).
@@ -110848,18 +111240,18 @@ corresponding receiving stub shall be invoked by
the RPC-receiver.
transferred control to the appropriate receiving stub) the
parameters are first unmarshalled. Then, the tags of the
controlling operands (obtained by dereferencing the pointer to
- the object) are checked for equality. If the check fails
+ the object) are checked for equality. If the check fails
Constraint_Error is raised and propagated back to the calling
partition, unless it is a result of an asynchronous call.
Finally, a dispatching call to the specific subprogram (based
on the controlling object's tag) is made. Note that since
this subprogram is not in an RCI package, no specific stub is
- generated for it, it is called normally from the dispatching
- stub.
+ generated for it, it is called normally from the <dispatching
+ stub>.
20.1/1
-{8652/00868652/0086} {AI95-00159-01AI95-00159-01} With respect to shared
-variables in shared passive library units, the execution of the
+{<8652/00868652/0086>} {<AI95-00159-01AI95-00159-01>} With respect to
+shared variables in shared passive library units, the execution of the
corresponding subprogram body of a synchronous remote procedure call is
considered to be part of the execution of the calling task. The
execution of the corresponding subprogram body of an asynchronous remote
@@ -110888,19 +111280,20 @@ signal the next action of the calling task (see
*note 9.10::).
_Wording Changes from Ada 95_
22.b/2
- {8652/00868652/0086} {AI95-00159-01AI95-00159-01} Corrigendum:
- Added rules so that tasks can safely access shared passive
- objects.
+ {<8652/00868652/0086>} {<AI95-00159-01AI95-00159-01>}
+ Corrigendum: Added rules so that tasks can safely access
+ shared passive objects.
22.c/2
- {8652/00858652/0085} {AI95-00215-01AI95-00215-01} Corrigendum:
- Clarified that the check on class-wide types also applies to
- values returned from remote subprogram call functions.
+ {<8652/00858652/0085>} {<AI95-00215-01AI95-00215-01>}
+ Corrigendum: Clarified that the check on class-wide types also
+ applies to values returned from remote subprogram call
+ functions.
_Wording Changes from Ada 2005_
22.d/3
- {AI05-0101-1AI05-0101-1} Correction: Corrected the text to
+ {<AI05-0101-1AI05-0101-1>} Correction: Corrected the text to
note that remote access types can be defined in remote types
units.
@@ -110916,17 +111309,17 @@ E.4.1 Asynchronous Remote Calls
-------------------------------
1/3
-{AI05-0229-1AI05-0229-1} [This subclause introduces the aspect
+{<AI05-0229-1AI05-0229-1>} [This subclause introduces the aspect
Asynchronous which can be specified to allow a remote subprogram call to
return prior to completion of the execution of the corresponding remote
subprogram body.]
-Paragraphs 2 through 7 were deleted.
+<Paragraphs 2 through 7 were deleted.>
_Static Semantics_
8/3
-{AI05-0229-1AI05-0229-1} For a remote procedure, the following
+{<AI05-0229-1AI05-0229-1>} For a remote procedure, the following
language-defined representation aspect may be specified:
8.1/3
@@ -110941,7 +111334,7 @@ Asynchronous
call to return.
8.2/3
-{AI05-0229-1AI05-0229-1} For a remote access type, the following
+{<AI05-0229-1AI05-0229-1>} For a remote access type, the following
language-defined representation aspect may be specified:
8.3/3
@@ -110954,12 +111347,12 @@ Asynchronous
_Legality Rules_
8.4/3
-{AI05-0229-1AI05-0229-1} If aspect Asynchronous is specified for a
+{<AI05-0229-1AI05-0229-1>} If aspect Asynchronous is specified for a
remote procedure, the formal parameters of the procedure shall all be of
mode in.
8.5/3
-{AI05-0229-1AI05-0229-1} If aspect Asynchronous is specified for a
+{<AI05-0229-1AI05-0229-1>} If aspect Asynchronous is specified for a
remote access type, the type shall be a remote access-to-class-wide
type, or the type shall be a remote access-to-procedure type with the
formal parameters of the designated profile of the type all of mode in.
@@ -110967,8 +111360,8 @@ formal parameters of the designated profile of the
type all of mode in.
_Dynamic Semantics_
9/3
-{AI05-0229-1AI05-0229-1} A remote call is asynchronous if it is a call
-to a procedure, or a call through a value of an access-to-procedure
+{<AI05-0229-1AI05-0229-1>} A remote call is <asynchronous> if it is a
+call to a procedure, or a call through a value of an access-to-procedure
type, for which aspect Asynchronous is True. In addition, if aspect
Asynchronous is True for a remote access-to-class-wide type, then a
dispatching call on a procedure with a controlling operand designated by
@@ -110988,7 +111381,7 @@ corresponding body executes at most once as a result
of the call.
_Extensions to Ada 2005_
10.b/3
- {AI05-0229-1AI05-0229-1} Aspect Asynchronous is new; pragma
+ {<AI05-0229-1AI05-0229-1>} Aspect Asynchronous is new; pragma
Asynchronous is now obsolescent.
@@ -111000,18 +111393,18 @@ E.4.2 Example of Use of a Remote
Access-to-Class-Wide Type
_Examples_
1
-Example of using a remote access-to-class-wide type to achieve dynamic
-binding across active partitions:
+<Example of using a remote access-to-class-wide type to achieve dynamic
+binding across active partitions:>
2
package Tapes is
pragma Pure(Tapes);
type Tape is abstract tagged limited private;
- -- Primitive dispatching operations where
- -- Tape is controlling operand
+ <-- Primitive dispatching operations where>
+ <-- Tape is controlling operand>
procedure Copy (From, To : access Tape; Num_Recs : in Natural) is
abstract;
procedure Rewind (T : access Tape) is abstract;
- -- More operations
+ <-- More operations>
private
type Tape is ...
end Tapes;
@@ -111020,20 +111413,20 @@ binding across active partitions:
with Tapes;
package Name_Server is
pragma Remote_Call_Interface;
- -- Dynamic binding to remote operations is achieved
- -- using the access-to-limited-class-wide type Tape_Ptr
+ <-- Dynamic binding to remote operations is achieved>
+ <-- using the access-to-limited-class-wide type Tape_Ptr>
type Tape_Ptr is access all Tapes.Tape'Class;
- -- The following statically bound remote operations
- -- allow for a name-server capability in this example
+ <-- The following statically bound remote operations>
+ <-- allow for a name-server capability in this example>
function Find (Name : String) return Tape_Ptr;
procedure Register (Name : in String; T : in Tape_Ptr);
procedure Remove (T : in Tape_Ptr);
- -- More operations
+ <-- More operations>
end Name_Server;
4
package Tape_Driver is
- -- Declarations are not shown, they are irrelevant here
+ <-- Declarations are not shown, they are irrelevant here>
end Tape_Driver;
5
@@ -111049,8 +111442,8 @@ binding across active partitions:
begin
. . .
end Rewind;
- -- Objects remotely accessible through use
- -- of Name_Server operations
+ <-- Objects remotely accessible through use>
+ <-- of Name_Server operations>
Tape1, Tape2 : aliased New_Tape;
begin
Name_Server.Register ("NINE-TRACK", Tape1'Access);
@@ -111059,7 +111452,7 @@ binding across active partitions:
6
with Tapes, Name_Server;
- -- Tape_Driver is not needed and thus not mentioned in the with_clause
+ <-- Tape_Driver is not needed and thus not mentioned in the with_clause>
procedure Tape_Client is
T1, T2 : Name_Server.Tape_Ptr;
begin
@@ -111071,7 +111464,7 @@ binding across active partitions:
end Tape_Client;
7
-Notes on the example:
+<Notes on the example>:
7.a
Discussion: The example does not show the case where tapes are
@@ -111082,7 +111475,7 @@ Notes on the example:
them about the availability of the tapes in the system.
8/1
-This paragraph was deleted.
+<This paragraph was deleted.>
9
* The package Tapes provides the necessary declarations of the type
@@ -111123,7 +111516,7 @@ E.5 Partition Communication Subsystem
=====================================
1/2
-{AI95-00273-01AI95-00273-01} [The Partition Communication Subsystem
+{<AI95-00273-01AI95-00273-01>} [The <Partition Communication Subsystem>
(PCS) provides facilities for supporting communication between the
active partitions of a distributed program. The package System.RPC is a
language-defined interface to the PCS.]
@@ -111138,11 +111531,11 @@ language-defined interface to the PCS.]
The following language-defined library package exists:
3
- with Ada.Streams; -- see *note 13.13.1::
+ with Ada.Streams; <-- see *note 13.13.1::>
package System.RPC is
4
- type Partition_Id is range 0 .. implementation-defined;
+ type Partition_Id is range 0 .. <implementation-defined>;
5
Communication_Error : exception;
@@ -111164,20 +111557,20 @@ The following language-defined library package
exists:
Item : in Ada.Streams.Stream_Element_Array);
9
- -- Synchronous call
+ <-- Synchronous call>
procedure Do_RPC(
Partition : in Partition_Id;
Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
10
- -- Asynchronous call
+ <-- Asynchronous call>
procedure Do_APC(
Partition : in Partition_Id;
Params : access Params_Stream_Type);
11
- -- The handler for incoming RPCs
+ <-- The handler for incoming RPCs>
type RPC_Receiver is access procedure(
Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
@@ -111189,7 +111582,7 @@ The following language-defined library package exists:
13
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.RPC;
14
@@ -111246,11 +111639,11 @@ Do_RPC contains the reply message.
21
The procedure System.RPC.Establish_RPC_Receiver is called once,
immediately after elaborating the library units of an active partition
-(that is, right after the elaboration of the partition) if the partition
-includes an RCI library unit, but prior to invoking the main subprogram,
-if any. The Partition parameter is the Partition_Id of the active
-partition being elaborated. The Receiver parameter designates an
-implementation-provided procedure called the RPC-receiver which will
+(that is, right after the <elaboration of the partition>) if the
+partition includes an RCI library unit, but prior to invoking the main
+subprogram, if any. The Partition parameter is the Partition_Id of the
+active partition being elaborated. The Receiver parameter designates an
+implementation-provided procedure called the <RPC-receiver> which will
handle all RPCs received by the partition from the PCS.
Establish_RPC_Receiver saves a reference to the RPC-receiver; when a
message is received at the called partition, the RPC-receiver is called
@@ -111305,7 +111698,7 @@ remote subprogram calls into the partition].
concurrent calls on the RPC-receiver.
24.1/1
-{8652/00878652/0087} {AI95-00082-01AI95-00082-01} An implementation
+{<8652/00878652/0087>} {<AI95-00082-01AI95-00082-01>} An implementation
shall not restrict the replacement of the body of System.RPC. An
implementation shall not restrict children of System.RPC. [The related
implementation permissions in the introduction to Annex A do not apply.]
@@ -111318,18 +111711,18 @@ implementation permissions in the introduction to
Annex A do not apply.]
requirement overrides that permission for System.RPC.
24.2/1
-{8652/00878652/0087} {AI95-00082-01AI95-00082-01} If the implementation
-of System.RPC is provided by the user, an implementation shall support
-remote subprogram calls as specified.
+{<8652/00878652/0087>} {<AI95-00082-01AI95-00082-01>} If the
+implementation of System.RPC is provided by the user, an implementation
+shall support remote subprogram calls as specified.
24.b/2
- Discussion: {AI95-00273-01AI95-00273-01} If the implementation
- takes advantage of the implementation permission to use a
- different specification for System.RPC, it still needs to use
- it for remote subprogram calls, and allow the user to replace
- the body of System.RPC. It just isn't guaranteed to be
- portable to do so in Ada 2005 - an advantage which was more
- theoretical than real anyway.
+ Discussion: {<AI95-00273-01AI95-00273-01>} If the
+ implementation takes advantage of the implementation
+ permission to use a different specification for System.RPC, it
+ still needs to use it for remote subprogram calls, and allow
+ the user to replace the body of System.RPC. It just isn't
+ guaranteed to be portable to do so in Ada 2005 - an advantage
+ which was more theoretical than real anyway.
_Documentation Requirements_
@@ -111340,7 +111733,7 @@ of such tasks, this limit shall be documented as
well, together with the
mechanisms to configure it (if this is supported).
25.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
25.a.1/2
Documentation Requirement: Whether the RPC-receiver is invoked
@@ -111373,7 +111766,7 @@ implementation.
acquire one, appropriate for the target environment.
27.1/3
-{AI95-00273-01AI95-00273-01} {AI05-0299-1AI05-0299-1} An alternative
+{<AI95-00273-01AI95-00273-01>} {<AI05-0299-1AI05-0299-1>} An alternative
declaration is allowed for package System.RPC as long as it provides a
set of operations that is substantially equivalent to the specification
defined in this subclause.
@@ -111401,7 +111794,7 @@ defined in this subclause.
idea, why should anyone believe that the former is?
27.d/3
- {AI05-0299-1AI05-0299-1} Therefore, this subclause is made
+ {<AI05-0299-1AI05-0299-1>} Therefore, this subclause is made
optional. We considered deleting the subclause outright, but
we still require that users may replace the package (whatever
its interface). Also, it still provides a useful guide to the
@@ -111452,7 +111845,7 @@ stream.
_Incompatibilities With Ada 95_
30.a/2
- {AI95-00273-01AI95-00273-01} The specification of System.RPC
+ {<AI95-00273-01AI95-00273-01>} The specification of System.RPC
can now be tailored for an implementation. If a program
replaces the body of System.RPC with a user-defined body, it
might not compile in a given implementation of Ada 2005 (if
@@ -111461,8 +111854,8 @@ stream.
_Wording Changes from Ada 95_
30.b/2
- {8652/00878652/0087} {AI95-00082-01AI95-00082-01} Corrigendum:
- Clarified that the user can replace System.RPC.
+ {<8652/00878652/0087>} {<AI95-00082-01AI95-00082-01>}
+ Corrigendum: Clarified that the user can replace System.RPC.
File: aarm2012.info, Node: Annex F, Next: Annex G, Prev: Annex E, Up: Top
@@ -111484,13 +111877,13 @@ programming. These fall into several categories:
procedure for decimal division; and
4/2
- * {AI95-00285-01AI95-00285-01} the child packages Text_IO.Editing,
+ * {<AI95-00285-01AI95-00285-01>} the child packages Text_IO.Editing,
Wide_Text_IO.Editing, and Wide_Wide_Text_IO.Editing, which support
formatted and localized output of decimal data, based on "picture
String" values.
5/2
-{AI95-00434-01AI95-00434-01} See also: *note 3.5.9::, "*note 3.5.9::
+{<AI95-00434-01AI95-00434-01>} See also: *note 3.5.9::, "*note 3.5.9::
Fixed Point Types"; *note 3.5.10::, "*note 3.5.10:: Operations of Fixed
Point Types"; *note 4.6::, "*note 4.6:: Type Conversions"; *note 13.3::,
"*note 13.3:: Operational and Representation Attributes"; *note
@@ -111506,13 +111899,13 @@ Information Systems.
_Implementation Advice_
7/3
-{AI05-0229-1AI05-0229-1} If COBOL (respectively, C) is widely supported
-in the target environment, implementations supporting the Information
-Systems Annex should provide the child package Interfaces.COBOL
-(respectively, Interfaces.C) specified in *note Annex B:: and should
-support a convention_identifier of COBOL (respectively, C) for the
-Convention aspect (see *note Annex B::), thus allowing Ada programs to
-interface with programs written in that language.
+{<AI05-0229-1AI05-0229-1>} If COBOL (respectively, C) is widely
+supported in the target environment, implementations supporting the
+Information Systems Annex should provide the child package
+Interfaces.COBOL (respectively, Interfaces.C) specified in *note Annex
+B:: and should support a <convention_>identifier of COBOL (respectively,
+C) for the Convention aspect (see *note Annex B::), thus allowing Ada
+programs to interface with programs written in that language.
7.a/2
Implementation Advice: If COBOL (respectively, C) is supported
@@ -111528,7 +111921,7 @@ interface with programs written in that language.
_Wording Changes from Ada 95_
7.c/2
- {AI95-00285-01AI95-00285-01} Added a mention of
+ {<AI95-00285-01AI95-00285-01>} Added a mention of
Wide_Wide_Text_IO.Editing, part of the support for 32-bit
characters.
@@ -111568,11 +111961,11 @@ of subtype S when S'Machine_Radix = 10.
2.a/2
Implementation Advice: Packed decimal should be used as the
- internal representation for objects of subtype S when
- S'Machine_Radix = 10.
+ internal representation for objects of subtype <S> when
+ <S>'Machine_Radix = 10.
2.b/3
- Discussion: {AI05-0229-1AI05-0229-1} The intent of a decimal
+ Discussion: {<AI05-0229-1AI05-0229-1>} The intent of a decimal
Machine_Radix attribute definition clause is to allow the
programmer to declare an Ada decimal data object whose
representation matches a particular COBOL implementation's
@@ -111590,7 +111983,7 @@ of subtype S when S'Machine_Radix = 10.
_Examples_
3
-Example of Machine_Radix attribute definition clause:
+<Example of Machine_Radix attribute definition clause:>
4
type Money is delta 0.01 digits 15;
@@ -111612,18 +112005,18 @@ The library package Decimal has the following
declaration:
pragma Pure(Decimal);
3
- Max_Scale : constant := implementation-defined;
- Min_Scale : constant := implementation-defined;
+ Max_Scale : constant := <implementation-defined>;
+ Min_Scale : constant := <implementation-defined>;
4
Min_Delta : constant := 10.0**(-Max_Scale);
Max_Delta : constant := 10.0**(-Min_Scale);
5
- Max_Decimal_Digits : constant := implementation-defined;
+ Max_Decimal_Digits : constant := <implementation-defined>;
6/3
- {AI05-0229-1AI05-0229-1} generic
+ {<AI05-0229-1AI05-0229-1>} generic
type Dividend_Type is delta <> digits <>;
type Divisor_Type is delta <> digits <>;
type Quotient_Type is delta <> digits <>;
@@ -111643,23 +112036,23 @@ The library package Decimal has the following
declaration:
8
Max_Scale is the largest N such that 10.0**(-N) is allowed as a decimal
-type's delta. Its type is universal_integer.
+type's delta. Its type is <universal_integer>.
9
Min_Scale is the smallest N such that 10.0**(-N) is allowed as a decimal
-type's delta. Its type is universal_integer.
+type's delta. Its type is <universal_integer>.
10
-Min_Delta is the smallest value allowed for delta in a
-decimal_fixed_point_definition. Its type is universal_real.
+Min_Delta is the smallest value allowed for <delta> in a
+decimal_fixed_point_definition. Its type is <universal_real>.
11
-Max_Delta is the largest value allowed for delta in a
-decimal_fixed_point_definition. Its type is universal_real.
+Max_Delta is the largest value allowed for <delta> in a
+decimal_fixed_point_definition. Its type is <universal_real>.
12
-Max_Decimal_Digits is the largest value allowed for digits in a
-decimal_fixed_point_definition. Its type is universal_integer.
+Max_Decimal_Digits is the largest value allowed for <digits> in a
+decimal_fixed_point_definition. Its type is <universal_integer>.
12.a
Reason: The name is Max_Decimal_Digits versus Max_Digits, in
@@ -111701,9 +112094,9 @@ F.3 Edited Output for Decimal Types
===================================
1/2
-{AI95-00285-01AI95-00285-01} The child packages Text_IO.Editing,
+{<AI95-00285-01AI95-00285-01>} The child packages Text_IO.Editing,
Wide_Text_IO.Editing, and Wide_Wide_Text_IO.Editing provide localizable
-formatted text output, known as edited output, for decimal types. An
+formatted text output, known as <edited output>, for decimal types. An
edited output string is a function of a numeric value,
program-specifiable locale elements, and a format control value. The
numeric value is of some decimal type. The locale elements are:
@@ -111722,7 +112115,7 @@ numeric value is of some decimal type. The locale
elements are:
value.
6/2
-{AI95-00285-01AI95-00285-01} For Text_IO.Editing the edited output and
+{<AI95-00285-01AI95-00285-01>} For Text_IO.Editing the edited output and
currency strings are of type String, and the locale characters are of
type Character. For Wide_Text_IO.Editing their types are Wide_String
and Wide_Character, respectively. For Wide_Wide_Text_IO.Editing their
@@ -111740,8 +112133,8 @@ decimal digits, the presence or absence of a radix
mark, suppression of
leading zeros, and insertion of particular character values.
9
-A Picture object is composed from a String value, known as a picture
-String, that serves as a template for the edited output string, and a
+A Picture object is composed from a String value, known as a <picture
+String>, that serves as a template for the edited output string, and a
Boolean value that controls whether a string of all space characters is
produced when the number's value is zero. A picture String comprises a
sequence of one- or two-Character symbols, each serving as a placeholder
@@ -111803,7 +112196,7 @@ treated as part of a floating sign, floating
currency, or zero
suppression string.
18/2
-{AI95-00434-01AI95-00434-01} An example of a picture String is
+{<AI95-00434-01AI95-00434-01>} An example of a picture String is
"<###Z_ZZ9.99>". If the currency string is "kr", the separator
character is ',', and the radix mark is '.' then the edited output
string values for the decimal values 32.10 and -5432.10 are
@@ -111811,7 +112204,7 @@ string values for the decimal values 32.10 and
-5432.10 are
the space character.
19/2
-{AI95-00285-01AI95-00285-01} The generic packages Text_IO.Decimal_IO,
+{<AI95-00285-01AI95-00285-01>} The generic packages Text_IO.Decimal_IO,
Wide_Text_IO.Decimal_IO, and Wide_Wide_Text_IO.Decimal_IO (see *note
A.10.9::, "*note A.10.9:: Input-Output for Real Types") provide text
input and nonedited text output for decimal types.
@@ -111819,14 +112212,14 @@ input and nonedited text output for decimal types.
NOTES
20/2
- 2 {AI95-00285-01AI95-00285-01} A picture String is of type
+ 2 {<AI95-00285-01AI95-00285-01>} A picture String is of type
Standard.String, for all of Text_IO.Editing, Wide_Text_IO.Editing,
and Wide_Wide_Text_IO.Editing.
_Wording Changes from Ada 95_
20.a/2
- {AI95-00285-01AI95-00285-01} Added descriptions of
+ {<AI95-00285-01AI95-00285-01>} Added descriptions of
Wide_Wide_Text_IO.Editing; see *note F.3.5::.
* Menu:
@@ -111844,15 +112237,15 @@ F.3.1 Picture String Formation
------------------------------
1/3
-{AI05-0299-1AI05-0299-1} A well-formed picture String, or simply picture
-String, is a String value that conforms to the syntactic rules,
-composition constraints, and character replication conventions specified
-in this subclause.
+{<AI05-0299-1AI05-0299-1>} A <well-formed picture String>, or simply
+<picture String>, is a String value that conforms to the syntactic
+rules, composition constraints, and character replication conventions
+specified in this subclause.
_Dynamic Semantics_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3
picture_string ::=
@@ -112042,8 +112435,8 @@ The following composition constraints apply to a
picture String:
all_sign_number, then it has an occurrence of '>'.
43/1
- * {8652/00888652/0088} {AI95-00153AI95-00153} If a picture String has
- '+' or '-' as fixed_LHS_sign, in a floating_LHS_sign, or in an
+ * {<8652/00888652/0088>} {<AI95-00153AI95-00153>} If a picture String
+ has '+' or '-' as fixed_LHS_sign, in a floating_LHS_sign, or in an
all_sign_number, then it has no RHS_sign or '>' character.
44
@@ -112060,25 +112453,25 @@ The following composition constraints apply to a
picture String:
except for possible case differences between 'Z' and 'z'.
47
-A replicable Character is a Character that, by the above rules, can
+A <replicable Character> is a Character that, by the above rules, can
occur in two consecutive positions in a picture String.
48
-A Character replication is a String
+A <Character replication> is a String
49
- char & '(' & spaces & count_string & ')'
+ <char> & '(' & <spaces> & <count_string> & ')'
50
-where char is a replicable Character, spaces is a String (possibly
-empty) comprising only space Character values, and count_string is a
+where <char> is a replicable Character, <spaces> is a String (possibly
+empty) comprising only space Character values, and <count_string> is a
String of one or more decimal digit Character values. A Character
replication in a picture String has the same effect as (and is said to
-be equivalent to) a String comprising n consecutive occurrences of char,
-where n=Integer'Value(count_string).
+be <equivalent to>) a String comprising <n> consecutive occurrences of
+<char>, where <n>=Integer'Value(<count_string>).
51
-An expanded picture String is a picture String containing no Character
+An <expanded picture String> is a picture String containing no Character
replications.
51.a
@@ -112095,8 +112488,9 @@ replications.
_Wording Changes from Ada 95_
52.a/2
- {8652/00888652/0088} {AI95-00153-01AI95-00153-01} Corrigendum:
- The picture string rules for numbers were tightened.
+ {<8652/00888652/0088>} {<AI95-00153-01AI95-00153-01>}
+ Corrigendum: The picture string rules for numbers were
+ tightened.
File: aarm2012.info, Node: F.3.2, Next: F.3.3, Prev: F.3.1, Up: F.3
@@ -112135,7 +112529,7 @@ The combination of a True value for Blank_When_Zero
and a '*' character
in Pic_String is inconsistent; no edited output string is defined.
9.a/2
- Reason: {AI95-00114-01AI95-00114-01} Such a Pic_String is
+ Reason: {<AI95-00114-01AI95-00114-01>} Such a Pic_String is
invalid, and any attempt to use such a string will raise
Picture_Error.
@@ -112159,7 +112553,7 @@ Pic_String'Length + Currency_Length_Adjustment -
Radix_Adjustment, and
14
Let the magnitude of Item be expressed as a base-10 number
-Ip���I1.F1���Fq, called the displayed magnitude of Item, where:
+Ip���I1.F1���Fq, called the <displayed> <magnitude> of Item, where:
15
* q = Min(Max(Num'Scale, 0), n) where n is 0 if Pic_String has no
@@ -112211,11 +112605,11 @@ An instance of direct_insertion maps to Separator
if direct_insertion =
'_', and to the direct_insertion Character otherwise.
23
-An instance of number maps to a string integer_part & radix_part &
-fraction_part where:
+An instance of number maps to a string <integer_part> & <radix_part> &
+<fraction_part> where:
24
- * The string for integer_part is obtained as follows:
+ * The string for <integer_part> is obtained as follows:
25
1. Occurrences of '9' in fore_digits of number are replaced
@@ -112237,7 +112631,7 @@ fraction_part where:
string is produced.
28
- * The radix_part is:
+ * The <radix_part> is:
29
* "" if number does not include a radix, if radix = 'V', or
@@ -112247,7 +112641,7 @@ fraction_part where:
* Radix_Mark if number includes '.' as radix
31
- * The string for fraction_part is obtained as follows:
+ * The string for <fraction_part> is obtained as follows:
32
1. Occurrences of '9' in aft_digits of number are replaced
@@ -112263,7 +112657,7 @@ An instance of zero_suppression maps to the string
obtained as follows:
35
1. The rightmost 'Z', 'z', or '*' Character values are replaced
- with the excess digits (if any) from the integer_part of the
+ with the excess digits (if any) from the <integer_part> of the
mapping of the number to the right of the zero_suppression
instance,
@@ -112299,8 +112693,8 @@ An instance of floating_LHS_sign maps to the string
obtained as follows.
43
1. Up to all but one of the rightmost LHS_Sign Character values
- are replaced by the excess digits (if any) from the integer_part of
- the mapping of the number to the right of the floating_LHS_sign
+ are replaced by the excess digits (if any) from the <integer_part>
+ of the mapping of the number to the right of the floating_LHS_sign
instance.
44
@@ -112335,7 +112729,7 @@ follows:
50
1. Up to all but one of the rightmost '$' Character values are
- replaced with the excess digits (if any) from the integer_part of
+ replaced with the excess digits (if any) from the <integer_part> of
the mapping of the number to the right of the floating_$_currency
instance.
@@ -112361,7 +112755,7 @@ follows:
56
1. Up to all but one of the rightmost '#' Character values are
- replaced with the excess digits (if any) from the integer_part of
+ replaced with the excess digits (if any) from the <integer_part> of
the mapping of the number to the right of the floating_#_currency
instance.
@@ -112447,14 +112841,14 @@ character.
Item: Picture and Result Strings:
73/3
- {AI05-0248-1AI05-0248-1} 123456.78 Picture: "-###**_***_**9.99"
+ {<AI05-0248-1AI05-0248-1>} 123456.78 Picture: "-###**_***_**9.99"
Result: "bbb$***123,456.78"
"bbFF***123.456,78" (currency = "FF",
separator = '.',
radix mark = ',')
74/1
- {8652/00898652/0089} {AI95-00070AI95-00070} 123456.78 Picture:
"-$**_***_**9.99"
+ {<8652/00898652/0089>} {<AI95-00070AI95-00070>} 123456.78 Picture:
"-$**_***_**9.99"
Result: "b$***123,456.78"
"bFF***123.456,78" (currency = "FF",
separator = '.',
@@ -112479,8 +112873,8 @@ character.
_Wording Changes from Ada 95_
78.a/2
- {8652/00898652/0089} {AI95-00070-01AI95-00070-01} Corrigendum:
- Corrected the picture string example.
+ {<8652/00898652/0089>} {<AI95-00070-01AI95-00070-01>}
+ Corrigendum: Corrected the picture string example.
File: aarm2012.info, Node: F.3.3, Next: F.3.4, Prev: F.3.2, Up: F.3
@@ -112522,7 +112916,7 @@ The library package Text_IO.Editing has the following
declaration:
function Blank_When_Zero (Pic : in Picture) return Boolean;
8
- Max_Picture_Length : constant := implementation_defined;
+ Max_Picture_Length : constant := <implementation_defined>;
9
Picture_Error : exception;
@@ -112589,7 +112983,7 @@ The library package Text_IO.Editing has the following
declaration:
Radix_Mark : in Character := Default_Radix_Mark);
end Decimal_Output;
private
- ... -- not specified by the language
+ ... <-- not specified by the language>
end Ada.Text_IO.Editing;
16.a
@@ -112738,12 +113132,12 @@ the Put procedures is invoked with a null string
for Currency.
Radix_Mark : in Character := Default_Radix_Mark);
44/3
- {AI05-0264-1AI05-0264-1} Put copies Image(Item, Pic, Currency,
- Fill, Separator, Radix_Mark) to the given string, right
- justified. Otherwise, unassigned Character values in To are
- assigned the space character. If To'Length is less than the
- length of the string resulting from Image, then Layout_Error
- is raised.
+ {<AI05-0264-1AI05-0264-1>} Put copies Image(Item, Pic,
+ Currency, Fill, Separator, Radix_Mark) to the given string,
+ right justified. Otherwise, unassigned Character values in To
+ are assigned the space character. If To'Length is less than
+ the length of the string resulting from Image, then
+ Layout_Error is raised.
_Implementation Requirements_
@@ -112869,8 +113263,9 @@ F.3.5 The Package Wide_Wide_Text_IO.Editing
_Static Semantics_
1/2
-{AI95-00285-01AI95-00285-01} The child package Wide_Wide_Text_IO.Editing
-has the same contents as Text_IO.Editing, except that:
+{<AI95-00285-01AI95-00285-01>} The child package
+Wide_Wide_Text_IO.Editing has the same contents as Text_IO.Editing,
+except that:
2/2
* each occurrence of Character is replaced by Wide_Wide_Character,
@@ -112893,7 +113288,7 @@ has the same contents as Text_IO.Editing, except that:
NOTES
6/2
- 6 {AI95-00285-01AI95-00285-01} Each of the functions
+ 6 {<AI95-00285-01AI95-00285-01>} Each of the functions
Wide_Wide_Text_IO.Editing.Valid, To_Picture, and Pic_String has
String (versus Wide_Wide_String) as its parameter or result
subtype, since a picture String is not localizable.
@@ -112901,9 +113296,10 @@ has the same contents as Text_IO.Editing, except
that:
_Extensions to Ada 95_
6.a/2
- {AI95-00285-01AI95-00285-01} Package Wide_Wide_Text_IO.Editing
- is new; it supports 32-bit character strings. (Shouldn't it
- have been "Widest_Text_IO.Editing"? :-)
+ {<AI95-00285-01AI95-00285-01>} Package
+ Wide_Wide_Text_IO.Editing is new; it supports 32-bit character
+ strings. (Shouldn't it have been "Widest_Text_IO.Editing"?
+ :-)
File: aarm2012.info, Node: Annex G, Next: Annex H, Prev: Annex F, Up: Top
@@ -112930,27 +113326,27 @@ The Numerics Annex specifies
not conforming to the Numerics Annex;
5/2
- * {AI95-00296-01AI95-00296-01} models of floating point and fixed
+ * {<AI95-00296-01AI95-00296-01>} models of floating point and fixed
point arithmetic on which the accuracy requirements of strict mode
are based;
6/2
- * {AI95-00296-01AI95-00296-01} the definitions of the model-oriented
- attributes of floating point types that apply in the strict mode;
- and
+ * {<AI95-00296-01AI95-00296-01>} the definitions of the
+ model-oriented attributes of floating point types that apply in the
+ strict mode; and
6.1/2
- * {AI95-00296-01AI95-00296-01} features for the manipulation of real
- and complex vectors and matrices.
+ * {<AI95-00296-01AI95-00296-01>} features for the manipulation of
+ real and complex vectors and matrices.
_Implementation Advice_
7/3
-{AI05-0229-1AI05-0229-1} If Fortran (respectively, C) is widely
+{<AI05-0229-1AI05-0229-1>} If Fortran (respectively, C) is widely
supported in the target environment, implementations supporting the
Numerics Annex should provide the child package Interfaces.Fortran
(respectively, Interfaces.C) specified in *note Annex B:: and should
-support a convention_identifier of Fortran (respectively, C) for the
+support a <convention_>identifier of Fortran (respectively, C) for the
Convention aspect (see *note Annex B::), thus allowing Ada programs to
interface with programs written in that language.
@@ -113020,7 +113416,7 @@ The generic library package
Numerics.Generic_Complex_Types has the
following declaration:
2/1
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01} generic
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>} generic
type Real is digits <>;
package Ada.Numerics.Generic_Complex_Types is
pragma Pure(Generic_Complex_Types);
@@ -113032,7 +113428,7 @@ following declaration:
end record;
4/2
- {AI95-00161-01AI95-00161-01} type Imaginary is private;
+ {<AI95-00161-01AI95-00161-01>} type Imaginary is private;
pragma Preelaborable_Initialization(Imaginary);
5
@@ -113149,10 +113545,10 @@ following declaration:
end Ada.Numerics.Generic_Complex_Types;
25/1
-{8652/00208652/0020} {AI95-00126-01AI95-00126-01} The library package
-Numerics.Complex_Types is declared pure and defines the same types,
-constants, and subprograms as Numerics.Generic_Complex_Types, except
-that the predefined type Float is systematically substituted for
+{<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>} The library
+package Numerics.Complex_Types is declared pure and defines the same
+types, constants, and subprograms as Numerics.Generic_Complex_Types,
+except that the predefined type Float is systematically substituted for
Real'Base throughout. Nongeneric equivalents of
Numerics.Generic_Complex_Types for each of the other predefined floating
point types are defined similarly, with the names
@@ -113173,7 +113569,7 @@ Numerics.Short_Complex_Types,
Numerics.Long_Complex_Types, etc.
by changing a single context clause.
26/2
-{AI95-00434-01AI95-00434-01} [Complex is a visible type with Cartesian
+{<AI95-00434-01AI95-00434-01>} [Complex is a visible type with Cartesian
components.]
26.a
@@ -113194,9 +113590,9 @@ components.]
27.b
* They allow complex "literals" to be written in the
- alternate form of a + b*i (or a + b*j), if desired. Of
- course, in some contexts the sum will need to be
- parenthesized.
+ alternate form of <a> + <b>*i (or <a> + <b>*j), if
+ desired. Of course, in some contexts the sum will need
+ to be parenthesized.
27.c
* When an Ada binding to IEC 559:1989 that provides
@@ -113205,17 +113601,18 @@ components.]
arithmetic between pure-imaginary and complex operands
without requiring the former to be represented as (or
promoted to) complex values with a real component of
- zero. For example, the multiplication of a + b*i by d*i
- should yield -b� d + a� d*i, but if one cannot avoid
- representing the pure-imaginary value d*i as the complex
- value 0.0 + d*i, then a NaN ("Not-a-Number") could be
- produced as the result of multiplying a by 0.0 (e.g.,
- when a is infinite); the NaN could later trigger an
- exception. Providing the Imaginary type and overloadings
- of the arithmetic operators for mixtures of Imaginary and
- Complex operands gives the programmer the same control
- over avoiding premature coercion of pure-imaginary values
- to complex as is already provided for pure-real values.
+ zero. For example, the multiplication of <a> + <b>*i by
+ <d>*i should yield -<b>� <d> + <a>� <d>*i, but if one
+ cannot avoid representing the pure-imaginary value <d>*i
+ as the complex value 0.0 + <d>*i, then a NaN
+ ("Not-a-Number") could be produced as the result of
+ multiplying <a> by 0.0 (e.g., when <a> is infinite); the
+ NaN could later trigger an exception. Providing the
+ Imaginary type and overloadings of the arithmetic
+ operators for mixtures of Imaginary and Complex operands
+ gives the programmer the same control over avoiding
+ premature coercion of pure-imaginary values to complex as
+ is already provided for pure-real values.
27.d
Reason: The Imaginary type is private, rather than being
@@ -113374,8 +113771,8 @@ shall not be affected by any range constraint of the
subtype Real.
42
In the following cases, evaluation of a complex arithmetic operation
-shall yield the prescribed result, provided that the preceding rules do
-not call for an exception to be raised:
+shall yield the <prescribed result>, provided that the preceding rules
+do not call for an exception to be raised:
43
* The results of the Re, Im, and Compose_From_Cartesian functions are
@@ -113409,8 +113806,8 @@ not call for an exception to be raised:
result of zero.
47.a
- Discussion: Argument(X + i*Y) is analogous to EF.Arctan(Y, X),
- where EF is an appropriate instance of
+ Discussion: Argument(X + i*Y) is analogous to <EF>.Arctan(Y,
+ X), where <EF> is an appropriate instance of
Numerics.Generic_Elementary_Functions, except when X and Y are
both zero, in which case the former yields the value zero
while the latter raises Numerics.Argument_Error.
@@ -113468,8 +113865,8 @@ instantiations of the generic package for the
appropriate predefined
type.
55/2
-{8652/00918652/0091} {AI95-00434-01AI95-00434-01} Implementations may
-obtain the result of exponentiation of a complex or pure-imaginary
+{<8652/00918652/0091>} {<AI95-00434-01AI95-00434-01>} Implementations
+may obtain the result of exponentiation of a complex or pure-imaginary
operand by repeated complex multiplication, with arbitrary association
of the factors and with a possible final complex reciprocation (when the
exponent is negative). Implementations are also permitted to obtain the
@@ -113573,16 +113970,16 @@ Modulus parameter has a nonnegative (resp.,
negative) value.
_Extensions to Ada 95_
58.g/2
- {AI95-00161-01AI95-00161-01} Amendment Correction: Added a
+ {<AI95-00161-01AI95-00161-01>} Amendment Correction: Added a
pragma Preelaborable_Initialization to type Imaginary, so that
it can be used in preelaborated units.
_Wording Changes from Ada 95_
58.h/2
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01} Corrigendum:
- Explicitly stated that the nongeneric equivalents of
- Generic_Complex_Types are pure.
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>}
+ Corrigendum: Explicitly stated that the nongeneric equivalents
+ of Generic_Complex_Types are pure.
File: aarm2012.info, Node: G.1.2, Next: G.1.3, Prev: G.1.1, Up: G.1
@@ -113598,7 +113995,7 @@ Numerics.Generic_Complex_Elementary_Functions has the
following
declaration:
2/2
- {AI95-00434-01AI95-00434-01} with Ada.Numerics.Generic_Complex_Types;
+ {<AI95-00434-01AI95-00434-01>} with Ada.Numerics.Generic_Complex_Types;
generic
with package Complex_Types is
new Ada.Numerics.Generic_Complex_Types (<>);
@@ -113643,16 +114040,17 @@ declaration:
end Ada.Numerics.Generic_Complex_Elementary_Functions;
9/1
-{8652/00208652/0020} {AI95-00126-01AI95-00126-01} The library package
-Numerics.Complex_Elementary_Functions is declared pure and defines the
-same subprograms as Numerics.Generic_Complex_Elementary_Functions,
-except that the predefined type Float is systematically substituted for
-Real'Base, and the Complex and Imaginary types exported by
-Numerics.Complex_Types are systematically substituted for Complex and
-Imaginary, throughout. Nongeneric equivalents of
-Numerics.Generic_Complex_Elementary_Functions corresponding to each of
-the other predefined floating point types are defined similarly, with
-the names Numerics.Short_Complex_Elementary_Functions,
+{<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>} The library
+package Numerics.Complex_Elementary_Functions is declared pure and
+defines the same subprograms as
+Numerics.Generic_Complex_Elementary_Functions, except that the
+predefined type Float is systematically substituted for Real'Base, and
+the Complex and Imaginary types exported by Numerics.Complex_Types are
+systematically substituted for Complex and Imaginary, throughout.
+Nongeneric equivalents of Numerics.Generic_Complex_Elementary_Functions
+corresponding to each of the other predefined floating point types are
+defined similarly, with the names
+Numerics.Short_Complex_Elementary_Functions,
Numerics.Long_Complex_Elementary_Functions, etc.
9.a
@@ -113691,20 +114089,20 @@ eliminated by the following conventions:
negative real axis.
15/2
- * {AI95-00185-01AI95-00185-01} The imaginary component of the result
- of the Arcsin, Arccos, and Arctanh functions is discontinuous as
- the parameter X crosses the real axis to the left of -1.0 or the
- right of 1.0.
+ * {<AI95-00185-01AI95-00185-01>} The imaginary component of the
+ result of the Arcsin, Arccos, and Arctanh functions is
+ discontinuous as the parameter X crosses the real axis to the left
+ of -1.0 or the right of 1.0.
16/2
- * {AI95-00185-01AI95-00185-01} The real component of the result of
+ * {<AI95-00185-01AI95-00185-01>} The real component of the result of
the Arctan and Arcsinh functions is discontinuous as the parameter
- X crosses the imaginary axis below -i or above i.
+ X crosses the imaginary axis below -<i> or above <i>.
17/2
- * {AI95-00185-01AI95-00185-01} The real component of the result of
+ * {<AI95-00185-01AI95-00185-01>} The real component of the result of
the Arccot function is discontinuous as the parameter X crosses the
- imaginary axis below -i or above i.
+ imaginary axis below -<i> or above <i>.
18
* The imaginary component of the Arccosh function is discontinuous as
@@ -113716,13 +114114,14 @@ eliminated by the following conventions:
and 1.0.
19.a/2
- Discussion: {AI95-00185-01AI95-00185-01} The branch cuts come
- from the fact that the functions in question are really
+ Discussion: {<AI95-00185-01AI95-00185-01>} The branch cuts
+ come from the fact that the functions in question are really
multi-valued in the complex domain, and that we have to pick
- one principal value to be the result of the function.
+ one <principal value> to be the result of the function.
Evidently we have much freedom in choosing where the branch
cuts lie. However, we are adhering to the following
- principles which seem to lead to the more natural definitions:
+ principles which seem to lead to the more <natural>
+ definitions:
19.b/2
* A branch cut should not intersect the real axis at a
@@ -113741,13 +114140,13 @@ eliminated by the following conventions:
invariant by reflection in the origin.
20/2
-{AI95-00185-01AI95-00185-01} The computed results of the mathematically
-multivalued functions are rendered single-valued by the following
-conventions, which are meant to imply that the principal branch is an
-analytic continuation of the corresponding real-valued function in
-Numerics.Generic_Elementary_Functions. (For Arctan and Arccot, the
-single-argument function in question is that obtained from the
-two-argument version by fixing the second argument to be its default
+{<AI95-00185-01AI95-00185-01>} The computed results of the
+mathematically multivalued functions are rendered single-valued by the
+following conventions, which are meant to imply that the principal
+branch is an analytic continuation of the corresponding real-valued
+function in Numerics.Generic_Elementary_Functions. (For Arctan and
+Arccot, the single-argument function in question is that obtained from
+the two-argument version by fixing the second argument to be its default
value.)
21
@@ -113803,7 +114202,7 @@ cases, provided that
Complex_Types.Real'Machine_Overflows is True:
31
* by the Arctan and Arccot functions, when the value of the parameter
- X is � i;
+ X is � <i>;
32
* by the Arctanh and Arccoth functions, when the value of the
@@ -113811,9 +114210,9 @@ cases, provided that
Complex_Types.Real'Machine_Overflows is True:
33
[Constraint_Error can also be raised when a finite result overflows (see
-*note G.2.6::); this may occur for parameter values sufficiently near
+*note G.2.6::); this may occur for parameter values sufficiently <near>
poles, and, in the case of some of the functions, for parameter values
-having components of sufficiently large magnitude.] When
+having components of sufficiently large magnitude.] When
Complex_Types.Real'Machine_Overflows is False, the result at poles is
unspecified.
@@ -113858,7 +114257,7 @@ subtype Complex_Types.Real.
35
In the following cases, evaluation of a complex elementary function
-shall yield the prescribed result (or a result having the prescribed
+shall yield the <prescribed result> (or a result having the prescribed
component), provided that the preceding rules do not call for an
exception to be raised:
@@ -113879,21 +114278,21 @@ exception to be raised:
the result
39
- * i (resp., -i), when the sign of the imaginary component
- of X is positive (resp., negative), if
+ * <i> (resp., -<i>), when the sign of the imaginary
+ component of X is positive (resp., negative), if
Complex_Types.Real'Signed_Zeros is True;
40
- * i, if Complex_Types.Real'Signed_Zeros is False;
+ * <i>, if Complex_Types.Real'Signed_Zeros is False;
41/2
- * {AI95-00434-01AI95-00434-01} When the parameter X has the value
+ * {<AI95-00434-01AI95-00434-01>} When the parameter X has the value
-1.0, the Log function yields an imaginary result; and the Arcsin
and Arccos functions yield a real result.
42
- * When the parameter X has the value � i, the Log function yields an
- imaginary result.
+ * When the parameter X has the value � <i>, the Log function yields
+ an imaginary result.
43
* Exponentiation by a zero exponent yields the value one.
@@ -113952,11 +114351,11 @@ Similarly, the Sin and Cos (resp., Sinh and Cosh)
functions are allowed
to raise the exception Constraint_Error, signaling overflow, when the
absolute value of the imaginary (resp., real) component of the parameter
X exceeds an unspecified threshold that is approximately
-log(Complex_Types.Real'Safe_Last) + log(2.0). This permission recognizes
-the impracticality of avoiding overflow in the marginal case that the
-hyperbolic sine or cosine of the imaginary (resp., real) component of X
-exceeds the safe range of Complex_Types.Real but both components of the
-final result do not.
+log(Complex_Types.Real'Safe_Last) + log(2.0). This permission
+recognizes the impracticality of avoiding overflow in the marginal case
+that the hyperbolic sine or cosine of the imaginary (resp., real)
+component of X exceeds the safe range of Complex_Types.Real but both
+components of the final result do not.
_Implementation Advice_
@@ -114011,13 +114410,13 @@ negative.
_Wording Changes from Ada 95_
49.g/2
- {8652/00208652/0020} {AI95-00126-01AI95-00126-01} Corrigendum:
- Explicitly stated that the nongeneric equivalents of
- Generic_Complex_Elementary_Functions are pure.
+ {<8652/00208652/0020>} {<AI95-00126-01AI95-00126-01>}
+ Corrigendum: Explicitly stated that the nongeneric equivalents
+ of Generic_Complex_Elementary_Functions are pure.
49.h/2
- {AI95-00185-01AI95-00185-01} Corrected various inconsistencies
- in the definition of the branch cuts.
+ {<AI95-00185-01AI95-00185-01>} Corrected various
+ inconsistencies in the definition of the branch cuts.
File: aarm2012.info, Node: G.1.3, Next: G.1.4, Prev: G.1.2, Up: G.1
@@ -114098,14 +114497,14 @@ declaration:
end Ada.Text_IO.Complex_IO;
9.1/2
-{AI95-00328-01AI95-00328-01} The library package Complex_Text_IO defines
-the same subprograms as Text_IO.Complex_IO, except that the predefined
-type Float is systematically substituted for Real, and the type
-Numerics.Complex_Types.Complex is systematically substituted for Complex
-throughout. Nongeneric equivalents of Text_IO.Complex_IO corresponding
-to each of the other predefined floating point types are defined
-similarly, with the names Short_Complex_Text_IO, Long_Complex_Text_IO,
-etc.
+{<AI95-00328-01AI95-00328-01>} The library package Complex_Text_IO
+defines the same subprograms as Text_IO.Complex_IO, except that the
+predefined type Float is systematically substituted for Real, and the
+type Numerics.Complex_Types.Complex is systematically substituted for
+Complex throughout. Nongeneric equivalents of Text_IO.Complex_IO
+corresponding to each of the other predefined floating point types are
+defined similarly, with the names Short_Complex_Text_IO,
+Long_Complex_Text_IO, etc.
9.a/2
Reason: The nongeneric equivalents are provided to allow the
@@ -114123,8 +114522,8 @@ The semantics of the Get and Put procedures are as
follows:
Width : in Field := 0);
12/1
- {8652/00928652/0092} {AI95-00029-01AI95-00029-01} The input
- sequence is a pair of optionally signed real literals
+ {<8652/00928652/0092>} {<AI95-00029-01AI95-00029-01>} The
+ input sequence is a pair of optionally signed real literals
representing the real and imaginary components of a complex
value. These components have the format defined for the
corresponding Get procedure of an instance of Text_IO.Float_IO
@@ -114239,7 +114638,7 @@ The semantics of the Get and Put procedures are as
follows:
Last : out Positive);
28/2
- {AI95-00434-01AI95-00434-01} Reads a complex value from the
+ {<AI95-00434-01AI95-00434-01>} Reads a complex value from the
beginning of the given string, following the same rule as the
Get procedure that reads a complex value from a file, but
treating the end of the string as a file terminator. Returns,
@@ -114320,16 +114719,16 @@ corresponding procedures of Text_IO.Float_IO.
_Extensions to Ada 95_
35.a/2
- {AI95-00328-01AI95-00328-01} Nongeneric equivalents for
+ {<AI95-00328-01AI95-00328-01>} Nongeneric equivalents for
Text_IO.Complex_IO are added, to be consistent with all other
language-defined Numerics generic packages.
_Wording Changes from Ada 95_
35.b/2
- {8652/00928652/0092} {AI95-00029-01AI95-00029-01} Corrigendum:
- Clarified that the syntax of values read by Complex_IO is the
- same as that read by Text_IO.Float_IO.
+ {<8652/00928652/0092>} {<AI95-00029-01AI95-00029-01>}
+ Corrigendum: Clarified that the syntax of values read by
+ Complex_IO is the same as that read by Text_IO.Float_IO.
File: aarm2012.info, Node: G.1.4, Next: G.1.5, Prev: G.1.3, Up: G.1
@@ -114356,7 +114755,7 @@ G.1.5 The Package Wide_Wide_Text_IO.Complex_IO
_Static Semantics_
1/2
-{AI95-00285-01AI95-00285-01} Implementations shall also provide the
+{<AI95-00285-01AI95-00285-01>} Implementations shall also provide the
generic library package Wide_Wide_Text_IO.Complex_IO. Its declaration is
obtained from that of Text_IO.Complex_IO by systematically replacing
Text_IO by Wide_Wide_Text_IO and String by Wide_Wide_String; the
@@ -114367,7 +114766,7 @@ those for the corresponding wide wide characters.
_Extensions to Ada 95_
1.a/2
- {AI95-00285-01AI95-00285-01} Package
+ {<AI95-00285-01AI95-00285-01>} Package
Wide_Wide_Text_IO.Complex_IO is new. (At least it wasn't
called Incredibly_Wide_Text_IO.Complex_IO; maybe next time.)
@@ -114382,13 +114781,13 @@ G.2 Numeric Performance Requirements
1
Implementations shall provide a user-selectable mode in which the
accuracy and other numeric performance requirements detailed in the
-following subclauses are observed. This mode, referred to as the strict
-mode, may or may not be the default mode; it directly affects the
-results of the predefined arithmetic operations of real types and the
-results of the subprograms in children of the Numerics package, and
+following subclauses are observed. This mode, referred to as the
+<strict mode>, may or may not be the default mode; it directly affects
+the results of the predefined arithmetic operations of real types and
+the results of the subprograms in children of the Numerics package, and
indirectly affects the operations in other language defined packages.
Implementations shall also provide the opposing mode, which is known as
-the relaxed mode.
+the <relaxed mode>.
1.a
Reason: On the assumption that the users of an implementation
@@ -114473,10 +114872,11 @@ declaration. The model numbers of a derived type
are those of the
parent type; the model numbers of a subtype are those of its type.
3
-The model numbers of a floating point type T are zero and all the values
-expressible in the canonical form (for the type T), in which mantissa
-has T'Model_Mantissa digits and exponent has a value greater than or
-equal to T'Model_Emin. (These attributes are defined in *note G.2.2::.)
+The <model numbers> of a floating point type T are zero and all the
+values expressible in the canonical form (for the type T), in which
+<mantissa> has T'Model_Mantissa digits and <exponent> has a value
+greater than or equal to T'Model_Emin. (These attributes are defined in
+*note G.2.2::.)
3.a
Discussion: The model is capable of describing the behavior of
@@ -114510,11 +114910,11 @@ equal to T'Model_Emin. (These attributes are
defined in *note G.2.2::.)
safe range.
4
-A model interval of a floating point type is any interval whose bounds
-are model numbers of the type. The model interval of a type T associated
-with a value v is the smallest model interval of T that includes v.
-(The model interval associated with a model number of a type consists of
-that number only.)
+A <model interval> of a floating point type is any interval whose bounds
+are model numbers of the type. The <model interval> of a type T
+<associated with a value> <v> is the smallest model interval of T that
+includes <v>. (The model interval associated with a model number of a
+type consists of that number only.)
_Implementation Requirements_
@@ -114531,14 +114931,14 @@ operations of floating point types are as follows.
yield exact results (see *note 3.5.8:: and *note A.5.3::).
6
-An operand interval is the model interval, of the type specified for the
-operand of an operation, associated with the value of the operand.
+An <operand interval> is the model interval, of the type specified for
+the operand of an operation, associated with the value of the operand.
7
For any predefined arithmetic operation that yields a result of a
floating point type T, the required bounds on the result are given by a
-model interval of T (called the result interval) defined in terms of the
-operand values as follows:
+model interval of T (called the <result interval>) defined in terms of
+the operand values as follows:
8
* The result interval is the smallest model interval of T that
@@ -114556,10 +114956,10 @@ in the case of a negative exponent.
The result interval of a conversion of a numeric value to a floating
point type T is the model interval of T associated with the operand
value, except when the source expression is of a fixed point type with a
-small that is not a power of T'Machine_Radix or is a fixed point
-multiplication or division either of whose operands has a small that is
-not a power of T'Machine_Radix; in these cases, the result interval is
-implementation defined.
+<small> that is not a power of T'Machine_Radix or is a fixed point
+multiplication or division either of whose operands has a <small> that
+is not a power of T'Machine_Radix; in these cases, the result interval
+is implementation defined.
10.a
Implementation defined: The result interval in certain cases
@@ -114684,86 +115084,87 @@ conditions to those in *note A.5.3::.
_Static Semantics_
2
-For every subtype S of a floating point type T:
+For every subtype S of a floating point type <T>:
3/2
-{AI95-00256-01AI95-00256-01} S'Model_Mantissa
+{<AI95-00256-01AI95-00256-01>} S'Model_Mantissa
Yields the number of digits in the mantissa of the
- canonical form of the model numbers of T (see *note
+ canonical form of the model numbers of <T> (see *note
A.5.3::). The value of this attribute shall be greater
than or equal to
3.1/2
- 'ceiling(d � log(10) / log(T'Machine_Radix))' + g
+ 'ceiling(<d> � log(10) / log(<T>'Machine_Radix))' + <g>
3.2/2
- where d is the requested decimal precision of T, and g is
- 0 if T'Machine_Radix is a positive power of 10 and 1
- otherwise. In addition, T'Model_Mantissa shall be less
- than or equal to the value of T'Machine_Mantissa. This
- attribute yields a value of the type universal_integer.
+ where <d> is the requested decimal precision of <T>, and
+ <g> is 0 if <T>'Machine_Radix is a positive power of 10
+ and 1 otherwise. In addition, <T>'Model_Mantissa shall
+ be less than or equal to the value of
+ <T>'Machine_Mantissa. This attribute yields a value of
+ the type <universal_integer>.
3.a
Ramification: S'Model_Epsilon, which is defined in terms of
S'Model_Mantissa (see *note A.5.3::), yields the absolute
value of the difference between one and the next model number
- of the type T above one. It is equal to or larger than the
+ of the type <T> above one. It is equal to or larger than the
absolute value of the difference between one and the next
- machine number of the type T above one.
+ machine number of the type <T> above one.
4
S'Model_Emin
Yields the minimum exponent of the canonical form of the
- model numbers of T (see *note A.5.3::). The value of
+ model numbers of <T> (see *note A.5.3::). The value of
this attribute shall be greater than or equal to the
- value of T'Machine_Emin. This attribute yields a value
- of the type universal_integer.
+ value of <T>'Machine_Emin. This attribute yields a value
+ of the type <universal_integer>.
4.a
Ramification: S'Model_Small, which is defined in terms of
S'Model_Emin (see *note A.5.3::), yields the smallest positive
- (nonzero) model number of the type T.
+ (nonzero) model number of the type <T>.
5
S'Safe_First
- Yields the lower bound of the safe range of T. The value
- of this attribute shall be a model number of T and
- greater than or equal to the lower bound of the base
- range of T. In addition, if T is declared by a
+ Yields the lower bound of the safe range of <T>. The
+ value of this attribute shall be a model number of <T>
+ and greater than or equal to the lower bound of the base
+ range of <T>. In addition, if <T> is declared by a
floating_point_definition or is derived from such a type,
and the floating_point_definition includes a
- real_range_specification specifying a lower bound of lb,
- then the value of this attribute shall be less than or
- equal to lb; otherwise, it shall be less than or equal to
- -10.0 4 � d, where d is the requested decimal precision
- of T. This attribute yields a value of the type
- universal_real.
+ real_range_specification specifying a lower bound of
+ <lb>, then the value of this attribute shall be less than
+ or equal to <lb>; otherwise, it shall be less than or
+ equal to -10.0 4 � <d>, where <d> is the requested
+ decimal precision of <T>. This attribute yields a value
+ of the type <universal_real>.
6
S'Safe_Last
- Yields the upper bound of the safe range of T. The value
- of this attribute shall be a model number of T and less
- than or equal to the upper bound of the base range of T.
- In addition, if T is declared by a
+ Yields the upper bound of the safe range of <T>. The
+ value of this attribute shall be a model number of <T>
+ and less than or equal to the upper bound of the base
+ range of <T>. In addition, if <T> is declared by a
floating_point_definition or is derived from such a type,
and the floating_point_definition includes a
- real_range_specification specifying an upper bound of ub,
- then the value of this attribute shall be greater than or
- equal to ub; otherwise, it shall be greater than or equal
- to 10.0 4 � d, where d is the requested decimal precision
- of T. This attribute yields a value of the type
- universal_real.
+ real_range_specification specifying an upper bound of
+ <ub>, then the value of this attribute shall be greater
+ than or equal to <ub>; otherwise, it shall be greater
+ than or equal to 10.0 4 � <d>, where d is the requested
+ decimal precision of <T>. This attribute yields a value
+ of the type <universal_real>.
7
S'Model
- Denotes a function (of a parameter X) whose specification
- is given in *note A.5.3::. If X is a model number of T,
- the function yields X; otherwise, it yields the value
- obtained by rounding or truncating X to either one of the
- adjacent model numbers of T. Constraint_Error is raised
- if the resulting model number is outside the safe range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True.
+ Denotes a function (of a parameter <X>) whose
+ specification is given in *note A.5.3::. If <X> is a
+ model number of <T>, the function yields <X>; otherwise,
+ it yields the value obtained by rounding or truncating
+ <X> to either one of the adjacent model numbers of <T>.
+ Constraint_Error is raised if the resulting model number
+ is outside the safe range of S. A zero result has the
+ sign of <X> when S'Signed_Zeros is True.
8
Subject to the constraints given above, the values of S'Model_Mantissa
@@ -114786,8 +115187,8 @@ S'Safe_First minimized, by the implementation as
follows:
S'Model_Mantissa.
11/3
- * {AI05-0092-1AI05-0092-1} Finally, S'Safe_First and S'Safe_Last are
- set (in either order) to the smallest and largest values,
+ * {<AI05-0092-1AI05-0092-1>} Finally, S'Safe_First and S'Safe_Last
+ are set (in either order) to the smallest and largest values,
respectively, for which the implementation satisfies the
strict-mode requirements of *note G.2.1:: in terms of the model
numbers and safe range induced by these attributes and the
@@ -114842,7 +115243,7 @@ S'Safe_First minimized, by the implementation as
follows:
_Wording Changes from Ada 95_
11.h/2
- {AI95-00256-01AI95-00256-01} Corrected the definition of
+ {<AI95-00256-01AI95-00256-01>} Corrected the definition of
Model_Mantissa to match that given in *note 3.5.8::.
@@ -114885,28 +115286,29 @@ rounding (see *note 3.5.10::).
5
When the result type is a floating point type, the accuracy is as given
-in *note G.2.1::. For some combinations of the operand and result types
+in *note G.2.1::. For some combinations of the operand and result types
in the remaining cases, the result is required to belong to a small set
-of values called the perfect result set; for other combinations, it is
+of values called the <perfect result set>; for other combinations, it is
required merely to belong to a generally larger and
-implementation-defined set of values called the close result set. When
-the result type is a decimal fixed point type, the perfect result set
-contains a single value; thus, operations on decimal types are always
-fully specified.
+implementation-defined set of values called the <close result set>.
+When the result type is a decimal fixed point type, the perfect result
+set contains a single value; thus, operations on decimal types are
+always fully specified.
5.a
- Implementation defined: The definition of close result set,
+ Implementation defined: The definition of <close result set>,
which determines the accuracy of certain fixed point
multiplications and divisions.
6
When one operand of a fixed-fixed multiplication or division is of type
-universal_real, that operand is not implicitly converted in the usual
+<universal_real>, that operand is not implicitly converted in the usual
sense, since the context does not determine a unique target type, but
the accuracy of the result of the multiplication or division (i.e.,
whether the result has to belong to the perfect result set or merely the
close result set) depends on the value of the operand of type
-universal_real and on the types of the other operand and of the result.
+<universal_real> and on the types of the other operand and of the
+result.
6.a
Discussion: We need not consider here the multiplication or
@@ -114918,44 +115320,45 @@ universal_real and on the types of the other
operand and of the result.
7
For a fixed point multiplication or division whose (exact) mathematical
-result is v, and for the conversion of a value v to a fixed point type,
-the perfect result set and close result set are defined as follows:
+result is <v>, and for the conversion of a value <v> to a fixed point
+type, the perfect result set and close result set are defined as
+follows:
8
- * If the result type is an ordinary fixed point type with a small of
- s,
+ * If the result type is an ordinary fixed point type with a <small>
+ of <s>,
9
- * if v is an integer multiple of s, then the perfect result
- set contains only the value v;
+ * if <v> is an integer multiple of <s>, then the perfect
+ result set contains only the value <v>;
10
- * otherwise, it contains the integer multiple of s just
- below v and the integer multiple of s just above v.
+ * otherwise, it contains the integer multiple of <s> just
+ below <v> and the integer multiple of <s> just above <v>.
11
The close result set is an implementation-defined set of
- consecutive integer multiples of s containing the perfect result
+ consecutive integer multiples of <s> containing the perfect result
set as a subset.
12
- * If the result type is a decimal type with a small of s,
+ * If the result type is a decimal type with a <small> of <s>,
13
- * if v is an integer multiple of s, then the perfect result
- set contains only the value v;
+ * if <v> is an integer multiple of <s>, then the perfect
+ result set contains only the value <v>;
14/3
- * {AI05-0264-1AI05-0264-1} otherwise, if truncation
- applies, then it contains only the integer multiple of s
- in the direction toward zero, whereas if rounding
+ * {<AI05-0264-1AI05-0264-1>} otherwise, if truncation
+ applies, then it contains only the integer multiple of
+ <s> in the direction toward zero, whereas if rounding
applies, then it contains only the nearest integer
- multiple of s (with ties broken by rounding away from
+ multiple of <s> (with ties broken by rounding away from
zero).
15
The close result set is an implementation-defined set of
- consecutive integer multiples of s containing the perfect result
+ consecutive integer multiples of <s> containing the perfect result
set as a subset.
15.a
@@ -114966,14 +115369,14 @@ the perfect result set and close result set are
defined as follows:
* If the result type is an integer type,
17
- * if v is an integer, then the perfect result set contains
- only the value v;
+ * if <v> is an integer, then the perfect result set
+ contains only the value <v>;
18
- * otherwise, it contains the integer nearest to the value v
- (if v lies equally distant from two consecutive integers,
- the perfect result set contains the one that is further
- from zero).
+ * otherwise, it contains the integer nearest to the value
+ <v> (if <v> lies equally distant from two consecutive
+ integers, the perfect result set contains the one that is
+ further from zero).
19
The close result set is an implementation-defined set of
@@ -114983,40 +115386,41 @@ the perfect result set and close result set are
defined as follows:
The result of a fixed point multiplication or division shall belong
either to the perfect result set or to the close result set, as
described below, if overflow does not occur. In the following cases, if
-the result type is a fixed point type, let s be its small; otherwise,
-i.e. when the result type is an integer type, let s be 1.0.
+the result type is a fixed point type, let <s> be its <small>;
+otherwise, i.e. when the result type is an integer type, let <s> be
+1.0.
21
* For a multiplication or division neither of whose operands is of
- type universal_real, let l and r be the smalls of the left and
- right operands. For a multiplication, if (l � r) / s is an integer
- or the reciprocal of an integer (the smalls are said to be
- "compatible" in this case), the result shall belong to the perfect
- result set; otherwise, it belongs to the close result set. For a
- division, if l / (r � s) is an integer or the reciprocal of an
- integer (i.e., the smalls are compatible), the result shall belong
- to the perfect result set; otherwise, it belongs to the close
- result set.
+ type <universal_real>, let <l> and <r> be the <smalls> of the left
+ and right operands. For a multiplication, if (<l> � <r>) / <s> is
+ an integer or the reciprocal of an integer (the <smalls> are said
+ to be "compatible" in this case), the result shall belong to the
+ perfect result set; otherwise, it belongs to the close result set.
+ For a division, if <l> / (<r> � <s>) is an integer or the
+ reciprocal of an integer (i.e., the <smalls> are compatible), the
+ result shall belong to the perfect result set; otherwise, it
+ belongs to the close result set.
21.a
Ramification: When the operand and result types are all
- decimal types, their smalls are necessarily compatible; the
+ decimal types, their <smalls> are necessarily compatible; the
same is true when they are all ordinary fixed point types with
- binary smalls.
+ binary <smalls>.
22
- * For a multiplication or division having one universal_real operand
- with a value of v, note that it is always possible to factor v as
- an integer multiple of a "compatible" small, but the integer
- multiple may be "too big." If there exists a factorization in
- which that multiple is less than some implementation-defined limit,
- the result shall belong to the perfect result set; otherwise, it
- belongs to the close result set.
+ * For a multiplication or division having one <universal_real>
+ operand with a value of <v>, note that it is always possible to
+ factor <v> as an integer multiple of a "compatible" <small>, but
+ the integer multiple may be "too big." If there exists a
+ factorization in which that multiple is less than some
+ implementation-defined limit, the result shall belong to the
+ perfect result set; otherwise, it belongs to the close result set.
22.a
- Implementation defined: Conditions on a universal_real operand
- of a fixed point multiplication or division for which the
- result shall be in the perfect result set.
+ Implementation defined: Conditions on a <universal_real>
+ operand of a fixed point multiplication or division for which
+ the result shall be in the <perfect result set>.
23
A multiplication P * Q of an operand of a fixed point type F by an
@@ -115026,23 +115430,24 @@ also allowed. In these cases, the result has a
type of F; explicit
conversion of the result is never required. The accuracy required in
these cases is the same as that required for a multiplication F(P * Q)
or a division F(P / Q) obtained by interpreting the operand of the
-integer type to have a fixed point type with a small of 1.0.
+integer type to have a fixed point type with a <small> of 1.0.
24
The accuracy of the result of a conversion from an integer or fixed
point type to a fixed point type, or from a fixed point type to an
integer type, is the same as that of a fixed point multiplication of the
-source value by a fixed point operand having a small of 1.0 and a value
-of 1.0, as given by the foregoing rules. The result of a conversion
-from a floating point type to a fixed point type shall belong to the
-close result set. The result of a conversion of a universal_real
-operand to a fixed point type shall belong to the perfect result set.
+source value by a fixed point operand having a <small> of 1.0 and a
+value of 1.0, as given by the foregoing rules. The result of a
+conversion from a floating point type to a fixed point type shall belong
+to the close result set. The result of a conversion of a
+<universal_real> operand to a fixed point type shall belong to the
+perfect result set.
25
The possibility of overflow in the result of a predefined arithmetic
operation or conversion yielding a result of a fixed point type T is
analogous to that for floating point types, except for being related to
-the base range instead of the safe range. If all of the permitted
+the base range instead of the safe range. If all of the permitted
results belong to the base range of T, then the implementation shall
deliver one of the permitted results; otherwise,
@@ -115063,20 +115468,20 @@ deliver one of the permitted results; otherwise,
27.b
Since the values of a fixed point type are now just the
- integer multiples of its small, the possibility of using extra
- bits available in the chosen representation for extra accuracy
- rather than for increasing the base range would appear to be
- removed, raising the possibility that some fixed point
- expressions will yield less accurate results than in Ada 83.
- However, this is partially offset by the ability of an
- implementation to choose a smaller default small than before.
- Of course, if it does so for a type T then T'Small will have a
- different value than it previously had.
+ integer multiples of its <small>, the possibility of using
+ extra bits available in the chosen representation for extra
+ accuracy rather than for increasing the base range would
+ appear to be removed, raising the possibility that some fixed
+ point expressions will yield less accurate results than in Ada
+ 83. However, this is partially offset by the ability of an
+ implementation to choose a smaller default <small> than
+ before. Of course, if it does so for a type T then T'Small
+ will have a different value than it previously had.
27.c
- The accuracy requirements in the case of incompatible smalls
- are relaxed to foster wider support for nonbinary smalls. If
- this relaxation is exploited for a type that was previously
+ The accuracy requirements in the case of incompatible <smalls>
+ are relaxed to foster wider support for nonbinary <smalls>.
+ If this relaxation is exploited for a type that was previously
supported, lower accuracy could result; however, there is no
particular incentive to exploit the relaxation in such a case.
@@ -115115,22 +115520,22 @@ Numerics.Generic_Elementary_Functions shall be as
specified here.
2
When an exception is not raised, the result of evaluating a function in
-an instance EF of Numerics.Generic_Elementary_Functions belongs to a
-result interval, defined as the smallest model interval of EF.Float_Type
-that contains all the values of the form f � (1.0 + d), where f is the
-exact value of the corresponding mathematical function at the given
-parameter values, d is a real number, and |d| is less than or equal to
-the function's maximum relative error. The function delivers a value
-that belongs to the result interval when both of its bounds belong to
-the safe range of EF.Float_Type; otherwise,
+an instance <EF> of Numerics.Generic_Elementary_Functions belongs to a
+<result interval>, defined as the smallest model interval of
+<EF>.Float_Type that contains all the values of the form <f> � (1.0 +
+<d>), where <f> is the exact value of the corresponding mathematical
+function at the given parameter values, <d> is a real number, and |<d>|
+is less than or equal to the function's <maximum relative error>. The
+function delivers a value that belongs to the result interval when both
+of its bounds belong to the safe range of <EF>.Float_Type; otherwise,
3
- * if EF.Float_Type'Machine_Overflows is True, the function either
+ * if <EF>.Float_Type'Machine_Overflows is True, the function either
delivers a value that belongs to the result interval or raises
Constraint_Error, signaling overflow;
4
- * if EF.Float_Type'Machine_Overflows is False, the result is
+ * if <EF>.Float_Type'Machine_Overflows is False, the result is
implementation defined.
4.a
@@ -115142,35 +115547,35 @@ the safe range of EF.Float_Type; otherwise,
The maximum relative error exhibited by each function is as follows:
6
- * 2.0 � EF.Float_Type'Model_Epsilon, in the case of the Sqrt, Sin,
+ * 2.0 � <EF>.Float_Type'Model_Epsilon, in the case of the Sqrt, Sin,
and Cos functions;
7
- * 4.0 � EF.Float_Type'Model_Epsilon, in the case of the Log, Exp,
+ * 4.0 � <EF>.Float_Type'Model_Epsilon, in the case of the Log, Exp,
Tan, Cot, and inverse trigonometric functions; and
8
- * 8.0 � EF.Float_Type'Model_Epsilon, in the case of the forward and
+ * 8.0 � <EF>.Float_Type'Model_Epsilon, in the case of the forward and
inverse hyperbolic functions.
9
The maximum relative error exhibited by the exponentiation operator,
which depends on the values of the operands, is (4.0 + |Right �
-log(Left)| / 32.0) � EF.Float_Type'Model_Epsilon.
+log(Left)| / 32.0) � <EF>.Float_Type'Model_Epsilon.
10
The maximum relative error given above applies throughout the domain of
the forward trigonometric functions when the Cycle parameter is
-specified. When the Cycle parameter is omitted, the maximum relative
+specified. When the Cycle parameter is omitted, the maximum relative
error given above applies only when the absolute value of the angle
-parameter X is less than or equal to some implementation-defined angle
-threshold, which shall be at least EF.Float_Type'Machine_Radix
-'floor(EF.Float_Type'Machine_Mantissa/2)'. Beyond the angle threshold,
-the accuracy of the forward trigonometric functions is implementation
-defined.
+parameter X is less than or equal to some implementation-defined <angle
+threshold>, which shall be at least <EF>.Float_Type'Machine_Radix
+'floor(<EF>.Float_Type'Machine_Mantissa/2)'. Beyond the angle
+threshold, the accuracy of the forward trigonometric functions is
+implementation defined.
10.a
- Implementation defined: The value of the angle threshold,
+ Implementation defined: The value of the <angle threshold>,
within which certain elementary functions, complex arithmetic
operations, and complex elementary functions yield results
conforming to a maximum relative error bound.
@@ -115185,28 +115590,29 @@ defined.
maintain during argument reduction.
11/2
-{AI95-00434-01AI95-00434-01} The prescribed results specified in *note
+{<AI95-00434-01AI95-00434-01>} The prescribed results specified in *note
A.5.1:: for certain functions at particular parameter values take
precedence over the maximum relative error bounds; effectively, they
narrow to a single value the result interval allowed by the maximum
relative error bounds. Additional rules with a similar effect are given
by table G-1 for the inverse trigonometric functions, at particular
parameter values for which the mathematical result is possibly not a
-model number of EF.Float_Type (or is, indeed, even transcendental). In
-each table entry, the values of the parameters are such that the result
-lies on the axis between two quadrants; the corresponding accuracy rule,
-which takes precedence over the maximum relative error bounds, is that
-the result interval is the model interval of EF.Float_Type associated
-with the exact mathematical result given in the table.
+model number of <EF>.Float_Type (or is, indeed, even transcendental).
+In each table entry, the values of the parameters are such that the
+result lies on the axis between two quadrants; the corresponding
+accuracy rule, which takes precedence over the maximum relative error
+bounds, is that the result interval is the model interval of
+<EF>.Float_Type associated with the exact mathematical result given in
+the table.
12/1
-This paragraph was deleted.
+<This paragraph was deleted.>
13
The last line of the table is meant to apply when
-EF.Float_Type'Signed_Zeros is False; the two lines just above it, when
-EF.Float_Type'Signed_Zeros is True and the parameter Y has a zero value
-with the indicated sign.
+<EF>.Float_Type'Signed_Zeros is False; the two lines just above it, when
+<EF>.Float_Type'Signed_Zeros is True and the parameter Y has a zero
+value with the indicated sign.
Table G-1: Tightly Approximated Elementary Function Results
Function Value of X Value of Y Exact Result Exact Result
@@ -115236,7 +115642,7 @@ The amount by which the result of an inverse
trigonometric function is
allowed to spill over into a quadrant adjacent to the one corresponding
to the principal branch, as given in *note A.5.1::, is limited. The
rule is that the result belongs to the smallest model interval of
-EF.Float_Type that contains both boundaries of the quadrant
+<EF>.Float_Type that contains both boundaries of the quadrant
corresponding to the principal branch. This rule also takes precedence
over the maximum relative error bounds, effectively narrowing the result
interval allowed by them.
@@ -115337,43 +115743,46 @@ whenever the expected counts are fewer than 5.
Implementation Note: In the floating point random number test
suite, the generator is reset to a time-dependent state at the
beginning of the run. The test suite incorporates the
- following tests, adapted from D. E. Knuth, The Art of Computer
- Programming, vol. 2: Seminumerical Algorithms. In the
- descriptions below, the given number of degrees of freedom is
- the number before reduction due to any necessary combination
- of measurement categories with small expected counts; it is
- one less than the number of measurement categories.
+ following tests, adapted from D. E. Knuth, <The Art of
+ Computer Programming, vol. 2: Seminumerical Algorithms.> In
+ the descriptions below, the given number of degrees of freedom
+ is the number before reduction due to any necessary
+ combination of measurement categories with small expected
+ counts; it is one less than the number of measurement
+ categories.
4.b
* Proportional Distribution Test (a variant of the
Equidistribution Test). The interval 0.0 .. 1.0 is
- partitioned into K subintervals. K is chosen randomly
- between 4 and 25 for each repetition of the test, along
- with the boundaries of the subintervals (subject to the
- constraint that at least 2 of the subintervals have a
- width of 0.001 or more). 5000 random floating point
- numbers are generated. The counts of random numbers
- falling into each subinterval are tallied and compared
- with the expected counts, which are proportional to the
- widths of the subintervals. The number of degrees of
- freedom for the chi-square test is K-1.
+ partitioned into <K> subintervals. <K> is chosen
+ randomly between 4 and 25 for each repetition of the
+ test, along with the boundaries of the subintervals
+ (subject to the constraint that at least 2 of the
+ subintervals have a width of 0.001 or more). 5000 random
+ floating point numbers are generated. The counts of
+ random numbers falling into each subinterval are tallied
+ and compared with the expected counts, which are
+ proportional to the widths of the subintervals. The
+ number of degrees of freedom for the chi-square test is
+ <K>-1.
4.c
- * Gap Test. The bounds of a range A .. B, with 0.0 <= A <
- B <= 1.0, are chosen randomly for each repetition of the
- test, subject to the constraint that 0.2 <= B-A <= 0.6.
- Random floating point numbers are generated until 5000
- falling into the range A .. B have been encountered.
- Each of these 5000 is preceded by a "gap" (of length
- greater than or equal to 0) of consecutive random numbers
- not falling into the range A .. B. The counts of gaps of
- each length from 0 to 15, and of all lengths greater than
- 15 lumped together, are tallied and compared with the
- expected counts. Let P = B-A. The probability that a gap
- has a length of L is (1-P) L � P for L <= 15, while the
- probability that a gap has a length of 16 or more is
- (1-P) 16. The number of degrees of freedom for the
- chi-square test is 16.
+ * Gap Test. The bounds of a range <A> .. <B>, with 0.0 <=
+ <A> < <B> <= 1.0, are chosen randomly for each repetition
+ of the test, subject to the constraint that 0.2 <=
+ <B>-<A> <= 0.6. Random floating point numbers are
+ generated until 5000 falling into the range <A> .. <B>
+ have been encountered. Each of these 5000 is preceded by
+ a "gap" (of length greater than or equal to 0) of
+ consecutive random numbers not falling into the range <A>
+ .. <B>. The counts of gaps of each length from 0 to 15,
+ and of all lengths greater than 15 lumped together, are
+ tallied and compared with the expected counts. Let <P> =
+ <B>-<A>. The probability that a gap has a length of <L>
+ is (1-<P>) <L> � <P> for <L> <= 15, while the probability
+ that a gap has a length of 16 or more is (1-<P>) 16. The
+ number of degrees of freedom for the chi-square test is
+ 16.
4.d
* Permutation Test. 5000 tuples of 4 different random
@@ -115400,22 +115809,22 @@ whenever the expected counts are fewer than 5.
run. The counts of increasing runs of each length from 1
to 4, and of all lengths greater than 4 lumped together,
are tallied and compared with the expected counts. The
- probability that an increasing run has a length of L is
- 1/L! - 1/(L+1)! for L <= 4, while the probability that
- an increasing run has a length of 5 or more is 1/5!. The
- number of degrees of freedom for the chi-square test is
- 4.
+ probability that an increasing run has a length of <L> is
+ 1/<L>! - 1/(<L>+1)! for <L> <= 4, while the probability
+ that an increasing run has a length of 5 or more is 1/5!.
+ The number of degrees of freedom for the chi-square test
+ is 4.
4.f
* Decreasing-Runs Test. The test is similar to the
Increasing Runs Test, but with decreasing runs.
4.g
- * Maximum-of-t Test (with t = 5). 5000 tuples of 5 random
- floating point numbers are generated. The maximum of the
- components of each 5-tuple is determined and raised to
- the 5th power. The uniformity of the resulting values
- over the range 0.0 .. 1.0 is tested as in the
+ * Maximum-of-<t> Test (with <t> = 5). 5000 tuples of 5
+ random floating point numbers are generated. The maximum
+ of the components of each 5-tuple is determined and
+ raised to the 5th power. The uniformity of the resulting
+ values over the range 0.0 .. 1.0 is tested as in the
Proportional Distribution Test.
4.h
@@ -115423,7 +115832,7 @@ whenever the expected counts are fewer than 5.
Numerics.Discrete_Random is instantiated as described below.
The generator is reset to a time-dependent state after each
instantiation. The test suite incorporates the following
- tests, adapted from D. E. Knuth (op. cit.) and other
+ tests, adapted from D. E. Knuth (<op. cit.>) and other
sources. The given number of degrees of freedom for the
chi-square test is reduced by any necessary combination of
measurement categories with small expected counts, as
@@ -115431,14 +115840,14 @@ whenever the expected counts are fewer than 5.
4.i
* Equidistribution Test. In each repetition of the test, a
- number R between 2 and 30 is chosen randomly, and
+ number <R> between 2 and 30 is chosen randomly, and
Numerics.Discrete_Random is instantiated with an integer
- subtype whose range is 1 .. R. 5000 integers are
+ subtype whose range is 1 .. <R>. 5000 integers are
generated randomly from this range. The counts of
occurrences of each integer in the range are tallied and
compared with the expected counts, which have equal
probabilities. The number of degrees of freedom for the
- chi-square test is R-1.
+ chi-square test is <R>-1.
4.j
* Simplified Poker Test. Numerics.Discrete_Random is
@@ -115447,27 +115856,28 @@ whenever the expected counts are fewer than 5.
Queen, King, and Ace) of an infinite deck of playing
cards. 2000 "poker" hands (5-tuples of values of this
subtype) are generated randomly. The counts of hands
- containing exactly K different denominations (1 <= K <=
- 5) are tallied and compared with the expected counts.
- The probability that a hand contains exactly K different
- denominations is given by a formula in Knuth. The number
- of degrees of freedom for the chi-square test is 4.
+ containing exactly <K> different denominations (1 <= <K>
+ <= 5) are tallied and compared with the expected counts.
+ The probability that a hand contains exactly <K>
+ different denominations is given by a formula in Knuth.
+ The number of degrees of freedom for the chi-square test
+ is 4.
4.k
* Coupon Collector's Test. Numerics.Discrete_Random is
instantiated in each repetition of the test with an
- integer subtype whose range is 1 .. R, where R varies
- systematically from 2 to 11. Integers are generated
- randomly from this range until each value in the range
- has occurred, and the number K of integers generated is
- recorded. This constitutes a "coupon collector's
- segment" of length K. 2000 such segments are generated.
- The counts of segments of each length from R to R+29, and
- of all lengths greater than R+29 lumped together, are
- tallied and compared with the expected counts. The
- probability that a segment has any given length is given
- by formulas in Knuth. The number of degrees of freedom
- for the chi-square test is 30.
+ integer subtype whose range is 1 .. <R>, where <R>
+ varies systematically from 2 to 11. Integers are
+ generated randomly from this range until each value in
+ the range has occurred, and the number <K> of integers
+ generated is recorded. This constitutes a "coupon
+ collector's segment" of length <K>. 2000 such segments
+ are generated. The counts of segments of each length
+ from <R> to <R>+29, and of all lengths greater than
+ <R>+29 lumped together, are tallied and compared with the
+ expected counts. The probability that a segment has any
+ given length is given by formulas in Knuth. The number
+ of degrees of freedom for the chi-square test is 30.
4.l
* Craps Test (Lengths of Games). Numerics.Discrete_Random
@@ -115478,32 +115888,35 @@ whenever the expected counts are fewer than 5.
pair of dice required to produce a win or a loss. A game
is won on the first roll if the dice show 7 or 11; it is
lost if they show 2, 3, or 12. If the dice show some
- other sum on the first roll, it is called the point, and
- the game is won if and only if the point is rolled again
- before a 7 is rolled.) The counts of games of each
+ other sum on the first roll, it is called the <point>,
+ and the game is won if and only if the point is rolled
+ again before a 7 is rolled.) The counts of games of each
length from 1 to 18, and of all lengths greater than 18
lumped together, are tallied and compared with the
- expected counts. For 2 <= S <= 12, let D S be the
+ expected counts. For 2 <= <S> <= 12, let <D> <S> be the
probability that a roll of a pair of dice shows the sum
- S, and let Q S(L) = D S � (1 - (D S + D 7)) L-2 � (D S +
- D 7). Then, the probability that a game has a length of
- 1 is D 7 + D 11 + D 2 + D 3 + D 12 and, for L > 1, the
- probability that a game has a length of L is Q 4(L) + Q
- 5(L) + Q 6(L) + Q 8(L) + Q 9(L) + Q 10(L). The number of
- degrees of freedom for the chi-square test is 18.
+ <S>, and let <Q> <S>(<L>) = <D> <S> � (1 - (<D> <S> + <D>
+ 7)) <L>-2 � (<D> <S> + <D> 7). Then, the probability
+ that a game has a length of 1 is <D> 7 + <D> 11 + <D> 2 +
+ <D> 3 + <D> 12 and, for <L> > 1, the probability that a
+ game has a length of <L> is <Q> 4(<L>) + <Q> 5(<L>) + <Q>
+ 6(<L>) + <Q> 8(<L>) + <Q> 9(<L>) + <Q> 10(<L>). The
+ number of degrees of freedom for the chi-square test is
+ 18.
4.m
* Craps Test (Lengths of Passes). This test is similar to
the last, but enough craps games are played for 3000
losses to occur. A string of wins followed by a loss is
- called a pass, and its length is the number of wins
+ called a <pass>, and its length is the number of wins
preceding the loss. The counts of passes of each length
from 0 to 7, and of all lengths greater than 7 lumped
together, are tallied and compared with the expected
- counts. For L >= 0, the probability that a pass has a
- length of L is W L � (1-W), where W, the probability that
- a game ends in a win, is 244.0/495.0. The number of
- degrees of freedom for the chi-square test is 8.
+ counts. For <L> >= 0, the probability that a pass has a
+ length of <L> is <W> <L> � (1-<W>), where <W>, the
+ probability that a game ends in a win, is 244.0/495.0.
+ The number of degrees of freedom for the chi-square test
+ is 8.
4.n
* Collision Test. Numerics.Discrete_Random is instantiated
@@ -115535,32 +115948,32 @@ here.
2
When an exception is not raised, the result of evaluating a real
-function of an instance CT of Numerics.Generic_Complex_Types (i.e., a
-function that yields a value of subtype CT.Real'Base or CT.Imaginary)
-belongs to a result interval defined as for a real elementary function
-(see *note G.2.4::).
+function of an instance <CT> of Numerics.Generic_Complex_Types (i.e., a
+function that yields a value of subtype <CT>.Real'Base or
+<CT>.Imaginary) belongs to a result interval defined as for a real
+elementary function (see *note G.2.4::).
3
When an exception is not raised, each component of the result of
evaluating a complex function of such an instance, or of an instance of
Numerics.Generic_Complex_Elementary_Functions obtained by instantiating
-the latter with CT (i.e., a function that yields a value of subtype
-CT.Complex), also belongs to a result interval. The result intervals
-for the components of the result are either defined by a maximum
-relative error bound or by a maximum box error bound. When the result
-interval for the real (resp., imaginary) component is defined by maximum
-relative error, it is defined as for that of a real function, relative
-to the exact value of the real (resp., imaginary) part of the result of
-the corresponding mathematical function. When defined by maximum box
-error, the result interval for a component of the result is the smallest
-model interval of CT.Real that contains all the values of the
-corresponding part of f � (1.0 + d), where f is the exact complex value
-of the corresponding mathematical function at the given parameter
-values, d is complex, and |d| is less than or equal to the given maximum
-box error. The function delivers a value that belongs to the result
-interval (or a value both of whose components belong to their respective
-result intervals) when both bounds of the result interval(s) belong to
-the safe range of CT.Real; otherwise,
+the latter with <CT> (i.e., a function that yields a value of subtype
+<CT>.Complex), also belongs to a <result interval>. The result
+intervals for the components of the result are either defined by a
+<maximum relative error> bound or by a <maximum box error> bound. When
+the result interval for the real (resp., imaginary) component is defined
+by maximum relative error, it is defined as for that of a real function,
+relative to the exact value of the real (resp., imaginary) part of the
+result of the corresponding mathematical function. When defined by
+maximum box error, the result interval for a component of the result is
+the smallest model interval of <CT>.Real that contains all the values of
+the corresponding part of <f> � (1.0 + <d>), where <f> is the exact
+complex value of the corresponding mathematical function at the given
+parameter values, <d> is complex, and |<d>| is less than or equal to the
+given maximum box error. The function delivers a value that belongs to
+the result interval (or a value both of whose components belong to their
+respective result intervals) when both bounds of the result interval(s)
+belong to the safe range of <CT>.Real; otherwise,
3.a
Discussion: The maximum relative error could be specified
@@ -115568,10 +115981,10 @@ the safe range of CT.Real; otherwise,
that freedom here.
3.b
- Discussion: Note that f � (1.0 + d) defines a small circular
- region of the complex plane centered at f, and the result
- intervals for the real and imaginary components of the result
- define a small rectangular box containing that circle.
+ Discussion: Note that <f> � (1.0 + <d>) defines a small
+ circular region of the complex plane centered at <f>, and the
+ result intervals for the real and imaginary components of the
+ result define a small rectangular box containing that circle.
3.c
Reason: Box error is used when the computation of the result
@@ -115595,14 +116008,14 @@ the safe range of CT.Real; otherwise,
modulus of the mathematical result.
4
- * if CT.Real'Machine_Overflows is True, the function either delivers
- a value that belongs to the result interval (or a value both of
- whose components belong to their respective result intervals) or
- raises Constraint_Error, signaling overflow;
+ * if <CT>.Real'Machine_Overflows is True, the function either
+ delivers a value that belongs to the result interval (or a value
+ both of whose components belong to their respective result
+ intervals) or raises Constraint_Error, signaling overflow;
5
- * if CT.Real'Machine_Overflows is False, the result is implementation
- defined.
+ * if <CT>.Real'Machine_Overflows is False, the result is
+ implementation defined.
5.a
Implementation defined: The result of a complex arithmetic
@@ -115611,12 +116024,12 @@ the safe range of CT.Real; otherwise,
corresponding real type is False.
6/2
-{AI95-00434-01AI95-00434-01} The error bounds for particular complex
+{<AI95-00434-01AI95-00434-01>} The error bounds for particular complex
functions are tabulated in table G-2. In the table, the error bound is
-given as the coefficient of CT.Real'Model_Epsilon.
+given as the coefficient of <CT>.Real'Model_Epsilon.
7/1
-This paragraph was deleted.
+<This paragraph was deleted.>
Table G-2: Error Bounds for Particular Complex Functions
Function or Operator Nature of Nature of Error Bound
@@ -115690,24 +116103,25 @@ and inverse hyperbolic functions, at particular
parameter values for
which a component of the mathematical result is transcendental. In each
case, the accuracy rule, which takes precedence over the error bounds,
is that the result interval for the stated result component is the model
-interval of CT.Real associated with the component's exact mathematical
+interval of <CT>.Real associated with the component's exact mathematical
value. The cases in question are as follows:
10
* When the parameter X has the value zero, the real (resp.,
imaginary) component of the result of the Arccot (resp., Arccoth)
- function is in the model interval of CT.Real associated with the
+ function is in the model interval of <CT>.Real associated with the
value PI/2.0.
11
* When the parameter X has the value one, the real component of the
- result of the Arcsin function is in the model interval of CT.Real
+ result of the Arcsin function is in the model interval of <CT>.Real
associated with the value PI/2.0.
12
* When the parameter X has the value -1.0, the real component of the
result of the Arcsin (resp., Arccos) function is in the model
- interval of CT.Real associated with the value -PI/2.0 (resp., PI).
+ interval of <CT>.Real associated with the value -PI/2.0 (resp.,
+ PI).
12.a
Discussion: It is possible to give many other prescribed
@@ -115719,12 +116133,12 @@ value. The cases in question are as follows:
so, however.
13/2
-{AI95-00434-01AI95-00434-01} The amount by which a component of the
+{<AI95-00434-01AI95-00434-01>} The amount by which a component of the
result of an inverse trigonometric or inverse hyperbolic function is
allowed to spill over into a quadrant adjacent to the one corresponding
to the principal branch, as given in *note G.1.2::, is limited. The
rule is that the result belongs to the smallest model interval of
-CT.Real that contains both boundaries of the quadrant corresponding to
+<CT>.Real that contains both boundaries of the quadrant corresponding to
the principal branch. This rule also takes precedence over the maximum
error bounds, effectively narrowing the result interval allowed by them.
@@ -115766,7 +116180,7 @@ G.3 Vector and Matrix Manipulation
==================================
1/2
-{AI95-00296-01AI95-00296-01} Types and operations for the manipulation
+{<AI95-00296-01AI95-00296-01>} Types and operations for the manipulation
of real vectors and matrices are provided in Generic_Real_Arrays, which
is defined in *note G.3.1::. Types and operations for the manipulation
of complex vectors and matrices are provided in Generic_Complex_Arrays,
@@ -115783,10 +116197,10 @@ floating point types are also provided as children
of Numerics.
1.b/2
These packages provide facilities that are similar to and
- replace those found in ISO/IEC 13813:1998 Information
+ replace those found in ISO/IEC 13813:1998 <Information
technology -- Programming languages -- Generic packages of
real and complex type declarations and basic operations for
- Ada (including vector and matrix types). (The other
+ Ada (including vector and matrix types)>. (The other
facilities provided by that Standard were already provided in
Ada 95.) In addition to the main facilities of that Standard,
these packages also include subprograms for the solution of
@@ -115797,7 +116211,7 @@ floating point types are also provided as children of
Numerics.
_Extensions to Ada 95_
1.c/3
- {AI95-00296-01AI95-00296-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00296-01AI95-00296-01>} {<AI05-0299-1AI05-0299-1>} This
subclause It just provides an introduction to the following
subclauses.
@@ -115815,8 +116229,8 @@ G.3.1 Real Vectors and Matrices
_Static Semantics_
1/2
-{AI95-00296-01AI95-00296-01} {AI95-00418-01AI95-00418-01} The generic
-library package Numerics.Generic_Real_Arrays has the following
+{<AI95-00296-01AI95-00296-01>} {<AI95-00418-01AI95-00418-01>} The
+generic library package Numerics.Generic_Real_Arrays has the following
declaration:
2/2
@@ -115826,7 +116240,7 @@ declaration:
pragma Pure(Generic_Real_Arrays);
3/2
- -- Types
+ -- <Types>
4/2
type Real_Vector is array (Integer range <>) of Real'Base;
@@ -115834,10 +116248,10 @@ declaration:
of Real'Base;
5/2
- -- Subprograms for Real_Vector types
+ -- <Subprograms for Real_Vector types>
6/2
- -- Real_Vector arithmetic operations
+ -- <Real_Vector arithmetic operations>
7/2
function "+" (Right : Real_Vector) return Real_Vector;
@@ -115855,7 +116269,7 @@ declaration:
function "abs" (Right : Real_Vector) return Real'Base;
11/2
- -- Real_Vector scaling operations
+ -- <Real_Vector scaling operations>
12/2
function "*" (Left : Real'Base; Right : Real_Vector)
@@ -115866,7 +116280,7 @@ declaration:
return Real_Vector;
13/2
- -- Other Real_Vector operations
+ -- <Other Real_Vector operations>
14/2
function Unit_Vector (Index : Integer;
@@ -115874,10 +116288,10 @@ declaration:
First : Integer := 1) return Real_Vector;
15/2
- -- Subprograms for Real_Matrix types
+ -- <Subprograms for Real_Matrix types>
16/2
- -- Real_Matrix arithmetic operations
+ -- <Real_Matrix arithmetic operations>
17/2
function "+" (Right : Real_Matrix) return Real_Matrix;
@@ -115900,7 +116314,7 @@ declaration:
return Real_Vector;
21/2
- -- Real_Matrix scaling operations
+ -- <Real_Matrix scaling operations>
22/2
function "*" (Left : Real'Base; Right : Real_Matrix)
@@ -115911,7 +116325,7 @@ declaration:
return Real_Matrix;
23/2
- -- Real_Matrix inversion and related operations
+ -- <Real_Matrix inversion and related operations>
24/2
function Solve (A : Real_Matrix; X : Real_Vector) return Real_Vector;
@@ -115920,7 +116334,7 @@ declaration:
function Determinant (A : Real_Matrix) return Real'Base;
25/2
- -- Eigenvalues and vectors of a real symmetric matrix
+ -- <Eigenvalues and vectors of a real symmetric matrix>
26/2
function Eigenvalues (A : Real_Matrix) return Real_Vector;
@@ -115931,7 +116345,7 @@ declaration:
Vectors : out Real_Matrix);
28/2
- -- Other Real_Matrix operations
+ -- <Other Real_Matrix operations>
29/2
function Unit_Matrix (Order : Positive;
@@ -115942,8 +116356,8 @@ declaration:
end Ada.Numerics.Generic_Real_Arrays;
31/2
-{AI95-00296-01AI95-00296-01} The library package Numerics.Real_Arrays is
-declared pure and defines the same types and subprograms as
+{<AI95-00296-01AI95-00296-01>} The library package Numerics.Real_Arrays
+is declared pure and defines the same types and subprograms as
Numerics.Generic_Real_Arrays, except that the predefined type Float is
systematically substituted for Real'Base throughout. Nongeneric
equivalents for each of the other predefined floating point types are
@@ -115957,7 +116371,7 @@ Numerics.Long_Real_Arrays, etc.
be consistent with other Numerics packages.
32/2
-{AI95-00296-01AI95-00296-01} Two types are defined and exported by
+{<AI95-00296-01AI95-00296-01>} Two types are defined and exported by
Numerics.Generic_Real_Arrays. The composite type Real_Vector is
provided to represent a vector with components of type Real; it is
defined as an unconstrained, one-dimensional array with an index of type
@@ -115966,16 +116380,16 @@ matrix with components of type Real; it is defined
as an unconstrained,
two-dimensional array with indices of type Integer.
33/2
-{AI95-00296-01AI95-00296-01} The effect of the various subprograms is as
-described below. In most cases the subprograms are described in terms
-of corresponding scalar operations of the type Real; any exception
+{<AI95-00296-01AI95-00296-01>} The effect of the various subprograms is
+as described below. In most cases the subprograms are described in
+terms of corresponding scalar operations of the type Real; any exception
raised by those operations is propagated by the array operation.
Moreover, the accuracy of the result for each individual component is as
defined for the scalar operation unless stated otherwise.
34/2
-{AI95-00296-01AI95-00296-01} In the case of those operations which are
-defined to involve an inner product, Constraint_Error may be raised if
+{<AI95-00296-01AI95-00296-01>} In the case of those operations which are
+defined to <involve an inner product>, Constraint_Error may be raised if
an intermediate result is outside the range of Real'Base even though the
mathematical final result would not be.
@@ -115985,36 +116399,37 @@ mathematical final result would not be.
function "abs" (Right : Real_Vector) return Real_Vector;
36/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Right. The index range of the result is
- Right'Range.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Right. The index range of the
+ result is Right'Range.
37/2
function "+" (Left, Right : Real_Vector) return Real_Vector;
function "-" (Left, Right : Real_Vector) return Real_Vector;
38/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Left and the matching component of Right.
- The index range of the result is Left'Range. Constraint_Error
- is raised if Left'Length is not equal to Right'Length.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Left and the matching component of
+ Right. The index range of the result is Left'Range.
+ Constraint_Error is raised if Left'Length is not equal to
+ Right'Length.
39/2
function "*" (Left, Right : Real_Vector) return Real'Base;
40/2
- {AI95-00296-01AI95-00296-01} This operation returns the inner
- product of Left and Right. Constraint_Error is raised if
- Left'Length is not equal to Right'Length. This operation
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ inner product of Left and Right. Constraint_Error is raised
+ if Left'Length is not equal to Right'Length. This operation
involves an inner product.
41/2
function "abs" (Right : Real_Vector) return Real'Base;
42/2
- {AI95-00418-01AI95-00418-01} This operation returns the
+ {<AI95-00418-01AI95-00418-01>} This operation returns the
L2-norm of Right (the square root of the inner product of the
vector with itself).
@@ -116040,20 +116455,20 @@ mathematical final result would not be.
function "*" (Left : Real'Base; Right : Real_Vector) return Real_Vector;
44/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the scalar Left
- using the "*" operation of the type Real. The index range of
- the result is Right'Range.
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the scalar
+ Left using the "*" operation of the type Real. The index
+ range of the result is Right'Range.
45/2
function "*" (Left : Real_Vector; Right : Real'Base) return Real_Vector;
function "/" (Left : Real_Vector; Right : Real'Base) return Real_Vector;
46/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Left and to the scalar Right. The index
- range of the result is Left'Range.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Left and to the scalar Right. The
+ index range of the result is Left'Range.
47/2
function Unit_Vector (Index : Integer;
@@ -116061,8 +116476,8 @@ mathematical final result would not be.
First : Integer := 1) return Real_Vector;
48/2
- {AI95-00296-01AI95-00296-01} This function returns a unit
- vector with Order components and a lower bound of First. All
+ {<AI95-00296-01AI95-00296-01>} This function returns a <unit
+ vector> with Order components and a lower bound of First. All
components are set to 0.0 except for the Index component which
is set to 1.0. Constraint_Error is raised if Index < First,
Index > First + Order - 1 or if First + Order - 1 >
@@ -116074,16 +116489,16 @@ mathematical final result would not be.
function "abs" (Right : Real_Matrix) return Real_Matrix;
50/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Right. The index ranges of the result are
- those of Right.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Right. The index ranges of the
+ result are those of Right.
51/2
function Transpose (X : Real_Matrix) return Real_Matrix;
52/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
transpose of a matrix X. The first and second index ranges of
the result are X'Range(2) and X'Range(1) respectively.
@@ -116092,10 +116507,10 @@ mathematical final result would not be.
function "-" (Left, Right : Real_Matrix) return Real_Matrix;
54/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Left and the matching component of Right.
- The index ranges of the result are those of Left.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Left and the matching component of
+ Right. The index ranges of the result are those of Left.
Constraint_Error is raised if Left'Length(1) is not equal to
Right'Length(1) or Left'Length(2) is not equal to
Right'Length(2).
@@ -116104,7 +116519,7 @@ mathematical final result would not be.
function "*" (Left, Right : Real_Matrix) return Real_Matrix;
56/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for matrix multiplication.
The first and second index ranges of the result are
Left'Range(1) and Right'Range(2) respectively.
@@ -116115,17 +116530,17 @@ mathematical final result would not be.
function "*" (Left, Right : Real_Vector) return Real_Matrix;
58/2
- {AI95-00296-01AI95-00296-01} This operation returns the outer
- product of a (column) vector Left by a (row) vector Right
- using the operation "*" of the type Real for computing the
- individual components. The first and second index ranges of
- the result are Left'Range and Right'Range respectively.
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ outer product of a (column) vector Left by a (row) vector
+ Right using the operation "*" of the type Real for computing
+ the individual components. The first and second index ranges
+ of the result are Left'Range and Right'Range respectively.
59/2
function "*" (Left : Real_Vector; Right : Real_Matrix) return Real_Vector;
60/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for multiplication of a (row)
vector Left by a matrix Right. The index range of the (row)
vector result is Right'Range(2). Constraint_Error is raised
@@ -116136,7 +116551,7 @@ mathematical final result would not be.
function "*" (Left : Real_Matrix; Right : Real_Vector) return Real_Vector;
62/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for multiplication of a matrix
Left by a (column) vector Right. The index range of the
(column) vector result is Left'Range(1). Constraint_Error is
@@ -116147,27 +116562,27 @@ mathematical final result would not be.
function "*" (Left : Real'Base; Right : Real_Matrix) return Real_Matrix;
64/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the scalar Left
- using the "*" operation of the type Real. The index ranges of
- the result are those of Right.
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the scalar
+ Left using the "*" operation of the type Real. The index
+ ranges of the result are those of Right.
65/2
function "*" (Left : Real_Matrix; Right : Real'Base) return Real_Matrix;
function "/" (Left : Real_Matrix; Right : Real'Base) return Real_Matrix;
66/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation of the type Real to
- each component of Left and to the scalar Right. The index
- ranges of the result are those of Left.
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation of the type
+ Real to each component of Left and to the scalar Right. The
+ index ranges of the result are those of Left.
67/2
function Solve (A : Real_Matrix; X : Real_Vector) return Real_Vector;
68/2
- {AI95-00296-01AI95-00296-01} This function returns a vector Y
- such that X is (nearly) equal to A * Y. This is the standard
+ {<AI95-00296-01AI95-00296-01>} This function returns a vector
+ Y such that X is (nearly) equal to A * Y. This is the standard
mathematical operation for solving a single set of linear
equations. The index range of the result is A'Range(2).
Constraint_Error is raised if A'Length(1), A'Length(2), and
@@ -116195,8 +116610,8 @@ mathematical final result would not be.
function Solve (A, X : Real_Matrix) return Real_Matrix;
70/2
- {AI95-00296-01AI95-00296-01} This function returns a matrix Y
- such that X is (nearly) equal to A * Y. This is the standard
+ {<AI95-00296-01AI95-00296-01>} This function returns a matrix
+ Y such that X is (nearly) equal to A * Y. This is the standard
mathematical operation for solving several sets of linear
equations. The index ranges of the result are A'Range(2) and
X'Range(2). Constraint_Error is raised if A'Length(1),
@@ -116207,8 +116622,8 @@ mathematical final result would not be.
function Inverse (A : Real_Matrix) return Real_Matrix;
72/2
- {AI95-00296-01AI95-00296-01} This function returns a matrix B
- such that A * B is (nearly) equal to the unit matrix. The
+ {<AI95-00296-01AI95-00296-01>} This function returns a matrix
+ B such that A * B is (nearly) equal to the unit matrix. The
index ranges of the result are A'Range(2) and A'Range(1).
Constraint_Error is raised if A'Length(1) is not equal to
A'Length(2). Constraint_Error is raised if the matrix A is
@@ -116218,7 +116633,7 @@ mathematical final result would not be.
function Determinant (A : Real_Matrix) return Real'Base;
74/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
determinant of the matrix A. Constraint_Error is raised if
A'Length(1) is not equal to A'Length(2).
@@ -116226,7 +116641,7 @@ mathematical final result would not be.
function Eigenvalues(A : Real_Matrix) return Real_Vector;
76/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
eigenvalues of the symmetric matrix A as a vector sorted into
order with the largest first. Constraint_Error is raised if
A'Length(1) is not equal to A'Length(2). The index range of
@@ -116239,7 +116654,7 @@ mathematical final result would not be.
Vectors : out Real_Matrix);
78/3
- {AI95-00296-01AI95-00296-01} {AI05-0047-1AI05-0047-1} This
+ {<AI95-00296-01AI95-00296-01>} {<AI05-0047-1AI05-0047-1>} This
procedure computes both the eigenvalues and eigenvectors of
the symmetric matrix A. The out parameter Values is the same
as that obtained by calling the function Eigenvalues. The out
@@ -116257,18 +116672,19 @@ mathematical final result would not be.
does not converge quickly enough.
78.a/3
- Ramification: {AI05-0047-1AI05-0047-1} There is no requirement
- on the absolute direction of the returned eigenvectors. Thus
- they might be multiplied by -1. It is only the ratios of the
- components that matter. This is standard practice.
+ Ramification: {<AI05-0047-1AI05-0047-1>} There is no
+ requirement on the absolute direction of the returned
+ eigenvectors. Thus they might be multiplied by -1. It is
+ only the ratios of the components that matter. This is
+ standard practice.
79/2
function Unit_Matrix (Order : Positive;
First_1, First_2 : Integer := 1) return Real_Matrix;
80/2
- {AI95-00296-01AI95-00296-01} This function returns a square
- unit matrix with Order**2 components and lower bounds of
+ {<AI95-00296-01AI95-00296-01>} This function returns a square
+ <unit matrix> with Order**2 components and lower bounds of
First_1 and First_2 (for the first and second index ranges
respectively). All components are set to 0.0 except for the
main diagonal, whose components are set to 1.0.
@@ -116278,7 +116694,7 @@ mathematical final result would not be.
_Implementation Requirements_
81/2
-{AI95-00296-01AI95-00296-01} Accuracy requirements for the subprograms
+{<AI95-00296-01AI95-00296-01>} Accuracy requirements for the subprograms
Solve, Inverse, Determinant, Eigenvalues and Eigensystem are
implementation defined.
@@ -116295,17 +116711,17 @@ strict mode and the relaxed mode (see *note G.2::).
83/2
For operations involving an inner product, no requirements are specified
in the relaxed mode. In the strict mode the modulus of the absolute
-error of the inner product X*Y shall not exceed g*abs(X)*abs(Y) where g
-is defined as
+error of the inner product <X>*<Y> shall not exceed
+<g>*abs(<X>)*abs(<Y>) where <g> is defined as
84/2
- g = X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = <X>'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
85/2
-{AI95-00418-01AI95-00418-01} For the L2-norm, no accuracy requirements
+{<AI95-00418-01AI95-00418-01>} For the L2-norm, no accuracy requirements
are specified in the relaxed mode. In the strict mode the relative
-error on the norm shall not exceed g / 2.0 + 3.0 * Real'Model_Epsilon
-where g is defined as above.
+error on the norm shall not exceed <g> / 2.0 + 3.0 * Real'Model_Epsilon
+where <g> is defined as above.
85.a/2
Reason: This is simply the combination of the error on the
@@ -116317,7 +116733,7 @@ where g is defined as above.
_Documentation Requirements_
86/2
-{AI95-00296-01AI95-00296-01} Implementations shall document any
+{<AI95-00296-01AI95-00296-01>} Implementations shall document any
techniques used to reduce cancellation errors such as extended precision
arithmetic.
@@ -116339,32 +116755,32 @@ arithmetic.
Section 3.1.
86.c/3
- {AI05-0047-1AI05-0047-1} Note moreover that the componentwise
- accuracy requirements are not met by subcubic methods for
- matrix multiplication such as that devised by Strassen. These
- methods, which are typically used for the fast multiplication
- of very large matrices (e.g. order more than a few
- thousands), have normwise accuracy properties. If it is
- desired to use such methods, then distinct subprograms should
- be provided (perhaps in a child package). See Section 22.2.2
- in the above reference.
+ {<AI05-0047-1AI05-0047-1>} Note moreover that the
+ componentwise accuracy requirements are not met by subcubic
+ methods for matrix multiplication such as that devised by
+ Strassen. These methods, which are typically used for the
+ fast multiplication of very large matrices (e.g. order more
+ than a few thousands), have normwise accuracy properties. If
+ it is desired to use such methods, then distinct subprograms
+ should be provided (perhaps in a child package). See Section
+ 22.2.2 in the above reference.
_Implementation Permissions_
87/2
-{AI95-00296-01AI95-00296-01} The nongeneric equivalent packages may, but
-need not, be actual instantiations of the generic package for the
+{<AI95-00296-01AI95-00296-01>} The nongeneric equivalent packages may,
+but need not, be actual instantiations of the generic package for the
appropriate predefined type.
_Implementation Advice_
88/3
-{AI95-00296-01AI95-00296-01} {AI05-0264-1AI05-0264-1} Implementations
-should implement the Solve and Inverse functions using established
-techniques such as LU decomposition with row interchanges followed by
-back and forward substitution. Implementations are recommended to
-refine the result by performing an iteration on the residuals; if this
-is done, then it should be documented.
+{<AI95-00296-01AI95-00296-01>} {<AI05-0264-1AI05-0264-1>}
+Implementations should implement the Solve and Inverse functions using
+established techniques such as LU decomposition with row interchanges
+followed by back and forward substitution. Implementations are
+recommended to refine the result by performing an iteration on the
+residuals; if this is done, then it should be documented.
88.a/2
Implementation Advice: Solve and Inverse for
@@ -116393,7 +116809,7 @@ equality operator to compare the relevant components.
symmetric.
91/3
-{AI05-0047-1AI05-0047-1} An implementation should minimize the
+{<AI05-0047-1AI05-0047-1>} An implementation should minimize the
circumstances under which the algorithm used for Eigenvalues and
Eigensystem fails to converge.
@@ -116413,14 +116829,14 @@ Eigensystem fails to converge.
_Extensions to Ada 95_
91.b/2
- {AI95-00296-01AI95-00296-01} The package
+ {<AI95-00296-01AI95-00296-01>} The package
Numerics.Generic_Real_Arrays and its nongeneric equivalents
are new.
_Wording Changes from Ada 2005_
91.c/3
- {AI05-0047-1AI05-0047-1} Correction: Corrected various
+ {<AI05-0047-1AI05-0047-1>} Correction: Corrected various
accuracy and definition issues.
@@ -116432,7 +116848,7 @@ G.3.2 Complex Vectors and Matrices
_Static Semantics_
1/2
-{AI95-00296-01AI95-00296-01} The generic library package
+{<AI95-00296-01AI95-00296-01>} The generic library package
Numerics.Generic_Complex_Arrays has the following declaration:
2/2
@@ -116448,7 +116864,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
pragma Pure(Generic_Complex_Arrays);
3/2
- -- Types
+ -- <Types>
4/2
type Complex_Vector is array (Integer range <>) of Complex;
@@ -116456,10 +116872,10 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Integer range <>) of Complex;
5/2
- -- Subprograms for Complex_Vector types
+ -- <Subprograms for Complex_Vector types>
6/2
- -- Complex_Vector selection, conversion and composition operations
+ -- <Complex_Vector selection, conversion and composition operations>
7/2
function Re (X : Complex_Vector) return Real_Vector;
@@ -116493,7 +116909,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
return Complex_Vector;
12/2
- -- Complex_Vector arithmetic operations
+ -- <Complex_Vector arithmetic operations>
13/2
function "+" (Right : Complex_Vector) return Complex_Vector;
@@ -116508,10 +116924,10 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
function "*" (Left, Right : Complex_Vector) return Complex;
16/3
- {AI05-0047-1AI05-0047-1} function "abs" (Right : Complex_Vector)
return Real'Base;
+ {<AI05-0047-1AI05-0047-1>} function "abs" (Right : Complex_Vector)
return Real'Base;
17/2
- -- Mixed Real_Vector and Complex_Vector arithmetic operations
+ -- <Mixed Real_Vector and Complex_Vector arithmetic operations>
18/2
function "+" (Left : Real_Vector;
@@ -116530,7 +116946,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
return Complex;
20/2
- -- Complex_Vector scaling operations
+ -- <Complex_Vector scaling operations>
21/2
function "*" (Left : Complex;
@@ -116549,7 +116965,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Right : Real'Base) return Complex_Vector;
23/2
- -- Other Complex_Vector operations
+ -- <Other Complex_Vector operations>
24/2
function Unit_Vector (Index : Integer;
@@ -116557,10 +116973,10 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
First : Integer := 1) return Complex_Vector;
25/2
- -- Subprograms for Complex_Matrix types
+ -- <Subprograms for Complex_Matrix types>
26/2
- -- Complex_Matrix selection, conversion and composition operations
+ -- <Complex_Matrix selection, conversion and composition operations>
27/2
function Re (X : Complex_Matrix) return Real_Matrix;
@@ -116596,7 +117012,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
return Complex_Matrix;
33/2
- -- Complex_Matrix arithmetic operations
+ -- <Complex_Matrix arithmetic operations>
34/2
function "+" (Right : Complex_Matrix) return Complex_Matrix;
@@ -116619,7 +117035,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Right : Complex_Vector) return Complex_Vector;
38/2
- -- Mixed Real_Matrix and Complex_Matrix arithmetic operations
+ -- <Mixed Real_Matrix and Complex_Matrix arithmetic operations>
39/2
function "+" (Left : Real_Matrix;
@@ -116652,7 +117068,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Right : Real_Vector) return Complex_Vector;
42/2
- -- Complex_Matrix scaling operations
+ -- <Complex_Matrix scaling operations>
43/2
function "*" (Left : Complex;
@@ -116671,7 +117087,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Right : Real'Base) return Complex_Matrix;
45/2
- -- Complex_Matrix inversion and related operations
+ -- <Complex_Matrix inversion and related operations>
46/2
function Solve (A : Complex_Matrix; X : Complex_Vector)
@@ -116681,7 +117097,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
function Determinant (A : Complex_Matrix) return Complex;
47/2
- -- Eigenvalues and vectors of a Hermitian matrix
+ -- <Eigenvalues and vectors of a Hermitian matrix>
48/2
function Eigenvalues(A : Complex_Matrix) return Real_Vector;
@@ -116692,7 +117108,7 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
Vectors : out Complex_Matrix);
50/2
- -- Other Complex_Matrix operations
+ -- <Other Complex_Matrix operations>
51/2
function Unit_Matrix (Order : Positive;
@@ -116703,19 +117119,20 @@ Numerics.Generic_Complex_Arrays has the following
declaration:
end Ada.Numerics.Generic_Complex_Arrays;
53/2
-{AI95-00296-01AI95-00296-01} The library package Numerics.Complex_Arrays
-is declared pure and defines the same types and subprograms as
-Numerics.Generic_Complex_Arrays, except that the predefined type Float
-is systematically substituted for Real'Base, and the Real_Vector and
-Real_Matrix types exported by Numerics.Real_Arrays are systematically
-substituted for Real_Vector and Real_Matrix, and the Complex type
-exported by Numerics.Complex_Types is systematically substituted for
-Complex, throughout. Nongeneric equivalents for each of the other
-predefined floating point types are defined similarly, with the names
-Numerics.Short_Complex_Arrays, Numerics.Long_Complex_Arrays, etc.
+{<AI95-00296-01AI95-00296-01>} The library package
+Numerics.Complex_Arrays is declared pure and defines the same types and
+subprograms as Numerics.Generic_Complex_Arrays, except that the
+predefined type Float is systematically substituted for Real'Base, and
+the Real_Vector and Real_Matrix types exported by Numerics.Real_Arrays
+are systematically substituted for Real_Vector and Real_Matrix, and the
+Complex type exported by Numerics.Complex_Types is systematically
+substituted for Complex, throughout. Nongeneric equivalents for each of
+the other predefined floating point types are defined similarly, with
+the names Numerics.Short_Complex_Arrays, Numerics.Long_Complex_Arrays,
+etc.
54/2
-{AI95-00296-01AI95-00296-01} Two types are defined and exported by
+{<AI95-00296-01AI95-00296-01>} Two types are defined and exported by
Numerics.Generic_Complex_Arrays. The composite type Complex_Vector is
provided to represent a vector with components of type Complex; it is
defined as an unconstrained one-dimensional array with an index of type
@@ -116724,8 +117141,8 @@ matrix with components of type Complex; it is defined
as an
unconstrained, two-dimensional array with indices of type Integer.
55/2
-{AI95-00296-01AI95-00296-01} The effect of the various subprograms is as
-described below. In many cases they are described in terms of
+{<AI95-00296-01AI95-00296-01>} The effect of the various subprograms is
+as described below. In many cases they are described in terms of
corresponding scalar operations in Numerics.Generic_Complex_Types. Any
exception raised by those operations is propagated by the array
subprogram. Moreover, any constraints on the parameters and the
@@ -116733,13 +117150,13 @@ accuracy of the result for each individual
component are as defined for
the scalar operation.
56/2
-{AI95-00296-01AI95-00296-01} In the case of those operations which are
-defined to involve an inner product, Constraint_Error may be raised if
+{<AI95-00296-01AI95-00296-01>} In the case of those operations which are
+defined to <involve an inner product>, Constraint_Error may be raised if
an intermediate result has a component outside the range of Real'Base
even though the final mathematical result would not.
56.a/3
- Discussion: {AI05-0047-1AI05-0047-1} An inner product never
+ Discussion: {<AI05-0047-1AI05-0047-1>} An inner product never
involves implicit complex conjugation. If the product of a
vector with the conjugate of another (or the same) vector is
required, then this has to be stated explicitly by writing for
@@ -116751,8 +117168,8 @@ even though the final mathematical result would not.
function Im (X : Complex_Vector) return Real_Vector;
58/2
- {AI95-00296-01AI95-00296-01} Each function returns a vector of
- the specified Cartesian components of X. The index range of
+ {<AI95-00296-01AI95-00296-01>} Each function returns a vector
+ of the specified Cartesian components of X. The index range of
the result is X'Range.
59/2
@@ -116760,7 +117177,7 @@ even though the final mathematical result would not.
procedure Set_Im (X : in out Complex_Vector; Im : in Real_Vector);
60/2
- {AI95-00296-01AI95-00296-01} Each procedure replaces the
+ {<AI95-00296-01AI95-00296-01>} Each procedure replaces the
specified (Cartesian) component of each of the components of X
by the value of the matching component of Re or Im; the other
(Cartesian) component of each of the components is unchanged.
@@ -116774,9 +117191,9 @@ even though the final mathematical result would not.
return Complex_Vector;
62/2
- {AI95-00296-01AI95-00296-01} Each function constructs a vector
- of Complex results (in Cartesian representation) formed from
- given vectors of Cartesian components; when only the real
+ {<AI95-00296-01AI95-00296-01>} Each function constructs a
+ vector of Complex results (in Cartesian representation) formed
+ from given vectors of Cartesian components; when only the real
components are given, imaginary components of zero are
assumed. The index range of the result is Re'Range.
Constraint_Error is raised if Re'Length is not equal to
@@ -116791,7 +117208,7 @@ even though the final mathematical result would not.
Cycle : Real'Base) return Real_Vector;
64/2
- {AI95-00296-01AI95-00296-01} Each function calculates and
+ {<AI95-00296-01AI95-00296-01>} Each function calculates and
returns a vector of the specified polar components of X or
Right using the corresponding function in
numerics.generic_complex_types. The index range of the result
@@ -116805,9 +117222,9 @@ even though the final mathematical result would not.
return Complex_Vector;
66/2
- {AI95-00296-01AI95-00296-01} Each function constructs a vector
- of Complex results (in Cartesian representation) formed from
- given vectors of polar components using the corresponding
+ {<AI95-00296-01AI95-00296-01>} Each function constructs a
+ vector of Complex results (in Cartesian representation) formed
+ from given vectors of polar components using the corresponding
function in numerics.generic_complex_types on matching
components of Modulus and Argument. The index range of the
result is Modulus'Range. Constraint_Error is raised if
@@ -116818,8 +117235,8 @@ even though the final mathematical result would not.
function "-" (Right : Complex_Vector) return Complex_Vector;
68/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Right.
The index range of the result is Right'Range.
@@ -116827,8 +117244,8 @@ even though the final mathematical result would not.
function Conjugate (X : Complex_Vector) return Complex_Vector;
70/2
- {AI95-00296-01AI95-00296-01} This function returns the result
- of applying the appropriate function Conjugate in
+ {<AI95-00296-01AI95-00296-01>} This function returns the
+ result of applying the appropriate function Conjugate in
numerics.generic_complex_types to each component of X. The
index range of the result is X'Range.
@@ -116837,8 +117254,8 @@ even though the final mathematical result would not.
function "-" (Left, Right : Complex_Vector) return Complex_Vector;
72/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Left and
the matching component of Right. The index range of the
result is Left'Range. Constraint_Error is raised if
@@ -116848,16 +117265,16 @@ even though the final mathematical result would not.
function "*" (Left, Right : Complex_Vector) return Complex;
74/2
- {AI95-00296-01AI95-00296-01} This operation returns the inner
- product of Left and Right. Constraint_Error is raised if
- Left'Length is not equal to Right'Length. This operation
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ inner product of Left and Right. Constraint_Error is raised
+ if Left'Length is not equal to Right'Length. This operation
involves an inner product.
75/3
- {AI05-0047-1AI05-0047-1} function "abs" (Right : Complex_Vector) return
Real'Base;
+ {<AI05-0047-1AI05-0047-1>} function "abs" (Right : Complex_Vector) return
Real'Base;
76/2
- {AI95-00418-01AI95-00418-01} This operation returns the
+ {<AI95-00418-01AI95-00418-01>} This operation returns the
Hermitian L2-norm of Right (the square root of the inner
product of the vector with its conjugate).
@@ -116881,8 +117298,8 @@ even though the final mathematical result would not.
Right : Real_Vector) return Complex_Vector;
78/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Left and
the matching component of Right. The index range of the
result is Left'Range. Constraint_Error is raised if
@@ -116893,18 +117310,18 @@ even though the final mathematical result would not.
function "*" (Left : Complex_Vector; Right : Real_Vector) return
Complex;
80/2
- {AI95-00296-01AI95-00296-01} Each operation returns the inner
- product of Left and Right. Constraint_Error is raised if
- Left'Length is not equal to Right'Length. These operations
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ inner product of Left and Right. Constraint_Error is raised
+ if Left'Length is not equal to Right'Length. These operations
involve an inner product.
81/2
function "*" (Left : Complex; Right : Complex_Vector) return
Complex_Vector;
82/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the complex number
- Left using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the complex
+ number Left using the appropriate operation "*" in
numerics.generic_complex_types. The index range of the result
is Right'Range.
@@ -116913,8 +117330,8 @@ even though the final mathematical result would not.
function "/" (Left : Complex_Vector; Right : Complex) return
Complex_Vector;
84/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of the vector
Left and the complex number Right. The index range of the
result is Left'Range.
@@ -116924,9 +117341,9 @@ even though the final mathematical result would not.
Right : Complex_Vector) return Complex_Vector;
86/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the real number Left
- using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the real
+ number Left using the appropriate operation "*" in
numerics.generic_complex_types. The index range of the result
is Right'Range.
@@ -116937,8 +117354,8 @@ even though the final mathematical result would not.
Right : Real'Base) return Complex_Vector;
88/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of the vector
Left and the real number Right. The index range of the result
is Left'Range.
@@ -116949,8 +117366,8 @@ even though the final mathematical result would not.
First : Integer := 1) return Complex_Vector;
90/2
- {AI95-00296-01AI95-00296-01} This function returns a unit
- vector with Order components and a lower bound of First. All
+ {<AI95-00296-01AI95-00296-01>} This function returns a <unit
+ vector> with Order components and a lower bound of First. All
components are set to (0.0, 0.0) except for the Index
component which is set to (1.0, 0.0). Constraint_Error is
raised if Index < First, Index > First + Order - 1, or if
@@ -116961,16 +117378,16 @@ even though the final mathematical result would not.
function Im (X : Complex_Matrix) return Real_Matrix;
92/2
- {AI95-00296-01AI95-00296-01} Each function returns a matrix of
- the specified Cartesian components of X. The index ranges of
- the result are those of X.
+ {<AI95-00296-01AI95-00296-01>} Each function returns a matrix
+ of the specified Cartesian components of X. The index ranges
+ of the result are those of X.
93/2
procedure Set_Re (X : in out Complex_Matrix; Re : in Real_Matrix);
procedure Set_Im (X : in out Complex_Matrix; Im : in Real_Matrix);
94/2
- {AI95-00296-01AI95-00296-01} Each procedure replaces the
+ {<AI95-00296-01AI95-00296-01>} Each procedure replaces the
specified (Cartesian) component of each of the components of X
by the value of the matching component of Re or Im; the other
(Cartesian) component of each of the components is unchanged.
@@ -116985,10 +117402,10 @@ even though the final mathematical result would not.
return Complex_Matrix;
96/2
- {AI95-00296-01AI95-00296-01} Each function constructs a matrix
- of Complex results (in Cartesian representation) formed from
- given matrices of Cartesian components; when only the real
- components are given, imaginary components of zero are
+ {<AI95-00296-01AI95-00296-01>} Each function constructs a
+ matrix of Complex results (in Cartesian representation) formed
+ from given matrices of Cartesian components; when only the
+ real components are given, imaginary components of zero are
assumed. The index ranges of the result are those of Re.
Constraint_Error is raised if Re'Length(1) is not equal to
Im'Length(1) or Re'Length(2) is not equal to Im'Length(2).
@@ -117002,7 +117419,7 @@ even though the final mathematical result would not.
Cycle : Real'Base) return Real_Matrix;
98/2
- {AI95-00296-01AI95-00296-01} Each function calculates and
+ {<AI95-00296-01AI95-00296-01>} Each function calculates and
returns a matrix of the specified polar components of X or
Right using the corresponding function in
numerics.generic_complex_types. The index ranges of the
@@ -117016,22 +117433,22 @@ even though the final mathematical result would not.
return Complex_Matrix;
100/2
- {AI95-00296-01AI95-00296-01} Each function constructs a matrix
- of Complex results (in Cartesian representation) formed from
- given matrices of polar components using the corresponding
- function in numerics.generic_complex_types on matching
- components of Modulus and Argument. The index ranges of the
- result are those of Modulus. Constraint_Error is raised if
- Modulus'Length(1) is not equal to Argument'Length(1) or
- Modulus'Length(2) is not equal to Argument'Length(2).
+ {<AI95-00296-01AI95-00296-01>} Each function constructs a
+ matrix of Complex results (in Cartesian representation) formed
+ from given matrices of polar components using the
+ corresponding function in numerics.generic_complex_types on
+ matching components of Modulus and Argument. The index ranges
+ of the result are those of Modulus. Constraint_Error is
+ raised if Modulus'Length(1) is not equal to Argument'Length(1)
+ or Modulus'Length(2) is not equal to Argument'Length(2).
101/2
function "+" (Right : Complex_Matrix) return Complex_Matrix;
function "-" (Right : Complex_Matrix) return Complex_Matrix;
102/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Right.
The index ranges of the result are those of Right.
@@ -117039,8 +117456,8 @@ even though the final mathematical result would not.
function Conjugate (X : Complex_Matrix) return Complex_Matrix;
104/2
- {AI95-00296-01AI95-00296-01} This function returns the result
- of applying the appropriate function Conjugate in
+ {<AI95-00296-01AI95-00296-01>} This function returns the
+ result of applying the appropriate function Conjugate in
numerics.generic_complex_types to each component of X. The
index ranges of the result are those of X.
@@ -117048,7 +117465,7 @@ even though the final mathematical result would not.
function Transpose (X : Complex_Matrix) return Complex_Matrix;
106/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
transpose of a matrix X. The first and second index ranges of
the result are X'Range(2) and X'Range(1) respectively.
@@ -117057,8 +117474,8 @@ even though the final mathematical result would not.
function "-" (Left, Right : Complex_Matrix) return Complex_Matrix;
108/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Left and
the matching component of Right. The index ranges of the
result are those of Left. Constraint_Error is raised if
@@ -117069,7 +117486,7 @@ even though the final mathematical result would not.
function "*" (Left, Right : Complex_Matrix) return Complex_Matrix;
110/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for matrix multiplication.
The first and second index ranges of the result are
Left'Range(1) and Right'Range(2) respectively.
@@ -117080,9 +117497,9 @@ even though the final mathematical result would not.
function "*" (Left, Right : Complex_Vector) return Complex_Matrix;
112/2
- {AI95-00296-01AI95-00296-01} This operation returns the outer
- product of a (column) vector Left by a (row) vector Right
- using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ outer product of a (column) vector Left by a (row) vector
+ Right using the appropriate operation "*" in
numerics.generic_complex_types for computing the individual
components. The first and second index ranges of the result
are Left'Range and Right'Range respectively.
@@ -117092,7 +117509,7 @@ even though the final mathematical result would not.
Right : Complex_Matrix) return Complex_Vector;
114/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for multiplication of a (row)
vector Left by a matrix Right. The index range of the (row)
vector result is Right'Range(2). Constraint_Error is raised
@@ -117104,7 +117521,7 @@ even though the final mathematical result would not.
Right : Complex_Vector) return Complex_Vector;
116/2
- {AI95-00296-01AI95-00296-01} This operation provides the
+ {<AI95-00296-01AI95-00296-01>} This operation provides the
standard mathematical operation for multiplication of a matrix
Left by a (column) vector Right. The index range of the
(column) vector result is Left'Range(1). Constraint_Error is
@@ -117122,8 +117539,8 @@ even though the final mathematical result would not.
Right : Real_Matrix) return Complex_Matrix;
118/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of Left and
the matching component of Right. The index ranges of the
result are those of Left. Constraint_Error is raised if
@@ -117137,7 +117554,7 @@ even though the final mathematical result would not.
Right : Real_Matrix) return Complex_Matrix;
120/2
- {AI95-00296-01AI95-00296-01} Each operation provides the
+ {<AI95-00296-01AI95-00296-01>} Each operation provides the
standard mathematical operation for matrix multiplication.
The first and second index ranges of the result are
Left'Range(1) and Right'Range(2) respectively.
@@ -117151,9 +117568,9 @@ even though the final mathematical result would not.
Right : Real_Vector) return Complex_Matrix;
122/2
- {AI95-00296-01AI95-00296-01} Each operation returns the outer
- product of a (column) vector Left by a (row) vector Right
- using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ outer product of a (column) vector Left by a (row) vector
+ Right using the appropriate operation "*" in
numerics.generic_complex_types for computing the individual
components. The first and second index ranges of the result
are Left'Range and Right'Range respectively.
@@ -117165,7 +117582,7 @@ even though the final mathematical result would not.
Right : Real_Matrix) return Complex_Vector;
124/2
- {AI95-00296-01AI95-00296-01} Each operation provides the
+ {<AI95-00296-01AI95-00296-01>} Each operation provides the
standard mathematical operation for multiplication of a (row)
vector Left by a matrix Right. The index range of the (row)
vector result is Right'Range(2). Constraint_Error is raised
@@ -117179,7 +117596,7 @@ even though the final mathematical result would not.
Right : Real_Vector) return Complex_Vector;
126/2
- {AI95-00296-01AI95-00296-01} Each operation provides the
+ {<AI95-00296-01AI95-00296-01>} Each operation provides the
standard mathematical operation for multiplication of a matrix
Left by a (column) vector Right. The index range of the
(column) vector result is Left'Range(1). Constraint_Error is
@@ -117190,9 +117607,9 @@ even though the final mathematical result would not.
function "*" (Left : Complex; Right : Complex_Matrix) return
Complex_Matrix;
128/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the complex number
- Left using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the complex
+ number Left using the appropriate operation "*" in
numerics.generic_complex_types. The index ranges of the
result are those of Right.
@@ -117201,8 +117618,8 @@ even though the final mathematical result would not.
function "/" (Left : Complex_Matrix; Right : Complex) return
Complex_Matrix;
130/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of the matrix
Left and the complex number Right. The index ranges of the
result are those of Left.
@@ -117212,9 +117629,9 @@ even though the final mathematical result would not.
Right : Complex_Matrix) return Complex_Matrix;
132/2
- {AI95-00296-01AI95-00296-01} This operation returns the result
- of multiplying each component of Right by the real number Left
- using the appropriate operation "*" in
+ {<AI95-00296-01AI95-00296-01>} This operation returns the
+ result of multiplying each component of Right by the real
+ number Left using the appropriate operation "*" in
numerics.generic_complex_types. The index ranges of the
result are those of Right.
@@ -117225,8 +117642,8 @@ even though the final mathematical result would not.
Right : Real'Base) return Complex_Matrix;
134/2
- {AI95-00296-01AI95-00296-01} Each operation returns the result
- of applying the corresponding operation in
+ {<AI95-00296-01AI95-00296-01>} Each operation returns the
+ result of applying the corresponding operation in
numerics.generic_complex_types to each component of the matrix
Left and the real number Right. The index ranges of the
result are those of Left.
@@ -117235,8 +117652,8 @@ even though the final mathematical result would not.
function Solve (A : Complex_Matrix; X : Complex_Vector) return
Complex_Vector;
136/2
- {AI95-00296-01AI95-00296-01} This function returns a vector Y
- such that X is (nearly) equal to A * Y. This is the standard
+ {<AI95-00296-01AI95-00296-01>} This function returns a vector
+ Y such that X is (nearly) equal to A * Y. This is the standard
mathematical operation for solving a single set of linear
equations. The index range of the result is A'Range(2).
Constraint_Error is raised if A'Length(1), A'Length(2), and
@@ -117264,8 +117681,8 @@ even though the final mathematical result would not.
function Solve (A, X : Complex_Matrix) return Complex_Matrix;
138/2
- {AI95-00296-01AI95-00296-01} This function returns a matrix Y
- such that X is (nearly) equal to A * Y. This is the standard
+ {<AI95-00296-01AI95-00296-01>} This function returns a matrix
+ Y such that X is (nearly) equal to A * Y. This is the standard
mathematical operation for solving several sets of linear
equations. The index ranges of the result are A'Range(2) and
X'Range(2). Constraint_Error is raised if A'Length(1),
@@ -117276,8 +117693,8 @@ even though the final mathematical result would not.
function Inverse (A : Complex_Matrix) return Complex_Matrix;
140/2
- {AI95-00296-01AI95-00296-01} This function returns a matrix B
- such that A * B is (nearly) equal to the unit matrix. The
+ {<AI95-00296-01AI95-00296-01>} This function returns a matrix
+ B such that A * B is (nearly) equal to the unit matrix. The
index ranges of the result are A'Range(2) and A'Range(1).
Constraint_Error is raised if A'Length(1) is not equal to
A'Length(2). Constraint_Error is raised if the matrix A is
@@ -117287,7 +117704,7 @@ even though the final mathematical result would not.
function Determinant (A : Complex_Matrix) return Complex;
142/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
determinant of the matrix A. Constraint_Error is raised if
A'Length(1) is not equal to A'Length(2).
@@ -117295,7 +117712,7 @@ even though the final mathematical result would not.
function Eigenvalues(A : Complex_Matrix) return Real_Vector;
144/2
- {AI95-00296-01AI95-00296-01} This function returns the
+ {<AI95-00296-01AI95-00296-01>} This function returns the
eigenvalues of the Hermitian matrix A as a vector sorted into
order with the largest first. Constraint_Error is raised if
A'Length(1) is not equal to A'Length(2). The index range of
@@ -117315,7 +117732,7 @@ even though the final mathematical result would not.
Vectors : out Complex_Matrix);
146/3
- {AI95-00296-01AI95-00296-01} {AI05-0047-1AI05-0047-1} This
+ {<AI95-00296-01AI95-00296-01>} {<AI05-0047-1AI05-0047-1>} This
procedure computes both the eigenvalues and eigenvectors of
the Hermitian matrix A. The out parameter Values is the same
as that obtained by calling the function Eigenvalues. The out
@@ -117332,11 +117749,11 @@ even though the final mathematical result would not.
does not converge quickly enough.
146.a/3
- Ramification: {AI05-0047-1AI05-0047-1} There is no requirement
- on the absolute direction of the returned eigenvectors. Thus
- they might be multiplied by any complex number whose modulus
- is 1. It is only the ratios of the components that matter.
- This is standard practice.
+ Ramification: {<AI05-0047-1AI05-0047-1>} There is no
+ requirement on the absolute direction of the returned
+ eigenvectors. Thus they might be multiplied by any complex
+ number whose modulus is 1. It is only the ratios of the
+ components that matter. This is standard practice.
147/2
function Unit_Matrix (Order : Positive;
@@ -117344,8 +117761,8 @@ even though the final mathematical result would not.
return Complex_Matrix;
148/2
- {AI95-00296-01AI95-00296-01} This function returns a square
- unit matrix with Order**2 components and lower bounds of
+ {<AI95-00296-01AI95-00296-01>} This function returns a square
+ <unit matrix> with Order**2 components and lower bounds of
First_1 and First_2 (for the first and second index ranges
respectively). All components are set to (0.0, 0.0) except
for the main diagonal, whose components are set to (1.0, 0.0).
@@ -117355,7 +117772,7 @@ even though the final mathematical result would not.
_Implementation Requirements_
149/2
-{AI95-00296-01AI95-00296-01} Accuracy requirements for the subprograms
+{<AI95-00296-01AI95-00296-01>} Accuracy requirements for the subprograms
Solve, Inverse, Determinant, Eigenvalues and Eigensystem are
implementation defined.
@@ -117365,35 +117782,35 @@ implementation defined.
Eigensystem for type Complex_Matrix.
150/2
-{AI95-00296-01AI95-00296-01} For operations not involving an inner
+{<AI95-00296-01AI95-00296-01>} For operations not involving an inner
product, the accuracy requirements are those of the corresponding
operations of the type Real'Base and Complex in both the strict mode and
the relaxed mode (see *note G.2::).
151/2
-{AI95-00296-01AI95-00296-01} For operations involving an inner product,
-no requirements are specified in the relaxed mode. In the strict mode
-the modulus of the absolute error of the inner product X*Y shall not
-exceed g*abs(X)*abs(Y) where g is defined as
+{<AI95-00296-01AI95-00296-01>} For operations involving an inner
+product, no requirements are specified in the relaxed mode. In the
+strict mode the modulus of the absolute error of the inner product
+<X>*<Y> shall not exceed <g>*abs(<X>)*abs(<Y>) where <g> is defined as
152/2
- g = X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = <X>'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
for mixed complex and real operands
153/2
- g = sqrt(2.0) * X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = sqrt(2.0) * <X>'Length * Real'Machine_Radix**(1 -
Real'Model_Mantissa)
for two complex operands
154/2
-{AI95-00418-01AI95-00418-01} For the L2-norm, no accuracy requirements
+{<AI95-00418-01AI95-00418-01>} For the L2-norm, no accuracy requirements
are specified in the relaxed mode. In the strict mode the relative
-error on the norm shall not exceed g / 2.0 + 3.0 * Real'Model_Epsilon
-where g has the definition appropriate for two complex operands.
+error on the norm shall not exceed <g> / 2.0 + 3.0 * Real'Model_Epsilon
+where <g> has the definition appropriate for two complex operands.
_Documentation Requirements_
155/2
-{AI95-00296-01AI95-00296-01} Implementations shall document any
+{<AI95-00296-01AI95-00296-01>} Implementations shall document any
techniques used to reduce cancellation errors such as extended precision
arithmetic.
@@ -117417,12 +117834,12 @@ arithmetic.
_Implementation Permissions_
156/2
-{AI95-00296-01AI95-00296-01} The nongeneric equivalent packages may, but
-need not, be actual instantiations of the generic package for the
+{<AI95-00296-01AI95-00296-01>} The nongeneric equivalent packages may,
+but need not, be actual instantiations of the generic package for the
appropriate predefined type.
157/2
-{AI95-00296-01AI95-00296-01} Although many operations are defined in
+{<AI95-00296-01AI95-00296-01>} Although many operations are defined in
terms of operations from numerics.generic_complex_types, they need not
be implemented by calling those operations provided that the effect is
the same.
@@ -117430,11 +117847,11 @@ the same.
_Implementation Advice_
158/3
-{AI95-00296-01AI95-00296-01} {AI05-0264-1AI05-0264-1} Implementations
-should implement the Solve and Inverse functions using established
-techniques. Implementations are recommended to refine the result by
-performing an iteration on the residuals; if this is done, then it
-should be documented.
+{<AI95-00296-01AI95-00296-01>} {<AI05-0264-1AI05-0264-1>}
+Implementations should implement the Solve and Inverse functions using
+established techniques. Implementations are recommended to refine the
+result by performing an iteration on the residuals; if this is done,
+then it should be documented.
158.a/2
Implementation Advice: Solve and Inverse for
@@ -117443,7 +117860,7 @@ should be documented.
iteration on the residuals.
159/2
-{AI95-00296-01AI95-00296-01} It is not the intention that any special
+{<AI95-00296-01AI95-00296-01>} It is not the intention that any special
provision should be made to determine whether a matrix is
ill-conditioned or not. The naturally occurring overflow (including
division by zero) which will result from executing these functions with
@@ -117454,10 +117871,10 @@ an ill-conditioned matrix and thus raise
Constraint_Error is sufficient.
document with this paragraph.
160/2
-{AI95-00296-01AI95-00296-01} The test that a matrix is Hermitian should
-use the equality operator to compare the real components and negation
-followed by equality to compare the imaginary components (see *note
-G.2.1::).
+{<AI95-00296-01AI95-00296-01>} The test that a matrix is Hermitian
+should use the equality operator to compare the real components and
+negation followed by equality to compare the imaginary components (see
+*note G.2.1::).
160.a/2
Implementation Advice: The equality and negation operators
@@ -117481,7 +117898,7 @@ algorithm used for Eigenvalues and Eigensystem fails
to converge.
The Algebraic Eigenvalue Problem, Oxford University Press.
161/2
-{AI95-00296-01AI95-00296-01} Implementations should not perform
+{<AI95-00296-01AI95-00296-01>} Implementations should not perform
operations on mixed complex and real operands by first converting the
real operand to complex. See *note G.1.1::.
@@ -117493,14 +117910,14 @@ real operand to complex. See *note G.1.1::.
_Extensions to Ada 95_
161.b/2
- {AI95-00296-01AI95-00296-01} The package
+ {<AI95-00296-01AI95-00296-01>} The package
Numerics.Generic_Complex_Arrays and its nongeneric equivalents
are new.
_Wording Changes from Ada 2005_
161.c/3
- {AI05-0047-1AI05-0047-1} Correction: Corrected various
+ {<AI05-0047-1AI05-0047-1>} Correction: Corrected various
accuracy and definition issues.
@@ -117510,8 +117927,8 @@ Annex H High Integrity Systems
******************************
1/2
-{AI95-00347-01AI95-00347-01} This Annex addresses requirements for high
-integrity systems (including safety-critical systems and
+{<AI95-00347-01AI95-00347-01>} This Annex addresses requirements for
+high integrity systems (including safety-critical systems and
security-critical systems). It provides facilities and specifies
documentation requirements that relate to several needs:
@@ -117529,7 +117946,7 @@ documentation requirements that relate to several
needs:
Execution understandability is supported by pragma Normalize_Scalars,
and also by requirements for the implementation to document the effect
of a program in the presence of a bounded error or where the language
-rules leave the effect unspecified.
+rules leave the effect unspecified.
5
The pragmas Reviewable and Restrictions relate to the other requirements
@@ -117561,7 +117978,7 @@ addressed by this Annex.
_Wording Changes from Ada 95_
6.c/2
- {AI95-00347-01AI95-00347-01} The title of this annex was
+ {<AI95-00347-01AI95-00347-01>} The title of this annex was
changed to better reflect its purpose and scope. High
integrity systems has become the standard way of identifying
systems that have high reliability requirements; it subsumes
@@ -117611,8 +118028,8 @@ compilation_units included in a partition.
_Documentation Requirements_
5/2
-{AI95-00434-01AI95-00434-01} If a pragma Normalize_Scalars applies, the
-implementation shall document the implicit initial values for scalar
+{<AI95-00434-01AI95-00434-01>} If a pragma Normalize_Scalars applies,
+the implementation shall document the implicit initial values for scalar
subtypes, and shall identify each case in which such a value is used and
is not an invalid representation.
@@ -117649,7 +118066,7 @@ is not an invalid representation.
_Implementation Advice_
6/2
-{AI95-00434-01AI95-00434-01} Whenever possible, the implicit initial
+{<AI95-00434-01AI95-00434-01>} Whenever possible, the implicit initial
values for a scalar subtype should be an invalid representation (see
*note 13.9.1::).
@@ -117712,7 +118129,7 @@ annotated listing for a given unit or partition. See
also *note
1.1.3::, and *note 1.1.2::.]
1.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
1.b/2
Documentation Requirement: The range of effects for each
@@ -117833,11 +118250,11 @@ compilation unit to which such a pragma applies:
compiler will detect, it is not easy to test for this. In
practice, it is thought that compilers claiming conformity to
this Annex will perform significant optimizations and
- therefore will detect such situations. Of course, such events
- could well indicate a programmer error.
+ therefore <will> detect such situations. Of course, such
+ events could well indicate a programmer error.
8/2
- * {AI95-00209-01AI95-00209-01} For each read of a scalar object, an
+ * {<AI95-00209-01AI95-00209-01>} For each read of a scalar object, an
identification of the read as either "known to be initialized," or
"possibly uninitialized," independent of whether pragma
Normalize_Scalars applies;
@@ -118005,7 +118422,7 @@ also in an appropriate numeric format (such as
hexadecimal or octal).
_Wording Changes from Ada 95_
21.b/2
- {AI95-00209-01AI95-00209-01} The wording was clarified that
+ {<AI95-00209-01AI95-00209-01>} The wording was clarified that
pragma Reviewable applies to each read of an object, as it
makes no sense to talk about the state of an object that will
immediately be overwritten.
@@ -118032,13 +118449,13 @@ unit. The purpose of such a pragma is to
facilitate code validation.
The form of a pragma Inspection_Point is as follows:
3
- pragma Inspection_Point[(object_name {, object_name})];
+ pragma Inspection_Point[(<object_>name {, <object_>name})];
_Legality Rules_
4
A pragma Inspection_Point is allowed wherever a declarative_item or
-statement is allowed. Each object_name shall statically denote the
+statement is allowed. Each <object_>name shall statically denote the
declaration of an object.
4.a
@@ -118048,13 +118465,13 @@ declaration of an object.
_Static Semantics_
5/2
-{8652/00938652/0093} {AI95-00207-01AI95-00207-01}
-{AI95-00434-01AI95-00434-01} An inspection point is a point in the
+{<8652/00938652/0093>} {<AI95-00207-01AI95-00207-01>}
+{<AI95-00434-01AI95-00434-01>} An <inspection point> is a point in the
object code corresponding to the occurrence of a pragma Inspection_Point
-in the compilation unit. An object is inspectable at an inspection point
-if the corresponding pragma Inspection_Point either has an argument
-denoting that object, or has no arguments and the declaration of the
-object is visible at the inspection point.
+in the compilation unit. An object is <inspectable> at an inspection
+point if the corresponding pragma Inspection_Point either has an
+argument denoting that object, or has no arguments and the declaration
+of the object is visible at the inspection point.
5.a
Ramification: If a pragma Inspection_Point is in an in-lined
@@ -118065,27 +118482,28 @@ object is visible at the inspection point.
by an optimizer.
5.a.1/1
- {8652/00938652/0093} {AI95-00207-01AI95-00207-01} The short
- form of the pragma is a convenient shorthand for listing all
- objects which could be explicitly made inspectable by the long
- form of the pragma; thus only visible objects are made
+ {<8652/00938652/0093>} {<AI95-00207-01AI95-00207-01>} The
+ short form of the pragma is a convenient shorthand for listing
+ all objects which could be explicitly made inspectable by the
+ long form of the pragma; thus only visible objects are made
inspectable by it. Objects that are not visible at the point
of the pragma are not made inspectable by the short form
pragma. This is necessary so that implementations need not
keep information about (or prevent optimizations on) a unit
- simply because some other unit might contain a short form
+ simply because some other unit <might> contain a short form
Inspection_Point pragma.
5.b/1
- Discussion: {8652/00938652/0093} {AI95-00207-01AI95-00207-01}
- If the short form of the pragma is used, then all visible
- objects are inspectable. This implies that global objects
- from other compilation units are inspectable. A good
- interactive debugging system could provide information similar
- to a post-mortem dump at such inspection points. The annex
- does not require that any inspection facility is provided,
- merely that the information is available to understand the
- state of the machine at those points.
+ Discussion: {<8652/00938652/0093>}
+ {<AI95-00207-01AI95-00207-01>} If the short form of the pragma
+ is used, then all visible objects are inspectable. This
+ implies that global objects from other compilation units are
+ inspectable. A good interactive debugging system could
+ provide information similar to a post-mortem dump at such
+ inspection points. The annex does not require that any
+ inspection facility is provided, merely that the information
+ is available to understand the state of the machine at those
+ points.
_Dynamic Semantics_
@@ -118093,7 +118511,7 @@ object is visible at the inspection point.
Execution of a pragma Inspection_Point has no effect.
6.a/2
- Discussion: {AI95-00114-01AI95-00114-01} Although an
+ Discussion: {<AI95-00114-01AI95-00114-01>} Although an
inspection point has no (semantic) effect, the removal or
adding of a new point could change the machine code generated
by the compiler.
@@ -118120,7 +118538,7 @@ memory locations or registers) from which the
object's value can be
obtained.
8.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
8.b/2
Documentation Requirement: For each inspection point, a
@@ -118131,7 +118549,7 @@ obtained.
NOTES
9/2
- 7 {AI95-00209-01AI95-00209-01} The implementation is not allowed
+ 7 {<AI95-00209-01AI95-00209-01>} The implementation is not allowed
to perform "dead store elimination" on the last assignment to a
variable prior to a point where the variable is inspectable. Thus
an inspection point has the effect of an implicit read of each of
@@ -118166,13 +118584,13 @@ obtained.
_Wording Changes from Ada 95_
11.b/2
- {8652/00938652/0093} {AI95-00207-01AI95-00207-01} Corrigendum:
- Corrected the definition of the Inspection_Point pragma to
- apply to only variables visible at the point of the pragma.
- Otherwise, the compiler would have to assume that some other
- code somewhere could have a pragma Inspection_Point,
- preventing many optimizations (such as unused object
- elimination).
+ {<8652/00938652/0093>} {<AI95-00207-01AI95-00207-01>}
+ Corrigendum: Corrected the definition of the Inspection_Point
+ pragma to apply to only variables visible at the point of the
+ pragma. Otherwise, the compiler would have to assume that
+ some other code somewhere could have a pragma
+ Inspection_Point, preventing many optimizations (such as
+ unused object elimination).
File: aarm2012.info, Node: H.4, Next: H.5, Prev: H.3, Up: Annex H
@@ -118181,13 +118599,13 @@ H.4 High Integrity Restrictions
===============================
1/3
-{AI05-0299-1AI05-0299-1} This subclause defines restrictions that can be
-used with pragma Restrictions (see *note 13.12::); these facilitate the
-demonstration of program correctness by allowing tailored versions of
-the run-time system.
+{<AI05-0299-1AI05-0299-1>} This subclause defines restrictions that can
+be used with pragma Restrictions (see *note 13.12::); these facilitate
+the demonstration of program correctness by allowing tailored versions
+of the run-time system.
1.a/3
- Discussion: {AI05-0005-1AI05-0005-1} Note that the
+ Discussion: {<AI05-0005-1AI05-0005-1>} Note that the
restrictions are absolute. If a partition has 100 library
units and just one needs Unchecked_Conversion, then the pragma
cannot be used to ensure the other 99 units do not use
@@ -118199,12 +118617,12 @@ the run-time system.
_Static Semantics_
2/2
-This paragraph was deleted.{AI95-00347-01AI95-00347-01}
-{AI95-00394-01AI95-00394-01}
+<This paragraph was deleted.>{<AI95-00347-01AI95-00347-01>}
+{<AI95-00394-01AI95-00394-01>}
3/2
-{AI95-00394-01AI95-00394-01} The following restriction_identifiers are
-language defined:
+{<AI95-00394-01AI95-00394-01>} The following <restriction_>identifiers
+are language defined:
4
Tasking-related restriction:
@@ -118222,7 +118640,7 @@ No_Allocators
There are no occurrences of an allocator.
8/1
-{8652/00428652/0042} {AI95-00130AI95-00130} No_Local_Allocators
+{<8652/00428652/0042>} {<AI95-00130AI95-00130>} No_Local_Allocators
Allocators are prohibited in subprograms, generic
subprograms, tasks, and entry bodies.
@@ -118232,26 +118650,27 @@ No_Allocators
main subprogram is invoked.
8.b/1
- This paragraph was deleted.{8652/00428652/0042}
- {AI95-00130AI95-00130}
+ <This paragraph was deleted.>{<8652/00428652/0042>}
+ {<AI95-00130AI95-00130>}
8.1/3
-{AI05-0152-1AI05-0152-1} {AI05-0262-1AI05-0262-1}
+{<AI05-0152-1AI05-0152-1>} {<AI05-0262-1AI05-0262-1>}
No_Anonymous_Allocators
There are no allocators of anonymous access types.
8.2/3
-{AI05-0190-1AI05-0190-1} No_Coextensions
+{<AI05-0190-1AI05-0190-1>} No_Coextensions
There are no coextensions. See *note 3.10.2::.
8.3/3
-{AI05-0190-1AI05-0190-1} No_Access_Parameter_Allocators
+{<AI05-0190-1AI05-0190-1>} No_Access_Parameter_Allocators
Allocators are not permitted as the actual parameter to
an access parameter. See *note 6.1::.
9/2
- This paragraph was deleted.{AI95-00394-01AI95-00394-01}
+ <This paragraph was
+ deleted.>{<AI95-00394-01AI95-00394-01>}
10
Immediate_Reclamation
@@ -118259,7 +118678,7 @@ Immediate_Reclamation
allocators and not deallocated via unchecked
deallocation, any storage reserved at run time for an
object is immediately reclaimed when the object no longer
- exists.
+ exists.
10.a
Discussion: Immediate reclamation would apply to storage
@@ -118297,7 +118716,7 @@ No_Floating_Point
allowed.
14.a/2
- Discussion: {AI95-00114-01AI95-00114-01} The intention is to
+ Discussion: {<AI95-00114-01AI95-00114-01>} The intention is to
avoid the use of floating point hardware at run time, but this
is expressed in language terms. It is conceivable that
floating point is used implicitly in some contexts, say fixed
@@ -118324,12 +118743,13 @@ No_Fixed_Point
16/2
- This paragraph was deleted.{AI95-00394-01AI95-00394-01}
+ <This paragraph was
+ deleted.>{<AI95-00394-01AI95-00394-01>}
17
No_Access_Subprograms
The declaration of access-to-subprogram types is not
- allowed.
+ allowed.
17.a.1/2
Discussion: Most critical applications would require some
@@ -118350,7 +118770,7 @@ No_Dispatch
subtype T.
20/2
-{AI95-00285-01AI95-00285-01} No_IO
+{<AI95-00285-01AI95-00285-01>} No_IO
Semantic dependence on any of the library units
Sequential_IO, Direct_IO, Text_IO, Wide_Text_IO,
Wide_Wide_Text_IO, or Stream_IO is not allowed.
@@ -118388,31 +118808,31 @@ No_Reentrancy
_Implementation Requirements_
23.1/2
-{AI95-00394-01AI95-00394-01} An implementation of this Annex shall
+{<AI95-00394-01AI95-00394-01>} An implementation of this Annex shall
support:
23.2/2
* the restrictions defined in this subclause; and
23.3/3
- * {AI05-0189-1AI05-0189-1} the following restrictions defined in
+ * {<AI05-0189-1AI05-0189-1>} the following restrictions defined in
*note D.7::: No_Task_Hierarchy, No_Abort_Statement,
No_Implicit_Heap_Allocation,
No_Standard_Allocators_After_Elaboration; and
23.4/2
- * {AI95-00347-01AI95-00347-01} the pragma Profile(Ravenscar); and
+ * {<AI95-00347-01AI95-00347-01>} the pragma Profile(Ravenscar); and
23.a/2
- Discussion: {AI95-00347-01AI95-00347-01} The reference to
+ Discussion: {<AI95-00347-01AI95-00347-01>} The reference to
pragma Profile(Ravenscar) is intended to show that properly
restricted tasking is appropriate for use in high integrity
systems. The Ada 95 Annex seemed to suggest that tasking was
inappropriate for such systems.
23.5/2
- * the following uses of restriction_parameter_identifiers defined in
- *note D.7::[, which are checked prior to program execution]:
+ * the following uses of <restriction_parameter_>identifiers defined
+ in *note D.7::[, which are checked prior to program execution]:
23.6/2
* Max_Task_Entries => 0,
@@ -118424,13 +118844,13 @@ support:
* Max_Tasks => 0.
24/3
-{AI05-0263-1AI05-0263-1} {AI05-0272-1AI05-0272-1} If an implementation
-supports pragma Restrictions for a particular argument, then except for
-the restrictions No_Unchecked_Deallocation, No_Unchecked_Conversion,
-No_Access_Subprograms, No_Unchecked_Access, No_Specification_of_Aspect,
-No_Use_of_Attribute, No_Use_of_Pragma, and the equivalent use of
-No_Dependence, the associated restriction applies to the run-time
-system.
+{<AI05-0263-1AI05-0263-1>} {<AI05-0272-1AI05-0272-1>} If an
+implementation supports pragma Restrictions for a particular argument,
+then except for the restrictions No_Unchecked_Deallocation,
+No_Unchecked_Conversion, No_Access_Subprograms, No_Unchecked_Access,
+No_Specification_of_Aspect, No_Use_of_Attribute, No_Use_of_Pragma, and
+the equivalent use of No_Dependence, the associated restriction applies
+to the run-time system.
24.a
Reason: Permission is granted for the run-time system to use
@@ -118461,9 +118881,10 @@ system.
needs to be applied in an appropriate fashion.
24.e/3
- {AI05-0263-1AI05-0263-1} "the equivalent use of No_Dependence"
- refers to No_Dependence => Ada.Unchecked_Conversion and the
- like, not all uses of No_Dependence.
+ {<AI05-0263-1AI05-0263-1>} "the equivalent use of
+ No_Dependence" refers to No_Dependence =>
+ Ada.Unchecked_Conversion and the like, not all uses of
+ No_Dependence.
_Documentation Requirements_
@@ -118474,7 +118895,7 @@ checks are still performed automatically (for
example, an overflow check
performed by the processor).
25.a/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
25.b/2
Documentation Requirement: If a pragma
@@ -118482,7 +118903,7 @@ performed by the processor).
constructs where language-defined checks are still performed.
25.c/2
- Discussion: {AI95-00114-01AI95-00114-01} The documentation
+ Discussion: {<AI95-00114-01AI95-00114-01>} The documentation
requirements here are quite difficult to satisfy. One method
is to review the object code generated and determine the
checks that are still present, either explicitly, or
@@ -118514,20 +118935,20 @@ the execution of a subprogram by a task, another
task invokes the same
subprogram.
27.a/3
- Discussion: {AI05-0005-1AI05-0005-1} In practice, many
+ Discussion: {<AI05-0005-1AI05-0005-1>} In practice, many
implementations might not exploit the absence of recursion or
need for reentrancy, in which case the program execution would
be unaffected by the use of recursion or reentrancy, even
though the program is still formally erroneous.
27.b/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
NOTES
28/2
- 10 {AI95-00394-01AI95-00394-01} Uses of
- restriction_parameter_identifier No_Dependence defined in *note
+ 10 {<AI95-00394-01AI95-00394-01>} Uses of
+ <restriction_parameter_>identifier No_Dependence defined in *note
13.12.1::: No_Dependence => Ada.Unchecked_Deallocation and
No_Dependence => Ada.Unchecked_Conversion may be appropriate for
high-integrity systems. Other uses of No_Dependence can also be
@@ -118547,52 +118968,52 @@ subprogram.
_Extensions to Ada 95_
28.c/2
- {8652/00428652/0042} {AI95-00130-01AI95-00130-01}
+ {<8652/00428652/0042>} {<AI95-00130-01AI95-00130-01>}
No_Local_Allocators no longer prohibits generic
instantiations.
_Wording Changes from Ada 95_
28.d/2
- {AI95-00285-01AI95-00285-01} Wide_Wide_Text_IO (which is new)
- is added to the No_IO restriction.
+ {<AI95-00285-01AI95-00285-01>} Wide_Wide_Text_IO (which is
+ new) is added to the No_IO restriction.
28.e/3
- {AI95-00347-01AI95-00347-01} {AI05-0299-1AI05-0299-1} The
+ {<AI95-00347-01AI95-00347-01>} {<AI05-0299-1AI05-0299-1>} The
title of this subclause was changed to match the change to the
Annex title. Pragma Profile(Ravenscar) is part of this annex.
28.f/2
- {AI95-00394-01AI95-00394-01} Restriction No_Dependence is used
- instead of special restriction_identifiers. The old names are
- banished to Obsolescent Features (see *note J.13::).
+ {<AI95-00394-01AI95-00394-01>} Restriction No_Dependence is
+ used instead of special <restriction_>identifiers. The old
+ names are banished to Obsolescent Features (see *note J.13::).
28.g/2
- {AI95-00394-01AI95-00394-01} The bizarre wording "apply in
+ {<AI95-00394-01AI95-00394-01>} The bizarre wording "apply in
this Annex" (which no one quite can explain the meaning of) is
banished.
_Extensions to Ada 2005_
28.h/3
- {AI05-0152-1AI05-0152-1} {AI05-0190-1AI05-0190-1} Restrictions
- No_Anonymous_Allocators, No_Coextensions, and
+ {<AI05-0152-1AI05-0152-1>} {<AI05-0190-1AI05-0190-1>}
+ Restrictions No_Anonymous_Allocators, No_Coextensions, and
No_Access_Parameter_Allocators are new.
_Wording Changes from Ada 2005_
28.i/3
- {AI05-0189-1AI05-0189-1} New restriction
+ {<AI05-0189-1AI05-0189-1>} New restriction
No_Standard_Allocators_After_Elaboration is added to the list
of restrictions that are required by this annex.
28.j/3
- {AI05-0263-1AI05-0263-1} Correction: Ada 2005 restriction
+ {<AI05-0263-1AI05-0263-1>} Correction: Ada 2005 restriction
No_Dependence is added where needed (this was missed in Ada
2005).
28.k/3
- {AI05-0272-1AI05-0272-1} Restrictions against individual
+ {<AI05-0272-1AI05-0272-1>} Restrictions against individual
aspects, pragmas, and attributes do not apply to the run-time
system, in order that an implementation can use whatever
aspects, pragmas, and attributes are needed to do the job.
@@ -118607,14 +119028,14 @@ H.5 Pragma Detect_Blocking
==========================
1/2
-{AI95-00305-01AI95-00305-01} The following pragma forces an
+{<AI95-00305-01AI95-00305-01>} The following pragma forces an
implementation to detect potentially blocking operations within a
protected operation.
_Syntax_
2/2
- {AI95-00305-01AI95-00305-01} The form of a pragma Detect_Blocking
+ {<AI95-00305-01AI95-00305-01>} The form of a pragma Detect_Blocking
is as follows:
3/2
@@ -118623,34 +119044,34 @@ protected operation.
_Post-Compilation Rules_
4/2
-{AI95-00305-01AI95-00305-01} A pragma Detect_Blocking is a configuration
-pragma.
+{<AI95-00305-01AI95-00305-01>} A pragma Detect_Blocking is a
+configuration pragma.
_Dynamic Semantics_
5/2
-{AI95-00305-01AI95-00305-01} An implementation is required to detect a
+{<AI95-00305-01AI95-00305-01>} An implementation is required to detect a
potentially blocking operation within a protected operation, and to
raise Program_Error (see *note 9.5.1::).
_Implementation Permissions_
6/2
-{AI95-00305-01AI95-00305-01} An implementation is allowed to reject a
+{<AI95-00305-01AI95-00305-01>} An implementation is allowed to reject a
compilation_unit if a potentially blocking operation is present directly
within an entry_body or the body of a protected subprogram.
NOTES
7/2
- 11 {AI95-00305-01AI95-00305-01} An operation that causes a task to
- be blocked within a foreign language domain is not defined to be
+ 11 {<AI95-00305-01AI95-00305-01>} An operation that causes a task
+ to be blocked within a foreign language domain is not defined to be
potentially blocking, and need not be detected.
_Extensions to Ada 95_
7.a/2
- {AI95-00305-01AI95-00305-01} Pragma Detect_Blocking is new.
+ {<AI95-00305-01AI95-00305-01>} Pragma Detect_Blocking is new.
File: aarm2012.info, Node: H.6, Prev: H.5, Up: Annex H
@@ -118659,25 +119080,25 @@ H.6 Pragma Partition_Elaboration_Policy
=======================================
1/3
-{AI95-00265-01AI95-00265-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00265-01AI95-00265-01>} {<AI05-0299-1AI05-0299-1>} This subclause
defines a pragma for user control over elaboration policy.
_Syntax_
2/2
- {AI95-00265-01AI95-00265-01} The form of a pragma
+ {<AI95-00265-01AI95-00265-01>} The form of a pragma
Partition_Elaboration_Policy is as follows:
3/2
- pragma Partition_Elaboration_Policy (policy_identifier);
+ pragma Partition_Elaboration_Policy (<policy_>identifier);
4/2
- The policy_identifier shall be either Sequential, Concurrent or an
- implementation-defined identifier.
+ The <policy_>identifier shall be either Sequential, Concurrent or
+ an implementation-defined identifier.
4.a/2
Implementation defined: Implementation-defined
- policy_identifiers allowed in a pragma
+ <policy_>identifiers allowed in a pragma
Partition_Elaboration_Policy.
4.b/3
@@ -118691,28 +119112,28 @@ defines a pragma for user control over elaboration
policy.
_Post-Compilation Rules_
5/2
-{AI95-00265-01AI95-00265-01} A pragma Partition_Elaboration_Policy is a
-configuration pragma. It specifies the elaboration policy for a
+{<AI95-00265-01AI95-00265-01>} A pragma Partition_Elaboration_Policy is
+a configuration pragma. It specifies the elaboration policy for a
partition. At most one elaboration policy shall be specified for a
partition.
6/3
-{AI95-00265-01AI95-00265-01} {AI05-0264-1AI05-0264-1} If the Sequential
-policy is specified for a partition, then pragma Restrictions
+{<AI95-00265-01AI95-00265-01>} {<AI05-0264-1AI05-0264-1>} If the
+Sequential policy is specified for a partition, then pragma Restrictions
(No_Task_Hierarchy) shall also be specified for the partition.
_Dynamic Semantics_
7/2
-{AI95-00265-01AI95-00265-01} Notwithstanding what this International
+{<AI95-00265-01AI95-00265-01>} Notwithstanding what this International
Standard says elsewhere, this pragma allows partition elaboration rules
concerning task activation and interrupt attachment to be changed. If
-the policy_identifier is Concurrent, or if there is no pragma
+the <policy_>identifier is Concurrent, or if there is no pragma
Partition_Elaboration_Policy defined for the partition, then the rules
defined elsewhere in this Standard apply.
8/2
-{AI95-00265-01AI95-00265-01} {AI95-00421-01AI95-00421-01} If the
+{<AI95-00265-01AI95-00265-01>} {<AI95-00421-01AI95-00421-01>} If the
partition elaboration policy is Sequential, then task activation and
interrupt attachment are performed in the following sequence of steps:
@@ -118733,13 +119154,13 @@ interrupt attachment are performed in the following
sequence of steps:
concurrently with these executing tasks.
13/2
-{AI95-00265-01AI95-00265-01} {AI95-00421-01AI95-00421-01} If several
+{<AI95-00265-01AI95-00265-01>} {<AI95-00421-01AI95-00421-01>} If several
dynamic interrupt handler attachments for the same interrupt are
deferred, then the most recent call of Attach_Handler or
Exchange_Handler determines which handler is attached.
14/2
-{AI95-00265-01AI95-00265-01} {AI95-00421-01AI95-00421-01} If any
+{<AI95-00265-01AI95-00265-01>} {<AI95-00421-01AI95-00421-01>} If any
deferred task activation fails, Tasking_Error is raised at the beginning
of the sequence of statements of the body of the environment task prior
to calling the main subprogram.
@@ -118747,10 +119168,11 @@ to calling the main subprogram.
_Implementation Advice_
15/3
-{AI95-00265-01AI95-00265-01} {AI05-0264-1AI05-0264-1} If the partition
-elaboration policy is Sequential and the Environment task becomes
-permanently blocked during elaboration, then the partition is deadlocked
-and it is recommended that the partition be immediately terminated.
+{<AI95-00265-01AI95-00265-01>} {<AI05-0264-1AI05-0264-1>} If the
+partition elaboration policy is Sequential and the Environment task
+becomes permanently blocked during elaboration, then the partition is
+deadlocked and it is recommended that the partition be immediately
+terminated.
15.a/3
Implementation Advice: If the partition elaboration policy is
@@ -118761,16 +119183,16 @@ and it is recommended that the partition be
immediately terminated.
_Implementation Permissions_
16/3
-{AI95-00265-01AI95-00265-01} {AI05-0264-1AI05-0264-1} If the partition
-elaboration policy is Sequential and any task activation fails, then an
-implementation may immediately terminate the active partition to
-mitigate the hazard posed by continuing to execute with a subset of the
-tasks being active.
+{<AI95-00265-01AI95-00265-01>} {<AI05-0264-1AI05-0264-1>} If the
+partition elaboration policy is Sequential and any task activation
+fails, then an implementation may immediately terminate the active
+partition to mitigate the hazard posed by continuing to execute with a
+subset of the tasks being active.
NOTES
17/2
- 12 {AI95-00421-01AI95-00421-01} If any deferred task activation
+ 12 {<AI95-00421-01AI95-00421-01>} If any deferred task activation
fails, the environment task is unable to handle the Tasking_Error
exception and completes immediately. By contrast, if the partition
elaboration policy is Concurrent, then this exception could be
@@ -118779,7 +119201,7 @@ tasks being active.
_Extensions to Ada 95_
17.a/2
- {AI95-00265-01AI95-00265-01} {AI95-00421-01AI95-00421-01}
+ {<AI95-00265-01AI95-00265-01>} {<AI95-00421-01AI95-00421-01>}
Pragma Partition_Elaboration_Policy is new.
@@ -118789,7 +119211,7 @@ Annex J Obsolescent Features
****************************
1/2
-{AI95-00368-01AI95-00368-01} [ This Annex contains descriptions of
+{<AI95-00368-01AI95-00368-01>} [ This Annex contains descriptions of
features of the language whose functionality is largely redundant with
other features defined by this International Standard. Use of these
features is not recommended in newly written programs. Use of these
@@ -118820,7 +119242,8 @@ features can be prevented by using pragma Restrictions
types (see *note A.5.3::).
1.e/2
- * This paragraph was deleted.{AI95-00284-02AI95-00284-02}
+ * <This paragraph was
+ deleted.>{<AI95-00284-02AI95-00284-02>}
1.f
* The pragmas System_Name, Storage_Unit, and Memory_Size
@@ -118836,13 +119259,13 @@ features can be prevented by using pragma
Restrictions
_Wording Changes from Ada 95_
1.i/2
- {AI95-00368-01AI95-00368-01} A mention of the
+ {<AI95-00368-01AI95-00368-01>} A mention of the
No_Obsolescent_Features restriction was added.
_Wording Changes from Ada 2005_
1.j/3
- {AI05-0229-1AI05-0229-1} Pragma Controlled has been removed
+ {<AI05-0229-1AI05-0229-1>} Pragma Controlled has been removed
from the language, rather than declared to be obsolescent. No
existing implementation gives it any effect. An
implementation could continue to support the pragma as an
@@ -118907,10 +119330,10 @@ The following library_unit_renaming_declarations
exist:
9
with System.Machine_Code;
- package Machine_Code renames System.Machine_Code; -- If supported.
+ package Machine_Code renames System.Machine_Code; --< If supported.>
9.a/3
- Discussion: {AI05-0004-1AI05-0004-1} These library units
+ Discussion: {<AI05-0004-1AI05-0004-1>} These library units
correspond to those declared in Ada 83, which did not have the
child unit concept or the parent package Ada.
@@ -118941,8 +119364,8 @@ J.2 Allowed Replacements of Characters
for both occurrences.
3.a/2
- To be honest: {AI95-00285-01AI95-00285-01} The intent is that
- such a replacement works in the Value, Wide_Value, and
+ To be honest: {<AI95-00285-01AI95-00285-01>} The intent is
+ that such a replacement works in the Value, Wide_Value, and
Wide_Wide_Value attributes, and in the Get procedures of
Text_IO (and Wide_Text_IO and Wide_Wide_Text_IO as well)}, so
that things like "16:.123:" is acceptable.
@@ -118984,7 +119407,7 @@ J.2 Allowed Replacements of Characters
%"This is quoted."%
5.e/3
- {AI05-0248-1AI05-0248-1} is not legal in Ada (and never was
+ {<AI05-0248-1AI05-0248-1>} is not legal in Ada (and never was
legal). One has to write:
5.f
@@ -119000,7 +119423,7 @@ J.3 Reduced Accuracy Subtypes
A digits_constraint may be used to define a floating point subtype with
a new value for its requested decimal precision, as reflected by its
Digits attribute. Similarly, a delta_constraint may be used to define
-an ordinary fixed point subtype with a new value for its delta, as
+an ordinary fixed point subtype with a new value for its <delta>, as
reflected by its Delta attribute.
1.a
@@ -119011,19 +119434,19 @@ reflected by its Delta attribute.
_Syntax_
2/4
- {AI12-0152-1AI12-0152-1} delta_constraint ::= delta static_
+ {<AI12-0152-1AI12-0152-1>} delta_constraint ::= delta <static_>
simple_expression [range_constraint]
_Name Resolution Rules_
3/4
-{AI12-0152-1AI12-0152-1} The simple_expression of a delta_constraint is
-expected to be of any real type.
+{<AI12-0152-1AI12-0152-1>} The simple_expression of a delta_constraint
+is expected to be of any real type.
_Legality Rules_
4/4
-{AI12-0152-1AI12-0152-1} The simple_expression of a delta_constraint
+{<AI12-0152-1AI12-0152-1>} The simple_expression of a delta_constraint
shall be static.
5
@@ -119037,21 +119460,21 @@ subtype (notwithstanding the rule given in *note
3.5.9:: that only
allows a decimal fixed point subtype).
6.a/2
- This paragraph was deleted.{AI95-00114-01AI95-00114-01}
+ <This paragraph was deleted.>{<AI95-00114-01AI95-00114-01>}
_Static Semantics_
7/4
-{AI12-0152-1AI12-0152-1} A subtype_indication with a subtype_mark that
+{<AI12-0152-1AI12-0152-1>} A subtype_indication with a subtype_mark that
denotes an ordinary fixed point subtype and a delta_constraint defines
-an ordinary fixed point subtype with a delta given by the value of the
+an ordinary fixed point subtype with a <delta> given by the value of the
simple_expression of the delta_constraint. If the delta_constraint
includes a range_constraint (*note 3.5: S0036.), then the ordinary fixed
point subtype is constrained by the range_constraint (*note 3.5:
S0036.).
8/4
-{AI12-0152-1AI12-0152-1} A subtype_indication with a subtype_mark that
+{<AI12-0152-1AI12-0152-1>} A subtype_indication with a subtype_mark that
denotes a floating point subtype and a digits_constraint defines a
floating point subtype with a requested decimal precision (as reflected
by its Digits attribute) given by the value of the simple_expression of
@@ -119062,13 +119485,13 @@ constrained by the range_constraint (*note 3.5:
S0036.).
_Dynamic Semantics_
9/4
-{AI12-0152-1AI12-0152-1} A delta_constraint is compatible with an
+{<AI12-0152-1AI12-0152-1>} A delta_constraint is <compatible> with an
ordinary fixed point subtype if the value of the simple_expression is no
-less than the delta of the subtype, and the range_constraint, if any, is
-compatible with the subtype.
+less than the <delta> of the subtype, and the range_constraint, if any,
+is compatible with the subtype.
10/4
-{AI12-0152-1AI12-0152-1} A digits_constraint is compatible with a
+{<AI12-0152-1AI12-0152-1>} A digits_constraint is <compatible> with a
floating point subtype if the value of the simple_expression is no
greater than the requested decimal precision of the subtype, and the
range_constraint, if any, is compatible with the subtype.
@@ -119099,7 +119522,7 @@ range_constraint, if any.
_Wording Changes from Ada 2012_
11.c/4
- {AI12-0152-1AI12-0152-1} Corrigendum: Changed the syntax so
+ {<AI12-0152-1AI12-0152-1>} Corrigendum: Changed the syntax so
that the value following delta in a delta_constraint is a
simple_expression. This is compatible as any expressions that
would require extra parentheses are already illegal. The
@@ -119140,7 +119563,7 @@ S'Constrained
not bother to extend its definition to private extensions.
2.b
- The Constrained attribute of an object is not obsolete.
+ The Constrained attribute of an object is <not> obsolete.
2.c
Note well: S'Constrained matches the Ada 95 definition of
@@ -119166,29 +119589,29 @@ The following declaration exists in the declaration
of package Standard:
package ASCII is
3
- -- Control characters:
+ --< Control characters:>
4
- NUL : constant Character := nul; SOH : constant Character := soh;
- STX : constant Character := stx; ETX : constant Character := etx;
- EOT : constant Character := eot; ENQ : constant Character := enq;
- ACK : constant Character := ack; BEL : constant Character := bel;
- BS : constant Character := bs; HT : constant Character := ht;
- LF : constant Character := lf; VT : constant Character := vt;
- FF : constant Character := ff; CR : constant Character := cr;
- SO : constant Character := so; SI : constant Character := si;
- DLE : constant Character := dle; DC1 : constant Character := dc1;
- DC2 : constant Character := dc2; DC3 : constant Character := dc3;
- DC4 : constant Character := dc4; NAK : constant Character := nak;
- SYN : constant Character := syn; ETB : constant Character := etb;
- CAN : constant Character := can; EM : constant Character := em;
- SUB : constant Character := sub; ESC : constant Character := esc;
- FS : constant Character := fs; GS : constant Character := gs;
- RS : constant Character := rs; US : constant Character := us;
- DEL : constant Character := del;
+ NUL : constant Character := <nul>; SOH : constant Character :=
<soh>;
+ STX : constant Character := <stx>; ETX : constant Character :=
<etx>;
+ EOT : constant Character := <eot>; ENQ : constant Character :=
<enq>;
+ ACK : constant Character := <ack>; BEL : constant Character :=
<bel>;
+ BS : constant Character := <bs>; HT : constant Character :=
<ht>;
+ LF : constant Character := <lf>; VT : constant Character :=
<vt>;
+ FF : constant Character := <ff>; CR : constant Character :=
<cr>;
+ SO : constant Character := <so>; SI : constant Character :=
<si>;
+ DLE : constant Character := <dle>; DC1 : constant Character :=
<dc1>;
+ DC2 : constant Character := <dc2>; DC3 : constant Character :=
<dc3>;
+ DC4 : constant Character := <dc4>; NAK : constant Character :=
<nak>;
+ SYN : constant Character := <syn>; ETB : constant Character :=
<etb>;
+ CAN : constant Character := <can>; EM : constant Character :=
<em>;
+ SUB : constant Character := <sub>; ESC : constant Character :=
<esc>;
+ FS : constant Character := <fs>; GS : constant Character :=
<gs>;
+ RS : constant Character := <rs>; US : constant Character :=
<us>;
+ DEL : constant Character := <del>;
5
- -- Other characters:
+ --< Other characters:>
6
Exclam : constant Character:= '!'; Quotation : constant Character:=
'"';
@@ -119203,7 +119626,7 @@ The following declaration exists in the declaration
of package Standard:
R_Brace : constant Character:= '}'; Tilde : constant Character:=
'~';
7
- -- Lower case letters:
+ --< Lower case letters:>
8
LC_A: constant Character:= 'a';
@@ -119261,8 +119684,8 @@ J.7 At Clauses
_Static Semantics_
2
-An at_clause of the form "for x use at y;" is equivalent to an
-attribute_definition_clause of the form "for x'Address use y;".
+An at_clause of the form "for <x> use at <y>;" is equivalent to an
+attribute_definition_clause of the form "for <x>'Address use <y>;".
2.a
Reason: The preferred syntax for specifying the address of an
@@ -119304,7 +119727,7 @@ J.7.1 Interrupt Entries
1
[Implementations are permitted to allow the attachment of task entries
to interrupts via the address clause. Such an entry is referred to as
-an interrupt entry.
+an <interrupt entry>.
2
The address of the task entry corresponds to a hardware interrupt in an
@@ -119321,10 +119744,10 @@ For any task entry X:
5
X'Address
- For a task entry whose address is specified (an interrupt
- entry), the value refers to the corresponding hardware
- interrupt. For such an entry, as for any other task
- entry, the meaning of this value is implementation
+ For a task entry whose address is specified (an
+ <interrupt entry>), the value refers to the corresponding
+ hardware interrupt. For such an entry, as for any other
+ task entry, the meaning of this value is implementation
defined. The value of this attribute is of the type of
the subtype System.Address.
@@ -119343,8 +119766,8 @@ X'Address
As part of the initialization of a task object, the address clause for
an interrupt entry is elaborated[, which evaluates the expression of the
address clause]. A check is made that the address specified is
-associated with some interrupt to which a task entry may be attached. If
-this check fails, Program_Error is raised. Otherwise, the interrupt
+associated with some interrupt to which a task entry may be attached.
+If this check fails, Program_Error is raised. Otherwise, the interrupt
entry is attached to the interrupt associated with the specified
address.
@@ -119404,8 +119827,8 @@ program execution[; that is, not just when they have
an interrupt entry
attached to them].
16/1
-{8652/00778652/0077} {AI95-00111-01AI95-00111-01} Interrupt entry calls
-may be implemented by having the hardware execute directly the
+{<8652/00778652/0077>} {<AI95-00111-01AI95-00111-01>} Interrupt entry
+calls may be implemented by having the hardware execute directly the
appropriate accept_statement. Alternatively, the implementation is
allowed to provide an internal interrupt handler to simulate the effect
of a normal task calling the entry.
@@ -119427,7 +119850,7 @@ terminate_alternative in addition to those given in
*note 9.3::.
NOTES
20/1
- 1 {8652/00778652/0077} {AI95-00111-01AI95-00111-01} Queued
+ 1 {<8652/00778652/0077>} {<AI95-00111-01AI95-00111-01>} Queued
interrupts correspond to ordinary entry calls. Interrupts that are
lost if not immediately processed correspond to conditional entry
calls. It is a consequence of the priority rules that an
@@ -119444,7 +119867,7 @@ terminate_alternative in addition to those given in
*note 9.3::.
_Examples_
22
-Example of an interrupt entry:
+<Example of an interrupt entry:>
23
task Interrupt_Handler is
@@ -119455,7 +119878,7 @@ Example of an interrupt entry:
_Wording Changes from Ada 83_
23.a/2
- {AI95-00114-01AI95-00114-01} RM83-13.5.1 did not adequately
+ {<AI95-00114-01AI95-00114-01>} RM83-13.5.1 did not adequately
address the problems associated with interrupts. This feature
is now obsolescent and is replaced by the Ada 95 interrupt
model as specified in the Systems Programming Annex.
@@ -119463,8 +119886,8 @@ Example of an interrupt entry:
_Wording Changes from Ada 95_
23.b/2
- {8652/00778652/0077} {AI95-00111-01AI95-00111-01} Corrigendum:
- The undefined term accept body was replaced by
+ {<8652/00778652/0077>} {<AI95-00111-01AI95-00111-01>}
+ Corrigendum: The undefined term <accept body> was replaced by
accept_statement.
@@ -119476,7 +119899,7 @@ J.8 Mod Clauses
_Syntax_
1
- mod_clause ::= at mod static_expression;
+ mod_clause ::= at mod <static_>expression;
_Static Semantics_
@@ -119484,8 +119907,8 @@ J.8 Mod Clauses
A record_representation_clause of the form:
3/3
- {AI05-0092-1AI05-0092-1} for r use
- record at mod a;
+ {<AI05-0092-1AI05-0092-1>} for <r> use
+ record at mod <a>;
...
end record;
@@ -119493,8 +119916,8 @@ A record_representation_clause of the form:
is equivalent to:
5
- for r'Alignment use a;
- for r use
+ for <r>'Alignment use <a>;
+ for <r> use
record
...
end record;
@@ -119531,11 +119954,11 @@ For any task subtype T, the following attribute is
defined:
2
T'Storage_Size
Denotes an implementation-defined value of type
- universal_integer representing the number of storage
+ <universal_integer> representing the number of storage
elements reserved for a task of the subtype T.
2.a/3
- To be honest: {AI05-0229-1AI05-0229-1} T'Storage_Size cannot
+ To be honest: {<AI05-0229-1AI05-0229-1>} T'Storage_Size cannot
be particularly meaningful in the presence of the
specification of the aspect Storage_Size, especially when the
expression is dynamic, or depends on a discriminant of the
@@ -119546,7 +119969,7 @@ T'Storage_Size
Hence, it is always implementation defined.
3/3
- {AI95-00345-01AI95-00345-01} {AI05-0229-1AI05-0229-1}
+ {<AI95-00345-01AI95-00345-01>} {<AI05-0229-1AI05-0229-1>}
Storage_Size may be specified for a task first subtype
that is not an interface via an
attribute_definition_clause. When the attribute is
@@ -119554,19 +119977,20 @@ T'Storage_Size
value of the given expression.
3.a/3
- Ramification: {AI05-0229-1AI05-0229-1} When this attribute is
- specified with an attribute_definition_clause, the associated
- aspect is set to the value of the expression given in the
- attribute_definition_clause, rather than the expression
- itself. This value is therefore the same for all objects of
- the type; in particular, it is not re-evaluated when objects
- are created. This is different than when the aspect is
- specified with an aspect_specification (see *note 13.3::).
+ Ramification: {<AI05-0229-1AI05-0229-1>} When this attribute
+ is specified with an attribute_definition_clause, the
+ associated aspect is set to the <value> of the expression
+ given in the attribute_definition_clause, rather than the
+ expression itself. This value is therefore the same for all
+ objects of the type; in particular, it is not re-evaluated
+ when objects are created. This is different than when the
+ aspect is specified with an aspect_specification (see *note
+ 13.3::).
_Wording Changes from Ada 95_
3.b/2
- {AI95-00345-01AI95-00345-01} We don't allow specifying
+ {<AI95-00345-01AI95-00345-01>} We don't allow specifying
Storage_Size on task interfaces. We don't need to mention
class-wide task types, because these cannot be a first
subtype.
@@ -119578,14 +120002,14 @@ J.10 Specific Suppression of Checks
===================================
1/2
-{AI95-00224-01AI95-00224-01} Pragma Suppress can be used to suppress
+{<AI95-00224-01AI95-00224-01>} Pragma Suppress can be used to suppress
checks on specific entities.
_Syntax_
2/2
- {AI95-00224-01AI95-00224-01} The form of a specific Suppress pragma
- is as follows:
+ {<AI95-00224-01AI95-00224-01>} The form of a specific Suppress
+ pragma is as follows:
3/2
pragma Suppress(identifier, [On =>] name);
@@ -119593,11 +120017,11 @@ checks on specific entities.
_Legality Rules_
4/2
-{AI95-00224-01AI95-00224-01} The identifier shall be the name of a check
-(see *note 11.5::). The name shall statically denote some entity.
+{<AI95-00224-01AI95-00224-01>} The identifier shall be the name of a
+check (see *note 11.5::). The name shall statically denote some entity.
5/2
-{AI95-00224-01AI95-00224-01} For a specific Suppress pragma that is
+{<AI95-00224-01AI95-00224-01>} For a specific Suppress pragma that is
immediately within a package_specification, the name shall denote an
entity (or several overloaded subprograms) declared immediately within
the package_specification (*note 7.1: S0191.).
@@ -119605,7 +120029,7 @@ the package_specification (*note 7.1: S0191.).
_Static Semantics_
6/2
-{AI95-00224-01AI95-00224-01} A specific Suppress pragma applies to the
+{<AI95-00224-01AI95-00224-01>} A specific Suppress pragma applies to the
named check from the place of the pragma to the end of the innermost
enclosing declarative region, or, if the pragma is given in a
package_specification, to the end of the scope of the named entity. The
@@ -119632,19 +120056,19 @@ International Standard.
_Implementation Permissions_
7/2
-{AI95-00224-01AI95-00224-01} An implementation is allowed to place
+{<AI95-00224-01AI95-00224-01>} An implementation is allowed to place
restrictions on specific Suppress pragmas.
NOTES
8/2
- 3 {AI95-00224-01AI95-00224-01} An implementation may support a
+ 3 {<AI95-00224-01AI95-00224-01>} An implementation may support a
similar On parameter on pragma Unsuppress (see *note 11.5::).
_Wording Changes from Ada 95_
8.a/3
- {AI95-00224-01AI95-00224-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00224-01AI95-00224-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. This feature was moved here because it is
important for pragma Unsuppress that there be an unambiguous
meaning for each checking pragma. For instance, in the
@@ -119672,26 +120096,27 @@ J.11 The Class Attribute of Untagged Incomplete
Types
_Static Semantics_
1/2
-{AI95-00326-01AI95-00326-01} For the first subtype S of a type T
+{<AI95-00326-01AI95-00326-01>} For the first subtype S of a type <T>
declared by an incomplete_type_declaration that is not tagged, the
following attribute is defined:
2/2
-{AI95-00326-01AI95-00326-01} S'Class
+{<AI95-00326-01AI95-00326-01>} S'Class
Denotes the first subtype of the incomplete class-wide
- type rooted at T. The completion of T shall declare a
- tagged type. Such an attribute reference shall occur in
- the same library unit as the incomplete_type_declaration.
+ type rooted at <T>. The completion of <T> shall declare
+ a tagged type. Such an attribute reference shall occur
+ in the same library unit as the
+ incomplete_type_declaration.
2.a/2
- Reason: {AI95-00326-01AI95-00326-01} This must occur in the
+ Reason: {<AI95-00326-01AI95-00326-01>} This must occur in the
same unit to prevent children from imposing requirements on
their ancestor library units for deferred incomplete types.
_Wording Changes from Ada 95_
2.b/3
- {AI95-00326-01AI95-00326-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00326-01AI95-00326-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. This feature was moved here because the
tagged incomplete type provides a better way to provide this
capability (it doesn't put requirements on the completion
@@ -119707,12 +120132,12 @@ J.12 Pragma Interface
_Syntax_
1/2
- {AI95-00284-02AI95-00284-02} In addition to an identifier, the
+ {<AI95-00284-02AI95-00284-02>} In addition to an identifier, the
reserved word interface is allowed as a pragma name, to provide
compatibility with a prior edition of this International Standard.
1.a/2
- Implementation Note: {AI95-00284-02AI95-00284-02} All
+ Implementation Note: {<AI95-00284-02AI95-00284-02>} All
implementations need to at least recognize and ignore this
pragma. A syntax error is not an acceptable implementation of
this pragma.
@@ -119720,7 +120145,7 @@ J.12 Pragma Interface
_Wording Changes from Ada 95_
1.b/3
- {AI95-00326-01AI95-00326-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00326-01AI95-00326-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. This is necessary as interface is now a
reserved word, which would prevent pragma Interface from being
an implementation-defined pragma. We don't define any
@@ -119735,7 +120160,7 @@ J.13 Dependence Restriction Identifiers
=======================================
1/2
-{AI95-00394-01AI95-00394-01} The following restrictions involve
+{<AI95-00394-01AI95-00394-01>} The following restrictions involve
dependence on specific language-defined units. The more general
restriction No_Dependence (see *note 13.12.1::) should be used for this
purpose.
@@ -119743,28 +120168,28 @@ purpose.
_Static Semantics_
2/2
-{AI95-00394-01AI95-00394-01} The following restriction_identifiers
+{<AI95-00394-01AI95-00394-01>} The following <restriction_>identifiers
exist:
3/2
-{AI95-00394-01AI95-00394-01} No_Asynchronous_Control
+{<AI95-00394-01AI95-00394-01>} No_Asynchronous_Control
Semantic dependence on the predefined package
Asynchronous_Task_Control is not allowed.
4/2
-{AI95-00394-01AI95-00394-01} No_Unchecked_Conversion
+{<AI95-00394-01AI95-00394-01>} No_Unchecked_Conversion
Semantic dependence on the predefined generic function
Unchecked_Conversion is not allowed.
5/2
-{AI95-00394-01AI95-00394-01} No_Unchecked_Deallocation
+{<AI95-00394-01AI95-00394-01>} No_Unchecked_Deallocation
Semantic dependence on the predefined generic procedure
Unchecked_Deallocation is not allowed.
_Wording Changes from Ada 95_
5.a/3
- {AI95-00394-01AI95-00394-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00394-01AI95-00394-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. These restrictions are replaced by the more
general No_Dependence (see *note 13.12.1::).
@@ -119777,7 +120202,7 @@ J.14 Character and Wide_Character Conversion Functions
_Static Semantics_
1/2
-{AI95-00395-01AI95-00395-01} The following declarations exist in the
+{<AI95-00395-01AI95-00395-01>} The following declarations exist in the
declaration of package Ada.Characters.Handling:
2/2
@@ -119809,7 +120234,7 @@ declaration of package Ada.Characters.Handling:
_Wording Changes from Ada 95_
6.a/3
- {AI95-00394-01AI95-00394-01} {AI05-0299-1AI05-0299-1} This
+ {<AI95-00394-01AI95-00394-01>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. These subprograms were moved to
Characters.Conversions (see *note A.3.4::).
@@ -119820,13 +120245,13 @@ J.15 Aspect-related Pragmas
===========================
1/3
-{AI05-0229-1AI05-0229-1} Pragmas can be used as an alternative to
+{<AI05-0229-1AI05-0229-1>} Pragmas can be used as an alternative to
aspect_specifications to specify certain aspects.
_Wording Changes from Ada 2005_
1.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Many existing pragmas have been converted
into aspects; the pragmas have moved here.
@@ -119855,7 +120280,7 @@ J.15.1 Pragma Inline
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Inline, which is a
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Inline, which is a
program unit pragma (see *note 10.1.5::), is as follows:
2/3
@@ -119864,15 +120289,15 @@ J.15.1 Pragma Inline
_Legality Rules_
3/3
-{AI05-0229-1AI05-0229-1} The pragma shall apply to one or more callable
-entities or generic subprograms.
+{<AI05-0229-1AI05-0229-1>} The pragma shall apply to one or more
+callable entities or generic subprograms.
_Static Semantics_
4/3
-{AI05-0229-1AI05-0229-1} Pragma Inline specifies that the Inline aspect
-(see *note 6.3.2::) for each entity denoted by each name given in the
-pragma has the value True.
+{<AI05-0229-1AI05-0229-1>} Pragma Inline specifies that the Inline
+aspect (see *note 6.3.2::) for each entity denoted by each name given in
+the pragma has the value True.
4.a/3
Ramification: Note that inline expansion is desired no matter
@@ -119897,14 +120322,14 @@ pragma has the value True.
C : Character;
begin
...
- Put(C); -- Inline expansion is desired.
- Put(I); -- Inline expansion is NOT desired.
+ Put(C); --< Inline expansion is desired.>
+ Put(I); --< Inline expansion is NOT desired.>
end Main;
_Implementation Permissions_
5/3
-{AI05-0229-1AI05-0229-1} An implementation may allow a pragma Inline
+{<AI05-0229-1AI05-0229-1>} An implementation may allow a pragma Inline
that has an argument which is a direct_name denoting a subprogram_body
of the same declarative_part.
@@ -119921,25 +120346,25 @@ of the same declarative_part.
NOTES
6/3
- 4 {AI05-0229-1AI05-0229-1} The name in a pragma Inline may denote
- more than one entity in the case of overloading. Such a pragma
- applies to all of the denoted entities.
+ 4 {<AI05-0229-1AI05-0229-1>} The name in a pragma Inline may
+ denote more than one entity in the case of overloading. Such a
+ pragma applies to all of the denoted entities.
_Incompatibilities With Ada 83_
6.a/3
- {AI95-00309-01AI95-00309-01} {AI05-0229-1AI05-0229-1} A pragma
- Inline cannot refer to a subprogram_body outside of that body.
- The pragma can be given inside of the subprogram body. Ada
- 2005 adds an Implementation Permission to allow this usage for
- compatibility (and Ada 95 implementations also can use this
- permission), but implementations do not have to allow such
- pragmas.
+ {<AI95-00309-01AI95-00309-01>} {<AI05-0229-1AI05-0229-1>} A
+ pragma Inline cannot refer to a subprogram_body outside of
+ that body. The pragma can be given inside of the subprogram
+ body. Ada 2005 adds an Implementation Permission to allow
+ this usage for compatibility (and Ada 95 implementations also
+ can use this permission), but implementations do not have to
+ allow such pragmas.
_Extensions to Ada 83_
6.b/3
- {AI05-0229-1AI05-0229-1} A pragma Inline is allowed inside a
+ {<AI05-0229-1AI05-0229-1>} A pragma Inline is allowed inside a
subprogram_body if there is no corresponding
subprogram_declaration. This is for uniformity with other
program unit pragmas.
@@ -119947,14 +120372,14 @@ of the same declarative_part.
_Extensions to Ada 95_
6.c/3
- {AI95-00309-01AI95-00309-01} {AI05-0229-1AI05-0229-1}
+ {<AI95-00309-01AI95-00309-01>} {<AI05-0229-1AI05-0229-1>}
Amendment Correction: Implementations are allowed to let
Pragma Inline apply to a subprogram_body.
_Wording Changes from Ada 2005_
6.d/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Inline was moved here from *note
6.3.2::; aspect Inline lives there now.
@@ -119967,30 +120392,31 @@ J.15.2 Pragma No_Return
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma No_Return, which is a
- representation pragma (see *note 13.1::), is as follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma No_Return, which is
+ a representation pragma (see *note 13.1::), is as follows:
2/3
- pragma No_Return (procedure_local_name{, procedure_local_name});
+ pragma No_Return (<procedure_>local_name{, <procedure_>
+ local_name});
_Legality Rules_
3/3
-{AI05-0229-1AI05-0229-1} Each procedure_local_name shall denote one or
-more procedures or generic procedures. [The procedure_local_name shall
-not denote a null procedure nor an instance of a generic unit.]
+{<AI05-0229-1AI05-0229-1>} Each <procedure_>local_name shall denote one
+or more procedures or generic procedures. [The <procedure_>local_name
+shall not denote a null procedure nor an instance of a generic unit.]
_Static Semantics_
4/3
-{AI05-0229-1AI05-0229-1} Pragma No_Return specifies that the No_Return
+{<AI05-0229-1AI05-0229-1>} Pragma No_Return specifies that the No_Return
aspect (see *note 6.5.1::) for each procedure denoted by each local_name
given in the pragma has the value True.
_Wording Changes from Ada 2005_
4.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma No_Return was moved here from *note
6.5.1::; aspect No_Return lives there now.
@@ -120003,29 +120429,29 @@ J.15.3 Pragma Pack
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Pack, which is a
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Pack, which is a
representation pragma (see *note 13.1::), is as follows:
2/3
- pragma Pack (first_subtype_local_name);
+ pragma Pack (<first_subtype_>local_name);
_Legality Rules_
3/3
-{AI05-0229-1AI05-0229-1} The first_subtype_local_name of a pragma Pack
-shall denote a composite subtype.
+{<AI05-0229-1AI05-0229-1>} The <first_subtype_>local_name of a pragma
+Pack shall denote a composite subtype.
_Static Semantics_
4/3
-{AI05-0229-1AI05-0229-1} Pragma Pack specifies that the Pack aspect (see
-*note 13.2::) for the type denoted by first_subtype_local_name has the
-value True.
+{<AI05-0229-1AI05-0229-1>} Pragma Pack specifies that the Pack aspect
+(see *note 13.2::) for the type denoted by <first_subtype_>local_name
+has the value True.
_Wording Changes from Ada 2005_
4.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Pack was moved here from *note
13.2::; aspect Pack lives there now.
@@ -120038,33 +120464,33 @@ J.15.4 Pragma Storage_Size
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Storage_Size is as
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Storage_Size is as
follows:
2/3
pragma Storage_Size (expression);
3/3
- {AI05-0229-1AI05-0229-1} A pragma Storage_Size is allowed only
+ {<AI05-0229-1AI05-0229-1>} A pragma Storage_Size is allowed only
immediately within a task_definition.
_Name Resolution Rules_
4/3
-{AI05-0229-1AI05-0229-1} The expression of a pragma Storage_Size is
+{<AI05-0229-1AI05-0229-1>} The expression of a pragma Storage_Size is
expected to be of any integer type.
_Static Semantics_
5/3
-{AI05-0229-1AI05-0229-1} The pragma Storage_Size sets the Storage_Size
+{<AI05-0229-1AI05-0229-1>} The pragma Storage_Size sets the Storage_Size
aspect (see *note 13.3::) of the type defined by the immediately
enclosing task_definition to the value of the expression of the pragma.
_Wording Changes from Ada 2005_
5.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Storage_Size was moved here from
*note 13.3::; aspect Storage_Size lives there now.
@@ -120077,48 +120503,50 @@ J.15.5 Interfacing Pragmas
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} An interfacing pragma is a representation
- pragma that is one of the pragmas Import, Export, or Convention.
- Their forms are as follows:
+ {<AI05-0229-1AI05-0229-1>} An <interfacing pragma> is a
+ representation pragma that is one of the pragmas Import, Export, or
+ Convention. Their forms are as follows:
2/3
pragma Import(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]);
+ [Convention =>] <convention_>identifier, [Entity =>]
+ local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]);
3/3
pragma Export(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]);
+ [Convention =>] <convention_>identifier, [Entity =>]
+ local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]);
4/3
- pragma Convention([Convention =>] convention_identifier,[Entity
+ pragma Convention([Convention =>] <convention_>identifier,[Entity
=>] local_name);
5/3
- {AI05-0229-1AI05-0229-1} For pragmas Import and Export, the
+ {<AI05-0229-1AI05-0229-1>} For pragmas Import and Export, the
argument for Link_Name shall not be given without the
- pragma_argument_identifier unless the argument for External_Name is
- given.
+ <pragma_argument_>identifier unless the argument for External_Name
+ is given.
_Name Resolution Rules_
6/3
-{AI05-0229-1AI05-0229-1} The expected type for an
-external_name_string_expression and a link_name_string_expression in an
-interfacing pragma is String.
+{<AI05-0229-1AI05-0229-1>} The expected type for an
+<external_name_string_>expression and a <link_name_string_>expression in
+an interfacing pragma is String.
_Legality Rules_
7/3
-{AI05-0229-1AI05-0229-1} The convention_identifier of an interfacing
+{<AI05-0229-1AI05-0229-1>} The <convention_>identifier of an interfacing
pragma shall be the name of a convention (see *note B.1::).
8/3
-{AI05-0229-1AI05-0229-1} A pragma Import shall be the completion of a
-declaration. Notwithstanding any rule to the contrary, a pragma Import
+{<AI05-0229-1AI05-0229-1>} A pragma Import shall be the completion of a
+declaration. Notwithstanding any rule to the contrary, a pragma Import
may serve as the completion of any kind of (explicit) declaration if
supported by an implementation for that kind of declaration. If a
completion is a pragma Import, then it shall appear in the same
@@ -120129,22 +120557,22 @@ other than pragmas. If the local_name denotes more
than one entity,
then the pragma Import is the completion of all of them.
9/3
-{AI05-0229-1AI05-0229-1} The external_name_string_expression and
-link_name_string_expression of a pragma Import or Export shall be
+{<AI05-0229-1AI05-0229-1>} The <external_name_string_>expression and
+<link_name_string_>expression of a pragma Import or Export shall be
static.
10/3
-{AI05-0229-1AI05-0229-1} The local_name of each of these pragmas shall
+{<AI05-0229-1AI05-0229-1>} The local_name of each of these pragmas shall
denote a declaration that may have the similarly named aspect specified.
_Static Semantics_
11/3
-{AI05-0229-1AI05-0229-1} An interfacing pragma specifies various aspects
-of the entity denoted by the local_name as follows:
+{<AI05-0229-1AI05-0229-1>} An interfacing pragma specifies various
+aspects of the entity denoted by the local_name as follows:
12/3
- * The Convention aspect (see *note B.1::) is convention_identifier.
+ * The Convention aspect (see *note B.1::) is <convention_>identifier.
13/3
* A pragma Import specifies that the Import aspect (see *note B.1::)
@@ -120157,14 +120585,14 @@ of the entity denoted by the local_name as follows:
15/3
* For both pragma Import and Export, if an external name is given in
the pragma, the External_Name aspect (see *note B.1::) is specified
- to be external_name_string_expression. If a link name is given in
- the pragma, the Link_Name aspect (see *note B.1::) is specified to
- be the link_name_string_expression.
+ to be <external_name_string_>expression. If a link name is given
+ in the pragma, the Link_Name aspect (see *note B.1::) is specified
+ to be the <link_name_string_>expression.
_Wording Changes from Ada 2005_
15.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragmas Import, Export, and Convention were
moved here from *note B.1::; aspects Import, Export,
Convention, Link_Name, and External_Name live there now.
@@ -120178,31 +120606,31 @@ J.15.6 Pragma Unchecked_Union
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Unchecked_Union,
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Unchecked_Union,
which is a representation pragma (see *note 13.1::), is as follows:
2/3
- pragma Unchecked_Union (first_subtype_local_name);
+ pragma Unchecked_Union (<first_subtype_>local_name);
_Legality Rules_
3/3
-{AI05-0229-1AI05-0229-1} The first_subtype_local_name of a pragma
+{<AI05-0229-1AI05-0229-1>} The <first_subtype_>local_name of a pragma
Unchecked_Union shall denote an unconstrained discriminated record
subtype having a variant_part.
_Static Semantics_
4/3
-{AI05-0229-1AI05-0229-1} A pragma Unchecked_Union specifies that the
+{<AI05-0229-1AI05-0229-1>} A pragma Unchecked_Union specifies that the
Unchecked_Union aspect (see *note B.3.3::) for the type denoted by
-first_subtype_local_name has the value True.
+<first_subtype_>local_name has the value True.
_Wording Changes from Ada 2005_
4.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Unchecked_Union was moved here from
*note B.3.3::; aspect Unchecked_Union lives there now.
@@ -120215,39 +120643,38 @@ J.15.7 Pragmas Interrupt_Handler and Attach_Handler
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Interrupt_Handler is
- as follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Interrupt_Handler
+ is as follows:
2/3
- pragma Interrupt_Handler (handler_name);
+ pragma Interrupt_Handler (<handler_>name);
3/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Attach_Handler is as
- follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Attach_Handler is
+ as follows:
4/3
- pragma Attach_Handler (handler_name, expression);
+ pragma Attach_Handler (<handler_>name, expression);
_Name Resolution Rules_
5/3
-{AI05-0229-1AI05-0229-1} For the Interrupt_Handler and Attach_Handler
-pragmas, the handler_name shall resolve to denote a protected procedure
-with a parameterless profile.
+{<AI05-0229-1AI05-0229-1>} For the Interrupt_Handler and Attach_Handler
+pragmas, the <handler_>name shall resolve to denote a protected
+procedure with a parameterless profile.
6/3
-{AI05-0229-1AI05-0229-1} For the Attach_Handler pragma, the expected
-type for the expression is Interrupts.Interrupt_Id (see *note C.3.2::).
-
+{<AI05-0229-1AI05-0229-1>} For the Attach_Handler pragma, the expected
+type for the expression is Interrupts.Interrupt_Id (see *note C.3.2::).
_Legality Rules_
7/3
-{AI05-0033-1AI05-0033-1} {AI05-0229-1AI05-0229-1} The Attach_Handler and
-Interrupt_Handler pragmas are only allowed immediately within the
+{<AI05-0033-1AI05-0033-1>} {<AI05-0229-1AI05-0229-1>} The Attach_Handler
+and Interrupt_Handler pragmas are only allowed immediately within the
protected_definition where the corresponding subprogram is declared.
The corresponding protected_type_declaration or
single_protected_declaration shall be a library-level declaration, and
-shall not be declared within a generic body. In addition to the places
+shall not be declared within a generic body. In addition to the places
where Legality Rules normally apply (see *note 12.3::), these rules also
apply in the private part of an instance of a generic unit.
@@ -120257,7 +120684,7 @@ apply in the private part of an instance of a generic
unit.
library level.
7.b/3
- {AI05-0033-1AI05-0033-1} We cannot allow these pragmas in a
+ {<AI05-0033-1AI05-0033-1>} We cannot allow these pragmas in a
generic body, because legality rules are not checked for
instance bodies, and these should not be allowed if the
instance is not at the library level. The protected types can
@@ -120270,18 +120697,18 @@ apply in the private part of an instance of a
generic unit.
_Static Semantics_
8/3
-{AI05-0229-1AI05-0229-1} For an implementation that supports Annex C, a
-pragma Interrupt_Handler specifies the Interrupt_Handler aspect (see
-*note C.3.1::) for the protected procedure handler_name to have the
+{<AI05-0229-1AI05-0229-1>} For an implementation that supports Annex C,
+a pragma Interrupt_Handler specifies the Interrupt_Handler aspect (see
+*note C.3.1::) for the protected procedure <handler_>name to have the
value True. For an implementation that supports Annex C, a pragma
Attach_Handler specifies the Attach_Handler aspect (see *note C.3.1::)
-for the protected procedure handler_name to have the value of the given
-expression[ as evaluated at object creation time].
+for the protected procedure <handler_>name to have the value of the
+given expression[ as evaluated at object creation time].
_Incompatibilities With Ada 2005_
8.a/3
- {AI05-0033-1AI05-0033-1} Correction: Added missing generic
+ {<AI05-0033-1AI05-0033-1>} Correction: Added missing generic
contract wording for the pragma Attach_Handler and
Interrupt_Handler. This means that nested instances with
these pragmas in the private part are now illegal. This is
@@ -120290,7 +120717,7 @@ expression[ as evaluated at object creation time].
_Wording Changes from Ada 2005_
8.b/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragmas Interrupt_Handler and
Attach_Handler were moved here from *note C.3.1::; aspects
Interrupt_Handler and Attach_Handler live there now.
@@ -120304,7 +120731,7 @@ J.15.8 Shared Variable Pragmas
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form for pragmas Atomic, Volatile,
+ {<AI05-0229-1AI05-0229-1>} The form for pragmas Atomic, Volatile,
Independent, Atomic_Components, and Volatile_Components, and
Independent_Components is as follows:
@@ -120315,39 +120742,39 @@ J.15.8 Shared Variable Pragmas
pragma Volatile (local_name);
4/3
- {AI05-0009-1AI05-0009-1} pragma Independent (component_
+ {<AI05-0009-1AI05-0009-1>} pragma Independent (<component_>
local_name);
5/3
- pragma Atomic_Components (array_local_name);
+ pragma Atomic_Components (<array_>local_name);
6/3
- pragma Volatile_Components (array_local_name);
+ pragma Volatile_Components (<array_>local_name);
7/3
- {AI05-0009-1AI05-0009-1} pragma Independent_Components (
+ {<AI05-0009-1AI05-0009-1>} pragma Independent_Components (
local_name);
7.a/3
- Discussion: {AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1}
- Pragmas Independent and Independent_Components are born
- obsolescent; they are defined to provide consistency with the
- existing shared variable pragmas. As with all obsolescent
- features, these pragmas are not optional; all Ada
- implementations need to implement them. Also note that these
- pragmas were defined as a Correction; as such, they are
- expected to be implemented as part of Ada 2005 implementations
- (and they would not be obsolescent there).
+ Discussion: {<AI05-0009-1AI05-0009-1>}
+ {<AI05-0229-1AI05-0229-1>} Pragmas Independent and
+ Independent_Components are born obsolescent; they are defined
+ to provide consistency with the existing shared variable
+ pragmas. As with all obsolescent features, these pragmas are
+ not optional; all Ada implementations need to implement them.
+ Also note that these pragmas were defined as a Correction; as
+ such, they are expected to be implemented as part of Ada 2005
+ implementations (and they would not be obsolescent there).
_Name Resolution Rules_
8/3
-{AI05-0009-1AI05-0009-1} {AI05-0229-1AI05-0229-1} The local_name in an
-Atomic or Volatile pragma shall resolve to denote either an
+{<AI05-0009-1AI05-0009-1>} {<AI05-0229-1AI05-0229-1>} The local_name in
+an Atomic or Volatile pragma shall resolve to denote either an
object_declaration, a noninherited component_declaration, or a
-full_type_declaration. The component_local_name in an Independent
+full_type_declaration. The <component_>local_name in an Independent
pragma shall resolve to denote a noninherited component_declaration.
-The array_local_name in an Atomic_Components or Volatile_Components
+The <array_>local_name in an Atomic_Components or Volatile_Components
pragma shall resolve to denote the declaration of an array type or an
array object of an anonymous type. The local_name in an
Independent_Components pragma shall resolve to denote the declaration of
@@ -120356,21 +120783,21 @@ an array or record type or an array object of an
anonymous type.
_Static Semantics_
9/3
-{AI05-0229-1AI05-0229-1} These pragmas are representation pragmas (see
+{<AI05-0229-1AI05-0229-1>} These pragmas are representation pragmas (see
*note 13.1::). Each of these pragmas specifies that the similarly named
aspect (see *note C.6::) of the type, object, or component denoted by
-its argument is True.
+its argument is True.
_Legality Rules_
10/3
-{AI05-0229-1AI05-0229-1} The local_name of each of these pragmas shall
+{<AI05-0229-1AI05-0229-1>} The local_name of each of these pragmas shall
denote a declaration that may have the similarly named aspect specified.
_Wording Changes from Ada 2005_
10.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. These pragmas were moved here from *note
C.6::; various aspects live there now.
@@ -120381,7 +120808,7 @@ J.15.9 Pragma CPU
-----------------
0.a/3
- Discussion: {AI05-0229-1AI05-0229-1} This pragma is born
+ Discussion: {<AI05-0229-1AI05-0229-1>} This pragma is born
obsolescent; it is defined to provide consistency with
existing real-time pragmas. As with all obsolescent features,
this pragma is not optional; all Ada implementations need to
@@ -120390,7 +120817,7 @@ J.15.9 Pragma CPU
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma CPU is as follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma CPU is as follows:
2/3
pragma CPU (expression);
@@ -120398,25 +120825,25 @@ J.15.9 Pragma CPU
_Name Resolution Rules_
3/3
-{AI05-0229-1AI05-0229-1} The expected type for the expression of a
+{<AI05-0229-1AI05-0229-1>} The expected type for the expression of a
pragma CPU is System.Multiprocessors.CPU_Range.
_Legality Rules_
4/3
-{AI05-0229-1AI05-0229-1} A CPU pragma is allowed only immediately within
-a task_definition, or the declarative_part of a subprogram_body.
+{<AI05-0229-1AI05-0229-1>} A CPU pragma is allowed only immediately
+within a task_definition, or the declarative_part of a subprogram_body.
5/3
-{AI05-0229-1AI05-0229-1} For a CPU pragma that appears in the
+{<AI05-0229-1AI05-0229-1>} For a CPU pragma that appears in the
declarative_part of a subprogram_body, the expression shall be static.
_Static Semantics_
6/3
-{AI05-0229-1AI05-0229-1} For an implementation that supports Annex D, a
-pragma CPU specifies the value of the CPU aspect (see *note D.16::). If
-the pragma appears in a task_definition, the expression is associated
+{<AI05-0229-1AI05-0229-1>} For an implementation that supports Annex D,
+a pragma CPU specifies the value of the CPU aspect (see *note D.16::).
+If the pragma appears in a task_definition, the expression is associated
with the aspect for the task type or single_task_declaration that
contains the pragma; otherwise, the expression is associated with the
aspect for the subprogram that contains the pragma.
@@ -120424,7 +120851,7 @@ aspect for the subprogram that contains the pragma.
_Extensions to Ada 2005_
6.a/3
- {AI05-0009-1AI05-0009-1} Pragma CPU is new.
+ {<AI05-0009-1AI05-0009-1>} Pragma CPU is new.
File: aarm2012.info, Node: J.15.10, Next: J.15.11, Prev: J.15.9, Up: J.15
@@ -120433,7 +120860,7 @@ J.15.10 Pragma Dispatching_Domain
---------------------------------
0.a/3
- Discussion: {AI05-0167-1AI05-0167-1} This pragma is born
+ Discussion: {<AI05-0167-1AI05-0167-1>} This pragma is born
obsolescent; it is defined to provide consistency with
existing real-time pragmas. As with all obsolescent features,
this pragma is not optional; all Ada implementations need to
@@ -120442,8 +120869,8 @@ J.15.10 Pragma Dispatching_Domain
_Syntax_
1/3
- {AI05-0167-1AI05-0167-1} The form of a pragma Dispatching_Domain is
- as follows:
+ {<AI05-0167-1AI05-0167-1>} The form of a pragma Dispatching_Domain
+ is as follows:
2/3
pragma Dispatching_Domain (expression);
@@ -120451,28 +120878,28 @@ J.15.10 Pragma Dispatching_Domain
_Name Resolution Rules_
3/3
-{AI05-0167-1AI05-0167-1} The expected type for the expression is
-System.Multiprocessors.Dispatching_Domains.Dispatching_Domain.
+{<AI05-0167-1AI05-0167-1>} The expected type for the expression is
+System.Multiprocessors.Dispatching_Domains.Dispatching_Domain.
_Legality Rules_
4/3
-{AI05-0167-1AI05-0167-1} A Dispatching_Domain pragma is allowed only
+{<AI05-0167-1AI05-0167-1>} A Dispatching_Domain pragma is allowed only
immediately within a task_definition.
_Static Semantics_
5/3
-{AI05-0167-1AI05-0167-1} For an implementation that supports Annex D, a
-pragma Dispatching_Domain specifies the value of the Dispatching_Domain
-aspect (see *note D.16.1::). The expression is associated with the
-aspect for the task type or single_task_declaration that contains the
-pragma.
+{<AI05-0167-1AI05-0167-1>} For an implementation that supports Annex D,
+a pragma Dispatching_Domain specifies the value of the
+Dispatching_Domain aspect (see *note D.16.1::). The expression is
+associated with the aspect for the task type or single_task_declaration
+that contains the pragma.
_Extensions to Ada 2005_
5.a/3
- {AI05-0009-1AI05-0009-1} Pragma Dispatching_Domain is new.
+ {<AI05-0009-1AI05-0009-1>} Pragma Dispatching_Domain is new.
File: aarm2012.info, Node: J.15.11, Next: J.15.12, Prev: J.15.10, Up: J.15
@@ -120483,15 +120910,15 @@ J.15.11 Pragmas Priority and Interrupt_Priority
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Priority is as
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Priority is as
follows:
2/3
pragma Priority (expression);
3/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Interrupt_Priority is
- as follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Interrupt_Priority
+ is as follows:
4/3
pragma Interrupt_Priority [(expression);]
@@ -120499,28 +120926,28 @@ J.15.11 Pragmas Priority and Interrupt_Priority
_Name Resolution Rules_
5/3
-{AI05-0229-1AI05-0229-1} The expected type for the expression in a
-Priority or Interrupt_Priority pragma is Integer.
+{<AI05-0229-1AI05-0229-1>} The expected type for the expression in a
+Priority or Interrupt_Priority pragma is Integer.
_Legality Rules_
6/3
-{AI05-0229-1AI05-0229-1} A Priority pragma is allowed only immediately
+{<AI05-0229-1AI05-0229-1>} A Priority pragma is allowed only immediately
within a task_definition, a protected_definition, or the
declarative_part of a subprogram_body. An Interrupt_Priority pragma is
allowed only immediately within a task_definition or a
protected_definition.
7/3
-{AI05-0229-1AI05-0229-1} For a Priority pragma that appears in the
+{<AI05-0229-1AI05-0229-1>} For a Priority pragma that appears in the
declarative_part of a subprogram_body, the expression shall be static,
and its value shall be in the range of System.Priority.
_Static Semantics_
8/3
-{AI05-0229-1AI05-0229-1} For an implementation that supports Annex D, a
-pragma Priority specifies the value of the Priority aspect (see *note
+{<AI05-0229-1AI05-0229-1>} For an implementation that supports Annex D,
+a pragma Priority specifies the value of the Priority aspect (see *note
D.1::) and a pragma Interrupt_Priority specifies the value of the
Interrupt_Priority aspect as follows:
@@ -120540,14 +120967,14 @@ Interrupt_Priority aspect as follows:
that contains the pragma.
12/3
-{AI05-0229-1AI05-0229-1} If there is no expression in an
+{<AI05-0229-1AI05-0229-1>} If there is no expression in an
Interrupt_Priority pragma, the Interrupt_Priority aspect has the value
Interrupt_Priority'Last.
_Wording Changes from Ada 2005_
12.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragmas Interrupt_Priority and Priority
were moved here from *note D.1::; aspects Interrupt_Priority
and Priority live there now.
@@ -120561,30 +120988,30 @@ J.15.12 Pragma Relative_Deadline
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Relative_Deadline is
- as follows:
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Relative_Deadline
+ is as follows:
2/3
- pragma Relative_Deadline (relative_deadline_expression);
+ pragma Relative_Deadline (<relative_deadline_>expression);
_Name Resolution Rules_
3/3
-{AI05-0229-1AI05-0229-1} The expected type for a
-relative_deadline_expression is Real_Time.Time_Span.
+{<AI05-0229-1AI05-0229-1>} The expected type for a
+<relative_deadline_>expression is Real_Time.Time_Span.
_Legality Rules_
4/3
-{AI05-0229-1AI05-0229-1} A Relative_Deadline pragma is allowed only
+{<AI05-0229-1AI05-0229-1>} A Relative_Deadline pragma is allowed only
immediately within a task_definition or the declarative_part of a
subprogram_body.
_Static Semantics_
5/3
-{AI05-0229-1AI05-0229-1} For an implementation that supports Annex D, a
-pragma Relative_Deadline specifies the value of the Relative_Deadline
+{<AI05-0229-1AI05-0229-1>} For an implementation that supports Annex D,
+a pragma Relative_Deadline specifies the value of the Relative_Deadline
aspect (see *note D.2.6::). If the pragma appears in a task_definition,
the expression is associated with the aspect for the task type or
single_task_declaration that contains the pragma; otherwise, the
@@ -120594,7 +121021,7 @@ contains the pragma.
_Wording Changes from Ada 2005_
5.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Relative_Deadline was moved here
from *note D.2.6::; aspect Relative_Deadline lives there now.
@@ -120607,7 +121034,7 @@ J.15.13 Pragma Asynchronous
_Syntax_
1/3
- {AI05-0229-1AI05-0229-1} The form of a pragma Asynchronous, which
+ {<AI05-0229-1AI05-0229-1>} The form of a pragma Asynchronous, which
is a representation pragma (see *note 13.1::), is as follows:
2/3
@@ -120616,21 +121043,21 @@ J.15.13 Pragma Asynchronous
_Static Semantics_
3/3
-{AI05-0229-1AI05-0229-1} For an implementation that supports Annex E, a
-pragma Asynchronous specifies that the Asynchronous aspect (see *note
+{<AI05-0229-1AI05-0229-1>} For an implementation that supports Annex E,
+a pragma Asynchronous specifies that the Asynchronous aspect (see *note
E.4.1::) for the procedure or type denoted by local_name has the value
True.
_Legality Rules_
4/3
-{AI05-0229-1AI05-0229-1} The local_name of a pragma Asynchronous shall
+{<AI05-0229-1AI05-0229-1>} The local_name of a pragma Asynchronous shall
denote a declaration that may have aspect Asynchronous specified.
_Wording Changes from Ada 2005_
4.a/3
- {AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This
+ {<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This
subclause is new. Pragma Asynchronous was moved here from
*note E.4.1::; aspect Asynchronous lives there now.
@@ -120641,7 +121068,7 @@ Annex K Language-Defined Aspects and Attributes
***********************************************
1/3
-{AI05-0229-1AI05-0229-1} This annex summarizes the definitions given
+{<AI05-0229-1AI05-0229-1>} This annex summarizes the definitions given
elsewhere of the language-defined aspects and attributes. Some aspects
have corresponding attributes, as noted.
@@ -120657,7 +121084,7 @@ K.1 Language-Defined Aspects
============================
1/3
-{AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This subclause
+{<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This subclause
summarizes the definitions given elsewhere of the language-defined
aspects. Aspects are properties of entities that can be specified by
the Ada program; unless otherwise specified below, aspects can be
@@ -121050,7 +121477,7 @@ K.2 Language-Defined Attributes
===============================
1/3
-{AI05-0229-1AI05-0229-1} {AI05-0299-1AI05-0299-1} This subclause
+{<AI05-0229-1AI05-0229-1>} {<AI05-0299-1AI05-0299-1>} This subclause
summarizes the definitions given elsewhere of the language-defined
attributes. Attributes are properties of entities that can be queried
by an Ada program.
@@ -121062,7 +121489,7 @@ P'Access
3
P'Access yields an access value that designates the
subprogram denoted by P. The type of P'Access is an
- access-to-subprogram type (S), as determined by the
+ access-to-subprogram type (<S>), as determined by the
expected type. See *note 3.10.2::.
4
@@ -121090,25 +121517,25 @@ X'Address
8
S'Adjacent
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
9
S'Adjacent denotes a function with the following
specification:
10
- function S'Adjacent (X, Towards : T)
- return T
+ function S'Adjacent (<X>, <Towards> : <T>)
+ return <T>
11
- If Towards = X, the function yields X; otherwise, it
- yields the machine number of the type T adjacent to X in
- the direction of Towards, if that machine number exists.
- If the result would be outside the base range of S,
- Constraint_Error is raised. When T'Signed_Zeros is True,
- a zero result has the sign of X. When Towards is zero,
- its sign has no bearing on the result. See *note
- A.5.3::.
+ If <Towards> = <X>, the function yields <X>; otherwise,
+ it yields the machine number of the type <T> adjacent to
+ <X> in the direction of <Towards>, if that machine number
+ exists. If the result would be outside the base range of
+ S, Constraint_Error is raised. When <T>'Signed_Zeros is
+ True, a zero result has the sign of <X>. When <Towards>
+ is zero, its sign has no bearing on the result. See
+ *note A.5.3::.
12
S'Aft
@@ -121116,21 +121543,21 @@ S'Aft
13
S'Aft yields the number of decimal digits needed after
- the decimal point to accommodate the delta of the subtype
- S, unless the delta of the subtype S is greater than 0.1,
- in which case the attribute yields the value one. (S'Aft
- is the smallest positive integer N for which
+ the decimal point to accommodate the <delta> of the
+ subtype S, unless the <delta> of the subtype S is greater
+ than 0.1, in which case the attribute yields the value
+ one. (S'Aft is the smallest positive integer N for which
(10**N)*S'Delta is greater than or equal to one.) The
- value of this attribute is of the type universal_integer.
- See *note 3.5.10::.
+ value of this attribute is of the type
+ <universal_integer>. See *note 3.5.10::.
13.1/2
S'Alignment
For every subtype S:
13.2/2
- The value of this attribute is of type universal_integer,
- and nonnegative.
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative.
13.3/2
For an object X of subtype S, if S'Alignment is not zero,
@@ -121143,17 +121570,17 @@ X'Alignment
For a prefix X that denotes an object:
15/2
- The value of this attribute is of type universal_integer,
- and nonnegative; zero means that the object is not
- necessarily aligned on a storage element boundary. If
- X'Alignment is not zero, then X is aligned on a storage
- unit boundary and X'Address is an integral multiple of
- X'Alignment (that is, the Address modulo the Alignment is
- zero).
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative; zero means that the
+ object is not necessarily aligned on a storage element
+ boundary. If X'Alignment is not zero, then X is aligned
+ on a storage unit boundary and X'Address is an integral
+ multiple of X'Alignment (that is, the Address modulo the
+ Alignment is zero).
16/2
- This paragraph was deleted. See *note 13.3::.
+ <This paragraph was deleted.> See *note 13.3::.
17
S'Base
@@ -121161,8 +121588,8 @@ S'Base
18
S'Base denotes an unconstrained subtype of the type of S.
- This unconstrained subtype is called the base subtype of
- the type. See *note 3.5::.
+ This unconstrained subtype is called the <base subtype>
+ of the type. See *note 3.5::.
19
S'Bit_Order
@@ -121190,7 +121617,7 @@ T'Callable
24
Yields the value True when the task denoted by T is
- callable, and False otherwise; See *note 9.9::.
+ <callable>, and False otherwise; See *note 9.9::.
25
E'Caller
@@ -121205,38 +121632,38 @@ E'Caller
27
S'Ceiling
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
28
S'Ceiling denotes a function with the following
specification:
29
- function S'Ceiling (X : T)
- return T
+ function S'Ceiling (<X> : <T>)
+ return <T>
30
- The function yields the value 'ceiling(X)', i.e., the
+ The function yields the value 'ceiling(<X>)', i.e., the
smallest (most negative) integral value greater than or
- equal to X. When X is zero, the result has the sign of X;
- a zero result otherwise has a negative sign when
+ equal to <X>. When <X> is zero, the result has the sign
+ of <X>; a zero result otherwise has a negative sign when
S'Signed_Zeros is True. See *note A.5.3::.
31
S'Class
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
32
S'Class denotes a subtype of the class-wide type (called
- T'Class in this International Standard) for the class
- rooted at T (or if S already denotes a class-wide
+ <T>'Class in this International Standard) for the class
+ rooted at <T> (or if S already denotes a class-wide
subtype, then S'Class is the same as S).
33
S'Class is unconstrained. However, if S is constrained,
then the values of S'Class are only those that when
- converted to the type T belong to S. See *note 3.9::.
+ converted to the type <T> belong to S. See *note 3.9::.
34
S'Class
@@ -121258,31 +121685,32 @@ X'Component_Size
37
Denotes the size in bits of components of the type of X.
- The value of this attribute is of type universal_integer.
- See *note 13.3::.
+ The value of this attribute is of type
+ <universal_integer>. See *note 13.3::.
38
S'Compose
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
39
S'Compose denotes a function with the following
specification:
40
- function S'Compose (Fraction : T;
- Exponent : universal_integer)
- return T
+ function S'Compose (<Fraction> : <T>;
+ <Exponent> : <universal_integer>)
+ return <T>
41
- Let v be the value Fraction � T'Machine_RadixExponent-k,
- where k is the normalized exponent of Fraction. If v is
- a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of Fraction when S'Signed_Zeros is True. See *note
+ Let <v> be the value <Fraction> �
+ <T>'Machine_Radix<Exponent>-<k>, where <k> is the
+ normalized exponent of <Fraction>. If <v> is a machine
+ number of the type <T>, or if |<v>| >= <T>'Model_Small,
+ the function yields <v>; otherwise, it yields either one
+ of the machine numbers of the type <T> adjacent to <v>.
+ Constraint_Error is optionally raised if <v> is outside
+ the base range of S. A zero result has the sign of
+ <Fraction> when S'Signed_Zeros is True. See *note
A.5.3::.
42
@@ -121297,23 +121725,24 @@ A'Constrained
44
S'Copy_Sign
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
45
S'Copy_Sign denotes a function with the following
specification:
46
- function S'Copy_Sign (Value, Sign : T)
- return T
+ function S'Copy_Sign (<Value>, <Sign> : <T>)
+ return <T>
47
- If the value of Value is nonzero, the function yields a
- result whose magnitude is that of Value and whose sign is
- that of Sign; otherwise, it yields the value zero.
+ If the value of <Value> is nonzero, the function yields a
+ result whose magnitude is that of <Value> and whose sign
+ is that of <Sign>; otherwise, it yields the value zero.
Constraint_Error is optionally raised if the result is
outside the base range of S. A zero result has the sign
- of Sign when S'Signed_Zeros is True. See *note A.5.3::.
+ of <Sign> when S'Signed_Zeros is True. See *note
+ A.5.3::.
48
E'Count
@@ -121323,7 +121752,7 @@ E'Count
49
Yields the number of calls presently queued on the entry
E of the current instance of the unit. The value of this
- attribute is of the type universal_integer. See *note
+ attribute is of the type <universal_integer>. See *note
9.9::.
50/1
@@ -121341,24 +121770,24 @@ S'Delta
For every fixed point subtype S:
53
- S'Delta denotes the delta of the fixed point subtype S.
+ S'Delta denotes the <delta> of the fixed point subtype S.
The value of this attribute is of the type
- universal_real. See *note 3.5.10::.
+ <universal_real>. See *note 3.5.10::.
54
S'Denorm
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
55
Yields the value True if every value expressible in the
form
- � mantissa � T'Machine_RadixT'Machine_Emin
- where mantissa is a nonzero T'Machine_Mantissa-digit
- fraction in the number base T'Machine_Radix, the first
+ � <mantissa> � <T>'Machine_Radix<T>'Machine_Emin
+ where <mantissa> is a nonzero <T>'Machine_Mantissa-digit
+ fraction in the number base <T>'Machine_Radix, the first
digit of which is zero, is a machine number (see *note
- 3.5.7::) of the type T; yields the value False otherwise.
- The value of this attribute is of the predefined type
- Boolean. See *note A.5.3::.
+ 3.5.7::) of the type <T>; yields the value False
+ otherwise. The value of this attribute is of the
+ predefined type Boolean. See *note A.5.3::.
56
S'Digits
@@ -121367,38 +121796,38 @@ S'Digits
57
S'Digits denotes the requested decimal precision for the
subtype S. The value of this attribute is of the type
- universal_integer. See *note 3.5.8::.
+ <universal_integer>. See *note 3.5.8::.
58
S'Digits
For every decimal fixed point subtype S:
59
- S'Digits denotes the digits of the decimal fixed point
+ S'Digits denotes the <digits> of the decimal fixed point
subtype S, which corresponds to the number of decimal
digits that are representable in objects of the subtype.
The value of this attribute is of the type
- universal_integer. See *note 3.5.10::.
+ <universal_integer>. See *note 3.5.10::.
60
S'Exponent
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
61
S'Exponent denotes a function with the following
specification:
62
- function S'Exponent (X : T)
- return universal_integer
+ function S'Exponent (<X> : <T>)
+ return <universal_integer>
63
- The function yields the normalized exponent of X. See
+ The function yields the normalized exponent of <X>. See
*note A.5.3::.
64
S'External_Tag
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
65
@@ -121454,7 +121883,7 @@ R.C'First_Bit
of the first bit occupied by C. This offset is measured
in bits. The first bit of a storage element is numbered
zero. The value of this attribute is of the type
- universal_integer. See *note 13.5.2::.
+ <universal_integer>. See *note 13.5.2::.
73.1/4
S'First_Valid
@@ -121469,22 +121898,22 @@ S'First_Valid
74
S'Floor
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
75
S'Floor denotes a function with the following
specification:
76
- function S'Floor (X : T)
- return T
+ function S'Floor (<X> : <T>)
+ return <T>
77
- The function yields the value 'floor(X)', i.e., the
+ The function yields the value 'floor(<X>)', i.e., the
largest (most positive) integral value less than or equal
- to X. When X is zero, the result has the sign of X; a
- zero result otherwise has a positive sign. See *note
- A.5.3::.
+ to <X>. When <X> is zero, the result has the sign of
+ <X>; a zero result otherwise has a positive sign. See
+ *note A.5.3::.
78
S'Fore
@@ -121498,26 +121927,27 @@ S'Fore
a one-character prefix that is either a minus sign or a
space. (This minimum number does not include superfluous
zeros or underlines, and is at least 2.) The value of
- this attribute is of the type universal_integer. See
+ this attribute is of the type <universal_integer>. See
*note 3.5.10::.
80
S'Fraction
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
81
S'Fraction denotes a function with the following
specification:
82
- function S'Fraction (X : T)
- return T
+ function S'Fraction (<X> : <T>)
+ return <T>
83
- The function yields the value X � T'Machine_Radix-k,
- where k is the normalized exponent of X. A zero result,
- which can only occur when X is zero, has the sign of X.
- See *note A.5.3::.
+ The function yields the value <X> �
+ <T>'Machine_Radix-<k>, where <k> is the normalized
+ exponent of <X>. A zero result, which can only occur
+ when <X> is zero, has the sign of <X>. See *note
+ A.5.3::.
83.1/3
X'Has_Same_Storage
@@ -121528,7 +121958,7 @@ X'Has_Same_Storage
specification:
83.3/3
- function X'Has_Same_Storage (Arg : any_type)
+ function X'Has_Same_Storage (<Arg> : <any_type>)
return Boolean
83.4/4
@@ -121568,11 +121998,11 @@ S'Image
specification:
90
- function S'Image(Arg : S'Base)
+ function S'Image(<Arg> : S'Base)
return String
91/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
String. See *note 3.5::.
91.1/4
@@ -121582,12 +122012,12 @@ X'Image
91.2/4
X'Image denotes the result of calling function S'Image
- with Arg being X, where S is the nominal subtype of X.
+ with <Arg> being X, where S is the nominal subtype of X.
See *note 3.5::.
92
S'Class'Input
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
93
S'Class'Input denotes a function with the following
@@ -121595,13 +122025,13 @@ S'Class'Input
94/2
function S'Class'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T'Class
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>'Class
95/3
- First reads the external tag from Stream and determines
+ First reads the external tag from <Stream> and determines
the corresponding internal tag (by calling
- Tags.Descendant_Tag(String'Input(Stream), S'Tag) which
+ Tags.Descendant_Tag(String'Input(<Stream>), S'Tag) which
might raise Tag_Error -- see *note 3.9::) and then
dispatches to the subprogram denoted by the Input
attribute of the specific type identified by the internal
@@ -121611,7 +122041,7 @@ S'Class'Input
96
S'Input
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
97
S'Input denotes a function with the following
@@ -121619,11 +122049,11 @@ S'Input
98/2
function S'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>
99
- S'Input reads and returns one value from Stream, using
+ S'Input reads and returns one value from <Stream>, using
any bounds or discriminants written by a corresponding
S'Output to determine how much to read. See *note
13.13.2::.
@@ -121671,7 +122101,7 @@ R.C'Last_Bit
start of the first of the storage elements occupied by C,
of the last bit occupied by C. This offset is measured in
bits. The value of this attribute is of the type
- universal_integer. See *note 13.5.2::.
+ <universal_integer>. See *note 13.5.2::.
107.1/4
S'Last_Valid
@@ -121686,34 +122116,34 @@ S'Last_Valid
108
S'Leading_Part
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
109
S'Leading_Part denotes a function with the following
specification:
110
- function S'Leading_Part (X : T;
- Radix_Digits : universal_integer)
- return T
+ function S'Leading_Part (<X> : <T>;
+ <Radix_Digits> :
<universal_integer>)
+ return <T>
111
- Let v be the value T'Machine_Radixk-Radix_Digits, where k
- is the normalized exponent of X. The function yields the
- value
+ Let <v> be the value <T>'Machine_Radix<k>-<Radix_Digits>,
+ where <k> is the normalized exponent of <X>. The
+ function yields the value
112
- * 'floor(X/v)' � v, when X is nonnegative and
- Radix_Digits is positive;
+ * 'floor(<X>/<v>)' � <v>, when <X> is nonnegative and
+ <Radix_Digits> is positive;
113
- * 'ceiling(X/v)' � v, when X is negative and
- Radix_Digits is positive.
+ * 'ceiling(<X>/<v>)' � <v>, when <X> is negative and
+ <Radix_Digits> is positive.
114
- Constraint_Error is raised when Radix_Digits is zero or
- negative. A zero result, which can only occur when X is
- zero, has the sign of X. See *note A.5.3::.
+ Constraint_Error is raised when <Radix_Digits> is zero or
+ negative. A zero result, which can only occur when <X>
+ is zero, has the sign of <X>. See *note A.5.3::.
115/1
A'Length
@@ -121724,7 +122154,7 @@ A'Length
116
A'Length denotes the number of values of the first index
range (zero for a null range); its type is
- universal_integer. See *note 3.6.2::.
+ <universal_integer>. See *note 3.6.2::.
117/1
A'Length(N)
@@ -121735,149 +122165,151 @@ A'Length(N)
118
A'Length(N) denotes the number of values of the N-th
index range (zero for a null range); its type is
- universal_integer. See *note 3.6.2::.
+ <universal_integer>. See *note 3.6.2::.
119
S'Machine
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
120
S'Machine denotes a function with the following
specification:
121
- function S'Machine (X : T)
- return T
+ function S'Machine (<X> : <T>)
+ return <T>
122
- If X is a machine number of the type T, the function
- yields X; otherwise, it yields the value obtained by
- rounding or truncating X to either one of the adjacent
- machine numbers of the type T. Constraint_Error is raised
- if rounding or truncating X to the precision of the
- machine numbers results in a value outside the base range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True. See *note A.5.3::.
+ If <X> is a machine number of the type <T>, the function
+ yields <X>; otherwise, it yields the value obtained by
+ rounding or truncating <X> to either one of the adjacent
+ machine numbers of the type <T>. Constraint_Error is
+ raised if rounding or truncating <X> to the precision of
+ the machine numbers results in a value outside the base
+ range of S. A zero result has the sign of <X> when
+ S'Signed_Zeros is True. See *note A.5.3::.
123
S'Machine_Emax
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
124
- Yields the largest (most positive) value of exponent such
- that every value expressible in the canonical form (for
- the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer. See *note A.5.3::.
+ Yields the largest (most positive) value of <exponent>
+ such that every value expressible in the canonical form
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>. See *note
+ A.5.3::.
125
S'Machine_Emin
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
126
- Yields the smallest (most negative) value of exponent
+ Yields the smallest (most negative) value of <exponent>
such that every value expressible in the canonical form
- (for the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer. See *note A.5.3::.
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>. See *note
+ A.5.3::.
127
S'Machine_Mantissa
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
128
- Yields the largest value of p such that every value
- expressible in the canonical form (for the type T),
- having a p-digit mantissa and an exponent between
- T'Machine_Emin and T'Machine_Emax, is a machine number
- (see *note 3.5.7::) of the type T. This attribute yields
- a value of the type universal_integer. See *note
- A.5.3::.
+ Yields the largest value of <p> such that every value
+ expressible in the canonical form (for the type <T>),
+ having a <p>-digit <mantissa> and an <exponent> between
+ <T>'Machine_Emin and <T>'Machine_Emax, is a machine
+ number (see *note 3.5.7::) of the type <T>. This
+ attribute yields a value of the type <universal_integer>.
+ See *note A.5.3::.
129
S'Machine_Overflows
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
130
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean. See
*note A.5.3::.
131
S'Machine_Overflows
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
132
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean. See
*note A.5.4::.
133
S'Machine_Radix
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
134
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer. See *note A.5.3::.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>. See *note A.5.3::.
135
S'Machine_Radix
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
136
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer. See *note A.5.4::.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>. See *note A.5.4::.
136.1/2
S'Machine_Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
136.2/2
S'Machine_Rounding denotes a function with the following
specification:
136.3/2
- function S'Machine_Rounding (X : T)
- return T
+ function S'Machine_Rounding (<X> : <T>)
+ return <T>
136.4/2
- The function yields the integral value nearest to X. If X
- lies exactly halfway between two integers, one of those
- integers is returned, but which of them is returned is
- unspecified. A zero result has the sign of X when
+ The function yields the integral value nearest to <X>.
+ If <X> lies exactly halfway between two integers, one of
+ those integers is returned, but which of them is returned
+ is unspecified. A zero result has the sign of <X> when
S'Signed_Zeros is True. This function provides access to
the rounding behavior which is most efficient on the
target processor. See *note A.5.3::.
137
S'Machine_Rounds
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
138
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean. See *note A.5.3::.
139
S'Machine_Rounds
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
140
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean. See *note A.5.4::.
@@ -121890,7 +122322,7 @@ S'Max
specification:
143
- function S'Max(Left, Right : S'Base)
+ function S'Max(<Left>, <Right> : S'Base)
return S'Base
144
@@ -121905,7 +122337,7 @@ S'Max_Alignment_For_Allocation
Denotes the maximum value for Alignment that could be
requested by the implementation via Allocate for an
access type whose designated subtype is S. The value of
- this attribute is of type universal_integer. See *note
+ this attribute is of type <universal_integer>. See *note
13.11.1::.
145
@@ -121917,7 +122349,7 @@ S'Max_Size_In_Storage_Elements
that could be requested by the implementation via
Allocate for an access type whose designated subtype is
S. The value of this attribute is of type
- universal_integer. See *note 13.11.1::.
+ <universal_integer>. See *note 13.11.1::.
147
S'Min
@@ -121928,7 +122360,7 @@ S'Min
specification:
149
- function S'Min(Left, Right : S'Base)
+ function S'Min(<Left>, <Right> : S'Base)
return S'Base
150
@@ -121944,24 +122376,24 @@ S'Mod
specification:
150.3/2
- function S'Mod (Arg : universal_integer)
+ function S'Mod (<Arg> : <universal_integer>)
return S'Base
150.4/2
- This function returns Arg mod S'Modulus, as a value of
+ This function returns <Arg> mod S'Modulus, as a value of
the type of S. See *note 3.5.4::.
151
S'Model
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
152
S'Model denotes a function with the following
specification:
153
- function S'Model (X : T)
- return T
+ function S'Model (<X> : <T>)
+ return <T>
154
If the Numerics Annex is not supported, the meaning of
@@ -121972,50 +122404,50 @@ S'Model
155
S'Model_Emin
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
156
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to the value of T'Machine_Emin. See *note
- G.2.2:: for further requirements that apply to
+ than or equal to the value of <T>'Machine_Emin. See
+ *note G.2.2:: for further requirements that apply to
implementations supporting the Numerics Annex. The value
- of this attribute is of the type universal_integer. See
- *note A.5.3::.
+ of this attribute is of the type <universal_integer>.
+ See *note A.5.3::.
157
S'Model_Epsilon
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
158
- Yields the value T'Machine_Radix1 - T'Model_Mantissa.
+ Yields the value <T>'Machine_Radix1 - <T>'Model_Mantissa.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
159
S'Model_Mantissa
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
160
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to 'ceiling(d � log(10) /
- log(T'Machine_Radix))' + 1, where d is the requested
- decimal precision of T, and less than or equal to the
- value of T'Machine_Mantissa. See *note G.2.2:: for
+ than or equal to 'ceiling(<d> � log(10) /
+ log(<T>'Machine_Radix))' + 1, where <d> is the requested
+ decimal precision of <T>, and less than or equal to the
+ value of <T>'Machine_Mantissa. See *note G.2.2:: for
further requirements that apply to implementations
supporting the Numerics Annex. The value of this
- attribute is of the type universal_integer. See *note
+ attribute is of the type <universal_integer>. See *note
A.5.3::.
161
S'Model_Small
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
162
- Yields the value T'Machine_RadixT'Model_Emin - 1. The
- value of this attribute is of the type universal_real.
- See *note A.5.3::.
+ Yields the value <T>'Machine_Radix<T>'Model_Emin - 1.
+ The value of this attribute is of the type
+ <universal_real>. See *note A.5.3::.
163
S'Modulus
@@ -122023,7 +122455,7 @@ S'Modulus
164
S'Modulus yields the modulus of the type of S, as a value
- of the type universal_integer. See *note 3.5.4::.
+ of the type <universal_integer>. See *note 3.5.4::.
164.1/3
X'Old
@@ -122038,7 +122470,7 @@ X'Old
165
S'Class'Output
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
166
S'Class'Output denotes a procedure with the following
@@ -122046,14 +122478,14 @@ S'Class'Output
167/2
procedure S'Class'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
168/2
- First writes the external tag of Item to Stream (by
- calling String'Output(Stream,
- Tags.External_Tag(Item'Tag)) -- see *note 3.9::) and then
- dispatches to the subprogram denoted by the Output
+ First writes the external tag of <Item> to <Stream> (by
+ calling String'Output(<Stream>,
+ Tags.External_Tag(<Item>'Tag)) -- see *note 3.9::) and
+ then dispatches to the subprogram denoted by the Output
attribute of the specific type identified by the tag.
Tag_Error is raised if the tag of Item identifies a type
declared at an accessibility level deeper than that of S.
@@ -122061,7 +122493,7 @@ S'Class'Output
169
S'Output
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
170
S'Output denotes a procedure with the following
@@ -122069,12 +122501,13 @@ S'Output
171/2
procedure S'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
172
- S'Output writes the value of Item to Stream, including
- any bounds or discriminants. See *note 13.13.2::.
+ S'Output writes the value of <Item> to <Stream>,
+ including any bounds or discriminants. See *note
+ 13.13.2::.
172.1/3
X'Overlaps_Storage
@@ -122085,7 +122518,7 @@ X'Overlaps_Storage
specification:
172.3/3
- function X'Overlaps_Storage (Arg : any_type)
+ function X'Overlaps_Storage (<Arg> : <any_type>)
return Boolean
172.4/3
@@ -122105,7 +122538,7 @@ D'Partition_Id
library unit:
174
- Denotes a value of the type universal_integer that
+ Denotes a value of the type <universal_integer> that
identifies the partition in which D was elaborated. If D
denotes the declaration of a remote call interface
library unit (see *note E.2.3::) the given partition is
@@ -122121,12 +122554,12 @@ S'Pos
specification:
177
- function S'Pos(Arg : S'Base)
- return universal_integer
+ function S'Pos(<Arg> : S'Base)
+ return <universal_integer>
178
This function returns the position number of the value of
- Arg, as a value of type universal_integer. See *note
+ <Arg>, as a value of type <universal_integer>. See *note
3.5.5::.
179
@@ -122139,7 +122572,7 @@ R.C'Position
of C, denotes the value given for the position of the
component_clause; otherwise, denotes the same value as
R.C'Address - R'Address. The value of this attribute is
- of the type universal_integer. See *note 13.5.2::.
+ of the type <universal_integer>. See *note 13.5.2::.
181
S'Pred
@@ -122150,21 +122583,21 @@ S'Pred
specification:
183
- function S'Pred(Arg : S'Base)
+ function S'Pred(<Arg> : S'Base)
return S'Base
184
For an enumeration type, the function returns the value
whose position number is one less than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
returns the result of subtracting one from the value of
- Arg. For a fixed point type, the function returns the
- result of subtracting small from the value of Arg. For a
- floating point type, the function returns the machine
- number (as defined in *note 3.5.7::) immediately below
- the value of Arg; Constraint_Error is raised if there is
- no such machine number. See *note 3.5::.
+ <Arg>. For a fixed point type, the function returns the
+ result of subtracting <small> from the value of <Arg>.
+ For a floating point type, the function returns the
+ machine number (as defined in *note 3.5.7::) immediately
+ below the value of <Arg>; Constraint_Error is raised if
+ there is no such machine number. See *note 3.5::.
184.1/2
P'Priority
@@ -122210,7 +122643,7 @@ A'Range(N)
191
S'Class'Read
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
192
S'Class'Read denotes a procedure with the following
@@ -122218,8 +122651,8 @@ S'Class'Read
193/2
procedure S'Class'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>'Class)
194
Dispatches to the subprogram denoted by the Read
@@ -122228,7 +122661,7 @@ S'Class'Read
195
S'Read
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
196
S'Read denotes a procedure with the following
@@ -122236,33 +122669,34 @@ S'Read
197/2
procedure S'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>)
198
- S'Read reads the value of Item from Stream. See *note
- 13.13.2::.
+ S'Read reads the value of <Item> from <Stream>. See
+ *note 13.13.2::.
199
S'Remainder
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
200
S'Remainder denotes a function with the following
specification:
201
- function S'Remainder (X, Y : T)
- return T
+ function S'Remainder (<X>, <Y> : <T>)
+ return <T>
202
- For nonzero Y, let v be the value X - n � Y, where n is
- the integer nearest to the exact value of X/Y; if |n -
- X/Y| = 1/2, then n is chosen to be even. If v is a
- machine number of the type T, the function yields v;
- otherwise, it yields zero. Constraint_Error is raised if
- Y is zero. A zero result has the sign of X when
- S'Signed_Zeros is True. See *note A.5.3::.
+ For nonzero <Y>, let <v> be the value <X> - <n> � <Y>,
+ where <n> is the integer nearest to the exact value of
+ <X>/<Y>; if |<n> - <X>/<Y>| = 1/2, then <n> is chosen to
+ be even. If <v> is a machine number of the type <T>, the
+ function yields <v>; otherwise, it yields zero.
+ Constraint_Error is raised if <Y> is zero. A zero result
+ has the sign of <X> when S'Signed_Zeros is True. See
+ *note A.5.3::.
202.1/3
F'Result
@@ -122275,11 +122709,11 @@ F'Result
Post'Class postcondition expression for a function with a
controlling result or with a controlling access result.
For a controlling result, the type of the attribute is
- T'Class, where T is the function result type. For a
+ <T>'Class, where <T> is the function result type. For a
controlling access result, the type of the attribute is
an anonymous access type whose designated type is
- T'Class, where T is the designated type of the function
- result type. See *note 6.1.1::.
+ <T>'Class, where <T> is the designated type of the
+ function result type. See *note 6.1.1::.
203
S'Round
@@ -122290,7 +122724,7 @@ S'Round
specification:
205
- function S'Round(X : universal_real)
+ function S'Round(<X> : <universal_real>)
return S'Base
206
@@ -122300,93 +122734,93 @@ S'Round
207
S'Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
208
S'Rounding denotes a function with the following
specification:
209
- function S'Rounding (X : T)
- return T
+ function S'Rounding (<X> : <T>)
+ return <T>
210
- The function yields the integral value nearest to X,
- rounding away from zero if X lies exactly halfway between
- two integers. A zero result has the sign of X when
- S'Signed_Zeros is True. See *note A.5.3::.
+ The function yields the integral value nearest to <X>,
+ rounding away from zero if <X> lies exactly halfway
+ between two integers. A zero result has the sign of <X>
+ when S'Signed_Zeros is True. See *note A.5.3::.
211
S'Safe_First
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
212
Yields the lower bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
213
S'Safe_Last
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
214
Yields the upper bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
215
S'Scale
For every decimal fixed point subtype S:
216
- S'Scale denotes the scale of the subtype S, defined as
+ S'Scale denotes the <scale> of the subtype S, defined as
the value N such that S'Delta = 10.0**(-N). The scale
indicates the position of the point relative to the
rightmost significant digits of values of subtype S. The
- value of this attribute is of the type universal_integer.
- See *note 3.5.10::.
+ value of this attribute is of the type
+ <universal_integer>. See *note 3.5.10::.
217
S'Scaling
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
218
S'Scaling denotes a function with the following
specification:
219
- function S'Scaling (X : T;
- Adjustment : universal_integer)
- return T
+ function S'Scaling (<X> : <T>;
+ <Adjustment> : <universal_integer>)
+ return <T>
220
- Let v be the value X � T'Machine_RadixAdjustment. If v
- is a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of X when S'Signed_Zeros is True. See *note
- A.5.3::.
+ Let <v> be the value <X> � <T>'Machine_Radix<Adjustment>.
+ If <v> is a machine number of the type <T>, or if |<v>|
+ >= <T>'Model_Small, the function yields <v>; otherwise,
+ it yields either one of the machine numbers of the type
+ <T> adjacent to <v>. Constraint_Error is optionally
+ raised if <v> is outside the base range of S. A zero
+ result has the sign of <X> when S'Signed_Zeros is True.
+ See *note A.5.3::.
221
S'Signed_Zeros
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
222
Yields the value True if the hardware representation for
- the type T has the capability of representing both
+ the type <T> has the capability of representing both
positively and negatively signed zeros, these being
generated and used by the predefined operations of the
- type T as specified in IEC 559:1989; yields the value
+ type <T> as specified in IEC 559:1989; yields the value
False otherwise. The value of this attribute is of the
predefined type Boolean. See *note A.5.3::.
@@ -122411,7 +122845,7 @@ S'Size
227
If S is indefinite, the meaning is implementation
defined. The value of this attribute is of the type
- universal_integer. See *note 13.3::.
+ <universal_integer>. See *note 13.3::.
228/1
X'Size
@@ -122420,16 +122854,16 @@ X'Size
229
Denotes the size in bits of the representation of the
object. The value of this attribute is of the type
- universal_integer. See *note 13.3::.
+ <universal_integer>. See *note 13.3::.
230
S'Small
For every fixed point subtype S:
231
- S'Small denotes the small of the type of S. The value of
- this attribute is of the type universal_real. See *note
- 3.5.10::.
+ S'Small denotes the <small> of the type of S. The value
+ of this attribute is of the type <universal_real>. See
+ *note 3.5.10::.
232
S'Storage_Pool
@@ -122449,7 +122883,7 @@ S'Storage_Size
Storage_Size(S'Storage_Pool), which is intended to be a
measure of the number of storage elements reserved for
the pool. The type of this attribute is
- universal_integer. See *note 13.11::.
+ <universal_integer>. See *note 13.11::.
236/1
T'Storage_Size
@@ -122459,29 +122893,29 @@ T'Storage_Size
237
Denotes the number of storage elements reserved for the
task. The value of this attribute is of the type
- universal_integer. The Storage_Size includes the size of
- the task's stack, if any. The language does not specify
- whether or not it includes other storage associated with
- the task (such as the "task control block" used by some
- implementations.) See *note 13.3::.
+ <universal_integer>. The Storage_Size includes the size
+ of the task's stack, if any. The language does not
+ specify whether or not it includes other storage
+ associated with the task (such as the "task control
+ block" used by some implementations.) See *note 13.3::.
237.1/2
S'Stream_Size
- For every subtype S of an elementary type T:
+ For every subtype S of an elementary type <T>:
237.2/3
Denotes the number of bits read from or written to a
stream by the default implementations of S'Read and
S'Write. Hence, the number of stream elements required
- per item of elementary type T is:
+ per item of elementary type <T> is:
237.3/2
- T'Stream_Size / Ada.Streams.Stream_Element'Size
+ <T>'Stream_Size / Ada.Streams.Stream_Element'Size
237.4/2
- The value of this attribute is of type universal_integer
- and is a multiple of Stream_Element'Size. See *note
- 13.13.2::.
+ The value of this attribute is of type
+ <universal_integer> and is a multiple of
+ Stream_Element'Size. See *note 13.13.2::.
238
S'Succ
@@ -122492,29 +122926,29 @@ S'Succ
specification:
240
- function S'Succ(Arg : S'Base)
+ function S'Succ(<Arg> : S'Base)
return S'Base
241
For an enumeration type, the function returns the value
whose position number is one more than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
- returns the result of adding one to the value of Arg.
+ returns the result of adding one to the value of <Arg>.
For a fixed point type, the function returns the result
- of adding small to the value of Arg. For a floating
+ of adding <small> to the value of <Arg>. For a floating
point type, the function returns the machine number (as
defined in *note 3.5.7::) immediately above the value of
- Arg; Constraint_Error is raised if there is no such
+ <Arg>; Constraint_Error is raised if there is no such
machine number. See *note 3.5::.
242
S'Tag
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
243
- S'Tag denotes the tag of the type T (or if T is
+ S'Tag denotes the tag of the type <T> (or if <T> is
class-wide, the tag of the root type of the corresponding
class). The value of this attribute is of type Tag. See
*note 3.9::.
@@ -122541,39 +122975,39 @@ T'Terminated
248
S'Truncation
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
249
S'Truncation denotes a function with the following
specification:
250
- function S'Truncation (X : T)
- return T
+ function S'Truncation (<X> : <T>)
+ return <T>
251
- The function yields the value 'ceiling(X)' when X is
- negative, and 'floor(X)' otherwise. A zero result has
- the sign of X when S'Signed_Zeros is True. See *note
+ The function yields the value 'ceiling(<X>)' when <X> is
+ negative, and 'floor(<X>)' otherwise. A zero result has
+ the sign of <X> when S'Signed_Zeros is True. See *note
A.5.3::.
252
S'Unbiased_Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
253
S'Unbiased_Rounding denotes a function with the following
specification:
254
- function S'Unbiased_Rounding (X : T)
- return T
+ function S'Unbiased_Rounding (<X> : <T>)
+ return <T>
255
- The function yields the integral value nearest to X,
- rounding toward the even integer if X lies exactly
+ The function yields the integral value nearest to <X>,
+ rounding toward the even integer if <X> lies exactly
halfway between two integers. A zero result has the sign
- of X when S'Signed_Zeros is True. See *note A.5.3::.
+ of <X> when S'Signed_Zeros is True. See *note A.5.3::.
256
X'Unchecked_Access
@@ -122595,12 +123029,12 @@ S'Val
specification:
260
- function S'Val(Arg : universal_integer)
+ function S'Val(<Arg> : <universal_integer>)
return S'Base
261
This function returns a value of the type of S whose
- position number equals the value of Arg. See *note
+ position number equals the value of <Arg>. See *note
3.5.5::.
262
@@ -122625,7 +123059,7 @@ S'Value
specification:
266
- function S'Value(Arg : String)
+ function S'Value(<Arg> : String)
return S'Base
267
@@ -122652,11 +123086,11 @@ S'Wide_Image
specification:
272
- function S'Wide_Image(Arg : S'Base)
+ function S'Wide_Image(<Arg> : S'Base)
return Wide_String
273/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
Wide_String. See *note 3.5::.
273.1/4
@@ -122666,7 +123100,7 @@ X'Wide_Image
273.2/4
X'Wide_Image denotes the result of calling function
- S'Wide_Image with Arg being X, where S is the nominal
+ S'Wide_Image with <Arg> being X, where S is the nominal
subtype of X. See *note 3.5::.
274
@@ -122678,7 +123112,7 @@ S'Wide_Value
specification:
276
- function S'Wide_Value(Arg : Wide_String)
+ function S'Wide_Value(<Arg> : Wide_String)
return S'Base
277
@@ -122695,13 +123129,13 @@ S'Wide_Wide_Image
specification:
277.3/2
- function S'Wide_Wide_Image(Arg : S'Base)
+ function S'Wide_Wide_Image(<Arg> : S'Base)
return Wide_Wide_String
277.4/2
- The function returns an image of the value of Arg, that
- is, a sequence of characters representing the value in
- display form. See *note 3.5::.
+ The function returns an <image> of the value of <Arg>,
+ that is, a sequence of characters representing the value
+ in display form. See *note 3.5::.
277.5/4
X'Wide_Wide_Image
@@ -122710,7 +123144,7 @@ X'Wide_Wide_Image
277.6/4
X'Wide_Wide_Image denotes the result of calling function
- S'Wide_Wide_Image with Arg being X, where S is the
+ S'Wide_Wide_Image with <Arg> being X, where S is the
nominal subtype of X. See *note 3.5::.
277.7/2
@@ -122722,7 +123156,7 @@ S'Wide_Wide_Value
specification:
277.9/2
- function S'Wide_Wide_Value(Arg : Wide_Wide_String)
+ function S'Wide_Wide_Value(<Arg> : Wide_Wide_String)
return S'Base
277.10/2
@@ -122738,7 +123172,7 @@ S'Wide_Wide_Width
S'Wide_Wide_Width denotes the maximum length of a
Wide_Wide_String returned by S'Wide_Wide_Image over all
values of the subtype S. It denotes zero for a subtype
- that has a null range. Its type is universal_integer.
+ that has a null range. Its type is <universal_integer>.
See *note 3.5::.
278
@@ -122749,7 +123183,7 @@ S'Wide_Width
S'Wide_Width denotes the maximum length of a Wide_String
returned by S'Wide_Image over all values of the subtype
S. It denotes zero for a subtype that has a null range.
- Its type is universal_integer. See *note 3.5::.
+ Its type is <universal_integer>. See *note 3.5::.
280
S'Width
@@ -122759,11 +123193,11 @@ S'Width
S'Width denotes the maximum length of a String returned
by S'Image over all values of the subtype S. It denotes
zero for a subtype that has a null range. Its type is
- universal_integer. See *note 3.5::.
+ <universal_integer>. See *note 3.5::.
282
S'Class'Write
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
283
S'Class'Write denotes a procedure with the following
@@ -122771,8 +123205,8 @@ S'Class'Write
284/2
procedure S'Class'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
285
Dispatches to the subprogram denoted by the Write
@@ -122781,7 +123215,7 @@ S'Class'Write
286
S'Write
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
287
S'Write denotes a procedure with the following
@@ -122789,12 +123223,12 @@ S'Write
288/2
procedure S'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
289
- S'Write writes the value of Item to Stream. See *note
- 13.13.2::.
+ S'Write writes the value of <Item> to <Stream>. See
+ *note 13.13.2::.
File: aarm2012.info, Node: Annex L, Next: Annex M, Prev: Annex K, Up: Top
@@ -122807,53 +123241,54 @@ This Annex summarizes the definitions given
elsewhere of the
language-defined pragmas.
2
-pragma All_Calls_Remote[(library_unit_name)]; -- See *note E.2.3::.
+pragma All_Calls_Remote[(<library_unit_>name)]; -- See *note E.2.3::.
2.1/2
-pragma Assert([Check =>] boolean_expression[, [Message =>] string_
+pragma Assert([Check =>] <boolean_>expression[, [Message =>] <string_>
expression]); -- See *note 11.4.2::.
2.2/2
-pragma Assertion_Policy(policy_identifier); -- See *note 11.4.2::.
+pragma Assertion_Policy(<policy_>identifier); -- See *note 11.4.2::.
2.3/3
pragma Assertion_Policy(
- assertion_aspect_mark => policy_identifier
- {, assertion_aspect_mark => policy_identifier}); -- See *note
+ <assertion_>aspect_mark => <policy_>identifier
+ {, <assertion_>aspect_mark => <policy_>identifier}); -- See *note
11.4.2::.
3/3
-This paragraph was deleted.
+<This paragraph was deleted.>
3.1/3
pragma Asynchronous (local_name); -- See *note J.15.13::.
4/3
-This paragraph was deleted.
+<This paragraph was deleted.>
4.1/3
pragma Atomic (local_name); -- See *note J.15.8::.
5/3
-This paragraph was deleted.
+<This paragraph was deleted.>
5.1/3
-pragma Atomic_Components (array_local_name); -- See *note J.15.8::.
+pragma Atomic_Components (<array_>local_name); -- See *note J.15.8::.
6/3
-This paragraph was deleted.
+<This paragraph was deleted.>
6.1/3
-pragma Attach_Handler (handler_name, expression); -- See *note J.15.7::.
+pragma Attach_Handler (<handler_>name, expression); -- See *note
+J.15.7::.
7/3
-This paragraph was deleted.
+<This paragraph was deleted.>
8/3
-This paragraph was deleted.
+<This paragraph was deleted.>
8.1/3
-pragma Convention([Convention =>] convention_identifier,[Entity =>]
+pragma Convention([Convention =>] <convention_>identifier,[Entity =>]
local_name); -- See *note J.15.5::.
8.2/3
@@ -122873,79 +123308,79 @@ pragma Discard_Names[([On => ] local_name)]; -- See
*note C.5::.
pragma Dispatching_Domain (expression); -- See *note J.15.10::.
10
-pragma Elaborate(library_unit_name{, library_unit_name}); -- See *note
-10.2.1::.
+pragma Elaborate(<library_unit_>name{, <library_unit_>name}); -- See
+*note 10.2.1::.
11
-pragma Elaborate_All(library_unit_name{, library_unit_name}); -- See
+pragma Elaborate_All(<library_unit_>name{, <library_unit_>name}); -- See
*note 10.2.1::.
12
-pragma Elaborate_Body[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Elaborate_Body[(<library_unit_>name)]; -- See *note 10.2.1::.
13/3
-This paragraph was deleted.
+<This paragraph was deleted.>
13.1/3
pragma Export(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]); -- See *note
+ [Convention =>] <convention_>identifier, [Entity =>] local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]); -- See *note
J.15.5::.
14/3
-This paragraph was deleted.
+<This paragraph was deleted.>
14.1/3
pragma Import(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]); -- See *note
+ [Convention =>] <convention_>identifier, [Entity =>] local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]); -- See *note
J.15.5::.
14.2/3
-pragma Independent (component_local_name); -- See *note J.15.8::.
+pragma Independent (<component_>local_name); -- See *note J.15.8::.
14.3/3
pragma Independent_Components (local_name); -- See *note J.15.8::.
15/3
-This paragraph was deleted.
+<This paragraph was deleted.>
15.1/3
pragma Inline (name{, name}); -- See *note J.15.1::.
16
-pragma Inspection_Point[(object_name {, object_name})]; -- See *note
+pragma Inspection_Point[(<object_>name {, <object_>name})]; -- See *note
H.3.2::.
17/3
-This paragraph was deleted.
+<This paragraph was deleted.>
17.1/3
-pragma Interrupt_Handler (handler_name); -- See *note J.15.7::.
+pragma Interrupt_Handler (<handler_>name); -- See *note J.15.7::.
18/3
-This paragraph was deleted.
+<This paragraph was deleted.>
18.1/3
pragma Interrupt_Priority [(expression);] -- See *note J.15.11::.
19
-pragma Linker_Options(string_expression); -- See *note B.1::.
+pragma Linker_Options(<string_>expression); -- See *note B.1::.
20
pragma List(identifier); -- See *note 2.8::.
21
-pragma Locking_Policy(policy_identifier); -- See *note D.3::.
+pragma Locking_Policy(<policy_>identifier); -- See *note D.3::.
21.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
21.2/3
-pragma No_Return (procedure_local_name{, procedure_local_name}); -- See
-*note J.15.2::.
+pragma No_Return (<procedure_>local_name{, <procedure_>local_name}); --
+See *note J.15.2::.
22
pragma Normalize_Scalars; -- See *note H.1::.
@@ -122954,60 +123389,61 @@ pragma Normalize_Scalars; -- See *note H.1::.
pragma Optimize(identifier); -- See *note 2.8::.
24/3
-This paragraph was deleted.
+<This paragraph was deleted.>
24.1/3
-pragma Pack (first_subtype_local_name); -- See *note J.15.3::.
+pragma Pack (<first_subtype_>local_name); -- See *note J.15.3::.
25
pragma Page; -- See *note 2.8::.
25.1/2
-pragma Partition_Elaboration_Policy (policy_identifier); -- See *note
+pragma Partition_Elaboration_Policy (<policy_>identifier); -- See *note
H.6::.
25.2/2
pragma Preelaborable_Initialization(direct_name); -- See *note 10.2.1::.
26
-pragma Preelaborate[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Preelaborate[(<library_unit_>name)]; -- See *note 10.2.1::.
27/3
-This paragraph was deleted.
+<This paragraph was deleted.>
27.1/3
pragma Priority (expression); -- See *note J.15.11::.
27.2/2
pragma Priority_Specific_Dispatching (
- policy_identifier, first_priority_expression, last_priority_
+ <policy_>identifier, <first_priority_>expression, <last_priority_>
expression); -- See *note D.2.2::.
27.3/3
-pragma Profile (profile_identifier {, profile_
+pragma Profile (<profile_>identifier {, <profile_>
pragma_argument_association}); -- See *note 13.12::.
27.4/3
-This paragraph was deleted.
+<This paragraph was deleted.>
28
-pragma Pure[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Pure[(<library_unit_>name)]; -- See *note 10.2.1::.
29
-pragma Queuing_Policy(policy_identifier); -- See *note D.4::.
+pragma Queuing_Policy(<policy_>identifier); -- See *note D.4::.
29.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
29.2/3
-pragma Relative_Deadline (relative_deadline_expression); -- See *note
+pragma Relative_Deadline (<relative_deadline_>expression); -- See *note
J.15.12::.
30
-pragma Remote_Call_Interface[(library_unit_name)]; -- See *note E.2.3::.
+pragma Remote_Call_Interface[(<library_unit_>name)]; -- See *note
+E.2.3::.
31
-pragma Remote_Types[(library_unit_name)]; -- See *note E.2.2::.
+pragma Remote_Types[(<library_unit_>name)]; -- See *note E.2.2::.
32
pragma Restrictions(restriction{, restriction}); -- See *note 13.12::.
@@ -123016,10 +123452,10 @@ pragma Restrictions(restriction{, restriction}); --
See *note 13.12::.
pragma Reviewable; -- See *note H.3.1::.
34
-pragma Shared_Passive[(library_unit_name)]; -- See *note E.2.1::.
+pragma Shared_Passive[(<library_unit_>name)]; -- See *note E.2.1::.
35/3
-This paragraph was deleted.
+<This paragraph was deleted.>
35.1/3
pragma Storage_Size (expression); -- See *note J.15.4::.
@@ -123028,29 +123464,30 @@ pragma Storage_Size (expression); -- See *note
J.15.4::.
pragma Suppress(identifier); -- See *note 11.5::.
37
-pragma Task_Dispatching_Policy(policy_identifier); -- See *note D.2.2::.
+pragma Task_Dispatching_Policy(<policy_>identifier); -- See *note
+D.2.2::.
37.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
37.2/3
-pragma Unchecked_Union (first_subtype_local_name); -- See *note
+pragma Unchecked_Union (<first_subtype_>local_name); -- See *note
J.15.6::.
37.3/2
pragma Unsuppress(identifier); -- See *note 11.5::.
38/3
-This paragraph was deleted.
+<This paragraph was deleted.>
38.1/3
pragma Volatile (local_name); -- See *note J.15.8::.
39/3
-This paragraph was deleted.
+<This paragraph was deleted.>
39.1/3
-pragma Volatile_Components (array_local_name); -- See *note J.15.8::.
+pragma Volatile_Components (<array_>local_name); -- See *note J.15.8::.
_Wording Changes from Ada 83_
@@ -123065,7 +123502,7 @@ Annex M Summary of Documentation Requirements
*********************************************
1/3
-{AI05-0299-1AI05-0299-1} The Ada language allows for certain target
+{<AI05-0299-1AI05-0299-1>} The Ada language allows for certain target
machine dependences in a controlled manner. Each Ada implementation
must document many characteristics and properties of the target system.
This International Standard contains specific documentation
@@ -123334,8 +123771,8 @@ M.2 Implementation-Defined Characteristics
1/2
The Ada language allows for certain machine dependences in a controlled
-manner. Each Ada implementation must document all implementation-defined
-characteristics:
+manner. Each Ada implementation must document all
+implementation-defined characteristics:
1.a
Ramification: It need not document unspecified
@@ -123370,7 +123807,7 @@ characteristics:
Form KC. See *note 2.1::(4.1/3).
7/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
8
* The representation for an end of line. See *note 2.2::(2/3).
@@ -123421,10 +123858,11 @@ characteristics:
*note 3.5.7::(16).
18
- * The small of an ordinary fixed point type. See *note 3.5.9::(8/2).
+ * The <small> of an ordinary fixed point type. See *note
+ 3.5.9::(8/2).
19
- * What combinations of small, range, and digits are supported for
+ * What combinations of <small>, range, and <digits> are supported for
fixed point types. See *note 3.5.9::(10).
20/2
@@ -123468,7 +123906,7 @@ characteristics:
more than 100 hours. See *note 9.6.1::(86/2).
27/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
28
* The representation for a compilation. See *note 10.1::(2).
@@ -123538,8 +123976,8 @@ characteristics:
11.4.1::(13/2).
41.1/3
- * Implementation-defined policy_identifiers and
- assertion_aspect_marks allowed in a pragma Assertion_Policy. See
+ * Implementation-defined <policy_>identifiers and
+ <assertion_>aspect_marks allowed in a pragma Assertion_Policy. See
*note 11.4.2::(9/3).
41.2/2
@@ -123614,7 +124052,7 @@ characteristics:
*note 13.9::(11).
53/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
54
* Whether or not the implementation provides user-accessible names
@@ -123626,14 +124064,14 @@ characteristics:
13.11::(18).
56/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
56.1/4
* The effect of specifying aspect Default_Storage_Pool on an instance
of a language-defined generic unit. See *note 13.11.3::(5).
57/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
57.1/3
* Implementation-defined restrictions allowed in a pragma
@@ -123676,14 +124114,14 @@ characteristics:
A.5.2::(27).
65/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
66
* The string representation of a random number generator's state.
See *note A.5.2::(38).
67/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
68
* The values of the Model_Mantissa, Model_Emin, Model_Epsilon, Model,
@@ -123691,7 +124129,7 @@ characteristics:
supported. See *note A.5.3::(72).
69/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
70
* The value of Buffer_Size in Storage_IO. See *note A.9::(10).
@@ -123794,10 +124232,10 @@ characteristics:
C.1::(1/3).
82/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
83/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
83.1/3
* Any restrictions on a protected procedure or its containing type
@@ -123810,7 +124248,7 @@ characteristics:
C.3.1::(19).
84/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
85/4
* The semantics of some attributes and functions of an entity for
@@ -123826,17 +124264,17 @@ characteristics:
C.7.1::(17/3).
88/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
88.1/1
* Granularity of locking for Task_Attributes. See *note
C.7.2::(16/1).
89/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
90/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
91
* The declarations of Any_Priority and Priority. See *note
@@ -123854,10 +124292,10 @@ characteristics:
dispatching. See *note D.2.1::(9/2).
95/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
96/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
97/2
* Implementation defined task dispatching policies. See *note
@@ -123868,7 +124306,7 @@ characteristics:
D.2.5::(4).
98
- * Implementation-defined policy_identifiers allowed in a pragma
+ * Implementation-defined <policy_>identifiers allowed in a pragma
Locking_Policy. See *note D.3::(4).
98.1/2
@@ -123886,7 +124324,7 @@ characteristics:
* Implementation-defined queuing policies. See *note D.4::(1/3).
102/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
103
* Any operations that implicitly require heap storage allocation.
@@ -123918,10 +124356,10 @@ characteristics:
program code or data size or execution time. See *note D.7::(20).
105/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
106/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
106.1/3
* The value of Barrier_Limit'Last in Synchronous_Barriers. See *note
@@ -123932,7 +124370,7 @@ characteristics:
aborted. See *note D.10.1::(13/3).
107/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
107.1/3
* The value of Min_Handler_Ceiling in Execution_Time.Group_Budgets.
@@ -123960,7 +124398,7 @@ characteristics:
E.1::(11).
111/1
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
112
* Whether the execution of the remote subprogram is immediately
@@ -123970,7 +124408,7 @@ characteristics:
* The range of type System.RPC.Partition_Id. See *note E.5::(14).
113/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
114
* Implementation-defined interfaces in the PCS. See *note E.5::(26).
@@ -124025,14 +124463,14 @@ characteristics:
multiplication by a reciprocal. See *note G.2.1::(16).
125
- * The definition of close result set, which determines the accuracy
+ * The definition of <close result set>, which determines the accuracy
of certain fixed point multiplications and divisions. See *note
G.2.3::(5).
126
- * Conditions on a universal_real operand of a fixed point
+ * Conditions on a <universal_real> operand of a fixed point
multiplication or division for which the result shall be in the
- perfect result set. See *note G.2.3::(22).
+ <perfect result set>. See *note G.2.3::(22).
127
* The result of a fixed point arithmetic operation in overflow
@@ -124045,7 +124483,7 @@ characteristics:
is False. See *note G.2.4::(4).
129
- * The value of the angle threshold, within which certain elementary
+ * The value of the <angle threshold>, within which certain elementary
functions, complex arithmetic operations, and complex elementary
functions yield results conforming to a maximum relative error
bound. See *note G.2.4::(10).
@@ -124076,19 +124514,19 @@ characteristics:
See *note G.3.2::(149/2).
133/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
134/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
135/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
136/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
136.1/2
- * Implementation-defined policy_identifiers allowed in a pragma
+ * Implementation-defined <policy_>identifiers allowed in a pragma
Partition_Elaboration_Policy. See *note H.6::(4/2).
@@ -124223,8 +124661,8 @@ document whether that advice is followed:
be followed. See *note 13.3::(19).
26.1/3
- * For any tagged specific subtype S, S'Class'Alignment should equal
- S'Alignment. See *note 13.3::(28).
+ * For any tagged specific subtype <S>, <S>'Class'Alignment should
+ equal <S>'Alignment. See *note 13.3::(28).
27/2
* The recommended level of support for the Alignment attribute should
@@ -124419,23 +124857,23 @@ document whether that advice is followed:
61/2
* The worst-case time complexity of Element for Containers.Vector
- should be O(log N). See *note A.18.2::(256/2).
+ should be <O>(log <N>). See *note A.18.2::(256/2).
62/2
- * The worst-case time complexity of Append with Count = 1 when N is
- less than the capacity for Containers.Vector should be O(log N).
- See *note A.18.2::(257/2).
+ * The worst-case time complexity of Append with Count = 1 when <N> is
+ less than the capacity for Containers.Vector should be <O>(log
+ <N>). See *note A.18.2::(257/2).
63/2
* The worst-case time complexity of Prepend with Count = 1 and
- Delete_First with Count=1 for Containers.Vectors should be O(N log
- N). See *note A.18.2::(258/2).
+ Delete_First with Count=1 for Containers.Vectors should be <O>(<N>
+ log <N>). See *note A.18.2::(258/2).
64/2
* The worst-case time complexity of a call on procedure Sort of an
- instance of Containers.Vectors.Generic_Sorting should be O(N**2),
- and the average time complexity should be better than O(N**2). See
- *note A.18.2::(259/2).
+ instance of Containers.Vectors.Generic_Sorting should be
+ <O>(<N>**2), and the average time complexity should be better than
+ <O>(<N>**2). See *note A.18.2::(259/2).
65/2
* Containers.Vectors.Generic_Sorting.Sort and
@@ -124455,13 +124893,13 @@ document whether that advice is followed:
68/2
* The worst-case time complexity of Element, Insert with Count=1, and
Delete with Count=1 for Containers.Doubly_Linked_Lists should be
- O(log N). See *note A.18.3::(160/2).
+ <O>(log <N>). See *note A.18.3::(160/2).
69/2
* A call on procedure Sort of an instance of
Containers.Doubly_Linked_Lists.Generic_Sorting should have an
- average time complexity better than O(N**2) and worst case no worse
- than O(N**2). See *note A.18.3::(161/2).
+ average time complexity better than <O>(<N>**2) and worst case no
+ worse than <O>(<N>**2). See *note A.18.3::(161/2).
70/2
* Containers.Doubly_Linked_Lists.Move should not copy elements, and
@@ -124485,19 +124923,19 @@ document whether that advice is followed:
74/2
* The average time complexity of Element, Insert, Include, Replace,
Delete, Exclude and Find operations that take a key parameter for
- Containers.Hashed_Maps should be O(log N). The average time
+ Containers.Hashed_Maps should be <O>(log <N>). The average time
complexity of the subprograms of Containers.Hashed_Maps that take a
- cursor parameter should be O(1). The average time complexity of
- Containers.Hashed_Maps.Reserve_Capacity should be O(N). See *note
- A.18.5::(62/2).
+ cursor parameter should be <O>(1). The average time complexity of
+ Containers.Hashed_Maps.Reserve_Capacity should be <O>(<N>). See
+ *note A.18.5::(62/2).
75/2
* The worst-case time complexity of Element, Insert, Include,
Replace, Delete, Exclude and Find operations that take a key
- parameter for Containers.Ordered_Maps should be O((log N)**2) or
- better. The worst-case time complexity of the subprograms of
+ parameter for Containers.Ordered_Maps should be <O>((log <N>)**2)
+ or better. The worst-case time complexity of the subprograms of
Containers.Ordered_Maps that take a cursor parameter should be
- O(1). See *note A.18.6::(95/2).
+ <O>(1). See *note A.18.6::(95/2).
76/2
* Move for sets should not copy elements, and should minimize copying
@@ -124511,24 +124949,25 @@ document whether that advice is followed:
78/2
* The average time complexity of the Insert, Include, Replace,
Delete, Exclude and Find operations of Containers.Hashed_Sets that
- take an element parameter should be O(log N). The average time
+ take an element parameter should be <O>(log <N>). The average time
complexity of the subprograms of Containers.Hashed_Sets that take a
- cursor parameter should be O(1). The average time complexity of
- Containers.Hashed_Sets.Reserve_Capacity should be O(N). See *note
- A.18.8::(88/2).
+ cursor parameter should be <O>(1). The average time complexity of
+ Containers.Hashed_Sets.Reserve_Capacity should be <O>(<N>). See
+ *note A.18.8::(88/2).
79/2
* The worst-case time complexity of the Insert, Include, Replace,
Delete, Exclude and Find operations of Containers.Ordered_Sets that
- take an element parameter should be O((log N)**2). The worst-case
- time complexity of the subprograms of Containers.Ordered_Sets that
- take a cursor parameter should be O(1). See *note A.18.9::(116/2).
+ take an element parameter should be <O>((log <N>)**2). The
+ worst-case time complexity of the subprograms of
+ Containers.Ordered_Sets that take a cursor parameter should be
+ <O>(1). See *note A.18.9::(116/2).
79.1/3
* The worst-case time complexity of the Element, Parent, First_Child,
Last_Child, Next_Sibling, Previous_Sibling, Insert_Child with
Count=1, and Delete operations of Containers.Multiway_Trees should
- be O(log N). See *note A.18.10::(231/3).
+ be <O>(log <N>). See *note A.18.10::(231/3).
79.2/3
* Containers.Multiway_Trees.Move should not copy elements, and should
@@ -124610,8 +125049,8 @@ document whether that advice is followed:
80/2
* Containers.Generic_Array_Sort and
Containers.Generic_Constrained_Array_Sort should have an average
- time complexity better than O(N**2) and worst case no worse than
- O(N**2). See *note A.18.26::(10/2).
+ time complexity better than <O>(<N>**2) and worst case no worse
+ than <O>(<N>**2). See *note A.18.26::(10/2).
81/2
* Containers.Generic_Array_Sort and
@@ -124620,8 +125059,8 @@ document whether that advice is followed:
81.1/3
* Containers.Generic_Sort should have an average time complexity
- better than O(N**2) and worst case no worse than O(N**2). See
- *note A.18.26::(12/3).
+ better than <O>(<N>**2) and worst case no worse than <O>(<N>**2).
+ See *note A.18.26::(12/3).
81.2/3
* Containers.Generic_Sort should minimize calls to the generic formal
@@ -124648,11 +125087,11 @@ document whether that advice is followed:
B.1::(40/3).
84/3
- * For each supported convention L other than Intrinsic, specifying
+ * For each supported convention <L> other than Intrinsic, specifying
the aspects Import and Export should be supported for objects of
- L-compatible types and for subprograms, and aspect Convention
- should be supported for L-eligible types and for subprograms. See
- *note B.1::(41/4).
+ <L>-compatible types and for subprograms, and aspect Convention
+ should be supported for <L>-eligible types and for subprograms.
+ See *note B.1::(41/4).
85/2
* If an interface to C, COBOL, or Fortran is provided, the
@@ -124823,7 +125262,7 @@ document whether that advice is followed:
118/2
* Packed decimal should be used as the internal representation for
- objects of subtype S when S'Machine_Radix = 10. See *note
+ objects of subtype <S> when <S>'Machine_Radix = 10. See *note
F.1::(2).
119/2
@@ -124918,7 +125357,7 @@ Annex N Glossary
****************
1/2
-{AI95-00437-01AI95-00437-01} This Annex contains informal descriptions
+{<AI95-00437-01AI95-00437-01>} This Annex contains informal descriptions
of some of the terms used in this International Standard. The index
provides references to more formal definitions of all of the terms used
in this International Standard.
@@ -124965,14 +125404,14 @@ places.
4.3/2
Category (of types). A category of types is a set of types with one or
more common properties, such as primitive operations. A category of
-types that is closed under derivation is also known as a class.
+types that is closed under derivation is also known as a <class>.
5
Character type. A character type is an enumeration type whose values
include characters.
6/2
-Class (of types). A class is a set of types that is closed under
+Class (of types). A class is a set of types that is closed under
derivation, which means that if a given type is in the class, then all
types derived from that type are also in the class. The set of types of
a class share common properties, such as their primitive operations.
@@ -124987,7 +125426,7 @@ declaration, the body, or a renaming of a program
unit.
Composite type. A composite type may have components.
9
-Construct. A construct is a piece of text (explicit or implicit) that
+Construct. A <construct> is a piece of text (explicit or implicit) that
is an instance of a syntactic category defined under "Syntax".
9.1/3
@@ -125001,14 +125440,14 @@ Controlled type. A controlled type supports
user-defined assignment and
finalization. Objects are always finalized before being destroyed.
11
-Declaration. A declaration is a language construct that associates a
-name with (a view of) an entity. A declaration may appear explicitly in
-the program text (an explicit declaration), or may be supposed to occur
-at a given place in the text as a consequence of the semantics of
-another construct (an implicit declaration).
+Declaration. A <declaration> is a language construct that associates a
+name with (a view of) an entity. A declaration may appear explicitly in
+the program text (an <explicit> declaration), or may be supposed to
+occur at a given place in the text as a consequence of the semantics of
+another construct (an <implicit> declaration).
12/2
-This paragraph was deleted.
+<This paragraph was deleted.>
13/2
Derived type. A derived type is a type defined in terms of one or more
@@ -125054,17 +125493,17 @@ effect is called evaluation. Evaluation is one of
the forms of
execution.
18
-Exception. An exception represents a kind of exceptional situation; an
-occurrence of such a situation (at run time) is called an exception
-occurrence. To raise an exception is to abandon normal program execution
-so as to draw attention to the fact that the corresponding situation has
-arisen. Performing some actions in response to the arising of an
-exception is called handling the exception.
+Exception. An <exception> represents a kind of exceptional situation;
+an occurrence of such a situation (at run time) is called an <exception
+occurrence>. To <raise> an exception is to abandon normal program
+execution so as to draw attention to the fact that the corresponding
+situation has arisen. Performing some actions in response to the
+arising of an exception is called <handling> the exception.
19
Execution. The process by which a construct achieves its run-time
-effect is called execution. Execution of a declaration is also called
-elaboration. Execution of an expression is also called evaluation.
+effect is called <execution>. Execution of a declaration is also called
+<elaboration>. Execution of an expression is also called <evaluation>.
19.1/2
Function. A function is a form of subprogram that returns a result and
@@ -125128,9 +125567,9 @@ may perform arbitrary computations to access elements
from a container.
Library unit. A library unit is a separately compiled program unit, and
is always a package, subprogram, or generic unit. Library units may
have other (logically nested) library units as children, and may have
-other program units physically nested within them. A root library unit,
+other program units physically nested within them. A root library unit,
together with its children and grandchildren and so on, form a
-subsystem.
+<subsystem>.
23/2
Limited type. A limited type is a type for which copying (such as in an
@@ -125162,11 +125601,11 @@ definition of the derived type. The parent can be
almost any kind of
type, including an interface type.
26
-Partition. A partition is a part of a program. Each partition consists
-of a set of library units. Each partition may run in a separate address
-space, possibly on a separate computer. A program may contain just one
-partition. A distributed program typically contains multiple
-partitions, which can execute concurrently.
+Partition. A <partition> is a part of a program. Each partition
+consists of a set of library units. Each partition may run in a
+separate address space, possibly on a separate computer. A program may
+contain just one partition. A distributed program typically contains
+multiple partitions, which can execute concurrently.
26.1/3
Postcondition. A postcondition is an assertion that is expected to be
@@ -125218,12 +125657,12 @@ is always an interface type. Interfaces, tasks,
and protected types may
also have progenitors.
31
-Program. A program is a set of partitions, each of which may execute in
-a separate address space, possibly on a separate computer. A partition
-consists of a set of library units.
+Program. A <program> is a set of <partitions>, each of which may
+execute in a separate address space, possibly on a separate computer. A
+partition consists of a set of library units.
32
-Program unit. A program unit is either a package, a task unit, a
+Program unit. A <program unit> is either a package, a task unit, a
protected unit, a protected entry, a generic unit, or an explicitly
declared subprogram other than an enumeration literal. Certain kinds of
program units can be separately compiled. Alternatively, they can
@@ -125304,10 +125743,11 @@ task entries. The top-level task of a partition is
called the
environment task.
41/2
-Type. Each object has a type. A type has an associated set of values,
-and a set of primitive operations which implement the fundamental
-aspects of its semantics. Types are grouped into categories. Most
-language-defined categories of types are also classes of types.
+Type. Each object has a type. A <type> has an associated set of
+values, and a set of <primitive operations> which implement the
+fundamental aspects of its semantics. Types are grouped into
+<categories>. Most language-defined categories of types are also
+<classes> of types.
41.1/4
Type Invariant. See Invariant.
@@ -125381,10 +125821,10 @@ This Annex summarizes the complete syntax of the
language. See *note
string_literal ::= "{string_element}"
*note 2.6:::
- string_element ::= "" | non_quotation_mark_graphic_character
+ string_element ::= "" | <non_quotation_mark_>graphic_character
*note 2.7:::
- comment ::= --{non_end_of_line_character}
+ comment ::= --{<non_end_of_line_>character}
*note 2.8:::
pragma ::=
@@ -125393,10 +125833,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 2.8:::
pragma_argument_association ::=
- [pragma_argument_identifier =>] name
- | [pragma_argument_identifier =>] expression
- | pragma_argument_aspect_mark => name
- | pragma_argument_aspect_mark => expression
+ [<pragma_argument_>identifier =>] name
+ | [<pragma_argument_>identifier =>] expression
+ | <pragma_argument_>aspect_mark => name
+ | <pragma_argument_>aspect_mark => expression
*note 3.1:::
basic_declaration ::=
@@ -125441,7 +125881,7 @@ This Annex summarizes the complete syntax of the
language. See *note
subtype_indication ::= [null_exclusion] subtype_mark [constraint]
*note 3.2.2:::
- subtype_mark ::= subtype_name
+ subtype_mark ::= <subtype_>name
*note 3.2.2:::
constraint ::= scalar_constraint | composite_constraint
@@ -125474,11 +125914,11 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.3.2:::
number_declaration ::=
- defining_identifier_list : constant := static_expression;
+ defining_identifier_list : constant := <static_>expression;
*note 3.4:::
derived_type_definition ::=
- [abstract] [limited] new parent_subtype_indication [[and
+ [abstract] [limited] new <parent_>subtype_indication [[and
interface_list] record_extension_part]
*note 3.5:::
@@ -125505,11 +125945,11 @@ This Annex summarizes the complete syntax of the
language. See *note
modular_type_definition
*note 3.5.4:::
- signed_integer_type_definition ::= range static_
- simple_expression .. static_simple_expression
+ signed_integer_type_definition ::= range <static_>
+ simple_expression .. <static_>simple_expression
*note 3.5.4:::
- modular_type_definition ::= mod static_expression
+ modular_type_definition ::= mod <static_>expression
*note 3.5.6:::
real_type_definition ::=
@@ -125517,11 +125957,11 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.5.7:::
floating_point_definition ::=
- digits static_expression [real_range_specification]
+ digits <static_>expression [real_range_specification]
*note 3.5.7:::
real_range_specification ::=
- range static_simple_expression .. static_simple_expression
+ range <static_>simple_expression .. <static_>simple_expression
*note 3.5.9:::
fixed_point_definition ::= ordinary_fixed_point_definition |
@@ -125529,16 +125969,16 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.5.9:::
ordinary_fixed_point_definition ::=
- delta static_expression real_range_specification
+ delta <static_>expression real_range_specification
*note 3.5.9:::
decimal_fixed_point_definition ::=
- delta static_expression digits static_expression [
+ delta <static_>expression digits <static_>expression [
real_range_specification]
*note 3.5.9:::
digits_constraint ::=
- digits static_simple_expression [range_constraint]
+ digits <static_>simple_expression [range_constraint]
*note 3.6:::
array_type_definition ::=
@@ -125558,7 +125998,8 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_subtype_definition}) of component_definition
*note 3.6:::
- discrete_subtype_definition ::= discrete_subtype_indication | range
+ discrete_subtype_definition ::= <discrete_>subtype_indication |
+ range
*note 3.6:::
component_definition ::=
@@ -125569,7 +126010,7 @@ This Annex summarizes the complete syntax of the
language. See *note
index_constraint ::= (discrete_range {, discrete_range})
*note 3.6.1:::
- discrete_range ::= discrete_subtype_indication | range
+ discrete_range ::= <discrete_>subtype_indication | range
*note 3.7:::
discriminant_part ::= unknown_discriminant_part |
@@ -125598,8 +126039,8 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.7.1:::
discriminant_association ::=
- [discriminant_selector_name {| discriminant_selector_name} =>]
- expression
+ [<discriminant_>selector_name {| <discriminant_>
+ selector_name} =>] expression
*note 3.8:::
record_type_definition ::= [[abstract] tagged] [limited]
@@ -125629,7 +126070,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.8.1:::
variant_part ::=
- case discriminant_direct_name is
+ case <discriminant_>direct_name is
variant
{variant}
end case;
@@ -125643,7 +126084,7 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_choice_list ::= discrete_choice {| discrete_choice}
*note 3.8.1:::
- discrete_choice ::= choice_expression | discrete_
+ discrete_choice ::= choice_expression | <discrete_>
subtype_indication | range | others
*note 3.9.1:::
@@ -125661,7 +126102,7 @@ This Annex summarizes the complete syntax of the
language. See *note
interface_list]
*note 3.9.4:::
- interface_list ::= interface_subtype_mark {and interface_
+ interface_list ::= <interface_>subtype_mark {and <interface_>
subtype_mark}
*note 3.10:::
@@ -125751,20 +126192,20 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.1.4:::
attribute_designator ::=
- identifier[(static_expression)]
+ identifier[(<static_>expression)]
| Access | Delta | Digits | Mod
*note 4.1.4:::
range_attribute_reference ::= prefix'range_attribute_designator
*note 4.1.4:::
- range_attribute_designator ::= Range[(static_expression)]
+ range_attribute_designator ::= Range[(<static_>expression)]
*note 4.1.5:::
- generalized_reference ::= reference_object_name
+ generalized_reference ::= <reference_object_>name
*note 4.1.6:::
- generalized_indexing ::= indexable_container_object_prefix
+ generalized_indexing ::= <indexable_container_object_>prefix
actual_parameter_part
*note 4.3:::
@@ -125786,7 +126227,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.3.1:::
component_choice_list ::=
- component_selector_name {| component_selector_name}
+ <component_>selector_name {| <component_>selector_name}
| others
*note 4.3.2:::
@@ -125836,14 +126277,14 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.4:::
relation ::=
simple_expression [relational_operator simple_expression]
- | tested_simple_expression [not] in membership_choice_list
+ | <tested_>simple_expression [not] in membership_choice_list
| raise_expression
*note 4.4:::
membership_choice_list ::= membership_choice {| membership_choice}
*note 4.4:::
- membership_choice ::= choice_simple_expression | range |
+ membership_choice ::= <choice_>simple_expression | range |
subtype_mark
*note 4.4:::
@@ -125885,23 +126326,23 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.5.7:::
if_expression ::=
- if condition then dependent_expression
- {elsif condition then dependent_expression}
- [else dependent_expression]
+ if condition then <dependent_>expression
+ {elsif condition then <dependent_>expression}
+ [else <dependent_>expression]
*note 4.5.7:::
- condition ::= boolean_expression
+ condition ::= <boolean_>expression
*note 4.5.7:::
case_expression ::=
- case selecting_expression is
+ case <selecting_>expression is
case_expression_alternative {,
case_expression_alternative}
*note 4.5.7:::
case_expression_alternative ::=
when discrete_choice_list =>
- dependent_expression
+ <dependent_>expression
*note 4.5.8:::
quantified_expression ::= for quantifier
@@ -125912,7 +126353,7 @@ This Annex summarizes the complete syntax of the
language. See *note
quantifier ::= all | some
*note 4.5.8:::
- predicate ::= boolean_expression
+ predicate ::= <boolean_>expression
*note 4.6:::
type_conversion ::=
@@ -125929,7 +126370,7 @@ This Annex summarizes the complete syntax of the
language. See *note
| new [subpool_specification] qualified_expression
*note 4.8:::
- subpool_specification ::= (subpool_handle_name)
+ subpool_specification ::= (<subpool_handle_>name)
*note 5.1:::
sequence_of_statements ::= statement {statement} {label}
@@ -125958,14 +126399,14 @@ This Annex summarizes the complete syntax of the
language. See *note
null_statement ::= null;
*note 5.1:::
- label ::= <<label_statement_identifier>>
+ label ::= <<<label_>statement_identifier>>
*note 5.1:::
statement_identifier ::= direct_name
*note 5.2:::
assignment_statement ::=
- variable_name := expression;
+ <variable_>name := expression;
*note 5.3:::
if_statement ::=
@@ -125979,7 +126420,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.4:::
case_statement ::=
- case selecting_expression is
+ case <selecting_>expression is
case_statement_alternative
{case_statement_alternative}
end case;
@@ -125991,10 +126432,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.5:::
loop_statement ::=
- [loop_statement_identifier:]
+ [<loop_>statement_identifier:]
[iteration_scheme] loop
sequence_of_statements
- end loop [loop_identifier];
+ end loop [<loop_>identifier];
*note 5.5:::
iteration_scheme ::= while condition
@@ -126007,25 +126448,25 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.5.2:::
iterator_specification ::=
- defining_identifier in [reverse] iterator_name
+ defining_identifier in [reverse] <iterator_>name
| defining_identifier [:
- subtype_indication] of [reverse] iterable_name
+ subtype_indication] of [reverse] <iterable_>name
*note 5.6:::
block_statement ::=
- [block_statement_identifier:]
+ [<block_>statement_identifier:]
[declare
declarative_part]
begin
handled_sequence_of_statements
- end [block_identifier];
+ end [<block_>identifier];
*note 5.7:::
exit_statement ::=
- exit [loop_name] [when condition];
+ exit [<loop_>name] [when condition];
*note 5.8:::
- goto_statement ::= goto label_name;
+ goto_statement ::= goto <label_>name;
*note 6.1:::
subprogram_declaration ::=
@@ -126097,13 +126538,13 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 6.4:::
procedure_call_statement ::=
- procedure_name;
- | procedure_prefix actual_parameter_part;
+ <procedure_>name;
+ | <procedure_>prefix actual_parameter_part;
*note 6.4:::
function_call ::=
- function_name
- | function_prefix actual_parameter_part
+ <function_>name
+ | <function_>prefix actual_parameter_part
*note 6.4:::
actual_parameter_part ::=
@@ -126111,10 +126552,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 6.4:::
parameter_association ::=
- [formal_parameter_selector_name =>] explicit_actual_parameter
+ [<formal_parameter_>selector_name =>] explicit_actual_parameter
*note 6.4:::
- explicit_actual_parameter ::= expression | variable_name
+ explicit_actual_parameter ::= expression | <variable_>name
*note 6.5:::
simple_return_statement ::= return [expression];
@@ -126181,7 +126622,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 7.3:::
private_extension_declaration ::=
type defining_identifier [discriminant_part] is
- [abstract] [limited | synchronized] new ancestor_
+ [abstract] [limited | synchronized] new <ancestor_>
subtype_indication
[and interface_list] with private
[aspect_specification];
@@ -126193,7 +126634,7 @@ This Annex summarizes the complete syntax of the
language. See *note
use_clause ::= use_package_clause | use_type_clause
*note 8.4:::
- use_package_clause ::= use package_name {, package_name};
+ use_package_clause ::= use <package_>name {, <package_>name};
*note 8.4:::
use_type_clause ::= use [all] type subtype_mark {, subtype_mark};
@@ -126209,37 +126650,37 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 8.5.1:::
object_renaming_declaration ::=
defining_identifier : [null_exclusion]
- subtype_mark renames object_name
+ subtype_mark renames <object_>name
[aspect_specification];
- | defining_identifier : access_definition renames object_name
+ | defining_identifier : access_definition renames <object_>name
[aspect_specification];
*note 8.5.2:::
exception_renaming_declaration ::=
- defining_identifier : exception renames exception_name
+ defining_identifier : exception renames <exception_>name
[aspect_specification];
*note 8.5.3:::
package_renaming_declaration ::= package
- defining_program_unit_name renames package_name
+ defining_program_unit_name renames <package_>name
[aspect_specification];
*note 8.5.4:::
subprogram_renaming_declaration ::=
[overriding_indicator]
- subprogram_specification renames callable_entity_name
+ subprogram_specification renames <callable_entity_>name
[aspect_specification];
*note 8.5.5:::
generic_renaming_declaration ::=
generic package
- defining_program_unit_name renames generic_package_name
+ defining_program_unit_name renames <generic_package_>name
[aspect_specification];
| generic procedure
- defining_program_unit_name renames generic_procedure_name
+ defining_program_unit_name renames <generic_procedure_>name
[aspect_specification];
| generic function
- defining_program_unit_name renames generic_function_name
+ defining_program_unit_name renames <generic_function_>name
[aspect_specification];
*note 9.1:::
@@ -126261,7 +126702,7 @@ This Annex summarizes the complete syntax of the
language. See *note
{task_item}
[ private
{task_item}]
- end [task_identifier]
+ end [<task_>identifier]
*note 9.1:::
task_item ::= entry_declaration | aspect_clause
@@ -126273,7 +126714,7 @@ This Annex summarizes the complete syntax of the
language. See *note
declarative_part
begin
handled_sequence_of_statements
- end [task_identifier];
+ end [<task_>identifier];
*note 9.4:::
protected_type_declaration ::=
@@ -126294,7 +126735,7 @@ This Annex summarizes the complete syntax of the
language. See *note
{ protected_operation_declaration }
[ private
{ protected_element_declaration } ]
- end [protected_identifier]
+ end [<protected_>identifier]
*note 9.4:::
protected_operation_declaration ::= subprogram_declaration
@@ -126310,7 +126751,7 @@ This Annex summarizes the complete syntax of the
language. See *note
protected body defining_identifier
[aspect_specification] is
{ protected_operation_item }
- end [protected_identifier];
+ end [<protected_>identifier];
*note 9.4:::
protected_operation_item ::= subprogram_declaration
@@ -126332,9 +126773,9 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 9.5.2:::
accept_statement ::=
- accept entry_direct_name [(entry_index)] parameter_profile [do
+ accept <entry_>direct_name [(entry_index)] parameter_profile [do
handled_sequence_of_statements
- end [entry_identifier]];
+ end [<entry_>identifier]];
*note 9.5.2:::
entry_index ::= expression
@@ -126346,7 +126787,7 @@ This Annex summarizes the complete syntax of the
language. See *note
declarative_part
begin
handled_sequence_of_statements
- end [entry_identifier];
+ end [<entry_>identifier];
*note 9.5.2:::
entry_body_formal_part ::= [(entry_index_specification)]
@@ -126360,20 +126801,21 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_subtype_definition
*note 9.5.3:::
- entry_call_statement ::= entry_name [actual_parameter_part];
+ entry_call_statement ::= <entry_>name [actual_parameter_part];
*note 9.5.4:::
- requeue_statement ::= requeue procedure_or_entry_name [with abort];
+ requeue_statement ::= requeue <procedure_or_entry_>
+ name [with abort];
*note 9.6:::
delay_statement ::= delay_until_statement |
delay_relative_statement
*note 9.6:::
- delay_until_statement ::= delay until delay_expression;
+ delay_until_statement ::= delay until <delay_>expression;
*note 9.6:::
- delay_relative_statement ::= delay delay_expression;
+ delay_relative_statement ::= delay <delay_>expression;
*note 9.7:::
select_statement ::=
@@ -126457,7 +126899,7 @@ This Annex summarizes the complete syntax of the
language. See *note
abortable_part ::= sequence_of_statements
*note 9.8:::
- abort_statement ::= abort task_name {, task_name};
+ abort_statement ::= abort <task_>name {, <task_>name};
*note 10.1.1:::
compilation ::= {compilation_unit}
@@ -126499,12 +126941,12 @@ This Annex summarizes the complete syntax of the
language. See *note
with_clause ::= limited_with_clause | nonlimited_with_clause
*note 10.1.2:::
- limited_with_clause ::= limited [private] with library_unit_
- name {, library_unit_name};
+ limited_with_clause ::= limited [private] with <library_unit_>
+ name {, <library_unit_>name};
*note 10.1.2:::
- nonlimited_with_clause ::= [private] with library_unit_
- name {, library_unit_name};
+ nonlimited_with_clause ::= [private] with <library_unit_>
+ name {, <library_unit_>name};
*note 10.1.3:::
body_stub ::= subprogram_body_stub | package_body_stub |
@@ -126555,14 +126997,14 @@ This Annex summarizes the complete syntax of the
language. See *note
choice_parameter_specification ::= defining_identifier
*note 11.2:::
- exception_choice ::= exception_name | others
+ exception_choice ::= <exception_>name | others
*note 11.3:::
raise_statement ::= raise;
- | raise exception_name [with string_expression];
+ | raise <exception_>name [with <string_>expression];
*note 11.3:::
- raise_expression ::= raise exception_name [with string_
+ raise_expression ::= raise <exception_>name [with <string_>
simple_expression]
*note 12.1:::
@@ -126592,15 +127034,15 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.3:::
generic_instantiation ::=
package defining_program_unit_name is
- new generic_package_name [generic_actual_part]
+ new <generic_package_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
procedure defining_program_unit_name is
- new generic_procedure_name [generic_actual_part]
+ new <generic_procedure_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
function defining_designator is
- new generic_function_name [generic_actual_part]
+ new <generic_function_>name [generic_actual_part]
[aspect_specification];
*note 12.3:::
@@ -126609,13 +127051,13 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.3:::
generic_association ::=
- [generic_formal_parameter_selector_name =>]
+ [<generic_formal_parameter_>selector_name =>]
explicit_generic_actual_parameter
*note 12.3:::
- explicit_generic_actual_parameter ::= expression | variable_name
- | subprogram_name | entry_name | subtype_mark
- | package_instance_name
+ explicit_generic_actual_parameter ::= expression | <variable_>name
+ | <subprogram_>name | <entry_>name | subtype_mark
+ | <package_instance_>name
*note 12.4:::
formal_object_declaration ::=
@@ -126713,8 +127155,8 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.7:::
formal_package_declaration ::=
- with package defining_identifier is new generic_package_name
- formal_package_actual_part
+ with package defining_identifier is new <generic_package_>
+ name formal_package_actual_part
[aspect_specification];
*note 12.7:::
@@ -126727,7 +127169,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.7:::
formal_package_association ::=
generic_association
- | generic_formal_parameter_selector_name => <>
+ | <generic_formal_parameter_>selector_name => <>
*note 13.1:::
aspect_clause ::= attribute_definition_clause
@@ -126738,7 +127180,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 13.1:::
local_name ::= direct_name
| direct_name'attribute_designator
- | library_unit_name
+ | <library_unit_>name
*note 13.1.1:::
aspect_specification ::=
@@ -126746,7 +127188,7 @@ This Annex summarizes the complete syntax of the
language. See *note
aspect_mark [=> aspect_definition] }
*note 13.1.1:::
- aspect_mark ::= aspect_identifier['Class]
+ aspect_mark ::= <aspect_>identifier['Class]
*note 13.1.1:::
aspect_definition ::= name | expression | identifier
@@ -126758,63 +127200,63 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 13.4:::
enumeration_representation_clause ::=
- for first_subtype_local_name use enumeration_aggregate;
+ for <first_subtype_>local_name use enumeration_aggregate;
*note 13.4:::
enumeration_aggregate ::= array_aggregate
*note 13.5.1:::
record_representation_clause ::=
- for first_subtype_local_name use
+ for <first_subtype_>local_name use
record [mod_clause]
{component_clause}
end record;
*note 13.5.1:::
component_clause ::=
- component_local_name at position range first_bit .. last_bit;
+ <component_>local_name at position range first_bit .. last_bit;
*note 13.5.1:::
- position ::= static_expression
+ position ::= <static_>expression
*note 13.5.1:::
- first_bit ::= static_simple_expression
+ first_bit ::= <static_>simple_expression
*note 13.5.1:::
- last_bit ::= static_simple_expression
+ last_bit ::= <static_>simple_expression
*note 13.8:::
code_statement ::= qualified_expression;
*note 13.11.3:::
- storage_pool_indicator ::= storage_pool_name | null | Standard
+ storage_pool_indicator ::= <storage_pool_>name | null | Standard
*note 13.12:::
- restriction ::= restriction_identifier
- | restriction_parameter_identifier =>
+ restriction ::= <restriction_>identifier
+ | <restriction_parameter_>identifier =>
restriction_parameter_argument
*note 13.12:::
restriction_parameter_argument ::= name | expression
*note J.3:::
- delta_constraint ::= delta static_simple_expression [
+ delta_constraint ::= delta <static_>simple_expression [
range_constraint]
*note J.7:::
at_clause ::= for direct_name use at expression;
*note J.8:::
- mod_clause ::= at mod static_expression;
+ mod_clause ::= at mod <static_>expression;
Syntax Cross Reference
1/3
-{AI05-0299-1AI05-0299-1} In the following syntax cross reference, each
+{<AI05-0299-1AI05-0299-1>} In the following syntax cross reference, each
syntactic category is followed by the subclause number where it is
-defined. In addition, each syntactic category S is followed by a list
-of the categories that use S in their definitions. For example, the
+defined. In addition, each syntactic category <S> is followed by a list
+of the categories that use <S> in their definitions. For example, the
first listing below shows that abort_statement appears in the definition
of simple_statement.
@@ -128211,7 +128653,7 @@ Annex Q Language-Defined Entities
*********************************
1/2
-{AI95-00440-01AI95-00440-01} This annex lists the language-defined
+{<AI95-00440-01AI95-00440-01>} This annex lists the language-defined
entities of the language. A list of language-defined library units can
be found in *note Annex A::, "*note Annex A:: Predefined Language
Environment".
@@ -128231,7 +128673,7 @@ Q.1 Language-Defined Packages
=============================
1/3
-{AI95-00440-01AI95-00440-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00440-01AI95-00440-01>} {<AI05-0299-1AI05-0299-1>} This subclause
lists all language-defined packages.
@@ -128239,485 +128681,485 @@ lists all language-defined packages.
Ada *note A.2(2): 5994.
Address_To_Access_Conversions
- child of System *note 13.7.2(2): 5645.
+ <child of> System *note 13.7.2(2): 5645.
Arithmetic
- child of Ada.Calendar *note 9.6.1(8/2): 4548.
+ <child of> Ada.Calendar *note 9.6.1(8/2): 4548.
ASCII
- in Standard *note A.1(36.3/2): 5981.
+ <in> Standard *note A.1(36.3/2): 5981.
Assertions
- child of Ada *note 11.4.2(12/2): 5034.
+ <child of> Ada *note 11.4.2(12/2): 5034.
Asynchronous_Task_Control
- child of Ada *note D.11(3/2): 8705.
+ <child of> Ada *note D.11(3/2): 8705.
Bounded
- child of Ada.Strings *note A.4.4(3): 6394.
+ <child of> Ada.Strings *note A.4.4(3): 6394.
Bounded_IO
- child of Ada.Text_IO *note A.10.11(3/2): 7128.
- child of Ada.Wide_Text_IO *note A.11(4/3): 7154.
- child of Ada.Wide_Wide_Text_IO *note A.11(4/3): 7155.
+ <child of> Ada.Text_IO *note A.10.11(3/2): 7128.
+ <child of> Ada.Wide_Text_IO *note A.11(4/3): 7154.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(4/3): 7155.
Bounded_Priority_Queues
- child of Ada.Containers *note A.18.31(2/3): 8025.
+ <child of> Ada.Containers *note A.18.31(2/3): 8025.
Bounded_Synchronized_Queues
- child of Ada.Containers *note A.18.29(2/3): 8010.
+ <child of> Ada.Containers *note A.18.29(2/3): 8010.
C
- child of Interfaces *note B.3(4): 8106.
+ <child of> Interfaces *note B.3(4): 8106.
Calendar
- child of Ada *note 9.6(10): 4517.
+ <child of> Ada *note 9.6(10): 4517.
Characters
- child of Ada *note A.3.1(2): 5997.
+ <child of> Ada *note A.3.1(2): 5997.
COBOL
- child of Interfaces *note B.4(7): 8229.
+ <child of> Interfaces *note B.4(7): 8229.
Command_Line
- child of Ada *note A.15(3): 7226.
+ <child of> Ada *note A.15(3): 7226.
Complex_Arrays
- child of Ada.Numerics *note G.3.2(53/2): 9183.
+ <child of> Ada.Numerics *note G.3.2(53/2): 9183.
Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(9/1): 9057.
+ <child of> Ada.Numerics *note G.1.2(9/1): 9057.
Complex_Text_IO
- child of Ada *note G.1.3(9.1/2): 9075.
+ <child of> Ada *note G.1.3(9.1/2): 9075.
Complex_Types
- child of Ada.Numerics *note G.1.1(25/1): 9029.
+ <child of> Ada.Numerics *note G.1.1(25/1): 9029.
Complex_IO
- child of Ada.Text_IO *note G.1.3(3): 9065.
- child of Ada.Wide_Text_IO *note G.1.4(1): 9078.
- child of Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 9080.
+ <child of> Ada.Text_IO *note G.1.3(3): 9065.
+ <child of> Ada.Wide_Text_IO *note G.1.4(1): 9078.
+ <child of> Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 9080.
Constants
- child of Ada.Strings.Maps *note A.4.6(3/2): 6511.
+ <child of> Ada.Strings.Maps *note A.4.6(3/2): 6511.
Containers
- child of Ada *note A.18.1(3/2): 7325.
+ <child of> Ada *note A.18.1(3/2): 7325.
Conversions
- child of Ada.Characters *note A.3.4(2/2): 6272.
- child of Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6641.
+ <child of> Ada.Characters *note A.3.4(2/2): 6272.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6641.
Decimal
- child of Ada *note F.2(2): 8971.
+ <child of> Ada *note F.2(2): 8971.
Decimal_Conversions
- in Interfaces.COBOL *note B.4(31): 8263.
+ <in> Interfaces.COBOL *note B.4(31): 8263.
Decimal_IO
- in Ada.Text_IO *note A.10.1(73): 7085.
+ <in> Ada.Text_IO *note A.10.1(73): 7085.
Decimal_Output
- in Ada.Text_IO.Editing *note F.3.3(11): 8994.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8994.
Direct_IO
- child of Ada *note A.8.4(2): 6903.
+ <child of> Ada *note A.8.4(2): 6903.
Directories
- child of Ada *note A.16(3/2): 7236.
+ <child of> Ada *note A.16(3/2): 7236.
Discrete_Random
- child of Ada.Numerics *note A.5.2(17): 6729.
+ <child of> Ada.Numerics *note A.5.2(17): 6729.
Dispatching
- child of Ada *note D.2.1(1.2/3): 8466.
+ <child of> Ada *note D.2.1(1.2/3): 8466.
Dispatching_Domains
- child of System.Multiprocessors *note D.16.1(3/3): 8805.
+ <child of> System.Multiprocessors *note D.16.1(3/3): 8805.
Doubly_Linked_Lists
- child of Ada.Containers *note A.18.3(5/3): 7437.
+ <child of> Ada.Containers *note A.18.3(5/3): 7437.
Dynamic_Priorities
- child of Ada *note D.5.1(3/2): 8571.
+ <child of> Ada *note D.5.1(3/2): 8571.
EDF
- child of Ada.Dispatching *note D.2.6(9/2): 8523.
- child of Ada.Synchronous_Task_Control *note D.10(5.2/3): 8693.
+ <child of> Ada.Dispatching *note D.2.6(9/2): 8523.
+ <child of> Ada.Synchronous_Task_Control *note D.10(5.2/3): 8693.
Editing
- child of Ada.Text_IO *note F.3.3(3): 8982.
- child of Ada.Wide_Text_IO *note F.3.4(1): 9002.
- child of Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 9004.
+ <child of> Ada.Text_IO *note F.3.3(3): 8982.
+ <child of> Ada.Wide_Text_IO *note F.3.4(1): 9002.
+ <child of> Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 9004.
Elementary_Functions
- child of Ada.Numerics *note A.5.1(9/1): 6708.
+ <child of> Ada.Numerics *note A.5.1(9/1): 6708.
Enumeration_IO
- in Ada.Text_IO *note A.10.1(79): 7095.
+ <in> Ada.Text_IO *note A.10.1(79): 7095.
Environment_Variables
- child of Ada *note A.17(3/2): 7304.
+ <child of> Ada *note A.17(3/2): 7304.
Exceptions
- child of Ada *note 11.4.1(2/2): 4990.
+ <child of> Ada *note 11.4.1(2/2): 4990.
Execution_Time
- child of Ada *note D.14(3/2): 8719.
+ <child of> Ada *note D.14(3/2): 8719.
Finalization
- child of Ada *note 7.6(4/3): 3974.
+ <child of> Ada *note 7.6(4/3): 3974.
Fixed
- child of Ada.Strings *note A.4.3(5): 6356.
+ <child of> Ada.Strings *note A.4.3(5): 6356.
Fixed_IO
- in Ada.Text_IO *note A.10.1(68): 7075.
+ <in> Ada.Text_IO *note A.10.1(68): 7075.
Float_Random
- child of Ada.Numerics *note A.5.2(5): 6716.
+ <child of> Ada.Numerics *note A.5.2(5): 6716.
Float_Text_IO
- child of Ada *note A.10.9(33): 7127.
+ <child of> Ada *note A.10.9(33): 7127.
Float_Wide_Text_IO
- child of Ada *note A.11(2/2): 7150.
+ <child of> Ada *note A.11(2/2): 7150.
Float_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7153.
+ <child of> Ada *note A.11(3/2): 7153.
Float_IO
- in Ada.Text_IO *note A.10.1(63): 7065.
+ <in> Ada.Text_IO *note A.10.1(63): 7065.
Formatting
- child of Ada.Calendar *note 9.6.1(15/2): 4552.
+ <child of> Ada.Calendar *note 9.6.1(15/2): 4552.
Fortran
- child of Interfaces *note B.5(4): 8283.
+ <child of> Interfaces *note B.5(4): 8283.
Generic_Complex_Arrays
- child of Ada.Numerics *note G.3.2(2/2): 9147.
+ <child of> Ada.Numerics *note G.3.2(2/2): 9147.
Generic_Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(2/2): 9036.
+ <child of> Ada.Numerics *note G.1.2(2/2): 9036.
Generic_Complex_Types
- child of Ada.Numerics *note G.1.1(2/1): 9008.
+ <child of> Ada.Numerics *note G.1.1(2/1): 9008.
Generic_Dispatching_Constructor
- child of Ada.Tags *note 3.9(18.2/3): 2272.
+ <child of> Ada.Tags *note 3.9(18.2/3): 2272.
Generic_Elementary_Functions
- child of Ada.Numerics *note A.5.1(3): 6679.
+ <child of> Ada.Numerics *note A.5.1(3): 6679.
Generic_Bounded_Length
- in Ada.Strings.Bounded *note A.4.4(4): 6395.
+ <in> Ada.Strings.Bounded *note A.4.4(4): 6395.
Generic_Keys
- in Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7714.
- in Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7795.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7714.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7795.
Generic_Real_Arrays
- child of Ada.Numerics *note G.3.1(2/2): 9130.
+ <child of> Ada.Numerics *note G.3.1(2/2): 9130.
Generic_Sorting
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 7484.
- in Ada.Containers.Vectors *note A.18.2(75/2): 7409.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 7484.
+ <in> Ada.Containers.Vectors *note A.18.2(75/2): 7409.
Group_Budgets
- child of Ada.Execution_Time *note D.14.2(3/3): 8753.
+ <child of> Ada.Execution_Time *note D.14.2(3/3): 8753.
Handling
- child of Ada.Characters *note A.3.2(2/2): 6001.
- child of Ada.Wide_Characters *note A.3.5(3/3): 6292.
- child of Ada.Wide_Wide_Characters *note A.3.6(1/3): 6314.
+ <child of> Ada.Characters *note A.3.2(2/2): 6001.
+ <child of> Ada.Wide_Characters *note A.3.5(3/3): 6292.
+ <child of> Ada.Wide_Wide_Characters *note A.3.6(1/3): 6314.
Hashed_Maps
- child of Ada.Containers *note A.18.5(2/3): 7528.
+ <child of> Ada.Containers *note A.18.5(2/3): 7528.
Hashed_Sets
- child of Ada.Containers *note A.18.8(2/3): 7667.
+ <child of> Ada.Containers *note A.18.8(2/3): 7667.
Hierarchical_File_Names
- child of Ada.Directories *note A.16.1(3/3): 7290.
+ <child of> Ada.Directories *note A.16.1(3/3): 7290.
Indefinite_Doubly_Linked_Lists
- child of Ada.Containers *note A.18.12(2/3): 7913.
+ <child of> Ada.Containers *note A.18.12(2/3): 7913.
Indefinite_Hashed_Maps
- child of Ada.Containers *note A.18.13(2/3): 7916.
+ <child of> Ada.Containers *note A.18.13(2/3): 7916.
Indefinite_Hashed_Sets
- child of Ada.Containers *note A.18.15(2/3): 7922.
+ <child of> Ada.Containers *note A.18.15(2/3): 7922.
Indefinite_Holders
- child of Ada.Containers *note A.18.18(5/3): 7932.
+ <child of> Ada.Containers *note A.18.18(5/3): 7932.
Indefinite_Multiway_Trees
- child of Ada.Containers *note A.18.17(2/3): 7928.
+ <child of> Ada.Containers *note A.18.17(2/3): 7928.
Indefinite_Ordered_Maps
- child of Ada.Containers *note A.18.14(2/3): 7919.
+ <child of> Ada.Containers *note A.18.14(2/3): 7919.
Indefinite_Ordered_Sets
- child of Ada.Containers *note A.18.16(2/3): 7925.
+ <child of> Ada.Containers *note A.18.16(2/3): 7925.
Indefinite_Vectors
- child of Ada.Containers *note A.18.11(2/3): 7910.
+ <child of> Ada.Containers *note A.18.11(2/3): 7910.
Information
- child of Ada.Directories *note A.16(124/2): 7286.
+ <child of> Ada.Directories *note A.16(124/2): 7286.
Integer_Text_IO
- child of Ada *note A.10.8(21): 7125.
+ <child of> Ada *note A.10.8(21): 7125.
Integer_Wide_Text_IO
- child of Ada *note A.11(2/2): 7149.
+ <child of> Ada *note A.11(2/2): 7149.
Integer_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7152.
+ <child of> Ada *note A.11(3/2): 7152.
Integer_IO
- in Ada.Text_IO *note A.10.1(52): 7047.
+ <in> Ada.Text_IO *note A.10.1(52): 7047.
Interfaces *note B.2(3): 8091.
Interrupts
- child of Ada *note C.3.2(2/3): 8347.
- child of Ada.Execution_Time *note D.14.3(3/3): 8780.
+ <child of> Ada *note C.3.2(2/3): 8347.
+ <child of> Ada.Execution_Time *note D.14.3(3/3): 8780.
IO_Exceptions
- child of Ada *note A.13(3): 7213.
+ <child of> Ada *note A.13(3): 7213.
Iterator_Interfaces
- child of Ada *note 5.5.1(2/3): 3464.
+ <child of> Ada *note 5.5.1(2/3): 3464.
Latin_1
- child of Ada.Characters *note A.3.3(3): 6041.
+ <child of> Ada.Characters *note A.3.3(3): 6041.
List_Iterator_Interfaces
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 7443.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 7443.
Locales
- child of Ada *note A.19(3/3): 8034.
+ <child of> Ada *note A.19(3/3): 8034.
Machine_Code
- child of System *note 13.8(7): 5654.
+ <child of> System *note 13.8(7): 5654.
Map_Iterator_Interfaces
- in Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 7534.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 7590.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 7534.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 7590.
Maps
- child of Ada.Strings *note A.4.2(3/2): 6331.
+ <child of> Ada.Strings *note A.4.2(3/2): 6331.
Modular_IO
- in Ada.Text_IO *note A.10.1(57): 7056.
+ <in> Ada.Text_IO *note A.10.1(57): 7056.
Multiprocessors
- child of System *note D.16(3/3): 8797.
+ <child of> System *note D.16(3/3): 8797.
Multiway_Trees
- child of Ada.Containers *note A.18.10(7/3): 7834.
+ <child of> Ada.Containers *note A.18.10(7/3): 7834.
Names
- child of Ada.Interrupts *note C.3.2(12): 8358.
+ <child of> Ada.Interrupts *note C.3.2(12): 8358.
Non_Preemptive
- child of Ada.Dispatching *note D.2.4(2.2/3): 8505.
+ <child of> Ada.Dispatching *note D.2.4(2.2/3): 8505.
Numerics
- child of Ada *note A.5(3/2): 6673.
+ <child of> Ada *note A.5(3/2): 6673.
Ordered_Maps
- child of Ada.Containers *note A.18.6(2/3): 7583.
+ <child of> Ada.Containers *note A.18.6(2/3): 7583.
Ordered_Sets
- child of Ada.Containers *note A.18.9(2/3): 7742.
+ <child of> Ada.Containers *note A.18.9(2/3): 7742.
Pointers
- child of Interfaces.C *note B.3.2(4): 8199.
+ <child of> Interfaces.C *note B.3.2(4): 8199.
Real_Arrays
- child of Ada.Numerics *note G.3.1(31/2): 9142.
+ <child of> Ada.Numerics *note G.3.1(31/2): 9142.
Real_Time
- child of Ada *note D.8(3): 8654.
+ <child of> Ada *note D.8(3): 8654.
Round_Robin
- child of Ada.Dispatching *note D.2.5(4/2): 8514.
+ <child of> Ada.Dispatching *note D.2.5(4/2): 8514.
RPC
- child of System *note E.5(3): 8950.
+ <child of> System *note E.5(3): 8950.
Sequential_IO
- child of Ada *note A.8.1(2): 6875.
+ <child of> Ada *note A.8.1(2): 6875.
Set_Iterator_Interfaces
- in Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7673.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7749.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7673.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7749.
Single_Precision_Complex_Types
- in Interfaces.Fortran *note B.5(8): 8288.
+ <in> Interfaces.Fortran *note B.5(8): 8288.
Standard *note A.1(4): 5972.
Storage_Elements
- child of System *note 13.7.1(2/2): 5632.
+ <child of> System *note 13.7.1(2/2): 5632.
Storage_IO
- child of Ada *note A.9(3): 6937.
+ <child of> Ada *note A.9(3): 6937.
Storage_Pools
- child of System *note 13.11(5): 5695.
+ <child of> System *note 13.11(5): 5695.
Stream_IO
- child of Ada.Streams *note A.12.1(3/3): 7163.
+ <child of> Ada.Streams *note A.12.1(3/3): 7163.
Streams
- child of Ada *note 13.13.1(2): 5858.
+ <child of> Ada *note 13.13.1(2): 5858.
Strings
- child of Ada *note A.4.1(3): 6317.
- child of Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6647.
- child of Interfaces.C *note B.3.1(3): 8175.
+ <child of> Ada *note A.4.1(3): 6317.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6647.
+ <child of> Interfaces.C *note B.3.1(3): 8175.
Subpools
- child of System.Storage_Pools *note 13.11.4(3/3): 5774.
+ <child of> System.Storage_Pools *note 13.11.4(3/3): 5774.
Synchronized_Queue_Interfaces
- child of Ada.Containers *note A.18.27(3/3): 7995.
+ <child of> Ada.Containers *note A.18.27(3/3): 7995.
Synchronous_Barriers
- child of Ada *note D.10.1(3/3): 8700.
+ <child of> Ada *note D.10.1(3/3): 8700.
Synchronous_Task_Control
- child of Ada *note D.10(3/2): 8687.
+ <child of> Ada *note D.10(3/2): 8687.
System *note 13.7(3/2): 5603.
Tags
- child of Ada *note 3.9(6/2): 2247.
+ <child of> Ada *note 3.9(6/2): 2247.
Task_Attributes
- child of Ada *note C.7.2(2): 8421.
+ <child of> Ada *note C.7.2(2): 8421.
Task_Identification
- child of Ada *note C.7.1(2/2): 8400.
+ <child of> Ada *note C.7.1(2/2): 8400.
Task_Termination
- child of Ada *note C.7.3(2/2): 8433.
+ <child of> Ada *note C.7.3(2/2): 8433.
Text_Streams
- child of Ada.Text_IO *note A.12.2(3): 7203.
- child of Ada.Wide_Text_IO *note A.12.3(3): 7206.
- child of Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 7209.
+ <child of> Ada.Text_IO *note A.12.2(3): 7203.
+ <child of> Ada.Wide_Text_IO *note A.12.3(3): 7206.
+ <child of> Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 7209.
Text_IO
- child of Ada *note A.10.1(2): 6958.
+ <child of> Ada *note A.10.1(2): 6958.
Time_Zones
- child of Ada.Calendar *note 9.6.1(2/2): 4544.
+ <child of> Ada.Calendar *note 9.6.1(2/2): 4544.
Timers
- child of Ada.Execution_Time *note D.14.1(3/2): 8737.
+ <child of> Ada.Execution_Time *note D.14.1(3/2): 8737.
Timing_Events
- child of Ada.Real_Time *note D.15(3/2): 8784.
+ <child of> Ada.Real_Time *note D.15(3/2): 8784.
Tree_Iterator_Interfaces
- in Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7840.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7840.
Unbounded
- child of Ada.Strings *note A.4.5(3): 6456.
+ <child of> Ada.Strings *note A.4.5(3): 6456.
Unbounded_IO
- child of Ada.Text_IO *note A.10.12(3/2): 7138.
- child of Ada.Wide_Text_IO *note A.11(5/3): 7156.
- child of Ada.Wide_Wide_Text_IO *note A.11(5/3): 7157.
+ <child of> Ada.Text_IO *note A.10.12(3/2): 7138.
+ <child of> Ada.Wide_Text_IO *note A.11(5/3): 7156.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(5/3): 7157.
Unbounded_Priority_Queues
- child of Ada.Containers *note A.18.30(2/3): 8017.
+ <child of> Ada.Containers *note A.18.30(2/3): 8017.
Unbounded_Synchronized_Queues
- child of Ada.Containers *note A.18.28(2/3): 8003.
+ <child of> Ada.Containers *note A.18.28(2/3): 8003.
UTF_Encoding
- child of Ada.Strings *note A.4.11(3/3): 6630.
+ <child of> Ada.Strings *note A.4.11(3/3): 6630.
Vector_Iterator_Interfaces
- in Ada.Containers.Vectors *note A.18.2(11.2/3): 7344.
+ <in> Ada.Containers.Vectors *note A.18.2(11.2/3): 7344.
Vectors
- child of Ada.Containers *note A.18.2(6/3): 7336.
+ <child of> Ada.Containers *note A.18.2(6/3): 7336.
Wide_Bounded
- child of Ada.Strings *note A.4.7(1/3): 6528.
+ <child of> Ada.Strings *note A.4.7(1/3): 6528.
Wide_Constants
- child of Ada.Strings.Wide_Maps *note A.4.7(1/3): 6542, *note
+ <child of> Ada.Strings.Wide_Maps *note A.4.7(1/3): 6542, *note
A.4.8(28/2): 6606.
Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 6534.
+ <child of> Ada.Strings *note A.4.7(1/3): 6534.
Wide_Fixed
- child of Ada.Strings *note A.4.7(1/3): 6527.
+ <child of> Ada.Strings *note A.4.7(1/3): 6527.
Wide_Hash
- child of Ada.Strings *note A.4.7(1/3): 6530.
+ <child of> Ada.Strings *note A.4.7(1/3): 6530.
Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 6538.
+ <child of> Ada.Strings *note A.4.7(1/3): 6538.
Wide_Maps
- child of Ada.Strings *note A.4.7(3): 6543.
+ <child of> Ada.Strings *note A.4.7(3): 6543.
Wide_Text_IO
- child of Ada *note A.11(2/2): 7148.
+ <child of> Ada *note A.11(2/2): 7148.
Wide_Unbounded
- child of Ada.Strings *note A.4.7(1/3): 6529.
+ <child of> Ada.Strings *note A.4.7(1/3): 6529.
Wide_Characters
- child of Ada *note A.3.1(4/2): 5998.
+ <child of> Ada *note A.3.1(4/2): 5998.
Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6654.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6654.
Wide_Wide_Constants
- child of Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6584.
+ <child of> Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6584.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6576.
+ <child of> Ada.Strings *note A.4.8(1/3): 6576.
Wide_Wide_Hash
- child of Ada.Strings *note A.4.8(1/3): 6572.
+ <child of> Ada.Strings *note A.4.8(1/3): 6572.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6580.
+ <child of> Ada.Strings *note A.4.8(1/3): 6580.
Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7151.
+ <child of> Ada *note A.11(3/2): 7151.
Wide_Wide_Bounded
- child of Ada.Strings *note A.4.8(1/3): 6570.
+ <child of> Ada.Strings *note A.4.8(1/3): 6570.
Wide_Wide_Characters
- child of Ada *note A.3.1(6/2): 5999.
+ <child of> Ada *note A.3.1(6/2): 5999.
Wide_Wide_Fixed
- child of Ada.Strings *note A.4.8(1/3): 6569.
+ <child of> Ada.Strings *note A.4.8(1/3): 6569.
Wide_Wide_Maps
- child of Ada.Strings *note A.4.8(3/2): 6585.
+ <child of> Ada.Strings *note A.4.8(3/2): 6585.
Wide_Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6661.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6661.
Wide_Wide_Unbounded
- child of Ada.Strings *note A.4.8(1/3): 6571.
+ <child of> Ada.Strings *note A.4.8(1/3): 6571.
File: aarm2012.info, Node: Q.2, Next: Q.3, Prev: Q.1, Up: Annex Q
@@ -128726,657 +129168,658 @@ Q.2 Language-Defined Types and Subtypes
=======================================
1/3
-{AI95-00440-01AI95-00440-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00440-01AI95-00440-01>} {<AI05-0299-1AI05-0299-1>} This subclause
lists all language-defined types and subtypes.
Address
- in System *note 13.7(12): 5615.
+ <in> System *note 13.7(12): 5615.
Alignment
- in Ada.Strings *note A.4.1(6): 6325.
+ <in> Ada.Strings *note A.4.1(6): 6325.
Alphanumeric
- in Interfaces.COBOL *note B.4(16/3): 8241.
+ <in> Interfaces.COBOL *note B.4(16/3): 8241.
-Any_Priority subtype of Integer
- in System *note 13.7(16): 5625.
+Any_Priority <subtype of> Integer
+ <in> System *note 13.7(16): 5625.
Attribute_Handle
- in Ada.Task_Attributes *note C.7.2(3): 8422.
+ <in> Ada.Task_Attributes *note C.7.2(3): 8422.
-Barrier_Limit subtype of Positive
- in Ada.Synchronous_Barriers *note D.10.1(4/3): 8701.
+Barrier_Limit <subtype of> Positive
+ <in> Ada.Synchronous_Barriers *note D.10.1(4/3): 8701.
Binary
- in Interfaces.COBOL *note B.4(10): 8232.
+ <in> Interfaces.COBOL *note B.4(10): 8232.
Binary_Format
- in Interfaces.COBOL *note B.4(24): 8253.
+ <in> Interfaces.COBOL *note B.4(24): 8253.
Bit_Order
- in System *note 13.7(15/2): 5621.
+ <in> System *note 13.7(15/2): 5621.
Boolean
- in Standard *note A.1(5): 5973.
+ <in> Standard *note A.1(5): 5973.
Bounded_String
- in Ada.Strings.Bounded *note A.4.4(6): 6397.
+ <in> Ada.Strings.Bounded *note A.4.4(6): 6397.
-Buffer_Type subtype of Storage_Array
- in Ada.Storage_IO *note A.9(4): 6939.
+Buffer_Type <subtype of> Storage_Array
+ <in> Ada.Storage_IO *note A.9(4): 6939.
Byte
- in Interfaces.COBOL *note B.4(29/3): 8260.
+ <in> Interfaces.COBOL *note B.4(29/3): 8260.
Byte_Array
- in Interfaces.COBOL *note B.4(29/3): 8261.
+ <in> Interfaces.COBOL *note B.4(29/3): 8261.
C_float
- in Interfaces.C *note B.3(15): 8122.
+ <in> Interfaces.C *note B.3(15): 8122.
Cause_Of_Termination
- in Ada.Task_Termination *note C.7.3(3/2): 8434.
+ <in> Ada.Task_Termination *note C.7.3(3/2): 8434.
char
- in Interfaces.C *note B.3(19): 8125.
+ <in> Interfaces.C *note B.3(19): 8125.
char16_array
- in Interfaces.C *note B.3(39.5/3): 8149.
+ <in> Interfaces.C *note B.3(39.5/3): 8149.
char16_t
- in Interfaces.C *note B.3(39.2/2): 8145.
+ <in> Interfaces.C *note B.3(39.2/2): 8145.
char32_array
- in Interfaces.C *note B.3(39.14/3): 8159.
+ <in> Interfaces.C *note B.3(39.14/3): 8159.
char32_t
- in Interfaces.C *note B.3(39.11/2): 8155.
+ <in> Interfaces.C *note B.3(39.11/2): 8155.
char_array
- in Interfaces.C *note B.3(23/3): 8129.
+ <in> Interfaces.C *note B.3(23/3): 8129.
char_array_access
- in Interfaces.C.Strings *note B.3.1(4): 8176.
+ <in> Interfaces.C.Strings *note B.3.1(4): 8176.
Character
- in Standard *note A.1(35/3): 5978.
+ <in> Standard *note A.1(35/3): 5978.
Character_Mapping
- in Ada.Strings.Maps *note A.4.2(20/2): 6345.
+ <in> Ada.Strings.Maps *note A.4.2(20/2): 6345.
Character_Mapping_Function
- in Ada.Strings.Maps *note A.4.2(25): 6351.
+ <in> Ada.Strings.Maps *note A.4.2(25): 6351.
Character_Range
- in Ada.Strings.Maps *note A.4.2(6): 6334.
+ <in> Ada.Strings.Maps *note A.4.2(6): 6334.
Character_Ranges
- in Ada.Strings.Maps *note A.4.2(7): 6335.
+ <in> Ada.Strings.Maps *note A.4.2(7): 6335.
-Character_Sequence subtype of String
- in Ada.Strings.Maps *note A.4.2(16): 6341.
+Character_Sequence <subtype of> String
+ <in> Ada.Strings.Maps *note A.4.2(16): 6341.
Character_Set
- in Ada.Strings.Maps *note A.4.2(4/2): 6332.
- in Interfaces.Fortran *note B.5(11): 8293.
+ <in> Ada.Strings.Maps *note A.4.2(4/2): 6332.
+ <in> Interfaces.Fortran *note B.5(11): 8293.
chars_ptr
- in Interfaces.C.Strings *note B.3.1(5/2): 8177.
+ <in> Interfaces.C.Strings *note B.3.1(5/2): 8177.
chars_ptr_array
- in Interfaces.C.Strings *note B.3.1(6/2): 8178.
+ <in> Interfaces.C.Strings *note B.3.1(6/2): 8178.
COBOL_Character
- in Interfaces.COBOL *note B.4(13): 8238.
+ <in> Interfaces.COBOL *note B.4(13): 8238.
Complex
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 9009.
- in Interfaces.Fortran *note B.5(9): 8289.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 9009.
+ <in> Interfaces.Fortran *note B.5(9): 8289.
Complex_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9149.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9149.
Complex_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9148.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9148.
Constant_Reference_Type
- in Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7942.
- in Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7854.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7942.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7854.
Controlled
- in Ada.Finalization *note 7.6(5/2): 3975.
+ <in> Ada.Finalization *note 7.6(5/2): 3975.
Count
- in Ada.Direct_IO *note A.8.4(4): 6906.
- in Ada.Streams.Stream_IO *note A.12.1(7): 7167.
- in Ada.Text_IO *note A.10.1(5): 6961.
+ <in> Ada.Direct_IO *note A.8.4(4): 6906.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 7167.
+ <in> Ada.Text_IO *note A.10.1(5): 6961.
Count_Type
- in Ada.Containers *note A.18.1(5/2): 7327.
+ <in> Ada.Containers *note A.18.1(5/2): 7327.
Country_Code
- in Ada.Locales *note A.19(4/4): 8036.
+ <in> Ada.Locales *note A.19(4/4): 8036.
-CPU subtype of CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8800.
+CPU <subtype of> CPU_Range
+ <in> System.Multiprocessors *note D.16(4/3): 8800.
CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8798.
+ <in> System.Multiprocessors *note D.16(4/3): 8798.
CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.1/4):
-8812.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.1/4): 8812.
CPU_Time
- in Ada.Execution_Time *note D.14(4/2): 8720.
+ <in> Ada.Execution_Time *note D.14(4/2): 8720.
Cursor
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 7439.
- in Ada.Containers.Hashed_Maps *note A.18.5(4/2): 7530.
- in Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7669.
- in Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7836.
- in Ada.Containers.Ordered_Maps *note A.18.6(5/2): 7586.
- in Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7745.
- in Ada.Containers.Vectors *note A.18.2(9/2): 7340.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 7439.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(4/2): 7530.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7669.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7836.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(5/2): 7586.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7745.
+ <in> Ada.Containers.Vectors *note A.18.2(9/2): 7340.
Day_Count
- in Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4549.
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4549.
-Day_Duration subtype of Duration
- in Ada.Calendar *note 9.6(11/2): 4522.
+Day_Duration <subtype of> Duration
+ <in> Ada.Calendar *note 9.6(11/2): 4522.
Day_Name
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4553.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4553.
-Day_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4521.
+Day_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4521.
-Deadline subtype of Time
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8524.
+Deadline <subtype of> Time
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8524.
Decimal_Element
- in Interfaces.COBOL *note B.4(12/3): 8236.
+ <in> Interfaces.COBOL *note B.4(12/3): 8236.
Direction
- in Ada.Strings *note A.4.1(6): 6328.
+ <in> Ada.Strings *note A.4.1(6): 6328.
Directory_Entry_Type
- in Ada.Directories *note A.16(29/2): 7260.
+ <in> Ada.Directories *note A.16(29/2): 7260.
Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
8807.
Display_Format
- in Interfaces.COBOL *note B.4(22): 8247.
+ <in> Interfaces.COBOL *note B.4(22): 8247.
double
- in Interfaces.C *note B.3(16): 8123.
+ <in> Interfaces.C *note B.3(16): 8123.
Double_Precision
- in Interfaces.Fortran *note B.5(6): 8286.
+ <in> Interfaces.Fortran *note B.5(6): 8286.
Duration
- in Standard *note A.1(43): 5986.
+ <in> Standard *note A.1(43): 5986.
Encoding_Scheme
- in Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6631.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6631.
Exception_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4991.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4991.
Exception_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4996.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4996.
Exception_Occurrence_Access
- in Ada.Exceptions *note 11.4.1(3/2): 4997.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4997.
Exit_Status
- in Ada.Command_Line *note A.15(7): 7230.
+ <in> Ada.Command_Line *note A.15(7): 7230.
-Extended_Index subtype of Index_Type'Base
- in Ada.Containers.Vectors *note A.18.2(7/2): 7337.
+Extended_Index <subtype of> Index_Type'Base
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 7337.
-Field subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6964.
+Field <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6964.
File_Access
- in Ada.Text_IO *note A.10.1(18): 6986.
+ <in> Ada.Text_IO *note A.10.1(18): 6986.
File_Kind
- in Ada.Directories *note A.16(22/2): 7254.
+ <in> Ada.Directories *note A.16(22/2): 7254.
File_Mode
- in Ada.Direct_IO *note A.8.4(4): 6905.
- in Ada.Sequential_IO *note A.8.1(4): 6877.
- in Ada.Streams.Stream_IO *note A.12.1(6): 7166.
- in Ada.Text_IO *note A.10.1(4): 6960.
+ <in> Ada.Direct_IO *note A.8.4(4): 6905.
+ <in> Ada.Sequential_IO *note A.8.1(4): 6877.
+ <in> Ada.Streams.Stream_IO *note A.12.1(6): 7166.
+ <in> Ada.Text_IO *note A.10.1(4): 6960.
File_Size
- in Ada.Directories *note A.16(23/2): 7255.
+ <in> Ada.Directories *note A.16(23/2): 7255.
File_Type
- in Ada.Direct_IO *note A.8.4(3): 6904.
- in Ada.Sequential_IO *note A.8.1(3): 6876.
- in Ada.Streams.Stream_IO *note A.12.1(5/4): 7165.
- in Ada.Text_IO *note A.10.1(3): 6959.
+ <in> Ada.Direct_IO *note A.8.4(3): 6904.
+ <in> Ada.Sequential_IO *note A.8.1(3): 6876.
+ <in> Ada.Streams.Stream_IO *note A.12.1(5/4): 7165.
+ <in> Ada.Text_IO *note A.10.1(3): 6959.
Filter_Type
- in Ada.Directories *note A.16(30/2): 7261.
+ <in> Ada.Directories *note A.16(30/2): 7261.
Float
- in Standard *note A.1(21): 5977.
+ <in> Standard *note A.1(21): 5977.
Floating
- in Interfaces.COBOL *note B.4(9): 8230.
+ <in> Interfaces.COBOL *note B.4(9): 8230.
Fortran_Character
- in Interfaces.Fortran *note B.5(12/3): 8294.
+ <in> Interfaces.Fortran *note B.5(12/3): 8294.
Fortran_Integer
- in Interfaces.Fortran *note B.5(5): 8284.
+ <in> Interfaces.Fortran *note B.5(5): 8284.
Forward_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3465.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3465.
Generator
- in Ada.Numerics.Discrete_Random *note A.5.2(19): 6730.
- in Ada.Numerics.Float_Random *note A.5.2(7): 6717.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(19): 6730.
+ <in> Ada.Numerics.Float_Random *note A.5.2(7): 6717.
Group_Budget
- in Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8754.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8754.
Group_Budget_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8755.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8755.
Hash_Type
- in Ada.Containers *note A.18.1(4/2): 7326.
+ <in> Ada.Containers *note A.18.1(4/2): 7326.
Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7933.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7933.
-Hour_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4562.
+Hour_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4562.
Imaginary
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 9010.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 9010.
-Imaginary subtype of Imaginary
- in Interfaces.Fortran *note B.5(10): 8290.
+Imaginary <subtype of> Imaginary
+ <in> Interfaces.Fortran *note B.5(10): 8290.
int
- in Interfaces.C *note B.3(7): 8111.
+ <in> Interfaces.C *note B.3(7): 8111.
Integer
- in Standard *note A.1(12): 5974.
+ <in> Standard *note A.1(12): 5974.
Integer_Address
- in System.Storage_Elements *note 13.7.1(10/3): 5638.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5638.
Interrupt_Id
- in Ada.Interrupts *note C.3.2(2/3): 8348.
+ <in> Ada.Interrupts *note C.3.2(2/3): 8348.
-Interrupt_Priority subtype of Any_Priority
- in System *note 13.7(16): 5627.
+Interrupt_Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5627.
-ISO_646 subtype of Character
- in Ada.Characters.Handling *note A.3.2(9): 6024.
+ISO_646 <subtype of> Character
+ <in> Ada.Characters.Handling *note A.3.2(9): 6024.
Language_Code
- in Ada.Locales *note A.19(4/4): 8035.
+ <in> Ada.Locales *note A.19(4/4): 8035.
-Leap_Seconds_Count subtype of Integer
- in Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4550.
+Leap_Seconds_Count <subtype of> Integer
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4550.
-Length_Range subtype of Natural
- in Ada.Strings.Bounded *note A.4.4(8): 6399.
+Length_Range <subtype of> Natural
+ <in> Ada.Strings.Bounded *note A.4.4(8): 6399.
Limited_Controlled
- in Ada.Finalization *note 7.6(7/2): 3979.
+ <in> Ada.Finalization *note 7.6(7/2): 3979.
List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 7438.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 7438.
Logical
- in Interfaces.Fortran *note B.5(7): 8287.
+ <in> Interfaces.Fortran *note B.5(7): 8287.
long
- in Interfaces.C *note B.3(7): 8113.
+ <in> Interfaces.C *note B.3(7): 8113.
Long_Binary
- in Interfaces.COBOL *note B.4(10): 8233.
+ <in> Interfaces.COBOL *note B.4(10): 8233.
long_double
- in Interfaces.C *note B.3(17): 8124.
+ <in> Interfaces.C *note B.3(17): 8124.
Long_Floating
- in Interfaces.COBOL *note B.4(9): 8231.
+ <in> Interfaces.COBOL *note B.4(9): 8231.
Map
- in Ada.Containers.Hashed_Maps *note A.18.5(3/3): 7529.
- in Ada.Containers.Ordered_Maps *note A.18.6(4/3): 7585.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(3/3): 7529.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(4/3): 7585.
Membership
- in Ada.Strings *note A.4.1(6): 6327.
+ <in> Ada.Strings *note A.4.1(6): 6327.
-Minute_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4563.
+Minute_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4563.
-Month_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4520.
+Month_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4520.
Name
- in System *note 13.7(4): 5604.
+ <in> System *note 13.7(4): 5604.
Name_Case_Kind
- in Ada.Directories *note A.16(20.1/3): 7252.
+ <in> Ada.Directories *note A.16(20.1/3): 7252.
-Natural subtype of Integer
- in Standard *note A.1(13): 5975.
+Natural <subtype of> Integer
+ <in> Standard *note A.1(13): 5975.
-Number_Base subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6965.
+Number_Base <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6965.
Numeric
- in Interfaces.COBOL *note B.4(20/3): 8246.
+ <in> Interfaces.COBOL *note B.4(20/3): 8246.
Packed_Decimal
- in Interfaces.COBOL *note B.4(12/3): 8237.
+ <in> Interfaces.COBOL *note B.4(12/3): 8237.
Packed_Format
- in Interfaces.COBOL *note B.4(26): 8257.
+ <in> Interfaces.COBOL *note B.4(26): 8257.
Parameterless_Handler
- in Ada.Interrupts *note C.3.2(2/3): 8349.
+ <in> Ada.Interrupts *note C.3.2(2/3): 8349.
Params_Stream_Type
- in System.RPC *note E.5(6): 8953.
+ <in> System.RPC *note E.5(6): 8953.
Partition_Id
- in System.RPC *note E.5(4): 8951.
+ <in> System.RPC *note E.5(4): 8951.
Picture
- in Ada.Text_IO.Editing *note F.3.3(4): 8983.
+ <in> Ada.Text_IO.Editing *note F.3.3(4): 8983.
plain_char
- in Interfaces.C *note B.3(11): 8119.
+ <in> Interfaces.C *note B.3(11): 8119.
Pointer
- in Interfaces.C.Pointers *note B.3.2(5): 8200.
+ <in> Interfaces.C.Pointers *note B.3.2(5): 8200.
-Positive subtype of Integer
- in Standard *note A.1(13): 5976.
+Positive <subtype of> Integer
+ <in> Standard *note A.1(13): 5976.
-Positive_Count subtype of Count
- in Ada.Direct_IO *note A.8.4(4): 6907.
- in Ada.Streams.Stream_IO *note A.12.1(7): 7168.
- in Ada.Text_IO *note A.10.1(5): 6962.
+Positive_Count <subtype of> Count
+ <in> Ada.Direct_IO *note A.8.4(4): 6907.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 7168.
+ <in> Ada.Text_IO *note A.10.1(5): 6962.
-Priority subtype of Any_Priority
- in System *note 13.7(16): 5626.
+Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5626.
ptrdiff_t
- in Interfaces.C *note B.3(12): 8120.
+ <in> Interfaces.C *note B.3(12): 8120.
Queue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3): 8026.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3):
+8026.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
8011.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(4/3):
-7996.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(4/3): 7996.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
8018.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(4/3):
-8004.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(4/3): 8004.
Real
- in Interfaces.Fortran *note B.5(6): 8285.
+ <in> Interfaces.Fortran *note B.5(6): 8285.
Real_Matrix
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9132.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9132.
Real_Vector
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9131.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9131.
Reference_Type
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 7451.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 7545.
- in Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7723.
- in Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7943.
- in Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7855.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 7599.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7807.
- in Ada.Containers.Vectors *note A.18.2(34.2/3): 7363.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 7451.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 7545.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7723.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7943.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7855.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 7599.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7807.
+ <in> Ada.Containers.Vectors *note A.18.2(34.2/3): 7363.
Reversible_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3468.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3468.
Root_Storage_Pool
- in System.Storage_Pools *note 13.11(6/2): 5696.
+ <in> System.Storage_Pools *note 13.11(6/2): 5696.
Root_Storage_Pool_With_Subpools
- in System.Storage_Pools.Subpools *note 13.11.4(4/3): 5775.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(4/3): 5775.
Root_Stream_Type
- in Ada.Streams *note 13.13.1(3/2): 5860.
+ <in> Ada.Streams *note 13.13.1(3/2): 5860.
Root_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(5/3): 5776.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(5/3): 5776.
RPC_Receiver
- in System.RPC *note E.5(11): 8958.
+ <in> System.RPC *note E.5(11): 8958.
Search_Type
- in Ada.Directories *note A.16(31/2): 7262.
+ <in> Ada.Directories *note A.16(31/2): 7262.
-Second_Duration subtype of Day_Duration
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4565.
+Second_Duration <subtype of> Day_Duration
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4565.
-Second_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4564.
+Second_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4564.
Seconds_Count
- in Ada.Real_Time *note D.8(15): 8673.
+ <in> Ada.Real_Time *note D.8(15): 8673.
Set
- in Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7668.
- in Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7744.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7668.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7744.
short
- in Interfaces.C *note B.3(7): 8112.
+ <in> Interfaces.C *note B.3(7): 8112.
signed_char
- in Interfaces.C *note B.3(8): 8114.
+ <in> Interfaces.C *note B.3(8): 8114.
size_t
- in Interfaces.C *note B.3(13): 8121.
+ <in> Interfaces.C *note B.3(13): 8121.
State
- in Ada.Numerics.Discrete_Random *note A.5.2(23): 6734.
- in Ada.Numerics.Float_Random *note A.5.2(11): 6722.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(23): 6734.
+ <in> Ada.Numerics.Float_Random *note A.5.2(11): 6722.
Storage_Array
- in System.Storage_Elements *note 13.7.1(5): 5636.
+ <in> System.Storage_Elements *note 13.7.1(5): 5636.
-Storage_Count subtype of Storage_Offset
- in System.Storage_Elements *note 13.7.1(4): 5634.
+Storage_Count <subtype of> Storage_Offset
+ <in> System.Storage_Elements *note 13.7.1(4): 5634.
Storage_Element
- in System.Storage_Elements *note 13.7.1(5): 5635.
+ <in> System.Storage_Elements *note 13.7.1(5): 5635.
Storage_Offset
- in System.Storage_Elements *note 13.7.1(3): 5633.
+ <in> System.Storage_Elements *note 13.7.1(3): 5633.
Stream_Access
- in Ada.Streams.Stream_IO *note A.12.1(4): 7164.
- in Ada.Text_IO.Text_Streams *note A.12.2(3): 7204.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 7207.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 7210.
+ <in> Ada.Streams.Stream_IO *note A.12.1(4): 7164.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(3): 7204.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 7207.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 7210.
Stream_Element
- in Ada.Streams *note 13.13.1(4/1): 5861.
+ <in> Ada.Streams *note 13.13.1(4/1): 5861.
Stream_Element_Array
- in Ada.Streams *note 13.13.1(4/1): 5864.
+ <in> Ada.Streams *note 13.13.1(4/1): 5864.
-Stream_Element_Count subtype of Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5863.
+Stream_Element_Count <subtype of> Stream_Element_Offset
+ <in> Ada.Streams *note 13.13.1(4/1): 5863.
Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5862.
+ <in> Ada.Streams *note 13.13.1(4/1): 5862.
String
- in Standard *note A.1(37/3): 5983.
+ <in> Standard *note A.1(37/3): 5983.
String_Access
- in Ada.Strings.Unbounded *note A.4.5(7): 6460.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 6460.
Subpool_Handle
- in System.Storage_Pools.Subpools *note 13.11.4(6/3): 5777.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(6/3): 5777.
Suspension_Object
- in Ada.Synchronous_Task_Control *note D.10(4): 8688.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8688.
Synchronous_Barrier
- in Ada.Synchronous_Barriers *note D.10.1(5/3): 8702.
+ <in> Ada.Synchronous_Barriers *note D.10.1(5/3): 8702.
Tag
- in Ada.Tags *note 3.9(6/2): 2248.
+ <in> Ada.Tags *note 3.9(6/2): 2248.
Tag_Array
- in Ada.Tags *note 3.9(7.3/2): 2258.
+ <in> Ada.Tags *note 3.9(7.3/2): 2258.
Task_Array
- in Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8756.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8756.
Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 8401.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 8401.
Termination_Handler
- in Ada.Task_Termination *note C.7.3(4/2): 8435.
+ <in> Ada.Task_Termination *note C.7.3(4/2): 8435.
Time
- in Ada.Calendar *note 9.6(10): 4518.
- in Ada.Real_Time *note D.8(4): 8655.
+ <in> Ada.Calendar *note 9.6(10): 4518.
+ <in> Ada.Real_Time *note D.8(4): 8655.
Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4545.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4545.
Time_Span
- in Ada.Real_Time *note D.8(5): 8659.
+ <in> Ada.Real_Time *note D.8(5): 8659.
Timer
- in Ada.Execution_Time.Timers *note D.14.1(4/2): 8738.
+ <in> Ada.Execution_Time.Timers *note D.14.1(4/2): 8738.
Timer_Handler
- in Ada.Execution_Time.Timers *note D.14.1(5/2): 8739.
+ <in> Ada.Execution_Time.Timers *note D.14.1(5/2): 8739.
Timing_Event
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8785.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8785.
Timing_Event_Handler
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8786.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8786.
Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7835.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7835.
Trim_End
- in Ada.Strings *note A.4.1(6): 6329.
+ <in> Ada.Strings *note A.4.1(6): 6329.
Truncation
- in Ada.Strings *note A.4.1(6): 6326.
+ <in> Ada.Strings *note A.4.1(6): 6326.
Type_Set
- in Ada.Text_IO *note A.10.1(7): 6966.
+ <in> Ada.Text_IO *note A.10.1(7): 6966.
Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(4/2): 6457.
+ <in> Ada.Strings.Unbounded *note A.4.5(4/2): 6457.
-Uniformly_Distributed subtype of Float
- in Ada.Numerics.Float_Random *note A.5.2(8): 6718.
+Uniformly_Distributed <subtype of> Float
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6718.
unsigned
- in Interfaces.C *note B.3(9): 8115.
+ <in> Interfaces.C *note B.3(9): 8115.
unsigned_char
- in Interfaces.C *note B.3(10): 8118.
+ <in> Interfaces.C *note B.3(10): 8118.
unsigned_long
- in Interfaces.C *note B.3(9): 8117.
+ <in> Interfaces.C *note B.3(9): 8117.
unsigned_short
- in Interfaces.C *note B.3(9): 8116.
+ <in> Interfaces.C *note B.3(9): 8116.
-UTF_16_Wide_String subtype of Wide_String
- in Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6634.
+UTF_16_Wide_String <subtype of> Wide_String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6634.
-UTF_8_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6633.
+UTF_8_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6633.
-UTF_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6632.
+UTF_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6632.
Vector
- in Ada.Containers.Vectors *note A.18.2(8/3): 7339.
+ <in> Ada.Containers.Vectors *note A.18.2(8/3): 7339.
wchar_array
- in Interfaces.C *note B.3(33/3): 8139.
+ <in> Interfaces.C *note B.3(33/3): 8139.
wchar_t
- in Interfaces.C *note B.3(30/1): 8135.
+ <in> Interfaces.C *note B.3(30/1): 8135.
Wide_Character
- in Standard *note A.1(36.1/3): 5979.
+ <in> Standard *note A.1(36.1/3): 5979.
Wide_Character_Mapping
- in Ada.Strings.Wide_Maps *note A.4.7(20/2): 6557.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(20/2): 6557.
Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Maps *note A.4.7(26): 6563.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(26): 6563.
Wide_Character_Range
- in Ada.Strings.Wide_Maps *note A.4.7(6): 6546.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(6): 6546.
Wide_Character_Ranges
- in Ada.Strings.Wide_Maps *note A.4.7(7): 6547.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(7): 6547.
-Wide_Character_Sequence subtype of Wide_String
- in Ada.Strings.Wide_Maps *note A.4.7(16): 6553.
+Wide_Character_Sequence <subtype of> Wide_String
+ <in> Ada.Strings.Wide_Maps *note A.4.7(16): 6553.
Wide_Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(4/2): 6544.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(4/2): 6544.
Wide_String
- in Standard *note A.1(41/3): 5984.
+ <in> Standard *note A.1(41/3): 5984.
Wide_Wide_Character
- in Standard *note A.1(36.2/3): 5980.
+ <in> Standard *note A.1(36.2/3): 5980.
Wide_Wide_Character_Mapping
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6599.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6599.
Wide_Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6605.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6605.
Wide_Wide_Character_Range
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6588.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6588.
Wide_Wide_Character_Ranges
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6589.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6589.
-Wide_Wide_Character_Sequence subtype of Wide_Wide_String
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6595.
+Wide_Wide_Character_Sequence <subtype of> Wide_Wide_String
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6595.
Wide_Wide_Character_Set
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6586.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6586.
Wide_Wide_String
- in Standard *note A.1(42.1/3): 5985.
+ <in> Standard *note A.1(42.1/3): 5985.
-Year_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4519.
+Year_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4519.
File: aarm2012.info, Node: Q.3, Next: Q.4, Prev: Q.2, Up: Annex Q
@@ -129385,1955 +129828,1997 @@ Q.3 Language-Defined Subprograms
================================
1/3
-{AI95-00440-01AI95-00440-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00440-01AI95-00440-01>} {<AI05-0299-1AI05-0299-1>} This subclause
lists all language-defined subprograms.
-Abort_Task in Ada.Task_Identification *note C.7.1(3/3): 8406.
+Abort_Task <in> Ada.Task_Identification *note C.7.1(3/3): 8406.
Activation_Is_Complete
- in Ada.Task_Identification *note C.7.1(4/3): 8409.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8409.
Actual_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8518.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8518.
Ada.Unchecked_Deallocate_Subpool
- child of Ada *note 13.11.5(3/3): 5806.
+ <child of> Ada *note 13.11.5(3/3): 5806.
Add
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8764.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8764.
Add_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8758.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8758.
-Adjust in Ada.Finalization *note 7.6(6/2): 3977.
+Adjust <in> Ada.Finalization *note 7.6(6/2): 3977.
Allocate
- in System.Storage_Pools *note 13.11(7): 5697.
- in System.Storage_Pools.Subpools *note 13.11.4(14/3): 5784.
+ <in> System.Storage_Pools *note 13.11(7): 5697.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(14/3): 5784.
Allocate_From_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(11/3): 5781.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(11/3): 5781.
Ancestor_Find
- in Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7866.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7866.
Append
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 7461.
- in Ada.Containers.Vectors *note A.18.2(46/2): 7381, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 7461.
+ <in> Ada.Containers.Vectors *note A.18.2(46/2): 7381, *note
A.18.2(47/2): 7382.
- in Ada.Strings.Bounded *note A.4.4(13): 6404, *note A.4.4(14):
+ <in> Ada.Strings.Bounded *note A.4.4(13): 6404, *note A.4.4(14):
6405, *note A.4.4(15): 6406, *note A.4.4(16): 6407, *note A.4.4(17):
6408, *note A.4.4(18): 6409, *note A.4.4(19): 6410, *note A.4.4(20):
6411.
- in Ada.Strings.Unbounded *note A.4.5(12): 6466, *note A.4.5(13):
+ <in> Ada.Strings.Unbounded *note A.4.5(12): 6466, *note A.4.5(13):
6467, *note A.4.5(14): 6468.
Append_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7878.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7878.
Arccos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9046.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6694.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6694.
Arccosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9054.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6705.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6705.
Arccot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9048.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6699.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6699.
Arccoth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9056.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6707.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6707.
Arcsin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9045.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6693.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6693.
Arcsinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9053.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6704.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6704.
Arctan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9047.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6697.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6697.
Arctanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9055.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6706.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6706.
Argument
- in Ada.Command_Line *note A.15(5): 7228.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9158,
+ <in> Ada.Command_Line *note A.15(5): 7228.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9158,
*note G.3.2(31/2): 9170.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 9023.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 9023.
-Argument_Count in Ada.Command_Line *note A.15(4): 7227.
+Argument_Count <in> Ada.Command_Line *note A.15(4): 7227.
-Assert in Ada.Assertions *note 11.4.2(14/2): 5036.
+Assert <in> Ada.Assertions *note 11.4.2(14/2): 5036.
Assign
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 7454.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 7550.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7685.
- in Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7946.
- in Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7858.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 7604.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7759.
- in Ada.Containers.Vectors *note A.18.2(34.7/3): 7368.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 7454.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 7550.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7685.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7946.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7858.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 7604.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7759.
+ <in> Ada.Containers.Vectors *note A.18.2(34.7/3): 7368.
Assign_Task
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
8816.
-Attach_Handler in Ada.Interrupts *note C.3.2(7): 8353.
+Attach_Handler <in> Ada.Interrupts *note C.3.2(7): 8353.
-Base_Name in Ada.Directories *note A.16(19/2): 7250.
+Base_Name <in> Ada.Directories *note A.16(19/2): 7250.
Blank_When_Zero
- in Ada.Text_IO.Editing *note F.3.3(7): 8987.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8987.
-Bounded_Slice in Ada.Strings.Bounded *note A.4.4(28.1/2): 6415, *note
-A.4.4(28.2/2): 6416.
+Bounded_Slice <in> Ada.Strings.Bounded *note A.4.4(28.1/2): 6415,
+*note A.4.4(28.2/2): 6416.
Budget_Has_Expired
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8765.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8765.
Budget_Remaining
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8766.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8766.
Cancel_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8769.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8744.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8790.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8769.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8744.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8790.
Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(8/2): 7535.
- in Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7676.
- in Ada.Containers.Vectors *note A.18.2(19/2): 7347.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(8/2): 7535.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7676.
+ <in> Ada.Containers.Vectors *note A.18.2(19/2): 7347.
Ceiling
- in Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7630.
- in Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7791, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7630.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7791, *note
A.18.9(71/2): 7804.
Character_Set_Version
- in Ada.Wide_Characters.Handling *note A.3.5(4/3): 6293.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(4/3): 6293.
Child_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7872.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7872.
Child_Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7873.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7873.
Clear
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 7446.
- in Ada.Containers.Hashed_Maps *note A.18.5(12/2): 7539.
- in Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7680.
- in Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7937.
- in Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7849.
- in Ada.Containers.Ordered_Maps *note A.18.6(11/2): 7593.
- in Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7754.
- in Ada.Containers.Vectors *note A.18.2(24/2): 7352.
- in Ada.Environment_Variables *note A.17(7/2): 7309.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 7446.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(12/2): 7539.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7680.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7937.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7849.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(11/2): 7593.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7754.
+ <in> Ada.Containers.Vectors *note A.18.2(24/2): 7352.
+ <in> Ada.Environment_Variables *note A.17(7/2): 7309.
Clock
- in Ada.Calendar *note 9.6(12): 4523.
- in Ada.Execution_Time *note D.14(5/2): 8725.
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8781.
- in Ada.Real_Time *note D.8(6): 8665.
+ <in> Ada.Calendar *note 9.6(12): 4523.
+ <in> Ada.Execution_Time *note D.14(5/2): 8725.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8781.
+ <in> Ada.Real_Time *note D.8(6): 8665.
Clock_For_Interrupts
- in Ada.Execution_Time *note D.14(9.3/3): 8730.
+ <in> Ada.Execution_Time *note D.14(9.3/3): 8730.
Close
- in Ada.Direct_IO *note A.8.4(8): 6910.
- in Ada.Sequential_IO *note A.8.1(8): 6880.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7171.
- in Ada.Text_IO *note A.10.1(11): 6969.
+ <in> Ada.Direct_IO *note A.8.4(8): 6910.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6880.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7171.
+ <in> Ada.Text_IO *note A.10.1(11): 6969.
-Col in Ada.Text_IO *note A.10.1(37): 7022.
+Col <in> Ada.Text_IO *note A.10.1(37): 7022.
-Command_Name in Ada.Command_Line *note A.15(6): 7229.
+Command_Name <in> Ada.Command_Line *note A.15(6): 7229.
Compose
- in Ada.Directories *note A.16(20/2): 7251.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
+ <in> Ada.Directories *note A.16(20/2): 7251.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
7301.
Compose_From_Cartesian
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 9155,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 9155,
*note G.3.2(29/2): 9167.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 9020.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 9020.
Compose_From_Polar
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 9159,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 9159,
*note G.3.2(32/2): 9172.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 9025.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 9025.
Conjugate
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 9161,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 9161,
*note G.3.2(34/2): 9174.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 9027, *note
-G.1.1(15): 9028.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 9027,
+*note G.1.1(15): 9028.
Constant_Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 7452.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 7546, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 7452.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 7546, *note
A.18.5(17.5/3): 7548.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7684, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7684, *note
A.18.8(58.3/3): 7725.
- in Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7944.
- in Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7856.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 7600, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7944.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7856.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 7600, *note
A.18.6(16.5/3): 7602.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7758, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7758, *note
A.18.9(73.3/3): 7809.
- in Ada.Containers.Vectors *note A.18.2(34.3/3): 7364, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.3/3): 7364, *note
A.18.2(34.5/3): 7366.
Containing_Directory
- in Ada.Directories *note A.16(17/2): 7248.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
+ <in> Ada.Directories *note A.16(17/2): 7248.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
7298.
Contains
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 7481.
- in Ada.Containers.Hashed_Maps *note A.18.5(32/2): 7566.
- in Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7709, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 7481.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(32/2): 7566.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7709, *note
A.18.8(57/2): 7721.
- in Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7867.
- in Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7631.
- in Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7792, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7867.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7631.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7792, *note
A.18.9(72/2): 7805.
- in Ada.Containers.Vectors *note A.18.2(71/2): 7406.
+ <in> Ada.Containers.Vectors *note A.18.2(71/2): 7406.
Continue
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 8707.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8707.
Convert
- in Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6642,
+ <in> Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6642,
*note A.4.11(17/3): 6643, *note A.4.11(18/3): 6644, *note A.4.11(19/3):
6645, *note A.4.11(20/3): 6646.
Copy
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 7455.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 7551.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7686.
- in Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7947,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 7455.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 7551.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7686.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7947,
*note A.18.20(10/3): 7962, *note A.18.21(13/3): 7967, *note
A.18.22(10/3): 7971, *note A.18.23(13/3): 7976, *note A.18.24(10/3):
7980.
- in Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7859.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 7605.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7760.
- in Ada.Containers.Vectors *note A.18.2(34.8/3): 7369.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7859.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 7605.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7760.
+ <in> Ada.Containers.Vectors *note A.18.2(34.8/3): 7369.
-Copy_Array in Interfaces.C.Pointers *note B.3.2(15): 8208.
+Copy_Array <in> Interfaces.C.Pointers *note B.3.2(15): 8208.
-Copy_File in Ada.Directories *note A.16(13/2): 7245.
+Copy_File <in> Ada.Directories *note A.16(13/2): 7245.
Copy_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7880.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7880.
Copy_Terminated_Array
- in Interfaces.C.Pointers *note B.3.2(14): 8207.
+ <in> Interfaces.C.Pointers *note B.3.2(14): 8207.
Cos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9042.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6686.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6686.
Cosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9050.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6701.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6701.
Cot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9044.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6690.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6690.
Coth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9052.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6703.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6703.
Count
- in Ada.Strings.Bounded *note A.4.4(48): 6425, *note A.4.4(49):
+ <in> Ada.Strings.Bounded *note A.4.4(48): 6425, *note A.4.4(49):
6426, *note A.4.4(50): 6427.
- in Ada.Strings.Fixed *note A.4.3(13): 6366, *note A.4.3(14): 6367,
-*note A.4.3(15): 6368.
- in Ada.Strings.Unbounded *note A.4.5(43): 6482, *note A.4.5(44):
+ <in> Ada.Strings.Fixed *note A.4.3(13): 6366, *note A.4.3(14):
+6367, *note A.4.3(15): 6368.
+ <in> Ada.Strings.Unbounded *note A.4.5(43): 6482, *note A.4.5(44):
6483, *note A.4.5(45): 6484.
-Country in Ada.Locales *note A.19(6/3): 8040.
+Country <in> Ada.Locales *note A.19(6/3): 8040.
Create
- in Ada.Direct_IO *note A.8.4(6): 6908.
- in Ada.Sequential_IO *note A.8.1(6): 6878.
- in Ada.Streams.Stream_IO *note A.12.1(8): 7169.
- in Ada.Text_IO *note A.10.1(9): 6967.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
+ <in> Ada.Direct_IO *note A.8.4(6): 6908.
+ <in> Ada.Sequential_IO *note A.8.1(6): 6878.
+ <in> Ada.Streams.Stream_IO *note A.12.1(8): 7169.
+ <in> Ada.Text_IO *note A.10.1(9): 6967.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
8809, *note D.16.1(9.2/4): 8813.
-Create_Directory in Ada.Directories *note A.16(7/2): 7239.
+Create_Directory <in> Ada.Directories *note A.16(7/2): 7239.
-Create_Path in Ada.Directories *note A.16(9/2): 7241.
+Create_Path <in> Ada.Directories *note A.16(9/2): 7241.
Create_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(7/3): 5778.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(7/3): 5778.
-Current_Directory in Ada.Directories *note A.16(5/2): 7237.
+Current_Directory <in> Ada.Directories *note A.16(5/2): 7237.
-Current_Error in Ada.Text_IO *note A.10.1(17): 6985, *note A.10.1(20):
-6992.
+Current_Error <in> Ada.Text_IO *note A.10.1(17): 6985, *note
+A.10.1(20): 6992.
Current_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8768.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8743.
- in Ada.Interrupts *note C.3.2(6): 8352.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8789.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8768.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8743.
+ <in> Ada.Interrupts *note C.3.2(6): 8352.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8789.
-Current_Input in Ada.Text_IO *note A.10.1(17): 6983, *note A.10.1(20):
-6990.
+Current_Input <in> Ada.Text_IO *note A.10.1(17): 6983, *note
+A.10.1(20): 6990.
-Current_Output in Ada.Text_IO *note A.10.1(17): 6984, *note
+Current_Output <in> Ada.Text_IO *note A.10.1(17): 6984, *note
A.10.1(20): 6991.
Current_State
- in Ada.Synchronous_Task_Control *note D.10(4): 8691.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8691.
Current_Task
- in Ada.Task_Identification *note C.7.1(3/3): 8404.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8404.
Current_Task_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 8437.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 8437.
Current_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 8030.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+8030.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
8014.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7999.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7999.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
8022.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-8007.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 8007.
Day
- in Ada.Calendar *note 9.6(13): 4526.
- in Ada.Calendar.Formatting *note 9.6.1(23/2): 4568.
+ <in> Ada.Calendar *note 9.6(13): 4526.
+ <in> Ada.Calendar.Formatting *note 9.6.1(23/2): 4568.
Day_of_Week
- in Ada.Calendar.Formatting *note 9.6.1(18/2): 4561.
+ <in> Ada.Calendar.Formatting *note 9.6.1(18/2): 4561.
Deallocate
- in System.Storage_Pools *note 13.11(8): 5698.
- in System.Storage_Pools.Subpools *note 13.11.4(15/3): 5785.
+ <in> System.Storage_Pools *note 13.11(8): 5698.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(15/3): 5785.
Deallocate_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(12/3): 5782.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(12/3): 5782.
Decode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6651, *note
-A.4.11(27/3): 6652, *note A.4.11(28/3): 6653.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3): 6658,
-*note A.4.11(35/3): 6659, *note A.4.11(36/3): 6660.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6651,
+*note A.4.11(27/3): 6652, *note A.4.11(28/3): 6653.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3):
+6658, *note A.4.11(35/3): 6659, *note A.4.11(36/3): 6660.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
6665, *note A.4.11(43/3): 6666, *note A.4.11(44/3): 6667.
-Decrement in Interfaces.C.Pointers *note B.3.2(11/3): 8205.
+Decrement <in> Interfaces.C.Pointers *note B.3.2(11/3): 8205.
Default_Modulus
- in Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7966,
+ <in> Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7966,
*note A.18.23(10/3): 7975.
Default_Subpool_for_Pool
- in System.Storage_Pools.Subpools *note 13.11.4(13/3): 5783.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(13/3): 5783.
Delay_Until_And_Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
8819.
Delay_Until_And_Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8527.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8527.
Delete
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 7462.
- in Ada.Containers.Hashed_Maps *note A.18.5(25/2): 7559, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 7462.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(25/2): 7559, *note
A.18.5(26/2): 7560.
- in Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7693, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7693, *note
A.18.8(25/2): 7694, *note A.18.8(55/2): 7719.
- in Ada.Containers.Ordered_Maps *note A.18.6(24/2): 7613, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(24/2): 7613, *note
A.18.6(25/2): 7614.
- in Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7767, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7767, *note
A.18.9(24/2): 7768, *note A.18.9(68/2): 7801.
- in Ada.Containers.Vectors *note A.18.2(50/2): 7385, *note
+ <in> Ada.Containers.Vectors *note A.18.2(50/2): 7385, *note
A.18.2(51/2): 7386.
- in Ada.Direct_IO *note A.8.4(8): 6911.
- in Ada.Sequential_IO *note A.8.1(8): 6881.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7172.
- in Ada.Strings.Bounded *note A.4.4(64): 6440, *note A.4.4(65):
+ <in> Ada.Direct_IO *note A.8.4(8): 6911.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6881.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7172.
+ <in> Ada.Strings.Bounded *note A.4.4(64): 6440, *note A.4.4(65):
6441.
- in Ada.Strings.Fixed *note A.4.3(29): 6381, *note A.4.3(30): 6382.
- in Ada.Strings.Unbounded *note A.4.5(59): 6497, *note A.4.5(60):
+ <in> Ada.Strings.Fixed *note A.4.3(29): 6381, *note A.4.3(30):
+6382.
+ <in> Ada.Strings.Unbounded *note A.4.5(59): 6497, *note A.4.5(60):
6498.
- in Ada.Text_IO *note A.10.1(11): 6970.
+ <in> Ada.Text_IO *note A.10.1(11): 6970.
Delete_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7879.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7879.
-Delete_Directory in Ada.Directories *note A.16(8/2): 7240.
+Delete_Directory <in> Ada.Directories *note A.16(8/2): 7240.
-Delete_File in Ada.Directories *note A.16(11/2): 7243.
+Delete_File <in> Ada.Directories *note A.16(11/2): 7243.
Delete_First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 7463.
- in Ada.Containers.Ordered_Maps *note A.18.6(26/2): 7615.
- in Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7769.
- in Ada.Containers.Vectors *note A.18.2(52/2): 7387.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 7463.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(26/2): 7615.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7769.
+ <in> Ada.Containers.Vectors *note A.18.2(52/2): 7387.
Delete_Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 7464.
- in Ada.Containers.Ordered_Maps *note A.18.6(27/2): 7616.
- in Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7770.
- in Ada.Containers.Vectors *note A.18.2(53/2): 7388.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 7464.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(27/2): 7616.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7770.
+ <in> Ada.Containers.Vectors *note A.18.2(53/2): 7388.
Delete_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7861.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7861.
Delete_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7862.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7862.
-Delete_Tree in Ada.Directories *note A.16(10/2): 7242.
+Delete_Tree <in> Ada.Directories *note A.16(10/2): 7242.
Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7845.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7845.
Dequeue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 8028.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+8028.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
8013.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(6/3):
-7998.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(6/3): 7998.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
8020.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-8006.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 8006.
Dequeue_Only_High_Priority
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3): 8029.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3):
+8029.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
8021.
Dereference_Error
- in Interfaces.C.Strings *note B.3.1(12): 8184.
+ <in> Interfaces.C.Strings *note B.3.1(12): 8184.
-Descendant_Tag in Ada.Tags *note 3.9(7.1/2): 2255.
+Descendant_Tag <in> Ada.Tags *note 3.9(7.1/2): 2255.
-Detach_Handler in Ada.Interrupts *note C.3.2(9): 8355.
+Detach_Handler <in> Ada.Interrupts *note C.3.2(9): 8355.
Determinant
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9179.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9138.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9179.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9138.
Difference
- in Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4551.
- in Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7699, *note
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4551.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7699, *note
A.18.8(33/2): 7700.
- in Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7775, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7775, *note
A.18.9(34/2): 7776.
-Divide in Ada.Decimal *note F.2(6/3): 8977.
+Divide <in> Ada.Decimal *note F.2(6/3): 8977.
-Do_APC in System.RPC *note E.5(10): 8957.
+Do_APC <in> System.RPC *note E.5(10): 8957.
-Do_RPC in System.RPC *note E.5(9): 8956.
+Do_RPC <in> System.RPC *note E.5(9): 8956.
Eigensystem
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 9181.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 9140.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 9181.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 9140.
Eigenvalues
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 9180.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 9139.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 9180.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 9139.
Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 7447.
- in Ada.Containers.Hashed_Maps *note A.18.5(14/2): 7541, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 7447.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(14/2): 7541, *note
A.18.5(31/2): 7565.
- in Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7681, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7681, *note
A.18.8(52/2): 7716.
- in Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7938.
- in Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7850.
- in Ada.Containers.Ordered_Maps *note A.18.6(13/2): 7595, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7938.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7850.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(13/2): 7595, *note
A.18.6(39/2): 7628.
- in Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7755, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7755, *note
A.18.9(65/2): 7798.
- in Ada.Containers.Vectors *note A.18.2(27/2): 7355, *note
+ <in> Ada.Containers.Vectors *note A.18.2(27/2): 7355, *note
A.18.2(28/2): 7356.
- in Ada.Strings.Bounded *note A.4.4(26): 6412.
- in Ada.Strings.Unbounded *note A.4.5(20): 6469.
+ <in> Ada.Strings.Bounded *note A.4.4(26): 6412.
+ <in> Ada.Strings.Unbounded *note A.4.5(20): 6469.
Encode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6648, *note
-A.4.11(24/3): 6649, *note A.4.11(25/3): 6650.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3): 6655,
-*note A.4.11(32/3): 6656, *note A.4.11(33/3): 6657.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6648,
+*note A.4.11(24/3): 6649, *note A.4.11(25/3): 6650.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3):
+6655, *note A.4.11(32/3): 6656, *note A.4.11(33/3): 6657.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
6662, *note A.4.11(40/3): 6663, *note A.4.11(41/3): 6664.
-Encoding in Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6640.
+Encoding <in> Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6640.
End_Of_File
- in Ada.Direct_IO *note A.8.4(16): 6926.
- in Ada.Sequential_IO *note A.8.1(13): 6891.
- in Ada.Streams.Stream_IO *note A.12.1(12): 7179.
- in Ada.Text_IO *note A.10.1(34): 7015.
+ <in> Ada.Direct_IO *note A.8.4(16): 6926.
+ <in> Ada.Sequential_IO *note A.8.1(13): 6891.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 7179.
+ <in> Ada.Text_IO *note A.10.1(34): 7015.
-End_Of_Line in Ada.Text_IO *note A.10.1(30): 7008.
+End_Of_Line <in> Ada.Text_IO *note A.10.1(30): 7008.
-End_Of_Page in Ada.Text_IO *note A.10.1(33): 7014.
+End_Of_Page <in> Ada.Text_IO *note A.10.1(33): 7014.
-End_Search in Ada.Directories *note A.16(33/2): 7264.
+End_Search <in> Ada.Directories *note A.16(33/2): 7264.
Enqueue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 8027.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+8027.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
8012.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(5/3):
-7997.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(5/3): 7997.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
8019.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-8005.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 8005.
Environment_Task
- in Ada.Task_Identification *note C.7.1(3/3): 8405.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8405.
Equal_Case_Insensitive
- child of Ada.Strings *note A.4.10(2/3): 6621.
- child of Ada.Strings.Bounded *note A.4.10(7/3): 6623.
- child of Ada.Strings.Fixed *note A.4.10(5/3): 6622.
- child of Ada.Strings.Unbounded *note A.4.10(10/3): 6624.
+ <child of> Ada.Strings *note A.4.10(2/3): 6621.
+ <child of> Ada.Strings.Bounded *note A.4.10(7/3): 6623.
+ <child of> Ada.Strings.Fixed *note A.4.10(5/3): 6622.
+ <child of> Ada.Strings.Unbounded *note A.4.10(10/3): 6624.
Equal_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7841.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7841.
Equivalent_Elements
- in Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7710, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7710, *note
A.18.8(47/2): 7711, *note A.18.8(48/2): 7712.
- in Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7743.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7743.
Equivalent_Keys
- in Ada.Containers.Hashed_Maps *note A.18.5(34/2): 7567, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(34/2): 7567, *note
A.18.5(35/2): 7568, *note A.18.5(36/2): 7569.
- in Ada.Containers.Ordered_Maps *note A.18.6(3/2): 7584.
- in Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7796.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(3/2): 7584.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7796.
Equivalent_Sets
- in Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7674.
- in Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7750.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7674.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7750.
-Establish_RPC_Receiver in System.RPC *note E.5(12): 8959.
+Establish_RPC_Receiver <in> System.RPC *note E.5(12): 8959.
-Exception_Identity in Ada.Exceptions *note 11.4.1(5/2): 5002.
+Exception_Identity <in> Ada.Exceptions *note 11.4.1(5/2): 5002.
Exception_Information
- in Ada.Exceptions *note 11.4.1(5/2): 5006.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 5006.
-Exception_Message in Ada.Exceptions *note 11.4.1(4/3): 5000.
+Exception_Message <in> Ada.Exceptions *note 11.4.1(4/3): 5000.
-Exception_Name in Ada.Exceptions *note 11.4.1(2/2): 4993, *note
+Exception_Name <in> Ada.Exceptions *note 11.4.1(2/2): 4993, *note
11.4.1(5/2): 5003.
-Exchange_Handler in Ada.Interrupts *note C.3.2(8): 8354.
+Exchange_Handler <in> Ada.Interrupts *note C.3.2(8): 8354.
Exclude
- in Ada.Containers.Hashed_Maps *note A.18.5(24/2): 7558.
- in Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7692, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(24/2): 7558.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7692, *note
A.18.8(54/2): 7718.
- in Ada.Containers.Ordered_Maps *note A.18.6(23/2): 7612.
- in Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7766, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(23/2): 7612.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7766, *note
A.18.9(67/2): 7800.
Exists
- in Ada.Directories *note A.16(24/2): 7256.
- in Ada.Environment_Variables *note A.17(5/2): 7307.
+ <in> Ada.Directories *note A.16(24/2): 7256.
+ <in> Ada.Environment_Variables *note A.17(5/2): 7307.
Exp
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9039.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6683.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6683.
-Expanded_Name in Ada.Tags *note 3.9(7/2): 2250.
+Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2250.
-Extension in Ada.Directories *note A.16(18/2): 7249.
+Extension <in> Ada.Directories *note A.16(18/2): 7249.
-External_Tag in Ada.Tags *note 3.9(7/2): 2253.
+External_Tag <in> Ada.Tags *note 3.9(7/2): 2253.
-Finalize in Ada.Finalization *note 7.6(6/2): 3978, *note 7.6(8/2):
+Finalize <in> Ada.Finalization *note 7.6(6/2): 3978, *note 7.6(8/2):
3981.
Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 7479.
- in Ada.Containers.Hashed_Maps *note A.18.5(30/2): 7564.
- in Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7708, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 7479.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(30/2): 7564.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7708, *note
A.18.8(56/2): 7720.
- in Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7864.
- in Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7627.
- in Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7789, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7864.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7627.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7789, *note
A.18.9(69/2): 7802.
- in Ada.Containers.Vectors *note A.18.2(68/2): 7403.
+ <in> Ada.Containers.Vectors *note A.18.2(68/2): 7403.
Find_In_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7865.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7865.
-Find_Index in Ada.Containers.Vectors *note A.18.2(67/2): 7402.
+Find_Index <in> Ada.Containers.Vectors *note A.18.2(67/2): 7402.
Find_Token
- in Ada.Strings.Bounded *note A.4.4(50.1/3): 6428, *note A.4.4(51):
-6429.
- in Ada.Strings.Fixed *note A.4.3(15.1/3): 6369, *note A.4.3(16):
+ <in> Ada.Strings.Bounded *note A.4.4(50.1/3): 6428, *note
+A.4.4(51): 6429.
+ <in> Ada.Strings.Fixed *note A.4.3(15.1/3): 6369, *note A.4.3(16):
6370.
- in Ada.Strings.Unbounded *note A.4.5(45.1/3): 6485, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(45.1/3): 6485, *note
A.4.5(46): 6486.
First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 7471.
- in Ada.Containers.Hashed_Maps *note A.18.5(27/2): 7561.
- in Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7705.
- in Ada.Containers.Ordered_Maps *note A.18.6(28/2): 7617.
- in Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7781.
- in Ada.Containers.Vectors *note A.18.2(58/2): 7393.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3466.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 7471.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(27/2): 7561.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7705.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(28/2): 7617.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7781.
+ <in> Ada.Containers.Vectors *note A.18.2(58/2): 7393.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3466.
First_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7886.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7886.
First_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7887.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7887.
First_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 7472.
- in Ada.Containers.Ordered_Maps *note A.18.6(29/2): 7618.
- in Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7782.
- in Ada.Containers.Vectors *note A.18.2(59/2): 7394.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 7472.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(29/2): 7618.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7782.
+ <in> Ada.Containers.Vectors *note A.18.2(59/2): 7394.
-First_Index in Ada.Containers.Vectors *note A.18.2(57/2): 7392.
+First_Index <in> Ada.Containers.Vectors *note A.18.2(57/2): 7392.
First_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(30/2): 7619.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(30/2): 7619.
Floor
- in Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7629.
- in Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7790, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7629.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7790, *note
A.18.9(70/2): 7803.
Flush
- in Ada.Direct_IO *note A.8.4(10.1/4): 6918.
- in Ada.Sequential_IO *note A.8.1(10.1/4): 6888.
- in Ada.Streams.Stream_IO *note A.12.1(25/1): 7189.
- in Ada.Text_IO *note A.10.1(21/1): 6994.
+ <in> Ada.Direct_IO *note A.8.4(10.1/4): 6918.
+ <in> Ada.Sequential_IO *note A.8.1(10.1/4): 6888.
+ <in> Ada.Streams.Stream_IO *note A.12.1(25/1): 7189.
+ <in> Ada.Text_IO *note A.10.1(21/1): 6994.
Form
- in Ada.Direct_IO *note A.8.4(9): 6916.
- in Ada.Sequential_IO *note A.8.1(9): 6886.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7177.
- in Ada.Text_IO *note A.10.1(12): 6975.
+ <in> Ada.Direct_IO *note A.8.4(9): 6916.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6886.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7177.
+ <in> Ada.Text_IO *note A.10.1(12): 6975.
Free
- in Ada.Strings.Unbounded *note A.4.5(7): 6461.
- in Interfaces.C.Strings *note B.3.1(11): 8183.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 6461.
+ <in> Interfaces.C.Strings *note B.3.1(11): 8183.
-Full_Name in Ada.Directories *note A.16(15/2): 7246, *note A.16(39/2):
-7268.
+Full_Name <in> Ada.Directories *note A.16(15/2): 7246, *note
+A.16(39/2): 7268.
Generic_Array_Sort
- child of Ada.Containers *note A.18.26(3/2): 7987.
+ <child of> Ada.Containers *note A.18.26(3/2): 7987.
Generic_Constrained_Array_Sort
- child of Ada.Containers *note A.18.26(7/2): 7989.
+ <child of> Ada.Containers *note A.18.26(7/2): 7989.
Generic_Sort
- child of Ada.Containers *note A.18.26(9.2/4): 7991.
+ <child of> Ada.Containers *note A.18.26(9.2/4): 7991.
Get
- in Ada.Text_IO *note A.10.1(41): 7028, *note A.10.1(47): 7037,
+ <in> Ada.Text_IO *note A.10.1(41): 7028, *note A.10.1(47): 7037,
*note A.10.1(54): 7050, *note A.10.1(55): 7054, *note A.10.1(59): 7060,
*note A.10.1(60): 7063, *note A.10.1(65): 7070, *note A.10.1(67): 7073,
*note A.10.1(70): 7080, *note A.10.1(72): 7083, *note A.10.1(75): 7090,
*note A.10.1(77): 7093, *note A.10.1(81): 7099, *note A.10.1(83): 7102.
- in Ada.Text_IO.Complex_IO *note G.1.3(6): 9070, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(6): 9070, *note G.1.3(8):
9073.
Get_CPU
- in Ada.Interrupts *note C.3.2(10.1/3): 8357.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
+ <in> Ada.Interrupts *note C.3.2(10.1/3): 8357.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
8818.
Get_CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.3/4):
-8814.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.3/4): 8814.
-Get_Deadline in Ada.Dispatching.EDF *note D.2.6(9/2): 8528.
+Get_Deadline <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8528.
Get_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
8815.
Get_First_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
8810.
-Get_Immediate in Ada.Text_IO *note A.10.1(44): 7034, *note A.10.1(45):
-7035.
+Get_Immediate <in> Ada.Text_IO *note A.10.1(44): 7034, *note
+A.10.1(45): 7035.
Get_Last_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
8811.
Get_Line
- in Ada.Text_IO *note A.10.1(49): 7042, *note A.10.1(49.1/2): 7043.
- in Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 7133, *note
+ <in> Ada.Text_IO *note A.10.1(49): 7042, *note A.10.1(49.1/2):
+7043.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 7133, *note
A.10.11(9/2): 7134, *note A.10.11(10/2): 7135, *note A.10.11(11/2):
7136.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 7143, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 7143, *note
A.10.12(9/2): 7144, *note A.10.12(10/2): 7145, *note A.10.12(11/2):
7146.
-Get_Next_Entry in Ada.Directories *note A.16(35/2): 7266.
+Get_Next_Entry <in> Ada.Directories *note A.16(35/2): 7266.
Get_Priority
- in Ada.Dynamic_Priorities *note D.5.1(5): 8573.
+ <in> Ada.Dynamic_Priorities *note D.5.1(5): 8573.
Has_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 7442.
- in Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 7533.
- in Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7672.
- in Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7839.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 7589.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7748.
- in Ada.Containers.Vectors *note A.18.2(11.1/3): 7343.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 7442.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 7533.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7672.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7839.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 7589.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7748.
+ <in> Ada.Containers.Vectors *note A.18.2(11.1/3): 7343.
Hash
- child of Ada.Strings *note A.4.9(2/3): 6612.
- child of Ada.Strings.Bounded *note A.4.9(7/3): 6613.
- child of Ada.Strings.Unbounded *note A.4.9(10/3): 6614.
+ <child of> Ada.Strings *note A.4.9(2/3): 6612.
+ <child of> Ada.Strings.Bounded *note A.4.9(7/3): 6613.
+ <child of> Ada.Strings.Unbounded *note A.4.9(10/3): 6614.
Hash_Case_Insensitive
- child of Ada.Strings *note A.4.9(11.2/3): 6615.
- child of Ada.Strings.Bounded *note A.4.9(11.7/3): 6617.
- child of Ada.Strings.Fixed *note A.4.9(11.5/3): 6616.
- child of Ada.Strings.Unbounded *note A.4.9(11.10/3): 6618.
+ <child of> Ada.Strings *note A.4.9(11.2/3): 6615.
+ <child of> Ada.Strings.Bounded *note A.4.9(11.7/3): 6617.
+ <child of> Ada.Strings.Fixed *note A.4.9(11.5/3): 6616.
+ <child of> Ada.Strings.Unbounded *note A.4.9(11.10/3): 6618.
Head
- in Ada.Strings.Bounded *note A.4.4(70): 6446, *note A.4.4(71):
+ <in> Ada.Strings.Bounded *note A.4.4(70): 6446, *note A.4.4(71):
6447.
- in Ada.Strings.Fixed *note A.4.3(35): 6387, *note A.4.3(36): 6388.
- in Ada.Strings.Unbounded *note A.4.5(65): 6503, *note A.4.5(66):
+ <in> Ada.Strings.Fixed *note A.4.3(35): 6387, *note A.4.3(36):
+6388.
+ <in> Ada.Strings.Unbounded *note A.4.5(65): 6503, *note A.4.5(66):
6504.
-Hold in Ada.Asynchronous_Task_Control *note D.11(3/2): 8706.
+Hold <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8706.
-Hour in Ada.Calendar.Formatting *note 9.6.1(24/2): 4569.
+Hour <in> Ada.Calendar.Formatting *note 9.6.1(24/2): 4569.
Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9151,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9151,
*note G.3.2(27/2): 9164.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9014.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9014.
Image
- in Ada.Calendar.Formatting *note 9.6.1(35/2): 4580, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(35/2): 4580, *note
9.6.1(37/2): 4582.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6738.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6726.
- in Ada.Task_Identification *note C.7.1(3/3): 8403.
- in Ada.Text_IO.Editing *note F.3.3(13): 8997.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6738.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6726.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8403.
+ <in> Ada.Text_IO.Editing *note F.3.3(13): 8997.
Include
- in Ada.Containers.Hashed_Maps *note A.18.5(22/2): 7556.
- in Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7690.
- in Ada.Containers.Ordered_Maps *note A.18.6(21/2): 7610.
- in Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7764.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(22/2): 7556.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7690.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(21/2): 7610.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7764.
-Increment in Interfaces.C.Pointers *note B.3.2(11/3): 8204.
+Increment <in> Interfaces.C.Pointers *note B.3.2(11/3): 8204.
Index
- in Ada.Direct_IO *note A.8.4(15): 6924.
- in Ada.Streams.Stream_IO *note A.12.1(23): 7186.
- in Ada.Strings.Bounded *note A.4.4(43.1/2): 6417, *note
+ <in> Ada.Direct_IO *note A.8.4(15): 6924.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 7186.
+ <in> Ada.Strings.Bounded *note A.4.4(43.1/2): 6417, *note
A.4.4(43.2/2): 6418, *note A.4.4(44): 6419, *note A.4.4(45): 6420, *note
A.4.4(45.1/2): 6421, *note A.4.4(46): 6422.
- in Ada.Strings.Fixed *note A.4.3(8.1/2): 6358, *note A.4.3(8.2/2):
-6359, *note A.4.3(9): 6360, *note A.4.3(10): 6361, *note A.4.3(10.1/2):
-6362, *note A.4.3(11): 6363.
- in Ada.Strings.Unbounded *note A.4.5(38.1/2): 6474, *note
+ <in> Ada.Strings.Fixed *note A.4.3(8.1/2): 6358, *note
+A.4.3(8.2/2): 6359, *note A.4.3(9): 6360, *note A.4.3(10): 6361, *note
+A.4.3(10.1/2): 6362, *note A.4.3(11): 6363.
+ <in> Ada.Strings.Unbounded *note A.4.5(38.1/2): 6474, *note
A.4.5(38.2/2): 6475, *note A.4.5(39): 6476, *note A.4.5(40): 6477, *note
A.4.5(40.1/2): 6478, *note A.4.5(41): 6479.
Index_Non_Blank
- in Ada.Strings.Bounded *note A.4.4(46.1/2): 6423, *note A.4.4(47):
-6424.
- in Ada.Strings.Fixed *note A.4.3(11.1/2): 6364, *note A.4.3(12):
+ <in> Ada.Strings.Bounded *note A.4.4(46.1/2): 6423, *note
+A.4.4(47): 6424.
+ <in> Ada.Strings.Fixed *note A.4.3(11.1/2): 6364, *note A.4.3(12):
6365.
- in Ada.Strings.Unbounded *note A.4.5(41.1/2): 6480, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(41.1/2): 6480, *note
A.4.5(42): 6481.
Initial_Directory
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
7299.
-Initialize in Ada.Finalization *note 7.6(6/2): 3976, *note 7.6(8/2):
+Initialize <in> Ada.Finalization *note 7.6(6/2): 3976, *note 7.6(8/2):
3980.
Insert
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 7457,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 7457,
*note A.18.3(20/2): 7458, *note A.18.3(21/2): 7459.
- in Ada.Containers.Hashed_Maps *note A.18.5(19/2): 7553, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(19/2): 7553, *note
A.18.5(20/2): 7554, *note A.18.5(21/2): 7555.
- in Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7688, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7688, *note
A.18.8(20/2): 7689.
- in Ada.Containers.Ordered_Maps *note A.18.6(18/2): 7607, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(18/2): 7607, *note
A.18.6(19/2): 7608, *note A.18.6(20/2): 7609.
- in Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7762, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7762, *note
A.18.9(19/2): 7763.
- in Ada.Containers.Vectors *note A.18.2(36/2): 7371, *note
+ <in> Ada.Containers.Vectors *note A.18.2(36/2): 7371, *note
A.18.2(37/2): 7372, *note A.18.2(38/2): 7373, *note A.18.2(39/2): 7374,
*note A.18.2(40/2): 7375, *note A.18.2(41/2): 7376, *note A.18.2(42/2):
7377, *note A.18.2(43/2): 7378.
- in Ada.Strings.Bounded *note A.4.4(60): 6436, *note A.4.4(61):
+ <in> Ada.Strings.Bounded *note A.4.4(60): 6436, *note A.4.4(61):
6437.
- in Ada.Strings.Fixed *note A.4.3(25): 6377, *note A.4.3(26): 6378.
- in Ada.Strings.Unbounded *note A.4.5(55): 6493, *note A.4.5(56):
+ <in> Ada.Strings.Fixed *note A.4.3(25): 6377, *note A.4.3(26):
+6378.
+ <in> Ada.Strings.Unbounded *note A.4.5(55): 6493, *note A.4.5(56):
6494.
Insert_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7874, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7874, *note
A.18.10(49/3): 7875, *note A.18.10(50/3): 7876.
Insert_Space
- in Ada.Containers.Vectors *note A.18.2(48/2): 7383, *note
+ <in> Ada.Containers.Vectors *note A.18.2(48/2): 7383, *note
A.18.2(49/2): 7384.
-Interface_Ancestor_Tags in Ada.Tags *note 3.9(7.4/2): 2259.
+Interface_Ancestor_Tags <in> Ada.Tags *note 3.9(7.4/2): 2259.
-Internal_Tag in Ada.Tags *note 3.9(7/2): 2254.
+Internal_Tag <in> Ada.Tags *note 3.9(7/2): 2254.
Intersection
- in Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7697, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7697, *note
A.18.8(30/2): 7698.
- in Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7773, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7773, *note
A.18.9(31/2): 7774.
Inverse
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9178.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9137.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9178.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9137.
Is_A_Group_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8761.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8761.
-Is_Abstract in Ada.Tags *note 3.9(7.5/3): 2260.
+Is_Abstract <in> Ada.Tags *note 3.9(7.5/3): 2260.
Is_Alphanumeric
- in Ada.Characters.Handling *note A.3.2(4/3): 6011.
- in Ada.Wide_Characters.Handling *note A.3.5(12/3): 6301.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6011.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(12/3): 6301.
-Is_Attached in Ada.Interrupts *note C.3.2(5): 8351.
+Is_Attached <in> Ada.Interrupts *note C.3.2(5): 8351.
-Is_Basic in Ada.Characters.Handling *note A.3.2(4/3): 6007.
+Is_Basic <in> Ada.Characters.Handling *note A.3.2(4/3): 6007.
Is_Callable
- in Ada.Task_Identification *note C.7.1(4/3): 8408.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8408.
Is_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 6275.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6275.
Is_Control
- in Ada.Characters.Handling *note A.3.2(4/3): 6002.
- in Ada.Wide_Characters.Handling *note A.3.5(5/3): 6294.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6002.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(5/3): 6294.
Is_Current_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3): 7294.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3):
+7294.
Is_Decimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6009.
- in Ada.Wide_Characters.Handling *note A.3.5(10/3): 6299.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6009.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(10/3): 6299.
Is_Descendant_At_Same_Level
- in Ada.Tags *note 3.9(7.1/2): 2256.
+ <in> Ada.Tags *note 3.9(7.1/2): 2256.
Is_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6008.
- in Ada.Wide_Characters.Handling *note A.3.5(9/3): 6298.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6008.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(9/3): 6298.
Is_Empty
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 7445.
- in Ada.Containers.Hashed_Maps *note A.18.5(11/2): 7538.
- in Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7679.
- in Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7936.
- in Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7842.
- in Ada.Containers.Ordered_Maps *note A.18.6(10/2): 7592.
- in Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7753.
- in Ada.Containers.Vectors *note A.18.2(23/2): 7351.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 7445.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(11/2): 7538.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7679.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7936.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7842.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(10/2): 7592.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7753.
+ <in> Ada.Containers.Vectors *note A.18.2(23/2): 7351.
Is_Full_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3): 7295.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3):
+7295.
Is_Graphic
- in Ada.Characters.Handling *note A.3.2(4/3): 6003.
- in Ada.Wide_Characters.Handling *note A.3.5(19/3): 6308.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6003.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(19/3): 6308.
Is_Held
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 8708.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8708.
Is_Hexadecimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6010.
- in Ada.Wide_Characters.Handling *note A.3.5(11/3): 6300.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6010.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(11/3): 6300.
Is_In
- in Ada.Strings.Maps *note A.4.2(13): 6339.
- in Ada.Strings.Wide_Maps *note A.4.7(13): 6551.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6593.
+ <in> Ada.Strings.Maps *note A.4.2(13): 6339.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(13): 6551.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6593.
-Is_ISO_646 in Ada.Characters.Handling *note A.3.2(10): 6026.
+Is_ISO_646 <in> Ada.Characters.Handling *note A.3.2(10): 6026.
Is_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7847.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7847.
Is_Letter
- in Ada.Characters.Handling *note A.3.2(4/3): 6004.
- in Ada.Wide_Characters.Handling *note A.3.5(6/3): 6295.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6004.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(6/3): 6295.
Is_Line_Terminator
- in Ada.Characters.Handling *note A.3.2(4/3): 6013.
- in Ada.Wide_Characters.Handling *note A.3.5(14/3): 6303.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6013.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(14/3): 6303.
Is_Lower
- in Ada.Characters.Handling *note A.3.2(4/3): 6005.
- in Ada.Wide_Characters.Handling *note A.3.5(7/3): 6296.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6005.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(7/3): 6296.
Is_Mark
- in Ada.Characters.Handling *note A.3.2(4/3): 6014.
- in Ada.Wide_Characters.Handling *note A.3.5(15/3): 6304.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6014.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(15/3): 6304.
Is_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8760.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8760.
-Is_Nul_Terminated in Interfaces.C *note B.3(24): 8130, *note B.3(35):
-8140, *note B.3(39.16/2): 8160, *note B.3(39.7/2): 8150.
+Is_Nul_Terminated <in> Interfaces.C *note B.3(24): 8130, *note
+B.3(35): 8140, *note B.3(39.16/2): 8160, *note B.3(39.7/2): 8150.
Is_Open
- in Ada.Direct_IO *note A.8.4(10): 6917.
- in Ada.Sequential_IO *note A.8.1(10): 6887.
- in Ada.Streams.Stream_IO *note A.12.1(12): 7178.
- in Ada.Text_IO *note A.10.1(13): 6976.
+ <in> Ada.Direct_IO *note A.8.4(10): 6917.
+ <in> Ada.Sequential_IO *note A.8.1(10): 6887.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 7178.
+ <in> Ada.Text_IO *note A.10.1(13): 6976.
Is_Other_Format
- in Ada.Characters.Handling *note A.3.2(4/3): 6015.
- in Ada.Wide_Characters.Handling *note A.3.5(16/3): 6305.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6015.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(16/3): 6305.
Is_Parent_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3): 7293.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3):
+7293.
Is_Punctuation_Connector
- in Ada.Characters.Handling *note A.3.2(4/3): 6016.
- in Ada.Wide_Characters.Handling *note A.3.5(17/3): 6306.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6016.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(17/3): 6306.
Is_Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3): 7296.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3):
+7296.
-Is_Reserved in Ada.Interrupts *note C.3.2(4): 8350.
+Is_Reserved <in> Ada.Interrupts *note C.3.2(4): 8350.
Is_Root
- in Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7846.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7846.
Is_Root_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3): 7292.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3):
+7292.
Is_Round_Robin
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8519.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8519.
Is_Simple_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3): 7291.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3):
+7291.
Is_Sorted
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 7485.
- in Ada.Containers.Vectors *note A.18.2(76/2): 7410.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 7485.
+ <in> Ada.Containers.Vectors *note A.18.2(76/2): 7410.
Is_Space
- in Ada.Characters.Handling *note A.3.2(4/3): 6017.
- in Ada.Wide_Characters.Handling *note A.3.5(18/3): 6307.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6017.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(18/3): 6307.
Is_Special
- in Ada.Characters.Handling *note A.3.2(4/3): 6012.
- in Ada.Wide_Characters.Handling *note A.3.5(13/3): 6302.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6012.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(13/3): 6302.
Is_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 6274.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6274.
Is_Subset
- in Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7704.
- in Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7780.
- in Ada.Strings.Maps *note A.4.2(14): 6340.
- in Ada.Strings.Wide_Maps *note A.4.7(14): 6552.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6594.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7704.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7780.
+ <in> Ada.Strings.Maps *note A.4.2(14): 6340.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(14): 6552.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6594.
Is_Terminated
- in Ada.Task_Identification *note C.7.1(4/3): 8407.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8407.
Is_Upper
- in Ada.Characters.Handling *note A.3.2(4/3): 6006.
- in Ada.Wide_Characters.Handling *note A.3.5(8/3): 6297.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6006.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(8/3): 6297.
Is_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 6277.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6277.
Is_Wide_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 6278.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6278.
Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 7482.
- in Ada.Containers.Hashed_Maps *note A.18.5(37/2): 7570.
- in Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7713.
- in Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7868, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 7482.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(37/2): 7570.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7713.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7868, *note
A.18.10(44/3): 7870.
- in Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7632.
- in Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7793.
- in Ada.Containers.Vectors *note A.18.2(73/2): 7407.
- in Ada.Environment_Variables *note A.17(8/3): 7311.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7632.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7793.
+ <in> Ada.Containers.Vectors *note A.18.2(73/2): 7407.
+ <in> Ada.Environment_Variables *note A.17(8/3): 7311.
Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7894, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7894, *note
A.18.10(70/3): 7896.
Iterate_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7869, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7869, *note
A.18.10(45/3): 7871.
Key
- in Ada.Containers.Hashed_Maps *note A.18.5(13/2): 7540.
- in Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7715.
- in Ada.Containers.Ordered_Maps *note A.18.6(12/2): 7594.
- in Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7797.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(13/2): 7540.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7715.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(12/2): 7594.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7797.
-Kind in Ada.Directories *note A.16(25/2): 7257, *note A.16(40/2):
+Kind <in> Ada.Directories *note A.16(25/2): 7257, *note A.16(40/2):
7269.
-Language in Ada.Locales *note A.19(6/3): 8039.
+Language <in> Ada.Locales *note A.19(6/3): 8039.
Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 7473.
- in Ada.Containers.Ordered_Maps *note A.18.6(31/2): 7620.
- in Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7783.
- in Ada.Containers.Vectors *note A.18.2(61/2): 7396.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3469.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 7473.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(31/2): 7620.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7783.
+ <in> Ada.Containers.Vectors *note A.18.2(61/2): 7396.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3469.
Last_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7888.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7888.
Last_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7889.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7889.
Last_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 7474.
- in Ada.Containers.Ordered_Maps *note A.18.6(32/2): 7621.
- in Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7784.
- in Ada.Containers.Vectors *note A.18.2(62/2): 7397.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 7474.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(32/2): 7621.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7784.
+ <in> Ada.Containers.Vectors *note A.18.2(62/2): 7397.
-Last_Index in Ada.Containers.Vectors *note A.18.2(60/2): 7395.
+Last_Index <in> Ada.Containers.Vectors *note A.18.2(60/2): 7395.
Last_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(33/2): 7622.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(33/2): 7622.
Length
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 7444.
- in Ada.Containers.Hashed_Maps *note A.18.5(10/2): 7537.
- in Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7678.
- in Ada.Containers.Ordered_Maps *note A.18.6(9/2): 7591.
- in Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7752.
- in Ada.Containers.Vectors *note A.18.2(21/2): 7349.
- in Ada.Strings.Bounded *note A.4.4(9): 6400.
- in Ada.Strings.Unbounded *note A.4.5(6): 6459.
- in Ada.Text_IO.Editing *note F.3.3(11): 8995.
- in Interfaces.COBOL *note B.4(34): 8265, *note B.4(39): 8269, *note
-B.4(44): 8273.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 7444.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(10/2): 7537.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7678.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(9/2): 7591.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7752.
+ <in> Ada.Containers.Vectors *note A.18.2(21/2): 7349.
+ <in> Ada.Strings.Bounded *note A.4.4(9): 6400.
+ <in> Ada.Strings.Unbounded *note A.4.5(6): 6459.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8995.
+ <in> Interfaces.COBOL *note B.4(34): 8265, *note B.4(39): 8269,
+*note B.4(44): 8273.
Less_Case_Insensitive
- child of Ada.Strings *note A.4.10(13/3): 6625.
- child of Ada.Strings.Bounded *note A.4.10(18/3): 6627.
- child of Ada.Strings.Fixed *note A.4.10(16/3): 6626.
- child of Ada.Strings.Unbounded *note A.4.10(21/3): 6628.
+ <child of> Ada.Strings *note A.4.10(13/3): 6625.
+ <child of> Ada.Strings.Bounded *note A.4.10(18/3): 6627.
+ <child of> Ada.Strings.Fixed *note A.4.10(16/3): 6626.
+ <child of> Ada.Strings.Unbounded *note A.4.10(21/3): 6628.
-Line in Ada.Text_IO *note A.10.1(38): 7024.
+Line <in> Ada.Text_IO *note A.10.1(38): 7024.
-Line_Length in Ada.Text_IO *note A.10.1(25): 6999.
+Line_Length <in> Ada.Text_IO *note A.10.1(25): 6999.
Log
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9038.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6682.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6682.
-Look_Ahead in Ada.Text_IO *note A.10.1(43): 7032.
+Look_Ahead <in> Ada.Text_IO *note A.10.1(43): 7032.
Members
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8762.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8762.
Merge
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 7487.
- in Ada.Containers.Vectors *note A.18.2(78/2): 7412.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 7487.
+ <in> Ada.Containers.Vectors *note A.18.2(78/2): 7412.
-Microseconds in Ada.Real_Time *note D.8(14/2): 8669.
+Microseconds <in> Ada.Real_Time *note D.8(14/2): 8669.
-Milliseconds in Ada.Real_Time *note D.8(14/2): 8670.
+Milliseconds <in> Ada.Real_Time *note D.8(14/2): 8670.
-Minute in Ada.Calendar.Formatting *note 9.6.1(25/2): 4570.
+Minute <in> Ada.Calendar.Formatting *note 9.6.1(25/2): 4570.
-Minutes in Ada.Real_Time *note D.8(14/2): 8672.
+Minutes <in> Ada.Real_Time *note D.8(14/2): 8672.
Mode
- in Ada.Direct_IO *note A.8.4(9): 6914.
- in Ada.Sequential_IO *note A.8.1(9): 6884.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7175.
- in Ada.Text_IO *note A.10.1(12): 6973.
+ <in> Ada.Direct_IO *note A.8.4(9): 6914.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6884.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7175.
+ <in> Ada.Text_IO *note A.10.1(12): 6973.
-Modification_Time in Ada.Directories *note A.16(27/2): 7259, *note
+Modification_Time <in> Ada.Directories *note A.16(27/2): 7259, *note
A.16(42/2): 7271.
Modulus
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9156,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9156,
*note G.3.2(30/2): 9169.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 9022.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 9022.
Month
- in Ada.Calendar *note 9.6(13): 4525.
- in Ada.Calendar.Formatting *note 9.6.1(22/2): 4567.
+ <in> Ada.Calendar *note 9.6(13): 4525.
+ <in> Ada.Calendar.Formatting *note 9.6.1(22/2): 4567.
-More_Entries in Ada.Directories *note A.16(34/2): 7265.
+More_Entries <in> Ada.Directories *note A.16(34/2): 7265.
Move
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 7456.
- in Ada.Containers.Hashed_Maps *note A.18.5(18/2): 7552.
- in Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7687.
- in Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7948.
- in Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7860.
- in Ada.Containers.Ordered_Maps *note A.18.6(17/2): 7606.
- in Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7761.
- in Ada.Containers.Vectors *note A.18.2(35/2): 7370.
- in Ada.Strings.Fixed *note A.4.3(7): 6357.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 7456.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(18/2): 7552.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7687.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7948.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7860.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(17/2): 7606.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7761.
+ <in> Ada.Containers.Vectors *note A.18.2(35/2): 7370.
+ <in> Ada.Strings.Fixed *note A.4.3(7): 6357.
Name
- in Ada.Direct_IO *note A.8.4(9): 6915.
- in Ada.Sequential_IO *note A.8.1(9): 6885.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7176.
- in Ada.Text_IO *note A.10.1(12): 6974.
+ <in> Ada.Direct_IO *note A.8.4(9): 6915.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6885.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7176.
+ <in> Ada.Text_IO *note A.10.1(12): 6974.
Name_Case_Equivalence
- in Ada.Directories *note A.16(20.2/3): 7253.
+ <in> Ada.Directories *note A.16(20.2/3): 7253.
-Nanoseconds in Ada.Real_Time *note D.8(14/2): 8668.
+Nanoseconds <in> Ada.Real_Time *note D.8(14/2): 8668.
New_Char_Array
- in Interfaces.C.Strings *note B.3.1(9): 8181.
+ <in> Interfaces.C.Strings *note B.3.1(9): 8181.
-New_Line in Ada.Text_IO *note A.10.1(28): 7004.
+New_Line <in> Ada.Text_IO *note A.10.1(28): 7004.
-New_Page in Ada.Text_IO *note A.10.1(31): 7010.
+New_Page <in> Ada.Text_IO *note A.10.1(31): 7010.
-New_String in Interfaces.C.Strings *note B.3.1(10): 8182.
+New_String <in> Interfaces.C.Strings *note B.3.1(10): 8182.
Next
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 7475,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 7475,
*note A.18.3(39/2): 7477.
- in Ada.Containers.Hashed_Maps *note A.18.5(28/2): 7562, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(28/2): 7562, *note
A.18.5(29/2): 7563.
- in Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7706, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7706, *note
A.18.8(42/2): 7707.
- in Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7623, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7623, *note
A.18.6(35/2): 7624.
- in Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7785, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7785, *note
A.18.9(46/2): 7786.
- in Ada.Containers.Vectors *note A.18.2(63/2): 7398, *note
+ <in> Ada.Containers.Vectors *note A.18.2(63/2): 7398, *note
A.18.2(64/2): 7399.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3467.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3467.
Next_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7890, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7890, *note
A.18.10(66/3): 7892.
Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7843.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7843.
Null_Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 8402.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 8402.
Number_Of_CPUs
- in System.Multiprocessors *note D.16(5/3): 8801.
+ <in> System.Multiprocessors *note D.16(5/3): 8801.
Open
- in Ada.Direct_IO *note A.8.4(7): 6909.
- in Ada.Sequential_IO *note A.8.1(7): 6879.
- in Ada.Streams.Stream_IO *note A.12.1(9): 7170.
- in Ada.Text_IO *note A.10.1(10): 6968.
+ <in> Ada.Direct_IO *note A.8.4(7): 6909.
+ <in> Ada.Sequential_IO *note A.8.1(7): 6879.
+ <in> Ada.Streams.Stream_IO *note A.12.1(9): 7170.
+ <in> Ada.Text_IO *note A.10.1(10): 6968.
Overlap
- in Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7703.
- in Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7779.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7703.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7779.
Overwrite
- in Ada.Strings.Bounded *note A.4.4(62): 6438, *note A.4.4(63):
+ <in> Ada.Strings.Bounded *note A.4.4(62): 6438, *note A.4.4(63):
6439.
- in Ada.Strings.Fixed *note A.4.3(27): 6379, *note A.4.3(28): 6380.
- in Ada.Strings.Unbounded *note A.4.5(57): 6495, *note A.4.5(58):
+ <in> Ada.Strings.Fixed *note A.4.3(27): 6379, *note A.4.3(28):
+6380.
+ <in> Ada.Strings.Unbounded *note A.4.5(57): 6495, *note A.4.5(58):
6496.
-Page in Ada.Text_IO *note A.10.1(39): 7025.
+Page <in> Ada.Text_IO *note A.10.1(39): 7025.
-Page_Length in Ada.Text_IO *note A.10.1(26): 7001.
+Page_Length <in> Ada.Text_IO *note A.10.1(26): 7001.
Parent
- in Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7885.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7885.
-Parent_Tag in Ada.Tags *note 3.9(7.2/2): 2257.
+Parent_Tag <in> Ada.Tags *note 3.9(7.2/2): 2257.
Peak_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 8031.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+8031.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
8015.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-8000.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 8000.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
8023.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-8008.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 8008.
-Pic_String in Ada.Text_IO.Editing *note F.3.3(7): 8986.
+Pic_String <in> Ada.Text_IO.Editing *note F.3.3(7): 8986.
Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(9/3): 5779.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(9/3): 5779.
Prepend
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 7460.
- in Ada.Containers.Vectors *note A.18.2(44/2): 7379, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 7460.
+ <in> Ada.Containers.Vectors *note A.18.2(44/2): 7379, *note
A.18.2(45/2): 7380.
Prepend_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7877.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7877.
Previous
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 7476,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 7476,
*note A.18.3(40/2): 7478.
- in Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7625, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7625, *note
A.18.6(37/2): 7626.
- in Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7787, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7787, *note
A.18.9(48/2): 7788.
- in Ada.Containers.Vectors *note A.18.2(65/2): 7400, *note
+ <in> Ada.Containers.Vectors *note A.18.2(65/2): 7400, *note
A.18.2(66/2): 7401.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3470.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3470.
Previous_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7891, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7891, *note
A.18.10(67/3): 7893.
Put
- in Ada.Text_IO *note A.10.1(42): 7030, *note A.10.1(48): 7040,
+ <in> Ada.Text_IO *note A.10.1(42): 7030, *note A.10.1(48): 7040,
*note A.10.1(55): 7055, *note A.10.1(60): 7062, *note A.10.1(66): 7071,
*note A.10.1(67): 7074, *note A.10.1(71): 7082, *note A.10.1(72): 7084,
*note A.10.1(76): 7091, *note A.10.1(77): 7094, *note A.10.1(82): 7100,
*note A.10.1(83): 7103.
- in Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 7129, *note
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 7129, *note
A.10.11(5/2): 7130.
- in Ada.Text_IO.Complex_IO *note G.1.3(7): 9072, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(7): 9072, *note G.1.3(8):
9074.
- in Ada.Text_IO.Editing *note F.3.3(14): 8998, *note F.3.3(15):
+ <in> Ada.Text_IO.Editing *note F.3.3(14): 8998, *note F.3.3(15):
8999, *note F.3.3(16): 9000.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 7139, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 7139, *note
A.10.12(5/2): 7140.
Put_Line
- in Ada.Text_IO *note A.10.1(50): 7046.
- in Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 7131, *note
+ <in> Ada.Text_IO *note A.10.1(50): 7046.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 7131, *note
A.10.11(7/2): 7132.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 7141, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 7141, *note
A.10.12(7/2): 7142.
Query_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 7449.
- in Ada.Containers.Hashed_Maps *note A.18.5(16/2): 7543.
- in Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7683.
- in Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7940.
- in Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7852.
- in Ada.Containers.Ordered_Maps *note A.18.6(15/2): 7597.
- in Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7757.
- in Ada.Containers.Vectors *note A.18.2(31/2): 7359, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 7449.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(16/2): 7543.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7683.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7940.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7852.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(15/2): 7597.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7757.
+ <in> Ada.Containers.Vectors *note A.18.2(31/2): 7359, *note
A.18.2(32/2): 7360.
-Raise_Exception in Ada.Exceptions *note 11.4.1(4/3): 4999.
+Raise_Exception <in> Ada.Exceptions *note 11.4.1(4/3): 4999.
Random
- in Ada.Numerics.Discrete_Random *note A.5.2(20): 6731.
- in Ada.Numerics.Float_Random *note A.5.2(8): 6719.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(20): 6731.
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6719.
Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9150,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9150,
*note G.3.2(27/2): 9163.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9013.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9013.
Read
- in Ada.Direct_IO *note A.8.4(12): 6919.
- in Ada.Sequential_IO *note A.8.1(12): 6889.
- in Ada.Storage_IO *note A.9(6): 6940.
- in Ada.Streams *note 13.13.1(5): 5865.
- in Ada.Streams.Stream_IO *note A.12.1(15): 7181, *note A.12.1(16):
-7182.
- in System.RPC *note E.5(7): 8954.
+ <in> Ada.Direct_IO *note A.8.4(12): 6919.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6889.
+ <in> Ada.Storage_IO *note A.9(6): 6940.
+ <in> Ada.Streams *note 13.13.1(5): 5865.
+ <in> Ada.Streams.Stream_IO *note A.12.1(15): 7181, *note
+A.12.1(16): 7182.
+ <in> System.RPC *note E.5(7): 8954.
Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 7453.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 7547, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 7453.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 7547, *note
A.18.5(17.6/3): 7549.
- in Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7945.
- in Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7857.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 7601, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7945.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7857.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 7601, *note
A.18.6(16.6/3): 7603.
- in Ada.Containers.Vectors *note A.18.2(34.4/3): 7365, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.4/3): 7365, *note
A.18.2(34.6/3): 7367.
- in Ada.Interrupts *note C.3.2(10): 8356.
- in Ada.Task_Attributes *note C.7.2(5): 8424.
+ <in> Ada.Interrupts *note C.3.2(10): 8356.
+ <in> Ada.Task_Attributes *note C.7.2(5): 8424.
Reference_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7724, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7724, *note
A.18.8(58.4/3): 7726.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7808, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7808, *note
A.18.9(73.4/3): 7810.
-Reinitialize in Ada.Task_Attributes *note C.7.2(6): 8426.
+Reinitialize <in> Ada.Task_Attributes *note C.7.2(6): 8426.
Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
7300.
Remove_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8759.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8759.
-Rename in Ada.Directories *note A.16(12/2): 7244.
+Rename <in> Ada.Directories *note A.16(12/2): 7244.
Replace
- in Ada.Containers.Hashed_Maps *note A.18.5(23/2): 7557.
- in Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7691, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(23/2): 7557.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7691, *note
A.18.8(53/2): 7717.
- in Ada.Containers.Ordered_Maps *note A.18.6(22/2): 7611.
- in Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7765, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(22/2): 7611.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7765, *note
A.18.9(66/2): 7799.
Replace_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 7448.
- in Ada.Containers.Hashed_Maps *note A.18.5(15/2): 7542.
- in Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7682.
- in Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7939.
- in Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7851.
- in Ada.Containers.Ordered_Maps *note A.18.6(14/2): 7596.
- in Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7756.
- in Ada.Containers.Vectors *note A.18.2(29/2): 7357, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 7448.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(15/2): 7542.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7682.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7939.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7851.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(14/2): 7596.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7756.
+ <in> Ada.Containers.Vectors *note A.18.2(29/2): 7357, *note
A.18.2(30/2): 7358.
- in Ada.Strings.Bounded *note A.4.4(27): 6413.
- in Ada.Strings.Unbounded *note A.4.5(21): 6470.
+ <in> Ada.Strings.Bounded *note A.4.4(27): 6413.
+ <in> Ada.Strings.Unbounded *note A.4.5(21): 6470.
Replace_Slice
- in Ada.Strings.Bounded *note A.4.4(58): 6434, *note A.4.4(59):
+ <in> Ada.Strings.Bounded *note A.4.4(58): 6434, *note A.4.4(59):
6435.
- in Ada.Strings.Fixed *note A.4.3(23): 6375, *note A.4.3(24): 6376.
- in Ada.Strings.Unbounded *note A.4.5(53): 6491, *note A.4.5(54):
+ <in> Ada.Strings.Fixed *note A.4.3(23): 6375, *note A.4.3(24):
+6376.
+ <in> Ada.Strings.Unbounded *note A.4.5(53): 6491, *note A.4.5(54):
6492.
Replenish
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8763.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8763.
-Replicate in Ada.Strings.Bounded *note A.4.4(78): 6450, *note
+Replicate <in> Ada.Strings.Bounded *note A.4.4(78): 6450, *note
A.4.4(79): 6451, *note A.4.4(80): 6452.
-Reraise_Occurrence in Ada.Exceptions *note 11.4.1(4/3): 5001.
+Reraise_Occurrence <in> Ada.Exceptions *note 11.4.1(4/3): 5001.
Reserve_Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(9/2): 7536.
- in Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7677.
- in Ada.Containers.Vectors *note A.18.2(20/2): 7348.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(9/2): 7536.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7677.
+ <in> Ada.Containers.Vectors *note A.18.2(20/2): 7348.
Reset
- in Ada.Direct_IO *note A.8.4(8): 6913.
- in Ada.Numerics.Discrete_Random *note A.5.2(21): 6733, *note
+ <in> Ada.Direct_IO *note A.8.4(8): 6913.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(21): 6733, *note
A.5.2(24): 6736.
- in Ada.Numerics.Float_Random *note A.5.2(9): 6720, *note A.5.2(12):
-6724.
- in Ada.Sequential_IO *note A.8.1(8): 6883.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7173.
- in Ada.Text_IO *note A.10.1(11): 6972.
+ <in> Ada.Numerics.Float_Random *note A.5.2(9): 6720, *note
+A.5.2(12): 6724.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6883.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7173.
+ <in> Ada.Text_IO *note A.10.1(11): 6972.
Reverse_Elements
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 7465.
- in Ada.Containers.Vectors *note A.18.2(54/2): 7389.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 7465.
+ <in> Ada.Containers.Vectors *note A.18.2(54/2): 7389.
Reverse_Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 7480.
- in Ada.Containers.Vectors *note A.18.2(70/2): 7405.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 7480.
+ <in> Ada.Containers.Vectors *note A.18.2(70/2): 7405.
Reverse_Find_Index
- in Ada.Containers.Vectors *note A.18.2(69/2): 7404.
+ <in> Ada.Containers.Vectors *note A.18.2(69/2): 7404.
Reverse_Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 7483.
- in Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7633.
- in Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7794.
- in Ada.Containers.Vectors *note A.18.2(74/2): 7408.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 7483.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7633.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7794.
+ <in> Ada.Containers.Vectors *note A.18.2(74/2): 7408.
Reverse_Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7895.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7895.
-Root in Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7848.
+Root <in> Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7848.
Save
- in Ada.Numerics.Discrete_Random *note A.5.2(24): 6735.
- in Ada.Numerics.Float_Random *note A.5.2(12): 6723.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(24): 6735.
+ <in> Ada.Numerics.Float_Random *note A.5.2(12): 6723.
-Save_Occurrence in Ada.Exceptions *note 11.4.1(6/2): 5008.
+Save_Occurrence <in> Ada.Exceptions *note 11.4.1(6/2): 5008.
-Second in Ada.Calendar.Formatting *note 9.6.1(26/2): 4571.
+Second <in> Ada.Calendar.Formatting *note 9.6.1(26/2): 4571.
Seconds
- in Ada.Calendar *note 9.6(13): 4527.
- in Ada.Real_Time *note D.8(14/2): 8671.
+ <in> Ada.Calendar *note 9.6(13): 4527.
+ <in> Ada.Real_Time *note D.8(14/2): 8671.
-Seconds_Of in Ada.Calendar.Formatting *note 9.6.1(28/2): 4573.
+Seconds_Of <in> Ada.Calendar.Formatting *note 9.6.1(28/2): 4573.
-Set in Ada.Environment_Variables *note A.17(6/2): 7308.
+Set <in> Ada.Environment_Variables *note A.17(6/2): 7308.
Set_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(12.1/2): 6403.
+ <in> Ada.Strings.Bounded *note A.4.4(12.1/2): 6403.
-Set_Col in Ada.Text_IO *note A.10.1(35): 7018.
+Set_Col <in> Ada.Text_IO *note A.10.1(35): 7018.
Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
8817.
-Set_Deadline in Ada.Dispatching.EDF *note D.2.6(9/2): 8526.
+Set_Deadline <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8526.
Set_Dependents_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 8436.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 8436.
-Set_Directory in Ada.Directories *note A.16(6/2): 7238.
+Set_Directory <in> Ada.Directories *note A.16(6/2): 7238.
-Set_Error in Ada.Text_IO *note A.10.1(15): 6979.
+Set_Error <in> Ada.Text_IO *note A.10.1(15): 6979.
-Set_Exit_Status in Ada.Command_Line *note A.15(9): 7233.
+Set_Exit_Status <in> Ada.Command_Line *note A.15(9): 7233.
Set_False
- in Ada.Synchronous_Task_Control *note D.10(4): 8690.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8690.
Set_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8767.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8742.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8787.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8767.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8742.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8787.
Set_Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9153,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9153,
*note G.3.2(28/2): 9166.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9017.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9017.
Set_Index
- in Ada.Direct_IO *note A.8.4(14): 6923.
- in Ada.Streams.Stream_IO *note A.12.1(22): 7185.
+ <in> Ada.Direct_IO *note A.8.4(14): 6923.
+ <in> Ada.Streams.Stream_IO *note A.12.1(22): 7185.
-Set_Input in Ada.Text_IO *note A.10.1(15): 6977.
+Set_Input <in> Ada.Text_IO *note A.10.1(15): 6977.
-Set_Length in Ada.Containers.Vectors *note A.18.2(22/2): 7350.
+Set_Length <in> Ada.Containers.Vectors *note A.18.2(22/2): 7350.
-Set_Line in Ada.Text_IO *note A.10.1(36): 7020.
+Set_Line <in> Ada.Text_IO *note A.10.1(36): 7020.
-Set_Line_Length in Ada.Text_IO *note A.10.1(23): 6995.
+Set_Line_Length <in> Ada.Text_IO *note A.10.1(23): 6995.
-Set_Mode in Ada.Streams.Stream_IO *note A.12.1(24): 7188.
+Set_Mode <in> Ada.Streams.Stream_IO *note A.12.1(24): 7188.
-Set_Output in Ada.Text_IO *note A.10.1(15): 6978.
+Set_Output <in> Ada.Text_IO *note A.10.1(15): 6978.
-Set_Page_Length in Ada.Text_IO *note A.10.1(24): 6998.
+Set_Page_Length <in> Ada.Text_IO *note A.10.1(24): 6998.
Set_Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(10/3): 5780.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(10/3): 5780.
Set_Priority
- in Ada.Dynamic_Priorities *note D.5.1(4): 8572.
+ <in> Ada.Dynamic_Priorities *note D.5.1(4): 8572.
Set_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8516.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8516.
Set_Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9152,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9152,
*note G.3.2(28/2): 9165.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9016.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9016.
Set_Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 8438.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 8438.
Set_True
- in Ada.Synchronous_Task_Control *note D.10(4): 8689.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8689.
Set_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(11.1/2): 6465.
+ <in> Ada.Strings.Unbounded *note A.4.5(11.1/2): 6465.
-Set_Value in Ada.Task_Attributes *note C.7.2(6): 8425.
+Set_Value <in> Ada.Task_Attributes *note C.7.2(6): 8425.
Simple_Name
- in Ada.Directories *note A.16(16/2): 7247, *note A.16(38/2): 7267.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
+ <in> Ada.Directories *note A.16(16/2): 7247, *note A.16(38/2):
+7267.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
7297.
Sin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9041.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6685.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6685.
Sinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9049.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6700.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6700.
Size
- in Ada.Direct_IO *note A.8.4(15): 6925.
- in Ada.Directories *note A.16(26/2): 7258, *note A.16(41/2): 7270.
- in Ada.Streams.Stream_IO *note A.12.1(23): 7187.
+ <in> Ada.Direct_IO *note A.8.4(15): 6925.
+ <in> Ada.Directories *note A.16(26/2): 7258, *note A.16(41/2):
+7270.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 7187.
-Skip_Line in Ada.Text_IO *note A.10.1(29): 7006.
+Skip_Line <in> Ada.Text_IO *note A.10.1(29): 7006.
-Skip_Page in Ada.Text_IO *note A.10.1(32): 7012.
+Skip_Page <in> Ada.Text_IO *note A.10.1(32): 7012.
Slice
- in Ada.Strings.Bounded *note A.4.4(28): 6414.
- in Ada.Strings.Unbounded *note A.4.5(22): 6471.
+ <in> Ada.Strings.Bounded *note A.4.4(28): 6414.
+ <in> Ada.Strings.Unbounded *note A.4.5(22): 6471.
Solve
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9176.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9136.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9176.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9136.
Sort
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 7486.
- in Ada.Containers.Vectors *note A.18.2(77/2): 7411.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 7486.
+ <in> Ada.Containers.Vectors *note A.18.2(77/2): 7411.
Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 8439.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 8439.
Splice
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 7468,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 7468,
*note A.18.3(31/2): 7469, *note A.18.3(32/2): 7470.
Splice_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7883, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7883, *note
A.18.10(58/3): 7884.
Splice_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7881, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7881, *note
A.18.10(56/3): 7882.
Split
- in Ada.Calendar *note 9.6(14): 4528.
- in Ada.Calendar.Formatting *note 9.6.1(29/2): 4574, *note
+ <in> Ada.Calendar *note 9.6(14): 4528.
+ <in> Ada.Calendar.Formatting *note 9.6.1(29/2): 4574, *note
9.6.1(32/2): 4577, *note 9.6.1(33/2): 4578, *note 9.6.1(34/2): 4579.
- in Ada.Execution_Time *note D.14(8/2): 8726.
- in Ada.Real_Time *note D.8(16): 8674.
+ <in> Ada.Execution_Time *note D.14(8/2): 8726.
+ <in> Ada.Real_Time *note D.8(16): 8674.
Sqrt
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9037.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6680.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6680.
-Standard_Error in Ada.Text_IO *note A.10.1(16): 6982, *note
+Standard_Error <in> Ada.Text_IO *note A.10.1(16): 6982, *note
A.10.1(19): 6989.
-Standard_Input in Ada.Text_IO *note A.10.1(16): 6980, *note
+Standard_Input <in> Ada.Text_IO *note A.10.1(16): 6980, *note
A.10.1(19): 6987.
-Standard_Output in Ada.Text_IO *note A.10.1(16): 6981, *note
+Standard_Output <in> Ada.Text_IO *note A.10.1(16): 6981, *note
A.10.1(19): 6988.
-Start_Search in Ada.Directories *note A.16(32/2): 7263.
+Start_Search <in> Ada.Directories *note A.16(32/2): 7263.
Storage_Size
- in System.Storage_Pools *note 13.11(9): 5699.
- in System.Storage_Pools.Subpools *note 13.11.4(16/3): 5786.
+ <in> System.Storage_Pools *note 13.11(9): 5699.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(16/3): 5786.
Stream
- in Ada.Streams.Stream_IO *note A.12.1(13): 7180.
- in Ada.Text_IO.Text_Streams *note A.12.2(4): 7205.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 7208.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 7211.
+ <in> Ada.Streams.Stream_IO *note A.12.1(13): 7180.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(4): 7205.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 7208.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 7211.
-Strlen in Interfaces.C.Strings *note B.3.1(17): 8189.
+Strlen <in> Interfaces.C.Strings *note B.3.1(17): 8189.
-Sub_Second in Ada.Calendar.Formatting *note 9.6.1(27/2): 4572.
+Sub_Second <in> Ada.Calendar.Formatting *note 9.6.1(27/2): 4572.
Subtree_Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7844.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7844.
Supported
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8782.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8782.
Suspend_Until_True
- in Ada.Synchronous_Task_Control *note D.10(4): 8692.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8692.
Suspend_Until_True_And_Set_Deadline
- in Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 8694.
+ <in> Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 8694.
Swap
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 7466.
- in Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7863.
- in Ada.Containers.Vectors *note A.18.2(55/2): 7390, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 7466.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7863.
+ <in> Ada.Containers.Vectors *note A.18.2(55/2): 7390, *note
A.18.2(56/2): 7391.
Swap_Links
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 7467.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 7467.
Symmetric_Difference
- in Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7701, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7701, *note
A.18.8(36/2): 7702.
- in Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7777, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7777, *note
A.18.9(37/2): 7778.
Tail
- in Ada.Strings.Bounded *note A.4.4(72): 6448, *note A.4.4(73):
+ <in> Ada.Strings.Bounded *note A.4.4(72): 6448, *note A.4.4(73):
6449.
- in Ada.Strings.Fixed *note A.4.3(37): 6389, *note A.4.3(38): 6390.
- in Ada.Strings.Unbounded *note A.4.5(67): 6505, *note A.4.5(68):
+ <in> Ada.Strings.Fixed *note A.4.3(37): 6389, *note A.4.3(38):
+6390.
+ <in> Ada.Strings.Unbounded *note A.4.5(67): 6505, *note A.4.5(68):
6506.
Tan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9043.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6688.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6688.
Tanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9051.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6702.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6702.
Time_Of
- in Ada.Calendar *note 9.6(15): 4529.
- in Ada.Calendar.Formatting *note 9.6.1(30/2): 4575, *note
+ <in> Ada.Calendar *note 9.6(15): 4529.
+ <in> Ada.Calendar.Formatting *note 9.6.1(30/2): 4575, *note
9.6.1(31/2): 4576.
- in Ada.Execution_Time *note D.14(9/2): 8727.
- in Ada.Real_Time *note D.8(16): 8675.
+ <in> Ada.Execution_Time *note D.14(9/2): 8727.
+ <in> Ada.Real_Time *note D.8(16): 8675.
Time_Of_Event
- in Ada.Real_Time.Timing_Events *note D.15(6/2): 8791.
+ <in> Ada.Real_Time.Timing_Events *note D.15(6/2): 8791.
Time_Remaining
- in Ada.Execution_Time.Timers *note D.14.1(8/2): 8745.
+ <in> Ada.Execution_Time.Timers *note D.14.1(8/2): 8745.
To_Ada
- in Interfaces.C *note B.3(22): 8128, *note B.3(26): 8132, *note
+ <in> Interfaces.C *note B.3(22): 8128, *note B.3(26): 8132, *note
B.3(28): 8134, *note B.3(32): 8138, *note B.3(37): 8142, *note B.3(39):
8144, *note B.3(39.10/2): 8154, *note B.3(39.13/2): 8158, *note
B.3(39.17/2): 8162, *note B.3(39.19/2): 8164, *note B.3(39.4/2): 8148,
*note B.3(39.8/2): 8152.
- in Interfaces.COBOL *note B.4(17): 8243, *note B.4(19): 8245.
- in Interfaces.Fortran *note B.5(13): 8296, *note B.5(14): 8298,
+ <in> Interfaces.COBOL *note B.4(17): 8243, *note B.4(19): 8245.
+ <in> Interfaces.Fortran *note B.5(13): 8296, *note B.5(14): 8298,
*note B.5(16): 8300.
To_Address
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5647.
- in System.Storage_Elements *note 13.7.1(10/3): 5639.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5647.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5639.
-To_Basic in Ada.Characters.Handling *note A.3.2(6): 6020, *note
+To_Basic <in> Ada.Characters.Handling *note A.3.2(6): 6020, *note
A.3.2(7): 6023.
-To_Binary in Interfaces.COBOL *note B.4(45): 8275, *note B.4(48):
+To_Binary <in> Interfaces.COBOL *note B.4(45): 8275, *note B.4(48):
8278.
To_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(11): 6401.
+ <in> Ada.Strings.Bounded *note A.4.4(11): 6401.
-To_C in Interfaces.C *note B.3(21): 8127, *note B.3(25): 8131, *note
+To_C <in> Interfaces.C *note B.3(21): 8127, *note B.3(25): 8131, *note
B.3(27): 8133, *note B.3(32): 8137, *note B.3(36): 8141, *note B.3(38):
8143, *note B.3(39.13/2): 8157, *note B.3(39.16/2): 8161, *note
B.3(39.18/2): 8163, *note B.3(39.4/2): 8147, *note B.3(39.7/2): 8151,
*note B.3(39.9/2): 8153.
To_Character
- in Ada.Characters.Conversions *note A.3.4(5/2): 6287.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 6287.
-To_Chars_Ptr in Interfaces.C.Strings *note B.3.1(8): 8180.
+To_Chars_Ptr <in> Interfaces.C.Strings *note B.3.1(8): 8180.
-To_COBOL in Interfaces.COBOL *note B.4(17): 8242, *note B.4(18): 8244.
+To_COBOL <in> Interfaces.COBOL *note B.4(17): 8242, *note B.4(18):
+8244.
-To_Cursor in Ada.Containers.Vectors *note A.18.2(25/2): 7353.
+To_Cursor <in> Ada.Containers.Vectors *note A.18.2(25/2): 7353.
-To_Decimal in Interfaces.COBOL *note B.4(35): 8266, *note B.4(40):
+To_Decimal <in> Interfaces.COBOL *note B.4(35): 8266, *note B.4(40):
8270, *note B.4(44): 8274, *note B.4(47): 8276.
-To_Display in Interfaces.COBOL *note B.4(36): 8267.
+To_Display <in> Interfaces.COBOL *note B.4(36): 8267.
To_Domain
- in Ada.Strings.Maps *note A.4.2(24): 6349.
- in Ada.Strings.Wide_Maps *note A.4.7(24): 6561.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6603.
+ <in> Ada.Strings.Maps *note A.4.2(24): 6349.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(24): 6561.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6603.
-To_Duration in Ada.Real_Time *note D.8(13): 8666.
+To_Duration <in> Ada.Real_Time *note D.8(13): 8666.
-To_Fortran in Interfaces.Fortran *note B.5(13): 8295, *note B.5(14):
+To_Fortran <in> Interfaces.Fortran *note B.5(13): 8295, *note B.5(14):
8297, *note B.5(15): 8299.
To_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7935.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7935.
-To_Index in Ada.Containers.Vectors *note A.18.2(26/2): 7354.
+To_Index <in> Ada.Containers.Vectors *note A.18.2(26/2): 7354.
-To_Integer in System.Storage_Elements *note 13.7.1(10/3): 5640.
+To_Integer <in> System.Storage_Elements *note 13.7.1(10/3): 5640.
-To_ISO_646 in Ada.Characters.Handling *note A.3.2(11): 6027, *note
+To_ISO_646 <in> Ada.Characters.Handling *note A.3.2(11): 6027, *note
A.3.2(12): 6028.
-To_Long_Binary in Interfaces.COBOL *note B.4(48): 8279.
+To_Long_Binary <in> Interfaces.COBOL *note B.4(48): 8279.
To_Lower
- in Ada.Characters.Handling *note A.3.2(6): 6018, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 6018, *note A.3.2(7):
6021.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 6309, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 6309, *note
A.3.5(21/3): 6311.
To_Mapping
- in Ada.Strings.Maps *note A.4.2(23): 6348.
- in Ada.Strings.Wide_Maps *note A.4.7(23): 6560.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6602.
+ <in> Ada.Strings.Maps *note A.4.2(23): 6348.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(23): 6560.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6602.
-To_Packed in Interfaces.COBOL *note B.4(41): 8271.
+To_Packed <in> Interfaces.COBOL *note B.4(41): 8271.
-To_Picture in Ada.Text_IO.Editing *note F.3.3(6): 8985.
+To_Picture <in> Ada.Text_IO.Editing *note F.3.3(6): 8985.
To_Pointer
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5646.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5646.
To_Range
- in Ada.Strings.Maps *note A.4.2(24): 6350.
- in Ada.Strings.Wide_Maps *note A.4.7(25): 6562.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6604.
+ <in> Ada.Strings.Maps *note A.4.2(24): 6350.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(25): 6562.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6604.
To_Ranges
- in Ada.Strings.Maps *note A.4.2(10): 6338.
- in Ada.Strings.Wide_Maps *note A.4.7(10): 6550.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6592.
+ <in> Ada.Strings.Maps *note A.4.2(10): 6338.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(10): 6550.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6592.
To_Sequence
- in Ada.Strings.Maps *note A.4.2(19): 6344.
- in Ada.Strings.Wide_Maps *note A.4.7(19): 6556.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6598.
+ <in> Ada.Strings.Maps *note A.4.2(19): 6344.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(19): 6556.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6598.
To_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7675.
- in Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7751.
- in Ada.Strings.Maps *note A.4.2(8): 6336, *note A.4.2(9): 6337,
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7675.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7751.
+ <in> Ada.Strings.Maps *note A.4.2(8): 6336, *note A.4.2(9): 6337,
*note A.4.2(17): 6342, *note A.4.2(18): 6343.
- in Ada.Strings.Wide_Maps *note A.4.7(8): 6548, *note A.4.7(9):
+ <in> Ada.Strings.Wide_Maps *note A.4.7(8): 6548, *note A.4.7(9):
6549, *note A.4.7(17): 6554, *note A.4.7(18): 6555.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6590, *note
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6590, *note
A.4.8(9/2): 6591, *note A.4.8(17/2): 6596, *note A.4.8(18/2): 6597.
To_String
- in Ada.Characters.Conversions *note A.3.4(5/2): 6286.
- in Ada.Strings.Bounded *note A.4.4(12): 6402.
- in Ada.Strings.Unbounded *note A.4.5(11): 6464.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 6286.
+ <in> Ada.Strings.Bounded *note A.4.4(12): 6402.
+ <in> Ada.Strings.Unbounded *note A.4.5(11): 6464.
-To_Time_Span in Ada.Real_Time *note D.8(13): 8667.
+To_Time_Span <in> Ada.Real_Time *note D.8(13): 8667.
To_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(9): 6462, *note A.4.5(10):
+ <in> Ada.Strings.Unbounded *note A.4.5(9): 6462, *note A.4.5(10):
6463.
To_Upper
- in Ada.Characters.Handling *note A.3.2(6): 6019, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 6019, *note A.3.2(7):
6022.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 6310, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 6310, *note
A.3.5(21/3): 6312.
-To_Vector in Ada.Containers.Vectors *note A.18.2(13/2): 7345, *note
+To_Vector <in> Ada.Containers.Vectors *note A.18.2(13/2): 7345, *note
A.18.2(14/2): 7346.
To_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 6279, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6279, *note
A.3.4(5/2): 6289.
To_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 6280, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6280, *note
A.3.4(5/2): 6290.
To_Wide_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 6283.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6283.
To_Wide_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 6284.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6284.
Translate
- in Ada.Strings.Bounded *note A.4.4(53): 6430, *note A.4.4(54):
+ <in> Ada.Strings.Bounded *note A.4.4(53): 6430, *note A.4.4(54):
6431, *note A.4.4(55): 6432, *note A.4.4(56): 6433.
- in Ada.Strings.Fixed *note A.4.3(18): 6371, *note A.4.3(19): 6372,
-*note A.4.3(20): 6373, *note A.4.3(21): 6374.
- in Ada.Strings.Unbounded *note A.4.5(48): 6487, *note A.4.5(49):
+ <in> Ada.Strings.Fixed *note A.4.3(18): 6371, *note A.4.3(19):
+6372, *note A.4.3(20): 6373, *note A.4.3(21): 6374.
+ <in> Ada.Strings.Unbounded *note A.4.5(48): 6487, *note A.4.5(49):
6488, *note A.4.5(50): 6489, *note A.4.5(51): 6490.
Transpose
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 9175.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 9134.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 9175.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 9134.
Trim
- in Ada.Strings.Bounded *note A.4.4(67): 6442, *note A.4.4(68):
+ <in> Ada.Strings.Bounded *note A.4.4(67): 6442, *note A.4.4(68):
6444, *note A.4.4(69): 6445.
- in Ada.Strings.Fixed *note A.4.3(31): 6383, *note A.4.3(32): 6384,
-*note A.4.3(33): 6385, *note A.4.3(34): 6386.
- in Ada.Strings.Unbounded *note A.4.5(61): 6499, *note A.4.5(62):
+ <in> Ada.Strings.Fixed *note A.4.3(31): 6383, *note A.4.3(32):
+6384, *note A.4.3(33): 6385, *note A.4.3(34): 6386.
+ <in> Ada.Strings.Unbounded *note A.4.5(61): 6499, *note A.4.5(62):
6500, *note A.4.5(63): 6501, *note A.4.5(64): 6502.
Unbounded_Slice
- in Ada.Strings.Unbounded *note A.4.5(22.1/2): 6472, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(22.1/2): 6472, *note
A.4.5(22.2/2): 6473.
Unchecked_Conversion
- child of Ada *note 13.9(3/3): 5663.
+ <child of> Ada *note 13.9(3/3): 5663.
Unchecked_Deallocation
- child of Ada *note 13.11.2(3/3): 5742.
+ <child of> Ada *note 13.11.2(3/3): 5742.
Union
- in Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7695, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7695, *note
A.18.8(27/2): 7696.
- in Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7771, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7771, *note
A.18.9(28/2): 7772.
Unit_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 9182.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 9141.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 9182.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 9141.
Unit_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 9162.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 9133.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 9162.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 9133.
-Update in Interfaces.C.Strings *note B.3.1(18): 8190, *note B.3.1(19):
-8191.
+Update <in> Interfaces.C.Strings *note B.3.1(18): 8190, *note
+B.3.1(19): 8191.
Update_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 7450.
- in Ada.Containers.Hashed_Maps *note A.18.5(17/2): 7544.
- in Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7941.
- in Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7853.
- in Ada.Containers.Ordered_Maps *note A.18.6(16/2): 7598.
- in Ada.Containers.Vectors *note A.18.2(33/2): 7361, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 7450.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17/2): 7544.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7941.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7853.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16/2): 7598.
+ <in> Ada.Containers.Vectors *note A.18.2(33/2): 7361, *note
A.18.2(34/2): 7362.
Update_Element_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7722.
- in Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7806.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7722.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7806.
-Update_Error in Interfaces.C.Strings *note B.3.1(20): 8192.
+Update_Error <in> Interfaces.C.Strings *note B.3.1(20): 8192.
UTC_Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4547.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4547.
Valid
- in Ada.Text_IO.Editing *note F.3.3(5): 8984, *note F.3.3(12): 8996.
- in Interfaces.COBOL *note B.4(33): 8264, *note B.4(38): 8268, *note
-B.4(43): 8272.
+ <in> Ada.Text_IO.Editing *note F.3.3(5): 8984, *note F.3.3(12):
+8996.
+ <in> Interfaces.COBOL *note B.4(33): 8264, *note B.4(38): 8268,
+*note B.4(43): 8272.
Value
- in Ada.Calendar.Formatting *note 9.6.1(36/2): 4581, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(36/2): 4581, *note
9.6.1(38/2): 4583.
- in Ada.Environment_Variables *note A.17(4.1/3): 7306, *note
+ <in> Ada.Environment_Variables *note A.17(4.1/3): 7306, *note
A.17(4/2): 7305.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6739.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6727.
- in Ada.Strings.Maps *note A.4.2(21): 6346.
- in Ada.Strings.Wide_Maps *note A.4.7(21): 6558.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6600.
- in Ada.Task_Attributes *note C.7.2(4): 8423.
- in Interfaces.C.Pointers *note B.3.2(6): 8201, *note B.3.2(7):
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6739.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6727.
+ <in> Ada.Strings.Maps *note A.4.2(21): 6346.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(21): 6558.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6600.
+ <in> Ada.Task_Attributes *note C.7.2(4): 8423.
+ <in> Interfaces.C.Pointers *note B.3.2(6): 8201, *note B.3.2(7):
8202.
- in Interfaces.C.Strings *note B.3.1(13): 8185, *note B.3.1(14):
+ <in> Interfaces.C.Strings *note B.3.1(13): 8185, *note B.3.1(14):
8186, *note B.3.1(15): 8187, *note B.3.1(16): 8188.
Virtual_Length
- in Interfaces.C.Pointers *note B.3.2(13): 8206.
+ <in> Interfaces.C.Pointers *note B.3.2(13): 8206.
Wait_For_Release
- in Ada.Synchronous_Barriers *note D.10.1(6/3): 8703.
+ <in> Ada.Synchronous_Barriers *note D.10.1(6/3): 8703.
Wide_Equal_Case_Insensitive
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6536.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6535.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6537.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6536.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6535.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6537.
Wide_Hash
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6532.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6531.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6533.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6532.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6531.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6533.
Wide_Hash_Case_Insensitive
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6540.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6539.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6541.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6540.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6539.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6541.
-Wide_Exception_Name in Ada.Exceptions *note 11.4.1(2/2): 4994, *note
+Wide_Exception_Name <in> Ada.Exceptions *note 11.4.1(2/2): 4994, *note
11.4.1(5/2): 5004.
-Wide_Expanded_Name in Ada.Tags *note 3.9(7/2): 2251.
+Wide_Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2251.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6578.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6577.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6579.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6578.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6577.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6579.
Wide_Wide_Hash
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6574.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6573.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6575.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6574.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6573.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6575.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6582.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6581.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6583.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6582.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6581.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6583.
Wide_Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4995, *note 11.4.1(5/2): 5005.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4995, *note 11.4.1(5/2):
+5005.
-Wide_Wide_Expanded_Name in Ada.Tags *note 3.9(7/2): 2252.
+Wide_Wide_Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2252.
Write
- in Ada.Direct_IO *note A.8.4(13): 6921.
- in Ada.Sequential_IO *note A.8.1(12): 6890.
- in Ada.Storage_IO *note A.9(7): 6941.
- in Ada.Streams *note 13.13.1(6): 5866.
- in Ada.Streams.Stream_IO *note A.12.1(18): 7183, *note A.12.1(19):
-7184.
- in System.RPC *note E.5(8): 8955.
+ <in> Ada.Direct_IO *note A.8.4(13): 6921.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6890.
+ <in> Ada.Storage_IO *note A.9(7): 6941.
+ <in> Ada.Streams *note 13.13.1(6): 5866.
+ <in> Ada.Streams.Stream_IO *note A.12.1(18): 7183, *note
+A.12.1(19): 7184.
+ <in> System.RPC *note E.5(8): 8955.
Year
- in Ada.Calendar *note 9.6(13): 4524.
- in Ada.Calendar.Formatting *note 9.6.1(21/2): 4566.
+ <in> Ada.Calendar *note 9.6(13): 4524.
+ <in> Ada.Calendar.Formatting *note 9.6.1(21/2): 4566.
-Yield in Ada.Dispatching *note D.2.1(1.3/3): 8467.
+Yield <in> Ada.Dispatching *note D.2.1(1.3/3): 8467.
Yield_To_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8506.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8506.
Yield_To_Same_Or_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8507.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8507.
File: aarm2012.info, Node: Q.4, Next: Q.5, Prev: Q.3, Up: Annex Q
@@ -131342,141 +131827,141 @@ Q.4 Language-Defined Exceptions
===============================
1/3
-{AI95-00440-01AI95-00440-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00440-01AI95-00440-01>} {<AI05-0299-1AI05-0299-1>} This subclause
lists all language-defined exceptions.
Argument_Error
- in Ada.Numerics *note A.5(3/2): 6674.
+ <in> Ada.Numerics *note A.5(3/2): 6674.
Assertion_Error
- in Ada.Assertions *note 11.4.2(13/2): 5035.
+ <in> Ada.Assertions *note 11.4.2(13/2): 5035.
Capacity_Error
- in Ada.Containers *note A.18.1(5.1/3): 7328.
+ <in> Ada.Containers *note A.18.1(5.1/3): 7328.
Communication_Error
- in System.RPC *note E.5(5): 8952.
+ <in> System.RPC *note E.5(5): 8952.
Constraint_Error
- in Standard *note A.1(46): 5987.
+ <in> Standard *note A.1(46): 5987.
Conversion_Error
- in Interfaces.COBOL *note B.4(30): 8262.
+ <in> Interfaces.COBOL *note B.4(30): 8262.
Data_Error
- in Ada.Direct_IO *note A.8.4(18): 6933.
- in Ada.IO_Exceptions *note A.13(4): 7220.
- in Ada.Sequential_IO *note A.8.1(15): 6898.
- in Ada.Storage_IO *note A.9(9): 6942.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7196.
- in Ada.Text_IO *note A.10.1(85): 7110.
+ <in> Ada.Direct_IO *note A.8.4(18): 6933.
+ <in> Ada.IO_Exceptions *note A.13(4): 7220.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6898.
+ <in> Ada.Storage_IO *note A.9(9): 6942.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7196.
+ <in> Ada.Text_IO *note A.10.1(85): 7110.
Device_Error
- in Ada.Direct_IO *note A.8.4(18): 6931.
- in Ada.Directories *note A.16(43/2): 7275.
- in Ada.IO_Exceptions *note A.13(4): 7218.
- in Ada.Sequential_IO *note A.8.1(15): 6896.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7194.
- in Ada.Text_IO *note A.10.1(85): 7108.
+ <in> Ada.Direct_IO *note A.8.4(18): 6931.
+ <in> Ada.Directories *note A.16(43/2): 7275.
+ <in> Ada.IO_Exceptions *note A.13(4): 7218.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6896.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7194.
+ <in> Ada.Text_IO *note A.10.1(85): 7108.
Dispatching_Domain_Error
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
8806.
Dispatching_Policy_Error
- in Ada.Dispatching *note D.2.1(1.4/3): 8468.
+ <in> Ada.Dispatching *note D.2.1(1.4/3): 8468.
Encoding_Error
- in Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6635.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6635.
End_Error
- in Ada.Direct_IO *note A.8.4(18): 6932.
- in Ada.IO_Exceptions *note A.13(4): 7219.
- in Ada.Sequential_IO *note A.8.1(15): 6897.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7195.
- in Ada.Text_IO *note A.10.1(85): 7109.
+ <in> Ada.Direct_IO *note A.8.4(18): 6932.
+ <in> Ada.IO_Exceptions *note A.13(4): 7219.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6897.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7195.
+ <in> Ada.Text_IO *note A.10.1(85): 7109.
Group_Budget_Error
- in Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8770.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8770.
Index_Error
- in Ada.Strings *note A.4.1(5): 6323.
+ <in> Ada.Strings *note A.4.1(5): 6323.
Layout_Error
- in Ada.IO_Exceptions *note A.13(4): 7221.
- in Ada.Text_IO *note A.10.1(85): 7111.
+ <in> Ada.IO_Exceptions *note A.13(4): 7221.
+ <in> Ada.Text_IO *note A.10.1(85): 7111.
Length_Error
- in Ada.Strings *note A.4.1(5): 6321.
+ <in> Ada.Strings *note A.4.1(5): 6321.
Mode_Error
- in Ada.Direct_IO *note A.8.4(18): 6928.
- in Ada.IO_Exceptions *note A.13(4): 7215.
- in Ada.Sequential_IO *note A.8.1(15): 6893.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7191.
- in Ada.Text_IO *note A.10.1(85): 7105.
+ <in> Ada.Direct_IO *note A.8.4(18): 6928.
+ <in> Ada.IO_Exceptions *note A.13(4): 7215.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6893.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7191.
+ <in> Ada.Text_IO *note A.10.1(85): 7105.
Name_Error
- in Ada.Direct_IO *note A.8.4(18): 6929.
- in Ada.Directories *note A.16(43/2): 7273.
- in Ada.IO_Exceptions *note A.13(4): 7216.
- in Ada.Sequential_IO *note A.8.1(15): 6894.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7192.
- in Ada.Text_IO *note A.10.1(85): 7106.
+ <in> Ada.Direct_IO *note A.8.4(18): 6929.
+ <in> Ada.Directories *note A.16(43/2): 7273.
+ <in> Ada.IO_Exceptions *note A.13(4): 7216.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6894.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7192.
+ <in> Ada.Text_IO *note A.10.1(85): 7106.
Pattern_Error
- in Ada.Strings *note A.4.1(5): 6322.
+ <in> Ada.Strings *note A.4.1(5): 6322.
Picture_Error
- in Ada.Text_IO.Editing *note F.3.3(9): 8989.
+ <in> Ada.Text_IO.Editing *note F.3.3(9): 8989.
Pointer_Error
- in Interfaces.C.Pointers *note B.3.2(8): 8203.
+ <in> Interfaces.C.Pointers *note B.3.2(8): 8203.
Program_Error
- in Standard *note A.1(46): 5988.
+ <in> Standard *note A.1(46): 5988.
Status_Error
- in Ada.Direct_IO *note A.8.4(18): 6927.
- in Ada.Directories *note A.16(43/2): 7272.
- in Ada.IO_Exceptions *note A.13(4): 7214.
- in Ada.Sequential_IO *note A.8.1(15): 6892.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7190.
- in Ada.Text_IO *note A.10.1(85): 7104.
+ <in> Ada.Direct_IO *note A.8.4(18): 6927.
+ <in> Ada.Directories *note A.16(43/2): 7272.
+ <in> Ada.IO_Exceptions *note A.13(4): 7214.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6892.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7190.
+ <in> Ada.Text_IO *note A.10.1(85): 7104.
Storage_Error
- in Standard *note A.1(46): 5989.
+ <in> Standard *note A.1(46): 5989.
Tag_Error
- in Ada.Tags *note 3.9(8): 2261.
+ <in> Ada.Tags *note 3.9(8): 2261.
Tasking_Error
- in Standard *note A.1(46): 5990.
+ <in> Standard *note A.1(46): 5990.
Terminator_Error
- in Interfaces.C *note B.3(40): 8165.
+ <in> Interfaces.C *note B.3(40): 8165.
Time_Error
- in Ada.Calendar *note 9.6(18): 4530.
+ <in> Ada.Calendar *note 9.6(18): 4530.
Timer_Resource_Error
- in Ada.Execution_Time.Timers *note D.14.1(9/2): 8746.
+ <in> Ada.Execution_Time.Timers *note D.14.1(9/2): 8746.
Translation_Error
- in Ada.Strings *note A.4.1(5): 6324.
+ <in> Ada.Strings *note A.4.1(5): 6324.
Unknown_Zone_Error
- in Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4546.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4546.
Use_Error
- in Ada.Direct_IO *note A.8.4(18): 6930.
- in Ada.Directories *note A.16(43/2): 7274.
- in Ada.IO_Exceptions *note A.13(4): 7217.
- in Ada.Sequential_IO *note A.8.1(15): 6895.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7193.
- in Ada.Text_IO *note A.10.1(85): 7107.
+ <in> Ada.Direct_IO *note A.8.4(18): 6930.
+ <in> Ada.Directories *note A.16(43/2): 7274.
+ <in> Ada.IO_Exceptions *note A.13(4): 7217.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6895.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7193.
+ <in> Ada.Text_IO *note A.10.1(85): 7107.
File: aarm2012.info, Node: Q.5, Prev: Q.4, Up: Annex Q
@@ -131485,7 +131970,7 @@ Q.5 Language-Defined Objects
============================
1/3
-{AI95-00440-01AI95-00440-01} {AI05-0299-1AI05-0299-1} This subclause
+{<AI95-00440-01AI95-00440-01>} {<AI05-0299-1AI05-0299-1>} This subclause
lists all language-defined constants, variables, named numbers, and
enumeration literals.
@@ -131496,870 +131981,870 @@ enumeration literals.
-ACK in Ada.Characters.Latin_1 *note A.3.3(5): 6049.
+ACK <in> Ada.Characters.Latin_1 *note A.3.3(5): 6049.
-Acute in Ada.Characters.Latin_1 *note A.3.3(22): 6195.
+Acute <in> Ada.Characters.Latin_1 *note A.3.3(22): 6195.
-Ada_To_COBOL in Interfaces.COBOL *note B.4(14): 8239.
+Ada_To_COBOL <in> Interfaces.COBOL *note B.4(14): 8239.
Alphanumeric_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6520.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6520.
-Ampersand in Ada.Characters.Latin_1 *note A.3.3(8): 6081.
+Ampersand <in> Ada.Characters.Latin_1 *note A.3.3(8): 6081.
-APC in Ada.Characters.Latin_1 *note A.3.3(19): 6172.
+APC <in> Ada.Characters.Latin_1 *note A.3.3(19): 6172.
-Apostrophe in Ada.Characters.Latin_1 *note A.3.3(8): 6082.
+Apostrophe <in> Ada.Characters.Latin_1 *note A.3.3(8): 6082.
-Asterisk in Ada.Characters.Latin_1 *note A.3.3(8): 6085.
+Asterisk <in> Ada.Characters.Latin_1 *note A.3.3(8): 6085.
Basic_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6525.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6525.
Basic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6517.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6517.
-BEL in Ada.Characters.Latin_1 *note A.3.3(5): 6050.
+BEL <in> Ada.Characters.Latin_1 *note A.3.3(5): 6050.
-BOM_16 in Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6639.
+BOM_16 <in> Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6639.
-BOM_16BE in Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6637.
+BOM_16BE <in> Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6637.
-BOM_16LE in Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6638.
+BOM_16LE <in> Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6638.
-BOM_8 in Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6636.
+BOM_8 <in> Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6636.
-BPH in Ada.Characters.Latin_1 *note A.3.3(17): 6143.
+BPH <in> Ada.Characters.Latin_1 *note A.3.3(17): 6143.
-Broken_Bar in Ada.Characters.Latin_1 *note A.3.3(21/3): 6180.
+Broken_Bar <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6180.
-BS in Ada.Characters.Latin_1 *note A.3.3(5): 6051.
+BS <in> Ada.Characters.Latin_1 *note A.3.3(5): 6051.
-Buffer_Size in Ada.Storage_IO *note A.9(4): 6938.
+Buffer_Size <in> Ada.Storage_IO *note A.9(4): 6938.
-CAN in Ada.Characters.Latin_1 *note A.3.3(6): 6067.
+CAN <in> Ada.Characters.Latin_1 *note A.3.3(6): 6067.
-CCH in Ada.Characters.Latin_1 *note A.3.3(18): 6161.
+CCH <in> Ada.Characters.Latin_1 *note A.3.3(18): 6161.
-Cedilla in Ada.Characters.Latin_1 *note A.3.3(22): 6200.
+Cedilla <in> Ada.Characters.Latin_1 *note A.3.3(22): 6200.
-Cent_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 6176.
+Cent_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6176.
-char16_nul in Interfaces.C *note B.3(39.3/2): 8146.
+char16_nul <in> Interfaces.C *note B.3(39.3/2): 8146.
-char32_nul in Interfaces.C *note B.3(39.12/2): 8156.
+char32_nul <in> Interfaces.C *note B.3(39.12/2): 8156.
-CHAR_BIT in Interfaces.C *note B.3(6): 8107.
+CHAR_BIT <in> Interfaces.C *note B.3(6): 8107.
Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(46/2): 6564.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6607.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(46/2): 6564.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6607.
-Circumflex in Ada.Characters.Latin_1 *note A.3.3(12): 6102.
+Circumflex <in> Ada.Characters.Latin_1 *note A.3.3(12): 6102.
-COBOL_To_Ada in Interfaces.COBOL *note B.4(15): 8240.
+COBOL_To_Ada <in> Interfaces.COBOL *note B.4(15): 8240.
-Colon in Ada.Characters.Latin_1 *note A.3.3(10): 6092.
+Colon <in> Ada.Characters.Latin_1 *note A.3.3(10): 6092.
-Comma in Ada.Characters.Latin_1 *note A.3.3(8): 6087.
+Comma <in> Ada.Characters.Latin_1 *note A.3.3(8): 6087.
Commercial_At
- in Ada.Characters.Latin_1 *note A.3.3(10): 6098.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6098.
Control_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6512.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6512.
Copyright_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6183.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6183.
-Country_Unknown in Ada.Locales *note A.19(5/3): 8038.
+Country_Unknown <in> Ada.Locales *note A.19(5/3): 8038.
-CPU_Tick in Ada.Execution_Time *note D.14(4/2): 8724.
+CPU_Tick <in> Ada.Execution_Time *note D.14(4/2): 8724.
-CPU_Time_First in Ada.Execution_Time *note D.14(4/2): 8721.
+CPU_Time_First <in> Ada.Execution_Time *note D.14(4/2): 8721.
-CPU_Time_Last in Ada.Execution_Time *note D.14(4/2): 8722.
+CPU_Time_Last <in> Ada.Execution_Time *note D.14(4/2): 8722.
-CPU_Time_Unit in Ada.Execution_Time *note D.14(4/2): 8723.
+CPU_Time_Unit <in> Ada.Execution_Time *note D.14(4/2): 8723.
-CR in Ada.Characters.Latin_1 *note A.3.3(5): 6056.
+CR <in> Ada.Characters.Latin_1 *note A.3.3(5): 6056.
-CSI in Ada.Characters.Latin_1 *note A.3.3(19): 6168.
+CSI <in> Ada.Characters.Latin_1 *note A.3.3(19): 6168.
Currency_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6178.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6178.
-DC1 in Ada.Characters.Latin_1 *note A.3.3(6): 6060.
+DC1 <in> Ada.Characters.Latin_1 *note A.3.3(6): 6060.
-DC2 in Ada.Characters.Latin_1 *note A.3.3(6): 6061.
+DC2 <in> Ada.Characters.Latin_1 *note A.3.3(6): 6061.
-DC3 in Ada.Characters.Latin_1 *note A.3.3(6): 6062.
+DC3 <in> Ada.Characters.Latin_1 *note A.3.3(6): 6062.
-DC4 in Ada.Characters.Latin_1 *note A.3.3(6): 6063.
+DC4 <in> Ada.Characters.Latin_1 *note A.3.3(6): 6063.
-DCS in Ada.Characters.Latin_1 *note A.3.3(18): 6157.
+DCS <in> Ada.Characters.Latin_1 *note A.3.3(18): 6157.
Decimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6518.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6518.
Default_Aft
- in Ada.Text_IO *note A.10.1(64): 7067, *note A.10.1(69): 7077,
+ <in> Ada.Text_IO *note A.10.1(64): 7067, *note A.10.1(69): 7077,
*note A.10.1(74): 7087.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9067.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9067.
-Default_Base in Ada.Text_IO *note A.10.1(53): 7049, *note A.10.1(58):
-7058.
+Default_Base <in> Ada.Text_IO *note A.10.1(53): 7049, *note
+A.10.1(58): 7058.
-Default_Bit_Order in System *note 13.7(15/2): 5624.
+Default_Bit_Order <in> System *note 13.7(15/2): 5624.
Default_Currency
- in Ada.Text_IO.Editing *note F.3.3(10): 8990.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8990.
Default_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8525.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8525.
Default_Exp
- in Ada.Text_IO *note A.10.1(64): 7068, *note A.10.1(69): 7078,
+ <in> Ada.Text_IO *note A.10.1(64): 7068, *note A.10.1(69): 7078,
*note A.10.1(74): 7088.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9068.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9068.
-Default_Fill in Ada.Text_IO.Editing *note F.3.3(10): 8991.
+Default_Fill <in> Ada.Text_IO.Editing *note F.3.3(10): 8991.
Default_Fore
- in Ada.Text_IO *note A.10.1(64): 7066, *note A.10.1(69): 7076,
+ <in> Ada.Text_IO *note A.10.1(64): 7066, *note A.10.1(69): 7076,
*note A.10.1(74): 7086.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9066.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9066.
-Default_Priority in System *note 13.7(17): 5628.
+Default_Priority <in> System *note 13.7(17): 5628.
Default_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8515.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8515.
Default_Radix_Mark
- in Ada.Text_IO.Editing *note F.3.3(10): 8993.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8993.
Default_Separator
- in Ada.Text_IO.Editing *note F.3.3(10): 8992.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8992.
-Default_Setting in Ada.Text_IO *note A.10.1(80): 7097.
+Default_Setting <in> Ada.Text_IO *note A.10.1(80): 7097.
-Default_Width in Ada.Text_IO *note A.10.1(53): 7048, *note A.10.1(58):
-7057, *note A.10.1(80): 7096.
+Default_Width <in> Ada.Text_IO *note A.10.1(53): 7048, *note
+A.10.1(58): 7057, *note A.10.1(80): 7096.
-Degree_Sign in Ada.Characters.Latin_1 *note A.3.3(22): 6190.
+Degree_Sign <in> Ada.Characters.Latin_1 *note A.3.3(22): 6190.
-DEL in Ada.Characters.Latin_1 *note A.3.3(14): 6135.
+DEL <in> Ada.Characters.Latin_1 *note A.3.3(14): 6135.
-Diaeresis in Ada.Characters.Latin_1 *note A.3.3(21/3): 6182.
+Diaeresis <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6182.
Division_Sign
- in Ada.Characters.Latin_1 *note A.3.3(26): 6263.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6263.
-DLE in Ada.Characters.Latin_1 *note A.3.3(6): 6059.
+DLE <in> Ada.Characters.Latin_1 *note A.3.3(6): 6059.
-Dollar_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 6079.
+Dollar_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 6079.
-e in Ada.Numerics *note A.5(3/2): 6676.
+e <in> Ada.Numerics *note A.5(3/2): 6676.
-EM in Ada.Characters.Latin_1 *note A.3.3(6): 6068.
+EM <in> Ada.Characters.Latin_1 *note A.3.3(6): 6068.
Empty_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7934.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7934.
Empty_List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 7440.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 7440.
Empty_Map
- in Ada.Containers.Hashed_Maps *note A.18.5(5/2): 7531.
- in Ada.Containers.Ordered_Maps *note A.18.6(6/2): 7587.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(5/2): 7531.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(6/2): 7587.
Empty_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7670.
- in Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7746.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7670.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7746.
Empty_Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7837.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7837.
Empty_Vector
- in Ada.Containers.Vectors *note A.18.2(10/2): 7341.
+ <in> Ada.Containers.Vectors *note A.18.2(10/2): 7341.
-ENQ in Ada.Characters.Latin_1 *note A.3.3(5): 6048.
+ENQ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6048.
-EOT in Ada.Characters.Latin_1 *note A.3.3(5): 6047.
+EOT <in> Ada.Characters.Latin_1 *note A.3.3(5): 6047.
-EPA in Ada.Characters.Latin_1 *note A.3.3(18): 6164.
+EPA <in> Ada.Characters.Latin_1 *note A.3.3(18): 6164.
-Equals_Sign in Ada.Characters.Latin_1 *note A.3.3(10): 6095.
+Equals_Sign <in> Ada.Characters.Latin_1 *note A.3.3(10): 6095.
-ESA in Ada.Characters.Latin_1 *note A.3.3(17): 6148.
+ESA <in> Ada.Characters.Latin_1 *note A.3.3(17): 6148.
-ESC in Ada.Characters.Latin_1 *note A.3.3(6): 6070.
+ESC <in> Ada.Characters.Latin_1 *note A.3.3(6): 6070.
-ETB in Ada.Characters.Latin_1 *note A.3.3(6): 6066.
+ETB <in> Ada.Characters.Latin_1 *note A.3.3(6): 6066.
-ETX in Ada.Characters.Latin_1 *note A.3.3(5): 6046.
+ETX <in> Ada.Characters.Latin_1 *note A.3.3(5): 6046.
-Exclamation in Ada.Characters.Latin_1 *note A.3.3(8): 6076.
+Exclamation <in> Ada.Characters.Latin_1 *note A.3.3(8): 6076.
-Failure in Ada.Command_Line *note A.15(8): 7232.
+Failure <in> Ada.Command_Line *note A.15(8): 7232.
Feminine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6184.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6184.
-FF in Ada.Characters.Latin_1 *note A.3.3(5): 6055.
+FF <in> Ada.Characters.Latin_1 *note A.3.3(5): 6055.
-Fine_Delta in System *note 13.7(9): 5613.
+Fine_Delta <in> System *note 13.7(9): 5613.
Fraction_One_Half
- in Ada.Characters.Latin_1 *note A.3.3(22): 6205.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6205.
Fraction_One_Quarter
- in Ada.Characters.Latin_1 *note A.3.3(22): 6204.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6204.
Fraction_Three_Quarters
- in Ada.Characters.Latin_1 *note A.3.3(22): 6206.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6206.
-Friday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4558.
+Friday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4558.
-FS in Ada.Characters.Latin_1 *note A.3.3(6): 6071.
+FS <in> Ada.Characters.Latin_1 *note A.3.3(6): 6071.
-Full_Stop in Ada.Characters.Latin_1 *note A.3.3(8): 6090.
+Full_Stop <in> Ada.Characters.Latin_1 *note A.3.3(8): 6090.
Graphic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6513.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6513.
-Grave in Ada.Characters.Latin_1 *note A.3.3(13): 6104.
+Grave <in> Ada.Characters.Latin_1 *note A.3.3(13): 6104.
Greater_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 6096.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6096.
-GS in Ada.Characters.Latin_1 *note A.3.3(6): 6072.
+GS <in> Ada.Characters.Latin_1 *note A.3.3(6): 6072.
Hexadecimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6519.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6519.
High_Order_First
- in Interfaces.COBOL *note B.4(25): 8254.
- in System *note 13.7(15/2): 5622.
+ <in> Interfaces.COBOL *note B.4(25): 8254.
+ <in> System *note 13.7(15/2): 5622.
-HT in Ada.Characters.Latin_1 *note A.3.3(5): 6052.
+HT <in> Ada.Characters.Latin_1 *note A.3.3(5): 6052.
-HTJ in Ada.Characters.Latin_1 *note A.3.3(17): 6150.
+HTJ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6150.
-HTS in Ada.Characters.Latin_1 *note A.3.3(17): 6149.
+HTS <in> Ada.Characters.Latin_1 *note A.3.3(17): 6149.
-Hyphen in Ada.Characters.Latin_1 *note A.3.3(8): 6088.
+Hyphen <in> Ada.Characters.Latin_1 *note A.3.3(8): 6088.
i
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9011.
- in Interfaces.Fortran *note B.5(10): 8291.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9011.
+ <in> Interfaces.Fortran *note B.5(10): 8291.
Identity
- in Ada.Strings.Maps *note A.4.2(22): 6347.
- in Ada.Strings.Wide_Maps *note A.4.7(22): 6559.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6601.
+ <in> Ada.Strings.Maps *note A.4.2(22): 6347.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(22): 6559.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6601.
Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.1/3): 8728.
+ <in> Ada.Execution_Time *note D.14(9.1/3): 8728.
Inverted_Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6175.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6175.
Inverted_Question
- in Ada.Characters.Latin_1 *note A.3.3(22): 6207.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6207.
-IS1 in Ada.Characters.Latin_1 *note A.3.3(16): 6140.
+IS1 <in> Ada.Characters.Latin_1 *note A.3.3(16): 6140.
-IS2 in Ada.Characters.Latin_1 *note A.3.3(16): 6139.
+IS2 <in> Ada.Characters.Latin_1 *note A.3.3(16): 6139.
-IS3 in Ada.Characters.Latin_1 *note A.3.3(16): 6138.
+IS3 <in> Ada.Characters.Latin_1 *note A.3.3(16): 6138.
-IS4 in Ada.Characters.Latin_1 *note A.3.3(16): 6137.
+IS4 <in> Ada.Characters.Latin_1 *note A.3.3(16): 6137.
ISO_646_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6522.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6522.
j
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9012.
- in Interfaces.Fortran *note B.5(10): 8292.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9012.
+ <in> Interfaces.Fortran *note B.5(10): 8292.
-Language_Unknown in Ada.Locales *note A.19(5/3): 8037.
+Language_Unknown <in> Ada.Locales *note A.19(5/3): 8037.
-LC_A in Ada.Characters.Latin_1 *note A.3.3(13): 6105.
+LC_A <in> Ada.Characters.Latin_1 *note A.3.3(13): 6105.
-LC_A_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 6241.
+LC_A_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 6241.
LC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6242.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6242.
LC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6244.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6244.
-LC_A_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 6240.
+LC_A_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 6240.
-LC_A_Ring in Ada.Characters.Latin_1 *note A.3.3(25): 6245.
+LC_A_Ring <in> Ada.Characters.Latin_1 *note A.3.3(25): 6245.
-LC_A_Tilde in Ada.Characters.Latin_1 *note A.3.3(25): 6243.
+LC_A_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(25): 6243.
LC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(25): 6246.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6246.
-LC_B in Ada.Characters.Latin_1 *note A.3.3(13): 6106.
+LC_B <in> Ada.Characters.Latin_1 *note A.3.3(13): 6106.
-LC_C in Ada.Characters.Latin_1 *note A.3.3(13): 6107.
+LC_C <in> Ada.Characters.Latin_1 *note A.3.3(13): 6107.
LC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(25): 6247.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6247.
-LC_D in Ada.Characters.Latin_1 *note A.3.3(13): 6108.
+LC_D <in> Ada.Characters.Latin_1 *note A.3.3(13): 6108.
-LC_E in Ada.Characters.Latin_1 *note A.3.3(13): 6109.
+LC_E <in> Ada.Characters.Latin_1 *note A.3.3(13): 6109.
-LC_E_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 6249.
+LC_E_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 6249.
LC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6250.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6250.
LC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6251.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6251.
-LC_E_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 6248.
+LC_E_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 6248.
-LC_F in Ada.Characters.Latin_1 *note A.3.3(13): 6110.
+LC_F <in> Ada.Characters.Latin_1 *note A.3.3(13): 6110.
-LC_G in Ada.Characters.Latin_1 *note A.3.3(13): 6111.
+LC_G <in> Ada.Characters.Latin_1 *note A.3.3(13): 6111.
LC_German_Sharp_S
- in Ada.Characters.Latin_1 *note A.3.3(24): 6239.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6239.
-LC_H in Ada.Characters.Latin_1 *note A.3.3(13): 6112.
+LC_H <in> Ada.Characters.Latin_1 *note A.3.3(13): 6112.
-LC_I in Ada.Characters.Latin_1 *note A.3.3(13): 6113.
+LC_I <in> Ada.Characters.Latin_1 *note A.3.3(13): 6113.
-LC_I_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 6253.
+LC_I_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 6253.
LC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6254.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6254.
LC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6255.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6255.
-LC_I_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 6252.
+LC_I_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 6252.
LC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(26): 6256.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6256.
LC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(26): 6270.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6270.
-LC_J in Ada.Characters.Latin_1 *note A.3.3(13): 6114.
+LC_J <in> Ada.Characters.Latin_1 *note A.3.3(13): 6114.
-LC_K in Ada.Characters.Latin_1 *note A.3.3(13): 6115.
+LC_K <in> Ada.Characters.Latin_1 *note A.3.3(13): 6115.
-LC_L in Ada.Characters.Latin_1 *note A.3.3(13): 6116.
+LC_L <in> Ada.Characters.Latin_1 *note A.3.3(13): 6116.
-LC_M in Ada.Characters.Latin_1 *note A.3.3(13): 6117.
+LC_M <in> Ada.Characters.Latin_1 *note A.3.3(13): 6117.
-LC_N in Ada.Characters.Latin_1 *note A.3.3(13): 6118.
+LC_N <in> Ada.Characters.Latin_1 *note A.3.3(13): 6118.
-LC_N_Tilde in Ada.Characters.Latin_1 *note A.3.3(26): 6257.
+LC_N_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(26): 6257.
-LC_O in Ada.Characters.Latin_1 *note A.3.3(13): 6119.
+LC_O <in> Ada.Characters.Latin_1 *note A.3.3(13): 6119.
-LC_O_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 6259.
+LC_O_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 6259.
LC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 6260.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6260.
LC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6262.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6262.
-LC_O_Grave in Ada.Characters.Latin_1 *note A.3.3(26): 6258.
+LC_O_Grave <in> Ada.Characters.Latin_1 *note A.3.3(26): 6258.
LC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(26): 6264.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6264.
-LC_O_Tilde in Ada.Characters.Latin_1 *note A.3.3(26): 6261.
+LC_O_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(26): 6261.
-LC_P in Ada.Characters.Latin_1 *note A.3.3(14): 6120.
+LC_P <in> Ada.Characters.Latin_1 *note A.3.3(14): 6120.
-LC_Q in Ada.Characters.Latin_1 *note A.3.3(14): 6121.
+LC_Q <in> Ada.Characters.Latin_1 *note A.3.3(14): 6121.
-LC_R in Ada.Characters.Latin_1 *note A.3.3(14): 6122.
+LC_R <in> Ada.Characters.Latin_1 *note A.3.3(14): 6122.
-LC_S in Ada.Characters.Latin_1 *note A.3.3(14): 6123.
+LC_S <in> Ada.Characters.Latin_1 *note A.3.3(14): 6123.
-LC_T in Ada.Characters.Latin_1 *note A.3.3(14): 6124.
+LC_T <in> Ada.Characters.Latin_1 *note A.3.3(14): 6124.
-LC_U in Ada.Characters.Latin_1 *note A.3.3(14): 6125.
+LC_U <in> Ada.Characters.Latin_1 *note A.3.3(14): 6125.
-LC_U_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 6266.
+LC_U_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 6266.
LC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 6267.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6267.
LC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6268.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6268.
-LC_U_Grave in Ada.Characters.Latin_1 *note A.3.3(26): 6265.
+LC_U_Grave <in> Ada.Characters.Latin_1 *note A.3.3(26): 6265.
-LC_V in Ada.Characters.Latin_1 *note A.3.3(14): 6126.
+LC_V <in> Ada.Characters.Latin_1 *note A.3.3(14): 6126.
-LC_W in Ada.Characters.Latin_1 *note A.3.3(14): 6127.
+LC_W <in> Ada.Characters.Latin_1 *note A.3.3(14): 6127.
-LC_X in Ada.Characters.Latin_1 *note A.3.3(14): 6128.
+LC_X <in> Ada.Characters.Latin_1 *note A.3.3(14): 6128.
-LC_Y in Ada.Characters.Latin_1 *note A.3.3(14): 6129.
+LC_Y <in> Ada.Characters.Latin_1 *note A.3.3(14): 6129.
-LC_Y_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 6269.
+LC_Y_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 6269.
LC_Y_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6271.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6271.
-LC_Z in Ada.Characters.Latin_1 *note A.3.3(14): 6130.
+LC_Z <in> Ada.Characters.Latin_1 *note A.3.3(14): 6130.
Leading_Nonseparate
- in Interfaces.COBOL *note B.4(23): 8251.
+ <in> Interfaces.COBOL *note B.4(23): 8251.
-Leading_Separate in Interfaces.COBOL *note B.4(23): 8249.
+Leading_Separate <in> Interfaces.COBOL *note B.4(23): 8249.
Left_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6185.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6185.
Left_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 6131.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6131.
Left_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 6083.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6083.
Left_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 6099.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6099.
Less_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 6094.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6094.
Letter_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6514.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6514.
-LF in Ada.Characters.Latin_1 *note A.3.3(5): 6053.
+LF <in> Ada.Characters.Latin_1 *note A.3.3(5): 6053.
-Low_Line in Ada.Characters.Latin_1 *note A.3.3(12): 6103.
+Low_Line <in> Ada.Characters.Latin_1 *note A.3.3(12): 6103.
Low_Order_First
- in Interfaces.COBOL *note B.4(25): 8255.
- in System *note 13.7(15/2): 5623.
+ <in> Interfaces.COBOL *note B.4(25): 8255.
+ <in> System *note 13.7(15/2): 5623.
Lower_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6523.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6523.
Lower_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6515.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6515.
-Macron in Ada.Characters.Latin_1 *note A.3.3(21/3): 6189.
+Macron <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6189.
Masculine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(22): 6202.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6202.
-Max_Base_Digits in System *note 13.7(8): 5610.
+Max_Base_Digits <in> System *note 13.7(8): 5610.
-Max_Binary_Modulus in System *note 13.7(7): 5608.
+Max_Binary_Modulus <in> System *note 13.7(7): 5608.
-Max_Decimal_Digits in Ada.Decimal *note F.2(5): 8976.
+Max_Decimal_Digits <in> Ada.Decimal *note F.2(5): 8976.
-Max_Delta in Ada.Decimal *note F.2(4): 8975.
+Max_Delta <in> Ada.Decimal *note F.2(4): 8975.
-Max_Digits in System *note 13.7(8): 5611.
+Max_Digits <in> System *note 13.7(8): 5611.
-Max_Digits_Binary in Interfaces.COBOL *note B.4(11): 8234.
+Max_Digits_Binary <in> Interfaces.COBOL *note B.4(11): 8234.
Max_Digits_Long_Binary
- in Interfaces.COBOL *note B.4(11): 8235.
+ <in> Interfaces.COBOL *note B.4(11): 8235.
Max_Image_Width
- in Ada.Numerics.Discrete_Random *note A.5.2(25): 6737.
- in Ada.Numerics.Float_Random *note A.5.2(13): 6725.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(25): 6737.
+ <in> Ada.Numerics.Float_Random *note A.5.2(13): 6725.
-Max_Int in System *note 13.7(6): 5607.
+Max_Int <in> System *note 13.7(6): 5607.
-Max_Length in Ada.Strings.Bounded *note A.4.4(5): 6396.
+Max_Length <in> Ada.Strings.Bounded *note A.4.4(5): 6396.
-Max_Mantissa in System *note 13.7(9): 5612.
+Max_Mantissa <in> System *note 13.7(9): 5612.
-Max_Nonbinary_Modulus in System *note 13.7(7): 5609.
+Max_Nonbinary_Modulus <in> System *note 13.7(7): 5609.
Max_Picture_Length
- in Ada.Text_IO.Editing *note F.3.3(8): 8988.
+ <in> Ada.Text_IO.Editing *note F.3.3(8): 8988.
-Max_Scale in Ada.Decimal *note F.2(3): 8972.
+Max_Scale <in> Ada.Decimal *note F.2(3): 8972.
-Memory_Size in System *note 13.7(13): 5619.
+Memory_Size <in> System *note 13.7(13): 5619.
-Micro_Sign in Ada.Characters.Latin_1 *note A.3.3(22): 6196.
+Micro_Sign <in> Ada.Characters.Latin_1 *note A.3.3(22): 6196.
-Middle_Dot in Ada.Characters.Latin_1 *note A.3.3(22): 6199.
+Middle_Dot <in> Ada.Characters.Latin_1 *note A.3.3(22): 6199.
-Min_Delta in Ada.Decimal *note F.2(4): 8974.
+Min_Delta <in> Ada.Decimal *note F.2(4): 8974.
Min_Handler_Ceiling
- in Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8757.
- in Ada.Execution_Time.Timers *note D.14.1(6/2): 8740.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8757.
+ <in> Ada.Execution_Time.Timers *note D.14.1(6/2): 8740.
-Min_Int in System *note 13.7(6): 5606.
+Min_Int <in> System *note 13.7(6): 5606.
-Min_Scale in Ada.Decimal *note F.2(3): 8973.
+Min_Scale <in> Ada.Decimal *note F.2(3): 8973.
-Minus_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 6089.
+Minus_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 6089.
-Monday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4554.
+Monday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4554.
Multiplication_Sign
- in Ada.Characters.Latin_1 *note A.3.3(24): 6231.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6231.
-MW in Ada.Characters.Latin_1 *note A.3.3(18): 6162.
+MW <in> Ada.Characters.Latin_1 *note A.3.3(18): 6162.
-NAK in Ada.Characters.Latin_1 *note A.3.3(6): 6064.
+NAK <in> Ada.Characters.Latin_1 *note A.3.3(6): 6064.
-Native_Binary in Interfaces.COBOL *note B.4(25): 8256.
+Native_Binary <in> Interfaces.COBOL *note B.4(25): 8256.
-NBH in Ada.Characters.Latin_1 *note A.3.3(17): 6144.
+NBH <in> Ada.Characters.Latin_1 *note A.3.3(17): 6144.
-NBSP in Ada.Characters.Latin_1 *note A.3.3(21/3): 6174.
+NBSP <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6174.
-NEL in Ada.Characters.Latin_1 *note A.3.3(17): 6146.
+NEL <in> Ada.Characters.Latin_1 *note A.3.3(17): 6146.
No_Break_Space
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6173.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6173.
No_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 7441.
- in Ada.Containers.Hashed_Maps *note A.18.5(6/2): 7532.
- in Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7671.
- in Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7838.
- in Ada.Containers.Ordered_Maps *note A.18.6(7/2): 7588.
- in Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7747.
- in Ada.Containers.Vectors *note A.18.2(11/2): 7342.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 7441.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6/2): 7532.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7671.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7838.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7/2): 7588.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7747.
+ <in> Ada.Containers.Vectors *note A.18.2(11/2): 7342.
-No_Index in Ada.Containers.Vectors *note A.18.2(7/2): 7338.
+No_Index <in> Ada.Containers.Vectors *note A.18.2(7/2): 7338.
-No_Tag in Ada.Tags *note 3.9(6.1/2): 2249.
+No_Tag <in> Ada.Tags *note 3.9(6.1/2): 2249.
Not_A_Specific_CPU
- in System.Multiprocessors *note D.16(4/3): 8799.
+ <in> System.Multiprocessors *note D.16(4/3): 8799.
-Not_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 6186.
+Not_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6186.
NUL
- in Ada.Characters.Latin_1 *note A.3.3(5): 6043.
- in Interfaces.C *note B.3(20/1): 8126.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6043.
+ <in> Interfaces.C *note B.3(20/1): 8126.
-Null_Address in System *note 13.7(12): 5616.
+Null_Address <in> System *note 13.7(12): 5616.
Null_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(7): 6398.
+ <in> Ada.Strings.Bounded *note A.4.4(7): 6398.
-Null_Id in Ada.Exceptions *note 11.4.1(2/2): 4992.
+Null_Id <in> Ada.Exceptions *note 11.4.1(2/2): 4992.
-Null_Occurrence in Ada.Exceptions *note 11.4.1(3/2): 4998.
+Null_Occurrence <in> Ada.Exceptions *note 11.4.1(3/2): 4998.
-Null_Ptr in Interfaces.C.Strings *note B.3.1(7): 8179.
+Null_Ptr <in> Interfaces.C.Strings *note B.3.1(7): 8179.
Null_Set
- in Ada.Strings.Maps *note A.4.2(5): 6333.
- in Ada.Strings.Wide_Maps *note A.4.7(5): 6545.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6587.
+ <in> Ada.Strings.Maps *note A.4.2(5): 6333.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(5): 6545.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6587.
Null_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(5): 6458.
+ <in> Ada.Strings.Unbounded *note A.4.5(5): 6458.
-Number_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 6078.
+Number_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 6078.
-OSC in Ada.Characters.Latin_1 *note A.3.3(19): 6170.
+OSC <in> Ada.Characters.Latin_1 *note A.3.3(19): 6170.
-Packed_Signed in Interfaces.COBOL *note B.4(27): 8259.
+Packed_Signed <in> Interfaces.COBOL *note B.4(27): 8259.
-Packed_Unsigned in Interfaces.COBOL *note B.4(27): 8258.
+Packed_Unsigned <in> Interfaces.COBOL *note B.4(27): 8258.
Paragraph_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6198.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6198.
Percent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6080.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6080.
-Pi in Ada.Numerics *note A.5(3/2): 6675.
+Pi <in> Ada.Numerics *note A.5(3/2): 6675.
Pilcrow_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6197.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6197.
-PLD in Ada.Characters.Latin_1 *note A.3.3(17): 6152.
+PLD <in> Ada.Characters.Latin_1 *note A.3.3(17): 6152.
-PLU in Ada.Characters.Latin_1 *note A.3.3(17): 6153.
+PLU <in> Ada.Characters.Latin_1 *note A.3.3(17): 6153.
Plus_Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6192.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6192.
-Plus_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 6086.
+Plus_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 6086.
-PM in Ada.Characters.Latin_1 *note A.3.3(19): 6171.
+PM <in> Ada.Characters.Latin_1 *note A.3.3(19): 6171.
-Pound_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 6177.
+Pound_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6177.
-PU1 in Ada.Characters.Latin_1 *note A.3.3(18): 6158.
+PU1 <in> Ada.Characters.Latin_1 *note A.3.3(18): 6158.
-PU2 in Ada.Characters.Latin_1 *note A.3.3(18): 6159.
+PU2 <in> Ada.Characters.Latin_1 *note A.3.3(18): 6159.
-Question in Ada.Characters.Latin_1 *note A.3.3(10): 6097.
+Question <in> Ada.Characters.Latin_1 *note A.3.3(10): 6097.
-Quotation in Ada.Characters.Latin_1 *note A.3.3(8): 6077.
+Quotation <in> Ada.Characters.Latin_1 *note A.3.3(8): 6077.
Registered_Trade_Mark_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6188.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6188.
Reserved_128
- in Ada.Characters.Latin_1 *note A.3.3(17): 6141.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6141.
Reserved_129
- in Ada.Characters.Latin_1 *note A.3.3(17): 6142.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6142.
Reserved_132
- in Ada.Characters.Latin_1 *note A.3.3(17): 6145.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6145.
Reserved_153
- in Ada.Characters.Latin_1 *note A.3.3(19): 6166.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6166.
Reverse_Solidus
- in Ada.Characters.Latin_1 *note A.3.3(12): 6100.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6100.
-RI in Ada.Characters.Latin_1 *note A.3.3(17): 6154.
+RI <in> Ada.Characters.Latin_1 *note A.3.3(17): 6154.
Right_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(22): 6203.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6203.
Right_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 6133.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6133.
Right_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 6084.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6084.
Right_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 6101.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6101.
-Ring_Above in Ada.Characters.Latin_1 *note A.3.3(22): 6191.
+Ring_Above <in> Ada.Characters.Latin_1 *note A.3.3(22): 6191.
-RS in Ada.Characters.Latin_1 *note A.3.3(6): 6073.
+RS <in> Ada.Characters.Latin_1 *note A.3.3(6): 6073.
-Saturday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4559.
+Saturday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4559.
-SCHAR_MAX in Interfaces.C *note B.3(6): 8109.
+SCHAR_MAX <in> Interfaces.C *note B.3(6): 8109.
-SCHAR_MIN in Interfaces.C *note B.3(6): 8108.
+SCHAR_MIN <in> Interfaces.C *note B.3(6): 8108.
-SCI in Ada.Characters.Latin_1 *note A.3.3(19): 6167.
+SCI <in> Ada.Characters.Latin_1 *note A.3.3(19): 6167.
Section_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6181.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6181.
-Semicolon in Ada.Characters.Latin_1 *note A.3.3(10): 6093.
+Semicolon <in> Ada.Characters.Latin_1 *note A.3.3(10): 6093.
Separate_Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.2/3): 8729.
+ <in> Ada.Execution_Time *note D.14(9.2/3): 8729.
-SI in Ada.Characters.Latin_1 *note A.3.3(5): 6058.
+SI <in> Ada.Characters.Latin_1 *note A.3.3(5): 6058.
-SO in Ada.Characters.Latin_1 *note A.3.3(5): 6057.
+SO <in> Ada.Characters.Latin_1 *note A.3.3(5): 6057.
-Soft_Hyphen in Ada.Characters.Latin_1 *note A.3.3(21/3): 6187.
+Soft_Hyphen <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6187.
-SOH in Ada.Characters.Latin_1 *note A.3.3(5): 6044.
+SOH <in> Ada.Characters.Latin_1 *note A.3.3(5): 6044.
-Solidus in Ada.Characters.Latin_1 *note A.3.3(8): 6091.
+Solidus <in> Ada.Characters.Latin_1 *note A.3.3(8): 6091.
-SOS in Ada.Characters.Latin_1 *note A.3.3(19): 6165.
+SOS <in> Ada.Characters.Latin_1 *note A.3.3(19): 6165.
-SPA in Ada.Characters.Latin_1 *note A.3.3(18): 6163.
+SPA <in> Ada.Characters.Latin_1 *note A.3.3(18): 6163.
Space
- in Ada.Characters.Latin_1 *note A.3.3(8): 6075.
- in Ada.Strings *note A.4.1(4/2): 6318.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6075.
+ <in> Ada.Strings *note A.4.1(4/2): 6318.
Special_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6521.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6521.
-SS2 in Ada.Characters.Latin_1 *note A.3.3(17): 6155.
+SS2 <in> Ada.Characters.Latin_1 *note A.3.3(17): 6155.
-SS3 in Ada.Characters.Latin_1 *note A.3.3(17): 6156.
+SS3 <in> Ada.Characters.Latin_1 *note A.3.3(17): 6156.
-SSA in Ada.Characters.Latin_1 *note A.3.3(17): 6147.
+SSA <in> Ada.Characters.Latin_1 *note A.3.3(17): 6147.
-ST in Ada.Characters.Latin_1 *note A.3.3(19): 6169.
+ST <in> Ada.Characters.Latin_1 *note A.3.3(19): 6169.
-Storage_Unit in System *note 13.7(13): 5617.
+Storage_Unit <in> System *note 13.7(13): 5617.
-STS in Ada.Characters.Latin_1 *note A.3.3(18): 6160.
+STS <in> Ada.Characters.Latin_1 *note A.3.3(18): 6160.
-STX in Ada.Characters.Latin_1 *note A.3.3(5): 6045.
+STX <in> Ada.Characters.Latin_1 *note A.3.3(5): 6045.
-SUB in Ada.Characters.Latin_1 *note A.3.3(6): 6069.
+SUB <in> Ada.Characters.Latin_1 *note A.3.3(6): 6069.
-Success in Ada.Command_Line *note A.15(8): 7231.
+Success <in> Ada.Command_Line *note A.15(8): 7231.
-Sunday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4560.
+Sunday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4560.
Superscript_One
- in Ada.Characters.Latin_1 *note A.3.3(22): 6201.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6201.
Superscript_Three
- in Ada.Characters.Latin_1 *note A.3.3(22): 6194.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6194.
Superscript_Two
- in Ada.Characters.Latin_1 *note A.3.3(22): 6193.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6193.
-SYN in Ada.Characters.Latin_1 *note A.3.3(6): 6065.
+SYN <in> Ada.Characters.Latin_1 *note A.3.3(6): 6065.
System_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
8808.
-System_Name in System *note 13.7(4): 5605.
+System_Name <in> System *note 13.7(4): 5605.
-Thursday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4557.
+Thursday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4557.
Tick
- in Ada.Real_Time *note D.8(6): 8664.
- in System *note 13.7(10): 5614.
+ <in> Ada.Real_Time *note D.8(6): 8664.
+ <in> System *note 13.7(10): 5614.
-Tilde in Ada.Characters.Latin_1 *note A.3.3(14): 6134.
+Tilde <in> Ada.Characters.Latin_1 *note A.3.3(14): 6134.
-Time_First in Ada.Real_Time *note D.8(4): 8656.
+Time_First <in> Ada.Real_Time *note D.8(4): 8656.
-Time_Last in Ada.Real_Time *note D.8(4): 8657.
+Time_Last <in> Ada.Real_Time *note D.8(4): 8657.
-Time_Span_First in Ada.Real_Time *note D.8(5): 8660.
+Time_Span_First <in> Ada.Real_Time *note D.8(5): 8660.
-Time_Span_Last in Ada.Real_Time *note D.8(5): 8661.
+Time_Span_Last <in> Ada.Real_Time *note D.8(5): 8661.
-Time_Span_Unit in Ada.Real_Time *note D.8(5): 8663.
+Time_Span_Unit <in> Ada.Real_Time *note D.8(5): 8663.
-Time_Span_Zero in Ada.Real_Time *note D.8(5): 8662.
+Time_Span_Zero <in> Ada.Real_Time *note D.8(5): 8662.
-Time_Unit in Ada.Real_Time *note D.8(4): 8658.
+Time_Unit <in> Ada.Real_Time *note D.8(4): 8658.
Trailing_Nonseparate
- in Interfaces.COBOL *note B.4(23): 8252.
+ <in> Interfaces.COBOL *note B.4(23): 8252.
-Trailing_Separate in Interfaces.COBOL *note B.4(23): 8250.
+Trailing_Separate <in> Interfaces.COBOL *note B.4(23): 8250.
-Tuesday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4555.
+Tuesday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4555.
-UC_A_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 6209.
+UC_A_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 6209.
UC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6210.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6210.
UC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6212.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6212.
-UC_A_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 6208.
+UC_A_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 6208.
-UC_A_Ring in Ada.Characters.Latin_1 *note A.3.3(23): 6213.
+UC_A_Ring <in> Ada.Characters.Latin_1 *note A.3.3(23): 6213.
-UC_A_Tilde in Ada.Characters.Latin_1 *note A.3.3(23): 6211.
+UC_A_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(23): 6211.
UC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(23): 6214.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6214.
UC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(23): 6215.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6215.
-UC_E_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 6217.
+UC_E_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 6217.
UC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6218.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6218.
UC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6219.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6219.
-UC_E_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 6216.
+UC_E_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 6216.
-UC_I_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 6221.
+UC_I_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 6221.
UC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6222.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6222.
UC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6223.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6223.
-UC_I_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 6220.
+UC_I_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 6220.
UC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(24): 6224.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6224.
UC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(24): 6238.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6238.
-UC_N_Tilde in Ada.Characters.Latin_1 *note A.3.3(24): 6225.
+UC_N_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(24): 6225.
-UC_O_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 6227.
+UC_O_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 6227.
UC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 6228.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6228.
UC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 6230.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6230.
-UC_O_Grave in Ada.Characters.Latin_1 *note A.3.3(24): 6226.
+UC_O_Grave <in> Ada.Characters.Latin_1 *note A.3.3(24): 6226.
UC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(24): 6232.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6232.
-UC_O_Tilde in Ada.Characters.Latin_1 *note A.3.3(24): 6229.
+UC_O_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(24): 6229.
-UC_U_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 6234.
+UC_U_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 6234.
UC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 6235.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6235.
UC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 6236.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6236.
-UC_U_Grave in Ada.Characters.Latin_1 *note A.3.3(24): 6233.
+UC_U_Grave <in> Ada.Characters.Latin_1 *note A.3.3(24): 6233.
-UC_Y_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 6237.
+UC_Y_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 6237.
-UCHAR_MAX in Interfaces.C *note B.3(6): 8110.
+UCHAR_MAX <in> Interfaces.C *note B.3(6): 8110.
-Unbounded in Ada.Text_IO *note A.10.1(5): 6963.
+Unbounded <in> Ada.Text_IO *note A.10.1(5): 6963.
-Unsigned in Interfaces.COBOL *note B.4(23): 8248.
+Unsigned <in> Interfaces.COBOL *note B.4(23): 8248.
Upper_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6524.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6524.
Upper_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6516.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6516.
-US in Ada.Characters.Latin_1 *note A.3.3(6): 6074.
+US <in> Ada.Characters.Latin_1 *note A.3.3(6): 6074.
Vertical_Line
- in Ada.Characters.Latin_1 *note A.3.3(14): 6132.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6132.
-VT in Ada.Characters.Latin_1 *note A.3.3(5): 6054.
+VT <in> Ada.Characters.Latin_1 *note A.3.3(5): 6054.
-VTS in Ada.Characters.Latin_1 *note A.3.3(17): 6151.
+VTS <in> Ada.Characters.Latin_1 *note A.3.3(17): 6151.
-Wednesday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4556.
+Wednesday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4556.
Wide_Character_Set
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6608.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6608.
-wide_nul in Interfaces.C *note B.3(31/1): 8136.
+wide_nul <in> Interfaces.C *note B.3(31/1): 8136.
-Wide_Space in Ada.Strings *note A.4.1(4/2): 6319.
+Wide_Space <in> Ada.Strings *note A.4.1(4/2): 6319.
-Wide_Wide_Space in Ada.Strings *note A.4.1(4/2): 6320.
+Wide_Wide_Space <in> Ada.Strings *note A.4.1(4/2): 6320.
-Word_Size in System *note 13.7(13): 5618.
+Word_Size <in> System *note 13.7(13): 5618.
-Yen_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 6179.
+Yen_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6179.
File: aarm2012.info, Node: Index, Prev: Annex Q, Up: Top
@@ -132455,7 +132940,7 @@ A
abnormal completion *note 7.6.1(2/2): 4007.
abnormal state of an object *note 13.9.1(4): 5671.
- [partial] *note 9.8(21): 4675, *note 11.6(6/3): 5096, *note
+ [<partial>] *note 9.8(21): 4675, *note 11.6(6/3): 5096, *note
A.13(17): 7224.
abnormal task *note 9.8(4): 4665.
abnormal termination
@@ -132467,31 +132952,31 @@ abort
abort completion point *note 9.8(15): 4671.
abort-deferred operation *note 9.8(5): 4669.
abort_statement *note 9.8(2): 4658.
- used *note 5.1(4/2): 3379, *note P: 10142.
+ <used> *note 5.1(4/2): 3379, *note P: 10142.
Abort_Task
- in Ada.Task_Identification *note C.7.1(3/3): 8406.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8406.
abortable_part *note 9.7.4(5): 4643.
- used *note 9.7.4(2): 4636, *note P: 10419.
+ <used> *note 9.7.4(2): 4636, *note P: 10419.
abs operator *note 4.4(1/3): 2862, *note 4.5.6(1): 3087.
absolute value *note 4.4(1/3): 2864, *note 4.5.6(1): 3089.
abstract data type (ADT)
- See private types and private extensions *note 7.3(1): 3897.
- See also abstract type *note 3.9.3(1/2): 2339.
+ <See> private types and private extensions *note 7.3(1): 3897.
+ <See also> abstract type *note 3.9.3(1/2): 2339.
abstract formal subprogram *note 12.6(8.c/2): 5314.
abstract subprogram *note 3.9.3(1/2): 2342, *note 3.9.3(3/2): 2350.
abstract type *note 3.9.3(1.2/2): 2348, *note 3.9.3(1/2): 2338, *note
N(1.1/2): 9655.
abstract_subprogram_declaration *note 3.9.3(1.1/3): 2344.
- used *note 3.1(3/3): 1358, *note P: 9790.
+ <used> *note 3.1(3/3): 1358, *note P: 9790.
ACATS
Ada Conformity Assessment Test Suite *note 1.3(1.c/3): 1170.
accept_alternative *note 9.7.1(5): 4605.
- used *note 9.7.1(4): 4602, *note P: 10403.
+ <used> *note 9.7.1(4): 4602, *note P: 10403.
accept_statement *note 9.5.2(3): 4410.
- used *note 5.1(5/2): 3388, *note 9.7.1(5): 4606, *note P: 10150.
+ <used> *note 5.1(5/2): 3388, *note 9.7.1(5): 4606, *note P: 10150.
acceptable interpretation *note 8.6(14): 4196.
Access attribute *note 3.10.2(25/1): 2482, *note 3.10.2(33/3): 2492.
- See also Unchecked_Access attribute *note 13.10(3): 5689.
+ <See also> Unchecked_Access attribute *note 13.10(3): 5689.
access discriminant *note 3.7(9/2): 2118.
access parameter *note 6.1(24/2): 3599.
access paths
@@ -132507,18 +132992,20 @@ access-to-object type *note 3.10(7/1): 2410.
access-to-subprogram type *note 3.10(7/1): 2411, *note 3.10(11): 2423.
access-to-variable type *note 3.10(10): 2422.
Access_Check *note 11.5(11/2): 5063.
- [partial] *note 4.1(13): 2573, *note 4.1.5(8/3): 2648, *note
+ [<partial>] *note 4.1(13): 2573, *note 4.1.5(8/3): 2648, *note
4.6(51/4): 3234, *note 4.8(10.4/3): 3314.
access_definition *note 3.10(6/2): 2403.
- used *note 3.3.1(2/3): 1564, *note 3.6(7/2): 2024, *note 3.7(5/2):
-2112, *note 6.1(13/2): 3574, *note 6.1(15/3): 3585, *note 6.5(2.3/2):
-3788, *note 8.5.1(2/3): 4137, *note 12.4(2/3): 5200, *note P: 10246.
+ <used> *note 3.3.1(2/3): 1564, *note 3.6(7/2): 2024, *note
+3.7(5/2): 2112, *note 6.1(13/2): 3574, *note 6.1(15/3): 3585, *note
+6.5(2.3/2): 3788, *note 8.5.1(2/3): 4137, *note 12.4(2/3): 5200, *note
+P: 10246.
access_to_object_definition *note 3.10(3): 2395.
- used *note 3.10(2/2): 2392, *note P: 9945.
+ <used> *note 3.10(2/2): 2392, *note P: 9945.
access_to_subprogram_definition *note 3.10(5): 2399.
- used *note 3.10(2/2): 2394, *note P: 9947.
+ <used> *note 3.10(2/2): 2394, *note P: 9947.
access_type_definition *note 3.10(2/2): 2390.
- used *note 3.2.1(4/2): 1455, *note 12.5.4(2): 5282, *note P: 9814.
+ <used> *note 3.2.1(4/2): 1455, *note 12.5.4(2): 5282, *note P:
+9814.
accessibility
distributed *note 3.10.2(33.1/3): 2497.
from shared passive library units *note E.2.1(8): 8862.
@@ -132532,9 +133019,9 @@ accessibility rule
type conversion *note 4.6(24.17/4): 3185, *note 4.6(24.21/4): 3191.
type conversion, array components *note 4.6(24.6/2): 3180.
accessibility rules
- See also Heart of Darkness *note 3.10.2(3.b/3): 2467.
+ <See also> Heart of Darkness *note 3.10.2(3.b/3): 2467.
Accessibility_Check *note 11.5(19.1/2): 5072.
- [partial] *note 3.10.2(30): 2487, *note 4.6(39.1/2): 3212, *note
+ [<partial>] *note 3.10.2(30): 2487, *note 4.6(39.1/2): 3212, *note
4.6(48/3): 3226, *note 4.8(10.1/3): 3305, *note 6.5(8/4): 3806, *note
6.5(21/3): 3812, *note 13.11.4(25/3): 5796, *note 13.11.4(26/3): 5798,
*note E.4(18/1): 8935.
@@ -132542,7 +133029,7 @@ accessible partition *note E.1(7): 8839.
accuracy *note 4.6(32): 3202, *note G.2(1): 9082.
ACID *note 1.3(1.c/3): 1163.
ACK
- in Ada.Characters.Latin_1 *note A.3.3(5): 6049.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6049.
acquire
execution resource associated with protected object *note
9.5.1(5/4): 4396.
@@ -132550,7 +133037,7 @@ activation
of a task *note 9.2(1): 4294.
activation failure *note 9.2(1): 4296.
Activation_Is_Complete
- in Ada.Task_Identification *note C.7.1(4/3): 8409.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8409.
activator
of a task *note 9.2(5): 4297.
active locale *note A.19(8/3): 8041.
@@ -132564,12 +133051,12 @@ actual subtype *note 3.3(23/3): 1543, *note
12.5(4): 5245.
of an object *note 3.3.1(9/2): 1585.
actual type *note 12.5(4): 5247.
actual_parameter_part *note 6.4(4): 3729.
- used *note 4.1.6(10/3): 2661, *note 6.4(2): 3724, *note 6.4(3):
+ <used> *note 4.1.6(10/3): 2661, *note 6.4(2): 3724, *note 6.4(3):
3728, *note 9.5.3(2): 4462, *note P: 10229.
Actual_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8518.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8518.
Acute
- in Ada.Characters.Latin_1 *note A.3.3(22): 6195.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6195.
ACVC
Ada Compiler Validation Capability *note 1.3(1.c/3): 1168.
Ada *note A.2(2): 5994.
@@ -132758,7 +133245,7 @@ Ada.Text_IO.Text_Streams *note A.12.2(3): 7203.
Ada.Text_IO.Unbounded_IO *note A.10.12(3/2): 7138.
Ada.Unchecked_Conversion *note 13.9(3/3): 5663.
Ada.Unchecked_Deallocate_Subpool
- child of Ada *note 13.11.5(3/3): 5806.
+ <child of> Ada *note 13.11.5(3/3): 5806.
Ada.Unchecked_Deallocation *note 13.11.2(3/3): 5742.
Ada.Wide_Characters *note A.3.1(4/2): 5998.
Ada.Wide_Characters.Handling *note A.3.5(3/3): 6292.
@@ -132777,44 +133264,44 @@ Ada.Wide_Wide_Text_IO.Editing *note F.3.5(1/2):
9003.
Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 7209.
Ada.Wide_Wide_Text_IO.Unbounded_IO *note A.11(5/3): 7157.
Ada_To_COBOL
- in Interfaces.COBOL *note B.4(14): 8239.
+ <in> Interfaces.COBOL *note B.4(14): 8239.
adafinal *note B.1(39/3): 8084.
adainit *note B.1(39/3): 8083.
Add
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8764.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8764.
Add_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8758.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8758.
address
arithmetic *note 13.7.1(6): 5637.
comparison *note 13.7(14/3): 5620.
- in System *note 13.7(12): 5615.
+ <in> System *note 13.7(12): 5615.
Address aspect *note 13.3(12): 5468.
Address attribute *note 13.3(11): 5464, *note J.7.1(5): 9278.
Address clause *note 13.3(7/2): 5442, *note 13.3(12): 5466.
Address_To_Access_Conversions
- child of System *note 13.7.2(2): 5645.
+ <child of> System *note 13.7.2(2): 5645.
Adjacent attribute *note A.5.3(48): 6807.
Adjust *note 7.6(2): 3973.
- in Ada.Finalization *note 7.6(6/2): 3977.
+ <in> Ada.Finalization *note 7.6(6/2): 3977.
adjusting the value of an object *note 7.6(15): 3987, *note 7.6(16/3):
3989.
adjustment *note 7.6(15): 3988, *note 7.6(16/3): 3990.
as part of assignment *note 5.2(14/3): 3419.
ADT (abstract data type)
- See private types and private extensions *note 7.3(1): 3898.
- See also abstract type *note 3.9.3(1/2): 2340.
+ <See> private types and private extensions *note 7.3(1): 3898.
+ <See also> abstract type *note 3.9.3(1/2): 2340.
advice *note 1.1.2(37): 1047.
Aft attribute *note 3.5.10(5): 1994.
aggregate *note 4.3(1): 2687, *note 4.3(2): 2689.
- used *note 4.4(7/3): 2924, *note 4.7(2): 3264, *note 6.8(2/4):
+ <used> *note 4.4(7/3): 2924, *note 4.7(2): 3264, *note 6.8(2/4):
3852, *note P: 10087.
- See also composite type *note 3.2(2/2): 1404.
+ <See also> composite type *note 3.2(2/2): 1404.
AI *note 1.3(1.c/3): 1161.
aliased *note 3.10(9/3): 2418, *note N(3): 9657.
aliasing
- See distinct access paths *note 6.2(12/3): 3666.
+ <See> distinct access paths *note 6.2(12/3): 3666.
Alignment
- in Ada.Strings *note A.4.1(6): 6325.
+ <in> Ada.Strings *note A.4.1(6): 6325.
Alignment (subtype) aspect *note 13.3(26.4/2): 5480.
Alignment attribute *note 13.3(23/2): 5472, *note 13.3(26.2/2): 5476.
Alignment clause *note 13.3(7/2): 5443, *note 13.3(25/2): 5474, *note
@@ -132823,28 +133310,28 @@ All_Calls_Remote aspect *note E.2.3(16/3): 8904.
All_Calls_Remote pragma *note E.2.3(5): 8892, *note L(2): 9470.
All_Checks *note 11.5(25/3): 5077.
Allocate
- in System.Storage_Pools *note 13.11(7): 5697.
- in System.Storage_Pools.Subpools *note 13.11.4(14/3): 5784.
+ <in> System.Storage_Pools *note 13.11(7): 5697.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(14/3): 5784.
Allocate_From_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(11/3): 5781.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(11/3): 5781.
Allocation_Check *note 11.5(19.2/2): 5073.
- [partial] *note 4.8(10.2/2): 3308, *note 4.8(10.3/2): 3311, *note
+ [<partial>] *note 4.8(10.2/2): 3308, *note 4.8(10.3/2): 3311, *note
4.8(10.4/3): 3316, *note 13.11.4(30/3): 5801.
allocator *note 4.8(2/3): 3279.
- used *note 4.4(7/3): 2926, *note P: 10089.
+ <used> *note 4.4(7/3): 2926, *note P: 10089.
Alphanumeric
- in Interfaces.COBOL *note B.4(16/3): 8241.
+ <in> Interfaces.COBOL *note B.4(16/3): 8241.
alphanumeric character
a category of Character *note A.3.2(31): 6037.
Alphanumeric_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6520.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6520.
ambiguous *note 8.6(30): 4217.
ambiguous cursor
of a vector *note A.18.2(240/2): 7423.
ambiguous grammar *note 1.1.4(14.a): 1091.
Amendment Correction *note 1.1.2(39.n/3): 1055.
ampersand *note 2.1(15/3): 1198.
- in Ada.Characters.Latin_1 *note A.3.3(8): 6081.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6081.
ampersand operator *note 4.4(1/3): 2839, *note 4.5.3(3): 3039.
ancestor *note N(3.1/2): 9658.
of a library unit *note 10.1.1(11): 4742.
@@ -132857,9 +133344,9 @@ ancestor subtype
ancestor type
of an extension_aggregate *note 4.3.2(5/3): 2737.
Ancestor_Find
- in Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7866.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7866.
ancestor_part *note 4.3.2(3): 2732.
- used *note 4.3.2(2): 2730, *note P: 10021.
+ <used> *note 4.3.2(2): 2730, *note P: 10021.
and operator *note 4.4(1/3): 2795, *note 4.5.1(2): 2960.
and then (short-circuit control form) *note 4.4(1/3): 2801, *note
4.5.1(1): 2955.
@@ -132874,24 +133361,24 @@ anonymous array type *note 3.3.1(1/3): 1555.
anonymous protected type *note 3.3.1(1/3): 1557.
anonymous task type *note 3.3.1(1/3): 1556.
anonymous type *note 3.2.1(7/2): 1460.
-Any_Priority subtype of Integer
- in System *note 13.7(16): 5625.
+Any_Priority <subtype of> Integer
+ <in> System *note 13.7(16): 5625.
APC
- in Ada.Characters.Latin_1 *note A.3.3(19): 6172.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6172.
apostrophe *note 2.1(15/3): 1199.
- in Ada.Characters.Latin_1 *note A.3.3(8): 6082.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6082.
Append
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 7461.
- in Ada.Containers.Vectors *note A.18.2(46/2): 7381, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 7461.
+ <in> Ada.Containers.Vectors *note A.18.2(46/2): 7381, *note
A.18.2(47/2): 7382.
- in Ada.Strings.Bounded *note A.4.4(13): 6404, *note A.4.4(14):
+ <in> Ada.Strings.Bounded *note A.4.4(13): 6404, *note A.4.4(14):
6405, *note A.4.4(15): 6406, *note A.4.4(16): 6407, *note A.4.4(17):
6408, *note A.4.4(18): 6409, *note A.4.4(19): 6410, *note A.4.4(20):
6411.
- in Ada.Strings.Unbounded *note A.4.5(12): 6466, *note A.4.5(13):
+ <in> Ada.Strings.Unbounded *note A.4.5(12): 6466, *note A.4.5(13):
6467, *note A.4.5(14): 6468.
Append_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7878.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7878.
applicable index constraint *note 4.3.3(10): 2775.
application areas *note 1.1.2(7): 1007.
applies
@@ -132913,69 +133400,77 @@ arbitrary order *note 1.1.4(18): 1097.
7.6.1(11.1/3): 4020, *note 7.6.1(20.2/3): 4029, *note 9.7.1(15): 4615,
*note 9.8(4): 4663, *note 12.3(20): 5182, *note 13.11.5(7/3): 5807.
Arccos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9046.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6694.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6694.
Arccosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9054.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6705.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6705.
Arccot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9048.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6698.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6698.
Arccoth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9056.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6707.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6707.
Arcsin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9045.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6692.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6692.
Arcsinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9053.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6704.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6704.
Arctan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 9047.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6696.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6696.
Arctanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 9055.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6706.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6706.
ARG *note 1.3(1.c/3): 1159.
Argument
- in Ada.Command_Line *note A.15(5): 7228.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9158,
+ <in> Ada.Command_Line *note A.15(5): 7228.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9158,
*note G.3.2(31/2): 9170.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 9024.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 9024.
argument of a pragma *note 2.8(9): 1328.
Argument_Count
- in Ada.Command_Line *note A.15(4): 7227.
+ <in> Ada.Command_Line *note A.15(4): 7227.
Argument_Error
- in Ada.Numerics *note A.5(3/2): 6674.
+ <in> Ada.Numerics *note A.5(3/2): 6674.
Arithmetic
- child of Ada.Calendar *note 9.6.1(8/2): 4548.
+ <child of> Ada.Calendar *note 9.6.1(8/2): 4548.
array *note 3.6(1): 2004.
array component expression *note 4.3.3(6): 2769.
array component iterator *note 5.5.2(3/3): 3502.
array for a loop *note 5.5.2(11/3): 3512.
array indexing
- See indexed_component *note 4.1.1(1): 2578.
+ <See> indexed_component *note 4.1.1(1): 2578.
array slice *note 4.1.2(1): 2591.
array type *note 3.6(1): 2005, *note N(4): 9659.
array_aggregate *note 4.3.3(2): 2748.
- used *note 4.3(2): 2692, *note 13.4(3): 5534, *note P: 10012.
+ <used> *note 4.3(2): 2692, *note 13.4(3): 5534, *note P: 10012.
array_component_association *note 4.3.3(5/2): 2763.
- used *note 4.3.3(4): 2761, *note P: 10036.
+ <used> *note 4.3.3(4): 2761, *note P: 10036.
array_type_definition *note 3.6(2): 2006.
- used *note 3.2.1(4/2): 1453, *note 3.3.1(2/3): 1568, *note
+ <used> *note 3.2.1(4/2): 1453, *note 3.3.1(2/3): 1568, *note
12.5.3(2): 5277, *note P: 9840.
ASCII
package physically nested within the declaration of Standard *note
A.1(36.3/2): 5982.
- in Standard *note A.1(36.3/2): 5981.
+ <in> Standard *note A.1(36.3/2): 5981.
aspect *note 13.1(0.1/3): 5340, *note K.1(1/3): 9422, *note N(4.1/3):
9660.
class-wide *note 13.1.1(28/4): 5414.
@@ -132983,15 +133478,15 @@ aspect *note 13.1(0.1/3): 5340, *note K.1(1/3):
9422, *note N(4.1/3):
predicate *note 3.2.4(1/3): 1510.
aspect of representation *note 13.1(8/3): 5361.
aspect_clause *note 13.1(2/1): 5345.
- used *note 3.8(5/1): 2174, *note 3.11(4/1): 2515, *note 9.1(5/1):
+ <used> *note 3.8(5/1): 2174, *note 3.11(4/1): 2515, *note 9.1(5/1):
4266, *note 9.4(5/1): 4332, *note 9.4(8/4): 4347, *note P: 10351.
aspect_definition *note 13.1.1(4/3): 5398.
- used *note 13.1.1(2/3): 5393, *note P: 10586.
+ <used> *note 13.1.1(2/3): 5393, *note P: 10586.
aspect_mark *note 13.1.1(3/3): 5396.
- used *note 2.8(3/3): 1323, *note 11.4.2(6.1/3): 5028, *note
+ <used> *note 2.8(3/3): 1323, *note 11.4.2(6.1/3): 5028, *note
13.1.1(2/3): 5392, *note L(2.3/3): 9481, *note P: 9783.
aspect_specification *note 13.1.1(2/3): 5391.
- used *note 3.2.1(3/3): 1446, *note 3.2.2(2/3): 1473, *note
+ <used> *note 3.2.1(3/3): 1446, *note 3.2.2(2/3): 1473, *note
3.3.1(2/3): 1562, *note 3.8(6/3): 2179, *note 3.9.3(1.1/3): 2347, *note
6.1(2/3): 3543, *note 6.3(2/3): 3673, *note 6.7(2/3): 3838, *note
6.8(2/4): 3849, *note 7.1(3/3): 3871, *note 7.2(2/3): 3886, *note
@@ -133080,7 +133575,7 @@ aspects
Write'Class *note 13.13.2(38/4): 5914.
assembly language *note C.1(4/3): 8312.
Assert
- in Ada.Assertions *note 11.4.2(14/2): 5037.
+ <in> Ada.Assertions *note 11.4.2(14/2): 5037.
Assert pragma *note 11.4.2(3/2): 5020, *note L(2.1/2): 9473.
assertion *note N(4.2/3): 9661.
assertion expressions *note 11.4.2(1.1/3): 5018.
@@ -133091,23 +133586,23 @@ Assertion_Error
raised by failure of run-time check *note 3.2.4(31.1/4): 1528,
*note 4.6(57/4): 3249, *note 6.1.1(32/3): 3636, *note 6.1.1(33/3): 3639,
*note 6.1.1(35/3): 3646, *note 7.3.2(22/3): 3944.
- in Ada.Assertions *note 11.4.2(13/2): 5035.
+ <in> Ada.Assertions *note 11.4.2(13/2): 5035.
Assertion_Policy pragma *note 11.4.2(6.1/3): 5027, *note 11.4.2(6/2):
5024, *note L(2.2/2): 9477, *note L(2.3/3): 9480.
assertions *note 11.4.2(1.1/3): 5017.
- child of Ada *note 11.4.2(12/2): 5034.
+ <child of> Ada *note 11.4.2(12/2): 5034.
Assign
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 7454.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 7550.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7685.
- in Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7946.
- in Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7858.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 7604.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7759.
- in Ada.Containers.Vectors *note A.18.2(34.7/3): 7368.
- See assignment operation *note 5.2(3): 3405.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 7454.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 7550.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7685.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7946.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7858.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 7604.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7759.
+ <in> Ada.Containers.Vectors *note A.18.2(34.7/3): 7368.
+ <See> assignment operation *note 5.2(3): 3405.
Assign_Task
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
8816.
assigning back of parameters *note 6.4.1(17): 3767.
assignment
@@ -133129,7 +133624,7 @@ mode in *note 12.4(11): 5216.
during parameter copy back *note 6.4.1(17): 3768.
list of uses *note 7.6.1(24.d): 4030.
assignment_statement *note 5.2(2): 3401.
- used *note 5.1(4/2): 3371, *note P: 10134.
+ <used> *note 5.1(4/2): 3371, *note P: 10134.
associated components
of a record_component_association *note 4.3.1(10): 2720.
associated declaration
@@ -133143,19 +133638,19 @@ associated object
of a value of a by-reference type *note 6.2(10/4): 3660.
of a value of a limited type *note 6.2(10.f): 3661.
asterisk *note 2.1(15/3): 1203.
- in Ada.Characters.Latin_1 *note A.3.3(8): 6085.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6085.
asynchronous
remote procedure call *note E.4.1(9/3): 8946.
Asynchronous aspect *note E.4.1(8.1/3): 8944.
Asynchronous pragma *note J.15.13(2/3): 9420, *note L(3.1/3): 9486.
asynchronous remote procedure call *note E.4(1): 8922.
asynchronous_select *note 9.7.4(2): 4634.
- used *note 9.7(2): 4590, *note P: 10396.
+ <used> *note 9.7(2): 4590, *note P: 10396.
Asynchronous_Task_Control
- child of Ada *note D.11(3/2): 8705.
+ <child of> Ada *note D.11(3/2): 8705.
at-most-once execution *note E.4(11): 8931.
at_clause *note J.7(1): 9272.
- used *note 13.1(2/1): 5349, *note P: 10578.
+ <used> *note 13.1(2/1): 5349, *note P: 10578.
atomic *note C.6(7/3): 8389.
Atomic aspect *note C.6(6.2/3): 8378.
Atomic pragma *note J.15.8(2/3): 9370, *note L(4.1/3): 9489.
@@ -133163,7 +133658,7 @@ Atomic_Components aspect *note C.6(6.6/3): 8384.
Atomic_Components pragma *note J.15.8(5/3): 9379, *note L(5.1/3):
9492.
Attach_Handler
- in Ada.Interrupts *note C.3.2(7): 8353.
+ <in> Ada.Interrupts *note C.3.2(7): 8353.
Attach_Handler aspect *note C.3.1(6.3/3): 8329.
Attach_Handler pragma *note J.15.7(4/3): 9363, *note L(6.1/3): 9495.
attaching
@@ -133174,14 +133669,14 @@ attribute *note 4.1.4(1): 2621, *note K.2(1/3):
9423.
specifying *note 13.3(1/1): 5427.
stream-oriented *note 13.13.2(1/3): 5869.
attribute_definition_clause *note 13.3(2): 5428.
- used *note 13.1(2/1): 5346, *note P: 10575.
+ <used> *note 13.1(2/1): 5346, *note P: 10575.
attribute_designator *note 4.1.4(3/2): 2625.
- used *note 4.1.4(2): 2624, *note 13.1(3): 5353, *note 13.3(2):
+ <used> *note 4.1.4(2): 2624, *note 13.1(3): 5353, *note 13.3(2):
5433, *note P: 10595.
Attribute_Handle
- in Ada.Task_Attributes *note C.7.2(3): 8422.
+ <in> Ada.Task_Attributes *note C.7.2(3): 8422.
attribute_reference *note 4.1.4(2): 2622.
- used *note 4.1(2/3): 2547, *note P: 9977.
+ <used> *note 4.1(2/3): 2547, *note P: 9977.
attributes
Access *note 3.10.2(25/1): 2481, *note 3.10.2(33/3): 2491.
Address *note 13.3(11): 5463, *note J.7.1(5): 9277.
@@ -133306,10 +133801,10 @@ Backus-Naur Form (BNF)
cross reference *note P: 10626.
notation *note 1.1.4(3): 1088.
under Syntax heading *note 1.1.2(25): 1017.
-Barrier_Limit subtype of Positive
- in Ada.Synchronous_Barriers *note D.10.1(4/3): 8701.
+Barrier_Limit <subtype of> Positive
+ <in> Ada.Synchronous_Barriers *note D.10.1(4/3): 8701.
base *note 2.4.2(3): 1291, *note 2.4.2(6): 1299.
- used *note 2.4.2(2): 1287, *note P: 9761.
+ <used> *note 2.4.2(2): 1287, *note P: 9761.
base 16 literal *note 2.4.2(1): 1284.
base 2 literal *note 2.4.2(1): 1278.
base 8 literal *note 2.4.2(1): 1281.
@@ -133331,27 +133826,27 @@ base range
base subtype
of a type *note 3.5(15): 1711.
Base_Name
- in Ada.Directories *note A.16(19/2): 7250.
+ <in> Ada.Directories *note A.16(19/2): 7250.
based_literal *note 2.4.2(2): 1286.
- used *note 2.4(2): 1262, *note P: 9752.
+ <used> *note 2.4(2): 1262, *note P: 9752.
based_numeral *note 2.4.2(4): 1293.
- used *note 2.4.2(2): 1289, *note P: 9763.
+ <used> *note 2.4.2(2): 1289, *note P: 9763.
basic letter
a category of Character *note A.3.2(27): 6034.
basic_declaration *note 3.1(3/3): 1352.
- used *note 3.11(4/1): 2514, *note P: 9963.
+ <used> *note 3.11(4/1): 2514, *note P: 9963.
basic_declarative_item *note 3.11(4/1): 2513.
- used *note 3.11(3): 2511, *note 7.1(3/3): 3872, *note P: 10261.
+ <used> *note 3.11(3): 2511, *note 7.1(3/3): 3872, *note P: 10261.
Basic_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6525.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6525.
Basic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6517.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6517.
Beaujolais effect *note 8.4(1.b): 4103.
- [partial] *note 3.6(18.b): 2044, *note 8.6(22.a): 4208, *note
+ [<partial>] *note 3.6(18.b): 2044, *note 8.6(22.a): 4208, *note
8.6(34.a): 4220, *note 8.6(34.k): 4222.
become nonlimited *note 7.3.1(5/1): 3926, *note 7.5(16): 3960.
BEL
- in Ada.Characters.Latin_1 *note A.3.3(5): 6050.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6050.
belong
to a range *note 3.5(4): 1687.
to a subtype *note 3.2(8/2): 1426.
@@ -133362,21 +133857,21 @@ big endian *note 13.5.3(2): 5587.
big-O notation *note A.18(3.b/2): 7320.
binary
literal *note 2.4.2(1): 1279.
- in Interfaces.COBOL *note B.4(10): 8232.
+ <in> Interfaces.COBOL *note B.4(10): 8232.
binary adding operator *note 4.5.3(1): 3027.
binary literal *note 2.4.2(1): 1277.
binary operator *note 4.5(9): 2947.
binary_adding_operator *note 4.5(4): 2941.
- used *note 4.4(4): 2910, *note P: 10076.
+ <used> *note 4.4(4): 2910, *note P: 10076.
Binary_Format
- in Interfaces.COBOL *note B.4(24): 8253.
+ <in> Interfaces.COBOL *note B.4(24): 8253.
bit field
- See record_representation_clause *note 13.5.1(1): 5551.
+ <See> record_representation_clause *note 13.5.1(1): 5551.
bit ordering *note 13.5.3(2): 5585.
bit string
- See logical operators on boolean arrays *note 4.5.1(2): 2966.
+ <See> logical operators on boolean arrays *note 4.5.1(2): 2966.
Bit_Order
- in System *note 13.7(15/2): 5621.
+ <in> System *note 13.7(15/2): 5621.
Bit_Order aspect *note 13.5.3(4): 5597.
Bit_Order attribute *note 13.5.3(4): 5593.
Bit_Order clause *note 13.3(7/2): 5448, *note 13.5.3(4): 5595.
@@ -133384,11 +133879,11 @@ blank
in text input for enumeration and numeric types *note A.10.6(5/2):
7118.
Blank_When_Zero
- in Ada.Text_IO.Editing *note F.3.3(7): 8987.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8987.
block_statement *note 5.6(2): 3519.
- used *note 5.1(5/2): 3386, *note P: 10148.
+ <used> *note 5.1(5/2): 3386, *note P: 10148.
blocked
- [partial] *note D.2.1(11/3): 8480.
+ [<partial>] *note D.2.1(11/3): 8480.
a task state *note 9(10): 4240.
during an entry call *note 9.5.3(19): 4482.
execution of a selective_accept *note 9.7.1(16): 4616.
@@ -133410,23 +133905,23 @@ BNF (Backus-Naur Form)
notation *note 1.1.4(3): 1087.
under Syntax heading *note 1.1.2(25): 1016.
body *note 3.11(5): 2517, *note 3.11.1(1/3): 2537.
- used *note 3.11(3): 2512, *note P: 9962.
+ <used> *note 3.11(3): 2512, *note P: 9962.
body_stub *note 10.1.3(2): 4782.
- used *note 3.11(5): 2519, *note P: 9967.
+ <used> *note 3.11(5): 2519, *note P: 9967.
Body_Version attribute *note E.3(4): 8915.
BOM_16
- in Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6639.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6639.
BOM_16BE
- in Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6637.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6637.
BOM_16LE
- in Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6638.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6638.
BOM_8
- in Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6636.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6636.
Boolean *note 3.5.3(1): 1820.
- in Standard *note A.1(5): 5973.
+ <in> Standard *note A.1(5): 5973.
boolean type *note 3.5.3(1): 1823.
Bounded
- child of Ada.Strings *note A.4.4(3): 6394.
+ <child of> Ada.Strings *note A.4.4(3): 6394.
bounded error *note 1.1.2(31): 1038, *note 1.1.5(8): 1106.
cause *note 4.8(11.1/2): 3320, *note 6.2(12/3): 3667, *note
7.6.1(14/1): 4022, *note 9.4(20.1/2): 4368, *note 9.5.1(8): 4399, *note
@@ -133444,18 +133939,18 @@ A.18.24(12/3): 7981, *note A.18.25(14/3): 7984,
*note C.7.1(17/3): 8417,
*note C.7.2(13.2/1): 8429, *note D.2.6(30/2): 8531, *note D.3(13.1/2):
8553, *note E.1(10/2): 8842, *note E.3(6): 8918, *note J.7.1(11): 9283.
Bounded_IO
- child of Ada.Text_IO *note A.10.11(3/2): 7128.
- child of Ada.Wide_Text_IO *note A.11(4/3): 7154.
- child of Ada.Wide_Wide_Text_IO *note A.11(4/3): 7155.
+ <child of> Ada.Text_IO *note A.10.11(3/2): 7128.
+ <child of> Ada.Wide_Text_IO *note A.11(4/3): 7154.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(4/3): 7155.
Bounded_Priority_Queues
- child of Ada.Containers *note A.18.31(2/3): 8025.
+ <child of> Ada.Containers *note A.18.31(2/3): 8025.
Bounded_Slice
- in Ada.Strings.Bounded *note A.4.4(28.1/2): 6415, *note
+ <in> Ada.Strings.Bounded *note A.4.4(28.1/2): 6415, *note
A.4.4(28.2/2): 6416.
Bounded_String
- in Ada.Strings.Bounded *note A.4.4(6): 6397.
+ <in> Ada.Strings.Bounded *note A.4.4(6): 6397.
Bounded_Synchronized_Queues
- child of Ada.Containers *note A.18.29(2/3): 8010.
+ <child of> Ada.Containers *note A.18.29(2/3): 8010.
bounds
of a discrete_range *note 3.6.1(6): 2064.
of an array *note 3.6(13): 2034.
@@ -133463,25 +133958,25 @@ bounds
box
compound delimiter *note 3.6(15): 2039.
BPH
- in Ada.Characters.Latin_1 *note A.3.3(17): 6143.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6143.
broadcast signal
- See protected object *note 9.4(1): 4313.
- See requeue *note 9.5.4(1): 4487.
+ <See> protected object *note 9.4(1): 4313.
+ <See> requeue *note 9.5.4(1): 4487.
Broken_Bar
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6180.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6180.
BS
- in Ada.Characters.Latin_1 *note A.3.3(5): 6051.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6051.
budget *note D.14.2(14/2): 8772.
Budget_Has_Expired
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8765.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8765.
Budget_Remaining
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8766.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8766.
Buffer_Size
- in Ada.Storage_IO *note A.9(4): 6938.
-Buffer_Type subtype of Storage_Array
- in Ada.Storage_IO *note A.9(4): 6939.
+ <in> Ada.Storage_IO *note A.9(4): 6938.
+Buffer_Type <subtype of> Storage_Array
+ <in> Ada.Storage_IO *note A.9(4): 6939.
build-in-place
- See built in place
+ <See> built in place
built in place *note 7.6(17.1/3): 3993.
by copy parameter passing *note 6.2(2): 3653.
by reference parameter passing *note 6.2(2): 3656.
@@ -133489,12 +133984,12 @@ by-copy type *note 6.2(3/3): 3658.
by-reference type *note 6.2(4): 3659.
atomic or volatile *note C.6(18): 8395.
Byte
- in Interfaces.COBOL *note B.4(29/3): 8260.
- See storage element *note 13.3(8): 5460.
+ <in> Interfaces.COBOL *note B.4(29/3): 8260.
+ <See> storage element *note 13.3(8): 5460.
byte sex
- See ordering of storage elements in a word *note 13.5.3(5): 5598.
+ <See> ordering of storage elements in a word *note 13.5.3(5): 5598.
Byte_Array
- in Interfaces.COBOL *note B.4(29/3): 8261.
+ <in> Interfaces.COBOL *note B.4(29/3): 8261.
@@ -133506,15 +134001,15 @@ C
C
- child of Interfaces *note B.3(4): 8106.
+ <child of> Interfaces *note B.3(4): 8106.
C interface *note B.3(1/4): 8105.
C standard *note 1.2(7/3): 1143.
C++ standard *note 1.2(9/3): 1149.
C_float
- in Interfaces.C *note B.3(15): 8122.
+ <in> Interfaces.C *note B.3(15): 8122.
C_Variadic *note B.3(60.16/4): 8169.
Calendar
- child of Ada *note 9.6(10): 4517.
+ <child of> Ada *note 9.6(10): 4517.
call *note 6(2/3): 3538.
master of *note 3.10.2(10.1/3): 2471.
call on a dispatching operation *note 3.9.2(2/3): 2315.
@@ -133533,11 +134028,11 @@ calling convention *note 6.3.1(2/1): 3688, *note
B.1(11/3): 8072.
calling partition *note E.4(1): 8923.
calling stub *note E.4(10): 8929.
CAN
- in Ada.Characters.Latin_1 *note A.3.3(6): 6067.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6067.
Cancel_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8769.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8744.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8790.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8769.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8744.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8790.
cancellation
of a delay_statement *note 9.6(22/3): 4536.
of an entry call *note 9.5.3(20): 4483.
@@ -133551,25 +134046,25 @@ capacity
of a hashed set *note A.18.8(63/2): 7727.
of a queue *note A.18.27(10/3): 8001.
of a vector *note A.18.2(2/2): 7334.
- in Ada.Containers.Hashed_Maps *note A.18.5(8/2): 7535.
- in Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7676.
- in Ada.Containers.Vectors *note A.18.2(19/2): 7347.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(8/2): 7535.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7676.
+ <in> Ada.Containers.Vectors *note A.18.2(19/2): 7347.
Capacity_Error
- in Ada.Containers *note A.18.1(5.1/3): 7328.
+ <in> Ada.Containers *note A.18.1(5.1/3): 7328.
case insensitive *note 2.3(5/3): 1254.
case_expression *note 4.5.7(5/3): 3117.
- used *note 4.5.7(2/3): 3108, *note P: 10094.
+ <used> *note 4.5.7(2/3): 3108, *note P: 10094.
case_expression_alternative *note 4.5.7(6/3): 3121.
- used *note 4.5.7(5/3): 3120, *note P: 10102.
+ <used> *note 4.5.7(5/3): 3120, *note P: 10102.
case_statement *note 5.4(2/3): 3429.
- used *note 5.1(5/2): 3384, *note P: 10146.
+ <used> *note 5.1(5/2): 3384, *note P: 10146.
case_statement_alternative *note 5.4(3): 3433.
- used *note 5.4(2/3): 3431, *note P: 10162.
+ <used> *note 5.4(2/3): 3431, *note P: 10162.
cast
- See type conversion *note 4.6(1/3): 3152.
- See unchecked type conversion *note 13.9(1): 5662.
+ <See> type conversion *note 4.6(1/3): 3152.
+ <See> unchecked type conversion *note 13.9(1): 5662.
catch (an exception)
- See handle *note 11(1/3): 4923.
+ <See> handle *note 11(1/3): 4923.
categorization aspect *note E.2(2/3): 8848.
categorization pragma *note E.2(2/3): 8844.
Remote_Call_Interface *note E.2.3(2): 8886.
@@ -133581,53 +134076,53 @@ category
category (of types) *note N(4.3/2): 9662.
category determined for a formal type *note 12.5(6/3): 5253.
catenation operator
- See concatenation operator *note 4.4(1/3): 2843.
- See concatenation operator *note 4.5.3(3): 3043.
+ <See> concatenation operator *note 4.4(1/3): 2843.
+ <See> concatenation operator *note 4.5.3(3): 3043.
Cause_Of_Termination
- in Ada.Task_Termination *note C.7.3(3/2): 8434.
+ <in> Ada.Task_Termination *note C.7.3(3/2): 8434.
CCH
- in Ada.Characters.Latin_1 *note A.3.3(18): 6161.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6161.
cease to exist
object *note 7.6.1(11/3): 4017, *note 13.11.2(10/4): 5747.
type *note 7.6.1(11/3): 4018.
Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(22): 6200.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6200.
Ceiling
- in Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7630.
- in Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7791, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7630.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7791, *note
A.18.9(71/2): 7804.
Ceiling attribute *note A.5.3(33): 6791.
ceiling priority
of a protected object *note D.3(8/3): 8549.
Ceiling_Check
- [partial] *note C.3.1(11/3): 8337, *note D.3(13): 8550.
+ [<partial>] *note C.3.1(11/3): 8337, *note D.3(13): 8550.
Ceiling_Locking locking policy *note D.3(7): 8548.
Cent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6176.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6176.
change of representation *note 13.6(1/3): 5601.
char
- in Interfaces.C *note B.3(19): 8125.
+ <in> Interfaces.C *note B.3(19): 8125.
char16_array
- in Interfaces.C *note B.3(39.5/3): 8149.
+ <in> Interfaces.C *note B.3(39.5/3): 8149.
char16_nul
- in Interfaces.C *note B.3(39.3/2): 8146.
+ <in> Interfaces.C *note B.3(39.3/2): 8146.
char16_t
- in Interfaces.C *note B.3(39.2/2): 8145.
+ <in> Interfaces.C *note B.3(39.2/2): 8145.
char32_array
- in Interfaces.C *note B.3(39.14/3): 8159.
+ <in> Interfaces.C *note B.3(39.14/3): 8159.
char32_nul
- in Interfaces.C *note B.3(39.12/2): 8156.
+ <in> Interfaces.C *note B.3(39.12/2): 8156.
char32_t
- in Interfaces.C *note B.3(39.11/2): 8155.
+ <in> Interfaces.C *note B.3(39.11/2): 8155.
char_array
- in Interfaces.C *note B.3(23/3): 8129.
+ <in> Interfaces.C *note B.3(23/3): 8129.
char_array_access
- in Interfaces.C.Strings *note B.3.1(4): 8176.
+ <in> Interfaces.C.Strings *note B.3.1(4): 8176.
CHAR_BIT
- in Interfaces.C *note B.3(6): 8107.
+ <in> Interfaces.C *note B.3(6): 8107.
Character *note 3.5.2(2/3): 1806.
- used *note 2.7(2): 1310, *note P: 9773.
- in Standard *note A.1(35/3): 5978.
+ <used> *note 2.7(2): 1310, *note P: 9773.
+ <in> Standard *note A.1(35/3): 5978.
character encoding *note A.4.11(46/3): 6669.
character plane *note 2.1(1/3): 1174.
character set *note 2.1(1/3): 1172.
@@ -133638,33 +134133,33 @@ character set standard
control functions *note 1.2(5): 1135.
character type *note 3.5.2(1): 1802, *note N(5): 9663.
character_literal *note 2.5(2): 1300.
- used *note 3.5.1(4): 1794, *note 4.1(2/3): 2550, *note 4.1.3(3):
+ <used> *note 3.5.1(4): 1794, *note 4.1(2/3): 2550, *note 4.1.3(3):
2608, *note P: 9860.
Character_Mapping
- in Ada.Strings.Maps *note A.4.2(20/2): 6345.
+ <in> Ada.Strings.Maps *note A.4.2(20/2): 6345.
Character_Mapping_Function
- in Ada.Strings.Maps *note A.4.2(25): 6351.
+ <in> Ada.Strings.Maps *note A.4.2(25): 6351.
Character_Range
- in Ada.Strings.Maps *note A.4.2(6): 6334.
+ <in> Ada.Strings.Maps *note A.4.2(6): 6334.
Character_Ranges
- in Ada.Strings.Maps *note A.4.2(7): 6335.
-Character_Sequence subtype of String
- in Ada.Strings.Maps *note A.4.2(16): 6341.
+ <in> Ada.Strings.Maps *note A.4.2(7): 6335.
+Character_Sequence <subtype of> String
+ <in> Ada.Strings.Maps *note A.4.2(16): 6341.
Character_Set
- in Ada.Strings.Maps *note A.4.2(4/2): 6332.
- in Ada.Strings.Wide_Maps *note A.4.7(46/2): 6564.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6607.
- in Interfaces.Fortran *note B.5(11): 8293.
+ <in> Ada.Strings.Maps *note A.4.2(4/2): 6332.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(46/2): 6564.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6607.
+ <in> Interfaces.Fortran *note B.5(11): 8293.
Character_Set_Version
- in Ada.Wide_Characters.Handling *note A.3.5(4/3): 6293.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(4/3): 6293.
characteristics
- [partial] *note 3.4(7/3): 1630.
+ [<partial>] *note 3.4(7/3): 1630.
Characters
- child of Ada *note A.3.1(2): 5997.
+ <child of> Ada *note A.3.1(2): 5997.
chars_ptr
- in Interfaces.C.Strings *note B.3.1(5/2): 8177.
+ <in> Interfaces.C.Strings *note B.3.1(5/2): 8177.
chars_ptr_array
- in Interfaces.C.Strings *note B.3.1(6/2): 8178.
+ <in> Interfaces.C.Strings *note B.3.1(6/2): 8178.
check
language-defined *note 11.5(2/3): 5045, *note 11.6(1/3): 5085.
check, language-defined
@@ -133721,24 +134216,24 @@ checking pragmas *note 11.5(1/2): 5043.
child
of a library unit *note 10.1.1(1): 4706.
Child_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7872.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7872.
Child_Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7873.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7873.
choice
of an exception_handler *note 11.2(5.b/3): 4959.
choice parameter *note 11.2(9): 4961.
choice_expression *note 4.4(2.1/3): 2878.
- used *note 3.8.1(5/3): 2213, *note P: 9934.
+ <used> *note 3.8.1(5/3): 2213, *note P: 9934.
choice_parameter_specification *note 11.2(4): 4954.
- used *note 11.2(3): 4950, *note P: 10474.
+ <used> *note 11.2(3): 4950, *note P: 10474.
choice_relation *note 4.4(2.2/3): 2889.
- used *note 4.4(2.1/3): 2888, *note P: 10055.
+ <used> *note 4.4(2.1/3): 2888, *note P: 10055.
Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(12): 6102.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6102.
class
of types *note 3.2(2/2): 1398, *note 3.4(1.1/2): 1617.
- See also package *note 7(1): 3866.
- See also tag *note 3.9(3): 2245.
+ <See also> package *note 7(1): 3866.
+ <See also> tag *note 3.9(3): 2245.
class (of types) *note N(6/2): 9664.
Class attribute *note 3.9(14): 2265, *note 7.3.1(9): 3931, *note
J.11(2/2): 9294.
@@ -133749,36 +134244,36 @@ class-wide precondition expression *note
6.1.1(3/3): 3611.
class-wide type *note 3.4.1(4): 1657, *note 3.7(26): 2130.
class-wide type invariant *note 7.3.2(3/4): 3937.
cleanup
- See finalization *note 7.6.1(1): 4001.
+ <See> finalization *note 7.6.1(1): 4001.
clear
execution timer object *note D.14.1(12/2): 8748.
group budget object *note D.14.2(15/2): 8776.
timing event object *note D.15(9/2): 8794.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 7446.
- in Ada.Containers.Hashed_Maps *note A.18.5(12/2): 7539.
- in Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7680.
- in Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7937.
- in Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7849.
- in Ada.Containers.Ordered_Maps *note A.18.6(11/2): 7593.
- in Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7754.
- in Ada.Containers.Vectors *note A.18.2(24/2): 7352.
- in Ada.Environment_Variables *note A.17(7/2): 7309.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 7446.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(12/2): 7539.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7680.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7937.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7849.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(11/2): 7593.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7754.
+ <in> Ada.Containers.Vectors *note A.18.2(24/2): 7352.
+ <in> Ada.Environment_Variables *note A.17(7/2): 7309.
cleared
termination handler *note C.7.3(9/2): 8447.
clock *note 9.6(6/3): 4516.
- in Ada.Calendar *note 9.6(12): 4523.
- in Ada.Execution_Time *note D.14(5/2): 8725.
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8781.
- in Ada.Real_Time *note D.8(6): 8665.
+ <in> Ada.Calendar *note 9.6(12): 4523.
+ <in> Ada.Execution_Time *note D.14(5/2): 8725.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8781.
+ <in> Ada.Real_Time *note D.8(6): 8665.
clock jump *note D.8(32): 8680.
clock tick *note D.8(23): 8679.
Clock_For_Interrupts
- in Ada.Execution_Time *note D.14(9.3/3): 8730.
+ <in> Ada.Execution_Time *note D.14(9.3/3): 8730.
Close
- in Ada.Direct_IO *note A.8.4(8): 6910.
- in Ada.Sequential_IO *note A.8.1(8): 6880.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7171.
- in Ada.Text_IO *note A.10.1(11): 6969.
+ <in> Ada.Direct_IO *note A.8.4(8): 6910.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6880.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7171.
+ <in> Ada.Text_IO *note A.10.1(11): 6969.
close result set *note G.2.3(5): 9112.
closed entry *note 9.5.3(5): 4465.
of a protected object *note 9.5.3(7/3): 4470.
@@ -133788,41 +134283,41 @@ closed under derivation *note 3.2(2.b/2): 1405,
*note 3.4(28): 1645,
closure
downward *note 3.10.2(13.b/2): 2474, *note 3.10.2(38/2): 2501.
COBOL
- child of Interfaces *note B.4(7): 8229.
+ <child of> Interfaces *note B.4(7): 8229.
COBOL interface *note B.4(1/3): 8228.
COBOL standard *note 1.2(4/2): 1129.
COBOL_Character
- in Interfaces.COBOL *note B.4(13): 8238.
+ <in> Interfaces.COBOL *note B.4(13): 8238.
COBOL_To_Ada
- in Interfaces.COBOL *note B.4(15): 8240.
+ <in> Interfaces.COBOL *note B.4(15): 8240.
code point
for characters *note 3.5.2(2/3): 1808, *note 3.5.2(11.p/3): 1819.
code_statement *note 13.8(2): 5650.
- used *note 5.1(4/2): 3381, *note P: 10144.
+ <used> *note 5.1(4/2): 3381, *note P: 10144.
Coding aspect *note 13.4(7): 5539.
coextension
of an object *note 3.10.2(14.4/3): 2476.
Col
- in Ada.Text_IO *note A.10.1(37): 7022.
+ <in> Ada.Text_IO *note A.10.1(37): 7022.
collection
of an access type *note 7.6.1(11.1/3): 4019.
colon *note 2.1(15/3): 1214.
- in Ada.Characters.Latin_1 *note A.3.3(10): 6092.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6092.
column number *note A.10(9): 6951.
comma *note 2.1(15/3): 1206.
- in Ada.Characters.Latin_1 *note A.3.3(8): 6087.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6087.
Command_Line
- child of Ada *note A.15(3): 7226.
+ <child of> Ada *note A.15(3): 7226.
Command_Name
- in Ada.Command_Line *note A.15(6): 7229.
+ <in> Ada.Command_Line *note A.15(6): 7229.
comment *note 2.7(2): 1309.
comments, instructions for submission *note 0.3(58/1): 1002.
Commercial_At
- in Ada.Characters.Latin_1 *note A.3.3(10): 6098.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6098.
Communication_Error
- in System.RPC *note E.5(5): 8952.
+ <in> System.RPC *note E.5(5): 8952.
comparison operator
- See relational operator *note 4.5.2(1): 2976.
+ <See> relational operator *note 4.5.2(1): 2976.
compatibility
composite_constraint with an access subtype *note 3.10(15/2): 2434.
constraint with a subtype *note 3.2.2(12): 1495.
@@ -133847,7 +134342,7 @@ compilation units needed
remote call interface *note E.2.3(18): 8905.
shared passive library unit *note E.2.1(11): 8865.
compilation_unit *note 10.1.1(3): 4709.
- used *note 10.1.1(2): 4708, *note P: 10427.
+ <used> *note 10.1.1(2): 4708, *note P: 10427.
compile-time error *note 1.1.2(27): 1022, *note 1.1.5(4): 1100.
compile-time semantics *note 1.1.2(28): 1027.
complete context *note 8.6(4): 4192.
@@ -133859,83 +134354,83 @@ completion
run-time concept *note 7.6.1(2/2): 4004.
completion and leaving (completed and left) *note 7.6.1(2/2): 4003.
completion legality
- [partial] *note 3.10.1(13): 2452.
+ [<partial>] *note 3.10.1(13): 2452.
entry_body *note 9.5.2(16): 4439.
Complex
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 9009.
- in Interfaces.Fortran *note B.5(9): 8289.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 9009.
+ <in> Interfaces.Fortran *note B.5(9): 8289.
Complex_Arrays
- child of Ada.Numerics *note G.3.2(53/2): 9183.
+ <child of> Ada.Numerics *note G.3.2(53/2): 9183.
Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(9/1): 9057.
+ <child of> Ada.Numerics *note G.1.2(9/1): 9057.
Complex_IO
- child of Ada.Text_IO *note G.1.3(3): 9065.
- child of Ada.Wide_Text_IO *note G.1.4(1): 9078.
- child of Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 9080.
+ <child of> Ada.Text_IO *note G.1.3(3): 9065.
+ <child of> Ada.Wide_Text_IO *note G.1.4(1): 9078.
+ <child of> Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 9080.
Complex_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9149.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9149.
Complex_Text_IO
- child of Ada *note G.1.3(9.1/2): 9075.
+ <child of> Ada *note G.1.3(9.1/2): 9075.
Complex_Types
- child of Ada.Numerics *note G.1.1(25/1): 9029.
+ <child of> Ada.Numerics *note G.1.1(25/1): 9029.
Complex_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9148.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 9148.
component *note 3.2(2/2): 1403.
of a type *note 3.2(6/2): 1417.
component subtype *note 3.6(10): 2029.
component_choice_list *note 4.3.1(5): 2712.
- used *note 4.3.1(4/2): 2711, *note P: 10016.
+ <used> *note 4.3.1(4/2): 2711, *note P: 10016.
component_clause *note 13.5.1(3): 5556.
- used *note 13.5.1(2): 5555, *note P: 10602.
+ <used> *note 13.5.1(2): 5555, *note P: 10602.
component_declaration *note 3.8(6/3): 2175.
- used *note 3.8(5/1): 2173, *note 9.4(6): 4335, *note P: 9921.
+ <used> *note 3.8(5/1): 2173, *note 9.4(6): 4335, *note P: 9921.
component_definition *note 3.6(7/2): 2022.
- used *note 3.6(3): 2012, *note 3.6(5): 2018, *note 3.8(6/3): 2177,
-*note P: 9889.
+ <used> *note 3.6(3): 2012, *note 3.6(5): 2018, *note 3.8(6/3):
+2177, *note P: 9889.
component_item *note 3.8(5/1): 2172.
- used *note 3.8(4): 2170, *note P: 9917.
+ <used> *note 3.8(4): 2170, *note P: 9917.
component_list *note 3.8(4): 2167.
- used *note 3.8(3): 2166, *note 3.8.1(3): 2208, *note P: 9931.
+ <used> *note 3.8(3): 2166, *note 3.8.1(3): 2208, *note P: 9931.
Component_Size aspect *note 13.3(70): 5514.
Component_Size attribute *note 13.3(69): 5510.
Component_Size clause *note 13.3(7/2): 5445, *note 13.3(70): 5512.
components
of a record type *note 3.8(9/2): 2181.
Compose
- in Ada.Directories *note A.16(20/2): 7251.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
+ <in> Ada.Directories *note A.16(20/2): 7251.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
7301.
Compose attribute *note A.5.3(24): 6779.
Compose_From_Cartesian
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 9154,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 9154,
*note G.3.2(29/2): 9168.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 9019.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 9019.
Compose_From_Polar
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 9159,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 9159,
*note G.3.2(32/2): 9173.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 9025.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 9025.
composite type *note 3.2(2/2): 1402, *note N(8/2): 9667.
composite_constraint *note 3.2.2(7): 1487.
- used *note 3.2.2(5): 1482, *note P: 9825.
+ <used> *note 3.2.2(5): 1482, *note P: 9825.
compound delimiter *note 2.2(10): 1236.
compound_statement *note 5.1(5/2): 3382.
- used *note 5.1(3): 3368, *note P: 10132.
+ <used> *note 5.1(3): 3368, *note P: 10132.
concatenation operator *note 4.4(1/3): 2841, *note 4.5.3(3): 3041.
concrete subprogram
- See nonabstract subprogram *note 3.9.3(1/2): 2343.
+ <See> nonabstract subprogram *note 3.9.3(1/2): 2343.
concrete type
- See nonabstract type *note 3.9.3(1/2): 2341.
+ <See> nonabstract type *note 3.9.3(1/2): 2341.
concurrent processing
- See task *note 9(1/3): 4233.
+ <See> task *note 9(1/3): 4233.
condition *note 4.5.7(4/3): 3115.
- used *note 4.5.7(3/3): 3110, *note 5.3(2): 3425, *note 5.5(3/3):
+ <used> *note 4.5.7(3/3): 3110, *note 5.3(2): 3425, *note 5.5(3/3):
3451, *note 5.7(2): 3527, *note 9.5.2(7): 4429, *note 9.7.1(3): 4600,
*note P: 10383.
- See also exception *note 11(1/3): 4920.
+ <See also> exception *note 11(1/3): 4920.
conditional_entry_call *note 9.7.3(2): 4630.
- used *note 9.7(2): 4589, *note P: 10395.
+ <used> *note 9.7(2): 4589, *note P: 10395.
conditional_expression *note 4.5.7(2/3): 3106.
- used *note 4.4(7/3): 2928, *note P: 10091.
+ <used> *note 4.4(7/3): 2928, *note P: 10091.
configuration
of the partitions of a program *note E(4): 8831.
configuration pragma *note 10.1.5(8): 4826.
@@ -133960,42 +134455,42 @@ confirming
representation value *note 13.1(18.2/3): 5377.
conformance *note 6.3.1(1): 3682.
of an implementation with the Standard *note 1.1.3(1): 1072.
- See also full conformance, mode conformance, subtype conformance,
+ <See also> full conformance, mode conformance, subtype conformance,
type conformance
Conjugate
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 9161,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 9161,
*note G.3.2(34/2): 9174.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 9027, *note
-G.1.1(15): 9028.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 9027,
+*note G.1.1(15): 9028.
consistency
among compilation units *note 10.1.4(5): 4815.
constant *note 3.3(13/3): 1533.
result of a function_call *note 6.4(12/2): 3744.
- See also literal *note 4.2(1): 2669.
- See also static *note 4.9(1): 3330.
+ <See also> literal *note 4.2(1): 2669.
+ <See also> static *note 4.9(1): 3330.
constant indexing *note 4.1.6(12/3): 2663.
constant object *note 3.3(13/3): 1535.
constant view *note 3.3(13/3): 1537.
Constant_Indexing aspect *note 4.1.6(2/3): 2654.
Constant_Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 7452.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 7546, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 7452.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 7546, *note
A.18.5(17.5/3): 7548.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7684, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7684, *note
A.18.8(58.3/3): 7725.
- in Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7944.
- in Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7856.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 7600, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7944.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7856.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 7600, *note
A.18.6(16.5/3): 7602.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7758, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7758, *note
A.18.9(73.3/3): 7809.
- in Ada.Containers.Vectors *note A.18.2(34.3/3): 7364, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.3/3): 7364, *note
A.18.2(34.5/3): 7366.
Constant_Reference_Type
- in Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7942.
- in Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7854.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7942.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7854.
Constants
- child of Ada.Strings.Maps *note A.4.6(3/2): 6511.
+ <child of> Ada.Strings.Maps *note A.4.6(3/2): 6511.
constituent
of a construct *note 1.1.4(17): 1096.
constrained *note 3.2(9): 1429.
@@ -134011,16 +134506,16 @@ constrained *note 3.2(9): 1429.
subtype *note K.2(33): 9428.
Constrained attribute *note 3.7.2(3/3): 2157, *note J.4(2): 9271.
constrained by its initial value *note 3.3.1(9/2): 1584.
- [partial] *note 4.8(6/3): 3292, *note 6.5(5.11/3): 3798.
+ [<partial>] *note 4.8(6/3): 3292, *note 6.5(5.11/3): 3798.
constrained_array_definition *note 3.6(5): 2015.
- used *note 3.6(2): 2008, *note P: 9882.
+ <used> *note 3.6(2): 2008, *note P: 9882.
constraint *note 3.2.2(5): 1480.
- [partial] *note 3.2(7/2): 1418.
+ [<partial>] *note 3.2(7/2): 1418.
null *note 3.2(7/2): 1420.
of a first array subtype *note 3.6(16): 2042.
of a subtype *note 3.2(8/2): 1424.
of an object *note 3.3.1(9/2): 1583.
- used *note 3.2.2(3/2): 1477, *note P: 9822.
+ <used> *note 3.2.2(3/2): 1477, *note P: 9822.
Constraint_Error
raised by failure of run-time check *note 1.1.5(12.b): 1115, *note
3.2.2(12): 1496, *note 3.5(24): 1719, *note 3.5(27): 1726, *note
@@ -134052,14 +134547,14 @@ K.2(11): 9424, *note K.2(114): 9439, *note
K.2(122): 9442, *note
K.2(184): 9446, *note K.2(202): 9451, *note K.2(220): 9455, *note
K.2(241): 9458, *note K.2(261): 9464, *note K.2(41): 9429, *note
K.2(47): 9432.
- in Standard *note A.1(46): 5987.
+ <in> Standard *note A.1(46): 5987.
Construct *note 1.1.4(16): 1095, *note N(9): 9668.
constructor
- See initialization *note 3.3.1(18/2): 1597.
- See initialization *note 7.6(1): 3967.
- See initialization expression *note 3.3.1(4): 1578.
- See Initialize *note 7.6(1): 3968.
- See initialized allocator *note 4.8(4): 3290.
+ <See> initialization *note 3.3.1(18/2): 1597.
+ <See> initialization *note 7.6(1): 3967.
+ <See> initialization expression *note 3.3.1(4): 1578.
+ <See> Initialize *note 7.6(1): 3968.
+ <See> initialized allocator *note 4.8(4): 3290.
container *note N(9.1/3): 9669.
cursor *note A.18(2/2): 7317.
list *note A.18.3(1/2): 7434.
@@ -134068,46 +134563,46 @@ container *note N(9.1/3): 9669.
vector *note A.18.2(1/2): 7332.
container element iterator *note 5.5.2(3/3): 3504.
Containers
- child of Ada *note A.18.1(3/2): 7325.
+ <child of> Ada *note A.18.1(3/2): 7325.
Containing_Directory
- in Ada.Directories *note A.16(17/2): 7248.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
+ <in> Ada.Directories *note A.16(17/2): 7248.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
7298.
Contains
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 7481.
- in Ada.Containers.Hashed_Maps *note A.18.5(32/2): 7566.
- in Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7709, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 7481.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(32/2): 7566.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7709, *note
A.18.8(57/2): 7721.
- in Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7867.
- in Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7631.
- in Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7792, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7867.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7631.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7792, *note
A.18.9(72/2): 7805.
- in Ada.Containers.Vectors *note A.18.2(71/2): 7406.
+ <in> Ada.Containers.Vectors *note A.18.2(71/2): 7406.
context free grammar
complete listing *note P: 9735.
cross reference *note P: 10624.
notation *note 1.1.4(3): 1086.
under Syntax heading *note 1.1.2(25): 1015.
context_clause *note 10.1.2(2): 4757.
- used *note 10.1.1(3): 4712, *note P: 10430.
+ <used> *note 10.1.1(3): 4712, *note P: 10430.
context_item *note 10.1.2(3): 4759.
- used *note 10.1.2(2): 4758, *note P: 10445.
+ <used> *note 10.1.2(2): 4758, *note P: 10445.
contiguous representation
- [partial] *note 13.1(7.a/2): 5359, *note 13.5.2(5): 5582, *note
+ [<partial>] *note 13.1(7.a/2): 5359, *note 13.5.2(5): 5582, *note
13.7.1(12): 5641, *note 13.9(9): 5664, *note 13.9(17/3): 5667, *note
13.11(17.d): 5721, *note 13.11(21.6/3): 5727.
Continue
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 8707.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8707.
contract model of generics *note 12.3(1.a/3): 5133.
control character
a category of Character *note A.3.2(22): 6029.
a category of Character *note A.3.3(4): 6042, *note A.3.3(15):
6136.
- See also format_effector *note 2.1(13/3): 1191.
+ <See also> format_effector *note 2.1(13/3): 1191.
Control_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6512.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6512.
Controlled
- in Ada.Finalization *note 7.6(5/2): 3975.
+ <in> Ada.Finalization *note 7.6(5/2): 3975.
controlled type *note 7.6(2): 3970, *note 7.6(9/2): 3982, *note N(10):
9670.
controlling access result *note 3.9.2(2/3): 2321.
@@ -134136,42 +134631,42 @@ conversion *note 4.6(1/3): 3151, *note 4.6(28):
3196.
value *note 4.6(5/2): 3167.
view *note 4.6(5/2): 3165.
Conversion_Error
- in Interfaces.COBOL *note B.4(30): 8262.
+ <in> Interfaces.COBOL *note B.4(30): 8262.
Conversions
- child of Ada.Characters *note A.3.4(2/2): 6272.
- child of Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6641.
+ <child of> Ada.Characters *note A.3.4(2/2): 6272.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6641.
Convert
- in Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6642,
+ <in> Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6642,
*note A.4.11(17/3): 6643, *note A.4.11(18/3): 6644, *note A.4.11(19/3):
6645, *note A.4.11(20/3): 6646.
convertible *note 4.6(4/3): 3163.
required *note 4.6(24.13/2): 3183, *note 4.6(24.4/2): 3178, *note
8.6(27.1/4): 4214.
Copy
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 7455.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 7551.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7686.
- in Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7947,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 7455.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 7551.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7686.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7947,
*note A.18.20(10/3): 7962, *note A.18.21(13/3): 7967, *note
A.18.22(10/3): 7971, *note A.18.23(13/3): 7976, *note A.18.24(10/3):
7980.
- in Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7859.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 7605.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7760.
- in Ada.Containers.Vectors *note A.18.2(34.8/3): 7369.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7859.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 7605.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7760.
+ <in> Ada.Containers.Vectors *note A.18.2(34.8/3): 7369.
copy back of parameters *note 6.4.1(17): 3765.
copy parameter passing *note 6.2(2): 3654.
Copy_Array
- in Interfaces.C.Pointers *note B.3.2(15): 8208.
+ <in> Interfaces.C.Pointers *note B.3.2(15): 8208.
Copy_File
- in Ada.Directories *note A.16(13/2): 7245.
+ <in> Ada.Directories *note A.16(13/2): 7245.
Copy_Sign attribute *note A.5.3(51): 6812.
Copy_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7880.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7880.
Copy_Terminated_Array
- in Interfaces.C.Pointers *note B.3.2(14): 8207.
+ <in> Interfaces.C.Pointers *note B.3.2(14): 8207.
Copyright_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6183.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6183.
core language *note 1.1.2(2): 1004.
Correction *note 1.1.2(39.aa/3): 1060.
corresponding constraint *note 3.4(6): 1629.
@@ -134188,41 +134683,45 @@ Corrigendum *note 1.1.2(39.n/3): 1054, *note
1.1.2(39.nn/4): 1065,
*note 1.1.2(39.qq/4): 1067, *note 1.1.2(39.tt/4): 1069, *note
1.1.2(39.ww/4): 1071.
Cos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9042.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6687.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6687.
Cosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9050.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6701.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6701.
Cot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9044.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6691.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6691.
Coth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9052.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6703.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6703.
Count
- in Ada.Direct_IO *note A.8.4(4): 6906.
- in Ada.Streams.Stream_IO *note A.12.1(7): 7167.
- in Ada.Strings.Bounded *note A.4.4(48): 6425, *note A.4.4(49):
+ <in> Ada.Direct_IO *note A.8.4(4): 6906.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 7167.
+ <in> Ada.Strings.Bounded *note A.4.4(48): 6425, *note A.4.4(49):
6426, *note A.4.4(50): 6427.
- in Ada.Strings.Fixed *note A.4.3(13): 6366, *note A.4.3(14): 6367,
-*note A.4.3(15): 6368.
- in Ada.Strings.Unbounded *note A.4.5(43): 6482, *note A.4.5(44):
+ <in> Ada.Strings.Fixed *note A.4.3(13): 6366, *note A.4.3(14):
+6367, *note A.4.3(15): 6368.
+ <in> Ada.Strings.Unbounded *note A.4.5(43): 6482, *note A.4.5(44):
6483, *note A.4.5(45): 6484.
- in Ada.Text_IO *note A.10.1(5): 6961.
+ <in> Ada.Text_IO *note A.10.1(5): 6961.
Count attribute *note 9.9(5): 4685.
Count_Type
- in Ada.Containers *note A.18.1(5/2): 7327.
+ <in> Ada.Containers *note A.18.1(5/2): 7327.
Country
- in Ada.Locales *note A.19(6/3): 8040.
+ <in> Ada.Locales *note A.19(6/3): 8040.
Country code standard *note 1.2(4.1/3): 1132.
Country_Code
- in Ada.Locales *note A.19(4/4): 8036.
+ <in> Ada.Locales *note A.19(4/4): 8036.
Country_Unknown
- in Ada.Locales *note A.19(5/3): 8038.
+ <in> Ada.Locales *note A.19(5/3): 8038.
cover
a type *note 3.4.1(9): 1666.
of a choice and an exception *note 11.2(6): 4960.
@@ -134232,40 +134731,40 @@ cover a value *note 3.8.1(1.a): 2201.
CPU aspect *note D.16(8/3): 8803.
CPU clock tick *note D.14(15/2): 8733.
CPU pragma *note J.15.9(2/3): 9400, *note L(8.2/3): 9503.
-CPU subtype of CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8800.
+CPU <subtype of> CPU_Range
+ <in> System.Multiprocessors *note D.16(4/3): 8800.
CPU time
of a task *note D.14(11/3): 8732.
CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8798.
+ <in> System.Multiprocessors *note D.16(4/3): 8798.
CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.1/4):
-8812.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.1/4): 8812.
CPU_Tick
- in Ada.Execution_Time *note D.14(4/2): 8724.
+ <in> Ada.Execution_Time *note D.14(4/2): 8724.
CPU_Time
- in Ada.Execution_Time *note D.14(4/2): 8720.
+ <in> Ada.Execution_Time *note D.14(4/2): 8720.
CPU_Time_First
- in Ada.Execution_Time *note D.14(4/2): 8721.
+ <in> Ada.Execution_Time *note D.14(4/2): 8721.
CPU_Time_Last
- in Ada.Execution_Time *note D.14(4/2): 8722.
+ <in> Ada.Execution_Time *note D.14(4/2): 8722.
CPU_Time_Unit
- in Ada.Execution_Time *note D.14(4/2): 8723.
+ <in> Ada.Execution_Time *note D.14(4/2): 8723.
CR
- in Ada.Characters.Latin_1 *note A.3.3(5): 6056.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6056.
create *note 3.1(12): 1392.
- in Ada.Direct_IO *note A.8.4(6): 6908.
- in Ada.Sequential_IO *note A.8.1(6): 6878.
- in Ada.Streams.Stream_IO *note A.12.1(8): 7169.
- in Ada.Text_IO *note A.10.1(9): 6967.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
+ <in> Ada.Direct_IO *note A.8.4(6): 6908.
+ <in> Ada.Sequential_IO *note A.8.1(6): 6878.
+ <in> Ada.Streams.Stream_IO *note A.12.1(8): 7169.
+ <in> Ada.Text_IO *note A.10.1(9): 6967.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
8809, *note D.16.1(9.2/4): 8813.
Create_Directory
- in Ada.Directories *note A.16(7/2): 7239.
+ <in> Ada.Directories *note A.16(7/2): 7239.
Create_Path
- in Ada.Directories *note A.16(9/2): 7241.
+ <in> Ada.Directories *note A.16(9/2): 7241.
Create_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(7/3): 5778.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(7/3): 5778.
creation
of a protected object *note C.3.1(10/3): 8331.
of a return object *note 6.5(5.11/3): 3797.
@@ -134273,11 +134772,11 @@ creation
of a task object *note D.1(17/4): 8461.
of an object *note 3.3(1): 1531.
critical section
- See intertask communication *note 9.5(1): 4375.
+ <See> intertask communication *note 9.5(1): 4375.
CSI
- in Ada.Characters.Latin_1 *note A.3.3(19): 6168.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6168.
Currency_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6178.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6178.
current column number *note A.10(9): 6952.
current index
of an open direct file *note A.8(4): 6874.
@@ -134293,47 +134792,48 @@ Current size
of a stream file *note A.12.1(1.1/1): 7162.
of an external file *note A.8(3): 6873.
Current_Directory
- in Ada.Directories *note A.16(5/2): 7237.
+ <in> Ada.Directories *note A.16(5/2): 7237.
Current_Error
- in Ada.Text_IO *note A.10.1(17): 6985, *note A.10.1(20): 6992.
+ <in> Ada.Text_IO *note A.10.1(17): 6985, *note A.10.1(20): 6992.
Current_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8768.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8743.
- in Ada.Interrupts *note C.3.2(6): 8352.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8789.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8768.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8743.
+ <in> Ada.Interrupts *note C.3.2(6): 8352.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8789.
Current_Input
- in Ada.Text_IO *note A.10.1(17): 6983, *note A.10.1(20): 6990.
+ <in> Ada.Text_IO *note A.10.1(17): 6983, *note A.10.1(20): 6990.
Current_Output
- in Ada.Text_IO *note A.10.1(17): 6984, *note A.10.1(20): 6991.
+ <in> Ada.Text_IO *note A.10.1(17): 6984, *note A.10.1(20): 6991.
Current_State
- in Ada.Synchronous_Task_Control *note D.10(4): 8691.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8691.
Current_Task
- in Ada.Task_Identification *note C.7.1(3/3): 8404.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8404.
Current_Task_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 8437.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 8437.
Current_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 8030.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+8030.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
8014.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7999.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7999.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
8022.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-8007.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 8007.
cursor
ambiguous *note A.18.2(240/2): 7424.
for a container *note A.18(2/2): 7316.
invalid *note A.18.2(248/2): 7427, *note A.18.3(153/2): 7500, *note
A.18.4(76/2): 7524, *note A.18.7(97/2): 7663, *note A.18.10(222/3):
7907.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 7439.
- in Ada.Containers.Hashed_Maps *note A.18.5(4/2): 7530.
- in Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7669.
- in Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7836.
- in Ada.Containers.Ordered_Maps *note A.18.6(5/2): 7586.
- in Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7745.
- in Ada.Containers.Vectors *note A.18.2(9/2): 7340.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 7439.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(4/2): 7530.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7669.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7836.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(5/2): 7586.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7745.
+ <in> Ada.Containers.Vectors *note A.18.2(9/2): 7340.
@@ -134348,63 +134848,63 @@ dangling reference *note 13.11.2(15.1/4): 5753.
dangling references
prevention via accessibility rules *note 3.10.2(3/2): 2464.
Data_Error
- in Ada.Direct_IO *note A.8.4(18): 6933.
- in Ada.IO_Exceptions *note A.13(4): 7220.
- in Ada.Sequential_IO *note A.8.1(15): 6898.
- in Ada.Storage_IO *note A.9(9): 6942.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7196.
- in Ada.Text_IO *note A.10.1(85): 7110.
+ <in> Ada.Direct_IO *note A.8.4(18): 6933.
+ <in> Ada.IO_Exceptions *note A.13(4): 7220.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6898.
+ <in> Ada.Storage_IO *note A.9(9): 6942.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7196.
+ <in> Ada.Text_IO *note A.10.1(85): 7110.
date and time formatting standard *note 1.2(5.1/2): 1137.
Day
- in Ada.Calendar *note 9.6(13): 4526.
- in Ada.Calendar.Formatting *note 9.6.1(23/2): 4568.
+ <in> Ada.Calendar *note 9.6(13): 4526.
+ <in> Ada.Calendar.Formatting *note 9.6.1(23/2): 4568.
Day_Count
- in Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4549.
-Day_Duration subtype of Duration
- in Ada.Calendar *note 9.6(11/2): 4522.
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4549.
+Day_Duration <subtype of> Duration
+ <in> Ada.Calendar *note 9.6(11/2): 4522.
Day_Name
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4553.
-Day_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4521.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4553.
+Day_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4521.
Day_of_Week
- in Ada.Calendar.Formatting *note 9.6.1(18/2): 4561.
+ <in> Ada.Calendar.Formatting *note 9.6.1(18/2): 4561.
DC1
- in Ada.Characters.Latin_1 *note A.3.3(6): 6060.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6060.
DC2
- in Ada.Characters.Latin_1 *note A.3.3(6): 6061.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6061.
DC3
- in Ada.Characters.Latin_1 *note A.3.3(6): 6062.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6062.
DC4
- in Ada.Characters.Latin_1 *note A.3.3(6): 6063.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6063.
DCS
- in Ada.Characters.Latin_1 *note A.3.3(18): 6157.
-Deadline subtype of Time
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8524.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6157.
+Deadline <subtype of> Time
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8524.
Deallocate
- in System.Storage_Pools *note 13.11(8): 5698.
- in System.Storage_Pools.Subpools *note 13.11.4(15/3): 5785.
+ <in> System.Storage_Pools *note 13.11(8): 5698.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(15/3): 5785.
Deallocate_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(12/3): 5782.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(12/3): 5782.
deallocation of storage *note 13.11.2(1): 5739.
Decimal
- child of Ada *note F.2(2): 8971.
+ <child of> Ada *note F.2(2): 8971.
decimal digit
a category of Character *note A.3.2(28): 6035.
decimal fixed point type *note 3.5.9(1): 1941, *note 3.5.9(6): 1959.
Decimal_Conversions
- in Interfaces.COBOL *note B.4(31): 8263.
+ <in> Interfaces.COBOL *note B.4(31): 8263.
Decimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6518.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6518.
Decimal_Element
- in Interfaces.COBOL *note B.4(12/3): 8236.
+ <in> Interfaces.COBOL *note B.4(12/3): 8236.
decimal_fixed_point_definition *note 3.5.9(4): 1949.
- used *note 3.5.9(2): 1945, *note P: 9873.
+ <used> *note 3.5.9(2): 1945, *note P: 9873.
Decimal_IO
- in Ada.Text_IO *note A.10.1(73): 7085.
+ <in> Ada.Text_IO *note A.10.1(73): 7085.
decimal_literal *note 2.4.1(2): 1264.
- used *note 2.4(2): 1261, *note P: 9751.
+ <used> *note 2.4(2): 1261, *note P: 9751.
Decimal_Output
- in Ada.Text_IO.Editing *note F.3.3(11): 8994.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8994.
Declaration *note 3.1(5): 1368, *note 3.1(6/3): 1371, *note N(11):
9671.
declaration list
@@ -134413,21 +134913,21 @@ declaration list
declarative region
of a construct *note 8.1(1): 4035.
declarative_item *note 3.11(3): 2510.
- used *note 3.11(2): 2509, *note P: 9960.
+ <used> *note 3.11(2): 2509, *note P: 9960.
declarative_part *note 3.11(2): 2508.
- used *note 5.6(2): 3521, *note 6.3(2/3): 3674, *note 7.2(2/3):
+ <used> *note 5.6(2): 3521, *note 6.3(2/3): 3674, *note 7.2(2/3):
3887, *note 9.1(6/3): 4270, *note 9.5.2(5): 4422, *note P: 10334.
declare *note 3.1(8): 1380, *note 3.1(12): 1391.
declared pure *note 10.2.1(17/3): 4893.
Decode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6651, *note
-A.4.11(27/3): 6652, *note A.4.11(28/3): 6653.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3): 6658,
-*note A.4.11(35/3): 6659, *note A.4.11(36/3): 6660.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6651,
+*note A.4.11(27/3): 6652, *note A.4.11(28/3): 6653.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3):
+6658, *note A.4.11(35/3): 6659, *note A.4.11(36/3): 6660.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
6665, *note A.4.11(43/3): 6666, *note A.4.11(44/3): 6667.
Decrement
- in Interfaces.C.Pointers *note B.3.2(11/3): 8205.
+ <in> Interfaces.C.Pointers *note B.3.2(11/3): 8205.
deeper
accessibility level *note 3.10.2(3/2): 2462.
statically *note 3.10.2(4): 2469, *note 3.10.2(17): 2478.
@@ -134442,66 +134942,67 @@ default pool *note 13.11.3(4.2/4): 5766.
default treatment *note C.3(5): 8325.
default variable indexing function *note 5.5.1(21/3): 3489.
Default_Aft
- in Ada.Text_IO *note A.10.1(64): 7067, *note A.10.1(69): 7077,
+ <in> Ada.Text_IO *note A.10.1(64): 7067, *note A.10.1(69): 7077,
*note A.10.1(74): 7087.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9067.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9067.
Default_Base
- in Ada.Text_IO *note A.10.1(53): 7049, *note A.10.1(58): 7058.
+ <in> Ada.Text_IO *note A.10.1(53): 7049, *note A.10.1(58): 7058.
Default_Bit_Order
- in System *note 13.7(15/2): 5624.
+ <in> System *note 13.7(15/2): 5624.
Default_Component_Value aspect *note 3.6(22.2/3): 2051.
Default_Currency
- in Ada.Text_IO.Editing *note F.3.3(10): 8990.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8990.
Default_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8525.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8525.
Default_Exp
- in Ada.Text_IO *note A.10.1(64): 7068, *note A.10.1(69): 7078,
+ <in> Ada.Text_IO *note A.10.1(64): 7068, *note A.10.1(69): 7078,
*note A.10.1(74): 7088.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9068.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9068.
default_expression *note 3.7(6): 2114.
- used *note 3.7(5/2): 2110, *note 3.8(6/3): 2178, *note 6.1(15/3):
+ <used> *note 3.7(5/2): 2110, *note 3.8(6/3): 2178, *note 6.1(15/3):
3583, *note 12.4(2/3): 5196, *note P: 9908.
Default_Fill
- in Ada.Text_IO.Editing *note F.3.3(10): 8991.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8991.
Default_Fore
- in Ada.Text_IO *note A.10.1(64): 7066, *note A.10.1(69): 7076,
+ <in> Ada.Text_IO *note A.10.1(64): 7066, *note A.10.1(69): 7076,
*note A.10.1(74): 7086.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 9066.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 9066.
Default_Iterator aspect *note 5.5.1(8/3): 3480.
Default_Modulus
- in Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7966,
+ <in> Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7966,
*note A.18.23(10/3): 7975.
default_name *note 12.6(4): 5306.
- used *note 12.6(3/2): 5305, *note P: 10564.
+ <used> *note 12.6(3/2): 5305, *note P: 10564.
Default_Priority
- in System *note 13.7(17): 5628.
+ <in> System *note 13.7(17): 5628.
Default_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8515.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8515.
Default_Radix_Mark
- in Ada.Text_IO.Editing *note F.3.3(10): 8993.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8993.
Default_Separator
- in Ada.Text_IO.Editing *note F.3.3(10): 8992.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8992.
Default_Setting
- in Ada.Text_IO *note A.10.1(80): 7097.
+ <in> Ada.Text_IO *note A.10.1(80): 7097.
Default_Storage_Pool aspect *note 13.11.3(5/4): 5770.
Default_Storage_Pool pragma *note 13.11.3(3/3): 5762, *note L(8.3/3):
9506.
Default_Subpool_for_Pool
- in System.Storage_Pools.Subpools *note 13.11.4(13/3): 5783.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(13/3): 5783.
Default_Value aspect *note 3.5(56.3/3): 1778.
Default_Width
- in Ada.Text_IO *note A.10.1(53): 7048, *note A.10.1(58): 7057,
+ <in> Ada.Text_IO *note A.10.1(53): 7048, *note A.10.1(58): 7057,
*note A.10.1(80): 7096.
deferred constant *note 7.4(2/3): 3950.
deferred constant declaration *note 3.3.1(6/3): 1580, *note 7.4(2/3):
3949.
defining name *note 3.1(10): 1381.
defining_character_literal *note 3.5.1(4): 1793.
- used *note 3.5.1(3): 1792, *note P: 9859.
+ <used> *note 3.5.1(3): 1792, *note P: 9859.
defining_designator *note 6.1(6): 3557.
- used *note 6.1(4.2/2): 3551, *note 12.3(2/3): 5145, *note P: 10507.
+ <used> *note 6.1(4.2/2): 3551, *note 12.3(2/3): 5145, *note P:
+10507.
defining_identifier *note 3.1(4): 1366.
- used *note 3.2.1(3/3): 1443, *note 3.2.2(2/3): 1471, *note
+ <used> *note 3.2.1(3/3): 1443, *note 3.2.2(2/3): 1471, *note
3.3.1(3): 1574, *note 3.5.1(3): 1791, *note 3.10.1(2/2): 2443, *note
5.5(4): 3455, *note 5.5.2(2/3): 3495, *note 6.1(7): 3562, *note
6.5(2.1/3): 3780, *note 7.3(2/3): 3900, *note 7.3(3/3): 3904, *note
@@ -134513,79 +135014,80 @@ defining_identifier *note 3.1(4): 1366.
12.5(2.1/3): 5225, *note 12.5(2.2/3): 5230, *note 12.7(2/3): 5322, *note
P: 9958.
defining_identifier_list *note 3.3.1(3): 1573.
- used *note 3.3.1(2/3): 1559, *note 3.3.2(2): 1609, *note 3.7(5/2):
-2107, *note 3.8(6/3): 2176, *note 6.1(15/3): 3584, *note 11.1(2/3):
-4931, *note 12.4(2/3): 5192, *note P: 9831.
+ <used> *note 3.3.1(2/3): 1559, *note 3.3.2(2): 1609, *note
+3.7(5/2): 2107, *note 3.8(6/3): 2176, *note 6.1(15/3): 3584, *note
+11.1(2/3): 4931, *note 12.4(2/3): 5192, *note P: 9831.
defining_operator_symbol *note 6.1(11): 3565.
- used *note 6.1(6): 3559, *note P: 10200.
+ <used> *note 6.1(6): 3559, *note P: 10200.
defining_program_unit_name *note 6.1(7): 3560.
- used *note 6.1(4.1/2): 3548, *note 6.1(6): 3558, *note 7.1(3/3):
+ <used> *note 6.1(4.1/2): 3548, *note 6.1(6): 3558, *note 7.1(3/3):
3870, *note 7.2(2/3): 3885, *note 8.5.3(2/3): 4154, *note 8.5.5(2/3):
4181, *note 12.3(2/3): 5135, *note P: 10309.
Definite attribute *note 12.5.1(23/3): 5263.
definite subtype *note 3.3(23/3): 1546.
definition *note 3.1(7): 1373.
Degree_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6190.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6190.
DEL
- in Ada.Characters.Latin_1 *note A.3.3(14): 6135.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6135.
delay_alternative *note 9.7.1(6): 4608.
- used *note 9.7.1(4): 4603, *note 9.7.2(2): 4621, *note P: 10411.
+ <used> *note 9.7.1(4): 4603, *note 9.7.2(2): 4621, *note P: 10411.
delay_relative_statement *note 9.6(4): 4510.
- used *note 9.6(2): 4507, *note P: 10390.
+ <used> *note 9.6(2): 4507, *note P: 10390.
delay_statement *note 9.6(2): 4505.
- used *note 5.1(4/2): 3378, *note 9.7.1(6): 4609, *note 9.7.4(4/2):
-4642, *note P: 10408.
+ <used> *note 5.1(4/2): 3378, *note 9.7.1(6): 4609, *note
+9.7.4(4/2): 4642, *note P: 10408.
Delay_Until_And_Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
8819.
Delay_Until_And_Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8527.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8527.
delay_until_statement *note 9.6(3): 4508.
- used *note 9.6(2): 4506, *note P: 10389.
+ <used> *note 9.6(2): 4506, *note P: 10389.
Delete
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 7462.
- in Ada.Containers.Hashed_Maps *note A.18.5(25/2): 7559, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 7462.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(25/2): 7559, *note
A.18.5(26/2): 7560.
- in Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7693, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7693, *note
A.18.8(25/2): 7694, *note A.18.8(55/2): 7719.
- in Ada.Containers.Ordered_Maps *note A.18.6(24/2): 7613, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(24/2): 7613, *note
A.18.6(25/2): 7614.
- in Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7767, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7767, *note
A.18.9(24/2): 7768, *note A.18.9(68/2): 7801.
- in Ada.Containers.Vectors *note A.18.2(50/2): 7385, *note
+ <in> Ada.Containers.Vectors *note A.18.2(50/2): 7385, *note
A.18.2(51/2): 7386.
- in Ada.Direct_IO *note A.8.4(8): 6911.
- in Ada.Sequential_IO *note A.8.1(8): 6881.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7172.
- in Ada.Strings.Bounded *note A.4.4(64): 6440, *note A.4.4(65):
+ <in> Ada.Direct_IO *note A.8.4(8): 6911.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6881.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7172.
+ <in> Ada.Strings.Bounded *note A.4.4(64): 6440, *note A.4.4(65):
6441.
- in Ada.Strings.Fixed *note A.4.3(29): 6381, *note A.4.3(30): 6382.
- in Ada.Strings.Unbounded *note A.4.5(59): 6497, *note A.4.5(60):
+ <in> Ada.Strings.Fixed *note A.4.3(29): 6381, *note A.4.3(30):
+6382.
+ <in> Ada.Strings.Unbounded *note A.4.5(59): 6497, *note A.4.5(60):
6498.
- in Ada.Text_IO *note A.10.1(11): 6970.
+ <in> Ada.Text_IO *note A.10.1(11): 6970.
Delete_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7879.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7879.
Delete_Directory
- in Ada.Directories *note A.16(8/2): 7240.
+ <in> Ada.Directories *note A.16(8/2): 7240.
Delete_File
- in Ada.Directories *note A.16(11/2): 7243.
+ <in> Ada.Directories *note A.16(11/2): 7243.
Delete_First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 7463.
- in Ada.Containers.Ordered_Maps *note A.18.6(26/2): 7615.
- in Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7769.
- in Ada.Containers.Vectors *note A.18.2(52/2): 7387.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 7463.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(26/2): 7615.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7769.
+ <in> Ada.Containers.Vectors *note A.18.2(52/2): 7387.
Delete_Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 7464.
- in Ada.Containers.Ordered_Maps *note A.18.6(27/2): 7616.
- in Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7770.
- in Ada.Containers.Vectors *note A.18.2(53/2): 7388.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 7464.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(27/2): 7616.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7770.
+ <in> Ada.Containers.Vectors *note A.18.2(53/2): 7388.
Delete_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7861.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7861.
Delete_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7862.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7862.
Delete_Tree
- in Ada.Directories *note A.16(10/2): 7242.
+ <in> Ada.Directories *note A.16(10/2): 7242.
delimiter *note 2.2(8/2): 1235.
delivery
of an interrupt *note C.3(2): 8318.
@@ -134593,7 +135095,7 @@ delta
of a fixed point type *note 3.5.9(1): 1942.
Delta attribute *note 3.5.10(3): 1990.
delta_constraint *note J.3(2/4): 9262.
- used *note 3.2.2(6): 1486, *note P: 9828.
+ <used> *note 3.2.2(6): 1486, *note P: 9828.
Denorm attribute *note A.5.3(9): 6761.
denormalized number *note A.5.3(10): 6762.
denote *note 8.6(16): 4200.
@@ -134609,33 +135111,35 @@ dependence
semantic *note 10.1.1(26/2): 4752.
depth
accessibility level *note 3.10.2(3/2): 2463.
- in Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7845.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7845.
depth-first order *note A.18.10(5/3): 7833.
Dequeue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 8028.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+8028.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
8013.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(6/3):
-7998.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(6/3): 7998.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
8020.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-8006.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 8006.
Dequeue_Only_High_Priority
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3): 8029.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3):
+8029.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
8021.
dereference *note 4.1(8): 2564.
Dereference_Error
- in Interfaces.C.Strings *note B.3.1(12): 8184.
+ <in> Interfaces.C.Strings *note B.3.1(12): 8184.
derivation class
for a type *note 3.4.1(2/2): 1653.
derived from
directly or indirectly *note 3.4.1(2/2): 1652.
derived type *note 3.4(1/2): 1615, *note N(13/2): 9674.
- [partial] *note 3.4(24): 1641.
+ [<partial>] *note 3.4(24): 1641.
derived_type_definition *note 3.4(2/2): 1619.
- used *note 3.2.1(4/2): 1456, *note P: 9815.
+ <used> *note 3.2.1(4/2): 1456, *note P: 9815.
descendant *note 10.1.1(11): 4743, *note N(13.1/2): 9675.
at run-time *note 3.9(12.3/3): 2262.
of a tree node *note A.18.10(4/3): 7832.
@@ -134643,7 +135147,7 @@ descendant *note 10.1.1(11): 4743, *note N(13.1/2):
9675.
of the full view of a type *note 7.3.1(5.1/3): 3929.
relationship with scope *note 8.2(4): 4045.
Descendant_Tag
- in Ada.Tags *note 3.9(7.1/2): 2255.
+ <in> Ada.Tags *note 3.9(7.1/2): 2255.
designate *note 3.10(1): 2387.
designated profile
of an access-to-subprogram type *note 3.10(11): 2424.
@@ -134655,54 +135159,54 @@ designated type
of a named access type *note 3.10(10): 2420.
of an anonymous access type *note 3.10(12/3): 2428.
designator *note 6.1(5): 3553.
- used *note 6.3(2/3): 3676, *note P: 10226.
+ <used> *note 6.3(2/3): 3676, *note P: 10226.
destructor
- See finalization *note 7.6(1): 3969.
- See finalization *note 7.6.1(1): 4002.
+ <See> finalization *note 7.6(1): 3969.
+ <See> finalization *note 7.6.1(1): 4002.
Detach_Handler
- in Ada.Interrupts *note C.3.2(9): 8355.
+ <in> Ada.Interrupts *note C.3.2(9): 8355.
Detect_Blocking pragma *note H.5(3/2): 9250, *note L(8.4/2): 9509.
Determinant
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9179.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9138.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9179.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9138.
determined category for a formal type *note 12.5(6/3): 5252.
determines
a type by a subtype_mark *note 3.2.2(8): 1490.
Device_Error
- in Ada.Direct_IO *note A.8.4(18): 6931.
- in Ada.Directories *note A.16(43/2): 7275.
- in Ada.IO_Exceptions *note A.13(4): 7218.
- in Ada.Sequential_IO *note A.8.1(15): 6896.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7194.
- in Ada.Text_IO *note A.10.1(85): 7108.
+ <in> Ada.Direct_IO *note A.8.4(18): 6931.
+ <in> Ada.Directories *note A.16(43/2): 7275.
+ <in> Ada.IO_Exceptions *note A.13(4): 7218.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6896.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7194.
+ <in> Ada.Text_IO *note A.10.1(85): 7108.
Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6182.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6182.
Difference
- in Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4551.
- in Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7699, *note
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4551.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7699, *note
A.18.8(33/2): 7700.
- in Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7775, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7775, *note
A.18.9(34/2): 7776.
digit *note 2.4.1(4.1/2): 1275.
- used *note 2.4.1(3): 1269, *note 2.4.2(5): 1298, *note P: 9769.
+ <used> *note 2.4.1(3): 1269, *note 2.4.2(5): 1298, *note P: 9769.
digits
of a decimal fixed point subtype *note 3.5.9(6): 1958, *note
3.5.10(7): 1997.
Digits attribute *note 3.5.8(2/1): 1937, *note 3.5.10(7): 1996.
digits_constraint *note 3.5.9(5/4): 1953.
- used *note 3.2.2(6): 1485, *note P: 9827.
+ <used> *note 3.2.2(6): 1485, *note P: 9827.
dimensionality
of an array *note 3.6(12): 2030.
direct access *note A.8(3): 6871.
direct file *note A.8(1/2): 6868.
Direct_IO
- child of Ada *note A.8.4(2): 6903.
+ <child of> Ada *note A.8.4(2): 6903.
direct_name *note 4.1(3): 2554.
- used *note 3.8.1(2): 2203, *note 4.1(2/3): 2542, *note 5.1(8):
+ <used> *note 3.8.1(2): 2203, *note 4.1(2/3): 2542, *note 5.1(8):
3394, *note 9.5.2(3): 4411, *note 10.2.1(4.2/2): 4877, *note 13.1(3):
5352, *note J.7(1): 9273, *note L(25.2/2): 9585, *note P: 10153.
Direction
- in Ada.Strings *note A.4.1(6): 6328.
+ <in> Ada.Strings *note A.4.1(6): 6328.
directly specified
of a representation aspect of an entity *note 13.1(8/3): 5363.
of an operational aspect of an entity *note 13.1(8.1/3): 5369.
@@ -134716,89 +135220,90 @@ directly visible *note 8.3(2): 4061, *note
8.3(21): 4084.
4828.
within the parent_unit_name of a subunit *note 10.1.6(4): 4836.
Directories
- child of Ada *note A.16(3/2): 7236.
+ <child of> Ada *note A.16(3/2): 7236.
directory *note A.16(45/2): 7276.
directory entry *note A.16(49/2): 7284.
directory name *note A.16(46/2): 7279.
Directory_Entry_Type
- in Ada.Directories *note A.16(29/2): 7260.
+ <in> Ada.Directories *note A.16(29/2): 7260.
disabled
predicate checks *note 3.2.4(7/3): 1517.
Discard_Names aspect *note C.5(1.3/4): 8369.
Discard_Names pragma *note C.5(3): 8371, *note L(9): 9511.
discontiguous representation
- [partial] *note 13.1(7.a/2): 5360, *note 13.5.2(5): 5583, *note
+ [<partial>] *note 13.1(7.a/2): 5360, *note 13.5.2(5): 5583, *note
13.7.1(12): 5642, *note 13.9(9): 5665, *note 13.9(17/3): 5668, *note
13.11(17.d): 5722, *note 13.11(21.6/3): 5728.
discrete array type *note 4.5.2(1): 3005.
discrete type *note 3.2(3): 1407, *note 3.5(1): 1673, *note N(14):
9676.
discrete_choice *note 3.8.1(5/3): 2212.
- used *note 3.8.1(4): 2210, *note P: 9933.
+ <used> *note 3.8.1(4): 2210, *note P: 9933.
discrete_choice_list *note 3.8.1(4): 2209.
- used *note 3.8.1(3): 2207, *note 4.3.3(5/2): 2764, *note
+ <used> *note 3.8.1(3): 2207, *note 4.3.3(5/2): 2764, *note
4.5.7(6/3): 3122, *note 5.4(3): 3434, *note P: 10039.
Discrete_Random
- child of Ada.Numerics *note A.5.2(17): 6729.
+ <child of> Ada.Numerics *note A.5.2(17): 6729.
discrete_range *note 3.6.1(3): 2059.
- used *note 3.6.1(2): 2057, *note 4.1.2(2): 2594, *note P: 9994.
+ <used> *note 3.6.1(2): 2057, *note 4.1.2(2): 2594, *note P: 9994.
discrete_subtype_definition *note 3.6(6): 2019.
- used *note 3.6(5): 2017, *note 5.5(4): 3456, *note 9.5.2(2/3):
+ <used> *note 3.6(5): 2017, *note 5.5(4): 3456, *note 9.5.2(2/3):
4407, *note 9.5.2(8): 4432, *note P: 9888.
discriminant *note 3.2(5/2): 1413, *note 3.7(1/2): 2094, *note
N(15/2): 9677.
of a variant_part *note 3.8.1(6): 2216.
use in a record definition *note 3.8(12/3): 2182.
discriminant_association *note 3.7.1(3): 2140.
- used *note 3.7.1(2): 2138, *note P: 9911.
+ <used> *note 3.7.1(2): 2138, *note P: 9911.
Discriminant_Check *note 11.5(12): 5064.
- [partial] *note 4.1.3(15): 2614, *note 4.3(6): 2697, *note
+ [<partial>] *note 4.1.3(15): 2614, *note 4.3(6): 2697, *note
4.3.2(8/3): 2741, *note 4.6(43): 3218, *note 4.6(45): 3220, *note
4.6(51/4): 3230, *note 4.6(52): 3243, *note 4.7(4/4): 3269, *note
4.8(10/2): 3301, *note 6.5(5.11/3): 3800.
discriminant_constraint *note 3.7.1(2): 2137.
- used *note 3.2.2(7): 1489, *note P: 9830.
+ <used> *note 3.2.2(7): 1489, *note P: 9830.
discriminant_part *note 3.7(2): 2099.
- used *note 3.10.1(2/2): 2444, *note 7.3(2/3): 3901, *note 7.3(3/3):
-3905, *note 12.5(2.1/3): 5226, *note 12.5(2.2/3): 5231, *note P: 10272.
+ <used> *note 3.10.1(2/2): 2444, *note 7.3(2/3): 3901, *note
+7.3(3/3): 3905, *note 12.5(2.1/3): 5226, *note 12.5(2.2/3): 5231, *note
+P: 10272.
discriminant_specification *note 3.7(5/2): 2106.
- used *note 3.7(4): 2105, *note P: 9900.
+ <used> *note 3.7(4): 2105, *note P: 9900.
discriminants
known *note 3.7(26): 2125.
unknown *note 3.7(1.b/2): 2098.
unknown *note 3.7(26): 2129.
discriminated type *note 3.7(8/2): 2117.
dispatching *note 3.9(3): 2241.
- child of Ada *note D.2.1(1.2/3): 8466.
+ <child of> Ada *note D.2.1(1.2/3): 8466.
dispatching call
on a dispatching operation *note 3.9.2(1/2): 2303.
dispatching domain *note D.16.1(16/4): 8820.
dispatching operation *note 3.9.2(1/2): 2302, *note 3.9.2(2/3): 2316.
- [partial] *note 3.9(1): 2226.
+ [<partial>] *note 3.9(1): 2226.
dispatching point *note D.2.1(4/2): 8472.
- [partial] *note D.2.3(8/2): 8500, *note D.2.4(9/3): 8509.
+ [<partial>] *note D.2.3(8/2): 8500, *note D.2.4(9/3): 8509.
dispatching policy for tasks *note 9(10.a/3): 4247.
- [partial] *note D.2.1(5/2): 8478.
+ [<partial>] *note D.2.1(5/2): 8478.
dispatching, task *note D.2.1(4/2): 8470.
Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
8807.
Dispatching_Domain aspect *note D.16.1(18/3): 8822.
Dispatching_Domain pragma *note J.15.10(2/3): 9405, *note L(9.1/3):
9514.
Dispatching_Domain_Error
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
8806.
Dispatching_Domains
- child of System.Multiprocessors *note D.16.1(3/3): 8805.
+ <child of> System.Multiprocessors *note D.16.1(3/3): 8805.
Dispatching_Policy_Error
- in Ada.Dispatching *note D.2.1(1.4/3): 8468.
+ <in> Ada.Dispatching *note D.2.1(1.4/3): 8468.
Display_Format
- in Interfaces.COBOL *note B.4(22): 8247.
+ <in> Interfaces.COBOL *note B.4(22): 8247.
displayed magnitude (of a decimal value) *note F.3.2(14): 8981.
disruption of an assignment *note 9.8(21): 4676, *note 13.9.1(5):
5672.
- [partial] *note 11.6(6/3): 5097.
+ [<partial>] *note 11.6(6/3): 5097.
distinct access paths *note 6.2(12/3): 3664.
distinguished receiver notation *note 4.1.3(19.e/2): 2620.
distributed accessibility *note 3.10.2(33.1/3): 2496.
@@ -134806,46 +135311,46 @@ distributed program *note E(3): 8830.
distributed system *note E(2): 8829.
distributed systems *note C(1): 8305.
divide *note 2.1(15/3): 1213.
- in Ada.Decimal *note F.2(6/3): 8977.
+ <in> Ada.Decimal *note F.2(6/3): 8977.
divide operator *note 4.4(1/3): 2852, *note 4.5.5(1): 3072.
Division_Check *note 11.5(13/2): 5065.
- [partial] *note 3.5.4(20): 1865, *note 4.5.5(22): 3079, *note
+ [<partial>] *note 3.5.4(20): 1865, *note 4.5.5(22): 3079, *note
A.5.1(28): 6709, *note A.5.3(47): 6804, *note G.1.1(40): 9030, *note
G.1.2(28): 9058, *note K.2(202): 9452.
Division_Sign
- in Ada.Characters.Latin_1 *note A.3.3(26): 6263.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6263.
DLE
- in Ada.Characters.Latin_1 *note A.3.3(6): 6059.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6059.
Do_APC
- in System.RPC *note E.5(10): 8957.
+ <in> System.RPC *note E.5(10): 8957.
Do_RPC
- in System.RPC *note E.5(9): 8956.
+ <in> System.RPC *note E.5(9): 8956.
documentation (required of an implementation) *note 1.1.3(18): 1082,
*note M.1(1/2): 9646, *note M.2(1/2): 9648, *note M.3(1/2): 9653.
documentation requirements *note 1.1.2(34): 1043, *note M(1/3): 9644.
summary of requirements *note M.1(1/2): 9645.
Dollar_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6079.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6079.
dope *note 13.5.1(15.d): 5571.
dot *note 2.1(15/3): 1210.
dot selection
- See selected_component *note 4.1.3(1): 2602.
+ <See> selected_component *note 4.1.3(1): 2602.
double
- in Interfaces.C *note B.3(16): 8123.
+ <in> Interfaces.C *note B.3(16): 8123.
Double_Precision
- in Interfaces.Fortran *note B.5(6): 8286.
+ <in> Interfaces.Fortran *note B.5(6): 8286.
Doubly_Linked_Lists
- child of Ada.Containers *note A.18.3(5/3): 7437.
+ <child of> Ada.Containers *note A.18.3(5/3): 7437.
downward closure *note 3.10.2(13.b/2): 2473, *note 3.10.2(38/2): 2500.
drift rate *note D.8(41): 8681.
Duration
- in Standard *note A.1(43): 5986.
+ <in> Standard *note A.1(43): 5986.
dynamic binding
- See dispatching operation *note 3.9(1): 2228.
+ <See> dispatching operation *note 3.9(1): 2228.
dynamic semantics *note 1.1.2(30): 1034.
Dynamic_Predicate aspect *note 3.2.4(1/3): 1514.
Dynamic_Priorities
- child of Ada *note D.5.1(3/2): 8571.
+ <child of> Ada *note D.5.1(3/2): 8571.
dynamically determined tag *note 3.9.2(1/2): 2306.
dynamically enclosing
of one execution by another *note 11.4(2): 4978.
@@ -134861,25 +135366,25 @@ E
e
- in Ada.Numerics *note A.5(3/2): 6676.
+ <in> Ada.Numerics *note A.5(3/2): 6676.
EDF
- child of Ada.Dispatching *note D.2.6(9/2): 8523.
- child of Ada.Synchronous_Task_Control *note D.10(5.2/3): 8693.
+ <child of> Ada.Dispatching *note D.2.6(9/2): 8523.
+ <child of> Ada.Synchronous_Task_Control *note D.10(5.2/3): 8693.
EDF_Across_Priorities task dispatching policy *note D.2.6(7/2): 8522.
edited output *note F.3(1/2): 8978.
Editing
- child of Ada.Text_IO *note F.3.3(3): 8982.
- child of Ada.Wide_Text_IO *note F.3.4(1): 9002.
- child of Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 9004.
+ <child of> Ada.Text_IO *note F.3.3(3): 8982.
+ <child of> Ada.Wide_Text_IO *note F.3.4(1): 9002.
+ <child of> Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 9004.
effect
external *note 1.1.3(8): 1076.
efficiency *note 11.5(29): 5081, *note 11.6(1/3): 5089.
Eigensystem
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 9181.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 9140.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 9181.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 9140.
Eigenvalues
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 9180.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 9139.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 9180.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 9139.
elaborable *note 3.1(11.g): 1388.
Elaborate pragma *note 10.2.1(20): 4898, *note L(10): 9516.
Elaborate_All pragma *note 10.2.1(21): 4902, *note L(11): 9520.
@@ -134958,110 +135463,111 @@ elaboration control *note 10.2.1(1): 4869.
elaboration dependence
library_item on another *note 10.2(9): 4852.
Elaboration_Check *note 11.5(20): 5074.
- [partial] *note 3.11(9): 2528.
+ [<partial>] *note 3.11(9): 2528.
element
of a storage pool *note 13.11(11): 5704.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 7447.
- in Ada.Containers.Hashed_Maps *note A.18.5(14/2): 7541, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 7447.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(14/2): 7541, *note
A.18.5(31/2): 7565.
- in Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7681, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7681, *note
A.18.8(52/2): 7716.
- in Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7938.
- in Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7850.
- in Ada.Containers.Ordered_Maps *note A.18.6(13/2): 7595, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7938.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7850.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(13/2): 7595, *note
A.18.6(39/2): 7628.
- in Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7755, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7755, *note
A.18.9(65/2): 7798.
- in Ada.Containers.Vectors *note A.18.2(27/2): 7355, *note
+ <in> Ada.Containers.Vectors *note A.18.2(27/2): 7355, *note
A.18.2(28/2): 7356.
- in Ada.Strings.Bounded *note A.4.4(26): 6412.
- in Ada.Strings.Unbounded *note A.4.5(20): 6469.
+ <in> Ada.Strings.Bounded *note A.4.4(26): 6412.
+ <in> Ada.Strings.Unbounded *note A.4.5(20): 6469.
elementary type *note 3.2(2/2): 1401, *note N(16): 9679.
Elementary_Functions
- child of Ada.Numerics *note A.5.1(9/1): 6708.
+ <child of> Ada.Numerics *note A.5.1(9/1): 6708.
eligible
a type, for a convention *note B.1(14/3): 8074.
else part
of a selective_accept *note 9.7.1(11): 4612.
EM
- in Ada.Characters.Latin_1 *note A.3.3(6): 6068.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6068.
embedded systems *note C(1): 8304, *note D(1): 8450.
empty element
of a vector *note A.18.2(4/2): 7335.
empty holder *note A.18.18(3/3): 7931.
Empty_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7934.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7934.
Empty_List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 7440.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 7440.
Empty_Map
- in Ada.Containers.Hashed_Maps *note A.18.5(5/2): 7531.
- in Ada.Containers.Ordered_Maps *note A.18.6(6/2): 7587.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(5/2): 7531.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(6/2): 7587.
Empty_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7670.
- in Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7746.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7670.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7746.
Empty_Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7837.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7837.
Empty_Vector
- in Ada.Containers.Vectors *note A.18.2(10/2): 7341.
+ <in> Ada.Containers.Vectors *note A.18.2(10/2): 7341.
enabled
invariant expression *note 7.3.2(21/4): 3943.
postcondition expression *note 6.1.1(19/3): 3630.
precondition expression *note 6.1.1(19/3): 3629.
predicate checks *note 3.2.4(7/3): 1516.
encapsulation
- See package *note 7(1): 3864.
+ <See> package *note 7(1): 3864.
enclosing
immediately *note 8.1(13): 4040.
Encode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6648, *note
-A.4.11(24/3): 6649, *note A.4.11(25/3): 6650.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3): 6655,
-*note A.4.11(32/3): 6656, *note A.4.11(33/3): 6657.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6648,
+*note A.4.11(24/3): 6649, *note A.4.11(25/3): 6650.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3):
+6655, *note A.4.11(32/3): 6656, *note A.4.11(33/3): 6657.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
6662, *note A.4.11(40/3): 6663, *note A.4.11(41/3): 6664.
Encoding
- in Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6640.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6640.
encoding scheme *note A.4.11(46/3): 6668.
Encoding_Error
- in Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6635.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6635.
Encoding_Scheme
- in Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6631.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6631.
end of a line *note 2.2(2/3): 1233.
End_Error
raised by failure of run-time check *note 13.13.2(37/1): 5895.
- in Ada.Direct_IO *note A.8.4(18): 6932.
- in Ada.IO_Exceptions *note A.13(4): 7219.
- in Ada.Sequential_IO *note A.8.1(15): 6897.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7195.
- in Ada.Text_IO *note A.10.1(85): 7109.
+ <in> Ada.Direct_IO *note A.8.4(18): 6932.
+ <in> Ada.IO_Exceptions *note A.13(4): 7219.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6897.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7195.
+ <in> Ada.Text_IO *note A.10.1(85): 7109.
End_Of_File
- in Ada.Direct_IO *note A.8.4(16): 6926.
- in Ada.Sequential_IO *note A.8.1(13): 6891.
- in Ada.Streams.Stream_IO *note A.12.1(12): 7179.
- in Ada.Text_IO *note A.10.1(34): 7016.
+ <in> Ada.Direct_IO *note A.8.4(16): 6926.
+ <in> Ada.Sequential_IO *note A.8.1(13): 6891.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 7179.
+ <in> Ada.Text_IO *note A.10.1(34): 7016.
End_Of_Line
- in Ada.Text_IO *note A.10.1(30): 7007.
+ <in> Ada.Text_IO *note A.10.1(30): 7007.
End_Of_Page
- in Ada.Text_IO *note A.10.1(33): 7013.
+ <in> Ada.Text_IO *note A.10.1(33): 7013.
End_Search
- in Ada.Directories *note A.16(33/2): 7264.
+ <in> Ada.Directories *note A.16(33/2): 7264.
endian
big *note 13.5.3(2): 5588.
little *note 13.5.3(2): 5591.
ENQ
- in Ada.Characters.Latin_1 *note A.3.3(5): 6048.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6048.
Enqueue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 8027.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+8027.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
8012.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(5/3):
-7997.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(5/3): 7997.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
8019.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-8005.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 8005.
entity *note 3.1(12.b): 1393.
- [partial] *note 3.1(1): 1350.
+ [<partial>] *note 3.1(1): 1350.
entity with runtime name text *note C.5(1.1/4): 8366.
entry
closed *note 9.5.3(5): 4466.
@@ -135076,63 +135582,63 @@ entry queue *note 9.5.3(12): 4475.
entry queuing policy *note 9.5.3(17): 4479.
default policy *note 9.5.3(17): 4481.
entry_barrier *note 9.5.2(7): 4428.
- used *note 9.5.2(5): 4421, *note P: 10377.
+ <used> *note 9.5.2(5): 4421, *note P: 10377.
entry_body *note 9.5.2(5): 4418.
- used *note 9.4(8/4): 4346, *note P: 10362.
+ <used> *note 9.4(8/4): 4346, *note P: 10362.
entry_body_formal_part *note 9.5.2(6): 4425.
- used *note 9.5.2(5): 4420, *note P: 10376.
+ <used> *note 9.5.2(5): 4420, *note P: 10376.
entry_call_alternative *note 9.7.2(3/2): 4622.
- used *note 9.7.2(2): 4620, *note 9.7.3(2): 4631, *note P: 10410.
+ <used> *note 9.7.2(2): 4620, *note 9.7.3(2): 4631, *note P: 10410.
entry_call_statement *note 9.5.3(2): 4460.
- used *note 5.1(4/2): 3376, *note 9.7.2(3.1/2): 4627, *note P:
+ <used> *note 5.1(4/2): 3376, *note 9.7.2(3.1/2): 4627, *note P:
10415.
entry_declaration *note 9.5.2(2/3): 4404.
- used *note 9.1(5/1): 4265, *note 9.4(5/1): 4331, *note P: 10350.
+ <used> *note 9.1(5/1): 4265, *note 9.4(5/1): 4331, *note P: 10350.
entry_index *note 9.5.2(4): 4416.
- used *note 9.5.2(3): 4412, *note P: 10370.
+ <used> *note 9.5.2(3): 4412, *note P: 10370.
entry_index_specification *note 9.5.2(8): 4430.
- used *note 9.5.2(6): 4426, *note P: 10381.
+ <used> *note 9.5.2(6): 4426, *note P: 10381.
enumeration literal *note 3.5.1(6/3): 1795.
enumeration type *note 3.2(3): 1408, *note 3.5.1(1): 1786, *note
N(17): 9680.
enumeration_aggregate *note 13.4(3): 5533.
- used *note 13.4(2): 5532, *note P: 10598.
+ <used> *note 13.4(2): 5532, *note P: 10598.
Enumeration_IO
- in Ada.Text_IO *note A.10.1(79): 7095.
+ <in> Ada.Text_IO *note A.10.1(79): 7095.
enumeration_literal_specification *note 3.5.1(3): 1790.
- used *note 3.5.1(2): 1788, *note P: 9857.
+ <used> *note 3.5.1(2): 1788, *note P: 9857.
enumeration_representation_clause *note 13.4(2): 5530.
- used *note 13.1(2/1): 5347, *note P: 10576.
+ <used> *note 13.1(2/1): 5347, *note P: 10576.
enumeration_type_definition *note 3.5.1(2): 1787.
- used *note 3.2.1(4/2): 1450, *note P: 9809.
+ <used> *note 3.2.1(4/2): 1450, *note P: 9809.
environment *note 10.1.4(1): 4812.
environment declarative_part *note 10.1.4(1): 4813.
for the environment task of a partition *note 10.2(13): 4854.
environment task *note 10.2(8): 4851.
environment variable *note A.17(1/2): 7303.
Environment_Task
- in Ada.Task_Identification *note C.7.1(3/3): 8405.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8405.
Environment_Variables
- child of Ada *note A.17(3/2): 7304.
+ <child of> Ada *note A.17(3/2): 7304.
EOT
- in Ada.Characters.Latin_1 *note A.3.3(5): 6047.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6047.
EPA
- in Ada.Characters.Latin_1 *note A.3.3(18): 6164.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6164.
epoch *note D.8(19): 8677.
equal operator *note 4.4(1/3): 2805, *note 4.5.2(1): 2983.
Equal_Case_Insensitive
- child of Ada.Strings *note A.4.10(2/3): 6621.
- child of Ada.Strings.Bounded *note A.4.10(7/3): 6623.
- child of Ada.Strings.Fixed *note A.4.10(5/3): 6622.
- child of Ada.Strings.Unbounded *note A.4.10(10/3): 6624.
+ <child of> Ada.Strings *note A.4.10(2/3): 6621.
+ <child of> Ada.Strings.Bounded *note A.4.10(7/3): 6623.
+ <child of> Ada.Strings.Fixed *note A.4.10(5/3): 6622.
+ <child of> Ada.Strings.Unbounded *note A.4.10(10/3): 6624.
Equal_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7841.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7841.
equality operator *note 4.5.2(1): 2977.
special inheritance rule for tagged types *note 3.4(17/2): 1637,
*note 4.5.2(14/3): 3013.
equals sign *note 2.1(15/3): 1217.
Equals_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 6095.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6095.
equivalence of use_clauses and selected_components *note 8.4(1.a):
4102.
equivalent element
@@ -135142,17 +135648,17 @@ equivalent key
of a hashed map *note A.18.5(42/2): 7572.
of an ordered map *note A.18.6(55/2): 7634.
Equivalent_Elements
- in Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7710, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7710, *note
A.18.8(47/2): 7711, *note A.18.8(48/2): 7712.
- in Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7743.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7743.
Equivalent_Keys
- in Ada.Containers.Hashed_Maps *note A.18.5(34/2): 7567, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(34/2): 7567, *note
A.18.5(35/2): 7568, *note A.18.5(36/2): 7569.
- in Ada.Containers.Ordered_Maps *note A.18.6(3/2): 7584.
- in Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7796.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(3/2): 7584.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7796.
Equivalent_Sets
- in Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7674.
- in Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7750.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7674.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7750.
erroneous execution *note 1.1.2(32): 1040, *note 1.1.5(10): 1108.
cause *note 3.7.2(4): 2158, *note 3.9(25.3/2): 2279, *note
6.4.1(18/3): 3771, *note 9.8(21): 4677, *note 9.10(11): 4690, *note
@@ -135180,17 +135686,17 @@ error
link-time *note 1.1.2(29): 1031, *note 1.1.5(4): 1103.
run-time *note 1.1.2(30): 1037, *note 1.1.5(6): 1105, *note
11.5(2/3): 5048, *note 11.6(1/3): 5087.
- See also bounded error, erroneous execution
+ <See also> bounded error, erroneous execution
ESA
- in Ada.Characters.Latin_1 *note A.3.3(17): 6148.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6148.
ESC
- in Ada.Characters.Latin_1 *note A.3.3(6): 6070.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6070.
Establish_RPC_Receiver
- in System.RPC *note E.5(12): 8959.
+ <in> System.RPC *note E.5(12): 8959.
ETB
- in Ada.Characters.Latin_1 *note A.3.3(6): 6066.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6066.
ETX
- in Ada.Characters.Latin_1 *note A.3.3(5): 6046.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6046.
evaluable *note 3.1(11.g): 1389.
evaluation *note 3.1(11): 1385, *note 3.1(11.a): 1387, *note
N(17.1/2): 9681, *note N(19): 9687.
@@ -135238,40 +135744,41 @@ N(17.1/2): 9681, *note N(19): 9687.
Exception *note 11(1/3): 4924, *note 11.1(1): 4929, *note N(18): 9682.
exception occurrence *note 11(1/3): 4919.
exception_choice *note 11.2(5): 4956.
- used *note 11.2(3): 4951, *note P: 10475.
+ <used> *note 11.2(3): 4951, *note P: 10475.
exception_declaration *note 11.1(2/3): 4930.
- used *note 3.1(3/3): 1363, *note P: 9795.
+ <used> *note 3.1(3/3): 1363, *note P: 9795.
exception_handler *note 11.2(3): 4949.
- used *note 11.2(2): 4947, *note P: 10472.
+ <used> *note 11.2(2): 4947, *note P: 10472.
Exception_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4991.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4991.
Exception_Identity
- in Ada.Exceptions *note 11.4.1(5/2): 5002.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 5002.
Exception_Information
- in Ada.Exceptions *note 11.4.1(5/2): 5006.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 5006.
Exception_Message
- in Ada.Exceptions *note 11.4.1(4/3): 5000.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 5000.
Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4993, *note 11.4.1(5/2): 5003.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4993, *note 11.4.1(5/2):
+5003.
Exception_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4996.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4996.
Exception_Occurrence_Access
- in Ada.Exceptions *note 11.4.1(3/2): 4997.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4997.
exception_renaming_declaration *note 8.5.2(2/3): 4148.
- used *note 8.5(2): 4123, *note P: 10286.
+ <used> *note 8.5(2): 4123, *note P: 10286.
Exceptions
- child of Ada *note 11.4.1(2/2): 4990.
+ <child of> Ada *note 11.4.1(2/2): 4990.
Exchange_Handler
- in Ada.Interrupts *note C.3.2(8): 8354.
+ <in> Ada.Interrupts *note C.3.2(8): 8354.
Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(8): 6076.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6076.
exclamation point *note 2.1(15/3): 1222.
Exclude
- in Ada.Containers.Hashed_Maps *note A.18.5(24/2): 7558.
- in Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7692, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(24/2): 7558.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7692, *note
A.18.8(54/2): 7718.
- in Ada.Containers.Ordered_Maps *note A.18.6(23/2): 7612.
- in Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7766, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(23/2): 7612.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7766, *note
A.18.9(67/2): 7800.
excludes null
subtype *note 3.10(13.1/2): 2431.
@@ -135337,26 +135844,27 @@ execution resource
execution time
of a task *note D.14(11/3): 8731.
Execution_Time
- child of Ada *note D.14(3/2): 8719.
+ <child of> Ada *note D.14(3/2): 8719.
exhaust
a budget *note D.14.2(14/2): 8773.
exist
cease to *note 7.6.1(11/3): 4016, *note 13.11.2(10/4): 5746, *note
13.11.5(7.1/4): 5808.
Exists
- in Ada.Directories *note A.16(24/2): 7256.
- in Ada.Environment_Variables *note A.17(5/2): 7307.
+ <in> Ada.Directories *note A.16(24/2): 7256.
+ <in> Ada.Environment_Variables *note A.17(5/2): 7307.
exit_statement *note 5.7(2): 3525.
- used *note 5.1(4/2): 3372, *note P: 10135.
+ <used> *note 5.1(4/2): 3372, *note P: 10135.
Exit_Status
- in Ada.Command_Line *note A.15(7): 7230.
+ <in> Ada.Command_Line *note A.15(7): 7230.
Exp
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9040.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6683.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6683.
expanded name *note 4.1.3(4): 2610.
Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2250.
+ <in> Ada.Tags *note 3.9(7/2): 2250.
expected profile *note 8.6(26): 4209.
accept_statement entry_direct_name *note 9.5.2(11): 4433.
Access attribute_reference prefix *note 3.10.2(2.3/2): 2458.
@@ -135464,7 +135972,7 @@ expected type *note 8.6(20/2): 4203.
Unchecked_Access attribute *note 13.10(4.a): 5690.
variant_part discrete_choice *note 3.8.1(6): 2217.
expiration time
- [partial] *note 9.6(1): 4503.
+ [<partial>] *note 9.6(1): 4503.
for a delay_relative_statement *note 9.6(20): 4533.
for a delay_until_statement *note 9.6(20): 4532.
expires
@@ -135472,16 +135980,16 @@ expires
explicit declaration *note 3.1(5): 1369, *note N(11): 9672.
explicit initial value *note 3.3.1(1/3): 1553.
explicit_actual_parameter *note 6.4(6): 3735.
- used *note 6.4(5): 3734, *note P: 10236.
+ <used> *note 6.4(5): 3734, *note P: 10236.
explicit_dereference *note 4.1(5): 2560.
- used *note 4.1(2/3): 2543, *note P: 9973.
+ <used> *note 4.1(2/3): 2543, *note P: 9973.
explicit_generic_actual_parameter *note 12.3(5): 5155.
- used *note 12.3(4): 5154, *note P: 10514.
+ <used> *note 12.3(4): 5154, *note P: 10514.
explicitly aliased parameter *note 6.1(23.1/3): 3597.
explicitly assign *note 10.2(2): 4846.
explicitly limited record *note 3.8(13.1/3): 2183.
exponent *note 2.4.1(4): 1272, *note 4.5.6(11/3): 3100.
- used *note 2.4.1(2): 1267, *note 2.4.2(2): 1290, *note P: 9764.
+ <used> *note 2.4.1(2): 1267, *note 2.4.2(2): 1290, *note P: 9764.
Exponent attribute *note A.5.3(18): 6775.
exponentiation operator *note 4.4(1/3): 2860, *note 4.5.6(7): 3096.
Export aspect *note B.1(1/3): 8054.
@@ -135489,44 +135997,44 @@ Export pragma *note J.15.5(3/3): 9342, *note
L(13.1/3): 9527.
exported entity *note B.1(23/3): 8077.
expression *note 4.4(1/3): 2794, *note 4.4(2): 2867.
predicate-static *note 3.2.4(15/3): 1520.
- used *note 2.8(3/3): 1324, *note 3.3.1(2/3): 1569, *note 3.3.2(2):
-1610, *note 3.5.4(4): 1835, *note 3.5.7(2): 1908, *note 3.5.9(3): 1947,
-*note 3.5.9(4): 1950, *note 3.7(6): 2115, *note 3.7.1(3): 2143, *note
-4.1.1(2): 2581, *note 4.1.4(3/2): 2627, *note 4.1.4(5): 2632, *note
-4.3.1(4/2): 2710, *note 4.3.2(3): 2733, *note 4.3.3(3/2): 2755, *note
-4.3.3(5/2): 2765, *note 4.4(7/3): 2927, *note 4.5.7(3/3): 3111, *note
-4.5.7(4/3): 3116, *note 4.5.7(5/3): 3118, *note 4.5.7(6/3): 3123, *note
-4.5.8(3/3): 3144, *note 4.6(2): 3157, *note 4.7(2): 3262, *note 5.2(2):
-3403, *note 5.4(2/3): 3430, *note 6.4(6): 3736, *note 6.5(2.1/3): 3782,
-*note 6.5(2/2): 3778, *note 6.8(2/4): 3848, *note 9.5.2(4): 4417, *note
-9.6(3): 4509, *note 9.6(4): 4511, *note 11.3(2/2): 4966, *note
-11.4.2(3/2): 5022, *note 12.3(5): 5156, *note 13.1.1(4/3): 5400, *note
-13.3(2): 5431, *note 13.5.1(4): 5562, *note 13.12(4.1/2): 5820, *note
-B.1(8): 8068, *note B.1(10.1/3): 8070, *note D.2.2(3.2/2): 8489, *note
-J.7(1): 9274, *note J.8(1): 9285, *note J.15.4(2/3): 9320, *note
-J.15.5(2/3): 9340, *note J.15.5(3/3): 9345, *note J.15.7(4/3): 9365,
-*note J.15.9(2/3): 9401, *note L(2.1/2): 9475, *note L(6.1/3): 9497,
-*note L(8.2/3): 9504, *note L(13.1/3): 9530, *note L(14.1/3): 9536,
-*note L(19): 9559, *note L(27.2/2): 9594, *note L(35.1/3): 9625, *note
-P: 10028.
+ <used> *note 2.8(3/3): 1324, *note 3.3.1(2/3): 1569, *note
+3.3.2(2): 1610, *note 3.5.4(4): 1835, *note 3.5.7(2): 1908, *note
+3.5.9(3): 1947, *note 3.5.9(4): 1950, *note 3.7(6): 2115, *note
+3.7.1(3): 2143, *note 4.1.1(2): 2581, *note 4.1.4(3/2): 2627, *note
+4.1.4(5): 2632, *note 4.3.1(4/2): 2710, *note 4.3.2(3): 2733, *note
+4.3.3(3/2): 2755, *note 4.3.3(5/2): 2765, *note 4.4(7/3): 2927, *note
+4.5.7(3/3): 3111, *note 4.5.7(4/3): 3116, *note 4.5.7(5/3): 3118, *note
+4.5.7(6/3): 3123, *note 4.5.8(3/3): 3144, *note 4.6(2): 3157, *note
+4.7(2): 3262, *note 5.2(2): 3403, *note 5.4(2/3): 3430, *note 6.4(6):
+3736, *note 6.5(2.1/3): 3782, *note 6.5(2/2): 3778, *note 6.8(2/4):
+3848, *note 9.5.2(4): 4417, *note 9.6(3): 4509, *note 9.6(4): 4511,
+*note 11.3(2/2): 4966, *note 11.4.2(3/2): 5022, *note 12.3(5): 5156,
+*note 13.1.1(4/3): 5400, *note 13.3(2): 5431, *note 13.5.1(4): 5562,
+*note 13.12(4.1/2): 5820, *note B.1(8): 8068, *note B.1(10.1/3): 8070,
+*note D.2.2(3.2/2): 8489, *note J.7(1): 9274, *note J.8(1): 9285, *note
+J.15.4(2/3): 9320, *note J.15.5(2/3): 9340, *note J.15.5(3/3): 9345,
+*note J.15.7(4/3): 9365, *note J.15.9(2/3): 9401, *note L(2.1/2): 9475,
+*note L(6.1/3): 9497, *note L(8.2/3): 9504, *note L(13.1/3): 9530, *note
+L(14.1/3): 9536, *note L(19): 9559, *note L(27.2/2): 9594, *note
+L(35.1/3): 9625, *note P: 10028.
expression function *note 6.8(6/4): 3856.
expression_function_declaration *note 6.8(2/4): 3845.
- used *note 3.1(3/3): 1360, *note 9.4(8/4): 4345, *note P: 9792.
+ <used> *note 3.1(3/3): 1360, *note 9.4(8/4): 4345, *note P: 9792.
extended_digit *note 2.4.2(5): 1297.
- used *note 2.4.2(4): 1294, *note P: 9768.
-Extended_Index subtype of Index_Type'Base
- in Ada.Containers.Vectors *note A.18.2(7/2): 7337.
+ <used> *note 2.4.2(4): 1294, *note P: 9768.
+Extended_Index <subtype of> Index_Type'Base
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 7337.
extended_return_object_declaration *note 6.5(2.1/3): 3779.
- used *note 6.5(2.2/3): 3784, *note P: 10243.
+ <used> *note 6.5(2.2/3): 3784, *note P: 10243.
extended_return_statement *note 6.5(2.2/3): 3783.
- used *note 5.1(5/2): 3387, *note P: 10149.
+ <used> *note 5.1(5/2): 3387, *note P: 10149.
extension
of a private type *note 3.9(2.1/2): 2239, *note 3.9.1(1/2): 2293.
of a record type *note 3.9(2.1/2): 2237, *note 3.9.1(1/2): 2291.
of a type *note 3.9(2/2): 2236, *note 3.9.1(1/2): 2289.
- in Ada.Directories *note A.16(18/2): 7249.
+ <in> Ada.Directories *note A.16(18/2): 7249.
extension_aggregate *note 4.3.2(2): 2729.
- used *note 4.3(2): 2691, *note P: 10011.
+ <used> *note 4.3(2): 2691, *note P: 10011.
extensions to Ada 2005 *note 1.1.2(39.ff/3): 1062, *note 2.2(14.d/3):
1237, *note 2.8(19.f/3): 1336, *note 3.2.1(16.g/3): 1469, *note
3.2.2(15.e/3): 1499, *note 3.2.4(51.a/3): 1529, *note 3.3(26.j/3): 1551,
@@ -135695,7 +136203,7 @@ external streaming
type supports *note 13.13.2(52/3): 5923.
External_Name aspect *note B.1(1/3): 8058.
External_Tag
- in Ada.Tags *note 3.9(7/2): 2253.
+ <in> Ada.Tags *note 3.9(7/2): 2253.
External_Tag aspect *note 13.3(75/3): 5525, *note K.2(65): 9438.
External_Tag attribute *note 13.3(75/3): 5521.
External_Tag clause *note 13.3(7/2): 5446, *note 13.3(75/3): 5522,
@@ -135713,21 +136221,21 @@ F
factor *note 4.4(6): 2916.
- used *note 4.4(5): 2915, *note P: 10078.
+ <used> *note 4.4(5): 2915, *note P: 10078.
factory *note 3.9(30/2): 2280.
failure
of a language-defined check *note 11.5(2/3): 5049.
- in Ada.Command_Line *note A.15(8): 7232.
+ <in> Ada.Command_Line *note A.15(8): 7232.
fall-back handler *note C.7.3(9/2): 8442.
False *note 3.5.3(1): 1821.
family
entry *note 9.5.2(20): 4442.
Feminine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6184.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6184.
FF
- in Ada.Characters.Latin_1 *note A.3.3(5): 6055.
-Field subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6964.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6055.
+Field <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6964.
FIFO_Queuing queuing policy *note D.4(7/2): 8567.
FIFO_Within_Priorities task dispatching policy *note D.2.3(2/2): 8498.
file
@@ -135735,23 +136243,23 @@ file
file name *note A.16(46/2): 7280.
file terminator *note A.10(7): 6949.
File_Access
- in Ada.Text_IO *note A.10.1(18): 6986.
+ <in> Ada.Text_IO *note A.10.1(18): 6986.
File_Kind
- in Ada.Directories *note A.16(22/2): 7254.
+ <in> Ada.Directories *note A.16(22/2): 7254.
File_Mode
- in Ada.Direct_IO *note A.8.4(4): 6905.
- in Ada.Sequential_IO *note A.8.1(4): 6877.
- in Ada.Streams.Stream_IO *note A.12.1(6): 7166.
- in Ada.Text_IO *note A.10.1(4): 6960.
+ <in> Ada.Direct_IO *note A.8.4(4): 6905.
+ <in> Ada.Sequential_IO *note A.8.1(4): 6877.
+ <in> Ada.Streams.Stream_IO *note A.12.1(6): 7166.
+ <in> Ada.Text_IO *note A.10.1(4): 6960.
File_Size
- in Ada.Directories *note A.16(23/2): 7255.
+ <in> Ada.Directories *note A.16(23/2): 7255.
File_Type
- in Ada.Direct_IO *note A.8.4(3): 6904.
- in Ada.Sequential_IO *note A.8.1(3): 6876.
- in Ada.Streams.Stream_IO *note A.12.1(5/4): 7165.
- in Ada.Text_IO *note A.10.1(3): 6959.
+ <in> Ada.Direct_IO *note A.8.4(3): 6904.
+ <in> Ada.Sequential_IO *note A.8.1(3): 6876.
+ <in> Ada.Streams.Stream_IO *note A.12.1(5/4): 7165.
+ <in> Ada.Text_IO *note A.10.1(3): 6959.
Filter_Type
- in Ada.Directories *note A.16(30/2): 7261.
+ <in> Ada.Directories *note A.16(30/2): 7261.
finalization
of a master *note 7.6.1(4): 4012.
of a protected object *note 9.4(20): 4366.
@@ -135760,40 +136268,40 @@ finalization
of an object *note 7.6.1(5): 4013.
of environment task for a foreign language main subprogram *note
B.1(39/3): 8086.
- child of Ada *note 7.6(4/3): 3974.
+ <child of> Ada *note 7.6(4/3): 3974.
Finalize *note 7.6(2): 3972.
- in Ada.Finalization *note 7.6(6/2): 3978, *note 7.6(8/2): 3981.
+ <in> Ada.Finalization *note 7.6(6/2): 3978, *note 7.6(8/2): 3981.
Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 7479.
- in Ada.Containers.Hashed_Maps *note A.18.5(30/2): 7564.
- in Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7708, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 7479.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(30/2): 7564.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7708, *note
A.18.8(56/2): 7720.
- in Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7864.
- in Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7627.
- in Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7789, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7864.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7627.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7789, *note
A.18.9(69/2): 7802.
- in Ada.Containers.Vectors *note A.18.2(68/2): 7403.
+ <in> Ada.Containers.Vectors *note A.18.2(68/2): 7403.
Find_In_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7865.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7865.
Find_Index
- in Ada.Containers.Vectors *note A.18.2(67/2): 7402.
+ <in> Ada.Containers.Vectors *note A.18.2(67/2): 7402.
Find_Token
- in Ada.Strings.Bounded *note A.4.4(50.1/3): 6428, *note A.4.4(51):
-6429.
- in Ada.Strings.Fixed *note A.4.3(15.1/3): 6369, *note A.4.3(16):
+ <in> Ada.Strings.Bounded *note A.4.4(50.1/3): 6428, *note
+A.4.4(51): 6429.
+ <in> Ada.Strings.Fixed *note A.4.3(15.1/3): 6369, *note A.4.3(16):
6370.
- in Ada.Strings.Unbounded *note A.4.5(45.1/3): 6485, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(45.1/3): 6485, *note
A.4.5(46): 6486.
Fine_Delta
- in System *note 13.7(9): 5613.
+ <in> System *note 13.7(9): 5613.
First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 7471.
- in Ada.Containers.Hashed_Maps *note A.18.5(27/2): 7561.
- in Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7705.
- in Ada.Containers.Ordered_Maps *note A.18.6(28/2): 7617.
- in Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7781.
- in Ada.Containers.Vectors *note A.18.2(58/2): 7393.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3466.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 7471.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(27/2): 7561.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7705.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(28/2): 7617.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7781.
+ <in> Ada.Containers.Vectors *note A.18.2(58/2): 7393.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3466.
First attribute *note 3.5(12): 1704, *note 3.6.2(3): 2072.
first element
of a hashed set *note A.18.8(68/2): 7733.
@@ -135806,63 +136314,63 @@ first node
first subtype *note 3.2.1(6): 1458, *note 3.4.1(5): 1658.
First(N) attribute *note 3.6.2(4): 2074.
first_bit *note 13.5.1(5): 5563.
- used *note 13.5.1(3): 5559, *note P: 10605.
+ <used> *note 13.5.1(3): 5559, *note P: 10605.
First_Bit attribute *note 13.5.2(3/2): 5579.
First_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7886.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7886.
First_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7887.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7887.
First_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 7472.
- in Ada.Containers.Ordered_Maps *note A.18.6(29/2): 7618.
- in Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7782.
- in Ada.Containers.Vectors *note A.18.2(59/2): 7394.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 7472.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(29/2): 7618.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7782.
+ <in> Ada.Containers.Vectors *note A.18.2(59/2): 7394.
First_Index
- in Ada.Containers.Vectors *note A.18.2(57/2): 7392.
+ <in> Ada.Containers.Vectors *note A.18.2(57/2): 7392.
First_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(30/2): 7619.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(30/2): 7619.
First_Valid attribute *note 3.5.5(7.2/4): 1889.
Fixed
- child of Ada.Strings *note A.4.3(5): 6356.
+ <child of> Ada.Strings *note A.4.3(5): 6356.
fixed point type *note 3.5.9(1): 1939.
Fixed_IO
- in Ada.Text_IO *note A.10.1(68): 7075.
+ <in> Ada.Text_IO *note A.10.1(68): 7075.
fixed_point_definition *note 3.5.9(2): 1943.
- used *note 3.5.6(2): 1899, *note P: 9867.
+ <used> *note 3.5.6(2): 1899, *note P: 9867.
Float *note 3.5.7(12): 1928, *note 3.5.7(14): 1930.
- in Standard *note A.1(21): 5977.
+ <in> Standard *note A.1(21): 5977.
Float_IO
- in Ada.Text_IO *note A.10.1(63): 7065.
+ <in> Ada.Text_IO *note A.10.1(63): 7065.
Float_Random
- child of Ada.Numerics *note A.5.2(5): 6716.
+ <child of> Ada.Numerics *note A.5.2(5): 6716.
Float_Text_IO
- child of Ada *note A.10.9(33): 7127.
+ <child of> Ada *note A.10.9(33): 7127.
Float_Wide_Text_IO
- child of Ada *note A.11(2/2): 7150.
+ <child of> Ada *note A.11(2/2): 7150.
Float_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7153.
+ <child of> Ada *note A.11(3/2): 7153.
Floating
- in Interfaces.COBOL *note B.4(9): 8230.
+ <in> Interfaces.COBOL *note B.4(9): 8230.
floating point type *note 3.5.7(1): 1906.
floating_point_definition *note 3.5.7(2): 1907.
- used *note 3.5.6(2): 1898, *note P: 9866.
+ <used> *note 3.5.6(2): 1898, *note P: 9866.
Floor
- in Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7629.
- in Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7790, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7629.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7790, *note
A.18.9(70/2): 7803.
Floor attribute *note A.5.3(30): 6789.
Flush
- in Ada.Direct_IO *note A.8.4(10.1/4): 6918.
- in Ada.Sequential_IO *note A.8.1(10.1/4): 6888.
- in Ada.Streams.Stream_IO *note A.12.1(25/1): 7189.
- in Ada.Text_IO *note A.10.1(21/1): 6994.
+ <in> Ada.Direct_IO *note A.8.4(10.1/4): 6918.
+ <in> Ada.Sequential_IO *note A.8.1(10.1/4): 6888.
+ <in> Ada.Streams.Stream_IO *note A.12.1(25/1): 7189.
+ <in> Ada.Text_IO *note A.10.1(21/1): 6994.
Fore attribute *note 3.5.10(4): 1992.
form
of an external file *note A.7(1): 6859.
- in Ada.Direct_IO *note A.8.4(9): 6916.
- in Ada.Sequential_IO *note A.8.1(9): 6886.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7177.
- in Ada.Text_IO *note A.10.1(12): 6975.
+ <in> Ada.Direct_IO *note A.8.4(9): 6916.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6886.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7177.
+ <in> Ada.Text_IO *note A.10.1(12): 6975.
formal object, generic *note 12.4(1): 5190.
formal package, generic *note 12.7(1): 5320.
formal parameter
@@ -135871,77 +136379,77 @@ formal subprogram, generic *note 12.6(1): 5292.
formal subtype *note 12.5(5): 5251.
formal type *note 12.5(5): 5249.
formal_abstract_subprogram_declaration *note 12.6(2.2/3): 5300.
- used *note 12.6(2/2): 5295, *note P: 10557.
+ <used> *note 12.6(2/2): 5295, *note P: 10557.
formal_access_type_definition *note 12.5.4(2): 5281.
- used *note 12.5(3/2): 5242, *note P: 10549.
+ <used> *note 12.5(3/2): 5242, *note P: 10549.
formal_array_type_definition *note 12.5.3(2): 5276.
- used *note 12.5(3/2): 5241, *note P: 10548.
+ <used> *note 12.5(3/2): 5241, *note P: 10548.
formal_complete_type_declaration *note 12.5(2.1/3): 5224.
- used *note 12.5(2/3): 5222, *note P: 10532.
+ <used> *note 12.5(2/3): 5222, *note P: 10532.
formal_concrete_subprogram_declaration *note 12.6(2.1/3): 5296.
- used *note 12.6(2/2): 5294, *note P: 10556.
+ <used> *note 12.6(2/2): 5294, *note P: 10556.
formal_decimal_fixed_point_definition *note 12.5.2(7): 5275.
- used *note 12.5(3/2): 5240, *note P: 10547.
+ <used> *note 12.5(3/2): 5240, *note P: 10547.
formal_derived_type_definition *note 12.5.1(3/2): 5256.
- used *note 12.5(3/2): 5234, *note P: 10541.
+ <used> *note 12.5(3/2): 5234, *note P: 10541.
formal_discrete_type_definition *note 12.5.2(2): 5270.
- used *note 12.5(3/2): 5235, *note P: 10542.
+ <used> *note 12.5(3/2): 5235, *note P: 10542.
formal_floating_point_definition *note 12.5.2(5): 5273.
- used *note 12.5(3/2): 5238, *note P: 10545.
+ <used> *note 12.5(3/2): 5238, *note P: 10545.
formal_incomplete_type_declaration *note 12.5(2.2/3): 5229.
- used *note 12.5(2/3): 5223, *note P: 10533.
+ <used> *note 12.5(2/3): 5223, *note P: 10533.
formal_interface_type_definition *note 12.5.5(2/2): 5288.
- used *note 12.5(3/2): 5243, *note P: 10550.
+ <used> *note 12.5(3/2): 5243, *note P: 10550.
formal_modular_type_definition *note 12.5.2(4): 5272.
- used *note 12.5(3/2): 5237, *note P: 10544.
+ <used> *note 12.5(3/2): 5237, *note P: 10544.
formal_object_declaration *note 12.4(2/3): 5191.
- used *note 12.1(6): 5117, *note P: 10493.
+ <used> *note 12.1(6): 5117, *note P: 10493.
formal_ordinary_fixed_point_definition *note 12.5.2(6): 5274.
- used *note 12.5(3/2): 5239, *note P: 10546.
+ <used> *note 12.5(3/2): 5239, *note P: 10546.
formal_package_actual_part *note 12.7(3/2): 5326.
- used *note 12.7(2/3): 5324, *note P: 10568.
+ <used> *note 12.7(2/3): 5324, *note P: 10568.
formal_package_association *note 12.7(3.1/2): 5330.
- used *note 12.7(3/2): 5328, *note P: 10571.
+ <used> *note 12.7(3/2): 5328, *note P: 10571.
formal_package_declaration *note 12.7(2/3): 5321.
- used *note 12.1(6): 5120, *note P: 10496.
+ <used> *note 12.1(6): 5120, *note P: 10496.
formal_part *note 6.1(14): 3575.
- used *note 6.1(12): 3568, *note 6.1(13/2): 3570, *note P: 10205.
+ <used> *note 6.1(12): 3568, *note 6.1(13/2): 3570, *note P: 10205.
formal_private_type_definition *note 12.5.1(2): 5255.
- used *note 12.5(3/2): 5233, *note P: 10540.
+ <used> *note 12.5(3/2): 5233, *note P: 10540.
formal_signed_integer_type_definition *note 12.5.2(3): 5271.
- used *note 12.5(3/2): 5236, *note P: 10543.
+ <used> *note 12.5(3/2): 5236, *note P: 10543.
formal_subprogram_declaration *note 12.6(2/2): 5293.
- used *note 12.1(6): 5119, *note P: 10495.
+ <used> *note 12.1(6): 5119, *note P: 10495.
formal_type_declaration *note 12.5(2/3): 5221.
- used *note 12.1(6): 5118, *note P: 10494.
+ <used> *note 12.1(6): 5118, *note P: 10494.
formal_type_definition *note 12.5(3/2): 5232.
- used *note 12.5(2.1/3): 5227, *note P: 10536.
+ <used> *note 12.5(2.1/3): 5227, *note P: 10536.
format_effector *note 2.1(13/3): 1190.
Formatting
- child of Ada.Calendar *note 9.6.1(15/2): 4552.
+ <child of> Ada.Calendar *note 9.6.1(15/2): 4552.
Fortran
- child of Interfaces *note B.5(4): 8283.
+ <child of> Interfaces *note B.5(4): 8283.
Fortran interface *note B.5(1/3): 8282.
Fortran standard *note 1.2(3/2): 1126.
Fortran_Character
- in Interfaces.Fortran *note B.5(12/3): 8294.
+ <in> Interfaces.Fortran *note B.5(12/3): 8294.
Fortran_Integer
- in Interfaces.Fortran *note B.5(5): 8284.
+ <in> Interfaces.Fortran *note B.5(5): 8284.
forward iterator *note 5.5.2(4/3): 3508.
Forward_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3465.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3465.
Fraction attribute *note A.5.3(21): 6777.
Fraction_One_Half
- in Ada.Characters.Latin_1 *note A.3.3(22): 6205.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6205.
Fraction_One_Quarter
- in Ada.Characters.Latin_1 *note A.3.3(22): 6204.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6204.
Fraction_Three_Quarters
- in Ada.Characters.Latin_1 *note A.3.3(22): 6206.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6206.
Free
- in Ada.Strings.Unbounded *note A.4.5(7): 6461.
- in Interfaces.C.Strings *note B.3.1(11): 8183.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 6461.
+ <in> Interfaces.C.Strings *note B.3.1(11): 8183.
freed
- See nonexistent *note 13.11.2(10/4): 5744.
+ <See> nonexistent *note 13.11.2(10/4): 5744.
freeing storage *note 13.11.2(1): 5741.
freezing
by a constituent of a construct *note 13.14(4/1): 5936.
@@ -135987,9 +136495,9 @@ freezing
freezing points
entity *note 13.14(2): 5931.
Friday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4558.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4558.
FS
- in Ada.Characters.Latin_1 *note A.3.3(6): 6071.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6071.
full conformance
for discrete_subtype_definitions *note 6.3.1(24): 3712.
for expressions *note 6.3.1(19): 3709.
@@ -136011,11 +136519,12 @@ full type definition *note 3.2.1(8/2): 1463.
full view
of a type *note 3.2.1(8/2): 1464.
Full_Name
- in Ada.Directories *note A.16(15/2): 7246, *note A.16(39/2): 7268.
+ <in> Ada.Directories *note A.16(15/2): 7246, *note A.16(39/2):
+7268.
Full_Stop
- in Ada.Characters.Latin_1 *note A.3.3(8): 6090.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6090.
full_type_declaration *note 3.2.1(3/3): 1442.
- used *note 3.2.1(2): 1438, *note P: 9799.
+ <used> *note 3.2.1(2): 1438, *note P: 9799.
function *note 6(1): 3536, *note N(19.1/2): 9688.
expression *note 6.8(6/4): 3857.
with a controlling access result *note 3.9.2(2/3): 2322.
@@ -136024,9 +136533,9 @@ function call
master of *note 3.10.2(10.1/3): 2472.
function instance *note 12.3(13): 5175.
function_call *note 6.4(3): 3725.
- used *note 4.1(2/3): 2549, *note P: 9979.
+ <used> *note 4.1(2/3): 2549, *note P: 9979.
function_specification *note 6.1(4.2/2): 3550.
- used *note 6.1(4/2): 3546, *note 6.8(2/4): 3847, *note P: 10255.
+ <used> *note 6.1(4/2): 3546, *note 6.8(2/4): 3847, *note P: 10255.
@@ -136040,17 +136549,17 @@ G
gaps *note 13.3(52.d/2): 5498.
general access type *note 3.10(7/1): 2413, *note 3.10(8): 2417.
general_access_modifier *note 3.10(4): 2398.
- used *note 3.10(3): 2396, *note P: 9948.
+ <used> *note 3.10(3): 2396, *note P: 9948.
generalized iterator *note 5.5.2(3/3): 3498.
generalized_indexing *note 4.1.6(10/3): 2659.
- used *note 4.1(2/3): 2553, *note P: 9983.
+ <used> *note 4.1(2/3): 2553, *note P: 9983.
generalized_reference *note 4.1.5(4/3): 2644.
- used *note 4.1(2/3): 2552, *note P: 9982.
+ <used> *note 4.1(2/3): 2552, *note P: 9982.
generation
of an interrupt *note C.3(2): 8317.
Generator
- in Ada.Numerics.Discrete_Random *note A.5.2(19): 6730.
- in Ada.Numerics.Float_Random *note A.5.2(7): 6717.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(19): 6730.
+ <in> Ada.Numerics.Float_Random *note A.5.2(7): 6717.
generic actual *note 12.3(7/3): 5165.
generic actual parameter *note 12.3(7/3): 5164.
generic actual subtype *note 12.5(4): 5244.
@@ -136058,7 +136567,7 @@ generic actual type *note 12.5(4): 5246.
generic body *note 12.2(1): 5129.
generic contract issue *note 10.2.1(10/2): 4879, *note 12.3(11.y):
5169.
- [partial] *note 3.2.4(29/3): 1521, *note 3.4(5.1/3): 1626, *note
+ [<partial>] *note 3.2.4(29/3): 1521, *note 3.4(5.1/3): 1626, *note
3.7(10/3): 2119, *note 3.7.1(7/3): 2149, *note 3.9.1(3/2): 2296, *note
3.9.4(17/2): 2383, *note 3.10.2(29.1/3): 2486, *note 3.10.2(33/3): 2494,
*note 4.5.2(9.8/4): 3011, *note 4.6(24.22/4): 3192, *note 4.8(5.6/3):
@@ -136086,96 +136595,99 @@ generic package *note 12.1(8/2): 5121.
generic procedure *note 12.1(8/2): 5123.
generic subprogram *note 12.1(8/2): 5122.
generic unit *note 12(1): 5098, *note N(20): 9689.
- See also dispatching operation *note 3.9(1): 2229.
+ <See also> dispatching operation *note 3.9(1): 2229.
generic_actual_part *note 12.3(3): 5149.
- used *note 12.3(2/3): 5147, *note 12.7(3/2): 5327, *note P: 10504.
+ <used> *note 12.3(2/3): 5147, *note 12.7(3/2): 5327, *note P:
+10504.
Generic_Array_Sort
- child of Ada.Containers *note A.18.26(3/2): 7987.
+ <child of> Ada.Containers *note A.18.26(3/2): 7987.
generic_association *note 12.3(4): 5152.
- used *note 12.3(3): 5151, *note 12.7(3.1/2): 5331, *note P: 10511.
+ <used> *note 12.3(3): 5151, *note 12.7(3.1/2): 5331, *note P:
+10511.
Generic_Bounded_Length
- in Ada.Strings.Bounded *note A.4.4(4): 6395.
+ <in> Ada.Strings.Bounded *note A.4.4(4): 6395.
Generic_Complex_Arrays
- child of Ada.Numerics *note G.3.2(2/2): 9147.
+ <child of> Ada.Numerics *note G.3.2(2/2): 9147.
Generic_Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(2/2): 9036.
+ <child of> Ada.Numerics *note G.1.2(2/2): 9036.
Generic_Complex_Types
- child of Ada.Numerics *note G.1.1(2/1): 9008.
+ <child of> Ada.Numerics *note G.1.1(2/1): 9008.
Generic_Constrained_Array_Sort
- child of Ada.Containers *note A.18.26(7/2): 7989.
+ <child of> Ada.Containers *note A.18.26(7/2): 7989.
generic_declaration *note 12.1(2): 5103.
- used *note 3.1(3/3): 1364, *note 10.1.1(5): 4721, *note P: 10437.
+ <used> *note 3.1(3/3): 1364, *note 10.1.1(5): 4721, *note P: 10437.
Generic_Dispatching_Constructor
- child of Ada.Tags *note 3.9(18.2/3): 2272.
+ <child of> Ada.Tags *note 3.9(18.2/3): 2272.
Generic_Elementary_Functions
- child of Ada.Numerics *note A.5.1(3): 6679.
+ <child of> Ada.Numerics *note A.5.1(3): 6679.
generic_formal_parameter_declaration *note 12.1(6): 5116.
- used *note 12.1(5): 5114, *note P: 10491.
+ <used> *note 12.1(5): 5114, *note P: 10491.
generic_formal_part *note 12.1(5): 5113.
- used *note 12.1(3/3): 5107, *note 12.1(4): 5111, *note P: 10486.
+ <used> *note 12.1(3/3): 5107, *note 12.1(4): 5111, *note P: 10486.
generic_instantiation *note 12.3(2/3): 5134.
- used *note 3.1(3/3): 1365, *note 10.1.1(5): 4722, *note P: 9797.
+ <used> *note 3.1(3/3): 1365, *note 10.1.1(5): 4722, *note P: 9797.
Generic_Keys
- in Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7714.
- in Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7795.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7714.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7795.
generic_package_declaration *note 12.1(4): 5110.
- used *note 12.1(2): 5105, *note P: 10485.
+ <used> *note 12.1(2): 5105, *note P: 10485.
Generic_Real_Arrays
- child of Ada.Numerics *note G.3.1(2/2): 9130.
+ <child of> Ada.Numerics *note G.3.1(2/2): 9130.
generic_renaming_declaration *note 8.5.5(2/3): 4177.
- used *note 8.5(2): 4126, *note 10.1.1(6): 4725, *note P: 10440.
+ <used> *note 8.5(2): 4126, *note 10.1.1(6): 4725, *note P: 10440.
Generic_Sort
- child of Ada.Containers *note A.18.26(9.2/4): 7991.
+ <child of> Ada.Containers *note A.18.26(9.2/4): 7991.
Generic_Sorting
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 7484.
- in Ada.Containers.Vectors *note A.18.2(75/2): 7409.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 7484.
+ <in> Ada.Containers.Vectors *note A.18.2(75/2): 7409.
generic_subprogram_declaration *note 12.1(3/3): 5106.
- used *note 12.1(2): 5104, *note P: 10484.
+ <used> *note 12.1(2): 5104, *note P: 10484.
Get
- in Ada.Text_IO *note A.10.1(41): 7027, *note A.10.1(47): 7037,
+ <in> Ada.Text_IO *note A.10.1(41): 7027, *note A.10.1(47): 7037,
*note A.10.1(54): 7050, *note A.10.1(55): 7054, *note A.10.1(59): 7059,
*note A.10.1(60): 7063, *note A.10.1(65): 7069, *note A.10.1(67): 7073,
*note A.10.1(70): 7080, *note A.10.1(72): 7083, *note A.10.1(75): 7089,
*note A.10.1(77): 7093, *note A.10.1(81): 7098, *note A.10.1(83): 7102.
- in Ada.Text_IO.Complex_IO *note G.1.3(6): 9069, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(6): 9069, *note G.1.3(8):
9073.
Get_CPU
- in Ada.Interrupts *note C.3.2(10.1/3): 8357.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
+ <in> Ada.Interrupts *note C.3.2(10.1/3): 8357.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
8818.
Get_CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.3/4):
-8814.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.3/4): 8814.
Get_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8528.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8528.
Get_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
8815.
Get_First_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
8810.
Get_Immediate
- in Ada.Text_IO *note A.10.1(44): 7033, *note A.10.1(45): 7036.
+ <in> Ada.Text_IO *note A.10.1(44): 7033, *note A.10.1(45): 7036.
Get_Last_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
8811.
Get_Line
- in Ada.Text_IO *note A.10.1(49): 7041, *note A.10.1(49.1/2): 7043.
- in Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 7133, *note
+ <in> Ada.Text_IO *note A.10.1(49): 7041, *note A.10.1(49.1/2):
+7043.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 7133, *note
A.10.11(9/2): 7134, *note A.10.11(10/2): 7135, *note A.10.11(11/2):
7136.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 7143, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 7143, *note
A.10.12(9/2): 7144, *note A.10.12(10/2): 7145, *note A.10.12(11/2):
7146.
Get_Next_Entry
- in Ada.Directories *note A.16(35/2): 7266.
+ <in> Ada.Directories *note A.16(35/2): 7266.
Get_Priority
- in Ada.Dynamic_Priorities *note D.5.1(5): 8573.
+ <in> Ada.Dynamic_Priorities *note D.5.1(5): 8573.
global to *note 8.1(15): 4042.
Glossary *note N(1/2): 9654.
glyphs *note 2.1(15.a/3): 1225.
goto_statement *note 5.8(2): 3530.
- used *note 5.1(4/2): 3373, *note P: 10136.
+ <used> *note 5.1(4/2): 3373, *note P: 10136.
govern a variant *note 3.8.1(20): 2221.
govern a variant_part *note 3.8.1(20): 2220.
grammar
@@ -136190,29 +136702,29 @@ graphic character
a category of Character *note A.3.2(23): 6030.
graphic symbols *note 2.1(15.a/3): 1224.
graphic_character *note 2.1(14/3): 1195.
- used *note 2.5(2): 1301, *note 2.6(3): 1306, *note P: 9772.
+ <used> *note 2.5(2): 1301, *note 2.6(3): 1306, *note P: 9772.
Graphic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6513.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6513.
Grave
- in Ada.Characters.Latin_1 *note A.3.3(13): 6104.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6104.
greater than operator *note 4.4(1/3): 2821, *note 4.5.2(1): 2999.
greater than or equal operator *note 4.4(1/3): 2825, *note 4.5.2(1):
3003.
greater-than sign *note 2.1(15/3): 1218.
Greater_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 6096.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6096.
Group_Budget
- in Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8754.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8754.
Group_Budget_Error
- in Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8770.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8770.
Group_Budget_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8755.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8755.
Group_Budgets
- child of Ada.Execution_Time *note D.14.2(3/3): 8753.
+ <child of> Ada.Execution_Time *note D.14.2(3/3): 8753.
GS
- in Ada.Characters.Latin_1 *note A.3.3(6): 6072.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6072.
guard *note 9.7.1(3): 4599.
- used *note 9.7.1(2): 4596, *note P: 10399.
+ <used> *note 9.7.1(2): 4596, *note P: 10399.
@@ -136229,7 +136741,7 @@ handle
an exception occurrence *note 11.4(1): 4976, *note 11.4(7): 4987.
subpool *note 13.11.4(18/3): 5790.
handled_sequence_of_statements *note 11.2(2): 4945.
- used *note 5.6(2): 3522, *note 6.3(2/3): 3675, *note 6.5(2.2/3):
+ <used> *note 5.6(2): 3522, *note 6.3(2/3): 3675, *note 6.5(2.2/3):
3785, *note 7.2(2/3): 3888, *note 9.1(6/3): 4271, *note 9.5.2(3): 4414,
*note 9.5.2(5): 4423, *note P: 10379.
handler *note 11.2(5.a): 4958.
@@ -136239,43 +136751,44 @@ handler *note 11.2(5.a): 4958.
termination *note C.7.3(8/3): 8441.
timing event *note D.15(10/2): 8795.
Handling
- child of Ada.Characters *note A.3.2(2/2): 6001.
- child of Ada.Wide_Characters *note A.3.5(3/3): 6292.
- child of Ada.Wide_Wide_Characters *note A.3.6(1/3): 6314.
+ <child of> Ada.Characters *note A.3.2(2/2): 6001.
+ <child of> Ada.Wide_Characters *note A.3.5(3/3): 6292.
+ <child of> Ada.Wide_Wide_Characters *note A.3.6(1/3): 6314.
Has_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 7442.
- in Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 7533.
- in Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7672.
- in Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7839.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 7589.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7748.
- in Ada.Containers.Vectors *note A.18.2(11.1/3): 7343.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 7442.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 7533.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7672.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7839.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 7589.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7748.
+ <in> Ada.Containers.Vectors *note A.18.2(11.1/3): 7343.
Has_Same_Storage attribute *note 13.3(73.2/4): 5517.
Hash
- child of Ada.Strings *note A.4.9(2/3): 6612.
- child of Ada.Strings.Bounded *note A.4.9(7/3): 6613.
- child of Ada.Strings.Unbounded *note A.4.9(10/3): 6614.
+ <child of> Ada.Strings *note A.4.9(2/3): 6612.
+ <child of> Ada.Strings.Bounded *note A.4.9(7/3): 6613.
+ <child of> Ada.Strings.Unbounded *note A.4.9(10/3): 6614.
Hash_Case_Insensitive
- child of Ada.Strings *note A.4.9(11.2/3): 6615.
- child of Ada.Strings.Bounded *note A.4.9(11.7/3): 6617.
- child of Ada.Strings.Fixed *note A.4.9(11.5/3): 6616.
- child of Ada.Strings.Unbounded *note A.4.9(11.10/3): 6618.
+ <child of> Ada.Strings *note A.4.9(11.2/3): 6615.
+ <child of> Ada.Strings.Bounded *note A.4.9(11.7/3): 6617.
+ <child of> Ada.Strings.Fixed *note A.4.9(11.5/3): 6616.
+ <child of> Ada.Strings.Unbounded *note A.4.9(11.10/3): 6618.
Hash_Type
- in Ada.Containers *note A.18.1(4/2): 7326.
+ <in> Ada.Containers *note A.18.1(4/2): 7326.
Hashed_Maps
- child of Ada.Containers *note A.18.5(2/3): 7528.
+ <child of> Ada.Containers *note A.18.5(2/3): 7528.
Hashed_Sets
- child of Ada.Containers *note A.18.8(2/3): 7667.
+ <child of> Ada.Containers *note A.18.8(2/3): 7667.
Head
- in Ada.Strings.Bounded *note A.4.4(70): 6446, *note A.4.4(71):
+ <in> Ada.Strings.Bounded *note A.4.4(70): 6446, *note A.4.4(71):
6447.
- in Ada.Strings.Fixed *note A.4.3(35): 6387, *note A.4.3(36): 6388.
- in Ada.Strings.Unbounded *note A.4.5(65): 6503, *note A.4.5(66):
+ <in> Ada.Strings.Fixed *note A.4.3(35): 6387, *note A.4.3(36):
+6388.
+ <in> Ada.Strings.Unbounded *note A.4.5(65): 6503, *note A.4.5(66):
6504.
head (of a queue) *note D.2.1(5/2): 8474.
heap management
user-defined *note 13.11(1): 5694.
- See also allocator *note 4.8(1): 3278.
+ <See also> allocator *note 4.8(1): 3278.
Heart of Darkness *note 3.10.2(3.b/3): 2466.
held priority *note D.11(4/2): 8710.
heterogeneous input-output *note A.12.1(1): 7160.
@@ -136285,7 +136798,7 @@ hexadecimal digit
a category of Character *note A.3.2(30): 6036.
hexadecimal literal *note 2.4.2(1): 1283.
Hexadecimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6519.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6519.
hidden from all visibility *note 8.3(5): 4068, *note 8.3(14): 4079.
by lack of a with_clause *note 8.3(20/2): 4083.
for a declaration completed by a subsequent declaration *note
@@ -136297,29 +136810,29 @@ hidden from direct visibility *note 8.3(5): 4069,
*note 8.3(21): 4088.
where hidden from all visibility *note 8.3(23): 4090.
hiding *note 8.3(5): 4067.
Hierarchical_File_Names
- child of Ada.Directories *note A.16.1(3/3): 7290.
+ <child of> Ada.Directories *note A.16.1(3/3): 7290.
High_Order_First *note 13.5.3(2): 5586.
- in Interfaces.COBOL *note B.4(25): 8254.
- in System *note 13.7(15/2): 5622.
+ <in> Interfaces.COBOL *note B.4(25): 8254.
+ <in> System *note 13.7(15/2): 5622.
highest precedence operator *note 4.5.6(1): 3085.
highest_precedence_operator *note 4.5(7): 2944.
Hold
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 8706.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8706.
Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7933.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7933.
homograph *note 8.3(8): 4072.
Hour
- in Ada.Calendar.Formatting *note 9.6.1(24/2): 4569.
-Hour_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4562.
+ <in> Ada.Calendar.Formatting *note 9.6.1(24/2): 4569.
+Hour_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4562.
HT
- in Ada.Characters.Latin_1 *note A.3.3(5): 6052.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6052.
HTJ
- in Ada.Characters.Latin_1 *note A.3.3(17): 6150.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6150.
HTS
- in Ada.Characters.Latin_1 *note A.3.3(17): 6149.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6149.
Hyphen
- in Ada.Characters.Latin_1 *note A.3.3(8): 6088.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6088.
hyphen-minus *note 2.1(15/3): 1207.
@@ -136332,11 +136845,11 @@ I
i
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9011.
- in Interfaces.Fortran *note B.5(10): 8291.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9011.
+ <in> Interfaces.Fortran *note B.5(10): 8291.
identifier *note 2.3(2/2): 1238.
- used *note 2.8(2): 1313, *note 2.8(3/3): 1319, *note 2.8(21): 1339,
-*note 2.8(23): 1344, *note 3.1(4): 1367, *note 4.1(3): 2555, *note
+ <used> *note 2.8(2): 1313, *note 2.8(3/3): 1319, *note 2.8(21):
+1339, *note 2.8(23): 1344, *note 3.1(4): 1367, *note 4.1(3): 2555, *note
4.1.3(3): 2607, *note 4.1.4(3/2): 2626, *note 5.5(2): 3449, *note
5.6(2): 3523, *note 6.1(5): 3555, *note 7.1(3/3): 3875, *note 7.2(2/3):
3890, *note 9.1(4): 4263, *note 9.1(6/3): 4272, *note 9.4(4): 4328,
@@ -136355,13 +136868,13 @@ L(29): 9605, *note L(36): 9628, *note L(37): 9631,
*note L(37.3/2):
9637, *note M.2(98): 9651, *note P: 10357.
identifier specific to a pragma *note 2.8(10/3): 1329.
identifier_extend *note 2.3(3.1/3): 1249.
- used *note 2.3(2/2): 1241, *note P: 9740.
+ <used> *note 2.3(2/2): 1241, *note P: 9740.
identifier_start *note 2.3(3/2): 1242.
- used *note 2.3(2/2): 1240, *note P: 9738.
+ <used> *note 2.3(2/2): 1240, *note P: 9738.
Identity
- in Ada.Strings.Maps *note A.4.2(22): 6347.
- in Ada.Strings.Wide_Maps *note A.4.7(22): 6559.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6601.
+ <in> Ada.Strings.Maps *note A.4.2(22): 6347.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(22): 6559.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6601.
Identity attribute *note 11.4.1(9): 5010, *note C.7.1(12): 8411.
idle task *note D.11(4/2): 8711.
IEC 559:1989 *note G.2.2(11.a): 9110.
@@ -136370,30 +136883,30 @@ G.2.2(11.a): 9109.
IEEE_Float_32 *note B.2(10.a): 8102.
IEEE_Float_64 *note B.2(10.a): 8103.
if_expression *note 4.5.7(3/3): 3109.
- used *note 4.5.7(2/3): 3107, *note P: 10093.
+ <used> *note 4.5.7(2/3): 3107, *note P: 10093.
if_statement *note 5.3(2): 3422.
- used *note 5.1(5/2): 3383, *note P: 10145.
+ <used> *note 5.1(5/2): 3383, *note P: 10145.
illegal
construct *note 1.1.2(27): 1025.
partition *note 1.1.2(29): 1033.
Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9151,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9151,
*note G.3.2(27/2): 9164.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9014.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9014.
image
of a value *note 3.5(27.3/2): 1733, *note 3.5(30/3): 1738, *note
K.2(273/3): 9466, *note K.2(277.4/2): 9467.
- in Ada.Calendar.Formatting *note 9.6.1(35/2): 4580, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(35/2): 4580, *note
9.6.1(37/2): 4582.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6738.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6726.
- in Ada.Task_Identification *note C.7.1(3/3): 8403.
- in Ada.Text_IO.Editing *note F.3.3(13): 8997.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6738.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6726.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 8403.
+ <in> Ada.Text_IO.Editing *note F.3.3(13): 8997.
Image attribute *note 3.5(35): 1740, *note 3.5(55.4/4): 1776.
Imaginary
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 9010.
-Imaginary subtype of Imaginary
- in Interfaces.Fortran *note B.5(10): 8290.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 9010.
+Imaginary <subtype of> Imaginary
+ <in> Interfaces.Fortran *note B.5(10): 8290.
immediate scope
of (a view of) an entity *note 8.2(11): 4054.
of a declaration *note 8.2(2): 4044.
@@ -136411,7 +136924,7 @@ implementation defined *note 1.1.3(18): 1078.
implementation permissions *note 1.1.2(36): 1045.
implementation requirements *note 1.1.2(33): 1042.
implementation-dependent
- See unspecified *note 1.1.3(18): 1081.
+ <See> unspecified *note 1.1.3(18): 1081.
implemented
by a protected entry *note 9.4(11.1/3): 4352.
by a protected subprogram *note 9.4(11.1/3): 4351.
@@ -136456,7 +136969,7 @@ implicit subtype conversion *note 4.6(59): 3251,
*note 4.6(60): 3252.
reading a view conversion *note 4.6(56/4): 3246.
result of inherited function *note 3.4(27/2): 1644.
implicit_dereference *note 4.1(6): 2562.
- used *note 4.1(4): 2559, *note P: 9987.
+ <used> *note 4.1(4): 2559, *note P: 9987.
Implicit_Dereference aspect *note 4.1.5(2/3): 2640.
Import aspect *note B.1(1/3): 8052.
Import pragma *note J.15.5(2/3): 9336, *note L(14.1/3): 9533.
@@ -136466,10 +136979,10 @@ inaccessible partition *note E.1(7): 8838.
inactive
a task state *note 9(10): 4238.
Include
- in Ada.Containers.Hashed_Maps *note A.18.5(22/2): 7556.
- in Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7690.
- in Ada.Containers.Ordered_Maps *note A.18.6(21/2): 7610.
- in Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7764.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(22/2): 7556.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7690.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(21/2): 7610.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7764.
included
one execution by another *note 11.4(2.a): 4981.
one range in another *note 3.5(4): 1689.
@@ -136543,7 +137056,7 @@ incomplete type *note 3.2(4.1/2): 1410, *note
3.10.1(2.1/4): 2445,
incomplete view *note 3.10.1(2.1/4): 2446.
tagged *note 3.10.1(2.1/4): 2447.
incomplete_type_declaration *note 3.10.1(2/2): 2442.
- used *note 3.2.1(2): 1439, *note P: 9800.
+ <used> *note 3.2.1(2): 1439, *note P: 9800.
inconsistencies with Ada 2005 *note 1.1.2(39.z/3): 1059, *note
2.1(19.g/3): 1228, *note 3.5(63.l/3): 1783, *note 3.9(33.i/3): 2286,
*note 4.3.2(13.d/3): 2746, *note 4.3.3(45.i/3): 2792, *note
@@ -136577,24 +137090,24 @@ inconsistencies with Ada 95 *note 1.1.2(39.m/2):
1053, *note
11.4.1(19.y/2): 5014, *note 13.13.2(60.g/2): 5925, *note A.4.4(106.e/2):
6453, *note A.12.1(36.a/3): 7199, *note B.3.1(60.a/2): 8197.
Increment
- in Interfaces.C.Pointers *note B.3.2(11/3): 8204.
+ <in> Interfaces.C.Pointers *note B.3.2(11/3): 8204.
indefinite subtype *note 3.3(23/3): 1545, *note 3.7(26): 2131.
Indefinite_Doubly_Linked_Lists
- child of Ada.Containers *note A.18.12(2/3): 7913.
+ <child of> Ada.Containers *note A.18.12(2/3): 7913.
Indefinite_Hashed_Maps
- child of Ada.Containers *note A.18.13(2/3): 7916.
+ <child of> Ada.Containers *note A.18.13(2/3): 7916.
Indefinite_Hashed_Sets
- child of Ada.Containers *note A.18.15(2/3): 7922.
+ <child of> Ada.Containers *note A.18.15(2/3): 7922.
Indefinite_Holders
- child of Ada.Containers *note A.18.18(5/3): 7932.
+ <child of> Ada.Containers *note A.18.18(5/3): 7932.
Indefinite_Multiway_Trees
- child of Ada.Containers *note A.18.17(2/3): 7928.
+ <child of> Ada.Containers *note A.18.17(2/3): 7928.
Indefinite_Ordered_Maps
- child of Ada.Containers *note A.18.14(2/3): 7919.
+ <child of> Ada.Containers *note A.18.14(2/3): 7919.
Indefinite_Ordered_Sets
- child of Ada.Containers *note A.18.16(2/3): 7925.
+ <child of> Ada.Containers *note A.18.16(2/3): 7925.
Indefinite_Vectors
- child of Ada.Containers *note A.18.11(2/3): 7910.
+ <child of> Ada.Containers *note A.18.11(2/3): 7910.
Independent aspect *note C.6(6.3/3): 8380.
Independent pragma *note J.15.8(4/3): 9376, *note L(14.2/3): 9539.
independent subprogram *note 11.6(6/3): 5094.
@@ -136606,42 +137119,42 @@ independently addressable *note 9.10(1/3): 4687.
index
of an array *note 3.6(9.a): 2028.
of an element of an open direct file *note A.8(3): 6872.
- in Ada.Direct_IO *note A.8.4(15): 6924.
- in Ada.Streams.Stream_IO *note A.12.1(23): 7186.
- in Ada.Strings.Bounded *note A.4.4(43.1/2): 6417, *note
+ <in> Ada.Direct_IO *note A.8.4(15): 6924.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 7186.
+ <in> Ada.Strings.Bounded *note A.4.4(43.1/2): 6417, *note
A.4.4(43.2/2): 6418, *note A.4.4(44): 6419, *note A.4.4(45): 6420, *note
A.4.4(45.1/2): 6421, *note A.4.4(46): 6422.
- in Ada.Strings.Fixed *note A.4.3(8.1/2): 6358, *note A.4.3(8.2/2):
-6359, *note A.4.3(9): 6360, *note A.4.3(10): 6361, *note A.4.3(10.1/2):
-6362, *note A.4.3(11): 6363.
- in Ada.Strings.Unbounded *note A.4.5(38.1/2): 6474, *note
+ <in> Ada.Strings.Fixed *note A.4.3(8.1/2): 6358, *note
+A.4.3(8.2/2): 6359, *note A.4.3(9): 6360, *note A.4.3(10): 6361, *note
+A.4.3(10.1/2): 6362, *note A.4.3(11): 6363.
+ <in> Ada.Strings.Unbounded *note A.4.5(38.1/2): 6474, *note
A.4.5(38.2/2): 6475, *note A.4.5(39): 6476, *note A.4.5(40): 6477, *note
A.4.5(40.1/2): 6478, *note A.4.5(41): 6479.
index range *note 3.6(13): 2033.
index subtype *note 3.6(9): 2026.
index type *note 3.6(9): 2027.
Index_Check *note 11.5(14): 5066.
- [partial] *note 4.1.1(7): 2588, *note 4.1.2(7): 2598, *note
+ [<partial>] *note 4.1.1(7): 2588, *note 4.1.2(7): 2598, *note
4.3.3(29/3): 2784, *note 4.3.3(30): 2786, *note 4.5.3(8): 3045, *note
4.6(51/4): 3232, *note 4.7(4/4): 3271, *note 4.8(10/2): 3299.
index_constraint *note 3.6.1(2): 2056.
- used *note 3.2.2(7): 1488, *note P: 9829.
+ <used> *note 3.2.2(7): 1488, *note P: 9829.
Index_Error
- in Ada.Strings *note A.4.1(5): 6323.
+ <in> Ada.Strings *note A.4.1(5): 6323.
Index_Non_Blank
- in Ada.Strings.Bounded *note A.4.4(46.1/2): 6423, *note A.4.4(47):
-6424.
- in Ada.Strings.Fixed *note A.4.3(11.1/2): 6364, *note A.4.3(12):
+ <in> Ada.Strings.Bounded *note A.4.4(46.1/2): 6423, *note
+A.4.4(47): 6424.
+ <in> Ada.Strings.Fixed *note A.4.3(11.1/2): 6364, *note A.4.3(12):
6365.
- in Ada.Strings.Unbounded *note A.4.5(41.1/2): 6480, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(41.1/2): 6480, *note
A.4.5(42): 6481.
index_subtype_definition *note 3.6(4): 2013.
- used *note 3.6(3): 2010, *note P: 9883.
+ <used> *note 3.6(3): 2010, *note P: 9883.
indexable container object *note 4.1.6(5/3): 2658.
indexable container type *note 4.1.6(5/3): 2657, *note N(20.2/3):
9691.
indexed_component *note 4.1.1(2): 2579.
- used *note 4.1(2/3): 2544, *note P: 9974.
+ <used> *note 4.1(2/3): 2544, *note P: 9974.
indexing
constant *note 4.1.6(12/3): 2664.
variable *note 4.1.6(16/3): 2666.
@@ -136649,16 +137162,16 @@ individual membership test *note 4.5.2(26.1/3):
3017.
indivisible *note C.6(10/4): 8393.
inferable discriminants *note B.3.3(20/2): 8222.
Information
- child of Ada.Directories *note A.16(124/2): 7286.
+ <child of> Ada.Directories *note A.16(124/2): 7286.
information hiding
- See package *note 7(1): 3863.
- See private types and private extensions *note 7.3(1): 3895.
+ <See> package *note 7(1): 3863.
+ <See> private types and private extensions *note 7.3(1): 3895.
information systems *note C(1): 8306, *note F(1): 8965.
informative *note 1.1.2(18): 1010.
inherently mutable object *note 3.3(13/3): 1539.
inheritance
- See derived types and classes *note 3.4(1/2): 1616.
- See also tagged types and type extension *note 3.9(1): 2233.
+ <See> derived types and classes *note 3.4(1/2): 1616.
+ <See also> tagged types and type extension *note 3.9(1): 2233.
inherited
from an ancestor type *note 3.4.1(11): 1671.
inherited component *note 3.4(11): 1632, *note 3.4(12): 1633.
@@ -136667,7 +137180,7 @@ inherited entry *note 3.4(12): 1635.
inherited protected subprogram *note 3.4(12): 1634.
inherited subprogram *note 3.4(17/2): 1636.
Initial_Directory
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
7299.
initialization
of a protected object *note 9.4(14): 4363.
@@ -136678,7 +137191,7 @@ initialization
initialization expression *note 3.3.1(1/3): 1554, *note 3.3.1(4):
1577.
Initialize *note 7.6(2): 3971.
- in Ada.Finalization *note 7.6(6/2): 3976, *note 7.6(8/2): 3980.
+ <in> Ada.Finalization *note 7.6(6/2): 3976, *note 7.6(8/2): 3980.
initialized allocator *note 4.8(4): 3288.
initialized by default *note 3.3.1(18/2): 1594.
Inline aspect *note 6.3.2(5.1/3): 3718.
@@ -136692,30 +137205,31 @@ Input'Class aspect *note 13.13.2(38/4): 5917.
input-output
unspecified for access types *note A.7(6): 6862.
Insert
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 7457,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 7457,
*note A.18.3(20/2): 7458, *note A.18.3(21/2): 7459.
- in Ada.Containers.Hashed_Maps *note A.18.5(19/2): 7553, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(19/2): 7553, *note
A.18.5(20/2): 7554, *note A.18.5(21/2): 7555.
- in Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7688, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7688, *note
A.18.8(20/2): 7689.
- in Ada.Containers.Ordered_Maps *note A.18.6(18/2): 7607, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(18/2): 7607, *note
A.18.6(19/2): 7608, *note A.18.6(20/2): 7609.
- in Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7762, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7762, *note
A.18.9(19/2): 7763.
- in Ada.Containers.Vectors *note A.18.2(36/2): 7371, *note
+ <in> Ada.Containers.Vectors *note A.18.2(36/2): 7371, *note
A.18.2(37/2): 7372, *note A.18.2(38/2): 7373, *note A.18.2(39/2): 7374,
*note A.18.2(40/2): 7375, *note A.18.2(41/2): 7376, *note A.18.2(42/2):
7377, *note A.18.2(43/2): 7378.
- in Ada.Strings.Bounded *note A.4.4(60): 6436, *note A.4.4(61):
+ <in> Ada.Strings.Bounded *note A.4.4(60): 6436, *note A.4.4(61):
6437.
- in Ada.Strings.Fixed *note A.4.3(25): 6377, *note A.4.3(26): 6378.
- in Ada.Strings.Unbounded *note A.4.5(55): 6493, *note A.4.5(56):
+ <in> Ada.Strings.Fixed *note A.4.3(25): 6377, *note A.4.3(26):
+6378.
+ <in> Ada.Strings.Unbounded *note A.4.5(55): 6493, *note A.4.5(56):
6494.
Insert_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7874, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7874, *note
A.18.10(49/3): 7875, *note A.18.10(50/3): 7876.
Insert_Space
- in Ada.Containers.Vectors *note A.18.2(48/2): 7383, *note
+ <in> Ada.Containers.Vectors *note A.18.2(48/2): 7383, *note
A.18.2(49/2): 7384.
inspectable object *note H.3.2(5/2): 9208.
inspection point *note H.3.2(5/2): 9207.
@@ -136728,25 +137242,25 @@ instance
of a generic unit *note 12.3(1): 5131.
instructions for comment submission *note 0.3(58/1): 1001.
int
- in Interfaces.C *note B.3(7): 8111.
+ <in> Interfaces.C *note B.3(7): 8111.
Integer *note 3.5.4(11): 1848, *note 3.5.4(21): 1868.
- in Standard *note A.1(12): 5974.
+ <in> Standard *note A.1(12): 5974.
integer literal *note 2.4(1): 1259.
integer literals *note 3.5.4(14): 1855, *note 3.5.4(30): 1877.
integer type *note 3.5.4(1): 1824, *note N(21): 9692.
Integer_Address
- in System.Storage_Elements *note 13.7.1(10/3): 5638.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5638.
Integer_IO
- in Ada.Text_IO *note A.10.1(52): 7047.
+ <in> Ada.Text_IO *note A.10.1(52): 7047.
Integer_N *note B.2(8): 8098.
Integer_Text_IO
- child of Ada *note A.10.8(21): 7125.
+ <child of> Ada *note A.10.8(21): 7125.
integer_type_definition *note 3.5.4(2): 1828.
- used *note 3.2.1(4/2): 1451, *note P: 9810.
+ <used> *note 3.2.1(4/2): 1451, *note P: 9810.
Integer_Wide_Text_IO
- child of Ada *note A.11(2/2): 7149.
+ <child of> Ada *note A.11(2/2): 7149.
Integer_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7152.
+ <child of> Ada *note A.11(3/2): 7152.
interaction
between tasks *note 9(1/3): 4230.
interface *note 3.9.4(4/2): 2362.
@@ -136763,13 +137277,14 @@ interface to Fortran *note B.5(1/3): 8281.
interface to other languages *note B(1): 8045.
interface type *note N(21.1/2): 9693.
Interface_Ancestor_Tags
- in Ada.Tags *note 3.9(7.4/2): 2259.
+ <in> Ada.Tags *note 3.9(7.4/2): 2259.
interface_list *note 3.9.4(3/2): 2359.
- used *note 3.4(2/2): 1621, *note 3.9.4(2/2): 2358, *note 7.3(3/3):
-3907, *note 9.1(2/3): 4253, *note 9.1(3/3): 4258, *note 9.4(2/3): 4318,
-*note 9.4(3/3): 4323, *note 12.5.1(3/2): 5258, *note P: 10325.
+ <used> *note 3.4(2/2): 1621, *note 3.9.4(2/2): 2358, *note
+7.3(3/3): 3907, *note 9.1(2/3): 4253, *note 9.1(3/3): 4258, *note
+9.4(2/3): 4318, *note 9.4(3/3): 4323, *note 12.5.1(3/2): 5258, *note P:
+10325.
interface_type_definition *note 3.9.4(2/2): 2357.
- used *note 3.2.1(4/2): 1457, *note 12.5.5(2/2): 5289, *note P:
+ <used> *note 3.2.1(4/2): 1457, *note 12.5.5(2/2): 5289, *note P:
10555.
Interfaces *note B.2(3): 8091.
Interfaces.C *note B.3(4): 8106.
@@ -136788,7 +137303,7 @@ internal node
of a tree *note A.18.10(2/4): 7825.
internal requeue *note 9.5(7): 4380.
Internal_Tag
- in Ada.Tags *note 3.9(7/2): 2254.
+ <in> Ada.Tags *note 3.9(7/2): 2254.
interpretation
of a complete context *note 8.6(10): 4193.
of a constituent of a complete context *note 8.6(15): 4199.
@@ -136799,27 +137314,27 @@ interrupt *note C.3(2): 8315.
interrupt entry *note J.7.1(5): 9276.
interrupt handler *note C.3(2): 8323.
Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.1/3): 8728.
+ <in> Ada.Execution_Time *note D.14(9.1/3): 8728.
Interrupt_Handler aspect *note C.3.1(6.2/3): 8327.
Interrupt_Handler pragma *note J.15.7(2/3): 9360, *note L(17.1/3):
9553.
Interrupt_Id
- in Ada.Interrupts *note C.3.2(2/3): 8348.
+ <in> Ada.Interrupts *note C.3.2(2/3): 8348.
Interrupt_Priority aspect *note D.1(6.3/3): 8455.
Interrupt_Priority pragma *note J.15.11(4/3): 9411, *note L(18.1/3):
9556.
-Interrupt_Priority subtype of Any_Priority
- in System *note 13.7(16): 5627.
+Interrupt_Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5627.
Interrupts
- child of Ada *note C.3.2(2/3): 8347.
- child of Ada.Execution_Time *note D.14.3(3/3): 8780.
+ <child of> Ada *note C.3.2(2/3): 8347.
+ <child of> Ada.Execution_Time *note D.14.3(3/3): 8780.
Intersection
- in Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7697, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7697, *note
A.18.8(30/2): 7698.
- in Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7773, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7773, *note
A.18.9(31/2): 7774.
intertask communication *note 9.5(1): 4374.
- See also task *note 9(1/3): 4234.
+ <See also> task *note 9(1/3): 4234.
Intrinsic calling convention *note 6.3.1(4): 3691.
invalid cursor
of a list container *note A.18.3(153/2): 7499.
@@ -136833,148 +137348,154 @@ invariant *note N(21.2/4): 9694.
invariant check *note 7.3.2(9/4): 3941.
invariant expression *note 7.3.2(2/3): 3932.
Inverse
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9178.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9137.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9178.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9137.
Inverted_Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6175.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6175.
Inverted_Question
- in Ada.Characters.Latin_1 *note A.3.3(22): 6207.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6207.
involve an inner product
complex *note G.3.2(56/2): 9184.
real *note G.3.1(34/2): 9143.
IO_Exceptions
- child of Ada *note A.13(3): 7213.
+ <child of> Ada *note A.13(3): 7213.
IS1
- in Ada.Characters.Latin_1 *note A.3.3(16): 6140.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 6140.
IS2
- in Ada.Characters.Latin_1 *note A.3.3(16): 6139.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 6139.
IS3
- in Ada.Characters.Latin_1 *note A.3.3(16): 6138.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 6138.
IS4
- in Ada.Characters.Latin_1 *note A.3.3(16): 6137.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 6137.
Is_A_Group_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8761.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8761.
Is_Abstract
- in Ada.Tags *note 3.9(7.5/3): 2260.
+ <in> Ada.Tags *note 3.9(7.5/3): 2260.
Is_Alphanumeric
- in Ada.Characters.Handling *note A.3.2(4/3): 6011.
- in Ada.Wide_Characters.Handling *note A.3.5(12/3): 6301.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6011.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(12/3): 6301.
Is_Attached
- in Ada.Interrupts *note C.3.2(5): 8351.
+ <in> Ada.Interrupts *note C.3.2(5): 8351.
Is_Basic
- in Ada.Characters.Handling *note A.3.2(4/3): 6007.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6007.
Is_Callable
- in Ada.Task_Identification *note C.7.1(4/3): 8408.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8408.
Is_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 6273.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6273.
Is_Control
- in Ada.Characters.Handling *note A.3.2(4/3): 6002.
- in Ada.Wide_Characters.Handling *note A.3.5(5/3): 6294.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6002.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(5/3): 6294.
Is_Current_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3): 7294.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3):
+7294.
Is_Decimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6009.
- in Ada.Wide_Characters.Handling *note A.3.5(10/3): 6299.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6009.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(10/3): 6299.
Is_Descendant_At_Same_Level
- in Ada.Tags *note 3.9(7.1/2): 2256.
+ <in> Ada.Tags *note 3.9(7.1/2): 2256.
Is_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6008.
- in Ada.Wide_Characters.Handling *note A.3.5(9/3): 6298.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6008.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(9/3): 6298.
Is_Empty
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 7445.
- in Ada.Containers.Hashed_Maps *note A.18.5(11/2): 7538.
- in Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7679.
- in Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7936.
- in Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7842.
- in Ada.Containers.Ordered_Maps *note A.18.6(10/2): 7592.
- in Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7753.
- in Ada.Containers.Vectors *note A.18.2(23/2): 7351.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 7445.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(11/2): 7538.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7679.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7936.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7842.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(10/2): 7592.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7753.
+ <in> Ada.Containers.Vectors *note A.18.2(23/2): 7351.
Is_Full_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3): 7295.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3):
+7295.
Is_Graphic
- in Ada.Characters.Handling *note A.3.2(4/3): 6003.
- in Ada.Wide_Characters.Handling *note A.3.5(19/3): 6308.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6003.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(19/3): 6308.
Is_Held
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 8708.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 8708.
Is_Hexadecimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 6010.
- in Ada.Wide_Characters.Handling *note A.3.5(11/3): 6300.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6010.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(11/3): 6300.
Is_In
- in Ada.Strings.Maps *note A.4.2(13): 6339.
- in Ada.Strings.Wide_Maps *note A.4.7(13): 6551.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6593.
+ <in> Ada.Strings.Maps *note A.4.2(13): 6339.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(13): 6551.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6593.
Is_ISO_646
- in Ada.Characters.Handling *note A.3.2(10): 6025.
+ <in> Ada.Characters.Handling *note A.3.2(10): 6025.
Is_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7847.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7847.
Is_Letter
- in Ada.Characters.Handling *note A.3.2(4/3): 6004.
- in Ada.Wide_Characters.Handling *note A.3.5(6/3): 6295.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6004.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(6/3): 6295.
Is_Line_Terminator
- in Ada.Characters.Handling *note A.3.2(4/3): 6013.
- in Ada.Wide_Characters.Handling *note A.3.5(14/3): 6303.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6013.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(14/3): 6303.
Is_Lower
- in Ada.Characters.Handling *note A.3.2(4/3): 6005.
- in Ada.Wide_Characters.Handling *note A.3.5(7/3): 6296.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6005.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(7/3): 6296.
Is_Mark
- in Ada.Characters.Handling *note A.3.2(4/3): 6014.
- in Ada.Wide_Characters.Handling *note A.3.5(15/3): 6304.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6014.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(15/3): 6304.
Is_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8760.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8760.
Is_Nul_Terminated
- in Interfaces.C *note B.3(24): 8130, *note B.3(35): 8140, *note
+ <in> Interfaces.C *note B.3(24): 8130, *note B.3(35): 8140, *note
B.3(39.16/2): 8160, *note B.3(39.7/2): 8150.
Is_Open
- in Ada.Direct_IO *note A.8.4(10): 6917.
- in Ada.Sequential_IO *note A.8.1(10): 6887.
- in Ada.Streams.Stream_IO *note A.12.1(12): 7178.
- in Ada.Text_IO *note A.10.1(13): 6976.
+ <in> Ada.Direct_IO *note A.8.4(10): 6917.
+ <in> Ada.Sequential_IO *note A.8.1(10): 6887.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 7178.
+ <in> Ada.Text_IO *note A.10.1(13): 6976.
Is_Other_Format
- in Ada.Characters.Handling *note A.3.2(4/3): 6015.
- in Ada.Wide_Characters.Handling *note A.3.5(16/3): 6305.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6015.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(16/3): 6305.
Is_Parent_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3): 7293.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3):
+7293.
Is_Punctuation_Connector
- in Ada.Characters.Handling *note A.3.2(4/3): 6016.
- in Ada.Wide_Characters.Handling *note A.3.5(17/3): 6306.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6016.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(17/3): 6306.
Is_Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3): 7296.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3):
+7296.
Is_Reserved
- in Ada.Interrupts *note C.3.2(4): 8350.
+ <in> Ada.Interrupts *note C.3.2(4): 8350.
Is_Root
- in Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7846.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7846.
Is_Root_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3): 7292.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3):
+7292.
Is_Round_Robin
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8519.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8519.
Is_Simple_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3): 7291.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3):
+7291.
Is_Sorted
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 7485.
- in Ada.Containers.Vectors *note A.18.2(76/2): 7410.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 7485.
+ <in> Ada.Containers.Vectors *note A.18.2(76/2): 7410.
Is_Space
- in Ada.Characters.Handling *note A.3.2(4/3): 6017.
- in Ada.Wide_Characters.Handling *note A.3.5(18/3): 6307.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6017.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(18/3): 6307.
Is_Special
- in Ada.Characters.Handling *note A.3.2(4/3): 6012.
- in Ada.Wide_Characters.Handling *note A.3.5(13/3): 6302.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6012.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(13/3): 6302.
Is_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 6274.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6274.
Is_Subset
- in Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7704.
- in Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7780.
- in Ada.Strings.Maps *note A.4.2(14): 6340.
- in Ada.Strings.Wide_Maps *note A.4.7(14): 6552.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6594.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7704.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7780.
+ <in> Ada.Strings.Maps *note A.4.2(14): 6340.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(14): 6552.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6594.
Is_Terminated
- in Ada.Task_Identification *note C.7.1(4/3): 8407.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 8407.
Is_Upper
- in Ada.Characters.Handling *note A.3.2(4/3): 6006.
- in Ada.Wide_Characters.Handling *note A.3.5(8/3): 6297.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 6006.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(8/3): 6297.
Is_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 6277.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6277.
Is_Wide_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 6278.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 6278.
ISO 1989:2002 *note 1.2(4/2): 1127.
ISO 639-3:2007 *note 1.2(1.1/3): 1118.
ISO 8601:2004 *note 1.2(5.1/2): 1136.
@@ -136988,10 +137509,10 @@ ISO/IEC 646:1991 *note 1.2(2): 1121.
ISO/IEC 8859-1:1998 *note 1.2(6/3): 1138.
ISO/IEC 9899:2011 *note 1.2(7/3): 1141.
ISO/IEC TR 19769:2004 *note 1.2(10/2): 1150.
-ISO_646 subtype of Character
- in Ada.Characters.Handling *note A.3.2(9): 6024.
+ISO_646 <subtype of> Character
+ <in> Ada.Characters.Handling *note A.3.2(9): 6024.
ISO_646_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6522.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6522.
issue
an entry call *note 9.5.3(8): 4473.
italics
@@ -137008,24 +137529,24 @@ iterable container object for a loop *note
5.5.2(12/3): 3514.
iterable container type *note 5.5.1(11/3): 3484, *note N(21.3/3):
9695.
Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 7482.
- in Ada.Containers.Hashed_Maps *note A.18.5(37/2): 7570.
- in Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7713.
- in Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7868, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 7482.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(37/2): 7570.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7713.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7868, *note
A.18.10(44/3): 7870.
- in Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7632.
- in Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7793.
- in Ada.Containers.Vectors *note A.18.2(73/2): 7407.
- in Ada.Environment_Variables *note A.17(8/3): 7311.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7632.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7793.
+ <in> Ada.Containers.Vectors *note A.18.2(73/2): 7407.
+ <in> Ada.Environment_Variables *note A.17(8/3): 7311.
Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7894, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7894, *note
A.18.10(70/3): 7896.
Iterate_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7869, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7869, *note
A.18.10(45/3): 7871.
iteration cursor subtype *note 5.5.1(6/3): 3475.
iteration_scheme *note 5.5(3/3): 3450.
- used *note 5.5(2): 3447, *note P: 10167.
+ <used> *note 5.5(2): 3447, *note P: 10167.
iterator *note N(21.4/3): 9696.
array component *note 5.5.2(3/3): 3503.
container element *note 5.5.2(3/3): 3505.
@@ -137036,9 +137557,10 @@ iterator object *note 5.5.1(6/3): 3473.
iterator type *note 5.5.1(6/3): 3471.
Iterator_Element aspect *note 5.5.1(9/3): 3483.
Iterator_Interfaces
- child of Ada *note 5.5.1(2/3): 3464.
+ <child of> Ada *note 5.5.1(2/3): 3464.
iterator_specification *note 5.5.2(2/3): 3492.
- used *note 4.5.8(1/3): 3140, *note 5.5(3/3): 3453, *note P: 10110.
+ <used> *note 4.5.8(1/3): 3140, *note 5.5(3/3): 3453, *note P:
+10110.
@@ -137050,8 +137572,8 @@ J
j
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9012.
- in Interfaces.Fortran *note B.5(10): 8292.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 9012.
+ <in> Interfaces.Fortran *note B.5(10): 8292.
@@ -137063,18 +137585,19 @@ K
Key
- in Ada.Containers.Hashed_Maps *note A.18.5(13/2): 7540.
- in Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7715.
- in Ada.Containers.Ordered_Maps *note A.18.6(12/2): 7594.
- in Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7797.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(13/2): 7540.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7715.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(12/2): 7594.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7797.
Kind
- in Ada.Directories *note A.16(25/2): 7257, *note A.16(40/2): 7269.
+ <in> Ada.Directories *note A.16(25/2): 7257, *note A.16(40/2):
+7269.
known discriminants *note 3.7(26): 2124.
known to be constrained *note 3.3(23.1/3): 1547.
known to denote the same object *note 6.4.1(6.5/3): 3755.
known to refer to the same object *note 6.4.1(6.12/3): 3756.
known_discriminant_part *note 3.7(4): 2103.
- used *note 3.2.1(3/3): 1444, *note 3.7(2): 2101, *note 9.1(2/3):
+ <used> *note 3.2.1(3/3): 1444, *note 3.7(2): 2101, *note 9.1(2/3):
4251, *note 9.4(2/3): 4316, *note P: 9899.
@@ -137087,20 +137610,20 @@ L
label *note 5.1(7): 3391.
- used *note 5.1(2/3): 3363, *note 5.1(3): 3365, *note P: 10128.
+ <used> *note 5.1(2/3): 3363, *note 5.1(3): 3365, *note P: 10128.
Landau symbol O(X) *note A.18(3/2): 7318.
language
interface to assembly *note C.1(4/3): 8310.
interface to non-Ada *note B(1): 8046.
- in Ada.Locales *note A.19(6/3): 8039.
+ <in> Ada.Locales *note A.19(6/3): 8039.
Language code standard *note 1.2(1.1/3): 1120.
language-defined categories
- [partial] *note 3.2(10/2): 1434.
+ [<partial>] *note 3.2(10/2): 1434.
language-defined category
of types *note 3.2(2/2): 1400.
language-defined check *note 11.5(2/3): 5044, *note 11.6(1/3): 5084.
language-defined class
- [partial] *note 3.2(10/2): 1433.
+ [<partial>] *note 3.2(10/2): 1433.
of types *note 3.2(2/2): 1399.
Language-defined constants *note Q.5(1/3): 10633.
Language-defined exceptions *note Q.4(1/3): 10631.
@@ -137112,15 +137635,15 @@ Language-defined subtypes *note Q.2(1/3): 10629.
Language-defined types *note Q.2(1/3): 10628.
Language-defined values *note Q.5(1/3): 10634.
Language_Code
- in Ada.Locales *note A.19(4/4): 8035.
+ <in> Ada.Locales *note A.19(4/4): 8035.
Language_Unknown
- in Ada.Locales *note A.19(5/3): 8037.
+ <in> Ada.Locales *note A.19(5/3): 8037.
Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 7473.
- in Ada.Containers.Ordered_Maps *note A.18.6(31/2): 7620.
- in Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7783.
- in Ada.Containers.Vectors *note A.18.2(61/2): 7396.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3469.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 7473.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(31/2): 7620.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7783.
+ <in> Ada.Containers.Vectors *note A.18.2(61/2): 7396.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3469.
Last attribute *note 3.5(13): 1706, *note 3.6.2(5): 2076.
last element
of a hashed set *note A.18.8(68/2): 7734.
@@ -137132,166 +137655,166 @@ last node
of an ordered map *note A.18.6(58/3): 7638.
Last(N) attribute *note 3.6.2(6): 2078.
last_bit *note 13.5.1(6): 5565.
- used *note 13.5.1(3): 5560, *note P: 10606.
+ <used> *note 13.5.1(3): 5560, *note P: 10606.
Last_Bit attribute *note 13.5.2(4/2): 5581.
Last_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7888.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7888.
Last_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7889.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7889.
Last_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 7474.
- in Ada.Containers.Ordered_Maps *note A.18.6(32/2): 7621.
- in Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7784.
- in Ada.Containers.Vectors *note A.18.2(62/2): 7397.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 7474.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(32/2): 7621.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7784.
+ <in> Ada.Containers.Vectors *note A.18.2(62/2): 7397.
Last_Index
- in Ada.Containers.Vectors *note A.18.2(60/2): 7395.
+ <in> Ada.Containers.Vectors *note A.18.2(60/2): 7395.
Last_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(33/2): 7622.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(33/2): 7622.
Last_Valid attribute *note 3.5.5(7.3/4): 1891.
lateness *note D.9(12): 8685.
Latin-1 *note 3.5.2(2/3): 1803.
Latin_1
- child of Ada.Characters *note A.3.3(3): 6041.
+ <child of> Ada.Characters *note A.3.3(3): 6041.
Layout aspect *note 13.5(1): 5543.
Layout_Error
- in Ada.IO_Exceptions *note A.13(4): 7221.
- in Ada.Text_IO *note A.10.1(85): 7111.
+ <in> Ada.IO_Exceptions *note A.13(4): 7221.
+ <in> Ada.Text_IO *note A.10.1(85): 7111.
LC_A
- in Ada.Characters.Latin_1 *note A.3.3(13): 6105.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6105.
LC_A_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 6241.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6241.
LC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6242.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6242.
LC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6244.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6244.
LC_A_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 6240.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6240.
LC_A_Ring
- in Ada.Characters.Latin_1 *note A.3.3(25): 6245.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6245.
LC_A_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(25): 6243.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6243.
LC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(25): 6246.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6246.
LC_B
- in Ada.Characters.Latin_1 *note A.3.3(13): 6106.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6106.
LC_C
- in Ada.Characters.Latin_1 *note A.3.3(13): 6107.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6107.
LC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(25): 6247.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6247.
LC_D
- in Ada.Characters.Latin_1 *note A.3.3(13): 6108.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6108.
LC_E
- in Ada.Characters.Latin_1 *note A.3.3(13): 6109.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6109.
LC_E_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 6249.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6249.
LC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6250.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6250.
LC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6251.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6251.
LC_E_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 6248.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6248.
LC_F
- in Ada.Characters.Latin_1 *note A.3.3(13): 6110.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6110.
LC_G
- in Ada.Characters.Latin_1 *note A.3.3(13): 6111.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6111.
LC_German_Sharp_S
- in Ada.Characters.Latin_1 *note A.3.3(24): 6239.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6239.
LC_H
- in Ada.Characters.Latin_1 *note A.3.3(13): 6112.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6112.
LC_I
- in Ada.Characters.Latin_1 *note A.3.3(13): 6113.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6113.
LC_I_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 6253.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6253.
LC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 6254.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6254.
LC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 6255.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6255.
LC_I_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 6252.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 6252.
LC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(26): 6256.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6256.
LC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(26): 6270.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6270.
LC_J
- in Ada.Characters.Latin_1 *note A.3.3(13): 6114.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6114.
LC_K
- in Ada.Characters.Latin_1 *note A.3.3(13): 6115.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6115.
LC_L
- in Ada.Characters.Latin_1 *note A.3.3(13): 6116.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6116.
LC_M
- in Ada.Characters.Latin_1 *note A.3.3(13): 6117.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6117.
LC_N
- in Ada.Characters.Latin_1 *note A.3.3(13): 6118.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6118.
LC_N_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(26): 6257.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6257.
LC_O
- in Ada.Characters.Latin_1 *note A.3.3(13): 6119.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 6119.
LC_O_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 6259.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6259.
LC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 6260.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6260.
LC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6262.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6262.
LC_O_Grave
- in Ada.Characters.Latin_1 *note A.3.3(26): 6258.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6258.
LC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(26): 6264.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6264.
LC_O_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(26): 6261.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6261.
LC_P
- in Ada.Characters.Latin_1 *note A.3.3(14): 6120.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6120.
LC_Q
- in Ada.Characters.Latin_1 *note A.3.3(14): 6121.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6121.
LC_R
- in Ada.Characters.Latin_1 *note A.3.3(14): 6122.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6122.
LC_S
- in Ada.Characters.Latin_1 *note A.3.3(14): 6123.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6123.
LC_T
- in Ada.Characters.Latin_1 *note A.3.3(14): 6124.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6124.
LC_U
- in Ada.Characters.Latin_1 *note A.3.3(14): 6125.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6125.
LC_U_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 6266.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6266.
LC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 6267.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6267.
LC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6268.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6268.
LC_U_Grave
- in Ada.Characters.Latin_1 *note A.3.3(26): 6265.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6265.
LC_V
- in Ada.Characters.Latin_1 *note A.3.3(14): 6126.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6126.
LC_W
- in Ada.Characters.Latin_1 *note A.3.3(14): 6127.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6127.
LC_X
- in Ada.Characters.Latin_1 *note A.3.3(14): 6128.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6128.
LC_Y
- in Ada.Characters.Latin_1 *note A.3.3(14): 6129.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6129.
LC_Y_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 6269.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6269.
LC_Y_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 6271.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 6271.
LC_Z
- in Ada.Characters.Latin_1 *note A.3.3(14): 6130.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6130.
Leading_Nonseparate
- in Interfaces.COBOL *note B.4(23): 8251.
+ <in> Interfaces.COBOL *note B.4(23): 8251.
Leading_Part attribute *note A.5.3(54): 6817.
Leading_Separate
- in Interfaces.COBOL *note B.4(23): 8249.
+ <in> Interfaces.COBOL *note B.4(23): 8249.
leaf node
of a tree *note A.18.10(4/3): 7830.
-Leap_Seconds_Count subtype of Integer
- in Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4550.
+Leap_Seconds_Count <subtype of> Integer
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4550.
leaving *note 7.6.1(3/2): 4009.
left *note 7.6.1(3/2): 4010.
left parenthesis *note 2.1(15/3): 1201.
Left_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6185.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6185.
Left_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 6131.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6131.
Left_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 6083.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6083.
Left_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 6099.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6099.
legal
construct *note 1.1.2(27): 1024.
partition *note 1.1.2(29): 1032.
@@ -137304,67 +137827,67 @@ length
of a one-dimensional array *note 3.6(13): 2036.
of a set *note A.18.7(5/2): 7648.
of a vector container *note A.18.2(2/2): 7333.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 7444.
- in Ada.Containers.Hashed_Maps *note A.18.5(10/2): 7537.
- in Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7678.
- in Ada.Containers.Ordered_Maps *note A.18.6(9/2): 7591.
- in Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7752.
- in Ada.Containers.Vectors *note A.18.2(21/2): 7349.
- in Ada.Strings.Bounded *note A.4.4(9): 6400.
- in Ada.Strings.Unbounded *note A.4.5(6): 6459.
- in Ada.Text_IO.Editing *note F.3.3(11): 8995.
- in Interfaces.COBOL *note B.4(34): 8265, *note B.4(39): 8269, *note
-B.4(44): 8273.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 7444.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(10/2): 7537.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7678.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(9/2): 7591.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7752.
+ <in> Ada.Containers.Vectors *note A.18.2(21/2): 7349.
+ <in> Ada.Strings.Bounded *note A.4.4(9): 6400.
+ <in> Ada.Strings.Unbounded *note A.4.5(6): 6459.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8995.
+ <in> Interfaces.COBOL *note B.4(34): 8265, *note B.4(39): 8269,
+*note B.4(44): 8273.
Length attribute *note 3.6.2(9): 2084.
Length(N) attribute *note 3.6.2(10): 2086.
Length_Check *note 11.5(15): 5067.
- [partial] *note 4.5.1(8): 2969, *note 4.6(37): 3207, *note 4.6(52):
-3239.
+ [<partial>] *note 4.5.1(8): 2969, *note 4.6(37): 3207, *note
+4.6(52): 3239.
Length_Error
- in Ada.Strings *note A.4.1(5): 6321.
-Length_Range subtype of Natural
- in Ada.Strings.Bounded *note A.4.4(8): 6399.
+ <in> Ada.Strings *note A.4.1(5): 6321.
+Length_Range <subtype of> Natural
+ <in> Ada.Strings.Bounded *note A.4.4(8): 6399.
less than operator *note 4.4(1/3): 2813, *note 4.5.2(1): 2991.
less than or equal operator *note 4.4(1/3): 2817, *note 4.5.2(1):
2995.
less-than sign *note 2.1(15/3): 1216.
Less_Case_Insensitive
- child of Ada.Strings *note A.4.10(13/3): 6625.
- child of Ada.Strings.Bounded *note A.4.10(18/3): 6627.
- child of Ada.Strings.Fixed *note A.4.10(16/3): 6626.
- child of Ada.Strings.Unbounded *note A.4.10(21/3): 6628.
+ <child of> Ada.Strings *note A.4.10(13/3): 6625.
+ <child of> Ada.Strings.Bounded *note A.4.10(18/3): 6627.
+ <child of> Ada.Strings.Fixed *note A.4.10(16/3): 6626.
+ <child of> Ada.Strings.Unbounded *note A.4.10(21/3): 6628.
Less_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 6094.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6094.
letter
a category of Character *note A.3.2(24): 6031.
letter_lowercase *note 2.1(9/2): 1177.
- used *note 2.3(3/2): 1244, *note P: 9742.
+ <used> *note 2.3(3/2): 1244, *note P: 9742.
letter_modifier *note 2.1(9.2/2): 1179.
- used *note 2.3(3/2): 1246, *note P: 9744.
+ <used> *note 2.3(3/2): 1246, *note P: 9744.
letter_other *note 2.1(9.3/2): 1180.
- used *note 2.3(3/2): 1247, *note P: 9745.
+ <used> *note 2.3(3/2): 1247, *note P: 9745.
Letter_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6514.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6514.
letter_titlecase *note 2.1(9.1/2): 1178.
- used *note 2.3(3/2): 1245, *note P: 9743.
+ <used> *note 2.3(3/2): 1245, *note P: 9743.
letter_uppercase *note 2.1(8/2): 1176.
- used *note 2.3(3/2): 1243, *note P: 9741.
+ <used> *note 2.3(3/2): 1243, *note P: 9741.
level
accessibility *note 3.10.2(3/2): 2461.
library *note 3.10.2(23): 2480.
lexical element *note 2.2(1): 1230.
lexicographic order *note 4.5.2(26/3): 3016.
LF
- in Ada.Characters.Latin_1 *note A.3.3(5): 6053.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6053.
library *note 10.1.4(9): 4816.
- [partial] *note 10.1.1(9): 4733.
+ [<partial>] *note 10.1.1(9): 4733.
informal introduction *note 10(2): 4694.
- See also library level, library unit, library_item
+ <See also> library level, library unit, library_item
library level *note 3.10.2(23): 2479.
Library unit *note 10.1(3): 4704, *note 10.1.1(9): 4732, *note N(22):
9697.
informal introduction *note 10(2): 4692.
- See also language-defined library units
+ <See also> language-defined library units
library unit pragma *note 10.1.5(7/3): 4822.
All_Calls_Remote *note E.2.3(6): 8894.
categorization pragmas *note E.2(2/3): 8846.
@@ -137373,13 +137896,13 @@ library unit pragma *note 10.1.5(7/3): 4822.
Pure *note 10.2.1(15): 4890.
library_item *note 10.1.1(4): 4714.
informal introduction *note 10(2): 4693.
- used *note 10.1.1(3): 4711, *note P: 10429.
+ <used> *note 10.1.1(3): 4711, *note P: 10429.
library_unit_body *note 10.1.1(7): 4727.
- used *note 10.1.1(4): 4716, *note P: 10433.
+ <used> *note 10.1.1(4): 4716, *note P: 10433.
library_unit_declaration *note 10.1.1(5): 4718.
- used *note 10.1.1(4): 4715, *note P: 10432.
+ <used> *note 10.1.1(4): 4715, *note P: 10432.
library_unit_renaming_declaration *note 10.1.1(6): 4723.
- used *note 10.1.1(4): 4717, *note P: 10434.
+ <used> *note 10.1.1(4): 4717, *note P: 10434.
lifetime *note 3.10.2(3/2): 2465.
limited interface *note 3.9.4(5/2): 2372.
limited type *note 7.5(3/3): 3956, *note N(23/2): 9699.
@@ -137387,38 +137910,38 @@ limited type *note 7.5(3/3): 3956, *note N(23/2):
9699.
immutably *note 7.5(8.1/3): 3959.
limited view *note 10.1.1(12.1/2): 4750.
Limited_Controlled
- in Ada.Finalization *note 7.6(7/2): 3979.
+ <in> Ada.Finalization *note 7.6(7/2): 3979.
limited_with_clause *note 10.1.2(4.1/2): 4765.
- used *note 10.1.2(4/2): 4763, *note P: 10448.
+ <used> *note 10.1.2(4/2): 4763, *note P: 10448.
line *note 2.2(2/3): 1232.
- in Ada.Text_IO *note A.10.1(38): 7023.
+ <in> Ada.Text_IO *note A.10.1(38): 7023.
line terminator *note A.10(7): 6947.
Line_Length
- in Ada.Text_IO *note A.10.1(25): 6999.
+ <in> Ada.Text_IO *note A.10.1(25): 6999.
link name *note B.1(35): 8079.
link-time error
- See post-compilation error *note 1.1.2(29): 1030.
- See post-compilation error *note 1.1.5(4): 1102.
+ <See> post-compilation error *note 1.1.2(29): 1030.
+ <See> post-compilation error *note 1.1.5(4): 1102.
Link_Name aspect *note B.1(1/3): 8056.
Linker_Options pragma *note B.1(8): 8067, *note L(19): 9558.
linking
- See partition building *note 10.2(2): 4847.
+ <See> partition building *note 10.2(2): 4847.
List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 7438.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 7438.
list container *note A.18.3(1/2): 7433.
List pragma *note 2.8(21): 1338, *note L(20): 9561.
List_Iterator_Interfaces
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 7443.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 7443.
literal *note 4.2(1): 2668.
based *note 2.4.2(1): 1276.
decimal *note 2.4.1(1): 1263.
numeric *note 2.4(1): 1257.
- See also aggregate *note 4.3(1): 2688.
+ <See also> aggregate *note 4.3(1): 2688.
little endian *note 13.5.3(2): 5590.
load time *note C.4(3): 8365.
local to *note 8.1(14): 4041.
local_name *note 13.1(3): 5350.
- used *note 13.3(2): 5432, *note 13.4(2): 5531, *note 13.5.1(2):
+ <used> *note 13.3(2): 5432, *note 13.4(2): 5531, *note 13.5.1(2):
5553, *note 13.5.1(3): 5557, *note C.5(3): 8372, *note J.15.2(2/3):
9312, *note J.15.3(2/3): 9317, *note J.15.5(2/3): 9338, *note
J.15.5(3/3): 9344, *note J.15.5(4/3): 9350, *note J.15.6(2/3): 9358,
@@ -137433,56 +137956,58 @@ L(4.1/3): 9490, *note L(5.1/3): 9493, *note
L(8.1/3): 9501, *note L(9):
locale *note A.19(1/3): 8033.
active *note A.19(8/3): 8042.
Locales
- child of Ada *note A.19(3/3): 8034.
+ <child of> Ada *note A.19(3/3): 8034.
locking policy *note D.3(6/2): 8543.
Ceiling_Locking *note D.3(7): 8547.
Locking_Policy pragma *note D.3(3): 8536, *note L(21): 9564.
Log
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9038.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6682.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6682.
Logical
- in Interfaces.Fortran *note B.5(7): 8287.
+ <in> Interfaces.Fortran *note B.5(7): 8287.
logical operator *note 4.5.1(2): 2958.
- See also not operator *note 4.5.6(3): 3092.
+ <See also> not operator *note 4.5.6(3): 3092.
logical_operator *note 4.5(2): 2939.
long
- in Interfaces.C *note B.3(7): 8113.
+ <in> Interfaces.C *note B.3(7): 8113.
Long_Binary
- in Interfaces.COBOL *note B.4(10): 8233.
+ <in> Interfaces.COBOL *note B.4(10): 8233.
long_double
- in Interfaces.C *note B.3(17): 8124.
+ <in> Interfaces.C *note B.3(17): 8124.
Long_Float *note 3.5.7(15): 1931, *note 3.5.7(16): 1933, *note
3.5.7(17): 1934.
Long_Floating
- in Interfaces.COBOL *note B.4(9): 8231.
+ <in> Interfaces.COBOL *note B.4(9): 8231.
Long_Integer *note 3.5.4(22): 1869, *note 3.5.4(25): 1870, *note
3.5.4(28): 1874.
Look_Ahead
- in Ada.Text_IO *note A.10.1(43): 7032.
+ <in> Ada.Text_IO *note A.10.1(43): 7032.
loop cursor *note 5.5.2(12/3): 3516.
loop iterator *note 5.5.2(10/3): 3511.
container element iterator *note 5.5.2(12/3): 3515.
loop parameter *note 5.5(6): 3457, *note 5.5.2(7/3): 3510.
loop_parameter_specification *note 5.5(4): 3454.
- used *note 4.5.8(1/3): 3137, *note 5.5(3/3): 3452, *note P: 10107.
+ <used> *note 4.5.8(1/3): 3137, *note 5.5(3/3): 3452, *note P:
+10107.
loop_statement *note 5.5(2): 3445.
- used *note 5.1(5/2): 3385, *note P: 10147.
+ <used> *note 5.1(5/2): 3385, *note P: 10147.
low line *note 2.1(15/3): 1219.
low-level programming *note C(1): 8302.
Low_Line
- in Ada.Characters.Latin_1 *note A.3.3(12): 6103.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6103.
Low_Order_First *note 13.5.3(2): 5589.
- in Interfaces.COBOL *note B.4(25): 8255.
- in System *note 13.7(15/2): 5623.
+ <in> Interfaces.COBOL *note B.4(25): 8255.
+ <in> System *note 13.7(15/2): 5623.
lower bound
of a range *note 3.5(4): 1683.
lower-case letter
a category of Character *note A.3.2(25): 6032.
Lower_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6523.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6523.
Lower_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6515.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6515.
LR(1) *note 1.1.4(14.a): 1090.
@@ -137501,7 +138026,7 @@ machine numbers
of a floating point type *note 3.5.7(8): 1918.
machine scalar *note 13.3(8.1/3): 5462.
Machine_Code
- child of System *note 13.8(7): 5654.
+ <child of> System *note 13.8(7): 5654.
Machine_Emax attribute *note A.5.3(8): 6759.
Machine_Emin attribute *note A.5.3(7): 6757.
Machine_Mantissa attribute *note A.5.3(6): 6755.
@@ -137513,29 +138038,29 @@ Machine_Radix clause *note 13.3(7/2): 5456, *note
F.1(1): 8968.
Machine_Rounding attribute *note A.5.3(41.1/2): 6797.
Machine_Rounds attribute *note A.5.3(11): 6767, *note A.5.4(3): 6848.
macro
- See generic unit *note 12(1): 5101.
+ <See> generic unit *note 12(1): 5101.
Macron
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6189.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6189.
main subprogram
for a partition *note 10.2(7): 4850.
malloc
- See allocator *note 4.8(1): 3277.
+ <See> allocator *note 4.8(1): 3277.
Map
- in Ada.Containers.Hashed_Maps *note A.18.5(3/3): 7529.
- in Ada.Containers.Ordered_Maps *note A.18.6(4/3): 7585.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(3/3): 7529.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(4/3): 7585.
map container *note A.18.4(1/2): 7507.
Map_Iterator_Interfaces
- in Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 7534.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 7590.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 7534.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 7590.
Maps
- child of Ada.Strings *note A.4.2(3/2): 6331.
+ <child of> Ada.Strings *note A.4.2(3/2): 6331.
mark_non_spacing *note 2.1(9.4/2): 1181, *note 2.1(9.5/2): 1182.
- used *note 2.3(3.1/3): 1250, *note P: 9747.
+ <used> *note 2.3(3.1/3): 1250, *note P: 9747.
mark_spacing_combining
- used *note 2.3(3.1/3): 1251, *note P: 9748.
+ <used> *note 2.3(3.1/3): 1251, *note P: 9748.
marshalling *note E.4(9): 8926.
Masculine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(22): 6202.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6202.
master *note 7.6.1(3/2): 4011.
master of a call *note 3.10.2(10.1/3): 2470.
match
@@ -137549,36 +138074,36 @@ Max attribute *note 3.5(19): 1716.
Max_Alignment_For_Allocation attribute *note 13.11.1(4/3): 5735.
Max_Asynchronous_Select_Nesting restriction *note D.7(18/1): 8634.
Max_Base_Digits *note 3.5.7(6): 1916.
- in System *note 13.7(8): 5610.
+ <in> System *note 13.7(8): 5610.
Max_Binary_Modulus *note 3.5.4(7): 1839.
- in System *note 13.7(7): 5608.
+ <in> System *note 13.7(7): 5608.
Max_Decimal_Digits
- in Ada.Decimal *note F.2(5): 8976.
+ <in> Ada.Decimal *note F.2(5): 8976.
Max_Delta
- in Ada.Decimal *note F.2(4): 8975.
+ <in> Ada.Decimal *note F.2(4): 8975.
Max_Digits *note 3.5.7(6): 1917.
- in System *note 13.7(8): 5611.
+ <in> System *note 13.7(8): 5611.
Max_Digits_Binary
- in Interfaces.COBOL *note B.4(11): 8234.
+ <in> Interfaces.COBOL *note B.4(11): 8234.
Max_Digits_Long_Binary
- in Interfaces.COBOL *note B.4(11): 8235.
+ <in> Interfaces.COBOL *note B.4(11): 8235.
Max_Entry_Queue_Length restriction *note D.7(19.1/2): 8644.
Max_Image_Width
- in Ada.Numerics.Discrete_Random *note A.5.2(25): 6737.
- in Ada.Numerics.Float_Random *note A.5.2(13): 6725.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(25): 6737.
+ <in> Ada.Numerics.Float_Random *note A.5.2(13): 6725.
Max_Int *note 3.5.4(14): 1853.
- in System *note 13.7(6): 5607.
+ <in> System *note 13.7(6): 5607.
Max_Length
- in Ada.Strings.Bounded *note A.4.4(5): 6396.
+ <in> Ada.Strings.Bounded *note A.4.4(5): 6396.
Max_Mantissa
- in System *note 13.7(9): 5612.
+ <in> System *note 13.7(9): 5612.
Max_Nonbinary_Modulus *note 3.5.4(7): 1840.
- in System *note 13.7(7): 5609.
+ <in> System *note 13.7(7): 5609.
Max_Picture_Length
- in Ada.Text_IO.Editing *note F.3.3(8): 8988.
+ <in> Ada.Text_IO.Editing *note F.3.3(8): 8988.
Max_Protected_Entries restriction *note D.7(14): 8625.
Max_Scale
- in Ada.Decimal *note F.2(3): 8972.
+ <in> Ada.Decimal *note F.2(3): 8972.
Max_Select_Alternatives restriction *note D.7(12): 8621.
Max_Size_In_Storage_Elements attribute *note 13.11.1(3/3): 5733.
Max_Storage_At_Blocking restriction *note D.7(17/1): 8629.
@@ -137594,67 +138119,68 @@ maximum relative error
*note G.2.6(3): 9124.
for the evaluation of an elementary function *note G.2.4(2): 9118.
Members
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8762.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8762.
Membership
- in Ada.Strings *note A.4.1(6): 6327.
+ <in> Ada.Strings *note A.4.1(6): 6327.
membership test *note 4.5.2(2/3): 3006.
membership_choice *note 4.4(3.2/4): 2903.
- used *note 4.4(3.1/3): 2901, *note P: 10070.
+ <used> *note 4.4(3.1/3): 2901, *note P: 10070.
membership_choice_list *note 4.4(3.1/3): 2900.
- used *note 4.4(3/4): 2898, *note P: 10067.
+ <used> *note 4.4(3/4): 2898, *note P: 10067.
Memory_Size
- in System *note 13.7(13): 5619.
+ <in> System *note 13.7(13): 5619.
mentioned
in a with_clause *note 10.1.2(6/2): 4773.
Merge
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 7487.
- in Ada.Containers.Vectors *note A.18.2(78/2): 7412.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 7487.
+ <in> Ada.Containers.Vectors *note A.18.2(78/2): 7412.
message
- See dispatching call *note 3.9.2(1/2): 2312.
+ <See> dispatching call *note 3.9.2(1/2): 2312.
method
- See dispatching subprogram *note 3.9.2(1/2): 2313.
+ <See> dispatching subprogram *note 3.9.2(1/2): 2313.
methodological restriction *note 10.1.3(13.a): 4808.
metrics *note 1.1.2(35): 1044.
Micro_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6196.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6196.
Microseconds
- in Ada.Real_Time *note D.8(14/2): 8669.
+ <in> Ada.Real_Time *note D.8(14/2): 8669.
Middle_Dot
- in Ada.Characters.Latin_1 *note A.3.3(22): 6199.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6199.
Milliseconds
- in Ada.Real_Time *note D.8(14/2): 8670.
+ <in> Ada.Real_Time *note D.8(14/2): 8670.
Min attribute *note 3.5(16): 1713.
Min_Delta
- in Ada.Decimal *note F.2(4): 8974.
+ <in> Ada.Decimal *note F.2(4): 8974.
Min_Handler_Ceiling
- in Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8757.
- in Ada.Execution_Time.Timers *note D.14.1(6/2): 8740.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8757.
+ <in> Ada.Execution_Time.Timers *note D.14.1(6/2): 8740.
Min_Int *note 3.5.4(14): 1852.
- in System *note 13.7(6): 5606.
+ <in> System *note 13.7(6): 5606.
Min_Scale
- in Ada.Decimal *note F.2(3): 8973.
+ <in> Ada.Decimal *note F.2(3): 8973.
minus *note 2.1(15/3): 1208.
minus operator *note 4.4(1/3): 2835, *note 4.5.3(1): 3035, *note
4.5.4(1): 3060.
Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6089.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6089.
Minute
- in Ada.Calendar.Formatting *note 9.6.1(25/2): 4570.
-Minute_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4563.
+ <in> Ada.Calendar.Formatting *note 9.6.1(25/2): 4570.
+Minute_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4563.
Minutes
- in Ada.Real_Time *note D.8(14/2): 8672.
+ <in> Ada.Real_Time *note D.8(14/2): 8672.
mixed-language programs *note B(1): 8047, *note C.1(4/3): 8311.
Mod attribute *note 3.5.4(16.1/2): 1858.
mod operator *note 4.4(1/3): 2854, *note 4.5.5(1): 3074.
mod_clause *note J.8(1): 9284.
- used *note 13.5.1(2): 5554, *note P: 10601.
+ <used> *note 13.5.1(2): 5554, *note P: 10601.
mode *note 6.1(16): 3587.
- used *note 6.1(15/3): 3580, *note 12.4(2/3): 5193, *note P: 10522.
- in Ada.Direct_IO *note A.8.4(9): 6914.
- in Ada.Sequential_IO *note A.8.1(9): 6884.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7175.
- in Ada.Text_IO *note A.10.1(12): 6973.
+ <used> *note 6.1(15/3): 3580, *note 12.4(2/3): 5193, *note P:
+10522.
+ <in> Ada.Direct_IO *note A.8.4(9): 6914.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6884.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7175.
+ <in> Ada.Text_IO *note A.10.1(12): 6973.
mode conformance *note 6.3.1(16/3): 3700.
required *note 8.5.4(4/3): 4166, *note 8.5.4(5/3): 4169, *note
12.6(7/3): 5310, *note 12.6(8/3): 5311, *note 13.3(6): 5441.
@@ -137662,11 +138188,11 @@ mode of operation
nonstandard *note 1.1.5(11): 1109.
standard *note 1.1.5(11): 1111.
Mode_Error
- in Ada.Direct_IO *note A.8.4(18): 6928.
- in Ada.IO_Exceptions *note A.13(4): 7215.
- in Ada.Sequential_IO *note A.8.1(15): 6893.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7191.
- in Ada.Text_IO *note A.10.1(85): 7105.
+ <in> Ada.Direct_IO *note A.8.4(18): 6928.
+ <in> Ada.IO_Exceptions *note A.13(4): 7215.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6893.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7191.
+ <in> Ada.Text_IO *note A.10.1(85): 7105.
Model attribute *note A.5.3(68): 6836, *note G.2.2(7): 9106.
model interval *note G.2.1(4): 9087.
associated with a value *note G.2.1(4): 9088.
@@ -137679,55 +138205,56 @@ Model_Mantissa attribute *note A.5.3(64): 6828,
*note G.2.2(3/2):
9097.
Model_Small attribute *note A.5.3(67): 6834.
Modification_Time
- in Ada.Directories *note A.16(27/2): 7259, *note A.16(42/2): 7271.
+ <in> Ada.Directories *note A.16(27/2): 7259, *note A.16(42/2):
+7271.
modular type *note 3.5.4(1): 1826.
Modular_IO
- in Ada.Text_IO *note A.10.1(57): 7056.
+ <in> Ada.Text_IO *note A.10.1(57): 7056.
modular_type_definition *note 3.5.4(4): 1834.
- used *note 3.5.4(2): 1830, *note P: 9862.
+ <used> *note 3.5.4(2): 1830, *note P: 9862.
module
- See package *note 7(1): 3865.
+ <See> package *note 7(1): 3865.
modulus
of a modular type *note 3.5.4(7): 1838.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9156,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 9156,
*note G.3.2(30/2): 9169.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 9022.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 9022.
Modulus attribute *note 3.5.4(17): 1860.
Monday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4554.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4554.
Month
- in Ada.Calendar *note 9.6(13): 4525.
- in Ada.Calendar.Formatting *note 9.6.1(22/2): 4567.
-Month_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4520.
+ <in> Ada.Calendar *note 9.6(13): 4525.
+ <in> Ada.Calendar.Formatting *note 9.6.1(22/2): 4567.
+Month_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4520.
More_Entries
- in Ada.Directories *note A.16(34/2): 7265.
+ <in> Ada.Directories *note A.16(34/2): 7265.
Move
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 7456.
- in Ada.Containers.Hashed_Maps *note A.18.5(18/2): 7552.
- in Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7687.
- in Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7948.
- in Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7860.
- in Ada.Containers.Ordered_Maps *note A.18.6(17/2): 7606.
- in Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7761.
- in Ada.Containers.Vectors *note A.18.2(35/2): 7370.
- in Ada.Strings.Fixed *note A.4.3(7): 6357.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 7456.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(18/2): 7552.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7687.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7948.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7860.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(17/2): 7606.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7761.
+ <in> Ada.Containers.Vectors *note A.18.2(35/2): 7370.
+ <in> Ada.Strings.Fixed *note A.4.3(7): 6357.
multi-dimensional array *note 3.6(12): 2032.
Multiplication_Sign
- in Ada.Characters.Latin_1 *note A.3.3(24): 6231.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6231.
multiply *note 2.1(15/3): 1204.
multiply operator *note 4.4(1/3): 2846, *note 4.5.5(1): 3066.
multiplying operator *note 4.5.5(1): 3062.
multiplying_operator *note 4.5(6): 2943.
- used *note 4.4(5): 2914, *note P: 10079.
+ <used> *note 4.4(5): 2914, *note P: 10079.
Multiprocessors
- child of System *note D.16(3/3): 8797.
+ <child of> System *note D.16(3/3): 8797.
Multiway_Trees
- child of Ada.Containers *note A.18.10(7/3): 7834.
+ <child of> Ada.Containers *note A.18.10(7/3): 7834.
mutable *note 3.7(28.b): 2133.
mutates *note 7.6(17.6/3): 3997.
MW
- in Ada.Characters.Latin_1 *note A.3.3(18): 6162.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6162.
@@ -137740,13 +138267,13 @@ N
n-dimensional array_aggregate *note 4.3.3(6): 2767.
NAK
- in Ada.Characters.Latin_1 *note A.3.3(6): 6064.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6064.
name *note 4.1(2/3): 2541.
- [partial] *note 3.1(1): 1351.
+ [<partial>] *note 3.1(1): 1351.
of (a view of) an entity *note 3.1(8): 1378.
of a pragma *note 2.8(9): 1325.
of an external file *note A.7(1): 6858.
- used *note 2.8(3/3): 1318, *note 3.2.2(4): 1479, *note 4.1(4):
+ <used> *note 2.8(3/3): 1318, *note 3.2.2(4): 1479, *note 4.1(4):
2558, *note 4.1(5): 2561, *note 4.1(6): 2563, *note 4.1.5(4/3): 2645,
*note 4.4(7/3): 2925, *note 4.6(2): 3159, *note 4.8(2.1/3): 3285, *note
5.2(2): 3402, *note 5.5.2(2/3): 3497, *note 5.7(2): 3526, *note 5.8(2):
@@ -137768,23 +138295,23 @@ L(6.1/3): 9496, *note L(10): 9517, *note L(11):
9521, *note L(12): 9525,
*note L(15.1/3): 9547, *note L(16): 9551, *note L(17.1/3): 9554, *note
L(26): 9588, *note L(28): 9602, *note L(30): 9610, *note L(31): 9613,
*note L(34): 9622, *note P: 10176.
- in Ada.Direct_IO *note A.8.4(9): 6915.
- in Ada.Sequential_IO *note A.8.1(9): 6885.
- in Ada.Streams.Stream_IO *note A.12.1(11): 7176.
- in Ada.Text_IO *note A.10.1(12): 6974.
- in System *note 13.7(4): 5604.
+ <in> Ada.Direct_IO *note A.8.4(9): 6915.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6885.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 7176.
+ <in> Ada.Text_IO *note A.10.1(12): 6974.
+ <in> System *note 13.7(4): 5604.
name resolution rules *note 1.1.2(26/3): 1018.
Name_Case_Equivalence
- in Ada.Directories *note A.16(20.2/3): 7253.
+ <in> Ada.Directories *note A.16(20.2/3): 7253.
Name_Case_Kind
- in Ada.Directories *note A.16(20.1/3): 7252.
+ <in> Ada.Directories *note A.16(20.1/3): 7252.
Name_Error
- in Ada.Direct_IO *note A.8.4(18): 6929.
- in Ada.Directories *note A.16(43/2): 7273.
- in Ada.IO_Exceptions *note A.13(4): 7216.
- in Ada.Sequential_IO *note A.8.1(15): 6894.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7192.
- in Ada.Text_IO *note A.10.1(85): 7106.
+ <in> Ada.Direct_IO *note A.8.4(18): 6929.
+ <in> Ada.Directories *note A.16(43/2): 7273.
+ <in> Ada.IO_Exceptions *note A.13(4): 7216.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6894.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7192.
+ <in> Ada.Text_IO *note A.10.1(85): 7106.
named
in a use clause *note 8.4(7.1/2): 4114.
in a with_clause *note 10.1.2(6/2): 4775.
@@ -137797,20 +138324,20 @@ named number *note 3.3(24): 1549.
named parameter association *note 6.4.1(2/3): 3749.
named type *note 3.2.1(7/2): 1459.
named_array_aggregate *note 4.3.3(4): 2760.
- used *note 4.3.3(2): 2750, *note P: 10026.
+ <used> *note 4.3.3(2): 2750, *note P: 10026.
Names
- child of Ada.Interrupts *note C.3.2(12): 8358.
+ <child of> Ada.Interrupts *note C.3.2(12): 8358.
Nanoseconds
- in Ada.Real_Time *note D.8(14/2): 8668.
+ <in> Ada.Real_Time *note D.8(14/2): 8668.
Native_Binary
- in Interfaces.COBOL *note B.4(25): 8256.
+ <in> Interfaces.COBOL *note B.4(25): 8256.
Natural *note 3.5.4(12): 1849.
-Natural subtype of Integer
- in Standard *note A.1(13): 5975.
+Natural <subtype of> Integer
+ <in> Standard *note A.1(13): 5975.
NBH
- in Ada.Characters.Latin_1 *note A.3.3(17): 6144.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6144.
NBSP
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6174.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6174.
needed
of a compilation unit by another *note 10.2(2): 4849.
remote call interface *note E.2.3(18): 8906.
@@ -137832,33 +138359,33 @@ A.18.7(4/2): 7647, *note A.18.7(36.2/3): 7656,
*note A.18.7(96.2/3):
A.18.18(27/3): 7949, *note A.18.18(54/3): 7953, *note D.14.2(13/2):
8771, *note D.15(8/2): 8792.
NEL
- in Ada.Characters.Latin_1 *note A.3.3(17): 6146.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6146.
new
- See allocator *note 4.8(1): 3276.
+ <See> allocator *note 4.8(1): 3276.
New_Char_Array
- in Interfaces.C.Strings *note B.3.1(9): 8181.
+ <in> Interfaces.C.Strings *note B.3.1(9): 8181.
New_Line
- in Ada.Text_IO *note A.10.1(28): 7003.
+ <in> Ada.Text_IO *note A.10.1(28): 7003.
New_Page
- in Ada.Text_IO *note A.10.1(31): 7010.
+ <in> Ada.Text_IO *note A.10.1(31): 7010.
New_String
- in Interfaces.C.Strings *note B.3.1(10): 8182.
+ <in> Interfaces.C.Strings *note B.3.1(10): 8182.
Next
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 7475,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 7475,
*note A.18.3(39/2): 7477.
- in Ada.Containers.Hashed_Maps *note A.18.5(28/2): 7562, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(28/2): 7562, *note
A.18.5(29/2): 7563.
- in Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7706, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7706, *note
A.18.8(42/2): 7707.
- in Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7623, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7623, *note
A.18.6(35/2): 7624.
- in Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7785, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7785, *note
A.18.9(46/2): 7786.
- in Ada.Containers.Vectors *note A.18.2(63/2): 7398, *note
+ <in> Ada.Containers.Vectors *note A.18.2(63/2): 7398, *note
A.18.2(64/2): 7399.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3467.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3467.
Next_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7890, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7890, *note
A.18.10(66/3): 7892.
No_Abort_Statements restriction *note D.7(5/3): 8587.
No_Access_Parameter_Allocators restriction *note H.4(8.3/3): 9220.
@@ -137866,7 +138393,7 @@ No_Access_Subprograms restriction *note H.4(17):
9230.
No_Allocators restriction *note H.4(7): 9212.
No_Anonymous_Allocators restriction *note H.4(8.1/3): 9216.
No_Break_Space
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6173.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6173.
No_Coextensions restriction *note H.4(8.2/3): 9218.
No_Delay restriction *note H.4(21): 9240.
No_Dependence restriction *note 13.12.1(6/2): 5845.
@@ -137876,13 +138403,13 @@ No_Dynamic_Attachment restriction *note
D.7(10/3): 8598.
No_Dynamic_CPU_Assigmment restriction *note D.7(10.1/4): 8600.
No_Dynamic_Priorities restriction *note D.7(9/2): 8596.
No_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 7441.
- in Ada.Containers.Hashed_Maps *note A.18.5(6/2): 7532.
- in Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7671.
- in Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7838.
- in Ada.Containers.Ordered_Maps *note A.18.6(7/2): 7588.
- in Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7747.
- in Ada.Containers.Vectors *note A.18.2(11/2): 7342.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 7441.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6/2): 7532.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7671.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7838.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7/2): 7588.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7747.
+ <in> Ada.Containers.Vectors *note A.18.2(11/2): 7342.
No_Exceptions restriction *note H.4(12): 9224.
No_Fixed_Point restriction *note H.4(15): 9228.
No_Floating_Point restriction *note H.4(14): 9226.
@@ -137894,7 +138421,7 @@ No_Implementation_Pragmas restriction *note
13.12.1(3/2): 5839.
No_Implementation_Units restriction *note 13.12.1(3.1/3): 5841.
No_Implicit_Heap_Allocations restriction *note D.7(8): 8594.
No_Index
- in Ada.Containers.Vectors *note A.18.2(7/2): 7338.
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 7338.
No_IO restriction *note H.4(20/2): 9238.
No_Local_Allocators restriction *note H.4(8/1): 9214.
No_Local_Protected_Objects restriction *note D.7(10.2/3): 8602.
@@ -137915,7 +138442,7 @@ No_Specification_of_Aspect restriction *note
13.12.1(6.1/3): 5847.
No_Standard_Allocators_After_Elaboration restriction *note
D.7(19.2/3): 8647.
No_Tag
- in Ada.Tags *note 3.9(6.1/2): 2249.
+ <in> Ada.Tags *note 3.9(6.1/2): 2249.
No_Task_Allocators restriction *note D.7(7): 8591.
No_Task_Hierarchy restriction *note D.7(3/3): 8583.
No_Task_Termination restriction *note D.7(15.1/2): 8627.
@@ -137929,7 +138456,7 @@ node
of a map *note A.18.4(5/2): 7511.
of a tree *note A.18.10(2/4): 7826.
Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7843.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7843.
nominal subtype *note 3.3(23/3): 1542, *note 3.3.1(8/2): 1581.
associated with a dereference *note 4.1(9/3): 2566.
associated with a type_conversion *note 4.6(27): 3193.
@@ -137942,7 +138469,7 @@ nominal subtype *note 3.3(23/3): 1542, *note
3.3.1(8/2): 1581.
of a record component *note 3.8(14): 2185.
of the result of a function_call *note 6.4(12/2): 3743.
Non_Preemptive
- child of Ada.Dispatching *note D.2.4(2.2/3): 8505.
+ <child of> Ada.Dispatching *note D.2.4(2.2/3): 8505.
Non_Preemptive_FIFO_Within_Priorities task disp. policy *note
D.2.4(2/2): 8504.
nonconfirming
@@ -137957,9 +138484,9 @@ nonlimited interface *note 3.9.4(5/2): 2373.
nonlimited type *note 7.5(7): 3957.
becoming nonlimited *note 7.3.1(5/1): 3927, *note 7.5(16): 3961.
nonlimited_with_clause *note 10.1.2(4.2/2): 4768.
- used *note 10.1.2(4/2): 4764, *note P: 10449.
+ <used> *note 10.1.2(4/2): 4764, *note P: 10449.
nonnormative
- See informative *note 1.1.2(18): 1011.
+ <See> informative *note 1.1.2(18): 1011.
nonoverridable
aspect *note 13.1.1(18.2/4): 5407.
nonreturning *note 6.5.1(3.2/3): 3822.
@@ -137970,7 +138497,7 @@ normal completion *note 7.6.1(2/2): 4005.
normal library unit *note E.2(4/3): 8853.
normal state of an object *note 11.6(6/3): 5095, *note 13.9.1(4):
5670.
- [partial] *note 9.8(21): 4674, *note A.13(17): 7223.
+ [<partial>] *note 9.8(21): 4674, *note A.13(17): 7223.
normal termination
of a partition *note 10.2(25.c): 4860.
Normalize_Scalars pragma *note H.1(3): 9195, *note L(22): 9571.
@@ -137981,25 +138508,25 @@ not equal operator *note 4.4(1/3): 2809, *note
4.5.2(1): 2987.
not in (membership test) *note 4.4(1/3): 2828, *note 4.5.2(2/3): 3008.
not operator *note 4.4(1/3): 2865, *note 4.5.6(3): 3090.
Not_A_Specific_CPU
- in System.Multiprocessors *note D.16(4/3): 8799.
+ <in> System.Multiprocessors *note D.16(4/3): 8799.
Not_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6186.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6186.
notes *note 1.1.2(38): 1048.
notwithstanding *note 7.6(17.5/3): 3996, *note 10.1.6(6/2): 4840,
*note 10.2(18.c): 4856, *note 13.1.1(32/4): 5417, *note B.1(22/3): 8075,
*note B.1(38/3): 8081, *note C.3.1(19/3): 8343, *note E.2.1(8): 8863,
*note E.2.1(11): 8867, *note E.2.3(18): 8907, *note H.6(7/2): 9259,
*note J.3(6): 9266.
- [partial] *note J.15.5(8/3): 9353.
+ [<partial>] *note J.15.5(8/3): 9353.
NUL
- in Ada.Characters.Latin_1 *note A.3.3(5): 6043.
- in Interfaces.C *note B.3(20/1): 8126.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6043.
+ <in> Interfaces.C *note B.3(20/1): 8126.
null access value *note 4.2(9): 2678.
null array *note 3.6.1(7): 2066.
null constraint *note 3.2(7/2): 1419.
null extension *note 3.9.1(4.1/2): 2298.
null pointer
- See null access value *note 4.2(9): 2679.
+ <See> null access value *note 4.2(9): 2679.
null procedure *note 6.7(3/3): 3840.
null range *note 3.5(4): 1686.
null record *note 3.8(15): 2186.
@@ -138008,55 +138535,56 @@ null string literal *note 2.6(6): 1308.
null value
of an access type *note 3.10(13/2): 2430.
Null_Address
- in System *note 13.7(12): 5616.
+ <in> System *note 13.7(12): 5616.
Null_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(7): 6398.
+ <in> Ada.Strings.Bounded *note A.4.4(7): 6398.
null_exclusion *note 3.10(5.1/2): 2402.
- used *note 3.2.2(3/2): 1475, *note 3.7(5/2): 2108, *note 3.10(2/2):
-2391, *note 3.10(6/2): 2404, *note 6.1(13/2): 3571, *note 6.1(15/3):
-3581, *note 8.5.1(2/3): 4132, *note 12.4(2/3): 5194, *note P: 9944.
+ <used> *note 3.2.2(3/2): 1475, *note 3.7(5/2): 2108, *note
+3.10(2/2): 2391, *note 3.10(6/2): 2404, *note 6.1(13/2): 3571, *note
+6.1(15/3): 3581, *note 8.5.1(2/3): 4132, *note 12.4(2/3): 5194, *note P:
+9944.
Null_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4992.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4992.
Null_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4998.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4998.
null_procedure_declaration *note 6.7(2/3): 3835.
- used *note 3.1(3/3): 1359, *note 9.4(8/4): 4344, *note P: 10360.
+ <used> *note 3.1(3/3): 1359, *note 9.4(8/4): 4344, *note P: 10360.
Null_Ptr
- in Interfaces.C.Strings *note B.3.1(7): 8179.
+ <in> Interfaces.C.Strings *note B.3.1(7): 8179.
Null_Set
- in Ada.Strings.Maps *note A.4.2(5): 6333.
- in Ada.Strings.Wide_Maps *note A.4.7(5): 6545.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6587.
+ <in> Ada.Strings.Maps *note A.4.2(5): 6333.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(5): 6545.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6587.
null_statement *note 5.1(6): 3390.
- used *note 5.1(4/2): 3370, *note P: 10133.
+ <used> *note 5.1(4/2): 3370, *note P: 10133.
Null_Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 8402.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 8402.
Null_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(5): 6458.
+ <in> Ada.Strings.Unbounded *note A.4.5(5): 6458.
Number of the Beast *note 6.6(6.a/3): 3833.
number sign *note 2.1(15/3): 1197.
-Number_Base subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6965.
+Number_Base <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6965.
number_decimal *note 2.1(10/2): 1183.
- used *note 2.3(3.1/3): 1252, *note P: 9749.
+ <used> *note 2.3(3.1/3): 1252, *note P: 9749.
number_declaration *note 3.3.2(2): 1608.
- used *note 3.1(3/3): 1356, *note P: 9788.
+ <used> *note 3.1(3/3): 1356, *note P: 9788.
number_letter *note 2.1(10.1/2): 1184.
- used *note 2.3(3/2): 1248, *note P: 9746.
+ <used> *note 2.3(3/2): 1248, *note P: 9746.
Number_Of_CPUs
- in System.Multiprocessors *note D.16(5/3): 8801.
+ <in> System.Multiprocessors *note D.16(5/3): 8801.
Number_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6078.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6078.
numeral *note 2.4.1(3): 1268.
- used *note 2.4.1(2): 1265, *note 2.4.1(4): 1273, *note 2.4.2(3):
+ <used> *note 2.4.1(2): 1265, *note 2.4.1(4): 1273, *note 2.4.2(3):
1292, *note P: 9753.
Numeric
- in Interfaces.COBOL *note B.4(20/3): 8246.
+ <in> Interfaces.COBOL *note B.4(20/3): 8246.
numeric type *note 3.5(1): 1675.
numeric_literal *note 2.4(2): 1260.
- used *note 4.4(7/3): 2922, *note P: 10085.
+ <used> *note 4.4(7/3): 2922, *note P: 10085.
numerics *note G(1): 9006.
- child of Ada *note A.5(3/2): 6673.
+ <child of> Ada *note A.5(3/2): 6673.
@@ -138069,14 +138597,15 @@ O
O(f(N)) *note A.18(3/2): 7319.
object *note 3.3(2): 1532, *note N(24): 9700.
- [partial] *note 3.2(1): 1396.
+ [<partial>] *note 3.2(1): 1396.
object-oriented programming (OOP)
- See dispatching operations of tagged types *note 3.9.2(1/2): 2310.
- See tagged types and type extensions *note 3.9(1): 2231.
+ <See> dispatching operations of tagged types *note 3.9.2(1/2):
+2310.
+ <See> tagged types and type extensions *note 3.9(1): 2231.
object_declaration *note 3.3.1(2/3): 1558.
- used *note 3.1(3/3): 1355, *note P: 9787.
+ <used> *note 3.1(3/3): 1355, *note P: 9787.
object_renaming_declaration *note 8.5.1(2/3): 4130.
- used *note 8.5(2): 4122, *note P: 10285.
+ <used> *note 8.5(2): 4122, *note P: 10285.
obsolescent feature *note J(1/2): 9261.
occur immediately within *note 8.1(13): 4036.
occurrence
@@ -138093,15 +138622,16 @@ one-pass context_clauses *note 10.1.2(1.a): 4755.
only as a completion
entry_body *note 9.5.2(16): 4438.
OOP (object-oriented programming)
- See dispatching operations of tagged types *note 3.9.2(1/2): 2311.
- See tagged types and type extensions *note 3.9(1): 2232.
+ <See> dispatching operations of tagged types *note 3.9.2(1/2):
+2311.
+ <See> tagged types and type extensions *note 3.9(1): 2232.
opaque type
- See private types and private extensions *note 7.3(1): 3896.
+ <See> private types and private extensions *note 7.3(1): 3896.
Open
- in Ada.Direct_IO *note A.8.4(7): 6909.
- in Ada.Sequential_IO *note A.8.1(7): 6879.
- in Ada.Streams.Stream_IO *note A.12.1(9): 7170.
- in Ada.Text_IO *note A.10.1(10): 6968.
+ <in> Ada.Direct_IO *note A.8.4(7): 6909.
+ <in> Ada.Sequential_IO *note A.8.1(7): 6879.
+ <in> Ada.Streams.Stream_IO *note A.12.1(9): 7170.
+ <in> Ada.Text_IO *note A.10.1(10): 6968.
open alternative *note 9.7.1(14): 4613.
open entry *note 9.5.3(5): 4463.
of a protected object *note 9.5.3(7/3): 4469.
@@ -138167,25 +138697,25 @@ operator *note 6.6(1): 3829.
xor *note 4.4(1/3): 2800, *note 4.5.1(2): 2965.
operator precedence *note 4.5(1): 2938.
operator_symbol *note 6.1(9): 3563.
- used *note 4.1(3): 2556, *note 4.1.3(3): 2609, *note 6.1(5): 3556,
-*note 6.1(11): 3566, *note P: 9985.
+ <used> *note 4.1(3): 2556, *note 4.1.3(3): 2609, *note 6.1(5):
+3556, *note 6.1(11): 3566, *note P: 9985.
optimization *note 11.5(29): 5080, *note 11.6(1/3): 5088.
Optimize pragma *note 2.8(23): 1343, *note L(23): 9573.
or else (short-circuit control form) *note 4.4(1/3): 2802, *note
4.5.1(1): 2956.
or operator *note 4.4(1/3): 2797, *note 4.5.1(2): 2962.
Ordered_Maps
- child of Ada.Containers *note A.18.6(2/3): 7583.
+ <child of> Ada.Containers *note A.18.6(2/3): 7583.
Ordered_Sets
- child of Ada.Containers *note A.18.9(2/3): 7742.
+ <child of> Ada.Containers *note A.18.9(2/3): 7742.
ordering operator *note 4.5.2(1): 2979.
ordinary file *note A.16(45/2): 7278.
ordinary fixed point type *note 3.5.9(1): 1940, *note 3.5.9(8/2):
1962.
ordinary_fixed_point_definition *note 3.5.9(3): 1946.
- used *note 3.5.9(2): 1944, *note P: 9872.
+ <used> *note 3.5.9(2): 1944, *note P: 9872.
OSC
- in Ada.Characters.Latin_1 *note A.3.3(19): 6170.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6170.
other_control *note 2.1(13.1/2): 1192.
other_format *note 2.1(10.3/2): 1186.
other_private_use *note 2.1(13.2/2): 1193.
@@ -138199,13 +138729,13 @@ Output'Class aspect *note 13.13.2(38/4): 5919.
overall interpretation
of a complete context *note 8.6(10): 4194.
Overflow_Check *note 11.5(16): 5068.
- [partial] *note 3.5.4(20): 1862, *note 4.4(11): 2931, *note
+ [<partial>] *note 3.5.4(20): 1862, *note 4.4(11): 2931, *note
4.5.7(21/3): 3130, *note 5.4(13): 3440, *note G.2.1(11): 9091, *note
G.2.2(7): 9107, *note G.2.3(25): 9113, *note G.2.4(2): 9119, *note
G.2.6(3): 9126.
Overlap
- in Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7703.
- in Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7779.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7703.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7779.
Overlaps_Storage attribute *note 13.3(73.6/3): 5519.
overload resolution *note 8.6(1/3): 4189.
overloadable *note 8.3(7): 4071.
@@ -138219,15 +138749,16 @@ override *note 8.3(9/1): 4074, *note 12.3(17):
5180.
4275, *note 9.4(11.1/3): 4350.
overriding operation *note N(24.1/2): 9701.
overriding_indicator *note 8.3.1(2/2): 4099.
- used *note 3.9.3(1.1/3): 2345, *note 6.1(2/3): 3541, *note
+ <used> *note 3.9.3(1.1/3): 2345, *note 6.1(2/3): 3541, *note
6.3(2/3): 3671, *note 6.7(2/3): 3836, *note 6.8(2/4): 3846, *note
8.5.4(2/3): 4161, *note 9.5.2(2/3): 4405, *note 10.1.3(3/3): 4788, *note
12.3(2/3): 5144, *note P: 10501.
Overwrite
- in Ada.Strings.Bounded *note A.4.4(62): 6438, *note A.4.4(63):
+ <in> Ada.Strings.Bounded *note A.4.4(62): 6438, *note A.4.4(63):
6439.
- in Ada.Strings.Fixed *note A.4.3(27): 6379, *note A.4.3(28): 6380.
- in Ada.Strings.Unbounded *note A.4.5(57): 6495, *note A.4.5(58):
+ <in> Ada.Strings.Fixed *note A.4.3(27): 6379, *note A.4.3(28):
+6380.
+ <in> Ada.Strings.Unbounded *note A.4.5(57): 6495, *note A.4.5(58):
6496.
@@ -138246,62 +138777,62 @@ package instance *note 12.3(13): 5172.
package-private extension *note 7.3(14.a): 3918.
package-private type *note 7.3(14.a): 3917.
package_body *note 7.2(2/3): 3884.
- used *note 3.11(6): 2522, *note 10.1.1(7): 4729, *note P: 10443.
+ <used> *note 3.11(6): 2522, *note 10.1.1(7): 4729, *note P: 10443.
package_body_stub *note 10.1.3(4/3): 4791.
- used *note 10.1.3(2): 4784, *note P: 10455.
+ <used> *note 10.1.3(2): 4784, *note P: 10455.
package_declaration *note 7.1(2): 3867.
- used *note 3.1(3/3): 1361, *note 10.1.1(5): 4720, *note P: 9793.
+ <used> *note 3.1(3/3): 1361, *note 10.1.1(5): 4720, *note P: 9793.
package_renaming_declaration *note 8.5.3(2/3): 4153.
- used *note 8.5(2): 4124, *note 10.1.1(6): 4724, *note P: 10439.
+ <used> *note 8.5(2): 4124, *note 10.1.1(6): 4724, *note P: 10439.
package_specification *note 7.1(3/3): 3869.
- used *note 7.1(2): 3868, *note 12.1(4): 5112, *note P: 10490.
+ <used> *note 7.1(2): 3868, *note 12.1(4): 5112, *note P: 10490.
packed *note 13.2(5.1/3): 5420.
Packed_Decimal
- in Interfaces.COBOL *note B.4(12/3): 8237.
+ <in> Interfaces.COBOL *note B.4(12/3): 8237.
Packed_Format
- in Interfaces.COBOL *note B.4(26): 8257.
+ <in> Interfaces.COBOL *note B.4(26): 8257.
Packed_Signed
- in Interfaces.COBOL *note B.4(27): 8259.
+ <in> Interfaces.COBOL *note B.4(27): 8259.
Packed_Unsigned
- in Interfaces.COBOL *note B.4(27): 8258.
+ <in> Interfaces.COBOL *note B.4(27): 8258.
padding bits *note 13.1(7/2): 5358.
Page
- in Ada.Text_IO *note A.10.1(39): 7026.
+ <in> Ada.Text_IO *note A.10.1(39): 7026.
Page pragma *note 2.8(22): 1341, *note L(25): 9579.
page terminator *note A.10(7): 6948.
Page_Length
- in Ada.Text_IO *note A.10.1(26): 7001.
+ <in> Ada.Text_IO *note A.10.1(26): 7001.
Paragraph_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6198.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6198.
parallel processing
- See task *note 9(1/3): 4231.
+ <See> task *note 9(1/3): 4231.
parameter
explicitly aliased *note 6.1(23.1/3): 3598.
- See formal parameter *note 6.1(17): 3590.
- See generic formal parameter *note 12(1): 5102.
- See also discriminant *note 3.7(1/2): 2096.
- See also loop parameter *note 5.5(6): 3458.
+ <See> formal parameter *note 6.1(17): 3590.
+ <See> generic formal parameter *note 12(1): 5102.
+ <See also> discriminant *note 3.7(1/2): 2096.
+ <See also> loop parameter *note 5.5(6): 3458.
parameter assigning back *note 6.4.1(17): 3766.
parameter copy back *note 6.4.1(17): 3764.
parameter mode *note 6.1(18/3): 3591.
parameter passing *note 6.4.1(1): 3746.
parameter_and_result_profile *note 6.1(13/2): 3569.
- used *note 3.10(5): 2401, *note 3.10(6/2): 2409, *note 6.1(4.2/2):
-3552, *note P: 10195.
+ <used> *note 3.10(5): 2401, *note 3.10(6/2): 2409, *note
+6.1(4.2/2): 3552, *note P: 10195.
parameter_association *note 6.4(5): 3732.
- used *note 6.4(4): 3730, *note P: 10233.
+ <used> *note 6.4(4): 3730, *note P: 10233.
parameter_profile *note 6.1(12): 3567.
- used *note 3.10(5): 2400, *note 3.10(6/2): 2407, *note 6.1(4.1/2):
-3549, *note 9.5.2(2/3): 4408, *note 9.5.2(3): 4413, *note 9.5.2(6):
-4427, *note P: 9955.
+ <used> *note 3.10(5): 2400, *note 3.10(6/2): 2407, *note
+6.1(4.1/2): 3549, *note 9.5.2(2/3): 4408, *note 9.5.2(3): 4413, *note
+9.5.2(6): 4427, *note P: 9955.
parameter_specification *note 6.1(15/3): 3578.
- used *note 6.1(14): 3577, *note P: 10212.
+ <used> *note 6.1(14): 3577, *note P: 10212.
Parameterless_Handler
- in Ada.Interrupts *note C.3.2(2/3): 8349.
+ <in> Ada.Interrupts *note C.3.2(2/3): 8349.
Params_Stream_Type
- in System.RPC *note E.5(6): 8953.
+ <in> System.RPC *note E.5(6): 8953.
parent *note N(25.1/2): 9703.
- in Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7885.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7885.
parent body
of a subunit *note 10.1.3(8/2): 4803.
parent declaration
@@ -138312,10 +138843,10 @@ parent type *note 3.4(3/2): 1624.
parent unit
of a library unit *note 10.1.1(10): 4741.
Parent_Tag
- in Ada.Tags *note 3.9(7.2/2): 2257.
+ <in> Ada.Tags *note 3.9(7.2/2): 2257.
parent_unit_name *note 10.1.1(8): 4730.
- used *note 6.1(5): 3554, *note 6.1(7): 3561, *note 7.1(3/3): 3874,
-*note 7.2(2/3): 3889, *note 10.1.3(7): 4801, *note P: 10196.
+ <used> *note 6.1(5): 3554, *note 6.1(7): 3561, *note 7.1(3/3):
+3874, *note 7.2(2/3): 3889, *note 10.1.3(7): 4801, *note P: 10196.
part
of a type *note 3.2(6/2): 1416.
of an object or value *note 3.2(6/2): 1415.
@@ -138325,80 +138856,81 @@ partition *note 10.2(2): 4844, *note N(26): 9704.
partition building *note 10.2(2): 4845.
partition communication subsystem (PCS) *note E.5(1/2): 8948.
Partition_Check
- [partial] *note E.4(19): 8938.
+ [<partial>] *note E.4(19): 8938.
Partition_Elaboration_Policy pragma *note H.6(3/2): 9255, *note
L(25.1/2): 9581.
Partition_Id
- in System.RPC *note E.5(4): 8951.
+ <in> System.RPC *note E.5(4): 8951.
Partition_Id attribute *note E.1(9): 8841.
pass by copy *note 6.2(2): 3652.
pass by reference *note 6.2(2): 3655.
passive partition *note E.1(2): 8833.
Pattern_Error
- in Ada.Strings *note A.4.1(5): 6322.
+ <in> Ada.Strings *note A.4.1(5): 6322.
PC-map approach to finalization *note 7.6.1(24.s): 4031.
PCS (partition communication subsystem) *note E.5(1/2): 8949.
Peak_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 8031.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+8031.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
8015.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-8000.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 8000.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
8023.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-8008.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 8008.
pending interrupt occurrence *note C.3(2): 8319.
per-object constraint *note 3.8(18/2): 2192.
per-object expression *note 3.8(18/2): 2191.
percent sign *note 2.1(15/3): 1223.
Percent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6080.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6080.
perfect result set *note G.2.3(5): 9111.
perform indefinite insertion *note A.18(6/4): 7323.
periodic task
example *note 9.6(39): 4539.
- See delay_until_statement *note 9.6(39): 4540.
+ <See> delay_until_statement *note 9.6(39): 4540.
Pi
- in Ada.Numerics *note A.5(3/2): 6675.
+ <in> Ada.Numerics *note A.5(3/2): 6675.
Pic_String
- in Ada.Text_IO.Editing *note F.3.3(7): 8986.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8986.
Picture
- in Ada.Text_IO.Editing *note F.3.3(4): 8983.
+ <in> Ada.Text_IO.Editing *note F.3.3(4): 8983.
picture String
for edited output *note F.3.1(1/3): 8979.
Picture_Error
- in Ada.Text_IO.Editing *note F.3.3(9): 8989.
+ <in> Ada.Text_IO.Editing *note F.3.3(9): 8989.
Pilcrow_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6197.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6197.
plain_char
- in Interfaces.C *note B.3(11): 8119.
+ <in> Interfaces.C *note B.3(11): 8119.
plane
character *note 2.1(1/3): 1173.
PLD
- in Ada.Characters.Latin_1 *note A.3.3(17): 6152.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6152.
PLU
- in Ada.Characters.Latin_1 *note A.3.3(17): 6153.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6153.
plus operator *note 4.4(1/3): 2831, *note 4.5.3(1): 3031, *note
4.5.4(1): 3056.
plus sign *note 2.1(15/3): 1205.
Plus_Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 6192.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6192.
Plus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 6086.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6086.
PM
- in Ada.Characters.Latin_1 *note A.3.3(19): 6171.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6171.
point *note 2.1(15/3): 1211.
Pointer
- in Interfaces.C.Pointers *note B.3.2(5): 8200.
- See access value *note 3.10(1): 2388.
- See type System.Address *note 13.7(34/2): 5629.
+ <in> Interfaces.C.Pointers *note B.3.2(5): 8200.
+ <See> access value *note 3.10(1): 2388.
+ <See> type System.Address *note 13.7(34/2): 5629.
pointer type
- See access type *note 3.10(1): 2389.
+ <See> access type *note 3.10(1): 2389.
Pointer_Error
- in Interfaces.C.Pointers *note B.3.2(8): 8203.
+ <in> Interfaces.C.Pointers *note B.3.2(8): 8203.
Pointers
- child of Interfaces.C *note B.3.2(4): 8199.
+ <child of> Interfaces.C *note B.3.2(4): 8199.
polymorphism *note 3.9(1): 2227, *note 3.9.2(1/2): 2307.
pool
default *note 13.11.3(4.2/4): 5768.
@@ -138407,10 +138939,10 @@ pool element *note 3.10(7/1): 2415, *note
13.11(11): 5703.
pool type *note 13.11(11): 5701.
pool-specific access type *note 3.10(7/1): 2412, *note 3.10(8): 2416.
Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(9/3): 5779.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(9/3): 5779.
Pos attribute *note 3.5.5(2): 1881.
position *note 13.5.1(4): 5561.
- used *note 13.5.1(3): 5558, *note P: 10604.
+ <used> *note 13.5.1(3): 5558, *note P: 10604.
Position attribute *note 13.5.2(2/2): 5577.
position number *note 3.5(1): 1674.
of an enumeration value *note 3.5.1(7): 1796.
@@ -138421,14 +138953,14 @@ positional component association *note 4.3.1(6):
2716.
positional discriminant association *note 3.7.1(4): 2145.
positional parameter association *note 6.4.1(2/3): 3750.
positional_array_aggregate *note 4.3.3(3/2): 2751.
- used *note 4.3.3(2): 2749, *note P: 10025.
+ <used> *note 4.3.3(2): 2749, *note P: 10025.
Positive *note 3.5.4(12): 1850.
-Positive subtype of Integer
- in Standard *note A.1(13): 5976.
-Positive_Count subtype of Count
- in Ada.Direct_IO *note A.8.4(4): 6907.
- in Ada.Streams.Stream_IO *note A.12.1(7): 7168.
- in Ada.Text_IO *note A.10.1(5): 6962.
+Positive <subtype of> Integer
+ <in> Standard *note A.1(13): 5976.
+Positive_Count <subtype of> Count
+ <in> Ada.Direct_IO *note A.8.4(4): 6907.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 7168.
+ <in> Ada.Text_IO *note A.10.1(5): 6962.
POSIX *note 1.2(10.a): 1152.
possible interpretation *note 8.6(14): 4195.
for direct_names *note 8.3(24): 4093.
@@ -138450,9 +138982,9 @@ potentially blocking operation *note 9.5.1(8): 4400.
Suspend_Until_True *note D.10(10): 8695.
potentially unevaluated expression *note 6.1.1(20/3): 3631.
potentially use-visible *note 8.4(8/3): 4115.
- [partial] *note 12.6(9.2/3): 5315.
+ [<partial>] *note 12.6(9.2/3): 5315.
Pound_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6177.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6177.
Pragma *note 2.8(1): 1311, *note 2.8(2): 1312, *note L(1): 9468, *note
N(27): 9706.
pragma argument *note 2.8(9): 1327.
@@ -138506,8 +139038,8 @@ pragma, representation *note 13.1(1/1): 5343.
Volatile *note J.15.8(9/3): 9390.
Volatile_Components *note J.15.8(9/3): 9394.
pragma_argument_association *note 2.8(3/3): 1316.
- used *note 2.8(2): 1314, *note 13.12(11/3): 5827, *note L(27.3/3):
-9599, *note P: 9776.
+ <used> *note 2.8(2): 1314, *note 13.12(11/3): 5827, *note
+L(27.3/3): 9599, *note P: 9776.
pragmas
All_Calls_Remote *note E.2.3(5): 8891, *note L(2): 9469.
Assert *note 11.4.2(3/2): 5019, *note L(2.1/2): 9472.
@@ -138587,7 +139119,7 @@ predecessor node
predefined environment *note A(1): 5968.
predefined exception *note 11.1(4): 4933.
predefined library unit
- See language-defined library units
+ <See> language-defined library units
predefined operation
of a type *note 3.2.3(1/2): 1501.
predefined operations
@@ -138598,11 +139130,11 @@ predefined operations
of an access type *note 3.10.2(35/2): 2498.
of an array type *note 3.6.2(15): 2087.
predefined operator *note 4.5(9): 2945.
- [partial] *note 3.2.1(9): 1465.
+ [<partial>] *note 3.2.1(9): 1465.
predefined type *note 3.2.1(10): 1466.
- See language-defined types
+ <See> language-defined types
predicate *note 4.5.8(3/3): 3143, *note N(27.2/3): 9708.
- used *note 4.5.8(1/3): 3141, *note P: 10111.
+ <used> *note 4.5.8(1/3): 3141, *note P: 10111.
predicate aspect *note 3.2.4(1/3): 1508.
predicate check
allocator *note 3.2.4(31/4): 1526.
@@ -138624,7 +139156,7 @@ L(25.2/2): 9584.
Preelaborate aspect *note 10.2.1(11/3): 4882.
Preelaborate pragma *note 10.2.1(3): 4871, *note L(26): 9587.
preelaborated *note 10.2.1(11/3): 4884.
- [partial] *note 10.2.1(11/3): 4880, *note E.2.1(9): 8864.
+ [<partial>] *note 10.2.1(11/3): 4880, *note E.2.1(9): 8864.
implementation requirements *note C.4(2): 8364.
preempt
a running task *note D.2.3(9/2): 8501.
@@ -138632,20 +139164,20 @@ preference
for root numeric operators and ranges *note 8.6(29): 4215.
for universal access equality operators *note 8.6(29.1/3): 4216.
preference control
- See requeue *note 9.5.4(1): 4486.
+ <See> requeue *note 9.5.4(1): 4486.
prefix *note 4.1(4): 2557.
of a prefixed view *note 4.1.3(9.2/3): 2612.
- used *note 4.1.1(2): 2580, *note 4.1.2(2): 2593, *note 4.1.3(2):
+ <used> *note 4.1.1(2): 2580, *note 4.1.2(2): 2593, *note 4.1.3(2):
2604, *note 4.1.4(2): 2623, *note 4.1.4(4): 2629, *note 4.1.6(10/3):
2660, *note 6.4(2): 3723, *note 6.4(3): 3727, *note P: 9993.
prefixed view *note 4.1.3(9.2/3): 2611.
prefixed view profile *note 6.3.1(24.1/2): 3713.
Prepend
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 7460.
- in Ada.Containers.Vectors *note A.18.2(44/2): 7379, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 7460.
+ <in> Ada.Containers.Vectors *note A.18.2(44/2): 7379, *note
A.18.2(45/2): 7380.
Prepend_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7877.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7877.
prescribed result
for the evaluation of a complex arithmetic operation *note
G.1.1(42): 9034.
@@ -138653,23 +139185,23 @@ G.1.1(42): 9034.
G.1.2(35): 9062.
for the evaluation of an elementary function *note A.5.1(37): 6714.
Previous
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 7476,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 7476,
*note A.18.3(40/2): 7478.
- in Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7625, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7625, *note
A.18.6(37/2): 7626.
- in Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7787, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7787, *note
A.18.9(48/2): 7788.
- in Ada.Containers.Vectors *note A.18.2(65/2): 7400, *note
+ <in> Ada.Containers.Vectors *note A.18.2(65/2): 7400, *note
A.18.2(66/2): 7401.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3470.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3470.
Previous_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7891, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7891, *note
A.18.10(67/3): 7893.
primary *note 4.4(7/3): 2921.
- used *note 4.4(6): 2918, *note P: 10082.
+ <used> *note 4.4(6): 2918, *note P: 10082.
primitive function *note A.5.3(17): 6773.
primitive operation
- [partial] *note 3.2(1): 1395.
+ [<partial>] *note 3.2(1): 1395.
primitive operations *note N(28): 9709.
of a type *note 3.2.3(1/2): 1502.
primitive operator
@@ -138684,8 +139216,8 @@ priority inheritance *note D.1(15): 8458.
priority inversion *note D.2.3(11/2): 8502.
priority of an entry call *note D.4(9): 8570.
Priority pragma *note J.15.11(2/3): 9409, *note L(27.1/3): 9590.
-Priority subtype of Any_Priority
- in System *note 13.7(16): 5626.
+Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5626.
Priority_Queuing queuing policy *note D.4(8): 8569.
Priority_Specific_Dispatching pragma *note D.2.2(3.2/2): 8486, *note
L(27.2/2): 9592.
@@ -138694,7 +139226,7 @@ private descendant
of a library unit *note 10.1.1(12): 4749.
private extension *note 3.2(4.1/2): 1412, *note 3.9(2.1/2): 2238,
*note 3.9.1(1/2): 2292, *note N(29/2): 9710.
- [partial] *note 7.3(14): 3916, *note 12.5.1(5/3): 5260.
+ [<partial>] *note 7.3(14): 3916, *note 12.5.1(5/3): 5260.
private library unit *note 10.1.1(12): 4746.
private operations *note 7.3.1(1): 3925.
private part *note 8.2(5): 4047.
@@ -138702,24 +139234,24 @@ private part *note 8.2(5): 4047.
of a protected unit *note 9.4(11/2): 4349.
of a task unit *note 9.1(9): 4274.
private type *note 3.2(4.1/2): 1411, *note N(30/2): 9711.
- [partial] *note 7.3(14): 3915.
+ [<partial>] *note 7.3(14): 3915.
private types and private extensions *note 7.3(1): 3894.
private with_clause *note 10.1.2(4.b/2): 4771.
private_extension_declaration *note 7.3(3/3): 3903.
- used *note 3.2.1(2): 1441, *note P: 9802.
+ <used> *note 3.2.1(2): 1441, *note P: 9802.
private_type_declaration *note 7.3(2/3): 3899.
- used *note 3.2.1(2): 1440, *note P: 9801.
+ <used> *note 3.2.1(2): 1440, *note P: 9801.
procedure *note 6(1): 3535, *note N(30.1/2): 9712.
null *note 6.7(3/3): 3841.
procedure instance *note 12.3(13): 5174.
procedure_call_statement *note 6.4(2): 3721.
- used *note 5.1(4/2): 3374, *note 9.7.2(3.1/2): 4626, *note P:
+ <used> *note 5.1(4/2): 3374, *note 9.7.2(3.1/2): 4626, *note P:
10414.
procedure_or_entry_call *note 9.7.2(3.1/2): 4625.
- used *note 9.7.2(3/2): 4623, *note 9.7.4(4/2): 4641, *note P:
+ <used> *note 9.7.2(3/2): 4623, *note 9.7.4(4/2): 4641, *note P:
10422.
procedure_specification *note 6.1(4.1/2): 3547.
- used *note 6.1(4/2): 3545, *note 6.7(2/3): 3837, *note P: 10190.
+ <used> *note 6.1(4/2): 3545, *note 6.7(2/3): 3837, *note P: 10190.
processing node *note E(2): 8827.
profile *note 6.1(22): 3594.
associated with a dereference *note 4.1(10): 2568.
@@ -138737,8 +139269,8 @@ progenitor type *note 3.9.4(9/2): 2382.
program *note 10.2(1): 4841, *note N(31): 9714.
program execution *note 10.2(1): 4842.
program library
- See library *note 10(2): 4695.
- See library *note 10.1.4(9): 4817.
+ <See> library *note 10(2): 4695.
+ <See> library *note 10.1.4(9): 4817.
Program unit *note 10.1(1): 4702, *note N(32): 9715.
program unit pragma *note 10.1.5(2): 4819.
Inline *note J.15.1(1/3): 9298.
@@ -138770,7 +139302,7 @@ Program_Error
D.7(19.1/2): 8645, *note D.10(10): 8697, *note D.11(8): 8713, *note
E.1(10/2): 8843, *note E.3(6): 8920, *note E.4(18/1): 8937, *note
J.7.1(7): 9281.
- in Standard *note A.1(46): 5988.
+ <in> Standard *note A.1(46): 5988.
prohibited
tampering with a holder *note A.18.18(35/4): 7951.
tampering with a list *note A.18.3(69.1/4): 7492.
@@ -138784,7 +139316,7 @@ propagate *note 11.4(1): 4977.
an exception occurrence by an execution, to a dynamically enclosing
execution *note 11.4(6): 4984.
proper_body *note 3.11(6): 2520.
- used *note 3.11(5): 2518, *note 10.1.3(7): 4802, *note P: 10468.
+ <used> *note 3.11(5): 2518, *note 10.1.3(7): 4802, *note P: 10468.
protected action *note 9.5.1(4/4): 4394.
complete *note 9.5.1(6): 4397.
start *note 9.5.1(5/4): 4395.
@@ -138801,53 +139333,53 @@ protected tagged type *note 3.9.4(6/2): 2380.
protected type *note N(33/2): 9716.
protected unit *note 9.4(1): 4311.
protected_body *note 9.4(7/3): 4336.
- used *note 3.11(6): 2524, *note P: 9971.
+ <used> *note 3.11(6): 2524, *note P: 9971.
protected_body_stub *note 10.1.3(6/3): 4797.
- used *note 10.1.3(2): 4786, *note P: 10457.
+ <used> *note 10.1.3(2): 4786, *note P: 10457.
protected_definition *note 9.4(4): 4325.
- used *note 9.4(2/3): 4319, *note 9.4(3/3): 4324, *note P: 10345.
+ <used> *note 9.4(2/3): 4319, *note 9.4(3/3): 4324, *note P: 10345.
protected_element_declaration *note 9.4(6): 4333.
- used *note 9.4(4): 4327, *note P: 10347.
+ <used> *note 9.4(4): 4327, *note P: 10347.
protected_operation_declaration *note 9.4(5/1): 4329.
- used *note 9.4(4): 4326, *note 9.4(6): 4334, *note P: 10352.
+ <used> *note 9.4(4): 4326, *note 9.4(6): 4334, *note P: 10352.
protected_operation_item *note 9.4(8/4): 4341.
- used *note 9.4(7/3): 4339, *note P: 10356.
+ <used> *note 9.4(7/3): 4339, *note P: 10356.
protected_type_declaration *note 9.4(2/3): 4314.
- used *note 3.2.1(3/3): 1448, *note P: 9808.
+ <used> *note 3.2.1(3/3): 1448, *note P: 9808.
ptrdiff_t
- in Interfaces.C *note B.3(12): 8120.
+ <in> Interfaces.C *note B.3(12): 8120.
PU1
- in Ada.Characters.Latin_1 *note A.3.3(18): 6158.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6158.
PU2
- in Ada.Characters.Latin_1 *note A.3.3(18): 6159.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6159.
public declaration of a library unit *note 10.1.1(12): 4745.
public descendant
of a library unit *note 10.1.1(12): 4748.
public library unit *note 10.1.1(12): 4744.
punctuation_connector *note 2.1(10.2/2): 1185.
- used *note 2.3(3.1/3): 1253, *note P: 9750.
+ <used> *note 2.3(3.1/3): 1253, *note P: 9750.
pure *note 10.2.1(15.1/3): 4892.
Pure aspect *note 10.2.1(17/3): 4895.
Pure pragma *note 10.2.1(14): 4888, *note L(28): 9601.
Put
- in Ada.Text_IO *note A.10.1(42): 7030, *note A.10.1(48): 7040,
+ <in> Ada.Text_IO *note A.10.1(42): 7030, *note A.10.1(48): 7040,
*note A.10.1(55): 7055, *note A.10.1(60): 7064, *note A.10.1(66): 7071,
*note A.10.1(67): 7074, *note A.10.1(71): 7082, *note A.10.1(72): 7084,
*note A.10.1(76): 7092, *note A.10.1(77): 7094, *note A.10.1(82): 7101,
*note A.10.1(83): 7103.
- in Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 7129, *note
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 7129, *note
A.10.11(5/2): 7130.
- in Ada.Text_IO.Complex_IO *note G.1.3(7): 9071, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(7): 9071, *note G.1.3(8):
9074.
- in Ada.Text_IO.Editing *note F.3.3(14): 8998, *note F.3.3(15):
+ <in> Ada.Text_IO.Editing *note F.3.3(14): 8998, *note F.3.3(15):
8999, *note F.3.3(16): 9000.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 7139, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 7139, *note
A.10.12(5/2): 7140.
Put_Line
- in Ada.Text_IO *note A.10.1(50): 7045.
- in Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 7131, *note
+ <in> Ada.Text_IO *note A.10.1(50): 7045.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 7131, *note
A.10.11(7/2): 7132.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 7141, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 7141, *note
A.10.12(7/2): 7142.
@@ -138860,44 +139392,45 @@ Q
qualified_expression *note 4.7(2): 3260.
- used *note 4.1(2/3): 2551, *note 4.8(2/3): 3283, *note 13.8(2):
+ <used> *note 4.1(2/3): 2551, *note 4.8(2/3): 3283, *note 13.8(2):
5651, *note P: 9981.
quantified expressions *note 4.5.8(5/3): 3146.
quantified_expression *note 4.5.8(1/3): 3135.
- used *note 4.4(7/3): 2929, *note P: 10092.
+ <used> *note 4.4(7/3): 2929, *note P: 10092.
quantifier *note 4.5.8(2/3): 3142.
- used *note 4.5.8(1/3): 3136, *note P: 10109.
+ <used> *note 4.5.8(1/3): 3136, *note P: 10109.
Query_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 7449.
- in Ada.Containers.Hashed_Maps *note A.18.5(16/2): 7543.
- in Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7683.
- in Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7940.
- in Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7852.
- in Ada.Containers.Ordered_Maps *note A.18.6(15/2): 7597.
- in Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7757.
- in Ada.Containers.Vectors *note A.18.2(31/2): 7359, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 7449.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(16/2): 7543.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7683.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7940.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7852.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(15/2): 7597.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7757.
+ <in> Ada.Containers.Vectors *note A.18.2(31/2): 7359, *note
A.18.2(32/2): 7360.
Question
- in Ada.Characters.Latin_1 *note A.3.3(10): 6097.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6097.
Queue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3): 8026.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3):
+8026.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
8011.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(4/3):
-7996.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(4/3): 7996.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
8018.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(4/3):
-8004.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(4/3): 8004.
queuing policy *note D.4(1/3): 8557, *note D.4(6): 8565.
FIFO_Queuing *note D.4(7/2): 8566.
Priority_Queuing *note D.4(8): 8568.
Queuing_Policy pragma *note D.4(3): 8559, *note L(29): 9604.
Quotation
- in Ada.Characters.Latin_1 *note A.3.3(8): 6077.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6077.
quotation mark *note 2.1(15/3): 1196.
quoted string
- See string_literal *note 2.6(1): 1302.
+ <See> string_literal *note 2.6(1): 1302.
@@ -138914,27 +139447,27 @@ raise
an exception *note N(18): 9683.
an exception occurrence *note 11.4(3): 4983.
Raise_Exception
- in Ada.Exceptions *note 11.4.1(4/3): 4999.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 4999.
raise_expression *note 11.3(2.1/4): 4967.
- used *note 4.4(3/4): 2899, *note P: 10068.
+ <used> *note 4.4(3/4): 2899, *note P: 10068.
raise_statement *note 11.3(2/2): 4964.
- used *note 5.1(4/2): 3380, *note P: 10143.
+ <used> *note 5.1(4/2): 3380, *note P: 10143.
Random
- in Ada.Numerics.Discrete_Random *note A.5.2(20): 6731.
- in Ada.Numerics.Float_Random *note A.5.2(8): 6719.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(20): 6731.
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6719.
random number *note A.5.2(1): 6715.
range *note 3.5(3): 1678, *note 3.5(4): 1682.
of a scalar subtype *note 3.5(7): 1696.
- used *note 3.5(2): 1677, *note 3.6(6): 2021, *note 3.6.1(3): 2061,
-*note 3.8.1(5/3): 2215, *note 4.4(3.2/4): 2905, *note P: 9891.
+ <used> *note 3.5(2): 1677, *note 3.6(6): 2021, *note 3.6.1(3):
+2061, *note 3.8.1(5/3): 2215, *note 4.4(3.2/4): 2905, *note P: 9891.
Range attribute *note 3.5(14): 1708, *note 3.6.2(7): 2080.
Range(N) attribute *note 3.6.2(8): 2082.
range_attribute_designator *note 4.1.4(5): 2631.
- used *note 4.1.4(4): 2630, *note P: 10005.
+ <used> *note 4.1.4(4): 2630, *note P: 10005.
range_attribute_reference *note 4.1.4(4): 2628.
- used *note 3.5(3): 1679, *note P: 9853.
+ <used> *note 3.5(3): 1679, *note P: 9853.
Range_Check *note 11.5(17): 5069.
- [partial] *note 3.2.2(11): 1493, *note 3.5(24): 1720, *note
+ [<partial>] *note 3.2.2(11): 1493, *note 3.5(24): 1720, *note
3.5(27): 1727, *note 3.5(39.12/3): 1757, *note 3.5(39.4/3): 1751, *note
3.5(39.5/3): 1754, *note 3.5(43/3): 1763, *note 3.5(55/3): 1769, *note
3.5.5(7): 1886, *note 3.5.9(19/4): 1977, *note 4.2(11): 2681, *note
@@ -138948,27 +139481,27 @@ K.2(114): 9440, *note K.2(122): 9443, *note
K.2(184): 9449, *note
K.2(220): 9456, *note K.2(241): 9459, *note K.2(41): 9430, *note
K.2(47): 9433.
range_constraint *note 3.5(2): 1676.
- used *note 3.2.2(6): 1484, *note 3.5.9(5/4): 1955, *note J.3(2/4):
-9264, *note P: 9826.
+ <used> *note 3.2.2(6): 1484, *note 3.5.9(5/4): 1955, *note
+J.3(2/4): 9264, *note P: 9826.
Ravenscar *note D.13(1/3): 8716.
RCI
generic *note E.2.3(7/3): 8899.
library unit *note E.2.3(7/3): 8897.
package *note E.2.3(7/3): 8898.
Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9150,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 9150,
*note G.3.2(27/2): 9163.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9013.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 9013.
re-raise statement *note 11.3(3/4): 4970.
read
the value of an object *note 3.3(14): 1540.
- in Ada.Direct_IO *note A.8.4(12): 6920.
- in Ada.Sequential_IO *note A.8.1(12): 6889.
- in Ada.Storage_IO *note A.9(6): 6940.
- in Ada.Streams *note 13.13.1(5): 5865.
- in Ada.Streams.Stream_IO *note A.12.1(15): 7181, *note A.12.1(16):
-7182.
- in System.RPC *note E.5(7): 8954.
+ <in> Ada.Direct_IO *note A.8.4(12): 6920.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6889.
+ <in> Ada.Storage_IO *note A.9(6): 6940.
+ <in> Ada.Streams *note 13.13.1(5): 5865.
+ <in> Ada.Streams.Stream_IO *note A.12.1(15): 7181, *note
+A.12.1(16): 7182.
+ <in> System.RPC *note E.5(7): 8954.
Read aspect *note 13.13.2(38/4): 5905.
Read attribute *note 13.13.2(6): 5878, *note 13.13.2(14): 5882.
Read clause *note 13.3(7/2): 5452, *note 13.13.2(38/4): 5900.
@@ -138978,25 +139511,25 @@ ready
ready queue *note D.2.1(5/2): 8473.
ready task *note D.2.1(5/2): 8476.
Real
- in Interfaces.Fortran *note B.5(6): 8285.
+ <in> Interfaces.Fortran *note B.5(6): 8285.
real literal *note 2.4(1): 1258.
real literals *note 3.5.6(4): 1902.
real time *note D.8(18): 8676.
real type *note 3.2(3): 1409, *note 3.5.6(1): 1896, *note N(34): 9717.
real-time systems *note C(1): 8303, *note D(1): 8449.
Real_Arrays
- child of Ada.Numerics *note G.3.1(31/2): 9142.
+ <child of> Ada.Numerics *note G.3.1(31/2): 9142.
Real_Matrix
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9132.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9132.
real_range_specification *note 3.5.7(3): 1910.
- used *note 3.5.7(2): 1909, *note 3.5.9(3): 1948, *note 3.5.9(4):
+ <used> *note 3.5.7(2): 1909, *note 3.5.9(3): 1948, *note 3.5.9(4):
1952, *note P: 9875.
Real_Time
- child of Ada *note D.8(3): 8654.
+ <child of> Ada *note D.8(3): 8654.
real_type_definition *note 3.5.6(2): 1897.
- used *note 3.2.1(4/2): 1452, *note P: 9811.
+ <used> *note 3.2.1(4/2): 1452, *note P: 9811.
Real_Vector
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9131.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 9131.
receiving stub *note E.4(10): 8930.
reclamation of storage *note 13.11.2(1): 5740.
recommended level of support *note 13.1(20/3): 5383.
@@ -139020,66 +139553,67 @@ N(35): 9718.
Record layout aspect *note 13.5(1): 5547.
record type *note 3.8(1): 2161, *note N(36): 9719.
record_aggregate *note 4.3.1(2): 2703.
- used *note 4.3(2): 2690, *note 13.8(14.b): 5657, *note P: 10010.
+ <used> *note 4.3(2): 2690, *note 13.8(14.b): 5657, *note P: 10010.
record_component_association *note 4.3.1(4/2): 2708.
- used *note 4.3.1(3): 2707, *note P: 10015.
+ <used> *note 4.3.1(3): 2707, *note P: 10015.
record_component_association_list *note 4.3.1(3): 2705.
- used *note 4.3.1(2): 2704, *note 4.3.2(2): 2731, *note P: 10022.
+ <used> *note 4.3.1(2): 2704, *note 4.3.2(2): 2731, *note P: 10022.
record_definition *note 3.8(3): 2165.
- used *note 3.8(2): 2164, *note 3.9.1(2): 2295, *note P: 9915.
+ <used> *note 3.8(2): 2164, *note 3.9.1(2): 2295, *note P: 9915.
record_extension_part *note 3.9.1(2): 2294.
- used *note 3.4(2/2): 1622, *note P: 9851.
+ <used> *note 3.4(2/2): 1622, *note P: 9851.
record_representation_clause *note 13.5.1(2): 5552.
- used *note 13.1(2/1): 5348, *note P: 10577.
+ <used> *note 13.1(2/1): 5348, *note P: 10577.
record_type_definition *note 3.8(2): 2163.
- used *note 3.2.1(4/2): 1454, *note P: 9813.
+ <used> *note 3.2.1(4/2): 1454, *note P: 9813.
reentrant *note A(3/4): 5969.
reference
dangling *note 13.11.2(15.1/4): 5754.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 7453.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 7547, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 7453.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 7547, *note
A.18.5(17.6/3): 7549.
- in Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7945.
- in Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7857.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 7601, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7945.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7857.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 7601, *note
A.18.6(16.6/3): 7603.
- in Ada.Containers.Vectors *note A.18.2(34.4/3): 7365, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.4/3): 7365, *note
A.18.2(34.6/3): 7367.
- in Ada.Interrupts *note C.3.2(10): 8356.
- in Ada.Task_Attributes *note C.7.2(5): 8424.
+ <in> Ada.Interrupts *note C.3.2(10): 8356.
+ <in> Ada.Task_Attributes *note C.7.2(5): 8424.
reference discriminant *note 4.1.5(3/3): 2643.
reference object *note 4.1.5(3/3): 2642.
reference parameter passing *note 6.2(2): 3657.
reference type *note 4.1.5(3/3): 2641, *note N(36.1/3): 9720.
Reference_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7724, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7724, *note
A.18.8(58.4/3): 7726.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7808, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7808, *note
A.18.9(73.4/3): 7810.
Reference_Type
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 7451.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 7545.
- in Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7723.
- in Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7943.
- in Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7855.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 7599.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7807.
- in Ada.Containers.Vectors *note A.18.2(34.2/3): 7363.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 7451.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 7545.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7723.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7943.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7855.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 7599.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7807.
+ <in> Ada.Containers.Vectors *note A.18.2(34.2/3): 7363.
references *note 1.2(1/3): 1116.
Registered_Trade_Mark_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6188.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6188.
Reinitialize
- in Ada.Task_Attributes *note C.7.2(6): 8426.
+ <in> Ada.Task_Attributes *note C.7.2(6): 8426.
relation *note 4.4(3/4): 2893.
- used *note 4.4(2): 2873, *note P: 10045.
+ <used> *note 4.4(2): 2873, *note P: 10045.
relational operator *note 4.5.2(1): 2974.
relational_operator *note 4.5(3): 2940.
- used *note 4.4(2.2/3): 2891, *note 4.4(3/4): 2895, *note P: 10061.
+ <used> *note 4.4(2.2/3): 2891, *note 4.4(3/4): 2895, *note P:
+10061.
Relative_Deadline aspect *note D.2.6(9.2/3): 8530.
Relative_Deadline pragma *note J.15.12(2/3): 9415, *note L(29.2/3):
9607.
Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
7300.
relaxed mode *note G.2(1): 9084.
release
@@ -139104,46 +139638,47 @@ Remote_Call_Interface pragma *note E.2.3(3):
8889, *note L(30): 9609.
Remote_Types aspect *note E.2.2(4/3): 8877.
Remote_Types pragma *note E.2.2(3): 8873, *note L(31): 9612.
Remove_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8759.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8759.
Rename
- in Ada.Directories *note A.16(12/2): 7244.
+ <in> Ada.Directories *note A.16(12/2): 7244.
renamed entity *note 8.5(3): 4129.
renamed view *note 8.5(3): 4128.
renaming *note N(36.2/2): 9721.
renaming-as-body *note 8.5.4(1/3): 4158.
renaming-as-declaration *note 8.5.4(1/3): 4159.
renaming_declaration *note 8.5(2): 4121.
- used *note 3.1(3/3): 1362, *note P: 9794.
+ <used> *note 3.1(3/3): 1362, *note P: 9794.
rendezvous *note 9.5.2(25): 4453.
Replace
- in Ada.Containers.Hashed_Maps *note A.18.5(23/2): 7557.
- in Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7691, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(23/2): 7557.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7691, *note
A.18.8(53/2): 7717.
- in Ada.Containers.Ordered_Maps *note A.18.6(22/2): 7611.
- in Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7765, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(22/2): 7611.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7765, *note
A.18.9(66/2): 7799.
Replace_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 7448.
- in Ada.Containers.Hashed_Maps *note A.18.5(15/2): 7542.
- in Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7682.
- in Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7939.
- in Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7851.
- in Ada.Containers.Ordered_Maps *note A.18.6(14/2): 7596.
- in Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7756.
- in Ada.Containers.Vectors *note A.18.2(29/2): 7357, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 7448.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(15/2): 7542.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7682.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7939.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7851.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(14/2): 7596.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7756.
+ <in> Ada.Containers.Vectors *note A.18.2(29/2): 7357, *note
A.18.2(30/2): 7358.
- in Ada.Strings.Bounded *note A.4.4(27): 6413.
- in Ada.Strings.Unbounded *note A.4.5(21): 6470.
+ <in> Ada.Strings.Bounded *note A.4.4(27): 6413.
+ <in> Ada.Strings.Unbounded *note A.4.5(21): 6470.
Replace_Slice
- in Ada.Strings.Bounded *note A.4.4(58): 6434, *note A.4.4(59):
+ <in> Ada.Strings.Bounded *note A.4.4(58): 6434, *note A.4.4(59):
6435.
- in Ada.Strings.Fixed *note A.4.3(23): 6375, *note A.4.3(24): 6376.
- in Ada.Strings.Unbounded *note A.4.5(53): 6491, *note A.4.5(54):
+ <in> Ada.Strings.Fixed *note A.4.3(23): 6375, *note A.4.3(24):
+6376.
+ <in> Ada.Strings.Unbounded *note A.4.5(53): 6491, *note A.4.5(54):
6492.
Replenish
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8763.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8763.
Replicate
- in Ada.Strings.Bounded *note A.4.4(78): 6450, *note A.4.4(79):
+ <in> Ada.Strings.Bounded *note A.4.4(78): 6450, *note A.4.4(79):
6451, *note A.4.4(80): 6452.
representation
change of *note 13.6(1/3): 5602.
@@ -139180,7 +139715,7 @@ representation-oriented attributes
of a fixed point subtype *note A.5.4(1): 6844.
of a floating point subtype *note A.5.3(1): 6750.
representation_clause
- See aspect_clause *note 13.1(4/1): 5355.
+ <See> aspect_clause *note 13.1(4/1): 5355.
represented in canonical form *note A.5.3(10): 6764.
requested decimal precision
of a floating point type *note 3.5.7(4): 1913.
@@ -139188,7 +139723,7 @@ requeue *note 9.5.4(1): 4485.
requeue target *note 9.5.4(3/3): 4490.
requeue-with-abort *note 9.5.4(13): 4497.
requeue_statement *note 9.5.4(2/3): 4488.
- used *note 5.1(4/2): 3377, *note P: 10140.
+ <used> *note 5.1(4/2): 3377, *note P: 10140.
require overriding *note 3.9.3(6/4): 2352.
requires a completion *note 3.11.1(1/3): 2535, *note 3.11.1(6/3):
2539.
@@ -139209,41 +139744,41 @@ requires a completion *note 3.11.1(1/3): 2535,
*note 3.11.1(6/3):
task_declaration *note 9.1(9.3/2): 4278.
requires late initialization *note 3.3.1(8.1/2): 1582.
requires overriding
- [partial] *note 6.1.1(16/3): 3625.
+ [<partial>] *note 6.1.1(16/3): 3625.
Reraise_Occurrence
- in Ada.Exceptions *note 11.4.1(4/3): 5001.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 5001.
Reserve_Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(9/2): 7536.
- in Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7677.
- in Ada.Containers.Vectors *note A.18.2(20/2): 7348.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(9/2): 7536.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7677.
+ <in> Ada.Containers.Vectors *note A.18.2(20/2): 7348.
reserved interrupt *note C.3(2): 8322.
reserved word *note 2.9(2/3): 1346.
Reserved_128
- in Ada.Characters.Latin_1 *note A.3.3(17): 6141.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6141.
Reserved_129
- in Ada.Characters.Latin_1 *note A.3.3(17): 6142.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6142.
Reserved_132
- in Ada.Characters.Latin_1 *note A.3.3(17): 6145.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6145.
Reserved_153
- in Ada.Characters.Latin_1 *note A.3.3(19): 6166.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6166.
Reserved_Check
- [partial] *note C.3.1(10/3): 8333.
+ [<partial>] *note C.3.1(10/3): 8333.
Reset
- in Ada.Direct_IO *note A.8.4(8): 6912.
- in Ada.Numerics.Discrete_Random *note A.5.2(21): 6732, *note
+ <in> Ada.Direct_IO *note A.8.4(8): 6912.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(21): 6732, *note
A.5.2(24): 6736.
- in Ada.Numerics.Float_Random *note A.5.2(9): 6721, *note A.5.2(12):
-6724.
- in Ada.Sequential_IO *note A.8.1(8): 6882.
- in Ada.Streams.Stream_IO *note A.12.1(10): 7173.
- in Ada.Text_IO *note A.10.1(11): 6971.
+ <in> Ada.Numerics.Float_Random *note A.5.2(9): 6721, *note
+A.5.2(12): 6724.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6882.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 7173.
+ <in> Ada.Text_IO *note A.10.1(11): 6971.
resolution rules *note 1.1.2(26/3): 1020.
resolve
overload resolution *note 8.6(14): 4197.
restriction *note 13.12(4/2): 5814.
- used *note 13.12(3): 5813, *note L(32): 9616.
+ <used> *note 13.12(3): 5813, *note L(32): 9616.
restriction_parameter_argument *note 13.12(4.1/2): 5818.
- used *note 13.12(4/2): 5817, *note P: 10614.
+ <used> *note 13.12(4/2): 5817, *note P: 10614.
restrictions
Immediate_Reclamation *note H.4(10): 9221.
Max_Asynchronous_Select_Nesting *note D.7(18/1): 8633.
@@ -139319,66 +139854,66 @@ return object
simple_return_statement *note 6.5(6/2): 3803.
return statement *note 6.5(1/2): 3776.
return_subtype_indication *note 6.5(2.3/2): 3786.
- used *note 6.5(2.1/3): 3781, *note P: 10241.
+ <used> *note 6.5(2.1/3): 3781, *note P: 10241.
reverse iterator *note 5.5.2(4/3): 3506.
Reverse_Elements
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 7465.
- in Ada.Containers.Vectors *note A.18.2(54/2): 7389.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 7465.
+ <in> Ada.Containers.Vectors *note A.18.2(54/2): 7389.
Reverse_Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 7480.
- in Ada.Containers.Vectors *note A.18.2(70/2): 7405.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 7480.
+ <in> Ada.Containers.Vectors *note A.18.2(70/2): 7405.
Reverse_Find_Index
- in Ada.Containers.Vectors *note A.18.2(69/2): 7404.
+ <in> Ada.Containers.Vectors *note A.18.2(69/2): 7404.
Reverse_Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 7483.
- in Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7633.
- in Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7794.
- in Ada.Containers.Vectors *note A.18.2(74/2): 7408.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 7483.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7633.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7794.
+ <in> Ada.Containers.Vectors *note A.18.2(74/2): 7408.
Reverse_Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7895.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7895.
Reverse_Solidus
- in Ada.Characters.Latin_1 *note A.3.3(12): 6100.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6100.
reversible iterable container object *note 5.5.1(11/3): 3487.
reversible iterable container type *note 5.5.1(11/3): 3485.
reversible iterator object *note 5.5.1(6/3): 3474.
reversible iterator type *note 5.5.1(6/3): 3472.
Reversible_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3468.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3468.
Reviewable pragma *note H.3.1(3): 9200, *note L(33): 9619.
RI
- in Ada.Characters.Latin_1 *note A.3.3(17): 6154.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6154.
right parenthesis *note 2.1(15/3): 1202.
Right_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(22): 6203.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6203.
Right_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 6133.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6133.
Right_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 6084.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6084.
Right_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 6101.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 6101.
Ring_Above
- in Ada.Characters.Latin_1 *note A.3.3(22): 6191.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6191.
ripple effect *note 10.1.2(1.b/2): 4756.
root
of a tree *note A.18.10(2/4): 7823.
- in Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7848.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7848.
root library unit *note 10.1.1(10): 4740.
root node
of a tree *note A.18.10(2/4): 7824.
root type
of a class *note 3.4.1(2/2): 1654.
root_integer *note 3.5.4(14): 1851.
- [partial] *note 3.4.1(8): 1664.
+ [<partial>] *note 3.4.1(8): 1664.
root_real *note 3.5.6(3): 1900.
- [partial] *note 3.4.1(8): 1665.
+ [<partial>] *note 3.4.1(8): 1665.
Root_Storage_Pool
- in System.Storage_Pools *note 13.11(6/2): 5696.
+ <in> System.Storage_Pools *note 13.11(6/2): 5696.
Root_Storage_Pool_With_Subpools
- in System.Storage_Pools.Subpools *note 13.11.4(4/3): 5775.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(4/3): 5775.
Root_Stream_Type
- in Ada.Streams *note 13.13.1(3/2): 5860.
+ <in> Ada.Streams *note 13.13.1(3/2): 5860.
Root_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(5/3): 5776.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(5/3): 5776.
rooted at a type *note 3.4.1(2/2): 1655.
roots the subtree *note A.18.10(3/4): 7828.
Rosen trick *note 13.9.1(14.e/3): 5682.
@@ -139387,27 +139922,27 @@ Rotate_Left *note B.2(6): 8095.
Rotate_Right *note B.2(6): 8096.
Round attribute *note 3.5.10(12): 2002.
Round_Robin
- child of Ada.Dispatching *note D.2.5(4/2): 8514.
+ <child of> Ada.Dispatching *note D.2.5(4/2): 8514.
Round_Robin_Within_Priorities task dispatching policy *note
D.2.5(2/2): 8513.
Rounding attribute *note A.5.3(36): 6793.
RPC
- child of System *note E.5(3): 8950.
+ <child of> System *note E.5(3): 8950.
RPC-receiver *note E.5(21): 8961.
RPC_Receiver
- in System.RPC *note E.5(11): 8958.
+ <in> System.RPC *note E.5(11): 8958.
RS
- in Ada.Characters.Latin_1 *note A.3.3(6): 6073.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6073.
run-time check
- See language-defined check *note 11.5(2/3): 5046.
+ <See> language-defined check *note 11.5(2/3): 5046.
run-time error *note 1.1.2(30): 1036, *note 1.1.5(6): 1104, *note
11.5(2/3): 5047, *note 11.6(1/3): 5086.
run-time polymorphism *note 3.9.2(1/2): 2308.
run-time semantics *note 1.1.2(30): 1035.
run-time type
- See tag *note 3.9(3): 2243.
+ <See> tag *note 3.9(3): 2243.
running a program
- See program execution *note 10.2(1): 4843.
+ <See> program execution *note 10.2(1): 4843.
running task *note D.2.1(6/2): 8479.
runtime name text
entity with *note C.5(1.1/4): 8367.
@@ -139438,26 +139973,26 @@ satisfies
satisfies the predicates
of a subtype *note 3.2.4(29.2/4): 1522.
Saturday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4559.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4559.
Save
- in Ada.Numerics.Discrete_Random *note A.5.2(24): 6735.
- in Ada.Numerics.Float_Random *note A.5.2(12): 6723.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(24): 6735.
+ <in> Ada.Numerics.Float_Random *note A.5.2(12): 6723.
Save_Occurrence
- in Ada.Exceptions *note 11.4.1(6/2): 5008.
+ <in> Ada.Exceptions *note 11.4.1(6/2): 5008.
scalar type *note 3.2(3): 1406, *note 3.5(1): 1672, *note N(37): 9722.
scalar_constraint *note 3.2.2(6): 1483.
- used *note 3.2.2(5): 1481, *note P: 9824.
+ <used> *note 3.2.2(5): 1481, *note P: 9824.
scale
of a decimal fixed point subtype *note 3.5.10(11): 2000, *note
K.2(216): 9454.
Scale attribute *note 3.5.10(11): 1999.
Scaling attribute *note A.5.3(27): 6784.
SCHAR_MAX
- in Interfaces.C *note B.3(6): 8109.
+ <in> Interfaces.C *note B.3(6): 8109.
SCHAR_MIN
- in Interfaces.C *note B.3(6): 8108.
+ <in> Interfaces.C *note B.3(6): 8108.
SCI
- in Ada.Characters.Latin_1 *note A.3.3(19): 6167.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6167.
scope
informal definition *note 3.1(8): 1377.
of (a view of) an entity *note 8.2(11): 4055.
@@ -139467,48 +140002,48 @@ scope
of an aspect_specification *note 8.2(10.1/3): 4053.
of an attribute_definition_clause *note 8.2(10.1/3): 4052.
Search_Type
- in Ada.Directories *note A.16(31/2): 7262.
+ <in> Ada.Directories *note A.16(31/2): 7262.
Second
- in Ada.Calendar.Formatting *note 9.6.1(26/2): 4571.
-Second_Duration subtype of Day_Duration
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4565.
-Second_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4564.
+ <in> Ada.Calendar.Formatting *note 9.6.1(26/2): 4571.
+Second_Duration <subtype of> Day_Duration
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4565.
+Second_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4564.
Seconds
- in Ada.Calendar *note 9.6(13): 4527.
- in Ada.Real_Time *note D.8(14/2): 8671.
+ <in> Ada.Calendar *note 9.6(13): 4527.
+ <in> Ada.Real_Time *note D.8(14/2): 8671.
Seconds_Count
- in Ada.Real_Time *note D.8(15): 8673.
+ <in> Ada.Real_Time *note D.8(15): 8673.
Seconds_Of
- in Ada.Calendar.Formatting *note 9.6.1(28/2): 4573.
+ <in> Ada.Calendar.Formatting *note 9.6.1(28/2): 4573.
Section_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6181.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6181.
secure systems *note H(1/2): 9189.
select an entry call
from an entry queue *note 9.5.3(13): 4477, *note 9.5.3(16): 4478.
immediately *note 9.5.3(8): 4474.
select_alternative *note 9.7.1(4): 4601.
- used *note 9.7.1(2): 4597, *note P: 10400.
+ <used> *note 9.7.1(2): 4597, *note P: 10400.
select_statement *note 9.7(2): 4586.
- used *note 5.1(5/2): 3389, *note P: 10151.
+ <used> *note 5.1(5/2): 3389, *note P: 10151.
selected_component *note 4.1.3(2): 2603.
- used *note 4.1(2/3): 2546, *note P: 9976.
+ <used> *note 4.1(2/3): 2546, *note P: 9976.
selection
of an entry caller *note 9.5.2(24): 4452.
selective_accept *note 9.7.1(2): 4593.
- used *note 9.7(2): 4587, *note P: 10393.
+ <used> *note 9.7(2): 4587, *note P: 10393.
selector_name *note 4.1.3(3): 2606.
- used *note 3.7.1(3): 2142, *note 4.1.3(2): 2605, *note 4.3.1(5):
+ <used> *note 3.7.1(3): 2142, *note 4.1.3(2): 2605, *note 4.3.1(5):
2714, *note 6.4(5): 3733, *note 12.3(4): 5153, *note 12.7(3.1/2): 5332,
*note P: 10020.
semantic dependence
of one compilation unit upon another *note 10.1.1(26/2): 4751.
semicolon *note 2.1(15/3): 1215.
- in Ada.Characters.Latin_1 *note A.3.3(10): 6093.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 6093.
separate compilation *note 10.1(1): 4700.
safe *note 10(3.b): 4698.
Separate_Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.2/3): 8729.
+ <in> Ada.Execution_Time *note D.14(9.2/3): 8729.
separator *note 2.2(3/2): 1234.
separator_line *note 2.1(12/2): 1188.
separator_paragraph *note 2.1(12.1/2): 1189.
@@ -139516,7 +140051,7 @@ separator_space *note 2.1(11/2): 1187.
sequence of characters
of a string_literal *note 2.6(5): 1307.
sequence_of_statements *note 5.1(2/3): 3360.
- used *note 5.3(2): 3424, *note 5.4(3): 3435, *note 5.5(2): 3448,
+ <used> *note 5.3(2): 3424, *note 5.4(3): 3435, *note 5.5(2): 3448,
*note 9.7.1(2): 4598, *note 9.7.1(5): 4607, *note 9.7.1(6): 4610, *note
9.7.2(3/2): 4624, *note 9.7.3(2): 4632, *note 9.7.4(3): 4639, *note
9.7.4(5): 4644, *note 11.2(2): 4946, *note 11.2(3): 4953, *note P:
@@ -139526,7 +140061,7 @@ sequential
sequential access *note A.8(2): 6870.
sequential file *note A.8(1/2): 6867.
Sequential_IO
- child of Ada *note A.8.1(2): 6875.
+ <child of> Ada *note A.8.1(2): 6875.
service
an entry queue *note 9.5.3(13): 4476.
set
@@ -139534,75 +140069,75 @@ set
group budget object *note D.14.2(15/2): 8775.
termination handler *note C.7.3(9/2): 8446.
timing event object *note D.15(9/2): 8793.
- in Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7668.
- in Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7744.
- in Ada.Environment_Variables *note A.17(6/2): 7308.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7668.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7744.
+ <in> Ada.Environment_Variables *note A.17(6/2): 7308.
set container *note A.18.7(1/2): 7644.
Set_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(12.1/2): 6403.
+ <in> Ada.Strings.Bounded *note A.4.4(12.1/2): 6403.
Set_Col
- in Ada.Text_IO *note A.10.1(35): 7017.
+ <in> Ada.Text_IO *note A.10.1(35): 7017.
Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
8817.
Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 8526.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 8526.
Set_Dependents_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 8436.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 8436.
Set_Directory
- in Ada.Directories *note A.16(6/2): 7238.
+ <in> Ada.Directories *note A.16(6/2): 7238.
Set_Error
- in Ada.Text_IO *note A.10.1(15): 6979.
+ <in> Ada.Text_IO *note A.10.1(15): 6979.
Set_Exit_Status
- in Ada.Command_Line *note A.15(9): 7233.
+ <in> Ada.Command_Line *note A.15(9): 7233.
Set_False
- in Ada.Synchronous_Task_Control *note D.10(4): 8690.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8690.
Set_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8767.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8742.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8788.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8767.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8742.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8788.
Set_Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9153,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9153,
*note G.3.2(28/2): 9166.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9018.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9018.
Set_Index
- in Ada.Direct_IO *note A.8.4(14): 6923.
- in Ada.Streams.Stream_IO *note A.12.1(22): 7185.
+ <in> Ada.Direct_IO *note A.8.4(14): 6923.
+ <in> Ada.Streams.Stream_IO *note A.12.1(22): 7185.
Set_Input
- in Ada.Text_IO *note A.10.1(15): 6977.
+ <in> Ada.Text_IO *note A.10.1(15): 6977.
Set_Iterator_Interfaces
- in Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7673.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7749.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7673.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7749.
Set_Length
- in Ada.Containers.Vectors *note A.18.2(22/2): 7350.
+ <in> Ada.Containers.Vectors *note A.18.2(22/2): 7350.
Set_Line
- in Ada.Text_IO *note A.10.1(36): 7019.
+ <in> Ada.Text_IO *note A.10.1(36): 7019.
Set_Line_Length
- in Ada.Text_IO *note A.10.1(23): 6995.
+ <in> Ada.Text_IO *note A.10.1(23): 6995.
Set_Mode
- in Ada.Streams.Stream_IO *note A.12.1(24): 7188.
+ <in> Ada.Streams.Stream_IO *note A.12.1(24): 7188.
Set_Output
- in Ada.Text_IO *note A.10.1(15): 6978.
+ <in> Ada.Text_IO *note A.10.1(15): 6978.
Set_Page_Length
- in Ada.Text_IO *note A.10.1(24): 6997.
+ <in> Ada.Text_IO *note A.10.1(24): 6997.
Set_Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(10/3): 5780.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(10/3): 5780.
Set_Priority
- in Ada.Dynamic_Priorities *note D.5.1(4): 8572.
+ <in> Ada.Dynamic_Priorities *note D.5.1(4): 8572.
Set_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8517.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 8517.
Set_Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9152,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 9152,
*note G.3.2(28/2): 9165.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9016.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 9016.
Set_Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 8438.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 8438.
Set_True
- in Ada.Synchronous_Task_Control *note D.10(4): 8689.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8689.
Set_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(11.1/2): 6465.
+ <in> Ada.Strings.Unbounded *note A.4.5(11.1/2): 6465.
Set_Value
- in Ada.Task_Attributes *note C.7.2(6): 8425.
+ <in> Ada.Task_Attributes *note C.7.2(6): 8425.
shared passive library unit *note E.2(4/3): 8850, *note E.2.1(4/3):
8859.
shared variable
@@ -139614,110 +140149,114 @@ Shift_Left *note B.2(6): 8092.
Shift_Right *note B.2(6): 8093.
Shift_Right_Arithmetic *note B.2(6): 8094.
short
- in Interfaces.C *note B.3(7): 8112.
+ <in> Interfaces.C *note B.3(7): 8112.
short-circuit control form *note 4.5.1(1): 2954.
Short_Float *note 3.5.7(16): 1932.
Short_Integer *note 3.5.4(25): 1871.
SI
- in Ada.Characters.Latin_1 *note A.3.3(5): 6058.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6058.
signal
as defined between actions *note 9.10(2): 4689.
- See interrupt *note C.3(1/3): 8314.
+ <See> interrupt *note C.3(1/3): 8314.
signal (an exception)
- See raise *note 11(1/3): 4921.
+ <See> raise *note 11(1/3): 4921.
signal handling
example *note 9.7.4(10): 4648.
signed integer type *note 3.5.4(1): 1825.
signed_char
- in Interfaces.C *note B.3(8): 8114.
+ <in> Interfaces.C *note B.3(8): 8114.
signed_integer_type_definition *note 3.5.4(3): 1831.
- used *note 3.5.4(2): 1829, *note P: 9861.
+ <used> *note 3.5.4(2): 1829, *note P: 9861.
Signed_Zeros attribute *note A.5.3(13): 6771.
simple entry call *note 9.5.3(1): 4458.
simple name
of a file *note A.16(47/2): 7282.
Simple_Barriers restriction *note D.7(10.11/3): 8619.
simple_expression *note 4.4(4): 2907.
- used *note 3.5(3): 1681, *note 3.5.4(3): 1832, *note 3.5.7(3):
+ <used> *note 3.5(3): 1681, *note 3.5.4(3): 1832, *note 3.5.7(3):
1912, *note 3.5.9(5/4): 1954, *note 4.4(2.2/3): 2890, *note 4.4(3.2/4):
2904, *note 4.4(3/4): 2894, *note 11.3(2.1/4): 4969, *note 13.5.1(5):
5564, *note 13.5.1(6): 5566, *note J.3(2/4): 9263, *note P: 10063.
Simple_Name
- in Ada.Directories *note A.16(16/2): 7247, *note A.16(38/2): 7267.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
+ <in> Ada.Directories *note A.16(16/2): 7247, *note A.16(38/2):
+7267.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
7297.
simple_return_statement *note 6.5(2/2): 3777.
- used *note 5.1(4/2): 3375, *note P: 10138.
+ <used> *note 5.1(4/2): 3375, *note P: 10138.
simple_statement *note 5.1(4/2): 3369.
- used *note 5.1(3): 3366, *note P: 10130.
+ <used> *note 5.1(3): 3366, *note P: 10130.
Sin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9041.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6684.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6684.
single
class expected type *note 8.6(27/2): 4212.
single entry *note 9.5.2(20): 4445.
Single_Precision_Complex_Types
- in Interfaces.Fortran *note B.5(8): 8288.
+ <in> Interfaces.Fortran *note B.5(8): 8288.
single_protected_declaration *note 9.4(3/3): 4320.
- used *note 3.3.1(2/3): 1572, *note P: 9844.
+ <used> *note 3.3.1(2/3): 1572, *note P: 9844.
single_task_declaration *note 9.1(3/3): 4255.
- used *note 3.3.1(2/3): 1571, *note P: 9843.
+ <used> *note 3.3.1(2/3): 1571, *note P: 9843.
Sinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9049.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6700.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6700.
size
of an object *note 13.1(7/2): 5357.
- in Ada.Direct_IO *note A.8.4(15): 6925.
- in Ada.Directories *note A.16(26/2): 7258, *note A.16(41/2): 7270.
- in Ada.Streams.Stream_IO *note A.12.1(23): 7187.
+ <in> Ada.Direct_IO *note A.8.4(15): 6925.
+ <in> Ada.Directories *note A.16(26/2): 7258, *note A.16(41/2):
+7270.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 7187.
Size (object) aspect *note 13.3(41): 5490.
Size (subtype) aspect *note 13.3(48): 5497.
Size attribute *note 13.3(40): 5486, *note 13.3(45): 5493.
Size clause *note 13.3(7/2): 5444, *note 13.3(41): 5488, *note
13.3(48): 5495.
size_t
- in Interfaces.C *note B.3(13): 8121.
+ <in> Interfaces.C *note B.3(13): 8121.
Skip_Line
- in Ada.Text_IO *note A.10.1(29): 7006.
+ <in> Ada.Text_IO *note A.10.1(29): 7006.
Skip_Page
- in Ada.Text_IO *note A.10.1(32): 7011.
+ <in> Ada.Text_IO *note A.10.1(32): 7011.
slice *note 4.1.2(2): 2592.
- used *note 4.1(2/3): 2545, *note P: 9975.
- in Ada.Strings.Bounded *note A.4.4(28): 6414.
- in Ada.Strings.Unbounded *note A.4.5(22): 6471.
+ <used> *note 4.1(2/3): 2545, *note P: 9975.
+ <in> Ada.Strings.Bounded *note A.4.4(28): 6414.
+ <in> Ada.Strings.Unbounded *note A.4.5(22): 6471.
small
of a fixed point type *note 3.5.9(8/2): 1960.
Small aspect *note 3.5.10(2/1): 1988.
Small attribute *note 3.5.10(2/1): 1984.
Small clause *note 3.5.10(2/1): 1986, *note 13.3(7/2): 5447.
SO
- in Ada.Characters.Latin_1 *note A.3.3(5): 6057.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6057.
Soft_Hyphen
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6187.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6187.
SOH
- in Ada.Characters.Latin_1 *note A.3.3(5): 6044.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6044.
solidus *note 2.1(15/3): 1212.
- in Ada.Characters.Latin_1 *note A.3.3(8): 6091.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6091.
Solve
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9177.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9135.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 9177.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 9135.
Sort
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 7486.
- in Ada.Containers.Vectors *note A.18.2(77/2): 7411.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 7486.
+ <in> Ada.Containers.Vectors *note A.18.2(77/2): 7411.
SOS
- in Ada.Characters.Latin_1 *note A.3.3(19): 6165.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6165.
SPA
- in Ada.Characters.Latin_1 *note A.3.3(18): 6163.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6163.
Space
- in Ada.Characters.Latin_1 *note A.3.3(8): 6075.
- in Ada.Strings *note A.4.1(4/2): 6318.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 6075.
+ <in> Ada.Strings *note A.4.1(4/2): 6318.
special file *note A.16(45/2): 7277.
special graphic character
a category of Character *note A.3.2(32): 6038.
Special_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6521.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6521.
Specialized Needs Annexes *note 1.1.2(7): 1005.
specifiable
of Address for entries *note J.7.1(6): 9279.
@@ -139749,7 +140288,7 @@ specific postcondition expression *note 6.1.1(4/3):
3615.
specific precondition expression *note 6.1.1(2/3): 3607.
specific type *note 3.4.1(3/2): 1656.
Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 8439.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 8439.
specified
of an aspect of representation of an entity *note 13.1(17): 5373.
of an operational aspect of an entity *note 13.1(18.1/1): 5375.
@@ -139757,37 +140296,38 @@ specified (not!) *note 1.1.3(18): 1080, *note
M.2(1.a): 9650.
specified as independently addressable *note C.6(8.1/4): 8391.
specified discriminant *note 3.7(18): 2121.
Splice
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 7468,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 7468,
*note A.18.3(31/2): 7469, *note A.18.3(32/2): 7470.
Splice_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7883, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7883, *note
A.18.10(58/3): 7884.
Splice_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7881, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7881, *note
A.18.10(56/3): 7882.
Split
- in Ada.Calendar *note 9.6(14): 4528.
- in Ada.Calendar.Formatting *note 9.6.1(29/2): 4574, *note
+ <in> Ada.Calendar *note 9.6(14): 4528.
+ <in> Ada.Calendar.Formatting *note 9.6.1(29/2): 4574, *note
9.6.1(32/2): 4577, *note 9.6.1(33/2): 4578, *note 9.6.1(34/2): 4579.
- in Ada.Execution_Time *note D.14(8/2): 8726.
- in Ada.Real_Time *note D.8(16): 8674.
+ <in> Ada.Execution_Time *note D.14(8/2): 8726.
+ <in> Ada.Real_Time *note D.8(16): 8674.
Sqrt
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 9037.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6680.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6680.
squirrel away *note 8.5.4(8.g): 4171, *note 13.9.1(14.e/3): 5681.
SS2
- in Ada.Characters.Latin_1 *note A.3.3(17): 6155.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6155.
SS3
- in Ada.Characters.Latin_1 *note A.3.3(17): 6156.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6156.
SSA
- in Ada.Characters.Latin_1 *note A.3.3(17): 6147.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6147.
ST
- in Ada.Characters.Latin_1 *note A.3.3(19): 6169.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 6169.
stand-alone constant *note 3.3.1(23/3): 1600.
corresponding to a formal object of mode in *note 12.4(10/2): 5212.
stand-alone object *note 3.3.1(1/3): 1552.
- [partial] *note 12.4(10/2): 5213.
+ [<partial>] *note 12.4(10/2): 5213.
stand-alone variable *note 3.3.1(23/3): 1601.
Standard *note A.1(4): 5972.
standard error file *note A.10(6): 6946.
@@ -139796,20 +140336,20 @@ standard mode *note 1.1.5(11): 1112.
standard output file *note A.10(5): 6945.
standard storage pool *note 13.11(17): 5717.
Standard_Error
- in Ada.Text_IO *note A.10.1(16): 6982, *note A.10.1(19): 6989.
+ <in> Ada.Text_IO *note A.10.1(16): 6982, *note A.10.1(19): 6989.
Standard_Input
- in Ada.Text_IO *note A.10.1(16): 6980, *note A.10.1(19): 6987.
+ <in> Ada.Text_IO *note A.10.1(16): 6980, *note A.10.1(19): 6987.
Standard_Output
- in Ada.Text_IO *note A.10.1(16): 6981, *note A.10.1(19): 6988.
+ <in> Ada.Text_IO *note A.10.1(16): 6981, *note A.10.1(19): 6988.
Start_Search
- in Ada.Directories *note A.16(32/2): 7263.
+ <in> Ada.Directories *note A.16(32/2): 7263.
State
- in Ada.Numerics.Discrete_Random *note A.5.2(23): 6734.
- in Ada.Numerics.Float_Random *note A.5.2(11): 6722.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(23): 6734.
+ <in> Ada.Numerics.Float_Random *note A.5.2(11): 6722.
statement *note 5.1(3): 3364.
- used *note 5.1(2/3): 3362, *note P: 10127.
+ <used> *note 5.1(2/3): 3362, *note P: 10127.
statement_identifier *note 5.1(8): 3393.
- used *note 5.1(7): 3392, *note 5.5(2): 3446, *note 5.6(2): 3520,
+ <used> *note 5.1(7): 3392, *note 5.5(2): 3446, *note 5.6(2): 3520,
*note P: 10166.
static *note 3.3.2(1.a/3): 1607, *note 4.9(1): 3329.
constant *note 4.9(24): 3335.
@@ -139840,7 +140380,7 @@ statically compatible
for two subtypes *note 4.9.1(5/3): 3358.
statically deeper *note 3.10.2(4): 2468, *note 3.10.2(17): 2477.
statically determined tag *note 3.9.2(1/2): 2305.
- [partial] *note 3.9.2(15): 2330, *note 3.9.2(19): 2334.
+ [<partial>] *note 3.9.2(15): 2330, *note 3.9.2(19): 2334.
statically matching
effect on subtype-specific aspects *note 13.1(14): 5372.
for constraints *note 4.9.1(1/2): 3353.
@@ -139855,12 +140395,12 @@ statically matching
statically tagged *note 3.9.2(4/2): 2323.
statically unevaluated *note 4.9(32.1/3): 3348.
Status_Error
- in Ada.Direct_IO *note A.8.4(18): 6927.
- in Ada.Directories *note A.16(43/2): 7272.
- in Ada.IO_Exceptions *note A.13(4): 7214.
- in Ada.Sequential_IO *note A.8.1(15): 6892.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7190.
- in Ada.Text_IO *note A.10.1(85): 7104.
+ <in> Ada.Direct_IO *note A.8.4(18): 6927.
+ <in> Ada.Directories *note A.16(43/2): 7272.
+ <in> Ada.IO_Exceptions *note A.13(4): 7214.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6892.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7190.
+ <in> Ada.Text_IO *note A.10.1(85): 7104.
storage deallocation
unchecked *note 13.11.2(1): 5738.
storage element *note 13.3(8): 5459.
@@ -139878,38 +140418,38 @@ storage pool element *note 13.11(11): 5702.
storage pool that supports subpools *note 13.11.4(18/3): 5791.
storage pool type *note 13.11(11): 5700.
Storage_Array
- in System.Storage_Elements *note 13.7.1(5): 5636.
+ <in> System.Storage_Elements *note 13.7.1(5): 5636.
Storage_Check *note 11.5(23): 5075.
- [partial] *note 11.1(6): 4939, *note 13.3(67): 5506, *note
+ [<partial>] *note 11.1(6): 4939, *note 13.3(67): 5506, *note
13.11(17): 5718, *note D.7(17/1): 8630, *note D.7(18/1): 8635, *note
D.7(19/1): 8640.
-Storage_Count subtype of Storage_Offset
- in System.Storage_Elements *note 13.7.1(4): 5634.
+Storage_Count <subtype of> Storage_Offset
+ <in> System.Storage_Elements *note 13.7.1(4): 5634.
Storage_Element
- in System.Storage_Elements *note 13.7.1(5): 5635.
+ <in> System.Storage_Elements *note 13.7.1(5): 5635.
Storage_Elements
- child of System *note 13.7.1(2/2): 5632.
+ <child of> System *note 13.7.1(2/2): 5632.
Storage_Error
raised by failure of run-time check *note 4.8(14): 3321, *note
8.5.4(8.1/1): 4173, *note 11.1(4): 4936, *note 11.1(6): 4941, *note
11.5(23): 5076, *note 13.3(67): 5508, *note 13.11(17): 5720, *note
13.11(18/4): 5723, *note A.7(14/3): 6865, *note D.7(17/1): 8632, *note
D.7(18/1): 8637, *note D.7(19.3/3): 8648, *note D.7(19/1): 8642.
- in Standard *note A.1(46): 5989.
+ <in> Standard *note A.1(46): 5989.
Storage_IO
- child of Ada *note A.9(3): 6937.
+ <child of> Ada *note A.9(3): 6937.
Storage_Offset
- in System.Storage_Elements *note 13.7.1(3): 5633.
+ <in> System.Storage_Elements *note 13.7.1(3): 5633.
Storage_Pool aspect *note 13.11(15): 5714.
Storage_Pool attribute *note 13.11(13): 5706.
Storage_Pool clause *note 13.3(7/2): 5449, *note 13.11(15): 5711.
storage_pool_indicator *note 13.11.3(3.1/4): 5764.
- used *note 13.11.3(3/3): 5763, *note L(8.3/3): 9507.
+ <used> *note 13.11.3(3/3): 5763, *note L(8.3/3): 9507.
Storage_Pools
- child of System *note 13.11(5): 5695.
+ <child of> System *note 13.11(5): 5695.
Storage_Size
- in System.Storage_Pools *note 13.11(9): 5699.
- in System.Storage_Pools.Subpools *note 13.11.4(16/3): 5786.
+ <in> System.Storage_Pools *note 13.11(9): 5699.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(16/3): 5786.
Storage_Size (access) aspect *note 13.11(15): 5716.
Storage_Size (task) aspect *note 13.3(65.2/3): 5505.
Storage_Size attribute *note 13.3(60/3): 5503, *note 13.11(14): 5708,
@@ -139917,62 +140457,62 @@ Storage_Size attribute *note 13.3(60/3): 5503,
*note 13.11(14): 5708,
Storage_Size clause *note 13.3(7/2): 5450, *note 13.11(15): 5712.
Storage_Size pragma *note J.15.4(2/3): 9319, *note L(35.1/3): 9624.
Storage_Unit
- in System *note 13.7(13): 5617.
+ <in> System *note 13.7(13): 5617.
stream *note 13.13(1): 5855, *note N(37.2/3): 9724.
- in Ada.Streams.Stream_IO *note A.12.1(13): 7180.
- in Ada.Text_IO.Text_Streams *note A.12.2(4): 7205.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 7208.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 7211.
+ <in> Ada.Streams.Stream_IO *note A.12.1(13): 7180.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(4): 7205.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 7208.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 7211.
stream file *note A.8(1/2): 6869.
stream type *note 13.13(1): 5856.
stream-oriented attributes *note 13.13.2(1/3): 5868.
Stream_Access
- in Ada.Streams.Stream_IO *note A.12.1(4): 7164.
- in Ada.Text_IO.Text_Streams *note A.12.2(3): 7204.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 7207.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 7210.
+ <in> Ada.Streams.Stream_IO *note A.12.1(4): 7164.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(3): 7204.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 7207.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 7210.
Stream_Element
- in Ada.Streams *note 13.13.1(4/1): 5861.
+ <in> Ada.Streams *note 13.13.1(4/1): 5861.
Stream_Element_Array
- in Ada.Streams *note 13.13.1(4/1): 5864.
-Stream_Element_Count subtype of Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5863.
+ <in> Ada.Streams *note 13.13.1(4/1): 5864.
+Stream_Element_Count <subtype of> Stream_Element_Offset
+ <in> Ada.Streams *note 13.13.1(4/1): 5863.
Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5862.
+ <in> Ada.Streams *note 13.13.1(4/1): 5862.
Stream_IO
- child of Ada.Streams *note A.12.1(3/3): 7163.
+ <child of> Ada.Streams *note A.12.1(3/3): 7163.
Stream_Size aspect *note 13.13.2(1.5/2): 5873.
Stream_Size attribute *note 13.13.2(1.2/3): 5871.
Stream_Size clause *note 13.3(7/2): 5451.
Streams
- child of Ada *note 13.13.1(2): 5858.
+ <child of> Ada *note 13.13.1(2): 5858.
strict mode *note G.2(1): 9083.
strict weak ordering *note A.18(5/3): 7321.
String
- in Standard *note A.1(37/3): 5983.
+ <in> Standard *note A.1(37/3): 5983.
string type *note 3.6.3(1): 2088.
String_Access
- in Ada.Strings.Unbounded *note A.4.5(7): 6460.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 6460.
string_element *note 2.6(3): 1305.
- used *note 2.6(2): 1304, *note P: 9771.
+ <used> *note 2.6(2): 1304, *note P: 9771.
string_literal *note 2.6(2): 1303.
- used *note 4.4(7/3): 2923, *note 6.1(9): 3564, *note P: 10086.
+ <used> *note 4.4(7/3): 2923, *note 6.1(9): 3564, *note P: 10086.
Strings
- child of Ada *note A.4.1(3): 6317.
- child of Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6647.
- child of Interfaces.C *note B.3.1(3): 8175.
+ <child of> Ada *note A.4.1(3): 6317.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6647.
+ <child of> Interfaces.C *note B.3.1(3): 8175.
Strlen
- in Interfaces.C.Strings *note B.3.1(17): 8189.
+ <in> Interfaces.C.Strings *note B.3.1(17): 8189.
structure
- See record type *note 3.8(1): 2162.
+ <See> record type *note 3.8(1): 2162.
STS
- in Ada.Characters.Latin_1 *note A.3.3(18): 6160.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 6160.
STX
- in Ada.Characters.Latin_1 *note A.3.3(5): 6045.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6045.
SUB
- in Ada.Characters.Latin_1 *note A.3.3(6): 6069.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6069.
Sub_Second
- in Ada.Calendar.Formatting *note 9.6.1(27/2): 4572.
+ <in> Ada.Calendar.Formatting *note 9.6.1(27/2): 4572.
subaggregate
of an array_aggregate *note 4.3.3(6): 2768.
subcomponent *note 3.2(6/2): 1414.
@@ -139980,30 +140520,30 @@ subpool *note 13.11.4(18/3): 5787.
subpool access type *note 13.11.4(22/3): 5793.
subpool handle *note 13.11.4(18/3): 5789.
Subpool_Handle
- in System.Storage_Pools.Subpools *note 13.11.4(6/3): 5777.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(6/3): 5777.
subpool_specification *note 4.8(2.1/3): 3284.
- used *note 4.8(2/3): 3280, *note P: 10121.
+ <used> *note 4.8(2/3): 3280, *note P: 10121.
Subpools
- child of System.Storage_Pools *note 13.11.4(3/3): 5774.
+ <child of> System.Storage_Pools *note 13.11.4(3/3): 5774.
subprogram *note 6(1): 3534, *note N(37.3/2): 9725.
abstract *note 3.9.3(3/2): 2351.
subprogram call *note 6.4(1): 3720.
subprogram instance *note 12.3(13): 5173.
subprogram_body *note 6.3(2/3): 3670.
- used *note 3.11(6): 2521, *note 9.4(8/4): 4343, *note 10.1.1(7):
+ <used> *note 3.11(6): 2521, *note 9.4(8/4): 4343, *note 10.1.1(7):
4728, *note P: 10442.
subprogram_body_stub *note 10.1.3(3/3): 4787.
- used *note 10.1.3(2): 4783, *note P: 10454.
+ <used> *note 10.1.3(2): 4783, *note P: 10454.
subprogram_declaration *note 6.1(2/3): 3540.
- used *note 3.1(3/3): 1357, *note 9.4(5/1): 4330, *note 9.4(8/4):
+ <used> *note 3.1(3/3): 1357, *note 9.4(5/1): 4330, *note 9.4(8/4):
4342, *note 10.1.1(5): 4719, *note P: 10358.
subprogram_default *note 12.6(3/2): 5304.
- used *note 12.6(2.1/3): 5298, *note 12.6(2.2/3): 5302, *note P:
+ <used> *note 12.6(2.1/3): 5298, *note 12.6(2.2/3): 5302, *note P:
10562.
subprogram_renaming_declaration *note 8.5.4(2/3): 4160.
- used *note 8.5(2): 4125, *note 10.1.1(6): 4726, *note P: 10441.
+ <used> *note 8.5(2): 4125, *note 10.1.1(6): 4726, *note P: 10441.
subprogram_specification *note 6.1(4/2): 3544.
- used *note 3.9.3(1.1/3): 2346, *note 6.1(2/3): 3542, *note
+ <used> *note 3.9.3(1.1/3): 2346, *note 6.1(2/3): 3542, *note
6.3(2/3): 3672, *note 8.5.4(2/3): 4162, *note 10.1.3(3/3): 4789, *note
12.1(3/3): 5108, *note 12.6(2.1/3): 5297, *note 12.6(2.2/3): 5301, *note
P: 10188.
@@ -140012,17 +140552,17 @@ subtree
node which roots *note A.18.10(3/4): 7829.
of a tree *note A.18.10(3/4): 7827.
Subtree_Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7844.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7844.
subtype *note 3.2(8/2): 1421, *note N(38/3): 9726.
constraint of *note 3.2(8/2): 1425.
of a generic formal object *note 12.4(10.c): 5214.
type of *note 3.2(8/2): 1423.
values belonging to *note 3.2(8/2): 1428.
subtype (of an object)
- See actual subtype of an object *note 3.3(23/3): 1544.
- See actual subtype of an object *note 3.3.1(9/2): 1586.
+ <See> actual subtype of an object *note 3.3(23/3): 1544.
+ <See> actual subtype of an object *note 3.3.1(9/2): 1586.
subtype conformance *note 6.3.1(17/3): 3703, *note 12.3(11.j/3): 5167.
- [partial] *note 3.10.2(35/2): 2499, *note 9.5.4(17): 4498.
+ [<partial>] *note 3.10.2(35/2): 2499, *note 9.5.4(17): 4498.
required *note 3.9.2(10/2): 2327, *note 3.10.2(33/3): 2495, *note
4.6(24.20/3): 3190, *note 8.5.1(4.3/2): 4141, *note 8.5.4(5/3): 4170,
*note 9.1(9.7/2): 4280, *note 9.1(9.8/2): 4281, *note 9.4(11.6/2): 4356,
@@ -140033,22 +140573,22 @@ subtype conversion
bounds of a fixed point type *note 3.5.9(14.a.1/1): 1968.
bounds of a floating point type *note 3.5.7(11.a.1/1): 1927.
bounds of signed integer type *note 3.5.4(9.a.1/1): 1844.
- See type conversion *note 4.6(1/3): 3149.
- See also implicit subtype conversion *note 4.6(1/3): 3153.
+ <See> type conversion *note 4.6(1/3): 3149.
+ <See also> implicit subtype conversion *note 4.6(1/3): 3153.
subtype-specific
attribute_definition_clause *note 13.3(7.a): 5458.
of a representation item *note 13.1(8/3): 5365.
of an aspect *note 13.1(8/3): 5367.
subtype_declaration *note 3.2.2(2/3): 1470.
- used *note 3.1(3/3): 1354, *note P: 9786.
+ <used> *note 3.1(3/3): 1354, *note P: 9786.
subtype_indication *note 3.2.2(3/2): 1474.
- used *note 3.2.2(2/3): 1472, *note 3.3.1(2/3): 1560, *note
+ <used> *note 3.2.2(2/3): 1472, *note 3.3.1(2/3): 1560, *note
3.4(2/2): 1620, *note 3.6(6): 2020, *note 3.6(7/2): 2023, *note
3.6.1(3): 2060, *note 3.8.1(5/3): 2214, *note 3.10(3): 2397, *note
4.8(2/3): 3281, *note 5.5.2(2/3): 3496, *note 6.5(2.3/2): 3787, *note
7.3(3/3): 3906, *note P: 10245.
subtype_mark *note 3.2.2(4): 1478.
- used *note 3.2.2(3/2): 1476, *note 3.6(4): 2014, *note 3.7(5/2):
+ <used> *note 3.2.2(3/2): 1476, *note 3.6(4): 2014, *note 3.7(5/2):
2109, *note 3.9.4(3/2): 2361, *note 3.10(6/2): 2405, *note 4.3.2(3):
2734, *note 4.4(3.2/4): 2906, *note 4.6(2): 3158, *note 4.7(2): 3263,
*note 6.1(13/2): 3572, *note 6.1(15/3): 3582, *note 8.4(4/3): 4112,
@@ -140058,10 +140598,10 @@ subtypes
of a profile *note 6.1(25): 3601.
subunit *note 10.1.3(7): 4800, *note 10.1.3(8/2): 4804.
of a program unit *note 10.1.3(8/2): 4805.
- used *note 10.1.1(3): 4713, *note P: 10431.
+ <used> *note 10.1.1(3): 4713, *note P: 10431.
Succ attribute *note 3.5(22): 1718.
Success
- in Ada.Command_Line *note A.15(8): 7231.
+ <in> Ada.Command_Line *note A.15(8): 7231.
successor element
of a hashed set *note A.18.8(68/2): 7735.
of a set *note A.18.7(6/2): 7651.
@@ -140071,41 +140611,41 @@ successor node
of a map *note A.18.4(6/2): 7515.
of an ordered map *note A.18.6(58/3): 7639.
Sunday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4560.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4560.
super
- See view conversion *note 4.6(5/2): 3168.
+ <See> view conversion *note 4.6(5/2): 3168.
Superscript_One
- in Ada.Characters.Latin_1 *note A.3.3(22): 6201.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6201.
Superscript_Three
- in Ada.Characters.Latin_1 *note A.3.3(22): 6194.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6194.
Superscript_Two
- in Ada.Characters.Latin_1 *note A.3.3(22): 6193.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 6193.
support external streaming *note 13.13.2(52/3): 5922.
Supported
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8782.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8782.
Suppress pragma *note 11.5(4/2): 5051, *note J.10(3/2): 9290, *note
L(36): 9627.
suppressed check *note 11.5(8/2): 5060.
Suspend_Until_True
- in Ada.Synchronous_Task_Control *note D.10(4): 8692.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8692.
Suspend_Until_True_And_Set_Deadline
- in Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 8694.
+ <in> Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 8694.
Suspension_Object
- in Ada.Synchronous_Task_Control *note D.10(4): 8688.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 8688.
Swap
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 7466.
- in Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7863.
- in Ada.Containers.Vectors *note A.18.2(55/2): 7390, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 7466.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7863.
+ <in> Ada.Containers.Vectors *note A.18.2(55/2): 7390, *note
A.18.2(56/2): 7391.
Swap_Links
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 7467.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 7467.
Symmetric_Difference
- in Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7701, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7701, *note
A.18.8(36/2): 7702.
- in Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7777, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7777, *note
A.18.9(37/2): 7778.
SYN
- in Ada.Characters.Latin_1 *note A.3.3(6): 6065.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6065.
synchronization *note 9(1/3): 4232.
Synchronization aspect *note 9.5(12/3): 4384.
synchronization_kind *note 9.5(10/3): 4382.
@@ -140113,13 +140653,13 @@ synchronized *note N(38.1/2): 9727.
synchronized interface *note 3.9.4(5/2): 2369.
synchronized tagged type *note 3.9.4(6/2): 2374.
Synchronized_Queue_Interfaces
- child of Ada.Containers *note A.18.27(3/3): 7995.
+ <child of> Ada.Containers *note A.18.27(3/3): 7995.
Synchronous_Barrier
- in Ada.Synchronous_Barriers *note D.10.1(5/3): 8702.
+ <in> Ada.Synchronous_Barriers *note D.10.1(5/3): 8702.
Synchronous_Barriers
- child of Ada *note D.10.1(3/3): 8700.
+ <child of> Ada *note D.10.1(3/3): 8700.
Synchronous_Task_Control
- child of Ada *note D.10(3/2): 8687.
+ <child of> Ada *note D.10(3/2): 8687.
syntactic category *note 1.1.4(15): 1094.
syntax
complete listing *note P(1): 9733.
@@ -140136,10 +140676,10 @@ System.Storage_Elements *note 13.7.1(2/2): 5632.
System.Storage_Pools *note 13.11(5): 5695.
System.Storage_Pools.Subpools *note 13.11.4(3/3): 5774.
System_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
8808.
System_Name
- in System *note 13.7(4): 5605.
+ <in> System *note 13.7(4): 5605.
systems programming *note C(1): 8301.
@@ -140154,7 +140694,7 @@ T
T
italicized *note 4.5.1(3.b/2): 2967.
Tag
- in Ada.Tags *note 3.9(6/2): 2248.
+ <in> Ada.Tags *note 3.9(6/2): 2248.
Tag attribute *note 3.9(16): 2269, *note 3.9(18): 2271.
tag indeterminate *note 3.9.2(6/2): 2325.
tag of an object *note 3.9(3): 2240.
@@ -140165,24 +140705,25 @@ tag of an object *note 3.9(3): 2240.
returned by a function *note 3.9(23): 2276, *note 3.9(24/2): 2277.
stand-alone object, component, or aggregate *note 3.9(20): 2273.
Tag_Array
- in Ada.Tags *note 3.9(7.3/2): 2258.
+ <in> Ada.Tags *note 3.9(7.3/2): 2258.
Tag_Check *note 11.5(18): 5070.
- [partial] *note 3.9.2(16): 2331, *note 4.6(42): 3216, *note
+ [<partial>] *note 3.9.2(16): 2331, *note 4.6(42): 3216, *note
4.6(52): 3241, *note 5.2(10): 3413, *note 6.5(8.1/3): 3808.
Tag_Error
- in Ada.Tags *note 3.9(8): 2261.
+ <in> Ada.Tags *note 3.9(8): 2261.
tagged incomplete view *note 3.10.1(2.1/4): 2448.
tagged type *note 3.9(2/2): 2234, *note N(39): 9728.
protected *note 3.9.4(6/2): 2378.
synchronized *note 3.9.4(6/2): 2376.
task *note 3.9.4(6/2): 2377.
Tags
- child of Ada *note 3.9(6/2): 2247.
+ <child of> Ada *note 3.9(6/2): 2247.
Tail
- in Ada.Strings.Bounded *note A.4.4(72): 6448, *note A.4.4(73):
+ <in> Ada.Strings.Bounded *note A.4.4(72): 6448, *note A.4.4(73):
6449.
- in Ada.Strings.Fixed *note A.4.3(37): 6389, *note A.4.3(38): 6390.
- in Ada.Strings.Unbounded *note A.4.5(67): 6505, *note A.4.5(68):
+ <in> Ada.Strings.Fixed *note A.4.3(37): 6389, *note A.4.3(38):
+6390.
+ <in> Ada.Strings.Unbounded *note A.4.5(67): 6505, *note A.4.5(68):
6506.
tail (of a queue) *note D.2.1(5/2): 8475.
tamper with cursors
@@ -140206,13 +140747,15 @@ tampering
prohibited for a tree *note A.18.10(90/4): 7902.
prohibited for a vector *note A.18.2(97.1/4): 7418.
Tan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 9043.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6688.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6688.
Tanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 9051.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6702.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6702.
target
of an assignment operation *note 5.2(3): 3406.
of an assignment_statement *note 5.2(3): 3407.
@@ -140233,9 +140776,9 @@ task *note 9(1/3): 4229.
task declaration *note 9.1(1): 4248.
task dispatching *note D.2.1(4/2): 8469.
task dispatching point *note D.2.1(4/2): 8471.
- [partial] *note D.2.3(8/2): 8499, *note D.2.4(9/3): 8508.
+ [<partial>] *note D.2.3(8/2): 8499, *note D.2.4(9/3): 8508.
task dispatching policy *note 9(10.a/3): 4246, *note D.2.2(7/2): 8494.
- [partial] *note D.2.1(5/2): 8477.
+ [<partial>] *note D.2.1(5/2): 8477.
EDF_Across_Priorities *note D.2.6(7/2): 8521.
FIFO_Within_Priorities *note D.2.3(2/2): 8497.
Non_Preemptive_FIFO_Within_Priorities *note D.2.4(2/2): 8503.
@@ -140254,42 +140797,42 @@ task tagged type *note 3.9.4(6/2): 2379.
task type *note N(40/2): 9729.
task unit *note 9(9): 4236.
Task_Array
- in Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8756.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8756.
Task_Attributes
- child of Ada *note C.7.2(2): 8421.
+ <child of> Ada *note C.7.2(2): 8421.
task_body *note 9.1(6/3): 4267.
- used *note 3.11(6): 2523, *note P: 9970.
+ <used> *note 3.11(6): 2523, *note P: 9970.
task_body_stub *note 10.1.3(5/3): 4794.
- used *note 10.1.3(2): 4785, *note P: 10456.
+ <used> *note 10.1.3(2): 4785, *note P: 10456.
task_definition *note 9.1(4): 4260.
- used *note 9.1(2/3): 4254, *note 9.1(3/3): 4259, *note P: 10322.
+ <used> *note 9.1(2/3): 4254, *note 9.1(3/3): 4259, *note P: 10322.
Task_Dispatching_Policy pragma *note D.2.2(3): 8483, *note L(37):
9630.
Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 8401.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 8401.
Task_Identification
- child of Ada *note C.7.1(2/2): 8400.
+ <child of> Ada *note C.7.1(2/2): 8400.
task_item *note 9.1(5/1): 4264.
- used *note 9.1(4): 4262, *note P: 10328.
+ <used> *note 9.1(4): 4262, *note P: 10328.
Task_Termination
- child of Ada *note C.7.3(2/2): 8433.
+ <child of> Ada *note C.7.3(2/2): 8433.
task_type_declaration *note 9.1(2/3): 4249.
- used *note 3.2.1(3/3): 1447, *note P: 9807.
+ <used> *note 3.2.1(3/3): 1447, *note P: 9807.
Tasking_Error
raised by failure of run-time check *note 9.2(5): 4299, *note
9.5.3(21): 4484, *note 11.1(4): 4937, *note 13.11.2(13): 5750, *note
13.11.2(14): 5752, *note C.7.2(13): 8427, *note D.5.1(8): 8574, *note
D.11(8): 8712.
- in Standard *note A.1(46): 5990.
+ <in> Standard *note A.1(46): 5990.
template *note 12(1): 5099.
for a formal package *note 12.7(4): 5333.
- See generic unit *note 12(1): 5100.
+ <See> generic unit *note 12(1): 5100.
term *note 4.4(5): 2912.
- used *note 4.4(4): 2909, *note P: 10077.
+ <used> *note 4.4(4): 2909, *note P: 10077.
terminal interrupt
example *note 9.7.4(10): 4650.
terminate_alternative *note 9.7.1(7): 4611.
- used *note 9.7.1(4): 4604, *note P: 10405.
+ <used> *note 9.7.1(4): 4604, *note P: 10405.
terminated
a task state *note 9(10): 4244.
Terminated attribute *note 9.9(3): 4683.
@@ -140302,31 +140845,31 @@ termination handler *note C.7.3(8/3): 8440.
fall-back *note C.7.3(9/2): 8443.
specific *note C.7.3(9/2): 8445.
Termination_Handler
- in Ada.Task_Termination *note C.7.3(4/2): 8435.
+ <in> Ada.Task_Termination *note C.7.3(4/2): 8435.
Terminator_Error
- in Interfaces.C *note B.3(40): 8165.
+ <in> Interfaces.C *note B.3(40): 8165.
tested type
of a membership test *note 4.5.2(3/3): 3010.
text of a program *note 2.2(1): 1229.
Text_IO
- child of Ada *note A.10.1(2): 6958.
+ <child of> Ada *note A.10.1(2): 6958.
Text_Streams
- child of Ada.Text_IO *note A.12.2(3): 7203.
- child of Ada.Wide_Text_IO *note A.12.3(3): 7206.
- child of Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 7209.
+ <child of> Ada.Text_IO *note A.12.2(3): 7203.
+ <child of> Ada.Wide_Text_IO *note A.12.3(3): 7206.
+ <child of> Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 7209.
throw (an exception)
- See raise *note 11(1/3): 4922.
+ <See> raise *note 11(1/3): 4922.
thunk *note 13.14(19.i): 5961.
Thursday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4557.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4557.
tick *note 2.1(15/3): 1200.
- in Ada.Real_Time *note D.8(6): 8664.
- in System *note 13.7(10): 5614.
+ <in> Ada.Real_Time *note D.8(6): 8664.
+ <in> System *note 13.7(10): 5614.
Tilde
- in Ada.Characters.Latin_1 *note A.3.3(14): 6134.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6134.
Time
- in Ada.Calendar *note 9.6(10): 4518.
- in Ada.Real_Time *note D.8(4): 8655.
+ <in> Ada.Calendar *note 9.6(10): 4518.
+ <in> Ada.Real_Time *note D.8(4): 8655.
time base *note 9.6(6/3): 4515.
time limit
example *note 9.7.4(12): 4653.
@@ -140335,225 +140878,225 @@ Time-dependent Reset procedure
of the random number generator *note A.5.2(34): 6743.
time-out
example *note 9.7.4(12): 4652.
- See asynchronous_select *note 9.7.4(12): 4651.
- See selective_accept *note 9.7.1(1): 4592.
- See timed_entry_call *note 9.7.2(1/2): 4618.
+ <See> asynchronous_select *note 9.7.4(12): 4651.
+ <See> selective_accept *note 9.7.1(1): 4592.
+ <See> timed_entry_call *note 9.7.2(1/2): 4618.
Time_Error
- in Ada.Calendar *note 9.6(18): 4530.
+ <in> Ada.Calendar *note 9.6(18): 4530.
Time_First
- in Ada.Real_Time *note D.8(4): 8656.
+ <in> Ada.Real_Time *note D.8(4): 8656.
Time_Last
- in Ada.Real_Time *note D.8(4): 8657.
+ <in> Ada.Real_Time *note D.8(4): 8657.
Time_Of
- in Ada.Calendar *note 9.6(15): 4529.
- in Ada.Calendar.Formatting *note 9.6.1(30/2): 4575, *note
+ <in> Ada.Calendar *note 9.6(15): 4529.
+ <in> Ada.Calendar.Formatting *note 9.6.1(30/2): 4575, *note
9.6.1(31/2): 4576.
- in Ada.Execution_Time *note D.14(9/2): 8727.
- in Ada.Real_Time *note D.8(16): 8675.
+ <in> Ada.Execution_Time *note D.14(9/2): 8727.
+ <in> Ada.Real_Time *note D.8(16): 8675.
Time_Of_Event
- in Ada.Real_Time.Timing_Events *note D.15(6/2): 8791.
+ <in> Ada.Real_Time.Timing_Events *note D.15(6/2): 8791.
Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4545.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4545.
Time_Remaining
- in Ada.Execution_Time.Timers *note D.14.1(8/2): 8745.
+ <in> Ada.Execution_Time.Timers *note D.14.1(8/2): 8745.
Time_Span
- in Ada.Real_Time *note D.8(5): 8659.
+ <in> Ada.Real_Time *note D.8(5): 8659.
Time_Span_First
- in Ada.Real_Time *note D.8(5): 8660.
+ <in> Ada.Real_Time *note D.8(5): 8660.
Time_Span_Last
- in Ada.Real_Time *note D.8(5): 8661.
+ <in> Ada.Real_Time *note D.8(5): 8661.
Time_Span_Unit
- in Ada.Real_Time *note D.8(5): 8663.
+ <in> Ada.Real_Time *note D.8(5): 8663.
Time_Span_Zero
- in Ada.Real_Time *note D.8(5): 8662.
+ <in> Ada.Real_Time *note D.8(5): 8662.
Time_Unit
- in Ada.Real_Time *note D.8(4): 8658.
+ <in> Ada.Real_Time *note D.8(4): 8658.
Time_Zones
- child of Ada.Calendar *note 9.6.1(2/2): 4544.
+ <child of> Ada.Calendar *note 9.6.1(2/2): 4544.
timed_entry_call *note 9.7.2(2): 4619.
- used *note 9.7(2): 4588, *note P: 10394.
+ <used> *note 9.7(2): 4588, *note P: 10394.
Timer
- in Ada.Execution_Time.Timers *note D.14.1(4/2): 8738.
+ <in> Ada.Execution_Time.Timers *note D.14.1(4/2): 8738.
timer interrupt
example *note 9.7.4(12): 4655.
Timer_Handler
- in Ada.Execution_Time.Timers *note D.14.1(5/2): 8739.
+ <in> Ada.Execution_Time.Timers *note D.14.1(5/2): 8739.
Timer_Resource_Error
- in Ada.Execution_Time.Timers *note D.14.1(9/2): 8746.
+ <in> Ada.Execution_Time.Timers *note D.14.1(9/2): 8746.
Timers
- child of Ada.Execution_Time *note D.14.1(3/2): 8737.
+ <child of> Ada.Execution_Time *note D.14.1(3/2): 8737.
times operator *note 4.4(1/3): 2848, *note 4.5.5(1): 3068.
timing
- See delay_statement *note 9.6(1): 4504.
+ <See> delay_statement *note 9.6(1): 4504.
Timing_Event
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8785.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8785.
Timing_Event_Handler
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8786.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8786.
Timing_Events
- child of Ada.Real_Time *note D.15(3/2): 8784.
+ <child of> Ada.Real_Time *note D.15(3/2): 8784.
To_Ada
- in Interfaces.C *note B.3(22): 8128, *note B.3(26): 8132, *note
+ <in> Interfaces.C *note B.3(22): 8128, *note B.3(26): 8132, *note
B.3(28): 8134, *note B.3(32): 8138, *note B.3(37): 8142, *note B.3(39):
8144, *note B.3(39.10/2): 8154, *note B.3(39.13/2): 8158, *note
B.3(39.17/2): 8162, *note B.3(39.19/2): 8164, *note B.3(39.4/2): 8148,
*note B.3(39.8/2): 8152.
- in Interfaces.COBOL *note B.4(17): 8243, *note B.4(19): 8245.
- in Interfaces.Fortran *note B.5(13): 8296, *note B.5(14): 8298,
+ <in> Interfaces.COBOL *note B.4(17): 8243, *note B.4(19): 8245.
+ <in> Interfaces.Fortran *note B.5(13): 8296, *note B.5(14): 8298,
*note B.5(16): 8300.
To_Address
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5647.
- in System.Storage_Elements *note 13.7.1(10/3): 5639.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5647.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5639.
To_Basic
- in Ada.Characters.Handling *note A.3.2(6): 6020, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 6020, *note A.3.2(7):
6023.
To_Binary
- in Interfaces.COBOL *note B.4(45): 8275, *note B.4(48): 8278.
+ <in> Interfaces.COBOL *note B.4(45): 8275, *note B.4(48): 8278.
To_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(11): 6401.
+ <in> Ada.Strings.Bounded *note A.4.4(11): 6401.
To_C
- in Interfaces.C *note B.3(21): 8127, *note B.3(25): 8131, *note
+ <in> Interfaces.C *note B.3(21): 8127, *note B.3(25): 8131, *note
B.3(27): 8133, *note B.3(32): 8137, *note B.3(36): 8141, *note B.3(38):
8143, *note B.3(39.13/2): 8157, *note B.3(39.16/2): 8161, *note
B.3(39.18/2): 8163, *note B.3(39.4/2): 8147, *note B.3(39.7/2): 8151,
*note B.3(39.9/2): 8153.
To_Character
- in Ada.Characters.Conversions *note A.3.4(5/2): 6285.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 6285.
To_Chars_Ptr
- in Interfaces.C.Strings *note B.3.1(8): 8180.
+ <in> Interfaces.C.Strings *note B.3.1(8): 8180.
To_COBOL
- in Interfaces.COBOL *note B.4(17): 8242, *note B.4(18): 8244.
+ <in> Interfaces.COBOL *note B.4(17): 8242, *note B.4(18): 8244.
To_Cursor
- in Ada.Containers.Vectors *note A.18.2(25/2): 7353.
+ <in> Ada.Containers.Vectors *note A.18.2(25/2): 7353.
To_Decimal
- in Interfaces.COBOL *note B.4(35): 8266, *note B.4(40): 8270, *note
-B.4(44): 8274, *note B.4(47): 8277.
+ <in> Interfaces.COBOL *note B.4(35): 8266, *note B.4(40): 8270,
+*note B.4(44): 8274, *note B.4(47): 8277.
To_Display
- in Interfaces.COBOL *note B.4(36): 8267.
+ <in> Interfaces.COBOL *note B.4(36): 8267.
To_Domain
- in Ada.Strings.Maps *note A.4.2(24): 6349.
- in Ada.Strings.Wide_Maps *note A.4.7(24): 6561.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6603.
+ <in> Ada.Strings.Maps *note A.4.2(24): 6349.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(24): 6561.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6603.
To_Duration
- in Ada.Real_Time *note D.8(13): 8666.
+ <in> Ada.Real_Time *note D.8(13): 8666.
To_Fortran
- in Interfaces.Fortran *note B.5(13): 8295, *note B.5(14): 8297,
+ <in> Interfaces.Fortran *note B.5(13): 8295, *note B.5(14): 8297,
*note B.5(15): 8299.
To_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7935.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7935.
To_Index
- in Ada.Containers.Vectors *note A.18.2(26/2): 7354.
+ <in> Ada.Containers.Vectors *note A.18.2(26/2): 7354.
To_Integer
- in System.Storage_Elements *note 13.7.1(10/3): 5640.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5640.
To_ISO_646
- in Ada.Characters.Handling *note A.3.2(11): 6027, *note A.3.2(12):
-6028.
+ <in> Ada.Characters.Handling *note A.3.2(11): 6027, *note
+A.3.2(12): 6028.
To_Long_Binary
- in Interfaces.COBOL *note B.4(48): 8279.
+ <in> Interfaces.COBOL *note B.4(48): 8279.
To_Lower
- in Ada.Characters.Handling *note A.3.2(6): 6018, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 6018, *note A.3.2(7):
6021.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 6309, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 6309, *note
A.3.5(21/3): 6311.
To_Mapping
- in Ada.Strings.Maps *note A.4.2(23): 6348.
- in Ada.Strings.Wide_Maps *note A.4.7(23): 6560.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6602.
+ <in> Ada.Strings.Maps *note A.4.2(23): 6348.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(23): 6560.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6602.
To_Packed
- in Interfaces.COBOL *note B.4(41): 8271.
+ <in> Interfaces.COBOL *note B.4(41): 8271.
To_Picture
- in Ada.Text_IO.Editing *note F.3.3(6): 8985.
+ <in> Ada.Text_IO.Editing *note F.3.3(6): 8985.
To_Pointer
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5646.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5646.
To_Range
- in Ada.Strings.Maps *note A.4.2(24): 6350.
- in Ada.Strings.Wide_Maps *note A.4.7(25): 6562.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6604.
+ <in> Ada.Strings.Maps *note A.4.2(24): 6350.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(25): 6562.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6604.
To_Ranges
- in Ada.Strings.Maps *note A.4.2(10): 6338.
- in Ada.Strings.Wide_Maps *note A.4.7(10): 6550.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6592.
+ <in> Ada.Strings.Maps *note A.4.2(10): 6338.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(10): 6550.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6592.
To_Sequence
- in Ada.Strings.Maps *note A.4.2(19): 6344.
- in Ada.Strings.Wide_Maps *note A.4.7(19): 6556.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6598.
+ <in> Ada.Strings.Maps *note A.4.2(19): 6344.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(19): 6556.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6598.
To_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7675.
- in Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7751.
- in Ada.Strings.Maps *note A.4.2(8): 6336, *note A.4.2(9): 6337,
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7675.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7751.
+ <in> Ada.Strings.Maps *note A.4.2(8): 6336, *note A.4.2(9): 6337,
*note A.4.2(17): 6342, *note A.4.2(18): 6343.
- in Ada.Strings.Wide_Maps *note A.4.7(8): 6548, *note A.4.7(9):
+ <in> Ada.Strings.Wide_Maps *note A.4.7(8): 6548, *note A.4.7(9):
6549, *note A.4.7(17): 6554, *note A.4.7(18): 6555.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6590, *note
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6590, *note
A.4.8(9/2): 6591, *note A.4.8(17/2): 6596, *note A.4.8(18/2): 6597.
To_String
- in Ada.Characters.Conversions *note A.3.4(5/2): 6288.
- in Ada.Strings.Bounded *note A.4.4(12): 6402.
- in Ada.Strings.Unbounded *note A.4.5(11): 6464.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 6288.
+ <in> Ada.Strings.Bounded *note A.4.4(12): 6402.
+ <in> Ada.Strings.Unbounded *note A.4.5(11): 6464.
To_Time_Span
- in Ada.Real_Time *note D.8(13): 8667.
+ <in> Ada.Real_Time *note D.8(13): 8667.
To_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(9): 6462, *note A.4.5(10):
+ <in> Ada.Strings.Unbounded *note A.4.5(9): 6462, *note A.4.5(10):
6463.
To_Upper
- in Ada.Characters.Handling *note A.3.2(6): 6019, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 6019, *note A.3.2(7):
6022.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 6310, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 6310, *note
A.3.5(21/3): 6312.
To_Vector
- in Ada.Containers.Vectors *note A.18.2(13/2): 7345, *note
+ <in> Ada.Containers.Vectors *note A.18.2(13/2): 7345, *note
A.18.2(14/2): 7346.
To_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 6279, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6279, *note
A.3.4(5/2): 6289.
To_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 6280, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6280, *note
A.3.4(5/2): 6290.
To_Wide_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 6281.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6281.
To_Wide_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 6284.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 6284.
token
- See lexical element *note 2.2(1): 1231.
+ <See> lexical element *note 2.2(1): 1231.
Trailing_Nonseparate
- in Interfaces.COBOL *note B.4(23): 8252.
+ <in> Interfaces.COBOL *note B.4(23): 8252.
Trailing_Separate
- in Interfaces.COBOL *note B.4(23): 8250.
+ <in> Interfaces.COBOL *note B.4(23): 8250.
transfer of control *note 5.1(14/2): 3396.
Translate
- in Ada.Strings.Bounded *note A.4.4(53): 6430, *note A.4.4(54):
+ <in> Ada.Strings.Bounded *note A.4.4(53): 6430, *note A.4.4(54):
6431, *note A.4.4(55): 6432, *note A.4.4(56): 6433.
- in Ada.Strings.Fixed *note A.4.3(18): 6371, *note A.4.3(19): 6372,
-*note A.4.3(20): 6373, *note A.4.3(21): 6374.
- in Ada.Strings.Unbounded *note A.4.5(48): 6487, *note A.4.5(49):
+ <in> Ada.Strings.Fixed *note A.4.3(18): 6371, *note A.4.3(19):
+6372, *note A.4.3(20): 6373, *note A.4.3(21): 6374.
+ <in> Ada.Strings.Unbounded *note A.4.5(48): 6487, *note A.4.5(49):
6488, *note A.4.5(50): 6489, *note A.4.5(51): 6490.
Translation_Error
- in Ada.Strings *note A.4.1(5): 6324.
+ <in> Ada.Strings *note A.4.1(5): 6324.
Transpose
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 9175.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 9134.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 9175.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 9134.
Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7835.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7835.
Tree_Iterator_Interfaces
- in Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7840.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7840.
triggering_alternative *note 9.7.4(3): 4637.
- used *note 9.7.4(2): 4635, *note P: 10418.
+ <used> *note 9.7.4(2): 4635, *note P: 10418.
triggering_statement *note 9.7.4(4/2): 4640.
- used *note 9.7.4(3): 4638, *note P: 10420.
+ <used> *note 9.7.4(3): 4638, *note P: 10420.
Trim
- in Ada.Strings.Bounded *note A.4.4(67): 6442, *note A.4.4(68):
+ <in> Ada.Strings.Bounded *note A.4.4(67): 6442, *note A.4.4(68):
6444, *note A.4.4(69): 6445.
- in Ada.Strings.Fixed *note A.4.3(31): 6383, *note A.4.3(32): 6384,
-*note A.4.3(33): 6385, *note A.4.3(34): 6386.
- in Ada.Strings.Unbounded *note A.4.5(61): 6499, *note A.4.5(62):
+ <in> Ada.Strings.Fixed *note A.4.3(31): 6383, *note A.4.3(32):
+6384, *note A.4.3(33): 6385, *note A.4.3(34): 6386.
+ <in> Ada.Strings.Unbounded *note A.4.5(61): 6499, *note A.4.5(62):
6500, *note A.4.5(63): 6501, *note A.4.5(64): 6502.
Trim_End
- in Ada.Strings *note A.4.1(6): 6329.
+ <in> Ada.Strings *note A.4.1(6): 6329.
True *note 3.5.3(1): 1822.
Truncation
- in Ada.Strings *note A.4.1(6): 6326.
+ <in> Ada.Strings *note A.4.1(6): 6326.
Truncation attribute *note A.5.3(42): 6800.
Tuesday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4555.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4555.
two's complement
modular types *note 3.5.4(29): 1875.
type *note 3.2(1): 1394, *note N(41/2): 9730.
@@ -140561,10 +141104,10 @@ type *note 3.2(1): 1394, *note N(41/2): 9730.
needs finalization *note 7.6(9.1/2): 3984.
of a subtype *note 3.2(8/2): 1422.
synchronized tagged *note 3.9.4(6/2): 2375.
- See also tag *note 3.9(3): 2244.
- See also language-defined types
+ <See also> tag *note 3.9(3): 2244.
+ <See also> language-defined types
type conformance *note 6.3.1(15/2): 3697.
- [partial] *note 3.4(17/2): 1638, *note 8.3(8): 4073, *note
+ [<partial>] *note 3.4(17/2): 1638, *note 8.3(8): 4073, *note
8.3(26/2): 4096, *note 10.1.4(4/3): 4814.
required *note 3.11.1(5): 2538, *note 4.1.4(14/2): 2637, *note
8.6(26): 4211, *note 9.1(9.2/3): 4277, *note 9.1(9.5/3): 4279, *note
@@ -140579,41 +141122,41 @@ type conversion *note 4.6(1/3): 3150.
enumeration *note 4.6(21.1/2): 3172, *note 4.6(34): 3203.
numeric *note 4.6(24.1/2): 3174, *note 4.6(29): 3200.
unchecked *note 13.9(1): 5659.
- See also qualified_expression *note 4.7(1): 3259.
+ <See also> qualified_expression *note 4.7(1): 3259.
type conversion, implicit
- See implicit subtype conversion *note 4.6(1/3): 3154.
+ <See> implicit subtype conversion *note 4.6(1/3): 3154.
type extension *note 3.9(2/2): 2235, *note 3.9.1(1/2): 2288.
type invariant *note N(41.1/4): 9731.
class-wide *note 7.3.2(3/4): 3938.
type of a discrete_range *note 3.6.1(4): 2062.
type of a range *note 3.5(4): 1685.
type parameter
- See discriminant *note 3.7(1/2): 2095.
+ <See> discriminant *note 3.7(1/2): 2095.
type profile
- See profile, type conformant *note 6.3.1(15/2): 3699.
+ <See> profile, type conformant *note 6.3.1(15/2): 3699.
type resolution rules *note 8.6(20/2): 4204.
if any type in a specified class of types is expected *note
8.6(21): 4205.
if expected type is specific *note 8.6(22): 4207.
if expected type is universal or class-wide *note 8.6(21): 4206.
type tag
- See tag *note 3.9(3): 2242.
+ <See> tag *note 3.9(3): 2242.
type-related
aspect *note 13.1(8.1/3): 5371, *note 13.1(8/3): 5366.
attribute_definition_clause *note 13.3(7.a): 5457.
operational item *note 13.1(8.1/3): 5370.
representation item *note 13.1(8/3): 5364.
type_conversion *note 4.6(2): 3155.
- used *note 4.1(2/3): 2548, *note P: 9978.
- See also unchecked type conversion *note 13.9(1): 5661.
+ <used> *note 4.1(2/3): 2548, *note P: 9978.
+ <See also> unchecked type conversion *note 13.9(1): 5661.
type_declaration *note 3.2.1(2): 1437.
- used *note 3.1(3/3): 1353, *note P: 9785.
+ <used> *note 3.1(3/3): 1353, *note P: 9785.
type_definition *note 3.2.1(4/2): 1449.
- used *note 3.2.1(3/3): 1445, *note P: 9805.
+ <used> *note 3.2.1(3/3): 1445, *note P: 9805.
Type_Invariant aspect *note 7.3.2(2/3): 3934.
Type_Invariant'Class aspect *note 7.3.2(3/4): 3936.
Type_Set
- in Ada.Text_IO *note A.10.1(7): 6966.
+ <in> Ada.Text_IO *note A.10.1(7): 6966.
types
of a profile *note 6.1(29): 3602.
@@ -140627,102 +141170,102 @@ U
UC_A_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 6209.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6209.
UC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6210.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6210.
UC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6212.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6212.
UC_A_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 6208.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6208.
UC_A_Ring
- in Ada.Characters.Latin_1 *note A.3.3(23): 6213.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6213.
UC_A_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(23): 6211.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6211.
UC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(23): 6214.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6214.
UC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(23): 6215.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6215.
UC_E_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 6217.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6217.
UC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6218.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6218.
UC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6219.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6219.
UC_E_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 6216.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6216.
UC_I_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 6221.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6221.
UC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 6222.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6222.
UC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 6223.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6223.
UC_I_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 6220.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 6220.
UC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(24): 6224.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6224.
UC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(24): 6238.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6238.
UC_N_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(24): 6225.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6225.
UC_O_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 6227.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6227.
UC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 6228.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6228.
UC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 6230.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6230.
UC_O_Grave
- in Ada.Characters.Latin_1 *note A.3.3(24): 6226.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6226.
UC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(24): 6232.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6232.
UC_O_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(24): 6229.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6229.
UC_U_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 6234.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6234.
UC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 6235.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6235.
UC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 6236.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6236.
UC_U_Grave
- in Ada.Characters.Latin_1 *note A.3.3(24): 6233.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6233.
UC_Y_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 6237.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 6237.
UCHAR_MAX
- in Interfaces.C *note B.3(6): 8110.
+ <in> Interfaces.C *note B.3(6): 8110.
UI *note 1.3(1.c/3): 1167.
ultimate ancestor
of a type *note 3.4.1(10/2): 1669.
unary adding operator *note 4.5.4(1): 3052.
unary operator *note 4.5(9): 2949.
unary_adding_operator *note 4.5(5): 2942.
- used *note 4.4(4): 2908, *note P: 10074.
+ <used> *note 4.4(4): 2908, *note P: 10074.
Unbiased_Rounding attribute *note A.5.3(39): 6795.
Unbounded
- child of Ada.Strings *note A.4.5(3): 6456.
- in Ada.Text_IO *note A.10.1(5): 6963.
+ <child of> Ada.Strings *note A.4.5(3): 6456.
+ <in> Ada.Text_IO *note A.10.1(5): 6963.
Unbounded_IO
- child of Ada.Text_IO *note A.10.12(3/2): 7138.
- child of Ada.Wide_Text_IO *note A.11(5/3): 7156.
- child of Ada.Wide_Wide_Text_IO *note A.11(5/3): 7157.
+ <child of> Ada.Text_IO *note A.10.12(3/2): 7138.
+ <child of> Ada.Wide_Text_IO *note A.11(5/3): 7156.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(5/3): 7157.
Unbounded_Priority_Queues
- child of Ada.Containers *note A.18.30(2/3): 8017.
+ <child of> Ada.Containers *note A.18.30(2/3): 8017.
Unbounded_Slice
- in Ada.Strings.Unbounded *note A.4.5(22.1/2): 6472, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(22.1/2): 6472, *note
A.4.5(22.2/2): 6473.
Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(4/2): 6457.
+ <in> Ada.Strings.Unbounded *note A.4.5(4/2): 6457.
Unbounded_Synchronized_Queues
- child of Ada.Containers *note A.18.28(2/3): 8003.
+ <child of> Ada.Containers *note A.18.28(2/3): 8003.
unchecked storage deallocation *note 13.11.2(1): 5737.
unchecked type conversion *note 13.9(1): 5658.
unchecked union object *note B.3.3(6/3): 8220.
unchecked union subtype *note B.3.3(6/3): 8219.
unchecked union type *note B.3.3(6/3): 8218.
Unchecked_Access attribute *note 13.10(3): 5688, *note H.4(18): 9234.
- See also Access attribute *note 3.10.2(25/1): 2483.
+ <See also> Access attribute *note 3.10.2(25/1): 2483.
Unchecked_Conversion
- child of Ada *note 13.9(3/3): 5663.
+ <child of> Ada *note 13.9(3/3): 5663.
Unchecked_Deallocation
- child of Ada *note 13.11.2(3/3): 5742.
+ <child of> Ada *note 13.11.2(3/3): 5742.
Unchecked_Union aspect *note B.3.3(3.2/3): 8217.
Unchecked_Union pragma *note J.15.6(2/3): 9357, *note L(37.2/3): 9633.
unconstrained *note 3.2(9): 1430.
@@ -140736,22 +141279,22 @@ unconstrained *note 3.2(9): 1430.
subtype *note 3.10(14/3): 2433.
subtype *note K.2(33): 9427.
unconstrained_array_definition *note 3.6(3): 2009.
- used *note 3.6(2): 2007, *note P: 9881.
+ <used> *note 3.6(2): 2007, *note P: 9881.
undefined result *note 11.6(5): 5092.
underline *note 2.1(15/3): 1220.
- used *note 2.4.1(3): 1270, *note 2.4.2(4): 1295, *note P: 9757.
+ <used> *note 2.4.1(3): 1270, *note 2.4.2(4): 1295, *note P: 9757.
Uniformity Issue (UI) *note 1.3(1.c/3): 1166.
Uniformity Rapporteur Group (URG) *note 1.3(1.c/3): 1164.
-Uniformly_Distributed subtype of Float
- in Ada.Numerics.Float_Random *note A.5.2(8): 6718.
+Uniformly_Distributed <subtype of> Float
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6718.
uninitialized allocator *note 4.8(4): 3289.
uninitialized variables *note 13.9.1(2): 5669.
- [partial] *note 3.3.1(21/3): 1599, *note 13.3(55.i): 5500.
+ [<partial>] *note 3.3.1(21/3): 1599, *note 13.3(55.i): 5500.
union
C *note B.3.3(1/3): 8215.
- in Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7695, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7695, *note
A.18.8(27/2): 7696.
- in Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7771, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7771, *note
A.18.9(28/2): 7772.
unit consistency *note E.3(6): 8919.
unit matrix
@@ -140761,44 +141304,44 @@ unit vector
complex vector *note G.3.2(90/2): 9185.
real vector *note G.3.1(48/2): 9144.
Unit_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 9182.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 9141.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 9182.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 9141.
Unit_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 9162.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 9133.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 9162.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 9133.
universal type *note 3.4.1(6/2): 1659.
universal_access
- [partial] *note 3.4.1(6/2): 1663, *note 4.2(8/2): 2675.
+ [<partial>] *note 3.4.1(6/2): 1663, *note 4.2(8/2): 2675.
universal_fixed
- [partial] *note 3.4.1(6/2): 1662, *note 3.5.6(4): 1903.
+ [<partial>] *note 3.4.1(6/2): 1662, *note 3.5.6(4): 1903.
universal_integer
- [partial] *note 3.4.1(6/2): 1660, *note 3.5.4(14): 1854, *note
+ [<partial>] *note 3.4.1(6/2): 1660, *note 3.5.4(14): 1854, *note
3.5.4(30): 1876, *note 4.2(8/2): 2673.
universal_real
- [partial] *note 3.4.1(6/2): 1661, *note 3.5.6(4): 1901, *note
+ [<partial>] *note 3.4.1(6/2): 1661, *note 3.5.6(4): 1901, *note
4.2(8/2): 2674.
unknown discriminants *note 3.7(26): 2128.
- [partial] *note 3.7(1.b/2): 2097.
+ [<partial>] *note 3.7(1.b/2): 2097.
unknown_discriminant_part *note 3.7(3): 2102.
- used *note 3.7(2): 2100, *note P: 9898.
+ <used> *note 3.7(2): 2100, *note P: 9898.
Unknown_Zone_Error
- in Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4546.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4546.
unmarshalling *note E.4(9): 8927.
unpolluted *note 13.13.1(2): 5859.
unsigned
- in Interfaces.C *note B.3(9): 8115.
- in Interfaces.COBOL *note B.4(23): 8248.
+ <in> Interfaces.C *note B.3(9): 8115.
+ <in> Interfaces.COBOL *note B.4(23): 8248.
unsigned type
- See modular type *note 3.5.4(1): 1827.
+ <See> modular type *note 3.5.4(1): 1827.
unsigned_char
- in Interfaces.C *note B.3(10): 8118.
+ <in> Interfaces.C *note B.3(10): 8118.
unsigned_long
- in Interfaces.C *note B.3(9): 8117.
+ <in> Interfaces.C *note B.3(9): 8117.
Unsigned_N *note B.2(8): 8097.
unsigned_short
- in Interfaces.C *note B.3(9): 8116.
+ <in> Interfaces.C *note B.3(9): 8116.
unspecified *note 1.1.3(18): 1079, *note M.2(1.a): 9649.
- [partial] *note 2.1(5/3): 1175, *note 3.9(4/2): 2246, *note
+ [<partial>] *note 2.1(5/3): 1175, *note 3.9(4/2): 2246, *note
3.9(12.5/3): 2263, *note 4.5.2(13): 3012, *note 4.5.2(24.2/1): 3015,
*note 4.5.5(21): 3078, *note 4.6(58.4/4): 3250, *note 6.1.1(34/3): 3643,
*note 6.1.1(35/3): 3648, *note 6.2(11/3): 3663, *note 7.2(5/3): 3891,
@@ -140831,64 +141374,64 @@ H.2(1): 9198, *note K.2(136.4/2): 9445.
Unsuppress pragma *note 11.5(4.1/2): 5054, *note L(37.3/2): 9636.
update
the value of an object *note 3.3(14): 1541.
- in Interfaces.C.Strings *note B.3.1(18): 8190, *note B.3.1(19):
+ <in> Interfaces.C.Strings *note B.3.1(18): 8190, *note B.3.1(19):
8191.
Update_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 7450.
- in Ada.Containers.Hashed_Maps *note A.18.5(17/2): 7544.
- in Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7941.
- in Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7853.
- in Ada.Containers.Ordered_Maps *note A.18.6(16/2): 7598.
- in Ada.Containers.Vectors *note A.18.2(33/2): 7361, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 7450.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17/2): 7544.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7941.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7853.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16/2): 7598.
+ <in> Ada.Containers.Vectors *note A.18.2(33/2): 7361, *note
A.18.2(34/2): 7362.
Update_Element_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7722.
- in Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7806.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7722.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7806.
Update_Error
- in Interfaces.C.Strings *note B.3.1(20): 8192.
+ <in> Interfaces.C.Strings *note B.3.1(20): 8192.
upper bound
of a range *note 3.5(4): 1684.
upper-case letter
a category of Character *note A.3.2(26): 6033.
Upper_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 6524.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 6524.
Upper_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 6516.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 6516.
URG *note 1.3(1.c/3): 1165.
US
- in Ada.Characters.Latin_1 *note A.3.3(6): 6074.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 6074.
usage name *note 3.1(10): 1382.
use-visible *note 8.3(4): 4066, *note 8.4(9): 4116.
use_clause *note 8.4(2): 4104.
- used *note 3.11(4/1): 2516, *note 10.1.2(3): 4761, *note 12.1(5):
+ <used> *note 3.11(4/1): 2516, *note 10.1.2(3): 4761, *note 12.1(5):
5115, *note P: 10447.
Use_Error
- in Ada.Direct_IO *note A.8.4(18): 6930.
- in Ada.Directories *note A.16(43/2): 7274.
- in Ada.IO_Exceptions *note A.13(4): 7217.
- in Ada.Sequential_IO *note A.8.1(15): 6895.
- in Ada.Streams.Stream_IO *note A.12.1(26): 7193.
- in Ada.Text_IO *note A.10.1(85): 7107.
+ <in> Ada.Direct_IO *note A.8.4(18): 6930.
+ <in> Ada.Directories *note A.16(43/2): 7274.
+ <in> Ada.IO_Exceptions *note A.13(4): 7217.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6895.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 7193.
+ <in> Ada.Text_IO *note A.10.1(85): 7107.
use_package_clause *note 8.4(3): 4107.
- used *note 8.4(2): 4105, *note P: 10279.
+ <used> *note 8.4(2): 4105, *note P: 10279.
use_type_clause *note 8.4(4/3): 4110.
- used *note 8.4(2): 4106, *note P: 10280.
+ <used> *note 8.4(2): 4106, *note P: 10280.
user-defined assignment *note 7.6(1): 3965.
user-defined heap management *note 13.11(1): 5693.
user-defined operator *note 6.6(1): 3830.
user-defined storage management *note 13.11(1): 5691.
UTC_Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4547.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4547.
UTF-16 *note A.4.11(46/3): 6671.
UTF-8 *note A.4.11(46/3): 6670.
-UTF_16_Wide_String subtype of Wide_String
- in Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6634.
-UTF_8_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6633.
+UTF_16_Wide_String <subtype of> Wide_String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6634.
+UTF_8_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6633.
UTF_Encoding
- child of Ada.Strings *note A.4.11(3/3): 6630.
-UTF_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6632.
+ <child of> Ada.Strings *note A.4.11(3/3): 6630.
+UTF_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6632.
@@ -140901,24 +141444,25 @@ V
Val attribute *note 3.5.5(5): 1883.
Valid
- in Ada.Text_IO.Editing *note F.3.3(5): 8984, *note F.3.3(12): 8996.
- in Interfaces.COBOL *note B.4(33): 8264, *note B.4(38): 8268, *note
-B.4(43): 8272.
+ <in> Ada.Text_IO.Editing *note F.3.3(5): 8984, *note F.3.3(12):
+8996.
+ <in> Interfaces.COBOL *note B.4(33): 8264, *note B.4(38): 8268,
+*note B.4(43): 8272.
Valid attribute *note 13.9.2(3/4): 5684, *note H(6): 9192.
value *note 3.2(10.a): 1435.
- in Ada.Calendar.Formatting *note 9.6.1(36/2): 4581, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(36/2): 4581, *note
9.6.1(38/2): 4583.
- in Ada.Environment_Variables *note A.17(4.1/3): 7306, *note
+ <in> Ada.Environment_Variables *note A.17(4.1/3): 7306, *note
A.17(4/2): 7305.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6739.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6727.
- in Ada.Strings.Maps *note A.4.2(21): 6346.
- in Ada.Strings.Wide_Maps *note A.4.7(21): 6558.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6600.
- in Ada.Task_Attributes *note C.7.2(4): 8423.
- in Interfaces.C.Pointers *note B.3.2(6): 8201, *note B.3.2(7):
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6739.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6727.
+ <in> Ada.Strings.Maps *note A.4.2(21): 6346.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(21): 6558.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6600.
+ <in> Ada.Task_Attributes *note C.7.2(4): 8423.
+ <in> Interfaces.C.Pointers *note B.3.2(6): 8201, *note B.3.2(7):
8202.
- in Interfaces.C.Strings *note B.3.1(13): 8185, *note B.3.1(14):
+ <in> Interfaces.C.Strings *note B.3.1(13): 8185, *note B.3.1(14):
8186, *note B.3.1(15): 8187, *note B.3.1(16): 8188.
Value attribute *note 3.5(52): 1766.
value conversion *note 4.6(5/2): 3166.
@@ -140932,32 +141476,32 @@ Variable_Indexing aspect *note 4.1.6(3/3): 2656.
variadic
C *note B.3(60.16/4): 8170.
variant *note 3.8.1(3): 2206.
- used *note 3.8.1(2): 2205, *note P: 9928.
- See also tagged type *note 3.9(1): 2230.
+ <used> *note 3.8.1(2): 2205, *note P: 9928.
+ <See also> tagged type *note 3.9(1): 2230.
variant_part *note 3.8.1(2): 2202.
- used *note 3.8(4): 2171, *note P: 9920.
+ <used> *note 3.8(4): 2171, *note P: 9920.
Vector
- in Ada.Containers.Vectors *note A.18.2(8/3): 7339.
+ <in> Ada.Containers.Vectors *note A.18.2(8/3): 7339.
vector container *note A.18.2(1/2): 7331.
Vector_Iterator_Interfaces
- in Ada.Containers.Vectors *note A.18.2(11.2/3): 7344.
+ <in> Ada.Containers.Vectors *note A.18.2(11.2/3): 7344.
Vectors
- child of Ada.Containers *note A.18.2(6/3): 7336.
+ <child of> Ada.Containers *note A.18.2(6/3): 7336.
version
of a compilation unit *note E.3(5/1): 8916.
Version attribute *note E.3(3): 8913.
vertical line *note 2.1(15/3): 1221.
Vertical_Line
- in Ada.Characters.Latin_1 *note A.3.3(14): 6132.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 6132.
view *note 3.1(7): 1372, *note N(42/2): 9732.
of a subtype (implied) *note 3.1(7.1/3): 1376.
of a type (implied) *note 3.1(7.1/3): 1375.
of an object (implied) *note 3.1(7.1/3): 1374.
view conversion *note 4.6(5/2): 3164.
virtual function
- See dispatching subprogram *note 3.9.2(1/2): 2314.
+ <See> dispatching subprogram *note 3.9.2(1/2): 2314.
Virtual_Length
- in Interfaces.C.Pointers *note B.3.2(13): 8206.
+ <in> Interfaces.C.Pointers *note B.3.2(13): 8206.
visibility
direct *note 8.3(2): 4059, *note 8.3(21): 4086.
immediate *note 8.3(4): 4063, *note 8.3(21): 4087.
@@ -140991,9 +141535,9 @@ Volatile_Components aspect *note C.6(6.7/3): 8386.
Volatile_Components pragma *note J.15.8(6/3): 9382, *note L(39.1/3):
9642.
VT
- in Ada.Characters.Latin_1 *note A.3.3(5): 6054.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 6054.
VTS
- in Ada.Characters.Latin_1 *note A.3.3(17): 6151.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 6151.
@@ -141005,129 +141549,131 @@ W
Wait_For_Release
- in Ada.Synchronous_Barriers *note D.10.1(6/3): 8703.
+ <in> Ada.Synchronous_Barriers *note D.10.1(6/3): 8703.
wchar_array
- in Interfaces.C *note B.3(33/3): 8139.
+ <in> Interfaces.C *note B.3(33/3): 8139.
wchar_t
- in Interfaces.C *note B.3(30/1): 8135.
+ <in> Interfaces.C *note B.3(30/1): 8135.
Wednesday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4556.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4556.
well-formed picture String
for edited output *note F.3.1(1/3): 8980.
Wide_Bounded
- child of Ada.Strings *note A.4.7(1/3): 6528.
+ <child of> Ada.Strings *note A.4.7(1/3): 6528.
Wide_Character *note 3.5.2(3/3): 1809.
- in Standard *note A.1(36.1/3): 5979.
+ <in> Standard *note A.1(36.1/3): 5979.
Wide_Character_Mapping
- in Ada.Strings.Wide_Maps *note A.4.7(20/2): 6557.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(20/2): 6557.
Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Maps *note A.4.7(26): 6563.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(26): 6563.
Wide_Character_Range
- in Ada.Strings.Wide_Maps *note A.4.7(6): 6546.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(6): 6546.
Wide_Character_Ranges
- in Ada.Strings.Wide_Maps *note A.4.7(7): 6547.
-Wide_Character_Sequence subtype of Wide_String
- in Ada.Strings.Wide_Maps *note A.4.7(16): 6553.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(7): 6547.
+Wide_Character_Sequence <subtype of> Wide_String
+ <in> Ada.Strings.Wide_Maps *note A.4.7(16): 6553.
Wide_Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(4/2): 6544.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6608.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(4/2): 6544.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6608.
Wide_Characters
- child of Ada *note A.3.1(4/2): 5998.
+ <child of> Ada *note A.3.1(4/2): 5998.
Wide_Constants
- child of Ada.Strings.Wide_Maps *note A.4.7(1/3): 6542, *note
+ <child of> Ada.Strings.Wide_Maps *note A.4.7(1/3): 6542, *note
A.4.8(28/2): 6606.
Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 6534.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6536.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6535.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6537.
+ <child of> Ada.Strings *note A.4.7(1/3): 6534.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6536.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6535.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6537.
Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4994, *note 11.4.1(5/2): 5004.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4994, *note 11.4.1(5/2):
+5004.
Wide_Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2251.
+ <in> Ada.Tags *note 3.9(7/2): 2251.
Wide_Fixed
- child of Ada.Strings *note A.4.7(1/3): 6527.
+ <child of> Ada.Strings *note A.4.7(1/3): 6527.
Wide_Hash
- child of Ada.Strings *note A.4.7(1/3): 6530.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6532.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6531.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6533.
+ <child of> Ada.Strings *note A.4.7(1/3): 6530.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6532.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6531.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6533.
Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 6538.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6540.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6539.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6541.
+ <child of> Ada.Strings *note A.4.7(1/3): 6538.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 6540.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 6539.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 6541.
Wide_Image attribute *note 3.5(28): 1737, *note 3.5(55.3/4): 1774.
Wide_Maps
- child of Ada.Strings *note A.4.7(3): 6543.
+ <child of> Ada.Strings *note A.4.7(3): 6543.
wide_nul
- in Interfaces.C *note B.3(31/1): 8136.
+ <in> Interfaces.C *note B.3(31/1): 8136.
Wide_Space
- in Ada.Strings *note A.4.1(4/2): 6319.
+ <in> Ada.Strings *note A.4.1(4/2): 6319.
Wide_String
- in Standard *note A.1(41/3): 5984.
+ <in> Standard *note A.1(41/3): 5984.
Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6654.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6654.
Wide_Text_IO
- child of Ada *note A.11(2/2): 7148.
+ <child of> Ada *note A.11(2/2): 7148.
Wide_Unbounded
- child of Ada.Strings *note A.4.7(1/3): 6529.
+ <child of> Ada.Strings *note A.4.7(1/3): 6529.
Wide_Value attribute *note 3.5(40): 1760.
Wide_Wide_Bounded
- child of Ada.Strings *note A.4.8(1/3): 6570.
+ <child of> Ada.Strings *note A.4.8(1/3): 6570.
Wide_Wide_Character *note 3.5.2(4/3): 1812.
- in Standard *note A.1(36.2/3): 5980.
+ <in> Standard *note A.1(36.2/3): 5980.
Wide_Wide_Character_Mapping
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6599.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6599.
Wide_Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6605.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6605.
Wide_Wide_Character_Range
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6588.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6588.
Wide_Wide_Character_Ranges
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6589.
-Wide_Wide_Character_Sequence subtype of Wide_Wide_String
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6595.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6589.
+Wide_Wide_Character_Sequence <subtype of> Wide_Wide_String
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6595.
Wide_Wide_Character_Set
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6586.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6586.
Wide_Wide_Characters
- child of Ada *note A.3.1(6/2): 5999.
+ <child of> Ada *note A.3.1(6/2): 5999.
Wide_Wide_Constants
- child of Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6584.
+ <child of> Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6584.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6576.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6578.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6577.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6579.
+ <child of> Ada.Strings *note A.4.8(1/3): 6576.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6578.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6577.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6579.
Wide_Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4995, *note 11.4.1(5/2): 5005.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4995, *note 11.4.1(5/2):
+5005.
Wide_Wide_Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2252.
+ <in> Ada.Tags *note 3.9(7/2): 2252.
Wide_Wide_Fixed
- child of Ada.Strings *note A.4.8(1/3): 6569.
+ <child of> Ada.Strings *note A.4.8(1/3): 6569.
Wide_Wide_Hash
- child of Ada.Strings *note A.4.8(1/3): 6572.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6574.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6573.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6575.
+ <child of> Ada.Strings *note A.4.8(1/3): 6572.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6574.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6573.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6575.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6580.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6582.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6581.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6583.
+ <child of> Ada.Strings *note A.4.8(1/3): 6580.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6582.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6581.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6583.
Wide_Wide_Image attribute *note 3.5(27.1/2): 1732, *note 3.5(55.2/4):
1772.
Wide_Wide_Maps
- child of Ada.Strings *note A.4.8(3/2): 6585.
+ <child of> Ada.Strings *note A.4.8(3/2): 6585.
Wide_Wide_Space
- in Ada.Strings *note A.4.1(4/2): 6320.
+ <in> Ada.Strings *note A.4.1(4/2): 6320.
Wide_Wide_String
- in Standard *note A.1(42.1/3): 5985.
+ <in> Standard *note A.1(42.1/3): 5985.
Wide_Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6661.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6661.
Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 7151.
+ <child of> Ada *note A.11(3/2): 7151.
Wide_Wide_Unbounded
- child of Ada.Strings *note A.4.8(1/3): 6571.
+ <child of> Ada.Strings *note A.4.8(1/3): 6571.
Wide_Wide_Value attribute *note 3.5(39.1/2): 1748.
Wide_Wide_Width attribute *note 3.5(37.1/2): 1742.
Wide_Width attribute *note 3.5(38): 1744.
@@ -141135,24 +141681,24 @@ Width attribute *note 3.5(39): 1746.
with_clause *note 10.1.2(4/2): 4762.
mentioned in *note 10.1.2(6/2): 4774.
named in *note 10.1.2(6/2): 4776.
- used *note 10.1.2(3): 4760, *note P: 10446.
+ <used> *note 10.1.2(3): 4760, *note P: 10446.
within
immediately *note 8.1(13): 4038.
word *note 13.3(8): 5461.
Word_Size
- in System *note 13.7(13): 5618.
+ <in> System *note 13.7(13): 5618.
wording changes from Ada 2005 *note 1.1.2(39.jj/3): 1063.
wording changes from Ada 2012 *note 1.1.2(39.ww/4): 1070.
wording changes from Ada 83 *note 1.1.2(39.j/2): 1052.
wording changes from Ada 95 *note 1.1.2(39.w/2): 1058.
Write
- in Ada.Direct_IO *note A.8.4(13): 6922.
- in Ada.Sequential_IO *note A.8.1(12): 6890.
- in Ada.Storage_IO *note A.9(7): 6941.
- in Ada.Streams *note 13.13.1(6): 5866.
- in Ada.Streams.Stream_IO *note A.12.1(18): 7183, *note A.12.1(19):
-7184.
- in System.RPC *note E.5(8): 8955.
+ <in> Ada.Direct_IO *note A.8.4(13): 6922.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6890.
+ <in> Ada.Storage_IO *note A.9(7): 6941.
+ <in> Ada.Streams *note 13.13.1(6): 5866.
+ <in> Ada.Streams.Stream_IO *note A.12.1(18): 7183, *note
+A.12.1(19): 7184.
+ <in> System.RPC *note E.5(8): 8955.
Write aspect *note 13.13.2(38/4): 5907.
Write attribute *note 13.13.2(3): 5876, *note 13.13.2(11): 5880.
Write clause *note 13.3(7/2): 5453, *note 13.13.2(38/4): 5901.
@@ -141179,18 +141725,18 @@ Y
Year
- in Ada.Calendar *note 9.6(13): 4524.
- in Ada.Calendar.Formatting *note 9.6.1(21/2): 4566.
-Year_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4519.
+ <in> Ada.Calendar *note 9.6(13): 4524.
+ <in> Ada.Calendar.Formatting *note 9.6.1(21/2): 4566.
+Year_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4519.
Yen_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 6179.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 6179.
Yield
- in Ada.Dispatching *note D.2.1(1.3/3): 8467.
+ <in> Ada.Dispatching *note D.2.1(1.3/3): 8467.
Yield_To_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8506.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8506.
Yield_To_Same_Or_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8507.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 8507.
Tag Table:
@@ -141198,10457 +141744,10457 @@ Node: Top223
Node: Front Matter1660
Node: 0.18815
Node: 0.211516
-Node: 0.313806
-Ref: 100137575
-Ref: 100237575
-Node: 0.9954490
-Node: 154715
-Ref: 100361095
-Node: 1.161655
-Node: 1.1.163690
-Node: 1.1.265255
-Ref: 100465967
-Ref: 100566279
-Ref: 100666279
-Ref: 100766279
-Ref: 100866757
-Ref: 100966757
-Ref: 101067223
-Ref: 101167223
-Ref: 101267223
-Ref: 101371742
-Ref: 101471747
-Ref: 101571747
-Ref: 101671747
-Ref: 101771747
-Ref: 101871851
-Ref: 101971852
-Ref: 102071852
-Ref: 102172943
-Ref: 102272943
-Ref: 102372943
-Ref: 102472983
-Ref: 102572984
-Ref: 102673349
-Ref: 102773349
-Ref: 102874200
-Ref: 102974200
-Ref: 103074200
-Ref: 103174200
-Ref: 103274251
-Ref: 103374252
-Ref: 103475003
-Ref: 103575003
-Ref: 103675003
-Ref: 103775003
-Ref: 103875536
-Ref: 103975536
-Ref: 104075882
-Ref: 104175882
-Ref: 104276005
-Ref: 104376637
-Ref: 104477196
-Ref: 104577357
-Ref: 104678042
-Ref: 104778042
-Ref: 104879467
-Ref: 104980259
-Ref: 105081291
-Ref: 105181929
-Ref: 105282548
-Ref: 105383299
-Ref: 105483639
-Ref: 105583789
-Ref: 105684771
-Ref: 105786322
-Ref: 105887995
-Ref: 105988953
-Ref: 106089262
-Ref: 106190267
-Ref: 106291667
-Ref: 106393205
-Ref: 106494238
-Ref: 106594573
-Ref: 106695533
-Ref: 106795946
-Ref: 106896908
-Ref: 106997312
-Ref: 107098402
-Ref: 107198667
-Node: 1.1.398987
-Ref: 107299229
-Ref: 107399290
-Ref: 1074102401
-Ref: 1075104090
-Ref: 1076104090
-Ref: 1077104215
-Ref: 1078112371
-Ref: 1079112371
-Ref: 1080112371
-Ref: 1081112371
-Ref: 1082112371
-Ref: 1083114851
-Node: 1.1.4117108
-Ref: 1084117592
-Ref: 1085117592
-Ref: 1086117592
-Ref: 1087117592
-Ref: 1088117592
-Ref: 1089118901
-Ref: 1090119230
-Ref: 1091119231
-Ref: 1092119231
-Ref: 1093119231
-Ref: 1094122069
-Ref: 1095122228
-Ref: 1096122920
-Ref: 1097123016
-Ref: 1098123591
-Ref: 1099123592
-Node: 1.1.5126776
-Ref: 1100127616
-Ref: 1101127621
-Ref: 1102127621
-Ref: 1103127621
-Ref: 1104128370
-Ref: 1105128375
-Ref: 1106129055
-Ref: 1107129115
-Ref: 1108129347
-Ref: 1109130980
-Ref: 1110130980
-Ref: 1111131605
-Ref: 1112131606
-Ref: 1113132401
-Ref: 1114133128
-Ref: 1115133316
-Node: 1.2134396
-Ref: 1116134542
-Ref: 1117134543
-Ref: 1118134893
-Ref: 1119134894
-Ref: 1120134894
-Ref: 1121135029
-Ref: 1122135029
-Ref: 1123135029
-Ref: 1124135165
-Ref: 1125135166
-Ref: 1126135166
-Ref: 1127135305
-Ref: 1128135306
-Ref: 1129135306
-Ref: 1130135439
-Ref: 1131135440
-Ref: 1132135440
-Ref: 1133135564
-Ref: 1134135564
-Ref: 1135135564
-Ref: 1136135696
-Ref: 1137135697
-Ref: 1138135844
-Ref: 1139135845
-Ref: 1140135845
-Ref: 1141136031
-Ref: 1142136032
-Ref: 1143136032
-Ref: 1144136213
-Ref: 1145136214
-Ref: 1146136214
-Ref: 1147136505
-Ref: 1148136506
-Ref: 1149136506
-Ref: 1150136616
-Ref: 1151136617
-Ref: 1152136848
-Node: 1.3137674
-Ref: 1153137814
-Ref: 1154138458
-Ref: 1155138459
-Ref: 1156138459
-Ref: 1157138459
-Ref: 1158138988
-Ref: 1159138989
-Ref: 1160139066
-Ref: 1161139067
-Ref: 1162139363
-Ref: 1163139364
-Ref: 1164139573
-Ref: 1165139574
-Ref: 1166139780
-Ref: 1167139781
-Ref: 1168140203
-Ref: 1169140204
-Ref: 1170140204
-Ref: 1171140204
-Node: 2140476
-Node: 2.1141213
-Ref: 1172141391
-Ref: 1173141648
-Ref: 1174141648
-Ref: 1175144462
-Ref: 1176145207
-Ref: 1177145363
-Ref: 1178145625
-Ref: 1179145783
-Ref: 1180145939
-Ref: 1181146089
-Ref: 1182146247
-Ref: 1183146416
-Ref: 1184146571
-Ref: 1185146724
-Ref: 1186146893
-Ref: 1187147042
-Ref: 1188147197
-Ref: 1189147352
-Ref: 1190147540
-Ref: 1191147884
-Ref: 1192148140
-Ref: 1193148358
-Ref: 1194148519
-Ref: 1195148728
-Ref: 1196152194
-Ref: 1197152195
-Ref: 1198152195
-Ref: 1199152195
-Ref: 1200152195
-Ref: 1201152195
-Ref: 1202152195
-Ref: 1203152195
-Ref: 1204152195
-Ref: 1205152195
-Ref: 1206152195
-Ref: 1207152195
-Ref: 1208152195
-Ref: 1209152195
-Ref: 1210152195
-Ref: 1211152195
-Ref: 1212152195
-Ref: 1213152195
-Ref: 1214152195
-Ref: 1215152195
-Ref: 1216152195
-Ref: 1217152195
-Ref: 1218152195
-Ref: 1219152195
-Ref: 1220152195
-Ref: 1221152195
-Ref: 1222152195
-Ref: 1223152195
-Ref: 1224152289
-Ref: 1225152290
-Ref: 1226156705
-Ref: 1227158182
-Ref: 1228158553
-Node: 2.2160291
-Ref: 1229160505
-Ref: 1230160578
-Ref: 1231160578
-Ref: 1232161079
-Ref: 1233161086
-Ref: 1234161439
-Ref: 1235162507
-Ref: 1236162652
-Ref: 1237164252
-Node: 2.3164463
-Ref: 1238164720
-Ref: S0002164720
-Ref: 1239164733
-Ref: 1240164751
-Ref: 1241164770
-Ref: 1242164878
-Ref: S0003164878
-Ref: S0004164878
-Ref: 1243164893
-Ref: 1244164920
-Ref: 1245164947
-Ref: 1246164974
-Ref: 1247165000
-Ref: 1248165023
-Ref: 1249165154
-Ref: S0005165154
-Ref: 1250165169
-Ref: 1251165196
-Ref: 1252165229
-Ref: 1253165254
-Ref: 1254166019
-Ref: 1255171629
-Ref: 1256171915
-Node: 2.4172888
-Ref: 1257173000
-Ref: 1258173076
-Ref: 1259173135
-Ref: 1260173257
-Ref: S0006173257
-Ref: 1261173261
-Ref: 1262173280
-Node: 2.4.1173493
-Ref: 1263173603
-Ref: 1264173771
-Ref: S0007173771
-Ref: 1265173775
-Ref: 1266173786
-Ref: 1267173796
-Ref: 1268173821
-Ref: S0008173821
-Ref: 1269173825
-Ref: 1270173834
-Ref: 1271173845
-Ref: 1272173868
-Ref: S0009173868
-Ref: 1273173879
-Ref: 1274173893
-Ref: 1275173947
-Ref: S0010173947
-Node: 2.4.2175282
-Ref: 1276175389
-Ref: 1277175390
-Ref: 1278175390
-Ref: 1279175390
-Ref: 1280175390
-Ref: 1281175390
-Ref: 1282175390
-Ref: 1283175390
-Ref: 1284175390
-Ref: 1285175390
-Ref: 1286175546
-Ref: S0011175546
-Ref: 1287175559
-Ref: 1288175566
-Ref: 1289175582
-Ref: 1290175600
-Ref: 1291175622
-Ref: S0012175622
-Ref: 1292175626
-Ref: 1293175656
-Ref: S0013175656
-Ref: 1294175669
-Ref: 1295175686
-Ref: 1296175697
-Ref: 1297175735
-Ref: S0014175735
-Ref: 1298175739
-Ref: 1299175818
-Node: 2.5177092
-Ref: 1300177374
-Ref: S0015177374
-Ref: 1301177380
-Node: 2.6178055
-Ref: 1302178458
-Ref: 1303178524
-Ref: S0016178524
-Ref: 1304178531
-Ref: 1305178570
-Ref: S0017178570
-Ref: 1306178599
-Ref: 1307178797
-Ref: 1308179114
-Node: 2.7180528
-Ref: 1309180762
-Ref: S0018180762
-Ref: 1310180786
-Node: 2.8181454
-Ref: 1311181548
-Ref: 1312182562
-Ref: S0019182562
-Ref: 1313182582
-Ref: 1314182595
-Ref: 1315182626
-Ref: 1316182726
-Ref: S0020182726
-Ref: 1317182758
-Ref: 1318182773
-Ref: 1319182805
-Ref: 1320182820
-Ref: 1321182857
-Ref: 1322182873
-Ref: 1323182904
-Ref: 1324182920
-Ref: 1325184465
-Ref: 1326184465
-Ref: 1327184539
-Ref: 1328184540
-Ref: 1329184893
-Ref: 1330184894
-Ref: 1331189048
-Ref: 1332189048
-Ref: 1333189276
-Ref: 1334194513
-Ref: 1335194761
-Ref: 1336195307
-Ref: 1337196106
-Ref: 1338196107
-Ref: 1339196112
-Ref: 1340196142
-Ref: 1341196143
-Ref: 1342196166
-Ref: 1343196167
-Ref: 1344196176
-Ref: 1345199051
-Node: 2.9199998
-Ref: 1346200267
-Ref: 1347202364
-Ref: 1348202871
-Ref: 1349203702
-Node: 3204361
-Node: 3.1204986
-Ref: 1350205078
-Ref: 1351205165
-Ref: 1352205622
-Ref: S0021205622
-Ref: 1353205637
-Ref: 1354205658
-Ref: 1355205688
-Ref: 1356205711
-Ref: 1357205740
-Ref: 1358205767
-Ref: 1359205809
-Ref: 1360205840
-Ref: 1361205882
-Ref: 1362205906
-Ref: 1363205937
-Ref: 1364205963
-Ref: 1365205993
-Ref: 1366206042
-Ref: S0022206042
-Ref: 1367206046
-Ref: 1368206107
-Ref: 1369206195
-Ref: 1370206196
-Ref: 1371206820
-Ref: 1372208242
-Ref: 1373208242
-Ref: 1374209766
-Ref: 1375209766
-Ref: 1376209766
-Ref: 1377210408
-Ref: 1378210842
-Ref: 1379210943
-Ref: 1380211042
-Ref: 1381211362
-Ref: 1382211597
-Ref: 1383212228
-Ref: 1384212310
-Ref: 1385212311
-Ref: 1386212669
-Ref: 1387212670
-Ref: 1388215131
-Ref: 1389215201
-Ref: 1390215269
-Ref: 1391216724
-Ref: 1392216795
-Ref: 1393217072
-Node: 3.2222831
-Ref: 1394222993
-Ref: 1395222993
-Ref: 1396223128
-Ref: 1397223875
-Ref: 1398223876
-Ref: 1399223920
-Ref: 1400224063
-Ref: 1401224114
-Ref: 1402224181
-Ref: 1403224182
-Ref: 1404224256
-Ref: 1405224420
-Ref: 1406228349
-Ref: 1407228488
-Ref: 1408228489
-Ref: 1409228596
-Ref: 1410228957
-Ref: 1411228958
-Ref: 1412228958
-Ref: 1413229659
-Ref: 1414229927
-Ref: 1415230168
-Ref: 1416230436
-Ref: 1417230436
-Ref: 1418231338
-Ref: 1419231456
-Ref: 1420231456
-Ref: 1421231940
-Ref: 1422232131
-Ref: 1423232131
-Ref: 1424232209
-Ref: 1425232209
-Ref: 1426232342
-Ref: 1427232377
-Ref: 1428232377
-Ref: 1429233800
-Ref: 1430233800
-Ref: 1431233800
-Ref: 1432233800
-Ref: 1433235349
-Ref: 1434235952
-Ref: 1435236044
-Ref: 1436236185
-Node: 3.2.1242205
-Ref: 1437242440
-Ref: S0023242440
-Ref: 1438242446
-Ref: 1439242478
-Ref: 1440242516
-Ref: 1441242551
-Ref: 1442242637
-Ref: S0024242637
-Ref: 1443242657
-Ref: 1444242678
-Ref: 1445242706
-Ref: 1446242742
-Ref: 1447242775
-Ref: 1448242807
-Ref: 1449242888
-Ref: S0025242888
-Ref: 1450242903
-Ref: 1451242935
-Ref: 1452242969
-Ref: 1453242994
-Ref: 1454243026
-Ref: 1455243053
-Ref: 1456243086
-Ref: 1457243114
-Ref: 1458243317
-Ref: 1459243747
-Ref: 1460243870
-Ref: 1461244062
-Ref: 1462244869
-Ref: 1463245080
-Ref: 1464245153
-Ref: 1465245818
-Ref: 1466246307
-Ref: 1467247242
-Ref: 1468247341
-Ref: 1469250853
-Node: 3.2.2250986
-Ref: 1470251324
-Ref: S0026251324
-Ref: 1471251345
-Ref: 1472251368
-Ref: 1473251401
-Ref: 1474251481
-Ref: S0027251481
-Ref: 1475251488
-Ref: 1476251510
-Ref: 1477251524
-Ref: 1478251556
-Ref: S0028251556
-Ref: 1479251569
-Ref: 1480251890
-Ref: S0029251890
-Ref: 1481251894
-Ref: 1482251915
-Ref: 1483251961
-Ref: S0030251961
-Ref: 1484251976
-Ref: 1485251995
-Ref: 1486252015
-Ref: 1487252060
-Ref: S0031252060
-Ref: 1488252075
-Ref: 1489252094
-Ref: 1490252219
-Ref: 1491252677
-Ref: 1492252772
-Ref: 1493253130
-Ref: 1494253130
-Ref: 1495253581
-Ref: 1496253878
-Ref: 1497255350
-Ref: 1498256179
-Ref: 1499256391
-Node: 3.2.3256522
-Ref: 1500256746
-Ref: 1501256965
-Ref: 1502257136
-Ref: 1503258373
-Ref: 1504259229
-Ref: 1505260690
-Ref: 1506260842
-Ref: 1507261232
-Node: 3.2.4262643
-Ref: 1508263049
-Ref: 1509263049
-Ref: 1510263049
-Ref: 1511263049
-Ref: 1512263049
-Ref: 1513263049
-Ref: 1514263049
-Ref: 1515263668
-Ref: 1516264445
-Ref: 1517264445
-Ref: 1518264445
-Ref: 1519267598
-Ref: 1520267598
-Ref: 1521271721
-Ref: 1522272609
-Ref: 1523272609
-Ref: 1524274994
-Ref: 1525274994
-Ref: 1526274994
-Ref: 1527274994
-Ref: 1528275867
-Ref: 1529279793
-Ref: 1530279934
-Node: 3.3281233
-Ref: 1531281432
-Ref: 1532281746
-Ref: 1533282794
-Ref: 1534282795
-Ref: 1535282795
-Ref: 1536282795
-Ref: 1537282795
-Ref: 1538282795
-Ref: 1539283256
-Ref: 1540283424
-Ref: 1541283564
-Ref: 1542286028
-Ref: 1543286126
-Ref: 1544286127
-Ref: 1545286301
-Ref: 1546286302
-Ref: 1547287017
-Ref: 1548287017
-Ref: 1549289221
-Ref: 1550290088
-Ref: 1551292445
-Node: 3.3.1293812
-Ref: 1552293954
-Ref: 1553293955
-Ref: 1554293955
-Ref: 1555294117
-Ref: 1556294118
-Ref: 1557294118
-Ref: 1558294413
-Ref: S0032294413
-Ref: 1559294427
-Ref: 1560294475
-Ref: 1561294504
-Ref: 1562294530
-Ref: 1563294562
-Ref: 1564294610
-Ref: 1565294638
-Ref: 1566294664
-Ref: 1567294696
-Ref: 1568294744
-Ref: 1569294776
-Ref: 1570294802
-Ref: 1571294834
-Ref: 1572294867
-Ref: 1573294928
-Ref: S0033294928
-Ref: 1574294940
-Ref: 1575294963
-Ref: 1576295036
-Ref: 1577295177
-Ref: 1578295234
-Ref: 1579295728
-Ref: 1580295815
-Ref: 1581296522
-Ref: 1582296963
-Ref: 1583297518
-Ref: 1584297815
-Ref: 1585297874
-Ref: 1586297875
-Ref: 1587297977
-Ref: 1588297978
-Ref: 1589298063
-Ref: 1590298673
-Ref: 1591299568
-Ref: 1592300535
-Ref: 1593301280
-Ref: 1594301502
-Ref: 1595301742
-Ref: 1596301743
-Ref: 1597301967
-Ref: 1598303799
-Ref: 1599307538
-Ref: 1600309093
-Ref: 1601309094
-Ref: 1602311040
-Ref: 1603313115
-Ref: 1604313938
-Ref: 1605314144
-Ref: 1606314914
-Node: 3.3.2315404
-Ref: 1607315619
-Ref: 1608316099
-Ref: S0034316099
-Ref: 1609316114
-Ref: 1610316160
-Ref: 1611316224
-Ref: 1612316912
-Ref: 1613316964
-Ref: 1614317687
-Node: 3.4318571
-Ref: 1615318760
-Ref: 1616318932
-Ref: 1617319593
-Ref: 1618319594
-Ref: 1619320400
-Ref: S0035320400
-Ref: 1620320446
-Ref: 1621320471
-Ref: 1622320493
-Ref: 1623320652
-Ref: 1624320653
-Ref: 1625322120
-Ref: 1626324709
-Ref: 1627326416
-Ref: 1628326416
-Ref: 1629326594
-Ref: 1630327385
-Ref: 1631330360
-Ref: 1632330361
-Ref: 1633330735
-Ref: 1634330736
-Ref: 1635330736
-Ref: 1636334168
-Ref: 1637334512
-Ref: 1638335080
-Ref: 1639337554
-Ref: 1640338505
-Ref: 1641340579
-Ref: 1642341055
-Ref: 1643341785
-Ref: 1644342489
-Ref: 1645342931
-Ref: 1646343421
-Ref: 1647346932
-Ref: 1648347500
-Ref: 1649348592
-Ref: 1650349557
-Ref: 1651350608
-Node: 3.4.1351630
-Ref: 1652351946
-Ref: 1653352257
-Ref: 1654352258
-Ref: 1655352258
-Ref: 1656353162
-Ref: 1657353618
-Ref: 1658354239
-Ref: 1659355230
-Ref: 1660355550
-Ref: 1661355550
-Ref: 1662355550
-Ref: 1663355550
-Ref: 1664358420
-Ref: 1665358420
-Ref: 1666358575
-Ref: 1667358754
-Ref: 1668359099
-Ref: 1669359179
-Ref: 1670359180
-Ref: 1671361275
-Node: 3.5363032
-Ref: 1672363136
-Ref: 1673363207
-Ref: 1674363270
-Ref: 1675363349
-Ref: 1676363570
-Ref: S0036363570
-Ref: 1677363582
-Ref: 1678363601
-Ref: S0037363601
-Ref: 1679363607
-Ref: 1680363643
-Ref: 1681363664
-Ref: 1682363928
-Ref: 1683363928
-Ref: 1684363928
-Ref: 1685363928
-Ref: 1686364127
-Ref: 1687364325
-Ref: 1688364442
-Ref: 1689364518
-Ref: 1690364676
-Ref: 1691364905
-Ref: 1692366624
-Ref: 1693367322
-Ref: 1694368111
-Ref: 1695368111
-Ref: 1696368185
-Ref: 1697368421
-Ref: 1698368569
-Ref: 1699369385
-Ref: 1700369463
-Ref: 1701369716
-Ref: 1702369716
-Ref: 1703369944
-Ref: 1704369959
-Ref: 1705370175
-Ref: 1706370190
-Ref: 1707370395
-Ref: 1708370410
-Ref: 1709370476
-Ref: 1710370491
-Ref: 1711370645
-Ref: 1712370657
-Ref: 1713370672
-Ref: 1714370973
-Ref: 1715371323
-Ref: 1716371338
-Ref: 1717371624
-Ref: 1718371639
-Ref: 1719371808
-Ref: 1720371973
-Ref: 1721371974
-Ref: 1722372460
-Ref: 1723372461
-Ref: 1724372935
-Ref: 1725372950
-Ref: 1726373119
-Ref: 1727373284
-Ref: 1728373285
-Ref: 1729373786
-Ref: 1730373787
-Ref: 1731374279
-Ref: 1732374294
-Ref: 1733374532
-Ref: 1734375424
-Ref: 1735376252
-Ref: 1736378672
-Ref: 1737378687
-Ref: 1738378983
-Ref: 1739379797
-Ref: 1740379812
-Ref: 1741380799
-Ref: 1742380814
-Ref: 1743381136
-Ref: 1744381151
-Ref: 1745381408
-Ref: 1746381423
-Ref: 1747381680
-Ref: 1748381695
-Ref: 1749382147
-Ref: 1750382148
-Ref: 1751382654
-Ref: 1752382655
-Ref: 1753383500
-Ref: 1754384021
-Ref: 1755384022
-Ref: 1756385344
-Ref: 1757385560
-Ref: 1758385561
-Ref: 1759385766
-Ref: 1760385781
-Ref: 1761386203
-Ref: 1762386204
-Ref: 1763386685
-Ref: 1764386686
-Ref: 1765387818
-Ref: 1766387833
-Ref: 1767388220
-Ref: 1768388221
-Ref: 1769388692
-Ref: 1770388693
-Ref: 1771389351
-Ref: 1772389366
-Ref: 1773389572
-Ref: 1774389587
-Ref: 1775389778
-Ref: 1776389793
-Ref: 1777391748
-Ref: 1778391748
-Ref: 1779392940
-Ref: 1780394788
-Ref: 1781395888
-Ref: 1782397364
-Ref: 1783398028
-Ref: 1784399535
-Ref: 1785399754
-Node: 3.5.1400328
-Ref: 1786400441
-Ref: 1787400579
-Ref: S0038400579
-Ref: 1788400593
-Ref: 1789400630
-Ref: 1790400713
-Ref: S0039400713
-Ref: 1791400719
-Ref: 1792400741
-Ref: 1793400808
-Ref: S0040400808
-Ref: 1794400812
-Ref: 1795401564
-Ref: 1796402695
-Ref: 1797403035
-Ref: 1798403479
-Ref: 1799403479
-Ref: 1800403479
-Ref: 1801405497
-Node: 3.5.2406397
-Ref: 1802406565
-Ref: 1803406792
-Ref: 1804406793
-Ref: 1805406793
-Ref: 1806406793
-Ref: 1807407470
-Ref: 1808407471
-Ref: 1809407639
-Ref: 1810407640
-Ref: 1811407640
-Ref: 1812408153
-Ref: 1813408154
-Ref: 1814410441
-Ref: 1815410900
-Ref: 1816411467
-Ref: 1817412102
-Ref: 1818414403
-Ref: 1819415669
-Node: 3.5.3415671
-Ref: 1820415835
-Ref: 1821415940
-Ref: 1822415941
-Ref: 1823416031
-Node: 3.5.4416540
-Ref: 1824416658
-Ref: 1825416658
-Ref: 1826416658
-Ref: 1827417034
-Ref: 1828417108
-Ref: S0041417108
-Ref: 1829417112
-Ref: 1830417146
-Ref: 1831417214
-Ref: S0042417214
-Ref: 1832417232
-Ref: 1833417266
-Ref: 1834418072
-Ref: S0043418072
-Ref: 1835418088
-Ref: 1836418151
-Ref: 1837418283
-Ref: 1838418576
-Ref: 1839418576
-Ref: 1840418576
-Ref: 1841419476
-Ref: 1842419677
-Ref: 1843419678
-Ref: 1844420474
-Ref: 1845420480
-Ref: 1846420594
-Ref: 1847420595
-Ref: 1848420739
-Ref: 1849422198
-Ref: 1850422198
-Ref: 1851422411
-Ref: 1852422411
-Ref: 1853422411
-Ref: 1854422769
-Ref: 1855422770
-Ref: 1856424653
-Ref: 1857424832
-Ref: 1858424847
-Ref: 1859425177
-Ref: 1860425192
-Ref: 1861425347
-Ref: 1862425689
-Ref: 1863425689
-Ref: 1864425689
-Ref: 1865425881
-Ref: 1866425881
-Ref: 1867425881
-Ref: 1868426057
-Ref: 1869426151
-Ref: 1870426760
-Ref: 1871426760
-Ref: 1872427602
-Ref: 1873428556
-Ref: 1874429663
-Ref: 1875431110
-Ref: 1876432282
-Ref: 1877432282
-Ref: 1878433838
-Ref: 1879436455
-Node: 3.5.5436922
-Ref: 1880437193
-Ref: 1881437208
-Ref: 1882437524
-Ref: 1883437539
-Ref: 1884437715
-Ref: 1885437730
-Ref: 1886437838
-Ref: 1887437839
-Ref: 1888438734
-Ref: 1889438749
-Ref: 1890439007
-Ref: 1891439022
-Ref: 1892440533
-Ref: 1893441455
-Ref: 1894443111
-Ref: 1895443393
-Node: 3.5.6443722
-Ref: 1896443834
-Ref: 1897444063
-Ref: S0044444063
-Ref: 1898444076
-Ref: 1899444104
-Ref: 1900444176
-Ref: 1901445071
-Ref: 1902445071
-Ref: 1903445252
-Ref: 1904445562
-Ref: 1905447153
-Node: 3.5.7449301
-Ref: 1906449433
-Ref: 1907449655
-Ref: S0045449655
-Ref: 1908449681
-Ref: 1909449693
-Ref: 1910449751
-Ref: S0046449751
-Ref: 1911449776
-Ref: 1912449804
-Ref: 1913449874
-Ref: 1914450084
-Ref: 1915450143
-Ref: 1916450314
-Ref: 1917450531
-Ref: 1918451559
-Ref: 1919451708
-Ref: 1920452369
-Ref: 1921452503
-Ref: 1922453074
-Ref: 1923453209
-Ref: 1924453210
-Ref: 1925453827
-Ref: 1926453828
-Ref: 1927454486
-Ref: 1928454492
-Ref: 1929454669
-Ref: 1930454829
-Ref: 1931454988
-Ref: 1932455153
-Ref: 1933455153
-Ref: 1934456046
-Ref: 1935457830
-Node: 3.5.8459899
-Ref: 1936460190
-Ref: 1937460205
-Ref: 1938460815
-Node: 3.5.9461658
-Ref: 1939461785
-Ref: 1940461785
-Ref: 1941461785
-Ref: 1942461874
-Ref: 1943462061
-Ref: S0047462061
-Ref: 1944462065
-Ref: 1945462100
-Ref: 1946462176
-Ref: S0048462176
-Ref: 1947462202
-Ref: 1948462214
-Ref: 1949462277
-Ref: S0049462277
-Ref: 1950462303
-Ref: 1951462328
-Ref: 1952462340
-Ref: 1953462424
-Ref: S0050462424
-Ref: 1954462451
-Ref: 1955462470
-Ref: 1956462540
-Ref: 1957462742
-Ref: 1958462743
-Ref: 1959462743
-Ref: 1960463409
-Ref: 1961463523
-Ref: 1962463670
-Ref: 1963464969
-Ref: 1964465123
-Ref: 1965465413
-Ref: 1966465414
-Ref: 1967465716
-Ref: 1968466113
-Ref: 1969466171
-Ref: 1970466331
-Ref: 1971466332
-Ref: 1972466583
-Ref: 1973467072
-Ref: 1974467125
-Ref: 1975467490
-Ref: 1976469430
-Ref: 1977469530
-Ref: 1978469531
-Ref: 1979469761
-Ref: 1980472308
-Ref: 1981472658
-Ref: 1982473789
-Node: 3.5.10474630
-Ref: 1983474902
-Ref: 1984474917
-Ref: 1985475099
-Ref: 1986475100
-Ref: 1987475349
-Ref: 1988475349
-Ref: 1989475455
-Ref: 1990475470
-Ref: 1991475798
-Ref: 1992475813
-Ref: 1993476362
-Ref: 1994476377
-Ref: 1995476959
-Ref: 1996476974
-Ref: 1997477298
-Ref: 1998478409
-Ref: 1999478424
-Ref: 2000478537
-Ref: 2001478906
-Ref: 2002478921
-Ref: 2003479599
-Node: 3.6480415
-Ref: 2004480517
-Ref: 2005480517
-Ref: 2006480885
-Ref: S0051480885
-Ref: 2007480898
-Ref: 2008480931
-Ref: 2009480998
-Ref: S0052480998
-Ref: 2010481017
-Ref: 2011481045
-Ref: 2012481075
-Ref: 2013481134
-Ref: S0053481134
-Ref: 2014481138
-Ref: 2015481197
-Ref: S0054481197
-Ref: 2016481217
-Ref: 2017481248
-Ref: 2018481287
-Ref: 2019481343
-Ref: S0055481343
-Ref: 2020481357
-Ref: 2021481378
-Ref: 2022481477
-Ref: S0056481477
-Ref: 2023481500
-Ref: 2024481537
-Ref: 2025481607
-Ref: 2026481937
-Ref: 2027482051
-Ref: 2028482123
-Ref: 2029482317
-Ref: 2030482718
-Ref: 2031482718
-Ref: 2032482718
-Ref: 2033483331
-Ref: 2034483379
-Ref: 2035483438
-Ref: 2036483561
-Ref: 2037484033
-Ref: 2038484033
-Ref: 2039484288
-Ref: 2040484459
-Ref: 2041484459
-Ref: 2042484716
-Ref: 2043485578
-Ref: 2044485888
-Ref: 2045486190
-Ref: 2046486472
-Ref: 2047486784
-Ref: 2048487150
-Ref: 2049487536
-Ref: 2050488086
-Ref: 2051488086
-Ref: 2052489367
-Ref: 2053491180
-Ref: 2054492837
-Ref: 2055493542
-Node: 3.6.1493820
-Ref: 2056494178
-Ref: S0057494178
-Ref: 2057494185
-Ref: 2058494203
-Ref: 2059494242
-Ref: S0058494242
-Ref: 2060494256
-Ref: 2061494277
-Ref: 2062494335
-Ref: 2063494451
-Ref: 2064495148
-Ref: 2065495334
-Ref: 2066495535
-Ref: 2067495653
-Ref: 2068495971
-Ref: 2069496085
-Ref: 2070497511
-Node: 3.6.2498494
-Ref: 2071499389
-Ref: 2072499404
-Ref: 2073499533
-Ref: 2074499548
-Ref: 2075499675
-Ref: 2076499690
-Ref: 2077499817
-Ref: 2078499832
-Ref: 2079499959
-Ref: 2080499974
-Ref: 2081500107
-Ref: 2082500122
-Ref: 2083500276
-Ref: 2084500291
-Ref: 2085500456
-Ref: 2086500471
-Ref: 2087501730
-Node: 3.6.3502858
-Ref: 2088503006
-Ref: 2089504632
-Ref: 2090504921
-Ref: 2091505225
-Ref: 2092505589
-Ref: 2093506088
-Node: 3.7506124
-Ref: 2094506291
-Ref: 2095506291
-Ref: 2096506292
-Ref: 2097507163
-Ref: 2098507164
-Ref: 2099509529
-Ref: S0059509529
-Ref: 2100509533
-Ref: 2101509562
-Ref: 2102509625
-Ref: S0060509625
-Ref: 2103509666
-Ref: S0061509666
-Ref: 2104509680
-Ref: 2105509710
-Ref: 2106509804
-Ref: S0062509804
-Ref: 2107509817
-Ref: 2108509845
-Ref: 2109509861
-Ref: 2110509878
-Ref: 2111509912
-Ref: 2112509939
-Ref: 2113509961
-Ref: 2114510013
-Ref: S0063510013
-Ref: 2115510017
-Ref: 2116510081
-Ref: 2117510564
-Ref: 2118511934
-Ref: 2119514631
-Ref: 2120521595
-Ref: 2121521896
-Ref: 2122522341
-Ref: 2123522965
-Ref: 2124525633
-Ref: 2125525633
-Ref: 2126525633
-Ref: 2127525633
-Ref: 2128525752
-Ref: 2129525753
-Ref: 2130526114
-Ref: 2131526115
-Ref: 2132528488
-Ref: 2133529824
-Ref: 2134534185
-Ref: 2135536748
-Ref: 2136537344
-Node: 3.7.1537694
-Ref: 2137538228
-Ref: S0064538228
-Ref: 2138538242
-Ref: 2139538270
-Ref: 2140538329
-Ref: S0065538329
-Ref: 2141538356
-Ref: 2142538386
-Ref: 2143538405
-Ref: 2144538425
-Ref: 2145538532
-Ref: 2146538880
-Ref: 2147538966
-Ref: 2148539247
-Ref: 2149540114
-Ref: 2150542518
-Ref: 2151543069
-Ref: 2152543237
-Ref: 2153543591
-Ref: 2154545170
-Ref: 2155546027
-Node: 3.7.2547563
-Ref: 2156548264
-Ref: 2157548279
-Ref: 2158550678
-Ref: 2159551586
-Node: 3.8553034
-Ref: 2160553138
-Ref: 2161553138
-Ref: 2162553301
-Ref: 2163553374
-Ref: S0066553374
-Ref: 2164553409
-Ref: 2165553458
-Ref: S0067553458
-Ref: 2166553491
-Ref: 2167553569
-Ref: S0068553569
-Ref: 2168553585
-Ref: 2169553601
-Ref: 2170553628
-Ref: 2171553644
-Ref: 2172553748
-Ref: S0069553748
-Ref: 2173553757
-Ref: 2174553782
-Ref: 2175553852
-Ref: S0070553852
-Ref: 2176553865
-Ref: 2177553892
-Ref: 2178553917
-Ref: 2179553957
-Ref: 2180554032
-Ref: 2181554282
-Ref: 2182555864
-Ref: 2183558118
-Ref: 2184558119
-Ref: 2185558241
-Ref: 2186558462
-Ref: 2187558931
-Ref: 2188559079
-Ref: 2189559182
-Ref: 2190559329
-Ref: 2191559864
-Ref: 2192559865
-Ref: 2193559865
-Ref: 2194560277
-Ref: 2195561237
-Ref: 2196563124
-Ref: 2197564136
-Ref: 2198565907
-Ref: 2199566017
-Ref: 2200566851
-Node: 3.8.1567043
-Ref: 2201567396
-Ref: 2202568110
-Ref: S0071568110
-Ref: 2203568141
-Ref: 2204568168
-Ref: 2205568188
-Ref: 2206568230
-Ref: S0072568230
-Ref: 2207568248
-Ref: 2208568283
-Ref: 2209568326
-Ref: S0073568326
-Ref: 2210568330
-Ref: 2211568350
-Ref: 2212568442
-Ref: S0074568442
-Ref: 2213568451
-Ref: 2214568481
-Ref: 2215568502
-Ref: 2216568575
-Ref: 2217568790
-Ref: 2218569641
-Ref: 2219571297
-Ref: 2220573302
-Ref: 2221573302
-Ref: 2222575541
-Ref: 2223576524
-Ref: 2224577663
-Ref: 2225578065
-Node: 3.9579220
-Ref: 2226579366
-Ref: 2227579366
-Ref: 2228579367
-Ref: 2229579367
-Ref: 2230579367
-Ref: 2231579526
-Ref: 2232579527
-Ref: 2233579527
-Ref: 2234585517
-Ref: 2235585919
-Ref: 2236585920
-Ref: 2237586047
-Ref: 2238586048
-Ref: 2239586048
-Ref: 2240588023
-Ref: 2241588356
-Ref: 2242588425
-Ref: 2243588426
-Ref: 2244588426
-Ref: 2245588426
-Ref: 2246589097
-Ref: 2247592019
-Ref: 2248592090
-Ref: 2249592202
-Ref: 2250592277
-Ref: 2251592333
-Ref: 2252592399
-Ref: 2253592475
-Ref: 2254592530
-Ref: 2255592628
-Ref: 2256592708
-Ref: 2257592847
-Ref: 2258592930
-Ref: 2259593031
-Ref: 2260593133
-Ref: 2261593183
-Ref: 2262600037
-Ref: 2263601248
-Ref: 2264601983
-Ref: 2265601998
-Ref: 2266602249
-Ref: 2267602264
-Ref: 2268603360
-Ref: 2269603375
-Ref: 2270603893
-Ref: 2271603908
-Ref: 2272604473
-Ref: 2273605643
-Ref: 2274605933
-Ref: 2275606267
-Ref: 2276606684
-Ref: 2277607238
-Ref: 2278607358
-Ref: 2279609033
-Ref: 2280615492
-Ref: 2281615492
-Ref: 2282615819
-Ref: 2283615959
-Ref: 2284617757
-Ref: 2285618426
-Ref: 2286619283
-Ref: 2287619976
-Node: 3.9.1620784
-Ref: 2288620924
-Ref: 2289620924
-Ref: 2290620925
-Ref: 2291620925
-Ref: 2292620925
-Ref: 2293620925
-Ref: 2294621581
-Ref: S0075621581
-Ref: 2295621591
-Ref: 2296622009
-Ref: 2297626322
-Ref: 2298627186
-Ref: 2299627392
-Ref: 2300631219
-Ref: 2301631356
-Node: 3.9.2631852
-Ref: 2302632079
-Ref: 2303632080
-Ref: 2304632080
-Ref: 2305632080
-Ref: 2306632080
-Ref: 2307632080
-Ref: 2308632080
-Ref: 2309632080
-Ref: 2310633065
-Ref: 2311633066
-Ref: 2312633066
-Ref: 2313633066
-Ref: 2314633066
-Ref: 2315634307
-Ref: 2316634308
-Ref: 2317634425
-Ref: 2318634617
-Ref: 2319634870
-Ref: 2320634871
-Ref: 2321635292
-Ref: 2322635292
-Ref: 2323636253
-Ref: 2324636689
-Ref: 2325636947
-Ref: 2326640383
-Ref: 2327640509
-Ref: 2328645632
-Ref: 2329645632
-Ref: 2330645831
-Ref: 2331646176
-Ref: 2332646177
-Ref: 2333646301
-Ref: 2334649636
-Ref: 2335657287
-Ref: 2336657442
-Ref: 2337658377
-Node: 3.9.3661054
-Ref: 2338661238
-Ref: 2339661238
-Ref: 2340661239
-Ref: 2341661239
-Ref: 2342661373
-Ref: 2343661374
-Ref: 2344662702
-Ref: S0076662702
-Ref: 2345662717
-Ref: 2346662748
-Ref: 2347662799
-Ref: 2348662903
-Ref: 2349662904
-Ref: 2350664032
-Ref: 2351664033
-Ref: 2352669315
-Ref: 2353679934
-Ref: 2354682863
-Ref: 2355684116
-Ref: 2356684861
-Node: 3.9.4685748
-Ref: 2357687285
-Ref: S0077687285
-Ref: 2358687358
-Ref: 2359687467
-Ref: S0078687467
-Ref: 2360687482
-Ref: 2361687510
-Ref: 2362687657
-Ref: 2363687657
-Ref: 2364687998
-Ref: 2365687998
-Ref: 2366687999
-Ref: 2367687999
-Ref: 2368687999
-Ref: 2369687999
-Ref: 2370687999
-Ref: 2371687999
-Ref: 2372687999
-Ref: 2373687999
-Ref: 2374688481
-Ref: 2375688482
-Ref: 2376688482
-Ref: 2377688482
-Ref: 2378688482
-Ref: 2379688482
-Ref: 2380688482
-Ref: 2381690454
-Ref: 2382690455
-Ref: 2383694040
-Ref: 2384699474
-Node: 3.10699899
-Ref: 2385700007
-Ref: 2386700007
-Ref: 2387700007
-Ref: 2388700299
-Ref: 2389700300
-Ref: 2390700957
-Ref: S0079700957
-Ref: 2391700972
-Ref: 2392700988
-Ref: 2393701026
-Ref: 2394701042
-Ref: 2395701109
-Ref: S0080701109
-Ref: 2396701131
-Ref: 2397701156
-Ref: 2398701206
-Ref: S0081701206
-Ref: 2399701265
-Ref: S0082701265
-Ref: 2400701308
-Ref: 2401701364
-Ref: 2402701448
-Ref: S0083701448
-Ref: 2403701581
-Ref: S0084701581
-Ref: 2404701596
-Ref: 2405701630
-Ref: 2406701653
-Ref: 2407701698
-Ref: 2408701726
-Ref: 2409701770
-Ref: 2410701905
-Ref: 2411701906
-Ref: 2412701906
-Ref: 2413701906
-Ref: 2414702066
-Ref: 2415702244
-Ref: 2416702466
-Ref: 2417702466
-Ref: 2418703284
-Ref: 2419707701
-Ref: 2420707702
-Ref: 2421707904
-Ref: 2422708068
-Ref: 2423710210
-Ref: 2424710304
-Ref: 2425710409
-Ref: 2426715129
-Ref: 2427715130
-Ref: 2428715130
-Ref: 2429715627
-Ref: 2430715691
-Ref: 2431716611
-Ref: 2432718333
-Ref: 2433718334
-Ref: 2434721327
-Ref: 2435721534
-Ref: 2436721824
-Ref: 2437722117
-Ref: 2438723950
-Ref: 2439724766
-Ref: 2440726090
-Ref: 2441726826
-Node: 3.10.1729422
-Ref: 2442730100
-Ref: S0085730100
-Ref: 2443730110
-Ref: 2444730137
-Ref: 2445730275
-Ref: 2446730276
-Ref: 2447730566
-Ref: 2448730566
-Ref: 2449732997
-Ref: 2450735231
-Ref: 2451740997
-Ref: 2452741450
-Ref: 2453743509
-Ref: 2454745849
-Ref: 2455746982
-Ref: 2456748007
-Node: 3.10.2749816
-Ref: 2457751051
-Ref: 2458751717
-Ref: 2459751718
-Ref: 2460753569
-Ref: 2461753570
-Ref: 2462753570
-Ref: 2463753570
-Ref: 2464753570
-Ref: 2465753570
-Ref: 2466755056
-Ref: 2467755057
-Ref: 2468755061
-Ref: 2469755061
-Ref: 2470760133
-Ref: 2471760133
-Ref: 2472760133
-Ref: 2473770557
-Ref: 2474770558
-Ref: 2475772289
-Ref: 2476773816
-Ref: 2477776416
-Ref: 2478776416
-Ref: 2479781156
-Ref: 2480781156
-Ref: 2481799114
-Ref: 2482799129
-Ref: 2483799448
-Ref: 2484803607
-Ref: 2485805388
-Ref: 2486806491
-Ref: 2487806496
-Ref: 2488806511
-Ref: 2489806511
-Ref: 2490807736
-Ref: 2491808156
-Ref: 2492808171
-Ref: 2493808484
-Ref: 2494808575
-Ref: 2495808917
-Ref: 2496810740
-Ref: 2497810740
-Ref: 2498812499
-Ref: 2499812858
-Ref: 2500814119
-Ref: 2501814120
-Ref: 2502815832
-Ref: 2503816295
-Ref: 2504819097
-Ref: 2505820761
-Ref: 2506821906
-Ref: 2507824298
-Node: 3.11826549
-Ref: 2508826785
-Ref: S0086826785
-Ref: 2509826791
-Ref: 2510826833
-Ref: S0087826833
-Ref: 2511826847
-Ref: 2512826872
-Ref: 2513826964
-Ref: S0088826964
-Ref: 2514826978
-Ref: 2515826998
-Ref: 2516827014
-Ref: 2517827037
-Ref: S0089827037
-Ref: 2518827041
-Ref: 2519827056
-Ref: 2520827085
-Ref: S0090827085
-Ref: 2521827099
-Ref: 2522827117
-Ref: 2523827132
-Ref: 2524827144
-Ref: 2525827348
-Ref: 2526827399
-Ref: 2527827564
-Ref: 2528828212
-Ref: 2529828212
-Ref: 2530828615
-Ref: 2531829855
-Ref: 2532831885
-Ref: 2533831890
-Ref: 2534832052
-Node: 3.11.1834384
-Ref: 2535834624
-Ref: 2536834697
-Ref: 2537834846
-Ref: 2538837169
-Ref: 2539837298
-Ref: 2540839135
-Node: 4841228
-Node: 4.1841790
-Ref: 2541842400
-Ref: S0091842400
-Ref: 2542842415
-Ref: 2543842431
-Ref: 2544842462
-Ref: 2545842484
-Ref: 2546842500
-Ref: 2547842523
-Ref: 2548842553
-Ref: 2549842573
-Ref: 2550842597
-Ref: 2551842619
-Ref: 2552842650
-Ref: 2553842676
-Ref: 2554842716
-Ref: S0092842716
-Ref: 2555842720
-Ref: 2556842734
-Ref: 2557843020
-Ref: S0093843020
-Ref: 2558843024
-Ref: 2559843032
-Ref: 2560843081
-Ref: S0094843081
-Ref: 2561843085
-Ref: 2562843123
-Ref: S0095843123
-Ref: 2563843127
-Ref: 2564843478
-Ref: 2565843478
-Ref: 2566843677
-Ref: 2567844579
-Ref: 2568845934
-Ref: 2569846605
-Ref: 2570846772
-Ref: 2571846855
-Ref: 2572847035
-Ref: 2573847200
-Ref: 2574847201
-Ref: 2575847273
-Ref: 2576848349
-Ref: 2577852616
-Node: 4.1.1853947
-Ref: 2578854157
-Ref: 2579854226
-Ref: S0096854226
-Ref: 2580854230
-Ref: 2581854238
-Ref: 2582854252
-Ref: 2583854631
-Ref: 2584854876
-Ref: 2585855163
-Ref: 2586855274
-Ref: 2587855350
-Ref: 2588855351
-Ref: 2589855351
-Ref: 2590855481
-Node: 4.1.2856593
-Ref: 2591856698
-Ref: 2592856975
-Ref: S0097856975
-Ref: 2593856979
-Ref: 2594856987
-Ref: 2595857162
-Ref: 2596857655
-Ref: 2597857756
-Ref: 2598857756
-Ref: 2599857757
-Ref: 2600857757
-Ref: 2601857962
-Node: 4.1.3859485
-Ref: 2602859801
-Ref: 2603859871
-Ref: S0098859871
-Ref: 2604859875
-Ref: 2605859885
-Ref: 2606859920
-Ref: S0099859920
-Ref: 2607859924
-Ref: 2608859938
-Ref: 2609859958
-Ref: 2610860026
-Ref: 2611864227
-Ref: 2612864228
-Ref: 2613867887
-Ref: 2614867969
-Ref: 2615867969
-Ref: 2616868161
-Ref: 2617868162
-Ref: 2618869784
-Ref: 2619871017
-Ref: 2620871292
-Node: 4.1.4872189
-Ref: 2621872301
-Ref: 2622872540
-Ref: S0100872540
-Ref: 2623872544
-Ref: 2624872552
-Ref: 2625872628
-Ref: S0101872628
-Ref: 2626872642
-Ref: 2627872661
-Ref: 2628872746
-Ref: S0102872746
-Ref: 2629872750
-Ref: 2630872758
-Ref: 2631872819
-Ref: S0103872819
-Ref: 2632872838
-Ref: 2633875864
-Ref: 2634875864
-Ref: 2635878947
-Ref: 2636878947
-Ref: 2637880913
-Ref: 2638882164
-Node: 4.1.5885227
-Ref: 2639885683
-Ref: 2640885683
-Ref: 2641885912
-Ref: 2642885966
-Ref: 2643886098
-Ref: 2644886538
-Ref: S0104886538
-Ref: 2645886565
-Ref: 2646886771
-Ref: 2647887985
-Ref: 2648888203
-Ref: 2649888204
-Ref: 2650888294
-Ref: 2651889570
-Ref: 2652889748
-Node: 4.1.6890090
-Ref: 2653890826
-Ref: 2654890826
-Ref: 2655891588
-Ref: 2656891588
-Ref: 2657892674
-Ref: 2658892750
-Ref: 2659894446
-Ref: S0105894446
-Ref: 2660894478
-Ref: 2661894485
-Ref: 2662894736
-Ref: 2663895021
-Ref: 2664895021
-Ref: 2665895829
-Ref: 2666895829
-Ref: 2667898069
-Node: 4.2898657
-Ref: 2668898754
-Ref: 2669898945
-Ref: 2670899406
-Ref: 2671899406
-Ref: 2672900115
-Ref: 2673900898
-Ref: 2674900898
-Ref: 2675900898
-Ref: 2676900949
-Ref: 2677900949
-Ref: 2678900949
-Ref: 2679900949
-Ref: 2680901041
-Ref: 2681901456
-Ref: 2682901456
-Ref: 2683901766
-Ref: 2684902731
-Ref: 2685903089
-Ref: 2686903817
-Node: 4.3903958
-Ref: 2687904059
-Ref: 2688904174
-Ref: 2689904234
-Ref: S0106904234
-Ref: 2690904238
-Ref: 2691904258
-Ref: 2692904280
-Ref: 2693904384
-Ref: 2694906007
-Ref: 2695906296
-Ref: 2696906366
-Ref: 2697907469
-Ref: 2698907469
-Ref: 2699907578
-Ref: 2700908082
-Ref: 2701908671
-Ref: 2702909770
-Node: 4.3.1909927
-Ref: 2703910260
-Ref: S0107910260
-Ref: 2704910266
-Ref: 2705910342
-Ref: S0108910342
-Ref: 2706910356
-Ref: 2707910388
-Ref: 2708910506
-Ref: S0109910506
-Ref: 2709910521
-Ref: 2710910547
-Ref: 2711910568
-Ref: 2712910625
-Ref: S0110910625
-Ref: 2713910650
-Ref: 2714910677
-Ref: 2715910712
-Ref: 2716910842
-Ref: 2717912429
-Ref: 2718912777
-Ref: 2719914311
-Ref: 2720914447
-Ref: 2721920259
-Ref: 2722920391
-Ref: 2723920672
-Ref: 2724921051
-Ref: 2725923792
-Ref: 2726924335
-Ref: 2727924778
-Ref: 2728925354
-Node: 4.3.2926404
-Ref: 2729927283
-Ref: S0111927283
-Ref: 2730927298
-Ref: 2731927317
-Ref: 2732927373
-Ref: S0112927373
-Ref: 2733927377
-Ref: 2734927391
-Ref: 2735927486
-Ref: 2736927582
-Ref: 2737929103
-Ref: 2738930989
-Ref: 2739931473
-Ref: 2740932086
-Ref: 2741932116
-Ref: 2742932117
-Ref: 2743932555
-Ref: 2744934114
-Ref: 2745934262
-Ref: 2746934974
-Ref: 2747935955
-Node: 4.3.3936838
-Ref: 2748937744
-Ref: S0113937744
-Ref: 2749937756
-Ref: 2750937785
-Ref: 2751937872
-Ref: S0114937872
-Ref: 2752937887
-Ref: 2753937899
-Ref: 2754937913
-Ref: 2755937936
-Ref: 2756937950
-Ref: 2757937973
-Ref: 2758937995
-Ref: 2759938009
-Ref: 2760938065
-Ref: S0115938065
-Ref: 2761938080
-Ref: 2762938111
-Ref: 2763938207
-Ref: S0116938207
-Ref: 2764938221
-Ref: 2765938245
-Ref: 2766938265
-Ref: 2767938295
-Ref: 2768938443
-Ref: 2769938633
-Ref: 2770939204
-Ref: 2771939497
-Ref: 2772939597
-Ref: 2773940051
-Ref: 2774940188
-Ref: 2775940914
-Ref: 2776945941
-Ref: 2777946193
-Ref: 2778946193
-Ref: 2779946461
-Ref: 2780946462
-Ref: 2781947692
-Ref: 2782948813
-Ref: 2783948813
-Ref: 2784949380
-Ref: 2785949381
-Ref: 2786950058
-Ref: 2787950058
-Ref: 2788950463
-Ref: 2789952694
-Ref: 2790953426
-Ref: 2791955064
-Ref: 2792955853
-Ref: 2793956585
-Node: 4.4957297
-Ref: 2794957475
-Ref: 2795957844
-Ref: 2796957845
-Ref: 2797957845
-Ref: 2798957845
-Ref: 2799957845
-Ref: 2800957845
-Ref: 2801957845
-Ref: 2802957845
-Ref: 2803957845
-Ref: 2804957845
-Ref: 2805957845
-Ref: 2806957845
-Ref: 2807957845
-Ref: 2808957845
-Ref: 2809957845
-Ref: 2810957845
-Ref: 2811957845
-Ref: 2812957845
-Ref: 2813957845
-Ref: 2814957845
-Ref: 2815957845
-Ref: 2816957845
-Ref: 2817957845
-Ref: 2818957845
-Ref: 2819957845
-Ref: 2820957845
-Ref: 2821957845
-Ref: 2822957845
-Ref: 2823957845
-Ref: 2824957845
-Ref: 2825957845
-Ref: 2826957845
-Ref: 2827957845
-Ref: 2828957845
-Ref: 2829957845
-Ref: 2830957845
-Ref: 2831957845
-Ref: 2832957845
-Ref: 2833957845
-Ref: 2834957845
-Ref: 2835957845
-Ref: 2836957845
-Ref: 2837957845
-Ref: 2838957845
-Ref: 2839957845
-Ref: 2840957845
-Ref: 2841957845
-Ref: 2842957845
-Ref: 2843957845
-Ref: 2844957845
-Ref: 2845957845
-Ref: 2846957845
-Ref: 2847957845
-Ref: 2848957845
-Ref: 2849957845
-Ref: 2850957845
-Ref: 2851957845
-Ref: 2852957845
-Ref: 2853957845
-Ref: 2854957845
-Ref: 2855957845
-Ref: 2856957845
-Ref: 2857957845
-Ref: 2858957845
-Ref: 2859957845
-Ref: 2860957845
-Ref: 2861957845
-Ref: 2862957845
-Ref: 2863957845
-Ref: 2864957845
-Ref: 2865957845
-Ref: 2866957845
-Ref: 2867957905
-Ref: S0117957905
-Ref: 2868957920
-Ref: 2869957934
-Ref: 2870957949
-Ref: 2871957968
-Ref: 2872957988
-Ref: 2873958001
-Ref: 2874958016
-Ref: 2875958034
-Ref: 2876958054
-Ref: 2877958068
-Ref: 2878958132
-Ref: S0118958132
-Ref: 2879958147
-Ref: 2880958168
-Ref: 2881958195
-Ref: 2882958215
-Ref: 2883958242
-Ref: 2884958263
-Ref: 2885958290
-Ref: 2886958316
-Ref: 2887958343
-Ref: 2888958368
-Ref: 2889958437
-Ref: S0119958437
-Ref: 2890958452
-Ref: 2891958471
-Ref: 2892958491
-Ref: 2893958608
-Ref: S0120958608
-Ref: 2894958623
-Ref: 2895958642
-Ref: 2896958662
-Ref: 2897958698
-Ref: 2898958725
-Ref: 2899958758
-Ref: 2900958834
-Ref: S0121958834
-Ref: 2901958838
-Ref: 2902958865
-Ref: 2903958963
-Ref: S0122958963
-Ref: 2904958980
-Ref: 2905959000
-Ref: 2906959008
-Ref: 2907959046
-Ref: S0123959046
-Ref: 2908959052
-Ref: 2909959075
-Ref: 2910959081
-Ref: 2911959110
-Ref: 2912959128
-Ref: S0124959128
-Ref: 2913959132
-Ref: 2914959141
-Ref: 2915959162
-Ref: 2916959184
-Ref: S0125959184
-Ref: 2917959188
-Ref: 2918959201
-Ref: 2919959216
-Ref: 2920959230
-Ref: 2921959335
-Ref: S0126959335
-Ref: 2922959348
-Ref: 2923959373
-Ref: 2924959390
-Ref: 2925959408
-Ref: 2926959415
-Ref: 2927959428
-Ref: 2928959449
-Ref: 2929959476
-Ref: 2930960663
-Ref: 2931960803
-Ref: 2932960803
-Ref: 2933960803
-Ref: 2934963574
-Ref: 2935965238
-Ref: 2936966377
-Node: 4.5967007
-Ref: 2937967158
-Ref: 2938967158
-Ref: 2939967526
-Ref: S0127967526
-Ref: 2940967578
-Ref: S0128967578
-Ref: 2941967647
-Ref: S0129967647
-Ref: 2942967699
-Ref: S0130967699
-Ref: 2943967744
-Ref: S0131967744
-Ref: 2944967810
-Ref: S0132967810
-Ref: 2945968808
-Ref: 2946968808
-Ref: 2947968965
-Ref: 2948968966
-Ref: 2949968966
-Ref: 2950968966
-Ref: 2951969533
-Ref: 2952970116
-Ref: 2953970313
-Node: 4.5.1973090
-Ref: 2954973315
-Ref: 2955973315
-Ref: 2956973315
-Ref: 2957973462
-Ref: 2958973887
-Ref: 2959973887
-Ref: 2960973887
-Ref: 2961973887
-Ref: 2962973887
-Ref: 2963973887
-Ref: 2964973887
-Ref: 2965973887
-Ref: 2966974068
-Ref: 2967974751
-Ref: 2968976813
-Ref: 2969977116
-Ref: 2970977116
-Ref: 2971977280
-Ref: 2972977281
-Ref: 2973977370
-Node: 4.5.2978285
-Ref: 2974978460
-Ref: 2975978460
-Ref: 2976978460
-Ref: 2977978461
-Ref: 2978978461
-Ref: 2979978551
-Ref: 2980978552
-Ref: 2981978699
-Ref: 2982978700
-Ref: 2983978700
-Ref: 2984978700
-Ref: 2985978700
-Ref: 2986978700
-Ref: 2987978700
-Ref: 2988978700
-Ref: 2989978700
-Ref: 2990978700
-Ref: 2991978700
-Ref: 2992978700
-Ref: 2993978700
-Ref: 2994978700
-Ref: 2995978700
-Ref: 2996978700
-Ref: 2997978700
-Ref: 2998978700
-Ref: 2999978700
-Ref: 3000978700
-Ref: 3001978700
-Ref: 3002978700
-Ref: 3003978700
-Ref: 3004978700
-Ref: 3005978700
-Ref: 3006979055
-Ref: 3007979056
-Ref: 3008979056
-Ref: 3009979504
-Ref: 3010979505
-Ref: 3011987125
-Ref: 3012988651
-Ref: 3013989051
-Ref: 3014991387
-Ref: 3015996655
-Ref: 3016997057
-Ref: 3017997868
-Ref: 3018997924
-Ref: 3019998212
-Ref: 3020999931
-Ref: 30211004914
-Ref: 30221005964
-Ref: 30231006818
-Ref: 30241007854
-Ref: 30251008230
-Ref: 30261009070
-Node: 4.5.31010537
-Ref: 30271010721
-Ref: 30281010721
-Ref: 30291010721
-Ref: 30301010721
-Ref: 30311010721
-Ref: 30321010721
-Ref: 30331010721
-Ref: 30341010721
-Ref: 30351010721
-Ref: 30361010721
-Ref: 30371010999
-Ref: 30381010999
-Ref: 30391010999
-Ref: 30401010999
-Ref: 30411010999
-Ref: 30421010999
-Ref: 30431010999
-Ref: 30441011403
-Ref: 30451012454
-Ref: 30461012455
-Ref: 30471012604
-Ref: 30481012970
-Ref: 30491013252
-Ref: 30501014992
-Ref: 30511015735
-Node: 4.5.41016071
-Ref: 30521016253
-Ref: 30531016253
-Ref: 30541016253
-Ref: 30551016253
-Ref: 30561016253
-Ref: 30571016253
-Ref: 30581016253
-Ref: 30591016253
-Ref: 30601016253
-Ref: 30611016253
-Node: 4.5.51016755
-Ref: 30621016935
-Ref: 30631016935
-Ref: 30641016935
-Ref: 30651016935
-Ref: 30661016935
-Ref: 30671016935
-Ref: 30681016935
-Ref: 30691016935
-Ref: 30701016935
-Ref: 30711016935
-Ref: 30721016935
-Ref: 30731016935
-Ref: 30741016935
-Ref: 30751016935
-Ref: 30761016935
-Ref: 30771016935
-Ref: 30781023737
-Ref: 30791023744
-Ref: 30801023744
-Ref: 30811023744
-Ref: 30821026732
-Ref: 30831027244
-Ref: 30841028128
-Node: 4.5.61029426
-Ref: 30851029620
-Ref: 30861029620
-Ref: 30871029620
-Ref: 30881029620
-Ref: 30891029620
-Ref: 30901029808
-Ref: 30911029808
-Ref: 30921029808
-Ref: 30931030686
-Ref: 30941030687
-Ref: 30951030687
-Ref: 30961030932
-Ref: 30971030932
-Ref: 30981030932
-Ref: 30991030932
-Ref: 31001031398
-Ref: 31011032205
-Ref: 31021032601
-Ref: 31031032601
-Ref: 31041032744
-Ref: 31051032914
-Node: 4.5.71033883
-Ref: 31061035474
-Ref: S01331035474
-Ref: 31071035478
-Ref: 31081035500
-Ref: 31091035589
-Ref: S01341035589
-Ref: 31101035606
-Ref: 31111035631
-Ref: 31121035657
-Ref: 31131035682
-Ref: 31141035718
-Ref: 31151035774
-Ref: S01351035774
-Ref: 31161035787
-Ref: 31171035848
-Ref: S01361035848
-Ref: 31181035877
-Ref: 31191035900
-Ref: 31201035940
-Ref: 31211036031
-Ref: S01371036031
-Ref: 31221036050
-Ref: 31231036097
-Ref: 31241039610
-Ref: 31251041042
-Ref: 31261041242
-Ref: 31271041242
-Ref: 31281041243
-Ref: 31291043797
-Ref: 31301044407
-Ref: 31311044407
-Ref: 31321044407
-Ref: 31331044546
-Ref: 31341044638
-Node: 4.5.81044695
-Ref: 31351045069
-Ref: S01381045069
-Ref: 31361045078
-Ref: 31371045089
-Ref: 31381045127
-Ref: 31391045150
-Ref: 31401045161
-Ref: 31411045187
-Ref: 31421045217
-Ref: S01391045217
-Ref: 31431045252
-Ref: S01401045252
-Ref: 31441045265
-Ref: 31451046021
-Ref: 31461046165
-Ref: 31471046627
-Ref: 31481048239
-Node: 4.61048550
-Ref: 31491048981
-Ref: 31501048982
-Ref: 31511048982
-Ref: 31521048982
-Ref: 31531048983
-Ref: 31541048983
-Ref: 31551049048
-Ref: S01411049048
-Ref: 31561049062
-Ref: 31571049075
-Ref: 31581049096
-Ref: 31591049109
-Ref: 31601049118
-Ref: 31611049201
-Ref: 31621049284
-Ref: 31631049344
-Ref: 31641049905
-Ref: 31651049906
-Ref: 31661050116
-Ref: 31671050117
-Ref: 31681050169
-Ref: 31691050998
-Ref: 31701053486
-Ref: 31711053487
-Ref: 31721053736
-Ref: 31731053737
-Ref: 31741055898
-Ref: 31751055899
-Ref: 31761056030
-Ref: 31771056031
-Ref: 31781056356
-Ref: 31791056471
-Ref: 31801056730
-Ref: 31811059180
-Ref: 31821059181
-Ref: 31831060373
-Ref: 31841060717
-Ref: 31851063139
-Ref: 31861064160
-Ref: 31871064161
-Ref: 31881064743
-Ref: 31891064744
-Ref: 31901065091
-Ref: 31911065170
-Ref: 31921066076
-Ref: 31931067155
-Ref: 31941067270
-Ref: 31951067270
-Ref: 31961067270
-Ref: 31971067463
-Ref: 31981067464
-Ref: 31991067464
-Ref: 32001067741
-Ref: 32011067741
-Ref: 32021068255
-Ref: 32031070187
-Ref: 32041070187
-Ref: 32051070361
-Ref: 32061070361
-Ref: 32071070402
-Ref: 32081070402
-Ref: 32091070749
-Ref: 32101070749
-Ref: 32111070998
-Ref: 32121071807
-Ref: 32131071808
-Ref: 32141072013
-Ref: 32151072013
-Ref: 32161072363
-Ref: 32171072364
-Ref: 32181073116
-Ref: 32191073117
-Ref: 32201074012
-Ref: 32211074012
-Ref: 32221074335
-Ref: 32231074335
-Ref: 32241074451
-Ref: 32251074451
-Ref: 32261075209
-Ref: 32271075210
-Ref: 32281076651
-Ref: 32291076652
-Ref: 32301076652
-Ref: 32311076652
-Ref: 32321076652
-Ref: 32331076652
-Ref: 32341076652
-Ref: 32351076652
-Ref: 32361077050
-Ref: 32371077050
-Ref: 32381077500
-Ref: 32391077666
-Ref: 32401077667
-Ref: 32411077667
-Ref: 32421077667
-Ref: 32431077667
-Ref: 32441077667
-Ref: 32451078727
-Ref: 32461079264
-Ref: 32471079471
-Ref: 32481079472
-Ref: 32491079472
-Ref: 32501081110
-Ref: 32511081481
-Ref: 32521082052
-Ref: 32531082057
-Ref: 32541084062
-Ref: 32551084755
-Ref: 32561087123
-Ref: 32571088407
-Ref: 32581091514
-Node: 4.71094674
-Ref: 32591094944
-Ref: 32601095016
-Ref: S01421095016
-Ref: 32611095029
-Ref: 32621095043
-Ref: 32631095057
-Ref: 32641095070
-Ref: 32651095132
-Ref: 32661095748
-Ref: 32671095749
-Ref: 32681095749
-Ref: 32691095749
-Ref: 32701095749
-Ref: 32711095749
-Ref: 32721095749
-Ref: 32731095974
-Ref: 32741095975
-Ref: 32751098531
-Node: 4.81099109
-Ref: 32761099313
-Ref: 32771099314
-Ref: 32781099314
-Ref: 32791099401
-Ref: S01431099401
-Ref: 32801099419
-Ref: 32811099442
-Ref: 32821099474
-Ref: 32831099497
-Ref: 32841099576
-Ref: S01441099576
-Ref: 32851099597
-Ref: 32861100235
-Ref: 32871100765
-Ref: 32881101192
-Ref: 32891101261
-Ref: 32901101559
-Ref: 32911105952
-Ref: 32921106812
-Ref: 32931108134
-Ref: 32941108245
-Ref: 32951108246
-Ref: 32961108398
-Ref: 32971108477
-Ref: 32981108634
-Ref: 32991109172
-Ref: 33001109173
-Ref: 33011109173
-Ref: 33021109173
-Ref: 33031109262
-Ref: 33041109406
-Ref: 33051110311
-Ref: 33061110311
-Ref: 33071110311
-Ref: 33081112223
-Ref: 33091112223
-Ref: 33101112223
-Ref: 33111113350
-Ref: 33121113350
-Ref: 33131113350
-Ref: 33141113801
-Ref: 33151113801
-Ref: 33161113801
-Ref: 33171113801
-Ref: 33181113801
-Ref: 33191113802
-Ref: 33201114780
-Ref: 33211115551
-Ref: 33221117278
-Ref: 33231117613
-Ref: 33241118462
-Ref: 33251119172
-Ref: 33261119557
-Ref: 33271121420
-Ref: 33281122196
-Node: 4.91123032
-Ref: 33291123386
-Ref: 33301123495
-Ref: 33311124346
-Ref: 33321127694
-Ref: 33331128193
-Ref: 33341128741
-Ref: 33351129390
-Ref: 33361130831
-Ref: 33371130984
-Ref: 33381131316
-Ref: 33391131395
-Ref: 33401131613
-Ref: 33411133186
-Ref: 33421133305
-Ref: 33431133305
-Ref: 33441133305
-Ref: 33451133408
-Ref: 33461133552
-Ref: 33471133836
-Ref: 33481134184
-Ref: 33491138285
-Ref: 33501144373
-Ref: 33511147137
-Ref: 33521148948
-Node: 4.9.11151303
-Ref: 33531151531
-Ref: 33541152155
-Ref: 33551153294
-Ref: 33561153758
-Ref: 33571153947
-Ref: 33581154592
-Ref: 33591156105
-Node: 51156961
-Node: 5.11158531
-Ref: 33601158985
-Ref: S01451158985
-Ref: 33611158989
-Ref: 33621159001
-Ref: 33631159019
-Ref: 33641159043
-Ref: S01461159043
-Ref: 33651159057
-Ref: 33661159064
-Ref: 33671159084
-Ref: 33681159091
-Ref: 33691159165
-Ref: S01471159165
-Ref: 33701159169
-Ref: 33711159195
-Ref: 33721159220
-Ref: 33731159245
-Ref: 33741159264
-Ref: 33751159299
-Ref: 33761159327
-Ref: 33771159358
-Ref: 33781159380
-Ref: 33791159406
-Ref: 33801159426
-Ref: 33811159452
-Ref: 33821159524
-Ref: S01481159524
-Ref: 33831159539
-Ref: 33841159556
-Ref: 33851159581
-Ref: 33861159600
-Ref: 33871159626
-Ref: 33881159662
-Ref: 33891159683
-Ref: 33901159722
-Ref: S01491159722
-Ref: 33911159746
-Ref: S01501159746
-Ref: 33921159759
-Ref: 33931159810
-Ref: S01511159810
-Ref: 33941159814
-Ref: 33951163632
-Ref: 33961163715
-Ref: 33971164206
-Ref: 33981166678
-Ref: 33991167265
-Ref: 34001167449
-Node: 5.21167628
-Ref: 34011167931
-Ref: S01521167931
-Ref: 34021167953
-Ref: 34031167961
-Ref: 34041168125
-Ref: 34051168126
-Ref: 34061168314
-Ref: 34071168315
-Ref: 34081169390
-Ref: 34091169466
-Ref: 34101171238
-Ref: 34111171363
-Ref: 34121171698
-Ref: 34131171967
-Ref: 34141171967
-Ref: 34151171967
-Ref: 34161172308
-Ref: 34171172998
-Ref: 34181172998
-Ref: 34191173545
-Ref: 34201176087
-Ref: 34211177147
-Node: 5.31178243
-Ref: 34221178575
-Ref: S01531178575
-Ref: 34231178592
-Ref: 34241178618
-Ref: 34251178656
-Ref: 34261178682
-Ref: 34271178731
-Ref: 34281178882
-Node: 5.41180155
-Ref: 34291180517
-Ref: S01541180517
-Ref: 34301180545
-Ref: 34311180571
-Ref: 34321180610
-Ref: 34331180690
-Ref: S01551180690
-Ref: 34341180708
-Ref: 34351180743
-Ref: 34361180844
-Ref: 34371180845
-Ref: 34381180909
-Ref: 34391186053
-Ref: 34401186415
-Ref: 34411186415
-Ref: 34421186415
-Ref: 34431187791
-Ref: 34441188899
-Node: 5.51192103
-Ref: 34451192384
-Ref: S01561192384
-Ref: 34461192403
-Ref: 34471192438
-Ref: 34481192475
-Ref: 34491192525
-Ref: 34501192589
-Ref: S01571192589
-Ref: 34511192600
-Ref: 34521192624
-Ref: 34531192667
-Ref: 34541192726
-Ref: S01581192726
-Ref: 34551192739
-Ref: 34561192772
-Ref: 34571193042
-Ref: 34581193185
-Ref: 34591193235
-Ref: 34601193552
-Ref: 34611193978
-Ref: 34621193979
-Ref: 34631194725
-Node: 5.5.11199130
-Ref: 34641199403
-Ref: 34651199608
-Ref: 34661199664
-Ref: 34671199742
-Ref: 34681199850
-Ref: 34691199930
-Ref: 34701200010
-Ref: 34711200295
-Ref: 34721200429
-Ref: 34731200483
-Ref: 34741200557
-Ref: 34751200695
-Ref: 34761201427
-Ref: 34771201500
-Ref: 34781201629
-Ref: 34791201629
-Ref: 34801201629
-Ref: 34811201894
-Ref: 34821201894
-Ref: 34831201894
-Ref: 34841202270
-Ref: 34851202403
-Ref: 34861202477
-Ref: 34871202571
-Ref: 34881203865
-Ref: 34891205007
-Ref: 34901205099
-Ref: 34911205255
-Node: 5.5.21205625
-Ref: 34921205989
-Ref: S01591205989
-Ref: 34931206003
-Ref: 34941206045
-Ref: 34951206059
-Ref: 34961206082
-Ref: 34971206130
-Ref: 34981206315
-Ref: 34991206315
-Ref: 35001206377
-Ref: 35011206506
-Ref: 35021206619
-Ref: 35031206619
-Ref: 35041206672
-Ref: 35051206672
-Ref: 35061207100
-Ref: 35071207100
-Ref: 35081207136
-Ref: 35091207136
-Ref: 35101209880
-Ref: 35111212017
-Ref: 35121213652
-Ref: 35131213915
-Ref: 35141214833
-Ref: 35151215003
-Ref: 35161215074
-Ref: 35171217295
-Ref: 35181217447
-Node: 5.61220199
-Ref: 35191220480
-Ref: S01601220480
-Ref: 35201220500
-Ref: 35211220561
-Ref: 35221220615
-Ref: 35231220670
-Ref: 35241221183
-Node: 5.71222245
-Ref: 35251222578
-Ref: S01611222578
-Ref: 35261222602
-Ref: 35271222614
-Ref: 35281222812
-Ref: 35291223599
-Node: 5.81224454
-Ref: 35301224738
-Ref: S01621224738
-Ref: 35311224754
-Ref: 35321224812
-Ref: 35331225549
-Node: 61226425
-Ref: 35341226519
-Ref: 35351226519
-Ref: 35361226519
-Ref: 35371227789
-Ref: 35381227849
-Ref: 35391227931
-Node: 6.11228642
-Ref: 35401228949
-Ref: S01631228949
-Ref: 35411228964
-Ref: 35421228995
-Ref: 35431229034
-Ref: 35441229186
-Ref: S01641229186
-Ref: 35451229200
-Ref: 35461229233
-Ref: 35471229320
-Ref: S01651229320
-Ref: 35481229335
-Ref: 35491229368
-Ref: 35501229449
-Ref: S01661229449
-Ref: 35511229463
-Ref: 35521229489
-Ref: 35531229536
-Ref: S01671229536
-Ref: 35541229542
-Ref: 35551229562
-Ref: 35561229575
-Ref: 35571229618
-Ref: S01681229618
-Ref: 35581229622
-Ref: 35591229652
-Ref: 35601229717
-Ref: S01691229717
-Ref: 35611229723
-Ref: 35621229743
-Ref: 35631229893
-Ref: S01701229893
-Ref: 35641229897
-Ref: 35651230721
-Ref: S01711230721
-Ref: 35661230725
-Ref: 35671230768
-Ref: S01721230768
-Ref: 35681230774
-Ref: 35691230889
-Ref: S01731230889
-Ref: 35701230904
-Ref: 35711230925
-Ref: 35721230941
-Ref: 35731230964
-Ref: 35741230984
-Ref: 35751231022
-Ref: S01741231022
-Ref: 35761231036
-Ref: 35771231063
-Ref: 35781231182
-Ref: S01751231182
-Ref: 35791231196
-Ref: 35801231233
-Ref: 35811231239
-Ref: 35821231255
-Ref: 35831231278
-Ref: 35841231307
-Ref: 35851231334
-Ref: 35861231356
-Ref: 35871231395
-Ref: S01761231395
-Ref: 35881231473
-Ref: 35891231666
-Ref: 35901231777
-Ref: 35911231854
-Ref: 35921232337
-Ref: 35931232338
-Ref: 35941233990
-Ref: 35951234679
-Ref: 35961235064
-Ref: 35971235098
-Ref: 35981235099
-Ref: 35991235311
-Ref: 36001235391
-Ref: 36011236004
-Ref: 36021236959
-Ref: 36031237930
-Ref: 36041239889
-Ref: 36051241094
-Ref: 36061242526
-Node: 6.1.11243197
-Ref: 36071244314
-Ref: 36081244314
-Ref: 36091244477
-Ref: 36101244477
-Ref: 36111245293
-Ref: 36121245293
-Ref: 36131245522
-Ref: 36141245522
-Ref: 36151246523
-Ref: 36161246523
-Ref: 36171246687
-Ref: 36181246687
-Ref: 36191247095
-Ref: 36201247095
-Ref: 36211247246
-Ref: 36221247246
-Ref: 36231247517
-Ref: 36241247517
-Ref: 36251250106
-Ref: 36261254492
-Ref: 36271255113
-Ref: 36281255113
-Ref: 36291257281
-Ref: 36301257281
-Ref: 36311257673
-Ref: 36321258163
-Ref: 36331258178
-Ref: 36341266933
-Ref: 36351266948
-Ref: 36361268440
-Ref: 36371268440
-Ref: 36381268440
-Ref: 36391268739
-Ref: 36401268739
-Ref: 36411268739
-Ref: 36421269937
-Ref: 36431269937
-Ref: 36441271282
-Ref: 36451271282
-Ref: 36461271282
-Ref: 36471271282
-Ref: 36481271282
-Ref: 36491279091
-Ref: 36501279217
-Ref: 36511280698
-Node: 6.21282629
-Ref: 36521282886
-Ref: 36531282886
-Ref: 36541282886
-Ref: 36551282886
-Ref: 36561282886
-Ref: 36571282886
-Ref: 36581283424
-Ref: 36591283661
-Ref: 36601284256
-Ref: 36611286428
-Ref: 36621286665
-Ref: 36631287019
-Ref: 36641287756
-Ref: 36651287757
-Ref: 36661287757
-Ref: 36671287757
-Ref: 36681288427
-Ref: 36691294026
-Node: 6.31295441
-Ref: 36701295741
-Ref: S01771295741
-Ref: 36711295756
-Ref: 36721295787
-Ref: 36731295825
-Ref: 36741295862
-Ref: 36751295907
-Ref: 36761295952
-Ref: 36771296539
-Ref: 36781296791
-Ref: 36791297261
-Ref: 36801298164
-Ref: 36811299037
-Node: 6.3.11299252
-Ref: 36821299364
-Ref: 36831299364
-Ref: 36841299364
-Ref: 36851299364
-Ref: 36861299364
-Ref: 36871299653
-Ref: 36881299654
-Ref: 36891300057
-Ref: 36901300058
-Ref: 36911300359
-Ref: 36921300359
-Ref: 36931305351
-Ref: 36941305352
-Ref: 36951305684
-Ref: 36961305685
-Ref: 36971307440
-Ref: 36981307441
-Ref: 36991307763
-Ref: 37001308534
-Ref: 37011308535
-Ref: 37021309077
-Ref: 37031309109
-Ref: 37041309110
-Ref: 37051309377
-Ref: 37061309408
-Ref: 37071309465
-Ref: 37081309466
-Ref: 37091311026
-Ref: 37101314315
-Ref: 37111314570
-Ref: 37121314576
-Ref: 37131315427
-Ref: 37141316545
-Ref: 37151318159
-Ref: 37161320166
-Node: 6.3.21321013
-Ref: 37171321889
-Ref: 37181321889
-Ref: 37191323709
-Node: 6.41323777
-Ref: 37201323889
-Ref: 37211324200
-Ref: S01781324200
-Ref: 37221324224
-Ref: 37231324249
-Ref: 37241324256
-Ref: 37251324300
-Ref: S01791324300
-Ref: 37261324323
-Ref: 37271324346
-Ref: 37281324353
-Ref: 37291324587
-Ref: S01801324587
-Ref: 37301324602
-Ref: 37311324627
-Ref: 37321324680
-Ref: S01811324680
-Ref: 37331324711
-Ref: 37341324729
-Ref: 37351324788
-Ref: S01821324788
-Ref: 37361324792
-Ref: 37371324815
-Ref: 37381324823
-Ref: 37391324828
-Ref: 37401326867
-Ref: 37411327519
-Ref: 37421329576
-Ref: 37431330330
-Ref: 37441330331
-Ref: 37451333220
-Node: 6.4.11334243
-Ref: 37461334352
-Ref: 37471335641
-Ref: 37481335642
-Ref: 37491335642
-Ref: 37501335642
-Ref: 37511336060
-Ref: 37521336286
-Ref: 37531339464
-Ref: 37541341623
-Ref: 37551343142
-Ref: 37561348830
-Ref: 37571353625
-Ref: 37581354092
-Ref: 37591354216
-Ref: 37601354468
-Ref: 37611356053
-Ref: 37621359462
-Ref: 37631359462
-Ref: 37641359611
-Ref: 37651359611
-Ref: 37661359611
-Ref: 37671359611
-Ref: 37681359611
-Ref: 37691359848
-Ref: 37701359911
-Ref: 37711361120
-Ref: 37721361511
-Ref: 37731362148
-Ref: 37741362700
-Ref: 37751365192
-Node: 6.51366555
-Ref: 37761366835
-Ref: 37771367115
-Ref: S01831367115
-Ref: S01841367115
-Ref: 37781367128
-Ref: 37791367218
-Ref: S01851367218
-Ref: 37801367232
-Ref: 37811367274
-Ref: 37821367310
-Ref: 37831367498
-Ref: S01861367498
-Ref: 37841367519
-Ref: 37851367571
-Ref: 37861367690
-Ref: S01871367690
-Ref: 37871367694
-Ref: 37881367721
-Ref: 37891367821
-Ref: 37901367998
-Ref: 37911368144
-Ref: 37921368422
-Ref: 37931371696
-Ref: 37941375240
-Ref: 37951375717
-Ref: 37961376018
-Ref: 37971376341
-Ref: 37981376341
-Ref: 37991376483
-Ref: 38001376483
-Ref: 38011376484
-Ref: 38021377780
-Ref: 38031377978
-Ref: 38041377979
-Ref: 38051379681
-Ref: 38061379681
-Ref: 38071379682
-Ref: 38081381860
-Ref: 38091381861
-Ref: 38101382087
-Ref: 38111383229
-Ref: 38121383230
-Ref: 38131383230
-Ref: 38141393809
-Ref: 38151395833
-Ref: 38161396684
-Ref: 38171397827
-Ref: 38181399362
-Ref: 38191401459
-Ref: 38201402930
-Node: 6.5.11404995
-Ref: 38211405387
-Ref: 38221405899
-Ref: 38231405899
-Ref: 38241405899
-Ref: 38251407338
-Ref: 38261408201
-Ref: 38271410065
-Ref: 38281410192
-Node: 6.61410266
-Ref: 38291410394
-Ref: 38301410394
-Ref: 38311410394
-Ref: 38321412977
-Ref: 38331413312
-Ref: 38341413884
-Node: 6.71414734
-Ref: 38351415104
-Ref: S01881415104
-Ref: 38361415118
-Ref: 38371415148
-Ref: 38381415193
-Ref: 38391415553
-Ref: 38401415739
-Ref: 38411415739
-Ref: 38421416703
-Ref: 38431417210
-Ref: 38441417326
-Node: 6.81417570
-Ref: 38451417970
-Ref: S01891417970
-Ref: 38461417984
-Ref: 38471418014
-Ref: 38481418053
-Ref: 38491418078
-Ref: 38501418110
-Ref: 38511418140
-Ref: 38521418178
-Ref: 38531418201
-Ref: 38541418489
-Ref: 38551418877
-Ref: 38561420222
-Ref: 38571420222
-Ref: 38581420245
-Ref: 38591421201
-Ref: 38601421669
-Ref: 38611421812
-Node: 71421986
-Ref: 38621422075
-Ref: 38631422445
-Ref: 38641422446
-Ref: 38651422446
-Ref: 38661422446
-Node: 7.11422696
-Ref: 38671423088
-Ref: S01901423088
-Ref: 38681423092
-Ref: 38691423172
-Ref: S01911423172
-Ref: 38701423194
-Ref: 38711423235
-Ref: 38721423272
-Ref: 38731423325
-Ref: 38741423365
-Ref: 38751423383
-Ref: 38761423670
-Ref: 38771423671
-Ref: 38781424253
-Ref: 38791424416
-Ref: 38801424769
-Ref: 38811425859
-Ref: 38821427613
-Ref: 38831429098
-Node: 7.21429231
-Ref: 38841429809
-Ref: S01921429809
-Ref: 38851429836
-Ref: 38861429877
-Ref: 38871429914
-Ref: 38881429959
-Ref: 38891430006
-Ref: 38901430024
-Ref: 38911431769
-Ref: 38921432683
-Ref: 38931435730
-Node: 7.31435854
-Ref: 38941436408
-Ref: 38951436409
-Ref: 38961436409
-Ref: 38971436409
-Ref: 38981436409
-Ref: 38991437096
-Ref: S01931437096
-Ref: 39001437114
-Ref: 39011437135
-Ref: 39021437213
-Ref: 39031437397
-Ref: S01941437397
-Ref: 39041437415
-Ref: 39051437436
-Ref: 39061437517
-Ref: 39071437557
-Ref: 39081437599
-Ref: 39091437670
-Ref: 39101437670
-Ref: 39111450515
-Ref: 39121451002
-Ref: 39131451740
-Ref: 39141454835
-Ref: 39151456513
-Ref: 39161456586
-Ref: 39171456729
-Ref: 39181456885
-Ref: 39191458803
-Ref: 39201458882
-Ref: 39211459649
-Ref: 39221463333
-Ref: 39231465210
-Ref: 39241466024
-Node: 7.3.11466585
-Ref: 39251466895
-Ref: 39261469600
-Ref: 39271469601
-Ref: 39281469601
-Ref: 39291470059
-Ref: 39301479998
-Ref: 39311480013
-Node: 7.3.21485553
-Ref: 39321486053
-Ref: 39331486389
-Ref: 39341486389
-Ref: 39351487001
-Ref: 39361487001
-Ref: 39371487096
-Ref: 39381487096
-Ref: 39391487096
-Ref: 39401487861
-Ref: 39411490155
-Ref: 39421490155
-Ref: 39431496642
-Ref: 39441497277
-Ref: 39451501456
-Ref: 39461501594
-Ref: 39471504917
-Ref: 39481505355
-Node: 7.41506256
-Ref: 39491506732
-Ref: 39501506856
-Ref: 39511506944
-Ref: 39521507191
-Ref: 39531510141
-Ref: 39541512470
-Ref: 39551515394
-Node: 7.51515919
-Ref: 39561521042
-Ref: 39571523737
-Ref: 39581523930
-Ref: 39591523930
-Ref: 39601526612
-Ref: 39611526612
-Ref: 39621526612
-Ref: 39631529750
-Ref: 39641530352
-Node: 7.61532782
-Ref: 39651532905
-Ref: 39661532905
-Ref: 39671533475
-Ref: 39681533476
-Ref: 39691533476
-Ref: 39701533572
-Ref: 39711533656
-Ref: 39721533657
-Ref: 39731533657
-Ref: 39741535674
-Ref: 39751535759
-Ref: 39761535909
-Ref: 39771535977
-Ref: 39781536045
-Ref: 39791536142
-Ref: 39801536316
-Ref: 39811536392
-Ref: 39821536568
-Ref: 39831538961
-Ref: 39841538961
-Ref: 39851542128
-Ref: 39861543319
-Ref: 39871543566
-Ref: 39881543566
-Ref: 39891543767
-Ref: 39901543768
-Ref: 39911543963
-Ref: 39921545019
-Ref: 39931547725
-Ref: 39941547725
-Ref: 39951552311
-Ref: 39961552676
-Ref: 39971553008
-Ref: 39981561902
-Ref: 39991562156
-Ref: 40001564354
-Node: 7.6.11566017
-Ref: 40011566481
-Ref: 40021566482
-Ref: 40031566564
-Ref: 40041566565
-Ref: 40051566739
-Ref: 40061566740
-Ref: 40071566740
-Ref: 40081566740
-Ref: 40091567330
-Ref: 40101567331
-Ref: 40111567502
-Ref: 40121569552
-Ref: 40131572081
-Ref: 40141573242
-Ref: 40151574894
-Ref: 40161575617
-Ref: 40171575617
-Ref: 40181575618
-Ref: 40191577022
-Ref: 40201577371
-Ref: 40211580269
-Ref: 40221584977
-Ref: 40231585872
-Ref: 40241586414
-Ref: 40251588273
-Ref: 40261588984
-Ref: 40271589559
-Ref: 40281593673
-Ref: 40291594922
-Ref: 40301598921
-Ref: 40311603092
-Ref: 40321603102
-Ref: 40331604715
-Ref: 40341607125
-Node: 81608864
-Node: 8.11611195
-Ref: 40351611345
-Ref: 40361613466
-Ref: 40371613466
-Ref: 40381613466
-Ref: 40391613466
-Ref: 40401613466
-Ref: 40411613908
-Ref: 40421614645
-Ref: 40431620430
-Node: 8.21621259
-Ref: 40441621845
-Ref: 40451624399
-Ref: 40461625449
-Ref: 40471625591
-Ref: 40481625950
-Ref: 40491626022
-Ref: 40501626227
-Ref: 40511627613
-Ref: 40521628677
-Ref: 40531628925
-Ref: 40541628930
-Ref: 40551629045
-Ref: 40561631832
-Ref: 40571632807
-Node: 8.31636044
-Ref: 40581636145
-Ref: 40591636397
-Ref: 40601636397
-Ref: 40611636397
-Ref: 40621636705
-Ref: 40631637112
-Ref: 40641637112
-Ref: 40651637194
-Ref: 40661637317
-Ref: 40671637447
-Ref: 40681637565
-Ref: 40691637675
-Ref: 40701637801
-Ref: 40711638342
-Ref: 40721639048
-Ref: 40731639183
-Ref: 40741639662
-Ref: 40751639693
-Ref: 40761643516
-Ref: 40771647275
-Ref: 40781647280
-Ref: 40791647280
-Ref: 40801647385
-Ref: 40811647808
-Ref: 40821649515
-Ref: 40831650540
-Ref: 40841652180
-Ref: 40851652180
-Ref: 40861652180
-Ref: 40871652180
-Ref: 40881652329
-Ref: 40891652396
-Ref: 40901652584
-Ref: 40911652765
-Ref: 40921652823
-Ref: 40931652917
-Ref: 40941653037
-Ref: 40951654870
-Ref: 40961655216
-Ref: 40971665938
-Ref: 40981666692
-Node: 8.3.11669903
-Ref: 40991670267
-Ref: S01951670267
-Ref: 41001671677
-Ref: 41011674647
-Node: 8.41675028
-Ref: 41021675381
-Ref: 41031675761
-Ref: 41041676141
-Ref: S01961676141
-Ref: 41051676145
-Ref: 41061676167
-Ref: 41071676209
-Ref: S01971676209
-Ref: 41081676226
-Ref: 41091676242
-Ref: 41101676299
-Ref: S01981676299
-Ref: 41111676319
-Ref: 41121676341
-Ref: 41131676628
-Ref: 41141678507
-Ref: 41151678566
-Ref: 41161681081
-Ref: 41171681081
-Ref: 41181682083
-Ref: 41191684264
-Ref: 41201685033
-Node: 8.51685409
-Ref: 41211686026
-Ref: S01991686026
-Ref: 41221686042
-Ref: 41231686081
-Ref: 41241686123
-Ref: 41251686163
-Ref: 41261686206
-Ref: 41271686285
-Ref: 41281686448
-Ref: 41291686449
-Node: 8.5.11688505
-Ref: 41301688867
-Ref: S02001688867
-Ref: 41311688881
-Ref: 41321688904
-Ref: 41331688920
-Ref: 41341688954
-Ref: 41351688973
-Ref: 41361689005
-Ref: 41371689027
-Ref: 41381689060
-Ref: 41391689079
-Ref: 41401691170
-Ref: 41411691303
-Ref: 41421691848
-Ref: 41431693618
-Ref: 41441697643
-Ref: 41451698806
-Ref: 41461699763
-Ref: 41471700498
-Node: 8.5.21700638
-Ref: 41481700966
-Ref: S02011700966
-Ref: 41491700970
-Ref: 41501701026
-Ref: 41511701040
-Ref: 41521701534
-Node: 8.5.31701677
-Ref: 41531701993
-Ref: S02021701993
-Ref: 41541702006
-Ref: 41551702055
-Ref: 41561702069
-Ref: 41571703964
-Node: 8.5.41704104
-Ref: 41581704377
-Ref: 41591704435
-Ref: 41601704892
-Ref: S02031704892
-Ref: 41611704907
-Ref: 41621704938
-Ref: 41631704987
-Ref: 41641705006
-Ref: 41651705081
-Ref: 41661705368
-Ref: 41671706059
-Ref: 41681706810
-Ref: 41691706943
-Ref: 41701707226
-Ref: 41711714731
-Ref: 41721714839
-Ref: 41731714840
-Ref: 41741718806
-Ref: 41751719959
-Ref: 41761720693
-Node: 8.5.51720836
-Ref: 41771721143
-Ref: S02041721143
-Ref: 41781721175
-Ref: 41791721232
-Ref: 41801721251
-Ref: 41811721303
-Ref: 41821721362
-Ref: 41831721381
-Ref: 41841721432
-Ref: 41851721490
-Ref: 41861721509
-Ref: 41871722390
-Ref: 41881723164
-Node: 8.61723304
-Ref: 41891723468
-Ref: 41901723745
-Ref: 41911724348
-Ref: 41921724997
-Ref: 41931725819
-Ref: 41941725819
-Ref: 41951728198
-Ref: 41961728284
-Ref: 41971728285
-Ref: 41981728285
-Ref: 41991729055
-Ref: 42001729358
-Ref: 42011729816
-Ref: 42021732430
-Ref: 42031733350
-Ref: 42041733548
-Ref: 42051734122
-Ref: 42061734122
-Ref: 42071734856
-Ref: 42081735011
-Ref: 42091736884
-Ref: 42101737023
-Ref: 42111737154
-Ref: 42121737616
-Ref: 42131739625
-Ref: 42141739625
-Ref: 42151741455
-Ref: 42161742701
-Ref: 42171743315
-Ref: 42181743716
-Ref: 42191746427
-Ref: 42201746437
-Ref: 42211746704
-Ref: 42221751217
-Ref: 42231752273
-Ref: 42241753232
-Ref: 42251754499
-Ref: 42261755243
-Ref: 42271755891
-Node: 91757481
-Ref: 42281757630
-Ref: 42291757710
-Ref: 42301757711
-Ref: 42311757943
-Ref: 42321757944
-Ref: 42331757944
-Ref: 42341757944
-Ref: 42351758264
-Ref: 42361759425
-Ref: 42371759669
-Ref: 42381759670
-Ref: 42391759670
-Ref: 42401759670
-Ref: 42411759670
-Ref: 42421759670
-Ref: 42431759670
-Ref: 42441759670
-Ref: 42451759818
-Ref: 42461759965
-Ref: 42471759966
-Node: 9.11761742
-Ref: 42481761864
-Ref: 42491762332
-Ref: S02051762332
-Ref: 42501762355
-Ref: 42511762376
-Ref: 42521762415
-Ref: 42531762456
-Ref: 42541762487
-Ref: 42551762597
-Ref: S02061762597
-Ref: 42561762615
-Ref: 42571762650
-Ref: 42581762690
-Ref: 42591762721
-Ref: 42601762762
-Ref: S02071762762
-Ref: 42611762778
-Ref: 42621762817
-Ref: 42631762846
-Ref: 42641762927
-Ref: S02081762927
-Ref: 42651762931
-Ref: 42661762957
-Ref: 42671763015
-Ref: S02091763015
-Ref: 42681763038
-Ref: 42691763072
-Ref: 42701763107
-Ref: 42711763148
-Ref: 42721763197
-Ref: 42731763519
-Ref: 42741763709
-Ref: 42751765044
-Ref: 42761765045
-Ref: 42771765045
-Ref: 42781765889
-Ref: 42791767287
-Ref: 42801768415
-Ref: 42811768673
-Ref: 42821769106
-Ref: 42831769576
-Ref: 42841769646
-Ref: 42851769927
-Ref: 42861770145
-Ref: 42871771051
-Ref: 42881774530
-Ref: 42891775649
-Ref: 42901776926
-Node: 9.21777490
-Ref: 42911777681
-Ref: 42921777783
-Ref: 42931777784
-Ref: 42941777784
-Ref: 42951777784
-Ref: 42961777929
-Ref: 42971781120
-Ref: 42981781120
-Ref: 42991781277
-Node: 9.31785474
-Ref: 43001785677
-Ref: 43011785677
-Ref: 43021785677
-Ref: 43031785677
-Ref: 43041786893
-Ref: 43051787605
-Node: 9.41792345
-Ref: 43061792499
-Ref: 43071792499
-Ref: 43081792499
-Ref: 43091792499
-Ref: 43101792669
-Ref: 43111792670
-Ref: 43121792670
-Ref: 43131793051
-Ref: 43141793189
-Ref: S02101793189
-Ref: 43151793216
-Ref: 43161793237
-Ref: 43171793276
-Ref: 43181793316
-Ref: 43191793347
-Ref: 43201793466
-Ref: S02111793466
-Ref: 43211793488
-Ref: 43221793522
-Ref: 43231793562
-Ref: 43241793593
-Ref: 43251793643
-Ref: S02121793643
-Ref: 43261793659
-Ref: 43271793719
-Ref: 43281793775
-Ref: 43291793883
-Ref: S02131793883
-Ref: 43301793887
-Ref: 43311793923
-Ref: 43321793953
-Ref: 43331794004
-Ref: S02141794004
-Ref: 43341794008
-Ref: 43351794053
-Ref: 43361794407
-Ref: S02151794407
-Ref: 43371794434
-Ref: 43381794468
-Ref: 43391794503
-Ref: 43401794552
-Ref: 43411794679
-Ref: S02161794679
-Ref: 43421794683
-Ref: 43431794724
-Ref: 43441794752
-Ref: 43451794791
-Ref: 43461794835
-Ref: 43471794858
-Ref: 43481795274
-Ref: 43491795510
-Ref: 43501796817
-Ref: 43511796818
-Ref: 43521796818
-Ref: 43531796818
-Ref: 43541797685
-Ref: 43551799220
-Ref: 43561800381
-Ref: 43571800693
-Ref: 43581800774
-Ref: 43591802524
-Ref: 43601803183
-Ref: 43611803262
-Ref: 43621803553
-Ref: 43631803772
-Ref: 43641804004
-Ref: 43651804561
-Ref: 43661805019
-Ref: 43671805019
-Ref: 43681806791
-Ref: 43691812592
-Ref: 43701812903
-Ref: 43711814173
-Ref: 43721814688
-Ref: 43731815372
-Node: 9.51815632
-Ref: 43741815758
-Ref: 43751815758
-Ref: 43761816316
-Ref: 43771817264
-Ref: 43781817533
-Ref: 43791819304
-Ref: 43801819304
-Ref: 43811819304
-Ref: 43821821965
-Ref: S02171821965
-Ref: 43831822413
-Ref: 43841822413
-Ref: 43851824030
-Ref: 43861825070
-Node: 9.5.11825799
-Ref: 43871825963
-Ref: 43881825963
-Ref: 43891825963
-Ref: 43901827796
-Ref: 43911827796
-Ref: 43921828297
-Ref: 43931828476
-Ref: 43941829169
-Ref: 43951829519
-Ref: 43961829520
-Ref: 43971829844
-Ref: 43981829844
-Ref: 43991830241
-Ref: 44001830342
-Ref: 44011830343
-Ref: 44021831619
-Ref: 44031836157
-Node: 9.5.21836278
-Ref: 44041836714
-Ref: S02181836714
-Ref: 44051836728
-Ref: 44061836764
-Ref: 44071836786
-Ref: 44081836816
-Ref: 44091836852
-Ref: 44101836899
-Ref: S02191836899
-Ref: 44111836925
-Ref: 44121836939
-Ref: 44131836953
-Ref: 44141836985
-Ref: 44151837035
-Ref: 44161837355
-Ref: S02201837355
-Ref: 44171837359
-Ref: 44181837389
-Ref: S02211837389
-Ref: 44191837407
-Ref: 44201837428
-Ref: 44211837452
-Ref: 44221837484
-Ref: 44231837523
-Ref: 44241837572
-Ref: 44251837970
-Ref: S02221837970
-Ref: 44261837977
-Ref: 44271838005
-Ref: 44281838050
-Ref: S02231838050
-Ref: 44291838060
-Ref: 44301838103
-Ref: S02241838103
-Ref: 44311838112
-Ref: 44321838135
-Ref: 44331838990
-Ref: 44341839116
-Ref: 44351842243
-Ref: 44361843218
-Ref: 44371845459
-Ref: 44381845554
-Ref: 44391845688
-Ref: 44401845802
-Ref: 44411847112
-Ref: 44421847581
-Ref: 44431847581
-Ref: 44441847581
-Ref: 44451848041
-Ref: 44461848042
-Ref: 44471848321
-Ref: 44481848930
-Ref: 44491849776
-Ref: 44501849976
-Ref: 44511849977
-Ref: 44521849977
-Ref: 44531851275
-Ref: 44541851663
-Ref: 44551854953
-Ref: 44561855547
-Node: 9.5.31855677
-Ref: 44571855791
-Ref: 44581855864
-Ref: 44591855865
-Ref: 44601856150
-Ref: S02251856150
-Ref: 44611856161
-Ref: 44621856167
-Ref: 44631856722
-Ref: 44641856722
-Ref: 44651856722
-Ref: 44661856722
-Ref: 44671856889
-Ref: 44681856890
-Ref: 44691857201
-Ref: 44701857202
-Ref: 44711857364
-Ref: 44721858529
-Ref: 44731858678
-Ref: 44741858874
-Ref: 44751860168
-Ref: 44761860311
-Ref: 44771860311
-Ref: 44781860931
-Ref: 44791861222
-Ref: 44801861326
-Ref: 44811861327
-Ref: 44821862396
-Ref: 44831862971
-Ref: 44841864097
-Node: 9.5.41873100
-Ref: 44851873376
-Ref: 44861873521
-Ref: 44871873522
-Ref: 44881873617
-Ref: S02261873617
-Ref: 44891873654
-Ref: 44901873776
-Ref: 44911874172
-Ref: 44921874624
-Ref: 44931876690
-Ref: 44941879326
-Ref: 44951879796
-Ref: 44961880068
-Ref: 44971881681
-Ref: 44981883284
-Ref: 44991883687
-Ref: 45001883843
-Ref: 45011884063
-Ref: 45021884766
-Node: 9.61885315
-Ref: 45031885468
-Ref: 45041885942
-Ref: 45051886009
-Ref: S02271886009
-Ref: 45061886013
-Ref: 45071886038
-Ref: 45081886098
-Ref: S02281886098
-Ref: 45091886121
-Ref: 45101886165
-Ref: S02291886165
-Ref: 45111886182
-Ref: 45121886246
-Ref: 45131886351
-Ref: 45141886516
-Ref: 45151886517
-Ref: 45161886517
-Ref: 45171887548
-Ref: 45181887595
-Ref: 45191887662
-Ref: 45201887721
-Ref: 45211887775
-Ref: 45221887829
-Ref: 45231888304
-Ref: 45241888343
-Ref: 45251888400
-Ref: 45261888458
-Ref: 45271888514
-Ref: 45281888577
-Ref: 45291888827
-Ref: 45301889539
-Ref: 45311889699
-Ref: 45321889779
-Ref: 45331889941
-Ref: 45341890190
-Ref: 45351890696
-Ref: 45361891263
-Ref: 45371898666
-Ref: 45381898666
-Ref: 45391899816
-Ref: 45401899816
-Ref: 45411900280
-Ref: 45421900750
-Ref: 45431902212
-Node: 9.6.11903116
-Ref: 45441903452
-Ref: 45451903550
-Ref: 45461904285
-Ref: 45471904339
-Ref: 45481904442
-Ref: 45491904543
-Ref: 45501904709
-Ref: 45511905125
-Ref: 45521905649
-Ref: 45531905783
-Ref: 45541905796
-Ref: 45551905804
-Ref: 45561905813
-Ref: 45571905824
-Ref: 45581905846
-Ref: 45591905854
-Ref: 45601905864
-Ref: 45611905896
-Ref: 45621906008
-Ref: 45631906070
-Ref: 45641906132
-Ref: 45651906194
-Ref: 45661906271
-Ref: 45671906442
-Ref: 45681906614
-Ref: 45691906784
-Ref: 45701906955
-Ref: 45711907128
-Ref: 45721907230
-Ref: 45731907334
-Ref: 45741907603
-Ref: 45751907892
-Ref: 45761908449
-Ref: 45771908844
-Ref: 45781909361
-Ref: 45791909929
-Ref: 45801910359
-Ref: 45811910549
-Ref: 45821910673
-Ref: 45831910809
-Ref: 45841932365
-Ref: 45851932565
-Node: 9.71933082
-Ref: 45861933485
-Ref: S02301933485
-Ref: 45871933498
-Ref: 45881933524
-Ref: 45891933550
-Ref: 45901933582
-Ref: 45911933859
-Node: 9.7.11934056
-Ref: 45921934381
-Ref: 45931934449
-Ref: S02311934449
-Ref: 45941934477
-Ref: 45951934494
-Ref: 45961934532
-Ref: 45971934549
-Ref: 45981934590
-Ref: 45991934647
-Ref: S02321934647
-Ref: 46001934657
-Ref: 46011934696
-Ref: S02331934696
-Ref: 46021934709
-Ref: 46031934737
-Ref: 46041934764
-Ref: 46051934812
-Ref: S02341934812
-Ref: 46061934824
-Ref: 46071934842
-Ref: 46081934891
-Ref: S02351934891
-Ref: 46091934903
-Ref: 46101934920
-Ref: 46111934973
-Ref: S02361934973
-Ref: 46121935212
-Ref: 46131935776
-Ref: 46141935953
-Ref: 46151936598
-Ref: 46161937247
-Ref: 46171939080
-Node: 9.7.21940311
-Ref: 46181940750
-Ref: 46191940818
-Ref: S02371940818
-Ref: 46201940845
-Ref: 46211940886
-Ref: 46221940984
-Ref: S02381940984
-Ref: 46231940996
-Ref: 46241941021
-Ref: 46251941109
-Ref: S02391941109
-Ref: 46261941121
-Ref: 46271941148
-Ref: 46281942270
-Ref: 46291944191
-Node: 9.7.31944723
-Ref: 46301945588
-Ref: S02401945588
-Ref: 46311945615
-Ref: 46321945658
-Ref: 46331945750
-Node: 9.7.41946943
-Ref: 46341947293
-Ref: S02411947293
-Ref: 46351947320
-Ref: 46361947369
-Ref: 46371947433
-Ref: S02421947433
-Ref: 46381947437
-Ref: 46391947460
-Ref: 46401947549
-Ref: S02431947549
-Ref: 46411947553
-Ref: 46421947585
-Ref: 46431947623
-Ref: S02441947623
-Ref: 46441947627
-Ref: 46451947731
-Ref: 46461947732
-Ref: 46471948614
-Ref: 46481951267
-Ref: 46491951267
-Ref: 46501951267
-Ref: 46511951697
-Ref: 46521951698
-Ref: 46531951698
-Ref: 46541951698
-Ref: 46551951698
-Ref: 46561952178
-Ref: 46571952310
-Node: 9.81952488
-Ref: 46581953016
-Ref: S02451953016
-Ref: 46591953032
-Ref: 46601953045
-Ref: 46611953104
-Ref: 46621953251
-Ref: 46631953349
-Ref: 46641953349
-Ref: 46651953350
-Ref: 46661953350
-Ref: 46671954213
-Ref: 46681954213
-Ref: 46691954639
-Ref: 46701956570
-Ref: 46711957556
-Ref: 46721958949
-Ref: 46731959232
-Ref: 46741960467
-Ref: 46751960467
-Ref: 46761960467
-Ref: 46771960467
-Node: 9.91961302
-Ref: 46781961606
-Ref: 46791961621
-Ref: 46801961718
-Ref: 46811961719
-Ref: 46821961884
-Ref: 46831961899
-Ref: 46841962403
-Ref: 46851962418
-Node: 9.101963459
-Ref: 46861963722
-Ref: 46871963723
-Ref: 46881964414
-Ref: 46891966354
-Ref: 46901969618
-Ref: 46911969880
-Node: 9.111973811
-Node: 101977654
-Ref: 46921978697
-Ref: 46931978697
-Ref: 46941978697
-Ref: 46951979002
-Ref: 46961979494
-Ref: 46971979975
-Ref: 46981979985
-Ref: 46991980166
-Node: 10.11981306
-Ref: 47001981420
-Ref: 47011981420
-Ref: 47021981421
-Ref: 47031981736
-Ref: 47041982816
-Ref: 47051983063
-Node: 10.1.11984995
-Ref: 47061985355
-Ref: 47071985604
-Ref: S02461985604
-Ref: 47081985610
-Ref: 47091985652
-Ref: S02471985652
-Ref: 47101985666
-Ref: 47111985681
-Ref: 47121985703
-Ref: 47131985718
-Ref: 47141985746
-Ref: S02481985746
-Ref: 47151985761
-Ref: 47161985795
-Ref: 47171985832
-Ref: 47181985898
-Ref: S02491985898
-Ref: 47191985913
-Ref: 47201985940
-Ref: 47211985970
-Ref: 47221985994
-Ref: 47231986057
-Ref: S02501986057
-Ref: 47241986070
-Ref: 47251986107
-Ref: 47261986144
-Ref: 47271986201
-Ref: S02511986201
-Ref: 47281986205
-Ref: 47291986224
-Ref: 47301986261
-Ref: S02521986261
-Ref: 47311986265
-Ref: 47321986766
-Ref: 47331986766
-Ref: 47341986766
-Ref: 47351986766
-Ref: 47361986766
-Ref: 47371987073
-Ref: 47381988245
-Ref: 47391988245
-Ref: 47401988469
-Ref: 47411988761
-Ref: 47421989755
-Ref: 47431989894
-Ref: 47441990262
-Ref: 47451990262
-Ref: 47461990262
-Ref: 47471990262
-Ref: 47481990525
-Ref: 47491990646
-Ref: 47501993278
-Ref: 47512002636
-Ref: 47522002637
-Ref: 47532015112
-Ref: 47542016081
-Node: 10.1.22016769
-Ref: 47552017089
-Ref: 47562017501
-Ref: 47572018229
-Ref: S02532018229
-Ref: 47582018235
-Ref: 47592018269
-Ref: S02542018269
-Ref: 47602018273
-Ref: 47612018288
-Ref: 47622018383
-Ref: S02552018383
-Ref: 47632018387
-Ref: 47642018410
-Ref: 47652018464
-Ref: S02562018464
-Ref: 47662018505
-Ref: 47672018532
-Ref: 47682018573
-Ref: S02572018573
-Ref: 47692018606
-Ref: 47702018633
-Ref: 47712018815
-Ref: 47722019344
-Ref: 47732021049
-Ref: 47742021050
-Ref: 47752021110
-Ref: 47762021111
-Ref: 47772035800
-Ref: 47782037084
-Ref: 47792037521
-Ref: 47802037834
-Ref: 47812038246
-Node: 10.1.32039138
-Ref: 47822039671
-Ref: S02582039671
-Ref: 47832039675
-Ref: 47842039699
-Ref: 47852039719
-Ref: 47862039742
-Ref: 47872039851
-Ref: S02592039851
-Ref: 47882039865
-Ref: 47892039895
-Ref: 47902039944
-Ref: 47912040204
-Ref: S02602040204
-Ref: 47922040230
-Ref: 47932040274
-Ref: 47942040346
-Ref: S02612040346
-Ref: 47952040369
-Ref: 47962040413
-Ref: 47972040490
-Ref: S02622040490
-Ref: 47982040518
-Ref: 47992040562
-Ref: 48002040600
-Ref: S02632040600
-Ref: 48012040615
-Ref: 48022040633
-Ref: 48032040723
-Ref: 48042040817
-Ref: 48052041081
-Ref: 48062042273
-Ref: 48072042704
-Ref: 48082042894
-Ref: 48092045935
-Ref: 48102046225
-Ref: 48112046571
-Node: 10.1.42046682
-Ref: 48122046826
-Ref: 48132046826
-Ref: 48142049901
-Ref: 48152051080
-Ref: 48162057414
-Ref: 48172057831
-Ref: 48182059252
-Node: 10.1.52060499
-Ref: 48192060793
-Ref: 48202060793
-Ref: 48212060848
-Ref: 48222063340
-Ref: 48232063341
-Ref: 48242063341
-Ref: 48252063341
-Ref: 48262064289
-Ref: 48272064289
-Node: 10.1.62067150
-Ref: 48282067633
-Ref: 48292067634
-Ref: 48302067634
-Ref: 48312067634
-Ref: 48322069352
-Ref: 48332069352
-Ref: 48342069352
-Ref: 48352069352
-Ref: 48362070225
-Ref: 48372070225
-Ref: 48382070598
-Ref: 48392070598
-Ref: 48402070825
-Node: 10.22072766
-Ref: 48412072873
-Ref: 48422072873
-Ref: 48432072873
-Ref: 48442073098
-Ref: 48452073098
-Ref: 48462073305
-Ref: 48472073790
-Ref: 48482073791
-Ref: 48492073791
-Ref: 48502076284
-Ref: 48512077944
-Ref: 48522078548
-Ref: 48532078549
-Ref: 48542080954
-Ref: 48552084239
-Ref: 48562084240
-Ref: 48572086111
-Ref: 48582086232
-Ref: 48592087263
-Ref: 48602087264
-Ref: 48612087264
-Ref: 48622087264
-Ref: 48632087264
-Ref: 48642087483
-Ref: 48652087483
-Ref: 48662087747
-Ref: 48672090036
-Ref: 48682096348
-Node: 10.2.12097240
-Ref: 48692097347
-Ref: 48702099606
-Ref: 48712099607
-Ref: 48722099634
-Ref: 48732099645
-Ref: 48742099650
-Ref: 48752099829
-Ref: 48762099830
-Ref: 48772099859
-Ref: 48782099921
-Ref: 48792102528
-Ref: 48802104377
-Ref: 48812104522
-Ref: 48822104522
-Ref: 48832104907
-Ref: 48842105069
-Ref: 48852106020
-Ref: 48862108608
-Ref: 48872110838
-Ref: 48882110839
-Ref: 48892110858
-Ref: 48902110870
-Ref: 48912110875
-Ref: 48922111022
-Ref: 48932115878
-Ref: 48942115977
-Ref: 48952115977
-Ref: 48962116409
-Ref: 48972121749
-Ref: 48982121750
-Ref: 48992121773
-Ref: 49002121793
-Ref: 49012121818
-Ref: 49022121819
-Ref: 49032121846
-Ref: 49042121866
-Ref: 49052121891
-Ref: 49062121892
-Ref: 49072121921
-Ref: 49082122233
-Ref: 49092122238
-Ref: 49102122640
-Ref: 49112122800
-Ref: 49122124240
-Ref: 49132124240
-Ref: 49142126893
-Ref: 49152127344
-Ref: 49162129009
-Ref: 49172130164
-Ref: 49182131370
-Node: 112134020
-Ref: 49192134273
-Ref: 49202134274
-Ref: 49212134274
-Ref: 49222134274
-Ref: 49232134274
-Ref: 49242134274
-Ref: 49252134416
-Ref: 49262134558
-Ref: 49272134691
-Ref: 49282135038
-Node: 11.12136838
-Ref: 49292136955
-Ref: 49302137111
-Ref: S02642137111
-Ref: 49312137115
-Ref: 49322137167
-Ref: 49332138802
-Ref: 49342138802
-Ref: 49352138802
-Ref: 49362138802
-Ref: 49372138802
-Ref: 49382139211
-Ref: 49392139273
-Ref: 49402139273
-Ref: 49412139273
-Ref: 49422139377
-Ref: 49432139874
-Ref: 49442141032
-Node: 11.22141165
-Ref: 49452141445
-Ref: S02652141445
-Ref: 49462141460
-Ref: 49472141511
-Ref: 49482141539
-Ref: 49492141584
-Ref: S02662141584
-Ref: 49502141602
-Ref: 49512141635
-Ref: 49522141655
-Ref: 49532141692
-Ref: 49542141753
-Ref: S02672141753
-Ref: 49552141757
-Ref: 49562141802
-Ref: S02682141802
-Ref: 49572141817
-Ref: 49582141859
-Ref: 49592141965
-Ref: 49602142200
-Ref: 49612143616
-Ref: 49622143959
-Ref: 49632144614
-Node: 11.32145736
-Ref: 49642146034
-Ref: S02692146034
-Ref: 49652146075
-Ref: 49662146093
-Ref: 49672146184
-Ref: S02702146184
-Ref: 49682146210
-Ref: 49692146228
-Ref: 49702151034
-Ref: 49712151705
-Ref: 49722151807
-Ref: 49732152163
-Ref: 49742154075
-Ref: 49752154525
-Node: 11.42154864
-Ref: 49762155135
-Ref: 49772155209
-Ref: 49782155864
-Ref: 49792155864
-Ref: 49802156109
-Ref: 49812156272
-Ref: 49822156273
-Ref: 49832157619
-Ref: 49842158970
-Ref: 49852159163
-Ref: 49862159164
-Ref: 49872159353
-Ref: 49882159353
-Ref: 49892159353
-Node: 11.4.12161090
-Ref: 49902161414
-Ref: 49912161520
-Ref: 49922161614
-Ref: 49932161665
-Ref: 49942161732
-Ref: 49952161809
-Ref: 49962161939
-Ref: 49972162062
-Ref: 49982162135
-Ref: 49992162262
-Ref: 50002162408
-Ref: 50012162486
-Ref: 50022162587
-Ref: 50032162708
-Ref: 50042162845
-Ref: 50052163010
-Ref: 50062163190
-Ref: 50072163306
-Ref: 50082163445
-Ref: 50092164723
-Ref: 50102164738
-Ref: 50112166292
-Ref: 50122169921
-Ref: 50132182260
-Ref: 50142182453
-Ref: 50152184358
-Ref: 50162185005
-Node: 11.4.22185956
-Ref: 50172186599
-Ref: 50182186599
-Ref: 50192187964
-Ref: 50202187965
-Ref: 50212187991
-Ref: 50222188029
-Ref: 50232188265
-Ref: 50242188266
-Ref: 50252188290
-Ref: 50262188348
-Ref: 50272188349
-Ref: 50282188391
-Ref: 50292188413
-Ref: 50302188447
-Ref: 50312188469
-Ref: 50322188517
-Ref: 50332188518
-Ref: 50342192411
-Ref: 50352192489
-Ref: 50362192542
-Ref: 50372192588
-Ref: 50382193421
-Ref: 50392193421
-Ref: 50402198556
-Ref: 50412198732
-Ref: 50422199620
-Node: 11.4.32199759
-Node: 11.52202583
-Ref: 50432202752
-Ref: 50442203022
-Ref: 50452203023
-Ref: 50462203023
-Ref: 50472203023
-Ref: 50482203023
-Ref: 50492203224
-Ref: 50502203637
-Ref: 50512203638
-Ref: 50522203647
-Ref: 50532203709
-Ref: 50542203710
-Ref: 50552203721
-Ref: 50562203772
-Ref: 50572203773
-Ref: 50582203773
-Ref: 50592203773
-Ref: 50602205408
-Ref: 50612205634
-Ref: 50622206276
-Ref: 50632206477
-Ref: 50642206751
-Ref: 50652207070
-Ref: 50662207199
-Ref: 50672207767
-Ref: 50682207977
-Ref: 50692208240
-Ref: 50702208833
-Ref: 50712209119
-Ref: 50722209263
-Ref: 50732209383
-Ref: 50742209677
-Ref: 50752210156
-Ref: 50762210156
-Ref: 50772211030
-Ref: 50782212395
-Ref: 50792212892
-Ref: 50802214597
-Ref: 50812214597
-Ref: 50822215458
-Ref: 50832217400
-Node: 11.62219703
-Ref: 50842219858
-Ref: 50852219858
-Ref: 50862219859
-Ref: 50872219859
-Ref: 50882219859
-Ref: 50892219859
-Ref: 50902220083
-Ref: 50912222404
-Ref: 50922222404
-Ref: 50932225521
-Ref: 50942226261
-Ref: 50952226432
-Ref: 50962226433
-Ref: 50972226433
-Node: 122232651
-Ref: 50982232754
-Ref: 50992232844
-Ref: 51002233071
-Ref: 51012233072
-Ref: 51022233072
-Node: 12.12234911
-Ref: 51032235439
-Ref: S02712235439
-Ref: 51042235443
-Ref: 51052235477
-Ref: 51062235576
-Ref: S02722235576
-Ref: 51072235591
-Ref: 51082235612
-Ref: 51092235651
-Ref: 51102235709
-Ref: S02732235709
-Ref: 51112235724
-Ref: 51122235745
-Ref: 51132236062
-Ref: S02742236062
-Ref: 51142236076
-Ref: 51152236121
-Ref: 51162236177
-Ref: S02752236177
-Ref: 51172236193
-Ref: 51182236230
-Ref: 51192236265
-Ref: 51202236306
-Ref: 51212237017
-Ref: 51222237018
-Ref: 51232237018
-Ref: 51242237018
-Ref: 51252237145
-Ref: 51262237595
-Ref: 51272240343
-Ref: 51282241712
-Node: 12.22241907
-Ref: 51292242021
-Ref: 51302242346
-Node: 12.32244273
-Ref: 51312244402
-Ref: 51322244566
-Ref: 51332244567
-Ref: 51342245774
-Ref: S02762245774
-Ref: 51352245797
-Ref: 51362245861
-Ref: 51372245867
-Ref: 51382245906
-Ref: 51392245940
-Ref: 51402245982
-Ref: 51412246048
-Ref: 51422246054
-Ref: 51432246093
-Ref: 51442246127
-Ref: 51452246168
-Ref: 51462246226
-Ref: 51472246232
-Ref: 51482246271
-Ref: 51492246321
-Ref: S02772246321
-Ref: 51502246335
-Ref: 51512246358
-Ref: 51522246407
-Ref: S02782246407
-Ref: 51532246446
-Ref: 51542246464
-Ref: 51552246545
-Ref: S02792246545
-Ref: 51562246549
-Ref: 51572246572
-Ref: 51582246598
-Ref: 51592246611
-Ref: 51602246618
-Ref: 51612246658
-Ref: 51622246666
-Ref: 51632246671
-Ref: 51642246934
-Ref: 51652246935
-Ref: 51662246935
-Ref: 51672251982
-Ref: 51682254337
-Ref: 51692256086
-Ref: 51702260372
-Ref: 51712260373
-Ref: 51722260880
-Ref: 51732260881
-Ref: 51742260881
-Ref: 51752260881
-Ref: 51762260881
-Ref: 51772260881
-Ref: 51782260881
-Ref: 51792260881
-Ref: 51802270629
-Ref: 51812275087
-Ref: 51822275470
-Ref: 51832275710
-Ref: 51842281247
-Ref: 51852281534
-Ref: 51862282048
-Ref: 51872284557
-Ref: 51882284745
-Node: 12.42285097
-Ref: 51892285212
-Ref: 51902285212
-Ref: 51912285789
-Ref: S02802285789
-Ref: 51922285803
-Ref: 51932285830
-Ref: 51942285836
-Ref: 51952285852
-Ref: 51962285875
-Ref: 51972285909
-Ref: 51982285942
-Ref: 51992285969
-Ref: 52002285974
-Ref: 52012285996
-Ref: 52022286036
-Ref: 52032286111
-Ref: 52042286221
-Ref: 52052286909
-Ref: 52062288275
-Ref: 52072288408
-Ref: 52082289044
-Ref: 52092289846
-Ref: 52102289992
-Ref: 52112291276
-Ref: 52122291277
-Ref: 52132291277
-Ref: 52142292166
-Ref: 52152292481
-Ref: 52162292481
-Ref: 52172292759
-Ref: 52182293720
-Ref: 52192295052
-Ref: 52202295950
-Node: 12.52296087
-Ref: 52212296952
-Ref: S02812296952
-Ref: 52222296968
-Ref: 52232297012
-Ref: 52242297146
-Ref: S02822297146
-Ref: 52252297165
-Ref: 52262297185
-Ref: 52272297207
-Ref: 52282297250
-Ref: 52292297344
-Ref: S02832297344
-Ref: 52302297363
-Ref: 52312297383
-Ref: 52322297476
-Ref: S02842297476
-Ref: 52332297492
-Ref: 52342297534
-Ref: 52352297576
-Ref: 52362297619
-Ref: 52372297668
-Ref: 52382297710
-Ref: 52392297754
-Ref: 52402297804
-Ref: 52412297853
-Ref: 52422297893
-Ref: 52432297934
-Ref: 52442298015
-Ref: 52452298015
-Ref: 52462298015
-Ref: 52472298015
-Ref: 52482298497
-Ref: 52492298497
-Ref: 52502298497
-Ref: 52512298497
-Ref: 52522298806
-Ref: 52532298807
-Ref: 52542308181
-Node: 12.5.12308988
-Ref: 52552310331
-Ref: S02852310331
-Ref: 52562310511
-Ref: S02862310511
-Ref: 52572310566
-Ref: 52582310585
-Ref: 52592311220
-Ref: 52602311221
-Ref: 52612319414
-Ref: 52622324093
-Ref: 52632324108
-Ref: 52642326073
-Ref: 52652328815
-Ref: 52662329734
-Ref: 52672331147
-Ref: 52682331511
-Ref: 52692332994
-Node: 12.5.22333956
-Ref: 52702334948
-Ref: S02872334948
-Ref: 52712335003
-Ref: S02882335003
-Ref: 52722335055
-Ref: S02892335055
-Ref: 52732335107
-Ref: S02902335107
-Ref: 52742335168
-Ref: S02912335168
-Ref: 52752335227
-Ref: S02922335227
-Node: 12.5.32336442
-Ref: 52762337108
-Ref: S02932337108
-Ref: 52772337112
-Ref: 52782337955
-Ref: 52792338053
-Ref: 52802339105
-Node: 12.5.42339856
-Ref: 52812340527
-Ref: S02942340527
-Ref: 52822340531
-Ref: 52832340717
-Ref: 52842342528
-Ref: 52852343217
-Ref: 52862343648
-Ref: 52872344223
-Node: 12.5.52344878
-Ref: 52882345934
-Ref: S02952345934
-Ref: 52892345938
-Ref: 52902347397
-Node: 12.62347443
-Ref: 52912347566
-Ref: 52922347566
-Ref: 52932347915
-Ref: S02962347915
-Ref: 52942347919
-Ref: 52952347975
-Ref: 52962348123
-Ref: S02972348123
-Ref: 52972348143
-Ref: 52982348172
-Ref: 52992348206
-Ref: 53002348338
-Ref: S02982348338
-Ref: 53012348358
-Ref: 53022348396
-Ref: 53032348430
-Ref: 53042348510
-Ref: S02992348510
-Ref: 53052348514
-Ref: 53062348565
-Ref: S03002348565
-Ref: 53072348569
-Ref: 53082349690
-Ref: 53092350170
-Ref: 53102350422
-Ref: 53112350692
-Ref: 53122351459
-Ref: 53132352787
-Ref: 53142353487
-Ref: 53152358775
-Ref: 53162365015
-Ref: 53172365616
-Ref: 53182366229
-Node: 12.72366957
-Ref: 53192367074
-Ref: 53202367074
-Ref: 53212367437
-Ref: S03012367437
-Ref: 53222367464
-Ref: 53232367507
-Ref: 53242367513
-Ref: 53252367560
-Ref: 53262367648
-Ref: S03022367648
-Ref: 53272367689
-Ref: 53282367720
-Ref: 53292367750
-Ref: 53302367869
-Ref: S03032367869
-Ref: 53312367883
-Ref: 53322367937
-Ref: 53332368152
-Ref: 53342371779
-Ref: 53352372253
-Ref: 53362376251
-Ref: 53372376419
-Ref: 53382377320
-Ref: 53392378013
-Node: 12.82378151
-Node: 132380655
-Node: 13.12381807
-Ref: 53402382036
-Ref: 53412382943
-Ref: 53422382944
-Ref: 53432382944
-Ref: 53442383474
-Ref: 53452385345
-Ref: S03042385345
-Ref: S03052385345
-Ref: 53462385350
-Ref: 53472385396
-Ref: 53482385443
-Ref: 53492385485
-Ref: 53502385513
-Ref: S03062385513
-Ref: 53512385517
-Ref: 53522385543
-Ref: 53532385555
-Ref: 53542385602
-Ref: 53552385781
-Ref: 53562389784
-Ref: 53572389785
-Ref: 53582390294
-Ref: 53592390586
-Ref: 53602390587
-Ref: 53612394507
-Ref: 53622394508
-Ref: 53632394508
-Ref: 53642394780
-Ref: 53652394781
-Ref: 53662394781
-Ref: 53672394781
-Ref: 53682400078
-Ref: 53692400079
-Ref: 53702400079
-Ref: 53712400079
-Ref: 53722412502
-Ref: 53732418480
-Ref: 53742418934
-Ref: 53752420394
-Ref: 53762420898
-Ref: 53772421131
-Ref: 53782421131
-Ref: 53792421132
-Ref: 53802421132
-Ref: 53812421132
-Ref: 53822421235
-Ref: 53832421788
-Ref: 53842422899
-Ref: 53852429675
-Ref: 53862430334
-Ref: 53872432767
-Ref: 53882435175
-Ref: 53892437128
-Node: 13.1.12438275
-Ref: 53902438697
-Ref: 53912438794
-Ref: S03072438794
-Ref: 53922438812
-Ref: 53932438828
-Ref: 53942438866
-Ref: 53952438882
-Ref: 53962438949
-Ref: S03082438949
-Ref: 53972438961
-Ref: 53982439032
-Ref: S03092439032
-Ref: 53992439036
-Ref: 54002439044
-Ref: 54012439057
-Ref: 54022444222
-Ref: 54032444542
-Ref: 54042444753
-Ref: 54052444753
-Ref: 54062444948
-Ref: 54072449920
-Ref: 54082450114
-Ref: 54092450154
-Ref: 54102451139
-Ref: 54112452959
-Ref: 54122453326
-Ref: 54132453439
-Ref: 54142453439
-Ref: 54152453626
-Ref: 54162453811
-Ref: 54172454867
-Ref: 54182458061
-Ref: 54192458189
-Node: 13.22459458
-Ref: 54202461814
-Ref: 54212461815
-Ref: 54222461815
-Ref: 54232463289
-Ref: 54242466009
-Node: 13.32466966
-Ref: 54252467187
-Ref: 54262467187
-Ref: 54272467337
-Ref: 54282467770
-Ref: S03102467770
-Ref: 54292467790
-Ref: 54302467801
-Ref: 54312467826
-Ref: 54322467853
-Ref: 54332467864
-Ref: 54342467889
-Ref: 54352468126
-Ref: 54362468294
-Ref: 54372469525
-Ref: 54382469526
-Ref: 54392469728
-Ref: 54402469770
-Ref: 54412470824
-Ref: 54422471157
-Ref: 54432471158
-Ref: 54442471158
-Ref: 54452471158
-Ref: 54462471158
-Ref: 54472471158
-Ref: 54482471158
-Ref: 54492471158
-Ref: 54502471158
-Ref: 54512471158
-Ref: 54522471158
-Ref: 54532471158
-Ref: 54542471158
-Ref: 54552471158
-Ref: 54562471158
-Ref: 54572471334
-Ref: 54582471335
-Ref: 54592471521
-Ref: 54602471521
-Ref: 54612471591
-Ref: 54622472892
-Ref: 54632474091
-Ref: 54642474106
-Ref: 54652474888
-Ref: 54662474903
-Ref: 54672475024
-Ref: 54682475024
-Ref: 54692477523
-Ref: 54702479002
-Ref: 54712483122
-Ref: 54722483137
-Ref: 54732484244
-Ref: 54742484245
-Ref: 54752484742
-Ref: 54762484757
-Ref: 54772485242
-Ref: 54782485243
-Ref: 54792485466
-Ref: 54802485466
-Ref: 54812485615
-Ref: 54822485949
-Ref: 54832487234
-Ref: 54842489415
-Ref: 54852496662
-Ref: 54862496677
-Ref: 54872497026
-Ref: 54882497041
-Ref: 54892497229
-Ref: 54902497229
-Ref: 54912497643
-Ref: 54922497995
-Ref: 54932498010
-Ref: 54942498618
-Ref: 54952498619
-Ref: 54962499054
-Ref: 54972499054
-Ref: 54982503785
-Ref: 54992505199
-Ref: 55002509148
-Ref: 55012515879
-Ref: 55022516689
-Ref: 55032516704
-Ref: 55042518726
-Ref: 55052518726
-Ref: 55062520537
-Ref: 55072520537
-Ref: 55082520537
-Ref: 55092520875
-Ref: 55102520890
-Ref: 55112521024
-Ref: 55122521039
-Ref: 55132521264
-Ref: 55142521264
-Ref: 55152521832
-Ref: 55162523427
-Ref: 55172523442
-Ref: 55182524591
-Ref: 55192524606
-Ref: 55202525975
-Ref: 55212525990
-Ref: 55222526079
-Ref: 55232526080
-Ref: 55242526402
-Ref: 55252526402
-Ref: 55262533358
-Ref: 55272536324
-Ref: 55282537435
-Ref: 55292537959
-Node: 13.42538830
-Ref: 55302539160
-Ref: S03112539160
-Ref: 55312539192
-Ref: 55322539207
-Ref: 55332539259
-Ref: S03122539259
-Ref: 55342539263
-Ref: 55352539332
-Ref: 55362540901
-Ref: 55372540984
-Ref: 55382541126
-Ref: 55392541126
-Ref: 55402542387
-Ref: 55412545032
-Node: 13.52545995
-Ref: 55422546107
-Ref: 55432546107
-Ref: 55442546107
-Ref: 55452546107
-Ref: 55462546107
-Ref: 55472546107
-Ref: 55482546107
-Ref: 55492546107
-Ref: 55502546107
-Node: 13.5.12546474
-Ref: 55512546805
-Ref: 55522547331
-Ref: S03132547331
-Ref: 55532547363
-Ref: 55542547397
-Ref: 55552547423
-Ref: 55562547488
-Ref: S03142547488
-Ref: 55572547512
-Ref: 55582547526
-Ref: 55592547541
-Ref: 55602547554
-Ref: 55612547580
-Ref: S03152547580
-Ref: 55622547592
-Ref: 55632547620
-Ref: S03162547620
-Ref: 55642547632
-Ref: 55652547666
-Ref: S03172547666
-Ref: 55662547678
-Ref: 55672547944
-Ref: 55682547944
-Ref: 55692547944
-Ref: 55702547944
-Ref: 55712554537
-Ref: 55722555251
-Ref: 55732562199
-Ref: 55742562946
-Node: 13.5.22563161
-Ref: 55752563353
-Ref: 55762563661
-Ref: 55772563676
-Ref: 55782564788
-Ref: 55792564803
-Ref: 55802565450
-Ref: 55812565465
-Ref: 55822566595
-Ref: 55832566595
-Ref: 55842568106
-Node: 13.5.32568489
-Ref: 55852569439
-Ref: 55862569526
-Ref: 55872569527
-Ref: 55882569527
-Ref: 55892569762
-Ref: 55902569763
-Ref: 55912569763
-Ref: 55922569977
-Ref: 55932569992
-Ref: 55942570107
-Ref: 55952570108
-Ref: 55962570290
-Ref: 55972570290
-Ref: 55982570639
-Ref: 55992571778
-Ref: 56002573117
-Node: 13.62573352
-Ref: 56012573514
-Ref: 56022573514
-Node: 13.72575190
-Ref: 56032575707
-Ref: 56042575771
-Ref: 56052575828
-Ref: 56062575940
-Ref: 56072576004
-Ref: 56082576070
-Ref: 56092576138
-Ref: 56102576209
-Ref: 56112576271
-Ref: 56122576342
-Ref: 56132576410
-Ref: 56142576482
-Ref: 56152576604
-Ref: 56162576647
-Ref: 56172576692
-Ref: 56182576751
-Ref: 56192576825
-Ref: 56202576918
-Ref: 56212577639
-Ref: 56222577653
-Ref: 56232577671
-Ref: 56242577697
-Ref: 56252577843
-Ref: 56262577913
-Ref: 56272578024
-Ref: 56282578133
-Ref: 56292582741
-Ref: 56302585941
-Ref: 56312587708
-Node: 13.7.12588568
-Ref: 56322588860
-Ref: 56332588951
-Ref: 56342589018
-Ref: 56352589096
-Ref: 56362589207
-Ref: 56372589367
-Ref: 56382590132
-Ref: 56392590192
-Ref: 56402590301
-Ref: 56412591101
-Ref: 56422591102
-Ref: 56432592221
-Ref: 56442593966
-Node: 13.7.22594135
-Ref: 56452594426
-Ref: 56462594694
-Ref: 56472594802
-Ref: 56482595254
-Node: 13.82598235
-Ref: 56492598368
-Ref: 56502598555
-Ref: S03182598555
-Ref: 56512598559
-Ref: 56522599256
-Ref: 56532599928
-Ref: 56542599928
-Ref: 56552602201
-Ref: 56562602469
-Ref: 56572602482
-Node: 13.92602605
-Ref: 56582602745
-Ref: 56592602745
-Ref: 56602602746
-Ref: 56612602746
-Ref: 56622602746
-Ref: 56632603107
-Ref: 56642604350
-Ref: 56652604350
-Ref: 56662609120
-Ref: 56672609349
-Ref: 56682609349
-Node: 13.9.12610535
-Ref: 56692610994
-Ref: 56702611199
-Ref: 56712611199
-Ref: 56722611497
-Ref: 56732613319
-Ref: 56742613565
-Ref: 56752615074
-Ref: 56762615074
-Ref: 56772615333
-Ref: 56782615334
-Ref: 56792617069
-Ref: 56802623131
-Ref: 56812625756
-Ref: 56822625902
-Node: 13.9.22626478
-Ref: 56832626926
-Ref: 56842626941
-Ref: 56852627229
-Ref: 56862630660
-Node: 13.102631691
-Ref: 56872632163
-Ref: 56882632178
-Ref: 56892632470
-Ref: 56902633540
-Node: 13.112635490
-Ref: 56912635618
-Ref: 56922635619
-Ref: 56932635619
-Ref: 56942635619
-Ref: 56952637984
-Ref: 56962638121
-Ref: 56972638305
-Ref: 56982638567
-Ref: 56992638829
-Ref: 57002639211
-Ref: 57012639211
-Ref: 57022639284
-Ref: 57032639284
-Ref: 57042639284
-Ref: 57052639828
-Ref: 57062639843
-Ref: 57072639975
-Ref: 57082639990
-Ref: 57092640664
-Ref: 57102640664
-Ref: 57112640664
-Ref: 57122640664
-Ref: 57132640864
-Ref: 57142640864
-Ref: 57152640864
-Ref: 57162640864
-Ref: 57172642615
-Ref: 57182642801
-Ref: 57192642802
-Ref: 57202642802
-Ref: 57212643748
-Ref: 57222643758
-Ref: 57232644246
-Ref: 57242645735
-Ref: 57252646422
-Ref: 57262650469
-Ref: 57272650469
-Ref: 57282650470
-Ref: 57292664792
-Ref: 57302665936
-Ref: 57312666524
-Node: 13.11.12668761
-Ref: 57322669234
-Ref: 57332669249
-Ref: 57342669854
-Ref: 57352669869
-Ref: 57362671655
-Node: 13.11.22671718
-Ref: 57372671883
-Ref: 57382671883
-Ref: 57392671884
-Ref: 57402671884
-Ref: 57412671884
-Ref: 57422672295
-Ref: 57432672942
-Ref: 57442674676
-Ref: 57452674677
-Ref: 57462674677
-Ref: 57472674677
-Ref: 57482674915
-Ref: 57492675244
-Ref: 57502675244
-Ref: 57512675333
-Ref: 57522675333
-Ref: 57532676047
-Ref: 57542676047
-Ref: 57552676611
-Ref: 57562676753
-Ref: 57572676754
-Ref: 57582679131
-Ref: 57592679132
-Ref: 57602683514
-Node: 13.11.32685326
-Ref: 57612685937
-Ref: 57622685938
-Ref: 57632685966
-Ref: 57642686080
-Ref: S03192686080
-Ref: 57652686098
-Ref: 57662688416
-Ref: 57672688416
-Ref: 57682688416
-Ref: 57692689936
-Ref: 57702689936
-Ref: 57712694732
-Ref: 57722695673
-Ref: 57732696569
-Node: 13.11.42697014
-Ref: 57742697594
-Ref: 57752697698
-Ref: 57762697807
-Ref: 57772697874
-Ref: 57782697992
-Ref: 57792698234
-Ref: 57802698374
-Ref: 57812698532
-Ref: 57822698944
-Ref: 57832699199
-Ref: 57842699373
-Ref: 57852699659
-Ref: 57862699978
-Ref: 57872700272
-Ref: 57882700273
-Ref: 57892700273
-Ref: 57902700273
-Ref: 57912700273
-Ref: 57922701293
-Ref: 57932703334
-Ref: 57942703334
-Ref: 57952703829
-Ref: 57962704489
-Ref: 57972704489
-Ref: 57982704600
-Ref: 57992704600
-Ref: 58002704687
-Ref: 58012706014
-Ref: 58022706014
-Ref: 58032706014
-Ref: 58042706545
-Ref: 58052710065
-Node: 13.11.52710964
-Ref: 58062711388
-Ref: 58072711929
-Ref: 58082712033
-Ref: 58092713651
-Node: 13.11.62714196
-Node: 13.122720976
-Ref: 58102721561
-Ref: 58112721562
-Ref: 58122721575
-Ref: 58132721588
-Ref: 58142721654
-Ref: S03202721654
-Ref: 58152721671
-Ref: 58162721715
-Ref: 58172721729
-Ref: 58182721837
-Ref: S03212721837
-Ref: 58192721841
-Ref: 58202721854
-Ref: 58212721917
-Ref: 58222722350
-Ref: 58232722351
-Ref: 58242725896
-Ref: 58252725897
-Ref: 58262725914
-Ref: 58272725936
-Ref: 58282726577
-Ref: 58292726578
-Ref: 58302727992
-Ref: 58312728159
-Node: 13.12.12729535
-Ref: 58322729930
-Ref: 58332729931
-Ref: 58342730641
-Ref: 58352730642
-Ref: 58362730920
-Ref: 58372730921
-Ref: 58382733374
-Ref: 58392733375
-Ref: 58402733642
-Ref: 58412733643
-Ref: 58422734024
-Ref: 58432734025
-Ref: 58442735406
-Ref: 58452735407
-Ref: 58462735551
-Ref: 58472735552
-Ref: 58482735745
-Ref: 58492735746
-Ref: 58502735925
-Ref: 58512735926
-Ref: 58522738910
-Ref: 58532739506
-Ref: 58542739901
-Node: 13.132740230
-Ref: 58552740335
-Ref: 58562740335
-Ref: 58572741079
-Node: 13.13.12741202
-Ref: 58582742049
-Ref: 58592742106
-Ref: 58602742156
-Ref: 58612742342
-Ref: 58622742402
-Ref: 58632742474
-Ref: 58642742584
-Ref: 58652742708
-Ref: 58662742887
-Ref: 58672745952
-Node: 13.13.22746425
-Ref: 58682746789
-Ref: 58692746789
-Ref: 58702746989
-Ref: 58712747004
-Ref: 58722747775
-Ref: 58732747775
-Ref: 58742749685
-Ref: 58752751299
-Ref: 58762751314
-Ref: 58772751656
-Ref: 58782751671
-Ref: 58792757586
-Ref: 58802757601
-Ref: 58812758070
-Ref: 58822758085
-Ref: 58832758976
-Ref: 58842758991
-Ref: 58852759527
-Ref: 58862759542
-Ref: 58872762713
-Ref: 58882762728
-Ref: 58892763800
-Ref: 58902763815
-Ref: 58912765036
-Ref: 58922765037
-Ref: 58932765284
-Ref: 58942767012
-Ref: 58952767312
-Ref: 58962767673
-Ref: 58972767674
-Ref: 58982767674
-Ref: 58992767674
-Ref: 59002767674
-Ref: 59012767674
-Ref: 59022767674
-Ref: 59032767674
-Ref: 59042768219
-Ref: 59052768220
-Ref: 59062768220
-Ref: 59072768220
-Ref: 59082768220
-Ref: 59092768220
-Ref: 59102768220
-Ref: 59112768220
-Ref: 59122768220
-Ref: 59132768220
-Ref: 59142768220
-Ref: 59152768220
-Ref: 59162768220
-Ref: 59172768220
-Ref: 59182768220
-Ref: 59192768220
-Ref: 59202773424
-Ref: 59212776329
-Ref: 59222780315
-Ref: 59232780316
-Ref: 59242781366
-Ref: 59252787211
-Ref: 59262788419
-Ref: 59272792154
-Ref: 59282792615
-Ref: 59292794573
-Node: 13.142795610
-Ref: 59302804255
-Ref: 59312804255
-Ref: 59322804977
-Ref: 59332805401
-Ref: 59342805606
-Ref: 59352808884
-Ref: 59362809024
-Ref: 59372809359
-Ref: 59382810904
-Ref: 59392811111
-Ref: 59402813139
-Ref: 59412813236
-Ref: 59422813719
-Ref: 59432813957
-Ref: 59442814205
-Ref: 59452816252
-Ref: 59462816253
-Ref: 59472817885
-Ref: 59482817886
-Ref: 59492818548
-Ref: 59502819593
-Ref: 59512819736
-Ref: 59522820320
-Ref: 59532820720
-Ref: 59542821022
-Ref: 59552821975
-Ref: 59562822238
-Ref: 59572822297
-Ref: 59582822298
-Ref: 59592822541
-Ref: 59602822542
-Ref: 59612829207
-Ref: 59622830953
-Ref: 59632831013
-Ref: 59642832013
-Ref: 59652836288
-Ref: 59662837660
-Node: Annex A2839199
-Ref: 59672839359
-Ref: 59682839359
-Ref: 59692850890
-Node: A.12858116
-Ref: 59702858377
-Ref: 59712858584
-Ref: 59722859097
-Ref: 59732859169
-Ref: 59742860459
-Ref: 59752860520
-Ref: 59762860581
-Ref: 59772862476
-Ref: 59782865232
-Ref: 59792868977
-Ref: 59802869367
-Ref: 59812869502
-Ref: 59822869558
-Ref: 59832869646
-Ref: 59842870556
-Ref: 59852870797
-Ref: 59862871038
-Ref: 59872871284
-Ref: 59882871321
-Ref: 59892871358
-Ref: 59902871395
-Ref: 59912872384
-Ref: 59922876587
-Ref: 59932877397
-Node: A.22878273
-Ref: 59942878493
-Ref: 59952879958
-Node: A.32879993
-Ref: 59962880757
-Node: A.3.12881361
-Ref: 59972881682
-Ref: 59982881876
-Ref: 59992882090
-Ref: 60002883039
-Node: A.3.22883114
-Ref: 60012883525
-Ref: 60022883647
-Ref: 60032883722
-Ref: 60042883797
-Ref: 60052883872
-Ref: 60062883947
-Ref: 60072884022
-Ref: 60082884097
-Ref: 60092884172
-Ref: 60102884290
-Ref: 60112884365
-Ref: 60122884440
-Ref: 60132884515
-Ref: 60142884590
-Ref: 60152884665
-Ref: 60162884740
-Ref: 60172884819
-Ref: 60182884953
-Ref: 60192885018
-Ref: 60202885083
-Ref: 60212885151
-Ref: 60222885210
-Ref: 60232885269
-Ref: 60242885405
-Ref: 60252885501
-Ref: 60262885566
-Ref: 60272885635
-Ref: 60282885779
-Ref: 60292886942
-Ref: 60302887133
-Ref: 60312887326
-Ref: 60322887577
-Ref: 60332887803
-Ref: 60342888046
-Ref: 60352888305
-Ref: 60362888496
-Ref: 60372888730
-Ref: 60382888924
-Ref: 60392894273
-Ref: 60402894446
-Node: A.3.32895713
-Ref: 60412896473
-Ref: 60422896535
-Ref: 60432896548
-Ref: 60442896620
-Ref: 60452896692
-Ref: 60462896764
-Ref: 60472896836
-Ref: 60482896908
-Ref: 60492896980
-Ref: 60502897052
-Ref: 60512897124
-Ref: 60522897196
-Ref: 60532897268
-Ref: 60542897341
-Ref: 60552897414
-Ref: 60562897487
-Ref: 60572897560
-Ref: 60582897633
-Ref: 60592897709
-Ref: 60602897782
-Ref: 60612897855
-Ref: 60622897928
-Ref: 60632898001
-Ref: 60642898074
-Ref: 60652898147
-Ref: 60662898220
-Ref: 60672898293
-Ref: 60682898366
-Ref: 60692898439
-Ref: 60702898512
-Ref: 60712898585
-Ref: 60722898658
-Ref: 60732898731
-Ref: 60742898804
-Ref: 60752898919
-Ref: 60762899000
-Ref: 60772899081
-Ref: 60782899162
-Ref: 60792899243
-Ref: 60802899324
-Ref: 60812899405
-Ref: 60822899486
-Ref: 60832899567
-Ref: 60842899648
-Ref: 60852899729
-Ref: 60862899810
-Ref: 60872899891
-Ref: 60882899972
-Ref: 60892900053
-Ref: 60902900111
-Ref: 60912900192
-Ref: 60922900353
-Ref: 60932900434
-Ref: 60942900515
-Ref: 60952900596
-Ref: 60962900677
-Ref: 60972900758
-Ref: 60982900839
-Ref: 60992900995
-Ref: 61002901076
-Ref: 61012901157
-Ref: 61022901238
-Ref: 61032901319
-Ref: 61042901404
-Ref: 61052901485
-Ref: 61062901566
-Ref: 61072901647
-Ref: 61082901728
-Ref: 61092901810
-Ref: 61102901892
-Ref: 61112901974
-Ref: 61122902056
-Ref: 61132902138
-Ref: 61142902220
-Ref: 61152902302
-Ref: 61162902384
-Ref: 61172902466
-Ref: 61182902548
-Ref: 61192902630
-Ref: 61202902716
-Ref: 61212902798
-Ref: 61222902880
-Ref: 61232902962
-Ref: 61242903044
-Ref: 61252903126
-Ref: 61262903208
-Ref: 61272903290
-Ref: 61282903372
-Ref: 61292903454
-Ref: 61302903536
-Ref: 61312903618
-Ref: 61322903700
-Ref: 61332903782
-Ref: 61342903864
-Ref: 61352903946
-Ref: 61362904051
-Ref: 61372904065
-Ref: 61382904119
-Ref: 61392904173
-Ref: 61402904227
-Ref: 61412904285
-Ref: 61422904359
-Ref: 61432904433
-Ref: 61442904507
-Ref: 61452904581
-Ref: 61462904655
-Ref: 61472904729
-Ref: 61482904803
-Ref: 61492904877
-Ref: 61502904951
-Ref: 61512905025
-Ref: 61522905099
-Ref: 61532905173
-Ref: 61542905247
-Ref: 61552905321
-Ref: 61562905395
-Ref: 61572905473
-Ref: 61582905547
-Ref: 61592905621
-Ref: 61602905695
-Ref: 61612905769
-Ref: 61622905843
-Ref: 61632905917
-Ref: 61642905991
-Ref: 61652906069
-Ref: 61662906143
-Ref: 61672906217
-Ref: 61682906291
-Ref: 61692906365
-Ref: 61702906439
-Ref: 61712906513
-Ref: 61722906587
-Ref: 61732906788
-Ref: 61742906874
-Ref: 61752906946
-Ref: 61762907032
-Ref: 61772907118
-Ref: 61782907204
-Ref: 61792907290
-Ref: 61802907376
-Ref: 61812907462
-Ref: 61822907548
-Ref: 61832907634
-Ref: 61842907720
-Ref: 61852907806
-Ref: 61862907892
-Ref: 61872907978
-Ref: 61882908058
-Ref: 61892908144
-Ref: 61902908292
-Ref: 61912908378
-Ref: 61922908447
-Ref: 61932908533
-Ref: 61942908619
-Ref: 61952908705
-Ref: 61962908791
-Ref: 61972908877
-Ref: 61982908963
-Ref: 61992909033
-Ref: 62002909119
-Ref: 62012909205
-Ref: 62022909291
-Ref: 62032909377
-Ref: 62042909463
-Ref: 62052909549
-Ref: 62062909635
-Ref: 62072909721
-Ref: 62082909869
-Ref: 62092909955
-Ref: 62102910041
-Ref: 62112910127
-Ref: 62122910213
-Ref: 62132910299
-Ref: 62142910385
-Ref: 62152910471
-Ref: 62162910557
-Ref: 62172910643
-Ref: 62182910729
-Ref: 62192910815
-Ref: 62202910901
-Ref: 62212910987
-Ref: 62222911073
-Ref: 62232911159
-Ref: 62242911307
-Ref: 62252911393
-Ref: 62262911479
-Ref: 62272911565
-Ref: 62282911651
-Ref: 62292911737
-Ref: 62302911823
-Ref: 62312911909
-Ref: 62322911995
-Ref: 62332912081
-Ref: 62342912167
-Ref: 62352912253
-Ref: 62362912339
-Ref: 62372912425
-Ref: 62382912511
-Ref: 62392912597
-Ref: 62402912745
-Ref: 62412912831
-Ref: 62422912917
-Ref: 62432913003
-Ref: 62442913089
-Ref: 62452913175
-Ref: 62462913261
-Ref: 62472913347
-Ref: 62482913433
-Ref: 62492913519
-Ref: 62502913605
-Ref: 62512913691
-Ref: 62522913777
-Ref: 62532913863
-Ref: 62542913949
-Ref: 62552914035
-Ref: 62562914183
-Ref: 62572914269
-Ref: 62582914355
-Ref: 62592914441
-Ref: 62602914527
-Ref: 62612914613
-Ref: 62622914699
-Ref: 62632914785
-Ref: 62642914871
-Ref: 62652914957
-Ref: 62662915043
-Ref: 62672915129
-Ref: 62682915215
-Ref: 62692915301
-Ref: 62702915387
-Ref: 62712915473
-Node: A.3.42916127
-Ref: 62722916485
-Ref: 62732916542
-Ref: 62742916620
-Ref: 62752916698
-Ref: 62762916776
-Ref: 62772916854
-Ref: 62782916948
-Ref: 62792917044
-Ref: 62802917124
-Ref: 62812917201
-Ref: 62822917302
-Ref: 62832917397
-Ref: 62842917503
-Ref: 62852917608
-Ref: 62862917764
-Ref: 62872917915
-Ref: 62882918077
-Ref: 62892918233
-Ref: 62902918415
-Ref: 62912923332
-Node: A.3.52923458
-Ref: 62922924027
-Ref: 62932924106
-Ref: 62942924165
-Ref: 62952924238
-Ref: 62962924310
-Ref: 62972924381
-Ref: 62982924452
-Ref: 62992924524
-Ref: 63002924632
-Ref: 63012924716
-Ref: 63022924795
-Ref: 63032924869
-Ref: 63042924951
-Ref: 63052925022
-Ref: 63062925101
-Ref: 63072925189
-Ref: 63082925261
-Ref: 63092925335
-Ref: 63102925408
-Ref: 63112925487
-Ref: 63122925554
-Ref: 63132933853
-Node: A.3.62933910
-Ref: 63142934138
-Ref: 63152934429
-Node: A.42934491
-Ref: 63162935274
-Node: A.4.12935969
-Ref: 63172936278
-Ref: 63182936378
-Ref: 63192936431
-Ref: 63202936484
-Ref: 63212936550
-Ref: 63222936564
-Ref: 63232936579
-Ref: 63242936592
-Ref: 63252936639
-Ref: 63262936689
-Ref: 63272936738
-Ref: 63282936784
-Ref: 63292936832
-Ref: 63302937012
-Node: A.4.22937421
-Ref: 63312937850
-Ref: 63322938010
-Ref: 63332938107
-Ref: 63342938158
-Ref: 63352938342
-Ref: 63362938428
-Ref: 63372938510
-Ref: 63382938592
-Ref: 63392939147
-Ref: 63402939278
-Ref: 63412939638
-Ref: 63422939689
-Ref: 63432939774
-Ref: 63442939855
-Ref: 63452940032
-Ref: 63462940147
-Ref: 63472940275
-Ref: 63482940335
-Ref: 63492940439
-Ref: 63502940533
-Ref: 63512940627
-Ref: 63522944642
-Ref: 63532944759
-Ref: 63542946912
-Ref: 63552947666
-Node: A.4.32948274
-Ref: 63562950053
-Ref: 63572950214
-Ref: 63582950548
-Ref: 63592950885
-Ref: 63602951181
-Ref: 63612951480
-Ref: 63622951767
-Ref: 63632952065
-Ref: 63642952346
-Ref: 63652952555
-Ref: 63662952708
-Ref: 63672952948
-Ref: 63682953142
-Ref: 63692953307
-Ref: 63702953635
-Ref: 63712953953
-Ref: 63722954098
-Ref: 63732954222
-Ref: 63742954376
-Ref: 63752954555
-Ref: 63762954805
-Ref: 63772955239
-Ref: 63782955413
-Ref: 63792955628
-Ref: 63802955811
-Ref: 63812956038
-Ref: 63822956210
-Ref: 63832956515
-Ref: 63842956634
-Ref: 63852956847
-Ref: 63862957031
-Ref: 63872957319
-Ref: 63882957492
-Ref: 63892957704
-Ref: 63902957877
-Ref: 63912978246
-Ref: 63922978498
-Ref: 63932979538
-Node: A.4.42980152
-Ref: 63942981721
-Ref: 63952981900
-Ref: 63962981940
-Ref: 63972981998
-Ref: 63982982039
-Ref: 63992982108
-Ref: 64002982178
-Ref: 64012982325
-Ref: 64022982497
-Ref: 64032982609
-Ref: 64042982791
-Ref: 64052982960
-Ref: 64062983163
-Ref: 64072983366
-Ref: 64082983572
-Ref: 64092983779
-Ref: 64102983971
-Ref: 64112984155
-Ref: 64122984890
-Ref: 64132985035
-Ref: 64142985230
-Ref: 64152985448
-Ref: 64162985677
-Ref: 64172987424
-Ref: 64182987788
-Ref: 64192988111
-Ref: 64202988434
-Ref: 64212988744
-Ref: 64222989068
-Ref: 64232989372
-Ref: 64242989601
-Ref: 64252989771
-Ref: 64262990033
-Ref: 64272990247
-Ref: 64282990429
-Ref: 64292990783
-Ref: 64302991127
-Ref: 64312991297
-Ref: 64322991435
-Ref: 64332991614
-Ref: 64342991810
-Ref: 64352992161
-Ref: 64362992483
-Ref: 64372992748
-Ref: 64382992983
-Ref: 64392993264
-Ref: 64402993515
-Ref: 64412993715
-Ref: 64422993926
-Ref: 64432994066
-Ref: 64442994178
-Ref: 64452994390
-Ref: 64462994571
-Ref: 64472994832
-Ref: 64482995063
-Ref: 64492995324
-Ref: 64502996001
-Ref: 64512996209
-Ref: 64522996414
-Ref: 64533004192
-Ref: 64543004719
-Ref: 64553005884
-Node: A.4.53006362
-Ref: 64563007635
-Ref: 64573007760
-Ref: 64583007863
-Ref: 64593007934
-Ref: 64603008004
-Ref: 64613008058
-Ref: 64623008173
-Ref: 64633008271
-Ref: 64643008370
-Ref: 64653008481
-Ref: 64663008605
-Ref: 64673008730
-Ref: 64683008845
-Ref: 64693009501
-Ref: 64703009639
-Ref: 64713009827
-Ref: 64723010035
-Ref: 64733010255
-Ref: 64743011918
-Ref: 64753012266
-Ref: 64763012573
-Ref: 64773012882
-Ref: 64783013179
-Ref: 64793013488
-Ref: 64803013768
-Ref: 64813013987
-Ref: 64823014150
-Ref: 64833014399
-Ref: 64843014603
-Ref: 64853014778
-Ref: 64863015116
-Ref: 64873015444
-Ref: 64883015609
-Ref: 64893015743
-Ref: 64903015917
-Ref: 64913016106
-Ref: 64923016376
-Ref: 64933016617
-Ref: 64943016811
-Ref: 64953016975
-Ref: 64963017181
-Ref: 64973017357
-Ref: 64983017549
-Ref: 64993017711
-Ref: 65003017850
-Ref: 65013017958
-Ref: 65023018162
-Ref: 65033018336
-Ref: 65043018529
-Ref: 65053018692
-Ref: 65063018885
-Ref: 65073019584
-Ref: 65083023695
-Ref: 65093024939
-Ref: 65103025244
-Node: A.4.63025671
-Ref: 65113026460
-Ref: 65123026542
-Ref: 65133026598
-Ref: 65143026654
-Ref: 65153026710
-Ref: 65163026766
-Ref: 65173026822
-Ref: 65183026878
-Ref: 65193026934
-Ref: 65203026990
-Ref: 65213027046
-Ref: 65223027102
-Ref: 65233027161
-Ref: 65243027279
-Ref: 65253027397
-Ref: 65263028368
-Node: A.4.73028691
-Ref: 65273029733
-Ref: 65283029734
-Ref: 65293029734
-Ref: 65303029734
-Ref: 65313029734
-Ref: 65323029734
-Ref: 65333029734
-Ref: 65343029734
-Ref: 65353029734
-Ref: 65363029734
-Ref: 65373029734
-Ref: 65383029734
-Ref: 65393029734
-Ref: 65403029734
-Ref: 65413029734
-Ref: 65423029734
-Ref: 65433029848
-Ref: 65443030035
-Ref: 65453030142
-Ref: 65463030198
-Ref: 65473030404
-Ref: 65483030511
-Ref: 65493030615
-Ref: 65503030719
-Ref: 65513031398
-Ref: 65523031539
-Ref: 65533031924
-Ref: 65543031985
-Ref: 65553032092
-Ref: 65563032190
-Ref: 65573032398
-Ref: 65583032523
-Ref: 65593032666
-Ref: 65603032731
-Ref: 65613032845
-Ref: 65623032953
-Ref: 65633033057
-Ref: 65643035346
-Ref: 65653036010
-Ref: 65663036251
-Ref: 65673036833
-Ref: 65683037970
-Node: A.4.83038831
-Ref: 65693040052
-Ref: 65703040053
-Ref: 65713040053
-Ref: 65723040053
-Ref: 65733040053
-Ref: 65743040053
-Ref: 65753040053
-Ref: 65763040053
-Ref: 65773040053
-Ref: 65783040053
-Ref: 65793040053
-Ref: 65803040053
-Ref: 65813040053
-Ref: 65823040053
-Ref: 65833040053
-Ref: 65843040053
-Ref: 65853040255
-Ref: 65863040386
-Ref: 65873040505
-Ref: 65883040568
-Ref: 65893040798
-Ref: 65903040920
-Ref: 65913041036
-Ref: 65923041150
-Ref: 65933041910
-Ref: 65943042066
-Ref: 65953042486
-Ref: 65963042559
-Ref: 65973042680
-Ref: 65983042793
-Ref: 65993043005
-Ref: 66003043142
-Ref: 66013043305
-Ref: 66023043377
-Ref: 66033043506
-Ref: 66043043629
-Ref: 66053043747
-Ref: 66063044026
-Ref: 66073046267
-Ref: 66083046456
-Ref: 66093047219
-Ref: 66103047500
-Ref: 66113047941
-Node: A.4.93048892
-Ref: 66123049285
-Ref: 66133050062
-Ref: 66143050653
-Ref: 66153051078
-Ref: 66163051781
-Ref: 66173052215
-Ref: 66183052694
-Ref: 66193053655
-Ref: 66203053873
-Node: A.4.103054079
-Ref: 66213054491
-Ref: 66223055970
-Ref: 66233056421
-Ref: 66243056917
-Ref: 66253057371
-Ref: 66263057836
-Ref: 66273058286
-Ref: 66283058779
-Ref: 66293059132
-Node: A.4.113059536
-Ref: 66303060134
-Ref: 66313060288
-Ref: 66323060357
-Ref: 66333060400
-Ref: 66343060445
-Ref: 66353060493
-Ref: 66363060534
-Ref: 66373060718
-Ref: 66383060855
-Ref: 66393060992
-Ref: 66403061114
-Ref: 66413061320
-Ref: 66423061483
-Ref: 66433061740
-Ref: 66443061957
-Ref: 66453062117
-Ref: 66463062323
-Ref: 66473062537
-Ref: 66483062711
-Ref: 66493062903
-Ref: 66503063033
-Ref: 66513063180
-Ref: 66523063310
-Ref: 66533063377
-Ref: 66543063511
-Ref: 66553063700
-Ref: 66563063897
-Ref: 66573064032
-Ref: 66583064184
-Ref: 66593064319
-Ref: 66603064391
-Ref: 66613064535
-Ref: 66623064739
-Ref: 66633064941
-Ref: 66643065081
-Ref: 66653065238
-Ref: 66663065378
-Ref: 66673065455
-Ref: 66683065967
-Ref: 66693065967
-Ref: 66703065967
-Ref: 66713065967
-Ref: 66723077675
-Node: A.53078124
-Ref: 66733078842
-Ref: 66743078882
-Ref: 66753078918
-Ref: 66763079051
-Ref: 66773079890
-Ref: 66783080050
-Node: A.5.13080283
-Ref: 66793081027
-Ref: 66803081162
-Ref: 66813081243
-Ref: 66823081324
-Ref: 66833081405
-Ref: 66843081570
-Ref: 66853081651
-Ref: 66863081732
-Ref: 66873081813
-Ref: 66883081894
-Ref: 66893081975
-Ref: 66903082056
-Ref: 66913082137
-Ref: 66923082221
-Ref: 66933082302
-Ref: 66943082383
-Ref: 66953082464
-Ref: 66963082545
-Ref: 66973082747
-Ref: 66983082949
-Ref: 66993083151
-Ref: 67003083356
-Ref: 67013083437
-Ref: 67023083518
-Ref: 67033083599
-Ref: 67043083680
-Ref: 67053083761
-Ref: 67063083842
-Ref: 67073083923
-Ref: 67083084096
-Ref: 67093088557
-Ref: 67103088557
-Ref: 67113088557
-Ref: 67123089353
-Ref: 67133089603
-Ref: 67143091774
-Node: A.5.23096558
-Ref: 67153096985
-Ref: 67163098278
-Ref: 67173098326
-Ref: 67183098375
-Ref: 67193098441
-Ref: 67203098517
-Ref: 67213098618
-Ref: 67223098704
-Ref: 67233098744
-Ref: 67243098847
-Ref: 67253098944
-Ref: 67263099033
-Ref: 67273099094
-Ref: 67283099309
-Ref: 67293099421
-Ref: 67303099571
-Ref: 67313099622
-Ref: 67323099692
-Ref: 67333099793
-Ref: 67343099879
-Ref: 67353099919
-Ref: 67363100022
-Ref: 67373100119
-Ref: 67383100208
-Ref: 67393100269
-Ref: 67403101817
-Ref: 67413102128
-Ref: 67423104685
-Ref: 67433104921
-Ref: 67443106469
-Ref: 67453106469
-Ref: 67463106469
-Ref: 67473106849
-Ref: 67483106849
-Ref: 67493116021
-Node: A.5.33117542
-Ref: 67503117748
-Ref: 67513117876
-Ref: 67523117891
-Ref: 67533118049
-Ref: 67543118581
-Ref: 67553118596
-Ref: 67563119238
-Ref: 67573119253
-Ref: 67583119638
-Ref: 67593119653
-Ref: 67603120315
-Ref: 67613120330
-Ref: 67623120846
-Ref: 67633120944
-Ref: 67643121027
-Ref: 67653121028
-Ref: 67663121554
-Ref: 67673121569
-Ref: 67683123021
-Ref: 67693123036
-Ref: 67703123387
-Ref: 67713123402
-Ref: 67723123846
-Ref: 67733124436
-Ref: 67743124553
-Ref: 67753124568
-Ref: 67763124830
-Ref: 67773124845
-Ref: 67783125998
-Ref: 67793126013
-Ref: 67803126254
-Ref: 67813126624
-Ref: 67823126625
-Ref: 67833127257
-Ref: 67843127272
-Ref: 67853127508
-Ref: 67863127808
-Ref: 67873127809
-Ref: 67883128423
-Ref: 67893128438
-Ref: 67903128879
-Ref: 67913128894
-Ref: 67923129389
-Ref: 67933129404
-Ref: 67943129841
-Ref: 67953129856
-Ref: 67963130323
-Ref: 67973130338
-Ref: 67983131010
-Ref: 67993131436
-Ref: 68003131451
-Ref: 68013131833
-Ref: 68023131848
-Ref: 68033132019
-Ref: 68043132336
-Ref: 68053132337
-Ref: 68063132872
-Ref: 68073132887
-Ref: 68083133062
-Ref: 68093133273
-Ref: 68103133274
-Ref: 68113133812
-Ref: 68123133827
-Ref: 68133134005
-Ref: 68143134214
-Ref: 68153134215
-Ref: 68163135115
-Ref: 68173135130
-Ref: 68183135780
-Ref: 68193135795
-Ref: 68203135795
-Ref: 68213136521
-Ref: 68223136536
-Ref: 68233136700
-Ref: 68243136951
-Ref: 68253136952
-Ref: 68263139280
-Ref: 68273139399
-Ref: 68283139414
-Ref: 68293140005
-Ref: 68303140020
-Ref: 68313140439
-Ref: 68323140454
-Ref: 68333140956
-Ref: 68343140971
-Ref: 68353141778
-Ref: 68363141793
-Ref: 68373142227
-Ref: 68383142242
-Ref: 68393142678
-Ref: 68403142693
-Ref: 68413143684
-Ref: 68423145330
-Ref: 68433145901
-Node: A.5.43145952
-Ref: 68443146138
-Ref: 68453146263
-Ref: 68463146278
-Ref: 68473146453
-Ref: 68483146468
-Ref: 68493146780
-Ref: 68503146795
-Ref: 68513147185
-Ref: 68523147622
-Node: A.63147796
-Ref: 68533147938
-Ref: 68543147938
-Ref: 68553148688
-Ref: 68563149014
-Node: A.73149708
-Ref: 68573149902
-Ref: 68583149902
-Ref: 68593149902
-Ref: 68603150502
-Ref: 68613152254
-Ref: 68623152255
-Ref: 68633152255
-Ref: 68643152318
-Ref: 68653153665
-Ref: 68663153666
-Node: A.83154948
-Ref: 68673155164
-Ref: 68683155165
-Ref: 68693155165
-Ref: 68703155594
-Ref: 68713157484
-Ref: 68723157484
-Ref: 68733157484
-Ref: 68743158040
-Node: A.8.13158718
-Ref: 68753159101
-Ref: 68763159118
-Ref: 68773159164
-Ref: 68783159262
-Ref: 68793159472
-Ref: 68803159664
-Ref: 68813159715
-Ref: 68823159766
-Ref: 68833159838
-Ref: 68843159891
-Ref: 68853159955
-Ref: 68863160016
-Ref: 68873160081
-Ref: 68883160177
-Ref: 68893160271
-Ref: 68903160343
-Ref: 68913160417
-Ref: 68923160504
-Ref: 68933160573
-Ref: 68943160640
-Ref: 68953160707
-Ref: 68963160773
-Ref: 68973160842
-Ref: 68983160908
-Ref: 68993161129
-Ref: 69003161248
-Ref: 69013161800
-Ref: 69023162428
-Node: A.8.23162856
-Node: A.8.33172864
-Node: A.8.43176057
-Ref: 69033176434
-Ref: 69043176451
-Ref: 69053176497
-Ref: 69063176556
-Ref: 69073176620
-Ref: 69083176718
-Ref: 69093176930
-Ref: 69103177122
-Ref: 69113177173
-Ref: 69123177224
-Ref: 69133177296
-Ref: 69143177349
-Ref: 69153177413
-Ref: 69163177474
-Ref: 69173177539
-Ref: 69183177635
-Ref: 69193177729
-Ref: 69203177871
-Ref: 69213177946
-Ref: 69223178088
-Ref: 69233178162
-Ref: 69243178239
-Ref: 69253178306
-Ref: 69263178368
-Ref: 69273178455
-Ref: 69283178524
-Ref: 69293178591
-Ref: 69303178658
-Ref: 69313178724
-Ref: 69323178793
-Ref: 69333178859
-Ref: 69343179336
-Ref: 69353179627
-Ref: 69363180240
-Node: A.8.53180660
-Node: A.93184040
-Ref: 69373185450
-Ref: 69383185503
-Ref: 69393185618
-Ref: 69403185762
-Ref: 69413185841
-Ref: 69423185935
-Ref: 69433187364
-Node: A.103187395
-Ref: 69443189671
-Ref: 69453189671
-Ref: 69463190666
-Ref: 69473190990
-Ref: 69483190990
-Ref: 69493190990
-Ref: 69503192284
-Ref: 69513192289
-Ref: 69523192289
-Ref: 69533192289
-Ref: 69543192289
-Ref: 69553193102
-Ref: 69563193102
-Ref: 69573194039
-Node: A.10.13194641
-Ref: 69583194926
-Ref: 69593194943
-Ref: 69603194989
-Ref: 69613195052
-Ref: 69623195112
-Ref: 69633195167
-Ref: 69643195243
-Ref: 69653195317
-Ref: 69663195371
-Ref: 69673195460
-Ref: 69683195681
-Ref: 69693195878
-Ref: 69703195930
-Ref: 69713195982
-Ref: 69723196055
-Ref: 69733196111
-Ref: 69743196176
-Ref: 69753196238
-Ref: 69763196304
-Ref: 69773196428
-Ref: 69783196479
-Ref: 69793196530
-Ref: 69803196584
-Ref: 69813196635
-Ref: 69823196686
-Ref: 69833196741
-Ref: 69843196792
-Ref: 69853196843
-Ref: 69863196894
-Ref: 69873196957
-Ref: 69883197010
-Ref: 69893197063
-Ref: 69903197120
-Ref: 69913197173
-Ref: 69923197226
-Ref: 69933197358
-Ref: 69943197405
-Ref: 69953197488
-Ref: 69963197559
-Ref: 69973197615
-Ref: 69983197686
-Ref: 69993197742
-Ref: 70003197807
-Ref: 70013197855
-Ref: 70023197920
-Ref: 70033198014
-Ref: 70043198133
-Ref: 70053198202
-Ref: 70063198321
-Ref: 70073198390
-Ref: 70083198457
-Ref: 70093198507
-Ref: 70103198559
-Ref: 70113198591
-Ref: 70123198643
-Ref: 70133198676
-Ref: 70143198743
-Ref: 70153198793
-Ref: 70163198860
-Ref: 70173198910
-Ref: 70183198983
-Ref: 70193199041
-Ref: 70203199114
-Ref: 70213199171
-Ref: 70223199237
-Ref: 70233199286
-Ref: 70243199352
-Ref: 70253199401
-Ref: 70263199467
-Ref: 70273199555
-Ref: 70283199622
-Ref: 70293199671
-Ref: 70303199737
-Ref: 70313199786
-Ref: 70323199962
-Ref: 70333200083
-Ref: 70343200202
-Ref: 70353200266
-Ref: 70363200442
-Ref: 70373200598
-Ref: 70383200662
-Ref: 70393200708
-Ref: 70403200771
-Ref: 70413200817
-Ref: 70423200960
-Ref: 70433201063
-Ref: 70443201126
-Ref: 70453201172
-Ref: 70463201240
-Ref: 70473201401
-Ref: 70483201430
-Ref: 70493201477
-Ref: 70503201537
-Ref: 70513201676
-Ref: 70523201772
-Ref: 70533201986
-Ref: 70543202153
-Ref: 70553202285
-Ref: 70563202508
-Ref: 70573202537
-Ref: 70583202584
-Ref: 70593202644
-Ref: 70603202783
-Ref: 70613202879
-Ref: 70623203093
-Ref: 70633203260
-Ref: 70643203392
-Ref: 70653203681
-Ref: 70663203708
-Ref: 70673203746
-Ref: 70683203795
-Ref: 70693203847
-Ref: 70703203987
-Ref: 70713204083
-Ref: 70723204342
-Ref: 70733204559
-Ref: 70743204690
-Ref: 70753204959
-Ref: 70763204986
-Ref: 70773205031
-Ref: 70783205075
-Ref: 70793205127
-Ref: 70803205267
-Ref: 70813205363
-Ref: 70823205622
-Ref: 70833205839
-Ref: 70843205971
-Ref: 70853206250
-Ref: 70863206279
-Ref: 70873206324
-Ref: 70883206368
-Ref: 70893206420
-Ref: 70903206560
-Ref: 70913206656
-Ref: 70923206915
-Ref: 70933207132
-Ref: 70943207264
-Ref: 70953207601
-Ref: 70963207634
-Ref: 70973207675
-Ref: 70983207742
-Ref: 70993207832
-Ref: 71003207879
-Ref: 71013208097
-Ref: 71023208272
-Ref: 71033208405
-Ref: 71043208599
-Ref: 71053208668
-Ref: 71063208735
-Ref: 71073208802
-Ref: 71083208868
-Ref: 71093208937
-Ref: 71103209003
-Ref: 71113209070
-Ref: 71123209283
-Ref: 71133209362
-Ref: 71143209486
-Ref: 71153209824
-Node: A.10.23210768
-Node: A.10.33214137
-Ref: 71163218399
-Node: A.10.43220090
-Node: A.10.53222800
-Ref: 71173233031
-Node: A.10.63233361
-Ref: 71183235476
-Node: A.10.73239685
-Ref: 71193241507
-Ref: 71203242920
-Ref: 71213244851
-Ref: 71223245976
-Ref: 71233248356
-Ref: 71243248831
-Node: A.10.83249083
-Ref: 71253253632
-Ref: 71263254629
-Node: A.10.93255306
-Ref: 71273262013
-Node: A.10.103264195
-Node: A.10.113269853
-Ref: 71283270504
-Ref: 71293270528
-Ref: 71303270635
-Ref: 71313270709
-Ref: 71323270821
-Ref: 71333270899
-Ref: 71343271005
-Ref: 71353271080
-Ref: 71363271182
-Ref: 71373273013
-Node: A.10.123273060
-Ref: 71383273577
-Ref: 71393273601
-Ref: 71403273720
-Ref: 71413273806
-Ref: 71423273930
-Ref: 71433274020
-Ref: 71443274138
-Ref: 71453274225
-Ref: 71463274339
-Ref: 71473276346
-Node: A.113276395
-Ref: 71483277015
-Ref: 71493277299
-Ref: 71503277299
-Ref: 71513277630
-Ref: 71523277928
-Ref: 71533277929
-Ref: 71543278340
-Ref: 71553278341
-Ref: 71563279138
-Ref: 71573279139
-Ref: 71583279737
-Ref: 71593279915
-Node: A.123280722
-Node: A.12.13281431
-Ref: 71603281572
-Ref: 71613282584
-Ref: 71623282584
-Ref: 71633282839
-Ref: 71643282936
-Ref: 71653283032
-Ref: 71663283136
-Ref: 71673283203
-Ref: 71683283273
-Ref: 71693283393
-Ref: 71703283617
-Ref: 71713283810
-Ref: 71723283863
-Ref: 71733283916
-Ref: 71743283990
-Ref: 71753284046
-Ref: 71763284109
-Ref: 71773284169
-Ref: 71783284233
-Ref: 71793284301
-Ref: 71803284373
-Ref: 71813284609
-Ref: 71823284830
-Ref: 71833285091
-Ref: 71843285253
-Ref: 71853285453
-Ref: 71863285531
-Ref: 71873285599
-Ref: 71883285663
-Ref: 71893285794
-Ref: 71903285858
-Ref: 71913285928
-Ref: 71923285996
-Ref: 71933286064
-Ref: 71943286131
-Ref: 71953286201
-Ref: 71963286268
-Ref: 71973286495
-Ref: 71983291723
-Ref: 71993292563
-Ref: 72003293511
-Ref: 72013295021
-Ref: 72023295381
-Node: A.12.23295875
-Ref: 72033296274
-Ref: 72043296329
-Ref: 72053296409
-Node: A.12.33297033
-Ref: 72063297457
-Ref: 72073297517
-Ref: 72083297597
-Node: A.12.43297784
-Ref: 72093298282
-Ref: 72103298347
-Ref: 72113298429
-Ref: 72123298744
-Node: A.133298803
-Ref: 72133299193
-Ref: 72143299241
-Ref: 72153299275
-Ref: 72163299309
-Ref: 72173299343
-Ref: 72183299377
-Ref: 72193299411
-Ref: 72203299445
-Ref: 72213299479
-Ref: 72223304158
-Ref: 72233304490
-Ref: 72243304491
-Node: A.143304494
-Ref: 72253304656
-Node: A.153305722
-Ref: 72263306354
-Ref: 72273306416
-Ref: 72283306466
-Ref: 72293306532
-Ref: 72303306575
-Ref: 72313306637
-Ref: 72323306676
-Ref: 72333306728
-Ref: 72343307555
-Ref: 72353310000
-Node: A.163310035
-Ref: 72363311023
-Ref: 72373311093
-Ref: 72383311149
-Ref: 72393311211
-Ref: 72403311349
-Ref: 72413311414
-Ref: 72423311543
-Ref: 72433311604
-Ref: 72443311660
-Ref: 72453311725
-Ref: 72463311940
-Ref: 72473312007
-Ref: 72483312076
-Ref: 72493312154
-Ref: 72503312221
-Ref: 72513312288
-Ref: 72523312524
-Ref: 72533312665
-Ref: 72543312793
-Ref: 72553312867
-Ref: 72563312938
-Ref: 72573313003
-Ref: 72583313068
-Ref: 72593313133
-Ref: 72603313253
-Ref: 72613313313
-Ref: 72623313377
-Ref: 72633313433
-Ref: 72643313694
-Ref: 72653313759
-Ref: 72663313838
-Ref: 72673314306
-Ref: 72683314412
-Ref: 72693314516
-Ref: 72703314618
-Ref: 72713314720
-Ref: 72723314834
-Ref: 72733314907
-Ref: 72743314978
-Ref: 72753315048
-Ref: 72763315625
-Ref: 72773315626
-Ref: 72783315626
-Ref: 72793316333
-Ref: 72803316334
-Ref: 72813317131
-Ref: 72823317132
-Ref: 72833318052
-Ref: 72843318507
-Ref: 72853337683
-Ref: 72863345552
-Ref: 72873356304
-Ref: 72883356433
-Ref: 72893357302
-Node: A.16.13358199
-Ref: 72903358812
-Ref: 72913358835
-Ref: 72923358907
-Ref: 72933358987
-Ref: 72943359069
-Ref: 72953359152
-Ref: 72963359222
-Ref: 72973359297
-Ref: 72983359413
-Ref: 72993359547
-Ref: 73003359622
-Ref: 73013359693
-Ref: 73023368207
-Node: A.173368275
-Ref: 73033368462
-Ref: 73043369076
-Ref: 73053369151
-Ref: 73063369240
-Ref: 73073369323
-Ref: 73083369388
-Ref: 73093369454
-Ref: 73103369498
-Ref: 73113369553
-Ref: 73123373327
-Ref: 73133373732
-Ref: 73143376143
-Ref: 73153376288
-Node: A.183376698
-Ref: 73163377648
-Ref: 73173377648
-Ref: 73183378370
-Ref: 73193378371
-Ref: 73203378760
-Ref: 73213379329
-Ref: 73223386778
-Ref: 73233388221
-Ref: 73243390842
-Node: A.18.13393332
-Ref: 73253393731
-Ref: 73263393783
-Ref: 73273393842
-Ref: 73283393931
-Ref: 73293395108
-Ref: 73303395235
-Node: A.18.23395636
-Ref: 73313396206
-Ref: 73323396206
-Ref: 73333396213
-Ref: 73343396213
-Ref: 73353396736
-Ref: 73363397788
-Ref: 73373397886
-Ref: 73383398059
-Ref: 73393398162
-Ref: 73403398460
-Ref: 73413398546
-Ref: 73423398592
-Ref: 73433398672
-Ref: 73443398769
-Ref: 73453398951
-Ref: 73463399021
-Ref: 73473399482
-Ref: 73483399555
-Ref: 73493399691
-Ref: 73503399762
-Ref: 73513399886
-Ref: 73523399956
-Ref: 73533400014
-Ref: 73543400139
-Ref: 73553400215
-Ref: 73563400349
-Ref: 73573400422
-Ref: 73583400625
-Ref: 73593400824
-Ref: 73603401013
-Ref: 73613401162
-Ref: 73623401391
-Ref: 73633401832
-Ref: 73643401998
-Ref: 73653402206
-Ref: 73663402391
-Ref: 73673402595
-Ref: 73683402777
-Ref: 73693402880
-Ref: 73703402981
-Ref: 73713403084
-Ref: 73723403258
-Ref: 73733403424
-Ref: 73743403643
-Ref: 73753403885
-Ref: 73763404119
-Ref: 73773404406
-Ref: 73783404589
-Ref: 73793404817
-Ref: 73803404932
-Ref: 73813405116
-Ref: 73823405229
-Ref: 73833405410
-Ref: 73843405611
-Ref: 73853405863
-Ref: 73863406046
-Ref: 73873406221
-Ref: 73883406355
-Ref: 73893406487
-Ref: 73903406557
-Ref: 73913406670
-Ref: 73923406778
-Ref: 73933406853
-Ref: 73943406918
-Ref: 73953407008
-Ref: 73963407086
-Ref: 73973407150
-Ref: 73983407239
-Ref: 73993407303
-Ref: 74003407359
-Ref: 74013407427
-Ref: 74023407487
-Ref: 74033407704
-Ref: 74043407885
-Ref: 74053408125
-Ref: 74063408330
-Ref: 74073408517
-Ref: 74083408657
-Ref: 74093409240
-Ref: 74103409285
-Ref: 74113409359
-Ref: 74123409420
-Ref: 74133410136
-Ref: 74143411046
-Ref: 74153415110
-Ref: 74163416239
-Ref: 74173416982
-Ref: 74183416983
-Ref: 74193432666
-Ref: 74203465056
-Ref: 74213468530
-Ref: 74223469647
-Ref: 74233470827
-Ref: 74243470828
-Ref: 74253471449
-Ref: 74263473028
-Ref: 74273473028
-Ref: 74283474135
-Ref: 74293474258
-Ref: 74303481925
-Ref: 74313482072
-Ref: 74323482641
-Node: A.18.33484317
-Ref: 74333484767
-Ref: 74343484768
-Ref: 74353484802
-Ref: 74363485343
-Ref: 74373485793
-Ref: 74383485937
-Ref: 74393486231
-Ref: 74403486316
-Ref: 74413486357
-Ref: 74423486436
-Ref: 74433486532
-Ref: 74443486710
-Ref: 74453486778
-Ref: 74463486846
-Ref: 74473486902
-Ref: 74483486986
-Ref: 74493487183
-Ref: 74503487332
-Ref: 74513487771
-Ref: 74523487937
-Ref: 74533488139
-Ref: 74543488319
-Ref: 74553488418
-Ref: 74563488476
-Ref: 74573488575
-Ref: 74583488807
-Ref: 74593489092
-Ref: 74603489318
-Ref: 74613489500
-Ref: 74623489679
-Ref: 74633489852
-Ref: 74643489984
-Ref: 74653490114
-Ref: 74663490182
-Ref: 74673490289
-Ref: 74683490408
-Ref: 74693490567
-Ref: 74703490778
-Ref: 74713490938
-Ref: 74723491001
-Ref: 74733491089
-Ref: 74743491151
-Ref: 74753491238
-Ref: 74763491301
-Ref: 74773491369
-Ref: 74783491426
-Ref: 74793491486
-Ref: 74803491665
-Ref: 74813491868
-Ref: 74823492052
-Ref: 74833492190
-Ref: 74843492763
-Ref: 74853492808
-Ref: 74863492880
-Ref: 74873492939
-Ref: 74883493714
-Ref: 74893494434
-Ref: 74903496791
-Ref: 74913498103
-Ref: 74923498749
-Ref: 74933498750
-Ref: 74943504725
-Ref: 74953528030
-Ref: 74963530407
-Ref: 74973530751
-Ref: 74983531166
-Ref: 74993531728
-Ref: 75003531728
-Ref: 75013533414
-Ref: 75023533415
-Ref: 75033539484
-Ref: 75043539675
-Ref: 75053540131
-Ref: 75063540736
-Node: A.18.43542517
-Ref: 75073543048
-Ref: 75083543048
-Ref: 75093543899
-Ref: 75103544598
-Ref: 75113544651
-Ref: 75123545100
-Ref: 75133545134
-Ref: 75143545135
-Ref: 75153545135
-Ref: 75163546133
-Ref: 75173547339
-Ref: 75183547987
-Ref: 75193547988
-Ref: 75203556429
-Ref: 75213569664
-Ref: 75223570076
-Ref: 75233570619
-Ref: 75243570619
-Ref: 75253571415
-Ref: 75263571569
-Ref: 75273575663
-Node: A.18.53577015
-Ref: 75283577813
-Ref: 75293577941
-Ref: 75303578233
-Ref: 75313578318
-Ref: 75323578357
-Ref: 75333578436
-Ref: 75343578532
-Ref: 75353578706
-Ref: 75363578775
-Ref: 75373578908
-Ref: 75383578975
-Ref: 75393579042
-Ref: 75403579097
-Ref: 75413579161
-Ref: 75423579234
-Ref: 75433579430
-Ref: 75443579651
-Ref: 75453580144
-Ref: 75463580310
-Ref: 75473580511
-Ref: 75483580689
-Ref: 75493580892
-Ref: 75503581073
-Ref: 75513581170
-Ref: 75523581254
-Ref: 75533581351
-Ref: 75543581629
-Ref: 75553581848
-Ref: 75563582019
-Ref: 75573582193
-Ref: 75583582367
-Ref: 75593582481
-Ref: 75603582593
-Ref: 75613582702
-Ref: 75623582775
-Ref: 75633582840
-Ref: 75643582897
-Ref: 75653583014
-Ref: 75663583143
-Ref: 75673583321
-Ref: 75683583410
-Ref: 75693583545
-Ref: 75703583681
-Ref: 75713584344
-Ref: 75723585183
-Ref: 75733585742
-Ref: 75743586834
-Ref: 75753587492
-Ref: 75763588423
-Ref: 75773588424
-Ref: 75783588424
-Ref: 75793588610
-Ref: 75803598228
-Ref: 75813598386
-Ref: 75823598966
-Node: A.18.63599280
-Ref: 75833599992
-Ref: 75843600101
-Ref: 75853600201
-Ref: 75863600493
-Ref: 75873600578
-Ref: 75883600617
-Ref: 75893600696
-Ref: 75903600792
-Ref: 75913600966
-Ref: 75923601033
-Ref: 75933601100
-Ref: 75943601155
-Ref: 75953601219
-Ref: 75963601292
-Ref: 75973601488
-Ref: 75983601709
-Ref: 75993602202
-Ref: 76003602368
-Ref: 76013602569
-Ref: 76023602747
-Ref: 76033602950
-Ref: 76043603131
-Ref: 76053603228
-Ref: 76063603284
-Ref: 76073603381
-Ref: 76083603659
-Ref: 76093603878
-Ref: 76103604049
-Ref: 76113604223
-Ref: 76123604397
-Ref: 76133604511
-Ref: 76143604623
-Ref: 76153604733
-Ref: 76163604796
-Ref: 76173604857
-Ref: 76183604919
-Ref: 76193604995
-Ref: 76203605063
-Ref: 76213605124
-Ref: 76223605199
-Ref: 76233605266
-Ref: 76243605330
-Ref: 76253605386
-Ref: 76263605454
-Ref: 76273605514
-Ref: 76283605620
-Ref: 76293605738
-Ref: 76303605846
-Ref: 76313605958
-Ref: 76323606577
-Ref: 76333606714
-Ref: 76343607298
-Ref: 76353608014
-Ref: 76363608794
-Ref: 76373609874
-Ref: 76383609875
-Ref: 76393609875
-Ref: 76403609875
-Ref: 76413619297
-Ref: 76423619456
-Ref: 76433620039
-Node: A.18.73620592
-Ref: 76443621104
-Ref: 76453621104
-Ref: 76463621957
-Ref: 76473622660
-Ref: 76483623001
-Ref: 76493623035
-Ref: 76503623036
-Ref: 76513623036
-Ref: 76523624064
-Ref: 76533625483
-Ref: 76543626363
-Ref: 76553626364
-Ref: 76563634780
-Ref: 76573648378
-Ref: 76583648614
-Ref: 76593651412
-Ref: 76603654073
-Ref: 76613654486
-Ref: 76623655029
-Ref: 76633655029
-Ref: 76643656014
-Ref: 76653656168
-Ref: 76663660269
-Node: A.18.83661628
-Ref: 76673662408
-Ref: 76683662536
-Ref: 76693662780
-Ref: 76703662865
-Ref: 76713662904
-Ref: 76723662983
-Ref: 76733663079
-Ref: 76743663253
-Ref: 76753663327
-Ref: 76763663395
-Ref: 76773663465
-Ref: 76783663598
-Ref: 76793663665
-Ref: 76803663732
-Ref: 76813663787
-Ref: 76823663860
-Ref: 76833664056
-Ref: 76843664425
-Ref: 76853664627
-Ref: 76863664724
-Ref: 76873664808
-Ref: 76883664905
-Ref: 76893665128
-Ref: 76903665244
-Ref: 76913665362
-Ref: 76923665480
-Ref: 76933665598
-Ref: 76943665714
-Ref: 76953665824
-Ref: 76963665922
-Ref: 76973666058
-Ref: 76983666170
-Ref: 76993666321
-Ref: 77003666429
-Ref: 77013666574
-Ref: 77023666702
-Ref: 77033666878
-Ref: 77043666945
-Ref: 77053667051
-Ref: 77063667113
-Ref: 77073667177
-Ref: 77083667233
-Ref: 77093667343
-Ref: 77103667525
-Ref: 77113667617
-Ref: 77123667763
-Ref: 77133667910
-Ref: 77143668508
-Ref: 77153668550
-Ref: 77163668617
-Ref: 77173668755
-Ref: 77183668938
-Ref: 77193669058
-Ref: 77203669175
-Ref: 77213669301
-Ref: 77223669437
-Ref: 77233669711
-Ref: 77243669900
-Ref: 77253670117
-Ref: 77263670329
-Ref: 77273670674
-Ref: 77283670974
-Ref: 77293671543
-Ref: 77303672073
-Ref: 77313672282
-Ref: 77323672537
-Ref: 77333672904
-Ref: 77343672905
-Ref: 77353672905
-Ref: 77363673106
-Ref: 77373678042
-Ref: 77383678447
-Ref: 77393679695
-Ref: 77403679853
-Ref: 77413680433
-Node: A.18.93680916
-Ref: 77423681599
-Ref: 77433681708
-Ref: 77443681816
-Ref: 77453682060
-Ref: 77463682145
-Ref: 77473682184
-Ref: 77483682263
-Ref: 77493682359
-Ref: 77503682533
-Ref: 77513682608
-Ref: 77523682676
-Ref: 77533682743
-Ref: 77543682810
-Ref: 77553682865
-Ref: 77563682938
-Ref: 77573683134
-Ref: 77583683503
-Ref: 77593683705
-Ref: 77603683802
-Ref: 77613683858
-Ref: 77623683955
-Ref: 77633684178
-Ref: 77643684294
-Ref: 77653684412
-Ref: 77663684530
-Ref: 77673684648
-Ref: 77683684764
-Ref: 77693684874
-Ref: 77703684937
-Ref: 77713684999
-Ref: 77723685097
-Ref: 77733685233
-Ref: 77743685345
-Ref: 77753685496
-Ref: 77763685604
-Ref: 77773685749
-Ref: 77783685877
-Ref: 77793686054
-Ref: 77803686121
-Ref: 77813686227
-Ref: 77823686289
-Ref: 77833686365
-Ref: 77843686426
-Ref: 77853686501
-Ref: 77863686565
-Ref: 77873686621
-Ref: 77883686689
-Ref: 77893686749
-Ref: 77903686870
-Ref: 77913686993
-Ref: 77923687120
-Ref: 77933687803
-Ref: 77943687940
-Ref: 77953688617
-Ref: 77963688660
-Ref: 77973688759
-Ref: 77983688827
-Ref: 77993688969
-Ref: 78003689155
-Ref: 78013689277
-Ref: 78023689396
-Ref: 78033689525
-Ref: 78043689656
-Ref: 78053689791
-Ref: 78063689915
-Ref: 78073690193
-Ref: 78083690382
-Ref: 78093690599
-Ref: 78103690811
-Ref: 78113691289
-Ref: 78123691889
-Ref: 78133692098
-Ref: 78143692336
-Ref: 78153692712
-Ref: 78163692713
-Ref: 78173692713
-Ref: 78183692713
-Ref: 78193700429
-Ref: 78203702123
-Ref: 78213702283
-Ref: 78223702867
-Node: A.18.103703592
-Ref: 78233704585
-Ref: 78243704585
-Ref: 78253704598
-Ref: 78263704783
-Ref: 78273705278
-Ref: 78283705279
-Ref: 78293705279
-Ref: 78303705653
-Ref: 78313705797
-Ref: 78323705917
-Ref: 78333706255
-Ref: 78343706889
-Ref: 78353707048
-Ref: 78363707342
-Ref: 78373707428
-Ref: 78383707470
-Ref: 78393707523
-Ref: 78403707618
-Ref: 78413707731
-Ref: 78423707929
-Ref: 78433707996
-Ref: 78443708068
-Ref: 78453708149
-Ref: 78463708217
-Ref: 78473708284
-Ref: 78483708351
-Ref: 78493708414
-Ref: 78503708470
-Ref: 78513708543
-Ref: 78523708740
-Ref: 78533708889
-Ref: 78543709132
-Ref: 78553709324
-Ref: 78563709488
-Ref: 78573709688
-Ref: 78583709841
-Ref: 78593709913
-Ref: 78603709971
-Ref: 78613710070
-Ref: 78623710191
-Ref: 78633710318
-Ref: 78643710424
-Ref: 78653710596
-Ref: 78663710790
-Ref: 78673710930
-Ref: 78683711051
-Ref: 78693711189
-Ref: 78703711361
-Ref: 78713711506
-Ref: 78723711635
-Ref: 78733711707
-Ref: 78743711787
-Ref: 78753712102
-Ref: 78763712476
-Ref: 78773712785
-Ref: 78783713045
-Ref: 78793713301
-Ref: 78803713430
-Ref: 78813713667
-Ref: 78823713970
-Ref: 78833714215
-Ref: 78843714558
-Ref: 78853714834
-Ref: 78863714899
-Ref: 78873714967
-Ref: 78883715049
-Ref: 78893715116
-Ref: 78903715197
-Ref: 78913715268
-Ref: 78923715344
-Ref: 78933715409
-Ref: 78943715528
-Ref: 78953715723
-Ref: 78963715900
-Ref: 78973716696
-Ref: 78983716803
-Ref: 78993718846
-Ref: 79003720131
-Ref: 79013721175
-Ref: 79023721176
-Ref: 79033731853
-Ref: 79043772966
-Ref: 79053773379
-Ref: 79063773932
-Ref: 79073773932
-Ref: 79083774955
-Ref: 79093780399
-Node: A.18.113781044
-Ref: 79103781741
-Ref: 79113783200
-Ref: 79123783363
-Node: A.18.123784154
-Ref: 79133784934
-Ref: 79143786436
-Ref: 79153786611
-Node: A.18.133786948
-Ref: 79163787636
-Ref: 79173789440
-Ref: 79183789607
-Node: A.18.143789944
-Ref: 79193790637
-Ref: 79203792442
-Ref: 79213792610
-Node: A.18.153792947
-Ref: 79223793620
-Ref: 79233794465
-Ref: 79243794632
-Node: A.18.163794969
-Ref: 79253795647
-Ref: 79263796494
-Ref: 79273796662
-Node: A.18.173796999
-Ref: 79283797660
-Ref: 79293799238
-Ref: 79303799408
-Node: A.18.183799745
-Ref: 79313800453
-Ref: 79323800856
-Ref: 79333800973
-Ref: 79343801066
-Ref: 79353801185
-Ref: 79363801259
-Ref: 79373801329
-Ref: 79383801387
-Ref: 79393801461
-Ref: 79403801598
-Ref: 79413801793
-Ref: 79423801967
-Ref: 79433802153
-Ref: 79443802314
-Ref: 79453802453
-Ref: 79463802579
-Ref: 79473802680
-Ref: 79483802742
-Ref: 79493804095
-Ref: 79503804764
-Ref: 79513805565
-Ref: 79523805566
-Ref: 79533810350
-Ref: 79543814136
-Ref: 79553814582
-Ref: 79563815304
-Ref: 79573818561
-Ref: 79583818726
-Node: A.18.193819319
-Ref: 79593821323
-Ref: 79603822085
-Ref: 79613824568
-Node: A.18.203824636
-Ref: 79623826540
-Ref: 79633827394
-Ref: 79643828150
-Ref: 79653830511
-Node: A.18.213830591
-Ref: 79663832587
-Ref: 79673832909
-Ref: 79683833800
-Ref: 79693834553
-Ref: 79703837077
-Node: A.18.223837149
-Ref: 79713839012
-Ref: 79723839555
-Ref: 79733840308
-Ref: 79743842837
-Node: A.18.233842910
-Ref: 79753844889
-Ref: 79763845211
-Ref: 79773846098
-Ref: 79783846851
-Ref: 79793849245
-Node: A.18.243849317
-Ref: 79803851178
-Ref: 79813851717
-Ref: 79823852470
-Ref: 79833854869
-Node: A.18.253854942
-Ref: 79843857926
-Ref: 79853858682
-Ref: 79863860998
-Node: A.18.263861072
-Ref: 79873861942
-Ref: 79883862861
-Ref: 79893864167
-Ref: 79903865188
-Ref: 79913865557
-Ref: 79923866976
-Ref: 79933869211
-Ref: 79943869456
-Node: A.18.273869809
-Ref: 79953870555
-Ref: 79963870626
-Ref: 79973870682
-Ref: 79983870852
-Ref: 79993871021
-Ref: 80003871101
-Ref: 80013871529
-Ref: 80023873930
-Node: A.18.283874012
-Ref: 80033874810
-Ref: 80043875014
-Ref: 80053875217
-Ref: 80063875311
-Ref: 80073875413
-Ref: 80083875486
-Ref: 80093876772
-Node: A.18.293876854
-Ref: 80103877684
-Ref: 80113877886
-Ref: 80123878147
-Ref: 80133878241
-Ref: 80143878343
-Ref: 80153878416
-Ref: 80163879409
-Node: A.18.303879489
-Ref: 80173880519
-Ref: 80183880719
-Ref: 80193880922
-Ref: 80203881016
-Ref: 80213881173
-Ref: 80223881400
-Ref: 80233881473
-Ref: 80243883970
-Node: A.18.313884048
-Ref: 80253885110
-Ref: 80263885308
-Ref: 80273885567
-Ref: 80283885661
-Ref: 80293885818
-Ref: 80303886045
-Ref: 80313886118
-Ref: 80323887157
-Node: A.18.323887233
-Node: A.193892419
-Ref: 80333892595
-Ref: 80343892917
-Ref: 80353893037
-Ref: 80363893187
-Ref: 80373893952
-Ref: 80383894012
-Ref: 80393894083
-Ref: 80403894131
-Ref: 80413894259
-Ref: 80423894259
-Ref: 80433896486
-Ref: 80443896616
-Node: Annex B3897389
-Ref: 80453897547
-Ref: 80463897547
-Ref: 80473897547
-Ref: 80483899171
-Node: B.13899806
-Ref: 80493900079
-Ref: 80503900079
-Ref: 80513900134
-Ref: 80523900135
-Ref: 80533900402
-Ref: 80543900403
-Ref: 80553900973
-Ref: 80563900973
-Ref: 80573900973
-Ref: 80583900973
-Ref: 80593900973
-Ref: 80603900974
-Ref: 80613900974
-Ref: 80623900974
-Ref: 80633900974
-Ref: 80643901467
-Ref: 80653901467
-Ref: 80663902379
-Ref: 80673902380
-Ref: 80683902402
-Ref: 80693903249
-Ref: 80703903283
-Ref: 80713903405
-Ref: 80723903851
-Ref: 80733904543
-Ref: 80743904973
-Ref: 80753907293
-Ref: 80763908070
-Ref: 80773908071
-Ref: 80783910219
-Ref: 80793910415
-Ref: 80803911915
-Ref: 80813911916
-Ref: 80823912843
-Ref: 80833913714
-Ref: 80843913715
-Ref: 80853913715
-Ref: 80863913715
-Ref: 80873919360
-Ref: 80883920205
-Ref: 80893921053
-Ref: 80903921299
-Node: B.23921540
-Ref: 80913922231
-Ref: 80923922934
-Ref: 80933922934
-Ref: 80943922934
-Ref: 80953922934
-Ref: 80963922934
-Ref: 80973923434
-Ref: 80983923434
-Ref: 80993923836
-Ref: 81003923836
-Ref: 81013925483
-Ref: 81023925649
-Ref: 81033925649
-Node: B.33928344
-Ref: 81043928612
-Ref: 81053928613
-Ref: 81063929410
-Ref: 81073929497
-Ref: 81083929569
-Ref: 81093929644
-Ref: 81103929718
-Ref: 81113929840
-Ref: 81123929892
-Ref: 81133929944
-Ref: 81143929999
-Ref: 81153930103
-Ref: 81163930162
-Ref: 81173930221
-Ref: 81183930284
-Ref: 81193930385
-Ref: 81203930440
-Ref: 81213930500
-Ref: 81223930585
-Ref: 81233930648
-Ref: 81243930711
-Ref: 81253930813
-Ref: 81263930926
-Ref: 81273930994
-Ref: 81283931057
-Ref: 81293931168
-Ref: 81303931317
-Ref: 81313931395
-Ref: 81323931536
-Ref: 81333931674
-Ref: 81343931888
-Ref: 81353932196
-Ref: 81363932312
-Ref: 81373932388
-Ref: 81383932455
-Ref: 81393932556
-Ref: 81403932720
-Ref: 81413932799
-Ref: 81423932946
-Ref: 81433933090
-Ref: 81443933310
-Ref: 81453933677
-Ref: 81463933746
-Ref: 81473933829
-Ref: 81483933895
-Ref: 81493933992
-Ref: 81503934164
-Ref: 81513934240
-Ref: 81523934388
-Ref: 81533934537
-Ref: 81543934763
-Ref: 81553935014
-Ref: 81563935084
-Ref: 81573935168
-Ref: 81583935239
-Ref: 81593935342
-Ref: 81603935516
-Ref: 81613935592
-Ref: 81623935746
-Ref: 81633935901
-Ref: 81643936132
-Ref: 81653936349
-Ref: 81663938255
-Ref: 81673941064
-Ref: 81683941506
-Ref: 81693949845
-Ref: 81703949845
-Ref: 81713957126
-Ref: 81723957723
-Ref: 81733958900
-Ref: 81743959534
-Node: B.3.13960314
-Ref: 81753961080
-Ref: 81763961135
-Ref: 81773961226
-Ref: 81783961351
-Ref: 81793961427
-Ref: 81803961478
-Ref: 81813961639
-Ref: 81823961719
-Ref: 81833961788
-Ref: 81843961832
-Ref: 81853961884
-Ref: 81863961952
-Ref: 81873962051
-Ref: 81883962115
-Ref: 81893962210
-Ref: 81903962276
-Ref: 81913962481
-Ref: 81923962672
-Ref: 81933969271
-Ref: 81943969536
-Ref: 81953969648
-Ref: 81963969705
-Ref: 81973970415
-Ref: 81983970974
-Node: B.3.23972121
-Ref: 81993973402
-Ref: 82003973458
-Ref: 82013973509
-Ref: 82023973663
-Ref: 82033973780
-Ref: 82043974412
-Ref: 82053974504
-Ref: 82063974662
-Ref: 82073974834
-Ref: 82083975070
-Ref: 82093978392
-Ref: 82103978585
-Ref: 82113978729
-Ref: 82123978947
-Ref: 82133979100
-Ref: 82143979427
-Node: B.3.33981238
-Ref: 82153981438
-Ref: 82163982285
-Ref: 82173982285
-Ref: 82183982535
-Ref: 82193982536
-Ref: 82203982536
-Ref: 82213983654
-Ref: 82223986866
-Ref: 82233987194
-Ref: 82243988987
-Ref: 82253989115
-Ref: 82263989533
-Node: B.43989849
-Ref: 82273990005
-Ref: 82283990006
-Ref: 82293991017
-Ref: 82303991136
-Ref: 82313991197
-Ref: 82323991262
-Ref: 82333991320
-Ref: 82343991377
-Ref: 82353991446
-Ref: 82363991551
-Ref: 82373991612
-Ref: 82383991714
-Ref: 82393991784
-Ref: 82403991875
-Ref: 82413991998
-Ref: 82423992102
-Ref: 82433992168
-Ref: 82443992239
-Ref: 82453992409
-Ref: 82463992589
-Ref: 82473992735
-Ref: 82483992774
-Ref: 82493992830
-Ref: 82503992886
-Ref: 82513992942
-Ref: 82523992998
-Ref: 82533993063
-Ref: 82543993101
-Ref: 82553993153
-Ref: 82563993205
-Ref: 82573993266
-Ref: 82583993304
-Ref: 82593993356
-Ref: 82603993511
-Ref: 82613993561
-Ref: 82623993643
-Ref: 82633993752
-Ref: 82643993873
-Ref: 82653993996
-Ref: 82663994072
-Ref: 82673994201
-Ref: 82683994410
-Ref: 82693994539
-Ref: 82703994614
-Ref: 82713994749
-Ref: 82723994967
-Ref: 82733995092
-Ref: 82743995163
-Ref: 82753995294
-Ref: 82763995510
-Ref: 82773995577
-Ref: 82783995648
-Ref: 82793995715
-Ref: 82803997876
-Node: B.54015623
-Ref: 82814015771
-Ref: 82824015772
-Ref: 82834016587
-Ref: 82844016634
-Ref: 82854016699
-Ref: 82864016763
-Ref: 82874016830
-Ref: 82884016873
-Ref: 82894016981
-Ref: 82904017056
-Ref: 82914017119
-Ref: 82924017183
-Ref: 82934017256
-Ref: 82944017356
-Ref: 82954017463
-Ref: 82964017535
-Ref: 82974017607
-Ref: 82984017680
-Ref: 82994017758
-Ref: 83004017939
-Node: Annex C4023122
-Ref: 83014023263
-Ref: 83024023263
-Ref: 83034023264
-Ref: 83044023264
-Ref: 83054023264
-Ref: 83064023264
-Ref: 83074023523
-Node: C.14023840
-Ref: 83084024251
-Ref: 83094025314
-Ref: 83104025315
-Ref: 83114025315
-Ref: 83124025315
-Node: C.24029182
-Ref: 83134029575
-Node: C.34029704
-Ref: 83144029979
-Ref: 83154030031
-Ref: 83164030132
-Ref: 83174030236
-Ref: 83184030364
-Ref: 83194030461
-Ref: 83204030548
-Ref: 83214030687
-Ref: 83224030688
-Ref: 83234030964
-Ref: 83244030965
-Ref: 83254031791
-Node: C.3.14038597
-Ref: 83264039306
-Ref: 83274039306
-Ref: 83284039620
-Ref: 83294039620
-Ref: 83304040165
-Ref: 83314041617
-Ref: 83324041618
-Ref: 83334041944
-Ref: 83344041945
-Ref: 83354042010
-Ref: 83364042176
-Ref: 83374042177
-Ref: 83384042177
-Ref: 83394042532
-Ref: 83404042658
-Ref: 83414044308
-Ref: 83424044649
-Ref: 83434048026
-Ref: 83444050181
-Ref: 83454051456
-Ref: 83464051692
-Node: C.3.24051819
-Ref: 83474052081
-Ref: 83484052160
-Ref: 83494052213
-Ref: 83504052335
-Ref: 83514052421
-Ref: 83524052507
-Ref: 83534052612
-Ref: 83544052744
-Ref: 83554052931
-Ref: 83564053009
-Ref: 83574053130
-Ref: 83584053344
-Ref: 83594054441
-Ref: 83604055988
-Ref: 83614056305
-Ref: 83624056654
-Ref: 83634059626
-Node: C.44060006
-Ref: 83644060522
-Ref: 83654060901
-Node: C.54065089
-Ref: 83664065575
-Ref: 83674065575
-Ref: 83684065985
-Ref: 83694065985
-Ref: 83704066237
-Ref: 83714066238
-Ref: 83724066261
-Ref: 83734066445
-Ref: 83744066446
-Ref: 83754067605
-Ref: 83764067605
-Node: C.64072035
-Ref: 83774072683
-Ref: 83784072683
-Ref: 83794072871
-Ref: 83804072871
-Ref: 83814073077
-Ref: 83824073077
-Ref: 83834073499
-Ref: 83844073499
-Ref: 83854073728
-Ref: 83864073728
-Ref: 83874074167
-Ref: 83884074167
-Ref: 83894074628
-Ref: 83904075270
-Ref: 83914076124
-Ref: 83924076124
-Ref: 83934077189
-Ref: 83944082885
-Ref: 83954082992
-Ref: 83964084201
-Ref: 83974088087
-Ref: 83984088960
-Ref: 83994089394
-Node: C.74090808
-Node: C.7.14091658
-Ref: 84004091972
-Ref: 84014092036
-Ref: 84024092119
-Ref: 84034092312
-Ref: 84044092382
-Ref: 84054092433
-Ref: 84064092484
-Ref: 84074092573
-Ref: 84084092644
-Ref: 84094092715
-Ref: 84104094971
-Ref: 84114094986
-Ref: 84124095180
-Ref: 84134095195
-Ref: 84144095552
-Ref: 84154095679
-Ref: 84164095679
-Ref: 84174095857
-Ref: 84184095989
-Ref: 84194096701
-Ref: 84204098410
-Node: C.7.24098902
-Ref: 84214099345
-Ref: 84224099362
-Ref: 84234099424
-Ref: 84244099507
-Ref: 84254099602
-Ref: 84264099711
-Ref: 84274101006
-Ref: 84284101121
-Ref: 84294102164
-Ref: 84304102649
-Ref: 84314103016
-Ref: 84324103294
-Node: C.7.34112276
-Ref: 84334112644
-Ref: 84344112710
-Ref: 84354112793
-Ref: 84364113025
-Ref: 84374113119
-Ref: 84384113200
-Ref: 84394113341
-Ref: 84404113576
-Ref: 84414113577
-Ref: 84424114702
-Ref: 84434114703
-Ref: 84444114703
-Ref: 84454114703
-Ref: 84464114703
-Ref: 84474114703
-Ref: 84484118097
-Node: Annex D4118747
-Ref: 84494118883
-Ref: 84504118883
-Ref: 84514122532
-Node: D.14123151
-Ref: 84524123949
-Ref: 84534123949
-Ref: 84544124277
-Ref: 84554124277
-Ref: 84564126586
-Ref: 84574126586
-Ref: 84584126586
-Ref: 84594126586
-Ref: 84604126586
-Ref: 84614127733
-Ref: 84624128140
-Ref: 84634128141
-Ref: 84644131443
-Ref: 84654132399
-Node: D.24132745
-Node: D.2.14133567
-Ref: 84664134035
-Ref: 84674134126
-Ref: 84684134172
-Ref: 84694134985
-Ref: 84704134986
-Ref: 84714134986
-Ref: 84724134986
-Ref: 84734135596
-Ref: 84744135597
-Ref: 84754135597
-Ref: 84764135597
-Ref: 84774135597
-Ref: 84784135597
-Ref: 84794136584
-Ref: 84804138932
-Ref: 84814141177
-Node: D.2.24142042
-Ref: 84824142559
-Ref: 84834142560
-Ref: 84844142591
-Ref: 84854142736
-Ref: 84864142737
-Ref: 84874142786
-Ref: 84884142813
-Ref: 84894142839
-Ref: 84904145206
-Ref: 84914145207
-Ref: 84924145333
-Ref: 84934145334
-Ref: 84944145813
-Ref: 84954146258
-Ref: 84964148930
-Node: D.2.34150023
-Ref: 84974150432
-Ref: 84984150432
-Ref: 84994151747
-Ref: 85004151748
-Ref: 85014152189
-Ref: 85024152759
-Node: D.2.44154793
-Ref: 85034155258
-Ref: 85044155258
-Ref: 85054155399
-Ref: 85064155461
-Ref: 85074155495
-Ref: 85084158549
-Ref: 85094158549
-Ref: 85104161452
-Ref: 85114161607
-Node: D.2.54161662
-Ref: 85124162129
-Ref: 85134162129
-Ref: 85144162310
-Ref: 85154162318
-Ref: 85164162431
-Ref: 85174162560
-Ref: 85184162692
-Ref: 85194162797
-Ref: 85204167601
-Node: D.2.64167705
-Ref: 85214170338
-Ref: 85224170338
-Ref: 85234170528
-Ref: 85244170544
-Ref: 85254170583
-Ref: 85264170684
-Ref: 85274170851
-Ref: 85284171025
-Ref: 85294171521
-Ref: 85304171521
-Ref: 85314177494
-Ref: 85324177889
-Ref: 85334179555
-Ref: 85344179723
-Node: D.34180029
-Ref: 85354180503
-Ref: 85364180504
-Ref: 85374180526
-Ref: 85384180598
-Ref: 85394180669
-Ref: 85404180751
-Ref: 85414180862
-Ref: 85424180862
-Ref: 85434181043
-Ref: 85444181852
-Ref: 85454182536
-Ref: 85464182537
-Ref: 85474182632
-Ref: 85484182632
-Ref: 85494182696
-Ref: 85504184317
-Ref: 85514184317
-Ref: 85524184317
-Ref: 85534184820
-Ref: 85544184972
-Ref: 85554185268
-Ref: 85564190524
-Node: D.44192073
-Ref: 85574192281
-Ref: 85584192652
-Ref: 85594192653
-Ref: 85604192675
-Ref: 85614192747
-Ref: 85624192833
-Ref: 85634192898
-Ref: 85644192898
-Ref: 85654192999
-Ref: 85664193754
-Ref: 85674193754
-Ref: 85684193885
-Ref: 85694193885
-Ref: 85704193894
-Node: D.54201728
-Node: D.5.14202338
-Ref: 85714202848
-Ref: 85724202921
-Ref: 85734203135
-Ref: 85744203627
-Ref: 85754204684
-Ref: 85764207903
-Ref: 85774211742
-Node: D.5.24212744
-Ref: 85784213241
-Ref: 85794213256
-Ref: 85804214496
-Ref: 85814215737
-Node: D.64215846
-Node: D.74219609
-Ref: 85824220104
-Ref: 85834220105
-Ref: 85844221027
-Ref: 85854221028
-Ref: 85864222099
-Ref: 85874222100
-Ref: 85884222255
-Ref: 85894222255
-Ref: 85904222374
-Ref: 85914222374
-Ref: 85924222850
-Ref: 85934222854
-Ref: 85944222854
-Ref: 85954223473
-Ref: 85964223474
-Ref: 85974223588
-Ref: 85984223589
-Ref: 85994224091
-Ref: 86004224092
-Ref: 86014225521
-Ref: 86024225522
-Ref: 86034225680
-Ref: 86044225681
-Ref: 86054225806
-Ref: 86064225807
-Ref: 86074226330
-Ref: 86084226392
-Ref: 86094226393
-Ref: 86104226648
-Ref: 86114226649
-Ref: 86124226755
-Ref: 86134226756
-Ref: 86144226885
-Ref: 86154226886
-Ref: 86164227112
-Ref: 86174227113
-Ref: 86184228011
-Ref: 86194228012
-Ref: 86204228307
-Ref: 86214228307
-Ref: 86224228433
-Ref: 86234228433
-Ref: 86244229110
-Ref: 86254229111
-Ref: 86264229367
-Ref: 86274229368
-Ref: 86284229981
-Ref: 86294229982
-Ref: 86304230290
-Ref: 86314230291
-Ref: 86324230291
-Ref: 86334230534
-Ref: 86344230535
-Ref: 86354231044
-Ref: 86364231045
-Ref: 86374231045
-Ref: 86384231295
-Ref: 86394231296
-Ref: 86404231771
-Ref: 86414231772
-Ref: 86424231772
-Ref: 86434232361
-Ref: 86444232362
-Ref: 86454232640
-Ref: 86464232673
-Ref: 86474232674
-Ref: 86484233434
-Ref: 86494234408
-Ref: 86504235276
-Ref: 86514236479
-Ref: 86524238447
-Ref: 86534239286
-Node: D.84239700
-Ref: 86544240048
-Ref: 86554240064
-Ref: 86564240088
-Ref: 86574240123
-Ref: 86584240157
-Ref: 86594240232
-Ref: 86604240261
-Ref: 86614240306
-Ref: 86624240350
-Ref: 86634240394
-Ref: 86644240441
-Ref: 86654240484
-Ref: 86664241848
-Ref: 86674241910
-Ref: 86684242007
-Ref: 86694242069
-Ref: 86704242131
-Ref: 86714242193
-Ref: 86724242255
-Ref: 86734242317
-Ref: 86744242385
-Ref: 86754242465
-Ref: 86764242658
-Ref: 86774243741
-Ref: 86784243741
-Ref: 86794245891
-Ref: 86804249078
-Ref: 86814251805
-Ref: 86824255974
-Node: D.94256847
-Ref: 86834257874
-Ref: 86844257874
-Ref: 86854260245
-Ref: 86864260245
-Node: D.104262356
-Ref: 86874262900
-Ref: 86884262970
-Ref: 86894263025
-Ref: 86904263082
-Ref: 86914263139
-Ref: 86924263209
-Ref: 86934263766
-Ref: 86944263785
-Ref: 86954265048
-Ref: 86964265048
-Ref: 86974265048
-Ref: 86984266274
-Ref: 86994266465
-Node: D.10.14266577
-Ref: 87004267075
-Ref: 87014267148
-Ref: 87024267337
-Ref: 87034267436
-Ref: 87044269492
-Node: D.114269549
-Ref: 87054270112
-Ref: 87064270185
-Ref: 87074270248
-Ref: 87084270314
-Ref: 87094270503
-Ref: 87104270504
-Ref: 87114270504
-Ref: 87124272495
-Ref: 87134272539
-Ref: 87144272650
-Ref: 87154275667
-Node: D.124276349
-Node: D.134279862
-Ref: 87164280122
-Ref: 87174284207
-Ref: 87184284546
-Node: D.144285548
-Ref: 87194286055
-Ref: 87204286074
-Ref: 87214286103
-Ref: 87224286147
-Ref: 87234286191
-Ref: 87244286264
-Ref: 87254286317
-Ref: 87264287043
-Ref: 87274287144
-Ref: 87284287290
-Ref: 87294287403
-Ref: 87304287544
-Ref: 87314287759
-Ref: 87324287760
-Ref: 87334289877
-Ref: 87344291422
-Ref: 87354294265
-Ref: 87364294407
-Node: D.14.14295445
-Ref: 87374295975
-Ref: 87384295994
-Ref: 87394296147
-Ref: 87404296236
-Ref: 87414296345
-Ref: 87424296515
-Ref: 87434296683
-Ref: 87444296752
-Ref: 87454296879
-Ref: 87464296938
-Ref: 87474297544
-Ref: 87484297545
-Ref: 87494297746
-Ref: 87504299574
-Ref: 87514301984
-Ref: 87524303525
-Node: D.14.24303579
-Ref: 87534304159
-Ref: 87544304227
-Ref: 87554304397
-Ref: 87564304505
-Ref: 87574304632
-Ref: 87584304860
-Ref: 87594304982
-Ref: 87604305108
-Ref: 87614305234
-Ref: 87624305332
-Ref: 87634305401
-Ref: 87644305475
-Ref: 87654305548
-Ref: 87664305619
-Ref: 87674305697
-Ref: 87684305823
-Ref: 87694305915
-Ref: 87704306036
-Ref: 87714306339
-Ref: 87724306826
-Ref: 87734306826
-Ref: 87744306826
-Ref: 87754307114
-Ref: 87764307115
-Ref: 87774312389
-Ref: 87784313731
-Ref: 87794313886
-Node: D.14.34314412
-Ref: 87804314931
-Ref: 87814314949
-Ref: 87824315044
-Ref: 87834316657
-Node: D.154316715
-Ref: 87844317251
-Ref: 87854317269
-Ref: 87864317321
-Ref: 87874317437
-Ref: 87884317613
-Ref: 87894317793
-Ref: 87904317890
-Ref: 87914318019
-Ref: 87924318325
-Ref: 87934318569
-Ref: 87944318570
-Ref: 87954318784
-Ref: 87964325881
-Node: D.164326741
-Ref: 87974327187
-Ref: 87984327252
-Ref: 87994327308
-Ref: 88004327370
-Ref: 88014327544
-Ref: 88024328121
-Ref: 88034328121
-Ref: 88044330225
-Node: D.16.14330533
-Ref: 88054331117
-Ref: 88064331131
-Ref: 88074331187
-Ref: 88084331244
-Ref: 88094331348
-Ref: 88104331436
-Ref: 88114331539
-Ref: 88124331646
-Ref: 88134331738
-Ref: 88144331837
-Ref: 88154331918
-Ref: 88164332121
-Ref: 88174332390
-Ref: 88184332570
-Ref: 88194332749
-Ref: 88204333041
-Ref: 88214333930
-Ref: 88224333930
-Ref: 88234341946
-Ref: 88244342161
-Ref: 88254342986
-Node: Annex E4344489
-Ref: 88264344852
-Ref: 88274344943
-Ref: 88284344943
-Ref: 88294344943
-Ref: 88304345244
-Ref: 88314345385
-Node: E.14346790
-Ref: 88324347022
-Ref: 88334347022
-Ref: 88344348214
-Ref: 88354349052
-Ref: 88364349449
-Ref: 88374349449
-Ref: 88384349449
-Ref: 88394349449
-Ref: 88404350152
-Ref: 88414350167
-Ref: 88424350572
-Ref: 88434350704
-Node: E.24353264
-Ref: 88444353704
-Ref: 88454353705
-Ref: 88464353705
-Ref: 88474353705
-Ref: 88484353705
-Ref: 88494353705
-Ref: 88504354495
-Ref: 88514354630
-Ref: 88524354763
-Ref: 88534354872
-Node: E.2.14358084
-Ref: 88544358990
-Ref: 88554358995
-Ref: 88564359062
-Ref: 88574359063
-Ref: 88584359092
-Ref: 88594359174
-Ref: 88604359309
-Ref: 88614359309
-Ref: 88624362060
-Ref: 88634362060
-Ref: 88644363015
-Ref: 88654363217
-Ref: 88664363217
-Ref: 88674363217
-Ref: 88684363848
-Ref: 88694364131
-Node: E.2.24364556
-Ref: 88704365343
-Ref: 88714365348
-Ref: 88724365413
-Ref: 88734365414
-Ref: 88744365441
-Ref: 88754365523
-Ref: 88764365652
-Ref: 88774365652
-Ref: 88784368231
-Ref: 88794368368
-Ref: 88804368369
-Ref: 88814374305
-Ref: 88824375218
-Ref: 88834377354
-Ref: 88844378066
-Ref: 88854378575
-Node: E.2.34380080
-Ref: 88864380724
-Ref: 88874380729
-Ref: 88884380803
-Ref: 88894380804
-Ref: 88904380840
-Ref: 88914380925
-Ref: 88924380926
-Ref: 88934380957
-Ref: 88944380968
-Ref: 88954380973
-Ref: 88964381149
-Ref: 88974381150
-Ref: 88984381150
-Ref: 88994381150
-Ref: 89004381150
-Ref: 89014381298
-Ref: 89024381298
-Ref: 89034385674
-Ref: 89044385675
-Ref: 89054386778
-Ref: 89064386778
-Ref: 89074386778
-Ref: 89084389692
-Ref: 89094390973
-Ref: 89104391489
-Ref: 89114392193
-Node: E.34392900
-Ref: 89124393719
-Ref: 89134393734
-Ref: 89144393930
-Ref: 89154393945
-Ref: 89164394208
-Ref: 89174394550
-Ref: 89184395032
-Ref: 89194395032
-Ref: 89204395444
-Node: E.44396943
-Ref: 89214397075
-Ref: 89224397075
-Ref: 89234397075
-Ref: 89244397075
-Ref: 89254397075
-Ref: 89264398897
-Ref: 89274398897
-Ref: 89284398897
-Ref: 89294399588
-Ref: 89304399588
-Ref: 89314400160
-Ref: 89324400600
-Ref: 89334401749
-Ref: 89344401749
-Ref: 89354402118
-Ref: 89364402119
-Ref: 89374402410
-Ref: 89384403954
-Ref: 89394403954
-Ref: 89404404309
-Ref: 89414411706
-Ref: 89424412806
-Node: E.4.14415217
-Ref: 89434416006
-Ref: 89444416006
-Ref: 89454417140
-Ref: 89464417141
-Ref: 89474417958
-Node: E.4.24418038
-Node: E.54422444
-Ref: 89484422614
-Ref: 89494422615
-Ref: 89504423159
-Ref: 89514423176
-Ref: 89524423238
-Ref: 89534423287
-Ref: 89544423450
-Ref: 89554423638
-Ref: 89564423797
-Ref: 89574424000
-Ref: 89584424159
-Ref: 89594424318
-Ref: 89604426400
-Ref: 89614426775
-Ref: 89624428505
-Ref: 89634428505
-Ref: 89644435394
-Node: Annex F4435888
-Ref: 89654436028
-Ref: 89664438115
-Node: F.14438508
-Ref: 89674438710
-Ref: 89684438710
-Ref: 89694438992
-Ref: 89704438992
-Node: F.24440546
-Ref: 89714440805
-Ref: 89724440847
-Ref: 89734440903
-Ref: 89744440962
-Ref: 89754441014
-Ref: 89764441069
-Ref: 89774441406
-Node: F.34443376
-Ref: 89784443696
-Node: F.3.14448905
-Ref: 89794449057
-Ref: 89804449058
-Node: F.3.24456506
-Ref: 89814457915
-Node: F.3.34469138
-Ref: 89824469894
-Ref: 89834469911
-Ref: 89844469951
-Ref: 89854470086
-Ref: 89864470242
-Ref: 89874470309
-Ref: 89884470371
-Ref: 89894470440
-Ref: 89904470485
-Ref: 89914470542
-Ref: 89924470599
-Ref: 89934470656
-Ref: 89944471181
-Ref: 89954471219
-Ref: 89964471374
-Ref: 89974471573
-Ref: 89984472002
-Ref: 89994472449
-Ref: 90004472843
-Node: F.3.44481833
-Ref: 90014482035
-Ref: 90024482035
-Node: F.3.54482789
-Ref: 90034483017
-Ref: 90044483018
-Ref: 90054483950
-Node: Annex G4484108
-Ref: 90064484226
-Ref: 90074486080
-Node: G.14486255
-Node: G.1.14487572
-Ref: 90084487879
-Ref: 90094488023
-Ref: 90104488156
-Ref: 90114488245
-Ref: 90124488277
-Ref: 90134488321
-Ref: 90144488375
-Ref: 90154488429
-Ref: 90164488487
-Ref: 90174488584
-Ref: 90184488681
-Ref: 90194488782
-Ref: 90204488859
-Ref: 90214488936
-Ref: 90224489016
-Ref: 90234489158
-Ref: 90244489222
-Ref: 90254489334
-Ref: 90264489436
-Ref: 90274489664
-Ref: 90284490183
-Ref: 90294492974
-Ref: 90304501439
-Ref: 90314501439
-Ref: 90324501439
-Ref: 90334501781
-Ref: 90344503442
-Ref: 90354512212
-Node: G.1.24512604
-Ref: 90364512995
-Ref: 90374513265
-Ref: 90384513319
-Ref: 90394513373
-Ref: 90404513427
-Ref: 90414513712
-Ref: 90424513763
-Ref: 90434513814
-Ref: 90444513865
-Ref: 90454513919
-Ref: 90464513973
-Ref: 90474514027
-Ref: 90484514081
-Ref: 90494514138
-Ref: 90504514190
-Ref: 90514514242
-Ref: 90524514294
-Ref: 90534514349
-Ref: 90544514404
-Ref: 90554514459
-Ref: 90564514514
-Ref: 90574514669
-Ref: 90584520688
-Ref: 90594520688
-Ref: 90604520688
-Ref: 90614521640
-Ref: 90624523677
-Ref: 90634526925
-Ref: 90644527727
-Node: G.1.34530414
-Ref: 90654531646
-Ref: 90664531824
-Ref: 90674531859
-Ref: 90684531908
-Ref: 90694531956
-Ref: 90704532094
-Ref: 90714532189
-Ref: 90724532442
-Ref: 90734532654
-Ref: 90744532784
-Ref: 90754533035
-Ref: 90764542711
-Node: G.1.44543120
-Ref: 90774543328
-Ref: 90784543328
-Node: G.1.54543739
-Ref: 90794543973
-Ref: 90804543974
-Ref: 90814544497
-Node: G.24544646
-Ref: 90824544848
-Ref: 90834544848
-Ref: 90844545328
-Ref: 90854547385
-Node: G.2.14547854
-Ref: 90864548877
-Ref: 90874550966
-Ref: 90884551067
-Ref: 90894551876
-Ref: 90904552265
-Ref: 90914553341
-Ref: 90924553341
-Ref: 90934553620
-Ref: 90944555466
-Ref: 90954557546
-Node: G.2.24557840
-Ref: 90964558409
-Ref: 90974558409
-Ref: 90984559506
-Ref: 90994559506
-Ref: 91004560042
-Ref: 91014560042
-Ref: 91024560839
-Ref: 91034560839
-Ref: 91044561636
-Ref: 91054561638
-Ref: 91064561638
-Ref: 91074561974
-Ref: 91084561975
-Ref: 91094563484
-Ref: 91104563485
-Node: G.2.34566328
-Ref: 91114567887
-Ref: 91124568054
-Ref: 91134574793
-Ref: 91144574794
-Ref: 91154574945
-Ref: 91164575420
-Node: G.2.44577375
-Ref: 91174577727
-Ref: 91184577727
-Ref: 91194578189
-Ref: 91204578190
-Ref: 91214578342
-Ref: 91224579551
-Node: G.2.54585060
-Node: G.2.64597718
-Ref: 91234598387
-Ref: 91244598852
-Ref: 91254599125
-Ref: 91264599510
-Ref: 91274599511
-Ref: 91284601388
-Node: G.34608686
-Ref: 91294610474
-Node: G.3.14610666
-Ref: 91304611086
-Ref: 91314611169
-Ref: 91324611236
-Ref: 91334612379
-Ref: 91344612861
-Ref: 91354613812
-Ref: 91364613890
-Ref: 91374613954
-Ref: 91384614017
-Ref: 91394614156
-Ref: 91404614230
-Ref: 91414614456
-Ref: 91424614713
-Ref: 91434616533
-Ref: 91444619973
-Ref: 91454628998
-Ref: 91464634996
-Node: G.3.24635267
-Ref: 91474635960
-Ref: 91484636046
-Ref: 91494636114
-Ref: 91504636380
-Ref: 91514636441
-Ref: 91524636508
-Ref: 91534636614
-Ref: 91544636724
-Ref: 91554636821
-Ref: 91564636924
-Ref: 91574637136
-Ref: 91584637207
-Ref: 91594637335
-Ref: 91604637439
-Ref: 91614637823
-Ref: 91624639762
-Ref: 91634640073
-Ref: 91644640134
-Ref: 91654640202
-Ref: 91664640308
-Ref: 91674640419
-Ref: 91684640516
-Ref: 91694640619
-Ref: 91704640837
-Ref: 91714640908
-Ref: 91724641036
-Ref: 91734641140
-Ref: 91744641522
-Ref: 91754641597
-Ref: 91764644488
-Ref: 91774644586
-Ref: 91784644656
-Ref: 91794644725
-Ref: 91804644860
-Ref: 91814644936
-Ref: 91824645168
-Ref: 91834645431
-Ref: 91844647278
-Ref: 91854656195
-Ref: 91864673644
-Ref: 91874679600
-Node: Annex H4679875
-Ref: 91884680051
-Ref: 91894680052
-Ref: 91904680713
-Ref: 91914680842
-Ref: 91924680843
-Ref: 91934681618
-Node: H.14682451
-Ref: 91944683089
-Ref: 91954683090
-Ref: 91964683161
-Ref: 91974683161
-Node: H.24686804
-Ref: 91984687023
-Node: H.34689221
-Node: H.3.14689524
-Ref: 91994690348
-Ref: 92004690349
-Ref: 92014690413
-Ref: 92024690413
-Node: H.3.24699176
-Ref: 92034699821
-Ref: 92044699822
-Ref: 92054699847
-Ref: 92064699862
-Ref: 92074700348
-Ref: 92084700484
-Node: H.44705837
-Ref: 92094707004
-Ref: 92104707004
-Ref: 92114707166
-Ref: 92124707166
-Ref: 92134707285
-Ref: 92144707286
-Ref: 92154707755
-Ref: 92164707756
-Ref: 92174707878
-Ref: 92184707879
-Ref: 92194707989
-Ref: 92204707990
-Ref: 92214708538
-Ref: 92224708539
-Ref: 92234708782
-Ref: 92244708782
-Ref: 92254709697
-Ref: 92264709697
-Ref: 92274710571
-Ref: 92284710571
-Ref: 92294711389
-Ref: 92304711390
-Ref: 92314711888
-Ref: 92324711888
-Ref: 92334711926
-Ref: 92344711927
-Ref: 92354711974
-Ref: 92364711974
-Ref: 92374712118
-Ref: 92384712119
-Ref: 92394712644
-Ref: 92404712644
-Ref: 92414713009
-Ref: 92424713009
-Ref: 92434713134
-Ref: 92444713134
-Ref: 92454717623
-Ref: 92464718040
-Ref: 92474719723
-Ref: 92484720710
-Node: H.54721735
-Ref: 92494722169
-Ref: 92504722170
-Ref: 92514722269
-Ref: 92524722270
-Ref: 92534723119
-Node: H.64723152
-Ref: 92544723594
-Ref: 92554723595
-Ref: 92564723632
-Ref: 92574724389
-Ref: 92584724390
-Ref: 92594724875
-Ref: 92604727763
-Node: Annex J4727819
-Ref: 92614727993
-Node: J.14730749
-Node: J.24732051
-Node: J.34734766
-Ref: 92624735500
-Ref: S03224735500
-Ref: 92634735518
-Ref: 92644735543
-Ref: 92654735639
-Ref: 92664735975
-Ref: 92674737324
-Ref: 92684737571
-Ref: 92694737811
-Node: J.44739296
-Ref: 92704739622
-Ref: 92714739622
-Node: J.54741047
-Node: J.64743652
-Node: J.74744784
-Ref: 92724744945
-Ref: S03234744945
-Ref: 92734744954
-Ref: 92744744973
-Ref: 92754745727
-Node: J.7.14746274
-Ref: 92764746804
-Ref: 92774746806
-Ref: 92784746806
-Ref: 92794747208
-Ref: 92804747543
-Ref: 92814747820
-Ref: 92824747970
-Ref: 92834748639
-Node: J.84752054
-Ref: 92844752218
-Ref: S03244752218
-Ref: 92854752237
-Node: J.94753306
-Ref: 92864753556
-Ref: 92874753556
-Ref: 92884754451
-Node: J.104755595
-Ref: 92894756002
-Ref: 92904756003
-Ref: 92914756012
-Ref: 92924756031
-Node: J.114758773
-Ref: 92934759208
-Ref: 92944759208
-Node: J.124760148
-Node: J.134761294
-Ref: 92954761823
-Ref: 92964761999
-Ref: 92974762179
-Node: J.144762588
-Node: J.154764125
-Node: J.15.14765104
-Ref: 92984765387
-Ref: 92994765387
-Ref: 93004765407
-Ref: 93014765408
-Ref: 93024765416
-Ref: 93034765422
-Ref: 93044767625
-Ref: 93054768098
-Ref: 93064768409
-Node: J.15.24768774
-Ref: 93074769081
-Ref: 93084769081
-Ref: 93094769101
-Ref: 93104769102
-Ref: 93114769123
-Ref: 93124769146
-Node: J.15.34769903
-Ref: 93134770195
-Ref: 93144770195
-Ref: 93154770215
-Ref: 93164770216
-Ref: 93174770236
-Node: J.15.44770851
-Ref: 93184771132
-Ref: 93194771133
-Ref: 93204771147
-Ref: 93214771433
-Node: J.15.54771949
-Ref: 93224772157
-Ref: 93234772158
-Ref: 93244772158
-Ref: 93254772158
-Ref: 93264772158
-Ref: 93274772158
-Ref: 93284772158
-Ref: 93294772158
-Ref: 93304772158
-Ref: 93314772158
-Ref: 93324772158
-Ref: 93334772158
-Ref: 93344772158
-Ref: 93354772321
-Ref: 93364772322
-Ref: 93374772367
-Ref: 93384772390
-Ref: 93394772452
-Ref: 93404772506
-Ref: 93414772538
-Ref: 93424772539
-Ref: 93434772584
-Ref: 93444772607
-Ref: 93454772669
-Ref: 93464772723
-Ref: 93474772755
-Ref: 93484772756
-Ref: 93494772794
-Ref: 93504772821
-Ref: 93514773127
-Ref: 93524773128
-Ref: 93534773522
-Node: J.15.64775509
-Ref: 93544775834
-Ref: 93554775835
-Ref: 93564775859
-Ref: 93574775860
-Ref: 93584775891
-Node: J.15.74776613
-Ref: 93594776949
-Ref: 93604776950
-Ref: 93614776977
-Ref: 93624777093
-Ref: 93634777094
-Ref: 93644777118
-Ref: 93654777123
-Ref: 93664777508
-Ref: 93674777931
-Ref: 93684779485
-Node: J.15.84780079
-Ref: 93694780462
-Ref: 93704780463
-Ref: 93714780471
-Ref: 93724780502
-Ref: 93734780503
-Ref: 93744780513
-Ref: 93754780569
-Ref: 93764780570
-Ref: 93774780593
-Ref: 93784780630
-Ref: 93794780631
-Ref: 93804780656
-Ref: 93814780687
-Ref: 93824780688
-Ref: 93834780715
-Ref: 93844780771
-Ref: 93854780772
-Ref: 93864780796
-Ref: 93874782428
-Ref: 93884782429
-Ref: 93894782429
-Ref: 93904782429
-Ref: 93914782429
-Ref: 93924782429
-Ref: 93934782429
-Ref: 93944782429
-Ref: 93954782429
-Ref: 93964782429
-Ref: 93974782429
-Ref: 93984782429
-Node: J.15.94782871
-Ref: 93994783428
-Ref: 94004783429
-Ref: 94014783434
-Ref: 94024783615
-Ref: 94034784486
-Node: J.15.104784507
-Ref: 94044785117
-Ref: 94054785118
-Ref: 94064785332
-Ref: 94074785922
-Node: J.15.114785958
-Ref: 94084786280
-Ref: 94094786281
-Ref: 94104786417
-Ref: 94114786418
-Ref: 94124786623
-Ref: 94134786623
-Node: J.15.124788468
-Ref: 94144788769
-Ref: 94154788770
-Ref: 94164788975
-Node: J.15.134789927
-Ref: 94174790232
-Ref: 94184790232
-Ref: 94194790252
-Ref: 94204790253
-Ref: 94214790267
-Node: Annex K4790994
-Node: K.14791450
-Ref: 94224791623
-Node: K.24802173
-Ref: 94234802352
-Ref: 94244803966
-Ref: 94254804177
-Ref: 94264804178
-Ref: 94274808566
-Ref: 94284808581
-Ref: 94294809958
-Ref: 94304810328
-Ref: 94314810329
-Ref: 94324811134
-Ref: 94334811343
-Ref: 94344811344
-Ref: 94354814280
-Ref: 94364814295
-Ref: 94374814601
-Ref: 94384814601
-Ref: 94394824763
-Ref: 94404824778
-Ref: 94414824778
-Ref: 94424825962
-Ref: 94434826213
-Ref: 94444826214
-Ref: 94454830261
-Ref: 94464839857
-Ref: 94474840022
-Ref: 94484840023
-Ref: 94494840524
-Ref: 94504840525
-Ref: 94514843228
-Ref: 94524843545
-Ref: 94534843546
-Ref: 94544846814
-Ref: 94554847408
-Ref: 94564847708
-Ref: 94574847709
-Ref: 94584851735
-Ref: 94594851900
-Ref: 94604851901
-Ref: 94614852387
-Ref: 94624852388
-Ref: 94634855193
-Ref: 94644855208
-Ref: 94654855718
-Ref: 94664856874
-Ref: 94674858076
-Node: Annex L4861152
-Ref: 94684861302
-Ref: 94694861398
-Ref: 94704861399
-Ref: 94714861430
-Ref: 94724861473
-Ref: 94734861474
-Ref: 94744861500
-Ref: 94754861533
-Ref: 94764861584
-Ref: 94774861585
-Ref: 94784861609
-Ref: 94794861658
-Ref: 94804861659
-Ref: 94814861696
-Ref: 94824861718
-Ref: 94834861747
-Ref: 94844861769
-Ref: 94854861853
-Ref: 94864861854
-Ref: 94874861868
-Ref: 94884861952
-Ref: 94894861953
-Ref: 94904861961
-Ref: 94914862044
-Ref: 94924862045
-Ref: 94934862070
-Ref: 94944862153
-Ref: 94954862154
-Ref: 94964862178
-Ref: 94974862183
-Ref: 94984862301
-Ref: 94994862302
-Ref: 95004862340
-Ref: 95014862362
-Ref: 95024862412
-Ref: 95034862413
-Ref: 95044862418
-Ref: 95054862467
-Ref: 95064862468
-Ref: 95074862490
-Ref: 95084862552
-Ref: 95094862553
-Ref: 95104862599
-Ref: 95114862600
-Ref: 95124862623
-Ref: 95134862671
-Ref: 95144862672
-Ref: 95154862739
-Ref: 95164862740
-Ref: 95174862763
-Ref: 95184862783
-Ref: 95194862824
-Ref: 95204862825
-Ref: 95214862852
-Ref: 95224862872
-Ref: 95234862913
-Ref: 95244862914
-Ref: 95254862943
-Ref: 95264863023
-Ref: 95274863024
-Ref: 95284863064
-Ref: 95294863087
-Ref: 95304863144
-Ref: 95314863193
-Ref: 95324863279
-Ref: 95334863280
-Ref: 95344863320
-Ref: 95354863343
-Ref: 95364863400
-Ref: 95374863449
-Ref: 95384863500
-Ref: 95394863501
-Ref: 95404863524
-Ref: 95414863574
-Ref: 95424863575
-Ref: 95434863599
-Ref: 95444863684
-Ref: 95454863685
-Ref: 95464863693
-Ref: 95474863699
-Ref: 95484863741
-Ref: 95494863742
-Ref: 95504863767
-Ref: 95514863782
-Ref: 95524863862
-Ref: 95534863863
-Ref: 95544863890
-Ref: 95554863969
-Ref: 95564863970
-Ref: 95574864039
-Ref: 95584864040
-Ref: 95594864062
-Ref: 95604864105
-Ref: 95614864106
-Ref: 95624864111
-Ref: 95634864154
-Ref: 95644864155
-Ref: 95654864177
-Ref: 95664864261
-Ref: 95674864262
-Ref: 95684864283
-Ref: 95694864306
-Ref: 95704864353
-Ref: 95714864354
-Ref: 95724864403
-Ref: 95734864404
-Ref: 95744864413
-Ref: 95754864495
-Ref: 95764864496
-Ref: 95774864516
-Ref: 95784864562
-Ref: 95794864563
-Ref: 95804864603
-Ref: 95814864604
-Ref: 95824864641
-Ref: 95834864688
-Ref: 95844864689
-Ref: 95854864718
-Ref: 95864864765
-Ref: 95874864766
-Ref: 95884864793
-Ref: 95894864873
-Ref: 95904864874
-Ref: 95914864935
-Ref: 95924864936
-Ref: 95934864980
-Ref: 95944865007
-Ref: 95954865033
-Ref: 95964865083
-Ref: 95974865084
-Ref: 95984865101
-Ref: 95994865123
-Ref: 96004865224
-Ref: 96014865225
-Ref: 96024865244
-Ref: 96034865285
-Ref: 96044865286
-Ref: 96054865308
-Ref: 96064865392
-Ref: 96074865393
-Ref: 96084865477
-Ref: 96094865478
-Ref: 96104865514
-Ref: 96114865554
-Ref: 96124865555
-Ref: 96134865582
-Ref: 96144865622
-Ref: 96154865623
-Ref: 96164865636
-Ref: 96174865649
-Ref: 96184865697
-Ref: 96194865698
-Ref: 96204865742
-Ref: 96214865743
-Ref: 96224865772
-Ref: 96234865851
-Ref: 96244865852
-Ref: 96254865866
-Ref: 96264865912
-Ref: 96274865913
-Ref: 96284865922
-Ref: 96294865966
-Ref: 96304865967
-Ref: 96314865998
-Ref: 96324866084
-Ref: 96334866085
-Ref: 96344866116
-Ref: 96354866166
-Ref: 96364866167
-Ref: 96374866178
-Ref: 96384866261
-Ref: 96394866262
-Ref: 96404866272
-Ref: 96414866357
-Ref: 96424866358
-Ref: 96434866385
-Node: Annex M4866599
-Ref: 96444866801
-Node: M.14867546
-Ref: 96454867692
-Ref: 96464867692
-Node: M.24875133
-Ref: 96474875297
-Ref: 96484875376
-Ref: 96494875487
-Ref: 96504875488
-Ref: 96514890126
-Node: M.34896685
-Ref: 96524896803
-Ref: 96534896803
-Node: Annex N4927372
-Ref: 96544927520
-Ref: 96554927743
-Ref: 96564927897
-Ref: 96574928061
-Ref: 96584928378
-Ref: 96594928621
-Ref: 96604928756
-Ref: 96614928956
-Ref: 96624929240
-Ref: 96634929448
-Ref: 96644929543
-Ref: 96654929560
-Ref: 96664929824
-Ref: 96674930084
-Ref: 96684930142
-Ref: 96694930283
-Ref: 96704930513
-Ref: 96714930658
-Ref: 96724930760
-Ref: 96734930761
-Ref: 96744931023
-Ref: 96754931558
-Ref: 96764931725
-Ref: 96774931896
-Ref: 96784932163
-Ref: 96794932315
-Ref: 96804932382
-Ref: 96814932530
-Ref: 96824932679
-Ref: 96834932830
-Ref: 96844932972
-Ref: 96854933078
-Ref: 96864933172
-Ref: 96874933173
-Ref: 96884933291
-Ref: 96894933407
-Ref: 96904934050
-Ref: 96914934303
-Ref: 96924934470
-Ref: 96934934933
-Ref: 96944935275
-Ref: 96954935439
-Ref: 96964935608
-Ref: 96974935823
-Ref: 96984936085
-Ref: 96994936187
-Ref: 97004936361
-Ref: 97014936609
-Ref: 97024936785
-Ref: 97034937174
-Ref: 97044937352
-Ref: 97054937684
-Ref: 97064937806
-Ref: 97074938031
-Ref: 97084938148
-Ref: 97094938256
-Ref: 97104938873
-Ref: 97114939012
-Ref: 97124939291
-Ref: 97134939416
-Ref: 97144939660
-Ref: 97154939845
-Ref: 97164940178
-Ref: 97174940368
-Ref: 97184940506
-Ref: 97194940617
-Ref: 97204940747
-Ref: 97214940883
-Ref: 97224941023
-Ref: 97234941101
-Ref: 97244941406
-Ref: 97254941585
-Ref: 97264941900
-Ref: 97274942145
-Ref: 97284942393
-Ref: 97294942842
-Ref: 97304943071
-Ref: 97314943349
-Ref: 97324943387
-Node: Annex P4943510
-Ref: 97334943638
-Ref: 97344943638
-Ref: 97354943638
-Ref: 97364943638
-Ref: 97374943638
-Ref: 97384943804
-Ref: 97394943822
-Ref: 97404943841
-Ref: 97414943916
-Ref: 97424943943
-Ref: 97434943970
-Ref: 97444943997
-Ref: 97454944023
-Ref: 97464944046
-Ref: 97474944117
-Ref: 97484944144
-Ref: 97494944177
-Ref: 97504944202
-Ref: 97514944268
-Ref: 97524944286
-Ref: 97534944346
-Ref: 97544944356
-Ref: 97554944366
-Ref: 97564944414
-Ref: 97574944422
-Ref: 97584944433
-Ref: 97594944485
-Ref: 97604944499
-Ref: 97614944634
-Ref: 97624944641
-Ref: 97634944657
-Ref: 97644944675
-Ref: 97654944720
-Ref: 97664944781
-Ref: 97674944798
-Ref: 97684944809
-Ref: 97694944870
-Ref: 97704944947
-Ref: 97714945011
-Ref: 97724945095
-Ref: 97734945168
-Ref: 97744945230
-Ref: 97754945243
-Ref: 97764945274
-Ref: 97774945396
-Ref: 97784945411
-Ref: 97794945443
-Ref: 97804945458
-Ref: 97814945495
-Ref: 97824945511
-Ref: 97834945542
-Ref: 97844945558
-Ref: 97854945626
-Ref: 97864945647
-Ref: 97874945677
-Ref: 97884945700
-Ref: 97894945729
-Ref: 97904945756
-Ref: 97914945798
-Ref: 97924945829
-Ref: 97934945871
-Ref: 97944945895
-Ref: 97954945926
-Ref: 97964945952
-Ref: 97974945982
-Ref: 97984946052
-Ref: 97994946111
-Ref: 98004946143
-Ref: 98014946181
-Ref: 98024946216
-Ref: 98034946314
-Ref: 98044946335
-Ref: 98054946363
-Ref: 98064946399
-Ref: 98074946432
-Ref: 98084946464
-Ref: 98094946548
-Ref: 98104946580
-Ref: 98114946614
-Ref: 98124946639
-Ref: 98134946671
-Ref: 98144946698
-Ref: 98154946731
-Ref: 98164946759
-Ref: 98174946852
-Ref: 98184946875
-Ref: 98194946908
-Ref: 98204946982
-Ref: 98214946998
-Ref: 98224947012
-Ref: 98234947075
-Ref: 98244947121
-Ref: 98254947141
-Ref: 98264947221
-Ref: 98274947240
-Ref: 98284947260
-Ref: 98294947339
-Ref: 98304947358
-Ref: 98314947441
-Ref: 98324947489
-Ref: 98334947518
-Ref: 98344947544
-Ref: 98354947576
-Ref: 98364947624
-Ref: 98374947652
-Ref: 98384947678
-Ref: 98394947710
-Ref: 98404947758
-Ref: 98414947790
-Ref: 98424947816
-Ref: 98434947848
-Ref: 98444947881
-Ref: 98454947973
-Ref: 98464947996
-Ref: 98474948077
-Ref: 98484948123
-Ref: 98494948229
-Ref: 98504948254
-Ref: 98514948276
-Ref: 98524948351
-Ref: 98534948392
-Ref: 98544948428
-Ref: 98554948449
-Ref: 98564948535
-Ref: 98574948572
-Ref: 98584948679
-Ref: 98594948701
-Ref: 98604948791
-Ref: 98614948863
-Ref: 98624948896
-Ref: 98634949000
-Ref: 98644949034
-Ref: 98654949117
-Ref: 98664949188
-Ref: 98674949216
-Ref: 98684949317
-Ref: 98694949329
-Ref: 98704949431
-Ref: 98714949459
-Ref: 98724949530
-Ref: 98734949564
-Ref: 98744949685
-Ref: 98754949697
-Ref: 98764949805
-Ref: 98774949830
-Ref: 98784949842
-Ref: 98794949945
-Ref: 98804949964
-Ref: 98814950041
-Ref: 98824950074
-Ref: 98834950177
-Ref: 98844950205
-Ref: 98854950235
-Ref: 98864950315
-Ref: 98874950410
-Ref: 98884950441
-Ref: 98894950480
-Ref: 98904950566
-Ref: 98914950587
-Ref: 98924950661
-Ref: 98934950698
-Ref: 98944950765
-Ref: 98954950783
-Ref: 98964950854
-Ref: 98974950875
-Ref: 98984950927
-Ref: 98994950955
-Ref: 99004951106
-Ref: 99014951136
-Ref: 99024951229
-Ref: 99034951257
-Ref: 99044951273
-Ref: 99054951290
-Ref: 99064951324
-Ref: 99074951351
-Ref: 99084951373
-Ref: 99094951446
-Ref: 99104951521
-Ref: 99114951549
-Ref: 99124951654
-Ref: 99134951684
-Ref: 99144951703
-Ref: 99154951801
-Ref: 99164951900
-Ref: 99174952011
-Ref: 99184952027
-Ref: 99194952054
-Ref: 99204952070
-Ref: 99214952143
-Ref: 99224952167
-Ref: 99234952240
-Ref: 99244952267
-Ref: 99254952292
-Ref: 99264952332
-Ref: 99274952425
-Ref: 99284952452
-Ref: 99294952472
-Ref: 99304952551
-Ref: 99314952586
-Ref: 99324952652
-Ref: 99334952671
-Ref: 99344952734
-Ref: 99354952763
-Ref: 99364952790
-Ref: 99374952862
-Ref: 99384952953
-Ref: 99394952984
-Ref: 99404953035
-Ref: 99414953183
-Ref: 99424953260
-Ref: 99434953288
-Ref: 99444953371
-Ref: 99454953387
-Ref: 99464953425
-Ref: 99474953441
-Ref: 99484953548
-Ref: 99494953573
-Ref: 99504953760
-Ref: 99514953816
-Ref: 99524953956
-Ref: 99534953990
-Ref: 99544954013
-Ref: 99554954058
-Ref: 99564954086
-Ref: 99574954130
-Ref: 99584954229
-Ref: 99594954250
-Ref: 99604954335
-Ref: 99614954409
-Ref: 99624954434
-Ref: 99634954501
-Ref: 99644954521
-Ref: 99654954537
-Ref: 99664954582
-Ref: 99674954596
-Ref: 99684954657
-Ref: 99694954675
-Ref: 99704954690
-Ref: 99714954702
-Ref: 99724954761
-Ref: 99734954777
-Ref: 99744954808
-Ref: 99754954830
-Ref: 99764954846
-Ref: 99774954869
-Ref: 99784954899
-Ref: 99794954919
-Ref: 99804954943
-Ref: 99814954965
-Ref: 99824954996
-Ref: 99834955022
-Ref: 99844955083
-Ref: 99854955096
-Ref: 99864955147
-Ref: 99874955154
-Ref: 99884955224
-Ref: 99894955282
-Ref: 99904955335
-Ref: 99914955342
-Ref: 99924955356
-Ref: 99934955405
-Ref: 99944955412
-Ref: 99954955477
-Ref: 99964955486
-Ref: 99974955544
-Ref: 99984955557
-Ref: 99994955577
-Ref: 100004955643
-Ref: 100014955650
-Ref: 100024955732
-Ref: 100034955751
-Ref: 100044955859
-Ref: 100054955866
-Ref: 100064955964
-Ref: 100074956046
-Ref: 100084956129
-Ref: 100094956136
-Ref: 100104956202
-Ref: 100114956221
-Ref: 100124956243
-Ref: 100134956313
-Ref: 100144956422
-Ref: 100154956454
-Ref: 100164956575
-Ref: 100174956601
-Ref: 100184956622
-Ref: 100194956723
-Ref: 100204956750
-Ref: 100214956843
-Ref: 100224956862
-Ref: 100234956941
-Ref: 100244956954
-Ref: 100254957021
-Ref: 100264957050
-Ref: 100274957140
-Ref: 100284957152
-Ref: 100294957166
-Ref: 100304957189
-Ref: 100314957203
-Ref: 100324957226
-Ref: 100334957248
-Ref: 100344957262
-Ref: 100354957352
-Ref: 100364957383
-Ref: 100374957481
-Ref: 100384957505
-Ref: 100394957525
-Ref: 100404957602
-Ref: 100414957616
-Ref: 100424957631
-Ref: 100434957650
-Ref: 100444957670
-Ref: 100454957683
-Ref: 100464957698
-Ref: 100474957716
-Ref: 100484957736
-Ref: 100494957750
-Ref: 100504957817
-Ref: 100514957838
-Ref: 100524957865
-Ref: 100534957885
-Ref: 100544957912
-Ref: 100554957933
-Ref: 100564957960
-Ref: 100574957986
-Ref: 100584958013
-Ref: 100594958038
-Ref: 100604958110
-Ref: 100614958129
-Ref: 100624958149
-Ref: 100634958216
-Ref: 100644958235
-Ref: 100654958255
-Ref: 100664958291
-Ref: 100674958318
-Ref: 100684958351
-Ref: 100694958419
-Ref: 100704958440
-Ref: 100714958512
-Ref: 100724958532
-Ref: 100734958540
-Ref: 100744958606
-Ref: 100754958629
-Ref: 100764958635
-Ref: 100774958664
-Ref: 100784958703
-Ref: 100794958711
-Ref: 100804958732
-Ref: 100814958775
-Ref: 100824958787
-Ref: 100834958802
-Ref: 100844958816
-Ref: 100854958869
-Ref: 100864958894
-Ref: 100874958911
-Ref: 100884958929
-Ref: 100894958936
-Ref: 100904958949
-Ref: 100914958970
-Ref: 100924958997
-Ref: 100934959502
-Ref: 100944959518
-Ref: 100954959590
-Ref: 100964959615
-Ref: 100974959641
-Ref: 100984959666
-Ref: 100994959702
-Ref: 101004959762
-Ref: 101014959844
-Ref: 101024959867
-Ref: 101034959907
-Ref: 101044960009
-Ref: 101054960056
-Ref: 101064960123
-Ref: 101074960134
-Ref: 101084960172
-Ref: 101094960195
-Ref: 101104960206
-Ref: 101114960232
-Ref: 101124960342
-Ref: 101134960407
-Ref: 101144960420
-Ref: 101154960441
-Ref: 101164960454
-Ref: 101174960518
-Ref: 101184960532
-Ref: 101194960546
-Ref: 101204960559
-Ref: 101214960621
-Ref: 101224960644
-Ref: 101234960676
-Ref: 101244960699
-Ref: 101254960786
-Ref: 101264960843
-Ref: 101274960854
-Ref: 101284960866
-Ref: 101294960921
-Ref: 101304960928
-Ref: 101314960948
-Ref: 101324960955
-Ref: 101334961019
-Ref: 101344961044
-Ref: 101354961069
-Ref: 101364961094
-Ref: 101374961113
-Ref: 101384961148
-Ref: 101394961176
-Ref: 101404961207
-Ref: 101414961229
-Ref: 101424961255
-Ref: 101434961275
-Ref: 101444961301
-Ref: 101454961374
-Ref: 101464961391
-Ref: 101474961416
-Ref: 101484961435
-Ref: 101494961461
-Ref: 101504961497
-Ref: 101514961518
-Ref: 101524961626
-Ref: 101534961698
-Ref: 101544961777
-Ref: 101554961785
-Ref: 101564961851
-Ref: 101574961877
-Ref: 101584961915
-Ref: 101594961941
-Ref: 101604961990
-Ref: 101614962098
-Ref: 101624962124
-Ref: 101634962163
-Ref: 101644962278
-Ref: 101654962313
-Ref: 101664962394
-Ref: 101674962429
-Ref: 101684962466
-Ref: 101694962516
-Ref: 101704962580
-Ref: 101714962604
-Ref: 101724962647
-Ref: 101734962736
-Ref: 101744962769
-Ref: 101754962860
-Ref: 101764962902
-Ref: 101774962916
-Ref: 101784962939
-Ref: 101794962987
-Ref: 101804963052
-Ref: 101814963113
-Ref: 101824963167
-Ref: 101834963222
-Ref: 101844963298
-Ref: 101854963310
-Ref: 101864963376
-Ref: 101874963444
-Ref: 101884963475
-Ref: 101894963514
-Ref: 101904963600
-Ref: 101914963633
-Ref: 101924963718
-Ref: 101934963745
-Ref: 101944963829
-Ref: 101954963849
-Ref: 101964963924
-Ref: 101974963944
-Ref: 101984963957
-Ref: 101994964021
-Ref: 102004964050
-Ref: 102014964137
-Ref: 102024964157
-Ref: 102034964227
-Ref: 102044964295
-Ref: 102054964358
-Ref: 102064964439
-Ref: 102074964460
-Ref: 102084964476
-Ref: 102094964499
-Ref: 102104964519
-Ref: 102114964587
-Ref: 102124964614
-Ref: 102134964702
-Ref: 102144964739
-Ref: 102154964745
-Ref: 102164964761
-Ref: 102174964784
-Ref: 102184964813
-Ref: 102194964840
-Ref: 102204964862
-Ref: 102214964996
-Ref: 102224965027
-Ref: 102234965065
-Ref: 102244965102
-Ref: 102254965147
-Ref: 102264965192
-Ref: 102274965278
-Ref: 102284965303
-Ref: 102294965310
-Ref: 102304965394
-Ref: 102314965417
-Ref: 102324965424
-Ref: 102334965507
-Ref: 102344965532
-Ref: 102354965633
-Ref: 102364965651
-Ref: 102374965731
-Ref: 102384965753
-Ref: 102394965818
-Ref: 102404965904
-Ref: 102414965946
-Ref: 102424965982
-Ref: 102434966065
-Ref: 102444966117
-Ref: 102454966224
-Ref: 102464966245
-Ref: 102474966334
-Ref: 102484966364
-Ref: 102494966409
-Ref: 102504966502
-Ref: 102514966532
-Ref: 102524966571
-Ref: 102534966596
-Ref: 102544966628
-Ref: 102554966658
-Ref: 102564966696
-Ref: 102574966719
-Ref: 102584966790
-Ref: 102594966881
-Ref: 102604966922
-Ref: 102614966959
-Ref: 102624967012
-Ref: 102634967052
-Ref: 102644967070
-Ref: 102654967146
-Ref: 102664967187
-Ref: 102674967224
-Ref: 102684967269
-Ref: 102694967316
-Ref: 102704967334
-Ref: 102714967414
-Ref: 102724967435
-Ref: 102734967513
-Ref: 102744967608
-Ref: 102754967629
-Ref: 102764967710
-Ref: 102774967750
-Ref: 102784967792
-Ref: 102794967922
-Ref: 102804967943
-Ref: 102814968018
-Ref: 102824968034
-Ref: 102834968100
-Ref: 102844968116
-Ref: 102854968192
-Ref: 102864968231
-Ref: 102874968273
-Ref: 102884968313
-Ref: 102894968356
-Ref: 102904968453
-Ref: 102914968476
-Ref: 102924968492
-Ref: 102934968526
-Ref: 102944968545
-Ref: 102954968577
-Ref: 102964968599
-Ref: 102974968632
-Ref: 102984968651
-Ref: 102994968735
-Ref: 103004968791
-Ref: 103014968805
-Ref: 103024968895
-Ref: 103034968944
-Ref: 103044968958
-Ref: 103054969054
-Ref: 103064969085
-Ref: 103074969134
-Ref: 103084969153
-Ref: 103094969263
-Ref: 103104969320
-Ref: 103114969339
-Ref: 103124969391
-Ref: 103134969450
-Ref: 103144969469
-Ref: 103154969520
-Ref: 103164969578
-Ref: 103174969597
-Ref: 103184969689
-Ref: 103194969710
-Ref: 103204969749
-Ref: 103214969790
-Ref: 103224969821
-Ref: 103234969905
-Ref: 103244969940
-Ref: 103254969980
-Ref: 103264970011
-Ref: 103274970085
-Ref: 103284970124
-Ref: 103294970153
-Ref: 103304970203
-Ref: 103314970223
-Ref: 103324970294
-Ref: 103334970328
-Ref: 103344970363
-Ref: 103354970404
-Ref: 103364970453
-Ref: 103374970544
-Ref: 103384970565
-Ref: 103394970604
-Ref: 103404970644
-Ref: 103414970675
-Ref: 103424970772
-Ref: 103434970806
-Ref: 103444970846
-Ref: 103454970877
-Ref: 103464970960
-Ref: 103474971020
-Ref: 103484971076
-Ref: 103494971148
-Ref: 103504971183
-Ref: 103514971213
-Ref: 103524971285
-Ref: 103534971329
-Ref: 103544971417
-Ref: 103554971451
-Ref: 103564971486
-Ref: 103574971535
-Ref: 103584971601
-Ref: 103594971636
-Ref: 103604971664
-Ref: 103614971703
-Ref: 103624971747
-Ref: 103634971770
-Ref: 103644971936
-Ref: 103654971972
-Ref: 103664971994
-Ref: 103674972024
-Ref: 103684972060
-Ref: 103694972152
-Ref: 103704972166
-Ref: 103714972180
-Ref: 103724972212
-Ref: 103734972262
-Ref: 103744972318
-Ref: 103754972384
-Ref: 103764972405
-Ref: 103774972429
-Ref: 103784972461
-Ref: 103794972500
-Ref: 103804972549
-Ref: 103814972617
-Ref: 103824972645
-Ref: 103834972718
-Ref: 103844972788
-Ref: 103854972811
-Ref: 103864972902
-Ref: 103874972908
-Ref: 103884973007
-Ref: 103894973070
-Ref: 103904973094
-Ref: 103914973193
-Ref: 103924973270
-Ref: 103934973336
-Ref: 103944973362
-Ref: 103954973388
-Ref: 103964973420
-Ref: 103974973511
-Ref: 103984973528
-Ref: 103994973566
-Ref: 104004973583
-Ref: 104014973624
-Ref: 104024973709
-Ref: 104034973780
-Ref: 104044973808
-Ref: 104054973835
-Ref: 104064973914
-Ref: 104074973932
-Ref: 104084974012
-Ref: 104094974029
-Ref: 104104974186
-Ref: 104114974227
-Ref: 104124974325
-Ref: 104134974350
-Ref: 104144974436
-Ref: 104154974463
-Ref: 104164974560
-Ref: 104174974603
-Ref: 104184974718
-Ref: 104194974767
-Ref: 104204974854
-Ref: 104214974876
-Ref: 104224974957
-Ref: 104234974983
-Ref: 104244975044
-Ref: 104254975122
-Ref: 104264975135
-Ref: 104274975186
-Ref: 104284975262
-Ref: 104294975277
-Ref: 104304975299
-Ref: 104314975314
-Ref: 104324975376
-Ref: 104334975410
-Ref: 104344975447
-Ref: 104354975548
-Ref: 104364975575
-Ref: 104374975605
-Ref: 104384975629
-Ref: 104394975725
-Ref: 104404975762
-Ref: 104414975799
-Ref: 104424975880
-Ref: 104434975898
-Ref: 104444975959
-Ref: 104454976011
-Ref: 104464976069
-Ref: 104474976083
-Ref: 104484976137
-Ref: 104494976159
-Ref: 104504976269
-Ref: 104514976296
-Ref: 104524976385
-Ref: 104534976412
-Ref: 104544976460
-Ref: 104554976483
-Ref: 104564976503
-Ref: 104574976526
-Ref: 104584976608
-Ref: 104594976638
-Ref: 104604976687
-Ref: 104614976781
-Ref: 104624976825
-Ref: 104634976913
-Ref: 104644976957
-Ref: 104654977055
-Ref: 104664977099
-Ref: 104674977171
-Ref: 104684977189
-Ref: 104694977252
-Ref: 104704977298
-Ref: 104714977392
-Ref: 104724977443
-Ref: 104734977471
-Ref: 104744977552
-Ref: 104754977585
-Ref: 104764977605
-Ref: 104774977642
-Ref: 104784977725
-Ref: 104794977801
-Ref: 104804977896
-Ref: 104814977914
-Ref: 104824977989
-Ref: 104834978007
-Ref: 104844978081
-Ref: 104854978114
-Ref: 104864978219
-Ref: 104874978240
-Ref: 104884978279
-Ref: 104894978370
-Ref: 104904978391
-Ref: 104914978472
-Ref: 104924978517
-Ref: 104934978607
-Ref: 104944978644
-Ref: 104954978679
-Ref: 104964978720
-Ref: 104974978817
-Ref: 104984978881
-Ref: 104994978887
-Ref: 105004978926
-Ref: 105014978960
-Ref: 105024979002
-Ref: 105034979068
-Ref: 105044979074
-Ref: 105054979113
-Ref: 105064979147
-Ref: 105074979188
-Ref: 105084979246
-Ref: 105094979252
-Ref: 105104979291
-Ref: 105114979373
-Ref: 105124979396
-Ref: 105134979502
-Ref: 105144979520
-Ref: 105154979623
-Ref: 105164979645
-Ref: 105174979671
-Ref: 105184979684
-Ref: 105194979691
-Ref: 105204979731
-Ref: 105214979801
-Ref: 105224979828
-Ref: 105234979834
-Ref: 105244979850
-Ref: 105254979873
-Ref: 105264979907
-Ref: 105274979940
-Ref: 105284979967
-Ref: 105294979972
-Ref: 105304979994
-Ref: 105314980034
-Ref: 105324980122
-Ref: 105334980166
-Ref: 105344980278
-Ref: 105354980298
-Ref: 105364980320
-Ref: 105374980363
-Ref: 105384980465
-Ref: 105394980485
-Ref: 105404980581
-Ref: 105414980623
-Ref: 105424980665
-Ref: 105434980708
-Ref: 105444980757
-Ref: 105454980799
-Ref: 105464980843
-Ref: 105474980893
-Ref: 105484980942
-Ref: 105494980982
-Ref: 105504981023
-Ref: 105514981269
-Ref: 105524981288
-Ref: 105534981839
-Ref: 105544981922
-Ref: 105554982009
-Ref: 105564982094
-Ref: 105574982150
-Ref: 105584982273
-Ref: 105594982302
-Ref: 105604982336
-Ref: 105614982443
-Ref: 105624982481
-Ref: 105634982515
-Ref: 105644982586
-Ref: 105654982653
-Ref: 105664982737
-Ref: 105674982780
-Ref: 105684982786
-Ref: 105694982833
-Ref: 105704982949
-Ref: 105714982980
-Ref: 105724983010
-Ref: 105734983128
-Ref: 105744983182
-Ref: 105754983245
-Ref: 105764983286
-Ref: 105774983333
-Ref: 105784983375
-Ref: 105794983425
-Ref: 105804983450
-Ref: 105814983462
-Ref: 105824983509
-Ref: 105834983580
-Ref: 105844983596
-Ref: 105854983634
-Ref: 105864983650
-Ref: 105874983721
-Ref: 105884983789
-Ref: 105894983796
-Ref: 105904983809
-Ref: 105914983893
-Ref: 105924983904
-Ref: 105934983929
-Ref: 105944983956
-Ref: 105954983967
-Ref: 105964983992
-Ref: 105974984089
-Ref: 105984984104
-Ref: 105994984178
-Ref: 106004984282
-Ref: 106014984316
-Ref: 106024984342
-Ref: 106034984451
-Ref: 106044984465
-Ref: 106054984480
-Ref: 106064984493
-Ref: 106074984550
-Ref: 106084984609
-Ref: 106094984674
-Ref: 106104984736
-Ref: 106114984826
-Ref: 106124984903
-Ref: 106134984947
-Ref: 106144984961
-Ref: 106154985059
-Ref: 106164985066
-Ref: 106174985135
-Ref: 106184985154
-Ref: 106194985220
-Ref: 106204985239
-Ref: 106214985304
-Ref: 106224985341
-Ref: 106234985341
-Ref: 106244985341
-Ref: 106254985341
-Ref: 106264985341
-Node: Annex Q5030910
-Node: Q.15031506
-Ref: 106275031737
-Node: Q.25043086
-Ref: 106285043359
-Ref: 106295043359
-Node: Q.35059286
-Ref: 106305059538
-Node: Q.45126616
-Ref: 106315126865
-Node: Q.55130518
-Ref: 106325130800
-Ref: 106335130800
-Ref: 106345130800
-Node: Index5154699
-Node: operators5154994
-Node: A5156443
-Node: B5195204
-Node: C5203193
-Node: D5238931
-Node: E5260449
-Node: F5302806
-Node: G5316272
-Node: H5324180
-Node: I5328448
-Node: J5361532
-Node: K5361723
-Node: L5362502
-Node: M5378013
-Node: N5387597
-Node: O5402255
-Node: P5409666
-Node: Q5436854
-Node: R5438658
-Node: S5460934
-Node: T5490987
-Node: U5509241
-Node: V5520504
-Node: W5524629
-Node: X5531050
-Node: Y5531185
+Node: 0.313812
+Ref: 100137634
+Ref: 100237634
+Node: 0.9954572
+Node: 154797
+Ref: 100361179
+Node: 1.161740
+Node: 1.1.163785
+Node: 1.1.265350
+Ref: 100466066
+Ref: 100566382
+Ref: 100666382
+Ref: 100766382
+Ref: 100866862
+Ref: 100966862
+Ref: 101067330
+Ref: 101167330
+Ref: 101267330
+Ref: 101371865
+Ref: 101471870
+Ref: 101571870
+Ref: 101671870
+Ref: 101771870
+Ref: 101871976
+Ref: 101971977
+Ref: 102071977
+Ref: 102173068
+Ref: 102273068
+Ref: 102373068
+Ref: 102473108
+Ref: 102573110
+Ref: 102673477
+Ref: 102773477
+Ref: 102874328
+Ref: 102974328
+Ref: 103074328
+Ref: 103174328
+Ref: 103274379
+Ref: 103374381
+Ref: 103475132
+Ref: 103575132
+Ref: 103675132
+Ref: 103775132
+Ref: 103875665
+Ref: 103975665
+Ref: 104076011
+Ref: 104176011
+Ref: 104276134
+Ref: 104376766
+Ref: 104477325
+Ref: 104577486
+Ref: 104678171
+Ref: 104778171
+Ref: 104879596
+Ref: 104980388
+Ref: 105081422
+Ref: 105182060
+Ref: 105282679
+Ref: 105383430
+Ref: 105483772
+Ref: 105583922
+Ref: 105684904
+Ref: 105786457
+Ref: 105888130
+Ref: 105989088
+Ref: 106089397
+Ref: 106190402
+Ref: 106291802
+Ref: 106393340
+Ref: 106494373
+Ref: 106594708
+Ref: 106695668
+Ref: 106796081
+Ref: 106897043
+Ref: 106997447
+Ref: 107098537
+Ref: 107198802
+Node: 1.1.399122
+Ref: 107299364
+Ref: 107399425
+Ref: 1074102538
+Ref: 1075104229
+Ref: 1076104229
+Ref: 1077104356
+Ref: 1078112526
+Ref: 1079112526
+Ref: 1080112526
+Ref: 1081112526
+Ref: 1082112526
+Ref: 1083115011
+Node: 1.1.4117270
+Ref: 1084117754
+Ref: 1085117754
+Ref: 1086117754
+Ref: 1087117754
+Ref: 1088117754
+Ref: 1089119065
+Ref: 1090119398
+Ref: 1091119399
+Ref: 1092119399
+Ref: 1093119399
+Ref: 1094122253
+Ref: 1095122414
+Ref: 1096123108
+Ref: 1097123206
+Ref: 1098123783
+Ref: 1099123785
+Node: 1.1.5126977
+Ref: 1100127819
+Ref: 1101127824
+Ref: 1102127824
+Ref: 1103127824
+Ref: 1104128573
+Ref: 1105128578
+Ref: 1106129258
+Ref: 1107129321
+Ref: 1108129554
+Ref: 1109131189
+Ref: 1110131189
+Ref: 1111131816
+Ref: 1112131816
+Ref: 1113132612
+Ref: 1114133339
+Ref: 1115133528
+Node: 1.2134609
+Ref: 1116134757
+Ref: 1117134758
+Ref: 1118135112
+Ref: 1119135113
+Ref: 1120135113
+Ref: 1121135250
+Ref: 1122135250
+Ref: 1123135250
+Ref: 1124135390
+Ref: 1125135391
+Ref: 1126135391
+Ref: 1127135534
+Ref: 1128135535
+Ref: 1129135535
+Ref: 1130135674
+Ref: 1131135675
+Ref: 1132135675
+Ref: 1133135801
+Ref: 1134135801
+Ref: 1135135801
+Ref: 1136135937
+Ref: 1137135938
+Ref: 1138136089
+Ref: 1139136090
+Ref: 1140136090
+Ref: 1141136282
+Ref: 1142136283
+Ref: 1143136283
+Ref: 1144136474
+Ref: 1145136475
+Ref: 1146136475
+Ref: 1147136780
+Ref: 1148136781
+Ref: 1149136781
+Ref: 1150136895
+Ref: 1151136896
+Ref: 1152137129
+Node: 1.3137967
+Ref: 1153138109
+Ref: 1154138759
+Ref: 1155138761
+Ref: 1156138761
+Ref: 1157138761
+Ref: 1158139304
+Ref: 1159139305
+Ref: 1160139382
+Ref: 1161139384
+Ref: 1162139682
+Ref: 1163139683
+Ref: 1164139892
+Ref: 1165139894
+Ref: 1166140100
+Ref: 1167140101
+Ref: 1168140523
+Ref: 1169140525
+Ref: 1170140525
+Ref: 1171140525
+Node: 2140799
+Node: 2.1141538
+Ref: 1172141722
+Ref: 1173141981
+Ref: 1174141981
+Ref: 1175144837
+Ref: 1176145614
+Ref: 1177145772
+Ref: 1178146042
+Ref: 1179146202
+Ref: 1180146360
+Ref: 1181146512
+Ref: 1182146672
+Ref: 1183146843
+Ref: 1184147000
+Ref: 1185147155
+Ref: 1186147326
+Ref: 1187147477
+Ref: 1188147634
+Ref: 1189147791
+Ref: 1190147983
+Ref: 1191148327
+Ref: 1192148586
+Ref: 1193148806
+Ref: 1194148969
+Ref: 1195149184
+Ref: 1196152660
+Ref: 1197152661
+Ref: 1198152661
+Ref: 1199152661
+Ref: 1200152661
+Ref: 1201152661
+Ref: 1202152661
+Ref: 1203152661
+Ref: 1204152661
+Ref: 1205152661
+Ref: 1206152661
+Ref: 1207152661
+Ref: 1208152661
+Ref: 1209152661
+Ref: 1210152661
+Ref: 1211152661
+Ref: 1212152661
+Ref: 1213152661
+Ref: 1214152661
+Ref: 1215152661
+Ref: 1216152661
+Ref: 1217152661
+Ref: 1218152661
+Ref: 1219152661
+Ref: 1220152661
+Ref: 1221152661
+Ref: 1222152661
+Ref: 1223152661
+Ref: 1224152759
+Ref: 1225152760
+Ref: 1226157191
+Ref: 1227158682
+Ref: 1228159057
+Node: 2.2160799
+Ref: 1229161013
+Ref: 1230161086
+Ref: 1231161086
+Ref: 1232161593
+Ref: 1233161602
+Ref: 1234161958
+Ref: 1235163038
+Ref: 1236163185
+Ref: 1237164944
+Node: 2.3165155
+Ref: 1238165416
+Ref: S0002165416
+Ref: 1239165429
+Ref: 1240165447
+Ref: 1241165466
+Ref: 1242165578
+Ref: S0003165578
+Ref: S0004165578
+Ref: 1243165593
+Ref: 1244165620
+Ref: 1245165647
+Ref: 1246165674
+Ref: 1247165700
+Ref: 1248165723
+Ref: 1249165860
+Ref: S0005165860
+Ref: 1250165875
+Ref: 1251165902
+Ref: 1252165935
+Ref: 1253165960
+Ref: 1254166739
+Ref: 1255172380
+Ref: 1256172668
+Node: 2.4173643
+Ref: 1257173755
+Ref: 1258173835
+Ref: 1259173895
+Ref: 1260174017
+Ref: S0006174017
+Ref: 1261174021
+Ref: 1262174040
+Node: 2.4.1174257
+Ref: 1263174367
+Ref: 1264174535
+Ref: S0007174535
+Ref: 1265174539
+Ref: 1266174550
+Ref: 1267174560
+Ref: 1268174585
+Ref: S0008174585
+Ref: 1269174589
+Ref: 1270174598
+Ref: 1271174609
+Ref: 1272174632
+Ref: S0009174632
+Ref: 1273174643
+Ref: 1274174657
+Ref: 1275174713
+Ref: S0010174713
+Node: 2.4.2176054
+Ref: 1276176161
+Ref: 1277176162
+Ref: 1278176162
+Ref: 1279176162
+Ref: 1280176162
+Ref: 1281176162
+Ref: 1282176162
+Ref: 1283176162
+Ref: 1284176162
+Ref: 1285176162
+Ref: 1286176318
+Ref: S0011176318
+Ref: 1287176331
+Ref: 1288176338
+Ref: 1289176354
+Ref: 1290176372
+Ref: 1291176394
+Ref: S0012176394
+Ref: 1292176398
+Ref: 1293176428
+Ref: S0013176428
+Ref: 1294176441
+Ref: 1295176458
+Ref: 1296176469
+Ref: 1297176507
+Ref: S0014176507
+Ref: 1298176511
+Ref: 1299176590
+Node: 2.5177874
+Ref: 1300178156
+Ref: S0015178156
+Ref: 1301178162
+Node: 2.6178847
+Ref: 1302179250
+Ref: 1303179317
+Ref: S0016179317
+Ref: 1304179324
+Ref: 1305179363
+Ref: S0017179363
+Ref: 1306179394
+Ref: 1307179592
+Ref: 1308179911
+Node: 2.7181339
+Ref: 1309181573
+Ref: S0018181573
+Ref: 1310181599
+Node: 2.8182279
+Ref: 1311182373
+Ref: 1312183391
+Ref: S0019183391
+Ref: 1313183411
+Ref: 1314183424
+Ref: 1315183455
+Ref: 1316183557
+Ref: S0020183557
+Ref: 1317183591
+Ref: 1318183606
+Ref: 1319183640
+Ref: 1320183655
+Ref: 1321183694
+Ref: 1322183710
+Ref: 1323183743
+Ref: 1324183759
+Ref: 1325185327
+Ref: 1326185327
+Ref: 1327185403
+Ref: 1328185405
+Ref: 1329185764
+Ref: 1330185765
+Ref: 1331189925
+Ref: 1332189925
+Ref: 1333190153
+Ref: 1334195396
+Ref: 1335195644
+Ref: 1336196192
+Ref: 1337196997
+Ref: 1338196998
+Ref: 1339197003
+Ref: 1340197033
+Ref: 1341197034
+Ref: 1342197057
+Ref: 1343197058
+Ref: 1344197067
+Ref: 1345199956
+Node: 2.9200907
+Ref: 1346201184
+Ref: 1347203283
+Ref: 1348203794
+Ref: 1349204629
+Node: 3205290
+Node: 3.1205917
+Ref: 1350206009
+Ref: 1351206098
+Ref: 1352206562
+Ref: S0021206562
+Ref: 1353206577
+Ref: 1354206598
+Ref: 1355206628
+Ref: 1356206651
+Ref: 1357206680
+Ref: 1358206707
+Ref: 1359206749
+Ref: 1360206780
+Ref: 1361206822
+Ref: 1362206846
+Ref: 1363206877
+Ref: 1364206903
+Ref: 1365206933
+Ref: 1366206982
+Ref: S0022206982
+Ref: 1367206986
+Ref: 1368207047
+Ref: 1369207137
+Ref: 1370207139
+Ref: 1371207773
+Ref: 1372209195
+Ref: 1373209195
+Ref: 1374210741
+Ref: 1375210741
+Ref: 1376210741
+Ref: 1377211383
+Ref: 1378211819
+Ref: 1379211923
+Ref: 1380212024
+Ref: 1381212347
+Ref: 1382212584
+Ref: 1383213218
+Ref: 1384213302
+Ref: 1385213304
+Ref: 1386213668
+Ref: 1387213670
+Ref: 1388216135
+Ref: 1389216207
+Ref: 1390216278
+Ref: 1391217739
+Ref: 1392217812
+Ref: 1393218096
+Node: 3.2223869
+Ref: 1394224031
+Ref: 1395224031
+Ref: 1396224170
+Ref: 1397224929
+Ref: 1398224930
+Ref: 1399224975
+Ref: 1400225122
+Ref: 1401225175
+Ref: 1402225244
+Ref: 1403225245
+Ref: 1404225322
+Ref: 1405225495
+Ref: 1406229426
+Ref: 1407229573
+Ref: 1408229575
+Ref: 1409229685
+Ref: 1410230073
+Ref: 1411230074
+Ref: 1412230074
+Ref: 1413230785
+Ref: 1414231057
+Ref: 1415231300
+Ref: 1416231570
+Ref: 1417231570
+Ref: 1418232474
+Ref: 1419232593
+Ref: 1420232594
+Ref: 1421233085
+Ref: 1422233280
+Ref: 1423233280
+Ref: 1424233361
+Ref: 1425233361
+Ref: 1426233494
+Ref: 1427233532
+Ref: 1428233532
+Ref: 1429234962
+Ref: 1430234962
+Ref: 1431234962
+Ref: 1432234962
+Ref: 1433236517
+Ref: 1434237125
+Ref: 1435237217
+Ref: 1436237360
+Node: 3.2.1243423
+Ref: 1437243658
+Ref: S0023243658
+Ref: 1438243664
+Ref: 1439243696
+Ref: 1440243734
+Ref: 1441243769
+Ref: 1442243857
+Ref: S0024243857
+Ref: 1443243877
+Ref: 1444243898
+Ref: 1445243926
+Ref: 1446243962
+Ref: 1447243995
+Ref: 1448244027
+Ref: 1449244110
+Ref: S0025244110
+Ref: 1450244125
+Ref: 1451244157
+Ref: 1452244191
+Ref: 1453244216
+Ref: 1454244248
+Ref: 1455244275
+Ref: 1456244308
+Ref: 1457244336
+Ref: 1458244539
+Ref: 1459244973
+Ref: 1460245098
+Ref: 1461245293
+Ref: 1462246106
+Ref: 1463246319
+Ref: 1464246394
+Ref: 1465247062
+Ref: 1466247553
+Ref: 1467248494
+Ref: 1468248593
+Ref: 1469252126
+Node: 3.2.2252259
+Ref: 1470252599
+Ref: S0026252599
+Ref: 1471252620
+Ref: 1472252643
+Ref: 1473252676
+Ref: 1474252758
+Ref: S0027252758
+Ref: 1475252765
+Ref: 1476252787
+Ref: 1477252801
+Ref: 1478252833
+Ref: S0028252833
+Ref: 1479252848
+Ref: 1480253169
+Ref: S0029253169
+Ref: 1481253173
+Ref: 1482253194
+Ref: 1483253240
+Ref: S0030253240
+Ref: 1484253255
+Ref: 1485253274
+Ref: 1486253294
+Ref: 1487253339
+Ref: S0031253339
+Ref: 1488253354
+Ref: 1489253373
+Ref: 1490253498
+Ref: 1491253963
+Ref: 1492254058
+Ref: 1493254417
+Ref: 1494254417
+Ref: 1495254870
+Ref: 1496255170
+Ref: 1497256657
+Ref: 1498257488
+Ref: 1499257702
+Node: 3.2.3257833
+Ref: 1500258059
+Ref: 1501258288
+Ref: 1502258462
+Ref: 1503259702
+Ref: 1504260564
+Ref: 1505262027
+Ref: 1506262181
+Ref: 1507262571
+Node: 3.2.4263994
+Ref: 1508264410
+Ref: 1509264410
+Ref: 1510264410
+Ref: 1511264410
+Ref: 1512264410
+Ref: 1513264410
+Ref: 1514264410
+Ref: 1515265031
+Ref: 1516265826
+Ref: 1517265826
+Ref: 1518265826
+Ref: 1519268993
+Ref: 1520268993
+Ref: 1521273156
+Ref: 1522274052
+Ref: 1523274052
+Ref: 1524276455
+Ref: 1525276455
+Ref: 1526276455
+Ref: 1527276455
+Ref: 1528277330
+Ref: 1529281306
+Ref: 1530281449
+Node: 3.3282754
+Ref: 1531282953
+Ref: 1532283267
+Ref: 1533284323
+Ref: 1534284324
+Ref: 1535284324
+Ref: 1536284324
+Ref: 1537284324
+Ref: 1538284324
+Ref: 1539284796
+Ref: 1540284964
+Ref: 1541285106
+Ref: 1542287589
+Ref: 1543287689
+Ref: 1544287691
+Ref: 1545287869
+Ref: 1546287871
+Ref: 1547288592
+Ref: 1548288592
+Ref: 1549290812
+Ref: 1550291685
+Ref: 1551294048
+Node: 3.3.1295439
+Ref: 1552295583
+Ref: 1553295584
+Ref: 1554295584
+Ref: 1555295748
+Ref: 1556295750
+Ref: 1557295750
+Ref: 1558296051
+Ref: S0032296051
+Ref: 1559296065
+Ref: 1560296113
+Ref: 1561296142
+Ref: 1562296168
+Ref: 1563296200
+Ref: 1564296248
+Ref: 1565296276
+Ref: 1566296302
+Ref: 1567296334
+Ref: 1568296382
+Ref: 1569296414
+Ref: 1570296440
+Ref: 1571296472
+Ref: 1572296505
+Ref: 1573296566
+Ref: S0033296566
+Ref: 1574296578
+Ref: 1575296601
+Ref: 1576296674
+Ref: 1577296815
+Ref: 1578296875
+Ref: 1579297376
+Ref: 1580297466
+Ref: 1581298179
+Ref: 1582298624
+Ref: 1583299183
+Ref: 1584299480
+Ref: 1585299541
+Ref: 1586299543
+Ref: 1587299645
+Ref: 1588299647
+Ref: 1589299734
+Ref: 1590300348
+Ref: 1591301245
+Ref: 1592302213
+Ref: 1593302960
+Ref: 1594303191
+Ref: 1595303432
+Ref: 1596303434
+Ref: 1597303658
+Ref: 1598305497
+Ref: 1599309248
+Ref: 1600310808
+Ref: 1601310809
+Ref: 1602312777
+Ref: 1603314854
+Ref: 1604315679
+Ref: 1605315889
+Ref: 1606316669
+Node: 3.3.2317161
+Ref: 1607317378
+Ref: 1608317862
+Ref: S0034317862
+Ref: 1609317877
+Ref: 1610317925
+Ref: 1611317989
+Ref: 1612318693
+Ref: 1613318746
+Ref: 1614319485
+Node: 3.4320369
+Ref: 1615320562
+Ref: 1616320738
+Ref: 1617321402
+Ref: 1618321403
+Ref: 1619322217
+Ref: S0035322217
+Ref: 1620322265
+Ref: 1621322290
+Ref: 1622322312
+Ref: 1623322477
+Ref: 1624322478
+Ref: 1625323953
+Ref: 1626326566
+Ref: 1627328275
+Ref: 1628328275
+Ref: 1629328453
+Ref: 1630329253
+Ref: 1631332236
+Ref: 1632332237
+Ref: 1633332613
+Ref: 1634332614
+Ref: 1635332614
+Ref: 1636336067
+Ref: 1637336413
+Ref: 1638336982
+Ref: 1639339469
+Ref: 1640340421
+Ref: 1641342503
+Ref: 1642342979
+Ref: 1643343715
+Ref: 1644344419
+Ref: 1645344861
+Ref: 1646345351
+Ref: 1647348895
+Ref: 1648349463
+Ref: 1649350569
+Ref: 1650351540
+Ref: 1651352599
+Node: 3.4.1353625
+Ref: 1652353947
+Ref: 1653354264
+Ref: 1654354266
+Ref: 1655354266
+Ref: 1656355206
+Ref: 1657355669
+Ref: 1658356298
+Ref: 1659357305
+Ref: 1660357633
+Ref: 1661357633
+Ref: 1662357633
+Ref: 1663357633
+Ref: 1664360532
+Ref: 1665360532
+Ref: 1666360691
+Ref: 1667360876
+Ref: 1668361242
+Ref: 1669361333
+Ref: 1670361335
+Ref: 1671363438
+Node: 3.5365217
+Ref: 1672365321
+Ref: 1673365394
+Ref: 1674365461
+Ref: 1675365541
+Ref: 1676365764
+Ref: S0036365764
+Ref: 1677365776
+Ref: 1678365795
+Ref: S0037365795
+Ref: 1679365801
+Ref: 1680365837
+Ref: 1681365858
+Ref: 1682366122
+Ref: 1683366122
+Ref: 1684366122
+Ref: 1685366122
+Ref: 1686366329
+Ref: 1687366529
+Ref: 1688366649
+Ref: 1689366728
+Ref: 1690366889
+Ref: 1691367118
+Ref: 1692368839
+Ref: 1693369539
+Ref: 1694370328
+Ref: 1695370328
+Ref: 1696370402
+Ref: 1697370643
+Ref: 1698370793
+Ref: 1699371614
+Ref: 1700371692
+Ref: 1701371946
+Ref: 1702371946
+Ref: 1703372177
+Ref: 1704372192
+Ref: 1705372408
+Ref: 1706372423
+Ref: 1707372628
+Ref: 1708372643
+Ref: 1709372709
+Ref: 1710372724
+Ref: 1711372880
+Ref: 1712372893
+Ref: 1713372908
+Ref: 1714373213
+Ref: 1715373563
+Ref: 1716373578
+Ref: 1717373868
+Ref: 1718373883
+Ref: 1719374054
+Ref: 1720374221
+Ref: 1721374222
+Ref: 1722374716
+Ref: 1723374717
+Ref: 1724375195
+Ref: 1725375210
+Ref: 1726375381
+Ref: 1727375548
+Ref: 1728375549
+Ref: 1729376057
+Ref: 1730376058
+Ref: 1731376554
+Ref: 1732376569
+Ref: 1733376811
+Ref: 1734377707
+Ref: 1735378539
+Ref: 1736380959
+Ref: 1737380974
+Ref: 1738381278
+Ref: 1739382096
+Ref: 1740382111
+Ref: 1741383108
+Ref: 1742383123
+Ref: 1743383449
+Ref: 1744383464
+Ref: 1745383723
+Ref: 1746383738
+Ref: 1747383997
+Ref: 1748384012
+Ref: 1749384470
+Ref: 1750384471
+Ref: 1751384977
+Ref: 1752384978
+Ref: 1753385829
+Ref: 1754386350
+Ref: 1755386351
+Ref: 1756387675
+Ref: 1757387891
+Ref: 1758387892
+Ref: 1759388097
+Ref: 1760388112
+Ref: 1761388541
+Ref: 1762388556
+Ref: 1763389022
+Ref: 1764389023
+Ref: 1765390169
+Ref: 1766390184
+Ref: 1767390578
+Ref: 1768390593
+Ref: 1769391049
+Ref: 1770391050
+Ref: 1771391717
+Ref: 1772391732
+Ref: 1773391942
+Ref: 1774391957
+Ref: 1775392152
+Ref: 1776392167
+Ref: 1777394144
+Ref: 1778394144
+Ref: 1779395340
+Ref: 1780397198
+Ref: 1781398298
+Ref: 1782399776
+Ref: 1783400444
+Ref: 1784401957
+Ref: 1785402178
+Node: 3.5.1402752
+Ref: 1786402865
+Ref: 1787403003
+Ref: S0038403003
+Ref: 1788403017
+Ref: 1789403054
+Ref: 1790403137
+Ref: S0039403137
+Ref: 1791403143
+Ref: 1792403165
+Ref: 1793403232
+Ref: S0040403232
+Ref: 1794403236
+Ref: 1795403998
+Ref: 1796405133
+Ref: 1797405474
+Ref: 1798405920
+Ref: 1799405920
+Ref: 1800405920
+Ref: 1801407947
+Node: 3.5.2408849
+Ref: 1802409017
+Ref: 1803409254
+Ref: 1804409255
+Ref: 1805409255
+Ref: 1806409255
+Ref: 1807409934
+Ref: 1808409936
+Ref: 1809410112
+Ref: 1810410113
+Ref: 1811410113
+Ref: 1812410630
+Ref: 1813410631
+Ref: 1814412933
+Ref: 1815413392
+Ref: 1816413959
+Ref: 1817414596
+Ref: 1818416920
+Ref: 1819418196
+Node: 3.5.3418198
+Ref: 1820418362
+Ref: 1821418467
+Ref: 1822418469
+Ref: 1823418559
+Node: 3.5.4419071
+Ref: 1824419189
+Ref: 1825419189
+Ref: 1826419189
+Ref: 1827419571
+Ref: 1828419646
+Ref: S0041419646
+Ref: 1829419650
+Ref: 1830419684
+Ref: 1831419752
+Ref: S0042419752
+Ref: 1832419772
+Ref: 1833419808
+Ref: 1834420614
+Ref: S0043420614
+Ref: 1835420632
+Ref: 1836420695
+Ref: 1837420827
+Ref: 1838421121
+Ref: 1839421121
+Ref: 1840421121
+Ref: 1841422023
+Ref: 1842422224
+Ref: 1843422226
+Ref: 1844423026
+Ref: 1845423033
+Ref: 1846423147
+Ref: 1847423149
+Ref: 1848423293
+Ref: 1849424752
+Ref: 1850424752
+Ref: 1851424965
+Ref: 1852424965
+Ref: 1853424965
+Ref: 1854425327
+Ref: 1855425329
+Ref: 1856427233
+Ref: 1857427416
+Ref: 1858427431
+Ref: 1859427769
+Ref: 1860427784
+Ref: 1861427941
+Ref: 1862428283
+Ref: 1863428283
+Ref: 1864428283
+Ref: 1865428475
+Ref: 1866428475
+Ref: 1867428475
+Ref: 1868428651
+Ref: 1869428745
+Ref: 1870429354
+Ref: 1871429354
+Ref: 1872430196
+Ref: 1873431154
+Ref: 1874432265
+Ref: 1875433712
+Ref: 1876434884
+Ref: 1877434884
+Ref: 1878436450
+Ref: 1879439073
+Node: 3.5.5439544
+Ref: 1880439815
+Ref: 1881439830
+Ref: 1882440154
+Ref: 1883440169
+Ref: 1884440349
+Ref: 1885440364
+Ref: 1886440474
+Ref: 1887440476
+Ref: 1888441377
+Ref: 1889441392
+Ref: 1890441654
+Ref: 1891441669
+Ref: 1892443186
+Ref: 1893444111
+Ref: 1894445772
+Ref: 1895446056
+Node: 3.5.6446387
+Ref: 1896446499
+Ref: 1897446728
+Ref: S0044446728
+Ref: 1898446741
+Ref: 1899446769
+Ref: 1900446841
+Ref: 1901447749
+Ref: 1902447749
+Ref: 1903447934
+Ref: 1904448247
+Ref: 1905449848
+Node: 3.5.7452010
+Ref: 1906452142
+Ref: 1907452364
+Ref: S0045452364
+Ref: 1908452392
+Ref: 1909452404
+Ref: 1910452462
+Ref: S0046452462
+Ref: 1911452489
+Ref: 1912452519
+Ref: 1913452589
+Ref: 1914452801
+Ref: 1915452861
+Ref: 1916453032
+Ref: 1917453249
+Ref: 1918454282
+Ref: 1919454434
+Ref: 1920455096
+Ref: 1921455232
+Ref: 1922455806
+Ref: 1923455941
+Ref: 1924455943
+Ref: 1925456560
+Ref: 1926456562
+Ref: 1927457223
+Ref: 1928457230
+Ref: 1929457407
+Ref: 1930457567
+Ref: 1931457726
+Ref: 1932457891
+Ref: 1933457891
+Ref: 1934458784
+Ref: 1935460572
+Node: 3.5.8462641
+Ref: 1936462932
+Ref: 1937462947
+Ref: 1938463571
+Node: 3.5.9464428
+Ref: 1939464555
+Ref: 1940464555
+Ref: 1941464555
+Ref: 1942464644
+Ref: 1943464834
+Ref: S0047464834
+Ref: 1944464838
+Ref: 1945464873
+Ref: 1946464949
+Ref: S0048464949
+Ref: 1947464977
+Ref: 1948464989
+Ref: 1949465052
+Ref: S0049465052
+Ref: 1950465080
+Ref: 1951465107
+Ref: 1952465119
+Ref: 1953465205
+Ref: S0050465205
+Ref: 1954465234
+Ref: 1955465253
+Ref: 1956465323
+Ref: 1957465527
+Ref: 1958465529
+Ref: 1959465529
+Ref: 1960466203
+Ref: 1961466319
+Ref: 1962466468
+Ref: 1963467803
+Ref: 1964467957
+Ref: 1965468249
+Ref: 1966468251
+Ref: 1967468553
+Ref: 1968468952
+Ref: 1969469011
+Ref: 1970469180
+Ref: 1971469182
+Ref: 1972469433
+Ref: 1973469934
+Ref: 1974469988
+Ref: 1975470367
+Ref: 1976472322
+Ref: 1977472422
+Ref: 1978472424
+Ref: 1979472664
+Ref: 1980475236
+Ref: 1981475592
+Ref: 1982476731
+Node: 3.5.10477574
+Ref: 1983477846
+Ref: 1984477861
+Ref: 1985478051
+Ref: 1986478053
+Ref: 1987478302
+Ref: 1988478302
+Ref: 1989478408
+Ref: 1990478423
+Ref: 1991478759
+Ref: 1992478774
+Ref: 1993479325
+Ref: 1994479340
+Ref: 1995479943
+Ref: 1996479958
+Ref: 1997480287
+Ref: 1998481422
+Ref: 1999481437
+Ref: 2000481552
+Ref: 2001481938
+Ref: 2002481953
+Ref: 2003482635
+Node: 3.6483457
+Ref: 2004483559
+Ref: 2005483559
+Ref: 2006483929
+Ref: S0051483929
+Ref: 2007483942
+Ref: 2008483975
+Ref: 2009484042
+Ref: S0052484042
+Ref: 2010484061
+Ref: 2011484089
+Ref: 2012484119
+Ref: 2013484178
+Ref: S0053484178
+Ref: 2014484182
+Ref: 2015484241
+Ref: S0054484241
+Ref: 2016484261
+Ref: 2017484292
+Ref: 2018484331
+Ref: 2019484387
+Ref: S0055484387
+Ref: 2020484403
+Ref: 2021484424
+Ref: 2022484533
+Ref: S0056484533
+Ref: 2023484556
+Ref: 2024484593
+Ref: 2025484663
+Ref: 2026484995
+Ref: 2027485111
+Ref: 2028485185
+Ref: 2029485381
+Ref: 2030485788
+Ref: 2031485788
+Ref: 2032485788
+Ref: 2033486403
+Ref: 2034486453
+Ref: 2035486515
+Ref: 2036486641
+Ref: 2037487116
+Ref: 2038487116
+Ref: 2039487371
+Ref: 2040487544
+Ref: 2041487544
+Ref: 2042487801
+Ref: 2043488670
+Ref: 2044488982
+Ref: 2045489287
+Ref: 2046489569
+Ref: 2047489887
+Ref: 2048490253
+Ref: 2049490640
+Ref: 2050491192
+Ref: 2051491192
+Ref: 2052492477
+Ref: 2053494309
+Ref: 2054495972
+Ref: 2055496685
+Node: 3.6.1496963
+Ref: 2056497321
+Ref: S0057497321
+Ref: 2057497328
+Ref: 2058497346
+Ref: 2059497385
+Ref: S0058497385
+Ref: 2060497401
+Ref: 2061497422
+Ref: 2062497480
+Ref: 2063497596
+Ref: 2064498294
+Ref: 2065498480
+Ref: 2066498683
+Ref: 2067498804
+Ref: 2068499125
+Ref: 2069499239
+Ref: 2070500683
+Node: 3.6.2501666
+Ref: 2071502565
+Ref: 2072502580
+Ref: 2073502709
+Ref: 2074502724
+Ref: 2075502851
+Ref: 2076502866
+Ref: 2077502993
+Ref: 2078503008
+Ref: 2079503135
+Ref: 2080503150
+Ref: 2081503283
+Ref: 2082503298
+Ref: 2083503452
+Ref: 2084503467
+Ref: 2085503634
+Ref: 2086503649
+Ref: 2087504912
+Node: 3.6.3506044
+Ref: 2088506192
+Ref: 2089507834
+Ref: 2090508123
+Ref: 2091508427
+Ref: 2092508797
+Ref: 2093509298
+Node: 3.7509344
+Ref: 2094509515
+Ref: 2095509515
+Ref: 2096509516
+Ref: 2097510389
+Ref: 2098510390
+Ref: 2099512759
+Ref: S0059512759
+Ref: 2100512763
+Ref: 2101512792
+Ref: 2102512855
+Ref: S0060512855
+Ref: 2103512896
+Ref: S0061512896
+Ref: 2104512910
+Ref: 2105512940
+Ref: 2106513036
+Ref: S0062513036
+Ref: 2107513049
+Ref: 2108513077
+Ref: 2109513093
+Ref: 2110513110
+Ref: 2111513144
+Ref: 2112513171
+Ref: 2113513193
+Ref: 2114513245
+Ref: S0063513245
+Ref: 2115513249
+Ref: 2116513313
+Ref: 2117513804
+Ref: 2118515182
+Ref: 2119517910
+Ref: 2120524894
+Ref: 2121525198
+Ref: 2122525646
+Ref: 2123526274
+Ref: 2124528950
+Ref: 2125528950
+Ref: 2126528950
+Ref: 2127528950
+Ref: 2128529071
+Ref: 2129529073
+Ref: 2130529436
+Ref: 2131529438
+Ref: 2132531819
+Ref: 2133533160
+Ref: 2134537539
+Ref: 2135540140
+Ref: 2136540738
+Node: 3.7.1541090
+Ref: 2137541626
+Ref: S0064541626
+Ref: 2138541640
+Ref: 2139541668
+Ref: 2140541727
+Ref: S0065541727
+Ref: 2141541756
+Ref: 2142541788
+Ref: 2143541813
+Ref: 2144541827
+Ref: 2145541938
+Ref: 2146542288
+Ref: 2147542376
+Ref: 2148542660
+Ref: 2149543535
+Ref: 2150545955
+Ref: 2151546508
+Ref: 2152546678
+Ref: 2153547032
+Ref: 2154548628
+Ref: 2155549491
+Node: 3.7.2551031
+Ref: 2156551732
+Ref: 2157551747
+Ref: 2158554158
+Ref: 2159555066
+Node: 3.8556516
+Ref: 2160556620
+Ref: 2161556620
+Ref: 2162556783
+Ref: 2163556857
+Ref: S0066556857
+Ref: 2164556892
+Ref: 2165556941
+Ref: S0067556941
+Ref: 2166556974
+Ref: 2167557052
+Ref: S0068557052
+Ref: 2168557068
+Ref: 2169557084
+Ref: 2170557111
+Ref: 2171557127
+Ref: 2172557240
+Ref: S0069557240
+Ref: 2173557244
+Ref: 2174557269
+Ref: 2175557341
+Ref: S0070557341
+Ref: 2176557354
+Ref: 2177557381
+Ref: 2178557406
+Ref: 2179557446
+Ref: 2180557521
+Ref: 2181557777
+Ref: 2182559367
+Ref: 2183561631
+Ref: 2184561632
+Ref: 2185561756
+Ref: 2186561977
+Ref: 2187562448
+Ref: 2188562596
+Ref: 2189562700
+Ref: 2190562847
+Ref: 2191563389
+Ref: 2192563390
+Ref: 2193563390
+Ref: 2194563806
+Ref: 2195564772
+Ref: 2196566659
+Ref: 2197567681
+Ref: 2198569458
+Ref: 2199569570
+Ref: 2200570428
+Node: 3.8.1570620
+Ref: 2201570973
+Ref: 2202571689
+Ref: S0071571689
+Ref: 2203571722
+Ref: 2204571749
+Ref: 2205571769
+Ref: 2206571811
+Ref: S0072571811
+Ref: 2207571829
+Ref: 2208571864
+Ref: 2209571907
+Ref: S0073571907
+Ref: 2210571911
+Ref: 2211571931
+Ref: 2212572032
+Ref: S0074572032
+Ref: 2213572036
+Ref: 2214572068
+Ref: 2215572095
+Ref: 2216572162
+Ref: 2217572381
+Ref: 2218573235
+Ref: 2219574905
+Ref: 2220576924
+Ref: 2221576924
+Ref: 2222579177
+Ref: 2223580167
+Ref: 2224581310
+Ref: 2225581714
+Node: 3.9582877
+Ref: 2226583023
+Ref: 2227583023
+Ref: 2228583024
+Ref: 2229583024
+Ref: 2230583024
+Ref: 2231583185
+Ref: 2232583187
+Ref: 2233583187
+Ref: 2234589189
+Ref: 2235589592
+Ref: 2236589594
+Ref: 2237589726
+Ref: 2238589727
+Ref: 2239589727
+Ref: 2240591708
+Ref: 2241592047
+Ref: 2242592118
+Ref: 2243592120
+Ref: 2244592120
+Ref: 2245592120
+Ref: 2246592793
+Ref: 2247595728
+Ref: 2248595798
+Ref: 2249595912
+Ref: 2250595989
+Ref: 2251596045
+Ref: 2252596111
+Ref: 2253596187
+Ref: 2254596242
+Ref: 2255596342
+Ref: 2256596422
+Ref: 2257596563
+Ref: 2258596648
+Ref: 2259596751
+Ref: 2260596855
+Ref: 2261596900
+Ref: 2262603799
+Ref: 2263605018
+Ref: 2264605757
+Ref: 2265605772
+Ref: 2266606027
+Ref: 2267606042
+Ref: 2268607144
+Ref: 2269607159
+Ref: 2270607681
+Ref: 2271607696
+Ref: 2272608268
+Ref: 2273609439
+Ref: 2274609737
+Ref: 2275610077
+Ref: 2276610494
+Ref: 2277611056
+Ref: 2278611176
+Ref: 2279612865
+Ref: 2280619352
+Ref: 2281619352
+Ref: 2282619683
+Ref: 2283619825
+Ref: 2284621635
+Ref: 2285622310
+Ref: 2286623174
+Ref: 2287623879
+Node: 3.9.1624693
+Ref: 2288624835
+Ref: 2289624835
+Ref: 2290624836
+Ref: 2291624836
+Ref: 2292624836
+Ref: 2293624836
+Ref: 2294625496
+Ref: S0075625496
+Ref: 2295625506
+Ref: 2296625930
+Ref: 2297630268
+Ref: 2298631138
+Ref: 2299631346
+Ref: 2300635189
+Ref: 2301635328
+Node: 3.9.2635828
+Ref: 2302636059
+Ref: 2303636060
+Ref: 2304636060
+Ref: 2305636060
+Ref: 2306636060
+Ref: 2307636060
+Ref: 2308636060
+Ref: 2309636060
+Ref: 2310637053
+Ref: 2311637055
+Ref: 2312637055
+Ref: 2313637055
+Ref: 2314637055
+Ref: 2315638314
+Ref: 2316638315
+Ref: 2317638434
+Ref: 2318638634
+Ref: 2319638889
+Ref: 2320638891
+Ref: 2321639324
+Ref: 2322639324
+Ref: 2323640293
+Ref: 2324640733
+Ref: 2325640995
+Ref: 2326644467
+Ref: 2327644594
+Ref: 2328649752
+Ref: 2329649752
+Ref: 2330649955
+Ref: 2331650309
+Ref: 2332650311
+Ref: 2333650435
+Ref: 2334653805
+Ref: 2335661511
+Ref: 2336661668
+Ref: 2337662605
+Node: 3.9.3665320
+Ref: 2338665506
+Ref: 2339665506
+Ref: 2340665507
+Ref: 2341665507
+Ref: 2342665643
+Ref: 2343665645
+Ref: 2344666983
+Ref: S0076666983
+Ref: 2345666998
+Ref: 2346667029
+Ref: 2347667080
+Ref: 2348667186
+Ref: 2349667187
+Ref: 2350668321
+Ref: 2351668322
+Ref: 2352673650
+Ref: 2353684299
+Ref: 2354687234
+Ref: 2355688503
+Ref: 2356689252
+Node: 3.9.4690143
+Ref: 2357691692
+Ref: S0077691692
+Ref: 2358691765
+Ref: 2359691878
+Ref: S0078691878
+Ref: 2360691895
+Ref: 2361691925
+Ref: 2362692076
+Ref: 2363692076
+Ref: 2364692427
+Ref: 2365692427
+Ref: 2366692428
+Ref: 2367692428
+Ref: 2368692428
+Ref: 2369692428
+Ref: 2370692428
+Ref: 2371692428
+Ref: 2372692428
+Ref: 2373692428
+Ref: 2374692914
+Ref: 2375692915
+Ref: 2376692915
+Ref: 2377692915
+Ref: 2378692915
+Ref: 2379692915
+Ref: 2380692915
+Ref: 2381694909
+Ref: 2382694910
+Ref: 2383698519
+Ref: 2384703995
+Node: 3.10704422
+Ref: 2385704530
+Ref: 2386704530
+Ref: 2387704530
+Ref: 2388704828
+Ref: 2389704830
+Ref: 2390705495
+Ref: S0079705495
+Ref: 2391705510
+Ref: 2392705526
+Ref: 2393705564
+Ref: 2394705580
+Ref: 2395705647
+Ref: S0080705647
+Ref: 2396705669
+Ref: 2397705694
+Ref: 2398705744
+Ref: S0081705744
+Ref: 2399705803
+Ref: S0082705803
+Ref: 2400705846
+Ref: 2401705902
+Ref: 2402705988
+Ref: S0083705988
+Ref: 2403706127
+Ref: S0084706127
+Ref: 2404706142
+Ref: 2405706176
+Ref: 2406706199
+Ref: 2407706244
+Ref: 2408706272
+Ref: 2409706316
+Ref: 2410706455
+Ref: 2411706456
+Ref: 2412706456
+Ref: 2413706456
+Ref: 2414706620
+Ref: 2415706801
+Ref: 2416707026
+Ref: 2417707026
+Ref: 2418707858
+Ref: 2419712286
+Ref: 2420712287
+Ref: 2421712491
+Ref: 2422712658
+Ref: 2423714805
+Ref: 2424714899
+Ref: 2425715006
+Ref: 2426719750
+Ref: 2427719751
+Ref: 2428719751
+Ref: 2429720252
+Ref: 2430720320
+Ref: 2431721250
+Ref: 2432722994
+Ref: 2433722995
+Ref: 2434726008
+Ref: 2435726217
+Ref: 2436726510
+Ref: 2437726807
+Ref: 2438728662
+Ref: 2439729482
+Ref: 2440730810
+Ref: 2441731548
+Node: 3.10.1734179
+Ref: 2442734859
+Ref: S0085734859
+Ref: 2443734874
+Ref: 2444734895
+Ref: 2445735037
+Ref: 2446735038
+Ref: 2447735332
+Ref: 2448735332
+Ref: 2449737813
+Ref: 2450740051
+Ref: 2451745885
+Ref: 2452746338
+Ref: 2453748419
+Ref: 2454750765
+Ref: 2455751902
+Ref: 2456752936
+Node: 3.10.2754765
+Ref: 2457756003
+Ref: 2458756687
+Ref: 2459756689
+Ref: 2460758554
+Ref: 2461758555
+Ref: 2462758555
+Ref: 2463758555
+Ref: 2464758555
+Ref: 2465758555
+Ref: 2466760049
+Ref: 2467760051
+Ref: 2468760055
+Ref: 2469760055
+Ref: 2470765172
+Ref: 2471765172
+Ref: 2472765172
+Ref: 2473775666
+Ref: 2474775667
+Ref: 2475777420
+Ref: 2476778982
+Ref: 2477781608
+Ref: 2478781608
+Ref: 2479786406
+Ref: 2480786406
+Ref: 2481804444
+Ref: 2482804459
+Ref: 2483804782
+Ref: 2484809022
+Ref: 2485810825
+Ref: 2486811948
+Ref: 2487811953
+Ref: 2488811968
+Ref: 2489811968
+Ref: 2490813200
+Ref: 2491813622
+Ref: 2492813637
+Ref: 2493813973
+Ref: 2494814067
+Ref: 2495814412
+Ref: 2496816246
+Ref: 2497816246
+Ref: 2498818027
+Ref: 2499818386
+Ref: 2500819654
+Ref: 2501819655
+Ref: 2502821371
+Ref: 2503821836
+Ref: 2504824666
+Ref: 2505826341
+Ref: 2506827490
+Ref: 2507829922
+Node: 3.11832183
+Ref: 2508832419
+Ref: S0086832419
+Ref: 2509832425
+Ref: 2510832467
+Ref: S0087832467
+Ref: 2511832481
+Ref: 2512832506
+Ref: 2513832602
+Ref: S0088832602
+Ref: 2514832616
+Ref: 2515832636
+Ref: 2516832652
+Ref: 2517832675
+Ref: S0089832675
+Ref: 2518832679
+Ref: 2519832694
+Ref: 2520832723
+Ref: S0090832723
+Ref: 2521832737
+Ref: 2522832755
+Ref: 2523832770
+Ref: 2524832782
+Ref: 2525832990
+Ref: 2526833041
+Ref: 2527833206
+Ref: 2528833858
+Ref: 2529833858
+Ref: 2530834265
+Ref: 2531835513
+Ref: 2532837543
+Ref: 2533837548
+Ref: 2534837712
+Node: 3.11.1840064
+Ref: 2535840310
+Ref: 2536840387
+Ref: 2537840537
+Ref: 2538842872
+Ref: 2539843004
+Ref: 2540844855
+Node: 4846976
+Node: 4.1847540
+Ref: 2541848154
+Ref: S0091848154
+Ref: 2542848169
+Ref: 2543848185
+Ref: 2544848216
+Ref: 2545848238
+Ref: 2546848254
+Ref: 2547848277
+Ref: 2548848307
+Ref: 2549848327
+Ref: 2550848351
+Ref: 2551848373
+Ref: 2552848404
+Ref: 2553848430
+Ref: 2554848470
+Ref: S0092848470
+Ref: 2555848474
+Ref: 2556848488
+Ref: 2557848776
+Ref: S0093848776
+Ref: 2558848780
+Ref: 2559848788
+Ref: 2560848837
+Ref: S0094848837
+Ref: 2561848841
+Ref: 2562848879
+Ref: S0095848879
+Ref: 2563848883
+Ref: 2564849236
+Ref: 2565849236
+Ref: 2566849439
+Ref: 2567850348
+Ref: 2568851709
+Ref: 2569852388
+Ref: 2570852555
+Ref: 2571852638
+Ref: 2572852819
+Ref: 2573852984
+Ref: 2574852986
+Ref: 2575853058
+Ref: 2576854162
+Ref: 2577858435
+Node: 4.1.1859772
+Ref: 2578859982
+Ref: 2579860052
+Ref: S0096860052
+Ref: 2580860056
+Ref: 2581860064
+Ref: 2582860078
+Ref: 2583860457
+Ref: 2584860702
+Ref: 2585860990
+Ref: 2586861101
+Ref: 2587861177
+Ref: 2588861179
+Ref: 2589861179
+Ref: 2590861309
+Node: 4.1.2862438
+Ref: 2591862543
+Ref: 2592862820
+Ref: S0097862820
+Ref: 2593862824
+Ref: 2594862832
+Ref: 2595863007
+Ref: 2596863500
+Ref: 2597863601
+Ref: 2598863601
+Ref: 2599863603
+Ref: 2600863603
+Ref: 2601863810
+Node: 4.1.3865350
+Ref: 2602865666
+Ref: 2603865737
+Ref: S0098865737
+Ref: 2604865741
+Ref: 2605865751
+Ref: 2606865786
+Ref: S0099865786
+Ref: 2607865790
+Ref: 2608865804
+Ref: 2609865824
+Ref: 2610865892
+Ref: 2611870122
+Ref: 2612870127
+Ref: 2613873794
+Ref: 2614873876
+Ref: 2615873876
+Ref: 2616874068
+Ref: 2617874070
+Ref: 2618875732
+Ref: 2619876967
+Ref: 2620877242
+Node: 4.1.4878152
+Ref: 2621878264
+Ref: 2622878505
+Ref: S0100878505
+Ref: 2623878509
+Ref: 2624878517
+Ref: 2625878595
+Ref: S0101878595
+Ref: 2626878609
+Ref: 2627878630
+Ref: 2628878715
+Ref: S0102878715
+Ref: 2629878719
+Ref: 2630878727
+Ref: 2631878788
+Ref: S0103878788
+Ref: 2632878809
+Ref: 2633881843
+Ref: 2634881843
+Ref: 2635884938
+Ref: 2636884938
+Ref: 2637886914
+Ref: 2638888185
+Node: 4.1.5891264
+Ref: 2639891726
+Ref: 2640891726
+Ref: 2641891959
+Ref: 2642892015
+Ref: 2643892149
+Ref: 2644892591
+Ref: S0104892591
+Ref: 2645892620
+Ref: 2646892832
+Ref: 2647894062
+Ref: 2648894282
+Ref: 2649894284
+Ref: 2650894374
+Ref: 2651895688
+Ref: 2652895868
+Node: 4.1.6896210
+Ref: 2653896960
+Ref: 2654896960
+Ref: 2655897732
+Ref: 2656897732
+Ref: 2657898830
+Ref: 2658898908
+Ref: 2659900616
+Ref: S0105900616
+Ref: 2660900650
+Ref: 2661900657
+Ref: 2662900914
+Ref: 2663901207
+Ref: 2664901207
+Ref: 2665902023
+Ref: 2666902023
+Ref: 2667904303
+Node: 4.2904895
+Ref: 2668904992
+Ref: 2669905185
+Ref: 2670905653
+Ref: 2671905653
+Ref: 2672906362
+Ref: 2673907159
+Ref: 2674907159
+Ref: 2675907159
+Ref: 2676907210
+Ref: 2677907210
+Ref: 2678907210
+Ref: 2679907210
+Ref: 2680907302
+Ref: 2681907717
+Ref: 2682907717
+Ref: 2683908032
+Ref: 2684909008
+Ref: 2685909366
+Ref: 2686910098
+Node: 4.3910241
+Ref: 2687910342
+Ref: 2688910459
+Ref: 2689910520
+Ref: S0106910520
+Ref: 2690910524
+Ref: 2691910544
+Ref: 2692910566
+Ref: 2693910672
+Ref: 2694912297
+Ref: 2695912586
+Ref: 2696912657
+Ref: 2697913760
+Ref: 2698913760
+Ref: 2699913869
+Ref: 2700914374
+Ref: 2701914965
+Ref: 2702916067
+Node: 4.3.1916224
+Ref: 2703916557
+Ref: S0107916557
+Ref: 2704916563
+Ref: 2705916639
+Ref: S0108916639
+Ref: 2706916653
+Ref: 2707916685
+Ref: 2708916805
+Ref: S0109916805
+Ref: 2709916820
+Ref: 2710916846
+Ref: 2711916867
+Ref: 2712916924
+Ref: S0110916924
+Ref: 2713916951
+Ref: 2714916980
+Ref: 2715917015
+Ref: 2716917147
+Ref: 2717918740
+Ref: 2718919088
+Ref: 2719920624
+Ref: 2720920762
+Ref: 2721926607
+Ref: 2722926739
+Ref: 2723927020
+Ref: 2724927400
+Ref: 2725930167
+Ref: 2726930712
+Ref: 2727931159
+Ref: 2728931737
+Node: 4.3.2932795
+Ref: 2729933674
+Ref: S0111933674
+Ref: 2730933689
+Ref: 2731933708
+Ref: 2732933764
+Ref: S0112933764
+Ref: 2733933768
+Ref: 2734933782
+Ref: 2735933879
+Ref: 2736933975
+Ref: 2737935508
+Ref: 2738937408
+Ref: 2739937894
+Ref: 2740938507
+Ref: 2741938539
+Ref: 2742938540
+Ref: 2743938978
+Ref: 2744940544
+Ref: 2745940694
+Ref: 2746941420
+Ref: 2747942403
+Node: 4.3.3943288
+Ref: 2748944194
+Ref: S0113944194
+Ref: 2749944206
+Ref: 2750944235
+Ref: 2751944324
+Ref: S0114944324
+Ref: 2752944339
+Ref: 2753944351
+Ref: 2754944365
+Ref: 2755944388
+Ref: 2756944402
+Ref: 2757944425
+Ref: 2758944447
+Ref: 2759944461
+Ref: 2760944517
+Ref: S0115944517
+Ref: 2761944532
+Ref: 2762944563
+Ref: 2763944661
+Ref: S0116944661
+Ref: 2764944675
+Ref: 2765944699
+Ref: 2766944719
+Ref: 2767944749
+Ref: 2768944899
+Ref: 2769945091
+Ref: 2770945666
+Ref: 2771945963
+Ref: 2772946063
+Ref: 2773946520
+Ref: 2774946659
+Ref: 2775947387
+Ref: 2776952433
+Ref: 2777952685
+Ref: 2778952685
+Ref: 2779952953
+Ref: 2780952955
+Ref: 2781954193
+Ref: 2782955314
+Ref: 2783955314
+Ref: 2784955883
+Ref: 2785955884
+Ref: 2786956561
+Ref: 2787956561
+Ref: 2788956966
+Ref: 2789959235
+Ref: 2790959969
+Ref: 2791961609
+Ref: 2792962404
+Ref: 2793963150
+Node: 4.4963864
+Ref: 2794964048
+Ref: 2795964419
+Ref: 2796964421
+Ref: 2797964421
+Ref: 2798964421
+Ref: 2799964421
+Ref: 2800964421
+Ref: 2801964421
+Ref: 2802964421
+Ref: 2803964421
+Ref: 2804964421
+Ref: 2805964421
+Ref: 2806964421
+Ref: 2807964421
+Ref: 2808964421
+Ref: 2809964421
+Ref: 2810964421
+Ref: 2811964421
+Ref: 2812964421
+Ref: 2813964421
+Ref: 2814964421
+Ref: 2815964421
+Ref: 2816964421
+Ref: 2817964421
+Ref: 2818964421
+Ref: 2819964421
+Ref: 2820964421
+Ref: 2821964421
+Ref: 2822964421
+Ref: 2823964421
+Ref: 2824964421
+Ref: 2825964421
+Ref: 2826964421
+Ref: 2827964421
+Ref: 2828964421
+Ref: 2829964421
+Ref: 2830964421
+Ref: 2831964421
+Ref: 2832964421
+Ref: 2833964421
+Ref: 2834964421
+Ref: 2835964421
+Ref: 2836964421
+Ref: 2837964421
+Ref: 2838964421
+Ref: 2839964421
+Ref: 2840964421
+Ref: 2841964421
+Ref: 2842964421
+Ref: 2843964421
+Ref: 2844964421
+Ref: 2845964421
+Ref: 2846964421
+Ref: 2847964421
+Ref: 2848964421
+Ref: 2849964421
+Ref: 2850964421
+Ref: 2851964421
+Ref: 2852964421
+Ref: 2853964421
+Ref: 2854964421
+Ref: 2855964421
+Ref: 2856964421
+Ref: 2857964421
+Ref: 2858964421
+Ref: 2859964421
+Ref: 2860964421
+Ref: 2861964421
+Ref: 2862964421
+Ref: 2863964421
+Ref: 2864964421
+Ref: 2865964421
+Ref: 2866964421
+Ref: 2867964481
+Ref: S0117964481
+Ref: 2868964496
+Ref: 2869964510
+Ref: 2870964525
+Ref: 2871964544
+Ref: 2872964564
+Ref: 2873964577
+Ref: 2874964592
+Ref: 2875964610
+Ref: 2876964630
+Ref: 2877964644
+Ref: 2878964710
+Ref: S0118964710
+Ref: 2879964725
+Ref: 2880964746
+Ref: 2881964773
+Ref: 2882964793
+Ref: 2883964820
+Ref: 2884964841
+Ref: 2885964868
+Ref: 2886964894
+Ref: 2887964921
+Ref: 2888964946
+Ref: 2889965017
+Ref: S0119965017
+Ref: 2890965032
+Ref: 2891965051
+Ref: 2892965071
+Ref: 2893965194
+Ref: S0120965194
+Ref: 2894965209
+Ref: 2895965228
+Ref: 2896965248
+Ref: 2897965286
+Ref: 2898965313
+Ref: 2899965346
+Ref: 2900965424
+Ref: S0121965424
+Ref: 2901965428
+Ref: 2902965455
+Ref: 2903965562
+Ref: S0122965562
+Ref: 2904965576
+Ref: 2905965596
+Ref: 2906965604
+Ref: 2907965648
+Ref: S0123965648
+Ref: 2908965654
+Ref: 2909965677
+Ref: 2910965683
+Ref: 2911965712
+Ref: 2912965730
+Ref: S0124965730
+Ref: 2913965734
+Ref: 2914965743
+Ref: 2915965764
+Ref: 2916965786
+Ref: S0125965786
+Ref: 2917965790
+Ref: 2918965803
+Ref: 2919965818
+Ref: 2920965832
+Ref: 2921965943
+Ref: S0126965943
+Ref: 2922965956
+Ref: 2923965981
+Ref: 2924965998
+Ref: 2925966016
+Ref: 2926966023
+Ref: 2927966036
+Ref: 2928966057
+Ref: 2929966084
+Ref: 2930967271
+Ref: 2931967411
+Ref: 2932967411
+Ref: 2933967411
+Ref: 2934970234
+Ref: 2935971908
+Ref: 2936973049
+Node: 4.5973679
+Ref: 2937973830
+Ref: 2938973830
+Ref: 2939974198
+Ref: S0127974198
+Ref: 2940974250
+Ref: S0128974250
+Ref: 2941974319
+Ref: S0129974319
+Ref: 2942974371
+Ref: S0130974371
+Ref: 2943974416
+Ref: S0131974416
+Ref: 2944974482
+Ref: S0132974482
+Ref: 2945975480
+Ref: 2946975480
+Ref: 2947975639
+Ref: 2948975641
+Ref: 2949975641
+Ref: 2950975641
+Ref: 2951976212
+Ref: 2952976795
+Ref: 2953976992
+Node: 4.5.1979785
+Ref: 2954980010
+Ref: 2955980010
+Ref: 2956980010
+Ref: 2957980159
+Ref: 2958980584
+Ref: 2959980584
+Ref: 2960980584
+Ref: 2961980584
+Ref: 2962980584
+Ref: 2963980584
+Ref: 2964980584
+Ref: 2965980584
+Ref: 2966980771
+Ref: 2967981477
+Ref: 2968983553
+Ref: 2969983856
+Ref: 2970983856
+Ref: 2971984020
+Ref: 2972984022
+Ref: 2973984111
+Node: 4.5.2985035
+Ref: 2974985210
+Ref: 2975985210
+Ref: 2976985210
+Ref: 2977985211
+Ref: 2978985211
+Ref: 2979985303
+Ref: 2980985305
+Ref: 2981985454
+Ref: 2982985456
+Ref: 2983985456
+Ref: 2984985456
+Ref: 2985985456
+Ref: 2986985456
+Ref: 2987985456
+Ref: 2988985456
+Ref: 2989985456
+Ref: 2990985456
+Ref: 2991985456
+Ref: 2992985456
+Ref: 2993985456
+Ref: 2994985456
+Ref: 2995985456
+Ref: 2996985456
+Ref: 2997985456
+Ref: 2998985456
+Ref: 2999985456
+Ref: 3000985456
+Ref: 3001985456
+Ref: 3002985456
+Ref: 3003985456
+Ref: 3004985456
+Ref: 3005985456
+Ref: 3006985819
+Ref: 3007985820
+Ref: 3008985820
+Ref: 3009986274
+Ref: 3010986275
+Ref: 3011993993
+Ref: 3012995522
+Ref: 3013995925
+Ref: 3014998252
+Ref: 30151003544
+Ref: 30161003948
+Ref: 30171004767
+Ref: 30181004827
+Ref: 30191005117
+Ref: 30201006881
+Ref: 30211011972
+Ref: 30221013028
+Ref: 30231013892
+Ref: 30241014931
+Ref: 30251015309
+Ref: 30261016159
+Node: 4.5.31017632
+Ref: 30271017816
+Ref: 30281017816
+Ref: 30291017816
+Ref: 30301017816
+Ref: 30311017816
+Ref: 30321017816
+Ref: 30331017816
+Ref: 30341017816
+Ref: 30351017816
+Ref: 30361017816
+Ref: 30371018104
+Ref: 30381018104
+Ref: 30391018104
+Ref: 30401018104
+Ref: 30411018104
+Ref: 30421018104
+Ref: 30431018104
+Ref: 30441018537
+Ref: 30451019592
+Ref: 30461019594
+Ref: 30471019743
+Ref: 30481020112
+Ref: 30491020395
+Ref: 30501022145
+Ref: 30511022888
+Node: 4.5.41023224
+Ref: 30521023406
+Ref: 30531023406
+Ref: 30541023406
+Ref: 30551023406
+Ref: 30561023406
+Ref: 30571023406
+Ref: 30581023406
+Ref: 30591023406
+Ref: 30601023406
+Ref: 30611023406
+Node: 4.5.51023917
+Ref: 30621024097
+Ref: 30631024097
+Ref: 30641024097
+Ref: 30651024097
+Ref: 30661024097
+Ref: 30671024097
+Ref: 30681024097
+Ref: 30691024097
+Ref: 30701024097
+Ref: 30711024097
+Ref: 30721024097
+Ref: 30731024097
+Ref: 30741024097
+Ref: 30751024097
+Ref: 30761024097
+Ref: 30771024097
+Ref: 30781031017
+Ref: 30791031025
+Ref: 30801031025
+Ref: 30811031025
+Ref: 30821034055
+Ref: 30831034567
+Ref: 30841035457
+Node: 4.5.61036764
+Ref: 30851036958
+Ref: 30861036958
+Ref: 30871036958
+Ref: 30881036958
+Ref: 30891036958
+Ref: 30901037152
+Ref: 30911037152
+Ref: 30921037152
+Ref: 30931038040
+Ref: 30941038042
+Ref: 30951038042
+Ref: 30961038287
+Ref: 30971038287
+Ref: 30981038287
+Ref: 30991038287
+Ref: 31001038773
+Ref: 31011039582
+Ref: 31021039978
+Ref: 31031039978
+Ref: 31041040121
+Ref: 31051040296
+Node: 4.5.71041267
+Ref: 31061042878
+Ref: S01331042878
+Ref: 31071042882
+Ref: 31081042904
+Ref: 31091042997
+Ref: S01341042997
+Ref: 31101043018
+Ref: 31111043045
+Ref: 31121043071
+Ref: 31131043098
+Ref: 31141043136
+Ref: 31151043194
+Ref: S01351043194
+Ref: 31161043209
+Ref: 31171043272
+Ref: S01361043272
+Ref: 31181043303
+Ref: 31191043326
+Ref: 31201043366
+Ref: 31211043459
+Ref: S01371043459
+Ref: 31221043478
+Ref: 31231043527
+Ref: 31241047069
+Ref: 31251048529
+Ref: 31261048733
+Ref: 31271048733
+Ref: 31281048735
+Ref: 31291051325
+Ref: 31301051943
+Ref: 31311051943
+Ref: 31321051943
+Ref: 31331052083
+Ref: 31341052177
+Node: 4.5.81052234
+Ref: 31351052612
+Ref: S01381052612
+Ref: 31361052621
+Ref: 31371052638
+Ref: 31381052670
+Ref: 31391052693
+Ref: 31401052704
+Ref: 31411052730
+Ref: 31421052760
+Ref: S01391052760
+Ref: 31431052795
+Ref: S01401052795
+Ref: 31441052810
+Ref: 31451053570
+Ref: 31461053714
+Ref: 31471054180
+Ref: 31481055803
+Node: 4.61056116
+Ref: 31491056549
+Ref: 31501056551
+Ref: 31511056551
+Ref: 31521056551
+Ref: 31531056552
+Ref: 31541056552
+Ref: 31551056617
+Ref: S01411056617
+Ref: 31561056631
+Ref: 31571056644
+Ref: 31581056665
+Ref: 31591056678
+Ref: 31601056687
+Ref: 31611056772
+Ref: 31621056858
+Ref: 31631056922
+Ref: 31641057490
+Ref: 31651057491
+Ref: 31661057703
+Ref: 31671057704
+Ref: 31681057758
+Ref: 31691058590
+Ref: 31701061092
+Ref: 31711061093
+Ref: 31721061344
+Ref: 31731061345
+Ref: 31741063523
+Ref: 31751063524
+Ref: 31761063657
+Ref: 31771063658
+Ref: 31781063987
+Ref: 31791064104
+Ref: 31801064365
+Ref: 31811066867
+Ref: 31821066868
+Ref: 31831068069
+Ref: 31841068434
+Ref: 31851070882
+Ref: 31861071907
+Ref: 31871071908
+Ref: 31881072496
+Ref: 31891072497
+Ref: 31901072852
+Ref: 31911072937
+Ref: 31921073844
+Ref: 31931074927
+Ref: 31941075042
+Ref: 31951075042
+Ref: 31961075042
+Ref: 31971075239
+Ref: 31981075241
+Ref: 31991075241
+Ref: 32001075518
+Ref: 32011075518
+Ref: 32021076034
+Ref: 32031077968
+Ref: 32041077968
+Ref: 32051078142
+Ref: 32061078142
+Ref: 32071078183
+Ref: 32081078183
+Ref: 32091078530
+Ref: 32101078530
+Ref: 32111078779
+Ref: 32121079591
+Ref: 32131079593
+Ref: 32141079798
+Ref: 32151079798
+Ref: 32161080148
+Ref: 32171080150
+Ref: 32181080902
+Ref: 32191080903
+Ref: 32201081798
+Ref: 32211081798
+Ref: 32221082121
+Ref: 32231082121
+Ref: 32241082237
+Ref: 32251082237
+Ref: 32261082999
+Ref: 32271083001
+Ref: 32281084471
+Ref: 32291084472
+Ref: 32301084472
+Ref: 32311084472
+Ref: 32321084472
+Ref: 32331084472
+Ref: 32341084472
+Ref: 32351084472
+Ref: 32361084870
+Ref: 32371084870
+Ref: 32381085322
+Ref: 32391085488
+Ref: 32401085489
+Ref: 32411085489
+Ref: 32421085489
+Ref: 32431085489
+Ref: 32441085489
+Ref: 32451086553
+Ref: 32461087092
+Ref: 32471087306
+Ref: 32481087307
+Ref: 32491087307
+Ref: 32501088947
+Ref: 32511089320
+Ref: 32521089893
+Ref: 32531089898
+Ref: 32541091925
+Ref: 32551092618
+Ref: 32561094990
+Ref: 32571096278
+Ref: 32581099420
+Node: 4.71102598
+Ref: 32591102868
+Ref: 32601102941
+Ref: S01421102941
+Ref: 32611102954
+Ref: 32621102968
+Ref: 32631102982
+Ref: 32641102995
+Ref: 32651103057
+Ref: 32661103691
+Ref: 32671103692
+Ref: 32681103692
+Ref: 32691103692
+Ref: 32701103692
+Ref: 32711103692
+Ref: 32721103692
+Ref: 32731103917
+Ref: 32741103919
+Ref: 32751106497
+Node: 4.81107075
+Ref: 32761107279
+Ref: 32771107281
+Ref: 32781107281
+Ref: 32791107370
+Ref: S01431107370
+Ref: 32801107388
+Ref: 32811107411
+Ref: 32821107443
+Ref: 32831107466
+Ref: 32841107547
+Ref: S01441107547
+Ref: 32851107575
+Ref: 32861108217
+Ref: 32871108755
+Ref: 32881109186
+Ref: 32891109257
+Ref: 32901109556
+Ref: 32911113977
+Ref: 32921114841
+Ref: 32931116171
+Ref: 32941116282
+Ref: 32951116284
+Ref: 32961116436
+Ref: 32971116516
+Ref: 32981116675
+Ref: 32991117219
+Ref: 33001117221
+Ref: 33011117221
+Ref: 33021117221
+Ref: 33031117310
+Ref: 33041117455
+Ref: 33051118370
+Ref: 33061118370
+Ref: 33071118370
+Ref: 33081120310
+Ref: 33091120310
+Ref: 33101120310
+Ref: 33111121440
+Ref: 33121121440
+Ref: 33131121440
+Ref: 33141121898
+Ref: 33151121898
+Ref: 33161121898
+Ref: 33171121898
+Ref: 33181121898
+Ref: 33191121900
+Ref: 33201122880
+Ref: 33211123651
+Ref: 33221125401
+Ref: 33231125736
+Ref: 33241126593
+Ref: 33251127305
+Ref: 33261127694
+Ref: 33271129573
+Ref: 33281130353
+Node: 4.91131207
+Ref: 33291131561
+Ref: 33301131672
+Ref: 33311132524
+Ref: 33321135896
+Ref: 33331136397
+Ref: 33341136947
+Ref: 33351137598
+Ref: 33361139043
+Ref: 33371139198
+Ref: 33381139537
+Ref: 33391139622
+Ref: 33401139841
+Ref: 33411141419
+Ref: 33421141540
+Ref: 33431141540
+Ref: 33441141540
+Ref: 33451141643
+Ref: 33461141787
+Ref: 33471142073
+Ref: 33481142429
+Ref: 33491146597
+Ref: 33501152711
+Ref: 33511155475
+Ref: 33521157292
+Node: 4.9.11159683
+Ref: 33531159913
+Ref: 33541160547
+Ref: 33551161688
+Ref: 33561162158
+Ref: 33571162349
+Ref: 33581162999
+Ref: 33591164550
+Node: 51165412
+Node: 5.11166988
+Ref: 33601167444
+Ref: S01451167444
+Ref: 33611167448
+Ref: 33621167460
+Ref: 33631167478
+Ref: 33641167502
+Ref: S01461167502
+Ref: 33651167516
+Ref: 33661167523
+Ref: 33671167543
+Ref: 33681167550
+Ref: 33691167626
+Ref: S01471167626
+Ref: 33701167630
+Ref: 33711167656
+Ref: 33721167681
+Ref: 33731167706
+Ref: 33741167725
+Ref: 33751167760
+Ref: 33761167788
+Ref: 33771167819
+Ref: 33781167841
+Ref: 33791167867
+Ref: 33801167887
+Ref: 33811167913
+Ref: 33821167987
+Ref: S01481167987
+Ref: 33831168002
+Ref: 33841168019
+Ref: 33851168044
+Ref: 33861168063
+Ref: 33871168089
+Ref: 33881168125
+Ref: 33891168146
+Ref: 33901168185
+Ref: S01491168185
+Ref: 33911168209
+Ref: S01501168209
+Ref: 33921168224
+Ref: 33931168275
+Ref: S01511168275
+Ref: 33941168279
+Ref: 33951172090
+Ref: 33961172175
+Ref: 33971172668
+Ref: 33981175158
+Ref: 33991175747
+Ref: 34001175933
+Node: 5.21176112
+Ref: 34011176415
+Ref: S01521176415
+Ref: 34021176439
+Ref: 34031176447
+Ref: 34041176615
+Ref: 34051176617
+Ref: 34061176806
+Ref: 34071176806
+Ref: 34081177887
+Ref: 34091177965
+Ref: 34101179752
+Ref: 34111179879
+Ref: 34121180216
+Ref: 34131180485
+Ref: 34141180485
+Ref: 34151180485
+Ref: 34161180826
+Ref: 34171181517
+Ref: 34181181517
+Ref: 34191182068
+Ref: 34201184650
+Ref: 34211185712
+Node: 5.31186808
+Ref: 34221187140
+Ref: S01531187140
+Ref: 34231187157
+Ref: 34241187183
+Ref: 34251187221
+Ref: 34261187247
+Ref: 34271187296
+Ref: 34281187451
+Node: 5.41188730
+Ref: 34291189094
+Ref: S01541189094
+Ref: 34301189124
+Ref: 34311189150
+Ref: 34321189189
+Ref: 34331189269
+Ref: S01551189269
+Ref: 34341189287
+Ref: 34351189322
+Ref: 34361189425
+Ref: 34371189426
+Ref: 34381189492
+Ref: 34391194694
+Ref: 34401195062
+Ref: 34411195062
+Ref: 34421195062
+Ref: 34431196440
+Ref: 34441197548
+Node: 5.51200768
+Ref: 34451201049
+Ref: S01561201049
+Ref: 34461201070
+Ref: 34471201105
+Ref: 34481201142
+Ref: 34491201194
+Ref: 34501201260
+Ref: S01571201260
+Ref: 34511201271
+Ref: 34521201295
+Ref: 34531201338
+Ref: 34541201397
+Ref: S01581201397
+Ref: 34551201410
+Ref: 34561201443
+Ref: 34571201715
+Ref: 34581201860
+Ref: 34591201910
+Ref: 34601202227
+Ref: 34611202659
+Ref: 34621202660
+Ref: 34631203406
+Node: 5.5.11207837
+Ref: 34641208112
+Ref: 34651208317
+Ref: 34661208373
+Ref: 34671208451
+Ref: 34681208559
+Ref: 34691208639
+Ref: 34701208719
+Ref: 34711209008
+Ref: 34721209144
+Ref: 34731209200
+Ref: 34741209276
+Ref: 34751209416
+Ref: 34761210168
+Ref: 34771210246
+Ref: 34781210380
+Ref: 34791210380
+Ref: 34801210380
+Ref: 34811210649
+Ref: 34821210649
+Ref: 34831210649
+Ref: 34841211035
+Ref: 34851211170
+Ref: 34861211246
+Ref: 34871211342
+Ref: 34881212654
+Ref: 34891213810
+Ref: 34901213904
+Ref: 34911214062
+Node: 5.5.21214431
+Ref: 34921214801
+Ref: S01591214801
+Ref: 34931214815
+Ref: 34941214859
+Ref: 34951214873
+Ref: 34961214896
+Ref: 34971214946
+Ref: 34981215137
+Ref: 34991215137
+Ref: 35001215201
+Ref: 35011215332
+Ref: 35021215449
+Ref: 35031215449
+Ref: 35041215504
+Ref: 35051215504
+Ref: 35061215936
+Ref: 35071215936
+Ref: 35081215974
+Ref: 35091215974
+Ref: 35101218767
+Ref: 35111220928
+Ref: 35121222574
+Ref: 35131222839
+Ref: 35141223765
+Ref: 35151223937
+Ref: 35161224010
+Ref: 35171226249
+Ref: 35181226403
+Node: 5.61229161
+Ref: 35191229442
+Ref: S01601229442
+Ref: 35201229464
+Ref: 35211229525
+Ref: 35221229579
+Ref: 35231229636
+Ref: 35241230151
+Node: 5.71231215
+Ref: 35251231548
+Ref: S01611231548
+Ref: 35261231574
+Ref: 35271231586
+Ref: 35281231786
+Ref: 35291232575
+Node: 5.81233436
+Ref: 35301233720
+Ref: S01621233720
+Ref: 35311233738
+Ref: 35321233796
+Ref: 35331234537
+Node: 61235415
+Ref: 35341235509
+Ref: 35351235509
+Ref: 35361235509
+Ref: 35371236781
+Ref: 35381236843
+Ref: 35391236928
+Node: 6.11237642
+Ref: 35401237953
+Ref: S01631237953
+Ref: 35411237968
+Ref: 35421237999
+Ref: 35431238038
+Ref: 35441238196
+Ref: S01641238196
+Ref: 35451238210
+Ref: 35461238243
+Ref: 35471238332
+Ref: S01651238332
+Ref: 35481238352
+Ref: 35491238379
+Ref: 35501238462
+Ref: S01661238462
+Ref: 35511238476
+Ref: 35521238502
+Ref: 35531238549
+Ref: S01671238549
+Ref: 35541238555
+Ref: 35551238575
+Ref: 35561238588
+Ref: 35571238631
+Ref: S01681238631
+Ref: 35581238635
+Ref: 35591238665
+Ref: 35601238730
+Ref: S01691238730
+Ref: 35611238736
+Ref: 35621238756
+Ref: 35631238906
+Ref: S01701238906
+Ref: 35641238910
+Ref: 35651239741
+Ref: S01711239741
+Ref: 35661239745
+Ref: 35671239788
+Ref: S01721239788
+Ref: 35681239794
+Ref: 35691239913
+Ref: S01731239913
+Ref: 35701239928
+Ref: 35711239949
+Ref: 35721239965
+Ref: 35731239988
+Ref: 35741240008
+Ref: 35751240046
+Ref: S01741240046
+Ref: 35761240060
+Ref: 35771240087
+Ref: 35781240210
+Ref: S01751240210
+Ref: 35791240224
+Ref: 35801240261
+Ref: 35811240267
+Ref: 35821240283
+Ref: 35831240306
+Ref: 35841240335
+Ref: 35851240362
+Ref: 35861240384
+Ref: 35871240423
+Ref: S01761240423
+Ref: 35881240501
+Ref: 35891240696
+Ref: 35901240808
+Ref: 35911240888
+Ref: 35921241383
+Ref: 35931241384
+Ref: 35941243054
+Ref: 35951243749
+Ref: 35961244134
+Ref: 35971244171
+Ref: 35981244172
+Ref: 35991244392
+Ref: 36001244474
+Ref: 36011245092
+Ref: 36021246065
+Ref: 36031247046
+Ref: 36041249029
+Ref: 36051250238
+Ref: 36061251684
+Node: 6.1.11252361
+Ref: 36071253488
+Ref: 36081253488
+Ref: 36091253651
+Ref: 36101253651
+Ref: 36111254473
+Ref: 36121254473
+Ref: 36131254702
+Ref: 36141254702
+Ref: 36151255707
+Ref: 36161255707
+Ref: 36171255871
+Ref: 36181255871
+Ref: 36191256283
+Ref: 36201256283
+Ref: 36211256434
+Ref: 36221256434
+Ref: 36231256707
+Ref: 36241256707
+Ref: 36251259378
+Ref: 36261263790
+Ref: 36271264427
+Ref: 36281264427
+Ref: 36291266622
+Ref: 36301266622
+Ref: 36311267020
+Ref: 36321267516
+Ref: 36331267531
+Ref: 36341276375
+Ref: 36351276390
+Ref: 36361277902
+Ref: 36371277902
+Ref: 36381277902
+Ref: 36391278201
+Ref: 36401278201
+Ref: 36411278201
+Ref: 36421279407
+Ref: 36431279407
+Ref: 36441280762
+Ref: 36451280762
+Ref: 36461280762
+Ref: 36471280762
+Ref: 36481280762
+Ref: 36491288649
+Ref: 36501288777
+Ref: 36511290265
+Node: 6.21292198
+Ref: 36521292455
+Ref: 36531292455
+Ref: 36541292455
+Ref: 36551292455
+Ref: 36561292455
+Ref: 36571292455
+Ref: 36581293001
+Ref: 36591293240
+Ref: 36601293849
+Ref: 36611296026
+Ref: 36621296265
+Ref: 36631296624
+Ref: 36641297365
+Ref: 36651297366
+Ref: 36661297366
+Ref: 36671297366
+Ref: 36681298038
+Ref: 36691303647
+Node: 6.31305088
+Ref: 36701305392
+Ref: S01771305392
+Ref: 36711305407
+Ref: 36721305438
+Ref: 36731305476
+Ref: 36741305513
+Ref: 36751305558
+Ref: 36761305603
+Ref: 36771306190
+Ref: 36781306440
+Ref: 36791306910
+Ref: 36801307817
+Ref: 36811308694
+Node: 6.3.11308909
+Ref: 36821309021
+Ref: 36831309021
+Ref: 36841309021
+Ref: 36851309021
+Ref: 36861309021
+Ref: 36871309314
+Ref: 36881309315
+Ref: 36891309724
+Ref: 36901309725
+Ref: 36911310028
+Ref: 36921310028
+Ref: 36931315052
+Ref: 36941315053
+Ref: 36951315391
+Ref: 36961315392
+Ref: 36971317173
+Ref: 36981317174
+Ref: 36991317498
+Ref: 37001318280
+Ref: 37011318281
+Ref: 37021318833
+Ref: 37031318868
+Ref: 37041318869
+Ref: 37051319138
+Ref: 37061319170
+Ref: 37071319231
+Ref: 37081319232
+Ref: 37091320809
+Ref: 37101324114
+Ref: 37111324371
+Ref: 37121324378
+Ref: 37131325237
+Ref: 37141326357
+Ref: 37151327994
+Ref: 37161330011
+Node: 6.3.21330860
+Ref: 37171331740
+Ref: 37181331740
+Ref: 37191333590
+Node: 6.41333658
+Ref: 37201333770
+Ref: 37211334083
+Ref: S01781334083
+Ref: 37221334109
+Ref: 37231334136
+Ref: 37241334143
+Ref: 37251334187
+Ref: S01791334187
+Ref: 37261334212
+Ref: 37271334237
+Ref: 37281334244
+Ref: 37291334480
+Ref: S01801334480
+Ref: 37301334495
+Ref: 37311334520
+Ref: 37321334573
+Ref: S01811334573
+Ref: 37331334606
+Ref: 37341334624
+Ref: 37351334683
+Ref: S01821334683
+Ref: 37361334687
+Ref: 37371334712
+Ref: 37381334720
+Ref: 37391334725
+Ref: 37401336793
+Ref: 37411337445
+Ref: 37421339510
+Ref: 37431340266
+Ref: 37441340268
+Ref: 37451343197
+Node: 6.4.11344226
+Ref: 37461344335
+Ref: 37471345630
+Ref: 37481345631
+Ref: 37491345631
+Ref: 37501345631
+Ref: 37511346051
+Ref: 37521346279
+Ref: 37531349457
+Ref: 37541351630
+Ref: 37551353159
+Ref: 37561358857
+Ref: 37571363687
+Ref: 37581364154
+Ref: 37591364279
+Ref: 37601364531
+Ref: 37611366135
+Ref: 37621369565
+Ref: 37631369565
+Ref: 37641369714
+Ref: 37651369714
+Ref: 37661369714
+Ref: 37671369714
+Ref: 37681369714
+Ref: 37691369951
+Ref: 37701370015
+Ref: 37711371230
+Ref: 37721371621
+Ref: 37731372262
+Ref: 37741372816
+Ref: 37751375322
+Node: 6.51376686
+Ref: 37761376970
+Ref: 37771377252
+Ref: S01831377252
+Ref: S01841377252
+Ref: 37781377265
+Ref: 37791377357
+Ref: S01851377357
+Ref: 37801377371
+Ref: 37811377413
+Ref: 37821377449
+Ref: 37831377647
+Ref: S01861377647
+Ref: 37841377668
+Ref: 37851377720
+Ref: 37861377841
+Ref: S01871377841
+Ref: 37871377845
+Ref: 37881377872
+Ref: 37891377974
+Ref: 37901378153
+Ref: 37911378299
+Ref: 37921378580
+Ref: 37931381890
+Ref: 37941385478
+Ref: 37951385964
+Ref: 37961386265
+Ref: 37971386588
+Ref: 37981386588
+Ref: 37991386730
+Ref: 38001386730
+Ref: 38011386732
+Ref: 38021388034
+Ref: 38031388234
+Ref: 38041388236
+Ref: 38051389953
+Ref: 38061389953
+Ref: 38071389955
+Ref: 38081392151
+Ref: 38091392152
+Ref: 38101392382
+Ref: 38111393535
+Ref: 38121393537
+Ref: 38131393537
+Ref: 38141404176
+Ref: 38151406212
+Ref: 38161407065
+Ref: 38171408210
+Ref: 38181409759
+Ref: 38191411866
+Ref: 38201413342
+Node: 6.5.11415419
+Ref: 38211415817
+Ref: 38221416335
+Ref: 38231416335
+Ref: 38241416335
+Ref: 38251417790
+Ref: 38261418662
+Ref: 38271420539
+Ref: 38281420668
+Node: 6.61420742
+Ref: 38291420870
+Ref: 38301420870
+Ref: 38311420870
+Ref: 38321423465
+Ref: 38331423802
+Ref: 38341424381
+Node: 6.71425235
+Ref: 38351425611
+Ref: S01881425611
+Ref: 38361425625
+Ref: 38371425655
+Ref: 38381425700
+Ref: 38391426062
+Ref: 38401426256
+Ref: 38411426256
+Ref: 38421427226
+Ref: 38431427741
+Ref: 38441427859
+Node: 6.81428105
+Ref: 38451428511
+Ref: S01891428511
+Ref: 38461428525
+Ref: 38471428555
+Ref: 38481428594
+Ref: 38491428619
+Ref: 38501428651
+Ref: 38511428681
+Ref: 38521428719
+Ref: 38531428742
+Ref: 38541429034
+Ref: 38551429424
+Ref: 38561430783
+Ref: 38571430783
+Ref: 38581430808
+Ref: 38591431772
+Ref: 38601432246
+Ref: 38611432391
+Node: 71432565
+Ref: 38621432654
+Ref: 38631433024
+Ref: 38641433026
+Ref: 38651433026
+Ref: 38661433026
+Node: 7.11433276
+Ref: 38671433668
+Ref: S01901433668
+Ref: 38681433672
+Ref: 38691433754
+Ref: S01911433754
+Ref: 38701433776
+Ref: 38711433817
+Ref: 38721433854
+Ref: 38731433907
+Ref: 38741433947
+Ref: 38751433965
+Ref: 38761434254
+Ref: 38771434255
+Ref: 38781434843
+Ref: 38791435009
+Ref: 38801435366
+Ref: 38811436456
+Ref: 38821438214
+Ref: 38831439705
+Node: 7.21439838
+Ref: 38841440418
+Ref: S01921440418
+Ref: 38851440445
+Ref: 38861440486
+Ref: 38871440523
+Ref: 38881440568
+Ref: 38891440615
+Ref: 38901440633
+Ref: 38911442380
+Ref: 38921443295
+Ref: 38931446348
+Node: 7.31446472
+Ref: 38941447026
+Ref: 38951447028
+Ref: 38961447028
+Ref: 38971447028
+Ref: 38981447028
+Ref: 38991447717
+Ref: S01931447717
+Ref: 39001447735
+Ref: 39011447756
+Ref: 39021447834
+Ref: 39031448026
+Ref: S01941448026
+Ref: 39041448044
+Ref: 39051448065
+Ref: 39061448148
+Ref: 39071448188
+Ref: 39081448230
+Ref: 39091448301
+Ref: 39101448301
+Ref: 39111461188
+Ref: 39121461679
+Ref: 39131462421
+Ref: 39141465510
+Ref: 39151467191
+Ref: 39161467264
+Ref: 39171467408
+Ref: 39181467566
+Ref: 39191469495
+Ref: 39201469574
+Ref: 39211470346
+Ref: 39221474038
+Ref: 39231475921
+Ref: 39241476741
+Node: 7.3.11477304
+Ref: 39251477614
+Ref: 39261480341
+Ref: 39271480342
+Ref: 39281480342
+Ref: 39291480806
+Ref: 39301490811
+Ref: 39311490826
+Node: 7.3.21496396
+Ref: 39321496906
+Ref: 39331497242
+Ref: 39341497242
+Ref: 39351497862
+Ref: 39361497862
+Ref: 39371497959
+Ref: 39381497959
+Ref: 39391497959
+Ref: 39401498728
+Ref: 39411501069
+Ref: 39421501069
+Ref: 39431507691
+Ref: 39441508336
+Ref: 39451512576
+Ref: 39461512716
+Ref: 39471516066
+Ref: 39481516506
+Node: 7.41517409
+Ref: 39491517889
+Ref: 39501518015
+Ref: 39511518106
+Ref: 39521518356
+Ref: 39531521335
+Ref: 39541523674
+Ref: 39551526602
+Node: 7.51527131
+Ref: 39561532297
+Ref: 39571535018
+Ref: 39581535215
+Ref: 39591535215
+Ref: 39601537909
+Ref: 39611537909
+Ref: 39621537909
+Ref: 39631541053
+Ref: 39641541671
+Node: 7.61544120
+Ref: 39651544243
+Ref: 39661544243
+Ref: 39671544813
+Ref: 39681544815
+Ref: 39691544815
+Ref: 39701544911
+Ref: 39711544997
+Ref: 39721544999
+Ref: 39731544999
+Ref: 39741547026
+Ref: 39751547113
+Ref: 39761547265
+Ref: 39771547333
+Ref: 39781547401
+Ref: 39791547500
+Ref: 39801547676
+Ref: 39811547752
+Ref: 39821547932
+Ref: 39831550331
+Ref: 39841550331
+Ref: 39851553524
+Ref: 39861554715
+Ref: 39871554964
+Ref: 39881554964
+Ref: 39891555169
+Ref: 39901555170
+Ref: 39911555365
+Ref: 39921556425
+Ref: 39931559135
+Ref: 39941559135
+Ref: 39951563733
+Ref: 39961564100
+Ref: 39971564434
+Ref: 39981573354
+Ref: 39991573610
+Ref: 40001575842
+Node: 7.6.11577511
+Ref: 40011577982
+Ref: 40021577984
+Ref: 40031578068
+Ref: 40041578069
+Ref: 40051578245
+Ref: 40061578247
+Ref: 40071578247
+Ref: 40081578247
+Ref: 40091578845
+Ref: 40101578846
+Ref: 40111579019
+Ref: 40121581090
+Ref: 40131583623
+Ref: 40141584798
+Ref: 40151586458
+Ref: 40161587189
+Ref: 40171587189
+Ref: 40181587191
+Ref: 40191588617
+Ref: 40201588971
+Ref: 40211591886
+Ref: 40221596640
+Ref: 40231597549
+Ref: 40241598097
+Ref: 40251599968
+Ref: 40261600705
+Ref: 40271601289
+Ref: 40281605408
+Ref: 40291606663
+Ref: 40301610666
+Ref: 40311614847
+Ref: 40321614857
+Ref: 40331616484
+Ref: 40341618922
+Node: 81620673
+Node: 8.11623008
+Ref: 40351623158
+Ref: 40361625289
+Ref: 40371625289
+Ref: 40381625289
+Ref: 40391625289
+Ref: 40401625289
+Ref: 40411625735
+Ref: 40421626476
+Ref: 40431632273
+Node: 8.21633102
+Ref: 40441633690
+Ref: 40451636252
+Ref: 40461637305
+Ref: 40471637449
+Ref: 40481637809
+Ref: 40491637881
+Ref: 40501638086
+Ref: 40511639472
+Ref: 40521640540
+Ref: 40531640788
+Ref: 40541640793
+Ref: 40551640908
+Ref: 40561643698
+Ref: 40571644679
+Node: 8.31647927
+Ref: 40581648028
+Ref: 40591648282
+Ref: 40601648282
+Ref: 40611648282
+Ref: 40621648592
+Ref: 40631649002
+Ref: 40641649002
+Ref: 40651649088
+Ref: 40661649212
+Ref: 40671649343
+Ref: 40681649463
+Ref: 40691649576
+Ref: 40701649705
+Ref: 40711650248
+Ref: 40721650956
+Ref: 40731651093
+Ref: 40741651579
+Ref: 40751651611
+Ref: 40761655452
+Ref: 40771659214
+Ref: 40781659219
+Ref: 40791659219
+Ref: 40801659324
+Ref: 40811659747
+Ref: 40821661460
+Ref: 40831662489
+Ref: 40841664135
+Ref: 40851664135
+Ref: 40861664135
+Ref: 40871664135
+Ref: 40881664284
+Ref: 40891664351
+Ref: 40901664539
+Ref: 40911664726
+Ref: 40921664784
+Ref: 40931664880
+Ref: 40941665000
+Ref: 40951666844
+Ref: 40961667190
+Ref: 40971677982
+Ref: 40981678738
+Node: 8.3.11681987
+Ref: 40991682355
+Ref: S01951682355
+Ref: 41001683775
+Ref: 41011686751
+Node: 8.41687134
+Ref: 41021687487
+Ref: 41031687867
+Ref: 41041688249
+Ref: S01961688249
+Ref: 41051688253
+Ref: 41061688275
+Ref: 41071688317
+Ref: S01971688317
+Ref: 41081688336
+Ref: 41091688354
+Ref: 41101688413
+Ref: S01981688413
+Ref: 41111688433
+Ref: 41121688455
+Ref: 41131688746
+Ref: 41141690636
+Ref: 41151690699
+Ref: 41161693238
+Ref: 41171693238
+Ref: 41181694242
+Ref: 41191696429
+Ref: 41201697204
+Node: 8.51697582
+Ref: 41211698199
+Ref: S01991698199
+Ref: 41221698215
+Ref: 41231698254
+Ref: 41241698296
+Ref: 41251698336
+Ref: 41261698379
+Ref: 41271698458
+Ref: 41281698621
+Ref: 41291698622
+Node: 8.5.11700681
+Ref: 41301701049
+Ref: S02001701049
+Ref: 41311701063
+Ref: 41321701086
+Ref: 41331701102
+Ref: 41341701138
+Ref: 41351701157
+Ref: 41361701189
+Ref: 41371701211
+Ref: 41381701246
+Ref: 41391701265
+Ref: 41401703381
+Ref: 41411703516
+Ref: 41421704076
+Ref: 41431705855
+Ref: 41441709903
+Ref: 41451711082
+Ref: 41461712061
+Ref: 41471712798
+Node: 8.5.21712938
+Ref: 41481713268
+Ref: S02011713268
+Ref: 41491713272
+Ref: 41501713330
+Ref: 41511713344
+Ref: 41521713844
+Node: 8.5.31713987
+Ref: 41531714305
+Ref: S02021714305
+Ref: 41541714323
+Ref: 41551714368
+Ref: 41561714382
+Ref: 41571716301
+Node: 8.5.41716441
+Ref: 41581716716
+Ref: 41591716776
+Ref: 41601717242
+Ref: S02031717242
+Ref: 41611717257
+Ref: 41621717288
+Ref: 41631717339
+Ref: 41641717358
+Ref: 41651717433
+Ref: 41661717724
+Ref: 41671718433
+Ref: 41681719195
+Ref: 41691719329
+Ref: 41701719612
+Ref: 41711727158
+Ref: 41721727270
+Ref: 41731727271
+Ref: 41741731261
+Ref: 41751732440
+Ref: 41761733176
+Node: 8.5.51733319
+Ref: 41771733628
+Ref: S02041733628
+Ref: 41781733660
+Ref: 41791733719
+Ref: 41801733738
+Ref: 41811733790
+Ref: 41821733851
+Ref: 41831733870
+Ref: 41841733921
+Ref: 41851733981
+Ref: 41861734000
+Ref: 41871734885
+Ref: 41881735661
+Node: 8.61735801
+Ref: 41891735967
+Ref: 41901736244
+Ref: 41911736847
+Ref: 41921737496
+Ref: 41931738326
+Ref: 41941738326
+Ref: 41951740717
+Ref: 41961740805
+Ref: 41971740807
+Ref: 41981740807
+Ref: 41991741585
+Ref: 42001741891
+Ref: 42011742355
+Ref: 42021744983
+Ref: 42031745908
+Ref: 42041746110
+Ref: 42051746685
+Ref: 42061746685
+Ref: 42071747425
+Ref: 42081747584
+Ref: 42091749518
+Ref: 42101749659
+Ref: 42111749790
+Ref: 42121750259
+Ref: 42131752284
+Ref: 42141752284
+Ref: 42151754122
+Ref: 42161755389
+Ref: 42171756003
+Ref: 42181756407
+Ref: 42191759125
+Ref: 42201759135
+Ref: 42211759404
+Ref: 42221763921
+Ref: 42231764983
+Ref: 42241765950
+Ref: 42251767225
+Ref: 42261767971
+Ref: 42271768623
+Node: 91770215
+Ref: 42281770366
+Ref: 42291770448
+Ref: 42301770450
+Ref: 42311770684
+Ref: 42321770685
+Ref: 42331770685
+Ref: 42341770685
+Ref: 42351771005
+Ref: 42361772168
+Ref: 42371772416
+Ref: 42381772418
+Ref: 42391772418
+Ref: 42401772418
+Ref: 42411772418
+Ref: 42421772418
+Ref: 42431772418
+Ref: 42441772418
+Ref: 42451772574
+Ref: 42461772726
+Ref: 42471772727
+Node: 9.11774505
+Ref: 42481774627
+Ref: 42491775101
+Ref: S02051775101
+Ref: 42501775124
+Ref: 42511775145
+Ref: 42521775184
+Ref: 42531775225
+Ref: 42541775256
+Ref: 42551775370
+Ref: S02061775370
+Ref: 42561775388
+Ref: 42571775423
+Ref: 42581775463
+Ref: 42591775494
+Ref: 42601775535
+Ref: S02071775535
+Ref: 42611775551
+Ref: 42621775590
+Ref: 42631775621
+Ref: 42641775706
+Ref: S02081775706
+Ref: 42651775711
+Ref: 42661775736
+Ref: 42671775796
+Ref: S02091775796
+Ref: 42681775819
+Ref: 42691775853
+Ref: 42701775888
+Ref: 42711775929
+Ref: 42721775980
+Ref: 42731776308
+Ref: 42741776499
+Ref: 42751777852
+Ref: 42761777853
+Ref: 42771777853
+Ref: 42781778701
+Ref: 42791780111
+Ref: 42801781245
+Ref: 42811781507
+Ref: 42821781946
+Ref: 42831782415
+Ref: 42841782485
+Ref: 42851782765
+Ref: 42861782987
+Ref: 42871783893
+Ref: 42881787404
+Ref: 42891788531
+Ref: 42901789834
+Node: 9.21790402
+Ref: 42911790593
+Ref: 42921790695
+Ref: 42931790697
+Ref: 42941790697
+Ref: 42951790697
+Ref: 42961790844
+Ref: 42971794048
+Ref: 42981794048
+Ref: 42991794207
+Node: 9.31798438
+Ref: 43001798641
+Ref: 43011798641
+Ref: 43021798641
+Ref: 43031798641
+Ref: 43041799865
+Ref: 43051800581
+Node: 9.41805346
+Ref: 43061805500
+Ref: 43071805500
+Ref: 43081805500
+Ref: 43091805500
+Ref: 43101805678
+Ref: 43111805680
+Ref: 43121805680
+Ref: 43131806065
+Ref: 43141806208
+Ref: S02101806208
+Ref: 43151806235
+Ref: 43161806256
+Ref: 43171806295
+Ref: 43181806335
+Ref: 43191806366
+Ref: 43201806489
+Ref: S02111806489
+Ref: 43211806511
+Ref: 43221806545
+Ref: 43231806585
+Ref: 43241806616
+Ref: 43251806666
+Ref: S02121806666
+Ref: 43261806682
+Ref: 43271806742
+Ref: 43281806800
+Ref: 43291806912
+Ref: S02131806912
+Ref: 43301806916
+Ref: 43311806952
+Ref: 43321806982
+Ref: 43331807033
+Ref: S02141807033
+Ref: 43341807037
+Ref: 43351807082
+Ref: 43361807438
+Ref: S02151807438
+Ref: 43371807465
+Ref: 43381807499
+Ref: 43391807534
+Ref: 43401807585
+Ref: 43411807718
+Ref: S02161807718
+Ref: 43421807722
+Ref: 43431807763
+Ref: 43441807791
+Ref: 43451807830
+Ref: 43461807874
+Ref: 43471807897
+Ref: 43481808323
+Ref: 43491808559
+Ref: 43501809880
+Ref: 43511809881
+Ref: 43521809881
+Ref: 43531809881
+Ref: 43541810762
+Ref: 43551812309
+Ref: 43561813476
+Ref: 43571813792
+Ref: 43581813874
+Ref: 43591815629
+Ref: 43601816288
+Ref: 43611816367
+Ref: 43621816659
+Ref: 43631816878
+Ref: 43641817110
+Ref: 43651817667
+Ref: 43661818127
+Ref: 43671818127
+Ref: 43681819905
+Ref: 43691825722
+Ref: 43701826043
+Ref: 43711827335
+Ref: 43721827854
+Ref: 43731828544
+Node: 9.51828804
+Ref: 43741828930
+Ref: 43751828930
+Ref: 43761829492
+Ref: 43771830446
+Ref: 43781830719
+Ref: 43791832510
+Ref: 43801832510
+Ref: 43811832510
+Ref: 43821835189
+Ref: S02171835189
+Ref: 43831835639
+Ref: 43841835639
+Ref: 43851837274
+Ref: 43861838324
+Node: 9.5.11839076
+Ref: 43871839240
+Ref: 43881839240
+Ref: 43891839240
+Ref: 43901841079
+Ref: 43911841079
+Ref: 43921841584
+Ref: 43931841767
+Ref: 43941842464
+Ref: 43951842816
+Ref: 43961842817
+Ref: 43971843150
+Ref: 43981843150
+Ref: 43991843553
+Ref: 44001843656
+Ref: 44011843658
+Ref: 44021844934
+Ref: 44031849483
+Node: 9.5.21849604
+Ref: 44041850044
+Ref: S02181850044
+Ref: 44051850058
+Ref: 44061850094
+Ref: 44071850116
+Ref: 44081850146
+Ref: 44091850182
+Ref: 44101850229
+Ref: S02191850229
+Ref: 44111850257
+Ref: 44121850271
+Ref: 44131850285
+Ref: 44141850317
+Ref: 44151850369
+Ref: 44161850689
+Ref: S02201850689
+Ref: 44171850693
+Ref: 44181850723
+Ref: S02211850723
+Ref: 44191850741
+Ref: 44201850762
+Ref: 44211850786
+Ref: 44221850818
+Ref: 44231850857
+Ref: 44241850908
+Ref: 44251851308
+Ref: S02221851308
+Ref: 44261851315
+Ref: 44271851343
+Ref: 44281851388
+Ref: S02231851388
+Ref: 44291851398
+Ref: 44301851441
+Ref: S02241851441
+Ref: 44311851450
+Ref: 44321851473
+Ref: 44331852336
+Ref: 44341852464
+Ref: 44351855597
+Ref: 44361856574
+Ref: 44371858816
+Ref: 44381858911
+Ref: 44391859045
+Ref: 44401859160
+Ref: 44411860473
+Ref: 44421860943
+Ref: 44431860943
+Ref: 44441860943
+Ref: 44451861407
+Ref: 44461861409
+Ref: 44471861690
+Ref: 44481862305
+Ref: 44491863153
+Ref: 44501863353
+Ref: 44511863355
+Ref: 44521863355
+Ref: 44531864653
+Ref: 44541865043
+Ref: 44551868344
+Ref: 44561868956
+Node: 9.5.31869086
+Ref: 44571869200
+Ref: 44581869275
+Ref: 44591869277
+Ref: 44601869564
+Ref: S02251869564
+Ref: 44611869577
+Ref: 44621869583
+Ref: 44631870142
+Ref: 44641870142
+Ref: 44651870142
+Ref: 44661870142
+Ref: 44671870315
+Ref: 44681870316
+Ref: 44691870629
+Ref: 44701870630
+Ref: 44711870792
+Ref: 44721871958
+Ref: 44731872107
+Ref: 44741872306
+Ref: 44751873604
+Ref: 44761873747
+Ref: 44771873747
+Ref: 44781874373
+Ref: 44791874666
+Ref: 44801874770
+Ref: 44811874772
+Ref: 44821875841
+Ref: 44831876416
+Ref: 44841877544
+Node: 9.5.41886573
+Ref: 44851886849
+Ref: 44861886997
+Ref: 44871886999
+Ref: 44881887096
+Ref: S02261887096
+Ref: 44891887135
+Ref: 44901887261
+Ref: 44911887663
+Ref: 44921888120
+Ref: 44931890223
+Ref: 44941892863
+Ref: 44951893335
+Ref: 44961893607
+Ref: 44971895224
+Ref: 44981896831
+Ref: 44991897241
+Ref: 45001897401
+Ref: 45011897623
+Ref: 45021898328
+Node: 9.61898877
+Ref: 45031899030
+Ref: 45041899506
+Ref: 45051899574
+Ref: S02271899574
+Ref: 45061899578
+Ref: 45071899603
+Ref: 45081899663
+Ref: S02281899663
+Ref: 45091899688
+Ref: 45101899732
+Ref: S02291899732
+Ref: 45111899751
+Ref: 45121899815
+Ref: 45131899922
+Ref: 45141900092
+Ref: 45151900093
+Ref: 45161900093
+Ref: 45171901130
+Ref: 45181901172
+Ref: 45191901241
+Ref: 45201901300
+Ref: 45211901354
+Ref: 45221901408
+Ref: 45231901885
+Ref: 45241901924
+Ref: 45251901981
+Ref: 45261902039
+Ref: 45271902095
+Ref: 45281902158
+Ref: 45291902408
+Ref: 45301903115
+Ref: 45311903282
+Ref: 45321903364
+Ref: 45331903529
+Ref: 45341903781
+Ref: 45351904288
+Ref: 45361904859
+Ref: 45371912290
+Ref: 45381912290
+Ref: 45391913446
+Ref: 45401913446
+Ref: 45411913918
+Ref: 45421914388
+Ref: 45431915858
+Node: 9.6.11916776
+Ref: 45441917116
+Ref: 45451917216
+Ref: 45461917947
+Ref: 45471918006
+Ref: 45481918109
+Ref: 45491918207
+Ref: 45501918373
+Ref: 45511918789
+Ref: 45521919313
+Ref: 45531919444
+Ref: 45541919457
+Ref: 45551919465
+Ref: 45561919474
+Ref: 45571919485
+Ref: 45581919502
+Ref: 45591919515
+Ref: 45601919525
+Ref: 45611919557
+Ref: 45621919671
+Ref: 45631919733
+Ref: 45641919795
+Ref: 45651919857
+Ref: 45661919934
+Ref: 45671920105
+Ref: 45681920277
+Ref: 45691920447
+Ref: 45701920618
+Ref: 45711920791
+Ref: 45721920893
+Ref: 45731920997
+Ref: 45741921266
+Ref: 45751921555
+Ref: 45761922112
+Ref: 45771922507
+Ref: 45781923024
+Ref: 45791923592
+Ref: 45801924024
+Ref: 45811924214
+Ref: 45821924338
+Ref: 45831924474
+Ref: 45841946132
+Ref: 45851946334
+Node: 9.71946853
+Ref: 45861947256
+Ref: S02301947256
+Ref: 45871947269
+Ref: 45881947295
+Ref: 45891947321
+Ref: 45901947353
+Ref: 45911947632
+Node: 9.7.11947829
+Ref: 45921948154
+Ref: 45931948221
+Ref: S02311948221
+Ref: 45941948249
+Ref: 45951948266
+Ref: 45961948304
+Ref: 45971948321
+Ref: 45981948362
+Ref: 45991948419
+Ref: S02321948419
+Ref: 46001948429
+Ref: 46011948468
+Ref: S02331948468
+Ref: 46021948481
+Ref: 46031948509
+Ref: 46041948536
+Ref: 46051948584
+Ref: S02341948584
+Ref: 46061948596
+Ref: 46071948614
+Ref: 46081948663
+Ref: S02351948663
+Ref: 46091948675
+Ref: 46101948692
+Ref: 46111948745
+Ref: S02361948745
+Ref: 46121948984
+Ref: 46131949550
+Ref: 46141949731
+Ref: 46151950380
+Ref: 46161951029
+Ref: 46171952865
+Node: 9.7.21954102
+Ref: 46181954543
+Ref: 46191954612
+Ref: S02371954612
+Ref: 46201954639
+Ref: 46211954680
+Ref: 46221954780
+Ref: S02381954780
+Ref: 46231954792
+Ref: 46241954817
+Ref: 46251954907
+Ref: S02391954907
+Ref: 46261954919
+Ref: 46271954946
+Ref: 46281956076
+Ref: 46291958020
+Node: 9.7.31958552
+Ref: 46301959419
+Ref: S02401959419
+Ref: 46311959446
+Ref: 46321959489
+Ref: 46331959581
+Node: 9.7.41960780
+Ref: 46341961130
+Ref: S02411961130
+Ref: 46351961157
+Ref: 46361961206
+Ref: 46371961270
+Ref: S02421961270
+Ref: 46381961274
+Ref: 46391961297
+Ref: 46401961388
+Ref: S02431961388
+Ref: 46411961392
+Ref: 46421961424
+Ref: 46431961462
+Ref: S02441961462
+Ref: 46441961466
+Ref: 46451961572
+Ref: 46461961573
+Ref: 46471962461
+Ref: 46481965116
+Ref: 46491965116
+Ref: 46501965116
+Ref: 46511965552
+Ref: 46521965553
+Ref: 46531965553
+Ref: 46541965553
+Ref: 46551965553
+Ref: 46561966039
+Ref: 46571966173
+Node: 9.81966351
+Ref: 46581966879
+Ref: S02451966879
+Ref: 46591966897
+Ref: 46601966912
+Ref: 46611966971
+Ref: 46621967120
+Ref: 46631967220
+Ref: 46641967220
+Ref: 46651967222
+Ref: 46661967222
+Ref: 46671968092
+Ref: 46681968092
+Ref: 46691968522
+Ref: 46701970453
+Ref: 46711971441
+Ref: 46721972836
+Ref: 46731973120
+Ref: 46741974356
+Ref: 46751974356
+Ref: 46761974356
+Ref: 46771974356
+Node: 9.91975195
+Ref: 46781975499
+Ref: 46791975514
+Ref: 46801975613
+Ref: 46811975614
+Ref: 46821975779
+Ref: 46831975794
+Ref: 46841976298
+Ref: 46851976313
+Node: 9.101977356
+Ref: 46861977627
+Ref: 46871977628
+Ref: 46881978321
+Ref: 46891980276
+Ref: 46901983548
+Ref: 46911983812
+Node: 9.111987766
+Node: 101991643
+Ref: 46921992698
+Ref: 46931992698
+Ref: 46941992698
+Ref: 46951993007
+Ref: 46961993502
+Ref: 46971993983
+Ref: 46981993993
+Ref: 46991994174
+Node: 10.11995316
+Ref: 47001995430
+Ref: 47011995430
+Ref: 47021995431
+Ref: 47031995748
+Ref: 47041996828
+Ref: 47051997075
+Node: 10.1.11999010
+Ref: 47061999372
+Ref: 47071999625
+Ref: S02461999625
+Ref: 47081999631
+Ref: 47091999673
+Ref: S02471999673
+Ref: 47101999687
+Ref: 47111999702
+Ref: 47121999724
+Ref: 47131999739
+Ref: 47141999767
+Ref: S02481999767
+Ref: 47151999782
+Ref: 47161999816
+Ref: 47171999853
+Ref: 47181999919
+Ref: S02491999919
+Ref: 47191999934
+Ref: 47201999961
+Ref: 47211999991
+Ref: 47222000015
+Ref: 47232000078
+Ref: S02502000078
+Ref: 47242000091
+Ref: 47252000128
+Ref: 47262000165
+Ref: 47272000222
+Ref: S02512000222
+Ref: 47282000226
+Ref: 47292000245
+Ref: 47302000282
+Ref: S02522000282
+Ref: 47312000286
+Ref: 47322000789
+Ref: 47332000789
+Ref: 47342000789
+Ref: 47352000789
+Ref: 47362000789
+Ref: 47372001098
+Ref: 47382002273
+Ref: 47392002273
+Ref: 47402002499
+Ref: 47412002796
+Ref: 47422003793
+Ref: 47432003935
+Ref: 47442004306
+Ref: 47452004306
+Ref: 47462004306
+Ref: 47472004306
+Ref: 47482004573
+Ref: 47492004697
+Ref: 47502007342
+Ref: 47512016764
+Ref: 47522016765
+Ref: 47532029270
+Ref: 47542030241
+Node: 10.1.22030935
+Ref: 47552031255
+Ref: 47562031669
+Ref: 47572032399
+Ref: S02532032399
+Ref: 47582032405
+Ref: 47592032439
+Ref: S02542032439
+Ref: 47602032443
+Ref: 47612032458
+Ref: 47622032557
+Ref: S02552032557
+Ref: 47632032561
+Ref: 47642032584
+Ref: 47652032638
+Ref: S02562032638
+Ref: 47662032681
+Ref: 47672032710
+Ref: 47682032751
+Ref: S02572032751
+Ref: 47692032786
+Ref: 47702032815
+Ref: 47712033001
+Ref: 47722033532
+Ref: 47732035243
+Ref: 47742035244
+Ref: 47752035306
+Ref: 47762035307
+Ref: 47772050091
+Ref: 47782051377
+Ref: 47792051816
+Ref: 47802052133
+Ref: 47812052547
+Node: 10.1.32053443
+Ref: 47822053976
+Ref: S02582053976
+Ref: 47832053980
+Ref: 47842054004
+Ref: 47852054024
+Ref: 47862054047
+Ref: 47872054160
+Ref: S02592054160
+Ref: 47882054174
+Ref: 47892054204
+Ref: 47902054253
+Ref: 47912054515
+Ref: S02602054515
+Ref: 47922054541
+Ref: 47932054585
+Ref: 47942054659
+Ref: S02612054659
+Ref: 47952054682
+Ref: 47962054726
+Ref: 47972054805
+Ref: S02622054805
+Ref: 47982054833
+Ref: 47992054877
+Ref: 48002054915
+Ref: S02632054915
+Ref: 48012054930
+Ref: 48022054948
+Ref: 48032055040
+Ref: 48042055136
+Ref: 48052055405
+Ref: 48062056601
+Ref: 48072057033
+Ref: 48082057224
+Ref: 48092060265
+Ref: 48102060557
+Ref: 48112060907
+Node: 10.1.42061028
+Ref: 48122061172
+Ref: 48132061172
+Ref: 48142064259
+Ref: 48152065438
+Ref: 48162071800
+Ref: 48172072219
+Ref: 48182073645
+Node: 10.1.52074900
+Ref: 48192075194
+Ref: 48202075194
+Ref: 48212075251
+Ref: 48222077750
+Ref: 48232077751
+Ref: 48242077751
+Ref: 48252077751
+Ref: 48262078705
+Ref: 48272078705
+Node: 10.1.62081596
+Ref: 48282082083
+Ref: 48292082084
+Ref: 48302082084
+Ref: 48312082084
+Ref: 48322083808
+Ref: 48332083808
+Ref: 48342083808
+Ref: 48352083808
+Ref: 48362084681
+Ref: 48372084681
+Ref: 48382085054
+Ref: 48392085054
+Ref: 48402085283
+Node: 10.22087228
+Ref: 48412087335
+Ref: 48422087335
+Ref: 48432087335
+Ref: 48442087564
+Ref: 48452087564
+Ref: 48462087771
+Ref: 48472088260
+Ref: 48482088261
+Ref: 48492088261
+Ref: 48502090760
+Ref: 48512092422
+Ref: 48522093030
+Ref: 48532093032
+Ref: 48542095459
+Ref: 48552098750
+Ref: 48562098751
+Ref: 48572100622
+Ref: 48582100743
+Ref: 48592101775
+Ref: 48602101776
+Ref: 48612101776
+Ref: 48622101776
+Ref: 48632101776
+Ref: 48642101995
+Ref: 48652101995
+Ref: 48662102259
+Ref: 48672104555
+Ref: 48682110871
+Node: 10.2.12111769
+Ref: 48692111876
+Ref: 48702114135
+Ref: 48712114136
+Ref: 48722114165
+Ref: 48732114176
+Ref: 48742114181
+Ref: 48752114362
+Ref: 48762114363
+Ref: 48772114392
+Ref: 48782114454
+Ref: 48792117073
+Ref: 48802118942
+Ref: 48812119089
+Ref: 48822119089
+Ref: 48832119475
+Ref: 48842119638
+Ref: 48852120595
+Ref: 48862123203
+Ref: 48872125438
+Ref: 48882125439
+Ref: 48892125460
+Ref: 48902125472
+Ref: 48912125477
+Ref: 48922125628
+Ref: 48932130515
+Ref: 48942130616
+Ref: 48952130616
+Ref: 48962131048
+Ref: 48972136411
+Ref: 48982136412
+Ref: 48992136437
+Ref: 49002136459
+Ref: 49012136484
+Ref: 49022136485
+Ref: 49032136514
+Ref: 49042136536
+Ref: 49052136561
+Ref: 49062136562
+Ref: 49072136593
+Ref: 49082136905
+Ref: 49092136910
+Ref: 49102137314
+Ref: 49112137474
+Ref: 49122138923
+Ref: 49132138923
+Ref: 49142141586
+Ref: 49152142039
+Ref: 49162143708
+Ref: 49172144871
+Ref: 49182146082
+Node: 112148758
+Ref: 49192149013
+Ref: 49202149015
+Ref: 49212149015
+Ref: 49222149015
+Ref: 49232149015
+Ref: 49242149015
+Ref: 49252149161
+Ref: 49262149305
+Ref: 49272149441
+Ref: 49282149788
+Node: 11.12151596
+Ref: 49292151713
+Ref: 49302151871
+Ref: S02642151871
+Ref: 49312151875
+Ref: 49322151927
+Ref: 49332153562
+Ref: 49342153562
+Ref: 49352153562
+Ref: 49362153562
+Ref: 49372153562
+Ref: 49382153973
+Ref: 49392154035
+Ref: 49402154035
+Ref: 49412154035
+Ref: 49422154139
+Ref: 49432154639
+Ref: 49442155799
+Node: 11.22155932
+Ref: 49452156212
+Ref: S02652156212
+Ref: 49462156227
+Ref: 49472156278
+Ref: 49482156306
+Ref: 49492156351
+Ref: S02662156351
+Ref: 49502156369
+Ref: 49512156402
+Ref: 49522156422
+Ref: 49532156459
+Ref: 49542156520
+Ref: S02672156520
+Ref: 49552156524
+Ref: 49562156569
+Ref: S02682156569
+Ref: 49572156586
+Ref: 49582156628
+Ref: 49592156738
+Ref: 49602156979
+Ref: 49612158401
+Ref: 49622158746
+Ref: 49632159407
+Node: 11.32160531
+Ref: 49642160831
+Ref: S02692160831
+Ref: 49652160874
+Ref: 49662160894
+Ref: 49672160994
+Ref: S02702160994
+Ref: 49682161017
+Ref: 49692161037
+Ref: 49702165856
+Ref: 49712166553
+Ref: 49722166657
+Ref: 49732167020
+Ref: 49742168959
+Ref: 49752169419
+Node: 11.42169758
+Ref: 49762170029
+Ref: 49772170106
+Ref: 49782170764
+Ref: 49792170764
+Ref: 49802171021
+Ref: 49812171187
+Ref: 49822171188
+Ref: 49832172544
+Ref: 49842173897
+Ref: 49852174092
+Ref: 49862174093
+Ref: 49872174286
+Ref: 49882174286
+Ref: 49892174286
+Node: 11.4.12176029
+Ref: 49902176360
+Ref: 49912176465
+Ref: 49922176554
+Ref: 49932176610
+Ref: 49942176677
+Ref: 49952176754
+Ref: 49962176886
+Ref: 49972177009
+Ref: 49982177077
+Ref: 49992177213
+Ref: 50002177359
+Ref: 50012177437
+Ref: 50022177540
+Ref: 50032177661
+Ref: 50042177800
+Ref: 50052177967
+Ref: 50062178149
+Ref: 50072178267
+Ref: 50082178406
+Ref: 50092179692
+Ref: 50102179707
+Ref: 50112181291
+Ref: 50122184942
+Ref: 50132197299
+Ref: 50142197494
+Ref: 50152199411
+Ref: 50162200063
+Node: 11.4.22201030
+Ref: 50172201683
+Ref: 50182201683
+Ref: 50192203052
+Ref: 50202203053
+Ref: 50212203081
+Ref: 50222203121
+Ref: 50232203359
+Ref: 50242203360
+Ref: 50252203386
+Ref: 50262203446
+Ref: 50272203447
+Ref: 50282203491
+Ref: 50292203515
+Ref: 50302203551
+Ref: 50312203575
+Ref: 50322203625
+Ref: 50332203626
+Ref: 50342207557
+Ref: 50352207630
+Ref: 50362207688
+Ref: 50372207734
+Ref: 50382208581
+Ref: 50392208581
+Ref: 50402213744
+Ref: 50412213922
+Ref: 50422214814
+Node: 11.4.32214953
+Node: 11.52217789
+Ref: 50432217962
+Ref: 50442218234
+Ref: 50452218235
+Ref: 50462218235
+Ref: 50472218235
+Ref: 50482218235
+Ref: 50492218438
+Ref: 50502218858
+Ref: 50512218859
+Ref: 50522218868
+Ref: 50532218932
+Ref: 50542218933
+Ref: 50552218944
+Ref: 50562218997
+Ref: 50572218998
+Ref: 50582218998
+Ref: 50592218998
+Ref: 50602220651
+Ref: 50612220880
+Ref: 50622221525
+Ref: 50632221732
+Ref: 50642222006
+Ref: 50652222327
+Ref: 50662222456
+Ref: 50672223024
+Ref: 50682223234
+Ref: 50692223497
+Ref: 50702224090
+Ref: 50712224376
+Ref: 50722224522
+Ref: 50732224644
+Ref: 50742224938
+Ref: 50752225421
+Ref: 50762225421
+Ref: 50772226297
+Ref: 50782227666
+Ref: 50792228165
+Ref: 50802229877
+Ref: 50812229877
+Ref: 50822230746
+Ref: 50832232690
+Node: 11.62235009
+Ref: 50842235166
+Ref: 50852235166
+Ref: 50862235167
+Ref: 50872235167
+Ref: 50882235167
+Ref: 50892235167
+Ref: 50902235393
+Ref: 50912237722
+Ref: 50922237722
+Ref: 50932240843
+Ref: 50942241585
+Ref: 50952241757
+Ref: 50962241759
+Ref: 50972241759
+Node: 122247987
+Ref: 50982248090
+Ref: 50992248182
+Ref: 51002248414
+Ref: 51012248416
+Ref: 51022248416
+Node: 12.12250255
+Ref: 51032250783
+Ref: S02712250783
+Ref: 51042250787
+Ref: 51052250821
+Ref: 51062250922
+Ref: S02722250922
+Ref: 51072250937
+Ref: 51082250958
+Ref: 51092250997
+Ref: 51102251055
+Ref: S02732251055
+Ref: 51112251070
+Ref: 51122251091
+Ref: 51132251410
+Ref: S02742251410
+Ref: 51142251424
+Ref: 51152251469
+Ref: 51162251525
+Ref: S02752251525
+Ref: 51172251541
+Ref: 51182251578
+Ref: 51192251613
+Ref: 51202251654
+Ref: 51212252367
+Ref: 51222252368
+Ref: 51232252368
+Ref: 51242252368
+Ref: 51252252495
+Ref: 51262252947
+Ref: 51272255717
+Ref: 51282257090
+Node: 12.22257285
+Ref: 51292257399
+Ref: 51302257726
+Node: 12.32259677
+Ref: 51312259806
+Ref: 51322259972
+Ref: 51332259973
+Ref: 51342261182
+Ref: S02762261182
+Ref: 51352261205
+Ref: 51362261271
+Ref: 51372261277
+Ref: 51382261316
+Ref: 51392261350
+Ref: 51402261392
+Ref: 51412261460
+Ref: 51422261466
+Ref: 51432261505
+Ref: 51442261539
+Ref: 51452261580
+Ref: 51462261640
+Ref: 51472261646
+Ref: 51482261685
+Ref: 51492261735
+Ref: S02772261735
+Ref: 51502261749
+Ref: 51512261772
+Ref: 51522261821
+Ref: S02782261821
+Ref: 51532261862
+Ref: 51542261880
+Ref: 51552261961
+Ref: S02792261961
+Ref: 51562261965
+Ref: 51572261990
+Ref: 51582262018
+Ref: 51592262033
+Ref: 51602262040
+Ref: 51612262082
+Ref: 51622262090
+Ref: 51632262095
+Ref: 51642262366
+Ref: 51652262367
+Ref: 51662262367
+Ref: 51672267434
+Ref: 51682269796
+Ref: 51692271547
+Ref: 51702275843
+Ref: 51712275844
+Ref: 51722276351
+Ref: 51732276353
+Ref: 51742276353
+Ref: 51752276353
+Ref: 51762276353
+Ref: 51772276353
+Ref: 51782276353
+Ref: 51792276353
+Ref: 51802286113
+Ref: 51812290577
+Ref: 51822290960
+Ref: 51832291200
+Ref: 51842296785
+Ref: 51852297072
+Ref: 51862297586
+Ref: 51872300101
+Ref: 51882300291
+Node: 12.42300645
+Ref: 51892300760
+Ref: 51902300760
+Ref: 51912301343
+Ref: S02802301343
+Ref: 51922301357
+Ref: 51932301384
+Ref: 51942301390
+Ref: 51952301406
+Ref: 51962301429
+Ref: 51972301463
+Ref: 51982301496
+Ref: 51992301523
+Ref: 52002301528
+Ref: 52012301550
+Ref: 52022301590
+Ref: 52032301665
+Ref: 52042301775
+Ref: 52052302465
+Ref: 52062303840
+Ref: 52072303975
+Ref: 52082304622
+Ref: 52092305432
+Ref: 52102305579
+Ref: 52112306870
+Ref: 52122306871
+Ref: 52132306871
+Ref: 52142307764
+Ref: 52152308079
+Ref: 52162308079
+Ref: 52172308357
+Ref: 52182309319
+Ref: 52192310653
+Ref: 52202311569
+Node: 12.52311706
+Ref: 52212312575
+Ref: S02812312575
+Ref: 52222312591
+Ref: 52232312635
+Ref: 52242312773
+Ref: S02822312773
+Ref: 52252312792
+Ref: 52262312812
+Ref: 52272312834
+Ref: 52282312877
+Ref: 52292312973
+Ref: S02832312973
+Ref: 52302312992
+Ref: 52312313012
+Ref: 52322313107
+Ref: S02842313107
+Ref: 52332313123
+Ref: 52342313165
+Ref: 52352313207
+Ref: 52362313250
+Ref: 52372313299
+Ref: 52382313341
+Ref: 52392313385
+Ref: 52402313435
+Ref: 52412313484
+Ref: 52422313524
+Ref: 52432313565
+Ref: 52442313646
+Ref: 52452313646
+Ref: 52462313646
+Ref: 52472313646
+Ref: 52482314130
+Ref: 52492314130
+Ref: 52502314130
+Ref: 52512314130
+Ref: 52522314447
+Ref: 52532314448
+Ref: 52542323875
+Node: 12.5.12324688
+Ref: 52552326041
+Ref: S02852326041
+Ref: 52562326227
+Ref: S02862326227
+Ref: 52572326282
+Ref: 52582326301
+Ref: 52592326944
+Ref: 52602326945
+Ref: 52612335170
+Ref: 52622339882
+Ref: 52632339897
+Ref: 52642341880
+Ref: 52652344639
+Ref: 52662345566
+Ref: 52672346993
+Ref: 52682347359
+Ref: 52692348852
+Node: 12.5.22349816
+Ref: 52702350816
+Ref: S02872350816
+Ref: 52712350871
+Ref: S02882350871
+Ref: 52722350923
+Ref: S02892350923
+Ref: 52732350975
+Ref: S02902350975
+Ref: 52742351036
+Ref: S02912351036
+Ref: 52752351095
+Ref: S02922351095
+Node: 12.5.32352312
+Ref: 52762352982
+Ref: S02932352982
+Ref: 52772352986
+Ref: 52782353829
+Ref: 52792353928
+Ref: 52802354991
+Node: 12.5.42355744
+Ref: 52812356419
+Ref: S02942356419
+Ref: 52822356423
+Ref: 52832356609
+Ref: 52842358433
+Ref: 52852359131
+Ref: 52862359562
+Ref: 52872360143
+Node: 12.5.52360798
+Ref: 52882361862
+Ref: S02952361862
+Ref: 52892361867
+Ref: 52902363345
+Node: 12.62363391
+Ref: 52912363514
+Ref: 52922363514
+Ref: 52932363865
+Ref: S02962363865
+Ref: 52942363869
+Ref: 52952363925
+Ref: 52962364077
+Ref: S02972364077
+Ref: 52972364097
+Ref: 52982364126
+Ref: 52992364160
+Ref: 53002364296
+Ref: S02982364296
+Ref: 53012364316
+Ref: 53022364354
+Ref: 53032364388
+Ref: 53042364470
+Ref: S02992364470
+Ref: 53052364474
+Ref: 53062364525
+Ref: S03002364525
+Ref: 53072364529
+Ref: 53082365654
+Ref: 53092366136
+Ref: 53102366390
+Ref: 53112366665
+Ref: 53122367443
+Ref: 53132368791
+Ref: 53142369494
+Ref: 53152374799
+Ref: 53162381087
+Ref: 53172381694
+Ref: 53182382311
+Node: 12.72383041
+Ref: 53192383158
+Ref: 53202383158
+Ref: 53212383523
+Ref: S03012383523
+Ref: 53222383550
+Ref: 53232383595
+Ref: 53242383607
+Ref: 53252383648
+Ref: 53262383738
+Ref: S03022383738
+Ref: 53272383779
+Ref: 53282383810
+Ref: 53292383840
+Ref: 53302383961
+Ref: S03032383961
+Ref: 53312383975
+Ref: 53322384031
+Ref: 53332384248
+Ref: 53342387917
+Ref: 53352388398
+Ref: 53362392422
+Ref: 53372392594
+Ref: 53382393515
+Ref: 53392394210
+Node: 12.82394348
+Node: 132396854
+Node: 13.12398014
+Ref: 53402398249
+Ref: 53412399164
+Ref: 53422399165
+Ref: 53432399165
+Ref: 53442399703
+Ref: 53452401594
+Ref: S03042401594
+Ref: S03052401594
+Ref: 53462401603
+Ref: 53472401645
+Ref: 53482401692
+Ref: 53492401734
+Ref: 53502401762
+Ref: S03062401762
+Ref: 53512401766
+Ref: 53522401792
+Ref: 53532401804
+Ref: 53542401853
+Ref: 53552402036
+Ref: 53562406064
+Ref: 53572406065
+Ref: 53582406578
+Ref: 53592406873
+Ref: 53602406874
+Ref: 53612410806
+Ref: 53622410807
+Ref: 53632410807
+Ref: 53642411083
+Ref: 53652411085
+Ref: 53662411085
+Ref: 53672411085
+Ref: 53682416455
+Ref: 53692416457
+Ref: 53702416457
+Ref: 53712416457
+Ref: 53722428981
+Ref: 53732434996
+Ref: 53742435452
+Ref: 53752436931
+Ref: 53762437443
+Ref: 53772437680
+Ref: 53782437680
+Ref: 53792437682
+Ref: 53802437682
+Ref: 53812437682
+Ref: 53822437789
+Ref: 53832438346
+Ref: 53842439466
+Ref: 53852446287
+Ref: 53862446950
+Ref: 53872449395
+Ref: 53882451846
+Ref: 53892453833
+Node: 13.1.12454982
+Ref: 53902455408
+Ref: 53912455507
+Ref: S03072455507
+Ref: 53922455525
+Ref: 53932455541
+Ref: 53942455579
+Ref: 53952455595
+Ref: 53962455664
+Ref: S03082455664
+Ref: 53972455678
+Ref: 53982455757
+Ref: S03092455757
+Ref: 53992455761
+Ref: 54002455769
+Ref: 54012455788
+Ref: 54022460989
+Ref: 54032461309
+Ref: 54042461520
+Ref: 54052461520
+Ref: 54062461715
+Ref: 54072466719
+Ref: 54082466921
+Ref: 54092466963
+Ref: 54102467952
+Ref: 54112469779
+Ref: 54122470150
+Ref: 54132470269
+Ref: 54142470269
+Ref: 54152470458
+Ref: 54162470649
+Ref: 54172471713
+Ref: 54182474929
+Ref: 54192475059
+Node: 13.22476334
+Ref: 54202478700
+Ref: 54212478702
+Ref: 54222478702
+Ref: 54232480188
+Ref: 54242482926
+Node: 13.32483887
+Ref: 54252484112
+Ref: 54262484112
+Ref: 54272484262
+Ref: 54282484695
+Ref: S03102484695
+Ref: 54292484715
+Ref: 54302484726
+Ref: 54312484751
+Ref: 54322484778
+Ref: 54332484789
+Ref: 54342484814
+Ref: 54352485051
+Ref: 54362485219
+Ref: 54372486461
+Ref: 54382486462
+Ref: 54392486664
+Ref: 54402486707
+Ref: 54412487761
+Ref: 54422488097
+Ref: 54432488098
+Ref: 54442488098
+Ref: 54452488098
+Ref: 54462488098
+Ref: 54472488098
+Ref: 54482488098
+Ref: 54492488098
+Ref: 54502488098
+Ref: 54512488098
+Ref: 54522488098
+Ref: 54532488098
+Ref: 54542488098
+Ref: 54552488098
+Ref: 54562488098
+Ref: 54572488276
+Ref: 54582488277
+Ref: 54592488463
+Ref: 54602488463
+Ref: 54612488536
+Ref: 54622489842
+Ref: 54632491051
+Ref: 54642491066
+Ref: 54652491850
+Ref: 54662491865
+Ref: 54672491986
+Ref: 54682491986
+Ref: 54692494489
+Ref: 54702495968
+Ref: 54712500098
+Ref: 54722500113
+Ref: 54732501260
+Ref: 54742501261
+Ref: 54752501779
+Ref: 54762501794
+Ref: 54772502304
+Ref: 54782502305
+Ref: 54792502528
+Ref: 54802502528
+Ref: 54812502677
+Ref: 54822503015
+Ref: 54832504314
+Ref: 54842506507
+Ref: 54852513778
+Ref: 54862513793
+Ref: 54872514144
+Ref: 54882514159
+Ref: 54892514347
+Ref: 54902514347
+Ref: 54912514767
+Ref: 54922515123
+Ref: 54932515138
+Ref: 54942515748
+Ref: 54952515750
+Ref: 54962516185
+Ref: 54972516185
+Ref: 54982520894
+Ref: 54992522312
+Ref: 55002526279
+Ref: 55012533002
+Ref: 55022533812
+Ref: 55032533827
+Ref: 55042535861
+Ref: 55052535861
+Ref: 55062537681
+Ref: 55072537681
+Ref: 55082537681
+Ref: 55092538019
+Ref: 55102538034
+Ref: 55112538185
+Ref: 55122538200
+Ref: 55132538425
+Ref: 55142538425
+Ref: 55152538993
+Ref: 55162540599
+Ref: 55172540614
+Ref: 55182541777
+Ref: 55192541792
+Ref: 55202543187
+Ref: 55212543202
+Ref: 55222543297
+Ref: 55232543298
+Ref: 55242543620
+Ref: 55252543620
+Ref: 55262550596
+Ref: 55272553600
+Ref: 55282554714
+Ref: 55292555240
+Node: 13.42556119
+Ref: 55302556449
+Ref: S03112556449
+Ref: 55312556483
+Ref: 55322556498
+Ref: 55332556550
+Ref: S03122556550
+Ref: 55342556554
+Ref: 55352556623
+Ref: 55362558196
+Ref: 55372558281
+Ref: 55382558426
+Ref: 55392558426
+Ref: 55402559687
+Ref: 55412562348
+Node: 13.52563332
+Ref: 55422563444
+Ref: 55432563444
+Ref: 55442563444
+Ref: 55452563444
+Ref: 55462563444
+Ref: 55472563444
+Ref: 55482563444
+Ref: 55492563444
+Ref: 55502563444
+Node: 13.5.12563815
+Ref: 55512564146
+Ref: 55522564675
+Ref: S03132564675
+Ref: 55532564709
+Ref: 55542564743
+Ref: 55552564769
+Ref: 55562564834
+Ref: S03142564834
+Ref: 55572564860
+Ref: 55582564874
+Ref: 55592564889
+Ref: 55602564902
+Ref: 55612564928
+Ref: S03152564928
+Ref: 55622564942
+Ref: 55632564970
+Ref: S03162564970
+Ref: 55642564984
+Ref: 55652565018
+Ref: S03172565018
+Ref: 55662565032
+Ref: 55672565298
+Ref: 55682565298
+Ref: 55692565298
+Ref: 55702565298
+Ref: 55712571917
+Ref: 55722572631
+Ref: 55732579603
+Ref: 55742580352
+Node: 13.5.22580567
+Ref: 55752580759
+Ref: 55762581069
+Ref: 55772581084
+Ref: 55782582202
+Ref: 55792582217
+Ref: 55802582868
+Ref: 55812582883
+Ref: 55822584034
+Ref: 55832584034
+Ref: 55842585547
+Node: 13.5.32585930
+Ref: 55852586882
+Ref: 55862586969
+Ref: 55872586971
+Ref: 55882586971
+Ref: 55892587206
+Ref: 55902587208
+Ref: 55912587208
+Ref: 55922587422
+Ref: 55932587437
+Ref: 55942587552
+Ref: 55952587554
+Ref: 55962587736
+Ref: 55972587736
+Ref: 55982588085
+Ref: 55992589225
+Ref: 56002590574
+Node: 13.62590811
+Ref: 56012590975
+Ref: 56022590975
+Node: 13.72592669
+Ref: 56032593189
+Ref: 56042593252
+Ref: 56052593306
+Ref: 56062593422
+Ref: 56072593488
+Ref: 56082593556
+Ref: 56092593626
+Ref: 56102593699
+Ref: 56112593763
+Ref: 56122593836
+Ref: 56132593906
+Ref: 56142593980
+Ref: 56152594111
+Ref: 56162594151
+Ref: 56172594196
+Ref: 56182594257
+Ref: 56192594333
+Ref: 56202594436
+Ref: 56212595164
+Ref: 56222595178
+Ref: 56232595196
+Ref: 56242595217
+Ref: 56252595372
+Ref: 56262595444
+Ref: 56272595557
+Ref: 56282595661
+Ref: 56292600283
+Ref: 56302603492
+Ref: 56312605261
+Node: 13.7.12606125
+Ref: 56322606420
+Ref: 56332606510
+Ref: 56342606579
+Ref: 56352606657
+Ref: 56362606770
+Ref: 56372606931
+Ref: 56382607705
+Ref: 56392607767
+Ref: 56402607876
+Ref: 56412608690
+Ref: 56422608692
+Ref: 56432609817
+Ref: 56442611564
+Node: 13.7.22611733
+Ref: 56452612024
+Ref: 56462612294
+Ref: 56472612402
+Ref: 56482612858
+Node: 13.82615843
+Ref: 56492615976
+Ref: 56502616163
+Ref: S03182616163
+Ref: 56512616167
+Ref: 56522616864
+Ref: 56532617536
+Ref: 56542617536
+Ref: 56552619824
+Ref: 56562620092
+Ref: 56572620105
+Node: 13.92620228
+Ref: 56582620368
+Ref: 56592620368
+Ref: 56602620369
+Ref: 56612620369
+Ref: 56622620369
+Ref: 56632620732
+Ref: 56642621979
+Ref: 56652621979
+Ref: 56662626758
+Ref: 56672626989
+Ref: 56682626989
+Node: 13.9.12628182
+Ref: 56692628645
+Ref: 56702628851
+Ref: 56712628851
+Ref: 56722629154
+Ref: 56732630982
+Ref: 56742631228
+Ref: 56752632743
+Ref: 56762632743
+Ref: 56772633004
+Ref: 56782633006
+Ref: 56792634748
+Ref: 56802640860
+Ref: 56812643493
+Ref: 56822643639
+Node: 13.9.22644217
+Ref: 56832644665
+Ref: 56842644680
+Ref: 56852644972
+Ref: 56862648418
+Node: 13.102649455
+Ref: 56872649927
+Ref: 56882649942
+Ref: 56892650234
+Ref: 56902651307
+Node: 13.112653259
+Ref: 56912653387
+Ref: 56922653388
+Ref: 56932653388
+Ref: 56942653388
+Ref: 56952655757
+Ref: 56962655896
+Ref: 56972656080
+Ref: 56982656342
+Ref: 56992656604
+Ref: 57002656988
+Ref: 57012656988
+Ref: 57022657064
+Ref: 57032657066
+Ref: 57042657066
+Ref: 57052657618
+Ref: 57062657633
+Ref: 57072657765
+Ref: 57082657780
+Ref: 57092658456
+Ref: 57102658456
+Ref: 57112658456
+Ref: 57122658456
+Ref: 57132658656
+Ref: 57142658656
+Ref: 57152658656
+Ref: 57162658656
+Ref: 57172660446
+Ref: 57182660632
+Ref: 57192660634
+Ref: 57202660634
+Ref: 57212661594
+Ref: 57222661604
+Ref: 57232662102
+Ref: 57242663605
+Ref: 57252664292
+Ref: 57262668385
+Ref: 57272668385
+Ref: 57282668387
+Ref: 57292682781
+Ref: 57302683931
+Ref: 57312684521
+Node: 13.11.12686778
+Ref: 57322687255
+Ref: 57332687270
+Ref: 57342687898
+Ref: 57352687913
+Ref: 57362689713
+Node: 13.11.22689776
+Ref: 57372689941
+Ref: 57382689941
+Ref: 57392689942
+Ref: 57402689942
+Ref: 57412689942
+Ref: 57422690355
+Ref: 57432691006
+Ref: 57442692755
+Ref: 57452692756
+Ref: 57462692756
+Ref: 57472692756
+Ref: 57482692994
+Ref: 57492693323
+Ref: 57502693323
+Ref: 57512693412
+Ref: 57522693412
+Ref: 57532694130
+Ref: 57542694130
+Ref: 57552694696
+Ref: 57562694838
+Ref: 57572694840
+Ref: 57582697221
+Ref: 57592697222
+Ref: 57602701625
+Node: 13.11.32703441
+Ref: 57612704064
+Ref: 57622704065
+Ref: 57632704093
+Ref: 57642704211
+Ref: S03192704211
+Ref: 57652704231
+Ref: 57662706569
+Ref: 57672706569
+Ref: 57682706569
+Ref: 57692708101
+Ref: 57702708101
+Ref: 57712712949
+Ref: 57722713894
+Ref: 57732714804
+Node: 13.11.42715251
+Ref: 57742715835
+Ref: 57752715939
+Ref: 57762716048
+Ref: 57772716115
+Ref: 57782716233
+Ref: 57792716479
+Ref: 57802716619
+Ref: 57812716777
+Ref: 57822717189
+Ref: 57832717446
+Ref: 57842717620
+Ref: 57852717906
+Ref: 57862718227
+Ref: 57872718525
+Ref: 57882718526
+Ref: 57892718526
+Ref: 57902718526
+Ref: 57912718526
+Ref: 57922719564
+Ref: 57932721614
+Ref: 57942721614
+Ref: 57952722113
+Ref: 57962722778
+Ref: 57972722778
+Ref: 57982722889
+Ref: 57992722889
+Ref: 58002722978
+Ref: 58012724309
+Ref: 58022724309
+Ref: 58032724309
+Ref: 58042724844
+Ref: 58052728377
+Node: 13.11.52729280
+Ref: 58062729708
+Ref: 58072730253
+Ref: 58082730359
+Ref: 58092731981
+Node: 13.11.62732538
+Node: 13.122739376
+Ref: 58102739963
+Ref: 58112739964
+Ref: 58122739977
+Ref: 58132739990
+Ref: 58142740058
+Ref: S03202740058
+Ref: 58152740077
+Ref: 58162740129
+Ref: 58172740143
+Ref: 58182740253
+Ref: S03212740253
+Ref: 58192740257
+Ref: 58202740270
+Ref: 58212740333
+Ref: 58222740772
+Ref: 58232740773
+Ref: 58242744352
+Ref: 58252744353
+Ref: 58262744372
+Ref: 58272744396
+Ref: 58282745053
+Ref: 58292745054
+Ref: 58302746473
+Ref: 58312746644
+Node: 13.12.12748032
+Ref: 58322748433
+Ref: 58332748434
+Ref: 58342749148
+Ref: 58352749149
+Ref: 58362749431
+Ref: 58372749432
+Ref: 58382751887
+Ref: 58392751888
+Ref: 58402752157
+Ref: 58412752158
+Ref: 58422752543
+Ref: 58432752544
+Ref: 58442753935
+Ref: 58452753936
+Ref: 58462754082
+Ref: 58472754083
+Ref: 58482754278
+Ref: 58492754279
+Ref: 58502754460
+Ref: 58512754461
+Ref: 58522757463
+Ref: 58532758069
+Ref: 58542758484
+Node: 13.132758815
+Ref: 58552758920
+Ref: 58562758920
+Ref: 58572759668
+Node: 13.13.12759791
+Ref: 58582760638
+Ref: 58592760695
+Ref: 58602760747
+Ref: 58612760937
+Ref: 58622760999
+Ref: 58632761073
+Ref: 58642761183
+Ref: 58652761307
+Ref: 58662761486
+Ref: 58672764581
+Node: 13.13.22765070
+Ref: 58682765440
+Ref: 58692765440
+Ref: 58702765644
+Ref: 58712765659
+Ref: 58722766455
+Ref: 58732766455
+Ref: 58742768373
+Ref: 58752769995
+Ref: 58762770010
+Ref: 58772770364
+Ref: 58782770379
+Ref: 58792776380
+Ref: 58802776395
+Ref: 58812776872
+Ref: 58822776887
+Ref: 58832777790
+Ref: 58842777805
+Ref: 58852778353
+Ref: 58862778368
+Ref: 58872781594
+Ref: 58882781609
+Ref: 58892782717
+Ref: 58902782732
+Ref: 58912783990
+Ref: 58922783991
+Ref: 58932784238
+Ref: 58942785985
+Ref: 58952786289
+Ref: 58962786664
+Ref: 58972786665
+Ref: 58982786665
+Ref: 58992786665
+Ref: 59002786665
+Ref: 59012786665
+Ref: 59022786665
+Ref: 59032786665
+Ref: 59042787213
+Ref: 59052787215
+Ref: 59062787215
+Ref: 59072787215
+Ref: 59082787215
+Ref: 59092787215
+Ref: 59102787215
+Ref: 59112787215
+Ref: 59122787215
+Ref: 59132787215
+Ref: 59142787215
+Ref: 59152787215
+Ref: 59162787215
+Ref: 59172787215
+Ref: 59182787215
+Ref: 59192787215
+Ref: 59202792445
+Ref: 59212795382
+Ref: 59222799409
+Ref: 59232799410
+Ref: 59242800466
+Ref: 59252806385
+Ref: 59262807597
+Ref: 59272811369
+Ref: 59282811842
+Ref: 59292813824
+Node: 13.142814865
+Ref: 59302823529
+Ref: 59312823529
+Ref: 59322824259
+Ref: 59332824693
+Ref: 59342824900
+Ref: 59352828197
+Ref: 59362828339
+Ref: 59372828677
+Ref: 59382830241
+Ref: 59392830448
+Ref: 59402832492
+Ref: 59412832589
+Ref: 59422833079
+Ref: 59432833321
+Ref: 59442833573
+Ref: 59452835626
+Ref: 59462835627
+Ref: 59472837274
+Ref: 59482837275
+Ref: 59492837941
+Ref: 59502838994
+Ref: 59512839137
+Ref: 59522839733
+Ref: 59532840133
+Ref: 59542840435
+Ref: 59552841392
+Ref: 59562841657
+Ref: 59572841716
+Ref: 59582841718
+Ref: 59592841961
+Ref: 59602841963
+Ref: 59612848675
+Ref: 59622850430
+Ref: 59632850490
+Ref: 59642851492
+Ref: 59652855779
+Ref: 59662857162
+Node: Annex A2858712
+Ref: 59672858872
+Ref: 59682858872
+Ref: 59692870451
+Node: A.12877737
+Ref: 59702878000
+Ref: 59712878208
+Ref: 59722878725
+Ref: 59732878797
+Ref: 59742880111
+Ref: 59752880174
+Ref: 59762880235
+Ref: 59772882150
+Ref: 59782884982
+Ref: 59792888941
+Ref: 59802889351
+Ref: 59812889494
+Ref: 59822889552
+Ref: 59832889639
+Ref: 59842890553
+Ref: 59852890800
+Ref: 59862891045
+Ref: 59872891296
+Ref: 59882891333
+Ref: 59892891370
+Ref: 59902891407
+Ref: 59912892403
+Ref: 59922896606
+Ref: 59932897418
+Node: A.22898304
+Ref: 59942898524
+Ref: 59952899991
+Node: A.32900026
+Ref: 59962900798
+Node: A.3.12901404
+Ref: 59972901725
+Ref: 59982901921
+Ref: 59992902137
+Ref: 60002903092
+Node: A.3.22903167
+Ref: 60012903582
+Ref: 60022903708
+Ref: 60032903783
+Ref: 60042903858
+Ref: 60052903933
+Ref: 60062904008
+Ref: 60072904083
+Ref: 60082904158
+Ref: 60092904233
+Ref: 60102904351
+Ref: 60112904426
+Ref: 60122904501
+Ref: 60132904576
+Ref: 60142904651
+Ref: 60152904726
+Ref: 60162904801
+Ref: 60172904880
+Ref: 60182905016
+Ref: 60192905081
+Ref: 60202905146
+Ref: 60212905214
+Ref: 60222905273
+Ref: 60232905332
+Ref: 60242905470
+Ref: 60252905566
+Ref: 60262905631
+Ref: 60272905700
+Ref: 60282905844
+Ref: 60292907019
+Ref: 60302907212
+Ref: 60312907407
+Ref: 60322907660
+Ref: 60332907903
+Ref: 60342908148
+Ref: 60352908409
+Ref: 60362908602
+Ref: 60372908838
+Ref: 60382909034
+Ref: 60392914401
+Ref: 60402914576
+Node: A.3.32915867
+Ref: 60412916627
+Ref: 60422916691
+Ref: 60432916699
+Ref: 60442916771
+Ref: 60452916843
+Ref: 60462916915
+Ref: 60472916987
+Ref: 60482917059
+Ref: 60492917131
+Ref: 60502917203
+Ref: 60512917275
+Ref: 60522917347
+Ref: 60532917419
+Ref: 60542917492
+Ref: 60552917565
+Ref: 60562917638
+Ref: 60572917711
+Ref: 60582917784
+Ref: 60592917860
+Ref: 60602917933
+Ref: 60612918006
+Ref: 60622918079
+Ref: 60632918152
+Ref: 60642918225
+Ref: 60652918298
+Ref: 60662918371
+Ref: 60672918444
+Ref: 60682918517
+Ref: 60692918590
+Ref: 60702918663
+Ref: 60712918736
+Ref: 60722918809
+Ref: 60732918882
+Ref: 60742918955
+Ref: 60752919072
+Ref: 60762919155
+Ref: 60772919238
+Ref: 60782919321
+Ref: 60792919404
+Ref: 60802919487
+Ref: 60812919570
+Ref: 60822919653
+Ref: 60832919736
+Ref: 60842919819
+Ref: 60852919902
+Ref: 60862919985
+Ref: 60872920068
+Ref: 60882920151
+Ref: 60892920234
+Ref: 60902920292
+Ref: 60912920375
+Ref: 60922920540
+Ref: 60932920623
+Ref: 60942920706
+Ref: 60952920789
+Ref: 60962920872
+Ref: 60972920955
+Ref: 60982921038
+Ref: 60992921198
+Ref: 61002921281
+Ref: 61012921364
+Ref: 61022921447
+Ref: 61032921530
+Ref: 61042921617
+Ref: 61052921700
+Ref: 61062921783
+Ref: 61072921866
+Ref: 61082921949
+Ref: 61092922033
+Ref: 61102922117
+Ref: 61112922201
+Ref: 61122922285
+Ref: 61132922369
+Ref: 61142922453
+Ref: 61152922537
+Ref: 61162922621
+Ref: 61172922705
+Ref: 61182922789
+Ref: 61192922873
+Ref: 61202922961
+Ref: 61212923045
+Ref: 61222923129
+Ref: 61232923213
+Ref: 61242923297
+Ref: 61252923381
+Ref: 61262923465
+Ref: 61272923549
+Ref: 61282923633
+Ref: 61292923717
+Ref: 61302923801
+Ref: 61312923885
+Ref: 61322923969
+Ref: 61332924053
+Ref: 61342924137
+Ref: 61352924221
+Ref: 61362924333
+Ref: 61372924342
+Ref: 61382924396
+Ref: 61392924450
+Ref: 61402924504
+Ref: 61412924562
+Ref: 61422924636
+Ref: 61432924710
+Ref: 61442924784
+Ref: 61452924858
+Ref: 61462924932
+Ref: 61472925006
+Ref: 61482925080
+Ref: 61492925154
+Ref: 61502925228
+Ref: 61512925302
+Ref: 61522925376
+Ref: 61532925450
+Ref: 61542925524
+Ref: 61552925598
+Ref: 61562925672
+Ref: 61572925750
+Ref: 61582925824
+Ref: 61592925898
+Ref: 61602925972
+Ref: 61612926046
+Ref: 61622926120
+Ref: 61632926194
+Ref: 61642926268
+Ref: 61652926346
+Ref: 61662926420
+Ref: 61672926494
+Ref: 61682926568
+Ref: 61692926642
+Ref: 61702926716
+Ref: 61712926790
+Ref: 61722926864
+Ref: 61732927071
+Ref: 61742927159
+Ref: 61752927231
+Ref: 61762927319
+Ref: 61772927407
+Ref: 61782927495
+Ref: 61792927583
+Ref: 61802927671
+Ref: 61812927759
+Ref: 61822927847
+Ref: 61832927935
+Ref: 61842928023
+Ref: 61852928111
+Ref: 61862928199
+Ref: 61872928287
+Ref: 61882928367
+Ref: 61892928455
+Ref: 61902928607
+Ref: 61912928695
+Ref: 61922928764
+Ref: 61932928852
+Ref: 61942928940
+Ref: 61952929028
+Ref: 61962929116
+Ref: 61972929204
+Ref: 61982929292
+Ref: 61992929362
+Ref: 62002929450
+Ref: 62012929538
+Ref: 62022929626
+Ref: 62032929714
+Ref: 62042929802
+Ref: 62052929890
+Ref: 62062929978
+Ref: 62072930066
+Ref: 62082930218
+Ref: 62092930306
+Ref: 62102930394
+Ref: 62112930482
+Ref: 62122930570
+Ref: 62132930658
+Ref: 62142930746
+Ref: 62152930834
+Ref: 62162930922
+Ref: 62172931010
+Ref: 62182931098
+Ref: 62192931186
+Ref: 62202931274
+Ref: 62212931362
+Ref: 62222931450
+Ref: 62232931538
+Ref: 62242931690
+Ref: 62252931778
+Ref: 62262931866
+Ref: 62272931954
+Ref: 62282932042
+Ref: 62292932130
+Ref: 62302932218
+Ref: 62312932306
+Ref: 62322932394
+Ref: 62332932482
+Ref: 62342932570
+Ref: 62352932658
+Ref: 62362932746
+Ref: 62372932834
+Ref: 62382932922
+Ref: 62392933010
+Ref: 62402933162
+Ref: 62412933250
+Ref: 62422933338
+Ref: 62432933426
+Ref: 62442933514
+Ref: 62452933602
+Ref: 62462933690
+Ref: 62472933778
+Ref: 62482933866
+Ref: 62492933954
+Ref: 62502934042
+Ref: 62512934130
+Ref: 62522934218
+Ref: 62532934306
+Ref: 62542934394
+Ref: 62552934482
+Ref: 62562934634
+Ref: 62572934722
+Ref: 62582934810
+Ref: 62592934898
+Ref: 62602934986
+Ref: 62612935074
+Ref: 62622935162
+Ref: 62632935250
+Ref: 62642935338
+Ref: 62652935426
+Ref: 62662935514
+Ref: 62672935602
+Ref: 62682935690
+Ref: 62692935778
+Ref: 62702935866
+Ref: 62712935954
+Node: A.3.42936617
+Ref: 62722936977
+Ref: 62732937034
+Ref: 62742937112
+Ref: 62752937190
+Ref: 62762937268
+Ref: 62772937346
+Ref: 62782937440
+Ref: 62792937536
+Ref: 62802937616
+Ref: 62812937693
+Ref: 62822937794
+Ref: 62832937889
+Ref: 62842937995
+Ref: 62852938100
+Ref: 62862938256
+Ref: 62872938407
+Ref: 62882938569
+Ref: 62892938725
+Ref: 62902938907
+Ref: 62912943856
+Node: A.3.52943982
+Ref: 62922944559
+Ref: 62932944640
+Ref: 62942944699
+Ref: 62952944772
+Ref: 62962944844
+Ref: 62972944915
+Ref: 62982944986
+Ref: 62992945058
+Ref: 63002945166
+Ref: 63012945250
+Ref: 63022945329
+Ref: 63032945403
+Ref: 63042945485
+Ref: 63052945556
+Ref: 63062945635
+Ref: 63072945723
+Ref: 63082945795
+Ref: 63092945869
+Ref: 63102945942
+Ref: 63112946021
+Ref: 63122946088
+Ref: 63132954447
+Node: A.3.62954504
+Ref: 63142954734
+Ref: 63152955027
+Node: A.42955089
+Ref: 63162955878
+Node: A.4.12956575
+Ref: 63172956884
+Ref: 63182956986
+Ref: 63192957034
+Ref: 63202957087
+Ref: 63212957153
+Ref: 63222957172
+Ref: 63232957187
+Ref: 63242957200
+Ref: 63252957247
+Ref: 63262957297
+Ref: 63272957346
+Ref: 63282957392
+Ref: 63292957440
+Ref: 63302957624
+Node: A.4.22958037
+Ref: 63312958469
+Ref: 63322958632
+Ref: 63332958724
+Ref: 63342958780
+Ref: 63352958966
+Ref: 63362959052
+Ref: 63372959134
+Ref: 63382959216
+Ref: 63392959771
+Ref: 63402959902
+Ref: 63412960264
+Ref: 63422960315
+Ref: 63432960400
+Ref: 63442960481
+Ref: 63452960662
+Ref: 63462960777
+Ref: 63472960900
+Ref: 63482960965
+Ref: 63492961069
+Ref: 63502961163
+Ref: 63512961257
+Ref: 63522965278
+Ref: 63532965397
+Ref: 63542967558
+Ref: 63552968314
+Node: A.4.32968938
+Ref: 63562970719
+Ref: 63572970882
+Ref: 63582971220
+Ref: 63592971559
+Ref: 63602971855
+Ref: 63612972154
+Ref: 63622972443
+Ref: 63632972741
+Ref: 63642973024
+Ref: 63652973233
+Ref: 63662973386
+Ref: 63672973626
+Ref: 63682973820
+Ref: 63692973987
+Ref: 63702974315
+Ref: 63712974635
+Ref: 63722974780
+Ref: 63732974904
+Ref: 63742975058
+Ref: 63752975239
+Ref: 63762975489
+Ref: 63772975923
+Ref: 63782976097
+Ref: 63792976312
+Ref: 63802976495
+Ref: 63812976722
+Ref: 63822976894
+Ref: 63832977201
+Ref: 63842977320
+Ref: 63852977533
+Ref: 63862977717
+Ref: 63872978005
+Ref: 63882978178
+Ref: 63892978390
+Ref: 63902978563
+Ref: 63912998998
+Ref: 63922999254
+Ref: 63933000308
+Node: A.4.43000928
+Ref: 63943002497
+Ref: 63953002678
+Ref: 63963002713
+Ref: 63973002776
+Ref: 63983002812
+Ref: 63993002886
+Ref: 64003002956
+Ref: 64013003105
+Ref: 64023003277
+Ref: 64033003391
+Ref: 64043003573
+Ref: 64053003742
+Ref: 64063003945
+Ref: 64073004148
+Ref: 64083004354
+Ref: 64093004561
+Ref: 64103004753
+Ref: 64113004937
+Ref: 64123005672
+Ref: 64133005817
+Ref: 64143006012
+Ref: 64153006232
+Ref: 64163006463
+Ref: 64173008216
+Ref: 64183008582
+Ref: 64193008905
+Ref: 64203009228
+Ref: 64213009540
+Ref: 64223009864
+Ref: 64233010170
+Ref: 64243010399
+Ref: 64253010569
+Ref: 64263010831
+Ref: 64273011045
+Ref: 64283011229
+Ref: 64293011583
+Ref: 64303011929
+Ref: 64313012099
+Ref: 64323012237
+Ref: 64333012416
+Ref: 64343012614
+Ref: 64353012965
+Ref: 64363013287
+Ref: 64373013552
+Ref: 64383013787
+Ref: 64393014068
+Ref: 64403014319
+Ref: 64413014519
+Ref: 64423014732
+Ref: 64433014872
+Ref: 64443014984
+Ref: 64453015196
+Ref: 64463015377
+Ref: 64473015638
+Ref: 64483015869
+Ref: 64493016130
+Ref: 64503016809
+Ref: 64513017017
+Ref: 64523017222
+Ref: 64533025035
+Ref: 64543025565
+Ref: 64553026754
+Node: A.4.53027236
+Ref: 64563028509
+Ref: 64573028636
+Ref: 64583028734
+Ref: 64593028810
+Ref: 64603028880
+Ref: 64613028934
+Ref: 64623029051
+Ref: 64633029149
+Ref: 64643029248
+Ref: 64653029361
+Ref: 64663029485
+Ref: 64673029610
+Ref: 64683029725
+Ref: 64693030381
+Ref: 64703030519
+Ref: 64713030707
+Ref: 64723030917
+Ref: 64733031139
+Ref: 64743032806
+Ref: 64753033156
+Ref: 64763033463
+Ref: 64773033772
+Ref: 64783034071
+Ref: 64793034380
+Ref: 64803034662
+Ref: 64813034881
+Ref: 64823035044
+Ref: 64833035293
+Ref: 64843035497
+Ref: 64853035674
+Ref: 64863036012
+Ref: 64873036342
+Ref: 64883036507
+Ref: 64893036641
+Ref: 64903036815
+Ref: 64913037006
+Ref: 64923037276
+Ref: 64933037517
+Ref: 64943037711
+Ref: 64953037875
+Ref: 64963038081
+Ref: 64973038257
+Ref: 64983038449
+Ref: 64993038611
+Ref: 65003038750
+Ref: 65013038858
+Ref: 65023039062
+Ref: 65033039236
+Ref: 65043039429
+Ref: 65053039592
+Ref: 65063039785
+Ref: 65073040488
+Ref: 65083044609
+Ref: 65093045863
+Ref: 65103046170
+Node: A.4.63046601
+Ref: 65113047393
+Ref: 65123047469
+Ref: 65133047525
+Ref: 65143047581
+Ref: 65153047637
+Ref: 65163047693
+Ref: 65173047749
+Ref: 65183047805
+Ref: 65193047861
+Ref: 65203047917
+Ref: 65213047973
+Ref: 65223048029
+Ref: 65233048088
+Ref: 65243048208
+Ref: 65253048328
+Ref: 65263049312
+Node: A.4.73049637
+Ref: 65273050683
+Ref: 65283050685
+Ref: 65293050685
+Ref: 65303050685
+Ref: 65313050685
+Ref: 65323050685
+Ref: 65333050685
+Ref: 65343050685
+Ref: 65353050685
+Ref: 65363050685
+Ref: 65373050685
+Ref: 65383050685
+Ref: 65393050685
+Ref: 65403050685
+Ref: 65413050685
+Ref: 65423050685
+Ref: 65433050799
+Ref: 65443050990
+Ref: 65453051092
+Ref: 65463051153
+Ref: 65473051361
+Ref: 65483051468
+Ref: 65493051572
+Ref: 65503051676
+Ref: 65513052355
+Ref: 65523052496
+Ref: 65533052883
+Ref: 65543052944
+Ref: 65553053051
+Ref: 65563053149
+Ref: 65573053361
+Ref: 65583053486
+Ref: 65593053624
+Ref: 65603053694
+Ref: 65613053808
+Ref: 65623053916
+Ref: 65633054020
+Ref: 65643056326
+Ref: 65653056997
+Ref: 65663057240
+Ref: 65673057828
+Ref: 65683058976
+Node: A.4.83059839
+Ref: 65693061066
+Ref: 65703061068
+Ref: 65713061068
+Ref: 65723061068
+Ref: 65733061068
+Ref: 65743061068
+Ref: 65753061068
+Ref: 65763061068
+Ref: 65773061068
+Ref: 65783061068
+Ref: 65793061068
+Ref: 65803061068
+Ref: 65813061068
+Ref: 65823061068
+Ref: 65833061068
+Ref: 65843061068
+Ref: 65853061272
+Ref: 65863061405
+Ref: 65873061519
+Ref: 65883061587
+Ref: 65893061819
+Ref: 65903061941
+Ref: 65913062057
+Ref: 65923062171
+Ref: 65933062931
+Ref: 65943063087
+Ref: 65953063509
+Ref: 65963063582
+Ref: 65973063703
+Ref: 65983063816
+Ref: 65993064032
+Ref: 66003064169
+Ref: 66013064327
+Ref: 66023064404
+Ref: 66033064533
+Ref: 66043064656
+Ref: 66053064774
+Ref: 66063065057
+Ref: 66073067312
+Ref: 66083067505
+Ref: 66093068278
+Ref: 66103068563
+Ref: 66113069006
+Node: A.4.93069959
+Ref: 66123070356
+Ref: 66133071153
+Ref: 66143071750
+Ref: 66153072181
+Ref: 66163072888
+Ref: 66173073326
+Ref: 66183073809
+Ref: 66193074774
+Ref: 66203074994
+Node: A.4.103075200
+Ref: 66213075618
+Ref: 66223077105
+Ref: 66233077562
+Ref: 66243078064
+Ref: 66253078522
+Ref: 66263078993
+Ref: 66273079449
+Ref: 66283079948
+Ref: 66293080305
+Node: A.4.113080709
+Ref: 66303081314
+Ref: 66313081469
+Ref: 66323081538
+Ref: 66333081581
+Ref: 66343081626
+Ref: 66353081669
+Ref: 66363081710
+Ref: 66373081894
+Ref: 66383082031
+Ref: 66393082168
+Ref: 66403082295
+Ref: 66413082504
+Ref: 66423082668
+Ref: 66433082925
+Ref: 66443083142
+Ref: 66453083302
+Ref: 66463083508
+Ref: 66473083725
+Ref: 66483083900
+Ref: 66493084092
+Ref: 66503084222
+Ref: 66513084369
+Ref: 66523084499
+Ref: 66533084566
+Ref: 66543084703
+Ref: 66553084893
+Ref: 66563085090
+Ref: 66573085225
+Ref: 66583085377
+Ref: 66593085512
+Ref: 66603085584
+Ref: 66613085731
+Ref: 66623085936
+Ref: 66633086138
+Ref: 66643086278
+Ref: 66653086435
+Ref: 66663086575
+Ref: 66673086652
+Ref: 66683087168
+Ref: 66693087168
+Ref: 66703087168
+Ref: 66713087168
+Ref: 66723098986
+Node: A.53099437
+Ref: 66733100159
+Ref: 66743100194
+Ref: 66753100230
+Ref: 66763100363
+Ref: 66773101207
+Ref: 66783101369
+Node: A.5.13101602
+Ref: 66793102346
+Ref: 66803102476
+Ref: 66813102557
+Ref: 66823102638
+Ref: 66833102719
+Ref: 66843102884
+Ref: 66853102965
+Ref: 66863103046
+Ref: 66873103127
+Ref: 66883103208
+Ref: 66893103289
+Ref: 66903103370
+Ref: 66913103451
+Ref: 66923103535
+Ref: 66933103616
+Ref: 66943103697
+Ref: 66953103778
+Ref: 66963103859
+Ref: 66973104061
+Ref: 66983104263
+Ref: 66993104465
+Ref: 67003104670
+Ref: 67013104751
+Ref: 67023104832
+Ref: 67033104913
+Ref: 67043104994
+Ref: 67053105075
+Ref: 67063105156
+Ref: 67073105237
+Ref: 67083105414
+Ref: 67093109895
+Ref: 67103109895
+Ref: 67113109895
+Ref: 67123110691
+Ref: 67133110943
+Ref: 67143113114
+Node: A.5.23117913
+Ref: 67153118340
+Ref: 67163119635
+Ref: 67173119685
+Ref: 67183119734
+Ref: 67193119800
+Ref: 67203119876
+Ref: 67213119977
+Ref: 67223120065
+Ref: 67233120105
+Ref: 67243120208
+Ref: 67253120300
+Ref: 67263120396
+Ref: 67273120457
+Ref: 67283120676
+Ref: 67293120788
+Ref: 67303120935
+Ref: 67313120986
+Ref: 67323121056
+Ref: 67333121157
+Ref: 67343121245
+Ref: 67353121285
+Ref: 67363121388
+Ref: 67373121480
+Ref: 67383121576
+Ref: 67393121637
+Ref: 67403123199
+Ref: 67413123510
+Ref: 67423126074
+Ref: 67433126310
+Ref: 67443127861
+Ref: 67453127861
+Ref: 67463127861
+Ref: 67473128251
+Ref: 67483128251
+Ref: 67493137449
+Node: A.5.33138978
+Ref: 67503139184
+Ref: 67513139316
+Ref: 67523139331
+Ref: 67533139494
+Ref: 67543140042
+Ref: 67553140057
+Ref: 67563140720
+Ref: 67573140735
+Ref: 67583141133
+Ref: 67593141148
+Ref: 67603141823
+Ref: 67613141838
+Ref: 67623142369
+Ref: 67633142469
+Ref: 67643142555
+Ref: 67653142557
+Ref: 67663143099
+Ref: 67673143114
+Ref: 67683144568
+Ref: 67693144583
+Ref: 67703144936
+Ref: 67713144951
+Ref: 67723145399
+Ref: 67733146026
+Ref: 67743146147
+Ref: 67753146162
+Ref: 67763146432
+Ref: 67773146447
+Ref: 67783147654
+Ref: 67793147669
+Ref: 67803147920
+Ref: 67813148318
+Ref: 67823148320
+Ref: 67833149002
+Ref: 67843149017
+Ref: 67853149263
+Ref: 67863149584
+Ref: 67873149586
+Ref: 67883150230
+Ref: 67893150245
+Ref: 67903150701
+Ref: 67913150716
+Ref: 67923151226
+Ref: 67933151241
+Ref: 67943151690
+Ref: 67953151705
+Ref: 67963152184
+Ref: 67973152199
+Ref: 67983152885
+Ref: 67993153311
+Ref: 68003153326
+Ref: 68013153722
+Ref: 68023153737
+Ref: 68033153916
+Ref: 68043154263
+Ref: 68053154265
+Ref: 68063154825
+Ref: 68073154840
+Ref: 68083155023
+Ref: 68093155261
+Ref: 68103155263
+Ref: 68113155800
+Ref: 68123155815
+Ref: 68133156001
+Ref: 68143156216
+Ref: 68153156218
+Ref: 68163157122
+Ref: 68173157137
+Ref: 68183157830
+Ref: 68193157845
+Ref: 68203157845
+Ref: 68213158595
+Ref: 68223158610
+Ref: 68233158780
+Ref: 68243159041
+Ref: 68253159043
+Ref: 68263161377
+Ref: 68273161500
+Ref: 68283161515
+Ref: 68293162118
+Ref: 68303162133
+Ref: 68313162556
+Ref: 68323162571
+Ref: 68333163081
+Ref: 68343163096
+Ref: 68353163927
+Ref: 68363163942
+Ref: 68373164382
+Ref: 68383164397
+Ref: 68393164838
+Ref: 68403164853
+Ref: 68413165849
+Ref: 68423167495
+Ref: 68433168068
+Node: A.5.43168119
+Ref: 68443168305
+Ref: 68453168434
+Ref: 68463168449
+Ref: 68473168629
+Ref: 68483168644
+Ref: 68493168958
+Ref: 68503168973
+Ref: 68513169365
+Ref: 68523169802
+Node: A.63169976
+Ref: 68533170120
+Ref: 68543170120
+Ref: 68553170870
+Ref: 68563171196
+Node: A.73171892
+Ref: 68573172086
+Ref: 68583172086
+Ref: 68593172086
+Ref: 68603172694
+Ref: 68613174458
+Ref: 68623174460
+Ref: 68633174460
+Ref: 68643174523
+Ref: 68653175882
+Ref: 68663175884
+Node: A.83177172
+Ref: 68673177390
+Ref: 68683177391
+Ref: 68693177391
+Ref: 68703177830
+Ref: 68713179720
+Ref: 68723179720
+Ref: 68733179720
+Ref: 68743180280
+Node: A.8.13180962
+Ref: 68753181345
+Ref: 68763181362
+Ref: 68773181408
+Ref: 68783181508
+Ref: 68793181718
+Ref: 68803181910
+Ref: 68813181961
+Ref: 68823182012
+Ref: 68833182084
+Ref: 68843182137
+Ref: 68853182201
+Ref: 68863182262
+Ref: 68873182327
+Ref: 68883182425
+Ref: 68893182521
+Ref: 68903182593
+Ref: 68913182667
+Ref: 68923182751
+Ref: 68933182820
+Ref: 68943182887
+Ref: 68953182954
+Ref: 68963183020
+Ref: 68973183089
+Ref: 68983183155
+Ref: 68993183385
+Ref: 69003183504
+Ref: 69013184066
+Ref: 69023184696
+Node: A.8.23185124
+Node: A.8.33195158
+Node: A.8.43198353
+Ref: 69033198730
+Ref: 69043198747
+Ref: 69053198793
+Ref: 69063198852
+Ref: 69073198918
+Ref: 69083199018
+Ref: 69093199230
+Ref: 69103199422
+Ref: 69113199473
+Ref: 69123199524
+Ref: 69133199596
+Ref: 69143199649
+Ref: 69153199713
+Ref: 69163199774
+Ref: 69173199839
+Ref: 69183199937
+Ref: 69193200033
+Ref: 69203200175
+Ref: 69213200250
+Ref: 69223200392
+Ref: 69233200466
+Ref: 69243200543
+Ref: 69253200610
+Ref: 69263200672
+Ref: 69273200756
+Ref: 69283200825
+Ref: 69293200892
+Ref: 69303200959
+Ref: 69313201025
+Ref: 69323201094
+Ref: 69333201160
+Ref: 69343201646
+Ref: 69353201947
+Ref: 69363202562
+Node: A.8.53202982
+Node: A.93206364
+Ref: 69373207774
+Ref: 69383207822
+Ref: 69393207944
+Ref: 69403208090
+Ref: 69413208169
+Ref: 69423208260
+Ref: 69433209696
+Node: A.103209727
+Ref: 69443212007
+Ref: 69453212007
+Ref: 69463213008
+Ref: 69473213332
+Ref: 69483213332
+Ref: 69493213332
+Ref: 69503214632
+Ref: 69513214638
+Ref: 69523214638
+Ref: 69533214638
+Ref: 69543214638
+Ref: 69553215455
+Ref: 69563215455
+Ref: 69573216396
+Node: A.10.13216998
+Ref: 69583217283
+Ref: 69593217300
+Ref: 69603217346
+Ref: 69613217409
+Ref: 69623217471
+Ref: 69633217521
+Ref: 69643217604
+Ref: 69653217680
+Ref: 69663217734
+Ref: 69673217825
+Ref: 69683218046
+Ref: 69693218243
+Ref: 69703218295
+Ref: 69713218347
+Ref: 69723218420
+Ref: 69733218476
+Ref: 69743218541
+Ref: 69753218603
+Ref: 69763218669
+Ref: 69773218795
+Ref: 69783218846
+Ref: 69793218897
+Ref: 69803218951
+Ref: 69813219002
+Ref: 69823219053
+Ref: 69833219108
+Ref: 69843219159
+Ref: 69853219210
+Ref: 69863219261
+Ref: 69873219324
+Ref: 69883219377
+Ref: 69893219430
+Ref: 69903219487
+Ref: 69913219540
+Ref: 69923219593
+Ref: 69933219731
+Ref: 69943219778
+Ref: 69953219863
+Ref: 69963219934
+Ref: 69973219990
+Ref: 69983220061
+Ref: 69993220117
+Ref: 70003220182
+Ref: 70013220230
+Ref: 70023220295
+Ref: 70033220391
+Ref: 70043220510
+Ref: 70053220579
+Ref: 70063220698
+Ref: 70073220767
+Ref: 70083220834
+Ref: 70093220884
+Ref: 70103220936
+Ref: 70113220968
+Ref: 70123221020
+Ref: 70133221053
+Ref: 70143221120
+Ref: 70153221170
+Ref: 70163221237
+Ref: 70173221287
+Ref: 70183221360
+Ref: 70193221418
+Ref: 70203221491
+Ref: 70213221548
+Ref: 70223221614
+Ref: 70233221663
+Ref: 70243221729
+Ref: 70253221778
+Ref: 70263221844
+Ref: 70273221934
+Ref: 70283222001
+Ref: 70293222050
+Ref: 70303222116
+Ref: 70313222165
+Ref: 70323222341
+Ref: 70333222462
+Ref: 70343222581
+Ref: 70353222645
+Ref: 70363222821
+Ref: 70373222979
+Ref: 70383223043
+Ref: 70393223089
+Ref: 70403223152
+Ref: 70413223198
+Ref: 70423223341
+Ref: 70433223446
+Ref: 70443223509
+Ref: 70453223555
+Ref: 70463223623
+Ref: 70473223786
+Ref: 70483223810
+Ref: 70493223857
+Ref: 70503223922
+Ref: 70513224061
+Ref: 70523224157
+Ref: 70533224371
+Ref: 70543224538
+Ref: 70553224670
+Ref: 70563224893
+Ref: 70573224917
+Ref: 70583224964
+Ref: 70593225029
+Ref: 70603225168
+Ref: 70613225264
+Ref: 70623225478
+Ref: 70633225645
+Ref: 70643225777
+Ref: 70653226068
+Ref: 70663226090
+Ref: 70673226128
+Ref: 70683226177
+Ref: 70693226234
+Ref: 70703226374
+Ref: 70713226470
+Ref: 70723226729
+Ref: 70733226946
+Ref: 70743227077
+Ref: 70753227346
+Ref: 70763227368
+Ref: 70773227413
+Ref: 70783227457
+Ref: 70793227514
+Ref: 70803227654
+Ref: 70813227750
+Ref: 70823228009
+Ref: 70833228226
+Ref: 70843228358
+Ref: 70853228637
+Ref: 70863228661
+Ref: 70873228706
+Ref: 70883228750
+Ref: 70893228807
+Ref: 70903228947
+Ref: 70913229043
+Ref: 70923229302
+Ref: 70933229519
+Ref: 70943229651
+Ref: 70953229990
+Ref: 70963230018
+Ref: 70973230059
+Ref: 70983230131
+Ref: 70993230221
+Ref: 71003230268
+Ref: 71013230486
+Ref: 71023230661
+Ref: 71033230794
+Ref: 71043230985
+Ref: 71053231054
+Ref: 71063231121
+Ref: 71073231188
+Ref: 71083231254
+Ref: 71093231323
+Ref: 71103231389
+Ref: 71113231456
+Ref: 71123231678
+Ref: 71133231757
+Ref: 71143231881
+Ref: 71153232221
+Node: A.10.23233171
+Node: A.10.33236540
+Ref: 71163240818
+Node: A.10.43242543
+Node: A.10.53245253
+Ref: 71173255494
+Node: A.10.63255824
+Ref: 71183257943
+Node: A.10.73262167
+Ref: 71193263992
+Ref: 71203265410
+Ref: 71213267348
+Ref: 71223268475
+Ref: 71233270860
+Ref: 71243271337
+Node: A.10.83271591
+Ref: 71253276142
+Ref: 71263277155
+Node: A.10.93277832
+Ref: 71273284539
+Node: A.10.103286737
+Node: A.10.113292413
+Ref: 71283293068
+Ref: 71293293092
+Ref: 71303293199
+Ref: 71313293273
+Ref: 71323293385
+Ref: 71333293463
+Ref: 71343293569
+Ref: 71353293644
+Ref: 71363293746
+Ref: 71373295597
+Node: A.10.123295644
+Ref: 71383296165
+Ref: 71393296189
+Ref: 71403296308
+Ref: 71413296394
+Ref: 71423296518
+Ref: 71433296608
+Ref: 71443296726
+Ref: 71453296813
+Ref: 71463296927
+Ref: 71473298954
+Node: A.113299003
+Ref: 71483299629
+Ref: 71493299913
+Ref: 71503299913
+Ref: 71513300248
+Ref: 71523300546
+Ref: 71533300548
+Ref: 71543300967
+Ref: 71553300968
+Ref: 71563301773
+Ref: 71573301774
+Ref: 71583302372
+Ref: 71593302552
+Node: A.123303366
+Node: A.12.13304079
+Ref: 71603304220
+Ref: 71613305236
+Ref: 71623305236
+Ref: 71633305493
+Ref: 71643305590
+Ref: 71653305688
+Ref: 71663305792
+Ref: 71673305859
+Ref: 71683305931
+Ref: 71693306053
+Ref: 71703306277
+Ref: 71713306470
+Ref: 71723306523
+Ref: 71733306576
+Ref: 71743306650
+Ref: 71753306706
+Ref: 71763306769
+Ref: 71773306829
+Ref: 71783306893
+Ref: 71793306961
+Ref: 71803307033
+Ref: 71813307275
+Ref: 71823307496
+Ref: 71833307761
+Ref: 71843307923
+Ref: 71853308127
+Ref: 71863308205
+Ref: 71873308273
+Ref: 71883308337
+Ref: 71893308472
+Ref: 71903308533
+Ref: 71913308603
+Ref: 71923308671
+Ref: 71933308739
+Ref: 71943308806
+Ref: 71953308876
+Ref: 71963308943
+Ref: 71973309179
+Ref: 71983314479
+Ref: 71993315323
+Ref: 72003316273
+Ref: 72013317801
+Ref: 72023318165
+Node: A.12.23318661
+Ref: 72033319060
+Ref: 72043319115
+Ref: 72053319195
+Node: A.12.33319819
+Ref: 72063320243
+Ref: 72073320303
+Ref: 72083320383
+Node: A.12.43320570
+Ref: 72093321072
+Ref: 72103321137
+Ref: 72113321219
+Ref: 72123321538
+Node: A.133321597
+Ref: 72133321987
+Ref: 72143322030
+Ref: 72153322064
+Ref: 72163322098
+Ref: 72173322132
+Ref: 72183322166
+Ref: 72193322200
+Ref: 72203322234
+Ref: 72213322268
+Ref: 72223326956
+Ref: 72233327288
+Ref: 72243327290
+Node: A.143327293
+Ref: 72253327455
+Node: A.153328531
+Ref: 72263329163
+Ref: 72273329225
+Ref: 72283329275
+Ref: 72293329341
+Ref: 72303329384
+Ref: 72313329443
+Ref: 72323329482
+Ref: 72333329539
+Ref: 72343330370
+Ref: 72353332822
+Node: A.163332857
+Ref: 72363333851
+Ref: 72373333923
+Ref: 72383333979
+Ref: 72393334041
+Ref: 72403334179
+Ref: 72413334244
+Ref: 72423334373
+Ref: 72433334434
+Ref: 72443334490
+Ref: 72453334555
+Ref: 72463334772
+Ref: 72473334839
+Ref: 72483334908
+Ref: 72493334986
+Ref: 72503335053
+Ref: 72513335120
+Ref: 72523335358
+Ref: 72533335501
+Ref: 72543335631
+Ref: 72553335705
+Ref: 72563335778
+Ref: 72573335843
+Ref: 72583335908
+Ref: 72593335973
+Ref: 72603336095
+Ref: 72613336155
+Ref: 72623336219
+Ref: 72633336275
+Ref: 72643336536
+Ref: 72653336601
+Ref: 72663336680
+Ref: 72673337150
+Ref: 72683337256
+Ref: 72693337360
+Ref: 72703337462
+Ref: 72713337564
+Ref: 72723337673
+Ref: 72733337746
+Ref: 72743337817
+Ref: 72753337887
+Ref: 72763338481
+Ref: 72773338483
+Ref: 72783338483
+Ref: 72793339196
+Ref: 72803339198
+Ref: 72813340001
+Ref: 72823340003
+Ref: 72833340927
+Ref: 72843341387
+Ref: 72853360607
+Ref: 72863368486
+Ref: 72873379280
+Ref: 72883379411
+Ref: 72893380282
+Node: A.16.13381185
+Ref: 72903381802
+Ref: 72913381825
+Ref: 72923381897
+Ref: 72933381977
+Ref: 72943382059
+Ref: 72953382142
+Ref: 72963382212
+Ref: 72973382287
+Ref: 72983382403
+Ref: 72993382537
+Ref: 73003382612
+Ref: 73013382683
+Ref: 73023391182
+Node: A.173391250
+Ref: 73033391439
+Ref: 73043392057
+Ref: 73053392132
+Ref: 73063392223
+Ref: 73073392306
+Ref: 73083392371
+Ref: 73093392437
+Ref: 73103392481
+Ref: 73113392538
+Ref: 73123396352
+Ref: 73133396759
+Ref: 73143399178
+Ref: 73153399325
+Node: A.183399739
+Ref: 73163400695
+Ref: 73173400695
+Ref: 73183401424
+Ref: 73193401425
+Ref: 73203401820
+Ref: 73213402399
+Ref: 73223409886
+Ref: 73233411333
+Ref: 73243413966
+Node: A.18.13416460
+Ref: 73253416863
+Ref: 73263416915
+Ref: 73273416976
+Ref: 73283417069
+Ref: 73293418255
+Ref: 73303418384
+Node: A.18.23418785
+Ref: 73313419355
+Ref: 73323419355
+Ref: 73333419363
+Ref: 73343419363
+Ref: 73353419890
+Ref: 73363420950
+Ref: 73373421048
+Ref: 73383421216
+Ref: 73393421326
+Ref: 73403421624
+Ref: 73413421705
+Ref: 73423421751
+Ref: 73433421838
+Ref: 73443421937
+Ref: 73453422119
+Ref: 73463422189
+Ref: 73473422650
+Ref: 73483422723
+Ref: 73493422859
+Ref: 73503422930
+Ref: 73513423054
+Ref: 73523423124
+Ref: 73533423182
+Ref: 73543423307
+Ref: 73553423383
+Ref: 73563423517
+Ref: 73573423590
+Ref: 73583423793
+Ref: 73593423992
+Ref: 73603424181
+Ref: 73613424330
+Ref: 73623424559
+Ref: 73633425004
+Ref: 73643425172
+Ref: 73653425382
+Ref: 73663425569
+Ref: 73673425775
+Ref: 73683425959
+Ref: 73693426064
+Ref: 73703426165
+Ref: 73713426268
+Ref: 73723426442
+Ref: 73733426608
+Ref: 73743426827
+Ref: 73753427069
+Ref: 73763427303
+Ref: 73773427590
+Ref: 73783427773
+Ref: 73793428001
+Ref: 73803428116
+Ref: 73813428300
+Ref: 73823428413
+Ref: 73833428594
+Ref: 73843428795
+Ref: 73853429047
+Ref: 73863429230
+Ref: 73873429405
+Ref: 73883429539
+Ref: 73893429671
+Ref: 73903429741
+Ref: 73913429854
+Ref: 73923429962
+Ref: 73933430037
+Ref: 73943430102
+Ref: 73953430192
+Ref: 73963430270
+Ref: 73973430334
+Ref: 73983430423
+Ref: 73993430487
+Ref: 74003430543
+Ref: 74013430611
+Ref: 74023430671
+Ref: 74033430888
+Ref: 74043431069
+Ref: 74053431309
+Ref: 74063431514
+Ref: 74073431705
+Ref: 74083431845
+Ref: 74093432432
+Ref: 74103432477
+Ref: 74113432551
+Ref: 74123432612
+Ref: 74133433333
+Ref: 74143434245
+Ref: 74153438340
+Ref: 74163439487
+Ref: 74173440244
+Ref: 74183440245
+Ref: 74193456022
+Ref: 74203488688
+Ref: 74213492174
+Ref: 74223493293
+Ref: 74233494481
+Ref: 74243494482
+Ref: 74253495107
+Ref: 74263496692
+Ref: 74273496692
+Ref: 74283497811
+Ref: 74293497934
+Ref: 74303505694
+Ref: 74313505843
+Ref: 74323506418
+Node: A.18.33508110
+Ref: 74333508562
+Ref: 74343508564
+Ref: 74353508600
+Ref: 74363509147
+Ref: 74373509603
+Ref: 74383509749
+Ref: 74393510043
+Ref: 74403510123
+Ref: 74413510164
+Ref: 74423510250
+Ref: 74433510348
+Ref: 74443510526
+Ref: 74453510594
+Ref: 74463510662
+Ref: 74473510718
+Ref: 74483510802
+Ref: 74493510999
+Ref: 74503511148
+Ref: 74513511591
+Ref: 74523511759
+Ref: 74533511963
+Ref: 74543512145
+Ref: 74553512246
+Ref: 74563512304
+Ref: 74573512403
+Ref: 74583512635
+Ref: 74593512920
+Ref: 74603513146
+Ref: 74613513328
+Ref: 74623513507
+Ref: 74633513680
+Ref: 74643513812
+Ref: 74653513942
+Ref: 74663514010
+Ref: 74673514117
+Ref: 74683514236
+Ref: 74693514395
+Ref: 74703514606
+Ref: 74713514766
+Ref: 74723514829
+Ref: 74733514917
+Ref: 74743514979
+Ref: 74753515066
+Ref: 74763515129
+Ref: 74773515197
+Ref: 74783515254
+Ref: 74793515314
+Ref: 74803515493
+Ref: 74813515696
+Ref: 74823515884
+Ref: 74833516022
+Ref: 74843516599
+Ref: 74853516644
+Ref: 74863516716
+Ref: 74873516775
+Ref: 74883517554
+Ref: 74893518276
+Ref: 74903520658
+Ref: 74913521997
+Ref: 74923522657
+Ref: 74933522658
+Ref: 74943528687
+Ref: 74953552146
+Ref: 74963554533
+Ref: 74973554881
+Ref: 74983555298
+Ref: 74993555864
+Ref: 75003555864
+Ref: 75013557564
+Ref: 75023557566
+Ref: 75033563704
+Ref: 75043563899
+Ref: 75053564367
+Ref: 75063564978
+Node: A.18.43566777
+Ref: 75073567310
+Ref: 75083567310
+Ref: 75093568168
+Ref: 75103568869
+Ref: 75113568924
+Ref: 75123569377
+Ref: 75133569413
+Ref: 75143569414
+Ref: 75153569414
+Ref: 75163570422
+Ref: 75173571648
+Ref: 75183572310
+Ref: 75193572311
+Ref: 75203580837
+Ref: 75213594166
+Ref: 75223594580
+Ref: 75233595127
+Ref: 75243595127
+Ref: 75253595931
+Ref: 75263596085
+Ref: 75273600197
+Node: A.18.53601573
+Ref: 75283602377
+Ref: 75293602507
+Ref: 75303602799
+Ref: 75313602879
+Ref: 75323602918
+Ref: 75333603004
+Ref: 75343603102
+Ref: 75353603276
+Ref: 75363603345
+Ref: 75373603478
+Ref: 75383603545
+Ref: 75393603612
+Ref: 75403603667
+Ref: 75413603731
+Ref: 75423603804
+Ref: 75433604000
+Ref: 75443604221
+Ref: 75453604718
+Ref: 75463604886
+Ref: 75473605089
+Ref: 75483605269
+Ref: 75493605474
+Ref: 75503605657
+Ref: 75513605756
+Ref: 75523605840
+Ref: 75533605937
+Ref: 75543606215
+Ref: 75553606434
+Ref: 75563606605
+Ref: 75573606779
+Ref: 75583606953
+Ref: 75593607067
+Ref: 75603607179
+Ref: 75613607288
+Ref: 75623607361
+Ref: 75633607426
+Ref: 75643607483
+Ref: 75653607600
+Ref: 75663607729
+Ref: 75673607911
+Ref: 75683608000
+Ref: 75693608135
+Ref: 75703608271
+Ref: 75713608942
+Ref: 75723609785
+Ref: 75733610356
+Ref: 75743611451
+Ref: 75753612111
+Ref: 75763613044
+Ref: 75773613045
+Ref: 75783613045
+Ref: 75793613231
+Ref: 75803622911
+Ref: 75813623071
+Ref: 75823623657
+Node: A.18.63623973
+Ref: 75833624691
+Ref: 75843624800
+Ref: 75853624902
+Ref: 75863625194
+Ref: 75873625274
+Ref: 75883625313
+Ref: 75893625399
+Ref: 75903625497
+Ref: 75913625671
+Ref: 75923625738
+Ref: 75933625805
+Ref: 75943625860
+Ref: 75953625924
+Ref: 75963625997
+Ref: 75973626193
+Ref: 75983626414
+Ref: 75993626911
+Ref: 76003627079
+Ref: 76013627282
+Ref: 76023627462
+Ref: 76033627667
+Ref: 76043627850
+Ref: 76053627949
+Ref: 76063628005
+Ref: 76073628102
+Ref: 76083628380
+Ref: 76093628599
+Ref: 76103628770
+Ref: 76113628944
+Ref: 76123629118
+Ref: 76133629232
+Ref: 76143629344
+Ref: 76153629454
+Ref: 76163629517
+Ref: 76173629578
+Ref: 76183629640
+Ref: 76193629716
+Ref: 76203629784
+Ref: 76213629845
+Ref: 76223629920
+Ref: 76233629987
+Ref: 76243630051
+Ref: 76253630107
+Ref: 76263630175
+Ref: 76273630235
+Ref: 76283630341
+Ref: 76293630459
+Ref: 76303630567
+Ref: 76313630679
+Ref: 76323631302
+Ref: 76333631439
+Ref: 76343632031
+Ref: 76353632765
+Ref: 76363633547
+Ref: 76373634631
+Ref: 76383634632
+Ref: 76393634632
+Ref: 76403634632
+Ref: 76413644198
+Ref: 76423644359
+Ref: 76433644948
+Node: A.18.73645505
+Ref: 76443646019
+Ref: 76453646019
+Ref: 76463646880
+Ref: 76473647585
+Ref: 76483647930
+Ref: 76493647966
+Ref: 76503647967
+Ref: 76513647967
+Ref: 76523649005
+Ref: 76533650449
+Ref: 76543651339
+Ref: 76553651340
+Ref: 76563659835
+Ref: 76573673528
+Ref: 76583673766
+Ref: 76593676580
+Ref: 76603679265
+Ref: 76613679680
+Ref: 76623680227
+Ref: 76633680227
+Ref: 76643681222
+Ref: 76653681376
+Ref: 76663685495
+Node: A.18.83686878
+Ref: 76673687664
+Ref: 76683687794
+Ref: 76693688038
+Ref: 76703688118
+Ref: 76713688157
+Ref: 76723688243
+Ref: 76733688341
+Ref: 76743688515
+Ref: 76753688589
+Ref: 76763688657
+Ref: 76773688727
+Ref: 76783688860
+Ref: 76793688927
+Ref: 76803688994
+Ref: 76813689049
+Ref: 76823689122
+Ref: 76833689318
+Ref: 76843689691
+Ref: 76853689895
+Ref: 76863689994
+Ref: 76873690078
+Ref: 76883690175
+Ref: 76893690398
+Ref: 76903690514
+Ref: 76913690632
+Ref: 76923690750
+Ref: 76933690868
+Ref: 76943690984
+Ref: 76953691094
+Ref: 76963691192
+Ref: 76973691328
+Ref: 76983691440
+Ref: 76993691591
+Ref: 77003691699
+Ref: 77013691844
+Ref: 77023691972
+Ref: 77033692148
+Ref: 77043692215
+Ref: 77053692321
+Ref: 77063692383
+Ref: 77073692447
+Ref: 77083692503
+Ref: 77093692613
+Ref: 77103692799
+Ref: 77113692891
+Ref: 77123693037
+Ref: 77133693184
+Ref: 77143693784
+Ref: 77153693826
+Ref: 77163693893
+Ref: 77173694031
+Ref: 77183694214
+Ref: 77193694334
+Ref: 77203694451
+Ref: 77213694577
+Ref: 77223694713
+Ref: 77233694989
+Ref: 77243695180
+Ref: 77253695399
+Ref: 77263695613
+Ref: 77273695962
+Ref: 77283696266
+Ref: 77293696847
+Ref: 77303697379
+Ref: 77313697590
+Ref: 77323697847
+Ref: 77333698216
+Ref: 77343698217
+Ref: 77353698217
+Ref: 77363698418
+Ref: 77373703391
+Ref: 77383703810
+Ref: 77393705088
+Ref: 77403705248
+Ref: 77413705834
+Node: A.18.93706321
+Ref: 77423707010
+Ref: 77433707119
+Ref: 77443707229
+Ref: 77453707473
+Ref: 77463707553
+Ref: 77473707592
+Ref: 77483707678
+Ref: 77493707776
+Ref: 77503707950
+Ref: 77513708025
+Ref: 77523708093
+Ref: 77533708160
+Ref: 77543708227
+Ref: 77553708282
+Ref: 77563708355
+Ref: 77573708551
+Ref: 77583708924
+Ref: 77593709128
+Ref: 77603709227
+Ref: 77613709283
+Ref: 77623709380
+Ref: 77633709603
+Ref: 77643709719
+Ref: 77653709837
+Ref: 77663709955
+Ref: 77673710073
+Ref: 77683710189
+Ref: 77693710299
+Ref: 77703710362
+Ref: 77713710424
+Ref: 77723710522
+Ref: 77733710658
+Ref: 77743710770
+Ref: 77753710921
+Ref: 77763711029
+Ref: 77773711174
+Ref: 77783711302
+Ref: 77793711479
+Ref: 77803711546
+Ref: 77813711652
+Ref: 77823711714
+Ref: 77833711790
+Ref: 77843711851
+Ref: 77853711926
+Ref: 77863711990
+Ref: 77873712046
+Ref: 77883712114
+Ref: 77893712174
+Ref: 77903712295
+Ref: 77913712418
+Ref: 77923712545
+Ref: 77933713232
+Ref: 77943713369
+Ref: 77953714050
+Ref: 77963714093
+Ref: 77973714192
+Ref: 77983714260
+Ref: 77993714402
+Ref: 78003714588
+Ref: 78013714710
+Ref: 78023714829
+Ref: 78033714958
+Ref: 78043715089
+Ref: 78053715224
+Ref: 78063715348
+Ref: 78073715628
+Ref: 78083715819
+Ref: 78093716038
+Ref: 78103716252
+Ref: 78113716748
+Ref: 78123717352
+Ref: 78133717563
+Ref: 78143717803
+Ref: 78153718183
+Ref: 78163718184
+Ref: 78173718184
+Ref: 78183718184
+Ref: 78193725983
+Ref: 78203727699
+Ref: 78213727861
+Ref: 78223728451
+Node: A.18.103729182
+Ref: 78233730189
+Ref: 78243730189
+Ref: 78253730202
+Ref: 78263730389
+Ref: 78273730894
+Ref: 78283730896
+Ref: 78293730896
+Ref: 78303731276
+Ref: 78313731422
+Ref: 78323731544
+Ref: 78333731890
+Ref: 78343732530
+Ref: 78353732693
+Ref: 78363732987
+Ref: 78373733068
+Ref: 78383733110
+Ref: 78393733168
+Ref: 78403733265
+Ref: 78413733378
+Ref: 78423733576
+Ref: 78433733643
+Ref: 78443733715
+Ref: 78453733796
+Ref: 78463733864
+Ref: 78473733931
+Ref: 78483733998
+Ref: 78493734061
+Ref: 78503734117
+Ref: 78513734190
+Ref: 78523734387
+Ref: 78533734536
+Ref: 78543734781
+Ref: 78553734975
+Ref: 78563735141
+Ref: 78573735343
+Ref: 78583735496
+Ref: 78593735568
+Ref: 78603735626
+Ref: 78613735725
+Ref: 78623735846
+Ref: 78633735973
+Ref: 78643736079
+Ref: 78653736255
+Ref: 78663736453
+Ref: 78673736593
+Ref: 78683736714
+Ref: 78693736852
+Ref: 78703737026
+Ref: 78713737173
+Ref: 78723737302
+Ref: 78733737374
+Ref: 78743737454
+Ref: 78753737769
+Ref: 78763738143
+Ref: 78773738452
+Ref: 78783738712
+Ref: 78793738968
+Ref: 78803739097
+Ref: 78813739334
+Ref: 78823739637
+Ref: 78833739882
+Ref: 78843740225
+Ref: 78853740501
+Ref: 78863740566
+Ref: 78873740634
+Ref: 78883740716
+Ref: 78893740783
+Ref: 78903740864
+Ref: 78913740935
+Ref: 78923741011
+Ref: 78933741076
+Ref: 78943741199
+Ref: 78953741398
+Ref: 78963741577
+Ref: 78973742377
+Ref: 78983742485
+Ref: 78993744560
+Ref: 79003745869
+Ref: 79013746927
+Ref: 79023746928
+Ref: 79033757689
+Ref: 79043799037
+Ref: 79053799452
+Ref: 79063800009
+Ref: 79073800009
+Ref: 79083801032
+Ref: 79093806538
+Node: A.18.113807191
+Ref: 79103807894
+Ref: 79113809357
+Ref: 79123809522
+Node: A.18.123810313
+Ref: 79133811099
+Ref: 79143812605
+Ref: 79153812782
+Node: A.18.133813119
+Ref: 79163813813
+Ref: 79173815621
+Ref: 79183815790
+Node: A.18.143816127
+Ref: 79193816826
+Ref: 79203818635
+Ref: 79213818805
+Node: A.18.153819142
+Ref: 79223819821
+Ref: 79233820670
+Ref: 79243820839
+Node: A.18.163821176
+Ref: 79253821860
+Ref: 79263822711
+Ref: 79273822881
+Node: A.18.173823218
+Ref: 79283823883
+Ref: 79293825470
+Ref: 79303825642
+Node: A.18.183825979
+Ref: 79313826695
+Ref: 79323827104
+Ref: 79333827221
+Ref: 79343827309
+Ref: 79353827433
+Ref: 79363827507
+Ref: 79373827577
+Ref: 79383827635
+Ref: 79393827709
+Ref: 79403827846
+Ref: 79413828045
+Ref: 79423828221
+Ref: 79433828409
+Ref: 79443828572
+Ref: 79453828713
+Ref: 79463828841
+Ref: 79473828944
+Ref: 79483829006
+Ref: 79493830365
+Ref: 79503831045
+Ref: 79513831866
+Ref: 79523831867
+Ref: 79533836711
+Ref: 79543840537
+Ref: 79553840986
+Ref: 79563841712
+Ref: 79573844993
+Ref: 79583845160
+Node: A.18.193845755
+Ref: 79593847769
+Ref: 79603848537
+Ref: 79613851043
+Node: A.18.203851111
+Ref: 79623853021
+Ref: 79633853879
+Ref: 79643854641
+Ref: 79653857023
+Node: A.18.213857103
+Ref: 79663859105
+Ref: 79673859427
+Ref: 79683860324
+Ref: 79693861083
+Ref: 79703863632
+Node: A.18.223863704
+Ref: 79713865573
+Ref: 79723866120
+Ref: 79733866879
+Ref: 79743869433
+Node: A.18.233869506
+Ref: 79753871491
+Ref: 79763871813
+Ref: 79773872706
+Ref: 79783873465
+Ref: 79793875882
+Node: A.18.243875954
+Ref: 79803877821
+Ref: 79813878364
+Ref: 79823879123
+Ref: 79833881545
+Node: A.18.253881618
+Ref: 79843884622
+Ref: 79853885384
+Ref: 79863887719
+Node: A.18.263887793
+Ref: 79873888669
+Ref: 79883889592
+Ref: 79893890900
+Ref: 79903891925
+Ref: 79913892298
+Ref: 79923893722
+Ref: 79933896006
+Ref: 79943896255
+Node: A.18.273896610
+Ref: 79953897360
+Ref: 79963897431
+Ref: 79973897487
+Ref: 79983897657
+Ref: 79993897826
+Ref: 80003897906
+Ref: 80013898342
+Ref: 80023900759
+Node: A.18.283900851
+Ref: 80033901651
+Ref: 80043901857
+Ref: 80053902060
+Ref: 80063902154
+Ref: 80073902256
+Ref: 80083902329
+Ref: 80093903625
+Node: A.18.293903707
+Ref: 80103904539
+Ref: 80113904743
+Ref: 80123905004
+Ref: 80133905098
+Ref: 80143905200
+Ref: 80153905273
+Ref: 80163906276
+Node: A.18.303906356
+Ref: 80173907388
+Ref: 80183907590
+Ref: 80193907793
+Ref: 80203907887
+Ref: 80213908048
+Ref: 80223908275
+Ref: 80233908348
+Ref: 80243910893
+Node: A.18.313910971
+Ref: 80253912035
+Ref: 80263912235
+Ref: 80273912494
+Ref: 80283912588
+Ref: 80293912749
+Ref: 80303912976
+Ref: 80313913049
+Ref: 80323914100
+Node: A.18.323914176
+Node: A.193919412
+Ref: 80333919594
+Ref: 80343919918
+Ref: 80353920040
+Ref: 80363920190
+Ref: 80373920952
+Ref: 80383921012
+Ref: 80393921088
+Ref: 80403921136
+Ref: 80413921270
+Ref: 80423921270
+Ref: 80433923515
+Ref: 80443923647
+Node: Annex B3924420
+Ref: 80453924578
+Ref: 80463924578
+Ref: 80473924578
+Ref: 80483926208
+Node: B.13926845
+Ref: 80493927122
+Ref: 80503927122
+Ref: 80513927181
+Ref: 80523927182
+Ref: 80533927449
+Ref: 80543927450
+Ref: 80553928020
+Ref: 80563928020
+Ref: 80573928020
+Ref: 80583928020
+Ref: 80593928020
+Ref: 80603928022
+Ref: 80613928022
+Ref: 80623928022
+Ref: 80633928022
+Ref: 80643928517
+Ref: 80653928517
+Ref: 80663929433
+Ref: 80673929434
+Ref: 80683929458
+Ref: 80693930319
+Ref: 80703930355
+Ref: 80713930479
+Ref: 80723930929
+Ref: 80733931627
+Ref: 80743932071
+Ref: 80753934431
+Ref: 80763935212
+Ref: 80773935213
+Ref: 80783937377
+Ref: 80793937575
+Ref: 80803939079
+Ref: 80813939080
+Ref: 80823940029
+Ref: 80833940902
+Ref: 80843940904
+Ref: 80853940904
+Ref: 80863940904
+Ref: 80873946606
+Ref: 80883947459
+Ref: 80893948312
+Ref: 80903948560
+Node: B.23948801
+Ref: 80913949492
+Ref: 80923950222
+Ref: 80933950222
+Ref: 80943950222
+Ref: 80953950222
+Ref: 80963950222
+Ref: 80973950730
+Ref: 80983950730
+Ref: 80993951132
+Ref: 81003951132
+Ref: 81013952779
+Ref: 81023952946
+Ref: 81033952946
+Node: B.33955657
+Ref: 81043955935
+Ref: 81053955936
+Ref: 81063956743
+Ref: 81073956827
+Ref: 81083956903
+Ref: 81093956982
+Ref: 81103957060
+Ref: 81113957193
+Ref: 81123957247
+Ref: 81133957301
+Ref: 81143957358
+Ref: 81153957462
+Ref: 81163957523
+Ref: 81173957584
+Ref: 81183957649
+Ref: 81193957750
+Ref: 81203957807
+Ref: 81213957869
+Ref: 81223957958
+Ref: 81233958023
+Ref: 81243958088
+Ref: 81253958194
+Ref: 81263958313
+Ref: 81273958383
+Ref: 81283958446
+Ref: 81293958561
+Ref: 81303958710
+Ref: 81313958788
+Ref: 81323958929
+Ref: 81333959067
+Ref: 81343959281
+Ref: 81353959595
+Ref: 81363959717
+Ref: 81373959795
+Ref: 81383959862
+Ref: 81393959965
+Ref: 81403960133
+Ref: 81413960212
+Ref: 81423960359
+Ref: 81433960503
+Ref: 81443960723
+Ref: 81453961096
+Ref: 81463961162
+Ref: 81473961252
+Ref: 81483961318
+Ref: 81493961417
+Ref: 81503961593
+Ref: 81513961669
+Ref: 81523961817
+Ref: 81533961966
+Ref: 81543962192
+Ref: 81553962445
+Ref: 81563962512
+Ref: 81573962603
+Ref: 81583962674
+Ref: 81593962779
+Ref: 81603962957
+Ref: 81613963033
+Ref: 81623963187
+Ref: 81633963342
+Ref: 81643963573
+Ref: 81653963785
+Ref: 81663965702
+Ref: 81673968513
+Ref: 81683968954
+Ref: 81693977340
+Ref: 81703977340
+Ref: 81713984711
+Ref: 81723985315
+Ref: 81733986508
+Ref: 81743987144
+Node: B.3.13987928
+Ref: 81753988696
+Ref: 81763988751
+Ref: 81773988844
+Ref: 81783988971
+Ref: 81793989042
+Ref: 81803989098
+Ref: 81813989259
+Ref: 81823989339
+Ref: 81833989408
+Ref: 81843989447
+Ref: 81853989504
+Ref: 81863989572
+Ref: 81873989671
+Ref: 81883989735
+Ref: 81893989830
+Ref: 81903989896
+Ref: 81913990101
+Ref: 81923990287
+Ref: 81933996933
+Ref: 81943997198
+Ref: 81953997310
+Ref: 81963997367
+Ref: 81973998079
+Ref: 81983998640
+Node: B.3.23999825
+Ref: 81994001106
+Ref: 82004001162
+Ref: 82014001213
+Ref: 82024001367
+Ref: 82034001479
+Ref: 82044002122
+Ref: 82054002214
+Ref: 82064002376
+Ref: 82074002548
+Ref: 82084002784
+Ref: 82094006106
+Ref: 82104006299
+Ref: 82114006443
+Ref: 82124006661
+Ref: 82134006814
+Ref: 82144007141
+Node: B.3.34008958
+Ref: 82154009164
+Ref: 82164010015
+Ref: 82174010015
+Ref: 82184010271
+Ref: 82194010272
+Ref: 82204010272
+Ref: 82214011408
+Ref: 82224014638
+Ref: 82234014970
+Ref: 82244016773
+Ref: 82254016903
+Ref: 82264017323
+Node: B.44017641
+Ref: 82274017799
+Ref: 82284017800
+Ref: 82294018813
+Ref: 82304018934
+Ref: 82314018997
+Ref: 82324019064
+Ref: 82334019124
+Ref: 82344019178
+Ref: 82354019249
+Ref: 82364019363
+Ref: 82374019426
+Ref: 82384019528
+Ref: 82394019595
+Ref: 82404019688
+Ref: 82414019820
+Ref: 82424019924
+Ref: 82434019990
+Ref: 82444020061
+Ref: 82454020231
+Ref: 82464020413
+Ref: 82474020561
+Ref: 82484020595
+Ref: 82494020651
+Ref: 82504020707
+Ref: 82514020763
+Ref: 82524020819
+Ref: 82534020889
+Ref: 82544020922
+Ref: 82554020974
+Ref: 82564021026
+Ref: 82574021092
+Ref: 82584021125
+Ref: 82594021177
+Ref: 82604021341
+Ref: 82614021391
+Ref: 82624021468
+Ref: 82634021582
+Ref: 82644021705
+Ref: 82654021828
+Ref: 82664021904
+Ref: 82674022033
+Ref: 82684022244
+Ref: 82694022373
+Ref: 82704022448
+Ref: 82714022583
+Ref: 82724022803
+Ref: 82734022928
+Ref: 82744022999
+Ref: 82754023130
+Ref: 82764023348
+Ref: 82774023415
+Ref: 82784023486
+Ref: 82794023553
+Ref: 82804025716
+Node: B.54043562
+Ref: 82814043712
+Ref: 82824043713
+Ref: 82834044532
+Ref: 82844044579
+Ref: 82854044646
+Ref: 82864044712
+Ref: 82874044781
+Ref: 82884044824
+Ref: 82894044932
+Ref: 82904045007
+Ref: 82914045065
+Ref: 82924045129
+Ref: 82934045207
+Ref: 82944045311
+Ref: 82954045418
+Ref: 82964045490
+Ref: 82974045562
+Ref: 82984045635
+Ref: 82994045713
+Ref: 83004045894
+Node: Annex C4051134
+Ref: 83014051275
+Ref: 83024051275
+Ref: 83034051276
+Ref: 83044051276
+Ref: 83054051276
+Ref: 83064051276
+Ref: 83074051535
+Node: C.14051852
+Ref: 83084052265
+Ref: 83094053330
+Ref: 83104053331
+Ref: 83114053331
+Ref: 83124053331
+Node: C.24057206
+Ref: 83134057605
+Node: C.34057734
+Ref: 83144058011
+Ref: 83154058064
+Ref: 83164058167
+Ref: 83174058274
+Ref: 83184058403
+Ref: 83194058503
+Ref: 83204058593
+Ref: 83214058735
+Ref: 83224058737
+Ref: 83234059015
+Ref: 83244059017
+Ref: 83254059849
+Node: C.3.14066665
+Ref: 83264067378
+Ref: 83274067378
+Ref: 83284067692
+Ref: 83294067692
+Ref: 83304068243
+Ref: 83314069712
+Ref: 83324069713
+Ref: 83334070048
+Ref: 83344070050
+Ref: 83354070115
+Ref: 83364070286
+Ref: 83374070287
+Ref: 83384070287
+Ref: 83394070642
+Ref: 83404070775
+Ref: 83414072443
+Ref: 83424072790
+Ref: 83434076179
+Ref: 83444078342
+Ref: 83454079635
+Ref: 83464079873
+Node: C.3.24080000
+Ref: 83474080264
+Ref: 83484080343
+Ref: 83494080398
+Ref: 83504080522
+Ref: 83514080608
+Ref: 83524080694
+Ref: 83534080799
+Ref: 83544080931
+Ref: 83554081118
+Ref: 83564081196
+Ref: 83574081319
+Ref: 83584081535
+Ref: 83594082646
+Ref: 83604084202
+Ref: 83614084522
+Ref: 83624084874
+Ref: 83634087873
+Node: C.44088257
+Ref: 83644088775
+Ref: 83654089155
+Node: C.54093358
+Ref: 83664093850
+Ref: 83674093850
+Ref: 83684094262
+Ref: 83694094262
+Ref: 83704094514
+Ref: 83714094515
+Ref: 83724094538
+Ref: 83734094722
+Ref: 83744094724
+Ref: 83754095887
+Ref: 83764095887
+Node: C.64100341
+Ref: 83774100997
+Ref: 83784100997
+Ref: 83794101185
+Ref: 83804101185
+Ref: 83814101391
+Ref: 83824101391
+Ref: 83834101815
+Ref: 83844101815
+Ref: 83854102044
+Ref: 83864102044
+Ref: 83874102485
+Ref: 83884102485
+Ref: 83894102952
+Ref: 83904103602
+Ref: 83914104468
+Ref: 83924104468
+Ref: 83934105541
+Ref: 83944111286
+Ref: 83954111393
+Ref: 83964112602
+Ref: 83974116506
+Ref: 83984117385
+Ref: 83994117833
+Node: C.74119257
+Node: C.7.14120115
+Ref: 84004120431
+Ref: 84014120495
+Ref: 84024120573
+Ref: 84034120777
+Ref: 84044120847
+Ref: 84054120898
+Ref: 84064120949
+Ref: 84074121040
+Ref: 84084121111
+Ref: 84094121182
+Ref: 84104123447
+Ref: 84114123462
+Ref: 84124123656
+Ref: 84134123671
+Ref: 84144124030
+Ref: 84154124157
+Ref: 84164124157
+Ref: 84174124339
+Ref: 84184124471
+Ref: 84194125196
+Ref: 84204126937
+Node: C.7.24127433
+Ref: 84214127876
+Ref: 84224127893
+Ref: 84234127955
+Ref: 84244128038
+Ref: 84254128133
+Ref: 84264128242
+Ref: 84274129537
+Ref: 84284129652
+Ref: 84294130704
+Ref: 84304131189
+Ref: 84314131556
+Ref: 84324131840
+Node: C.7.34140858
+Ref: 84334141228
+Ref: 84344141294
+Ref: 84354141377
+Ref: 84364141609
+Ref: 84374141703
+Ref: 84384141784
+Ref: 84394141925
+Ref: 84404142164
+Ref: 84414142165
+Ref: 84424143294
+Ref: 84434143295
+Ref: 84444143295
+Ref: 84454143295
+Ref: 84464143295
+Ref: 84474143295
+Ref: 84484146725
+Node: Annex D4147387
+Ref: 84494147523
+Ref: 84504147523
+Ref: 84514151174
+Node: D.14151793
+Ref: 84524152597
+Ref: 84534152597
+Ref: 84544152925
+Ref: 84554152925
+Ref: 84564155254
+Ref: 84574155254
+Ref: 84584155254
+Ref: 84594155254
+Ref: 84604155254
+Ref: 84614156415
+Ref: 84624156822
+Ref: 84634156824
+Ref: 84644160144
+Ref: 84654161118
+Node: D.24161466
+Node: D.2.14162296
+Ref: 84664162770
+Ref: 84674162863
+Ref: 84684162911
+Ref: 84694163730
+Ref: 84704163731
+Ref: 84714163731
+Ref: 84724163731
+Ref: 84734164347
+Ref: 84744164348
+Ref: 84754164348
+Ref: 84764164348
+Ref: 84774164348
+Ref: 84784164348
+Ref: 84794165347
+Ref: 84804167716
+Ref: 84814169970
+Node: D.2.24170854
+Ref: 84824171375
+Ref: 84834171376
+Ref: 84844171409
+Ref: 84854171556
+Ref: 84864171557
+Ref: 84874171608
+Ref: 84884171637
+Ref: 84894171670
+Ref: 84904174071
+Ref: 84914174072
+Ref: 84924174198
+Ref: 84934174200
+Ref: 84944174689
+Ref: 84954175138
+Ref: 84964177836
+Node: D.2.34178941
+Ref: 84974179358
+Ref: 84984179358
+Ref: 84994180679
+Ref: 85004180680
+Ref: 85014181125
+Ref: 85024181699
+Node: D.2.44183745
+Ref: 85034184220
+Ref: 85044184220
+Ref: 85054184363
+Ref: 85064184425
+Ref: 85074184459
+Ref: 85084187529
+Ref: 85094187529
+Ref: 85104190449
+Ref: 85114190606
+Node: D.2.54190661
+Ref: 85124191136
+Ref: 85134191136
+Ref: 85144191319
+Ref: 85154191322
+Ref: 85164191442
+Ref: 85174191571
+Ref: 85184191703
+Ref: 85194191808
+Ref: 85204196640
+Node: D.2.64196744
+Ref: 85214199401
+Ref: 85224199401
+Ref: 85234199593
+Ref: 85244199609
+Ref: 85254199643
+Ref: 85264199749
+Ref: 85274199916
+Ref: 85284200090
+Ref: 85294200588
+Ref: 85304200588
+Ref: 85314206633
+Ref: 85324207040
+Ref: 85334208730
+Ref: 85344208900
+Node: D.34209208
+Ref: 85354209686
+Ref: 85364209687
+Ref: 85374209711
+Ref: 85384209785
+Ref: 85394209856
+Ref: 85404209940
+Ref: 85414210051
+Ref: 85424210051
+Ref: 85434210238
+Ref: 85444211048
+Ref: 85454211737
+Ref: 85464211739
+Ref: 85474211834
+Ref: 85484211834
+Ref: 85494211902
+Ref: 85504213537
+Ref: 85514213537
+Ref: 85524213537
+Ref: 85534214042
+Ref: 85544214195
+Ref: 85554214491
+Ref: 85564219751
+Node: D.44221312
+Ref: 85574221526
+Ref: 85584221899
+Ref: 85594221900
+Ref: 85604221924
+Ref: 85614221998
+Ref: 85624222084
+Ref: 85634222149
+Ref: 85644222149
+Ref: 85654222250
+Ref: 85664223009
+Ref: 85674223009
+Ref: 85684223140
+Ref: 85694223140
+Ref: 85704223149
+Node: D.54231022
+Node: D.5.14231640
+Ref: 85714232156
+Ref: 85724232229
+Ref: 85734232443
+Ref: 85744232935
+Ref: 85754233992
+Ref: 85764237220
+Ref: 85774241067
+Node: D.5.24242079
+Ref: 85784242582
+Ref: 85794242597
+Ref: 85804243859
+Ref: 85814245108
+Node: D.64245217
+Node: D.74248986
+Ref: 85824249489
+Ref: 85834249490
+Ref: 85844250424
+Ref: 85854250425
+Ref: 85864251506
+Ref: 85874251507
+Ref: 85884251662
+Ref: 85894251662
+Ref: 85904251781
+Ref: 85914251781
+Ref: 85924252259
+Ref: 85934252263
+Ref: 85944252263
+Ref: 85954252884
+Ref: 85964252886
+Ref: 85974253008
+Ref: 85984253009
+Ref: 85994253516
+Ref: 86004253517
+Ref: 86014254950
+Ref: 86024254951
+Ref: 86034255113
+Ref: 86044255114
+Ref: 86054255241
+Ref: 86064255242
+Ref: 86074255767
+Ref: 86084255833
+Ref: 86094255834
+Ref: 86104256092
+Ref: 86114256093
+Ref: 86124256201
+Ref: 86134256202
+Ref: 86144256335
+Ref: 86154256336
+Ref: 86164256564
+Ref: 86174256565
+Ref: 86184257467
+Ref: 86194257468
+Ref: 86204257766
+Ref: 86214257766
+Ref: 86224257892
+Ref: 86234257892
+Ref: 86244258569
+Ref: 86254258571
+Ref: 86264258839
+Ref: 86274258840
+Ref: 86284259459
+Ref: 86294259460
+Ref: 86304259768
+Ref: 86314259769
+Ref: 86324259769
+Ref: 86334260016
+Ref: 86344260017
+Ref: 86354260526
+Ref: 86364260527
+Ref: 86374260527
+Ref: 86384260781
+Ref: 86394260782
+Ref: 86404261257
+Ref: 86414261258
+Ref: 86424261258
+Ref: 86434261849
+Ref: 86444261850
+Ref: 86454262128
+Ref: 86464262163
+Ref: 86474262164
+Ref: 86484262928
+Ref: 86494263904
+Ref: 86504264780
+Ref: 86514265997
+Ref: 86524267981
+Ref: 86534268837
+Node: D.84269253
+Ref: 86544269603
+Ref: 86554269619
+Ref: 86564269638
+Ref: 86574269673
+Ref: 86584269707
+Ref: 86594269789
+Ref: 86604269813
+Ref: 86614269858
+Ref: 86624269902
+Ref: 86634269946
+Ref: 86644269993
+Ref: 86654270041
+Ref: 86664271407
+Ref: 86674271469
+Ref: 86684271568
+Ref: 86694271630
+Ref: 86704271692
+Ref: 86714271754
+Ref: 86724271816
+Ref: 86734271878
+Ref: 86744271948
+Ref: 86754272028
+Ref: 86764272225
+Ref: 86774273312
+Ref: 86784273312
+Ref: 86794275463
+Ref: 86804278663
+Ref: 86814281396
+Ref: 86824285573
+Node: D.94286452
+Ref: 86834287481
+Ref: 86844287481
+Ref: 86854289856
+Ref: 86864289856
+Node: D.104291973
+Ref: 86874292523
+Ref: 86884292593
+Ref: 86894292648
+Ref: 86904292705
+Ref: 86914292762
+Ref: 86924292832
+Ref: 86934293397
+Ref: 86944293416
+Ref: 86954294685
+Ref: 86964294685
+Ref: 86974294685
+Ref: 86984295919
+Ref: 86994296112
+Node: D.10.14296224
+Ref: 87004296728
+Ref: 87014296801
+Ref: 87024296992
+Ref: 87034297091
+Ref: 87044299166
+Node: D.114299223
+Ref: 87054299794
+Ref: 87064299867
+Ref: 87074299930
+Ref: 87084299996
+Ref: 87094300187
+Ref: 87104300188
+Ref: 87114300188
+Ref: 87124302191
+Ref: 87134302236
+Ref: 87144302347
+Ref: 87154305370
+Node: D.124306068
+Node: D.134309585
+Ref: 87164309851
+Ref: 87174313988
+Ref: 87184314331
+Node: D.144315336
+Ref: 87194315849
+Ref: 87204315868
+Ref: 87214315892
+Ref: 87224315936
+Ref: 87234315980
+Ref: 87244316055
+Ref: 87254316113
+Ref: 87264316839
+Ref: 87274316940
+Ref: 87284317088
+Ref: 87294317205
+Ref: 87304317350
+Ref: 87314317573
+Ref: 87324317574
+Ref: 87334319703
+Ref: 87344321260
+Ref: 87354324117
+Ref: 87364324261
+Node: D.14.14325305
+Ref: 87374325841
+Ref: 87384325860
+Ref: 87394326013
+Ref: 87404326097
+Ref: 87414326213
+Ref: 87424326383
+Ref: 87434326551
+Ref: 87444326620
+Ref: 87454326747
+Ref: 87464326801
+Ref: 87474327422
+Ref: 87484327424
+Ref: 87494327629
+Ref: 87504329466
+Ref: 87514331902
+Ref: 87524333455
+Node: D.14.24333509
+Ref: 87534334097
+Ref: 87544334169
+Ref: 87554334339
+Ref: 87564334447
+Ref: 87574334569
+Ref: 87584334804
+Ref: 87594334926
+Ref: 87604335052
+Ref: 87614335178
+Ref: 87624335276
+Ref: 87634335345
+Ref: 87644335419
+Ref: 87654335492
+Ref: 87664335563
+Ref: 87674335641
+Ref: 87684335767
+Ref: 87694335859
+Ref: 87704335975
+Ref: 87714336287
+Ref: 87724336782
+Ref: 87734336782
+Ref: 87744336782
+Ref: 87754337077
+Ref: 87764337079
+Ref: 87774342410
+Ref: 87784343761
+Ref: 87794343918
+Node: D.14.34344444
+Ref: 87804344969
+Ref: 87814344987
+Ref: 87824345082
+Ref: 87834346707
+Node: D.154346765
+Ref: 87844347307
+Ref: 87854347325
+Ref: 87864347377
+Ref: 87874347493
+Ref: 87884347669
+Ref: 87894347849
+Ref: 87904347946
+Ref: 87914348075
+Ref: 87924348385
+Ref: 87934348635
+Ref: 87944348637
+Ref: 87954348855
+Ref: 87964356001
+Node: D.164356865
+Ref: 87974357317
+Ref: 87984357382
+Ref: 87994357435
+Ref: 88004357502
+Ref: 88014357676
+Ref: 88024358257
+Ref: 88034358257
+Ref: 88044360389
+Node: D.16.14360699
+Ref: 88054361289
+Ref: 88064361298
+Ref: 88074361359
+Ref: 88084361411
+Ref: 88094361522
+Ref: 88104361610
+Ref: 88114361715
+Ref: 88124361824
+Ref: 88134361918
+Ref: 88144362019
+Ref: 88154362100
+Ref: 88164362303
+Ref: 88174362572
+Ref: 88184362752
+Ref: 88194362931
+Ref: 88204363231
+Ref: 88214364121
+Ref: 88224364121
+Ref: 88234372195
+Ref: 88244372412
+Ref: 88254373239
+Node: Annex E4374749
+Ref: 88264375112
+Ref: 88274375203
+Ref: 88284375203
+Ref: 88294375203
+Ref: 88304375510
+Ref: 88314375653
+Node: E.14377060
+Ref: 88324377292
+Ref: 88334377292
+Ref: 88344378488
+Ref: 88354379329
+Ref: 88364379726
+Ref: 88374379726
+Ref: 88384379726
+Ref: 88394379726
+Ref: 88404380436
+Ref: 88414380451
+Ref: 88424380860
+Ref: 88434380992
+Node: E.24383555
+Ref: 88444383997
+Ref: 88454383998
+Ref: 88464383998
+Ref: 88474383998
+Ref: 88484383998
+Ref: 88494383998
+Ref: 88504384802
+Ref: 88514384939
+Ref: 88524385074
+Ref: 88534385185
+Node: E.2.14388440
+Ref: 88544389346
+Ref: 88554389351
+Ref: 88564389418
+Ref: 88574389419
+Ref: 88584389450
+Ref: 88594389534
+Ref: 88604389671
+Ref: 88614389671
+Ref: 88624392434
+Ref: 88634392434
+Ref: 88644393389
+Ref: 88654393591
+Ref: 88664393591
+Ref: 88674393591
+Ref: 88684394230
+Ref: 88694394515
+Node: E.2.24394940
+Ref: 88704395727
+Ref: 88714395732
+Ref: 88724395797
+Ref: 88734395798
+Ref: 88744395827
+Ref: 88754395911
+Ref: 88764396042
+Ref: 88774396042
+Ref: 88784398639
+Ref: 88794398778
+Ref: 88804398780
+Ref: 88814404784
+Ref: 88824405701
+Ref: 88834407871
+Ref: 88844408584
+Ref: 88854409097
+Node: E.2.34410618
+Ref: 88864411262
+Ref: 88874411267
+Ref: 88884411341
+Ref: 88894411342
+Ref: 88904411380
+Ref: 88914411465
+Ref: 88924411466
+Ref: 88934411499
+Ref: 88944411510
+Ref: 88954411515
+Ref: 88964411697
+Ref: 88974411698
+Ref: 88984411698
+Ref: 88994411698
+Ref: 89004411698
+Ref: 89014411848
+Ref: 89024411848
+Ref: 89034416276
+Ref: 89044416277
+Ref: 89054417384
+Ref: 89064417384
+Ref: 89074417384
+Ref: 89084420341
+Ref: 89094421632
+Ref: 89104422150
+Ref: 89114422860
+Node: E.34423567
+Ref: 89124424390
+Ref: 89134424405
+Ref: 89144424601
+Ref: 89154424616
+Ref: 89164424883
+Ref: 89174425227
+Ref: 89184425716
+Ref: 89194425716
+Ref: 89204426130
+Node: E.44427642
+Ref: 89214427774
+Ref: 89224427774
+Ref: 89234427774
+Ref: 89244427774
+Ref: 89254427774
+Ref: 89264429611
+Ref: 89274429611
+Ref: 89284429611
+Ref: 89294430305
+Ref: 89304430305
+Ref: 89314430884
+Ref: 89324431324
+Ref: 89334432475
+Ref: 89344432475
+Ref: 89354432848
+Ref: 89364432849
+Ref: 89374433140
+Ref: 89384434697
+Ref: 89394434697
+Ref: 89404435052
+Ref: 89414442456
+Ref: 89424443559
+Node: E.4.14445997
+Ref: 89434446792
+Ref: 89444446792
+Ref: 89454447934
+Ref: 89464447935
+Ref: 89474448756
+Node: E.4.24448836
+Node: E.54453272
+Ref: 89484453444
+Ref: 89494453445
+Ref: 89504453993
+Ref: 89514454010
+Ref: 89524454069
+Ref: 89534454123
+Ref: 89544454286
+Ref: 89554454474
+Ref: 89564454635
+Ref: 89574454840
+Ref: 89584455001
+Ref: 89594455160
+Ref: 89604457244
+Ref: 89614457621
+Ref: 89624459354
+Ref: 89634459354
+Ref: 89644466263
+Node: Annex F4466761
+Ref: 89654466901
+Ref: 89664468996
+Node: F.14469391
+Ref: 89674469593
+Ref: 89684469593
+Ref: 89694469875
+Ref: 89704469875
+Node: F.24471437
+Ref: 89714471696
+Ref: 89724471733
+Ref: 89734471791
+Ref: 89744471852
+Ref: 89754471904
+Ref: 89764471959
+Ref: 89774472305
+Node: F.34474291
+Ref: 89784474615
+Node: F.3.14479836
+Ref: 89794479990
+Ref: 89804479991
+Node: F.3.24487491
+Ref: 89814488902
+Node: F.3.34500159
+Ref: 89824500915
+Ref: 89834500932
+Ref: 89844500972
+Ref: 89854501107
+Ref: 89864501263
+Ref: 89874501330
+Ref: 89884501387
+Ref: 89894501458
+Ref: 89904501503
+Ref: 89914501560
+Ref: 89924501617
+Ref: 89934501674
+Ref: 89944502204
+Ref: 89954502242
+Ref: 89964502397
+Ref: 89974502596
+Ref: 89984503025
+Ref: 89994503472
+Ref: 90004503866
+Node: F.3.44512860
+Ref: 90014513062
+Ref: 90024513062
+Node: F.3.54513816
+Ref: 90034514046
+Ref: 90044514047
+Ref: 90054514983
+Node: Annex G4515150
+Ref: 90064515268
+Ref: 90074517132
+Node: G.14517307
+Node: G.1.14518624
+Ref: 90084518935
+Ref: 90094519079
+Ref: 90104519214
+Ref: 90114519298
+Ref: 90124519330
+Ref: 90134519379
+Ref: 90144519433
+Ref: 90154519487
+Ref: 90164519545
+Ref: 90174519642
+Ref: 90184519739
+Ref: 90194519840
+Ref: 90204519917
+Ref: 90214519994
+Ref: 90224520074
+Ref: 90234520216
+Ref: 90244520280
+Ref: 90254520392
+Ref: 90264520494
+Ref: 90274520722
+Ref: 90284521241
+Ref: 90294524036
+Ref: 90304532548
+Ref: 90314532548
+Ref: 90324532548
+Ref: 90334532890
+Ref: 90344534551
+Ref: 90354543333
+Node: G.1.24543729
+Ref: 90364544122
+Ref: 90374544392
+Ref: 90384544446
+Ref: 90394544500
+Ref: 90404544554
+Ref: 90414544839
+Ref: 90424544890
+Ref: 90434544941
+Ref: 90444544992
+Ref: 90454545046
+Ref: 90464545100
+Ref: 90474545154
+Ref: 90484545208
+Ref: 90494545265
+Ref: 90504545317
+Ref: 90514545369
+Ref: 90524545421
+Ref: 90534545476
+Ref: 90544545531
+Ref: 90554545586
+Ref: 90564545641
+Ref: 90574545800
+Ref: 90584551850
+Ref: 90594551850
+Ref: 90604551850
+Ref: 90614552806
+Ref: 90624554844
+Ref: 90634558104
+Ref: 90644558906
+Node: G.1.34561600
+Ref: 90654562832
+Ref: 90664563005
+Ref: 90674563040
+Ref: 90684563089
+Ref: 90694563142
+Ref: 90704563280
+Ref: 90714563375
+Ref: 90724563628
+Ref: 90734563840
+Ref: 90744563970
+Ref: 90754564223
+Ref: 90764573907
+Node: G.1.44574320
+Ref: 90774574528
+Ref: 90784574528
+Node: G.1.54574939
+Ref: 90794575175
+Ref: 90804575176
+Ref: 90814575701
+Node: G.24575850
+Ref: 90824576052
+Ref: 90834576052
+Ref: 90844576534
+Ref: 90854578593
+Node: G.2.14579062
+Ref: 90864580085
+Ref: 90874582180
+Ref: 90884582283
+Ref: 90894583102
+Ref: 90904583495
+Ref: 90914584575
+Ref: 90924584575
+Ref: 90934584854
+Ref: 90944586700
+Ref: 90954588780
+Node: G.2.24589074
+Ref: 90964589647
+Ref: 90974589647
+Ref: 90984590785
+Ref: 90994590785
+Ref: 91004591329
+Ref: 91014591329
+Ref: 91024592149
+Ref: 91034592149
+Ref: 91044592967
+Ref: 91054592969
+Ref: 91064592969
+Ref: 91074593317
+Ref: 91084593319
+Ref: 91094594833
+Ref: 91104594834
+Node: G.2.34597679
+Ref: 91114599238
+Ref: 91124599408
+Ref: 91134606255
+Ref: 91144606257
+Ref: 91154606408
+Ref: 91164606883
+Node: G.2.44608847
+Ref: 91174609199
+Ref: 91184609199
+Ref: 91194609679
+Ref: 91204609681
+Ref: 91214609835
+Ref: 91224611056
+Node: G.2.54616587
+Node: G.2.64629521
+Ref: 91234630196
+Ref: 91244630671
+Ref: 91254630945
+Ref: 91264631343
+Ref: 91274631345
+Ref: 91284633230
+Node: G.34640555
+Ref: 91294642351
+Node: G.3.14642543
+Ref: 91304642967
+Ref: 91314643052
+Ref: 91324643119
+Ref: 91334644270
+Ref: 91344644756
+Ref: 91354645711
+Ref: 91364645789
+Ref: 91374645853
+Ref: 91384645916
+Ref: 91394646057
+Ref: 91404646131
+Ref: 91414646359
+Ref: 91424646618
+Ref: 91434648446
+Ref: 91444651912
+Ref: 91454660986
+Ref: 91464667022
+Node: G.3.24667295
+Ref: 91474667990
+Ref: 91484668078
+Ref: 91494668146
+Ref: 91504668416
+Ref: 91514668477
+Ref: 91524668544
+Ref: 91534668650
+Ref: 91544668760
+Ref: 91554668857
+Ref: 91564668960
+Ref: 91574669172
+Ref: 91584669243
+Ref: 91594669371
+Ref: 91604669475
+Ref: 91614669861
+Ref: 91624671808
+Ref: 91634672123
+Ref: 91644672184
+Ref: 91654672252
+Ref: 91664672358
+Ref: 91674672469
+Ref: 91684672566
+Ref: 91694672669
+Ref: 91704672887
+Ref: 91714672958
+Ref: 91724673086
+Ref: 91734673190
+Ref: 91744673574
+Ref: 91754673649
+Ref: 91764676546
+Ref: 91774676644
+Ref: 91784676714
+Ref: 91794676783
+Ref: 91804676920
+Ref: 91814676996
+Ref: 91824677230
+Ref: 91834677495
+Ref: 91844679350
+Ref: 91854688307
+Ref: 91864705821
+Ref: 91874711827
+Node: Annex H4712104
+Ref: 91884712282
+Ref: 91894712283
+Ref: 91904712944
+Ref: 91914713074
+Ref: 91924713075
+Ref: 91934713850
+Node: H.14714685
+Ref: 91944715323
+Ref: 91954715324
+Ref: 91964715395
+Ref: 91974715395
+Node: H.24719042
+Ref: 91984719261
+Node: H.34721461
+Node: H.3.14721764
+Ref: 91994722588
+Ref: 92004722589
+Ref: 92014722653
+Ref: 92024722653
+Node: H.3.24731422
+Ref: 92034732067
+Ref: 92044732068
+Ref: 92054732095
+Ref: 92064732112
+Ref: 92074732606
+Ref: 92084732744
+Node: H.44738131
+Ref: 92094739312
+Ref: 92104739312
+Ref: 92114739474
+Ref: 92124739474
+Ref: 92134739597
+Ref: 92144739598
+Ref: 92154740077
+Ref: 92164740078
+Ref: 92174740202
+Ref: 92184740203
+Ref: 92194740315
+Ref: 92204740316
+Ref: 92214740883
+Ref: 92224740885
+Ref: 92234741128
+Ref: 92244741128
+Ref: 92254742043
+Ref: 92264742043
+Ref: 92274742919
+Ref: 92284742919
+Ref: 92294743756
+Ref: 92304743758
+Ref: 92314744256
+Ref: 92324744256
+Ref: 92334744294
+Ref: 92344744295
+Ref: 92354744342
+Ref: 92364744342
+Ref: 92374744488
+Ref: 92384744489
+Ref: 92394745014
+Ref: 92404745014
+Ref: 92414745379
+Ref: 92424745379
+Ref: 92434745504
+Ref: 92444745504
+Ref: 92454750023
+Ref: 92464750440
+Ref: 92474752135
+Ref: 92484753138
+Node: H.54754169
+Ref: 92494754607
+Ref: 92504754608
+Ref: 92514754709
+Ref: 92524754710
+Ref: 92534755567
+Node: H.64755600
+Ref: 92544756048
+Ref: 92554756049
+Ref: 92564756088
+Ref: 92574756851
+Ref: 92584756852
+Ref: 92594757343
+Ref: 92604760259
+Node: Annex J4760315
+Ref: 92614760491
+Node: J.14763270
+Node: J.24764576
+Node: J.34767295
+Ref: 92624768033
+Ref: S03224768033
+Ref: 92634768053
+Ref: 92644768078
+Ref: 92654768176
+Ref: 92664768514
+Ref: 92674769875
+Ref: 92684770128
+Ref: 92694770370
+Node: J.44771857
+Ref: 92704772183
+Ref: 92714772183
+Node: J.54773610
+Node: J.64776287
+Node: J.74777419
+Ref: 92724777580
+Ref: S03234777580
+Ref: 92734777589
+Ref: 92744777608
+Ref: 92754778370
+Node: J.7.14778917
+Ref: 92764779449
+Ref: 92774779451
+Ref: 92784779451
+Ref: 92794779855
+Ref: 92804780190
+Ref: 92814780467
+Ref: 92824780617
+Ref: 92834781286
+Node: J.84784719
+Ref: 92844784883
+Ref: S03244784883
+Ref: 92854784904
+Node: J.94785985
+Ref: 92864786235
+Ref: 92874786235
+Ref: 92884787139
+Node: J.104788298
+Ref: 92894788709
+Ref: 92904788710
+Ref: 92914788719
+Ref: 92924788738
+Node: J.114791494
+Ref: 92934791935
+Ref: 92944791935
+Node: J.124792901
+Node: J.134794055
+Ref: 92954794592
+Ref: 92964794770
+Ref: 92974794952
+Node: J.144795365
+Node: J.154796908
+Node: J.15.14797893
+Ref: 92984798178
+Ref: 92994798178
+Ref: 93004798198
+Ref: 93014798199
+Ref: 93024798207
+Ref: 93034798213
+Ref: 93044800432
+Ref: 93054800908
+Ref: 93064801223
+Node: J.15.24801592
+Ref: 93074801901
+Ref: 93084801901
+Ref: 93094801921
+Ref: 93104801922
+Ref: 93114801945
+Ref: 93124801970
+Node: J.15.34802745
+Ref: 93134803039
+Ref: 93144803039
+Ref: 93154803059
+Ref: 93164803060
+Ref: 93174803082
+Node: J.15.44803709
+Ref: 93184803992
+Ref: 93194803993
+Ref: 93204804007
+Ref: 93214804297
+Node: J.15.54804819
+Ref: 93224805029
+Ref: 93234805030
+Ref: 93244805030
+Ref: 93254805030
+Ref: 93264805030
+Ref: 93274805030
+Ref: 93284805030
+Ref: 93294805030
+Ref: 93304805030
+Ref: 93314805030
+Ref: 93324805030
+Ref: 93334805030
+Ref: 93344805030
+Ref: 93354805196
+Ref: 93364805197
+Ref: 93374805244
+Ref: 93384805267
+Ref: 93394805336
+Ref: 93404805392
+Ref: 93414805424
+Ref: 93424805425
+Ref: 93434805472
+Ref: 93444805495
+Ref: 93454805564
+Ref: 93464805620
+Ref: 93474805652
+Ref: 93484805653
+Ref: 93494805693
+Ref: 93504805720
+Ref: 93514806032
+Ref: 93524806033
+Ref: 93534806437
+Node: J.15.64808445
+Ref: 93544808772
+Ref: 93554808773
+Ref: 93564808797
+Ref: 93574808798
+Ref: 93584808831
+Node: J.15.74809565
+Ref: 93594809903
+Ref: 93604809904
+Ref: 93614809933
+Ref: 93624810051
+Ref: 93634810052
+Ref: 93644810078
+Ref: 93654810083
+Ref: 93664810474
+Ref: 93674810899
+Ref: 93684812464
+Node: J.15.84813062
+Ref: 93694813447
+Ref: 93704813448
+Ref: 93714813456
+Ref: 93724813487
+Ref: 93734813488
+Ref: 93744813498
+Ref: 93754813556
+Ref: 93764813557
+Ref: 93774813582
+Ref: 93784813619
+Ref: 93794813620
+Ref: 93804813647
+Ref: 93814813678
+Ref: 93824813679
+Ref: 93834813708
+Ref: 93844813766
+Ref: 93854813767
+Ref: 93864813791
+Ref: 93874815436
+Ref: 93884815438
+Ref: 93894815438
+Ref: 93904815438
+Ref: 93914815438
+Ref: 93924815438
+Ref: 93934815438
+Ref: 93944815438
+Ref: 93954815438
+Ref: 93964815438
+Ref: 93974815438
+Ref: 93984815438
+Node: J.15.94815886
+Ref: 93994816447
+Ref: 94004816448
+Ref: 94014816453
+Ref: 94024816636
+Ref: 94034817514
+Node: J.15.104817535
+Ref: 94044818149
+Ref: 94054818150
+Ref: 94064818366
+Ref: 94074818963
+Node: J.15.114818999
+Ref: 94084819323
+Ref: 94094819324
+Ref: 94104819462
+Ref: 94114819463
+Ref: 94124819670
+Ref: 94134819670
+Node: J.15.124821528
+Ref: 94144821831
+Ref: 94154821832
+Ref: 94164822043
+Node: J.15.134823003
+Ref: 94174823310
+Ref: 94184823310
+Ref: 94194823330
+Ref: 94204823331
+Ref: 94214823345
+Node: Annex K4824080
+Node: K.14824538
+Ref: 94224824715
+Node: K.24835265
+Ref: 94234835448
+Ref: 94244837074
+Ref: 94254837312
+Ref: 94264837314
+Ref: 94274841732
+Ref: 94284841747
+Ref: 94294843141
+Ref: 94304843539
+Ref: 94314843541
+Ref: 94324844376
+Ref: 94334844591
+Ref: 94344844593
+Ref: 94354847588
+Ref: 94364847603
+Ref: 94374847909
+Ref: 94384847909
+Ref: 94394858206
+Ref: 94404858221
+Ref: 94414858221
+Ref: 94424859424
+Ref: 94434859685
+Ref: 94444859687
+Ref: 94454863854
+Ref: 94464873582
+Ref: 94474873749
+Ref: 94484873750
+Ref: 94494874258
+Ref: 94504874259
+Ref: 94514876992
+Ref: 94524877339
+Ref: 94534877341
+Ref: 94544880671
+Ref: 94554881280
+Ref: 94564881601
+Ref: 94574881603
+Ref: 94584885660
+Ref: 94594885827
+Ref: 94604885828
+Ref: 94614886322
+Ref: 94624886323
+Ref: 94634889168
+Ref: 94644889183
+Ref: 94654889695
+Ref: 94664890855
+Ref: 94674892065
+Node: Annex L4895175
+Ref: 94684895325
+Ref: 94694895421
+Ref: 94704895422
+Ref: 94714895455
+Ref: 94724895498
+Ref: 94734895499
+Ref: 94744895527
+Ref: 94754895562
+Ref: 94764895613
+Ref: 94774895614
+Ref: 94784895640
+Ref: 94794895689
+Ref: 94804895690
+Ref: 94814895729
+Ref: 94824895753
+Ref: 94834895784
+Ref: 94844895808
+Ref: 94854895894
+Ref: 94864895895
+Ref: 94874895909
+Ref: 94884895995
+Ref: 94894895996
+Ref: 94904896004
+Ref: 94914896089
+Ref: 94924896090
+Ref: 94934896117
+Ref: 94944896202
+Ref: 94954896203
+Ref: 94964896229
+Ref: 94974896234
+Ref: 94984896356
+Ref: 94994896357
+Ref: 95004896397
+Ref: 95014896419
+Ref: 95024896469
+Ref: 95034896470
+Ref: 95044896475
+Ref: 95054896524
+Ref: 95064896525
+Ref: 95074896547
+Ref: 95084896609
+Ref: 95094896610
+Ref: 95104896656
+Ref: 95114896657
+Ref: 95124896680
+Ref: 95134896728
+Ref: 95144896729
+Ref: 95154896796
+Ref: 95164896797
+Ref: 95174896822
+Ref: 95184896844
+Ref: 95194896885
+Ref: 95204896886
+Ref: 95214896915
+Ref: 95224896937
+Ref: 95234896978
+Ref: 95244896979
+Ref: 95254897010
+Ref: 95264897092
+Ref: 95274897093
+Ref: 95284897135
+Ref: 95294897158
+Ref: 95304897217
+Ref: 95314897268
+Ref: 95324897356
+Ref: 95334897357
+Ref: 95344897399
+Ref: 95354897422
+Ref: 95364897481
+Ref: 95374897532
+Ref: 95384897583
+Ref: 95394897584
+Ref: 95404897609
+Ref: 95414897659
+Ref: 95424897660
+Ref: 95434897684
+Ref: 95444897771
+Ref: 95454897772
+Ref: 95464897780
+Ref: 95474897786
+Ref: 95484897828
+Ref: 95494897829
+Ref: 95504897856
+Ref: 95514897873
+Ref: 95524897955
+Ref: 95534897956
+Ref: 95544897985
+Ref: 95554898066
+Ref: 95564898067
+Ref: 95574898136
+Ref: 95584898137
+Ref: 95594898161
+Ref: 95604898204
+Ref: 95614898205
+Ref: 95624898210
+Ref: 95634898253
+Ref: 95644898254
+Ref: 95654898278
+Ref: 95664898364
+Ref: 95674898365
+Ref: 95684898388
+Ref: 95694898413
+Ref: 95704898460
+Ref: 95714898461
+Ref: 95724898510
+Ref: 95734898511
+Ref: 95744898520
+Ref: 95754898604
+Ref: 95764898605
+Ref: 95774898627
+Ref: 95784898673
+Ref: 95794898674
+Ref: 95804898714
+Ref: 95814898715
+Ref: 95824898754
+Ref: 95834898801
+Ref: 95844898802
+Ref: 95854898831
+Ref: 95864898878
+Ref: 95874898879
+Ref: 95884898908
+Ref: 95894898990
+Ref: 95904898991
+Ref: 95914899052
+Ref: 95924899053
+Ref: 95934899099
+Ref: 95944899128
+Ref: 95954899156
+Ref: 95964899206
+Ref: 95974899207
+Ref: 95984899226
+Ref: 95994899250
+Ref: 96004899353
+Ref: 96014899354
+Ref: 96024899375
+Ref: 96034899416
+Ref: 96044899417
+Ref: 96054899441
+Ref: 96064899527
+Ref: 96074899528
+Ref: 96084899614
+Ref: 96094899615
+Ref: 96104899653
+Ref: 96114899693
+Ref: 96124899694
+Ref: 96134899723
+Ref: 96144899763
+Ref: 96154899764
+Ref: 96164899777
+Ref: 96174899790
+Ref: 96184899838
+Ref: 96194899839
+Ref: 96204899883
+Ref: 96214899884
+Ref: 96224899915
+Ref: 96234899996
+Ref: 96244899997
+Ref: 96254900011
+Ref: 96264900057
+Ref: 96274900058
+Ref: 96284900067
+Ref: 96294900111
+Ref: 96304900112
+Ref: 96314900145
+Ref: 96324900233
+Ref: 96334900234
+Ref: 96344900267
+Ref: 96354900317
+Ref: 96364900318
+Ref: 96374900329
+Ref: 96384900414
+Ref: 96394900415
+Ref: 96404900425
+Ref: 96414900512
+Ref: 96424900513
+Ref: 96434900542
+Node: Annex M4900756
+Ref: 96444900960
+Node: M.14901705
+Ref: 96454901851
+Ref: 96464901851
+Node: M.24909292
+Ref: 96474909456
+Ref: 96484909535
+Ref: 96494909647
+Ref: 96504909648
+Ref: 96514924335
+Node: M.34930924
+Ref: 96524931042
+Ref: 96534931042
+Node: Annex N4961727
+Ref: 96544961877
+Ref: 96554962100
+Ref: 96564962254
+Ref: 96574962418
+Ref: 96584962735
+Ref: 96594962978
+Ref: 96604963113
+Ref: 96614963313
+Ref: 96624963597
+Ref: 96634963807
+Ref: 96644963902
+Ref: 96654963919
+Ref: 96664964184
+Ref: 96674964444
+Ref: 96684964502
+Ref: 96694964645
+Ref: 96704964875
+Ref: 96714965020
+Ref: 96724965124
+Ref: 96734965126
+Ref: 96744965394
+Ref: 96754965929
+Ref: 96764966096
+Ref: 96774966267
+Ref: 96784966534
+Ref: 96794966686
+Ref: 96804966753
+Ref: 96814966901
+Ref: 96824967050
+Ref: 96834967205
+Ref: 96844967350
+Ref: 96854967459
+Ref: 96864967555
+Ref: 96874967557
+Ref: 96884967679
+Ref: 96894967795
+Ref: 96904968438
+Ref: 96914968691
+Ref: 96924968858
+Ref: 96934969321
+Ref: 96944969663
+Ref: 96954969827
+Ref: 96964969996
+Ref: 96974970211
+Ref: 96984970473
+Ref: 96994970578
+Ref: 97004970752
+Ref: 97014971000
+Ref: 97024971176
+Ref: 97034971565
+Ref: 97044971743
+Ref: 97054972077
+Ref: 97064972199
+Ref: 97074972424
+Ref: 97084972541
+Ref: 97094972649
+Ref: 97104973266
+Ref: 97114973405
+Ref: 97124973684
+Ref: 97134973809
+Ref: 97144974053
+Ref: 97154974242
+Ref: 97164974577
+Ref: 97174974767
+Ref: 97184974905
+Ref: 97194975016
+Ref: 97204975146
+Ref: 97214975282
+Ref: 97224975422
+Ref: 97234975500
+Ref: 97244975805
+Ref: 97254975984
+Ref: 97264976299
+Ref: 97274976544
+Ref: 97284976792
+Ref: 97294977241
+Ref: 97304977470
+Ref: 97314977756
+Ref: 97324977794
+Node: Annex P4977917
+Ref: 97334978045
+Ref: 97344978045
+Ref: 97354978045
+Ref: 97364978045
+Ref: 97374978045
+Ref: 97384978211
+Ref: 97394978229
+Ref: 97404978248
+Ref: 97414978323
+Ref: 97424978350
+Ref: 97434978377
+Ref: 97444978404
+Ref: 97454978430
+Ref: 97464978453
+Ref: 97474978524
+Ref: 97484978551
+Ref: 97494978584
+Ref: 97504978609
+Ref: 97514978675
+Ref: 97524978693
+Ref: 97534978753
+Ref: 97544978763
+Ref: 97554978773
+Ref: 97564978821
+Ref: 97574978829
+Ref: 97584978840
+Ref: 97594978892
+Ref: 97604978906
+Ref: 97614979041
+Ref: 97624979048
+Ref: 97634979064
+Ref: 97644979082
+Ref: 97654979127
+Ref: 97664979188
+Ref: 97674979205
+Ref: 97684979216
+Ref: 97694979277
+Ref: 97704979354
+Ref: 97714979418
+Ref: 97724979504
+Ref: 97734979579
+Ref: 97744979641
+Ref: 97754979654
+Ref: 97764979685
+Ref: 97774979809
+Ref: 97784979824
+Ref: 97794979858
+Ref: 97804979873
+Ref: 97814979912
+Ref: 97824979928
+Ref: 97834979961
+Ref: 97844979977
+Ref: 97854980045
+Ref: 97864980066
+Ref: 97874980096
+Ref: 97884980119
+Ref: 97894980148
+Ref: 97904980175
+Ref: 97914980217
+Ref: 97924980248
+Ref: 97934980290
+Ref: 97944980314
+Ref: 97954980345
+Ref: 97964980371
+Ref: 97974980401
+Ref: 97984980471
+Ref: 97994980530
+Ref: 98004980562
+Ref: 98014980600
+Ref: 98024980635
+Ref: 98034980733
+Ref: 98044980754
+Ref: 98054980782
+Ref: 98064980818
+Ref: 98074980851
+Ref: 98084980883
+Ref: 98094980967
+Ref: 98104980999
+Ref: 98114981033
+Ref: 98124981058
+Ref: 98134981090
+Ref: 98144981117
+Ref: 98154981150
+Ref: 98164981178
+Ref: 98174981271
+Ref: 98184981294
+Ref: 98194981327
+Ref: 98204981401
+Ref: 98214981417
+Ref: 98224981431
+Ref: 98234981496
+Ref: 98244981542
+Ref: 98254981562
+Ref: 98264981642
+Ref: 98274981661
+Ref: 98284981681
+Ref: 98294981760
+Ref: 98304981779
+Ref: 98314981862
+Ref: 98324981910
+Ref: 98334981939
+Ref: 98344981965
+Ref: 98354981997
+Ref: 98364982045
+Ref: 98374982073
+Ref: 98384982099
+Ref: 98394982131
+Ref: 98404982179
+Ref: 98414982211
+Ref: 98424982237
+Ref: 98434982269
+Ref: 98444982302
+Ref: 98454982394
+Ref: 98464982417
+Ref: 98474982498
+Ref: 98484982546
+Ref: 98494982654
+Ref: 98504982679
+Ref: 98514982701
+Ref: 98524982776
+Ref: 98534982817
+Ref: 98544982853
+Ref: 98554982874
+Ref: 98564982960
+Ref: 98574982997
+Ref: 98584983104
+Ref: 98594983126
+Ref: 98604983216
+Ref: 98614983288
+Ref: 98624983321
+Ref: 98634983427
+Ref: 98644983463
+Ref: 98654983548
+Ref: 98664983619
+Ref: 98674983647
+Ref: 98684983750
+Ref: 98694983762
+Ref: 98704983866
+Ref: 98714983896
+Ref: 98724983967
+Ref: 98734984001
+Ref: 98744984124
+Ref: 98754984136
+Ref: 98764984246
+Ref: 98774984273
+Ref: 98784984285
+Ref: 98794984390
+Ref: 98804984409
+Ref: 98814984486
+Ref: 98824984519
+Ref: 98834984622
+Ref: 98844984650
+Ref: 98854984680
+Ref: 98864984760
+Ref: 98874984855
+Ref: 98884984886
+Ref: 98894984925
+Ref: 98904985013
+Ref: 98914985034
+Ref: 98924985114
+Ref: 98934985151
+Ref: 98944985218
+Ref: 98954985236
+Ref: 98964985309
+Ref: 98974985330
+Ref: 98984985382
+Ref: 98994985410
+Ref: 99004985561
+Ref: 99014985591
+Ref: 99024985684
+Ref: 99034985712
+Ref: 99044985728
+Ref: 99054985745
+Ref: 99064985779
+Ref: 99074985806
+Ref: 99084985828
+Ref: 99094985901
+Ref: 99104985976
+Ref: 99114986004
+Ref: 99124986111
+Ref: 99134986143
+Ref: 99144986168
+Ref: 99154986260
+Ref: 99164986359
+Ref: 99174986470
+Ref: 99184986486
+Ref: 99194986513
+Ref: 99204986529
+Ref: 99214986602
+Ref: 99224986626
+Ref: 99234986699
+Ref: 99244986726
+Ref: 99254986751
+Ref: 99264986791
+Ref: 99274986886
+Ref: 99284986913
+Ref: 99294986933
+Ref: 99304987012
+Ref: 99314987047
+Ref: 99324987113
+Ref: 99334987132
+Ref: 99344987195
+Ref: 99354987226
+Ref: 99364987253
+Ref: 99374987325
+Ref: 99384987416
+Ref: 99394987447
+Ref: 99404987498
+Ref: 99414987646
+Ref: 99424987725
+Ref: 99434987755
+Ref: 99444987838
+Ref: 99454987854
+Ref: 99464987892
+Ref: 99474987908
+Ref: 99484988015
+Ref: 99494988040
+Ref: 99504988227
+Ref: 99514988283
+Ref: 99524988423
+Ref: 99534988457
+Ref: 99544988480
+Ref: 99554988525
+Ref: 99564988553
+Ref: 99574988597
+Ref: 99584988696
+Ref: 99594988717
+Ref: 99604988802
+Ref: 99614988876
+Ref: 99624988901
+Ref: 99634988968
+Ref: 99644988988
+Ref: 99654989004
+Ref: 99664989049
+Ref: 99674989063
+Ref: 99684989124
+Ref: 99694989142
+Ref: 99704989157
+Ref: 99714989169
+Ref: 99724989228
+Ref: 99734989244
+Ref: 99744989275
+Ref: 99754989297
+Ref: 99764989313
+Ref: 99774989336
+Ref: 99784989366
+Ref: 99794989386
+Ref: 99804989410
+Ref: 99814989432
+Ref: 99824989463
+Ref: 99834989489
+Ref: 99844989550
+Ref: 99854989563
+Ref: 99864989614
+Ref: 99874989621
+Ref: 99884989691
+Ref: 99894989749
+Ref: 99904989802
+Ref: 99914989809
+Ref: 99924989823
+Ref: 99934989872
+Ref: 99944989879
+Ref: 99954989944
+Ref: 99964989953
+Ref: 99974990011
+Ref: 99984990024
+Ref: 99994990044
+Ref: 100004990110
+Ref: 100014990117
+Ref: 100024990199
+Ref: 100034990220
+Ref: 100044990328
+Ref: 100054990335
+Ref: 100064990435
+Ref: 100074990519
+Ref: 100084990604
+Ref: 100094990611
+Ref: 100104990677
+Ref: 100114990696
+Ref: 100124990718
+Ref: 100134990788
+Ref: 100144990897
+Ref: 100154990929
+Ref: 100164991050
+Ref: 100174991076
+Ref: 100184991097
+Ref: 100194991200
+Ref: 100204991229
+Ref: 100214991322
+Ref: 100224991341
+Ref: 100234991420
+Ref: 100244991433
+Ref: 100254991500
+Ref: 100264991529
+Ref: 100274991619
+Ref: 100284991631
+Ref: 100294991645
+Ref: 100304991668
+Ref: 100314991682
+Ref: 100324991705
+Ref: 100334991727
+Ref: 100344991741
+Ref: 100354991831
+Ref: 100364991862
+Ref: 100374991960
+Ref: 100384991984
+Ref: 100394992004
+Ref: 100404992081
+Ref: 100414992095
+Ref: 100424992110
+Ref: 100434992129
+Ref: 100444992149
+Ref: 100454992162
+Ref: 100464992177
+Ref: 100474992195
+Ref: 100484992215
+Ref: 100494992229
+Ref: 100504992296
+Ref: 100514992317
+Ref: 100524992344
+Ref: 100534992364
+Ref: 100544992391
+Ref: 100554992412
+Ref: 100564992439
+Ref: 100574992465
+Ref: 100584992492
+Ref: 100594992517
+Ref: 100604992589
+Ref: 100614992608
+Ref: 100624992628
+Ref: 100634992695
+Ref: 100644992714
+Ref: 100654992734
+Ref: 100664992772
+Ref: 100674992799
+Ref: 100684992832
+Ref: 100694992900
+Ref: 100704992921
+Ref: 100714992995
+Ref: 100724993015
+Ref: 100734993023
+Ref: 100744993089
+Ref: 100754993112
+Ref: 100764993118
+Ref: 100774993147
+Ref: 100784993186
+Ref: 100794993194
+Ref: 100804993215
+Ref: 100814993258
+Ref: 100824993270
+Ref: 100834993285
+Ref: 100844993299
+Ref: 100854993352
+Ref: 100864993377
+Ref: 100874993394
+Ref: 100884993412
+Ref: 100894993419
+Ref: 100904993432
+Ref: 100914993453
+Ref: 100924993480
+Ref: 100934993985
+Ref: 100944994001
+Ref: 100954994073
+Ref: 100964994100
+Ref: 100974994126
+Ref: 100984994153
+Ref: 100994994191
+Ref: 101004994253
+Ref: 101014994337
+Ref: 101024994360
+Ref: 101034994400
+Ref: 101044994502
+Ref: 101054994551
+Ref: 101064994618
+Ref: 101074994629
+Ref: 101084994667
+Ref: 101094994690
+Ref: 101104994701
+Ref: 101114994727
+Ref: 101124994839
+Ref: 101134994904
+Ref: 101144994917
+Ref: 101154994938
+Ref: 101164994951
+Ref: 101174995015
+Ref: 101184995029
+Ref: 101194995043
+Ref: 101204995056
+Ref: 101214995118
+Ref: 101224995141
+Ref: 101234995173
+Ref: 101244995196
+Ref: 101254995285
+Ref: 101264995342
+Ref: 101274995353
+Ref: 101284995365
+Ref: 101294995420
+Ref: 101304995427
+Ref: 101314995447
+Ref: 101324995454
+Ref: 101334995518
+Ref: 101344995543
+Ref: 101354995568
+Ref: 101364995593
+Ref: 101374995612
+Ref: 101384995647
+Ref: 101394995675
+Ref: 101404995706
+Ref: 101414995728
+Ref: 101424995754
+Ref: 101434995774
+Ref: 101444995800
+Ref: 101454995873
+Ref: 101464995890
+Ref: 101474995915
+Ref: 101484995934
+Ref: 101494995960
+Ref: 101504995996
+Ref: 101514996017
+Ref: 101524996127
+Ref: 101534996199
+Ref: 101544996280
+Ref: 101554996288
+Ref: 101564996354
+Ref: 101574996380
+Ref: 101584996418
+Ref: 101594996444
+Ref: 101604996493
+Ref: 101614996603
+Ref: 101624996629
+Ref: 101634996668
+Ref: 101644996783
+Ref: 101654996818
+Ref: 101664996901
+Ref: 101674996936
+Ref: 101684996973
+Ref: 101694997025
+Ref: 101704997089
+Ref: 101714997113
+Ref: 101724997156
+Ref: 101734997245
+Ref: 101744997278
+Ref: 101754997369
+Ref: 101764997413
+Ref: 101774997427
+Ref: 101784997450
+Ref: 101794997500
+Ref: 101804997567
+Ref: 101814997628
+Ref: 101824997682
+Ref: 101834997739
+Ref: 101844997817
+Ref: 101854997829
+Ref: 101864997897
+Ref: 101874997965
+Ref: 101884997996
+Ref: 101894998035
+Ref: 101904998121
+Ref: 101914998154
+Ref: 101924998239
+Ref: 101934998266
+Ref: 101944998350
+Ref: 101954998370
+Ref: 101964998445
+Ref: 101974998465
+Ref: 101984998478
+Ref: 101994998542
+Ref: 102004998571
+Ref: 102014998658
+Ref: 102024998678
+Ref: 102034998748
+Ref: 102044998816
+Ref: 102054998879
+Ref: 102064998960
+Ref: 102074998981
+Ref: 102084998997
+Ref: 102094999020
+Ref: 102104999040
+Ref: 102114999108
+Ref: 102124999135
+Ref: 102134999223
+Ref: 102144999260
+Ref: 102154999266
+Ref: 102164999282
+Ref: 102174999305
+Ref: 102184999334
+Ref: 102194999361
+Ref: 102204999383
+Ref: 102214999517
+Ref: 102224999548
+Ref: 102234999586
+Ref: 102244999623
+Ref: 102254999668
+Ref: 102264999713
+Ref: 102274999801
+Ref: 102284999828
+Ref: 102294999835
+Ref: 102304999921
+Ref: 102314999946
+Ref: 102324999953
+Ref: 102335000036
+Ref: 102345000061
+Ref: 102355000164
+Ref: 102365000182
+Ref: 102375000262
+Ref: 102385000286
+Ref: 102395000351
+Ref: 102405000437
+Ref: 102415000479
+Ref: 102425000515
+Ref: 102435000598
+Ref: 102445000650
+Ref: 102455000757
+Ref: 102465000778
+Ref: 102475000867
+Ref: 102485000897
+Ref: 102495000942
+Ref: 102505001035
+Ref: 102515001065
+Ref: 102525001104
+Ref: 102535001129
+Ref: 102545001161
+Ref: 102555001191
+Ref: 102565001229
+Ref: 102575001252
+Ref: 102585001323
+Ref: 102595001414
+Ref: 102605001455
+Ref: 102615001492
+Ref: 102625001545
+Ref: 102635001585
+Ref: 102645001603
+Ref: 102655001679
+Ref: 102665001720
+Ref: 102675001757
+Ref: 102685001802
+Ref: 102695001849
+Ref: 102705001867
+Ref: 102715001947
+Ref: 102725001968
+Ref: 102735002046
+Ref: 102745002141
+Ref: 102755002162
+Ref: 102765002245
+Ref: 102775002285
+Ref: 102785002327
+Ref: 102795002457
+Ref: 102805002478
+Ref: 102815002555
+Ref: 102825002573
+Ref: 102835002639
+Ref: 102845002655
+Ref: 102855002731
+Ref: 102865002770
+Ref: 102875002812
+Ref: 102885002852
+Ref: 102895002895
+Ref: 102905002992
+Ref: 102915003015
+Ref: 102925003031
+Ref: 102935003067
+Ref: 102945003086
+Ref: 102955003118
+Ref: 102965003140
+Ref: 102975003175
+Ref: 102985003194
+Ref: 102995003278
+Ref: 103005003336
+Ref: 103015003350
+Ref: 103025003440
+Ref: 103035003491
+Ref: 103045003505
+Ref: 103055003601
+Ref: 103065003632
+Ref: 103075003683
+Ref: 103085003702
+Ref: 103095003812
+Ref: 103105003871
+Ref: 103115003890
+Ref: 103125003942
+Ref: 103135004003
+Ref: 103145004022
+Ref: 103155004073
+Ref: 103165004133
+Ref: 103175004152
+Ref: 103185004244
+Ref: 103195004265
+Ref: 103205004304
+Ref: 103215004345
+Ref: 103225004376
+Ref: 103235004460
+Ref: 103245004495
+Ref: 103255004535
+Ref: 103265004566
+Ref: 103275004640
+Ref: 103285004679
+Ref: 103295004710
+Ref: 103305004760
+Ref: 103315004780
+Ref: 103325004851
+Ref: 103335004885
+Ref: 103345004920
+Ref: 103355004961
+Ref: 103365005012
+Ref: 103375005103
+Ref: 103385005124
+Ref: 103395005163
+Ref: 103405005203
+Ref: 103415005234
+Ref: 103425005331
+Ref: 103435005365
+Ref: 103445005405
+Ref: 103455005436
+Ref: 103465005519
+Ref: 103475005579
+Ref: 103485005637
+Ref: 103495005709
+Ref: 103505005744
+Ref: 103515005774
+Ref: 103525005846
+Ref: 103535005890
+Ref: 103545005978
+Ref: 103555006012
+Ref: 103565006047
+Ref: 103575006098
+Ref: 103585006164
+Ref: 103595006199
+Ref: 103605006227
+Ref: 103615006266
+Ref: 103625006310
+Ref: 103635006333
+Ref: 103645006499
+Ref: 103655006535
+Ref: 103665006557
+Ref: 103675006587
+Ref: 103685006623
+Ref: 103695006717
+Ref: 103705006731
+Ref: 103715006745
+Ref: 103725006777
+Ref: 103735006829
+Ref: 103745006885
+Ref: 103755006951
+Ref: 103765006972
+Ref: 103775006996
+Ref: 103785007028
+Ref: 103795007067
+Ref: 103805007118
+Ref: 103815007186
+Ref: 103825007214
+Ref: 103835007287
+Ref: 103845007357
+Ref: 103855007380
+Ref: 103865007473
+Ref: 103875007479
+Ref: 103885007580
+Ref: 103895007649
+Ref: 103905007673
+Ref: 103915007774
+Ref: 103925007853
+Ref: 103935007919
+Ref: 103945007945
+Ref: 103955007971
+Ref: 103965008003
+Ref: 103975008094
+Ref: 103985008111
+Ref: 103995008149
+Ref: 104005008166
+Ref: 104015008207
+Ref: 104025008292
+Ref: 104035008363
+Ref: 104045008391
+Ref: 104055008418
+Ref: 104065008497
+Ref: 104075008515
+Ref: 104085008595
+Ref: 104095008612
+Ref: 104105008769
+Ref: 104115008810
+Ref: 104125008908
+Ref: 104135008933
+Ref: 104145009019
+Ref: 104155009046
+Ref: 104165009143
+Ref: 104175009186
+Ref: 104185009301
+Ref: 104195009350
+Ref: 104205009437
+Ref: 104215009459
+Ref: 104225009540
+Ref: 104235009566
+Ref: 104245009627
+Ref: 104255009707
+Ref: 104265009722
+Ref: 104275009773
+Ref: 104285009849
+Ref: 104295009864
+Ref: 104305009886
+Ref: 104315009901
+Ref: 104325009963
+Ref: 104335009997
+Ref: 104345010034
+Ref: 104355010135
+Ref: 104365010162
+Ref: 104375010192
+Ref: 104385010216
+Ref: 104395010312
+Ref: 104405010349
+Ref: 104415010386
+Ref: 104425010467
+Ref: 104435010485
+Ref: 104445010546
+Ref: 104455010598
+Ref: 104465010656
+Ref: 104475010670
+Ref: 104485010724
+Ref: 104495010746
+Ref: 104505010858
+Ref: 104515010887
+Ref: 104525010978
+Ref: 104535011007
+Ref: 104545011055
+Ref: 104555011078
+Ref: 104565011098
+Ref: 104575011121
+Ref: 104585011203
+Ref: 104595011233
+Ref: 104605011282
+Ref: 104615011376
+Ref: 104625011420
+Ref: 104635011508
+Ref: 104645011552
+Ref: 104655011650
+Ref: 104665011694
+Ref: 104675011766
+Ref: 104685011784
+Ref: 104695011847
+Ref: 104705011893
+Ref: 104715011987
+Ref: 104725012038
+Ref: 104735012066
+Ref: 104745012147
+Ref: 104755012180
+Ref: 104765012200
+Ref: 104775012237
+Ref: 104785012320
+Ref: 104795012398
+Ref: 104805012495
+Ref: 104815012515
+Ref: 104825012592
+Ref: 104835012612
+Ref: 104845012686
+Ref: 104855012719
+Ref: 104865012824
+Ref: 104875012845
+Ref: 104885012884
+Ref: 104895012975
+Ref: 104905012996
+Ref: 104915013077
+Ref: 104925013122
+Ref: 104935013212
+Ref: 104945013249
+Ref: 104955013284
+Ref: 104965013325
+Ref: 104975013422
+Ref: 104985013488
+Ref: 104995013494
+Ref: 105005013533
+Ref: 105015013567
+Ref: 105025013609
+Ref: 105035013677
+Ref: 105045013683
+Ref: 105055013722
+Ref: 105065013756
+Ref: 105075013797
+Ref: 105085013857
+Ref: 105095013863
+Ref: 105105013902
+Ref: 105115013984
+Ref: 105125014007
+Ref: 105135014115
+Ref: 105145014133
+Ref: 105155014236
+Ref: 105165014260
+Ref: 105175014288
+Ref: 105185014303
+Ref: 105195014310
+Ref: 105205014352
+Ref: 105215014422
+Ref: 105225014449
+Ref: 105235014455
+Ref: 105245014471
+Ref: 105255014494
+Ref: 105265014528
+Ref: 105275014561
+Ref: 105285014588
+Ref: 105295014593
+Ref: 105305014615
+Ref: 105315014655
+Ref: 105325014743
+Ref: 105335014787
+Ref: 105345014899
+Ref: 105355014919
+Ref: 105365014941
+Ref: 105375014984
+Ref: 105385015086
+Ref: 105395015106
+Ref: 105405015202
+Ref: 105415015244
+Ref: 105425015286
+Ref: 105435015329
+Ref: 105445015378
+Ref: 105455015420
+Ref: 105465015464
+Ref: 105475015514
+Ref: 105485015563
+Ref: 105495015603
+Ref: 105505015644
+Ref: 105515015890
+Ref: 105525015909
+Ref: 105535016460
+Ref: 105545016543
+Ref: 105555016630
+Ref: 105565016715
+Ref: 105575016771
+Ref: 105585016894
+Ref: 105595016923
+Ref: 105605016957
+Ref: 105615017064
+Ref: 105625017102
+Ref: 105635017136
+Ref: 105645017207
+Ref: 105655017274
+Ref: 105665017358
+Ref: 105675017403
+Ref: 105685017415
+Ref: 105695017456
+Ref: 105705017572
+Ref: 105715017603
+Ref: 105725017633
+Ref: 105735017751
+Ref: 105745017807
+Ref: 105755017870
+Ref: 105765017911
+Ref: 105775017958
+Ref: 105785018000
+Ref: 105795018050
+Ref: 105805018075
+Ref: 105815018087
+Ref: 105825018136
+Ref: 105835018207
+Ref: 105845018223
+Ref: 105855018261
+Ref: 105865018277
+Ref: 105875018350
+Ref: 105885018418
+Ref: 105895018425
+Ref: 105905018438
+Ref: 105915018522
+Ref: 105925018533
+Ref: 105935018558
+Ref: 105945018585
+Ref: 105955018596
+Ref: 105965018621
+Ref: 105975018720
+Ref: 105985018735
+Ref: 105995018809
+Ref: 106005018915
+Ref: 106015018949
+Ref: 106025018975
+Ref: 106035019086
+Ref: 106045019100
+Ref: 106055019115
+Ref: 106065019128
+Ref: 106075019187
+Ref: 106085019248
+Ref: 106095019315
+Ref: 106105019377
+Ref: 106115019469
+Ref: 106125019548
+Ref: 106135019594
+Ref: 106145019608
+Ref: 106155019706
+Ref: 106165019713
+Ref: 106175019784
+Ref: 106185019803
+Ref: 106195019869
+Ref: 106205019888
+Ref: 106215019955
+Ref: 106225019992
+Ref: 106235019992
+Ref: 106245019992
+Ref: 106255019992
+Ref: 106265019992
+Node: Annex Q5065567
+Node: Q.15066165
+Ref: 106275066400
+Node: Q.25078093
+Ref: 106285078370
+Ref: 106295078370
+Node: Q.35094843
+Ref: 106305095099
+Node: Q.45164003
+Ref: 106315164256
+Node: Q.55168041
+Ref: 106325168327
+Ref: 106335168327
+Ref: 106345168327
+Node: Index5192988
+Node: operators5193283
+Node: A5194732
+Node: B5233709
+Node: C5241800
+Node: D5278038
+Node: E5299900
+Node: F5342525
+Node: G5356213
+Node: H5364233
+Node: I5368577
+Node: J5402041
+Node: K5402236
+Node: L5403027
+Node: M5418838
+Node: N5428596
+Node: O5443420
+Node: P5450879
+Node: Q5478297
+Node: R5480139
+Node: S5502675
+Node: T5533166
+Node: U5551742
+Node: V5563203
+Node: W5567374
+Node: X5573951
+Node: Y5574086
End Tag Table
diff --git a/arm2012.info b/arm2012.info
index 0f5a09e..cea3d76 100644
--- a/arm2012.info
+++ b/arm2012.info
@@ -1,4 +1,4 @@
-This is arm2012.info, produced by texi2any version 6.4 from
+This is arm2012.info, produced by texi2any version 6.3 from
arm2012.texinfo.
INFO-DIR-SECTION GNU Ada tools
@@ -322,9 +322,9 @@ held responsible for identifying any or all such patent
rights.
3/3
International Standard ISO/IEC 8652 was prepared by Joint Technical
-Committee ISO/IEC JTC 1, Information Technology Subcommittee SC22,
-Programming languages, their environments and system software
-interfaces.
+Committee ISO/IEC JTC 1, <Information Technology> Subcommittee SC22,
+<Programming languages, their environments and system software
+interfaces>.
4/4
This consolidated edition updates the third edition (ISO/IEC 8652:2012).
@@ -349,7 +349,7 @@ Other available Ada documents include:
available.
4/1
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
5/3
* The Annotated Ada Reference Manual (AARM). The AARM contains all of
@@ -446,7 +446,7 @@ separately compiled program unit must name the library
units it
requires.
14
-Program Units
+<Program Units>
15
A subprogram is the basic unit for expressing an algorithm. There are
@@ -490,7 +490,7 @@ object or a protected type permitting the creation of
several similar
objects.
20
-Declarations and Statements
+<Declarations and Statements>
21
The body of a program unit generally contains two parts: a declarative
@@ -560,7 +560,7 @@ specify the actions to be taken when the error situation
arises.
Exceptions can be raised explicitly by a raise statement.
30
-Data Types
+<Data Types>
31
Every object in the language has a type, which characterizes a set of
@@ -642,7 +642,7 @@ limited set of index values, and records and private types
with
particular discriminant values.
40
-Other Facilities
+<Other Facilities>
41/2
Aspect clauses can be used to specify the mapping between types and
@@ -680,8 +680,8 @@ to all types of a given class.
Language Changes
-Paragraphs 44 through 57 have been removed as they described differences
-from the first edition of Ada (Ada 83).
+<Paragraphs 44 through 57 have been removed as they described
+differences from the first edition of Ada (Ada 83).>
57.1/3
This International Standard replaces the second edition of 1995. It
@@ -849,18 +849,18 @@ initiate the defect correction procedure.
Comments should use the following format:
60/3
- !topic Title summarizing comment
- !reference Ada 2012 RMss.ss(pp)
- !from Author Name yy-mm-dd
- !keywords keywords related to topic
+ !topic <Title summarizing comment>
+ !reference Ada 2012 RM<ss.ss(pp)>
+ !from <Author Name yy-mm-dd>
+ !keywords <keywords related to topic>
!discussion
- text of discussion
+ <text of discussion>
61/3
-where ss.ss is the clause or subclause number, pp is the paragraph
-number where applicable, and yy-mm-dd is the date the comment was sent.
-The date is optional, as is the !keywords line.
+where <ss.ss> is the clause or subclause number, <pp> is the paragraph
+number where applicable, and <yy-mm-dd> is the date the comment was
+sent. The date is optional, as is the !keywords line.
62/1
Please use a descriptive "Subject" in your e-mail message, and limit
@@ -1161,7 +1161,7 @@ Manual, except:
thus, the page breaks are in different places.
77.1/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
77.2/3
* The "Using this version of the Ada Reference Manual" subclause is
@@ -1197,7 +1197,7 @@ inserted, the paragraph numbers are of the form pp.nn,
where pp is the
number of the preceding paragraph, and nn is an insertion number. For
instance, the first paragraph inserted after paragraph 8 is numbered
8.1, the second paragraph inserted is numbered 8.2, and so on. Deleted
-paragraphs are indicated by the text This paragraph was deleted.
+paragraphs are indicated by the text <This paragraph was deleted.>
Deleted paragraphs include empty paragraphs that were numbered in the
1995 edition of the Ada Reference Manual.
@@ -1345,7 +1345,7 @@ This International Standard contains thirteen clauses,
fifteen annexes,
and an index.
2
-The core of the Ada language consists of:
+The <core> of the Ada language consists of:
3/3
* Clauses 1 through 13
@@ -1360,8 +1360,8 @@ The core of the Ada language consists of:
* *note Annex J::, "*note Annex J:: Obsolescent Features"
7
-The following Specialized Needs Annexes define features that are needed
-by certain application areas:
+The following <Specialized Needs Annexes> define features that are
+needed by certain application areas:
8
* *note Annex C::, "*note Annex C:: Systems Programming"
@@ -1440,7 +1440,7 @@ resolution.
_Legality Rules_
27
-Rules that are enforced at compile time. A construct is legal if it
+Rules that are enforced at compile time. A construct is <legal> if it
obeys all of the Legality Rules.
_Static Semantics_
@@ -1451,8 +1451,8 @@ A definition of the compile-time effect of each construct.
_Post-Compilation Rules_
29
-Rules that are enforced before running a partition. A partition is legal
-if its compilation units are legal and it obeys all of the
+Rules that are enforced before running a partition. A partition is
+legal if its compilation units are legal and it obeys all of the
Post-Compilation Rules.
_Dynamic Semantics_
@@ -1549,9 +1549,9 @@ A conforming implementation shall:
International Standard.
8
-The external effect of the execution of an Ada program is defined in
-terms of its interactions with its external environment. The following
-are defined as external interactions:
+The <external effect> of the execution of an Ada program is defined in
+terms of its interactions with its external environment. The following
+are defined as <external interactions>:
9
* Any interaction with an external file (see *note A.7::);
@@ -1608,13 +1608,13 @@ raise an exception at run time.
_Documentation Requirements_
18
-Certain aspects of the semantics are defined to be either implementation
-defined or unspecified. In such cases, the set of possible effects is
-specified, and the implementation may choose any effect in the set.
-Implementations shall document their behavior in implementation-defined
-situations, but documentation is not required for unspecified
-situations. The implementation-defined characteristics are summarized
-in *note M.2::.
+Certain aspects of the semantics are defined to be either
+<implementation defined> or <unspecified>. In such cases, the set of
+possible effects is specified, and the implementation may choose any
+effect in the set. Implementations shall document their behavior in
+implementation-defined situations, but documentation is not required for
+unspecified situations. The implementation-defined characteristics are
+summarized in *note M.2::.
19
The implementation may choose to document implementation-defined
@@ -1705,7 +1705,7 @@ variant of Backus-Naur Form. In particular:
* If the name of any syntactic category starts with an italicized
part, it is equivalent to the category name without the italicized
part. The italicized part is intended to convey some semantic
- information. For example subtype_name and task_name are both
+ information. For example <subtype_>name and <task_>name are both
equivalent to name alone.
14.1/3
@@ -1725,28 +1725,28 @@ mapping, as defined by documents referenced in the note
in Clause 1 of
ISO/IEC 10646:2011.
15
-A syntactic category is a nonterminal in the grammar defined in BNF
+A <syntactic category> is a nonterminal in the grammar defined in BNF
under "Syntax." Names of syntactic categories are set in a different
font, like_this.
16
-A construct is a piece of text (explicit or implicit) that is an
+A <construct> is a piece of text (explicit or implicit) that is an
instance of a syntactic category defined under "Syntax".
17
-A constituent of a construct is the construct itself, or any construct
+A <constituent> of a construct is the construct itself, or any construct
appearing within it.
18
Whenever the run-time semantics defines certain actions to happen in an
-arbitrary order, this means that the implementation shall arrange for
+<arbitrary order>, this means that the implementation shall arrange for
these actions to occur in a way that is equivalent to some sequential
order, following the rules that result from that sequential order. When
evaluations are defined to happen in an arbitrary order, with conversion
of the results to some subtypes, or with some run-time checks, the
evaluations, conversions, and checks may be arbitrarily interspersed, so
long as each expression is evaluated before converting or checking its
-value. Note that the effect of a program can depend on the order chosen
+value. Note that the effect of a program can depend on the order chosen
by the implementation. This can happen, for example, if two actual
parameters of a given call have side effects.
@@ -1796,7 +1796,7 @@ categories:
allowed, permitted, legal, or illegal belongs to this category.
Any program that contains such an error is not a legal Ada program;
on the other hand, the fact that a program is legal does not mean,
- per se, that the program is free from other forms of error.
+ <per se>, that the program is free from other forms of error.
4
The rules are further classified as either compile time rules, or
@@ -1824,10 +1824,10 @@ categories:
8
The language rules define certain kinds of errors that need not be
detected either prior to or during run time, but if not detected,
- the range of possible effects shall be bounded. The errors of this
- category are called bounded errors. The possible effects of a given
- bounded error are specified for each such error, but in any case
- one possible effect of a bounded error is the raising of the
+ the range of possible effects shall be bounded. The errors of this
+ category are called <bounded errors>. The possible effects of a
+ given bounded error are specified for each such error, but in any
+ case one possible effect of a bounded error is the raising of the
exception Program_Error.
9
@@ -1835,7 +1835,7 @@ categories:
10
In addition to bounded errors, the language rules define certain
- kinds of errors as leading to erroneous execution. Like bounded
+ kinds of errors as leading to <erroneous execution>. Like bounded
errors, the implementation need not detect such errors either prior
to or during run time. Unlike bounded errors, there is no
language-specified bound on the possible effect of erroneous
@@ -1844,16 +1844,15 @@ categories:
_Implementation Permissions_
11
-An implementation may provide nonstandard modes of operation. Typically
-these modes would be selected by a pragma or by a command line switch
-when the compiler is invoked. When operating in a nonstandard mode, the
-implementation may reject compilation_units that do not conform to
-additional requirements associated with the mode, such as an excessive
-number of warnings or violation of coding style guidelines. Similarly,
-in a nonstandard mode, the implementation may apply special
+An implementation may provide <nonstandard modes> of operation.
+Typically these modes would be selected by a pragma or by a command line
+switch when the compiler is invoked. When operating in a nonstandard
+mode, the implementation may reject compilation_units that do not
+conform to additional requirements associated with the mode, such as an
+excessive number of warnings or violation of coding style guidelines.
+Similarly, in a nonstandard mode, the implementation may apply special
optimizations or alternative algorithms that are only meaningful for
-programs that satisfy certain criteria specified by the implementation.
-In any case, an implementation shall support a standard mode that
+programs that satisfy certain criteria specified by the implementation.In any
case, an implementation shall support a <standard> mode that
conforms to the requirements of this International Standard; in
particular, in the standard mode, all legal compilation_units shall be
accepted.
@@ -1878,52 +1877,53 @@ latest edition of the referenced document (including
any amendments)
applies.
1.1/3
-ISO 639-3:2007, Codes for the representation of names of languages --
-Part 3: Alpha-3 code for comprehensive coverage of languages.
+ISO 639-3:2007, <Codes for the representation of names of languages --
+Part 3: Alpha-3 code for comprehensive coverage of languages>.
2
-ISO/IEC 646:1991, Information technology -- ISO 7-bit coded character
-set for information interchange.
+ISO/IEC 646:1991, <Information technology -- ISO 7-bit coded character
+set for information interchange>.
3/2
-ISO/IEC 1539-1:2004, Information technology -- Programming languages --
-Fortran -- Part 1: Base language.
+ISO/IEC 1539-1:2004, <Information technology -- Programming languages --
+Fortran -- Part 1: Base language>.
4/2
-ISO/IEC 1989:2002, Information technology -- Programming languages --
-COBOL.
+ISO/IEC 1989:2002, <Information technology -- Programming languages --
+COBOL>.
4.1/3
-ISO/IEC 3166-1:2006, Codes for the representation of names of countries
-and their subdivisions -- Part 1: Country Codes.
+ISO/IEC 3166-1:2006, <Codes for the representation of names of countries
+and their subdivisions -- Part 1: Country Codes>.
5
-ISO/IEC 6429:1992, Information technology -- Control functions for coded
-graphic character sets.
+ISO/IEC 6429:1992, <Information technology -- Control functions for
+coded graphic character sets>.
5.1/2
-ISO 8601:2004, Data elements and interchange formats -- Information
-interchange -- Representation of dates and times.
+ISO 8601:2004, <Data elements and interchange formats -- Information
+interchange -- Representation of dates and times>.
6/3
-ISO/IEC 8859-1:1998, Information technology -- 8-bit single-byte coded
-graphic character sets -- Part 1: Latin alphabet No. 1.
+ISO/IEC 8859-1:1998, <Information technology -- 8-bit single-byte coded
+graphic character sets -- Part 1: Latin alphabet No. 1>.
7/3
-ISO/IEC 9899:2011, Information technology -- Programming languages -- C.
+ISO/IEC 9899:2011, <Information technology -- Programming languages --
+C>.
8/3
-ISO/IEC 10646:2011, Information technology -- Universal Multiple-Octet
-Coded Character Set (UCS).
+ISO/IEC 10646:2011, <Information technology -- Universal Multiple-Octet
+Coded Character Set (UCS)>.
9/3
-ISO/IEC 14882:2011, Information technology -- Programming languages --
-C++.
+ISO/IEC 14882:2011, <Information technology -- Programming languages --
+C++>.
10/2
-ISO/IEC TR 19769:2004, Information technology -- Programming languages,
+ISO/IEC TR 19769:2004, <Information technology -- Programming languages,
their environments and system software interfaces -- Extensions for the
-programming language C to support new character data types.
+programming language C to support new character data types>.
File: arm2012.info, Node: 1.3, Prev: 1.2, Up: 1
@@ -1933,15 +1933,15 @@ File: arm2012.info, Node: 1.3, Prev: 1.2, Up: 1
1/2
Terms are defined throughout this International Standard, indicated by
-italic type. Terms explicitly defined in this International Standard
+<italic> type. Terms explicitly defined in this International Standard
are not to be presumed to refer implicitly to similar terms defined
elsewhere. Mathematical terms not defined in this International
-Standard are to be interpreted according to the CRC Concise Encyclopedia
-of Mathematics, Second Edition. Other terms not defined in this
-International Standard are to be interpreted according to the Webster's
-Third New International Dictionary of the English Language. Informal
-descriptions of some terms are also given in *note Annex N::, "*note
-Annex N:: Glossary".
+Standard are to be interpreted according to the <CRC Concise
+Encyclopedia of Mathematics, Second Edition>. Other terms not defined
+in this International Standard are to be interpreted according to the
+<Webster's Third New International Dictionary of the English Language>.
+Informal descriptions of some terms are also given in *note Annex N::,
+"*note Annex N:: Glossary".
File: arm2012.info, Node: 2, Next: 3, Prev: 1, Up: Top
@@ -1978,11 +1978,11 @@ File: arm2012.info, Node: 2.1, Next: 2.2, Up: 2
The character repertoire for the text of an Ada program consists of the
entire coding space described by the ISO/IEC 10646:2011 Universal
Multiple-Octet Coded Character Set. This coding space is organized in
-planes, each plane comprising 65536 characters.
+<planes>, each plane comprising 65536 characters.
_Syntax_
- Paragraphs 2 and 3 were deleted.
+ <Paragraphs 2 and 3 were deleted.>
3.1/3
A character is defined by this International Standard for each cell
@@ -2011,14 +2011,14 @@ Standard uses the character properties General
Category, Simple
Uppercase Mapping, Uppercase Mapping, and Special Case Condition of the
documents referenced by the note in Clause 1 of ISO/IEC 10646:2011. The
actual set of graphic symbols used by an implementation for the visual
-representation of the text of an Ada program is not specified.
+representation of the text of an Ada program is not specified.
6/3
Characters are categorized as follows:
7/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
8/2
letter_uppercase
@@ -2096,7 +2096,7 @@ format_effector
TABULATION), 16#0A# (LINE FEED), 16#0B# (LINE
TABULATION), 16#0C# (FORM FEED), 16#0D# (CARRIAGE
RETURN), 16#85# (NEXT LINE), and the characters in
- categories separator_line and separator_paragraph.
+ categories separator_line and separator_paragraph.
13.1/2
other_control
@@ -2172,22 +2172,22 @@ File: arm2012.info, Node: 2.2, Next: 2.3, Prev: 2.1,
Up: 2
1
The text of a program consists of the texts of one or more compilations.
-The text of each compilation is a sequence of separate lexical elements.
-Each lexical element is formed from a sequence of characters, and is
-either a delimiter, an identifier, a reserved word, a numeric_literal, a
-character_literal, a string_literal, or a comment. The meaning of a
-program depends only on the particular sequences of lexical elements
-that form its compilations, excluding comments.
+The text of each compilation is a sequence of separate <lexical
+elements>. Each lexical element is formed from a sequence of
+characters, and is either a delimiter, an identifier, a reserved word, a
+numeric_literal, a character_literal, a string_literal, or a comment.
+The meaning of a program depends only on the particular sequences of
+lexical elements that form its compilations, excluding comments.
2/3
-The text of a compilation is divided into lines. In general, the
+The text of a compilation is divided into <lines>. In general, the
representation for an end of line is implementation defined. However, a
sequence of one or more format_effectors other than the character whose
code point is 16#09# (CHARACTER TABULATION) signifies at least one end
of line.
3/2
-In some cases an explicit separator is required to separate adjacent
+In some cases an explicit <separator> is required to separate adjacent
lexical elements. A separator is any of a separator_space, a
format_effector, or the end of a line, as follows:
@@ -2215,13 +2215,13 @@ separator is; any such characters have no effect on the
meaning of an
Ada program.
8/2
-A delimiter is either one of the following characters:
+A <delimiter> is either one of the following characters:
9
& ' ( ) * + , - . / : ; < = >
|
10
-or one of the following compound delimiters each composed of two
+or one of the following <compound delimiters> each composed of two
adjacent special characters
11
@@ -2236,16 +2236,18 @@ character_literal, or numeric_literal.
13
The following names are used when referring to compound delimiters:
- delimiter name=> arrow
-.. double dot
-** double star, exponentiate
-:= assignment (pronounced: "becomes")
-/= inequality (pronounced: "not equal")
->= greater than or equal
-<= less than or equal
-<< left label bracket
->> right label bracket
-<> box
+delimiter name
+----------------------------------------------------
+=> arrow
+.. double dot
+** double star, exponentiate
+:= assignment (pronounced: "becomes")
+/= inequality (pronounced: "not equal")
+>= greater than or equal
+<= less than or equal
+<< left label bracket
+>> right label bracket
+<> box
_Implementation Requirements_
14
@@ -2319,14 +2321,14 @@ conventions.
_Examples_
7
-Examples of identifiers:
+<Examples of identifiers:>
8/2
Count X Get_Symbol Ethelyn Marion
Snobol_4 X1 Page_Count Store_Next_Item
- [Unicode 928][Unicode 955][Unicode 940][Unicode 964][Unicode 969][Unicode
957] -- Plato
- [Unicode 1063][Unicode 1072][Unicode 1081][Unicode 1082][Unicode
1086][Unicode 1074][Unicode 1089][Unicode 1082][Unicode 1080][Unicode 1081] --
Tchaikovsky
- [Unicode 952] [Unicode 966] -- Angles
+ [Unicode 928][Unicode 955][Unicode 940][Unicode 964][Unicode 969][Unicode
957] --< Plato>
+ [Unicode 1063][Unicode 1072][Unicode 1081][Unicode 1082][Unicode
1086][Unicode 1074][Unicode 1089][Unicode 1082][Unicode 1080][Unicode 1081]
--< Tchaikovsky>
+ [Unicode 952] [Unicode 966] --< Angles>
File: arm2012.info, Node: 2.4, Next: 2.5, Prev: 2.3, Up: 2
@@ -2335,9 +2337,9 @@ File: arm2012.info, Node: 2.4, Next: 2.5, Prev: 2.3,
Up: 2
====================
1
-There are two kinds of numeric_literals, real literals and integer
-literals. A real literal is a numeric_literal that includes a point; an
-integer literal is a numeric_literal without a point.
+There are two kinds of numeric_literals, <real literals> and <integer
+literals>. A real literal is a numeric_literal that includes a point;
+an integer literal is a numeric_literal without a point.
_Syntax_
@@ -2347,8 +2349,8 @@ integer literal is a numeric_literal without a point.
NOTES
3
- 3 The type of an integer literal is universal_integer. The type
- of a real literal is universal_real.
+ 3 The type of an integer literal is <universal_integer>. The type
+ of a real literal is <universal_real>.
* Menu:
@@ -2397,12 +2399,12 @@ value of the decimal_literal with the exponent.
_Examples_
8
-Examples of decimal literals:
+<Examples of decimal literals:>
9
- 12 0 1E6 123_456 -- integer literals
+ 12 0 1E6 123_456 --< integer literals>
- 12.0 0.0 0.456 3.14159_26 -- real literals
+ 12.0 0.0 0.456 3.14159_26 --< real literals>
File: arm2012.info, Node: 2.4.2, Prev: 2.4.1, Up: 2.4
@@ -2433,7 +2435,7 @@ the base explicitly.
_Legality Rules_
6
-The base (the numeric value of the decimal numeral preceding the first
+The <base> (the numeric value of the decimal numeral preceding the first
#) shall be at least two and at most sixteen. The extended_digits A
through F represent the digits ten through fifteen, respectively. The
value of each extended_digit of a based_literal shall be less than the
@@ -2455,12 +2457,12 @@ in upper case, with the same meaning.
_Examples_
9
-Examples of based literals:
+<Examples of based literals:>
10
- 2#1111_1111# 16#FF# 016#0ff# -- integer literals of value 255
- 16#E#E1 2#1110_0000# -- integer literals of value 224
- 16#F.FF#E+2 2#1.1111_1111_1110#E11 -- real literals of value 4095.0
+ 2#1111_1111# 16#FF# 016#0ff# --< integer literals of value 255>
+ 16#E#E1 2#1110_0000# --< integer literals of value 224>
+ 16#F.FF#E+2 2#1.1111_1111_1110#E11 --< real literals of value 4095.0>
File: arm2012.info, Node: 2.5, Next: 2.6, Prev: 2.4, Up: 2
@@ -2486,12 +2488,12 @@ two apostrophe characters.
_Examples_
4
-Examples of character literals:
+<Examples of character literals:>
5/2
'A' '*' ''' ' '
- 'L' '[Unicode 1051]' '[Unicode 923]' -- Various els.
- '[Unicode 8734]' '[Unicode 1488]' -- Big numbers -
infinity and aleph.
+ 'L' '[Unicode 1051]' '[Unicode 923]' --< Various els.>
+ '[Unicode 8734]' '[Unicode 1488]' --< Big numbers -
infinity and aleph.>
File: arm2012.info, Node: 2.6, Next: 2.7, Prev: 2.5, Up: 2
@@ -2504,7 +2506,7 @@ A string_literal is formed by a sequence of graphic
characters (possibly
none) enclosed between two quotation marks used as string brackets.
They are used to represent operator_symbols (see *note 6.1::), values of
a string type (see *note 4.2::), and array subaggregates (see *note
-4.3.3::).
+4.3.3::).
_Syntax_
@@ -2512,7 +2514,7 @@ a string type (see *note 4.2::), and array subaggregates
(see *note
string_literal ::= "{string_element}"
3
- string_element ::= "" | non_quotation_mark_graphic_character
+ string_element ::= "" | <non_quotation_mark_>graphic_character
4
A string_element is either a pair of quotation marks (""), or a
@@ -2521,14 +2523,14 @@ a string type (see *note 4.2::), and array
subaggregates (see *note
_Static Semantics_
5
-The sequence of characters of a string_literal is formed from the
+The <sequence of characters> of a string_literal is formed from the
sequence of string_elements between the bracketing quotation marks, in
the given order, with a string_element that is "" becoming a single
quotation mark in the sequence of characters, and any other
string_element being reproduced in the sequence.
6
-A null string literal is a string_literal with no string_elements
+A <null string literal> is a string_literal with no string_elements
between the quotation marks.
NOTES
@@ -2543,13 +2545,13 @@ between the quotation marks.
_Examples_
8
-Examples of string literals:
+<Examples of string literals:>
9/2
"Message of the day:"
- "" -- a null string literal
- " " "A" """" -- three string literals of length 1
+ "" --< a null string literal>
+ " " "A" """" --< three string literals of length 1>
"Characters such as $, %, and } are allowed in string literals"
"Archimedes said ""[Unicode 917][Unicode 973][Unicode 961][Unicode
951][Unicode 954][Unicode 945]"""
@@ -2568,7 +2570,7 @@ the line.
_Syntax_
2
- comment ::= --{non_end_of_line_character}
+ comment ::= --{<non_end_of_line_>character}
3
A comment may appear on any line of a program.
@@ -2584,17 +2586,17 @@ human reader.
_Examples_
5
-Examples of comments:
+<Examples of comments:>
6
- -- the last sentence above echoes the Algol 68 report
+ --< the last sentence above echoes the Algol 68 report >
- end; -- processing of Line is complete
+ end; --< processing of Line is complete >
- -- a long comment may be split onto
- -- two or more consecutive lines
+ --< a long comment may be split onto>
+ --< two or more consecutive lines >
- ---------------- the first two hyphens start the comment
+ ----------------< the first two hyphens start the comment >
File: arm2012.info, Node: 2.8, Next: 2.9, Prev: 2.7, Up: 2
@@ -2616,16 +2618,16 @@ implementation may support additional
(implementation-defined) pragmas.
3/3
pragma_argument_association ::=
- [pragma_argument_identifier =>] name
- | [pragma_argument_identifier =>] expression
- | pragma_argument_aspect_mark => name
- | pragma_argument_aspect_mark => expression
+ [<pragma_argument_>identifier =>] name
+ | [<pragma_argument_>identifier =>] expression
+ | <pragma_argument_>aspect_mark => name
+ | <pragma_argument_>aspect_mark => expression
4/3
In a pragma, any pragma_argument_associations without a
- pragma_argument_identifier or pragma_argument_aspect_mark shall
- precede any associations with a pragma_argument_identifier or
- pragma_argument_aspect_mark.
+ <pragma_argument_>identifier or <pragma_argument_>aspect_mark shall
+ precede any associations with a <pragma_argument_>identifier or
+ <pragma_argument_>aspect_mark.
5
Pragmas are only allowed at the following places in a program:
@@ -2654,12 +2656,12 @@ implementation may support additional
(implementation-defined) pragmas.
specific pragmas.
9
-The name of a pragma is the identifier following the reserved word
-pragma. The name or expression of a pragma_argument_association is a
-pragma argument.
+The <name> of a pragma is the identifier following the reserved word
+pragma. The name or expression of a pragma_argument_association is a
+<pragma argument>.
10/3
-An identifier specific to a pragma is an identifier or reserved word
+An <identifier specific to a pragma> is an identifier or reserved word
that is used in a pragma argument with special meaning for that pragma.
_Static Semantics_
@@ -2759,14 +2761,14 @@ defined how this advice is followed.
_Examples_
28
-Examples of pragmas:
+<Examples of pragmas:>
29/3
- pragma List(Off); -- turn off listing generation
- pragma Optimize(Off); -- turn off optional optimizations
- pragma Pure(Rational_Numbers); -- set categorization for package
+ pragma List(Off); -- <turn off listing generation>
+ pragma Optimize(Off); -- <turn off optional optimizations>
+ pragma Pure(Rational_Numbers); -- <set categorization for package>
pragma Assert(Exists(File_Name),
- Message => "Nonexistent file"); -- assert file exists
+ Message => "Nonexistent file"); -- <assert file exists>
File: arm2012.info, Node: 2.9, Prev: 2.8, Up: 2
@@ -2777,10 +2779,10 @@ File: arm2012.info, Node: 2.9, Prev: 2.8, Up: 2
_Syntax_
1/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
2/3
- The following are the reserved words. Within a program, some or
+ The following are the <reserved words>. Within a program, some or
all of the letters of a reserved word may be in upper case.
abort else new return
@@ -2848,8 +2850,8 @@ File: arm2012.info, Node: 3.1, Next: 3.2, Up: 3
================
1
-The language defines several kinds of named entities that are declared
-by declarations. The entity's name is defined by the declaration,
+The language defines several kinds of named <entities> that are declared
+by declarations. The entity's <name> is defined by the declaration,
usually by a defining_identifier (*note 3.1: S0022.), but sometimes by a
defining_character_literal (*note 3.5.1: S0040.) or
defining_operator_symbol (*note 6.1: S0171.).
@@ -2876,11 +2878,11 @@ of declaration defined as follows.
_Static Semantics_
5
-A declaration is a language construct that associates a name with (a
-view of) an entity. A declaration may appear explicitly in the program
-text (an explicit declaration), or may be supposed to occur at a given
+A <declaration> is a language construct that associates a name with (a
+view of) an entity. A declaration may appear explicitly in the program
+text (an <explicit> declaration), or may be supposed to occur at a given
place in the text as a consequence of the semantics of another construct
-(an implicit declaration).
+(an <implicit> declaration).
6/3
Each of the following is defined to be a declaration: any
@@ -2896,33 +2898,33 @@ an entry_declaration (*note 9.5.2: S0218.); an
entry_index_specification
S0267.); a generic_formal_parameter_declaration (*note 12.1: S0275.).
7
-All declarations contain a definition for a view of an entity. A view
-consists of an identification of the entity (the entity of the view),
-plus view-specific characteristics that affect the use of the entity
-through that view (such as mode of access to an object, formal parameter
-names and defaults for a subprogram, or visibility to components of a
-type). In most cases, a declaration also contains the definition for
-the entity itself (a renaming_declaration is an example of a declaration
-that does not define a new entity, but instead defines a view of an
-existing entity (see *note 8.5::)).
+All declarations contain a <definition> for a <view> of an entity. A
+view consists of an identification of the entity (the entity <of> the
+view), plus view-specific characteristics that affect the use of the
+entity through that view (such as mode of access to an object, formal
+parameter names and defaults for a subprogram, or visibility to
+components of a type). In most cases, a declaration also contains the
+definition for the entity itself (a renaming_declaration is an example
+of a declaration that does not define a new entity, but instead defines
+a view of an existing entity (see *note 8.5::)).
7.1/3
-When it is clear from context, the term object is used in place of view
-of an object. Similarly, the terms type and subtype are used in place
-of view of a type and view of a subtype, respectively.
+When it is clear from context, the term <object> is used in place of
+<view of an object>. Similarly, the terms <type> and <subtype> are used
+in place of <view of a type> and <view of a subtype>, respectively.
8
For each declaration, the language rules define a certain region of text
-called the scope of the declaration (see *note 8.2::). Most
+called the <scope> of the declaration (see *note 8.2::). Most
declarations associate an identifier with a declared entity. Within its
scope, and only there, there are places where it is possible to use the
identifier to refer to the declaration, the view it defines, and the
associated entity; these places are defined by the visibility rules (see
-*note 8.3::). At such places the identifier is said to be a name of the
-entity (the direct_name or selector_name); the name is said to denote
-the declaration, the view, and the associated entity (see *note 8.6::).
-The declaration is said to declare the name, the view, and in most
-cases, the entity itself.
+*note 8.3::). At such places the identifier is said to be a <name> of
+the entity (the direct_name or selector_name); the name is said to
+<denote> the declaration, the view, and the associated entity (see *note
+8.6::). The declaration is said to <declare> the name, the view, and in
+most cases, the entity itself.
9
As an alternative to an identifier, an enumeration literal can be
@@ -2934,26 +2936,26 @@ function can be declared with an operator_symbol as its
name (see *note
The syntax rules use the terms defining_identifier,
defining_character_literal (*note 3.5.1: S0040.), and
defining_operator_symbol (*note 6.1: S0171.) for the defining occurrence
-of a name; these are collectively called defining names. The terms
+of a name; these are collectively called <defining names>. The terms
direct_name and selector_name are used for usage occurrences of
identifiers, character_literals, and operator_symbols. These are
-collectively called usage names.
+collectively called <usage names>.
_Dynamic Semantics_
11
The process by which a construct achieves its run-time effect is called
-execution. This process is also called elaboration for declarations and
-evaluation for expressions. One of the terms execution, elaboration, or
-evaluation is defined by this International Standard for each construct
-that has a run-time effect.
+<execution>. This process is also called <elaboration> for declarations
+and <evaluation> for expressions. One of the terms execution,
+elaboration, or evaluation is defined by this International Standard for
+each construct that has a run-time effect.
NOTES
12
- 1 At compile time, the declaration of an entity declares the
- entity. At run time, the elaboration of the declaration creates the
- entity.
+ 1 At compile time, the declaration of an entity <declares> the
+ entity. At run time, the elaboration of the declaration <creates>
+ the entity.
File: arm2012.info, Node: 3.2, Next: 3.3, Prev: 3.1, Up: 3
@@ -2964,35 +2966,35 @@ File: arm2012.info, Node: 3.2, Next: 3.3, Prev: 3.1,
Up: 3
_Static Semantics_
1
-A type is characterized by a set of values, and a set of primitive
-operations which implement the fundamental aspects of its semantics. An
-object of a given type is a run-time entity that contains (has) a value
-of the type.
+A <type> is characterized by a set of values, and a set of <primitive
+operations> which implement the fundamental aspects of its semantics.
+An <object> of a given type is a run-time entity that contains (has) a
+value of the type.
2/2
-Types are grouped into categories of types. There exist several
-language-defined categories of types (see NOTES below), reflecting the
+Types are grouped into <categories> of types. There exist several
+<language-defined categories> of types (see NOTES below), reflecting the
similarity of their values and primitive operations. Most categories of
-types form classes of types. Elementary types are those whose values are
-logically indivisible; composite types are those whose values are
-composed of component values.
+types form <classes> of types. <Elementary> types are those whose
+values are logically indivisible; <composite> types are those whose
+values are composed of <component> values.
3
-The elementary types are the scalar types (discrete and real) and the
-access types (whose values provide access to objects or subprograms).
-Discrete types are either integer types or are defined by enumeration of
-their values (enumeration types). Real types are either floating point
-types or fixed point types.
+The elementary types are the <scalar> types (<discrete> and <real>) and
+the <access> types (whose values provide access to objects or
+subprograms). Discrete types are either <integer> types or are defined
+by enumeration of their values (<enumeration> types). Real types are
+either <floating point> types or <fixed point> types.
4/2
-The composite types are the record types, record extensions, array
-types, interface types, task types, and protected types.
+The composite types are the <record> types, <record extensions>, <array>
+types, <interface> types, <task> types, and <protected> types.
4.1/2
There can be multiple views of a type with varying sets of operations.
-An incomplete type represents an incomplete view (see *note 3.10.1::) of
-a type with a very restricted usage, providing support for recursive
-data structures. A private type or private extension represents a
+An <incomplete> type represents an incomplete view (see *note 3.10.1::)
+of a type with a very restricted usage, providing support for recursive
+data structures. A <private> type or <private extension> represents a
partial view (see *note 7.3::) of a type, providing support for data
abstraction. The full view (see *note 3.2.1::) of a type represents its
complete definition. An incomplete or partial view is considered a
@@ -3000,15 +3002,15 @@ composite type, even if the full view is not.
5/2
Certain composite types (and views thereof) have special components
-called discriminants whose values affect the presence, constraints, or
+called <discriminants> whose values affect the presence, constraints, or
initialization of other components. Discriminants can be thought of as
parameters of the type.
6/2
-The term subcomponent is used in this International Standard in place of
-the term component to indicate either a component, or a component of
+The term <subcomponent> is used in this International Standard in place
+of the term component to indicate either a component, or a component of
another subcomponent. Where other subcomponents are excluded, the term
-component is used instead. Similarly, a part of an object or value is
+component is used instead. Similarly, a <part> of an object or value is
used to mean the whole object or value, or any set of its subcomponents.
The terms component, subcomponent, and part are also applied to a type
meaning the component, subcomponent, or part of objects and values of
@@ -3016,29 +3018,29 @@ the type.
7/2
The set of possible values for an object of a given type can be
-subjected to a condition that is called a constraint (the case of a null
-constraint that specifies no restriction is also included); the rules
-for which values satisfy a given kind of constraint are given in *note
-3.5:: for range_constraints, *note 3.6.1:: for index_constraints, and
-*note 3.7.1:: for discriminant_constraints. The set of possible values
-for an object of an access type can also be subjected to a condition
-that excludes the null value (see *note 3.10::).
+subjected to a condition that is called a <constraint> (the case of a
+<null constraint> that specifies no restriction is also included); the
+rules for which values satisfy a given kind of constraint are given in
+*note 3.5:: for range_constraints, *note 3.6.1:: for index_constraints,
+and *note 3.7.1:: for discriminant_constraints. The set of possible
+values for an object of an access type can also be subjected to a
+condition that excludes the null value (see *note 3.10::).
8/2
-A subtype of a given type is a combination of the type, a constraint on
-values of the type, and certain attributes specific to the subtype. The
-given type is called the type of the subtype. Similarly, the associated
-constraint is called the constraint of the subtype. The set of values
-of a subtype consists of the values of its type that satisfy its
-constraint and any exclusion of the null value. Such values belong to
-the subtype.
+A <subtype> of a given type is a combination of the type, a constraint
+on values of the type, and certain attributes specific to the subtype.
+The given type is called the <type of the subtype>. Similarly, the
+associated constraint is called the <constraint of the subtype>. The
+set of values of a subtype consists of the values of its type that
+satisfy its constraint and any exclusion of the null value. Such values
+<belong> to the subtype.
9
-A subtype is called an unconstrained subtype if its type has unknown
+A subtype is called an <unconstrained> subtype if its type has unknown
discriminants, or if its type allows range, index, or discriminant
constraints, but the subtype does not impose such a constraint;
-otherwise, the subtype is called a constrained subtype (since it has no
-unconstrained characteristics).
+otherwise, the subtype is called a <constrained> subtype (since it has
+no unconstrained characteristics).
NOTES
@@ -3050,8 +3052,8 @@ unconstrained characteristics).
generally those that have their own particular set of primitive
operations (see *note 3.2.3::), or that correspond to a set of
types that are matched by a given kind of generic formal type (see
- *note 12.5::). The following are examples of "interesting"
- language-defined classes: elementary, scalar, discrete,
+ *note 12.5::). The following are examples of "interesting"
+ <language-defined classes>: elementary, scalar, discrete,
enumeration, character, boolean, integer, signed integer, modular,
real, floating point, fixed point, ordinary fixed point, decimal
fixed point, numeric, access, access-to-object,
@@ -3059,7 +3061,7 @@ unconstrained characteristics).
tagged, task, protected, nonlimited. Special syntax is provided to
define types in each of these classes. In addition to these
classes, the following are examples of "interesting"
- language-defined categories: abstract, incomplete, interface,
+ <language-defined categories>: abstract, incomplete, interface,
limited, private, record.
11/2
@@ -3155,19 +3157,19 @@ itself.
6
The defining_identifier (*note 3.1: S0022.) of a type_declaration (*note
-3.2.1: S0023.) denotes the first subtype of the type. The
+3.2.1: S0023.) denotes the <first subtype> of the type. The
known_discriminant_part (*note 3.7: S0061.), if any, defines the
discriminants of the type (see *note 3.7::, "*note 3.7::
Discriminants"). The remainder of the type_declaration (*note 3.2.1:
S0023.) defines the remaining characteristics of (the view of) the type.
7/2
-A type defined by a type_declaration (*note 3.2.1: S0023.) is a named
-type; such a type has one or more nameable subtypes. Certain other forms
-of declaration also include type definitions as part of the declaration
-for an object. The type defined by such a declaration is anonymous --
-it has no nameable subtypes. For explanatory purposes, this
-International Standard sometimes refers to an anonymous type by a
+A type defined by a type_declaration (*note 3.2.1: S0023.) is a <named>
+type; such a type has one or more nameable subtypes. Certain other
+forms of declaration also include type definitions as part of the
+declaration for an object. The type defined by such a declaration is
+<anonymous> -- it has no nameable subtypes. For explanatory purposes,
+this International Standard sometimes refers to an anonymous type by a
pseudo-name, written in italics, and uses such pseudo-names at places
where the syntax normally requires an identifier. For a named type
whose first subtype is T, this International Standard sometimes refers
@@ -3176,24 +3178,24 @@ to the type of T as simply "the type T".
8/2
A named type that is declared by a full_type_declaration (*note 3.2.1:
S0024.), or an anonymous type that is defined by an access_definition or
-as part of declaring an object of the type, is called a full type. The
-declaration of a full type also declares the full view of the type. The
-type_definition (*note 3.2.1: S0025.), task_definition (*note 9.1:
-S0207.), protected_definition (*note 9.4: S0212.), or access_definition
-(*note 3.10: S0084.) that defines a full type is called a full type
-definition. Types declared by other forms of type_declaration (*note
-3.2.1: S0023.) are not separate types; they are partial or incomplete
-views of some full type.
+as part of declaring an object of the type, is called a <full type>.
+The declaration of a full type also declares the <full view> of the
+type. The type_definition (*note 3.2.1: S0025.), task_definition (*note
+9.1: S0207.), protected_definition (*note 9.4: S0212.), or
+access_definition (*note 3.10: S0084.) that defines a full type is
+called a <full type definition>. Types declared by other forms of
+type_declaration (*note 3.2.1: S0023.) are not separate types; they are
+partial or incomplete views of some full type.
9
-The definition of a type implicitly declares certain predefined
-operators that operate on the type, according to what classes the type
+The definition of a type implicitly declares certain <predefined
+operators> that operate on the type, according to what classes the type
belongs, as specified in *note 4.5::, "*note 4.5:: Operators and
Expression Evaluation".
10
-The predefined types (for example the types Boolean, Wide_Character,
-Integer, root_integer, and universal_integer) are the types that are
+The <predefined types> (for example the types Boolean, Wide_Character,
+Integer, <root_integer>, and <universal_integer>) are the types that are
defined in a predefined library package called Standard; this package
also includes the (implicit) declarations of their predefined operators.
The package Standard is described in *note A.1::.
@@ -3202,13 +3204,13 @@ The package Standard is described in *note A.1::.
11
The elaboration of a full_type_declaration consists of the elaboration
-of the full type definition. Each elaboration of a full type definition
+of the full type definition. Each elaboration of a full type definition
creates a distinct type and its first subtype.
_Examples_
12
-Examples of type definitions:
+<Examples of type definitions:>
13
(White, Red, Yellow, Green, Blue, Brown, Black)
@@ -3216,7 +3218,7 @@ Examples of type definitions:
array(1 .. 10) of Integer
14
-Examples of type declarations:
+<Examples of type declarations:>
15
type Color is (White, Red, Yellow, Green, Blue, Brown, Black);
@@ -3258,7 +3260,7 @@ type, as defined by a subtype_indication.
subtype_indication ::= [null_exclusion] subtype_mark [constraint]
4
- subtype_mark ::= subtype_name
+ subtype_mark ::= <subtype_>name
5
constraint ::= scalar_constraint | composite_constraint
@@ -3274,14 +3276,15 @@ type, as defined by a subtype_indication.
_Name Resolution Rules_
8
-A subtype_mark shall resolve to denote a subtype. The type determined by
-a subtype_mark is the type of the subtype denoted by the subtype_mark.
+A subtype_mark shall resolve to denote a subtype. The type <determined
+by> a subtype_mark is the type of the subtype denoted by the
+subtype_mark.
_Dynamic Semantics_
9
The elaboration of a subtype_declaration consists of the elaboration of
-the subtype_indication. The elaboration of a subtype_indication creates
+the subtype_indication. The elaboration of a subtype_indication creates
a new subtype. If the subtype_indication does not include a constraint,
the new subtype has the same (possibly null) constraint as that denoted
by the subtype_mark. The elaboration of a subtype_indication that
@@ -3291,16 +3294,16 @@ includes a constraint proceeds as follows:
* The constraint is first elaborated.
11
- * A check is then made that the constraint is compatible with the
+ * A check is then made that the constraint is <compatible> with the
subtype denoted by the subtype_mark.
12
The condition imposed by a constraint is the condition obtained after
-elaboration of the constraint. The rules defining compatibility are
+elaboration of the constraint. The rules defining compatibility are
given for each form of constraint in the appropriate subclause. These
-rules are such that if a constraint is compatible with a subtype, then
+rules are such that if a constraint is <compatible> with a subtype, then
the condition imposed by the constraint cannot contradict any condition
-already imposed by the subtype on its values. The exception
+already imposed by the subtype on its values. The exception
Constraint_Error is raised if any check of compatibility fails.
NOTES
@@ -3316,17 +3319,17 @@ Constraint_Error is raised if any check of
compatibility fails.
_Examples_
14
-Examples of subtype declarations:
+<Examples of subtype declarations:>
15/2
- subtype Rainbow is Color range Red .. Blue; -- see *note 3.2.1::
+ subtype Rainbow is Color range Red .. Blue; --< see *note
3.2.1::>
subtype Red_Blue is Rainbow;
subtype Int is Integer;
subtype Small_Int is Integer range -10 .. 10;
- subtype Up_To_K is Column range 1 .. K; -- see *note 3.2.1::
- subtype Square is Matrix(1 .. 10, 1 .. 10); -- see *note 3.6::
- subtype Male is Person(Sex => M); -- see *note
3.10.1::
- subtype Binop_Ref is not null Binop_Ptr; -- see *note 3.10::
+ subtype Up_To_K is Column range 1 .. K; --< see *note
3.2.1::>
+ subtype Square is Matrix(1 .. 10, 1 .. 10); --< see *note 3.6::>
+ subtype Male is Person(Sex => M); --< see *note
3.10.1::>
+ subtype Binop_Ref is not null Binop_Ptr; --< see *note
3.10::>
File: arm2012.info, Node: 3.2.3, Next: 3.2.4, Prev: 3.2.2, Up: 3.2
@@ -3337,17 +3340,17 @@ File: arm2012.info, Node: 3.2.3, Next: 3.2.4, Prev:
3.2.2, Up: 3.2
_Static Semantics_
1/2
-An operation operates on a type T if it yields a value of type T, if it
-has an operand whose expected type (see *note 8.6::) is T, or if it has
-an access parameter or access result type (see *note 6.1::) designating
-T. A predefined operator, or other language-defined operation such as
-assignment or a membership test, that operates on a type, is called a
-predefined operation of the type. The primitive operations of a type are
-the predefined operations of the type, plus any user-defined primitive
-subprograms.
+An operation <operates on a type> <T> if it yields a value of type <T>,
+if it has an operand whose expected type (see *note 8.6::) is <T>, or if
+it has an access parameter or access result type (see *note 6.1::)
+designating <T>. A predefined operator, or other language-defined
+operation such as assignment or a membership test, that operates on a
+type, is called a <predefined operation> of the type. The <primitive
+operations> of a type are the predefined operations of the type, plus
+any user-defined primitive subprograms.
2
-The primitive subprograms of a specific type are defined as follows:
+The <primitive subprograms> of a specific type are defined as follows:
3
* The predefined operators of the type (see *note 4.5::);
@@ -3379,7 +3382,7 @@ The primitive subprograms of a specific type are defined
as follows:
8
A primitive subprogram whose designator is an operator_symbol is called
-a primitive operator.
+a <primitive operator>.
File: arm2012.info, Node: 3.2.4, Prev: 3.2.3, Up: 3.2
@@ -3388,9 +3391,9 @@ File: arm2012.info, Node: 3.2.4, Prev: 3.2.3, Up: 3.2
------------------------
1/3
-The language-defined predicate aspects Static_Predicate and
+The language-defined <predicate aspects> Static_Predicate and
Dynamic_Predicate may be used to define properties of subtypes. A
-predicate specification is an aspect_specification for one of the two
+<predicate specification> is an aspect_specification for one of the two
predicate aspects. General rules for aspects and aspect_specifications
are found in Clause *note 13:: (*note 13.1:: and *note 13.1.1::
respectively).
@@ -3416,10 +3419,10 @@ predicate specifications apply to certain other
subtypes:
subtype denoted by the subtype_mark applies.
6/4
-This paragraph was deleted.
+<This paragraph was deleted.>
7/3
-Predicate checks are defined to be enabled or disabled for a given
+Predicate checks are defined to be <enabled> or <disabled> for a given
subtype as follows:
8/3
@@ -3479,19 +3482,19 @@ The expected type for the Predicate_Failure expression
is String.
15/3
The expression of a Static_Predicate specification shall be
-predicate-static; that is, one of the following:
+<predicate-static>; that is, one of the following:
16/3
* a static expression;
17/4
- * a membership test whose tested_simple_expression is the current
+ * a membership test whose <tested_>simple_expression is the current
instance, and whose membership_choice_list meets the requirements
for a static membership test (see *note 4.9::);
18/3
- * a case_expression whose selecting_expression is the current
- instance, and whose dependent_expressions are static expressions;
+ * a case_expression whose <selecting_>expression is the current
+ instance, and whose <dependent_>expressions are static expressions;
19/3
* a call to a predefined equality or ordering operator, where one
@@ -3548,31 +3551,31 @@ If any of the above Legality Rules is violated in an
instance of a
generic unit, Program_Error is raised at the point of the violation.
29.2/4
-To determine whether a value satisfies the predicates of a subtype S,
-the following tests are performed in the following order, until one of
-the tests fails, in which case the predicates are not satisfied and no
-further tests are performed, or all of the tests succeed, in which case
-the predicates are satisfied:
+To determine whether a value <satisfies the predicates> of a subtype
+<S>, the following tests are performed in the following order, until one
+of the tests fails, in which case the predicates are not satisfied and
+no further tests are performed, or all of the tests succeed, in which
+case the predicates are satisfied:
29.3/4
* the value is first tested to determine whether it satisfies any
- constraints or any null exclusion of S;
+ constraints or any null exclusion of <S>;
29.4/4
* then:
29.5/4
- * if S is a first subtype, the value is tested to determine
+ * if <S> is a first subtype, the value is tested to determine
whether it satisfies the predicates of the parent and
- progenitor subtypes (if any) of S (in an arbitrary order);
+ progenitor subtypes (if any) of <S> (in an arbitrary order);
29.6/4
- * if S is defined by a subtype_indication, the value is tested
+ * if <S> is defined by a subtype_indication, the value is tested
to determine whether it satisfies the predicates of the
subtype denoted by the subtype_mark of the subtype_indication;
29.7/4
- * finally, if S is defined by a declaration to which one or more
+ * finally, if <S> is defined by a declaration to which one or more
predicate specifications apply, the predicates are evaluated (in an
arbitrary order) to test that all of them yield True for the given
value.
@@ -3610,10 +3613,10 @@ If predicate checks are enabled for a given subtype,
then:
string is associated with the Assertion_Error exception.
32/4
-This paragraph was deleted.
+<This paragraph was deleted.>
33/4
-This paragraph was deleted.
+<This paragraph was deleted.>
NOTES
@@ -3631,8 +3634,8 @@ This paragraph was deleted.
36/4
7 No predicates apply to the base subtype of a scalar type; every
- value of a scalar type T is considered to satisfy the predicates of
- T'Base.
+ value of a scalar type <T> is considered to satisfy the predicates
+ of <T>'Base.
37/4
8 Predicate_Failure expressions are never evaluated during the
@@ -3646,7 +3649,7 @@ This paragraph was deleted.
_Examples_
39/4
- subtype Basic_Letter is Character -- See *note A.3.2:: for "basic letter".
+ subtype Basic_Letter is Character -- <See *note A.3.2:: for "basic
letter".>
with Static_Predicate => Basic_Letter in 'A'..'Z' | 'a'..'z' | '�' |
'�' | '�' | '�' | '�' | '�' | '�';
40/4
@@ -3655,8 +3658,8 @@ This paragraph was deleted.
Predicate_Failure => "Even_Integer must be a multiple of 2";
41/4
-Text_IO (see *note A.10.1::) could have used predicates to describe some
-common exceptional conditions as follows:
+<Text_IO (see *note A.10.1::) could have used predicates to describe
+some common exceptional conditions as follows:>
42/4
with Ada.IO_Exceptions;
@@ -3699,7 +3702,7 @@ common exceptional conditions as follows:
...
51/4
- -- Similarly for all of the other input and output subprograms.
+ -- <Similarly for all of the other input and output subprograms.>
File: arm2012.info, Node: 3.3, Next: 3.4, Prev: 3.2, Up: 3
@@ -3708,7 +3711,7 @@ File: arm2012.info, Node: 3.3, Next: 3.4, Prev: 3.2,
Up: 3
=============================
1
-Objects are created at run time and contain a value of a given type. An
+Objects are created at run time and contain a value of a given type. An
object can be created and initialized as part of elaborating a
declaration, evaluating an allocator, aggregate, or function_call, or
passing a parameter by copy. Prior to reclaiming the storage for an
@@ -3754,22 +3757,22 @@ All of the following are objects:
* a component, slice, or view conversion of another object.
13/3
-An object is either a constant object or a variable object. Similarly,
-a view of an object is either a constant or a variable. All views of a
-constant elementary object are constant. All views of a constant
-composite object are constant, except for parts that are of controlled
-or immutably limited types; variable views of those parts and their
-subcomponents may exist. In this sense, objects of controlled and
-immutably limited types are inherently mutable. A constant view of an
+An object is either a <constant> object or a <variable> object.
+Similarly, a view of an object is either a <constant> or a <variable>.
+All views of a constant elementary object are constant. All views of a
+constant composite object are constant, except for parts that are of
+controlled or immutably limited types; variable views of those parts and
+their subcomponents may exist. In this sense, objects of controlled and
+immutably limited types are <inherently mutable>. A constant view of an
object cannot be used to modify its value. The terms constant and
variable by themselves refer to constant and variable views of objects.
14
-The value of an object is read when the value of any part of the object
-is evaluated, or when the value of an enclosing object is evaluated. The
-value of a variable is updated when an assignment is performed to any
-part of the variable, or when an assignment is performed to an enclosing
-object.
+The value of an object is <read> when the value of any part of the
+object is evaluated, or when the value of an enclosing object is
+evaluated. The value of a variable is <updated> when an assignment is
+performed to any part of the variable, or when an assignment is
+performed to an enclosing object.
15
Whether a view of an object is constant or variable is determined by the
@@ -3816,22 +3819,22 @@ constants:
of a constant.
23/3
-At the place where a view of an object is defined, a nominal subtype is
-associated with the view. The object's actual subtype (that is, its
-subtype) can be more restrictive than the nominal subtype of the view;
-it always is if the nominal subtype is an indefinite subtype. A subtype
-is an indefinite subtype if it is an unconstrained array subtype, or if
-it has unknown discriminants or unconstrained discriminants without
-defaults (see *note 3.7::); otherwise, the subtype is a definite subtype
-(all elementary subtypes are definite subtypes). A class-wide subtype
-is defined to have unknown discriminants, and is therefore an indefinite
-subtype. An indefinite subtype does not by itself provide enough
-information to create an object; an additional constraint or explicit
-initialization expression is necessary (see *note 3.3.1::). A component
-cannot have an indefinite nominal subtype.
+At the place where a view of an object is defined, a <nominal subtype>
+is associated with the view. The object's <actual subtype> (that is,
+its subtype) can be more restrictive than the nominal subtype of the
+view; it always is if the nominal subtype is an <indefinite subtype>. A
+subtype is an indefinite subtype if it is an unconstrained array
+subtype, or if it has unknown discriminants or unconstrained
+discriminants without defaults (see *note 3.7::); otherwise, the subtype
+is a <definite> subtype (all elementary subtypes are definite subtypes).
+A class-wide subtype is defined to have unknown discriminants, and is
+therefore an indefinite subtype. An indefinite subtype does not by
+itself provide enough information to create an object; an additional
+constraint or explicit initialization expression is necessary (see *note
+3.3.1::). A component cannot have an indefinite nominal subtype.
23.1/3
-A view of a composite object is known to be constrained if:
+A view of a composite object is <known to be constrained> if:
23.2/3
* its nominal subtype is constrained, and is not an untagged partial
@@ -3877,7 +3880,7 @@ is known to be constrained:
considered pool-specific.
24
-A named number provides a name for a numeric value known at compile
+A <named number> provides a name for a numeric value known at compile
time. It is declared by a number_declaration.
NOTES
@@ -3910,9 +3913,9 @@ File: arm2012.info, Node: 3.3.1, Next: 3.3.2, Up: 3.3
-------------------------
1/3
-An object_declaration declares a stand-alone object with a given nominal
-subtype and, optionally, an explicit initial value given by an
-initialization expression. For an array, access, task, or protected
+An object_declaration declares a <stand-alone> object with a given
+nominal subtype and, optionally, an explicit initial value given by an
+initialization expression. For an array, access, task, or protected
object, the object_declaration may include the definition of the
(anonymous) type of the object.
@@ -3941,7 +3944,7 @@ object, the object_declaration may include the definition
of the
4
For an object_declaration with an expression following the compound
delimiter :=, the type expected for the expression is that of the
-object. This expression is called the initialization expression.
+object. This expression is called the <initialization expression>.
_Legality Rules_
@@ -3955,11 +3958,11 @@ shall be an initialization expression.
6/3
An object_declaration with the reserved word constant declares a
-constant object. If it has an initialization expression, then it is
-called a full constant declaration. Otherwise, it is called a deferred
-constant declaration. The rules for deferred constant declarations are
-given in subclause *note 7.4::. The rules for full constant
-declarations are given in this subclause.
+constant object. If it has an initialization expression, then it is
+called a <full constant declaration>. Otherwise, it is called a
+<deferred constant declaration>. The rules for deferred constant
+declarations are given in subclause *note 7.4::. The rules for full
+constant declarations are given in this subclause.
7
Any declaration that includes a defining_identifier_list with more than
@@ -3977,7 +3980,7 @@ object_declaration declares an object of the type of the
nominal
subtype.
8.1/2
-A component of an object is said to require late initialization if it
+A component of an object is said to <require late initialization> if it
has an access discriminant value constrained by a per-object expression,
or if it has an initialization expression that includes a name denoting
the current instance of the type or denoting an access discriminant.
@@ -3989,15 +3992,15 @@ If a composite object declared by an object_declaration
has an
unconstrained nominal subtype, then if this subtype is indefinite or the
object is constant the actual subtype of this object is constrained.
The constraint is determined by the bounds or discriminants (if any) of
-its initial value; the object is said to be constrained by its initial
-value. When not constrained by its initial value, the actual and nominal
-subtypes of the object are the same. If its actual subtype is
-constrained, the object is called a constrained object.
+its initial value; the object is said to be <constrained by its initial
+value>. When not constrained by its initial value, the actual and
+nominal subtypes of the object are the same. If its actual subtype is
+constrained, the object is called a <constrained object>.
10
For an object_declaration without an initialization expression, any
initial values for the object or its subcomponents are determined by the
-implicit initial values defined for its nominal subtype, as follows:
+<implicit initial values> defined for its nominal subtype, as follows:
11
* The implicit initial value for an access subtype is the null value
@@ -4020,7 +4023,7 @@ implicit initial values defined for its nominal subtype,
as follows:
of this expression and conversion to the component's nominal
subtype (which might raise Constraint_Error), unless the component
is a discriminant of a constrained subtype (the previous case), or
- is in an excluded variant (see *note 3.8.1::). For each component
+ is in an excluded variant (see *note 3.8.1::). For each component
that does not have a default_expression, if the composite subtype
has the Default_Component_Value aspect specified, the implicit
initial value is the value of that aspect converted to the
@@ -4048,21 +4051,21 @@ sequence of steps:
2. If the object_declaration includes an initialization
expression, the (explicit) initial value is obtained by evaluating
the expression and converting it to the nominal subtype (which
- might raise Constraint_Error -- see *note 4.6::).
+ might raise Constraint_Error -- see *note 4.6::).
18/2
3. The object is created, and, if there is not an initialization
- expression, the object is initialized by default. When an object is
- initialized by default, any per-object constraints (see *note
+ expression, the object is <initialized by default>. When an object
+ is initialized by default, any per-object constraints (see *note
3.8::) are elaborated and any implicit initial values for the
object or for its subcomponents are obtained as determined by the
- nominal subtype. Any initial values (whether explicit or implicit)
+ nominal subtype. Any initial values (whether explicit or implicit)
are assigned to the object or to the corresponding subcomponents.
As described in *note 5.2:: and *note 7.6::, Initialize and Adjust
- procedures can be called.
+ procedures can be called.
19/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
20/2
For the third step above, evaluations and assignments are performed in
@@ -4092,10 +4095,11 @@ an arbitrary order subject to the following
restrictions:
21/3
There is no implicit initial value defined for a scalar subtype unless
-the Default_Value aspect has been specified for the type. In the absence
-of an explicit initialization or the specification of the Default_Value
-aspect, a newly created scalar object might have a value that does not
-belong to its subtype (see *note 13.9.1:: and *note H.1::).
+the Default_Value aspect has been specified for the type. In the
+absence of an explicit initialization or the specification of the
+Default_Value aspect, a newly created scalar object might have a value
+that does not belong to its subtype (see *note 13.9.1:: and *note
+H.1::).
NOTES
@@ -4123,23 +4127,23 @@ belong to its subtype (see *note 13.9.1:: and *note
H.1::).
_Examples_
25
-Example of a multiple object declaration:
+<Example of a multiple object declaration:>
26
- -- the multiple object declaration
+ --< the multiple object declaration >
27/2
- John, Paul : not null Person_Name := new Person(Sex => M); -- see *note
3.10.1::
+ John, Paul : not null Person_Name := new Person(Sex => M); --< see
*note 3.10.1::>
28
- -- is equivalent to the two single object declarations in the order given
+ --< is equivalent to the two single object declarations in the order
given>
29/2
John : not null Person_Name := new Person(Sex => M);
Paul : not null Person_Name := new Person(Sex => M);
30
-Examples of variable declarations:
+<Examples of variable declarations:>
31/2
Count, Sum : Integer;
@@ -4151,13 +4155,13 @@ Examples of variable declarations:
[Unicode 952], [Unicode 966] : Float range -PI .. +PI;
32
-Examples of constant declarations:
+<Examples of constant declarations:>
33/2
Limit : constant Integer := 10_000;
Low_Limit : constant Integer := Limit/10;
Tolerance : constant Real := Dispersion(1.15);
- Hello_Msg : constant access String := Hello'Access; -- see *note 3.10.2::
+ Hello_Msg : constant access String := Hello'Access; --< see *note
3.10.2::>
File: arm2012.info, Node: 3.3.2, Prev: 3.3.1, Up: 3.3
@@ -4172,31 +4176,31 @@ A number_declaration declares a named number.
2
number_declaration ::=
- defining_identifier_list : constant := static_expression;
+ defining_identifier_list : constant := <static_>expression;
_Name Resolution Rules_
3
-The static_expression given for a number_declaration is expected to be
+The <static_>expression given for a number_declaration is expected to be
of any numeric type.
_Legality Rules_
4/3
-The static_expression given for a number declaration shall be a static
+The <static_>expression given for a number declaration shall be a static
expression, as defined by subclause *note 4.9::.
_Static Semantics_
5
-The named number denotes a value of type universal_integer if the type
-of the static_expression is an integer type. The named number denotes a
-value of type universal_real if the type of the static_expression is a
-real type.
+The named number denotes a value of type <universal_integer> if the type
+of the <static_>expression is an integer type. The named number denotes
+a value of type <universal_real> if the type of the <static_>expression
+is a real type.
6
The value denoted by the named number is the value of the
-static_expression, converted to the corresponding universal type.
+<static_>expression, converted to the corresponding universal type.
_Dynamic Semantics_
@@ -4206,16 +4210,16 @@ The elaboration of a number_declaration has no effect.
_Examples_
8
-Examples of number declarations:
+<Examples of number declarations:>
9
- Two_Pi : constant := 2.0*Ada.Numerics.Pi; -- a real number (see
*note A.5::)
+ Two_Pi : constant := 2.0*Ada.Numerics.Pi; --< a real number (see
*note A.5::)>
10/2
- Max : constant := 500; -- an integer number
- Max_Line_Size : constant := Max/6; -- the integer 83
- Power_16 : constant := 2**16; -- the integer 65_536
- One, Un, Eins : constant := 1; -- three different
names for 1
+ Max : constant := 500; --< an integer number>
+ Max_Line_Size : constant := Max/6; --< the integer 83>
+ Power_16 : constant := 2**16; --< the integer 65_536>
+ One, Un, Eins : constant := 1; --< three different
names for 1>
File: arm2012.info, Node: 3.4, Next: 3.5, Prev: 3.3, Up: 3
@@ -4224,35 +4228,35 @@ File: arm2012.info, Node: 3.4, Next: 3.5, Prev: 3.3,
Up: 3
=============================
1/2
-A derived_type_definition defines a derived type (and its first subtype)
-whose characteristics are derived from those of a parent type, and
-possibly from progenitor types.
+A derived_type_definition defines a <derived type> (and its first
+subtype) whose characteristics are <derived> from those of a parent
+type, and possibly from progenitor types.
1.1/2
-A class of types is a set of types that is closed under derivation; that
-is, if the parent or a progenitor type of a derived type belongs to a
-class, then so does the derived type. By saying that a particular group
-of types forms a class, we are saying that all derivatives of a type in
-the set inherit the characteristics that define that set. The more
-general term category of types is used for a set of types whose defining
-characteristics are not necessarily inherited by derivatives; for
-example, limited, abstract, and interface are all categories of types,
-but not classes of types.
+A <class of types> is a set of types that is closed under derivation;
+that is, if the parent or a progenitor type of a derived type belongs to
+a class, then so does the derived type. By saying that a particular
+group of types forms a class, we are saying that all derivatives of a
+type in the set inherit the characteristics that define that set. The
+more general term <category of types> is used for a set of types whose
+defining characteristics are not necessarily inherited by derivatives;
+for example, limited, abstract, and interface are all categories of
+types, but not classes of types.
_Syntax_
2/2
derived_type_definition ::=
- [abstract] [limited] new parent_subtype_indication [[and
+ [abstract] [limited] new <parent_>subtype_indication [[and
interface_list] record_extension_part]
_Legality Rules_
3/2
-The parent_subtype_indication defines the parent subtype; its type is
-the parent type. The interface_list defines the progenitor types (see
-*note 3.9.4::). A derived type has one parent type and zero or more
-progenitor types.
+The <parent_>subtype_indication defines the <parent subtype>; its type
+is the <parent type>. The interface_list defines the progenitor types
+(see *note 3.9.4::). A derived type has one parent type and zero or
+more progenitor types.
4
A type shall be completely defined (see *note 3.11.1::) prior to being
@@ -4261,10 +4265,11 @@ full_type_declarations for the parent type and any of
its subcomponents
have to precede the derived_type_definition.
5/2
-If there is a record_extension_part, the derived type is called a record
-extension of the parent type. A record_extension_part shall be provided
-if and only if the parent type is a tagged type. An interface_list
-shall be provided only if the parent type is a tagged type.
+If there is a record_extension_part, the derived type is called a
+<record extension> of the parent type. A record_extension_part shall be
+provided if and only if the parent type is a tagged type. An
+interface_list shall be provided only if the parent type is a tagged
+type.
5.1/3
If the reserved word limited appears in a derived_type_definition, the
@@ -4278,8 +4283,8 @@ part of an instance of a generic unit.
6
The first subtype of the derived type is unconstrained if a
known_discriminant_part is provided in the declaration of the derived
-type, or if the parent subtype is unconstrained. Otherwise, the
-constraint of the first subtype corresponds to that of the parent
+type, or if the parent subtype is unconstrained. Otherwise, the
+constraint of the first subtype <corresponds> to that of the parent
subtype in the following sense: it is the same as that of the parent
subtype except that for a range constraint (implicit or explicit), the
value of each bound of its range is replaced by the corresponding value
@@ -4290,8 +4295,8 @@ The first subtype of the derived type excludes null (see
*note 3.10::)
if and only if the parent subtype excludes null.
7/3
-The characteristics and implicitly declared primitive subprograms of the
-derived type are defined as follows:
+The <characteristics> and implicitly declared primitive subprograms of
+the derived type are defined as follows:
8/2
* If the parent type or a progenitor type belongs to a class of
@@ -4322,16 +4327,16 @@ derived type are defined as follows:
known_discriminant_part, if there is one; otherwise, each
discriminant of the parent type (implicitly declared in
the same order with the same specifications) -- in the
- latter case, the discriminants are said to be inherited,
- or if unknown in the parent, are also unknown in the
- derived type;
+ latter case, the discriminants are said to be
+ <inherited>, or if unknown in the parent, are also
+ unknown in the derived type;
12
* Each nondiscriminant component, entry, and protected
subprogram of the parent type, implicitly declared in the
same order with the same declarations; these components,
entries, and protected subprograms are said to be
- inherited;
+ <inherited>;
13
* Each component declared in a record_extension_part, if
@@ -4344,7 +4349,7 @@ derived type are defined as follows:
following the parent subtype_indication.
15/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
16
* For each predefined operator of the parent type, there is a
@@ -4354,9 +4359,9 @@ derived type are defined as follows:
* For each user-defined primitive subprogram (other than a
user-defined equality operator -- see below) of the parent type or
of a progenitor type that already exists at the place of the
- derived_type_definition, there exists a corresponding inherited
+ derived_type_definition, there exists a corresponding <inherited>
primitive subprogram of the derived type with the same defining
- name. Primitive user-defined equality operators of the parent type
+ name. Primitive user-defined equality operators of the parent type
and any progenitor types are also inherited by the derived type,
except when the derived type is a nonlimited record extension, and
the inherited operator would have a profile that is type conformant
@@ -4364,7 +4369,7 @@ derived type are defined as follows:
in this case, the user-defined equality operator is not inherited,
but is rather incorporated into the implementation of the
predefined equality operator of the record extension (see *note
- 4.5.2::).
+ 4.5.2::).
18/3
The profile of an inherited subprogram (including an inherited
@@ -4373,8 +4378,8 @@ derived type are defined as follows:
progenitor type, after systematic replacement of each subtype of
its profile (see *note 6.1::) that is of the parent or progenitor
type, other than those subtypes found in the designated profile of
- an access_definition, with a corresponding subtype of the derived
- type. For a given subtype of the parent or progenitor type, the
+ an access_definition, with a <corresponding subtype> of the derived
+ type. For a given subtype of the parent or progenitor type, the
corresponding subtype of the derived type is defined as follows:
19
@@ -4394,7 +4399,7 @@ derived type are defined as follows:
is not a record extension, then the corresponding subtype
is constrained to those values that when converted to the
parent type belong to the given subtype (see *note
- 4.6::).
+ 4.6::).
22/2
The same formal parameters have default_expressions in the profile
@@ -4442,8 +4447,7 @@ subprogram is the derived type, the result of calling the
subprogram of
the parent or progenitor is converted to the derived type, or in the
case of a null extension, extended to the derived type using the
equivalent of an extension_aggregate with the original result as the
-ancestor_part and null record as the record_component_association_list.
-
+ancestor_part and null record as the record_component_association_list.
NOTES
28
@@ -4456,7 +4460,7 @@ ancestor_part and null record as the
record_component_association_list.
17 Evaluating an inherited enumeration literal is equivalent to
evaluating the corresponding enumeration literal of the parent
type, and then converting the result to the derived type. This
- follows from their equivalence to parameterless functions.
+ follows from their equivalence to parameterless functions.
30
18 A generic subprogram is not a subprogram, and hence cannot be a
@@ -4502,18 +4506,18 @@ ancestor_part and null record as the
record_component_association_list.
_Examples_
36
-Examples of derived type declarations:
+<Examples of derived type declarations:>
37
- type Local_Coordinate is new Coordinate; -- two different types
- type Midweek is new Day range Tue .. Thu; -- see *note 3.5.1::
- type Counter is new Positive; -- same range as Positive
+ type Local_Coordinate is new Coordinate; --< two different types>
+ type Midweek is new Day range Tue .. Thu; --< see *note 3.5.1::>
+ type Counter is new Positive; --< same range as Positive >
38
- type Special_Key is new Key_Manager.Key; -- see *note 7.3.1::
- -- the inherited subprograms have the following specifications:
- -- procedure Get_Key(K : out Special_Key);
- -- function "<"(X,Y : Special_Key) return Boolean;
+ type Special_Key is new Key_Manager.Key; --< see *note 7.3.1::>
+ --< the inherited subprograms have the following specifications: >
+ --< procedure Get_Key(K : out Special_Key);>
+ --< function "<"(X,Y : Special_Key) return Boolean;>
* Menu:
@@ -4527,24 +4531,25 @@ File: arm2012.info, Node: 3.4.1, Up: 3.4
1
In addition to the various language-defined classes of types, types can
-be grouped into derivation classes.
+be grouped into <derivation classes>.
_Static Semantics_
2/2
-A derived type is derived from its parent type directly; it is derived
-indirectly from any type from which its parent type is derived. A
-derived type, interface type, type extension, task type, protected type,
-or formal derived type is also derived from every ancestor of each of
-its progenitor types, if any. The derivation class of types for a type T
-(also called the class rooted at T) is the set consisting of T (the root
-type of the class) and all types derived from T (directly or indirectly)
-plus any associated universal or class-wide types (defined below).
+A derived type is <derived from> its parent type <directly>; it is
+derived <indirectly> from any type from which its parent type is
+derived. A derived type, interface type, type extension, task type,
+protected type, or formal derived type is also derived from every
+ancestor of each of its progenitor types, if any. The derivation class
+of types for a type <T> (also called the class <rooted> at <T>) is the
+set consisting of <T> (the <root type> of the class) and all types
+derived from <T> (directly or indirectly) plus any associated universal
+or class-wide types (defined below).
3/2
-Every type is either a specific type, a class-wide type, or a universal
-type. A specific type is one defined by a type_declaration, a
-formal_type_declaration, or a full type definition embedded in another
+Every type is either a <specific> type, a <class-wide> type, or a
+<universal> type. A specific type is one defined by a type_declaration,
+a formal_type_declaration, or a full type definition embedded in another
construct. Class-wide and universal types are implicitly defined, to
act as representatives for an entire class of types, as follows:
@@ -4552,42 +4557,43 @@ act as representatives for an entire class of types, as
follows:
Class-wide types
Class-wide types are defined for (and belong to) each
derivation class rooted at a tagged type (see *note
- 3.9::). Given a subtype S of a tagged type T, S'Class is
- the subtype_mark for a corresponding subtype of the
- tagged class-wide type T'Class. Such types are called
+ 3.9::). Given a subtype S of a tagged type <T>, S'Class
+ is the subtype_mark for a corresponding subtype of the
+ tagged class-wide type <T>'Class. Such types are called
"class-wide" because when a formal parameter is defined
- to be of a class-wide type T'Class, an actual parameter
- of any type in the derivation class rooted at T is
+ to be of a class-wide type <T>'Class, an actual parameter
+ of any type in the derivation class rooted at <T> is
acceptable (see *note 8.6::).
5
- The set of values for a class-wide type T'Class is the
+ The set of values for a class-wide type <T>'Class is the
discriminated union of the set of values of each specific
- type in the derivation class rooted at T (the tag acts as
- the implicit discriminant -- see *note 3.9::).
+ type in the derivation class rooted at <T> (the tag acts
+ as the implicit discriminant -- see *note 3.9::).
Class-wide types have no primitive subprograms of their
own. However, as explained in *note 3.9.2::, operands of
- a class-wide type T'Class can be used as part of a
- dispatching call on a primitive subprogram of the type T.
- The only components (including discriminants) of T'Class
- that are visible are those of T. If S is a first subtype,
- then S'Class is a first subtype.
+ a class-wide type <T>'Class can be used as part of a
+ dispatching call on a primitive subprogram of the type
+ <T>. The only components (including discriminants) of
+ <T>'Class that are visible are those of <T>. If S is a
+ first subtype, then S'Class is a first subtype.
6/2
Universal types
Universal types are defined for (and belong to) the
integer, real, fixed point, and access classes, and are
referred to in this standard as respectively,
- universal_integer, universal_real, universal_fixed, and
- universal_access. These are analogous to class-wide
- types for these language-defined elementary classes. As
- with class-wide types, if a formal parameter is of a
- universal type, then an actual parameter of any type in
- the corresponding class is acceptable. In addition, a
- value of a universal type (including an integer or real
- numeric_literal, or the literal null) is "universal" in
- that it is acceptable where some particular type in the
- class is expected (see *note 8.6::).
+ <universal_integer>, <universal_real>, <universal_fixed>,
+ and <universal_access>. These are analogous to
+ class-wide types for these language-defined elementary
+ classes. As with class-wide types, if a formal parameter
+ is of a universal type, then an actual parameter of any
+ type in the corresponding class is acceptable. In
+ addition, a value of a universal type (including an
+ integer or real numeric_literal, or the literal null) is
+ "universal" in that it is acceptable where some
+ particular type in the class is expected (see *note
+ 8.6::).
7
The set of values of a universal type is the
@@ -4600,27 +4606,27 @@ Universal types
8
The integer and real numeric classes each have a specific root type in
-addition to their universal type, named respectively root_integer and
-root_real.
+addition to their universal type, named respectively <root_integer> and
+<root_real>.
9
-A class-wide or universal type is said to cover all of the types in its
-class. A specific type covers only itself.
+A class-wide or universal type is said to <cover> all of the types in
+its class. A specific type covers only itself.
10/2
-A specific type T2 is defined to be a descendant of a type T1 if T2 is
-the same as T1, or if T2 is derived (directly or indirectly) from T1. A
-class-wide type T2'Class is defined to be a descendant of type T1 if T2
-is a descendant of T1. Similarly, the numeric universal types are
-defined to be descendants of the root types of their classes. If a type
-T2 is a descendant of a type T1, then T1 is called an ancestor of T2. An
-ultimate ancestor of a type is an ancestor of that type that is not
-itself a descendant of any other type. Every untagged type has a unique
-ultimate ancestor.
+A specific type <T2> is defined to be a <descendant> of a type <T1> if
+<T2> is the same as <T1>, or if <T2> is derived (directly or indirectly)
+from <T1>. A class-wide type <T2>'Class is defined to be a descendant
+of type <T1> if <T2> is a descendant of <T1>. Similarly, the numeric
+universal types are defined to be descendants of the root types of their
+classes. If a type <T2> is a descendant of a type <T1>, then <T1> is
+called an <ancestor> of <T2>. An <ultimate ancestor> of a type is an
+ancestor of that type that is not itself a descendant of any other type.
+Every untagged type has a unique ultimate ancestor.
11
An inherited component (including an inherited discriminant) of a
-derived type is inherited from a given ancestor of the type if the
+derived type is inherited <from> a given ancestor of the type if the
corresponding component was inherited by each derived type in the chain
of derivations going back to the given ancestor.
@@ -4629,18 +4635,18 @@ of derivations going back to the given ancestor.
12
26 Because operands of a universal type are acceptable to the
predefined operators of any type in their class, ambiguity can
- result. For universal_integer and universal_real, this potential
- ambiguity is resolved by giving a preference (see *note 8.6::) to
- the predefined operators of the corresponding root types
- (root_integer and root_real, respectively). Hence, in an
+ result. For <universal_integer> and <universal_real>, this
+ potential ambiguity is resolved by giving a preference (see *note
+ 8.6::) to the predefined operators of the corresponding root types
+ (<root_integer> and <root_real>, respectively). Hence, in an
apparently ambiguous expression like
13
1 + 4 < 7
14
- where each of the literals is of type universal_integer, the
- predefined operators of root_integer will be preferred over those
+ where each of the literals is of type <universal_integer>, the
+ predefined operators of <root_integer> will be preferred over those
of other specific integer types, thereby resolving the ambiguity.
@@ -4650,11 +4656,11 @@ File: arm2012.info, Node: 3.5, Next: 3.6, Prev: 3.4,
Up: 3
================
1
-Scalar types comprise enumeration types, integer types, and real types.
-Enumeration types and integer types are called discrete types; each
-value of a discrete type has a position number which is an integer
-value. Integer types and real types are called numeric types. All
-scalar types are ordered, that is, all relational operators are
+<Scalar> types comprise enumeration types, integer types, and real
+types. Enumeration types and integer types are called <discrete> types;
+each value of a discrete type has a <position number> which is an
+integer value. Integer types and real types are called <numeric> types.
+All scalar types are ordered, that is, all relational operators are
predefined for their values.
_Syntax_
@@ -4667,16 +4673,17 @@ predefined for their values.
| simple_expression .. simple_expression
4
-A range has a lower bound and an upper bound and specifies a subset of
-the values of some scalar type (the type of the range). A range with
-lower bound L and upper bound R is described by "L .. R". If R is less
-than L, then the range is a null range, and specifies an empty set of
-values. Otherwise, the range specifies the values of the type from the
-lower bound to the upper bound, inclusive. A value belongs to a range if
-it is of the type of the range, and is in the subset of values specified
-by the range. A value satisfies a range constraint if it belongs to the
-associated range. One range is included in another if all values that
-belong to the first range also belong to the second.
+A <range> has a <lower bound> and an <upper bound> and specifies a
+subset of the values of some scalar type (the <type of the range>). A
+range with lower bound L and upper bound R is described by "L .. R". If
+R is less than L, then the range is a <null range>, and specifies an
+empty set of values. Otherwise, the range specifies the values of the
+type from the lower bound to the upper bound, inclusive. A value
+<belongs> to a range if it is of the type of the range, and is in the
+subset of values specified by the range. A value <satisfies> a range
+constraint if it belongs to the associated range. One range is
+<included> in another if all values that belong to the first range also
+belong to the second.
_Name Resolution Rules_
@@ -4684,7 +4691,7 @@ belong to the first range also belong to the second.
For a subtype_indication containing a range_constraint, either directly
or as part of some other scalar_constraint, the type of the range shall
resolve to that of the type determined by the subtype_mark of the
-subtype_indication. For a range of a given type, the simple_expressions
+subtype_indication. For a range of a given type, the simple_expressions
of the range (likewise, the simple_expressions of the equivalent range
for a range_attribute_reference) are expected to be of the type of the
range.
@@ -4692,7 +4699,7 @@ range.
_Static Semantics_
6
-The base range of a scalar type is the range of finite values of the
+The <base range> of a scalar type is the range of finite values of the
type that can be represented in every unconstrained object of the type;
it is also the range supported at a minimum for intermediate values
during the evaluation of expressions involving predefined operators of
@@ -4700,29 +4707,29 @@ the type.
7
A constrained scalar subtype is one to which a range constraint applies.
-The range of a constrained scalar subtype is the range associated with
-the range constraint of the subtype. The range of an unconstrained
+The <range> of a constrained scalar subtype is the range associated with
+the range constraint of the subtype. The <range> of an unconstrained
scalar subtype is the base range of its type.
_Dynamic Semantics_
8
-A range is compatible with a scalar subtype if and only if it is either
-a null range or each bound of the range belongs to the range of the
-subtype. A range_constraint is compatible with a scalar subtype if and
-only if its range is compatible with the subtype.
+A range is <compatible> with a scalar subtype if and only if it is
+either a null range or each bound of the range belongs to the range of
+the subtype. A range_constraint is <compatible> with a scalar subtype
+if and only if its range is compatible with the subtype.
9
The elaboration of a range_constraint consists of the evaluation of the
-range. The evaluation of a range determines a lower bound and an upper
+range. The evaluation of a range determines a lower bound and an upper
bound. If simple_expressions are given to specify bounds, the
evaluation of the range evaluates these simple_expressions in an
-arbitrary order, and converts them to the type of the range. If a
+arbitrary order, and converts them to the type of the range. If a
range_attribute_reference is given, the evaluation of the range consists
of the evaluation of the range_attribute_reference.
10
-Attributes
+<Attributes>
11
For every scalar subtype S, the following attributes are defined:
@@ -4744,8 +4751,8 @@ S'Range
15
S'Base
S'Base denotes an unconstrained subtype of the type of S.
- This unconstrained subtype is called the base subtype of
- the type.
+ This unconstrained subtype is called the <base subtype>
+ of the type.
16
S'Min
@@ -4753,7 +4760,7 @@ S'Min
specification:
17
- function S'Min(Left, Right : S'Base)
+ function S'Min(<Left>, <Right> : S'Base)
return S'Base
18
@@ -4766,7 +4773,7 @@ S'Max
specification:
20
- function S'Max(Left, Right : S'Base)
+ function S'Max(<Left>, <Right> : S'Base)
return S'Base
21
@@ -4779,20 +4786,20 @@ S'Succ
specification:
23
- function S'Succ(Arg : S'Base)
+ function S'Succ(<Arg> : S'Base)
return S'Base
24
For an enumeration type, the function returns the value
whose position number is one more than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
- returns the result of adding one to the value of Arg.
+ returns the result of adding one to the value of <Arg>.
For a fixed point type, the function returns the result
- of adding small to the value of Arg. For a floating
+ of adding <small> to the value of <Arg>. For a floating
point type, the function returns the machine number (as
defined in *note 3.5.7::) immediately above the value of
- Arg; Constraint_Error is raised if there is no such
+ <Arg>; Constraint_Error is raised if there is no such
machine number.
25
@@ -4801,21 +4808,21 @@ S'Pred
specification:
26
- function S'Pred(Arg : S'Base)
+ function S'Pred(<Arg> : S'Base)
return S'Base
27
For an enumeration type, the function returns the value
whose position number is one less than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
returns the result of subtracting one from the value of
- Arg. For a fixed point type, the function returns the
- result of subtracting small from the value of Arg. For a
- floating point type, the function returns the machine
- number (as defined in *note 3.5.7::) immediately below
- the value of Arg; Constraint_Error is raised if there is
- no such machine number.
+ <Arg>. For a fixed point type, the function returns the
+ result of subtracting <small> from the value of <Arg>.
+ For a floating point type, the function returns the
+ machine number (as defined in *note 3.5.7::) immediately
+ below the value of <Arg>; Constraint_Error is raised if
+ there is no such machine number.
27.1/2
S'Wide_Wide_Image
@@ -4823,13 +4830,13 @@ S'Wide_Wide_Image
specification:
27.2/2
- function S'Wide_Wide_Image(Arg : S'Base)
+ function S'Wide_Wide_Image(<Arg> : S'Base)
return Wide_Wide_String
27.3/2
- The function returns an image of the value of Arg, that
- is, a sequence of characters representing the value in
- display form. The lower bound of the result is one.
+ The function returns an <image> of the value of <Arg>,
+ that is, a sequence of characters representing the value
+ in display form. The lower bound of the result is one.
27.4/2
The image of an integer value is the corresponding
@@ -4842,11 +4849,11 @@ S'Wide_Wide_Image
corresponding identifier in upper case or the
corresponding character literal (including the two
apostrophes); neither leading nor trailing spaces are
- included. For a nongraphic character (a value of a
+ included. For a <nongraphic character> (a value of a
character type that has no enumeration literal associated
with it), the result is a corresponding language-defined
name in upper case (for example, the image of the
- nongraphic character identified as nul is "NUL" -- the
+ nongraphic character identified as <nul> is "NUL" -- the
quotes are not part of the image).
27.6/2
@@ -4878,11 +4885,11 @@ S'Wide_Image
specification:
29
- function S'Wide_Image(Arg : S'Base)
+ function S'Wide_Image(<Arg> : S'Base)
return Wide_String
30/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
Wide_String. The lower bound of the result is one. The
image has the same sequence of graphic characters as
defined for S'Wide_Wide_Image if all the graphic
@@ -4891,7 +4898,7 @@ S'Wide_Image
shorter than that of S'Wide_Wide_Image for the same value
of Arg).
- Paragraphs 31 through 34 were moved to Wide_Wide_Image.
+ <Paragraphs 31 through 34 were moved to Wide_Wide_Image.>
35
S'Image
@@ -4899,39 +4906,39 @@ S'Image
specification:
36
- function S'Image(Arg : S'Base)
+ function S'Image(<Arg> : S'Base)
return String
37/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
String. The lower bound of the result is one. The image
has the same sequence of graphic characters as that
defined for S'Wide_Wide_Image if all the graphic
characters are defined in Character; otherwise, the
sequence of characters is implementation defined (but no
shorter than that of S'Wide_Wide_Image for the same value
- of Arg).
+ of <Arg>).
37.1/2
S'Wide_Wide_Width
S'Wide_Wide_Width denotes the maximum length of a
Wide_Wide_String returned by S'Wide_Wide_Image over all
values of the subtype S. It denotes zero for a subtype
- that has a null range. Its type is universal_integer.
+ that has a null range. Its type is <universal_integer>.
38
S'Wide_Width
S'Wide_Width denotes the maximum length of a Wide_String
returned by S'Wide_Image over all values of the subtype
S. It denotes zero for a subtype that has a null range.
- Its type is universal_integer.
+ Its type is <universal_integer>.
39
S'Width
S'Width denotes the maximum length of a String returned
by S'Image over all values of the subtype S. It denotes
zero for a subtype that has a null range. Its type is
- universal_integer.
+ <universal_integer>.
39.1/2
S'Wide_Wide_Value
@@ -4939,7 +4946,7 @@ S'Wide_Wide_Value
specification:
39.2/2
- function S'Wide_Wide_Value(Arg : Wide_Wide_String)
+ function S'Wide_Wide_Value(<Arg> : Wide_Wide_String)
return S'Base
39.3/2
@@ -5003,7 +5010,7 @@ S'Wide_Value
specification:
41
- function S'Wide_Value(Arg : Wide_String)
+ function S'Wide_Value(<Arg> : Wide_String)
return S'Base
42
@@ -5021,11 +5028,11 @@ S'Wide_Value
the result is the corresponding enumeration value;
otherwise, Constraint_Error is raised. For a numeric
subtype S, the evaluation of a call on S'Wide_Value with
- Arg of type Wide_String is equivalent to a call on
- S'Wide_Wide_Value for a corresponding Arg of type
+ <Arg> of type Wide_String is equivalent to a call on
+ S'Wide_Wide_Value for a corresponding <Arg> of type
Wide_Wide_String.
- Paragraphs 44 through 51 were moved to Wide_Wide_Value.
+ <Paragraphs 44 through 51 were moved to Wide_Wide_Value.>
52
S'Value
@@ -5033,7 +5040,7 @@ S'Value
specification:
53
- function S'Value(Arg : String)
+ function S'Value(<Arg> : String)
return S'Base
54
@@ -5049,9 +5056,9 @@ S'Value
to the result of S'Image for a value of the type), the
result is the corresponding enumeration value; otherwise,
Constraint_Error is raised. For a numeric subtype S, the
- evaluation of a call on S'Value with Arg of type String
+ evaluation of a call on S'Value with <Arg> of type String
is equivalent to a call on S'Wide_Wide_Value for a
- corresponding Arg of type Wide_Wide_String.
+ corresponding <Arg> of type Wide_Wide_String.
55.1/4
For a prefix X that denotes an object of a scalar type (after any
@@ -5060,19 +5067,19 @@ implicit dereference), the following attributes are
defined:
55.2/4
X'Wide_Wide_Image
X'Wide_Wide_Image denotes the result of calling function
- S'Wide_Wide_Image with Arg being X, where S is the
+ S'Wide_Wide_Image with <Arg> being X, where S is the
nominal subtype of X.
55.3/4
X'Wide_Image
X'Wide_Image denotes the result of calling function
- S'Wide_Image with Arg being X, where S is the nominal
+ S'Wide_Image with <Arg> being X, where S is the nominal
subtype of X.
55.4/4
X'Image
X'Image denotes the result of calling function S'Image
- with Arg being X, where S is the nominal subtype of X.
+ with <Arg> being X, where S is the nominal subtype of X.
_Implementation Permissions_
@@ -5084,9 +5091,9 @@ type to support special values such as infinities and
NaNs.
56.1/3
An implementation may extend the Wide_Wide_Value, Wide_Value, and Value
attributes of a character type to accept strings of the form
-"Hex_hhhhhhhh" (ignoring case) for any character (not just the ones for
-which Wide_Wide_Image would produce that form -- see *note 3.5.2::), as
-well as three-character strings of the form "'X'", where X is any
+"Hex_<hhhhhhhh>" (ignoring case) for any character (not just the ones
+for which Wide_Wide_Image would produce that form -- see *note 3.5.2::),
+as well as three-character strings of the form "'<X>'", where <X> is any
character, including nongraphic characters.
_Static Semantics_
@@ -5138,18 +5145,18 @@ appears.
_Examples_
60
-Examples of ranges:
+<Examples of ranges:>
61
-10 .. 10
X .. X + 1
0.0 .. 2.0*Pi
- Red .. Green -- see *note 3.5.1::
- 1 .. 0 -- a null range
- Table'Range -- a range attribute reference (see *note 3.6::)
+ Red .. Green --< see *note 3.5.1::>
+ 1 .. 0 --< a null range>
+ Table'Range --< a range attribute reference (see *note 3.6::)>
62
-Examples of range constraints:
+<Examples of range constraints:>
63
range -999.0 .. +999.0
@@ -5202,15 +5209,15 @@ shall be distinct.
6/3
Each enumeration_literal_specification is the explicit declaration of
-the corresponding enumeration literal: it declares a parameterless
+the corresponding <enumeration literal>: it declares a parameterless
function, whose defining name is the defining_identifier (*note 3.1:
S0022.) or defining_character_literal (*note 3.5.1: S0040.), and whose
result subtype is the base subtype of the enumeration type.
7
Each enumeration literal corresponds to a distinct value of the
-enumeration type, and to a distinct position number. The position number
-of the value of the first listed enumeration literal is zero; the
+enumeration type, and to a distinct position number. The position
+number of the value of the first listed enumeration literal is zero; the
position number of the value of each subsequent enumeration literal is
one more than that of its predecessor in the list.
@@ -5222,9 +5229,9 @@ follow the order of corresponding position numbers.
If the same defining_identifier or defining_character_literal is
specified in more than one enumeration_type_definition (*note 3.5.1:
S0038.), the corresponding enumeration literals are said to be
-overloaded. At any place where an overloaded enumeration literal occurs
-in the text of a program, the type of the enumeration literal has to be
-determinable from the context (see *note 8.6::).
+<overloaded>. At any place where an overloaded enumeration literal
+occurs in the text of a program, the type of the enumeration literal has
+to be determinable from the context (see *note 8.6::).
_Dynamic Semantics_
@@ -5248,7 +5255,7 @@ literal returns the corresponding value of the
enumeration type.
_Examples_
13
-Examples of enumeration types and subtypes:
+<Examples of enumeration types and subtypes: >
14
type Day is (Mon, Tue, Wed, Thu, Fri, Sat, Sun);
@@ -5256,7 +5263,7 @@ Examples of enumeration types and subtypes:
type Gender is (M, F);
type Level is (Low, Medium, Urgent);
type Color is (White, Red, Yellow, Green, Blue, Brown, Black);
- type Light is (Red, Amber, Green); -- Red and Green are overloaded
+ type Light is (Red, Amber, Green); --< Red and Green are overloaded>
15
type Hexa is ('A', 'B', 'C', 'D', 'E', 'F');
@@ -5265,7 +5272,7 @@ Examples of enumeration types and subtypes:
16
subtype Weekday is Day range Mon .. Fri;
subtype Major is Suit range Hearts .. Spades;
- subtype Rainbow is Color range Red .. Blue; -- the Color Red, not the
Light
+ subtype Rainbow is Color range Red .. Blue; --< the Color Red, not the
Light>
File: arm2012.info, Node: 3.5.2, Next: 3.5.3, Prev: 3.5.1, Up: 3.5
@@ -5276,7 +5283,7 @@ File: arm2012.info, Node: 3.5.2, Next: 3.5.3, Prev:
3.5.1, Up: 3.5
_Static Semantics_
1
-An enumeration type is said to be a character type if at least one of
+An enumeration type is said to be a <character type> if at least one of
its enumeration literals is a character_literal.
2/3
@@ -5289,7 +5296,7 @@ Row 00 has a corresponding language-defined name, which
is not usable as
an enumeration literal, but which is usable with the attributes Image,
Wide_Image, Wide_Wide_Image, Value, Wide_Value, and Wide_Wide_Value;
these names are given in the definition of type Character in *note
-A.1::, "*note A.1:: The Package Standard", but are set in italics.
+A.1::, "*note A.1:: The Package Standard", but are set in <italics>.
3/3
The predefined type Wide_Character is a character type whose values
@@ -5316,7 +5323,7 @@ hexadecimal as eight extended digits. As with other
language-defined
names, these names are usable only with the attributes (Wide_)Wide_Image
and (Wide_)Wide_Value; they are not usable as enumeration literals.
-Paragraphs 6 and 7 were deleted.
+<Paragraphs 6 and 7 were deleted.>
NOTES
@@ -5327,15 +5334,15 @@ Paragraphs 6 and 7 were deleted.
of the predefined type Character.
9/3
- 32 A conventional character set such as EBCDIC can be declared as
- a character type; the internal codes of the characters can be
+ 32 A conventional character set such as <EBCDIC> can be declared
+ as a character type; the internal codes of the characters can be
specified by an enumeration_representation_clause as explained in
subclause *note 13.4::.
_Examples_
10
-Example of a character type:
+<Example of a character type: >
11
type Roman_Digit is ('I', 'V', 'X', 'L', 'C', 'D', 'M');
@@ -5350,9 +5357,9 @@ File: arm2012.info, Node: 3.5.3, Next: 3.5.4, Prev:
3.5.2, Up: 3.5
1
There is a predefined enumeration type named Boolean, declared in the
-visible part of package Standard. It has the two enumeration literals
-False and True ordered with the relation False < True. Any descendant of
-the predefined type Boolean is called a boolean type.
+visible part of package Standard. It has the two enumeration literals
+False and True ordered with the relation False < True. Any descendant
+of the predefined type Boolean is called a <boolean> type.
File: arm2012.info, Node: 3.5.4, Next: 3.5.5, Prev: 3.5.3, Up: 3.5
@@ -5362,11 +5369,11 @@ File: arm2012.info, Node: 3.5.4, Next: 3.5.5, Prev:
3.5.3, Up: 3.5
1
An integer_type_definition defines an integer type; it defines either a
-signed integer type, or a modular integer type. The base range of a
+<signed> integer type, or a <modular> integer type. The base range of a
signed integer type includes at least the values of the specified range.
A modular type is an integer type with all arithmetic modulo a specified
-positive modulus; such a type corresponds to an unsigned type with
-wrap-around semantics.
+positive <modulus>; such a type corresponds to an unsigned type with
+wrap-around semantics.
_Syntax_
@@ -5375,17 +5382,17 @@ wrap-around semantics.
modular_type_definition
3
- signed_integer_type_definition ::= range static_
- simple_expression .. static_simple_expression
+ signed_integer_type_definition ::= range <static_>
+ simple_expression .. <static_>simple_expression
4
- modular_type_definition ::= mod static_expression
+ modular_type_definition ::= mod <static_>expression
_Name Resolution Rules_
5
Each simple_expression in a signed_integer_type_definition is expected
-to be of any integer type; they need not be of the same type. The
+to be of any integer type; they need not be of the same type. The
expression in a modular_type_definition is likewise expected to be of
any integer type.
@@ -5398,7 +5405,7 @@ System.Max_Int.
7
The expression of a modular_type_definition shall be static, and its
-value (the modulus) shall be positive, and shall be no greater than
+value (the <modulus>) shall be positive, and shall be no greater than
System.Max_Binary_Modulus if a power of 2, or no greater than
System.Max_Nonbinary_Modulus if not.
@@ -5414,14 +5421,14 @@ inclusive.
9
A signed_integer_type_definition defines an integer type whose base
range includes at least the values of the simple_expressions and is
-symmetric about zero, excepting possibly an extra negative value. A
+symmetric about zero, excepting possibly an extra negative value. A
signed_integer_type_definition also defines a constrained first subtype
of the type, with a range whose bounds are given by the values of the
simple_expressions, converted to the type being defined.
10
A modular_type_definition defines a modular type whose base range is
-from zero to one less than the given modulus. A modular_type_definition
+from zero to one less than the given modulus. A modular_type_definition
also defines a constrained first subtype of the type with a range that
is the same as the base range of the type.
@@ -5440,17 +5447,17 @@ package Standard:
14
A type defined by an integer_type_definition is implicitly derived from
-root_integer, an anonymous predefined (specific) integer type, whose
+<root_integer>, an anonymous predefined (specific) integer type, whose
base range is System.Min_Int .. System.Max_Int. However, the base
-range of the new type is not inherited from root_integer, but is instead
-determined by the range or modulus specified by the
-integer_type_definition. Integer literals are all of the type
-universal_integer, the universal type (see *note 3.4.1::) for the class
-rooted at root_integer, allowing their use with the operations of any
-integer type.
+range of the new type is not inherited from <root_integer>, but is
+instead determined by the range or modulus specified by the
+integer_type_definition. Integer literals are all of the type
+<universal_integer>, the universal type (see *note 3.4.1::) for the
+class rooted at <root_integer>, allowing their use with the operations
+of any integer type.
15
-The position number of an integer value is equal to the value.
+The <position number> of an integer value is equal to the value.
16/2
For every modular subtype S, the following attributes are defined:
@@ -5461,17 +5468,17 @@ S'Mod
specification:
16.2/2
- function S'Mod (Arg : universal_integer)
+ function S'Mod (<Arg> : <universal_integer>)
return S'Base
16.3/2
- This function returns Arg mod S'Modulus, as a value of
+ This function returns <Arg> mod S'Modulus, as a value of
the type of S.
17
S'Modulus
S'Modulus yields the modulus of the type of S, as a value
- of the type universal_integer.
+ of the type <universal_integer>.
_Dynamic Semantics_
@@ -5488,7 +5495,7 @@ within the base range of the type.
20
For a signed integer type, the exception Constraint_Error is raised by
the execution of an operation that cannot deliver the correct result
-because it is outside the base range of the type. For any integer type,
+because it is outside the base range of the type. For any integer type,
Constraint_Error is raised by the operators "/", "rem", and "mod" if the
right operand is zero.
@@ -5527,13 +5534,13 @@ supported by an implementation. The range of each
first subtype should
be the base range of its type.
26
-An implementation may provide nonstandard integer types, descendants of
-root_integer that are declared outside of the specification of package
-Standard, which need not have all the standard characteristics of a type
-defined by an integer_type_definition. For example, a nonstandard
-integer type might have an asymmetric base range or it might not be
-allowed as an array or loop index (a very long integer). Any type
-descended from a nonstandard integer type is also nonstandard. An
+An implementation may provide <nonstandard integer types>, descendants
+of <root_integer> that are declared outside of the specification of
+package Standard, which need not have all the standard characteristics
+of a type defined by an integer_type_definition. For example, a
+nonstandard integer type might have an asymmetric base range or it might
+not be allowed as an array or loop index (a very long integer). Any
+type descended from a nonstandard integer type is also nonstandard. An
implementation may place arbitrary restrictions on the use of such
types; it is implementation defined whether operators that are
predefined for "any integer type" are defined for a particular
@@ -5572,10 +5579,10 @@ should support a nonbinary modulus up to Integer'Last.
30
33 Integer literals are of the anonymous predefined integer type
- universal_integer. Other integer types have no literals. However,
- the overload resolution rules (see *note 8.6::, "*note 8.6:: The
- Context of Overload Resolution") allow expressions of the type
- universal_integer whenever an integer type is expected.
+ <universal_integer>. Other integer types have no literals.
+ However, the overload resolution rules (see *note 8.6::, "*note
+ 8.6:: The Context of Overload Resolution") allow expressions of the
+ type <universal_integer> whenever an integer type is expected.
31
34 The same arithmetic operators are predefined for all signed
@@ -5595,7 +5602,7 @@ should support a nonbinary modulus up to Integer'Last.
_Examples_
33
-Examples of integer types and subtypes:
+<Examples of integer types and subtypes: >
34
type Page_Num is range 1 .. 2_000;
@@ -5607,8 +5614,8 @@ Examples of integer types and subtypes:
subtype Buffer_Size is Integer range 0 .. Max;
36
- type Byte is mod 256; -- an unsigned byte
- type Hash_Index is mod 97; -- modulus is prime
+ type Byte is mod 256; --< an unsigned byte>
+ type Hash_Index is mod 97; --< modulus is prime>
File: arm2012.info, Node: 3.5.5, Next: 3.5.6, Prev: 3.5.4, Up: 3.5
@@ -5627,12 +5634,12 @@ S'Pos
specification:
3
- function S'Pos(Arg : S'Base)
- return universal_integer
+ function S'Pos(<Arg> : S'Base)
+ return <universal_integer>
4
This function returns the position number of the value of
- Arg, as a value of type universal_integer.
+ <Arg>, as a value of type <universal_integer>.
5
S'Val
@@ -5640,12 +5647,12 @@ S'Val
specification:
6
- function S'Val(Arg : universal_integer)
+ function S'Val(<Arg> : <universal_integer>)
return S'Base
7
This function returns a value of the type of S whose
- position number equals the value of Arg. For the
+ position number equals the value of <Arg>. For the
evaluation of a call on S'Val, if there is no value in
the base range of its type with the given position
number, Constraint_Error is raised.
@@ -5678,7 +5685,7 @@ by a Static_Predicate aspect.
For the evaluation of a call on S'Pos for an enumeration subtype, if the
value of the operand does not correspond to the internal code for any
enumeration literal of its type (perhaps due to an uninitialized
-variable), then the implementation should raise Program_Error. This is
+variable), then the implementation should raise Program_Error. This is
particularly important for enumeration types with noncontiguous internal
codes specified by an enumeration_representation_clause (*note 13.4:
S0311.).
@@ -5718,10 +5725,10 @@ S0311.).
_Examples_
14
-Examples of attributes of discrete subtypes:
+<Examples of attributes of discrete subtypes: >
15
- -- For the types and subtypes declared in subclause *note 3.5.1:: the
following hold:
+ --< For the types and subtypes declared in subclause *note 3.5.1:: the
following hold: >
16
-- Color'First = White, Color'Last = Black
@@ -5753,18 +5760,18 @@ fixed point types.
3
A type defined by a real_type_definition is implicitly derived from
-root_real, an anonymous predefined (specific) real type. Hence, all
+<root_real>, an anonymous predefined (specific) real type. Hence, all
real types, whether floating point or fixed point, are in the derivation
-class rooted at root_real.
+class rooted at <root_real>.
4
-Real literals are all of the type universal_real, the universal type
-(see *note 3.4.1::) for the class rooted at root_real, allowing their
-use with the operations of any real type. Certain multiplying operators
-have a result type of universal_fixed (see *note 4.5.5::), the universal
-type for the class of fixed point types, allowing the result of the
-multiplication or division to be used where any specific fixed point
-type is expected.
+Real literals are all of the type <universal_real>, the universal type
+(see *note 3.4.1::) for the class rooted at <root_real>, allowing their
+use with the operations of any real type. Certain multiplying operators
+have a result type of <universal_fixed> (see *note 4.5.5::), the
+universal type for the class of fixed point types, allowing the result
+of the multiplication or division to be used where any specific fixed
+point type is expected.
_Dynamic Semantics_
@@ -5776,7 +5783,7 @@ the floating_point_definition or the
fixed_point_definition.
6
An implementation shall perform the run-time evaluation of a use of a
-predefined operator of root_real with an accuracy at least as great as
+predefined operator of <root_real> with an accuracy at least as great as
that of any floating point type definable by a
floating_point_definition.
@@ -5790,8 +5797,8 @@ or the Machine_Overflows attribute of the type is False
(see *note
G.2::).
8
-An implementation may provide nonstandard real types, descendants of
-root_real that are declared outside of the specification of package
+An implementation may provide <nonstandard real types>, descendants of
+<root_real> that are declared outside of the specification of package
Standard, which need not have all the standard characteristics of a type
defined by a real_type_definition. For example, a nonstandard real type
might have an asymmetric or unsigned base range, or its predefined
@@ -5809,9 +5816,10 @@ explicit_generic_actual_parameters for formal scalar
types -- see *note
9
40 As stated, real literals are of the anonymous predefined real
- type universal_real. Other real types have no literals. However,
- the overload resolution rules (see *note 8.6::) allow expressions
- of the type universal_real whenever a real type is expected.
+ type <universal_real>. Other real types have no literals.
+ However, the overload resolution rules (see *note 8.6::) allow
+ expressions of the type <universal_real> whenever a real type is
+ expected.
File: arm2012.info, Node: 3.5.7, Next: 3.5.8, Prev: 3.5.6, Up: 3.5
@@ -5828,19 +5836,19 @@ digits.
2
floating_point_definition ::=
- digits static_expression [real_range_specification]
+ digits <static_>expression [real_range_specification]
3
real_range_specification ::=
- range static_simple_expression .. static_simple_expression
+ range <static_>simple_expression .. <static_>simple_expression
_Name Resolution Rules_
4
-The requested decimal precision, which is the minimum number of
+The <requested decimal precision>, which is the minimum number of
significant decimal digits required for the floating point type, is
specified by the value of the expression given after the reserved word
-digits. This expression is expected to be of any integer type.
+digits. This expression is expected to be of any integer type.
5
Each simple_expression of a real_range_specification is expected to be
@@ -5852,7 +5860,7 @@ of any real type; the types need not be the same.
The requested decimal precision shall be specified by a static
expression whose value is positive and no greater than
System.Max_Base_Digits. Each simple_expression of a
-real_range_specification shall also be static. If the
+real_range_specification shall also be static. If the
real_range_specification is omitted, the requested decimal precision
shall be no greater than System.Max_Digits.
@@ -5865,22 +5873,22 @@ precision and range.
8
The set of values for a floating point type is the (infinite) set of
-rational numbers. The machine numbers of a floating point type are the
-values of the type that can be represented exactly in every
-unconstrained variable of the type. The base range (see *note 3.5::) of
+rational numbers. The <machine numbers> of a floating point type are
+the values of the type that can be represented exactly in every
+unconstrained variable of the type. The base range (see *note 3.5::) of
a floating point type is symmetric around zero, except that it can
include some extra negative values in some implementations.
9
-The base decimal precision of a floating point type is the number of
-decimal digits of precision representable in objects of the type. The
-safe range of a floating point type is that part of its base range for
+The <base decimal precision> of a floating point type is the number of
+decimal digits of precision representable in objects of the type. The
+<safe range> of a floating point type is that part of its base range for
which the accuracy corresponding to the base decimal precision is
preserved by all predefined operations.
10
A floating_point_definition defines a floating point type whose base
-decimal precision is no less than the requested decimal precision. If a
+decimal precision is no less than the requested decimal precision. If a
real_range_specification is given, the safe range of the floating point
type (and hence, also its base range) includes at least the values of
the simple expressions given in the real_range_specification. If a
@@ -5891,9 +5899,9 @@ might include other values as well. The attributes
Safe_First and
Safe_Last give the actual bounds of the safe range.
11
-A floating_point_definition also defines a first subtype of the type. If
-a real_range_specification is given, then the subtype is constrained to
-a range whose bounds are given by a conversion of the values of the
+A floating_point_definition also defines a first subtype of the type.
+If a real_range_specification is given, then the subtype is constrained
+to a range whose bounds are given by a conversion of the values of the
simple_expressions of the real_range_specification to the type being
defined. Otherwise, the subtype is unconstrained.
@@ -5952,7 +5960,7 @@ library package Interfaces (see *note B.2::).
_Examples_
19
-Examples of floating point types and subtypes:
+<Examples of floating point types and subtypes:>
20
type Coefficient is digits 10 range -1.0 .. 1.0;
@@ -5962,7 +5970,7 @@ Examples of floating point types and subtypes:
type Mass is digits 7 range 0.0 .. 1.0E35;
22
- subtype Probability is Real range 0.0 .. 1.0; -- a subtype with a
smaller range
+ subtype Probability is Real range 0.0 .. 1.0; --< a subtype with a
smaller range>
File: arm2012.info, Node: 3.5.8, Next: 3.5.9, Prev: 3.5.7, Up: 3.5
@@ -5979,10 +5987,10 @@ The following attribute is defined for every floating
point subtype S:
S'Digits
S'Digits denotes the requested decimal precision for the
subtype S. The value of this attribute is of the type
- universal_integer. The requested decimal precision of
- the base subtype of a floating point type T is defined to
- be the largest value of d for which
- ceiling(d * log(10) / log(T'Machine_Radix)) + g <=
+ <universal_integer>. The requested decimal precision of
+ the base subtype of a floating point type <T> is defined
+ to be the largest value of <d> for which
+ ceiling(<d> * log(10) / log(T'Machine_Radix)) + <g> <=
T'Model_Mantissa
where g is 0 if Machine_Radix is a positive power of 10
and 1 otherwise.
@@ -6011,8 +6019,8 @@ File: arm2012.info, Node: 3.5.9, Next: 3.5.10, Prev:
3.5.8, Up: 3.5
1
A fixed point type is either an ordinary fixed point type, or a decimal
-fixed point type. The error bound of a fixed point type is specified as
-an absolute value, called the delta of the fixed point type.
+fixed point type. The error bound of a fixed point type is specified as
+an absolute value, called the <delta> of the fixed point type.
_Syntax_
@@ -6022,28 +6030,28 @@ an absolute value, called the delta of the fixed point
type.
3
ordinary_fixed_point_definition ::=
- delta static_expression real_range_specification
+ delta <static_>expression real_range_specification
4
decimal_fixed_point_definition ::=
- delta static_expression digits static_expression [
+ delta <static_>expression digits <static_>expression [
real_range_specification]
5/4
digits_constraint ::=
- digits static_simple_expression [range_constraint]
+ digits <static_>simple_expression [range_constraint]
_Name Resolution Rules_
6
-For a type defined by a fixed_point_definition, the delta of the type is
-specified by the value of the expression given after the reserved word
-delta; this expression is expected to be of any real type. For a type
-defined by a decimal_fixed_point_definition (a decimal fixed point
-type), the number of significant decimal digits for its first subtype
-(the digits of the first subtype) is specified by the expression given
-after the reserved word digits; this expression is expected to be of any
-integer type.
+For a type defined by a fixed_point_definition, the <delta> of the type
+is specified by the value of the expression given after the reserved
+word delta; this expression is expected to be of any real type. For a
+type defined by a decimal_fixed_point_definition (a <decimal> fixed
+point type), the number of significant decimal digits for its first
+subtype (the <digits> of the first subtype) is specified by the
+expression given after the reserved word digits; this expression is
+expected to be of any integer type.
6.1/4
The simple_expression of a digits_constraint is expected to be of any
@@ -6058,26 +6066,26 @@ shall be positive.
8/2
The set of values of a fixed point type comprise the integral multiples
-of a number called the small of the type. The machine numbers of a
+of a number called the <small> of the type. The <machine numbers> of a
fixed point type are the values of the type that can be represented
-exactly in every unconstrained variable of the type. For a type defined
-by an ordinary_fixed_point_definition (an ordinary fixed point type),
-the small may be specified by an attribute_definition_clause (*note
+exactly in every unconstrained variable of the type. For a type defined
+by an ordinary_fixed_point_definition (an <ordinary> fixed point type),
+the <small> may be specified by an attribute_definition_clause (*note
13.3: S0310.) (see *note 13.3::); if so specified, it shall be no
-greater than the delta of the type. If not specified, the small of an
-ordinary fixed point type is an implementation-defined power of two less
-than or equal to the delta.
+greater than the <delta> of the type. If not specified, the <small> of
+an ordinary fixed point type is an implementation-defined power of two
+less than or equal to the <delta>.
9
-For a decimal fixed point type, the small equals the delta; the delta
-shall be a power of 10. If a real_range_specification is given, both
-bounds of the range shall be in the range -(10**digits-1)*delta ..
-+(10**digits-1)*delta.
+For a decimal fixed point type, the <small> equals the <delta>; the
+<delta> shall be a power of 10. If a real_range_specification is given,
+both bounds of the range shall be in the range -(10**<digits>-1)*<delta>
+.. +(10**<digits>-1)*<delta>.
10
A fixed_point_definition is illegal if the implementation does not
-support a fixed point type with the given small and specified range or
-digits.
+support a fixed point type with the given <small> and specified range or
+<digits>.
11
For a subtype_indication with a digits_constraint, the subtype_mark
@@ -6092,10 +6100,10 @@ implementations.
13
An ordinary_fixed_point_definition defines an ordinary fixed point type
-whose base range includes at least all multiples of small that are
+whose base range includes at least all multiples of <small> that are
between the bounds specified in the real_range_specification. The base
range of the type does not necessarily include the specified bounds
-themselves. An ordinary_fixed_point_definition (*note 3.5.9: S0048.)
+themselves. An ordinary_fixed_point_definition (*note 3.5.9: S0048.)
also defines a constrained first subtype of the type, with each bound of
its range given by the closer to zero of:
@@ -6108,13 +6116,13 @@ its range given by the closer to zero of:
16
A decimal_fixed_point_definition defines a decimal fixed point type
-whose base range includes at least the range -(10**digits-1)*delta ..
-+(10**digits-1)*delta. A decimal_fixed_point_definition also defines a
-constrained first subtype of the type. If a real_range_specification is
-given, the bounds of the first subtype are given by a conversion of the
-values of the expressions of the real_range_specification. Otherwise,
-the range of the first subtype is -(10**digits-1)*delta ..
-+(10**digits-1)*delta.
+whose base range includes at least the range -(10**<digits>-1)*<delta>
+.. +(10**<digits>-1)*<delta>. A decimal_fixed_point_definition also
+defines a constrained first subtype of the type. If a
+real_range_specification is given, the bounds of the first subtype are
+given by a conversion of the values of the expressions of the
+real_range_specification. Otherwise, the range of the first subtype is
+-(10**<digits>-1)*<delta> .. +(10**<digits>-1)*<delta>.
_Dynamic Semantics_
@@ -6124,20 +6132,21 @@ and its first subtype.
18/4
For a digits_constraint on a decimal fixed point subtype with a given
-delta, if it does not have a range_constraint, then it specifies an
-implicit range -(10**D-1)*delta .. +(10**D-1)*delta, where D is the
-value of the simple_expression. A digits_constraint is compatible with a
-decimal fixed point subtype if the value of the simple_expression is no
-greater than the digits of the subtype, and if it specifies (explicitly
-or implicitly) a range that is compatible with the subtype.
+<delta>, if it does not have a range_constraint, then it specifies an
+implicit range -(10**<D>-1)*<delta> .. +(10**<D>-1)*<delta>, where <D>
+is the value of the simple_expression. A digits_constraint is
+<compatible> with a decimal fixed point subtype if the value of the
+simple_expression is no greater than the <digits> of the subtype, and if
+it specifies (explicitly or implicitly) a range that is compatible with
+the subtype.
19/4
The elaboration of a digits_constraint consists of the elaboration of
-the range_constraint, if any. If a range_constraint is given, a check is
-made that the bounds of the range are both in the range -(10**D-1)*delta
-.. +(10**D-1)*delta, where D is the value of the (static)
-simple_expression given after the reserved word digits. If this check
-fails, Constraint_Error is raised.
+the range_constraint, if any. If a range_constraint is given, a check
+is made that the bounds of the range are both in the range
+-(10**<D>-1)*<delta> .. +(10**<D>-1)*<delta>, where <D> is the value of
+the (static) simple_expression given after the reserved word digits. If
+this check fails, Constraint_Error is raised.
_Implementation Requirements_
@@ -6148,11 +6157,11 @@ The implementation shall support at least 24 bits of
precision
_Implementation Permissions_
21
-Implementations are permitted to support only smalls that are a power of
-two. In particular, all decimal fixed point type declarations can be
+Implementations are permitted to support only <small>s that are a power
+of two. In particular, all decimal fixed point type declarations can be
disallowed. Note however that conformance with the Information Systems
-Annex requires support for decimal smalls, and decimal fixed point type
-declarations with digits up to at least 18.
+Annex requires support for decimal <small>s, and decimal fixed point
+type declarations with <digits> up to at least 18.
NOTES
@@ -6163,7 +6172,7 @@ declarations with digits up to at least 18.
23
type Fraction is delta 2.0**(-15) range -1.0 .. 1.0;
-
+
24
With 2's complement hardware, such a type could have a signed
@@ -6173,21 +6182,21 @@ declarations with digits up to at least 18.
_Examples_
25
-Examples of fixed point types and subtypes:
+<Examples of fixed point types and subtypes:>
26
type Volt is delta 0.125 range 0.0 .. 255.0;
27
- -- A pure fraction which requires all the available
- -- space in a word can be declared as the type Fraction:
+ -- <A pure fraction which requires all the available>
+ -- <space in a word can be declared as the type Fraction:>
type Fraction is delta System.Fine_Delta range -1.0 .. 1.0;
- -- Fraction'Last = 1.0 - System.Fine_Delta
+ -- <Fraction'Last = 1.0 - System.Fine_Delta>
28
- type Money is delta 0.01 digits 15; -- decimal fixed point
+ type Money is delta 0.01 digits 15; -- <decimal fixed point>
subtype Salary is Money digits 10;
- -- Money'Last = 10.0**13 - 0.01, Salary'Last = 10.0**8 - 0.01
+ -- <Money'Last = 10.0**13 - 0.01, Salary'Last = 10.0**8 - 0.01>
File: arm2012.info, Node: 3.5.10, Prev: 3.5.9, Up: 3.5
@@ -6202,18 +6211,18 @@ The following attributes are defined for every fixed
point subtype S:
2/1
S'Small
- S'Small denotes the small of the type of S. The value of
- this attribute is of the type universal_real. Small may
- be specified for nonderived ordinary fixed point types
- via an attribute_definition_clause (*note 13.3: S0310.)
- (see *note 13.3::); the expression of such a clause shall
- be static.
+ S'Small denotes the <small> of the type of S. The value
+ of this attribute is of the type <universal_real>. Small
+ may be specified for nonderived ordinary fixed point
+ types via an attribute_definition_clause (*note 13.3:
+ S0310.) (see *note 13.3::); the expression of such a
+ clause shall be static.
3
S'Delta
- S'Delta denotes the delta of the fixed point subtype S.
+ S'Delta denotes the <delta> of the fixed point subtype S.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
4
S'Fore
@@ -6224,17 +6233,18 @@ S'Fore
a one-character prefix that is either a minus sign or a
space. (This minimum number does not include superfluous
zeros or underlines, and is at least 2.) The value of
- this attribute is of the type universal_integer.
+ this attribute is of the type <universal_integer>.
5
S'Aft
S'Aft yields the number of decimal digits needed after
- the decimal point to accommodate the delta of the subtype
- S, unless the delta of the subtype S is greater than 0.1,
- in which case the attribute yields the value one. (S'Aft
- is the smallest positive integer N for which
+ the decimal point to accommodate the <delta> of the
+ subtype S, unless the <delta> of the subtype S is greater
+ than 0.1, in which case the attribute yields the value
+ one. (S'Aft is the smallest positive integer N for which
(10**N)*S'Delta is greater than or equal to one.) The
- value of this attribute is of the type universal_integer.
+ value of this attribute is of the type
+ <universal_integer>.
6
The following additional attributes are defined for every decimal fixed
@@ -6242,11 +6252,12 @@ point subtype S:
7
S'Digits
- S'Digits denotes the digits of the decimal fixed point
+ S'Digits denotes the <digits> of the decimal fixed point
subtype S, which corresponds to the number of decimal
digits that are representable in objects of the subtype.
The value of this attribute is of the type
- universal_integer. Its value is determined as follows:
+ <universal_integer>. Its value is determined as follows:
+
8
* For a first subtype or a subtype defined by a
@@ -6262,17 +6273,18 @@ S'Digits
10
* The digits of a base subtype is the largest integer
- D such that the range -(10**D-1)*delta ..
- +(10**D-1)*delta is included in the base range of
- the type.
+ <D> such that the range -(10**<D>-1)*<delta> ..
+ +(10**<D>-1)*<delta> is included in the base range
+ of the type.
11
S'Scale
- S'Scale denotes the scale of the subtype S, defined as
+ S'Scale denotes the <scale> of the subtype S, defined as
the value N such that S'Delta = 10.0**(-N). The scale
indicates the position of the point relative to the
rightmost significant digits of values of subtype S. The
- value of this attribute is of the type universal_integer.
+ value of this attribute is of the type
+ <universal_integer>.
12
S'Round
@@ -6280,7 +6292,7 @@ S'Round
specification:
13
- function S'Round(X : universal_real)
+ function S'Round(<X> : <universal_real>)
return S'Base
14
@@ -6319,11 +6331,11 @@ File: arm2012.info, Node: 3.6, Next: 3.7, Prev: 3.5,
Up: 3
===============
1
-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.
+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_
@@ -6345,7 +6357,8 @@ components.
discrete_subtype_definition}) of component_definition
6
- discrete_subtype_definition ::= discrete_subtype_indication | range
+ discrete_subtype_definition ::= <discrete_>subtype_indication |
+ range
7/2
component_definition ::=
@@ -6358,26 +6371,27 @@ components.
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 *note 8.6::).
+range itself (plus the preference for <root_integer> -- see *note
+8.6::).
_Legality Rules_
9
Each index_subtype_definition or discrete_subtype_definition in an
-array_type_definition defines an index subtype; its type (the index
-type) shall be discrete.
+array_type_definition defines an <index subtype>; its type (the <index
+type>) shall be discrete.
10
The subtype defined by the subtype_indication of a component_definition
-(the component subtype) shall be a definite subtype.
+(the <component subtype>) shall be a definite subtype.
11/2
-This paragraph was deleted.
+<This paragraph was deleted.>
_Static Semantics_
12
-An array is characterized by the number of indices (the dimensionality
+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.
@@ -6388,11 +6402,11 @@ 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.
+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.
14
An array_type_definition defines an array type and its first subtype.
@@ -6406,16 +6420,16 @@ arrays (see *note 3.6.1::).
An unconstrained_array_definition defines an array type with an
unconstrained first subtype. Each index_subtype_definition (*note 3.6:
S0053.) defines the corresponding index subtype to be the subtype
-denoted by the subtype_mark (*note 3.2.2: S0028.). The compound
-delimiter <> (called a box) of an index_subtype_definition stands for an
-undefined range (different objects of the type need not have the same
+denoted by the subtype_mark (*note 3.2.2: S0028.). The compound
+delimiter <> (called a <box>) of an index_subtype_definition stands for
+an undefined range (different objects of the type need not have the same
bounds).
16
A constrained_array_definition defines an array type with a constrained
first subtype. Each discrete_subtype_definition (*note 3.6: S0055.)
defines the corresponding index subtype, as well as the corresponding
-index range for the constrained first subtype. The constraint of the
+index range for the constrained first subtype. The <constraint> of the
first subtype consists of the bounds of the index ranges.
17
@@ -6424,7 +6438,7 @@ The discrete subtype defined by a
discrete_subtype_definition (*note
3.2.2: S0027.), or a subtype determined by the range as follows:
18
- * If the type of the range resolves to root_integer, then the
+ * 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;
@@ -6453,7 +6467,7 @@ any per-object expressions creates the discrete subtype,
and consists of
the elaboration of the subtype_indication (*note 3.2.2: S0027.) or the
evaluation of the range. The elaboration of a
discrete_subtype_definition that contains one or more per-object
-expressions is defined in *note 3.8::. The elaboration of a
+expressions is defined in *note 3.8::. The elaboration of a
component_definition (*note 3.6: S0056.) in an array_type_definition
(*note 3.6: S0051.) consists of the elaboration of the
subtype_indication (*note 3.2.2: S0027.) or access_definition. The
@@ -6504,16 +6518,16 @@ defined by the full_type_declaration on which it
appears.
_Examples_
25
-Examples of type declarations with unconstrained array definitions:
+<Examples of type declarations with unconstrained array definitions: >
26
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 *note
3.5.2::
+ type Roman is array(Positive range <>) of Roman_Digit; --< see *note
3.5.2::>
27
-Examples of type declarations with constrained array definitions:
+<Examples of type declarations with constrained array definitions: >
28
type Table is array(1 .. 10) of Integer;
@@ -6521,17 +6535,17 @@ Examples of type declarations with constrained array
definitions:
type Line is array(1 .. Max_Line_Size) of Character;
29
-Examples of object declarations with array type definitions:
+<Examples of object declarations with array type definitions: >
30/2
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 *note
4.3.3::
+ Page : array(Positive range <>) of Line := --< an array of arrays>
+ (1 | 50 => Line'(1 | Line'Last => '+', others => '-'), --< see *note
4.3.3::>
2 .. 49 => Line'(1 | Line'Last => '|', others => ' '));
- -- Page is constrained by its initial value to (1..50)
+ --< Page is constrained by its initial value to (1..50)>
* Menu:
@@ -6555,13 +6569,13 @@ index of an array subtype, and thereby the
corresponding array bounds.
index_constraint ::= (discrete_range {, discrete_range})
3
- discrete_range ::= discrete_subtype_indication | range
+ discrete_range ::= <discrete_>subtype_indication | range
_Name Resolution Rules_
4
The type of a discrete_range is the type of the subtype defined by the
-subtype_indication, or the type of the range. For an index_constraint,
+subtype_indication, or the type of the range. For an index_constraint,
each discrete_range shall resolve to be of the type of the corresponding
index.
@@ -6583,17 +6597,17 @@ by the range of the subtype defined by the
subtype_indication.
_Dynamic Semantics_
7
-An index_constraint is compatible with an unconstrained array subtype if
-and only if the index range defined by each discrete_range is compatible
-(see *note 3.5::) with the corresponding index subtype. If any of the
-discrete_ranges defines a null range, any array thus constrained is a
-null array, having no components. An array value satisfies an
-index_constraint if at each index position the array value and the
-index_constraint have the same index bounds.
+An index_constraint is <compatible> with an unconstrained array subtype
+if and only if the index range defined by each discrete_range is
+compatible (see *note 3.5::) with the corresponding index subtype. If
+any of the discrete_ranges defines a null range, any array thus
+constrained is a <null array>, having no components. An array value
+<satisfies> an index_constraint if at each index position the array
+value and the index_constraint have the same index bounds.
8
The elaboration of an index_constraint consists of the evaluation of the
-discrete_range(s), in an arbitrary order. The evaluation of a
+discrete_range(s), in an arbitrary order. The evaluation of a
discrete_range consists of the elaboration of the subtype_indication or
the evaluation of the range.
@@ -6614,24 +6628,24 @@ the evaluation of the range.
_Examples_
11
-Examples of array declarations including an index constraint:
+<Examples of array declarations including an index constraint: >
12
- Board : Matrix(1 .. 8, 1 .. 8); -- see *note 3.6::
+ Board : Matrix(1 .. 8, 1 .. 8); --< see *note 3.6::>
Rectangle : Matrix(1 .. 20, 1 .. 30);
- Inverse : Matrix(1 .. N, 1 .. N); -- N need not be static
+ Inverse : Matrix(1 .. N, 1 .. N); --< N need not be static >
13
Filter : Bit_Vector(0 .. 31);
14
-Example of array declaration with a constrained array subtype:
+<Example of array declaration with a constrained array subtype: >
15
- My_Schedule : Schedule; -- all arrays of type Schedule have the same
bounds
+ My_Schedule : Schedule; --< all arrays of type Schedule have the same
bounds>
16
-Example of record type with a component that is an array:
+<Example of record type with a component that is an array: >
17
type Var_Line(Length : Natural) is
@@ -6640,7 +6654,7 @@ Example of record type with a component that is an array:
end record;
18
- Null_Line : Var_Line(0); -- Null_Line.Image is a null array
+ Null_Line : Var_Line(0); --< Null_Line.Image is a null array>
File: arm2012.info, Node: 3.6.2, Next: 3.6.3, Prev: 3.6.1, Up: 3.6
@@ -6698,13 +6712,13 @@ A'Range(N)
A'Length
A'Length denotes the number of values of the first index
range (zero for a null range); its type is
- universal_integer.
+ <universal_integer>.
10
A'Length(N)
A'Length(N) denotes the number of values of the N-th
index range (zero for a null range); its type is
- universal_integer.
+ <universal_integer>.
_Implementation Advice_
@@ -6752,8 +6766,8 @@ Fortran").
_Examples_
17
-Examples (using arrays declared in the examples of subclause *note
-3.6.1::):
+<Examples (using arrays declared in the examples of subclause *note
+3.6.1::):>
18
-- Filter'First = 0 Filter'Last = 31 Filter'Length =
32
@@ -6769,7 +6783,7 @@ File: arm2012.info, Node: 3.6.3, Prev: 3.6.2, Up: 3.6
1
A one-dimensional array type whose component type is a character type is
-called a string type.
+called a <string> type.
2/2
There are three predefined string types, String, Wide_String, and
@@ -6799,17 +6813,17 @@ Positive; these are declared in the visible part of
package Standard:
_Examples_
6
-Examples of string objects:
+<Examples of string objects:>
7
Stars : String(1 .. 120) := (1 .. 120 => '*' );
Question : constant String := "How many characters?";
- -- Question'First = 1, Question'Last = 20
- -- Question'Length = 20 (the number of characters)
+ --< Question'First = 1, Question'Last = 20>
+ --< Question'Length = 20 (the number of characters)>
8
- Ask_Twice : String := Question & Question; -- constrained to (1..40)
- Ninety_Six : constant Roman := "XCVI"; -- see *note 3.5.2:: and *note
3.6::
+ Ask_Twice : String := Question & Question; --< constrained to (1..40)>
+ Ninety_Six : constant Roman := "XCVI"; --< see *note 3.5.2:: and
*note 3.6::>
File: arm2012.info, Node: 3.7, Next: 3.8, Prev: 3.6, Up: 3
@@ -6861,14 +6875,15 @@ discriminant_specification is that of the corresponding
discriminant.
A discriminant_part is only permitted in a declaration for a composite
type that is not an array or interface type (this includes generic
formal types). A type declared with a known_discriminant_part is called
-a discriminated type, as is a type that inherits (known) discriminants.
+a <discriminated> type, as is a type that inherits (known)
+discriminants.
9/2
The subtype of a discriminant may be defined by an optional
null_exclusion and a subtype_mark, in which case the subtype_mark shall
denote a discrete or access subtype, or it may be defined by an
-access_definition. A discriminant that is defined by an
-access_definition is called an access discriminant and is of an
+access_definition. A discriminant that is defined by an
+access_definition is called an <access discriminant> and is of an
anonymous access type.
9.1/3
@@ -6886,7 +6901,7 @@ normally apply (see *note 12.3::), this rule applies also
in the private
part of an instance of a generic unit.
11/2
-This paragraph was deleted.
+<This paragraph was deleted.>
12
For a type defined by a derived_type_definition, if a
@@ -6907,7 +6922,7 @@ known_discriminant_part is provided in its declaration,
then:
corresponding parent discriminant.
16/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Static Semantics_
@@ -6921,24 +6936,24 @@ defined by the access_definition.
For a type defined by a derived_type_definition, each discriminant of
the parent type is either inherited, constrained to equal some new
discriminant of the derived type, or constrained to the value of an
-expression. When inherited or constrained to equal some new
+expression. When inherited or constrained to equal some new
discriminant, the parent discriminant and the discriminant of the
-derived type are said to correspond. Two discriminants also correspond
-if there is some common discriminant to which they both correspond. A
-discriminant corresponds to itself as well. If a discriminant of a
-parent type is constrained to a specific value by a
-derived_type_definition, then that discriminant is said to be specified
-by that derived_type_definition.
+derived type are said to <correspond>. Two discriminants also
+correspond if there is some common discriminant to which they both
+correspond. A discriminant corresponds to itself as well. If a
+discriminant of a parent type is constrained to a specific value by a
+derived_type_definition, then that discriminant is said to be
+<specified> by that derived_type_definition.
19
A constraint that appears within the definition of a discriminated type
-depends on a discriminant of the type if it names the discriminant as a
-bound or discriminant value. A component_definition depends on a
+<depends on a discriminant> of the type if it names the discriminant as
+a bound or discriminant value. A component_definition depends on a
discriminant if its constraint depends on the discriminant, or on a
discriminant that corresponds to it.
20
-A component depends on a discriminant if:
+A component <depends on a discriminant> if:
21
* Its component_definition depends on the discriminant; or
@@ -6949,8 +6964,8 @@ A component depends on a discriminant if:
23
* It is a component inherited as part of a derived_type_definition,
- and the constraint of the parent_subtype_indication depends on the
- discriminant; or
+ and the constraint of the <parent_>subtype_indication depends on
+ the discriminant; or
24
* It is a subcomponent of a component that depends on the
@@ -6964,15 +6979,15 @@ other component values are present in the value of the
discriminated
type.
26
-A type declared with a known_discriminant_part is said to have known
-discriminants; its first subtype is unconstrained. A type declared with
-an unknown_discriminant_part is said to have unknown discriminants. A
-type declared without a discriminant_part has no discriminants, unless
-it is a derived type; if derived, such a type has the same sort of
-discriminants (known, unknown, or none) as its parent (or ancestor)
-type. A tagged class-wide type also has unknown discriminants. Any
-subtype of a type with unknown discriminants is an unconstrained and
-indefinite subtype (see *note 3.2:: and *note 3.3::).
+A type declared with a known_discriminant_part is said to have <known
+discriminants>; its first subtype is unconstrained. A type declared
+with an unknown_discriminant_part is said to have <unknown
+discriminants>. A type declared without a discriminant_part has no
+discriminants, unless it is a derived type; if derived, such a type has
+the same sort of discriminants (known, unknown, or none) as its parent
+(or ancestor) type. A tagged class-wide type also has unknown
+discriminants. Any subtype of a type with unknown discriminants is an
+unconstrained and indefinite subtype (see *note 3.2:: and *note 3.3::).
_Dynamic Semantics_
@@ -6980,7 +6995,7 @@ indefinite subtype (see *note 3.2:: and *note 3.3::).
For an access discriminant, its access_definition is elaborated when the
value of the access discriminant is defined: by evaluation of its
default_expression, by elaboration of a discriminant_constraint, or by
-an assignment that initializes the enclosing object.
+an assignment that initializes the enclosing object.
NOTES
@@ -7015,10 +7030,10 @@ an assignment that initializes the enclosing object.
_Examples_
32
-Examples of discriminated types:
+<Examples of discriminated types:>
33
- type Buffer(Size : Buffer_Size := 100) is -- see *note 3.5.4::
+ type Buffer(Size : Buffer_Size := 100) is --< see *note 3.5.4::>
record
Pos : Buffer_Size := 0;
Value : String(1 .. Size);
@@ -7027,7 +7042,7 @@ Examples of discriminated types:
34
type Matrix_Rec(Rows, Columns : Integer) is
record
- Mat : Matrix(1 .. Rows, 1 .. Columns); -- see *note 3.6::
+ Mat : Matrix(1 .. Rows, 1 .. Columns); --< see *note 3.6::>
end record;
35
@@ -7043,8 +7058,8 @@ Examples of discriminated types:
37/3
task type Worker(Prio : System.Priority; Buf : access Buffer)
- with Priority => Prio is -- see *note D.1::
- -- discriminants used to parameterize the task type (see *note 9.1::)
+ with Priority => Prio is --< see *note D.1::>
+ --< discriminants used to parameterize the task type (see *note 9.1::)>
entry Fill;
entry Drain;
end Worker;
@@ -7072,13 +7087,13 @@ a given discriminated type.
3
discriminant_association ::=
- [discriminant_selector_name {| discriminant_selector_name} =>]
- expression
+ [<discriminant_>selector_name {| <discriminant_>
+ selector_name} =>] expression
4
- A discriminant_association is said to be named if it has one or
- more discriminant_selector_names; it is otherwise said to be
- positional. In a discriminant_constraint, any positional
+ A discriminant_association is said to be <named> if it has one or
+ more <discriminant_>selector_names; it is otherwise said to be
+ <positional>. In a discriminant_constraint, any positional
associations shall precede any named associations.
_Name Resolution Rules_
@@ -7086,12 +7101,12 @@ a given discriminated type.
5
Each selector_name of a named discriminant_association (*note 3.7.1:
S0065.) shall resolve to denote a discriminant of the subtype being
-constrained; the discriminants so named are the associated discriminants
-of the named association. For a positional association, the associated
-discriminant is the one whose discriminant_specification (*note 3.7:
-S0062.) occurred in the corresponding position in the
-known_discriminant_part (*note 3.7: S0061.) that defined the
-discriminants of the subtype being constrained.
+constrained; the discriminants so named are the <associated
+discriminants> of the named association. For a positional association,
+the <associated discriminant> is the one whose
+discriminant_specification (*note 3.7: S0062.) occurred in the
+corresponding position in the known_discriminant_part (*note 3.7:
+S0061.) that defined the discriminants of the subtype being constrained.
6
The expected type for the expression in a discriminant_association is
@@ -7117,17 +7132,17 @@ discriminant_constraint shall provide exactly one value
for each
discriminant of the subtype being constrained.
9/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Dynamic Semantics_
10
-A discriminant_constraint is compatible with an unconstrained
+A discriminant_constraint is <compatible> with an unconstrained
discriminated subtype if each discriminant value belongs to the subtype
of the corresponding discriminant.
11
-A composite value satisfies a discriminant constraint if and only if
+A composite value <satisfies> a discriminant constraint if and only if
each discriminant of the composite value has the value imposed by the
discriminant constraint.
@@ -7137,7 +7152,7 @@ discriminant_associations are evaluated in an arbitrary
order and
converted to the type of the associated discriminant (which might raise
Constraint_Error -- see *note 4.6::); the expression of a named
association is evaluated (and converted) once for each associated
-discriminant. The result of each evaluation and conversion is the value
+discriminant. The result of each evaluation and conversion is the value
imposed by the constraint for the associated discriminant.
NOTES
@@ -7150,15 +7165,15 @@ imposed by the constraint for the associated
discriminant.
_Examples_
14/3
-Examples (using types declared above in subclause *note 3.7::):
+<Examples (using types declared above in subclause *note 3.7::):>
15
- Large : Buffer(200); -- constrained, always 200 characters
- -- (explicit discriminant value)
- Message : Buffer; -- unconstrained, initially 100 characters
- -- (default discriminant value)
- Basis : Square(5); -- constrained, always 5 by 5
- Illegal : Square; -- illegal, a Square has to be constrained
+ Large : Buffer(200); --< constrained, always 200 characters>
+ --< (explicit discriminant value)>
+ Message : Buffer; --< unconstrained, initially 100 characters>
+ --< (default discriminant value)>
+ Basis : Square(5); --< constrained, always 5 by 5>
+ Illegal : Square; --< illegal, a Square has to be constrained>
File: arm2012.info, Node: 3.7.2, Prev: 3.7.1, Up: 3.7
@@ -7204,7 +7219,7 @@ File: arm2012.info, Node: 3.8, Next: 3.9, Prev: 3.7,
Up: 3
1
A record object is a composite object consisting of named components.
The value of a record object is a composite value consisting of the
-values of the components.
+values of the components.
_Syntax_
@@ -7243,7 +7258,7 @@ component_declaration is the type of the component.
_Legality Rules_
8/2
-This paragraph was deleted.
+<This paragraph was deleted.>
9/2
Each component_declaration declares a component of the record type.
@@ -7282,7 +7297,7 @@ of an access type, and the attribute_reference shall
appear alone.
13.1/3
If a record_type_definition includes the reserved word limited, the type
-is called an explicitly limited record type.
+is called an <explicitly limited record> type.
14
The component_definition of a component_declaration defines the
@@ -7293,7 +7308,7 @@ appears in the component_definition, then the component
is aliased (see
15
If the component_list of a record type is defined by the reserved word
null and there are no discriminants, then the record type has no
-components and all records of the type are null records. A
+components and all records of the type are <null records>. A
record_definition of null record is equivalent to record null; end
record.
@@ -7302,13 +7317,13 @@ record.
16
The elaboration of a record_type_definition creates the record type and
its first subtype, and consists of the elaboration of the
-record_definition. The elaboration of a record_definition consists of
+record_definition. The elaboration of a record_definition consists of
the elaboration of its component_list, if any.
17
The elaboration of a component_list consists of the elaboration of the
component_items and variant_part, if any, in the order in which they
-appear. The elaboration of a component_declaration consists of the
+appear. The elaboration of a component_declaration consists of the
elaboration of the component_definition.
18/2
@@ -7316,10 +7331,10 @@ Within the definition of a composite type, if a
component_definition or
discrete_subtype_definition (see *note 9.5.2::) includes a name that
denotes a discriminant of the type, or that is an attribute_reference
whose prefix denotes the current instance of the type, the expression
-containing the name is called a per-object expression, and the
-constraint or range being defined is called a per-object constraint. For
-the elaboration of a component_definition of a component_declaration or
-the discrete_subtype_definition (*note 3.6: S0055.) of an
+containing the name is called a <per-object expression>, and the
+constraint or range being defined is called a <per-object constraint>.
+For the elaboration of a component_definition of a component_declaration
+or the discrete_subtype_definition (*note 3.6: S0055.) of an
entry_declaration (*note 9.5.2: S0218.) for an entry family (see *note
9.5.2::), if the component subtype is defined by an access_definition or
if the constraint or range of the subtype_indication or
@@ -7382,7 +7397,7 @@ associated subtype is created.
_Examples_
26
-Examples of record type declarations:
+<Examples of record type declarations: >
27
type Date is
@@ -7400,14 +7415,14 @@ Examples of record type declarations:
end record;
29
-Examples of record variables:
+<Examples of record variables: >
30
Tomorrow, Yesterday : Date;
A, B, C : Complex;
31
- -- both components of A, B, and C are implicitly initialized to zero
+ --< both components of A, B, and C are implicitly initialized to zero >
* Menu:
@@ -7428,7 +7443,7 @@ of the discriminant covered by its discrete_choice_list.
2
variant_part ::=
- case discriminant_direct_name is
+ case <discriminant_>direct_name is
variant
{variant}
end case;
@@ -7442,17 +7457,17 @@ of the discriminant covered by its discrete_choice_list.
discrete_choice_list ::= discrete_choice {| discrete_choice}
5/3
- discrete_choice ::= choice_expression | discrete_
+ discrete_choice ::= choice_expression | <discrete_>
subtype_indication | range | others
_Name Resolution Rules_
6
-The discriminant_direct_name shall resolve to denote a discriminant
-(called the discriminant of the variant_part) specified in the
+The <discriminant_>direct_name shall resolve to denote a discriminant
+(called the <discriminant of the variant_part>) specified in the
known_discriminant_part of the full_type_declaration that contains the
-variant_part. The expected type for each discrete_choice in a variant is
-the type of the discriminant of the variant_part.
+variant_part. The expected type for each discrete_choice in a variant
+is the type of the discriminant of the variant_part.
_Legality Rules_
@@ -7467,7 +7482,7 @@ discrete_choice_list, if it appears, shall be the last
one in the
enclosing construct.
9
-A discrete_choice is defined to cover a value in the following cases:
+A discrete_choice is defined to <cover a value> in the following cases:
10/3
* A discrete_choice that is a choice_expression covers a value if the
@@ -7525,7 +7540,7 @@ If the component_list of a variant is specified by null,
the variant has
no components.
20
-The discriminant of a variant_part is said to govern the variant_part
+The discriminant of a variant_part is said to <govern> the variant_part
and its variants. In addition, the discriminant of a derived type
governs a variant_part and its variants if it corresponds (see *note
3.7::) to the discriminant of the variant_part.
@@ -7540,12 +7555,13 @@ in turn to any further variant that is, itself,
included in the
component_list of the given variant.
21.1/3
-When an object of a discriminated type T is initialized by default,
+When an object of a discriminated type <T> is initialized by default,
Constraint_Error is raised if no discrete_choice_list of any variant of
-a variant_part of T covers the value of the discriminant that governs
+a variant_part of <T> covers the value of the discriminant that governs
the variant_part. When a variant_part appears in the component_list of
-another variant V, this test is only applied if the value of the
-discriminant governing V is covered by the discrete_choice_list of V.
+another variant <V>, this test is only applied if the value of the
+discriminant governing <V> is covered by the discrete_choice_list of
+<V>.
22
The elaboration of a variant_part consists of the elaboration of the
@@ -7554,7 +7570,7 @@ component_list of each variant in the order in which they
appear.
_Examples_
23
-Example of record type with a variant part:
+<Example of record type with a variant part: >
24
type Device is (Printer, Disk, Drum);
@@ -7574,14 +7590,14 @@ Example of record type with a variant part:
end record;
26
-Examples of record subtypes:
+<Examples of record subtypes:>
27
subtype Drum_Unit is Peripheral(Drum);
subtype Disk_Unit is Peripheral(Disk);
28
-Examples of constrained record variables:
+<Examples of constrained record variables:>
29
Writer : Peripheral(Unit => Printer);
@@ -7596,22 +7612,23 @@ File: arm2012.info, Node: 3.9, Next: 3.10, Prev:
3.8, Up: 3
1
Tagged types and type extensions support object-oriented programming,
based on inheritance with extension and run-time polymorphism via
-dispatching operations.
+<dispatching operations>.
_Static Semantics_
2/2
A record type or private type that has the reserved word tagged in its
-declaration is called a tagged type. In addition, an interface type is
-a tagged type, as is a task or protected type derived from an interface
-(see *note 3.9.4::). When deriving from a tagged type, as for any
-derived type, additional primitive subprograms may be defined, and
-inherited primitive subprograms may be overridden. The derived type is
-called an extension of its ancestor types, or simply a type extension.
+declaration is called a <tagged> type. In addition, an interface type
+is a tagged type, as is a task or protected type derived from an
+interface (see *note 3.9.4::). When deriving from a tagged type, as for
+any derived type, additional primitive subprograms may be defined, and
+inherited primitive subprograms may be overridden. The derived type is
+called an <extension> of its ancestor types, or simply a <type
+extension>.
2.1/2
-Every type extension is also a tagged type, and is a record extension or
-a private extension of some other tagged type, or a noninterface
+Every type extension is also a tagged type, and is a <record extension>
+or a <private extension> of some other tagged type, or a noninterface
synchronized tagged type (see *note 3.9.4::). A record extension is
defined by a derived_type_definition with a record_extension_part (see
*note 3.9.1::), which may include the definition of additional
@@ -7621,12 +7638,12 @@ visible part of a package (see *note 7.3::) or in a
generic formal part
(see *note 12.5.1::).
3
-An object of a tagged type has an associated (run-time) tag that
+An object of a tagged type has an associated (run-time) <tag> that
identifies the specific tagged type used to create the object
-originally. The tag of an operand of a class-wide tagged type T'Class
+originally. The tag of an operand of a class-wide tagged type <T>'Class
controls which subprogram body is to be executed when a primitive
-subprogram of type T is applied to the operand (see *note 3.9.2::);
-using a tag to control which body to execute is called dispatching.
+subprogram of type <T> is applied to the operand (see *note 3.9.2::);
+using a tag to control which body to execute is called <dispatching>.
4/2
The tag of a specific tagged type identifies the full_type_declaration
@@ -7681,7 +7698,7 @@ The following language-defined library package exists:
9
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Tags;
9.1/2
@@ -7735,7 +7752,7 @@ False.
12.3/3
For the purposes of the dynamic semantics of functions Descendant_Tag
-and Is_Descendant_At_Same_Level, a tagged type T2 is a descendant of a
+and Is_Descendant_At_Same_Level, a tagged type T2 is a <descendant> of a
type T1 if it is the same as T1, or if its parent type or one of its
progenitor types is a descendant of type T1 by this rule, even if at the
point of the declaration of T2, one of the derivations in the chain is
@@ -7759,24 +7776,24 @@ The function Is_Abstract returns True if the type whose
tag is T is
abstract, and False otherwise.
13
-For every subtype S of a tagged type T (specific or class-wide), the
+For every subtype S of a tagged type <T> (specific or class-wide), the
following attributes are defined:
14
S'Class
S'Class denotes a subtype of the class-wide type (called
- T'Class in this International Standard) for the class
- rooted at T (or if S already denotes a class-wide
+ <T>'Class in this International Standard) for the class
+ rooted at <T> (or if S already denotes a class-wide
subtype, then S'Class is the same as S).
15
S'Class is unconstrained. However, if S is constrained,
then the values of S'Class are only those that when
- converted to the type T belong to S.
+ converted to the type <T> belong to S.
16
S'Tag
- S'Tag denotes the tag of the type T (or if T is
+ S'Tag denotes the tag of the type <T> (or if <T> is
class-wide, the tag of the root type of the corresponding
class). The value of this attribute is of type Tag.
@@ -7818,11 +7835,11 @@ follows:
20
* The tag of a stand-alone object, a component, or an aggregate of a
- specific tagged type T identifies T.
+ specific tagged type <T> identifies <T>.
21
* The tag of an object created by an allocator for an access type
- with a specific designated tagged type T, identifies T.
+ with a specific designated tagged type <T>, identifies <T>.
22
* The tag of an object of a class-wide tagged type is that of its
@@ -7830,7 +7847,7 @@ follows:
23
* The tag of the result returned by a function whose result type is a
- specific tagged type T identifies T.
+ specific tagged type <T> identifies <T>.
24/2
* The tag of the result returned by a function with a class-wide
@@ -7900,12 +7917,12 @@ innermost master is a master of the point of the
function call.
30/2
73 The capability provided by Tags.Generic_Dispatching_Constructor
- is sometimes known as a factory.
+ is sometimes known as a <factory>.
_Examples_
31
-Examples of tagged record types:
+<Examples of tagged record types:>
32
type Point is tagged
@@ -7915,7 +7932,7 @@ Examples of tagged record types:
33
type Expression is tagged null record;
- -- Components will be added by each extension
+ --< Components will be added by each extension>
* Menu:
@@ -7931,8 +7948,8 @@ File: arm2012.info, Node: 3.9.1, Next: 3.9.2, Up: 3.9
---------------------
1/2
-Every type extension is a tagged type, and is a record extension or a
-private extension of some other tagged type, or a noninterface
+Every type extension is a tagged type, and is a <record extension> or a
+<private extension> of some other tagged type, or a noninterface
synchronized tagged type.
_Syntax_
@@ -7946,7 +7963,7 @@ synchronized tagged type.
The parent type of a record extension shall not be a class-wide type nor
shall it be a synchronized tagged type (see *note 3.9.4::). If the
parent type or any progenitor is nonlimited, then each of the components
-of the record_extension_part shall be nonlimited. In addition to the
+of the record_extension_part shall be nonlimited. In addition to the
places where Legality Rules normally apply (see *note 12.3::), these
rules apply also in the private part of an instance of a generic unit.
@@ -7958,7 +7975,7 @@ formal type declared within the formal part of the
generic unit.
_Static Semantics_
4.1/2
-A record extension is a null extension if its declaration has no
+A record extension is a <null extension> if its declaration has no
known_discriminant_part and its record_extension_part includes no
component_declarations.
@@ -8000,41 +8017,41 @@ of the record_definition.
_Examples_
10
-Examples of record extensions (of types defined above in *note 3.9::):
+<Examples of record extensions (of types defined above in *note 3.9::):>
11
type Painted_Point is new Point with
record
Paint : Color := White;
end record;
- -- Components X and Y are inherited
+ --< Components X and Y are inherited>
12
Origin : constant Painted_Point := (X | Y => 0.0, Paint => Black);
13
type Literal is new Expression with
- record -- a leaf in an Expression tree
+ record --< a leaf in an Expression tree>
Value : Real;
end record;
14
type Expr_Ptr is access all Expression'Class;
- -- see *note 3.10::
+ --< see *note 3.10::>
15
type Binary_Operation is new Expression with
- record -- an internal node in an Expression tree
+ record --< an internal node in an Expression tree>
Left, Right : Expr_Ptr;
end record;
16
type Addition is new Binary_Operation with null record;
type Subtraction is new Binary_Operation with null record;
- -- No additional components needed for these extensions
+ --< No additional components needed for these extensions>
17
- Tree : Expr_Ptr := -- A tree representation of "5.0 + (13.0-7.0)"
+ Tree : Expr_Ptr := --< A tree representation of "5.0 +
(13.0-7.0)">
new Addition'(
Left => new Literal'(Value => 5.0),
Right => new Subtraction'(
@@ -8052,39 +8069,40 @@ The primitive subprograms of a tagged type, the
subprograms declared by
formal_abstract_subprogram_declaration (*note 12.6: S0298.)s, and the
stream attributes of a specific tagged type that are available (see
*note 13.13.2::) at the end of the declaration list where the type is
-declared are called dispatching operations. A dispatching operation can
-be called using a statically determined controlling tag, in which case
-the body to be executed is determined at compile time. Alternatively,
-the controlling tag can be dynamically determined, in which case the
-call dispatches to a body that is determined at run time; such a call is
-termed a dispatching call. As explained below, the properties of the
-operands and the context of a particular call on a dispatching operation
-determine how the controlling tag is determined, and hence whether or
-not the call is a dispatching call. Run-time polymorphism is achieved
-when a dispatching operation is called by a dispatching call.
+declared are called <dispatching operations>. A dispatching operation
+can be called using a statically determined <controlling> tag, in which
+case the body to be executed is determined at compile time.
+Alternatively, the controlling tag can be dynamically determined, in
+which case the call <dispatches> to a body that is determined at run
+time; such a call is termed a <dispatching call>. As explained below,
+the properties of the operands and the context of a particular call on a
+dispatching operation determine how the controlling tag is determined,
+and hence whether or not the call is a dispatching call. Run-time
+polymorphism is achieved when a dispatching operation is called by a
+dispatching call.
_Static Semantics_
2/3
-A call on a dispatching operation is a call whose name or prefix denotes
-the declaration of a dispatching operation. A controlling operand in a
-call on a dispatching operation of a tagged type T is one whose
-corresponding formal parameter is of type T or is of an anonymous access
-type with designated type T; the corresponding formal parameter is
-called a controlling formal parameter. If the controlling formal
-parameter is an access parameter, the controlling operand is the object
-designated by the actual parameter, rather than the actual parameter
-itself. If the call is to a (primitive) function with result type T (a
-function with a controlling result), then the call has a controlling
-result -- the context of the call can control the dispatching.
-Similarly, if the call is to a function with an access result type
-designating T (a function with a controlling access result), then the
-call has a controlling access result, and the context can similarly
-control dispatching.
+A <call on a dispatching operation> is a call whose name or prefix
+denotes the declaration of a dispatching operation. A <controlling
+operand> in a call on a dispatching operation of a tagged type <T> is
+one whose corresponding formal parameter is of type <T> or is of an
+anonymous access type with designated type <T>; the corresponding formal
+parameter is called a <controlling formal parameter>. If the
+controlling formal parameter is an access parameter, the controlling
+operand is the object designated by the actual parameter, rather than
+the actual parameter itself. If the call is to a (primitive) function
+with result type <T> (a <function with a controlling result>), then the
+call has a <controlling result> -- the context of the call can control
+the dispatching. Similarly, if the call is to a function with an access
+result type designating <T> (a <function with a controlling access
+result>), then the call has a <controlling access result>, and the
+context can similarly control dispatching.
3
-A name or expression of a tagged type is either statically tagged,
-dynamically tagged, or tag indeterminate, according to whether, when
+A name or expression of a tagged type is either <statically> tagged,
+<dynamically> tagged, or <tag indeterminate>, according to whether, when
used as a controlling operand, the tag that controls dispatching is
determined statically by the operand's (specific) type, dynamically by
its tag at run time, or from context. A qualified_expression or
@@ -8093,20 +8111,20 @@ tagged according to its operand. For other kinds of
names and
expressions, this is determined as follows:
4/2
- * The name or expression is statically tagged if it is of a specific
- tagged type and, if it is a call with a controlling result or
- controlling access result, it has at least one statically tagged
+ * The name or expression is <statically tagged> if it is of a
+ specific tagged type and, if it is a call with a controlling result
+ or controlling access result, it has at least one statically tagged
controlling operand;
5/2
- * The name or expression is dynamically tagged if it is of a
+ * The name or expression is <dynamically tagged> if it is of a
class-wide type, or it is a call with a controlling result or
controlling access result and at least one dynamically tagged
controlling operand;
6/2
- * The name or expression is tag indeterminate if it is a call with a
- controlling result or controlling access result, all of whose
+ * The name or expression is <tag indeterminate> if it is a call with
+ a controlling result or controlling access result, all of whose
controlling operands (if any) are tag indeterminate.
7/1
@@ -8140,9 +8158,9 @@ operand in a call on a dispatching operation.
In the declaration of a dispatching operation of a tagged type,
everywhere a subtype of the tagged type appears as a subtype of the
profile (see *note 6.1::), it shall statically match the first subtype
-of the tagged type. If the dispatching operation overrides an inherited
+of the tagged type. If the dispatching operation overrides an inherited
subprogram, it shall be subtype conformant with the inherited
-subprogram. The convention of an inherited dispatching operation is the
+subprogram. The convention of an inherited dispatching operation is the
convention of the corresponding primitive operation of the parent or
progenitor type. The default convention of a dispatching operation that
overrides an inherited primitive operation is the convention of the
@@ -8175,26 +8193,28 @@ a body.
_Dynamic Semantics_
14
-For the execution of a call on a dispatching operation of a type T, the
-controlling tag value determines which subprogram body is executed. The
-controlling tag value is defined as follows:
+For the execution of a call on a dispatching operation of a type <T>,
+the <controlling tag value> determines which subprogram body is
+executed. The controlling tag value is defined as follows:
15
* If one or more controlling operands are statically tagged, then the
- controlling tag value is statically determined to be the tag of T.
+ controlling tag value is <statically determined> to be the tag of
+ <T>.
16
* If one or more controlling operands are dynamically tagged, then
the controlling tag value is not statically determined, but is
- rather determined by the tags of the controlling operands. If there
- is more than one dynamically tagged controlling operand, a check is
- made that they all have the same tag. If this check fails,
- Constraint_Error is raised unless the call is a function_call whose
- name denotes the declaration of an equality operator (predefined or
- user defined) that returns Boolean, in which case the result of the
- call is defined to indicate inequality, and no subprogram_body is
- executed. This check is performed prior to evaluating any
- tag-indeterminate controlling operands.
+ rather determined by the tags of the controlling operands. If
+ there is more than one dynamically tagged controlling operand, a
+ check is made that they all have the same tag. If this check
+ fails, Constraint_Error is raised unless the call is a
+ function_call whose name denotes the declaration of an equality
+ operator (predefined or user defined) that returns Boolean, in
+ which case the result of the call is defined to indicate
+ inequality, and no subprogram_body is executed. This check is
+ performed prior to evaluating any tag-indeterminate controlling
+ operands.
17/2
* If all of the controlling operands (if any) are tag-indeterminate,
@@ -8205,7 +8225,7 @@ controlling tag value is defined as follows:
access result and is itself, or designates, a (possibly
parenthesized or qualified) controlling operand of an
enclosing call on a dispatching operation of a descendant
- of type T, then its controlling tag value is determined
+ of type <T>, then its controlling tag value is determined
by the controlling tag value of this enclosing call;
18.1/2
@@ -8218,7 +8238,7 @@ controlling tag value is defined as follows:
19
* Otherwise, the controlling tag value is statically
- determined to be the tag of type T.
+ determined to be the tag of type <T>.
20/3
For the execution of a call on a dispatching operation, the action
@@ -8288,10 +8308,10 @@ File: arm2012.info, Node: 3.9.3, Next: 3.9.4, Prev:
3.9.2, Up: 3.9
------------------------------------
1/2
-An abstract type is a tagged type intended for use as an ancestor of
-other types, but which is not allowed to have objects of its own. An
-abstract subprogram is a subprogram that has no body, but is intended to
-be overridden at some point when inherited. Because objects of an
+An <abstract type> is a tagged type intended for use as an ancestor of
+other types, but which is not allowed to have objects of its own. An
+<abstract subprogram> is a subprogram that has no body, but is intended
+to be overridden at some point when inherited. Because objects of an
abstract type cannot be created, a dispatching call to an abstract
subprogram always dispatches to some overriding body.
@@ -8320,7 +8340,7 @@ declaration.
3/2
A subprogram declared by an abstract_subprogram_declaration (*note
3.9.3: S0076.) or a formal_abstract_subprogram_declaration (*note 12.6:
-S0298.) (see *note 12.6::) is an abstract subprogram. If it is a
+S0298.) (see *note 12.6::) is an <abstract subprogram>. If it is a
primitive subprogram of a tagged type, then the tagged type shall be
abstract.
@@ -8333,7 +8353,7 @@ null extension inherits a function with a controlling
result, then:
5/2
* If the type is abstract or untagged, the implicitly declared
- subprogram is abstract.
+ subprogram is <abstract>.
6/4
* Otherwise, the subprogram shall be overridden with a nonabstract
@@ -8341,7 +8361,7 @@ null extension inherits a function with a controlling
result, then:
nonabstract function with a controlling result, have a full type
that is a null extension; for a type declared in the visible part
of a package, the overriding may be either in the visible or the
- private part. Such a subprogram is said to require overriding.
+ private part. Such a subprogram is said to <require overriding>.
However, if the type is a generic formal type, the subprogram need
not be overridden for the formal type itself; a nonabstract version
will necessarily be provided by the actual type.
@@ -8407,7 +8427,7 @@ The elaboration of an abstract_subprogram_declaration has
no effect.
_Examples_
14
-Example of an abstract type representing a set of natural numbers:
+<Example of an abstract type representing a set of natural numbers:>
15
package Sets is
@@ -8424,8 +8444,8 @@ Example of an abstract type representing a set of natural
numbers:
NOTES
16
- 84 Notes on the example: Given the above abstract type, one could
- then derive various (nonabstract) extensions of the type,
+ 84 <Notes on the example:> Given the above abstract type, one
+ could then derive various (nonabstract) extensions of the type,
representing alternative implementations of a set. One might use a
bit vector, but impose an upper bound on the largest element
representable, while another might use a hash table, trading off
@@ -8450,26 +8470,26 @@ type may have one or more interface types as ancestors.
interface_list]
3/2
- interface_list ::= interface_subtype_mark {and interface_
+ interface_list ::= <interface_>subtype_mark {and <interface_>
subtype_mark}
_Static Semantics_
4/2
-An interface type (also called an interface) is a specific abstract
+An interface type (also called an <interface>) is a specific abstract
tagged type that is defined by an interface_type_definition.
5/2
An interface with the reserved word limited, task, protected, or
-synchronized in its definition is termed, respectively, a limited
-interface, a task interface, a protected interface, or a synchronized
-interface. In addition, all task and protected interfaces are
-synchronized interfaces, and all synchronized interfaces are limited
-interfaces.
+synchronized in its definition is termed, respectively, a <limited
+interface>, a <task interface>, a <protected interface>, or a
+<synchronized interface>. In addition, all task and protected
+interfaces are synchronized interfaces, and all synchronized interfaces
+are limited interfaces.
6/2
A task or protected type derived from an interface is a tagged type.
-Such a tagged type is called a synchronized tagged type, as are
+Such a tagged type is called a <synchronized> tagged type, as are
synchronized interfaces and private extensions whose declaration
includes the reserved word synchronized.
@@ -8481,8 +8501,8 @@ abstract protected type.
An interface type has no components.
9/2
-An interface_subtype_mark in an interface_list names a progenitor
-subtype; its type is the progenitor type. An interface type inherits
+An <interface_>subtype_mark in an interface_list names a <progenitor
+subtype>; its type is the <progenitor type>. An interface type inherits
user-defined primitive subprograms from each progenitor type in the same
way that a derived type inherits user-defined primitive subprograms from
its progenitor types (see *note 3.4::).
@@ -8545,8 +8565,8 @@ type and its first subtype.
_Examples_
20/2
-Example of a limited interface and a synchronized interface extending
-it:
+<Example of a limited interface and a synchronized interface extending
+it:>
21/2
type Queue is limited interface;
@@ -8555,15 +8575,15 @@ it:
Person : out Person_Name) is abstract;
function Cur_Count(Q : in Queue) return Natural is abstract;
function Max_Count(Q : in Queue) return Natural is abstract;
- -- See *note 3.10.1:: for Person_Name.
+ -- <See *note 3.10.1:: for Person_Name.>
22/3
Queue_Error : exception;
- -- Append raises Queue_Error if Cur_Count(Q) = Max_Count(Q)
- -- Remove_First raises Queue_Error if Cur_Count(Q) = 0
+ --< Append raises Queue_Error if Cur_Count(Q) = Max_Count(Q)>
+ --< Remove_First raises Queue_Error if Cur_Count(Q) = 0>
23/2
- type Synchronized_Queue is synchronized interface and Queue; -- see *note
9.11::
+ type Synchronized_Queue is synchronized interface and Queue; --< see
*note 9.11::>
procedure Append_Wait(Q : in out Synchronized_Queue;
Person : in Person_Name) is abstract;
procedure Remove_First_Wait(Q : in out Synchronized_Queue;
@@ -8604,7 +8624,7 @@ This synchronized interface may only be implemented by a
task or
protected type, and as such ensures safe concurrent access.
28/2
-Example use of the interface:
+<Example use of the interface:>
29/3
type Fast_Food_Queue is new Queue with record ...;
@@ -8621,9 +8641,9 @@ Example use of the interface:
32/2
...
- -- Add George (see *note 3.10.1::) to the cashier's queue:
+ -- <Add George (see *note 3.10.1::) to the cashier's queue:>
Append (Cashier, George);
- -- After payment, move George to the sandwich counter queue:
+ -- <After payment, move George to the sandwich counter queue:>
Transfer (Cashier, Counter);
...
@@ -8636,10 +8656,10 @@ must be provided. Inside the call of Transfer, calls
will dispatch to
the implementations of Append and Remove_First for type Fast_Food_Queue.
34/2
-Example of a task interface:
+<Example of a task interface:>
35/2
- type Serial_Device is task interface; -- see *note 9.1::
+ type Serial_Device is task interface; --< see *note 9.1::>
procedure Read (Dev : in Serial_Device; C : out Character) is abstract;
procedure Write(Dev : in Serial_Device; C : in Character) is abstract;
@@ -8654,11 +8674,11 @@ File: arm2012.info, Node: 3.10, Next: 3.11, Prev:
3.9, Up: 3
=================
1
-A value of an access type (an access value) provides indirect access to
-the object or subprogram it designates. Depending on its type, an
+A value of an access type (an <access value>) provides indirect access
+to the object or subprogram it <designates>. Depending on its type, an
access value can designate either subprograms, objects created by
-allocators (see *note 4.8::), or more generally aliased objects of an
-appropriate type.
+allocators (see *note 4.8::), or more generally <aliased> objects of an
+appropriate type.
_Syntax_
@@ -8692,25 +8712,26 @@ appropriate type.
_Static Semantics_
7/1
-There are two kinds of access types, access-to-object types, whose
-values designate objects, and access-to-subprogram types, whose values
-designate subprograms. Associated with an access-to-object type is a
-storage pool; several access types may share the same storage pool. All
-descendants of an access type share the same storage pool. A storage
-pool is an area of storage used to hold dynamically allocated objects
-(called pool elements) created by allocators; storage pools are
-described further in *note 13.11::, "*note 13.11:: Storage Management".
+There are two kinds of access types, <access-to-object> types, whose
+values designate objects, and <access-to-subprogram> types, whose values
+designate subprograms. Associated with an access-to-object type is a
+<storage pool>; several access types may share the same storage pool.
+All descendants of an access type share the same storage pool. A
+storage pool is an area of storage used to hold dynamically allocated
+objects (called <pool elements>) created by allocators; storage pools
+are described further in *note 13.11::, "*note 13.11:: Storage
+Management".
8
-Access-to-object types are further subdivided into pool-specific access
-types, whose values can designate only the elements of their associated
-storage pool, and general access types, whose values can designate the
-elements of any storage pool, as well as aliased objects created by
-declarations rather than allocators, and aliased subcomponents of other
-objects.
+Access-to-object types are further subdivided into <pool-specific>
+access types, whose values can designate only the elements of their
+associated storage pool, and <general> access types, whose values can
+designate the elements of any storage pool, as well as aliased objects
+created by declarations rather than allocators, and aliased
+subcomponents of other objects.
9/3
-A view of an object is defined to be aliased if it is defined by an
+A view of an object is defined to be <aliased> if it is defined by an
object_declaration (*note 3.3.1: S0032.), component_definition (*note
3.6: S0056.), parameter_specification (*note 6.1: S0175.), or
extended_return_object_declaration with the reserved word aliased, or by
@@ -8725,13 +8746,13 @@ designated by an access value.
10
An access_to_object_definition defines an access-to-object type and its
first subtype; the subtype_indication (*note 3.2.2: S0027.) defines the
-designated subtype of the access type. If a general_access_modifier
+<designated subtype> of the access type. If a general_access_modifier
(*note 3.10: S0081.) appears, then the access type is a general access
-type. If the modifier is the reserved word constant, then the type is an
-access-to-constant type; a designated object cannot be updated through a
-value of such a type. If the modifier is the reserved word all, then the
-type is an access-to-variable type; a designated object can be both read
-and updated through a value of such a type. If no
+type. If the modifier is the reserved word constant, then the type is
+an <access-to-constant type>; a designated object cannot be updated
+through a value of such a type. If the modifier is the reserved word
+all, then the type is an <access-to-variable type>; a designated object
+can be both read and updated through a value of such a type. If no
general_access_modifier (*note 3.10: S0081.) appears in the
access_to_object_definition (*note 3.10: S0080.), the access type is a
pool-specific access-to-variable type.
@@ -8739,22 +8760,22 @@ pool-specific access-to-variable type.
11
An access_to_subprogram_definition defines an access-to-subprogram type
and its first subtype; the parameter_profile or
-parameter_and_result_profile defines the designated profile of the
-access type. There is a calling convention associated with the
+parameter_and_result_profile defines the <designated profile> of the
+access type. There is a <calling convention> associated with the
designated profile; only subprograms with this calling convention can be
designated by values of the access type. By default, the calling
-convention is "protected" if the reserved word protected appears, and
+convention is "<protected>" if the reserved word protected appears, and
"Ada" otherwise. See *note Annex B:: for how to override this default.
12/3
An access_definition defines an anonymous general access type or an
anonymous access-to-subprogram type. For a general access type, the
-subtype_mark denotes its designated subtype; if the
+subtype_mark denotes its <designated subtype>; if the
general_access_modifier (*note 3.10: S0081.) constant appears, the type
is an access-to-constant type; otherwise, it is an access-to-variable
type. For an access-to-subprogram type, the parameter_profile (*note
6.1: S0172.) or parameter_and_result_profile (*note 6.1: S0173.) denotes
-its designated profile.
+its <designated profile>.
13/2
For each access type, there is a null access value designating no entity
@@ -8772,12 +8793,12 @@ attribute of a nonintrinsic subprogram.
13.1/2
A null_exclusion in a construct specifies that the null value does not
belong to the access subtype defined by the construct, that is, the
-access subtype excludes null. In addition, the anonymous access subtype
-defined by the access_definition for a controlling access parameter (see
-*note 3.9.2::) excludes null. Finally, for a subtype_indication without
-a null_exclusion, the subtype denoted by the subtype_indication excludes
-null if and only if the subtype denoted by the subtype_mark in the
-subtype_indication excludes null.
+access subtype <excludes null>. In addition, the anonymous access
+subtype defined by the access_definition for a controlling access
+parameter (see *note 3.9.2::) excludes null. Finally, for a
+subtype_indication without a null_exclusion, the subtype denoted by the
+subtype_indication excludes null if and only if the subtype denoted by
+the subtype_mark in the subtype_indication excludes null.
14/3
All subtypes of an access-to-subprogram type are constrained. The first
@@ -8800,10 +8821,10 @@ construct shall denote an access subtype that does not
exclude null.
_Dynamic Semantics_
15/2
-A composite_constraint is compatible with an unconstrained access
+A composite_constraint is <compatible> with an unconstrained access
subtype if it is compatible with the designated subtype. A
null_exclusion is compatible with any access subtype that does not
-exclude null. An access value satisfies a composite_constraint of an
+exclude null. An access value <satisfies> a composite_constraint of an
access subtype if it equals the null value of its type or if it
designates an object whose value satisfies the constraint. An access
value satisfies an exclusion of the null value if it does not equal the
@@ -8840,22 +8861,22 @@ type.
_Examples_
21
-Examples of access-to-object types:
+<Examples of access-to-object types:>
22/4
- type Frame is access Matrix; -- see *note 3.6::
- type Peripheral_Ref is not null access Peripheral; -- see *note 3.8.1::
+ type Frame is access Matrix; --< see *note 3.6::>
+ type Peripheral_Ref is not null access Peripheral; --< see *note
3.8.1::>
type Binop_Ptr is access all Binary_Operation'Class;
- -- general
access-to-class-wide, see *note 3.9.1::
+ --< general
access-to-class-wide, see *note 3.9.1::>
23
-Example of an access subtype:
+<Example of an access subtype:>
24
- subtype Drum_Ref is Peripheral_Ref(Drum); -- see *note 3.8.1::
+ subtype Drum_Ref is Peripheral_Ref(Drum); --< see *note 3.8.1::>
25
-Example of an access-to-subprogram type:
+<Example of an access-to-subprogram type:>
26
type Message_Procedure is access procedure (M : in String := "Error!");
@@ -8866,8 +8887,8 @@ Example of an access-to-subprogram type:
...
Give_Message := Other_Procedure'Access;
...
- Give_Message("File not found."); -- call with parameter (.all is
optional)
- Give_Message.all; -- call with no parameters
+ Give_Message("File not found."); --< call with parameter (.all is
optional)>
+ Give_Message.all; --< call with no parameters>
* Menu:
@@ -8898,40 +8919,41 @@ subsequent full_type_declaration.
_Static Semantics_
2.1/4
-An incomplete_type_declaration declares an incomplete view of a type and
-its first subtype; the first subtype is unconstrained if a
+An incomplete_type_declaration declares an <incomplete view> of a type
+and its first subtype; the first subtype is unconstrained if a
discriminant_part appears. If the incomplete_type_declaration (*note
-3.10.1: S0085.) includes the reserved word tagged, it declares a tagged
-incomplete view. If T denotes a tagged incomplete view, then T'Class
-denotes a tagged incomplete view. An incomplete view of a type is a
-limited view of the type (see *note 7.5::).
+3.10.1: S0085.) includes the reserved word tagged, it declares a <tagged
+incomplete view>. If <T> denotes a tagged incomplete view, then
+<T>'Class denotes a tagged incomplete view. An incomplete view of a
+type is a limited view of the type (see *note 7.5::).
2.2/2
-Given an access type A whose designated type T is an incomplete view, a
-dereference of a value of type A also has this incomplete view except
-when:
+Given an access type <A> whose designated type <T> is an incomplete
+view, a dereference of a value of type <A> also has this incomplete view
+except when:
2.3/2
- * it occurs within the immediate scope of the completion of T, or
+ * it occurs within the immediate scope of the completion of <T>, or
2.4/3
* it occurs within the scope of a nonlimited_with_clause that
mentions a library package in whose visible part the completion of
- T is declared, or
+ <T> is declared, or
2.5/3
- * it occurs within the scope of the completion of T and T is an
+ * it occurs within the scope of the completion of <T> and <T> is an
incomplete view declared by an incomplete_type_declaration.
2.6/3
-In these cases, the dereference has the view of T visible at the point
+In these cases, the dereference has the view of <T> visible at the point
of the dereference.
2.7/3
Similarly, if a subtype_mark denotes a subtype_declaration defining a
-subtype of an incomplete view T, the subtype_mark denotes an incomplete
-view except under the same three circumstances given above, in which
-case it denotes the view of T visible at the point of the subtype_mark.
+subtype of an incomplete view <T>, the subtype_mark denotes an
+incomplete view except under the same three circumstances given above,
+in which case it denotes the view of <T> visible at the point of the
+subtype_mark.
_Legality Rules_
@@ -8959,7 +8981,7 @@ incomplete_type_declaration (*note 3.10.1: S0085.) has a
known_discriminant_part (*note 3.7: S0061.), then a type_declaration
(*note 3.2.1: S0023.) that completes it shall have a fully conforming
(explicit) known_discriminant_part (*note 3.7: S0061.) (see *note
-6.3.1::). If an incomplete_type_declaration (*note 3.10.1: S0085.) has
+6.3.1::). If an incomplete_type_declaration (*note 3.10.1: S0085.) has
no discriminant_part (or an unknown_discriminant_part (*note 3.7:
S0060.)), then a corresponding type_declaration (*note 3.2.1: S0023.) is
nevertheless allowed to have discriminants, either explicitly, or
@@ -9006,10 +9028,10 @@ If such a name denotes a tagged incomplete view, it may
also be used:
tagged incomplete view.
9.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
9.2/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
9.3/2
If any of the above uses occurs as part of the declaration of a
@@ -9029,7 +9051,7 @@ The result object of a function call shall not be of an
incomplete view.
A prefix shall not denote a subprogram having a formal parameter of an
untagged incomplete view, nor a return type that is an incomplete view.
-Paragraph 11 was deleted.
+<Paragraph 11 was deleted.>
_Dynamic Semantics_
@@ -9053,10 +9075,10 @@ The elaboration of an incomplete_type_declaration has
no effect.
_Examples_
14
-Example of a recursive type:
+<Example of a recursive type:>
15
- type Cell; -- incomplete type declaration
+ type Cell; --< incomplete type declaration>
type Link is access Cell;
16
@@ -9072,11 +9094,11 @@ Example of a recursive type:
Next : Link := Head.Succ;
18
-Examples of mutually dependent access types:
+<Examples of mutually dependent access types:>
19/2
- type Person(<>); -- incomplete type declaration
- type Car is tagged; -- incomplete type declaration
+ type Person(<>); --< incomplete type declaration>
+ type Car is tagged; --< incomplete type declaration>
20/2
type Person_Name is access Person;
@@ -9103,7 +9125,7 @@ Examples of mutually dependent access types:
end record;
23
- My_Car, Your_Car, Next_Car : Car_Name := new Car; -- see *note 4.8::
+ My_Car, Your_Car, Next_Car : Car_Name := new Car; --< see *note 4.8::>
George : Person_Name := new Person(M);
...
George.Vehicle := Your_Car;
@@ -9125,32 +9147,32 @@ features -- see Clause *note 13::).
2/2
For an attribute_reference with attribute_designator Access (or
Unchecked_Access -- see *note 13.10::), the expected type shall be a
-single access type A such that:
+single access type <A> such that:
2.1/2
- * A is an access-to-object type with designated type D and the type
- of the prefix is D'Class or is covered by D, or
+ * <A> is an access-to-object type with designated type <D> and the
+ type of the prefix is <D>'Class or is covered by <D>, or
2.2/2
- * A is an access-to-subprogram type whose designated profile is type
- conformant with that of the prefix.
+ * <A> is an access-to-subprogram type whose designated profile is
+ type conformant with that of the prefix.
2.3/2
The prefix of such an attribute_reference is never interpreted as an
implicit_dereference or a parameterless function_call (see *note
-4.1.4::). The designated type or profile of the expected type of the
+4.1.4::). The designated type or profile of the expected type of the
attribute_reference is the expected type or profile for the prefix.
_Static Semantics_
3/2
The accessibility rules, which prevent dangling references, are written
-in terms of accessibility levels, which reflect the run-time nesting of
-masters. As explained in *note 7.6.1::, a master is the execution of a
-certain construct, such as a subprogram_body. An accessibility level is
-deeper than another if it is more deeply nested at run time. For
-example, an object declared local to a called subprogram has a deeper
-accessibility level than an object declared local to the calling
+in terms of <accessibility levels>, which reflect the run-time nesting
+of <masters>. As explained in *note 7.6.1::, a master is the execution
+of a certain construct, such as a subprogram_body. An accessibility
+level is <deeper than> another if it is more deeply nested at run time.
+For example, an object declared local to a called subprogram has a
+deeper accessibility level than an object declared local to the calling
subprogram. The accessibility rules for access types require that the
accessibility level of an object designated by an access value be no
deeper than that of the access type. This ensures that the object will
@@ -9160,9 +9182,9 @@ The Unchecked_Access attribute may be used to circumvent
the
accessibility rules.
4
-A given accessibility level is said to be statically deeper than another
-if the given level is known at compile time (as defined below) to be
-deeper than the other for all possible executions. In most cases,
+A given accessibility level is said to be <statically deeper> than
+another if the given level is known at compile time (as defined below)
+to be deeper than the other for all possible executions. In most cases,
accessibility is enforced at compile time by Legality Rules. Run-time
accessibility checks are also used, since the Legality Rules do not
cover certain cases involving access parameters and generic packages.
@@ -9197,7 +9219,7 @@ accessibility level:
9.1/3
* The accessibility level of a conditional_expression is the
- accessibility level of the evaluated dependent_expression.
+ accessibility level of the evaluated <dependent_>expression.
10/4
* The accessibility level of an aggregate that is used (in its
@@ -9209,7 +9231,7 @@ accessibility level:
10.1/3
* The accessibility level of the result of a function call is that of
- the master of the function call, which is determined by the point
+ the <master of the function call>, which is determined by the point
of call as follows:
10.2/3
@@ -9336,19 +9358,19 @@ accessibility level:
14/3
* The accessibility level of an object created by an allocator is the
same as that of the access type, except for an allocator of an
- anonymous access type (an anonymous allocator) in certain contexts,
- as follows: For an anonymous allocator that defines the result of a
- function with an access result, the accessibility level is
- determined as though the allocator were in place of the call of the
- function; in the special case of a call that is the operand of a
- type conversion, the level is that of the target access type of the
- conversion. For an anonymous allocator defining the value of an
- access parameter, the accessibility level is that of the innermost
- master of the call. For an anonymous allocator whose type is that
- of a stand-alone object of an anonymous access-to-object type, the
- accessibility level is that of the declaration of the stand-alone
- object. For one defining an access discriminant, the accessibility
- level is determined as follows:
+ anonymous access type (an <anonymous allocator>) in certain
+ contexts, as follows: For an anonymous allocator that defines the
+ result of a function with an access result, the accessibility level
+ is determined as though the allocator were in place of the call of
+ the function; in the special case of a call that is the operand of
+ a type conversion, the level is that of the target access type of
+ the conversion. For an anonymous allocator defining the value of
+ an access parameter, the accessibility level is that of the
+ innermost master of the call. For an anonymous allocator whose
+ type is that of a stand-alone object of an anonymous
+ access-to-object type, the accessibility level is that of the
+ declaration of the stand-alone object. For one defining an access
+ discriminant, the accessibility level is determined as follows:
14.1/3
* for an allocator used to define the discriminant of an
@@ -9360,21 +9382,21 @@ accessibility level:
master that elaborates the subtype_indication.
14.3/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
14.4/3
- In the first case, the allocated object is said to be a coextension
- of the object whose discriminant designates it, as well as of any
- object of which the discriminated object is itself a coextension or
- subcomponent. If the allocated object is a coextension of an
- anonymous object representing the result of an aggregate or
- function call that is used (in its entirety) to directly initialize
- a part of an object, after the result is assigned, the coextension
- becomes a coextension of the object being initialized and is no
- longer considered a coextension of the anonymous object. All
- coextensions of an object (which have not thus been transfered by
- such an initialization) are finalized when the object is finalized
- (see *note 7.6.1::).
+ In the first case, the allocated object is said to be a
+ <coextension> of the object whose discriminant designates it, as
+ well as of any object of which the discriminated object is itself a
+ coextension or subcomponent. If the allocated object is a
+ coextension of an anonymous object representing the result of an
+ aggregate or function call that is used (in its entirety) to
+ directly initialize a part of an object, after the result is
+ assigned, the coextension becomes a coextension of the object being
+ initialized and is no longer considered a coextension of the
+ anonymous object. All coextensions of an object (which have not
+ thus been transfered by such an initialization) are finalized when
+ the object is finalized (see *note 7.6.1::).
14.5/3
* Within a return statement, the accessibility level of the anonymous
@@ -9394,13 +9416,13 @@ accessibility level:
In the above rules, the operand of a view conversion, parenthesized
expression or qualified_expression is considered to be used in a context
if the view conversion, parenthesized expression or qualified_expression
-itself is used in that context. Similarly, a dependent_expression of a
-conditional_expression is considered to be used in a context if the
+itself is used in that context. Similarly, a <dependent_>expression of
+a conditional_expression is considered to be used in a context if the
conditional_expression itself is used in that context.
17
-One accessibility level is defined to be statically deeper than another
-in the following cases:
+One accessibility level is defined to be <statically deeper> than
+another in the following cases:
18
* For a master that is statically nested within another master, the
@@ -9430,25 +9452,25 @@ in the following cases:
19.2/4
* Inside a return statement that applies to a function or generic
- function F, or the return expression of an expression function F,
- when determining whether the accessibility level of an explicitly
- aliased parameter of F is statically deeper than the level of the
- return object of F, the level of the return object is considered to
- be the same as that of the level of the explicitly aliased
- parameter; for statically comparing with the level of other
- entities, an explicitly aliased parameter of F is considered to
- have the accessibility level of the body of F.
+ function <F>, or the return expression of an expression function
+ <F>, when determining whether the accessibility level of an
+ explicitly aliased parameter of <F> is statically deeper than the
+ level of the return object of <F>, the level of the return object
+ is considered to be the same as that of the level of the explicitly
+ aliased parameter; for statically comparing with the level of other
+ entities, an explicitly aliased parameter of <F> is considered to
+ have the accessibility level of the body of <F>.
19.3/4
* For determining whether a level is statically deeper than the level
of the anonymous access type of an access result of a function or
- generic function F, when within a return statement that applies to
- F or the return expression of expression function F, the level of
- the master of the call is presumed to be the same as that of the
- level of the master that elaborated the body of F.
+ generic function <F>, when within a return statement that applies
+ to <F> or the return expression of expression function <F>, the
+ level of the master of the call is presumed to be the same as that
+ of the level of the master that elaborated the body of <F>.
20
- * or generic function F
+ * or generic function <F>
21
* For determining whether one level is statically deeper than another
@@ -9464,8 +9486,8 @@ in the following cases:
a deeper level than that of the type.
23
-The accessibility level of all library units is called the library
-level; a library-level declaration or entity is one whose accessibility
+The accessibility level of all library units is called the <library
+level>; a library-level declaration or entity is one whose accessibility
level is the library level.
24
@@ -9477,19 +9499,18 @@ X'Access
X'Access yields an access value that designates the
object denoted by X. The type of X'Access is an
access-to-object type, as determined by the expected
- type. The expected type shall be a general access type.
- X shall denote an aliased view of an object, including
+ type. The expected type shall be a general access type.
X shall denote an aliased view of an object, including
possibly the current instance (see *note 8.6::) of a
limited type within its definition, or a formal parameter
or generic formal object of a tagged type. The view
denoted by the prefix X shall satisfy the following
additional requirements, presuming the expected type for
- X'Access is the general access type A with designated
- type D:
+ X'Access is the general access type <A> with designated
+ type <D>:
26
- * If A is an access-to-variable type, then the view
- shall be a variable; on the other hand, if A is an
+ * If <A> is an access-to-variable type, then the view
+ shall be a variable; on the other hand, if <A> is an
access-to-constant type, the view may be either a
constant or a variable.
@@ -9499,27 +9520,27 @@ X'Access
known to be constrained.
28/2
- * If A is a named access type and D is a tagged type,
- then the type of the view shall be covered by D; if
- A is anonymous and D is tagged, then the type of the
- view shall be either D'Class or a type covered by D;
- if D is untagged, then the type of the view shall be
- D, and either:
+ * If <A> is a named access type and <D> is a tagged
+ type, then the type of the view shall be covered by
+ <D>; if <A> is anonymous and <D> is tagged, then the
+ type of the view shall be either <D>'Class or a type
+ covered by <D>; if <D> is untagged, then the type of
+ the view shall be <D>, and either:
28.1/2
- * the designated subtype of A shall
+ * the designated subtype of <A> shall
statically match the nominal subtype of
the view; or
28.2/4
- * D shall be discriminated in its full view
- and unconstrained in any partial view, and
- the designated subtype of A shall be
- unconstrained.
+ * <D> shall be discriminated in its full
+ view and unconstrained in any partial
+ view, and the designated subtype of <A>
+ shall be unconstrained.
29/3
* The accessibility level of the view shall not be
- statically deeper than that of the access type A.
+ statically deeper than that of the access type <A>.
29.1/3
In addition to the places where Legality Rules normally
@@ -9528,12 +9549,12 @@ X'Access
30
A check is made that the accessibility level of X is not
- deeper than that of the access type A. If this check
+ deeper than that of the access type <A>. If this check
fails, Program_Error is raised.
31
If the nominal subtype of X does not statically match the
- designated subtype of A, a view conversion of X to the
+ designated subtype of <A>, a view conversion of X to the
designated subtype is evaluated (which might raise
Constraint_Error -- see *note 4.6::) and the value of
X'Access designates that view.
@@ -9546,26 +9567,26 @@ subprogram:
P'Access
P'Access yields an access value that designates the
subprogram denoted by P. The type of P'Access is an
- access-to-subprogram type (S), as determined by the
- expected type. The accessibility level of P shall not be
- statically deeper than that of S. In addition to the
+ access-to-subprogram type (<S>), as determined by the
+ expected type. The accessibility level of P shall not be
+ statically deeper than that of <S>. In addition to the
places where Legality Rules normally apply (see *note
12.3::), this rule applies also in the private part of an
instance of a generic unit. The profile of P shall be
- subtype conformant with the designated profile of S, and
- shall not be Intrinsic. If the subprogram denoted by P is
- declared within a generic unit, and the expression
+ subtype conformant with the designated profile of <S>,
+ and shall not be Intrinsic. If the subprogram denoted by
+ P is declared within a generic unit, and the expression
P'Access occurs within the body of that generic unit or
within the body of a generic unit declared within the
declarative region of the generic unit, then the ultimate
- ancestor of S shall be either a nonformal type declared
+ ancestor of <S> shall be either a nonformal type declared
within the generic unit or an anonymous access type of an
access parameter.
_Legality Rules_
33.1/3
-An expression is said to have distributed accessibility if it is
+An expression is said to have <distributed accessibility> if it is
33.2/3
* a conditional_expression (see *note 4.5.7::); or
@@ -9583,8 +9604,8 @@ statically shallower, than any other.
33.5/3
Any static accessibility requirement that is imposed on an expression
that has distributed accessibility (or on its type) is instead imposed
-on the dependent_expressions of the underlying conditional_expression.
-This rule is applied recursively if a dependent_expression also has
+on the <dependent_>expressions of the underlying conditional_expression.
+This rule is applied recursively if a <dependent_>expression also has
distributed accessibility.
NOTES
@@ -9604,9 +9625,9 @@ distributed accessibility.
Explicit conversion is allowed between general access types with
matching designated subtypes; explicit conversion is allowed
between access-to-subprogram types with subtype conformant profiles
- (see *note 4.6::). Named access types have predefined equality
+ (see *note 4.6::). Named access types have predefined equality
operators; anonymous access types do not, but they can use the
- predefined equality operators for universal_access (see *note
+ predefined equality operators for <universal_access> (see *note
4.5.2::).
36
@@ -9644,10 +9665,10 @@ distributed accessibility.
_Examples_
41
-Example of use of the Access attribute:
+<Example of use of the Access attribute:>
42
- Martha : Person_Name := new Person(F); -- see *note 3.10.1::
+ Martha : Person_Name := new Person(F); --< see *note 3.10.1::>
Cars : array (1..2) of aliased Car;
...
Martha.Vehicle := Cars(1)'Access;
@@ -9686,7 +9707,7 @@ A declarative_part contains declarative_items (possibly
none).
6.1/2
The list of declarative_items of a declarative_part is called the
-declaration list of the declarative_part.
+<declaration list> of the declarative_part.
_Dynamic Semantics_
@@ -9696,8 +9717,9 @@ declarative_items, if any, in the order in which they are
given in the
declarative_part.
8
-An elaborable construct is in the elaborated state after the normal
-completion of its elaboration. Prior to that, it is not yet elaborated.
+An elaborable construct is in the <elaborated> state after the normal
+completion of its elaboration. Prior to that, it is <not yet
+elaborated>.
9
For a construct that attempts to use a body, a check (Elaboration_Check)
@@ -9744,10 +9766,10 @@ File: arm2012.info, Node: 3.11.1, Up: 3.11
----------------------------------
1/3
-Declarations sometimes come in two parts. A declaration that requires a
-second part is said to require completion. The second part is called the
-completion of the declaration (and of the entity declared), and is
-either another declaration, a body, or a pragma. A body is a body, an
+Declarations sometimes come in two parts. A declaration that requires a
+second part is said to <require completion>. The second part is called
+the <completion> of the declaration (and of the entity declared), and is
+either another declaration, a body, or a pragma. A <body> is a body, an
entry_body, a null_procedure_declaration or an
expression_function_declaration that completes another declaration, or a
renaming-as-body (see *note 8.5.4::).
@@ -9769,13 +9791,13 @@ a prior declaration only if:
5
* If the declaration is overloadable, then the completion either has
- a type-conformant profile, or is a pragma.
+ a type-conformant profile, or is a pragma.
_Legality Rules_
6/3
-An implicit declaration shall not have a completion. For any explicit
-declaration that is specified to require completion, there shall be a
+An implicit declaration shall not have a completion. For any explicit
+declaration that is specified to <require completion>, there shall be a
corresponding explicit completion, unless the declared entity is
imported (see *note B.1::).
@@ -9785,7 +9807,7 @@ requirements on completions appear where each kind of
completion is
defined.
8
-A type is completely defined at a place that is after its full type
+A type is <completely defined> at a place that is after its full type
definition (if it has one) and after all of its subcomponent types are
completely defined. A type shall be completely defined before it is
frozen (see *note 13.14:: and *note 7.3::).
@@ -9876,25 +9898,25 @@ access value that designates some related entity.
_Name Resolution Rules_
8
-The name in a dereference (either an implicit_dereference or an
+The name in a <dereference> (either an implicit_dereference or an
explicit_dereference) is expected to be of any access type.
_Static Semantics_
9/3
If the type of the name in a dereference is some access-to-object type
-T, then the dereference denotes a view of an object, the nominal subtype
-of the view being the designated subtype of T. If the designated subtype
-has unconstrained discriminants, the (actual) subtype of the view is
-constrained by the values of the discriminants of the designated object,
-except when there is a partial view of the type of the designated
-subtype that does not have discriminants, in which case the dereference
-is not constrained by its discriminant values.
+<T>, then the dereference denotes a view of an object, the <nominal
+subtype> of the view being the designated subtype of <T>. If the
+designated subtype has unconstrained discriminants, the (actual) subtype
+of the view is constrained by the values of the discriminants of the
+designated object, except when there is a partial view of the type of
+the designated subtype that does not have discriminants, in which case
+the dereference is not constrained by its discriminant values.
10
If the type of the name in a dereference is some access-to-subprogram
-type S, then the dereference denotes a view of a subprogram, the profile
-of the view being the designated profile of S.
+type <S>, then the dereference denotes a view of a subprogram, the
+<profile> of the view being the designated profile of <S>.
_Dynamic Semantics_
@@ -9905,40 +9927,40 @@ a character_literal.
12
The evaluation of a name that has a prefix includes the evaluation of
-the prefix. The evaluation of a prefix consists of the evaluation of the
-name or the implicit_dereference. The prefix denotes the entity denoted
-by the name or the implicit_dereference.
+the prefix. The evaluation of a prefix consists of the evaluation of
+the name or the implicit_dereference. The prefix denotes the entity
+denoted by the name or the implicit_dereference.
13
The evaluation of a dereference consists of the evaluation of the name
and the determination of the object or subprogram that is designated by
-the value of the name. A check is made that the value of the name is not
-the null access value. Constraint_Error is raised if this check fails.
-The dereference denotes the object or subprogram designated by the value
-of the name.
+the value of the name. A check is made that the value of the name is
+not the null access value. Constraint_Error is raised if this check
+fails. The dereference denotes the object or subprogram designated by
+the value of the name.
_Examples_
14
-Examples of direct names:
+<Examples of direct names:>
15
- Pi -- the direct name of a number (see *note 3.3.2::)
- Limit -- the direct name of a constant (see *note 3.3.1::)
- Count -- the direct name of a scalar variable (see *note 3.3.1::)
- Board -- the direct name of an array variable (see *note 3.6.1::)
- Matrix -- the direct name of a type (see *note 3.6::)
- Random -- the direct name of a function (see *note 6.1::)
- Error -- the direct name of an exception (see *note 11.1::)
+ Pi <-- the direct name of a number> (see *note 3.3.2::)
+ Limit <-- the direct name of a constant> (see *note 3.3.1::)
+ Count <-- the direct name of a scalar variable> (see *note 3.3.1::)
+ Board <-- the direct name of an array variable> (see *note 3.6.1::)
+ Matrix <-- the direct name of a type> (see *note 3.6::)
+ Random <-- the direct name of a function> (see *note 6.1::)
+ Error <-- the direct name of an exception> (see *note 11.1::)
16
-Examples of dereferences:
+<Examples of dereferences:>
17
- Next_Car.all -- explicit dereference denoting the object designated by
- -- the access variable Next_Car (see *note 3.10.1::)
- Next_Car.Owner -- selected component with implicit dereference;
- -- same as Next_Car.all.Owner
+ Next_Car.all --< explicit dereference denoting the object designated
by>
+ --< the access variable Next_Car (see *note 3.10.1::)>
+ Next_Car.Owner --< selected component with implicit dereference;>
+ --< same as Next_Car.all.Owner>
* Menu:
@@ -9957,7 +9979,7 @@ File: arm2012.info, Node: 4.1.1, Next: 4.1.2, Up: 4.1
1
An indexed_component denotes either a component of an array or an entry
-in a family of entries.
+in a family of entries.
_Syntax_
@@ -9980,7 +10002,7 @@ The expected type for each expression is the
corresponding index type.
5
When the prefix denotes an array, the indexed_component denotes the
-component of the array with the specified index value(s). The nominal
+component of the array with the specified index value(s). The nominal
subtype of the indexed_component is the component subtype of the array
type.
@@ -9993,28 +10015,28 @@ the individual entry of the entry family with the
specified index value.
7
For the evaluation of an indexed_component, the prefix and the
expressions are evaluated in an arbitrary order. The value of each
-expression is converted to the corresponding index type. A check is made
-that each index value belongs to the corresponding index range of the
-array or entry family denoted by the prefix. Constraint_Error is raised
-if this check fails.
+expression is converted to the corresponding index type. A check is
+made that each index value belongs to the corresponding index range of
+the array or entry family denoted by the prefix. Constraint_Error is
+raised if this check fails.
_Examples_
8
-Examples of indexed components:
+<Examples of indexed components:>
9
- My_Schedule(Sat) -- a component of a one-dimensional array (see
*note 3.6.1::)
- Page(10) -- a component of a one-dimensional array (see
*note 3.6::)
- Board(M, J + 1) -- a component of a two-dimensional array (see
*note 3.6.1::)
- Page(10)(20) -- a component of a component (see *note 3.6::)
- Request(Medium) -- an entry in a family of entries (see *note
9.1::)
- Next_Frame(L)(M, N) -- a component of a function call (see *note
6.1::)
+ My_Schedule(Sat) --< a component of a one-dimensional array (see
*note 3.6.1::)>
+ Page(10) --< a component of a one-dimensional array (see
*note 3.6::)>
+ Board(M, J + 1) --< a component of a two-dimensional array (see
*note 3.6.1::)>
+ Page(10)(20) --< a component of a component (see *note
3.6::)>
+ Request(Medium) --< an entry in a family of entries (see *note
9.1::)>
+ Next_Frame(L)(M, N) --< a component of a function call (see *note
6.1::)>
NOTES
10
- 1 Notes on the examples: Distinct notations are used for
+ 1 <Notes on the examples:> Distinct notations are used for
components of multidimensional arrays (such as Board) and arrays of
arrays (such as Page). The components of an array of arrays are
arrays and can therefore be indexed. Thus Page(10)(20) denotes the
@@ -10064,10 +10086,10 @@ defined by the discrete_range.
7
For the evaluation of a slice, the prefix and the discrete_range are
-evaluated in an arbitrary order. If the slice is not a null slice (a
+evaluated in an arbitrary order. If the slice is not a <null slice> (a
slice where the discrete_range is a null range), then a check is made
that the bounds of the discrete_range belong to the index range of the
-array denoted by the prefix. Constraint_Error is raised if this check
+array denoted by the prefix. Constraint_Error is raised if this check
fails.
NOTES
@@ -10086,16 +10108,16 @@ fails.
_Examples_
10
-Examples of slices:
+<Examples of slices:>
11
- Stars(1 .. 15) -- a slice of 15 characters (see *note
3.6.3::)
- Page(10 .. 10 + Size) -- a slice of 1 + Size components (see *note
3.6::)
- Page(L)(A .. B) -- a slice of the array Page(L) (see *note
3.6::)
- Stars(1 .. 0) -- a null slice (see *note 3.6.3::)
- My_Schedule(Weekday) -- bounds given by subtype (see *note 3.6.1::
and *note 3.5.1::)
- Stars(5 .. 15)(K) -- same as Stars(K) (see *note 3.6.3::)
- -- provided that K is in 5 .. 15
+ Stars(1 .. 15) --< a slice of 15 characters (see *note
3.6.3::)>
+ Page(10 .. 10 + Size) --< a slice of 1 + Size components (see *note
3.6::)>
+ Page(L)(A .. B) --< a slice of the array Page(L) (see *note
3.6::)>
+ Stars(1 .. 0) --< a null slice (see *note 3.6.3::)>
+ My_Schedule(Weekday) --< bounds given by subtype (see *note
3.6.1:: and *note 3.5.1::)>
+ Stars(5 .. 15)(K) --< same as Stars(K) (see *note 3.6.3::)>
+ --< provided that K is in 5 .. 15>
File: arm2012.info, Node: 4.1.3, Next: 4.1.4, Prev: 4.1.2, Up: 4.1
@@ -10106,7 +10128,7 @@ File: arm2012.info, Node: 4.1.3, Next: 4.1.4, Prev:
4.1.2, Up: 4.1
1
Selected_components are used to denote components (including
discriminants), entries, entry families, and protected subprograms; they
-are also used as expanded names as described below.
+are also used as expanded names as described below.
_Syntax_
@@ -10119,7 +10141,7 @@ are also used as expanded names as described below.
_Name Resolution Rules_
4
-A selected_component is called an expanded name if, according to the
+A selected_component is called an <expanded name> if, according to the
visibility rules, at least one possible interpretation of its prefix
denotes a package or an enclosing named construct (directly, not through
a subprogram_renaming_declaration or generic_renaming_declaration).
@@ -10156,22 +10178,22 @@ denote one of the following:
9.2/3
The prefix (after any implicit dereference) shall resolve to denote
- an object or value of a specific tagged type T or class-wide type
- T'Class. The selector_name shall resolve to denote a view of a
+ an object or value of a specific tagged type <T> or class-wide type
+ <T>'Class. The selector_name shall resolve to denote a view of a
subprogram declared immediately within the declarative region in
- which an ancestor of the type T is declared. The first formal
- parameter of the subprogram shall be of type T, or a class-wide
- type that covers T, or an access parameter designating one of these
- types. The designator of the subprogram shall not be the same as
- that of a component of the tagged type visible at the point of the
- selected_component. The subprogram shall not be an implicitly
- declared primitive operation of type T that overrides an inherited
- subprogram implemented by an entry or protected subprogram visible
- at the point of the selected_component. The selected_component
- denotes a view of this subprogram that omits the first formal
- parameter. This view is called a prefixed view of the subprogram,
- and the prefix of the selected_component (after any implicit
- dereference) is called the prefix of the prefixed view.
+ which an ancestor of the type <T> is declared. The first formal
+ parameter of the subprogram shall be of type <T>, or a class-wide
+ type that covers <T>, or an access parameter designating one of
+ these types. The designator of the subprogram shall not be the
+ same as that of a component of the tagged type visible at the point
+ of the selected_component. The subprogram shall not be an
+ implicitly declared primitive operation of type <T> that overrides
+ an inherited subprogram implemented by an entry or protected
+ subprogram visible at the point of the selected_component. The
+ selected_component denotes a view of this subprogram that omits the
+ first formal parameter. This view is called a <prefixed view> of
+ the subprogram, and the prefix of the selected_component (after any
+ implicit dereference) is called the <prefix> of the prefixed view.
10
An expanded name shall resolve to denote a declaration that occurs
@@ -10222,36 +10244,36 @@ prefix.
15
For a selected_component that denotes a component of a variant, a check
is made that the values of the discriminants are such that the value or
-object denoted by the prefix has this component. The exception
+object denoted by the prefix has this component. The exception
Constraint_Error is raised if this check fails.
_Examples_
16
-Examples of selected components:
+<Examples of selected components:>
17/2
- Tomorrow.Month -- a record component (see *note 3.8::)
- Next_Car.Owner -- a record component (see *note 3.10.1::)
- Next_Car.Owner.Age -- a record component (see *note 3.10.1::)
- -- the previous two lines involve implicit
dereferences
- Writer.Unit -- a record component (a discriminant) (see
*note 3.8.1::)
- Min_Cell(H).Value -- a record component of the result (see *note
6.1::)
- -- of the function call Min_Cell(H)
- Cashier.Append -- a prefixed view of a procedure (see *note
3.9.4::)
- Control.Seize -- an entry of a protected object (see *note
9.4::)
- Pool(K).Write -- an entry of the task Pool(K) (see *note 9.4::)
+ Tomorrow.Month --< a record component (see *note 3.8::)>
+ Next_Car.Owner --< a record component (see *note 3.10.1::)>
+ Next_Car.Owner.Age --< a record component (see *note 3.10.1::)>
+ --< the previous two lines involve implicit
dereferences>
+ Writer.Unit --< a record component (a discriminant) (see
*note 3.8.1::)>
+ Min_Cell(H).Value --< a record component of the result (see *note
6.1::)>
+ --< of the function call Min_Cell(H)>
+ Cashier.Append --< a prefixed view of a procedure (see *note
3.9.4::)>
+ Control.Seize --< an entry of a protected object (see *note
9.4::)>
+ Pool(K).Write --< an entry of the task Pool(K) (see *note
9.4::)>
18
-Examples of expanded names:
+<Examples of expanded names:>
19
- Key_Manager."<" -- an operator of the visible part of a package
(see *note 7.3.1::)
- Dot_Product.Sum -- a variable declared in a function body (see
*note 6.1::)
- Buffer.Pool -- a variable declared in a protected unit
(see *note 9.11::)
- Buffer.Read -- an entry of a protected unit (see *note
9.11::)
- Swap.Temp -- a variable declared in a block statement
(see *note 5.6::)
- Standard.Boolean -- the name of a predefined type (see *note
A.1::)
+ Key_Manager."<" --< an operator of the visible part of a package
(see *note 7.3.1::)>
+ Dot_Product.Sum --< a variable declared in a function body
(see *note 6.1::)>
+ Buffer.Pool --< a variable declared in a protected unit
(see *note 9.11::)>
+ Buffer.Read --< an entry of a protected unit (see *note
9.11::)>
+ Swap.Temp --< a variable declared in a block statement
(see *note 5.6::)>
+ Standard.Boolean --< the name of a predefined type (see *note
A.1::)>
File: arm2012.info, Node: 4.1.4, Next: 4.1.5, Prev: 4.1.3, Up: 4.1
@@ -10260,9 +10282,9 @@ File: arm2012.info, Node: 4.1.4, Next: 4.1.5, Prev:
4.1.3, Up: 4.1
----------------
1
-An attribute is a characteristic of an entity that can be queried via an
-attribute_reference (*note 4.1.4: S0100.) or a range_attribute_reference
-(*note 4.1.4: S0102.).
+An <attribute> is a characteristic of an entity that can be queried via
+an attribute_reference (*note 4.1.4: S0100.) or a
+range_attribute_reference (*note 4.1.4: S0102.).
_Syntax_
@@ -10271,14 +10293,14 @@ attribute_reference (*note 4.1.4: S0100.) or a
range_attribute_reference
3/2
attribute_designator ::=
- identifier[(static_expression)]
+ identifier[(<static_>expression)]
| Access | Delta | Digits | Mod
4
range_attribute_reference ::= prefix'range_attribute_designator
5
- range_attribute_designator ::= Range[(static_expression)]
+ range_attribute_designator ::= Range[(<static_>expression)]
_Name Resolution Rules_
@@ -10355,22 +10377,22 @@ compatibility with a previous edition of this
International Standard.
type, and the resolution of the name can use the fact that the type
of the object or the profile of the callable entity denoted by the
prefix has to match the designated type or be type conformant with
- the designated profile of the access type.
+ the designated profile of the access type.
_Examples_
15
-Examples of attributes:
+<Examples of attributes:>
16
- Color'First -- minimum value of the enumeration type Color (see
*note 3.5.1::)
- Rainbow'Base'First -- same as Color'First (see *note 3.5.1::)
- Real'Digits -- precision of the type Real (see *note 3.5.7::)
- Board'Last(2) -- upper bound of the second dimension of Board
(see *note 3.6.1::)
- Board'Range(1) -- index range of the first dimension of Board (see
*note 3.6.1::)
- Pool(K)'Terminated -- True if task Pool(K) is terminated (see *note
9.1::)
- Date'Size -- number of bits for records of type Date (see
*note 3.8::)
- Message'Address -- address of the record variable Message (see
*note 3.7.1::)
+ Color'First --< minimum value of the enumeration type Color
(see *note 3.5.1::)>
+ Rainbow'Base'First --< same as Color'First (see *note 3.5.1::)>
+ Real'Digits --< precision of the type Real (see *note 3.5.7::)>
+ Board'Last(2) --< upper bound of the second dimension of Board
(see *note 3.6.1::)>
+ Board'Range(1) --< index range of the first dimension of Board
(see *note 3.6.1::)>
+ Pool(K)'Terminated --< True if task Pool(K) is terminated (see *note
9.1::)>
+ Date'Size --< number of bits for records of type Date (see
*note 3.8::)>
+ Message'Address --< address of the record variable Message (see
*note 3.7.1::)>
File: arm2012.info, Node: 4.1.5, Next: 4.1.6, Prev: 4.1.4, Up: 4.1
@@ -10381,19 +10403,19 @@ File: arm2012.info, Node: 4.1.5, Next: 4.1.6,
Prev: 4.1.4, Up: 4.1
_Static Semantics_
1/3
-Given a discriminated type T, the following type-related operational
+Given a discriminated type <T>, the following type-related operational
aspect may be specified:
2/3
Implicit_Dereference
This aspect is specified by a name that denotes an access
- discriminant declared for the type T.
+ discriminant declared for the type <T>.
3/3
A (view of a) type with a specified Implicit_Dereference aspect is a
-reference type. A reference object is an object of a reference type.
-The discriminant named by the Implicit_Dereference aspect is the
-reference discriminant of the reference type or reference object. A
+<reference type>. A <reference object> is an object of a reference
+type. The discriminant named by the Implicit_Dereference aspect is the
+<reference discriminant> of the reference type or reference object. A
generalized_reference is a name that identifies a reference object, and
denotes the object or subprogram designated by the reference
discriminant of the reference object.
@@ -10401,12 +10423,12 @@ discriminant of the reference object.
_Syntax_
4/3
- generalized_reference ::= reference_object_name
+ generalized_reference ::= <reference_object_>name
_Name Resolution Rules_
5/3
-The expected type for the reference_object_name in a
+The expected type for the <reference_object_>name in a
generalized_reference is any reference type.
_Static Semantics_
@@ -10419,12 +10441,12 @@ A generalized_reference denotes a view equivalent to
that of a
dereference of the reference discriminant of the reference object.
7/3
-Given a reference type T, the Implicit_Dereference aspect is inherited
-by descendants of type T if not overridden. If a descendant type
-constrains the value of the reference discriminant of T by a new
+Given a reference type <T>, the Implicit_Dereference aspect is inherited
+by descendants of type <T> if not overridden. If a descendant type
+constrains the value of the reference discriminant of <T> by a new
discriminant, that new discriminant is the reference discriminant of the
descendant. If the descendant type constrains the value of the
-reference discriminant of T by an expression other than the name of a
+reference discriminant of <T> by an expression other than the name of a
new discriminant, a generalized_reference that identifies an object of
the descendant type denotes the object or subprogram designated by the
value of this constraining expression.
@@ -10433,28 +10455,28 @@ value of this constraining expression.
8/3
The evaluation of a generalized_reference consists of the evaluation of
-the reference_object_name and a determination of the object or
+the <reference_object_>name and a determination of the object or
subprogram designated by the reference discriminant of the named
-reference object. A check is made that the value of the reference
-discriminant is not the null access value. Constraint_Error is raised if
-this check fails. The generalized_reference denotes the object or
+reference object. A check is made that the value of the reference
+discriminant is not the null access value. Constraint_Error is raised
+if this check fails. The generalized_reference denotes the object or
subprogram designated by the value of the reference discriminant of the
named reference object.
_Examples_
9/3
- type Barrel is tagged ... -- holds objects of type Element
+ type Barrel is tagged ... -- <holds objects of type Element>
10/3
type Ref_Element(Data : access Element) is limited private
with Implicit_Dereference => Data;
- -- This Ref_Element type is a "reference" type.
- -- "Data" is its reference discriminant.
+ -- <This Ref_Element type is a "reference" type.>
+ -- <"Data" is its reference discriminant.>
11/3
function Find (B : aliased in out Barrel; Key : String) return
Ref_Element;
- -- Return a reference to an element of a barrel.
+ -- <Return a reference to an element of a barrel.>
12/3
B: aliased Barrel;
@@ -10463,10 +10485,10 @@ named reference object.
...
14/3
- Find (B, "grape") := Element'(...); -- Assign through a reference.
+ Find (B, "grape") := Element'(...); -- <Assign through a reference.>
15/3
- -- This is equivalent to:
+ -- <This is equivalent to:>
Find (B, "grape").Data.all := Element'(...);
@@ -10478,88 +10500,89 @@ File: arm2012.info, Node: 4.1.6, Prev: 4.1.5, Up:
4.1
_Static Semantics_
1/3
-Given a tagged type T, the following type-related, operational aspects
+Given a tagged type <T>, the following type-related, operational aspects
may be specified:
2/3
Constant_Indexing
This aspect shall be specified by a name that denotes one
or more functions declared immediately within the same
- declaration list in which T is declared. All such
+ declaration list in which <T> is declared. All such
functions shall have at least two parameters, the first
- of which is of type T or T'Class, or is an
- access-to-constant parameter with designated type T or
- T'Class.
+ of which is of type <T> or <T>'Class, or is an
+ access-to-constant parameter with designated type <T> or
+ <T>'Class.
3/3
Variable_Indexing
This aspect shall be specified by a name that denotes one
or more functions declared immediately within the same
- declaration list in which T is declared. All such
+ declaration list in which <T> is declared. All such
functions shall have at least two parameters, the first
- of which is of type T or T'Class, or is an access
- parameter with designated type T or T'Class. All such
- functions shall have a return type that is a reference
- type (see *note 4.1.5::), whose reference discriminant is
- of an access-to-variable type.
+ of which is of type <T> or <T>'Class, or is an access
+ parameter with designated type <T> or <T>'Class. All
+ such functions shall have a return type that is a
+ reference type (see *note 4.1.5::), whose reference
+ discriminant is of an access-to-variable type.
4/4
-These aspects are inherited by descendants of T (including the
-class-wide type T'Class).
+These aspects are inherited by descendants of <T> (including the
+class-wide type <T>'Class).
5/3
-An indexable container type is (a view of) a tagged type with at least
+An <indexable container type> is (a view of) a tagged type with at least
one of the aspects Constant_Indexing or Variable_Indexing specified. An
-indexable container object is an object of an indexable container type.
-A generalized_indexing is a name that denotes the result of calling a
-function named by a Constant_Indexing or Variable_Indexing aspect.
+<indexable container object> is an object of an indexable container
+type. A generalized_indexing is a name that denotes the result of
+calling a function named by a Constant_Indexing or Variable_Indexing
+aspect.
5.1/4
The Constant_Indexing and Variable_Indexing aspects are nonoverridable
(see *note 13.1.1::).
-Paragraphs 6 through 9 were deleted.
+<Paragraphs 6 through 9 were deleted.>
_Syntax_
10/3
- generalized_indexing ::= indexable_container_object_prefix
+ generalized_indexing ::= <indexable_container_object_>prefix
actual_parameter_part
_Name Resolution Rules_
11/3
-The expected type for the indexable_container_object_prefix of a
+The expected type for the <indexable_container_object_>prefix of a
generalized_indexing is any indexable container type.
12/3
If the Constant_Indexing aspect is specified for the type of the
-indexable_container_object_prefix of a generalized_indexing, then the
-generalized_indexing is interpreted as a constant indexing under the
+<indexable_container_object_>prefix of a generalized_indexing, then the
+generalized_indexing is interpreted as a <constant indexing> under the
following circumstances:
13/3
* when the Variable_Indexing aspect is not specified for the type of
- the indexable_container_object_prefix;
+ the <indexable_container_object_>prefix;
14/3
- * when the indexable_container_object_prefix denotes a constant;
+ * when the <indexable_container_object_>prefix denotes a constant;
15/3
* when the generalized_indexing is used within a primary where a name
denoting a constant is permitted.
16/3
-Otherwise, the generalized_indexing is interpreted as a variable
-indexing.
+Otherwise, the generalized_indexing is interpreted as a <variable
+indexing>.
17/3
When a generalized_indexing is interpreted as a constant (or variable)
indexing, it is equivalent to a call on a prefixed view of one of the
functions named by the Constant_Indexing (or Variable_Indexing) aspect
-of the type of the indexable_container_object_prefix with the given
-actual_parameter_part, and with the indexable_container_object_prefix as
-the prefix of the prefixed view.
+of the type of the <indexable_container_object_>prefix with the given
+actual_parameter_part, and with the <indexable_container_object_>prefix
+as the prefix of the prefixed view.
NOTES
@@ -10573,23 +10596,23 @@ the prefix of the prefixed view.
19/3
type Indexed_Barrel is tagged ...
with Variable_Indexing => Find;
- -- Indexed_Barrel is an indexable container type,
- -- Find is the generalized indexing operation.
+ -- <Indexed_Barrel is an indexable container type,>
+ -- <Find is the generalized indexing operation.>
20/3
function Find (B : aliased in out Indexed_Barrel; Key : String) return
Ref_Element;
- -- Return a reference to an element of a barrel (see *note 4.1.5::).
+ -- <Return a reference to an element of a barrel (see *note 4.1.5::).>
21/3
IB: aliased Indexed_Barrel;
22/3
- -- All of the following calls are then equivalent:
- Find (IB,"pear").Data.all := Element'(...); -- Traditional call
- IB.Find ("pear").Data.all := Element'(...); -- Call of prefixed view
- IB.Find ("pear") := Element'(...); -- Implicit dereference (see
*note 4.1.5::)
- IB ("pear") := Element'(...); -- Implicit indexing and
dereference
- IB ("pear").Data.all := Element'(...); -- Implicit indexing only
+ -- <All of the following calls are then equivalent:>
+ Find (IB,"pear").Data.all := Element'(...); -- <Traditional call>
+ IB.Find ("pear").Data.all := Element'(...); -- <Call of prefixed view>
+ IB.Find ("pear") := Element'(...); -- <Implicit dereference (see
*note 4.1.5::)>
+ IB ("pear") := Element'(...); -- <Implicit indexing and
dereference>
+ IB ("pear").Data.all := Element'(...); -- <Implicit indexing only>
File: arm2012.info, Node: 4.2, Next: 4.3, Prev: 4.1, Up: 4
@@ -10598,14 +10621,14 @@ File: arm2012.info, Node: 4.2, Next: 4.3, Prev:
4.1, Up: 4
============
1
-A literal represents a value literally, that is, by means of notation
+A <literal> represents a value literally, that is, by means of notation
suited to its kind. A literal is either a numeric_literal, a
-character_literal, the literal null, or a string_literal.
+character_literal, the literal null, or a string_literal.
_Name Resolution Rules_
2/2
-This paragraph was deleted.
+<This paragraph was deleted.>
3
For a name that consists of a character_literal, either its expected
@@ -10635,13 +10658,13 @@ type, there shall be a corresponding
defining_character_literal of the
component type of the expected string type.
7/2
-This paragraph was deleted.
+<This paragraph was deleted.>
_Static Semantics_
8/2
-An integer literal is of type universal_integer. A real literal is of
-type universal_real. The literal null is of type universal_access.
+An integer literal is of type <universal_integer>. A real literal is of
+type <universal_real>. The literal null is of type <universal_access>.
_Dynamic Semantics_
@@ -10658,11 +10681,11 @@ positional_array_aggregates (see *note 4.3.3::),
except that for a null
string literal, the upper bound is the predecessor of the lower bound.
11
-For the evaluation of a string_literal of type T, a check is made that
+For the evaluation of a string_literal of type <T>, a check is made that
the value of each character of the string_literal belongs to the
-component subtype of T. For the evaluation of a null string literal, a
-check is made that its lower bound is greater than the lower bound of
-the base range of the index type. The exception Constraint_Error is
+component subtype of <T>. For the evaluation of a null string literal,
+a check is made that its lower bound is greater than the lower bound of
+the base range of the index type. The exception Constraint_Error is
raised if either of these checks fails.
NOTES
@@ -10677,13 +10700,13 @@ raised if either of these checks fails.
_Examples_
13
-Examples of literals:
+<Examples of literals:>
14
- 3.14159_26536 -- a real literal
- 1_345 -- an integer literal
- 'A' -- a character literal
- "Some Text" -- a string literal
+ 3.14159_26536 --< a real literal>
+ 1_345 --< an integer literal>
+ 'A' --< a character literal>
+ "Some Text" --< a string literal >
File: arm2012.info, Node: 4.3, Next: 4.4, Prev: 4.2, Up: 4
@@ -10692,8 +10715,8 @@ File: arm2012.info, Node: 4.3, Next: 4.4, Prev: 4.2,
Up: 4
==============
1
-An aggregate combines component values into a composite value of an
-array type, record type, or record extension.
+An <aggregate> combines component values into a composite value of an
+array type, record type, or record extension.
_Syntax_
@@ -10719,12 +10742,12 @@ For the evaluation of an aggregate, an anonymous
object is created and
values for the components or ancestor part are obtained (as described in
the subsequent subclause for each kind of the aggregate) and assigned
into the corresponding components or ancestor part of the anonymous
-object. Obtaining the values and the assignments occur in an arbitrary
+object. Obtaining the values and the assignments occur in an arbitrary
order. The value of the aggregate is the value of this object.
6
If an aggregate is of a tagged type, a check is made that its value
-belongs to the first subtype of the type. Constraint_Error is raised if
+belongs to the first subtype of the type. Constraint_Error is raised if
this check fails.
* Menu:
@@ -10761,16 +10784,16 @@ association.
5
component_choice_list ::=
- component_selector_name {| component_selector_name}
+ <component_>selector_name {| <component_>selector_name}
| others
6
- A record_component_association (*note 4.3.1: S0109.) is a named
- component association if it has a component_choice_list; otherwise,
- it is a positional component association. Any positional component
- associations shall precede any named component associations. If
- there is a named association with a component_choice_list of
- others, it shall come last.
+ A record_component_association (*note 4.3.1: S0109.) is a <named
+ component association> if it has a component_choice_list;
+ otherwise, it is a <positional component association>. Any
+ positional component associations shall precede any named component
+ associations. If there is a named association with a
+ component_choice_list of others, it shall come last.
7
In the record_component_association_list (*note 4.3.1: S0108.) for
@@ -10786,7 +10809,7 @@ or record extension.
9
For the record_component_association_list (*note 4.3.1: S0108.) of a
record_aggregate (*note 4.3.1: S0107.), all components of the composite
-value defined by the aggregate are needed; for the association list of
+value defined by the aggregate are <needed>; for the association list of
an extension_aggregate, only those components not determined by the
ancestor expression or subtype are needed (see *note 4.3.2::). Each
selector_name (*note 4.1.3: S0099.) in a record_component_association
@@ -10795,7 +10818,7 @@ possibly a discriminant).
10
The expected type for the expression of a record_component_association
-(*note 4.3.1: S0109.) is the type of the associated component(s); the
+(*note 4.3.1: S0109.) is the type of the <associated> component(s); the
associated component(s) are as follows:
11
@@ -10805,8 +10828,8 @@ associated component(s) are as follows:
components;
12
- * For a named association with one or more component_selector_names,
- the named component(s);
+ * For a named association with one or more
+ <component_>selector_names, the named component(s);
13
* For a named association with the reserved word others, all needed
@@ -10835,10 +10858,10 @@ types whose subtypes statically match. In addition,
Legality Rules are
enforced separately for each associated component.
17/3
-The value of a discriminant that governs a variant_part P shall be given
-by a static expression, unless P is nested within a variant V that is
-not selected by the discriminant value governing the variant_part
-enclosing V.
+The value of a discriminant that governs a variant_part <P> shall be
+given by a static expression, unless <P> is nested within a variant <V>
+that is not selected by the discriminant value governing the
+variant_part enclosing <V>.
17.1/2
A record_component_association for a discriminant without a
@@ -10854,7 +10877,7 @@ record_component_association_list (*note 4.3.1: S0108.).
For the evaluation of a record_component_association_list (*note 4.3.1:
S0108.), any per-object constraints (see *note 3.8::) for components
specified in the association list are elaborated and any expressions are
-evaluated and converted to the subtype of the associated component. Any
+evaluated and converted to the subtype of the associated component. Any
constraint elaborations and expression evaluations (and conversions)
occur in an arbitrary order, except that the expression for a
discriminant is evaluated (and converted) prior to the elaboration of
@@ -10887,40 +10910,40 @@ converted) once for each associated component.
_Examples_
22
-Example of a record aggregate with positional associations:
+<Example of a record aggregate with positional associations:>
23
- (4, July, 1776) -- see *note 3.8::
+ (4, July, 1776) --< see *note
3.8:: >
24
-Examples of record aggregates with named associations:
+<Examples of record aggregates with named associations:>
25
(Day => 4, Month => July, Year => 1776)
(Month => July, Day => 4, Year => 1776)
26
- (Disk, Closed, Track => 5, Cylinder => 12) -- see *note
3.8.1::
+ (Disk, Closed, Track => 5, Cylinder => 12) --< see *note
3.8.1::>
(Unit => Disk, Status => Closed, Cylinder => 9, Track => 1)
27/2
-Examples of component associations with several choices:
+<Examples of component associations with several choices:>
28
- (Value => 0, Succ|Pred => new Cell'(0, null, null)) -- see *note
3.10.1::
+ (Value => 0, Succ|Pred => new Cell'(0, null, null)) --< see *note
3.10.1::>
29
- -- The allocator is evaluated twice: Succ and Pred designate different
cells
+ --< The allocator is evaluated twice: Succ and Pred designate different
cells>
29.1/2
- (Value => 0, Succ|Pred => <>) -- see *note 3.10.1::
+ (Value => 0, Succ|Pred => <>) --< see *note 3.10.1::>
29.2/2
- -- Succ and Pred will be set to null
+ --< Succ and Pred will be set to null>
30
-Examples of record aggregates for tagged types (see *note 3.9:: and
-*note 3.9.1::):
+<Examples of record aggregates for tagged types (see *note 3.9:: and
+*note 3.9.1::):>
31
Expression'(null record)
@@ -10952,7 +10975,7 @@ ancestor_part.
4/2
The expected type for an extension_aggregate shall be a single type that
-is a record extension. If the ancestor_part is an expression, it is
+is a record extension. If the ancestor_part is an expression, it is
expected to be of any tagged type.
_Legality Rules_
@@ -10961,9 +10984,9 @@ expected to be of any tagged type.
If the ancestor_part is a subtype_mark, it shall denote a specific
tagged subtype. If the ancestor_part is an expression, it shall not be
dynamically tagged. The type of the extension_aggregate shall be a
-descendant of the type of the ancestor_part (the ancestor type), through
-one or more record extensions (and no private extensions). If the
-ancestor_part is a subtype_mark, the view of the ancestor type from
+descendant of the type of the ancestor_part (the <ancestor> type),
+through one or more record extensions (and no private extensions). If
+the ancestor_part is a subtype_mark, the view of the ancestor type from
which the type is descended (see *note 7.3.1::) shall not have unknown
discriminants.
@@ -10980,14 +11003,14 @@ ancestor_part shall not be:
this rule; nor
5.4/3
- * a conditional_expression having at least one dependent_expression
+ * a conditional_expression having at least one <dependent_>expression
that would violate this rule.
_Static Semantics_
6
For the record_component_association_list (*note 4.3.1: S0108.) of an
-extension_aggregate (*note 4.3.2: S0111.), the only components needed
+extension_aggregate (*note 4.3.2: S0111.), the only components <needed>
are those of the composite value defined by the aggregate that are not
inherited from the type of the ancestor_part (*note 4.3.2: S0112.), plus
any inherited discriminants if the ancestor_part (*note 4.3.2: S0112.)
@@ -11015,7 +11038,7 @@ check is made that each discriminant determined by the
ancestor_part has
the value specified for a corresponding discriminant, if any, either in
the record_component_association_list (*note 4.3.1: S0108.), or in the
derived_type_definition for some ancestor of the type of the
-extension_aggregate. Constraint_Error is raised if this check fails.
+extension_aggregate. Constraint_Error is raised if this check fails.
NOTES
@@ -11035,7 +11058,7 @@ extension_aggregate. Constraint_Error is raised if this
check fails.
_Examples_
11
-Examples of extension aggregates (for types defined in *note 3.9.1::):
+<Examples of extension aggregates (for types defined in *note 3.9.1::):>
12
Painted_Point'(Point with Red)
@@ -11044,7 +11067,7 @@ Examples of extension aggregates (for types defined in
*note 3.9.1::):
13
(Expression with Left => 1.2, Right => 3.4)
Addition'(Binop with null record)
- -- presuming Binop is of type Binary_Operation
+ --< presuming Binop is of type Binary_Operation>
File: arm2012.info, Node: 4.3.3, Prev: 4.3.2, Up: 4.3
@@ -11082,26 +11105,26 @@ by the values covered by the discrete_choices.
| discrete_choice_list => <>
6
-An n-dimensional array_aggregate is one that is written as n levels of
+An <n-dimensional> array_aggregate is one that is written as n levels of
nested array_aggregates (or at the bottom level, equivalent
-string_literals). For the multidimensional case (n >= 2) the
+string_literals). For the multidimensional case (n >= 2) the
array_aggregates (or equivalent string_literals) at the n-1 lower levels
-are called subaggregates of the enclosing n-dimensional array_aggregate.
-The expressions of the bottom level subaggregates (or of the
-array_aggregate itself if one-dimensional) are called the array
-component expressions of the enclosing n-dimensional array_aggregate.
+are called <subaggregate>s of the enclosing n-dimensional
+array_aggregate. The expressions of the bottom level subaggregates (or
+of the array_aggregate itself if one-dimensional) are called the <array
+component expressions> of the enclosing n-dimensional array_aggregate.
_Name Resolution Rules_
7/2
The expected type for an array_aggregate (that is not a subaggregate)
-shall be a single array type. The component type of this array type is
+shall be a single array type. The component type of this array type is
the expected type for each array component expression of the
array_aggregate.
8
The expected type for each discrete_choice in any discrete_choice_list
-of a named_array_aggregate is the type of the corresponding index; the
+of a named_array_aggregate is the type of the <corresponding index>; the
corresponding index for an array_aggregate that is not a subaggregate is
the first index of its type; for an (n-m)-dimensional subaggregate
within an array_aggregate of an n-dimensional type, the corresponding
@@ -11114,12 +11137,13 @@ An array_aggregate of an n-dimensional array type
shall be written as an
n-dimensional array_aggregate.
10
-An others choice is allowed for an array_aggregate only if an applicable
-index constraint applies to the array_aggregate. An applicable index
-constraint is a constraint provided by certain contexts where an
-array_aggregate is permitted that can be used to determine the bounds of
-the array value specified by the aggregate. Each of the following
-contexts (and none other) defines an applicable index constraint:
+An others choice is allowed for an array_aggregate only if an
+<applicable index constraint> applies to the array_aggregate. An
+applicable index constraint is a constraint provided by certain contexts
+where an array_aggregate is permitted that can be used to determine the
+bounds of the array value specified by the aggregate. Each of the
+following contexts (and none other) defines an applicable index
+constraint:
11/4
* For an explicit_actual_parameter, an
@@ -11154,11 +11178,11 @@ contexts (and none other) defines an applicable index
constraint:
15.1/3
* For a conditional_expression, the applicable index constraint for
- each dependent_expression is that, if any, defined for the
+ each <dependent_>expression is that, if any, defined for the
conditional_expression.
16
-The applicable index constraint applies to an array_aggregate that
+The applicable index constraint <applies> to an array_aggregate that
appears in such a context, as well as to any subaggregates thereof. In
the case of an explicit_actual_parameter (or default_expression) for a
call on a generic formal subprogram, no applicable index constraint is
@@ -11209,7 +11233,7 @@ two steps:
2. The array component expressions of the aggregate are evaluated
in an arbitrary order and their values are converted to the
component subtype of the array type; an array component expression
- is evaluated once for each associated component.
+ is evaluated once for each associated component.
23.1/4
Each expression in an array_component_association defines the value for
@@ -11271,30 +11295,30 @@ fail.
_Examples_
33
-Examples of array aggregates with positional associations:
+<Examples of array aggregates with positional associations:>
34
(7, 9, 5, 1, 3, 2, 4, 8, 6, 0)
- Table'(5, 8, 4, 1, others => 0) -- see *note 3.6::
+ Table'(5, 8, 4, 1, others => 0) --< see *note 3.6:: >
35
-Examples of array aggregates with named associations:
+<Examples of array aggregates with named associations:>
36
- (1 .. 5 => (1 .. 8 => 0.0)) -- two-dimensional
- (1 .. N => new Cell) -- N new cells, in particular for N = 0
+ (1 .. 5 => (1 .. 8 => 0.0)) --< two-dimensional>
+ (1 .. N => new Cell) --< N new cells, in particular for N =
0>
37
Table'(2 | 4 | 10 => 1, others => 0)
- Schedule'(Mon .. Fri => True, others => False) -- see *note 3.6::
+ Schedule'(Mon .. Fri => True, others => False) --< see *note 3.6::>
Schedule'(Wed | Sun => False, others => True)
- Vector'(1 => 2.5) -- single-component
vector
+ Vector'(1 => 2.5) --< single-component
vector>
38
-Examples of two-dimensional array aggregates:
+<Examples of two-dimensional array aggregates:>
39
- -- Three aggregates for the same value of subtype Matrix(1..2,1..3) (see
*note 3.6::):
+ --< Three aggregates for the same value of subtype Matrix(1..2,1..3) (see
*note 3.6::):>
40
((1.1, 1.2, 1.3), (2.1, 2.2, 2.3))
@@ -11302,24 +11326,24 @@ Examples of two-dimensional array aggregates:
(1 => (1 => 1.1, 2 => 1.2, 3 => 1.3), 2 => (1 => 2.1, 2 => 2.2, 3 => 2.3))
41
-Examples of aggregates as initial values:
+<Examples of aggregates as initial values:>
42
- A : Table := (7, 9, 5, 1, 3, 2, 4, 8, 6, 0); -- A(1)=7, A(10)=0
- B : Table := (2 | 4 | 10 => 1, others => 0); -- B(1)=0, B(10)=1
- C : constant Matrix := (1 .. 5 => (1 .. 8 => 0.0)); -- C'Last(1)=5,
C'Last(2)=8
+ A : Table := (7, 9, 5, 1, 3, 2, 4, 8, 6, 0); --< A(1)=7, A(10)=0>
+ B : Table := (2 | 4 | 10 => 1, others => 0); --< B(1)=0, B(10)=1>
+ C : constant Matrix := (1 .. 5 => (1 .. 8 => 0.0)); --< C'Last(1)=5,
C'Last(2)=8>
43
- D : Bit_Vector(M .. N) := (M .. N => True); -- see *note 3.6::
+ D : Bit_Vector(M .. N) := (M .. N => True); --< see *note 3.6::>
E : Bit_Vector(M .. N) := (others => True);
- F : String(1 .. 1) := (1 => 'F'); -- a one component aggregate: same as
"F"
+ F : String(1 .. 1) := (1 => 'F'); --< a one component aggregate: same as
"F">
44/2
-Example of an array aggregate with defaulted others choice and with an
-applicable index constraint provided by an enclosing record aggregate:
+<Example of an array aggregate with defaulted others choice and with an
+applicable index constraint provided by an enclosing record aggregate:>
45/2
- Buffer'(Size => 50, Pos => 1, Value => String'('x', others => <>)) --
see *note 3.7::
+ Buffer'(Size => 50, Pos => 1, Value => String'('x', others => <>)) --<
see *note 3.7::>
File: arm2012.info, Node: 4.4, Next: 4.5, Prev: 4.3, Up: 4
@@ -11328,12 +11352,12 @@ File: arm2012.info, Node: 4.4, Next: 4.5, Prev:
4.3, Up: 4
===============
1/3
-An expression is a formula that defines the computation or retrieval of
-a value. In this International Standard, the term "expression" refers
-to a construct of the syntactic category expression or of any of the
-following categories: choice_expression, choice_relation, relation,
+An <expression> is a formula that defines the computation or retrieval
+of a value. In this International Standard, the term "expression"
+refers to a construct of the syntactic category expression or of any of
+the following categories: choice_expression, choice_relation, relation,
simple_expression, term, factor, primary, conditional_expression,
-quantified_expression.
+quantified_expression.
_Syntax_
@@ -11358,14 +11382,14 @@ quantified_expression.
3/4
relation ::=
simple_expression [relational_operator simple_expression]
- | tested_simple_expression [not] in membership_choice_list
+ | <tested_>simple_expression [not] in membership_choice_list
| raise_expression
3.1/3
membership_choice_list ::= membership_choice {| membership_choice}
3.2/4
- membership_choice ::= choice_simple_expression | range |
+ membership_choice ::= <choice_>simple_expression | range |
subtype_mark
4
@@ -11412,36 +11436,36 @@ Constraint_Error or return the value of the object.
_Examples_
12
-Examples of primaries:
+<Examples of primaries:>
13
- 4.0 -- real literal
- Pi -- named number
- (1 .. 10 => 0) -- array aggregate
- Sum -- variable
- Integer'Last -- attribute
- Sine(X) -- function call
- Color'(Blue) -- qualified expression
- Real(M*N) -- conversion
- (Line_Count + 10) -- parenthesized expression
+ 4.0 --< real literal>
+ Pi --< named number>
+ (1 .. 10 => 0) --< array aggregate>
+ Sum --< variable>
+ Integer'Last --< attribute>
+ Sine(X) --< function call>
+ Color'(Blue) --< qualified expression>
+ Real(M*N) --< conversion>
+ (Line_Count + 10) --< parenthesized expression >
14
-Examples of expressions:
+<Examples of expressions:>
15/2
- Volume -- primary
- not Destroyed -- factor
- 2*Line_Count -- term
- -4.0 -- simple expression
- -4.0 + A -- simple expression
- B**2 - 4.0*A*C -- simple expression
- R*Sin([Unicode 952])*Cos([Unicode 966]) -- simple expression
- Password(1 .. 3) = "Bwv" -- relation
- Count in Small_Int -- relation
- Count not in Small_Int -- relation
- Index = 0 or Item_Hit -- expression
- (Cold and Sunny) or Warm -- expression (parentheses are required)
- A**(B**C) -- expression (parentheses are required)
+ Volume --< primary>
+ not Destroyed --< factor>
+ 2*Line_Count --< term>
+ -4.0 --< simple expression>
+ -4.0 + A --< simple expression>
+ B**2 - 4.0*A*C --< simple expression>
+ R*Sin([Unicode 952])*Cos([Unicode 966]) --< simple expression>
+ Password(1 .. 3) = "Bwv" --< relation>
+ Count in Small_Int --< relation>
+ Count not in Small_Int --< relation>
+ Index = 0 or Item_Hit --< expression>
+ (Cold and Sunny) or Warm --< expression (parentheses are required)>
+ A**(B**C) --< expression (parentheses are required)>
File: arm2012.info, Node: 4.5, Next: 4.6, Prev: 4.4, Up: 4
@@ -11485,10 +11509,10 @@ Parentheses can be used to impose specific
associations.
9
For each form of type definition, certain of the above operators are
-predefined; that is, they are implicitly declared immediately after the
-type definition. For each such implicit operator declaration, the
-parameters are called Left and Right for binary operators; the single
-parameter is called Right for unary operators. An expression of the
+<predefined>; that is, they are implicitly declared immediately after
+the type definition. For each such implicit operator declaration, the
+parameters are called Left and Right for <binary> operators; the single
+parameter is called Right for <unary> operators. An expression of the
form X op Y, where op is a binary operator, is equivalent to a
function_call of the form "op"(X, Y). An expression of the form op Y,
where op is a unary operator, is equivalent to a function_call of the
@@ -11537,18 +11561,18 @@ association.
_Examples_
15
-Examples of precedence:
+<Examples of precedence:>
16
- not Sunny or Warm -- same as (not Sunny) or Warm
- X > 4.0 and Y > 0.0 -- same as (X > 4.0) and (Y > 0.0)
+ not Sunny or Warm --< same as (not Sunny) or Warm>
+ X > 4.0 and Y > 0.0 --< same as (X > 4.0) and (Y > 0.0)>
17
- -4.0*A**2 -- same as -(4.0 * (A**2))
- abs(1 + A) + B -- same as (abs (1 + A)) + B
- Y**(-3) -- parentheses are necessary
- A / B * C -- same as (A/B)*C
- A + (B + C) -- evaluate B + C before adding it to A
+ -4.0*A**2 --< same as -(4.0 * (A**2))>
+ abs(1 + A) + B --< same as (abs (1 + A)) + B>
+ Y**(-3) --< parentheses are necessary>
+ A / B * C --< same as (A/B)*C>
+ A + (B + C) --< evaluate B + C before adding it to A >
* Menu:
@@ -11571,20 +11595,21 @@ File: arm2012.info, Node: 4.5.1, Next: 4.5.2, Up:
4.5
1
An expression consisting of two relations connected by and then or or
-else (a short-circuit control form) shall resolve to be of some boolean
-type; the expected type for both relations is that same boolean type.
+else (a <short-circuit control form>) shall resolve to be of some
+boolean type; the expected type for both relations is that same boolean
+type.
_Static Semantics_
2
-The following logical operators are predefined for every boolean type T,
-for every modular type T, and for every one-dimensional array type T
-whose component type is a boolean type:
+The following logical operators are predefined for every boolean type
+<T>, for every modular type <T>, and for every one-dimensional array
+type <T> whose component type is a boolean type:
3
- function "and"(Left, Right : T) return T
- function "or" (Left, Right : T) return T
- function "xor"(Left, Right : T) return T
+ function "and"(Left, Right : <T>) return <T>
+ function "or" (Left, Right : <T>) return <T>
+ function "xor"(Left, Right : <T>) return <T>
4
For boolean types, the predefined logical operators and, or, and xor
@@ -11618,8 +11643,8 @@ determines the result.
8
For the logical operators on arrays, a check is made that for each
component of the left operand there is a matching component of the right
-operand, and vice versa. Also, a check is made that each component of
-the result belongs to the component subtype. The exception
+operand, and vice versa. Also, a check is made that each component of
+the result belongs to the component subtype. The exception
Constraint_Error is raised if either of the above checks fails.
NOTES
@@ -11639,17 +11664,17 @@ Constraint_Error is raised if either of the above
checks fails.
_Examples_
11
-Examples of logical operators:
+<Examples of logical operators:>
12
Sunny or Warm
- Filter(1 .. 10) and Filter(15 .. 24) -- see *note 3.6.1::
+ Filter(1 .. 10) and Filter(15 .. 24) --< see *note 3.6.1:: >
13
-Examples of short-circuit control forms:
+<Examples of short-circuit control forms:>
14
- Next_Car.Owner /= null and then Next_Car.Owner.Age > 25 -- see *note
3.10.1::
+ Next_Car.Owner /= null and then Next_Car.Owner.Age > 25 --< see *note
3.10.1::>
N = 0 or else A(N) = Hit_Value
@@ -11659,24 +11684,24 @@ File: arm2012.info, Node: 4.5.2, Next: 4.5.3,
Prev: 4.5.1, Up: 4.5
-----------------------------------------------
1
-The equality operators = (equals) and /= (not equals) are predefined for
-nonlimited types. The other relational_operators are the ordering
-operators < (less than), <= (less than or equal), > (greater than), and
->= (greater than or equal). The ordering operators are predefined for
-scalar types, and for discrete array types, that is, one-dimensional
+The <equality operators> = (equals) and /= (not equals) are predefined
+for nonlimited types. The other relational_operators are the <ordering
+operators> < (less than), <= (less than or equal), > (greater than), and
+>= (greater than or equal). The ordering operators are predefined for
+scalar types, and for <discrete array types>, that is, one-dimensional
array types whose components are of a discrete type.
2/3
-A membership test, using in or not in, determines whether or not a value
-belongs to any given subtype or range, is equal to any given value, has
-a tag that identifies a type that is covered by a given type, or is
-convertible to and has an accessibility level appropriate for a given
-access type. Membership tests are allowed for all types.
+A <membership test>, using in or not in, determines whether or not a
+value belongs to any given subtype or range, is equal to any given
+value, has a tag that identifies a type that is covered by a given type,
+or is convertible to and has an accessibility level appropriate for a
+given access type. Membership tests are allowed for all types.
_Name Resolution Rules_
3/3
-The tested type of a membership test is determined by the
+The <tested type> of a membership test is determined by the
membership_choices of the membership_choice_list. Either all
membership_choices of the membership_choice_list shall resolve to the
same type, which is the tested type; or each membership_choice shall be
@@ -11684,24 +11709,25 @@ of an elementary type, and the tested type shall be
covered by each of
these elementary types.
3.1/4
-If the tested type is tagged, then the tested_simple_expression shall
+If the tested type is tagged, then the <tested_>simple_expression shall
resolve to be of a type that is convertible (see *note 4.6::) to the
tested type; if untagged, the expected type for the
-tested_simple_expression is the tested type. The expected type of a
-choice_simple_expression in a membership_choice, and of a
+<tested_>simple_expression is the tested type. The expected type of a
+<choice_>simple_expression in a membership_choice, and of a
simple_expression of a range in a membership_choice, is the tested type
of the membership operation.
_Legality Rules_
4/4
-For a membership test, if the tested_simple_expression is of a tagged
+For a membership test, if the <tested_>simple_expression is of a tagged
class-wide type, then the tested type shall be (visibly) tagged.
4.1/4
-If a membership test includes one or more choice_simple_expressions and
-the tested type of the membership test is limited, then the tested type
-of the membership test shall have a visible primitive equality operator.
+If a membership test includes one or more <choice_>simple_expressions
+and the tested type of the membership test is limited, then the tested
+type of the membership test shall have a visible primitive equality
+operator.
_Static Semantics_
@@ -11709,61 +11735,62 @@ of the membership test shall have a visible primitive
equality operator.
The result type of a membership test is the predefined type Boolean.
6
-The equality operators are predefined for every specific type T that is
-not limited, and not an anonymous access type, with the following
+The equality operators are predefined for every specific type <T> that
+is not limited, and not an anonymous access type, with the following
specifications:
7
- function "=" (Left, Right : T) return Boolean
- function "/="(Left, Right : T) return Boolean
+ function "=" (Left, Right : <T>) return Boolean
+ function "/="(Left, Right : <T>) return Boolean
7.1/2
-The following additional equality operators for the universal_access
+The following additional equality operators for the <universal_access>
type are declared in package Standard for use with anonymous access
types:
7.2/2
- function "=" (Left, Right : universal_access) return Boolean
- function "/="(Left, Right : universal_access) return Boolean
+ function "=" (Left, Right : <universal_access>) return Boolean
+ function "/="(Left, Right : <universal_access>) return Boolean
8
-The ordering operators are predefined for every specific scalar type T,
-and for every discrete array type T, with the following specifications:
+The ordering operators are predefined for every specific scalar type
+<T>, and for every discrete array type <T>, with the following
+specifications:
9
- function "<" (Left, Right : T) return Boolean
- function "<="(Left, Right : T) return Boolean
- function ">" (Left, Right : T) return Boolean
- function ">="(Left, Right : T) return Boolean
+ function "<" (Left, Right : <T>) return Boolean
+ function "<="(Left, Right : <T>) return Boolean
+ function ">" (Left, Right : <T>) return Boolean
+ function ">="(Left, Right : <T>) return Boolean
_Name Resolution Rules_
9.1/2
At least one of the operands of an equality operator for
-universal_access shall be of a specific anonymous access type. Unless
+<universal_access> shall be of a specific anonymous access type. Unless
the predefined equality operator is identified using an expanded name
with prefix denoting the package Standard, neither operand shall be of
-an access-to-object type whose designated type is D or D'Class, where D
-has a user-defined primitive equality operator such that:
+an access-to-object type whose designated type is <D> or <D>'Class,
+where <D> has a user-defined primitive equality operator such that:
9.2/2
* its result type is Boolean;
9.3/3
- * it is declared immediately within the same declaration list as D or
- any partial or incomplete view of D; and
+ * it is declared immediately within the same declaration list as <D>
+ or any partial or incomplete view of <D>; and
9.4/2
* at least one of its operands is an access parameter with designated
- type D.
+ type <D>.
_Legality Rules_
9.5/2
At least one of the operands of the equality operators for
-universal_access shall be of type universal_access, or both shall be of
-access-to-object types, or both shall be of access-to-subprogram types.
-Further:
+<universal_access> shall be of type <universal_access>, or both shall be
+of access-to-object types, or both shall be of access-to-subprogram
+types. Further:
9.6/2
* When both are of access-to-object types, the designated types shall
@@ -11779,7 +11806,7 @@ Further:
If the profile of an explicitly declared primitive equality operator of
an untagged record type is type conformant with that of the
corresponding predefined equality operator, the declaration shall occur
-before the type is frozen. In addition to the places where Legality
+before the type is frozen. In addition to the places where Legality
Rules normally apply (see *note 12.3::), this rule applies also in the
private part of an instance of a generic unit.
@@ -11803,7 +11830,7 @@ or if both are equal to the null value of the access
type.
Two access-to-subprogram values are equal if they are the result of the
same evaluation of an Access attribute_reference, or if both are equal
to the null value of the access type. Two access-to-subprogram values
-are unequal if they designate different subprograms. It is unspecified
+are unequal if they designate different subprograms. It is unspecified
whether two access values that designate the same subprogram but are the
result of distinct evaluations of Access attribute_references are equal
or unequal.
@@ -11830,7 +11857,7 @@ of its full type.
For other composite types, the predefined equality operators (and
certain other predefined operations on composite types -- see *note
4.5.1:: and *note 4.6::) are defined in terms of the corresponding
-operation on matching components, defined as follows:
+operation on <matching components>, defined as follows:
17
* For two composite objects or values of the same non-array type,
@@ -11887,31 +11914,31 @@ predefined "=" operator.
26/3
For a discrete array type, the predefined ordering operators correspond
-to lexicographic order using the predefined order relation of the
+to <lexicographic order> using the predefined order relation of the
component type: A null array is lexicographically less than any array
having at least one component. In the case of nonnull arrays, the left
operand is lexicographically less than the right operand if the first
component of the left operand is less than that of the right; otherwise,
the left operand is lexicographically less than the right operand only
if their first components are equal and the tail of the left operand is
-lexicographically less than that of the right (the tail consists of the
-remaining components beyond the first and can be null).
+lexicographically less than that of the right (the <tail> consists of
+the remaining components beyond the first and can be null).
26.1/3
-An individual membership test is the membership test of a single
+An <individual membership test> is the membership test of a single
membership_choice.
27/4
For the evaluation of a membership test using in whose
membership_choice_list has a single membership_choice, the
-tested_simple_expression and the membership_choice are evaluated in an
+<tested_>simple_expression and the membership_choice are evaluated in an
arbitrary order; the result is the result of the individual membership
test for the membership_choice.
27.1/4
For the evaluation of a membership test using in whose
membership_choice_list has more than one membership_choice, the
-tested_simple_expression of the membership test is evaluated first and
+<tested_>simple_expression of the membership test is evaluated first and
the result of the operation is equivalent to that of a sequence
consisting of an individual membership test on each membership_choice
combined with the short-circuit control form or else.
@@ -11920,47 +11947,47 @@ combined with the short-circuit control form or else.
An individual membership test yields the result True if:
28.1/4
- * The membership_choice is a choice_simple_expression, and the
- tested_simple_expression is equal to the value of the
+ * The membership_choice is a <choice_>simple_expression, and the
+ <tested_>simple_expression is equal to the value of the
membership_choice. If the tested type is a record type or a
limited type, the test uses the primitive equality for the type;
otherwise, the test uses predefined equality.
28.2/4
* The membership_choice is a range and the value of the
- tested_simple_expression belongs to the given range.
+ <tested_>simple_expression belongs to the given range.
29/4
* The membership_choice is a subtype_mark, the tested type is scalar,
- the value of the tested_simple_expression belongs to the range of
+ the value of the <tested_>simple_expression belongs to the range of
the named subtype, and the value satisfies the predicates of the
named subtype.
30/4
* The membership_choice is a subtype_mark, the tested type is not
- scalar, the value of the tested_simple_expression satisfies any
+ scalar, the value of the <tested_>simple_expression satisfies any
constraints of the named subtype, the value satisfies the
predicates of the named subtype, and:
30.1/4
- * if the type of the tested_simple_expression is
+ * if the type of the <tested_>simple_expression is
class-wide, the value has a tag that identifies a type
covered by the tested type;
30.2/4
* if the tested type is an access type and the named
subtype excludes null, the value of the
- tested_simple_expression is not null;
+ <tested_>simple_expression is not null;
30.3/4
* if the tested type is a general access-to-object type,
- the type of the tested_simple_expression is convertible
+ the type of the <tested_>simple_expression is convertible
to the tested type and its accessibility level is no
deeper than that of the tested type; further, if the
designated type of the tested type is tagged and the
- tested_simple_expression is nonnull, the tag of the
+ <tested_>simple_expression is nonnull, the tag of the
object designated by the value of the
- tested_simple_expression is covered by the designated
+ <tested_>simple_expression is covered by the designated
type of the tested type.
31/3
@@ -11981,7 +12008,7 @@ composite types and generic formal types.
NOTES
33/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
34
14 If a composite type has components that depend on
@@ -11993,28 +12020,28 @@ composite types and generic formal types.
_Examples_
35
-Examples of expressions involving relational operators and membership
-tests:
+<Examples of expressions involving relational operators and membership
+tests:>
36
X /= Y
37
- "" < "A" and "A" < "Aa" -- True
- "Aa" < "B" and "A" < "A " -- True
+ "" < "A" and "A" < "Aa" --< True>
+ "Aa" < "B" and "A" < "A " --< True>
38/3
- My_Car = null -- True if My_Car has been set to null (see
*note 3.10.1::)
- My_Car = Your_Car -- True if we both share the same car
- My_Car.all = Your_Car.all -- True if the two cars are identical
+ My_Car = null --< True if My_Car has been set to null (see
*note 3.10.1::)>
+ My_Car = Your_Car --< True if we both share the same car>
+ My_Car.all = Your_Car.all --< True if the two cars are identical>
39/3
- N not in 1 .. 10 -- range membership test
- Today in Mon .. Fri -- range membership test
- Today in Weekday -- subtype membership test (see *note 3.5.1::)
- Card in Clubs | Spades -- list membership test (see *note 3.5.1::)
- Archive in Disk_Unit -- subtype membership test (see *note 3.8.1::)
- Tree.all in Addition'Class -- class membership test (see *note 3.9.1::)
+ N not in 1 .. 10 --< range membership test>
+ Today in Mon .. Fri --< range membership test>
+ Today in Weekday --< subtype membership test (see *note
3.5.1::)>
+ Card in Clubs | Spades --< list membership test (see *note 3.5.1::)>
+ Archive in Disk_Unit --< subtype membership test (see *note
3.8.1::)>
+ Tree.all in Addition'Class --< class membership test (see *note 3.9.1::)>
File: arm2012.info, Node: 4.5.3, Next: 4.5.4, Prev: 4.5.2, Up: 4.5
@@ -12026,29 +12053,29 @@ File: arm2012.info, Node: 4.5.3, Next: 4.5.4,
Prev: 4.5.2, Up: 4.5
1
The binary adding operators + (addition) and - (subtraction) are
-predefined for every specific numeric type T with their conventional
+predefined for every specific numeric type <T> with their conventional
meaning. They have the following specifications:
2
- function "+"(Left, Right : T) return T
- function "-"(Left, Right : T) return T
+ function "+"(Left, Right : <T>) return <T>
+ function "-"(Left, Right : <T>) return <T>
3
The concatenation operators & are predefined for every nonlimited,
-one-dimensional array type T with component type C. They have the
+one-dimensional array type <T> with component type <C>. They have the
following specifications:
4
- function "&"(Left : T; Right : T) return T
- function "&"(Left : T; Right : C) return T
- function "&"(Left : C; Right : T) return T
- function "&"(Left : C; Right : C) return T
+ function "&"(Left : <T>; Right : <T>) return <T>
+ function "&"(Left : <T>; Right : <C>) return <T>
+ function "&"(Left : <C>; Right : <T>) return <T>
+ function "&"(Left : <C>; Right : <C>) return <T>
_Dynamic Semantics_
5
-For the evaluation of a concatenation with result type T, if both
-operands are of type T, the result of the concatenation is a
+For the evaluation of a concatenation with result type <T>, if both
+operands are of type <T>, the result of the concatenation is a
one-dimensional array whose length is the sum of the lengths of its
operands, and whose components comprise the components of the left
operand followed by the components of the right operand. If the left
@@ -12067,17 +12094,17 @@ follows:
is that of the left operand.
8
-The upper bound is determined by the lower bound and the length. A check
-is made that the upper bound of the result of the concatenation belongs
-to the range of the index subtype, unless the result is a null array.
-Constraint_Error is raised if this check fails.
+The upper bound is determined by the lower bound and the length. A
+check is made that the upper bound of the result of the concatenation
+belongs to the range of the index subtype, unless the result is a null
+array. Constraint_Error is raised if this check fails.
9
-If either operand is of the component type C, the result of the
+If either operand is of the component type <C>, the result of the
concatenation is given by the above rules, using in place of such an
operand an array having this operand as its only component (converted to
the component subtype) and having the lower bound of the index subtype
-of the array type as its lower bound.
+of the array type as its lower bound.
10
The result of a concatenation is defined in terms of an assignment to an
@@ -12094,15 +12121,15 @@ anonymous object, as for any function call (see *note
6.5::).
_Examples_
12
-Examples of expressions involving binary adding operators:
+<Examples of expressions involving binary adding operators:>
13
- Z + 0.1 -- Z has to be of a real type
+ Z + 0.1 --< Z has to be of a real type >
14
- "A" & "BCD" -- concatenation of two string literals
- 'A' & "BCD" -- concatenation of a character literal and a string literal
- 'A' & 'A' -- concatenation of two character literals
+ "A" & "BCD" --< concatenation of two string literals>
+ 'A' & "BCD" --< concatenation of a character literal and a string
literal>
+ 'A' & 'A' --< concatenation of two character literals >
File: arm2012.info, Node: 4.5.4, Next: 4.5.5, Prev: 4.5.3, Up: 4.5
@@ -12114,12 +12141,12 @@ File: arm2012.info, Node: 4.5.4, Next: 4.5.5,
Prev: 4.5.3, Up: 4.5
1
The unary adding operators + (identity) and - (negation) are predefined
-for every specific numeric type T with their conventional meaning. They
-have the following specifications:
+for every specific numeric type <T> with their conventional meaning.
+They have the following specifications:
2
- function "+"(Right : T) return T
- function "-"(Right : T) return T
+ function "+"(Right : <T>) return <T>
+ function "-"(Right : <T>) return <T>
NOTES
@@ -12140,13 +12167,13 @@ File: arm2012.info, Node: 4.5.5, Next: 4.5.6,
Prev: 4.5.4, Up: 4.5
1
The multiplying operators * (multiplication), / (division), mod
(modulus), and rem (remainder) are predefined for every specific integer
-type T:
+type <T>:
2
- function "*" (Left, Right : T) return T
- function "/" (Left, Right : T) return T
- function "mod"(Left, Right : T) return T
- function "rem"(Left, Right : T) return T
+ function "*" (Left, Right : <T>) return <T>
+ function "/" (Left, Right : <T>) return <T>
+ function "mod"(Left, Right : <T>) return <T>
+ function "rem"(Left, Right : <T>) return <T>
3
Signed integer multiplication has its conventional meaning.
@@ -12181,59 +12208,59 @@ is only possible for the "*" operator).
11
Multiplication and division operators are predefined for every specific
-floating point type T:
+floating point type <T>:
12
- function "*"(Left, Right : T) return T
- function "/"(Left, Right : T) return T
+ function "*"(Left, Right : <T>) return <T>
+ function "/"(Left, Right : <T>) return <T>
13
The following multiplication and division operators, with an operand of
the predefined type Integer, are predefined for every specific fixed
-point type T:
+point type <T>:
14
- function "*"(Left : T; Right : Integer) return T
- function "*"(Left : Integer; Right : T) return T
- function "/"(Left : T; Right : Integer) return T
+ function "*"(Left : <T>; Right : Integer) return <T>
+ function "*"(Left : Integer; Right : <T>) return <T>
+ function "/"(Left : <T>; Right : Integer) return <T>
15
All of the above multiplying operators are usable with an operand of an
appropriate universal numeric type. The following additional
-multiplying operators for root_real are predefined, and are usable when
-both operands are of an appropriate universal or root numeric type, and
-the result is allowed to be of type root_real, as in a
+multiplying operators for <root_real> are predefined, and are usable
+when both operands are of an appropriate universal or root numeric type,
+and the result is allowed to be of type <root_real>, as in a
number_declaration:
16
- function "*"(Left, Right : root_real) return root_real
- function "/"(Left, Right : root_real) return root_real
+ function "*"(Left, Right : <root_real>) return <root_real>
+ function "/"(Left, Right : <root_real>) return <root_real>
17
- function "*"(Left : root_real; Right : root_integer) return root_real
- function "*"(Left : root_integer; Right : root_real) return root_real
- function "/"(Left : root_real; Right : root_integer) return root_real
+ function "*"(Left : <root_real>; Right : <root_integer>) return
<root_real>
+ function "*"(Left : <root_integer>; Right : <root_real>) return
<root_real>
+ function "/"(Left : <root_real>; Right : <root_integer>) return
<root_real>
18
Multiplication and division between any two fixed point types are
provided by the following two predefined operators:
19
- function "*"(Left, Right : universal_fixed) return universal_fixed
- function "/"(Left, Right : universal_fixed) return universal_fixed
+ function "*"(Left, Right : <universal_fixed>) return <universal_fixed>
+ function "/"(Left, Right : <universal_fixed>) return <universal_fixed>
_Name Resolution Rules_
19.1/2
The above two fixed-fixed multiplying operators shall not be used in a
-context where the expected type for the result is itself universal_fixed
--- the context has to identify some other numeric type to which the
-result is to be converted, either explicitly or implicitly. Unless the
-predefined universal operator is identified using an expanded name with
-prefix denoting the package Standard, an explicit conversion is required
-on the result when using the above fixed-fixed multiplication operator
-if either operand is of a type having a user-defined primitive
-multiplication operator such that:
+context where the expected type for the result is itself
+<universal_fixed> -- the context has to identify some other numeric type
+to which the result is to be converted, either explicitly or implicitly.
+Unless the predefined universal operator is identified using an expanded
+name with prefix denoting the package Standard, an explicit conversion
+is required on the result when using the above fixed-fixed
+multiplication operator if either operand is of a type having a
+user-defined primitive multiplication operator such that:
19.2/3
* it is declared immediately within the same declaration list as the
@@ -12246,7 +12273,7 @@ multiplication operator such that:
A corresponding requirement applies to the universal fixed-fixed
division operator.
-Paragraph 20 was deleted.
+<Paragraph 20 was deleted.>
_Dynamic Semantics_
@@ -12255,15 +12282,15 @@ The multiplication and division operators for real
types have their
conventional meaning. For floating point types, the accuracy of the
result is determined by the precision of the result type. For decimal
fixed point types, the result is truncated toward zero if the
-mathematical result is between two multiples of the small of the
+mathematical result is between two multiples of the <small> of the
specific result type (possibly determined by context); for ordinary
fixed point types, if the mathematical result is between two multiples
-of the small, it is unspecified which of the two is the result.
+of the <small>, it is unspecified which of the two is the result.
22
The exception Constraint_Error is raised by integer division, rem, and
-mod if the right operand is zero. Similarly, for a real type T with
-T'Machine_Overflows True, division by zero raises Constraint_Error.
+mod if the right operand is zero. Similarly, for a real type <T> with
+<T'>Machine_Overflows True, division by zero raises Constraint_Error.
NOTES
@@ -12308,7 +12335,7 @@ T'Machine_Overflows True, division by zero raises
Constraint_Error.
_Examples_
31
-Examples of expressions involving multiplying operators:
+<Examples of expressions involving multiplying operators:>
32
I : Integer := 1;
@@ -12316,29 +12343,29 @@ Examples of expressions involving multiplying
operators:
K : Integer := 3;
33
- X : Real := 1.0; -- see *note 3.5.7::
+ X : Real := 1.0; --< see *note 3.5.7::>
Y : Real := 2.0;
34
- F : Fraction := 0.25; -- see *note 3.5.9::
+ F : Fraction := 0.25; --< see *note 3.5.9::>
G : Fraction := 0.5;
35
- Expression Value Result Type
+ <Expression> <Value> <Result Type>
- I*J 2 same as I and J, that is, Integer
- K/J 1 same as K and J, that is, Integer
- K mod J 1 same as K and J, that is, Integer
+ I*J 2 <same as I and J, that is, Integer>
+ K/J 1 <same as K and J, that is, Integer>
+ K mod J 1 <same as K and J, that is, Integer>
- X/Y 0.5 same as X and Y, that is, Real
- F/2 0.125 same as F, that is, Fraction
+ X/Y 0.5 <same as X and Y, that is, Real>
+ F/2 0.125 <same as F, that is, Fraction>
- 3*F 0.75 same as F, that is, Fraction
- 0.75*G 0.375 universal_fixed, implicitly convertible
- to any fixed point type
- Fraction(F*G) 0.125 Fraction, as stated by the conversion
- Real(J)*Y 4.0 Real, the type of both operands after
- conversion of J
+ 3*F 0.75 <same as F, that is, Fraction>
+ 0.75*G 0.375 <universal_fixed, implicitly convertible>
+ <to any fixed point type>
+ Fraction(F*G) 0.125 <Fraction, as stated by the conversion>
+ Real(J)*Y 4.0 <Real, the type of both operands after>
+ <conversion of J>
File: arm2012.info, Node: 4.5.6, Next: 4.5.7, Prev: 4.5.5, Up: 4.5
@@ -12350,19 +12377,19 @@ File: arm2012.info, Node: 4.5.6, Next: 4.5.7,
Prev: 4.5.5, Up: 4.5
1
The highest precedence unary operator abs (absolute value) is predefined
-for every specific numeric type T, with the following specification:
+for every specific numeric type <T>, with the following specification:
2
- function "abs"(Right : T) return T
+ function "abs"(Right : <T>) return <T>
3
The highest precedence unary operator not (logical negation) is
-predefined for every boolean type T, every modular type T, and for every
-one-dimensional array type T whose components are of a boolean type,
-with the following specification:
+predefined for every boolean type <T>, every modular type <T>, and for
+every one-dimensional array type <T> whose components are of a boolean
+type, with the following specification:
4
- function "not"(Right : T) return T
+ function "not"(Right : <T>) return <T>
5
The result of the operator not for a modular type is defined as the
@@ -12376,27 +12403,27 @@ The operator not that applies to a one-dimensional
array of boolean
components yields a one-dimensional boolean array with the same bounds;
each component of the result is obtained by logical negation of the
corresponding component of the operand (that is, the component that has
-the same index value). A check is made that each component of the result
-belongs to the component subtype; the exception Constraint_Error is
-raised if this check fails.
+the same index value). A check is made that each component of the
+result belongs to the component subtype; the exception Constraint_Error
+is raised if this check fails.
7
-The highest precedence exponentiation operator ** is predefined for
-every specific integer type T with the following specification:
+The highest precedence <exponentiation> operator ** is predefined for
+every specific integer type <T> with the following specification:
8
- function "**"(Left : T; Right : Natural) return T
+ function "**"(Left : <T>; Right : Natural) return <T>
9
Exponentiation is also predefined for every specific floating point type
-as well as root_real, with the following specification (where T is
-root_real or the floating point type):
+as well as <root_real>, with the following specification (where <T> is
+<root_real> or the floating point type):
10
- function "**"(Left : T; Right : Integer'Base) return T
+ function "**"(Left : <T>; Right : Integer'Base) return <T>
11/3
-The right operand of an exponentiation is the exponent. The value of
+The right operand of an exponentiation is the <exponent>. The value of
X**N with the value of the exponent N positive is the same as the value
of X*X*...X (with N-1 multiplications) except that the multiplications
are associated in an arbitrary order. With N equal to zero, the result
@@ -12419,7 +12446,7 @@ generally be 0.0.)
13
19 As implied by the specification given above for exponentiation
of an integer type, a check is made that the exponent is not
- negative. Constraint_Error is raised if this check fails.
+ negative. Constraint_Error is raised if this check fails.
File: arm2012.info, Node: 4.5.7, Next: 4.5.8, Prev: 4.5.6, Up: 4.5
@@ -12429,13 +12456,14 @@ File: arm2012.info, Node: 4.5.7, Next: 4.5.8,
Prev: 4.5.6, Up: 4.5
1/3
A conditional_expression selects for evaluation at most one of the
-enclosed dependent_expressions, depending on a decision among the
+enclosed <dependent_>expressions, depending on a decision among the
alternatives. One kind of conditional_expression is the if_expression,
-which selects for evaluation a dependent_expression depending on the
+which selects for evaluation a <dependent_>expression depending on the
value of one or more corresponding conditions. The other kind of
conditional_expression is the case_expression, which selects for
-evaluation one of a number of alternative dependent_expressions; the
-chosen alternative is determined by the value of a selecting_expression.
+evaluation one of a number of alternative <dependent_>expressions; the
+chosen alternative is determined by the value of a
+<selecting_>expression.
_Syntax_
@@ -12444,23 +12472,23 @@ chosen alternative is determined by the value of a
selecting_expression.
3/3
if_expression ::=
- if condition then dependent_expression
- {elsif condition then dependent_expression}
- [else dependent_expression]
+ if condition then <dependent_>expression
+ {elsif condition then <dependent_>expression}
+ [else <dependent_>expression]
4/3
- condition ::= boolean_expression
+ condition ::= <boolean_>expression
5/3
case_expression ::=
- case selecting_expression is
+ case <selecting_>expression is
case_expression_alternative {,
case_expression_alternative}
6/3
case_expression_alternative ::=
when discrete_choice_list =>
- dependent_expression
+ <dependent_>expression
7/3
Wherever the Syntax Rules allow an expression, a
@@ -12470,13 +12498,13 @@ chosen alternative is determined by the value of a
selecting_expression.
_Name Resolution Rules_
8/3
-If a conditional_expression is expected to be of a type T, then each
-dependent_expression of the conditional_expression is expected to be of
-type T. Similarly, if a conditional_expression is expected to be of some
-class of types, then each dependent_expression of the
+If a conditional_expression is expected to be of a type <T>, then each
+<dependent_>expression of the conditional_expression is expected to be
+of type <T>. Similarly, if a conditional_expression is expected to be
+of some class of types, then each <dependent_>expression of the
conditional_expression is subject to the same expectation. If a
-conditional_expression shall resolve to be of a type T, then each
-dependent_expression shall resolve to be of type T.
+conditional_expression shall resolve to be of a type <T>, then each
+<dependent_>expression shall resolve to be of type <T>.
9/3
The possible types of a conditional_expression are further determined as
@@ -12488,42 +12516,44 @@ follows:
conversion; otherwise,
11/3
- * If all of the dependent_expressions are of the same type, the type
- of the conditional_expression is that type; otherwise,
+ * If all of the <dependent_>expressions are of the same type, the
+ type of the conditional_expression is that type; otherwise,
12/3
- * If a dependent_expression is of an elementary type, the type of the
- conditional_expression shall be covered by that type; otherwise,
+ * If a <dependent_>expression is of an elementary type, the type of
+ the conditional_expression shall be covered by that type;
+ otherwise,
13/3
- * If the conditional_expression is expected to be of type T or shall
- resolve to type T, then the conditional_expression is of type T.
+ * If the conditional_expression is expected to be of type <T> or
+ shall resolve to type <T>, then the conditional_expression is of
+ type <T>.
14/3
A condition is expected to be of any boolean type.
15/3
-The expected type for the selecting_expression and the discrete_choices
-are as for case statements (see *note 5.4::).
+The expected type for the <selecting_>expression and the
+discrete_choices are as for case statements (see *note 5.4::).
_Legality Rules_
16/3
-All of the dependent_expressions shall be convertible (see *note 4.6::)
-to the type of the conditional_expression.
+All of the <dependent_>expressions shall be convertible (see *note
+4.6::) to the type of the conditional_expression.
17/3
If the expected type of a conditional_expression is a specific tagged
-type, all of the dependent_expressions of the conditional_expression
+type, all of the <dependent_>expressions of the conditional_expression
shall be dynamically tagged, or none shall be dynamically tagged. In
this case, the conditional_expression is dynamically tagged if all of
-the dependent_expressions are dynamically tagged, is tag-indeterminate
-if all of the dependent_expressions are tag-indeterminate, and is
+the <dependent_>expressions are dynamically tagged, is tag-indeterminate
+if all of the <dependent_>expressions are tag-indeterminate, and is
statically tagged otherwise.
18/3
-If there is no else dependent_expression, the if_expression shall be of
-a boolean type.
+If there is no else <dependent_>expression, the if_expression shall be
+of a boolean type.
19/3
All Legality Rules that apply to the discrete_choices of a
@@ -12537,20 +12567,20 @@ For the evaluation of an if_expression, the condition
specified after
if, and any conditions specified after elsif, are evaluated in
succession (treating a final else as elsif True then), until one
evaluates to True or all conditions are evaluated and yield False. If a
-condition evaluates to True, the associated dependent_expression is
+condition evaluates to True, the associated <dependent_>expression is
evaluated, converted to the type of the if_expression, and the resulting
value is the value of the if_expression. Otherwise (when there is no
else clause), the value of the if_expression is True.
21/3
-For the evaluation of a case_expression, the selecting_expression is
-first evaluated. If the value of the selecting_expression is covered by
-the discrete_choice_list of some case_expression_alternative, then the
-dependent_expression of the case_expression_alternative is evaluated,
-converted to the type of the case_expression, and the resulting value is
-the value of the case_expression. Otherwise (the value is not covered by
-any discrete_choice_list, perhaps due to being outside the base range),
-Constraint_Error is raised.
+For the evaluation of a case_expression, the <selecting_>expression is
+first evaluated. If the value of the <selecting_>expression is covered
+by the discrete_choice_list of some case_expression_alternative, then
+the <dependent_>expression of the case_expression_alternative is
+evaluated, converted to the type of the case_expression, and the
+resulting value is the value of the case_expression. Otherwise (the
+value is not covered by any discrete_choice_list, perhaps due to being
+outside the base range), Constraint_Error is raised.
File: arm2012.info, Node: 4.5.8, Prev: 4.5.7, Up: 4.5
@@ -12573,7 +12603,7 @@ existentially quantified predicates over containers and
arrays.
quantifier ::= all | some
3/3
- predicate ::= boolean_expression
+ predicate ::= <boolean_>expression
4/3
Wherever the Syntax Rules allow an expression, a
@@ -12643,7 +12673,7 @@ Explicit type conversions, both value conversions and
view conversions,
are allowed between closely related types as defined below. This
subclause also defines rules for value and view conversions to a
particular subtype of a type, both explicit ones and those implicit in
-other constructs.
+other constructs.
_Syntax_
@@ -12653,21 +12683,21 @@ other constructs.
| subtype_mark(name)
3
-The target subtype of a type_conversion is the subtype denoted by the
-subtype_mark. The operand of a type_conversion is the expression or name
-within the parentheses; its type is the operand type.
+The <target subtype> of a type_conversion is the subtype denoted by the
+subtype_mark. The <operand> of a type_conversion is the expression or
+name within the parentheses; its type is the <operand type>.
4/3
-One type is convertible to a second type if a type_conversion with the
+One type is <convertible> to a second type if a type_conversion with the
first type as operand type and the second type as target type is legal
according to the rules of this subclause. Two types are convertible if
each is convertible to the other.
5/2
A type_conversion whose operand is the name of an object is called a
-view conversion if both its target type and operand type are tagged, or
-if it appears in a call as an actual parameter of mode out or in out;
-other type_conversions are called value conversions.
+<view conversion> if both its target type and operand type are tagged,
+or if it appears in a call as an actual parameter of mode out or in out;
+other type_conversions are called <value conversions>.
_Name Resolution Rules_
@@ -12684,7 +12714,7 @@ operand of a value conversion is interpreted as an
expression.
In a view conversion for an untagged type, the target type shall be
convertible (back) to the operand type.
-Paragraphs 9 through 20 were reorganized and moved below.
+<Paragraphs 9 through 20 were reorganized and moved below.>
21/3
If there is a type (other than a root numeric type) that is an ancestor
@@ -12747,13 +12777,13 @@ both class-wide types, one of the following rules
shall apply:
tagged, private, or volatile subcomponent.
24.10/2
- * If the target type is universal_access, then the operand type shall
- be an access type.
+ * If the target type is <universal_access>, then the operand type
+ shall be an access type.
24.11/2
* If the target type is a general access-to-object type, then the
- operand type shall be universal_access or an access-to-object type.
- Further, if the operand type is not universal_access:
+ operand type shall be <universal_access> or an access-to-object
+ type. Further, if the operand type is not <universal_access>:
24.12/2
* If the target type is an access-to-variable type, then
@@ -12788,15 +12818,15 @@ both class-wide types, one of the following rules
shall apply:
24.18/2
* If the target type is a pool-specific access-to-object type, then
- the operand type shall be universal_access.
+ the operand type shall be <universal_access>.
24.19/2
* If the target type is an access-to-subprogram type, then the
- operand type shall be universal_access or an access-to-subprogram
- type. Further, if the operand type is not universal_access:
+ operand type shall be <universal_access> or an access-to-subprogram
+ type. Further, if the operand type is not <universal_access>:
24.20/3
- * The designated profiles shall be subtype conformant.
+ * The designated profiles shall be subtype conformant.
24.21/4
* The accessibility level of the operand type shall not be
@@ -12828,9 +12858,9 @@ The nominal subtype of a type_conversion is its target
subtype.
28
For the evaluation of a type_conversion that is a value conversion, the
-operand is evaluated, and then the value of the operand is converted to
-a corresponding value of the target type, if any. If there is no value
-of the target type that corresponds to the operand value,
+operand is evaluated, and then the value of the operand is <converted>
+to a <corresponding> value of the target type, if any. If there is no
+value of the target type that corresponds to the operand value,
Constraint_Error is raised; this can only happen on conversion to a
modular type, and only when the operand value is outside the base range
of the modular type. Additional rules follow:
@@ -12847,7 +12877,7 @@ of the modular type. Additional rules follow:
31
* If the target type is a decimal fixed point type, then
the result is truncated (toward 0) if the value of the
- operand is not a multiple of the small of the target
+ operand is not a multiple of the <small> of the target
type.
32
@@ -12884,7 +12914,7 @@ of the modular type. Additional rules follow:
* If the target subtype is an unconstrained array subtype,
then the bounds of the result are obtained by converting
each bound of the value of the operand to the
- corresponding index type of the target type. For each
+ corresponding index type of the target type. For each
nonnull index range, a check is made that the bounds of
the range belong to the corresponding index subtype.
@@ -12897,7 +12927,7 @@ of the modular type. Additional rules follow:
* If the component types of the array types are anonymous
access types, then a check is made that the accessibility
level of the operand type is not deeper than that of the
- target type.
+ target type.
40
* Composite (Non-Array) Type Conversion
@@ -12907,7 +12937,7 @@ of the modular type. Additional rules follow:
is that of the matching component of the operand value.
42
- * The tag of the result is that of the operand. If the
+ * The tag of the result is that of the operand. If the
operand type is class-wide, a check is made that the tag
of the operand identifies a (specific) type that is
covered by or descended from the target type.
@@ -12953,7 +12983,7 @@ of the modular type. Additional rules follow:
is not deeper than that of the declaration of the
stand-alone object; then if the check succeeds, the
accessibility level of the target type becomes that of
- the operand type.
+ the operand type.
49/2
* If the operand value is null, the result of the
@@ -13009,7 +13039,7 @@ The properties of this new view are as follows:
latter case, the value of the operand object may be used to
initialize the formal parameter without checking against any
constraint of the target subtype (as described more precisely in
- *note 6.4.1::).
+ *note 6.4.1::).
57/4
If an Accessibility_Check fails, Program_Error is raised. If a
@@ -13051,7 +13081,7 @@ assignment operation.
performed implicitly in situations where the expected type and the
actual type of a construct differ, as is permitted by the type
resolution rules (see *note 8.6::). For example, an integer
- literal is of the type universal_integer, and is implicitly
+ literal is of the type <universal_integer>, and is implicitly
converted when assigned to a target of some specific integer type.
Similarly, an actual parameter of a specific tagged type is
implicitly converted when the corresponding formal parameter is of
@@ -13083,15 +13113,15 @@ assignment operation.
_Examples_
63
-Examples of numeric type conversion:
+<Examples of numeric type conversion:>
64
- Real(2*J) -- value is converted to floating point
- Integer(1.6) -- value is 2
- Integer(-0.4) -- value is 0
+ Real(2*J) <-- value is converted to floating point>
+ Integer(1.6) <-- value is 2>
+ Integer(-0.4) <-- value is 0>
65
-Example of conversion between derived types:
+<Example of conversion between derived types:>
66
type A_Form is new B_Form;
@@ -13102,10 +13132,10 @@ Example of conversion between derived types:
68
X := A_Form(Y);
- Y := B_Form(X); -- the reverse conversion
+ Y := B_Form(X); <-- the reverse conversion >
69
-Examples of conversions between array types:
+<Examples of conversions between array types:>
70
type Sequence is array (Integer range <>) of Integer;
@@ -13113,9 +13143,9 @@ Examples of conversions between array types:
Ledger : array(1 .. 100) of Integer;
71
- Sequence(Ledger) -- bounds are those of Ledger
- Sequence(Ledger(31 .. 42)) -- bounds are 31 and 42
- Dozen(Ledger(31 .. 42)) -- bounds are those of Dozen
+ Sequence(Ledger) <-- bounds are those of Ledger>
+ Sequence(Ledger(31 .. 42)) <-- bounds are 31 and 42>
+ Dozen(Ledger(31 .. 42)) <-- bounds are those of Dozen >
File: arm2012.info, Node: 4.7, Next: 4.8, Prev: 4.6, Up: 4
@@ -13126,7 +13156,7 @@ File: arm2012.info, Node: 4.7, Next: 4.8, Prev: 4.6,
Up: 4
1
A qualified_expression is used to state explicitly the type, and to
verify the subtype, of an operand that is either an expression or an
-aggregate.
+aggregate.
_Syntax_
@@ -13137,7 +13167,7 @@ aggregate.
_Name Resolution Rules_
3
-The operand (the expression or aggregate) shall resolve to be of the
+The <operand> (the expression or aggregate) shall resolve to be of the
type determined by the subtype_mark (*note 3.2.2: S0028.), or a
universal type that covers it.
@@ -13155,7 +13185,7 @@ subtype_mark.
The evaluation of a qualified_expression evaluates the operand (and if
of a universal type, converts it to the type determined by the
subtype_mark) and checks that its value belongs to the subtype denoted
-by the subtype_mark. The exception Constraint_Error is raised if this
+by the subtype_mark. The exception Constraint_Error is raised if this
check fails. Furthermore, if predicate checks are enabled for the
subtype denoted by the subtype_mark, a check is performed as defined in
subclause *note 3.2.4::, "*note 3.2.4:: Subtype Predicates" that the
@@ -13173,23 +13203,23 @@ value satifies the predicates of the subtype.
_Examples_
6
-Examples of disambiguating expressions using qualification:
+<Examples of disambiguating expressions using qualification:>
7
type Mask is (Fix, Dec, Exp, Signif);
type Code is (Fix, Cla, Dec, Tnz, Sub);
8
- Print (Mask'(Dec)); -- Dec is of type Mask
- Print (Code'(Dec)); -- Dec is of type Code
+ Print (Mask'(Dec)); <-- Dec is of type Mask>
+ Print (Code'(Dec)); <-- Dec is of type Code >
9
- for J in Code'(Fix) .. Code'(Dec) loop ... -- qualification needed for
either Fix or Dec
- for J in Code range Fix .. Dec loop ... -- qualification unnecessary
- for J in Code'(Fix) .. Dec loop ... -- qualification unnecessary
for Dec
+ for J in Code'(Fix) .. Code'(Dec) loop ... <-- qualification needed for
either Fix or Dec>
+ for J in Code range Fix .. Dec loop ... <-- qualification unnecessary>
+ for J in Code'(Fix) .. Dec loop ... <-- qualification unnecessary
for Dec>
10
- Dozen'(1 | 3 | 5 | 7 => 2, others => 0) -- see *note 4.6::
+ Dozen'(1 | 3 | 5 | 7 => 2, others => 0) <-- see *note 4.6:: >
File: arm2012.info, Node: 4.8, Next: 4.9, Prev: 4.7, Up: 4
@@ -13199,7 +13229,7 @@ File: arm2012.info, Node: 4.8, Next: 4.9, Prev: 4.7,
Up: 4
1
The evaluation of an allocator creates an object and yields an access
-value that designates the object.
+value that designates the object.
_Syntax_
@@ -13209,7 +13239,7 @@ value that designates the object.
| new [subpool_specification] qualified_expression
2.1/3
- subpool_specification ::= (subpool_handle_name)
+ subpool_specification ::= (<subpool_handle_>name)
2.2/3
For an allocator with a subtype_indication, the subtype_indication
@@ -13219,23 +13249,22 @@ value that designates the object.
3/3
The expected type for an allocator shall be a single access-to-object
-type with designated type D such that either D covers the type
+type with designated type <D> such that either <D> covers the type
determined by the subtype_mark of the subtype_indication (*note 3.2.2:
S0027.) or qualified_expression (*note 4.7: S0142.), or the expected
-type is anonymous and the determined type is D'Class. A
-subpool_handle_name is expected to be of any type descended from
+type is anonymous and the determined type is <D>'Class. A
+<subpool_handle_>name is expected to be of any type descended from
Subpool_Handle, which is the type used to identify a subpool, declared
in package System.Storage_Pools.Subpools (see *note 13.11.4::).
_Legality Rules_
4
-An initialized allocator is an allocator with a qualified_expression. An
-uninitialized allocator is one with a subtype_indication. In the
+An <initialized> allocator is an allocator with a qualified_expression.An
<uninitialized> allocator is one with a subtype_indication. In the
subtype_indication of an uninitialized allocator, a constraint is
permitted only if the subtype_mark denotes an unconstrained composite
subtype; if there is no constraint, then the subtype_mark shall denote a
-definite subtype.
+definite subtype.
5/2
If the type of the allocator is an access-to-constant type, the
@@ -13284,15 +13313,15 @@ the designated subtype when the designated subtype is
constrained or
there is an ancestor of the designated type that has a constrained
partial view; otherwise, the created object is constrained by its
initial value (even if the designated subtype is unconstrained with
-defaults).
+defaults).
_Dynamic Semantics_
7/2
For the evaluation of an initialized allocator, the evaluation of the
-qualified_expression is performed first. An object of the designated
+qualified_expression is performed first. An object of the designated
type is created and the value of the qualified_expression is converted
-to the designated subtype and assigned to the object.
+to the designated subtype and assigned to the object.
8
For the evaluation of an uninitialized allocator, the elaboration of the
@@ -13307,8 +13336,8 @@ subtype_indication is performed first. Then:
type is created with tag, if any, determined by the subtype_mark of
the subtype_indication. This object is then initialized by default
(see *note 3.3.1::) using the subtype_indication to determine its
- nominal subtype. A check is made that the value of the object
- belongs to the designated subtype. Constraint_Error is raised if
+ nominal subtype. A check is made that the value of the object
+ belongs to the designated subtype. Constraint_Error is raised if
this check fails. This check and the initialization of the object
are performed in an arbitrary order.
@@ -13323,24 +13352,23 @@ tag of the value if the type of the
qualified_expression is class-wide)
has one or more access discriminants, then a check is made that the
accessibility level of the anonymous access type of each access
discriminant is not deeper than that of the type of the allocator.
-Program_Error is raised if either such check fails.
+Program_Error is raised if either such check fails.
10.2/2
If the object to be created by an allocator has a controlled or
protected part, and the finalization of the collection of the type of
-the allocator (see *note 7.6.1::) has started, Program_Error is raised.
-
+the allocator (see *note 7.6.1::) has started, Program_Error is raised.
10.3/2
If the object to be created by an allocator contains any tasks, and the
master of the type of the allocator is completed, and all of the
dependent tasks of the master are terminated (see *note 9.3::), then
-Program_Error is raised.
+Program_Error is raised.
10.4/3
-If the allocator includes a subpool_handle_name, Constraint_Error is
+If the allocator includes a <subpool_handle_>name, Constraint_Error is
raised if the subpool handle is null. Program_Error is raised if the
-subpool does not belong (see *note 13.11.4::) to the storage pool of the
-access type of the allocator.
+subpool does not <belong> (see *note 13.11.4::) to the storage pool of
+the access type of the allocator.
11
If the created object contains any tasks, they are activated (see *note
@@ -13350,7 +13378,7 @@ returned.
_Bounded (Run-Time) Errors_
11.1/2
- It is a bounded error if the finalization of the collection of the type
+It is a bounded error if the finalization of the collection of the type
(see *note 7.6.1::) of the allocator has started. If the error is
detected, Program_Error is raised. Otherwise, the allocation proceeds
normally.
@@ -13369,7 +13397,7 @@ normally.
14
26 As explained in *note 13.11::, "*note 13.11:: Storage
Management", the storage for an object allocated by an allocator
- comes from a storage pool (possibly user defined). The exception
+ comes from a storage pool (possibly user defined). The exception
Storage_Error is raised by an allocator if there is not enough
storage. Instances of Unchecked_Deallocation may be used to
explicitly reclaim storage.
@@ -13381,24 +13409,24 @@ normally.
_Examples_
16
-Examples of allocators:
+<Examples of allocators:>
17
- new Cell'(0, null, null) -- initialized
explicitly, see *note 3.10.1::
- new Cell'(Value => 0, Succ => null, Pred => null) -- initialized
explicitly
- new Cell -- not initialized
+ new Cell'(0, null, null) <-- initialized
explicitly, see *note 3.10.1::>
+ new Cell'(Value => 0, Succ => null, Pred => null) <-- initialized
explicitly>
+ new Cell <-- not initialized>
18
- new Matrix(1 .. 10, 1 .. 20) -- the bounds only are
given
- new Matrix'(1 .. 10 => (1 .. 20 => 0.0)) -- initialized
explicitly
+ new Matrix(1 .. 10, 1 .. 20) <-- the bounds only are
given>
+ new Matrix'(1 .. 10 => (1 .. 20 => 0.0)) <-- initialized
explicitly>
19
- new Buffer(100) -- the discriminant
only is given
- new Buffer'(Size => 80, Pos => 0, Value => (1 .. 80 => 'A')) --
initialized explicitly
+ new Buffer(100) <-- the discriminant
only is given>
+ new Buffer'(Size => 80, Pos => 0, Value => (1 .. 80 => 'A')) <--
initialized explicitly>
20
- Expr_Ptr'(new Literal) -- allocator for
access-to-class-wide type, see *note 3.9.1::
- Expr_Ptr'(new Literal'(Expression with 3.5)) -- initialized
explicitly
+ Expr_Ptr'(new Literal) <-- allocator for
access-to-class-wide type, see *note 3.9.1::>
+ Expr_Ptr'(new Literal'(Expression with 3.5)) <-- initialized
explicitly>
File: arm2012.info, Node: 4.9, Prev: 4.8, Up: 4
@@ -13409,9 +13437,9 @@ File: arm2012.info, Node: 4.9, Prev: 4.8, Up: 4
1
Certain expressions of a scalar or string type are defined to be static.
Similarly, certain discrete ranges are defined to be static, and certain
-scalar and string subtypes are defined to be static subtypes. Static
+scalar and string subtypes are defined to be static subtypes. <Static>
means determinable at compile time, using the declared properties or
-values of the program entities.
+values of the program entities.
2
A static expression is a scalar or string expression that is one of the
@@ -13428,9 +13456,9 @@ following:
constant;
6
- * a function_call whose function_name or function_prefix statically
- denotes a static function, and whose actual parameters, if any
- (whether given explicitly or by default), are all static
+ * a function_call whose <function_>name or <function_>prefix
+ statically denotes a static function, and whose actual parameters,
+ if any (whether given explicitly or by default), are all static
expressions;
7
@@ -13452,10 +13480,10 @@ following:
or string) subtype, and whose operand is a static expression;
11/4
- * a membership test whose tested_simple_expression is a static
+ * a membership test whose <tested_>simple_expression is a static
expression, and whose membership_choice_list consists only of
membership_choices that are either static
- choice_simple_expressions, static ranges, or subtype_marks that
+ <choice_>simple_expressions, static ranges, or subtype_marks that
denote a static (scalar or string) subtype;
12
@@ -13464,14 +13492,14 @@ following:
12.1/3
* a conditional_expression all of whose conditions,
- selecting_expressions, and dependent_expressions are static
+ <selecting_>expressions, and <dependent_>expressions are static
expressions;
13
* a static expression enclosed in parentheses.
14
-A name statically denotes an entity if it denotes the entity and:
+A name <statically denotes> an entity if it denotes the entity and:
15
* It is a direct_name, expanded name, or character_literal, and it
@@ -13486,7 +13514,7 @@ A name statically denotes an entity if it denotes the
entity and:
denotes the renamed entity.
18
-A static function is one of the following:
+A <static function> is one of the following:
19
* a predefined operator whose parameter and result types are all
@@ -13508,7 +13536,7 @@ A static function is one of the following:
In any case, a generic formal subprogram is not a static function.
24
-A static constant is a constant view declared by a full constant
+A <static constant> is a constant view declared by a full constant
declaration or an object_renaming_declaration (*note 8.5.1: S0200.) with
a static nominal subtype, having a value defined by a static scalar
expression or by a static string expression whose value has a length not
@@ -13516,28 +13544,29 @@ exceeding the maximum length of a string_literal
(*note 2.6: S0016.) in
the implementation.
25
-A static range is a range whose bounds are static expressions, or a
+A <static range> is a range whose bounds are static expressions, or a
range_attribute_reference (*note 4.1.4: S0102.) that is equivalent to
-such a range. A static discrete_range (*note 3.6.1: S0058.) is one that
-is a static range or is a subtype_indication (*note 3.2.2: S0027.) that
-defines a static scalar subtype. The base range of a scalar type is a
-static range, unless the type is a descendant of a formal scalar type.
+such a range. A <static discrete_range (*note 3.6.1: S0058.)> is one
+that is a static range or is a subtype_indication (*note 3.2.2: S0027.)
+that defines a static scalar subtype. The base range of a scalar type
+is a static range, unless the type is a descendant of a formal scalar
+type.
26/3
-A static subtype is either a static scalar subtype or a static string
-subtype. A static scalar subtype is an unconstrained scalar subtype
-whose type is not a descendant of a formal type, or a constrained scalar
-subtype formed by imposing a compatible static constraint on a static
-scalar subtype. A static string subtype is an unconstrained string
-subtype whose index subtype and component subtype are static, or a
-constrained string subtype formed by imposing a compatible static
-constraint on a static string subtype. In any case, the subtype of a
-generic formal object of mode in out, and the result subtype of a
-generic formal function, are not static. Also, a subtype is not static
-if any Dynamic_Predicate specifications apply to it.
+A <static subtype> is either a <static scalar subtype> or a <static
+string subtype>. A static scalar subtype is an unconstrained scalar
+subtype whose type is not a descendant of a formal type, or a
+constrained scalar subtype formed by imposing a compatible static
+constraint on a static scalar subtype. A static string subtype is an
+unconstrained string subtype whose index subtype and component subtype
+are static, or a constrained string subtype formed by imposing a
+compatible static constraint on a static string subtype. In any case,
+the subtype of a generic formal object of mode in out, and the result
+subtype of a generic formal function, are not static. Also, a subtype
+is not static if any Dynamic_Predicate specifications apply to it.
27
-The different kinds of static constraint are defined as follows:
+The different kinds of <static constraint> are defined as follows:
28
* A null constraint is always static;
@@ -13560,39 +13589,39 @@ In any case, the constraint of the first subtype of a
scalar formal type
is neither static nor null.
32
-A subtype is statically constrained if it is constrained, and its
-constraint is static. An object is statically constrained if its
+A subtype is <statically constrained> if it is constrained, and its
+constraint is static. An object is <statically constrained> if its
nominal subtype is statically constrained, or if it is a static string
constant.
_Legality Rules_
32.1/3
-An expression is statically unevaluated if it is part of:
+An expression is <statically unevaluated> if it is part of:
32.2/3
* the right operand of a static short-circuit control form whose
value is determined by its left operand; or
32.3/3
- * a dependent_expression of an if_expression whose associated
+ * a <dependent_>expression of an if_expression whose associated
condition is static and equals False; or
32.4/3
- * a condition or dependent_expression of an if_expression where the
+ * a condition or <dependent_>expression of an if_expression where the
condition corresponding to at least one preceding
- dependent_expression of the if_expression is static and equals
+ <dependent_>expression of the if_expression is static and equals
True; or
32.5/3
- * a dependent_expression of a case_expression whose
- selecting_expression is static and whose value is not covered by
+ * a <dependent_>expression of a case_expression whose
+ <selecting_>expression is static and whose value is not covered by
the corresponding discrete_choice_list; or
32.6/4
- * a choice_simple_expression (or a simple_expression of a range that
- occurs as a membership_choice of a membership_choice_list) of a
- static membership test that is preceded in the enclosing
+ * a <choice_>simple_expression (or a simple_expression of a range
+ that occurs as a membership_choice of a membership_choice_list) of
+ a static membership test that is preceded in the enclosing
membership_choice_list by another item whose individual membership
test (see *note 4.5.2::) statically yields True.
@@ -13614,11 +13643,11 @@ For a static expression that is evaluated:
Otherwise, the value may be arbitrarily large or small.
36/2
- * If the expression is of type universal_real and its expected type
+ * If the expression is of type <universal_real> and its expected type
is a decimal fixed point type, then its value shall be a multiple
- of the small of the decimal type. This restriction does not apply
- if the expected type is a descendant of a formal scalar type (or a
- corresponding actual type in an instance).
+ of the <small> of the decimal type. This restriction does not
+ apply if the expected type is a descendant of a formal scalar type
+ (or a corresponding actual type in an instance).
37/2
In addition to the places where Legality Rules normally apply (see *note
@@ -13664,21 +13693,21 @@ target system.
_Examples_
41
-Examples of static expressions:
+<Examples of static expressions:>
42
- 1 + 1 -- 2
- abs(-10)*3 -- 30
+ 1 + 1 <-- 2>
+ abs(-10)*3 <-- 30>
43
Kilo : constant := 1000;
- Mega : constant := Kilo*Kilo; -- 1_000_000
+ Mega : constant := Kilo*Kilo; <-- 1_000_000>
Long : constant := Float'Digits*2;
44
- Half_Pi : constant := Pi/2; -- see *note 3.3.2::
+ Half_Pi : constant := Pi/2; <-- see *note 3.3.2::>
Deg_To_Rad : constant := Half_Pi/90;
- Rad_To_Deg : constant := 1.0/Deg_To_Rad; -- equivalent to
1.0/((3.14159_26536/2)/90)
+ Rad_To_Deg : constant := 1.0/Deg_To_Rad; <-- equivalent to
1.0/((3.14159_26536/2)/90)>
* Menu:
@@ -13693,7 +13722,7 @@ File: arm2012.info, Node: 4.9.1, Up: 4.9
_Static Semantics_
1/2
-A constraint statically matches another constraint if:
+A constraint <statically matches> another constraint if:
1.1/2
* both are null constraints;
@@ -13712,7 +13741,7 @@ A constraint statically matches another constraint if:
* both are nonstatic and come from the same formal_type_declaration.
2/3
-A subtype statically matches another subtype of the same type if they
+A subtype <statically matches> another subtype of the same type if they
have statically matching constraints, all predicate specifications that
apply to them come from the same declarations, and, for access subtypes,
either both or neither exclude null. Two anonymous access-to-object
@@ -13723,43 +13752,43 @@ statically match if their designated profiles are
subtype conformant,
and either both or neither exclude null.
3
-Two ranges of the same type statically match if both result from the
+Two ranges of the same type <statically match> if both result from the
same evaluation of a range, or if both are static and have equal
corresponding bounds.
4/3
-A constraint is statically compatible with a scalar subtype if it
+A constraint is <statically compatible> with a scalar subtype if it
statically matches the constraint of the subtype, or if both are static
-and the constraint is compatible with the subtype. A constraint is
-statically compatible with an access or composite subtype if it
+and the constraint is compatible with the subtype. A constraint is
+<statically compatible> with an access or composite subtype if it
statically matches the constraint of the subtype, or if the subtype is
unconstrained.
5/3
Two statically matching subtypes are statically compatible with each
-other. In addition, a subtype S1 is statically compatible with a
-subtype S2 if:
+other. In addition, a subtype <S1> is statically compatible with a
+subtype <S2> if:
6/3
- * the constraint of S1 is statically compatible with S2, and
+ * the constraint of <S1> is statically compatible with <S2>, and
7/3
- * if S2 excludes null, so does S1, and
+ * if <S2> excludes null, so does <S1>, and
8/3
* either:
9/3
- * all predicate specifications that apply to S2 apply also
- to S1, or
+ * all predicate specifications that apply to <S2> apply
+ also to <S1>, or
10/4
* both subtypes are static, every value that satisfies the
- predicates of S1 also satisfies the predicates of S2, and
- it is not the case that both types each have at least one
- applicable predicate specification, predicate checks are
- enabled (see *note 11.4.2::) for S2, and predicate checks
- are not enabled for S1.
+ predicates of <S1> also satisfies the predicates of <S2>,
+ and it is not the case that both types each have at least
+ one applicable predicate specification, predicate checks
+ are enabled (see *note 11.4.2::) for <S2>, and predicate
+ checks are not enabled for <S1>.
File: arm2012.info, Node: 5, Next: 6, Prev: 4, Up: Top
@@ -13835,7 +13864,7 @@ and other compound_statements.
null_statement ::= null;
7
- label ::= <<label_statement_identifier>>
+ label ::= <<<label_>statement_identifier>>
8
statement_identifier ::= direct_name
@@ -13879,7 +13908,7 @@ null_statement follows the labels before any following
constructs.
The execution of a null_statement has no effect.
14/2
-A transfer of control is the run-time action of an exit_statement,
+A <transfer of control> is the run-time action of an exit_statement,
return statement, goto_statement, or requeue_statement, selection of a
terminate_alternative, raising of an exception, or an abort, which
causes the next action performed to be one other than what would
@@ -13908,7 +13937,7 @@ completed.
_Examples_
17
-Examples of labeled statements:
+<Examples of labeled statements:>
18
<<Here>> <<Ici>> <<Aqui>> <<Hier>> null;
@@ -13930,40 +13959,39 @@ the result of evaluating an expression.
2
assignment_statement ::=
- variable_name := expression;
+ <variable_>name := expression;
3
The execution of an assignment_statement includes the evaluation of the
-expression and the assignment of the value of the expression into the
-target. An assignment operation (as opposed to an assignment_statement
-(*note 5.2: S0152.)) is performed in other contexts as well, including
-object initialization and by-copy parameter passing. The target of an
-assignment operation is the view of the object to which a value is being
-assigned; the target of an assignment_statement (*note 5.2: S0152.) is
-the variable denoted by the variable_name.
+expression and the <assignment> of the value of the expression into the
+<target>. An assignment operation (as opposed to an
+assignment_statement (*note 5.2: S0152.)) is performed in other contexts
+as well, including object initialization and by-copy parameter passing.The
<target> of an assignment operation is the view of the object to
+which a value is being assigned; the target of an assignment_statement
+(*note 5.2: S0152.) is the variable denoted by the <variable_>name.
_Name Resolution Rules_
4/2
-The variable_name of an assignment_statement is expected to be of any
-type. The expected type for the expression is the type of the target.
+The <variable_>name of an assignment_statement is expected to be of any
+type. The expected type for the expression is the type of the target.
_Legality Rules_
5/2
-The target denoted by the variable_name shall be a variable of a
+The target denoted by the <variable_>name shall be a variable of a
nonlimited type.
6
-If the target is of a tagged class-wide type T'Class, then the
-expression shall either be dynamically tagged, or of type T and
+If the target is of a tagged class-wide type <T>'Class, then the
+expression shall either be dynamically tagged, or of type <T> and
tag-indeterminate (see *note 3.9.2::).
_Dynamic Semantics_
7
-For the execution of an assignment_statement, the variable_name and the
-expression are first evaluated in an arbitrary order.
+For the execution of an assignment_statement, the <variable_>name and
+the expression are first evaluated in an arbitrary order.
8
When the type of the target is class-wide:
@@ -13980,13 +14008,13 @@ When the type of the target is class-wide:
11
The value of the expression is converted to the subtype of the target.
-The conversion might raise an exception (see *note 4.6::).
+The conversion might raise an exception (see *note 4.6::).
12
In cases involving controlled types, the target is finalized, and an
anonymous object might be used as an intermediate in the assignment, as
described in *note 7.6.1::, "*note 7.6.1:: Completion and Finalization".
-In any case, the converted value of the expression is then assigned to
+In any case, the converted value of the expression is then <assigned> to
the target, which consists of the following two steps:
13
@@ -13994,7 +14022,7 @@ the target, which consists of the following two steps:
14/3
* If any part of the target is controlled, its value is adjusted as
- explained in subclause *note 7.6::.
+ explained in subclause *note 7.6::.
NOTES
@@ -14003,27 +14031,27 @@ the target, which consists of the following two steps:
assignment_statement does not change the tag of the target.
16/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Examples_
17
-Examples of assignment statements:
+<Examples of assignment statements:>
18
Value := Max_Value - 1;
Shade := Blue;
19
- Next_Frame(F)(M, N) := 2.5; -- see *note 4.1.1::
- U := Dot_Product(V, W); -- see *note 6.3::
+ Next_Frame(F)(M, N) := 2.5; --< see *note 4.1.1::>
+ U := Dot_Product(V, W); --< see *note 6.3::>
20/4
- Writer := (Status => Open, Unit => Printer, Line_Count => 60); -- see
*note 3.8.1::
- Next.all := (72074, null, Head); -- see *note 3.10.1::
+ Writer := (Status => Open, Unit => Printer, Line_Count => 60); --< see
*note 3.8.1::>
+ Next.all := (72074, null, Head); --< see *note 3.10.1::>
21
-Examples involving scalar subtype conversions:
+<Examples involving scalar subtype conversions:>
22
I, J : Integer range 1 .. 10 := 5;
@@ -14031,12 +14059,12 @@ Examples involving scalar subtype conversions:
...
23
- I := J; -- identical ranges
- K := J; -- compatible ranges
- J := K; -- will raise Constraint_Error if K > 10
+ I := J; --< identical ranges>
+ K := J; --< compatible ranges>
+ J := K; --< will raise Constraint_Error if K > 10>
24
-Examples involving array subtype conversions:
+<Examples involving array subtype conversions:>
25
A : String(1 .. 31);
@@ -14044,20 +14072,21 @@ Examples involving array subtype conversions:
...
26
- A := B; -- same number of components
+ A := B; --< same number of components>
27
A(1 .. 9) := "tar sauce";
- A(4 .. 12) := A(1 .. 9); -- A(1 .. 12) = "tartar sauce"
+ A(4 .. 12) := A(1 .. 9); --< A(1 .. 12) = "tartar sauce">
NOTES
28
- 3 Notes on the examples: Assignment_statements are allowed even in
- the case of overlapping slices of the same array, because the
- variable_name and expression are both evaluated before copying the
- value into the variable. In the above example, an implementation
- yielding A(1 .. 12) = "tartartartar" would be incorrect.
+ 3 <Notes on the examples:> Assignment_statements are allowed even
+ in the case of overlapping slices of the same array, because the
+ <variable_>name and expression are both evaluated before copying
+ the value into the variable. In the above example, an
+ implementation yielding A(1 .. 12) = "tartartartar" would be
+ incorrect.
File: arm2012.info, Node: 5.3, Next: 5.4, Prev: 5.2, Up: 5
@@ -14082,7 +14111,7 @@ corresponding conditions.
sequence_of_statements]
end if;
-Paragraphs 3 and 4 were deleted.
+<Paragraphs 3 and 4 were deleted.>
_Dynamic Semantics_
@@ -14097,7 +14126,7 @@ executed; otherwise, none of them is executed.
_Examples_
6
-Examples of if statements:
+<Examples of if statements:>
7
if Month = December and Day = 31 then
@@ -14117,7 +14146,7 @@ Examples of if statements:
end if;
9
- if My_Car.Owner.Vehicle /= My_Car then -- see *note 3.10.1::
+ if My_Car.Owner.Vehicle /= My_Car then --< see *note 3.10.1::>
Report ("Incorrect data");
end if;
@@ -14136,7 +14165,7 @@ of an expression.
2/3
case_statement ::=
- case selecting_expression is
+ case <selecting_>expression is
case_statement_alternative
{case_statement_alternative}
end case;
@@ -14149,9 +14178,9 @@ of an expression.
_Name Resolution Rules_
4/3
-The selecting_expression is expected to be of any discrete type. The
+The <selecting_>expression is expected to be of any discrete type. The
expected type for each discrete_choice is the type of the
-selecting_expression.
+<selecting_>expression.
_Legality Rules_
@@ -14162,26 +14191,26 @@ others, if present, shall appear alone and in the last
discrete_choice_list.
6/3
-The possible values of the selecting_expression shall be covered (see
+The possible values of the <selecting_>expression shall be covered (see
*note 3.8.1::) as follows:
7/4
- * If the selecting_expression is a name (including a type_conversion,
- qualified_expression, or function_call) having a static and
- constrained nominal subtype, then each non-others discrete_choice
- shall cover only values in that subtype that satisfy its predicates
- (see *note 3.2.4::), and each value of that subtype that satisfies
- its predicates shall be covered by some discrete_choice (either
- explicitly or by others).
+ * If the <selecting_>expression is a name (including a
+ type_conversion, qualified_expression, or function_call) having a
+ static and constrained nominal subtype, then each non-others
+ discrete_choice shall cover only values in that subtype that
+ satisfy its predicates (see *note 3.2.4::), and each value of that
+ subtype that satisfies its predicates shall be covered by some
+ discrete_choice (either explicitly or by others).
8/3
- * If the type of the selecting_expression is root_integer,
- universal_integer, or a descendant of a formal scalar type, then
+ * If the type of the <selecting_>expression is <root_integer>,
+ <universal_integer>, or a descendant of a formal scalar type, then
the case_statement shall have an others discrete_choice.
9/3
* Otherwise, each value of the base range of the type of the
- selecting_expression shall be covered (either explicitly or by
+ <selecting_>expression shall be covered (either explicitly or by
others).
10
@@ -14191,11 +14220,11 @@ same value.
_Dynamic Semantics_
11/3
-For the execution of a case_statement the selecting_expression is first
-evaluated.
+For the execution of a case_statement the <selecting_>expression is
+first evaluated.
12/3
-If the value of the selecting_expression is covered by the
+If the value of the <selecting_>expression is covered by the
discrete_choice_list (*note 3.8.1: S0073.) of some
case_statement_alternative (*note 5.4: S0155.), then the
sequence_of_statements (*note 5.1: S0145.) of the _alternative is
@@ -14216,7 +14245,7 @@ due to being outside the base range), Constraint_Error
is raised.
_Examples_
15
-Examples of case statements:
+<Examples of case statements:>
16
case Sensor is
@@ -14258,10 +14287,10 @@ executed repeatedly, zero or more times.
2
loop_statement ::=
- [loop_statement_identifier:]
+ [<loop_>statement_identifier:]
[iteration_scheme] loop
sequence_of_statements
- end loop [loop_identifier];
+ end loop [<loop_>identifier];
3/3
iteration_scheme ::= while condition
@@ -14273,14 +14302,14 @@ executed repeatedly, zero or more times.
defining_identifier in [reverse] discrete_subtype_definition
5
- If a loop_statement has a loop_statement_identifier, then the
+ If a loop_statement has a <loop_>statement_identifier, then the
identifier shall be repeated after the end loop; otherwise, there
shall not be an identifier after the end loop.
_Static Semantics_
6
-A loop_parameter_specification declares a loop parameter, which is an
+A loop_parameter_specification declares a <loop parameter>, which is an
object whose subtype is that defined by the discrete_subtype_definition.
_Dynamic Semantics_
@@ -14311,9 +14340,9 @@ null range, the execution of the loop_statement is
complete. Otherwise,
the sequence_of_statements (*note 5.1: S0145.) is executed once for each
value of the discrete subtype defined by the discrete_subtype_definition
(*note 3.6: S0055.) that satisfies the predicates of the subtype (or
-until the loop is left as a consequence of a transfer of control). Prior
-to each such iteration, the corresponding value of the discrete subtype
-is assigned to the loop parameter. These values are assigned in
+until the loop is left as a consequence of a transfer of control).
+Prior to each such iteration, the corresponding value of the discrete
+subtype is assigned to the loop parameter. These values are assigned in
increasing order unless the reserved word reverse is present, in which
case the values are assigned in decreasing order.
@@ -14349,7 +14378,7 @@ iteration_scheme being for iterator_specification, see
*note 5.5.2::.
_Examples_
14
-Example of a loop statement without an iteration scheme:
+<Example of a loop statement without an iteration scheme:>
15
loop
@@ -14358,7 +14387,7 @@ Example of a loop statement without an iteration scheme:
end loop;
16
-Example of a loop statement with a while iteration scheme:
+<Example of a loop statement with a while iteration scheme:>
17
while Bid(N).Price < Cut_Off.Price loop
@@ -14367,21 +14396,21 @@ Example of a loop statement with a while iteration
scheme:
end loop;
18
-Example of a loop statement with a for iteration scheme:
+<Example of a loop statement with a for iteration scheme:>
19
- for J in Buffer'Range loop -- works even with a null range
+ for J in Buffer'Range loop --< works even with a null range>
if Buffer(J) /= Space then
Put(Buffer(J));
end if;
end loop;
20
-Example of a loop statement with a name:
+<Example of a loop statement with a name:>
21
Summation:
- while Next /= Head loop -- see *note 3.10.1::
+ while Next /= Head loop --< see *note 3.10.1::>
Sum := Sum + Next.Value;
Next := Next.Succ;
end loop Summation;
@@ -14425,49 +14454,50 @@ The following language-defined generic library
package exists:
end Ada.Iterator_Interfaces;
6/3
-An iterator type is a type descended from the Forward_Iterator interface
-from some instance of Ada.Iterator_Interfaces. A reversible iterator
-type is a type descended from the Reversible_Iterator interface from
-some instance of Ada.Iterator_Interfaces. An iterator object is an
-object of an iterator type. A reversible iterator object is an object
-of a reversible iterator type. The formal subtype Cursor from the
-associated instance of Ada.Iterator_Interfaces is the iteration cursor
-subtype for the iterator type.
+An <iterator type> is a type descended from the Forward_Iterator
+interface from some instance of Ada.Iterator_Interfaces. A <reversible
+iterator type> is a type descended from the Reversible_Iterator
+interface from some instance of Ada.Iterator_Interfaces. An <iterator
+object> is an object of an iterator type. A <reversible iterator
+object> is an object of a reversible iterator type. The formal subtype
+Cursor from the associated instance of Ada.Iterator_Interfaces is the
+<iteration cursor subtype> for the iterator type.
7/3
The following type-related operational aspects may be specified for an
-indexable container type T (see *note 4.1.6::):
+indexable container type <T> (see *note 4.1.6::):
8/3
Default_Iterator
This aspect is specified by a name that denotes exactly
one function declared immediately within the same
- declaration list in which T is declared, whose first
- parameter is of type T or T'Class or an access parameter
- whose designated type is type T or T'Class, whose other
- parameters, if any, have default expressions, and whose
- result type is an iterator type. This function is the
- default iterator function for T. Its result subtype is
- the default iterator subtype for T. The iteration cursor
- subtype for the default iterator subtype is the default
- cursor subtype for T.
+ declaration list in which <T> is declared, whose first
+ parameter is of type <T> or <T>'Class or an access
+ parameter whose designated type is type <T> or <T>'Class,
+ whose other parameters, if any, have default expressions,
+ and whose result type is an iterator type. This function
+ is the <default iterator function> for <T>. Its result
+ subtype is the <default iterator subtype> for <T>. The
+ iteration cursor subtype for the default iterator subtype
+ is the <default cursor subtype> for <T>.
9/3
Iterator_Element
This aspect is specified by a name that denotes a
- subtype. This is the default element subtype for T.
+ subtype. This is the <default element subtype> for <T>.
10/3
-These aspects are inherited by descendants of type T (including
-T'Class).
+These aspects are inherited by descendants of type <T> (including
+<T>'Class).
11/3
-An iterable container type is an indexable container type with specified
-Default_Iterator and Iterator_Element aspects. A reversible iterable
-container type is an iterable container type with the default iterator
-type being a reversible iterator type. An iterable container object is
-an object of an iterable container type. A reversible iterable
-container object is an object of a reversible iterable container type.
+An <iterable container type> is an indexable container type with
+specified Default_Iterator and Iterator_Element aspects. A <reversible
+iterable container type> is an iterable container type with the default
+iterator type being a reversible iterator type. An <iterable container
+object> is an object of an iterable container type. A <reversible
+iterable container object> is an object of a reversible iterable
+container type.
11.1/4
The Default_Iterator and Iterator_Element aspects are nonoverridable
@@ -14476,45 +14506,47 @@ The Default_Iterator and Iterator_Element aspects are
nonoverridable
_Legality Rules_
12/3
-The Constant_Indexing aspect (if any) of an iterable container type T
+The Constant_Indexing aspect (if any) of an iterable container type <T>
shall denote exactly one function with the following properties:
13/3
* the result type of the function is covered by the default element
- type of T or is a reference type (see *note 4.1.5::) with an access
- discriminant designating a type covered by the default element type
- of T;
+ type of <T> or is a reference type (see *note 4.1.5::) with an
+ access discriminant designating a type covered by the default
+ element type of <T>;
14/3
* the type of the second parameter of the function covers the default
- cursor type for T;
+ cursor type for <T>;
15/3
* if there are more than two parameters, the additional parameters
all have default expressions.
16/3
-This function (if any) is the default constant indexing function for T.
+This function (if any) is the <default constant indexing function> for
+<T>.
17/3
-The Variable_Indexing aspect (if any) of an iterable container type T
+The Variable_Indexing aspect (if any) of an iterable container type <T>
shall denote exactly one function with the following properties:
18/3
* the result type of the function is a reference type (see *note
4.1.5::) with an access discriminant designating a type covered by
- the default element type of T;
+ the default element type of <T>;
19/3
* the type of the second parameter of the function covers the default
- cursor type for T;
+ cursor type for <T>;
20/3
* if there are more than two parameters, the additional parameters
all have default expressions.
21/3
-This function (if any) is the default variable indexing function for T.
+This function (if any) is the <default variable indexing function> for
+<T>.
File: arm2012.info, Node: 5.5.2, Prev: 5.5.1, Up: 5.5
@@ -14530,50 +14562,50 @@ iterator_specification.
2/3
iterator_specification ::=
- defining_identifier in [reverse] iterator_name
+ defining_identifier in [reverse] <iterator_>name
| defining_identifier [:
- subtype_indication] of [reverse] iterable_name
+ subtype_indication] of [reverse] <iterable_>name
_Name Resolution Rules_
3/3
-For the first form of iterator_specification, called a generalized
-iterator, the expected type for the iterator_name is any iterator type.
-For the second form of iterator_specification, the expected type for the
-iterable_name is any array or iterable container type. If the
-iterable_name denotes an array object, the iterator_specification is
-called an array component iterator; otherwise it is called a container
-element iterator.
+For the first form of iterator_specification, called a <generalized
+iterator>, the expected type for the <iterator_>name is any iterator
+type. For the second form of iterator_specification, the expected type
+for the <iterable_>name is any array or iterable container type. If the
+<iterable_>name denotes an array object, the iterator_specification is
+called an <array component iterator>; otherwise it is called a
+<container element iterator>.
_Legality Rules_
4/3
If the reserved word reverse appears, the iterator_specification is a
-reverse iterator; otherwise it is a forward iterator. In a reverse
-generalized iterator, the iterator_name shall be of a reversible
+<reverse iterator>; otherwise it is a <forward iterator>. In a reverse
+generalized iterator, the <iterator_>name shall be of a reversible
iterator type. In a reverse container element iterator, the default
-iterator type for the type of the iterable_name shall be a reversible
+iterator type for the type of the <iterable_>name shall be a reversible
iterator type.
5/4
The subtype defined by the subtype_indication, if any, of an array
component iterator shall statically match the component subtype of the
-type of the iterable_name. The subtype defined by the
+type of the <iterable_>name. The subtype defined by the
subtype_indication, if any, of a container element iterator shall
statically match the default element subtype for the type of the
-iterable_name.
+<iterable_>name.
6/3
-In a container element iterator whose iterable_name has type T, if the
-iterable_name denotes a constant or the Variable_Indexing aspect is not
-specified for T, then the Constant_Indexing aspect shall be specified
-for T.
+In a container element iterator whose <iterable_>name has type <T>, if
+the <iterable_>name denotes a constant or the Variable_Indexing aspect
+is not specified for <T>, then the Constant_Indexing aspect shall be
+specified for <T>.
6.1/4
-The iterator_name or iterable_name of an iterator_specification shall
-not denote a subcomponent that depends on discriminants of an object
-whose nominal subtype is unconstrained, unless the object is known to be
-constrained.
+The <iterator_>name or <iterable_>name of an iterator_specification
+shall not denote a subcomponent that depends on discriminants of an
+object whose nominal subtype is unconstrained, unless the object is
+known to be constrained.
6.2/4
A container element iterator is illegal if the call of the default
@@ -14581,32 +14613,32 @@ iterator function that creates the loop iterator (see
below) is illegal.
6.3/4
A generalized iterator is illegal if the iteration cursor subtype of the
-iterator_name is a limited type at the point of the generalized
+<iterator_>name is a limited type at the point of the generalized
iterator. A container element iterator is illegal if the default cursor
-subtype of the type of the iterable_name is a limited type at the point
-of the container element iterator.
+subtype of the type of the <iterable_>name is a limited type at the
+point of the container element iterator.
_Static Semantics_
7/3
-An iterator_specification declares a loop parameter. In a generalized
+An iterator_specification declares a <loop parameter>. In a generalized
iterator, the nominal subtype of the loop parameter is the iteration
cursor subtype. In an array component iterator or a container element
iterator, if a subtype_indication is present, it determines the nominal
subtype of the loop parameter. In an array component iterator, if a
subtype_indication is not present, the nominal subtype of the loop
-parameter is the component subtype of the type of the iterable_name. In
-a container element iterator, if a subtype_indication is not present,
+parameter is the component subtype of the type of the <iterable_>name.
+In a container element iterator, if a subtype_indication is not present,
the nominal subtype of the loop parameter is the default element subtype
-for the type of the iterable_name.
+for the type of the <iterable_>name.
8/3
In a generalized iterator, the loop parameter is a constant. In an
array component iterator, the loop parameter is a constant if the
-iterable_name denotes a constant; otherwise it denotes a variable. In a
-container element iterator, the loop parameter is a constant if the
-iterable_name denotes a constant, or if the Variable_Indexing aspect is
-not specified for the type of the iterable_name; otherwise it is a
+<iterable_>name denotes a constant; otherwise it denotes a variable. In
+a container element iterator, the loop parameter is a constant if the
+<iterable_>name denotes a constant, or if the Variable_Indexing aspect
+is not specified for the type of the <iterable_>name; otherwise it is a
variable.
_Dynamic Semantics_
@@ -14618,10 +14650,10 @@ elaborates the subtype_indication, if any.
10/3
For a generalized iterator, the loop parameter is created, the
-iterator_name is evaluated, and the denoted iterator object becomes the
-loop iterator. In a forward generalized iterator, the operation First
-of the iterator type is called on the loop iterator, to produce the
-initial value for the loop parameter. If the result of calling
+<iterator_>name is evaluated, and the denoted iterator object becomes
+the <loop iterator>. In a forward generalized iterator, the operation
+First of the iterator type is called on the loop iterator, to produce
+the initial value for the loop parameter. If the result of calling
Has_Element on the initial value is False, then the execution of the
loop_statement is complete. Otherwise, the sequence_of_statements is
executed and then the Next operation of the iterator type is called with
@@ -14633,30 +14665,30 @@ generalized iterator, the operations Last and
Previous are called rather
than First and Next.
11/3
-For an array component iterator, the iterable_name is evaluated and the
-denoted array object becomes the array for the loop. If the array for
-the loop is a null array, then the execution of the loop_statement is
-complete. Otherwise, the sequence_of_statements is executed with the
+For an array component iterator, the <iterable_>name is evaluated and
+the denoted array object becomes the <array for the loop>. If the array
+for the loop is a null array, then the execution of the loop_statement
+is complete. Otherwise, the sequence_of_statements is executed with the
loop parameter denoting each component of the array for the loop, using
-a canonical order of components, which is last dimension varying fastest
-(unless the array has convention Fortran, in which case it is first
-dimension varying fastest). For a forward array component iterator, the
-iteration starts with the component whose index values are each the
-first in their index range, and continues in the canonical order. For a
-reverse array component iterator, the iteration starts with the
-component whose index values are each the last in their index range, and
-continues in the reverse of the canonical order. The loop iteration
-proceeds until the sequence_of_statements has been executed for each
-component of the array for the loop, or until the loop is left as a
-consequence of a transfer of control.
+a <canonical> order of components, which is last dimension varying
+fastest (unless the array has convention Fortran, in which case it is
+first dimension varying fastest). For a forward array component
+iterator, the iteration starts with the component whose index values are
+each the first in their index range, and continues in the canonical
+order. For a reverse array component iterator, the iteration starts
+with the component whose index values are each the last in their index
+range, and continues in the reverse of the canonical order. The loop
+iteration proceeds until the sequence_of_statements has been executed
+for each component of the array for the loop, or until the loop is left
+as a consequence of a transfer of control.
12/3
-For a container element iterator, the iterable_name is evaluated and the
-denoted iterable container object becomes the iterable container object
-for the loop. The default iterator function for the type of the
+For a container element iterator, the <iterable_>name is evaluated and
+the denoted iterable container object becomes the <iterable container
+object for the loop>. The default iterator function for the type of the
iterable container object for the loop is called on the iterable
-container object and the result is the loop iterator. An object of the
-default cursor subtype is created (the loop cursor).
+container object and the result is the <loop iterator>. An object of
+the default cursor subtype is created (the <loop cursor>).
13/3
For a forward container element iterator, the operation First of the
@@ -14685,9 +14717,9 @@ loop statement.
_Examples_
15/3
- -- Array component iterator example:
- for Element of Board loop -- See *note 3.6.1::.
- Element := Element * 2.0; -- Double each element of Board, a
two-dimensional array.
+ -- <Array component iterator example:>
+ for Element of Board loop -- <See *note 3.6.1::.>
+ Element := Element * 2.0; -- <Double each element of Board, a
two-dimensional array.>
end loop;
16/3
@@ -14709,15 +14741,15 @@ preceded by a declarative_part.
2
block_statement ::=
- [block_statement_identifier:]
+ [<block_>statement_identifier:]
[declare
declarative_part]
begin
handled_sequence_of_statements
- end [block_identifier];
+ end [<block_>identifier];
3
- If a block_statement has a block_statement_identifier, then the
+ If a block_statement has a <block_>statement_identifier, then the
identifier shall be repeated after the end; otherwise, there shall
not be an identifier after the end.
@@ -14737,7 +14769,7 @@ handled_sequence_of_statements.
_Examples_
6
-Example of a block statement with a local variable:
+<Example of a block statement with a local variable:>
7
Swap:
@@ -14762,18 +14794,18 @@ includes a condition.
2
exit_statement ::=
- exit [loop_name] [when condition];
+ exit [<loop_>name] [when condition];
_Name Resolution Rules_
3
-The loop_name, if any, in an exit_statement shall resolve to denote a
+The <loop_>name, if any, in an exit_statement shall resolve to denote a
loop_statement.
_Legality Rules_
4
-Each exit_statement (*note 5.7: S0161.) applies to a loop_statement
+Each exit_statement (*note 5.7: S0161.) <applies to> a loop_statement
(*note 5.5: S0156.); this is the loop_statement (*note 5.5: S0156.)
being exited. An exit_statement (*note 5.7: S0161.) with a name is only
allowed within the loop_statement (*note 5.5: S0156.) denoted by the
@@ -14803,7 +14835,7 @@ False, no transfer of control takes place.
_Examples_
7
-Examples of loops with exit statements:
+<Examples of loops with exit statements:>
8
for N in 1 .. Max_Num_Items loop
@@ -14815,9 +14847,9 @@ Examples of loops with exit statements:
9
Main_Cycle:
loop
- -- initial statements
+ --< initial statements>
exit Main_Cycle when Found;
- -- final statements
+ --< final statements>
end loop Main_Cycle;
@@ -14833,13 +14865,13 @@ statement to a target statement with a given label.
_Syntax_
2
- goto_statement ::= goto label_name;
+ goto_statement ::= goto <label_>name;
_Name Resolution Rules_
3
-The label_name shall resolve to denote a label; the statement with that
-label is the target statement.
+The <label_>name shall resolve to denote a label; the statement with
+that label is the <target statement>.
_Legality Rules_
@@ -14869,7 +14901,7 @@ encloses the goto_statement but does not enclose the
target.
_Examples_
7
-Example of a loop containing a goto statement:
+<Example of a loop containing a goto statement:>
8
<<Sort>>
@@ -14896,10 +14928,11 @@ its interface, and a subprogram_body defining its
execution. Operators
and enumeration literals are functions.
2/3
-A callable entity is a subprogram or entry (see Section 9). A callable
-entity is invoked by a call; that is, a subprogram call or entry call. A
-callable construct is a construct that defines the action of a call upon
-a callable entity: a subprogram_body, entry_body, or accept_statement.
+A <callable entity> is a subprogram or entry (see Section 9). A
+callable entity is invoked by a <call>; that is, a subprogram call or
+entry call. A <callable construct> is a construct that defines the
+action of a call upon a callable entity: a subprogram_body, entry_body,
+or accept_statement.
* Menu:
@@ -14930,7 +14963,7 @@ A subprogram_declaration declares a procedure or
function.
[aspect_specification];
3/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
4/2
subprogram_specification ::=
@@ -14997,16 +15030,16 @@ A subprogram_declaration declares a procedure or
function.
_Name Resolution Rules_
17
-A formal parameter is an object directly visible within a
+A <formal parameter> is an object directly visible within a
subprogram_body that represents the actual parameter passed to the
-subprogram in a call; it is declared by a parameter_specification. For a
-formal parameter, the expected type for its default_expression, if any,
-is that of the formal parameter.
+subprogram in a call; it is declared by a parameter_specification. For
+a formal parameter, the expected type for its default_expression, if
+any, is that of the formal parameter.
_Legality Rules_
18/3
-The parameter mode of a formal parameter conveys the direction of
+The <parameter mode> of a formal parameter conveys the direction of
information transfer with the actual parameter: in, in out, or out.
Mode in is the default, and is the mode of a parameter defined by an
access_definition.
@@ -15032,7 +15065,7 @@ corresponding body or accept_statement.
_Static Semantics_
22
-The profile of (a view of) a callable entity is either a
+The <profile> of (a view of) a callable entity is either a
parameter_profile or parameter_and_result_profile; it embodies
information about the interface to that entity -- for example, the
profile includes information about parameters passed to the callable
@@ -15049,15 +15082,15 @@ the optional null_exclusion and the subtype_mark, or
defined by the
access_definition, in the parameter_specification. The nominal subtype
of a function result is the subtype determined by the optional
null_exclusion and the subtype_mark, or defined by the
-access_definition, in the parameter_and_result_profile.
+access_definition, in the parameter_and_result_profile.
23.1/3
-An explicitly aliased parameter is a formal parameter whose
+An <explicitly aliased parameter> is a formal parameter whose
parameter_specification includes the reserved word aliased.
24/2
-An access parameter is a formal in parameter specified by an
-access_definition. An access result type is a function result type
+An <access parameter> is a formal in parameter specified by an
+access_definition. An <access result type> is a function result type
specified by an access_definition. An access parameter or result type
is of an anonymous access type (see *note 3.10::). Access parameters of
an access-to-object type allow dispatching calls to be controlled by
@@ -15066,7 +15099,7 @@ calls to subprograms passed as parameters irrespective
of their
accessibility level.
25
-The subtypes of a profile are:
+The <subtypes of a profile> are:
26
* For any non-access parameters, the nominal subtype of the
@@ -15093,7 +15126,7 @@ The subtypes of a profile are:
subtypes of the designated profile of the result type.
29
-The types of a profile are the types of those subtypes.
+The <types of a profile> are the types of those subtypes.
30/3
A subprogram declared by an abstract_subprogram_declaration is abstract;
@@ -15139,33 +15172,33 @@ The elaboration of a subprogram_declaration has no
effect.
_Examples_
36
-Examples of subprogram declarations:
+<Examples of subprogram declarations:>
37
procedure Traverse_Tree;
procedure Increment(X : in out Integer);
- procedure Right_Indent(Margin : out Line_Size); -- see *note
3.5.4::
- procedure Switch(From, To : in out Link); -- see *note
3.10.1::
+ procedure Right_Indent(Margin : out Line_Size); --< see *note
3.5.4::>
+ procedure Switch(From, To : in out Link); --< see *note
3.10.1::>
38
- function Random return Probability; -- see *note
3.5.7::
+ function Random return Probability; --< see *note
3.5.7::>
39/4
- function Min_Cell(X : Link) return Cell; -- see *note
3.10.1::
- function Next_Frame(K : Positive) return Frame; -- see *note
3.10::
- function Dot_Product(Left, Right : Vector) return Real; -- see *note
3.6::
+ function Min_Cell(X : Link) return Cell; --< see *note
3.10.1::>
+ function Next_Frame(K : Positive) return Frame; --< see *note
3.10::>
+ function Dot_Product(Left, Right : Vector) return Real; --< see *note
3.6::>
function Find(B : aliased in out Barrel; Key : String) return Real;
- -- see *note
4.1.5::
+ --< see *note
4.1.5::>
40
- function "*"(Left, Right : Matrix) return Matrix; -- see *note
3.6::
+ function "*"(Left, Right : Matrix) return Matrix; --< see *note
3.6::>
41
-Examples of in parameters with default expressions:
+<Examples of in parameters with default expressions:>
42
procedure Print_Header(Pages : in Natural;
- Header : in Line := (1 .. Line'Last => ' '); -- see
*note 3.6::
+ Header : in Line := (1 .. Line'Last => ' '); --< see
*note 3.6::>
Center : in Boolean := True);
* Menu:
@@ -15187,7 +15220,7 @@ aspect_specification (see *note 13.1.1::):
Pre
This aspect specifies a specific precondition for a
callable entity; it shall be specified by an expression,
- called a specific precondition expression. If not
+ called a <specific precondition expression>. If not
specified for an entity, the specific precondition
expression for the entity is the enumeration literal
True.
@@ -15196,17 +15229,17 @@ Pre
Pre'Class
This aspect specifies a class-wide precondition for an
operation of a tagged type and its descendants; it shall
- be specified by an expression, called a class-wide
- precondition expression. If not specified for an entity,
- then if no other class-wide precondition applies to the
- entity, the class-wide precondition expression for the
- entity is the enumeration literal True.
+ be specified by an expression, called a <class-wide
+ precondition expression>. If not specified for an
+ entity, then if no other class-wide precondition applies
+ to the entity, the class-wide precondition expression for
+ the entity is the enumeration literal True.
4/3
Post
This aspect specifies a specific postcondition for a
callable entity; it shall be specified by an expression,
- called a specific postcondition expression. If not
+ called a <specific postcondition expression>. If not
specified for an entity, the specific postcondition
expression for the entity is the enumeration literal
True.
@@ -15215,8 +15248,8 @@ Post
Post'Class
This aspect specifies a class-wide postcondition for an
operation of a tagged type and its descendants; it shall
- be specified by an expression, called a class-wide
- postcondition expression. If not specified for an
+ be specified by an expression, called a <class-wide
+ postcondition expression>. If not specified for an
entity, the class-wide postcondition expression for the
entity is the enumeration literal True.
@@ -15228,14 +15261,14 @@ boolean type.
7/4
Within the expression for a Pre'Class or Post'Class aspect for a
-primitive subprogram S of a tagged type T, a name that denotes a formal
-parameter (or S'Result) of type T is interpreted as though it had a
-(notional) type NT that is a formal derived type whose ancestor type is
-T, with directly visible primitive operations. Similarly, a name that
-denotes a formal access parameter (or S'Result) of type access-to-T is
-interpreted as having type access-to-NT. The result of this
-interpretation is that the only operations that can be applied to such
-names are those defined for such a formal derived type.
+primitive subprogram <S> of a tagged type <T>, a name that denotes a
+formal parameter (or <S>'Result) of type <T> is interpreted as though it
+had a (notional) type <NT> that is a formal derived type whose ancestor
+type is <T>, with directly visible primitive operations. Similarly, a
+name that denotes a formal access parameter (or <S>'Result) of type
+access-to-<T> is interpreted as having type access-to-<NT>. The result
+of this interpretation is that the only operations that can be applied
+to such names are those defined for such a formal derived type.
8/3
For an attribute_reference with attribute_designator Old, if the
@@ -15251,47 +15284,47 @@ or a null procedure. Only the Pre'Class and
Post'Class aspects may be
specified for such a subprogram.
10/3
-If a type T has an implicitly declared subprogram P inherited from a
-parent type T1 and a homograph (see *note 8.3::) of P from a progenitor
-type T2, and
+If a type <T> has an implicitly declared subprogram <P> inherited from a
+parent type <T1> and a homograph (see *note 8.3::) of <P> from a
+progenitor type <T2>, and
11/3
- * the corresponding primitive subprogram P1 of type T1 is neither
+ * the corresponding primitive subprogram <P1> of type <T1> is neither
null nor abstract; and
12/3
- * the class-wide precondition expression True does not apply to P1
+ * the class-wide precondition expression True does not apply to <P1>
(implicitly or explicitly); and
13/3
* there is a class-wide precondition expression that applies to the
- corresponding primitive subprogram P2 of T2 that does not fully
+ corresponding primitive subprogram <P2> of <T2> that does not fully
conform to any class-wide precondition expression that applies to
- P1,
+ <P1>,
14/3
then:
15/3
- * If the type T is abstract, the implicitly declared subprogram P is
- abstract.
+ * If the type <T> is abstract, the implicitly declared subprogram <P>
+ is <abstract>.
16/3
- * Otherwise, the subprogram P requires overriding and shall be
+ * Otherwise, the subprogram <P> <requires overriding> and shall be
overridden with a nonabstract subprogram.
17/3
-If a renaming of a subprogram or entry S1 overrides an inherited
-subprogram S2, then the overriding is illegal unless each class-wide
-precondition expression that applies to S1 fully conforms to some
-class-wide precondition expression that applies to S2 and each
-class-wide precondition expression that applies to S2 fully conforms to
-some class-wide precondition expression that applies to S1.
+If a renaming of a subprogram or entry <S1> overrides an inherited
+subprogram <S2>, then the overriding is illegal unless each class-wide
+precondition expression that applies to <S1> fully conforms to some
+class-wide precondition expression that applies to <S2> and each
+class-wide precondition expression that applies to <S2> fully conforms
+to some class-wide precondition expression that applies to <S1>.
17.1/4
Pre'Class shall not be specified for an overriding primitive subprogram
-of a tagged type T unless the Pre'Class aspect is specified for the
-corresponding primitive subprogram of some ancestor of T.
+of a tagged type <T> unless the Pre'Class aspect is specified for the
+corresponding primitive subprogram of some ancestor of <T>.
17.2/4
In addition to the places where Legality Rules normally apply (see *note
@@ -15302,19 +15335,19 @@ generic unit.
18/4
If a Pre'Class or Post'Class aspect is specified for a primitive
-subprogram S of a tagged type T, or such an aspect defaults to True,
+subprogram <S> of a tagged type <T>, or such an aspect defaults to True,
then a corresponding expression also applies to the corresponding
-primitive subprogram S of each descendant of T. The corresponding
-expression is constructed from the associated expression as follows:
+primitive subprogram <S> of each descendant of <T>. The <corresponding
+expression> is constructed from the associated expression as follows:
18.1/4
- * References to formal parameters of S (or to S itself) are replaced
- with references to the corresponding formal parameters of the
- corresponding inherited or overriding subprogram S (or to the
- corresponding subprogram S itself).
+ * References to formal parameters of <S> (or to <S> itself) are
+ replaced with references to the corresponding formal parameters of
+ the corresponding inherited or overriding subprogram <S> (or to the
+ corresponding subprogram <S> itself).
18.2/4
-The primitive subprogram S is illegal if it is not abstract and the
+The primitive subprogram <S> is illegal if it is not abstract and the
corresponding expression for a Pre'Class or Post'Class aspect would be
illegal.
@@ -15323,16 +15356,16 @@ If performing checks is required by the Pre,
Pre'Class, Post, or
Post'Class assertion policies (see *note 11.4.2::) in effect at the
point of a corresponding aspect specification applicable to a given
subprogram or entry, then the respective precondition or postcondition
-expressions are considered enabled.
+expressions are considered <enabled>.
20/3
-An expression is potentially unevaluated if it occurs within:
+An expression is <potentially unevaluated> if it occurs within:
21/3
* any part of an if_expression other than the first condition;
22/3
- * a dependent_expression of a case_expression;
+ * a <dependent_>expression of a case_expression;
22.1/4
* a predicate of a quantified_expression;
@@ -15360,17 +15393,17 @@ X'Old
26.2/4
* If X is of an anonymous access type defined by an
- access_definition A then
+ access_definition <A> then
26.3/4
- X'Old : constant A := X;
+ <X'Old> : constant <A> := X;
26.4/4
- * If X is of a specific tagged type T then
+ * If X is of a specific tagged type <T> then
26.5/4
- anonymous : constant T'Class := T'Class(X);
- X'Old : T renames T(anonymous);
+ <anonymous> : constant <T>'Class := <T>'Class(X);
+ <X'Old> : <T> renames <T>(<anonymous>);
26.6/4
where the name X'Old denotes the object renaming.
@@ -15379,11 +15412,11 @@ X'Old
* Otherwise
26.8/4
- X'Old : constant S := X;
+ <X'Old> : constant <S> := X;
26.9/4
- where S is the nominal subtype of X. This includes
- the case where the type of S is an anonymous array
+ where <S> is the nominal subtype of X. This includes
+ the case where the type of <S> is an anonymous array
type or a universal type.
26.10/4
@@ -15417,11 +15450,11 @@ F'Result
Post'Class postcondition expression for a function with a
controlling result or with a controlling access result.
For a controlling result, the type of the attribute is
- T'Class, where T is the function result type. For a
+ <T>'Class, where <T> is the function result type. For a
controlling access result, the type of the attribute is
an anonymous access type whose designated type is
- T'Class, where T is the designated type of the function
- result type.
+ <T>'Class, where <T> is the designated type of the
+ function result type.
30/3
Use of this attribute is allowed only within a
@@ -15489,32 +15522,33 @@ evaluation of a precondition or postcondition
expression is raised at
the point of call.
37/4
-For any call to a subprogram or entry S (including dispatching calls),
+For any call to a subprogram or entry <S> (including dispatching calls),
the checks that are performed to verify specific precondition
expressions and specific and class-wide postcondition expressions are
determined by those for the subprogram or entry actually invoked. Note
that the class-wide postcondition expressions verified by the
postcondition check that is part of a call on a primitive subprogram of
-type T includes all class-wide postcondition expressions originating in
-any progenitor of T, even if the primitive subprogram called is
-inherited from a type T1 and some of the postcondition expressions do
-not apply to the corresponding primitive subprogram of T1. Any
+type <T> includes all class-wide postcondition expressions originating
+in any progenitor of <T>, even if the primitive subprogram called is
+inherited from a type <T1> and some of the postcondition expressions do
+not apply to the corresponding primitive subprogram of <T1>. Any
operations within a class-wide postcondition expression that were
resolved as primitive operations of the (notional) formal derived type
-NT, are in the evaluation of the postcondition bound to the
+<NT>, are in the evaluation of the postcondition bound to the
corresponding operations of the type identified by the controlling tag
-of the call on S. This applies to both dispatching and non-dispatching
-calls on S.
+of the call on <S>. This applies to both dispatching and
+non-dispatching calls on <S>.
38/4
-The class-wide precondition check for a call to a subprogram or entry S
-consists solely of checking the class-wide precondition expressions that
-apply to the denoted callable entity (not necessarily to the one that is
-invoked). Any operations within such an expression that were resolved
-as primitive operations of the (notional) formal derived type NT are in
-the evaluation of the precondition bound to the corresponding operations
-of the type identified by the controlling tag of the call on S. This
-applies to both dispatching and non-dispatching calls on S.
+The class-wide precondition check for a call to a subprogram or entry
+<S> consists solely of checking the class-wide precondition expressions
+that apply to the denoted callable entity (not necessarily to the one
+that is invoked). Any operations within such an expression that were
+resolved as primitive operations of the (notional) formal derived type
+<NT> are in the evaluation of the precondition bound to the
+corresponding operations of the type identified by the controlling tag
+of the call on <S>. This applies to both dispatching and
+non-dispatching calls on <S>.
39/3
For a call via an access-to-subprogram value, all precondition and
@@ -15542,22 +15576,22 @@ out, or out.
_Static Semantics_
2
-A parameter is passed either by copy or by reference. When a parameter
-is passed by copy, the formal parameter denotes a separate object from
-the actual parameter, and any information transfer between the two
-occurs only before and after executing the subprogram. When a parameter
-is passed by reference, the formal parameter denotes (a view of) the
-object denoted by the actual parameter; reads and updates of the formal
-parameter directly reference the actual parameter object.
+A parameter is passed either <by copy> or <by reference>. When a
+parameter is passed by copy, the formal parameter denotes a separate
+object from the actual parameter, and any information transfer between
+the two occurs only before and after executing the subprogram. When a
+parameter is passed by reference, the formal parameter denotes (a view
+of) the object denoted by the actual parameter; reads and updates of the
+formal parameter directly reference the actual parameter object.
3/3
-A type is a by-copy type if it is an elementary type, or if it is a
+A type is a <by-copy type> if it is an elementary type, or if it is a
descendant of a private type whose full type is a by-copy type. A
parameter of a by-copy type is passed by copy, unless the formal
parameter is explicitly aliased.
4
-A type is a by-reference type if it is a descendant of one of the
+A type is a <by-reference type> if it is a descendant of one of the
following:
5
@@ -15577,14 +15611,14 @@ following:
10/4
A parameter of a by-reference type is passed by reference, as is an
-explicitly aliased parameter of any type. Each value of a by-reference
+explicitly aliased parameter of any type. Each value of a by-reference
type has an associated object. For a parenthesized expression,
qualified_expression, or view conversion, this object is the one
associated with the operand. For a value conversion, the associated
object is the anonymous result object if such an object is created (see
*note 4.6::); otherwise it is the associated object of the operand. For
a conditional_expression, this object is the one associated with the
-evaluated dependent_expression.
+evaluated <dependent_>expression.
11/3
For other parameters, it is unspecified whether the parameter is passed
@@ -15595,16 +15629,16 @@ by copy or by reference.
12/3
If one name denotes a part of a formal parameter, and a second name
denotes a part of a distinct formal parameter or an object that is not
-part of a formal parameter, then the two names are considered distinct
-access paths. If an object is of a type for which the parameter passing
-mechanism is not specified and is not an explicitly aliased parameter,
-then it is a bounded error to assign to the object via one access path,
-and then read the value of the object via a distinct access path, unless
-the first access path denotes a part of a formal parameter that no
-longer exists at the point of the second access (due to leaving the
-corresponding callable construct). The possible consequences are that
-Program_Error is raised, or the newly assigned value is read, or some
-old value of the object is read.
+part of a formal parameter, then the two names are considered <distinct
+access paths>. If an object is of a type for which the parameter
+passing mechanism is not specified and is not an explicitly aliased
+parameter, then it is a bounded error to assign to the object via one
+access path, and then read the value of the object via a distinct access
+path, unless the first access path denotes a part of a formal parameter
+that no longer exists at the point of the second access (due to leaving
+the corresponding callable construct). The possible consequences are
+that Program_Error is raised, or the newly assigned value is read, or
+some old value of the object is read.
NOTES
@@ -15654,7 +15688,7 @@ completion of a previous declaration, in which case the
body declares
the subprogram. If the body is a completion, it shall be the completion
of a subprogram_declaration or generic_subprogram_declaration. The
profile of a subprogram_body that completes a declaration shall conform
-fully to that of the declaration.
+fully to that of the declaration.
_Static Semantics_
@@ -15678,7 +15712,7 @@ handled_sequence_of_statements is then executed.
_Examples_
8
-Example of procedure body:
+<Example of procedure body:>
9
procedure Push(E : in Element_Type; S : in out Stack) is
@@ -15692,7 +15726,7 @@ Example of procedure body:
end Push;
10
-Example of a function body:
+<Example of a function body:>
11
function Dot_Product(Left, Right : Vector) return Real is
@@ -15725,19 +15759,19 @@ conformance, subtype conformance, or full conformance.
2/1
As explained in *note B.1::, "*note B.1:: Interfacing Aspects", a
-convention can be specified for an entity. Unless this International
+<convention> can be specified for an entity. Unless this International
Standard states otherwise, the default convention of an entity is Ada.
For a callable entity or access-to-subprogram type, the convention is
-called the calling convention. The following conventions are defined by
-the language:
+called the <calling convention>. The following conventions are defined
+by the language:
3/3
* The default calling convention for any subprogram not listed below
- is Ada. The Convention aspect may be specified to override the
+ is <Ada>. The Convention aspect may be specified to override the
default calling convention (see *note B.1::).
4
- * The Intrinsic calling convention represents subprograms that are
+ * The <Intrinsic> calling convention represents subprograms that are
"built in" to the compiler. The default calling convention is
Intrinsic for the following:
@@ -15772,22 +15806,23 @@ the language:
The Access attribute is not allowed for Intrinsic subprograms.
12/4
- * The default calling convention is protected for a protected
+ * The default calling convention is <protected> for a protected
subprogram, for a prefixed view of a subprogram with a
synchronization kind of By_Protected_Procedure, and for an
access-to-subprogram type with the reserved word protected in its
definition.
13/4
- * The default calling convention is entry for an entry and for a
+ * The default calling convention is <entry> for an entry and for a
prefixed view of a subprogram with a synchronization kind of
By_Entry.
13.1/3
* The calling convention for an anonymous access-to-subprogram
- parameter or anonymous access-to-subprogram result is protected if
- the reserved word protected appears in its definition; otherwise,
- it is the convention of the subprogram that contains the parameter.
+ parameter or anonymous access-to-subprogram result is <protected>
+ if the reserved word protected appears in its definition;
+ otherwise, it is the convention of the subprogram that contains the
+ parameter.
13.2/1
* If not specified above as Intrinsic, the calling convention for any
@@ -15798,17 +15833,17 @@ the language:
14/3
Of these four conventions, only Ada and Intrinsic are allowed as a
-convention_identifier in the specification of a Convention aspect.
+<convention_>identifier in the specification of a Convention aspect.
15/2
-Two profiles are type conformant if they have the same number of
+Two profiles are <type conformant> if they have the same number of
parameters, and both have a result if either does, and corresponding
parameter and result types are the same, or, for access parameters or
access results, corresponding designated types are the same, or
-corresponding designated profiles are type conformant.
+corresponding designated profiles are type conformant.
16/3
-Two profiles are mode conformant if:
+Two profiles are <mode conformant> if:
16.1/3
* they are type conformant; and
@@ -15821,16 +15856,16 @@ Two profiles are mode conformant if:
* for corresponding access parameters and any access result type, the
designated subtypes statically match and either both or neither are
access-to-constant, or the designated profiles are subtype
- conformant.
+ conformant.
17/3
-Two profiles are subtype conformant if they are mode conformant,
+Two profiles are <subtype conformant> if they are mode conformant,
corresponding subtypes of the profile statically match, and the
associated calling conventions are the same. The profile of a generic
-formal subprogram is not subtype conformant with any other profile.
+formal subprogram is not subtype conformant with any other profile.
18/3
-Two profiles are fully conformant if they are subtype conformant, if
+Two profiles are <fully conformant> if they are subtype conformant, if
they have access-to-subprogram results whose designated profiles are
fully conformant, and for corresponding parameters:
@@ -15849,8 +15884,8 @@ fully conformant, and for corresponding parameters:
fully conformant.
19
-Two expressions are fully conformant if, after replacing each use of an
-operator with the equivalent function_call:
+Two expressions are <fully conformant> if, after replacing each use of
+an operator with the equivalent function_call:
20
* each constituent construct of one corresponds to an instance of the
@@ -15878,19 +15913,19 @@ operator with the equivalent function_call:
corresponding literal in the other.
23
-Two known_discriminant_parts are fully conformant if they have the same
-number of discriminants, and discriminants in the same positions have
-the same names, statically matching subtypes, and default_expressions
-that are fully conformant with one another.
+Two known_discriminant_parts are <fully conformant> if they have the
+same number of discriminants, and discriminants in the same positions
+have the same names, statically matching subtypes, and
+default_expressions that are fully conformant with one another.
24
-Two discrete_subtype_definitions are fully conformant if they are both
+Two discrete_subtype_definitions are <fully conformant> if they are both
subtype_indications or are both ranges, the subtype_marks (if any)
denote the same subtype, and the corresponding simple_expressions of the
ranges (if any) fully conform.
24.1/2
-The prefixed view profile of a subprogram is the profile obtained by
+The <prefixed view profile> of a subprogram is the profile obtained by
omitting the first parameter of that subprogram. There is no prefixed
view profile for a parameterless subprogram. For the purposes of
defining subtype and mode conformance, the convention of a prefixed view
@@ -15912,8 +15947,8 @@ File: arm2012.info, Node: 6.3.2, Prev: 6.3.1, Up: 6.3
1
Subprograms may be expanded in line at the call site.
-Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -15948,7 +15983,7 @@ File: arm2012.info, Node: 6.4, Next: 6.5, Prev: 6.3,
Up: 6
====================
1
-A subprogram call is either a procedure_call_statement or a
+A <subprogram call> is either a procedure_call_statement or a
function_call; it invokes the execution of the subprogram_body. The
call specifies the association of the actual parameters, if any, with
formal parameters of the subprogram.
@@ -15957,13 +15992,13 @@ formal parameters of the subprogram.
2
procedure_call_statement ::=
- procedure_name;
- | procedure_prefix actual_parameter_part;
+ <procedure_>name;
+ | <procedure_>prefix actual_parameter_part;
3
function_call ::=
- function_name
- | function_prefix actual_parameter_part
+ <function_>name
+ | <function_>prefix actual_parameter_part
4
actual_parameter_part ::=
@@ -15971,17 +16006,18 @@ formal parameters of the subprogram.
5
parameter_association ::=
- [formal_parameter_selector_name =>] explicit_actual_parameter
+ [<formal_parameter_>selector_name =>] explicit_actual_parameter
6
- explicit_actual_parameter ::= expression | variable_name
+ explicit_actual_parameter ::= expression | <variable_>name
7
- A parameter_association is named or positional according to whether
- or not the formal_parameter_selector_name (*note 4.1.3: S0099.) is
- specified. Any positional associations shall precede any named
- associations. Named associations are not allowed if the prefix in
- a subprogram call is an attribute_reference (*note 4.1.4: S0100.).
+ A parameter_association is <named> or <positional> according to
+ whether or not the <formal_parameter_>selector_name (*note 4.1.3:
+ S0099.) is specified. Any positional associations shall precede
+ any named associations. Named associations are not allowed if the
+ prefix in a subprogram call is an attribute_reference (*note 4.1.4:
+ S0100.).
_Name Resolution Rules_
@@ -16031,32 +16067,32 @@ the function completes normally without executing a
return statement.
12/2
A function_call denotes a constant, as defined in *note 6.5::; the
nominal subtype of the constant is given by the nominal subtype of the
-function result.
+function result.
_Examples_
13
-Examples of procedure calls:
+<Examples of procedure calls:>
14
- Traverse_Tree; -- see
*note 6.1::
- Print_Header(128, Title, True); -- see
*note 6.1::
+ Traverse_Tree; --< see
*note 6.1::>
+ Print_Header(128, Title, True); --< see
*note 6.1::>
15
- Switch(From => X, To => Next); -- see
*note 6.1::
- Print_Header(128, Header => Title, Center => True); -- see
*note 6.1::
- Print_Header(Header => Title, Center => True, Pages => 128); -- see
*note 6.1::
+ Switch(From => X, To => Next); --< see
*note 6.1::>
+ Print_Header(128, Header => Title, Center => True); --< see
*note 6.1::>
+ Print_Header(Header => Title, Center => True, Pages => 128); --< see
*note 6.1::>
16
-Examples of function calls:
+<Examples of function calls:>
17
- Dot_Product(U, V) -- see *note 6.1:: and *note 6.3::
- Clock -- see *note 9.6::
- F.all -- presuming F is of an access-to-subprogram type --
see *note 3.10::
+ Dot_Product(U, V) --< see *note 6.1:: and *note 6.3::>
+ Clock --< see *note 9.6::>
+ F.all --< presuming F is of an access-to-subprogram type
-- see *note 3.10::>
18
-Examples of procedures with default expressions:
+<Examples of procedures with default expressions:>
19
procedure Activate(Process : in Process_Name;
@@ -16065,10 +16101,10 @@ Examples of procedures with default expressions:
Prior : in Boolean := False);
20/3
- procedure Pair(Left, Right : in Person_Name := new Person(M)); -- see
*note 3.10.1::
+ procedure Pair(Left, Right : in Person_Name := new Person(M)); --< see
*note 3.10.1::>
21
-Examples of their calls:
+<Examples of their calls:>
22
Activate(X);
@@ -16092,7 +16128,7 @@ Examples of their calls:
_Examples_
25
-Examples of overloaded subprograms:
+<Examples of overloaded subprograms:>
26
procedure Put(X : in Integer);
@@ -16103,7 +16139,7 @@ Examples of overloaded subprograms:
procedure Set(Signal : in Light);
28
-Examples of their calls:
+<Examples of their calls:>
29
Put(28);
@@ -16115,8 +16151,8 @@ Examples of their calls:
Set(Color'(Red));
31
- -- Set(Red) would be ambiguous since Red may
- -- denote a value either of type Color or of type Light
+ --< Set(Red) would be ambiguous since Red may>
+ --< denote a value either of type Color or of type Light>
* Menu:
@@ -16135,7 +16171,7 @@ parameter and a formal parameter.
_Name Resolution Rules_
2/3
-The formal_parameter_selector_name of a named parameter_association
+The <formal_parameter_>selector_name of a named parameter_association
(*note 6.4: S0181.) shall resolve to denote a parameter_specification
(*note 6.1: S0175.) of the view being called; this is the formal
parameter of the association. The formal parameter for a positional
@@ -16143,11 +16179,11 @@ parameter_association (*note 6.4: S0181.) is the
parameter with the
corresponding position in the formal part of the view being called.
3
-The actual parameter is either the explicit_actual_parameter given in a
-parameter_association for a given formal parameter, or the corresponding
-default_expression if no parameter_association is given for the formal
-parameter. The expected type for an actual parameter is the type of the
-corresponding formal parameter.
+The <actual parameter> is either the explicit_actual_parameter given in
+a parameter_association for a given formal parameter, or the
+corresponding default_expression if no parameter_association is given
+for the formal parameter. The expected type for an actual parameter is
+the type of the corresponding formal parameter.
4
If the mode is in, the actual is interpreted as an expression;
@@ -16180,15 +16216,15 @@ generic unit.
6/3
If the formal parameter is an explicitly aliased parameter, the type of
the actual parameter shall be tagged or the actual parameter shall be an
-aliased view of an object. Further, if the formal parameter subtype F
+aliased view of an object. Further, if the formal parameter subtype <F>
is untagged:
6.1/3
- * the subtype F shall statically match the nominal subtype of the
+ * the subtype <F> shall statically match the nominal subtype of the
actual object; or
6.2/3
- * the subtype F shall be unconstrained, discriminated in its full
+ * the subtype <F> shall be unconstrained, discriminated in its full
view, and unconstrained in any partial view.
6.3/4
@@ -16202,7 +16238,7 @@ each explicitly aliased parameter shall not be
statically deeper than
the accessibility level of the master of the call (see *note 3.10.2::).
6.5/3
-Two names are known to denote the same object if:
+Two names are <known to denote the same object> if:
6.6/3
* both names statically denote the same stand-alone object or
@@ -16231,14 +16267,14 @@ Two names are known to denote the same object if:
6.11/3
* one of the two names statically denotes a renaming declaration
- whose renamed object_name is known to denote the same object as the
- other, the prefix of any dereference within the renamed object_name
- is not a variable, and any expression within the renamed
- object_name contains no references to variables nor calls on
- nonstatic functions.
+ whose renamed <object_>name is known to denote the same object as
+ the other, the prefix of any dereference within the renamed
+ <object_>name is not a variable, and any expression within the
+ renamed <object_>name contains no references to variables nor calls
+ on nonstatic functions.
6.12/3
-Two names are known to refer to the same object if
+Two names are <known to refer to the same object> if
6.13/3
* The two names are known to denote the same object; or
@@ -16250,30 +16286,31 @@ Two names are known to refer to the same object if
6.15/3
* One of the two names statically denotes a renaming declaration
- whose renamed object_name is known to refer to the same object as
+ whose renamed <object_>name is known to refer to the same object as
the other name.
6.16/3
-If a call C has two or more parameters of mode in out or out that are of
-an elementary type, then the call is legal only if:
+If a call <C> has two or more parameters of mode in out or out that are
+of an elementary type, then the call is legal only if:
6.17/3
- * For each name N that is passed as a parameter of mode in out or out
- to the call C, there is no other name among the other parameters of
- mode in out or out to C that is known to denote the same object.
+ * For each name <N> that is passed as a parameter of mode in out or
+ out to the call <C>, there is no other name among the other
+ parameters of mode in out or out to <C> that is known to denote the
+ same object.
6.18/3
-If a construct C has two or more direct constituents that are names or
+If a construct <C> has two or more direct constituents that are names or
expressions whose evaluation may occur in an arbitrary order, at least
one of which contains a function call with an in out or out parameter,
then the construct is legal only if:
6.19/3
- * For each name N that is passed as a parameter of mode in out or out
- to some inner function call C2 (not including the construct C
- itself), there is no other name anywhere within a direct
- constituent of the construct C other than the one containing C2,
- that is known to refer to the same object.
+ * For each name <N> that is passed as a parameter of mode in out or
+ out to some inner function call <C2> (not including the construct
+ <C> itself), there is no other name anywhere within a direct
+ constituent of the construct <C> other than the one containing
+ <C2>, that is known to refer to the same object.
6.20/3
For the purposes of checking this rule:
@@ -16318,13 +16355,13 @@ For the evaluation of a parameter_association:
* For a parameter (of any mode) that is passed by reference (see
*note 6.2::), a view conversion of the actual parameter to the
nominal subtype of the formal parameter is evaluated, and the
- formal parameter denotes that conversion.
+ formal parameter denotes that conversion.
11
* For an in or in out parameter that is passed by copy (see *note
6.2::), the formal parameter object is created, and the value of
the actual parameter is converted to the nominal subtype of the
- formal parameter and assigned to the formal.
+ formal parameter and assigned to the formal.
12
* For an out parameter that is passed by copy, the formal parameter
@@ -16383,8 +16420,8 @@ constrained.
After normal completion and leaving of a subprogram, for each in out or
out parameter that is passed by copy, the value of the formal parameter
is converted to the subtype of the variable given as the actual
-parameter and assigned to it. These conversions and assignments occur in
-an arbitrary order.
+parameter and assigned to it. These conversions and assignments occur
+in an arbitrary order.
_Erroneous Execution_
@@ -16404,7 +16441,7 @@ File: arm2012.info, Node: 6.5, Next: 6.6, Prev: 6.4,
Up: 6
1/2
A simple_return_statement (*note 6.5: S0183.) or
extended_return_statement (*note 6.5: S0186.) (collectively called a
-return statement) is used to complete the execution of the innermost
+<return statement>) is used to complete the execution of the innermost
enclosing subprogram_body (*note 6.3: S0177.), entry_body (*note 9.5.2:
S0221.), or accept_statement (*note 9.5.2: S0219.).
@@ -16431,19 +16468,19 @@ S0221.), or accept_statement (*note 9.5.2: S0219.).
_Name Resolution Rules_
3/2
-The result subtype of a function is the subtype denoted by the
+The <result subtype> of a function is the subtype denoted by the
subtype_mark, or defined by the access_definition, after the reserved
word return in the profile of the function. The expected type for the
expression, if any, of a simple_return_statement (*note 6.5: S0183.) is
-the result type of the corresponding function. The expected type for the
-expression of an extended_return_statement is that of the
+the result type of the corresponding function. The expected type for
+the expression of an extended_return_statement is that of the
return_subtype_indication (*note 6.5: S0187.).
_Legality Rules_
4/2
-A return statement shall be within a callable construct, and it applies
-to the innermost callable construct or extended_return_statement that
+A return statement shall be within a callable construct, and it <applies
+to> the innermost callable construct or extended_return_statement that
contains it. A return statement shall not be within a body that is
within the construct to which the return statement applies.
@@ -16516,9 +16553,9 @@ object shall be immutably limited.
_Static Semantics_
5.10/3
-Within an extended_return_statement, the return object is declared with
-the given defining_identifier, with the nominal subtype defined by the
-return_subtype_indication (*note 6.5: S0187.). An
+Within an extended_return_statement, the <return object> is declared
+with the given defining_identifier, with the nominal subtype defined by
+the return_subtype_indication (*note 6.5: S0187.). An
extended_return_statement with the reserved word constant is a full
constant declaration that declares the return object to be a constant
object.
@@ -16537,12 +16574,12 @@ object of its nominal subtype (see *note 3.3.1::).
If the nominal
subtype is indefinite, the return object is constrained by its initial
value. A check is made that the value of the return object belongs to
the function result subtype. Constraint_Error is raised if this check
-fails.
+fails.
6/2
For the execution of a simple_return_statement (*note 6.5: S0183.), the
expression (if any) is first evaluated, converted to the result subtype,
-and then is assigned to the anonymous return object.
+and then is assigned to the anonymous <return object>.
7/2
If the return object has any parts that are tasks, the activation of
@@ -16559,15 +16596,15 @@ specific, in which case it is that of the type of the
subtype_indication. A check is made that the master of the type
identified by the tag of the result includes the elaboration of the
master that elaborated the function body. If this check fails,
-Program_Error is raised.
+Program_Error is raised.
8.1/3
If the result subtype of the function is defined by an access_definition
-designating a specific tagged type T, a check is made that the result
+designating a specific tagged type <T>, a check is made that the result
value is null or the tag of the object designated by the result value
-identifies T. Constraint_Error is raised if this check fails.
+identifies <T>. Constraint_Error is raised if this check fails.
-Paragraphs 9 through 20 were deleted.
+<Paragraphs 9 through 20 were deleted.>
21/3
If any part of the specific type of the return object of a function (or
@@ -16577,7 +16614,7 @@ that the accessibility level of the anonymous access
type of each access
discriminant, as determined by the expression or the
return_subtype_indication (*note 6.5: S0187.) of the return statement,
is not deeper than the level of the master of the call (see *note
-3.10.2::). If this check fails, Program_Error is raised.
+3.10.2::). If this check fails, Program_Error is raised.
22/3
For the execution of an extended_return_statement (*note 6.5: S0186.),
@@ -16621,17 +16658,17 @@ is built in place into such an object:
_Examples_
25
-Examples of return statements:
+<Examples of return statements:>
26/2
- return; -- in a procedure body, entry_body,
- -- accept_statement, or
extended_return_statement
+ return; --< in a procedure body, >entry_body<,>
+ -- accept_statement<, or
>extended_return_statement
27
- return Key_Value(Last_Index); -- in a function body
+ return Key_Value(Last_Index); --< in a function body>
28/2
- return Node : Cell do -- in a function body, see *note 3.10.1::
for Cell
+ return Node : Cell do --< in a function body, see *note
3.10.1:: for Cell>
Node.Value := Result;
Node.Succ := Next_Node;
end return;
@@ -16651,8 +16688,8 @@ Specifying aspect No_Return to have the value True
indicates that a
procedure cannot return normally; it may propagate an exception or loop
forever.
-Paragraphs 2 and 3 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 and 3 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -16664,7 +16701,7 @@ representation aspect may be specified:
No_Return
The type of aspect No_Return is Boolean. When aspect
No_Return is True for an entity, the entity is said to be
- nonreturning.
+ <nonreturning>.
3.3/3
If directly specified, the aspect_definition shall be a
@@ -16688,7 +16725,7 @@ generic procedure.
6/2
A procedure shall be nonreturning if it overrides a dispatching
-nonreturning procedure. In addition to the places where Legality Rules
+nonreturning procedure. In addition to the places where Legality Rules
normally apply (see *note 12.3::), this rule applies also in the private
part of an instance of a generic unit.
@@ -16696,20 +16733,20 @@ part of an instance of a generic unit.
If a renaming-as-body completes a nonreturning procedure declaration,
then the renamed procedure shall be nonreturning.
-Paragraph 8 was deleted.
+<Paragraph 8 was deleted.>
_Dynamic Semantics_
9/2
If the body of a nonreturning procedure completes normally,
-Program_Error is raised at the point of the call.
+Program_Error is raised at the point of the call.
_Examples_
10/3
- procedure Fail(Msg : String) -- raises Fatal_Error exception
+ procedure Fail(Msg : String) --< raises Fatal_Error exception>
with No_Return;
- -- Inform compiler and reader that procedure never returns normally
+ --< Inform compiler and reader that procedure never returns normally>
File: arm2012.info, Node: 6.6, Next: 6.7, Prev: 6.5, Up: 6
@@ -16718,14 +16755,14 @@ File: arm2012.info, Node: 6.6, Next: 6.7, Prev:
6.5, Up: 6
============================
1
-An operator is a function whose designator is an operator_symbol.
+An <operator> is a function whose designator is an operator_symbol.
Operators, like other functions, may be overloaded.
_Name Resolution Rules_
2
Each use of a unary or binary operator is equivalent to a function_call
-with function_prefix being the corresponding operator_symbol, and with
+with <function_>prefix being the corresponding operator_symbol, and with
(respectively) one or two positional actual parameters being the
operand(s) of the operator (in order).
@@ -16764,14 +16801,14 @@ declares an operator "/=" that gives the
complementary result.
_Examples_
8
-Examples of user-defined operators:
+<Examples of user-defined operators:>
9
function "+" (Left, Right : Matrix) return Matrix;
function "+" (Left, Right : Vector) return Vector;
- -- assuming that A, B, and C are of the type Vector
- -- the following two statements are equivalent:
+ --< assuming that A, B, and C are of the type Vector>
+ --< the following two statements are equivalent:>
A := B + C;
A := "+"(B, C);
@@ -16806,8 +16843,8 @@ fully to that of the declaration.
_Static Semantics_
3/3
-A null_procedure_declaration declares a null procedure. A completion is
-not allowed for a null_procedure_declaration; however, a
+A null_procedure_declaration declares a <null procedure>. A completion
+is not allowed for a null_procedure_declaration; however, a
null_procedure_declaration can complete a previous declaration.
_Dynamic Semantics_
@@ -16825,8 +16862,8 @@ Elaboration_Check.
_Examples_
6/2
- procedure Simplify(Expr : in out Expression) is null; -- see *note 3.9::
- -- By default, Simplify does nothing, but it may be overridden in
extensions of Expression
+ procedure Simplify(Expr : in out Expression) is null; --< see *note 3.9::>
+ --< By default, Simplify does nothing, but it may be overridden in
extensions of Expression>
File: arm2012.info, Node: 6.8, Prev: 6.7, Up: 6
@@ -16879,11 +16916,12 @@ expression_function_declaration (*note 6.8: S0189.).
6/4
An expression_function_declaration (*note 6.8: S0189.) declares an
-expression function. The return expression of an expression function is
-the expression or aggregate of the expression_function_declaration. A
-completion is not allowed for an expression_function_declaration (*note
-6.8: S0189.); however, an expression_function_declaration (*note 6.8:
-S0189.) can complete a previous declaration.
+<expression function>. The <return expression> of an expression
+function is the expression or aggregate of the
+expression_function_declaration. A completion is not allowed for an
+expression_function_declaration (*note 6.8: S0189.); however, an
+expression_function_declaration (*note 6.8: S0189.) can complete a
+previous declaration.
_Dynamic Semantics_
@@ -16902,7 +16940,7 @@ function can be called without failing the
Elaboration_Check.
_Examples_
9/3
- function Is_Origin (P : in Point) return Boolean is -- see *note 3.9::
+ function Is_Origin (P : in Point) return Boolean is -- <see *note 3.9::>
(P.X = 0.0 and P.Y = 0.0);
@@ -16917,7 +16955,7 @@ logically related entities. Typically, a package
contains the
declaration of a type (often a private type or private extension) along
with the declarations of primitive subprograms of the type, which can be
called from outside the package, while their inner workings remain
-hidden from outside users.
+hidden from outside users.
* Menu:
@@ -16970,13 +17008,13 @@ package_specification.
6/2
The first list of basic_declarative_items of a package_specification of
-a package other than a generic formal package is called the visible part
-of the package. The optional list of basic_declarative_items after the
-reserved word private (of any package_specification) is called the
-private part of the package. If the reserved word private does not
-appear, the package has an implicit empty private part. Each list of
-basic_declarative_items of a package_specification forms a declaration
-list of the package.
+a package other than a generic formal package is called the <visible
+part> of the package. The optional list of basic_declarative_items
+after the reserved word private (of any package_specification) is called
+the <private part> of the package. If the reserved word private does
+not appear, the package has an implicit empty private part. Each list
+of basic_declarative_items of a package_specification forms a
+<declaration list> of the package.
7
An entity declared in the private part of a package is visible only
@@ -17007,7 +17045,7 @@ its basic_declarative_items in the given order.
_Examples_
11
-Example of a package declaration:
+<Example of a package declaration:>
12
package Rational_Numbers is
@@ -17023,7 +17061,7 @@ Example of a package declaration:
function "="(X,Y : Rational) return Boolean;
15
- function "/" (X,Y : Integer) return Rational; -- to construct a
rational number
+ function "/" (X,Y : Integer) return Rational; --< to construct a
rational number>
16
function "+" (X,Y : Rational) return Rational;
@@ -17088,7 +17126,7 @@ For a noninstance, nonlibrary package, this body occurs
at the end of
the declarative_part (*note 3.11: S0086.) of the innermost enclosing
program unit or block_statement (*note 5.6: S0160.); if there are
several such packages, the order of the implicit package_bodies is
-unspecified. (For an instance, the implicit package_body (*note 7.2:
+unspecified. (For an instance, the implicit package_body (*note 7.2:
S0192.) occurs at the place of the instantiation (see *note 12.3::).
For a library package, the place is partially determined by the
elaboration dependences (see Clause *note 10::).)
@@ -17122,7 +17160,7 @@ handled_sequence_of_statements (*note 11.2: S0265.) is
then executed.
_Examples_
9
-Example of a package body (see *note 7.1::):
+<Example of a package body (see *note 7.1::):>
10
package body Rational_Numbers is
@@ -17130,7 +17168,7 @@ Example of a package body (see *note 7.1::):
11
procedure Same_Denominator (X,Y : in out Rational) is
begin
- -- reduces X and Y to the same denominator:
+ --< reduces X and Y to the same denominator:>
...
end Same_Denominator;
@@ -17174,7 +17212,7 @@ private type or private extension serves to separate
the characteristics
that can be used directly by outside program units (that is, the logical
properties) from other characteristics whose direct use is confined to
the package (the details of the definition of the type itself). See
-*note 3.9.1:: for an overview of type extensions.
+*note 3.9.1:: for an overview of type extensions.
_Syntax_
@@ -17187,7 +17225,7 @@ the package (the details of the definition of the type
itself). See
3/3
private_extension_declaration ::=
type defining_identifier [discriminant_part] is
- [abstract] [limited | synchronized] new ancestor_
+ [abstract] [limited | synchronized] new <ancestor_>
subtype_indication
[and interface_list] with private
[aspect_specification];
@@ -17196,11 +17234,11 @@ the package (the details of the definition of the
type itself). See
4
A private_type_declaration or private_extension_declaration declares a
-partial view of the type; such a declaration is allowed only as a
+<partial view> of the type; such a declaration is allowed only as a
declarative_item of the visible part of a package, and it requires a
completion, which shall be a full_type_declaration that occurs as a
declarative_item of the private part of the package. The view of the
-type declared by the full_type_declaration is called the full view. A
+type declared by the full_type_declaration is called the <full view>. A
generic formal private type or a generic formal private extension is
also a partial view.
@@ -17245,8 +17283,8 @@ If a full type has a partial view that is tagged, then:
interface type.
8
-The ancestor subtype of a private_extension_declaration is the subtype
-defined by the ancestor_subtype_indication (*note 3.2.2: S0027.); the
+The <ancestor subtype> of a private_extension_declaration is the subtype
+defined by the <ancestor_>subtype_indication (*note 3.2.2: S0027.); the
ancestor type shall be a specific tagged type. The full view of a
private extension shall be derived (directly or indirectly) from the
ancestor type. In addition to the places where Legality Rules normally
@@ -17263,7 +17301,7 @@ type shall be a limited interface.
If the declaration of a partial view includes a known_discriminant_part,
then the full_type_declaration shall have a fully conforming (explicit)
known_discriminant_part (see *note 6.3.1::, "*note 6.3.1:: Conformance
-Rules"). The ancestor subtype may be unconstrained; the parent subtype
+Rules"). The ancestor subtype may be unconstrained; the parent subtype
of the full view is required to be constrained (see *note 3.7::).
10
@@ -17290,13 +17328,13 @@ full_type_declaration shall define a definite subtype.
13
If the ancestor subtype of a private extension has constrained
discriminants, then the parent subtype of the full view shall impose a
-statically matching constraint on those discriminants.
+statically matching constraint on those discriminants.
_Static Semantics_
14
A private_type_declaration declares a private type and its first
-subtype. Similarly, a private_extension_declaration (*note 7.3: S0194.)
+subtype. Similarly, a private_extension_declaration (*note 7.3: S0194.)
declares a private extension and its first subtype.
15/3
@@ -17327,8 +17365,8 @@ of its parent type and its progenitor types (see *note
3.4:: and *note
17
The elaboration of a private_type_declaration creates a partial view of
-a type. The elaboration of a private_extension_declaration elaborates
-the ancestor_subtype_indication, and creates a partial view of a type.
+a type. The elaboration of a private_extension_declaration elaborates
+the <ancestor_>subtype_indication, and creates a partial view of a type.
NOTES
@@ -17372,14 +17410,14 @@ the ancestor_subtype_indication, and creates a
partial view of a type.
_Examples_
21
-Examples of private type declarations:
+<Examples of private type declarations:>
22
type Key is private;
type File_Name is limited private;
23
-Example of a private extension declaration:
+<Example of a private extension declaration:>
24
type List is new Ada.Finalization.Controlled with private;
@@ -17398,8 +17436,8 @@ File: arm2012.info, Node: 7.3.1, Next: 7.3.2, Up: 7.3
1
For a type declared in the visible part of a package or generic package,
certain operations on the type do not become visible until later in the
-package -- either in the private part or the body. Such private
-operations are available only inside the declarative region of the
+package -- either in the private part or the body. Such <private
+operations> are available only inside the declarative region of the
package or generic package.
_Static Semantics_
@@ -17441,7 +17479,7 @@ predefined "=" operator is implicitly declared at that
place, and
assignment is allowed after that place.
5.1/3
-A type is a descendant of the full view of some ancestor of its parent
+A type is a <descendant> of the full view of some ancestor of its parent
type only if the current view it has of its parent is a descendant of
the full view of that ancestor. More generally, at any given place, a
type is descended from the same view of an ancestor as that from which
@@ -17459,7 +17497,8 @@ In this case, the derived type inherits no
characteristics from that
ancestor, but nevertheless is within the derivation class of the
ancestor for the purposes of type conversion, the "covers" relationship,
and matching against a formal derived type. In this case the derived
-type is effectively a descendant of an incomplete view of the ancestor.
+type is effectively a <descendant> of an incomplete view of the
+ancestor.
6/3
Inherited primitive subprograms follow a different rule. For a
@@ -17531,12 +17570,12 @@ S'Class
_Examples_
14
-Example of a type with private operations:
+<Example of a type with private operations:>
15
package Key_Manager is
type Key is private;
- Null_Key : constant Key; -- a deferred constant declaration (see *note
7.4::)
+ Null_Key : constant Key; --< a deferred constant declaration (see
*note 7.4::)>
procedure Get_Key(K : out Key);
function "<" (X, Y : Key) return Boolean;
private
@@ -17563,7 +17602,7 @@ Example of a type with private operations:
NOTES
18
- 12 Notes on the example: Outside of the package Key_Manager, the
+ 12 <Notes on the example:> Outside of the package Key_Manager, the
operations available for objects of type Key include assignment,
the comparison for equality or inequality, the procedure Get_Key
and the operator "<"; they do not include other relational
@@ -17596,22 +17635,22 @@ language-defined aspects may be specified with an
aspect_specification
2/3
Type_Invariant
This aspect shall be specified by an expression, called
- an invariant expression. Type_Invariant may be specified
- on a private_type_declaration (*note 7.3: S0193.), on a
- private_extension_declaration (*note 7.3: S0194.), or on
- a full_type_declaration (*note 3.2.1: S0024.) that
- declares the completion of a private type or private
- extension.
+ an <invariant expression>. Type_Invariant may be
+ specified on a private_type_declaration (*note 7.3:
+ S0193.), on a private_extension_declaration (*note 7.3:
+ S0194.), or on a full_type_declaration (*note 3.2.1:
+ S0024.) that declares the completion of a private type or
+ private extension.
3/4
Type_Invariant'Class
This aspect shall be specified by an expression, called
- an invariant expression. Type_Invariant'Class may be
+ an <invariant expression>. Type_Invariant'Class may be
specified on a private_type_declaration (*note 7.3:
S0193.), a private_extension_declaration (*note 7.3:
S0194.), or a full_type_declaration (*note 3.2.1: S0024.)
for an interface type. Type_Invariant'Class determines a
- class-wide type invariant for a tagged type.
+ <class-wide type invariant> for a tagged type.
_Name Resolution Rules_
@@ -17621,13 +17660,14 @@ The expected type for an invariant expression is any
boolean type.
5/4
Within an invariant expression, the identifier of the first subtype of
the associated type denotes the current instance of the type. Within an
-invariant expression for the Type_Invariant aspect of a type T, the type
-of this current instance is T. Within an invariant expression for the
-Type_Invariant'Class aspect of a type T, the type of this current
-instance is interpreted as though it had a (notional) type NT that is a
-visible formal derived type whose ancestor type is T. The effect of this
-interpretation is that the only operations that can be applied to this
-current instance are those defined for such a formal derived type.
+invariant expression for the Type_Invariant aspect of a type <T>, the
+type of this current instance is <T>. Within an invariant expression
+for the Type_Invariant'Class aspect of a type <T>, the type of this
+current instance is interpreted as though it had a (notional) type <NT>
+that is a visible formal derived type whose ancestor type is <T>. The
+effect of this interpretation is that the only operations that can be
+applied to this current instance are those defined for such a formal
+derived type.
_Legality Rules_
@@ -17645,41 +17685,41 @@ or shall be overridden.
_Static Semantics_
7/3
-If the Type_Invariant aspect is specified for a type T, then the
-invariant expression applies to T.
+If the Type_Invariant aspect is specified for a type <T>, then the
+invariant expression applies to <T>.
8/3
-If the Type_Invariant'Class aspect is specified for a tagged type T,
-then the invariant expression applies to all descendants of T.
+If the Type_Invariant'Class aspect is specified for a tagged type <T>,
+then the invariant expression applies to all descendants of <T>.
_Dynamic Semantics_
9/4
-If one or more invariant expressions apply to a nonabstract type T, then
-an invariant check is performed at the following places, on the
+If one or more invariant expressions apply to a nonabstract type <T>,
+then an invariant check is performed at the following places, on the
specified object(s):
10/4
- * After successful initialization of an object of type T by default
+ * After successful initialization of an object of type <T> by default
(see *note 3.3.1::), the check is performed on the new object
- unless the partial view of T has unknown discriminants;
+ unless the partial view of <T> has unknown discriminants;
10.1/4
* After successful explicit initialization of the completion of a
- deferred constant with a part of type T, if the completion is
- inside the immediate scope of the full view of T, and the deferred
- constant is visible outside the immediate scope of T, the check is
- performed on the part(s) of type T;
+ deferred constant with a part of type <T>, if the completion is
+ inside the immediate scope of the full view of <T>, and the
+ deferred constant is visible outside the immediate scope of <T>,
+ the check is performed on the part(s) of type <T>;
11/3
- * After successful conversion to type T, the check is performed on
+ * After successful conversion to type <T>, the check is performed on
the result of the conversion;
12/3
- * For a view conversion, outside the immediate scope of T, that
- converts from a descendant of T (including T itself) to an ancestor
- of type T (other than T itself), a check is performed on the part
- of the object that is of type T:
+ * For a view conversion, outside the immediate scope of <T>, that
+ converts from a descendant of <T> (including <T> itself) to an
+ ancestor of type <T> (other than <T> itself), a check is performed
+ on the part of the object that is of type <T>:
13/3
* after assigning to the view conversion; and
@@ -17690,7 +17730,7 @@ specified object(s):
15/4
* After a successful call on the Read or Input stream-oriented
- attribute of the type T, the check is performed on the object
+ attribute of the type <T>, the check is performed on the object
initialized by the attribute;
16/3
@@ -17698,65 +17738,65 @@ specified object(s):
subprogram or entry that:
17/4
- * is declared within the immediate scope of type T (or by an
+ * is declared within the immediate scope of type <T> (or by an
instance of a generic unit, and the generic is declared within
- the immediate scope of type T),
+ the immediate scope of type <T>),
18/4
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
19/4
* and either:
19.1/4
- * has a result with a part of type T, or
+ * has a result with a part of type <T>, or
19.2/4
* has one or more out or in out parameters with a part of
- type T, or
+ type <T>, or
19.3/4
* has an access-to-object parameter or result whose
- designated type has a part of type T, or
+ designated type has a part of type <T>, or
19.4/4
* is a procedure or entry that has an in parameter with a
- part of type T,
+ part of type <T>,
19.5/4
* and either:
19.6/4
- * T is a private type or a private extension and the
+ * <T> is a private type or a private extension and the
subprogram or entry is visible outside the immediate
- scope of type T or overrides an inherited operation that
- is visible outside the immediate scope of T, or
+ scope of type <T> or overrides an inherited operation
+ that is visible outside the immediate scope of <T>, or
19.7/4
- * T is a record extension, and the subprogram or entry is a
- primitive operation visible outside the immediate scope
- of type T or overrides an inherited operation that is
- visible outside the immediate scope of T.
+ * <T> is a record extension, and the subprogram or entry is
+ a primitive operation visible outside the immediate scope
+ of type <T> or overrides an inherited operation that is
+ visible outside the immediate scope of <T>.
20/3
- The check is performed on each such part of type T.
+ The check is performed on each such part of type <T>.
20.1/4
* For a view conversion to a class-wide type occurring within the
- immediate scope of T, from a specific type that is a descendant of
- T (including T itself), a check is performed on the part of the
- object that is of type T.
+ immediate scope of <T>, from a specific type that is a descendant
+ of <T> (including <T> itself), a check is performed on the part of
+ the object that is of type <T>.
21/4
If performing checks is required by the Type_Invariant or
Type_Invariant'Class assertion policies (see *note 11.4.2::) in effect
at the point of the corresponding aspect specification applicable to a
given type, then the respective invariant expression is considered
-enabled.
+<enabled>.
22/3
The invariant check consists of the evaluation of each enabled invariant
-expression that applies to T, on each of the objects specified above.
+expression that applies to <T>, on each of the objects specified above.
If any of these evaluate to False, Assertions.Assertion_Error is raised
at the point of the object initialization, conversion, or call. If a
given call requires more than one evaluation of an invariant expression,
@@ -17769,12 +17809,12 @@ postcondition check, and any constraint or predicate
checks associated
with in out or out parameters are performed in an arbitrary order.
22.1/4
-For an invariant check on a value of type T1 based on a class-wide
-invariant expression inherited from an ancestor type T, any operations
+For an invariant check on a value of type <T1> based on a class-wide
+invariant expression inherited from an ancestor type <T>, any operations
within the invariant expression that were resolved as primitive
-operations of the (notional) formal derived type NT are bound to the
-corresponding operations of type T1 in the evaluation of the invariant
-expression for the check on T1.
+operations of the (notional) formal derived type <NT> are bound to the
+corresponding operations of type <T1> in the evaluation of the invariant
+expression for the check on <T1>.
23/3
The invariant checks performed on a call are determined by the
@@ -17785,12 +17825,12 @@ value.
NOTES
24/3
- 13 For a call of a primitive subprogram of type NT that is
- inherited from type T, the specified checks of the specific
- invariants of both the types NT and T are performed. For a call of
- a primitive subprogram of type NT that is overridden for type NT,
- the specified checks of the specific invariants of only type NT are
- performed.
+ 13 For a call of a primitive subprogram of type <NT> that is
+ inherited from type <T>, the specified checks of the specific
+ invariants of both the types <NT> and <T> are performed. For a
+ call of a primitive subprogram of type <NT> that is overridden for
+ type <NT>, the specified checks of the specific invariants of only
+ type <NT> are performed.
File: arm2012.info, Node: 7.4, Next: 7.5, Prev: 7.3, Up: 7
@@ -17807,13 +17847,13 @@ from other languages (see *note Annex B::).
_Legality Rules_
2/3
-A deferred constant declaration is an object_declaration with the
-reserved word constant but no initialization expression. The constant
-declared by a deferred constant declaration is called a deferred
-constant. Unless the Import aspect (see *note B.1::) is True for a
+A <deferred constant declaration> is an object_declaration with the
+reserved word constant but no initialization expression. The constant
+declared by a deferred constant declaration is called a <deferred
+constant>. Unless the Import aspect (see *note B.1::) is True for a
deferred constant declaration, the deferred constant declaration
requires a completion, which shall be a full constant declaration
-(called the full declaration of the deferred constant).
+(called the <full declaration> of the deferred constant).
3
A deferred constant declaration that is completed by a full constant
@@ -17831,9 +17871,9 @@ apply to the corresponding full declaration:
6/3
* If the deferred constant declaration includes a subtype_indication
- S that defines a constrained subtype, then the constraint defined
+ <S> that defines a constrained subtype, then the constraint defined
by the subtype_indication in the full declaration shall match the
- constraint defined by S statically. On the other hand, if the
+ constraint defined by <S> statically. On the other hand, if the
subtype of the deferred constant is unconstrained, then the full
declaration is still allowed to impose a constraint. The constant
itself will be constrained, like all constants;
@@ -17873,15 +17913,15 @@ an imported constant) the array_type_definition.
_Examples_
12
-Examples of deferred constant declarations:
+<Examples of deferred constant declarations:>
13
- Null_Key : constant Key; -- see *note 7.3.1::
+ Null_Key : constant Key; --< see *note 7.3.1::>
14/3
CPU_Identifier : constant String(1..8)
with Import => True, Convention => Assembler, Link_Name => "CPU_ID";
- -- see *note B.1::
+ --< see *note B.1::>
File: arm2012.info, Node: 7.5, Next: 7.6, Prev: 7.4, Up: 7
@@ -17907,8 +17947,8 @@ shall be limited.
In the following contexts, an expression of a limited type is not
permitted unless it is an aggregate, a function_call, a parenthesized
expression or qualified_expression whose operand is permitted by this
-rule, or a conditional_expression all of whose dependent_expressions are
-permitted by this rule:
+rule, or a conditional_expression all of whose <dependent_>expressions
+are permitted by this rule:
2.2/2
* the initialization expression of an object_declaration (see *note
@@ -17946,7 +17986,7 @@ permitted by this rule:
_Static Semantics_
3/3
-A view of a type is limited if it is one of the following:
+A view of a type is <limited> if it is one of the following:
4/2
* a type with the reserved word limited, synchronized, task, or
@@ -17971,7 +18011,7 @@ Otherwise, the type is nonlimited.
There are no predefined equality operators for a limited type.
8.1/3
-A type is immutably limited if it is one of the following:
+A type is <immutably limited> if it is one of the following:
8.2/3
* An explicitly limited record type;
@@ -18004,7 +18044,7 @@ type is declared within the formal part of the generic
unit.
function_call, and such aggregates and function_calls must be built
directly in the target object (see *note 7.6::).
- Paragraphs 10 through 15 were deleted.
+ <Paragraphs 10 through 15 were deleted.>
16
16 As illustrated in *note 7.3.1::, an untagged limited type can
@@ -18013,7 +18053,7 @@ type is declared within the formal part of the generic
unit.
_Examples_
17
-Example of a package with a limited type:
+<Example of a package with a limited type:>
18
package IO_Package is
@@ -18048,7 +18088,7 @@ Example of a package with a limited type:
NOTES
21
- 17 Notes on the example: In the example above, an outside
+ 17 <Notes on the example:> In the example above, an outside
subprogram making use of IO_Package may obtain a file name by
calling Open and later use it in calls to Read and Write. Thus,
outside the package, a file name obtained from Open acts as a kind
@@ -18087,18 +18127,18 @@ finalized before being destroyed (for example, by
leaving a
subprogram_body containing an object_declaration, or by a call to an
instance of Unchecked_Deallocation). An assignment operation is used as
part of assignment_statements, explicit initialization, parameter
-passing, and other operations.
+passing, and other operations.
2
Default definitions for these three fundamental operations are provided
-by the language, but a controlled type gives the user additional control
-over parts of these operations. In particular, the user can define, for
-a controlled type, an Initialize procedure which is invoked immediately
-after the normal default initialization of a controlled object, a
-Finalize procedure which is invoked immediately before finalization of
-any of the components of a controlled object, and an Adjust procedure
-which is invoked as the last step of an assignment to a (nonlimited)
-controlled object.
+by the language, but a <controlled> type gives the user additional
+control over parts of these operations. In particular, the user can
+define, for a controlled type, an Initialize procedure which is invoked
+immediately after the normal default initialization of a controlled
+object, a Finalize procedure which is invoked immediately before
+finalization of any of the components of a controlled object, and an
+Adjust procedure which is invoked as the last step of an assignment to a
+(nonlimited) controlled object.
_Static Semantics_
@@ -18126,7 +18166,7 @@ The following language-defined library package exists:
procedure Initialize (Object : in out Limited_Controlled) is null;
procedure Finalize (Object : in out Limited_Controlled) is null;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Finalization;
9/2
@@ -18139,7 +18179,7 @@ Controlled, except that it is limited and it lacks the
primitive
subprogram Adjust.
9.1/2
-A type is said to need finalization if:
+A type is said to <need finalization> if:
9.2/2
* it is a controlled type, a task type or a protected type; or
@@ -18187,13 +18227,13 @@ all calls on Initialize.
13
When a target object with any controlled parts is assigned a value,
either when created or in a subsequent assignment_statement, the
-assignment operation proceeds as follows:
+<assignment operation> proceeds as follows:
14
* The value of the target becomes the assigned value.
15
- * The value of the target is adjusted.
+ * The value of the target is <adjusted.>
16/3
To adjust the value of a composite object, the values of the components
@@ -18218,7 +18258,7 @@ given in *note 5.2::, "*note 5.2:: Assignment
Statements".
When a function call or aggregate is used to initialize an object, the
result of the function call or aggregate is an anonymous object, which
is assigned into the newly-created object. For such an assignment, the
-anonymous object might be built in place, in which case the assignment
+anonymous object might be <built in place>, in which case the assignment
does not involve any copying. Under certain circumstances, the
anonymous object is required to be built in place. In particular:
@@ -18241,7 +18281,7 @@ object is built in place:
17.6/3
* Upon successful completion of the return statement or aggregate,
- the anonymous object mutates into the newly-created object; that
+ the anonymous object <mutates into> the newly-created object; that
is, the anonymous object ceases to exist, and the newly-created
object appears in its place.
@@ -18331,29 +18371,30 @@ File: arm2012.info, Node: 7.6.1, Up: 7.6
---------------------------------
1
-This subclause defines completion and leaving of the execution of
-constructs and entities. A master is the execution of a construct that
-includes finalization of local objects after it is complete (and after
-waiting for any local tasks -- see *note 9.3::), but before leaving.
-Other constructs and entities are left immediately upon completion.
+This subclause defines <completion> and <leaving> of the execution of
+constructs and entities. A <master> is the execution of a construct
+that includes finalization of local objects after it is complete (and
+after waiting for any local tasks -- see *note 9.3::), but before
+leaving. Other constructs and entities are left immediately upon
+completion.
_Dynamic Semantics_
2/2
-The execution of a construct or entity is complete when the end of that
-execution has been reached, or when a transfer of control (see *note
-5.1::) causes it to be abandoned. Completion due to reaching the end of
-execution, or due to the transfer of control of an exit_statement,
-return statement, goto_statement, or requeue_statement or of the
-selection of a terminate_alternative is normal completion. Completion
-is abnormal otherwise -- when control is transferred out of a construct
-due to abort or the raising of an exception.
+The execution of a construct or entity is <complete> when the end of
+that execution has been reached, or when a transfer of control (see
+*note 5.1::) causes it to be abandoned. Completion due to reaching the
+end of execution, or due to the transfer of control of an
+exit_statement, return statement, goto_statement, or requeue_statement
+or of the selection of a terminate_alternative is <normal completion>.
+Completion is <abnormal> otherwise -- when control is transferred out of
+a construct due to abort or the raising of an exception.
3/2
-After execution of a construct or entity is complete, it is left,
+After execution of a construct or entity is complete, it is <left>,
meaning that execution continues with the next action, as defined for
-the execution that is taking place. Leaving an execution happens
-immediately after its completion, except in the case of a master: the
+the execution that is taking place. Leaving an execution happens
+immediately after its completion, except in the case of a <master>: the
execution of a body other than a package_body; the execution of a
statement; or the evaluation of an expression, function_call, or range
that is not part of an enclosing expression, function_call, range, or
@@ -18362,9 +18403,9 @@ simple_return_statement (*note 6.5: S0183.). A master
is finalized
after it is complete, and before it is left.
4
-For the finalization of a master, dependent tasks are first awaited, as
-explained in *note 9.3::. Then each object whose accessibility level is
-the same as that of the master is finalized if the object was
+For the <finalization> of a master, dependent tasks are first awaited,
+as explained in *note 9.3::. Then each object whose accessibility level
+is the same as that of the master is finalized if the object was
successfully initialized and still exists. These actions are performed
whether the master is left by reaching the last statement or via a
transfer of control. When a transfer of control causes completion of an
@@ -18372,7 +18413,7 @@ execution, each included master is finalized in order,
from innermost
outward.
5
-For the finalization of an object:
+For the <finalization> of an object:
6/3
* If the full type of the object is an elementary type, finalization
@@ -18415,13 +18456,13 @@ completes, and it will be finalized then.
The finalization of a master performs finalization of objects created by
declarations in the master in the reverse order of their creation.
After the finalization of a master is complete, the objects finalized as
-part of its finalization cease to exist, as do any types and subtypes
-defined and created within the master.
+part of its finalization cease to <exist>, as do any types and subtypes
+defined and created within the master.
11.1/3
-Each nonderived access type T has an associated collection, which is the
-set of objects created by allocators of T, or of types derived from T.
-Unchecked_Deallocation removes an object from its collection.
+Each nonderived access type <T> has an associated <collection>, which is
+the set of objects created by allocators of <T>, or of types derived
+from <T>. Unchecked_Deallocation removes an object from its collection.
Finalization of a collection consists of finalization of each object in
the collection, in an arbitrary order. The collection of an access type
is an object implicitly declared at the following place:
@@ -18482,7 +18523,7 @@ Adjust operation:
those invoked as part of an assignment_statement, other adjustments
due to be performed might or might not be performed, and then
Program_Error is raised. During its propagation, finalization
- might or might not be applied to objects whose Adjust failed. For
+ might or might not be applied to objects whose Adjust failed. For
an Adjust invoked as part of an assignment_statement, any other
adjustments due to be performed are performed, and then
Program_Error is raised.
@@ -18493,7 +18534,7 @@ Adjust operation:
are performed, and then Program_Error is raised.
17.1/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
17.2/1
* For a Finalize invoked due to reaching the end of the execution of
@@ -18608,8 +18649,8 @@ File: arm2012.info, Node: 8.1, Next: 8.2, Up: 8
1
For each of the following constructs, there is a portion of the program
-text called its declarative region, within which nested declarations can
-occur:
+text called its <declarative region>, within which nested declarations
+can occur:
2
* any declaration, other than that of an enumeration type, that is
@@ -18657,27 +18698,27 @@ additional text determined (recursively), as follows:
record_representation_clause, if any.
12
-The declarative region of a declaration is also called the declarative
-region of any view or entity declared by the declaration.
+The declarative region of a declaration is also called the <declarative
+region> of any view or entity declared by the declaration.
13
-A declaration occurs immediately within a declarative region if this
+A declaration occurs <immediately within> a declarative region if this
region is the innermost declarative region that encloses the declaration
-(the immediately enclosing declarative region), not counting the
+(the <immediately enclosing> declarative region), not counting the
declarative region (if any) associated with the declaration itself.
14
-A declaration is local to a declarative region if the declaration occurs
-immediately within the declarative region. An entity is local to a
-declarative region if the entity is declared by a declaration that is
-local to the declarative region.
+A declaration is <local> to a declarative region if the declaration
+occurs immediately within the declarative region. An entity is <local>
+to a declarative region if the entity is declared by a declaration that
+is local to the declarative region.
15
-A declaration is global to a declarative region if the declaration
+A declaration is <global> to a declarative region if the declaration
occurs immediately within another declarative region that encloses the
-declarative region. An entity is global to a declarative region if the
-entity is declared by a declaration that is global to the declarative
-region.
+declarative region. An entity is <global> to a declarative region if
+the entity is declared by a declaration that is global to the
+declarative region.
NOTES
@@ -18692,8 +18733,8 @@ region.
2 As explained above and in *note 10.1.1::, "*note 10.1.1::
Compilation Units - Library Units", all library units are
descendants of Standard, and so are contained in the declarative
- region of Standard. They are not inside the declaration or body of
- Standard, but they are inside its declarative region.
+ region of Standard. They are <not> inside the declaration or body
+ of Standard, but they <are> inside its declarative region.
18
3 For a declarative region that comes in multiple parts, the text
@@ -18711,7 +18752,7 @@ File: arm2012.info, Node: 8.2, Next: 8.3, Prev: 8.1,
Up: 8
1
For each declaration, the language rules define a certain portion of the
-program text called the scope of the declaration. The scope of a
+program text called the <scope> of the declaration. The scope of a
declaration is also called the scope of any view or entity declared by
the declaration. Within the scope of an entity, and only there, there
are places where it is legal to refer to the declared entity. These
@@ -18720,7 +18761,7 @@ places are defined by the rules of visibility and
overloading.
_Static Semantics_
2
-The immediate scope of a declaration is a portion of the declarative
+The <immediate scope> of a declaration is a portion of the declarative
region immediately enclosing the declaration. The immediate scope
starts at the beginning of the declaration, except in the case of an
overloadable declaration, in which case the immediate scope starts just
@@ -18737,12 +18778,12 @@ exceptions:
4
* The immediate scope of a declaration in the private part of a
library unit does not include the visible part of any public
- descendant of that library unit.
+ descendant of that library unit.
5
-The visible part of (a view of) an entity is a portion of the text of
+The <visible part> of (a view of) an entity is a portion of the text of
its declaration containing declarations that are visible from outside.
-The private part of (a view of) an entity that has a visible part
+The <private part> of (a view of) an entity that has a visible part
contains all declarations within the declaration of (the view of) the
entity, except those in the visible part; these are not visible from
outside. Visible and private parts are defined only for these kinds of
@@ -18785,7 +18826,7 @@ identical to the scope of the associated declaration.
11
The immediate scope of a declaration is also the immediate scope of the
-entity or view declared by the declaration. Similarly, the scope of a
+entity or view declared by the declaration. Similarly, the scope of a
declaration is also the scope of the entity or view declared by the
declaration.
@@ -18814,19 +18855,19 @@ File: arm2012.info, Node: 8.3, Next: 8.4, Prev:
8.2, Up: 8
==============
1
-The visibility rules, given below, determine which declarations are
+The <visibility rules>, given below, determine which declarations are
visible and directly visible at each place within a program. The
visibility rules apply to both explicit and implicit declarations.
_Static Semantics_
2
-A declaration is defined to be directly visible at places where a name
+A declaration is defined to be <directly visible> at places where a name
consisting of only an identifier or operator_symbol is sufficient to
denote the declaration; that is, no selected_component notation or
special context (such as preceding => in a named association) is
-necessary to denote the declaration. A declaration is defined to be
-visible wherever it is directly visible, as well as at other places
+necessary to denote the declaration. A declaration is defined to be
+<visible> wherever it is directly visible, as well as at other places
where some name (such as a selected_component) can denote the
declaration.
@@ -18837,36 +18878,37 @@ used to indicate contexts where visibility, but not
direct visibility,
is required.
4
-There are two kinds of direct visibility: immediate visibility and
-use-visibility. A declaration is immediately visible at a place if it is
-directly visible because the place is within its immediate scope. A
+There are two kinds of direct visibility: <immediate visibility> and
+<use-visibility>. A declaration is immediately visible at a place if it
+is directly visible because the place is within its immediate scope. A
declaration is use-visible if it is directly visible because of a
use_clause (see *note 8.4::). Both conditions can apply.
5
-A declaration can be hidden, either from direct visibility, or from all
-visibility, within certain parts of its scope. Where hidden from all
-visibility, it is not visible at all (neither using a direct_name nor a
-selector_name). Where hidden from direct visibility, only direct
-visibility is lost; visibility using a selector_name is still possible.
+A declaration can be <hidden>, either from direct visibility, or from
+all visibility, within certain parts of its scope. Where <hidden from
+all visibility>, it is not visible at all (neither using a direct_name
+nor a selector_name). Where <hidden from direct visibility>, only
+direct visibility is lost; visibility using a selector_name is still
+possible.
6
-Two or more declarations are overloaded if they all have the same
+Two or more declarations are <overloaded> if they all have the same
defining name and there is a place where they are all directly visible.
7
The declarations of callable entities (including enumeration literals)
-are overloadable, meaning that overloading is allowed for them.
+are <overloadable>, meaning that overloading is allowed for them.
8
-Two declarations are homographs if they have the same defining name,
-and, if both are overloadable, their profiles are type conformant. An
+Two declarations are <homographs> if they have the same defining name,
+and, if both are overloadable, their profiles are type conformant. An
inner declaration hides any outer homograph from direct visibility.
9/1
Two homographs are not generally allowed immediately within the same
-declarative region unless one overrides the other (see Legality Rules
-below). The only declarations that are overridable are the implicit
+declarative region unless one <overrides> the other (see Legality Rules
+below). The only declarations that are <overridable> are the implicit
declarations for predefined operators and inherited primitive
subprograms. A declaration overrides another homograph that occurs
immediately within the same declarative region in the following cases:
@@ -18903,7 +18945,7 @@ immediately within the same declarative region in the
following cases:
overriding; if more than one such homograph remains that
is not thus overridden, then if they are all fully
conformant with one another, one is chosen arbitrarily;
- if not, they are all hidden from all visibility.
+ if not, they are all hidden from all visibility.
13
* For an implicit declaration of a primitive subprogram in a generic
@@ -18994,14 +19036,14 @@ scope except where hidden from direct visibility, as
follows:
from all visibility.
23.1/3
-An attribute_definition_clause or an aspect_specification is visible
+An attribute_definition_clause or an aspect_specification is <visible>
everywhere within its scope.
_Name Resolution Rules_
24
A direct_name shall resolve to denote a directly visible declaration
-whose defining name is the same as the direct_name. A selector_name
+whose defining name is the same as the direct_name. A selector_name
shall resolve to denote a visible declaration whose defining name is the
same as the selector_name.
@@ -19029,7 +19071,7 @@ declared in the visible part of an instance of a
generic unit. However,
they do not apply to other overloadable declarations in an instance;
such declarations may have type conformant profiles in the instance, so
long as the corresponding declarations in the generic were not type
-conformant.
+conformant.
NOTES
@@ -19160,7 +19202,7 @@ direct visibility of the primitive operators of a type.
use_clause ::= use_package_clause | use_type_clause
3
- use_package_clause ::= use package_name {, package_name};
+ use_package_clause ::= use <package_>name {, <package_>name};
4/3
use_type_clause ::= use [all] type subtype_mark {, subtype_mark};
@@ -19168,19 +19210,19 @@ direct visibility of the primitive operators of a
type.
_Legality Rules_
5/2
-A package_name of a use_package_clause shall denote a nonlimited view of
-a package.
+A <package_>name of a use_package_clause shall denote a nonlimited view
+of a package.
_Static Semantics_
6
-For each use_clause, there is a certain region of text called the scope
-of the use_clause. For a use_clause within a context_clause of a
-library_unit_declaration or library_unit_renaming_declaration, the scope
-is the entire declarative region of the declaration. For a use_clause
-within a context_clause of a body, the scope is the entire body and any
-subunits (including multiply nested subunits). The scope does not
-include context_clauses themselves.
+For each use_clause, there is a certain region of text called the
+<scope> of the use_clause. For a use_clause within a context_clause of
+a library_unit_declaration or library_unit_renaming_declaration, the
+scope is the entire declarative region of the declaration. For a
+use_clause within a context_clause of a body, the scope is the entire
+body and any subunits (including multiply nested subunits). The scope
+does not include context_clauses themselves.
7
For a use_clause immediately within a declarative region, the scope is
@@ -19190,38 +19232,38 @@ of a use_clause in the private part of a library unit
does not include
the visible part of any public descendant of that library unit.
7.1/2
-A package is named in a use_package_clause if it is denoted by a
-package_name of that clause. A type is named in a use_type_clause if it
-is determined by a subtype_mark of that clause.
+A package is <named> in a use_package_clause if it is denoted by a
+<package_>name of that clause. A type is <named> in a use_type_clause
+if it is determined by a subtype_mark of that clause.
8/3
For each package named in a use_package_clause whose scope encloses a
place, each declaration that occurs immediately within the declarative
-region of the package is potentially use-visible at this place if the
-declaration is visible at this place. For each type T or T'Class named
-in a use_type_clause whose scope encloses a place, the declaration of
-each primitive operator of type T is potentially use-visible at this
-place if its declaration is visible at this place. If a use_type_clause
-whose scope encloses a place includes the reserved word all, then the
-following entities are also potentially use-visible at this place if the
-declaration of the entity is visible at this place:
+region of the package is <potentially use-visible> at this place if the
+declaration is visible at this place. For each type <T> or <T>'Class
+named in a use_type_clause whose scope encloses a place, the declaration
+of each primitive operator of type <T> is potentially use-visible at
+this place if its declaration is visible at this place. If a
+use_type_clause whose scope encloses a place includes the reserved word
+all, then the following entities are also potentially use-visible at
+this place if the declaration of the entity is visible at this place:
8.1/3
- * Each primitive subprogram of T including each enumeration literal
+ * Each primitive subprogram of <T> including each enumeration literal
(if any);
8.2/3
* Each subprogram that is declared immediately within the declarative
- region in which an ancestor type of T is declared and that operates
- on a class-wide type that covers T.
+ region in which an ancestor type of <T> is declared and that
+ operates on a class-wide type that covers <T>.
8.3/3
Certain implicit declarations may become potentially use-visible in
certain contexts as described in *note 12.6::.
9
-A declaration is use-visible if it is potentially use-visible, except in
-these naming-conflict cases:
+A declaration is <use-visible> if it is potentially use-visible, except
+in these naming-conflict cases:
10
* A potentially use-visible declaration is not use-visible if the
@@ -19241,16 +19283,16 @@ The elaboration of a use_clause has no effect.
_Examples_
13
-Example of a use clause in a context clause:
+<Example of a use clause in a context clause:>
14
with Ada.Calendar; use Ada;
15
-Example of a use type clause:
+<Example of a use type clause:>
16
- use type Rational_Numbers.Rational; -- see *note 7.1::
+ use type Rational_Numbers.Rational; --< see *note 7.1::>
Two_Thirds: Rational_Numbers.Rational := 2/3;
@@ -19280,8 +19322,8 @@ of a previous subprogram_declaration.
3
The elaboration of a renaming_declaration evaluates the name that
follows the reserved word renames and thereby determines the view and
-entity denoted by this name (the renamed view and renamed entity). A
-name that denotes the renaming_declaration denotes (a new view of) the
+entity denoted by this name (the <renamed view> and <renamed entity>).
+A name that denotes the renaming_declaration denotes (a new view of) the
renamed entity.
NOTES
@@ -19330,22 +19372,22 @@ An object_renaming_declaration is used to rename an
object.
2/3
object_renaming_declaration ::=
defining_identifier : [null_exclusion]
- subtype_mark renames object_name
+ subtype_mark renames <object_>name
[aspect_specification];
- | defining_identifier : access_definition renames object_name
+ | defining_identifier : access_definition renames <object_>name
[aspect_specification];
_Name Resolution Rules_
3/2
-The type of the object_name shall resolve to the type determined by the
-subtype_mark, or in the case where the type is defined by an
+The type of the <object_>name shall resolve to the type determined by
+the subtype_mark, or in the case where the type is defined by an
access_definition, to an anonymous access type. If the anonymous access
-type is an access-to-object type, the type of the object_name shall have
-the same designated type as that of the access_definition. If the
+type is an access-to-object type, the type of the <object_>name shall
+have the same designated type as that of the access_definition. If the
anonymous access type is an access-to-subprogram type, the type of the
-object_name shall have a designated profile that is type conformant with
-that of the access_definition.
+<object_>name shall have a designated profile that is type conformant
+with that of the access_definition.
_Legality Rules_
@@ -19363,21 +19405,21 @@ of the renamed object and the type defined by the
access_definition:
4.3/2
* shall both be access-to-subprogram types with subtype conformant
- designated profiles.
+ designated profiles.
4.4/2
For an object_renaming_declaration with a null_exclusion or an
access_definition that has a null_exclusion:
4.5/2
- * if the object_name denotes a generic formal object of a generic
- unit G, and the object_renaming_declaration occurs within the body
- of G or within the body of a generic unit declared within the
- declarative region of G, then the declaration of the formal object
- of G shall have a null_exclusion;
+ * if the <object_>name denotes a generic formal object of a generic
+ unit <G>, and the object_renaming_declaration occurs within the
+ body of <G> or within the body of a generic unit declared within
+ the declarative region of <G>, then the declaration of the formal
+ object of <G> shall have a null_exclusion;
4.6/2
- * otherwise, the subtype of the object_name shall exclude null. In
+ * otherwise, the subtype of the <object_>name shall exclude null. In
addition to the places where Legality Rules normally apply (see
*note 12.3::), this rule applies also in the private part of an
instance of a generic unit.
@@ -19386,9 +19428,9 @@ access_definition that has a null_exclusion:
The renamed entity shall not be a subcomponent that depends on
discriminants of an object whose nominal subtype is unconstrained unless
the object is known to be constrained. A slice of an array shall not be
-renamed if this restriction disallows renaming of the array. In addition
-to the places where Legality Rules normally apply, these rules apply
-also in the private part of an instance of a generic unit.
+renamed if this restriction disallows renaming of the array. In
+addition to the places where Legality Rules normally apply, these rules
+apply also in the private part of an instance of a generic unit.
_Static Semantics_
@@ -19405,11 +19447,11 @@ object_renaming_declaration is ignored).
_Examples_
7
-Example of renaming an object:
+<Example of renaming an object:>
8
declare
- L : Person renames Leftmost_Person; -- see *note 3.10.1::
+ L : Person renames Leftmost_Person; --< see *note 3.10.1::>
begin
L.Age := L.Age + 1;
end;
@@ -19427,7 +19469,7 @@ An exception_renaming_declaration is used to rename an
exception.
2/3
exception_renaming_declaration ::=
- defining_identifier : exception renames exception_name
+ defining_identifier : exception renames <exception_>name
[aspect_specification];
_Legality Rules_
@@ -19444,10 +19486,10 @@ exception.
_Examples_
5
-Example of renaming an exception:
+<Example of renaming an exception:>
6
- EOF : exception renames Ada.IO_Exceptions.End_Error; -- see *note A.13::
+ EOF : exception renames Ada.IO_Exceptions.End_Error; <-- see *note A.13::>
File: arm2012.info, Node: 8.5.3, Next: 8.5.4, Prev: 8.5.2, Up: 8.5
@@ -19462,7 +19504,7 @@ A package_renaming_declaration is used to rename a
package.
2/3
package_renaming_declaration ::= package
- defining_program_unit_name renames package_name
+ defining_program_unit_name renames <package_>name
[aspect_specification];
_Legality Rules_
@@ -19471,12 +19513,12 @@ A package_renaming_declaration is used to rename a
package.
The renamed entity shall be a package.
3.1/2
-If the package_name of a package_renaming_declaration denotes a limited
-view of a package P, then a name that denotes the
+If the <package_>name of a package_renaming_declaration denotes a
+limited view of a package <P>, then a name that denotes the
package_renaming_declaration shall occur only within the immediate scope
of the renaming or the scope of a with_clause that mentions the package
-P or, if P is a nested package, the innermost library package enclosing
-P.
+<P> or, if <P> is a nested package, the innermost library package
+enclosing <P>.
_Static Semantics_
@@ -19492,7 +19534,7 @@ denotes a limited view of the package (see *note
10.1.1::).
_Examples_
5
-Example of renaming a package:
+<Example of renaming a package:>
6
package TM renames Table_Manager;
@@ -19506,74 +19548,75 @@ File: arm2012.info, Node: 8.5.4, Next: 8.5.5,
Prev: 8.5.3, Up: 8.5
1/3
A subprogram_renaming_declaration can serve as the completion of a
subprogram_declaration; such a renaming_declaration is called a
-renaming-as-body. A subprogram_renaming_declaration that is not a
-completion is called a renaming-as-declaration, and is used to rename a
-subprogram (possibly an enumeration literal) or an entry.
+<renaming-as-body>. A subprogram_renaming_declaration that is not a
+completion is called a <renaming-as-declaration>, and is used to rename
+a subprogram (possibly an enumeration literal) or an entry.
_Syntax_
2/3
subprogram_renaming_declaration ::=
[overriding_indicator]
- subprogram_specification renames callable_entity_name
+ subprogram_specification renames <callable_entity_>name
[aspect_specification];
_Name Resolution Rules_
3
-The expected profile for the callable_entity_name is the profile given
+The expected profile for the <callable_entity_>name is the profile given
in the subprogram_specification.
_Legality Rules_
4/3
The profile of a renaming-as-declaration shall be mode conformant, with
-that of the renamed callable entity.
+that of the renamed callable entity.
4.1/2
For a parameter or result subtype of the subprogram_specification that
has an explicit null_exclusion:
4.2/2
- * if the callable_entity_name denotes a generic formal subprogram of
- a generic unit G, and the subprogram_renaming_declaration occurs
- within the body of a generic unit G or within the body of a generic
- unit declared within the declarative region of the generic unit G,
- then the corresponding parameter or result subtype of the formal
- subprogram of G shall have a null_exclusion;
+ * if the <callable_entity_>name denotes a generic formal subprogram
+ of a generic unit <G>, and the subprogram_renaming_declaration
+ occurs within the body of a generic unit <G> or within the body of
+ a generic unit declared within the declarative region of the
+ generic unit <G>, then the corresponding parameter or result
+ subtype of the formal subprogram of <G> shall have a
+ null_exclusion;
4.3/2
* otherwise, the subtype of the corresponding parameter or result
- type of the renamed callable entity shall exclude null. In addition
- to the places where Legality Rules normally apply (see *note
- 12.3::), this rule applies also in the private part of an instance
- of a generic unit.
+ type of the renamed callable entity shall exclude null. In
+ addition to the places where Legality Rules normally apply (see
+ *note 12.3::), this rule applies also in the private part of an
+ instance of a generic unit.
5/3
The profile of a renaming-as-body shall conform fully to that of the
-declaration it completes. If the renaming-as-body completes that
+declaration it completes. If the renaming-as-body completes that
declaration before the subprogram it declares is frozen, the profile
shall be mode conformant with that of the renamed callable entity and
the subprogram it declares takes its convention from the renamed
subprogram; otherwise, the profile shall be subtype conformant with that
of the renamed callable entity and the convention of the renamed
-subprogram shall not be Intrinsic. A renaming-as-body is illegal if the
+subprogram shall not be Intrinsic. A renaming-as-body is illegal if the
declaration occurs before the subprogram whose declaration it completes
is frozen, and the renaming renames the subprogram itself, through one
or more subprogram renaming declarations, none of whose subprograms has
been frozen.
5.1/2
-The callable_entity_name of a renaming shall not denote a subprogram
+The <callable_entity_>name of a renaming shall not denote a subprogram
that requires overriding (see *note 3.9.3::).
5.2/2
-The callable_entity_name of a renaming-as-body shall not denote an
+The <callable_entity_>name of a renaming-as-body shall not denote an
abstract subprogram.
6
A name that denotes a formal parameter of the subprogram_specification
-is not allowed within the callable_entity_name.
+is not allowed within the <callable_entity_>name.
_Static Semantics_
@@ -19651,35 +19694,35 @@ infinite recursion.
_Examples_
13
-Examples of subprogram renaming declarations:
+<Examples of subprogram renaming declarations:>
14
- procedure My_Write(C : in Character) renames Pool(K).Write; -- see *note
4.1.3::
+ procedure My_Write(C : in Character) renames Pool(K).Write; --< see
*note 4.1.3::>
15
function Real_Plus(Left, Right : Real ) return Real renames "+";
function Int_Plus (Left, Right : Integer) return Integer renames "+";
16
- function Rouge return Color renames Red; -- see *note 3.5.1::
+ function Rouge return Color renames Red; --< see *note 3.5.1::>
function Rot return Color renames Red;
function Rosso return Color renames Rouge;
17
- function Next(X : Color) return Color renames Color'Succ; -- see *note
3.5.1::
+ function Next(X : Color) return Color renames Color'Succ; --< see *note
3.5.1::>
18
-Example of a subprogram renaming declaration with new parameter names:
+<Example of a subprogram renaming declaration with new parameter names:>
19
- function "*" (X,Y : Vector) return Real renames Dot_Product; -- see *note
6.1::
+ function "*" (X,Y : Vector) return Real renames Dot_Product; --< see
*note 6.1::>
20
-Example of a subprogram renaming declaration with a new default
-expression:
+<Example of a subprogram renaming declaration with a new default
+expression:>
21
- function Minimum(L : Link := Head) return Cell renames Min_Cell; -- see
*note 6.1::
+ function Minimum(L : Link := Head) return Cell renames Min_Cell; --< see
*note 6.1::>
File: arm2012.info, Node: 8.5.5, Prev: 8.5.4, Up: 8.5
@@ -19695,13 +19738,13 @@ A generic_renaming_declaration is used to rename a
generic unit.
2/3
generic_renaming_declaration ::=
generic package
- defining_program_unit_name renames generic_package_name
+ defining_program_unit_name renames <generic_package_>name
[aspect_specification];
| generic procedure
- defining_program_unit_name renames generic_procedure_name
+ defining_program_unit_name renames <generic_procedure_>name
[aspect_specification];
| generic function
- defining_program_unit_name renames generic_function_name
+ defining_program_unit_name renames <generic_function_>name
[aspect_specification];
_Legality Rules_
@@ -19728,10 +19771,10 @@ generic unit.
_Examples_
6
-Example of renaming a generic unit:
+<Example of renaming a generic unit:>
7
- generic package Enum_IO renames Ada.Text_IO.Enumeration_IO; -- see *note
A.10.10::
+ generic package Enum_IO renames Ada.Text_IO.Enumeration_IO; <-- see
*note A.10.10::>
File: arm2012.info, Node: 8.6, Prev: 8.5, Up: 8
@@ -19766,9 +19809,9 @@ formal and actual parameters are overloading rules.
_Name Resolution Rules_
4
-Overload resolution is applied separately to each complete context, not
-counting inner complete contexts. Each of the following constructs is a
-complete context:
+Overload resolution is applied separately to each <complete context>,
+not counting inner complete contexts. Each of the following constructs
+is a <complete context>:
5
* A context_item.
@@ -19783,12 +19826,13 @@ complete context:
* A pragma_argument_association.
9/4
- * The selecting_expression of a case_statement or case_expression.
+ * The <selecting_>expression of a case_statement or case_expression.
10
-An (overall) interpretation of a complete context embodies its meaning,
-and includes the following information about the constituents of the
-complete context, not including constituents of inner complete contexts:
+An (overall) <interpretation> of a complete context embodies its
+meaning, and includes the following information about the constituents
+of the complete context, not including constituents of inner complete
+contexts:
11
* for each constituent of the complete context, to which syntactic
@@ -19804,28 +19848,28 @@ complete context, not including constituents of inner
complete contexts:
it completes.
14
-A possible interpretation is one that obeys the syntax rules and the
-visibility rules. An acceptable interpretation is a possible
-interpretation that obeys the overloading rules, that is, those rules
+A <possible interpretation> is one that obeys the syntax rules and the
+visibility rules. An <acceptable interpretation> is a possible
+interpretation that obeys the <overloading rules>, that is, those rules
that specify an expected type or expected profile, or specify how a
-construct shall resolve or be interpreted.
+construct shall <resolve> or be <interpreted>.
15
-The interpretation of a constituent of a complete context is determined
-from the overall interpretation of the complete context as a whole.
-Thus, for example, "interpreted as a function_call," means that the
-construct's interpretation says that it belongs to the syntactic
+The <interpretation> of a constituent of a complete context is
+determined from the overall interpretation of the complete context as a
+whole. Thus, for example, "interpreted as a function_call," means that
+the construct's interpretation says that it belongs to the syntactic
category function_call.
16
-Each occurrence of a usage name denotes the declaration determined by
+Each occurrence of a usage name <denotes> the declaration determined by
its interpretation. It also denotes the view declared by its denoted
declaration, except in the following cases:
17/3
* If a usage name appears within the declarative region of a
type_declaration and denotes that same type_declaration, then it
- denotes the current instance of the type (rather than the type
+ denotes the <current instance> of the type (rather than the type
itself); the current instance of a type is the object or value of
the type that is associated with the execution that evaluates the
usage name. Similarly, if a usage name appears within the
@@ -19849,17 +19893,17 @@ declaration, except in the following cases:
18
* If a usage name appears within the declarative region of a
generic_declaration (but not within its generic_formal_part) and it
- denotes that same generic_declaration, then it denotes the current
- instance of the generic unit (rather than the generic unit itself).
- See also *note 12.3::.
+ denotes that same generic_declaration, then it denotes the <current
+ instance> of the generic unit (rather than the generic unit
+ itself). See also *note 12.3::.
19
A usage name that denotes a view also denotes the entity of that view.
20/2
-The expected type for a given expression, name, or other construct
-determines, according to the type resolution rules given below, the
-types considered for the construct during overload resolution. The type
+The <expected type> for a given expression, name, or other construct
+determines, according to the <type resolution rules> given below, the
+types considered for the construct during overload resolution. The type
resolution rules provide support for class-wide programming, universal
literals, dispatching operations, and anonymous access types:
@@ -19870,88 +19914,89 @@ literals, dispatching operations, and anonymous
access types:
universal type that covers the class.
22
- * If the expected type for a construct is a specific type T, then the
- type of the construct shall resolve either to T, or:
+ * If the expected type for a construct is a specific type <T>, then
+ the type of the construct shall resolve either to <T>, or:
23
- * to T'Class; or
+ * to <T>'Class; or
24
- * to a universal type that covers T; or
+ * to a universal type that covers <T>; or
25/2
- * when T is a specific anonymous access-to-object type (see
- *note 3.10::) with designated type D, to an
- access-to-object type whose designated type is D'Class or
- is covered by D; or
+ * when <T> is a specific anonymous access-to-object type
+ (see *note 3.10::) with designated type <D>, to an
+ access-to-object type whose designated type is <D>'Class
+ or is covered by <D>; or
25.1/3
- * when T is a named general access-to-object type (see
- *note 3.10::) with designated type D, to an anonymous
+ * when <T> is a named general access-to-object type (see
+ *note 3.10::) with designated type <D>, to an anonymous
access-to-object type whose designated type covers or is
- covered by D; or
+ covered by <D>; or
25.2/3
- * when T is an anonymous access-to-subprogram type (see
+ * when <T> is an anonymous access-to-subprogram type (see
*note 3.10::), to an access-to-subprogram type whose
- designated profile is type conformant with that of T.
+ designated profile is type conformant with that of <T>.
26
In certain contexts, such as in a subprogram_renaming_declaration, the
-Name Resolution Rules define an expected profile for a given name; in
+Name Resolution Rules define an <expected profile> for a given name; in
such cases, the name shall resolve to the name of a callable entity
-whose profile is type conformant with the expected profile.
+whose profile is type conformant with the expected profile.
_Legality Rules_
27/2
-When a construct is one that requires that its expected type be a single
-type in a given class, the type of the construct shall be determinable
-solely from the context in which the construct appears, excluding the
-construct itself, but using the requirement that it be in the given
-class. Furthermore, the context shall not be one that expects any type
-in some class that contains types of the given class; in particular, the
-construct shall not be the operand of a type_conversion.
+When a construct is one that requires that its expected type be a
+<single> type in a given class, the type of the construct shall be
+determinable solely from the context in which the construct appears,
+excluding the construct itself, but using the requirement that it be in
+the given class. Furthermore, the context shall not be one that expects
+any type in some class that contains types of the given class; in
+particular, the construct shall not be the operand of a type_conversion.
27.1/4
-Other than for the tested_simple_expression of a membership test, if the
-expected type for a name or expression is not the same as the actual
+Other than for the <tested_>simple_expression of a membership test, if
+the expected type for a name or expression is not the same as the actual
type of the name or expression, the actual type shall be convertible to
the expected type (see *note 4.6::); further, if the expected type is a
-named access-to-object type with designated type D1 and the actual type
-is an anonymous access-to-object type with designated type D2, then D1
-shall cover D2, and the name or expression shall denote a view with an
-accessibility level for which the statically deeper relationship
-applies; in particular it shall not denote an access parameter nor a
-stand-alone access object.
+named access-to-object type with designated type <D1> and the actual
+type is an anonymous access-to-object type with designated type <D2>,
+then <D1> shall cover <D2>, and the name or expression shall denote a
+view with an accessibility level for which the statically deeper
+relationship applies; in particular it shall not denote an access
+parameter nor a stand-alone access object.
28
A complete context shall have at least one acceptable interpretation; if
there is exactly one, then that one is chosen.
29
-There is a preference for the primitive operators (and ranges) of the
-root numeric types root_integer and root_real. In particular, if two
-acceptable interpretations of a constituent of a complete context differ
-only in that one is for a primitive operator (or range) of the type
-root_integer or root_real, and the other is not, the interpretation
-using the primitive operator (or range) of the root numeric type is
-preferred.
+There is a <preference> for the primitive operators (and ranges) of the
+root numeric types <root_integer> and <root_real>. In particular, if
+two acceptable interpretations of a constituent of a complete context
+differ only in that one is for a primitive operator (or range) of the
+type <root_integer> or <root_real>, and the other is not, the
+interpretation using the primitive operator (or range) of the root
+numeric type is <preferred>.
29.1/3
Similarly, there is a preference for the equality operators of the
-universal_access type (see *note 4.5.2::). If two acceptable
+<universal_access> type (see *note 4.5.2::). If two acceptable
interpretations of a constituent of a complete context differ only in
-that one is for an equality operator of the universal_access type, and
+that one is for an equality operator of the <universal_access> type, and
the other is not, the interpretation using the equality operator of the
-universal_access type is preferred.
+<universal_access> type is preferred.
30
For a complete context, if there is exactly one overall acceptable
interpretation where each constituent's interpretation is the same as or
preferred (in the above sense) over those in all other overall
acceptable interpretations, then that one overall acceptable
-interpretation is chosen. Otherwise, the complete context is ambiguous.
+interpretation is chosen. Otherwise, the complete context is
+<ambiguous>.
31
A complete context other than a pragma_argument_association shall not be
@@ -19961,7 +20006,7 @@ ambiguous.
A complete context that is a pragma_argument_association is allowed to
be ambiguous (unless otherwise specified for the particular pragma), but
only if every acceptable interpretation of the pragma argument is as a
-name that statically denotes a callable entity. Such a name denotes all
+name that statically denotes a callable entity. Such a name denotes all
of the declarations determined by its interpretations, and all of the
views declared by these declarations.
@@ -19989,16 +20034,16 @@ File: arm2012.info, Node: 9, Next: 10, Prev: 8,
Up: Top
1/3
The execution of an Ada program consists of the execution of one or more
-tasks. Each task represents a separate thread of control that proceeds
-independently and concurrently between the points where it interacts
-with other tasks. The various forms of task interaction are described
-in this clause, and include:
+<tasks>. Each task represents a separate thread of control that
+proceeds independently and concurrently between the points where it
+<interacts> with other tasks. The various forms of task interaction are
+described in this clause, and include:
2
* the activation and termination of a task;
3
- * a call on a protected subprogram of a protected object, providing
+ * a call on a protected subprogram of a <protected object>, providing
exclusive read-write access, or concurrent read-only access to
shared data;
@@ -20032,16 +20077,17 @@ synchronized through some other kind of task
interaction.
9
The properties of a task are defined by a corresponding task declaration
-and task_body, which together define a program unit called a task unit.
+and task_body, which together define a program unit called a <task
+unit>.
_Dynamic Semantics_
10
-Over time, tasks proceed through various states. A task is initially
-inactive; upon activation, and prior to its termination it is either
-blocked (as part of some task interaction) or ready to run. While ready,
-a task competes for the available execution resources that it requires
-to run.
+Over time, tasks proceed through various <states>. A task is initially
+<inactive>; upon activation, and prior to its <termination> it is either
+<blocked> (as part of some task interaction) or <ready> to run. While
+ready, a task competes for the available <execution resources> that it
+requires to run.
NOTES
@@ -20075,11 +20121,12 @@ File: arm2012.info, Node: 9.1, Next: 9.2, Up: 9
===============================
1
-A task unit is declared by a task declaration, which has a corresponding
-task_body. A task declaration may be a task_type_declaration, in which
-case it declares a named task type; alternatively, it may be a
-single_task_declaration, in which case it defines an anonymous task
-type, as well as declaring a named task object of that type.
+A task unit is declared by a <task declaration>, which has a
+corresponding task_body. A task declaration may be a
+task_type_declaration, in which case it declares a named task type;
+alternatively, it may be a single_task_declaration, in which case it
+defines an anonymous task type, as well as declaring a named task object
+of that type.
_Syntax_
@@ -20102,7 +20149,7 @@ type, as well as declaring a named task object of that
type.
{task_item}
[ private
{task_item}]
- end [task_identifier]
+ end [<task_>identifier]
5/1
task_item ::= entry_declaration | aspect_clause
@@ -20114,22 +20161,23 @@ type, as well as declaring a named task object of
that type.
declarative_part
begin
handled_sequence_of_statements
- end [task_identifier];
+ end [<task_>identifier];
7
- If a task_identifier appears at the end of a task_definition or
+ If a <task_>identifier appears at the end of a task_definition or
task_body, it shall repeat the defining_identifier.
-Paragraph 8 was deleted.
+<Paragraph 8 was deleted.>
_Static Semantics_
9
-A task_definition defines a task type and its first subtype. The first
+A task_definition defines a task type and its first subtype. The first
list of task_items of a task_definition (*note 9.1: S0207.), together
with the known_discriminant_part (*note 3.7: S0061.), if any, is called
-the visible part of the task unit. The optional list of task_items after
-the reserved word private is called the private part of the task unit.
+the visible part of the task unit. The optional list of task_items
+after the reserved word private is called the private part of the task
+unit.
9.1/1
For a task declaration without a task_definition, a task_definition
@@ -20145,9 +20193,9 @@ type or an access parameter designating the task type,
and there is an
entry_declaration for a single entry with the same identifier within the
task declaration, whose profile is type conformant with the prefixed
view profile of the inherited subprogram, the inherited subprogram is
-said to be implemented by the conforming task entry using an implicitly
-declared nonabstract subprogram which has the same profile as the
-inherited subprogram and which overrides it.
+said to be <implemented> by the conforming task entry using an
+implicitly declared nonabstract subprogram which has the same profile as
+the inherited subprogram and which overrides it.
_Legality Rules_
@@ -20156,8 +20204,8 @@ A task declaration requires a completion, which shall
be a task_body,
and every task_body shall be the completion of some task declaration.
9.4/2
-Each interface_subtype_mark of an interface_list appearing within a task
-declaration shall denote a limited interface type that is not a
+Each <interface_>subtype_mark of an interface_list appearing within a
+task declaration shall denote a limited interface type that is not a
protected interface.
9.5/3
@@ -20180,11 +20228,10 @@ declaration, at most one of the following shall apply:
9.8/2
* the inherited subprogram is implemented by a single entry of the
task type; in which case its prefixed view profile shall be subtype
- conformant with that of the task entry.
+ conformant with that of the task entry.
9.9/2
-If neither applies, the inherited subprogram shall be a null procedure.
-In addition to the places where Legality Rules normally apply (see *note
+If neither applies, the inherited subprogram shall be a null procedure.In
addition to the places where Legality Rules normally apply (see *note
12.3::), these rules also apply in the private part of an instance of a
generic unit.
@@ -20256,7 +20303,7 @@ The content of a task object of a given task type
includes:
_Examples_
22
-Examples of declarations of task types:
+<Examples of declarations of task types:>
23
task type Server is
@@ -20266,17 +20313,17 @@ Examples of declarations of task types:
24/2
task type Keyboard_Driver(ID : Keyboard_ID := New_ID) is
- new Serial_Device with -- see *note 3.9.4::
+ new Serial_Device with --< see *note 3.9.4::>
entry Read (C : out Character);
entry Write(C : in Character);
end Keyboard_Driver;
25
-Examples of declarations of single tasks:
+<Examples of declarations of single tasks:>
26
task Controller is
- entry Request(Level)(D : Item); -- a family of entries
+ entry Request(Level)(D : Item); --< a family of entries>
end Controller;
27
@@ -20286,10 +20333,10 @@ Examples of declarations of single tasks:
end;
28
- task User; -- has no entries
+ task User; --< has no entries>
29
-Examples of task objects:
+<Examples of task objects:>
30
Agent : Server;
@@ -20297,7 +20344,7 @@ Examples of task objects:
Pool : array(1 .. 10) of Keyboard_Driver;
31
-Example of access type designating task objects:
+<Example of access type designating task objects:>
32
type Keyboard is access Keyboard_Driver;
@@ -20313,11 +20360,11 @@ File: arm2012.info, Node: 9.2, Next: 9.3, Prev:
9.1, Up: 9
1
The execution of a task of a given task type consists of the execution
-of the corresponding task_body. The initial part of this execution is
-called the activation of the task; it consists of the elaboration of the
-declarative_part of the task_body. Should an exception be propagated by
-the elaboration of its declarative_part, the activation of the task is
-defined to have failed, and it becomes a completed task.
+of the corresponding task_body. The initial part of this execution is
+called the <activation> of the task; it consists of the elaboration of
+the declarative_part of the task_body. Should an exception be
+propagated by the elaboration of its declarative_part, the activation of
+the task is defined to have <failed>, and it becomes a completed task.
2/2
A task object (which represents one task) can be a part of a stand-alone
@@ -20354,8 +20401,8 @@ the function returns.
5
The task that created the new tasks and initiated their activations (the
-activator) is blocked until all of these activations complete
-(successfully or not). Once all of these activations are complete, if
+<activator>) is blocked until all of these activations complete
+(successfully or not). Once all of these activations are complete, if
the activation of any of the tasks has failed (due to the propagation of
an exception), Tasking_Error is raised in the activator, at the place at
which it initiated the activations. Otherwise, the activator proceeds
@@ -20365,12 +20412,12 @@ raise Tasking_Error.
6/3
If the master that directly encloses the point where the activation of a
-task T would be initiated, completes before the activation of T is
-initiated, T becomes terminated and is never activated. Furthermore, if
-a return statement is left such that the return object is not returned
-to the caller, any task that was created as a part of the return object
-or one of its coextensions immediately becomes terminated and is never
-activated.
+task <T> would be initiated, completes before the activation of <T> is
+initiated, <T> becomes terminated and is never activated. Furthermore,
+if a return statement is left such that the return object is not
+returned to the caller, any task that was created as a part of the
+return object or one of its coextensions immediately becomes terminated
+and is never activated.
NOTES
@@ -20390,14 +20437,14 @@ activated.
_Examples_
10
-Example of task activation:
+<Example of task activation:>
11
procedure P is
- A, B : Server; -- elaborate the task objects A, B
- C : Server; -- elaborate the task object C
+ A, B : Server; --< elaborate the task objects A, B>
+ C : Server; --< elaborate the task object C>
begin
- -- the tasks A, B, C are activated together before the first statement
+ --< the tasks A, B, C are activated together before the first
statement>
...
end;
@@ -20410,7 +20457,7 @@ File: arm2012.info, Node: 9.3, Next: 9.4, Prev: 9.2,
Up: 9
_Dynamic Semantics_
1
-Each task (other than an environment task -- see *note 10.2::) depends
+Each task (other than an environment task -- see *note 10.2::) <depends>
on one or more masters (see *note 7.6.1::), as follows:
2/4
@@ -20436,11 +20483,11 @@ depend on the task that executes the master, and
(recursively) on any
master of that task.
5
-A task is said to be completed when the execution of its corresponding
-task_body is completed. A task is said to be terminated when any
+A task is said to be <completed> when the execution of its corresponding
+task_body is completed. A task is said to be <terminated> when any
finalization of the task_body has been performed (see *note 7.6.1::).
The first step of finalizing a master (including a task_body) is to wait
-for the termination of any tasks dependent on the master. The task
+for the termination of any tasks dependent on the master. The task
executing the master is blocked until all the dependents have
terminated. Any remaining finalization is then performed and the master
is left.
@@ -20509,27 +20556,27 @@ that are not yet completed.
_Examples_
19
-Example of task dependence:
+<Example of task dependence:>
20
declare
- type Global is access Server; -- see *note 9.1::
+ type Global is access Server; --< see *note 9.1::>
A, B : Server;
G : Global;
begin
- -- activation of A and B
+ --< activation of A and B>
declare
type Local is access Server;
- X : Global := new Server; -- activation of X.all
- L : Local := new Server; -- activation of L.all
+ X : Global := new Server; --< activation of X.all>
+ L : Local := new Server; --< activation of L.all>
C : Server;
begin
- -- activation of C
- G := X; -- both G and X designate the same task object
+ --< activation of C>
+ G := X; --< both G and X designate the same task object>
...
- end; -- await termination of C and L.all (but not X.all)
+ end; --< await termination of C and L.all (but not X.all)>
...
- end; -- await termination of A, B, and G.all
+ end; --< await termination of A, B, and G.all>
File: arm2012.info, Node: 9.4, Next: 9.5, Prev: 9.3, Up: 9
@@ -20538,15 +20585,15 @@ File: arm2012.info, Node: 9.4, Next: 9.5, Prev:
9.3, Up: 9
=========================================
1
-A protected object provides coordinated access to shared data, through
-calls on its visible protected operations, which can be protected
-subprograms or protected entries. A protected unit is declared by a
-protected declaration, which has a corresponding protected_body. A
+A <protected object> provides coordinated access to shared data, through
+calls on its visible <protected operations>, which can be <protected
+subprograms> or <protected entries>. A <protected unit> is declared by
+a <protected declaration>, which has a corresponding protected_body. A
protected declaration may be a protected_type_declaration, in which case
it declares a named protected type; alternatively, it may be a
single_protected_declaration, in which case it defines an anonymous
protected type, as well as declaring a named protected object of that
-type.
+type.
_Syntax_
@@ -20569,7 +20616,7 @@ type.
{ protected_operation_declaration }
[ private
{ protected_element_declaration } ]
- end [protected_identifier]
+ end [<protected_>identifier]
5/1
protected_operation_declaration ::= subprogram_declaration
@@ -20585,7 +20632,7 @@ type.
protected body defining_identifier
[aspect_specification] is
{ protected_operation_item }
- end [protected_identifier];
+ end [<protected_>identifier];
8/4
protected_operation_item ::= subprogram_declaration
@@ -20596,11 +20643,11 @@ type.
| aspect_clause
9
- If a protected_identifier appears at the end of a
+ If a <protected_>identifier appears at the end of a
protected_definition or protected_body, it shall repeat the
defining_identifier.
-Paragraph 10 was deleted.
+<Paragraph 10 was deleted.>
_Static Semantics_
@@ -20609,7 +20656,7 @@ A protected_definition defines a protected type and its
first subtype.
The list of protected_operation_declaration (*note 9.4: S0213.)s of a
protected_definition (*note 9.4: S0212.), together with the
known_discriminant_part (*note 3.7: S0061.), if any, is called the
-visible part of the protected unit. The optional list of
+visible part of the protected unit. The optional list of
protected_element_declaration (*note 9.4: S0214.)s after the reserved
word private is called the private part of the protected unit.
@@ -20624,9 +20671,9 @@ type, and there is a protected_operation_declaration
for a protected
subprogram or single entry with the same identifier within the protected
declaration, whose profile is type conformant with the prefixed view
profile of the inherited subprogram, the inherited subprogram is said to
-be implemented by the conforming protected subprogram or entry using an
-implicitly declared nonabstract subprogram which has the same profile as
-the inherited subprogram and which overrides it.
+be <implemented> by the conforming protected subprogram or entry using
+an implicitly declared nonabstract subprogram which has the same profile
+as the inherited subprogram and which overrides it.
_Legality Rules_
@@ -20636,7 +20683,7 @@ protected_body (*note 9.4: S0215.), and every
protected_body (*note 9.4:
S0215.) shall be the completion of some protected declaration.
11.3/2
-Each interface_subtype_mark of an interface_list appearing within a
+Each <interface_>subtype_mark of an interface_list appearing within a
protected declaration shall denote a limited interface type that is not
a task interface.
@@ -20662,11 +20709,10 @@ protected declaration, at most one of the following
shall apply:
* the inherited subprogram is implemented by a protected subprogram
or single entry of the protected type, in which case its prefixed
view profile shall be subtype conformant with that of the protected
- subprogram or entry.
+ subprogram or entry.
11.8/2
-If neither applies, the inherited subprogram shall be a null procedure.
-In addition to the places where Legality Rules normally apply (see *note
+If neither applies, the inherited subprogram shall be a null procedure.In
addition to the places where Legality Rules normally apply (see *note
12.3::), these rules also apply in the private part of an instance of a
generic unit.
@@ -20699,7 +20745,7 @@ generic unit.
12
The elaboration of a protected declaration elaborates the
-protected_definition. The elaboration of a single_protected_declaration
+protected_definition. The elaboration of a single_protected_declaration
(*note 9.4: S0211.) also creates an object of an (anonymous) protected
type.
@@ -20727,9 +20773,9 @@ The content of an object of a given protected type
includes:
protected object;
18
- * A representation of the state of the execution resource associated
- with the protected object (one such resource is associated with
- each protected object).
+ * A representation of the state of the execution resource
+ <associated> with the protected object (one such resource is
+ associated with each protected object).
19
The execution resource associated with a protected object has to be
@@ -20739,7 +20785,7 @@ either for concurrent read-only access, or for
exclusive read-write
access.
20
-As the first step of the finalization of a protected object, each call
+As the first step of the <finalization> of a protected object, each call
remaining on any entry queue of the object is removed from its queue and
Program_Error is raised at the place of the corresponding
entry_call_statement (*note 9.5.3: S0225.).
@@ -20784,7 +20830,7 @@ may leave a task queued forever.
_Examples_
26
-Example of declaration of protected type and corresponding body:
+<Example of declaration of protected type and corresponding body:>
27
protected type Resource is
@@ -20809,11 +20855,11 @@ Example of declaration of protected type and
corresponding body:
end Resource;
30
-Example of a single protected declaration and corresponding body:
+<Example of a single protected declaration and corresponding body:>
31
protected Shared_Array is
- -- Index, Item, and Item_Array are global types
+ --< Index, Item, and Item_Array are global types>
function Component (N : in Index) return Item;
procedure Set_Component(N : in Index; E : in Item);
private
@@ -20835,7 +20881,7 @@ Example of a single protected declaration and
corresponding body:
end Shared_Array;
34
-Examples of protected objects:
+<Examples of protected objects:>
35
Control : Resource;
@@ -20862,27 +20908,27 @@ indirectly via a shared protected object.
When a name or prefix denotes an entry, protected subprogram, or a
prefixed view of a primitive subprogram of a limited interface whose
first parameter is a controlling parameter, the name or prefix
-determines a target object, as follows:
+determines a <target object>, as follows:
3/3
* If it is a direct_name or expanded name that denotes the
declaration (or body) of the operation, then the target object is
implicitly specified to be the current instance of the task or
protected unit immediately enclosing the operation; a call using
- such a name is defined to be an internal call;
+ such a name is defined to be an <internal call>;
4/3
* If it is a selected_component that is not an expanded name, then
the target object is explicitly specified to be the object denoted
by the prefix of the name; a call using such a name is defined to
- be an external call;
+ be an <external call>;
5/3
* If the name or prefix is a dereference (implicit or explicit) of an
access-to-protected-subprogram value, then the target object is
determined by the prefix of the Access attribute_reference that
produced the access value originally; a call using such a name is
- defined to be an external call;
+ defined to be an <external call>;
6
* If the name or prefix denotes a subprogram_renaming_declaration,
@@ -20895,12 +20941,12 @@ prefix that determines a target object implicitly, as
above, or is a
call on (a non-prefixed view of) a primitive subprogram of a limited
interface whose first parameter is a controlling parameter, in which
case the target object is identified explicitly by the first parameter.
-This latter case is an external call.
+This latter case is an <external call>.
7
A corresponding definition of target object applies to a
requeue_statement (see *note 9.5.4::), with a corresponding distinction
-between an internal requeue and an external requeue.
+between an <internal requeue> and an <external requeue>.
_Legality Rules_
@@ -20994,7 +21040,7 @@ File: arm2012.info, Node: 9.5.1, Next: 9.5.2, Up: 9.5
-------------------------------------------------
1
-A protected subprogram is a subprogram declared immediately within a
+A <protected subprogram> is a subprogram declared immediately within a
protected_definition. Protected procedures provide exclusive read-write
access to the data of a protected object; protected functions provide
concurrent read-only access to the data.
@@ -21030,9 +21076,9 @@ Exclusive_Functions
below).
2.4/4
-A protected procedure or entry is an exclusive protected operation. A
-protected function of a protected type P is an exclusive protected
-operation if the Exclusive_Functions aspect of P is True.
+A protected procedure or entry is an <exclusive> protected operation. A
+protected function of a protected type <P> is an exclusive protected
+operation if the Exclusive_Functions aspect of <P> is True.
_Dynamic Semantics_
@@ -21043,7 +21089,7 @@ back of in out or out parameters, proceeds as for a
normal subprogram
call (see *note 6.4::). If the call is an internal call (see *note
9.5::), the body of the subprogram is executed as for a normal
subprogram call. If the call is an external call, then the body of the
-subprogram is executed as part of a new protected action on the target
+subprogram is executed as part of a new <protected action> on the target
protected object; the protected action completes after the body of the
subprogram is executed. A protected action can also be started by an
entry call (see *note 9.5.3::).
@@ -21056,14 +21102,14 @@ function. This rule is expressible in terms of the
execution resource
associated with the protected object:
5/4
- * Starting a protected action on a protected object corresponds to
- acquiring the execution resource associated with the protected
+ * <Starting> a protected action on a protected object corresponds to
+ <acquiring> the execution resource associated with the protected
object, either for exclusive read-write access if the protected
action is for a call on an exclusive protected operation, or for
concurrent read-only access otherwise;
6
- * Completing the protected action corresponds to releasing the
+ * <Completing> the protected action corresponds to <releasing> the
associated execution resource.
7/4
@@ -21076,7 +21122,7 @@ queues (if any) of the protected object are serviced
(see *note
8
During a protected action, it is a bounded error to invoke an operation
-that is potentially blocking. The following are defined to be
+that is <potentially blocking>. The following are defined to be
potentially blocking operations:
9
@@ -21157,7 +21203,7 @@ blocking, a language-defined subprogram is nonblocking.
_Examples_
23
-Examples of protected subprogram calls (see *note 9.4::):
+<Examples of protected subprogram calls (see *note 9.4::):>
24
Shared_Array.Set_Component(N, E);
@@ -21186,9 +21232,9 @@ tasks and protected objects.
3
accept_statement ::=
- accept entry_direct_name [(entry_index)] parameter_profile [do
+ accept <entry_>direct_name [(entry_index)] parameter_profile [do
handled_sequence_of_statements
- end [entry_identifier]];
+ end [<entry_>identifier]];
4
entry_index ::= expression
@@ -21200,7 +21246,7 @@ tasks and protected objects.
declarative_part
begin
handled_sequence_of_statements
- end [entry_identifier];
+ end [<entry_>identifier];
6
entry_body_formal_part ::= [(entry_index_specification)]
@@ -21214,10 +21260,10 @@ tasks and protected objects.
discrete_subtype_definition
9
- If an entry_identifier appears at the end of an accept_statement,
- it shall repeat the entry_direct_name (*note 4.1: S0092.). If an
- entry_identifier appears at the end of an entry_body (*note 9.5.2:
- S0221.), it shall repeat the defining_identifier (*note 3.1:
+ If an <entry_>identifier appears at the end of an accept_statement,
+ it shall repeat the <entry_>direct_name (*note 4.1: S0092.). If an
+ <entry_>identifier appears at the end of an entry_body (*note
+ 9.5.2: S0221.), it shall repeat the defining_identifier (*note 3.1:
S0022.).
10
@@ -21231,7 +21277,7 @@ tasks and protected objects.
_Name Resolution Rules_
11
-In an accept_statement, the expected profile for the entry_direct_name
+In an accept_statement, the expected profile for the <entry_>direct_name
is that of the entry_declaration (*note 9.5.2: S0218.); the expected
type for an entry_index is that of the subtype defined by the
discrete_subtype_definition (*note 3.6: S0055.) of the corresponding
@@ -21272,11 +21318,11 @@ generic unit.
14
For an accept_statement, the innermost enclosing body shall be a
-task_body, and the entry_direct_name (*note 4.1: S0092.) shall denote an
-entry_declaration (*note 9.5.2: S0218.) in the corresponding task
+task_body, and the <entry_>direct_name (*note 4.1: S0092.) shall denote
+an entry_declaration (*note 9.5.2: S0218.) in the corresponding task
declaration; the profile of the accept_statement (*note 9.5.2: S0219.)
shall conform fully to that of the corresponding entry_declaration
-(*note 9.5.2: S0218.). An accept_statement (*note 9.5.2: S0219.) shall
+(*note 9.5.2: S0218.). An accept_statement (*note 9.5.2: S0219.) shall
have a parenthesized entry_index (*note 9.5.2: S0220.) if and only if
the corresponding entry_declaration (*note 9.5.2: S0218.) has a
discrete_subtype_definition (*note 3.6: S0055.).
@@ -21291,8 +21337,8 @@ enclosing task_body.
An entry_declaration of a protected unit requires a completion, which
shall be an entry_body, and every entry_body (*note 9.5.2: S0221.) shall
be the completion of an entry_declaration (*note 9.5.2: S0218.) of a
-protected unit. The profile of the entry_body (*note 9.5.2: S0221.)
-shall conform fully to that of the corresponding declaration.
+protected unit. The profile of the entry_body (*note 9.5.2: S0221.)
+shall conform fully to that of the corresponding declaration.
17
An entry_body_formal_part shall have an entry_index_specification (*note
@@ -21301,7 +21347,7 @@ An entry_body_formal_part shall have an
entry_index_specification (*note
In this case, the discrete_subtype_definition (*note 3.6: S0055.)s of
the entry_declaration (*note 9.5.2: S0218.) and the
entry_index_specification (*note 9.5.2: S0224.) shall fully conform to
-one another (see *note 6.3.1::).
+one another (see *note 6.3.1::).
18
A name that denotes a formal parameter of an entry_body is not allowed
@@ -21316,19 +21362,19 @@ have the same meaning (see *note 6.2::).
20
An entry_declaration with a discrete_subtype_definition (see *note
-3.6::) declares a family of distinct entries having the same profile,
-with one such entry for each value of the entry index subtype defined by
-the discrete_subtype_definition (*note 3.6: S0055.). A name for an
+3.6::) declares a <family> of distinct entries having the same profile,
+with one such entry for each value of the <entry index subtype> defined
+by the discrete_subtype_definition (*note 3.6: S0055.). A name for an
entry of a family takes the form of an indexed_component, where the
prefix denotes the entry_declaration for the family, and the index value
-identifies the entry within the family. The term single entry is used to
-refer to any entry other than an entry of an entry family.
+identifies the entry within the family. The term <single entry> is used
+to refer to any entry other than an entry of an entry family.
21
In the entry_body for an entry family, the entry_index_specification
declares a named constant whose subtype is the entry index subtype
-defined by the corresponding entry_declaration; the value of the named
-entry index identifies which entry of the family was called.
+defined by the corresponding entry_declaration; the value of the <named
+entry index> identifies which entry of the family was called.
_Dynamic Semantics_
@@ -21347,7 +21393,7 @@ S0221.) for an entry of a protected unit.
24
For the execution of an accept_statement, the entry_index, if any, is
first evaluated and converted to the entry index subtype; this index
-value identifies which entry of the family is to be accepted. Further
+value identifies which entry of the family is to be accepted. Further
execution of the accept_statement is then blocked until a caller of the
corresponding entry is selected (see *note 9.5.3::), whereupon the
handled_sequence_of_statements, if any, of the accept_statement is
@@ -21361,19 +21407,19 @@ entry_call_statement.
25
The above interaction between a calling task and an accepting task is
-called a rendezvous. After a rendezvous, the two tasks continue their
+called a <rendezvous>. After a rendezvous, the two tasks continue their
execution independently.
26
An entry_body is executed when the condition of the entry_barrier
evaluates to True and a caller of the corresponding single entry, or
entry of the corresponding entry family, has been selected (see *note
-9.5.3::). For the execution of the entry_body (*note 9.5.2: S0221.), the
-declarative_part (*note 3.11: S0086.) of the entry_body (*note 9.5.2:
-S0221.) is elaborated, and the handled_sequence_of_statements (*note
-11.2: S0265.) of the body is executed, as for the execution of a
+9.5.3::). For the execution of the entry_body (*note 9.5.2: S0221.),
+the declarative_part (*note 3.11: S0086.) of the entry_body (*note
+9.5.2: S0221.) is elaborated, and the handled_sequence_of_statements
+(*note 11.2: S0265.) of the body is executed, as for the execution of a
subprogram_body. The value of the named entry index, if any, is
-determined by the value of the entry index specified in the entry_name
+determined by the value of the entry index specified in the <entry_>name
of the selected entry call (or intermediate requeue_statement (*note
9.5.4: S0226.) -- see *note 9.5.4::).
@@ -21413,15 +21459,15 @@ of the selected entry call (or intermediate
requeue_statement (*note
_Examples_
32
-Examples of entry declarations:
+<Examples of entry declarations:>
33
entry Read(V : out Item);
entry Seize;
- entry Request(Level)(D : Item); -- a family of entries
+ entry Request(Level)(D : Item); --< a family of entries>
34
-Examples of accept statements:
+<Examples of accept statements:>
35
accept Shut_Down;
@@ -21443,28 +21489,28 @@ File: arm2012.info, Node: 9.5.3, Next: 9.5.4,
Prev: 9.5.2, Up: 9.5
-----------------
1
-An entry_call_statement (an entry call) can appear in various contexts.
-A simple entry call is a stand-alone statement that represents an
-unconditional call on an entry of a target task or a protected object.
-Entry calls can also appear as part of select_statements (see *note
-9.7::).
+An entry_call_statement (an <entry call>) can appear in various
+contexts. A <simple> entry call is a stand-alone statement that
+represents an unconditional call on an entry of a target task or a
+protected object. Entry calls can also appear as part of
+select_statements (see *note 9.7::).
_Syntax_
2
- entry_call_statement ::= entry_name [actual_parameter_part];
+ entry_call_statement ::= <entry_>name [actual_parameter_part];
_Name Resolution Rules_
3
-The entry_name given in an entry_call_statement shall resolve to denote
-an entry. The rules for parameter associations are the same as for
-subprogram calls (see *note 6.4:: and *note 6.4.1::).
+The <entry_>name given in an entry_call_statement shall resolve to
+denote an entry. The rules for parameter associations are the same as
+for subprogram calls (see *note 6.4:: and *note 6.4.1::).
_Static Semantics_
4
-The entry_name of an entry_call_statement specifies (explicitly or
+The <entry_>name of an entry_call_statement specifies (explicitly or
implicitly) the target object of the call, the entry or entry family,
and the entry index, if any (see *note 9.5::).
@@ -21472,7 +21518,7 @@ and the entry index, if any (see *note 9.5::).
5
Under certain circumstances (detailed below), an entry of a task or
-protected object is checked to see whether it is open or closed:
+protected object is checked to see whether it is <open> or <closed>:
6/3
* An entry of a task is open if the task is blocked on an
@@ -21484,17 +21530,17 @@ protected object is checked to see whether it is open
or closed:
7/3
* An entry of a protected object is open if the condition of the
entry_barrier of the corresponding entry_body evaluates to True;
- otherwise, it is closed. If the evaluation of the condition
+ otherwise, it is closed. If the evaluation of the condition
propagates an exception, the exception Program_Error is propagated
to all current callers of all entries of the protected object.
8
For the execution of an entry_call_statement, evaluation of the name and
of the parameter associations is as for a subprogram call (see *note
-6.4::). The entry call is then issued: For a call on an entry of a
+6.4::). The entry call is then <issued>: For a call on an entry of a
protected object, a new protected action is started on the object (see
*note 9.5.1::). The named entry is checked to see if it is open; if
-open, the entry call is said to be selected immediately, and the
+open, the entry call is said to be <selected immediately>, and the
execution of the call proceeds as follows:
9
@@ -21515,16 +21561,16 @@ actual parameters occurs, as for a subprogram call
(see *note 6.4.1::);
such assignments take place outside of any protected action.
12
-If the named entry is closed, the entry call is added to an entry queue
-(as part of the protected action, for a call on a protected entry), and
-the call remains queued until it is selected or cancelled; there is a
-separate (logical) entry queue for each entry of a given task or
-protected object (including each entry of an entry family).
+If the named entry is closed, the entry call is added to an <entry
+queue> (as part of the protected action, for a call on a protected
+entry), and the call remains queued until it is selected or cancelled;
+there is a separate (logical) entry queue for each entry of a given task
+or protected object (including each entry of an entry family).
13
-When a queued call is selected, it is removed from its entry queue.
+When a queued call is <selected>, it is removed from its entry queue.
Selecting a queued call from a particular entry queue is called
-servicing the entry queue. An entry with queued calls can be serviced
+<servicing> the entry queue. An entry with queued calls can be serviced
under the following circumstances:
14
@@ -21538,13 +21584,14 @@ under the following circumstances:
16
If there is at least one call on a queue corresponding to an open entry,
-then one such call is selected according to the entry queuing policy in
-effect (see below), and the corresponding accept_statement or entry_body
-is executed as above for an entry call that is selected immediately.
+then one such call is selected according to the <entry queuing policy>
+in effect (see below), and the corresponding accept_statement or
+entry_body is executed as above for an entry call that is selected
+immediately.
17
The entry queuing policy controls selection among queued calls both for
-task and protected entry queues. The default entry queuing policy is to
+task and protected entry queues. The default entry queuing policy is to
select calls on a given entry queue in order of arrival. If calls from
two or more queues are simultaneously eligible for selection, the
default entry queuing policy does not specify which queue is serviced
@@ -21646,14 +21693,14 @@ even if this might allow the entry call to be
selected in the interim.
_Examples_
30
-Examples of entry calls:
+<Examples of entry calls:>
31
- Agent.Shut_Down; -- see *note 9.1::
- Parser.Next_Lexeme(E); -- see *note 9.1::
- Pool(5).Read(Next_Char); -- see *note 9.1::
- Controller.Request(Low)(Some_Item); -- see *note 9.1::
- Flags(3).Seize; -- see *note 9.4::
+ Agent.Shut_Down; --< see *note 9.1::>
+ Parser.Next_Lexeme(E); --< see *note 9.1::>
+ Pool(5).Read(Next_Char); --< see *note 9.1::>
+ Controller.Request(Low)(Some_Item); --< see *note 9.1::>
+ Flags(3).Seize; --< see *note 9.4::>
File: arm2012.info, Node: 9.5.4, Prev: 9.5.3, Up: 9.5
@@ -21664,24 +21711,25 @@ File: arm2012.info, Node: 9.5.4, Prev: 9.5.3, Up:
9.5
1
A requeue_statement can be used to complete an accept_statement or
entry_body, while redirecting the corresponding entry call to a new (or
-the same) entry queue. Such a requeue can be performed with or without
-allowing an intermediate cancellation of the call, due to an abort or
-the expiration of a delay.
+the same) entry queue. Such a <requeue> can be performed with or
+without allowing an intermediate cancellation of the call, due to an
+abort or the expiration of a delay.
_Syntax_
2/3
- requeue_statement ::= requeue procedure_or_entry_name [with abort];
+ requeue_statement ::= requeue <procedure_or_entry_>
+ name [with abort];
_Name Resolution Rules_
3/3
-The procedure_or_entry_name of a requeue_statement shall resolve to
-denote a procedure or an entry (the requeue target). The profile of the
-entry, or the profile or prefixed profile of the procedure, shall either
-have no parameters, or be type conformant (see *note 6.3.1::) with the
-profile of the innermost enclosing entry_body (*note 9.5.2: S0221.) or
-accept_statement (*note 9.5.2: S0219.).
+The <procedure_or_entry_>name of a requeue_statement shall resolve to
+denote a procedure or an entry (the <requeue ><target>). The profile of
+the entry, or the profile or prefixed profile of the procedure, shall
+either have no parameters, or be type conformant (see *note 6.3.1::)
+with the profile of the innermost enclosing entry_body (*note 9.5.2:
+S0221.) or accept_statement (*note 9.5.2: S0219.).
_Legality Rules_
@@ -21693,22 +21741,22 @@ innermost enclosing body or callable construct.
5/3
If the requeue target has parameters, then its (prefixed) profile shall
be subtype conformant with the profile of the innermost enclosing
-callable construct.
+callable construct.
5.1/4
Given a requeue_statement where the innermost enclosing callable
-construct is for an entry E1, for every specific or class-wide
-postcondition expression P1 that applies to E1, there shall exist a
-postcondition expression P2 that applies to the requeue target E2 such
-that
+construct is for an entry <E1>, for every specific or class-wide
+postcondition expression <P1> that applies to <E1>, there shall exist a
+postcondition expression <P2> that applies to the requeue target <E2>
+such that
5.2/4
- * P1 is fully conformant with the expression produced by replacing
- each reference in P2 to a formal parameter of E2 with a reference
- to the corresponding formal paramter of E1; and
+ * <P1> is fully conformant with the expression produced by replacing
+ each reference in <P2> to a formal parameter of <E2> with a
+ reference to the corresponding formal paramter of <E1>; and
5.3/4
- * if P1 is enabled, then P2 is also enabled.
+ * if <P1> is enabled, then <P2> is also enabled.
5.4/4
The requeue target shall not have an applicable specific or class-wide
@@ -21747,7 +21795,7 @@ the entry_body.
7/4
The execution of a requeue_statement proceeds by first evaluating the
-procedure_or_entry_name, including the prefix identifying the target
+<procedure_or_entry_>name, including the prefix identifying the target
task or protected object and the expression identifying the entry within
an entry family, if any. Precondition checks are then performed as for
a call to the requeue target entry or subprogram. The entry_body or
@@ -21787,7 +21835,7 @@ specified in a requeue_statement; any parameter passing
is implicit.
13
If the requeue_statement includes the reserved words with abort (it is a
-requeue-with-abort), then:
+<requeue-with-abort>), then:
14
* if the original entry call has been aborted (see *note 9.8::), then
@@ -21810,21 +21858,21 @@ requeue_statement.
32 A requeue is permitted from a single entry to an entry of an
entry family, or vice-versa. The entry index, if any, plays no
part in the subtype conformance check between the profiles of the
- two entries; an entry index is part of the entry_name for an entry
- of a family.
+ two entries; an entry index is part of the <entry_>name for an
+ entry of a family.
_Examples_
18
-Examples of requeue statements:
+<Examples of requeue statements:>
19
requeue Request(Medium) with abort;
- -- requeue on a member of an entry family of the
current task, see *note 9.1::
+ --< requeue on a member of an entry family of the
current task, see *note 9.1::>
20
requeue Flags(I).Seize;
- -- requeue on an entry of an array component, see
*note 9.4::
+ --< requeue on an entry of an array component, see
*note 9.4::>
File: arm2012.info, Node: 9.6, Next: 9.7, Prev: 9.5, Up: 9
@@ -21834,12 +21882,12 @@ File: arm2012.info, Node: 9.6, Next: 9.7, Prev:
9.5, Up: 9
1
A delay_statement is used to block further execution until a specified
-expiration time is reached. The expiration time can be specified either
-as a particular point in time (in a delay_until_statement (*note 9.6:
-S0228.)), or in seconds from the current time (in a
+<expiration time> is reached. The expiration time can be specified
+either as a particular point in time (in a delay_until_statement (*note
+9.6: S0228.)), or in seconds from the current time (in a
delay_relative_statement (*note 9.6: S0229.)). The language-defined
package Calendar provides definitions for a type Time and associated
-operations, including a function Clock that returns the current time.
+operations, including a function Clock that returns the current time.
_Syntax_
@@ -21848,23 +21896,24 @@ operations, including a function Clock that returns
the current time.
delay_relative_statement
3
- delay_until_statement ::= delay until delay_expression;
+ delay_until_statement ::= delay until <delay_>expression;
4
- delay_relative_statement ::= delay delay_expression;
+ delay_relative_statement ::= delay <delay_>expression;
_Name Resolution Rules_
5
-The expected type for the delay_expression in a delay_relative_statement
-is the predefined type Duration. The delay_expression in a
-delay_until_statement is expected to be of any nonlimited type.
+The expected type for the <delay_>expression in a
+delay_relative_statement is the predefined type Duration. The
+<delay_>expression in a delay_until_statement is expected to be of any
+nonlimited type.
_Legality Rules_
6/3
There can be multiple time bases, each with a corresponding clock, and a
-corresponding time type. The type of the delay_expression in a
+corresponding <time type>. The type of the <delay_>expression in a
delay_until_statement shall be a time type -- either the type Time
defined in the language-defined package Calendar (see below), the type
Time in the package Real_Time (see *note D.8::), or some other
@@ -21887,7 +21936,7 @@ type, represents a time as reported by a corresponding
clock.
The following language-defined library package exists:
10
-
+
package Ada.Calendar is
type Time is private;
@@ -21937,21 +21986,22 @@ The following language-defined library package exists:
19
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Calendar;
_Dynamic Semantics_
20
-For the execution of a delay_statement, the delay_expression is first
-evaluated. For a delay_until_statement, the expiration time for the
-delay is the value of the delay_expression, in the time base associated
-with the type of the expression. For a delay_relative_statement, the
-expiration time is defined as the current time, in the time base
-associated with relative delays, plus the value of the delay_expression
-converted to the type Duration, and then rounded up to the next clock
-tick. The time base associated with relative delays is as defined in
-*note D.9::, "*note D.9:: Delay Accuracy" or is implementation defined.
+For the execution of a delay_statement, the <delay_>expression is first
+evaluated. For a delay_until_statement, the expiration time for the
+delay is the value of the <delay_>expression, in the time base
+associated with the type of the expression. For a
+delay_relative_statement, the expiration time is defined as the current
+time, in the time base associated with relative delays, plus the value
+of the <delay_>expression converted to the type Duration, and then
+rounded up to the next clock tick. The time base associated with
+relative delays is as defined in *note D.9::, "*note D.9:: Delay
+Accuracy" or is implementation defined.
21
The task executing a delay_statement is blocked until the expiration
@@ -21959,7 +22009,7 @@ time is reached, at which point it becomes ready again.
If the
expiration time has already passed, the task is not blocked.
22/3
-If an attempt is made to cancel the delay_statement (as part of an
+If an attempt is made to <cancel> the delay_statement (as part of an
asynchronous_select (*note 9.7.4: S0241.) or abort -- see *note 9.7.4::
and *note 9.8::), the statement is cancelled if the expiration time has
not yet passed, thereby completing the delay_statement.
@@ -22015,7 +22065,7 @@ An implementation may define additional time types.
29
An implementation may raise Time_Error if the value of a
-delay_expression in a delay_until_statement of a select_statement
+<delay_>expression in a delay_until_statement of a select_statement
represents a time more than 90 days past the current time. The actual
limit, if any, is implementation-defined.
@@ -22033,7 +22083,7 @@ not be the same time base as used for Calendar.Clock.
32
33 A delay_relative_statement with a negative value of the
- delay_expression is equivalent to one with a zero value.
+ <delay_>expression is equivalent to one with a zero value.
33
34 A delay_statement may be executed by the environment task;
@@ -22050,7 +22100,7 @@ not be the same time base as used for Calendar.Clock.
35
36 There is no necessary relationship between System.Tick (the
resolution of the clock of package Calendar) and Duration'Small
- (the small of type Duration).
+ (the <small> of type Duration).
36
37 Additional requirements associated with delay_statements are
@@ -22059,23 +22109,23 @@ not be the same time base as used for Calendar.Clock.
_Examples_
37
-Example of a relative delay statement:
+<Example of a relative delay statement:>
38
- delay 3.0; -- delay 3.0 seconds
+ delay 3.0; --< delay 3.0 seconds>
39
-Example of a periodic task:
+<Example of a periodic task:>
40
declare
use Ada.Calendar;
Next_Time : Time := Clock + Period;
- -- Period is a global constant of type Duration
+ --< Period is a global constant of type Duration>
begin
- loop -- repeated every Period seconds
+ loop --< repeated every Period seconds>
delay until Next_Time;
- ... -- perform some actions
+ ... --< perform some actions>
Next_Time := Next_Time + Period;
end loop;
end;
@@ -22099,7 +22149,7 @@ The following language-defined library packages exist:
package Ada.Calendar.Time_Zones is
3/2
- -- Time zone manipulation:
+ -- <Time zone manipulation:>
4/2
type Time_Offset is range -28*60 .. 28*60;
@@ -22114,11 +22164,11 @@ The following language-defined library packages exist:
end Ada.Calendar.Time_Zones;
8/2
-
+
package Ada.Calendar.Arithmetic is
9/2
- -- Arithmetic on days:
+ -- <Arithmetic on days:>
10/2
type Day_Count is range
@@ -22145,12 +22195,12 @@ The following language-defined library packages exist:
end Ada.Calendar.Arithmetic;
15/2
-
+
with Ada.Calendar.Time_Zones;
package Ada.Calendar.Formatting is
16/2
- -- Day of the week:
+ -- <Day of the week:>
17/2
type Day_Name is (Monday, Tuesday, Wednesday, Thursday,
@@ -22160,7 +22210,7 @@ The following language-defined library packages exist:
function Day_of_Week (Date : Time) return Day_Name;
19/2
- -- Hours:Minutes:Seconds access:
+ -- <Hours:Minutes:Seconds access:>
20/2
subtype Hour_Number is Natural range 0 .. 23;
@@ -22269,7 +22319,7 @@ The following language-defined library packages exist:
Time_Zone : in Time_Zones.Time_Offset := 0);
35/2
- -- Simple image and value:
+ -- <Simple image and value:>
function Image (Date : Time;
Include_Time_Fraction : Boolean := False;
Time_Zone : Time_Zones.Time_Offset := 0) return
String;
@@ -22640,7 +22690,7 @@ of control.
_Examples_
3
-Example of a select statement:
+<Example of a select statement:>
4
select
@@ -22666,8 +22716,7 @@ File: arm2012.info, Node: 9.7.1, Next: 9.7.2, Up: 9.7
1
This form of the select_statement allows a combination of waiting for,
and selecting from, one or more alternatives. The selection may depend
-on conditions associated with each alternative of the selective_accept.
-
+on conditions associated with each alternative of the selective_accept.
_Syntax_
2
@@ -22713,7 +22762,7 @@ on conditions associated with each alternative of the
selective_accept.
* one or more delay_alternatives; or
11
- * an else part (the reserved word else followed by a
+ * an <else part> (the reserved word else followed by a
sequence_of_statements).
12
@@ -22729,17 +22778,17 @@ delay_until_statement (*note 9.6: S0228.)s for the
same time type.
_Dynamic Semantics_
14
-A select_alternative is said to be open if it is not immediately
+A select_alternative is said to be <open> if it is not immediately
preceded by a guard, or if the condition of its guard evaluates to True.
-It is said to be closed otherwise.
+It is said to be <closed> otherwise.
15
For the execution of a selective_accept, any guard conditions are
evaluated; open alternatives are thus determined. For an open
-delay_alternative, the delay_expression is also evaluated. Similarly,
+delay_alternative, the <delay_>expression is also evaluated. Similarly,
for an open accept_alternative for an entry of a family, the entry_index
is also evaluated. These evaluations are performed in an arbitrary
-order, except that a delay_expression or entry_index is not evaluated
+order, except that a <delay_>expression or entry_index is not evaluated
until after evaluating the corresponding condition, if any. Selection
and execution of one open alternative, or of the else part, then
completes the execution of the selective_accept; the rules for this
@@ -22755,8 +22804,8 @@ the selected call is removed from its entry queue and
the
handled_sequence_of_statements (*note 11.2: S0265.) (if any) of the
corresponding accept_statement is executed; after the rendezvous
completes any subsequent sequence_of_statements (*note 5.1: S0145.) of
-the alternative is executed. If no selection is immediately possible (in
-the above sense) and there is no else part, the task blocks until an
+the alternative is executed. If no selection is immediately possible
+(in the above sense) and there is no else part, the task blocks until an
open alternative can be selected.
17
@@ -22797,7 +22846,7 @@ there is no else part.
_Examples_
23
-Example of a task body with a selective accept:
+<Example of a task body with a selective accept:>
24
task body Server is
@@ -22811,9 +22860,9 @@ Example of a task body with a selective accept:
Process_Work_Item(Current_Work_Item);
or
accept Shut_Down;
- exit; -- Premature shut down requested
+ exit; --< Premature shut down requested>
or
- terminate; -- Normal shutdown at end of scope
+ terminate; --< Normal shutdown at end of scope>
end select;
end loop;
end Server;
@@ -22829,7 +22878,7 @@ A timed_entry_call issues an entry call that is
cancelled if the call
(or a requeue-with-abort of the call) is not selected before the
expiration time is reached. A procedure call may appear rather than an
entry call for cases where the procedure might be implemented by an
-entry.
+entry.
_Syntax_
@@ -22853,25 +22902,26 @@ entry.
3.2/2
If a procedure_call_statement is used for a procedure_or_entry_call, the
-procedure_name or procedure_prefix of the procedure_call_statement shall
-statically denote an entry renamed as a procedure or (a view of) a
+<procedure_>name or <procedure_>prefix of the procedure_call_statement
+shall statically denote an entry renamed as a procedure or (a view of) a
primitive subprogram of a limited interface whose first parameter is a
controlling parameter (see *note 3.9.2::).
_Dynamic Semantics_
4/2
-For the execution of a timed_entry_call, the entry_name, procedure_name,
-or procedure_prefix, and any actual parameters are evaluated, as for a
-simple entry call (see *note 9.5.3::) or procedure call (see *note
-6.4::). The expiration time (see *note 9.6::) for the call is
-determined by evaluating the delay_expression of the delay_alternative.
-If the call is an entry call or a call on a procedure implemented by an
-entry, the entry call is then issued. Otherwise, the call proceeds as
-described in *note 6.4:: for a procedure call, followed by the
-sequence_of_statements (*note 5.1: S0145.) of the entry_call_alternative
-(*note 9.7.2: S0238.); the sequence_of_statements (*note 5.1: S0145.) of
-the delay_alternative (*note 9.7.1: S0235.) is ignored.
+For the execution of a timed_entry_call, the <entry_>name,
+<procedure_>name, or <procedure_>prefix, and any actual parameters are
+evaluated, as for a simple entry call (see *note 9.5.3::) or procedure
+call (see *note 6.4::). The expiration time (see *note 9.6::) for the
+call is determined by evaluating the <delay_>expression of the
+delay_alternative. If the call is an entry call or a call on a
+procedure implemented by an entry, the entry call is then issued.
+Otherwise, the call proceeds as described in *note 6.4:: for a procedure
+call, followed by the sequence_of_statements (*note 5.1: S0145.) of the
+entry_call_alternative (*note 9.7.2: S0238.); the sequence_of_statements
+(*note 5.1: S0145.) of the delay_alternative (*note 9.7.1: S0235.) is
+ignored.
5
If the call is queued (including due to a requeue-with-abort), and not
@@ -22885,14 +22935,14 @@ S0145.) of the entry_call_alternative (*note 9.7.2:
S0238.) is executed.
_Examples_
6
-Example of a timed entry call:
+<Example of a timed entry call:>
7
select
Controller.Request(Medium)(Some_Item);
or
delay 45.0;
- -- controller too busy, try something else
+ --< controller too busy, try something else>
end select;
@@ -22937,7 +22987,7 @@ as given after the reserved word else.
_Examples_
5
-Example of a conditional entry call:
+<Example of a conditional entry call:>
6
procedure Spin(R : in Resource) is
@@ -22947,7 +22997,7 @@ Example of a conditional entry call:
R.Seize;
return;
else
- null; -- busy waiting
+ null; --< busy waiting>
end select;
end loop;
end;
@@ -22986,13 +23036,13 @@ control upon completion of an entry call or the
expiration of a delay.
6/2
For the execution of an asynchronous_select whose triggering_statement
-(*note 9.7.4: S0243.) is a procedure_or_entry_call, the entry_name,
-procedure_name, or procedure_prefix, and actual parameters are evaluated
-as for a simple entry call (see *note 9.5.3::) or procedure call (see
-*note 6.4::). If the call is an entry call or a call on a procedure
-implemented by an entry, the entry call is issued. If the entry call is
-queued (or requeued-with-abort), then the abortable_part is executed.
-If the entry call is selected immediately, and never
+(*note 9.7.4: S0243.) is a procedure_or_entry_call, the <entry_>name,
+<procedure_>name, or <procedure_>prefix, and actual parameters are
+evaluated as for a simple entry call (see *note 9.5.3::) or procedure
+call (see *note 6.4::). If the call is an entry call or a call on a
+procedure implemented by an entry, the entry call is issued. If the
+entry call is queued (or requeued-with-abort), then the abortable_part
+is executed. If the entry call is selected immediately, and never
requeued-with-abort, then the abortable_part is never started. If the
call is on a procedure that is not implemented by an entry, the call
proceeds as described in *note 6.4::, followed by the
@@ -23001,7 +23051,7 @@ sequence_of_statements (*note 5.1: S0145.) of the
triggering_alternative
7
For the execution of an asynchronous_select whose triggering_statement
-(*note 9.7.4: S0243.) is a delay_statement, the delay_expression is
+(*note 9.7.4: S0243.) is a delay_statement, the <delay_>expression is
evaluated and the expiration time is determined, as for a normal
delay_statement. If the expiration time has not already passed, the
abortable_part is executed.
@@ -23024,7 +23074,7 @@ is executed after the abortable_part is left.
_Examples_
10
-Example of a main command loop for a command interpreter:
+<Example of a main command loop for a command interpreter:>
11
loop
@@ -23032,7 +23082,7 @@ Example of a main command loop for a command
interpreter:
Terminal.Wait_For_Interrupt;
Put_Line("Interrupted");
then abort
- -- This will be abandoned upon terminal interrupt
+ -- <This will be abandoned upon terminal interrupt>
Put_Line("-> ");
Get_Line(Command, Last);
Process_Command(Command(1..Last));
@@ -23040,15 +23090,15 @@ Example of a main command loop for a command
interpreter:
end loop;
12
-Example of a time-limited calculation:
+<Example of a time-limited calculation:>
13
select
delay 5.0;
Put_Line("Calculation does not converge");
then abort
- -- This calculation should finish in 5.0 seconds;
- -- if not, it is assumed to diverge.
+ -- <This calculation should finish in 5.0 seconds;>
+ -- < if not, it is assumed to diverge.>
Horribly_Complicated_Recursive_Function(X, Y);
end select;
@@ -23071,28 +23121,28 @@ causes a sequence_of_statements (*note 5.1: S0145.)
to be aborted.
_Syntax_
2
- abort_statement ::= abort task_name {, task_name};
+ abort_statement ::= abort <task_>name {, <task_>name};
_Name Resolution Rules_
3
-Each task_name is expected to be of any task type; they need not all be
-of the same task type.
+Each <task_>name is expected to be of any task type; they need not all
+be of the same task type.
_Dynamic Semantics_
4
-For the execution of an abort_statement, the given task_names are
-evaluated in an arbitrary order. Each named task is then aborted, which
-consists of making the task abnormal and aborting the execution of the
-corresponding task_body, unless it is already completed.
+For the execution of an abort_statement, the given <task_>names are
+evaluated in an arbitrary order. Each named task is then <aborted>,
+which consists of making the task <abnormal> and aborting the execution
+of the corresponding task_body, unless it is already completed.
5
-When the execution of a construct is aborted (including that of a
+When the execution of a construct is <aborted> (including that of a
task_body (*note 9.1: S0209.) or of a sequence_of_statements (*note 5.1:
S0145.)), the execution of every construct included within the aborted
execution is also aborted, except for executions included within the
-execution of an abort-deferred operation; the execution of an
+execution of an <abort-deferred> operation; the execution of an
abort-deferred operation continues to completion without being affected
by the abort; the following are the abort-deferred operations:
@@ -23140,9 +23190,9 @@ effects occur before the execution of the
abort_statement completes.
Other than for these immediate cases, the execution of a construct that
is aborted does not necessarily complete before the abort_statement
completes. However, the execution of the aborted construct completes no
-later than its next abort completion point (if any) that occurs outside
-of an abort-deferred operation; the following are abort completion
-points for an execution:
+later than its next <abort completion point> (if any) that occurs
+outside of an abort-deferred operation; the following are abort
+completion points for an execution:
16
* the point where the execution initiates the activation of another
@@ -23165,8 +23215,7 @@ points for an execution:
An attempt to execute an asynchronous_select as part of the execution of
an abort-deferred operation is a bounded error. Similarly, an attempt
to create a task that depends on a master that is included entirely
-within the execution of an abort-deferred operation is a bounded error.
-In both cases, Program_Error is raised if the error is detected by the
+within the execution of an abort-deferred operation is a bounded error.In both
cases, Program_Error is raised if the error is detected by the
implementation; otherwise, the operations proceed as they would outside
an abort-deferred operation, except that an abort of the abortable_part
or the created task might or might not have an effect.
@@ -23175,9 +23224,9 @@ or the created task might or might not have an effect.
21
If an assignment operation completes prematurely due to an abort, the
-assignment is said to be disrupted; the target of the assignment or its
-parts can become abnormal, and certain subsequent uses of the object can
-be erroneous, as explained in *note 13.9.1::.
+assignment is said to be <disrupted>; the target of the assignment or
+its parts can become abnormal, and certain subsequent uses of the object
+can be erroneous, as explained in *note 13.9.1::.
NOTES
@@ -23208,9 +23257,9 @@ the following attributes are defined:
2
T'Callable
Yields the value True when the task denoted by T is
- callable, and False otherwise; a task is callable unless
- it is completed or abnormal. The value of this attribute
- is of the predefined type Boolean.
+ <callable>, and False otherwise; a task is callable
+ unless it is completed or abnormal. The value of this
+ attribute is of the predefined type Boolean.
3
T'Terminated
@@ -23229,7 +23278,7 @@ the body of the task unit.
E'Count
Yields the number of calls presently queued on the entry
E of the current instance of the unit. The value of this
- attribute is of the type universal_integer.
+ attribute is of the type <universal_integer>.
NOTES
@@ -23262,7 +23311,7 @@ File: arm2012.info, Node: 9.10, Next: 9.11, Prev:
9.9, Up: 9
1/3
If two different objects, including nonoverlapping parts of the same
-object, are independently addressable, they can be manipulated
+object, are <independently addressable>, they can be manipulated
concurrently by two different tasks without synchronization. Any two
nonoverlapping objects are independently addressable if either object is
specified as independently addressable (see *note C.6::). Otherwise,
@@ -23280,9 +23329,9 @@ another. However, task interactions can be used to
synchronize the
actions of two or more tasks to allow, for example, meaningful
communication by the direct updating and reading of variables shared
between the tasks. The actions of two different tasks are synchronized
-in this sense when an action of one task signals an action of the other
-task; an action A1 is defined to signal an action A2 under the following
-circumstances:
+in this sense when an action of one task <signals> an action of the
+other task; an action A1 is defined to signal an action A2 under the
+following circumstances:
3
* If A1 and A2 are part of the execution of the same task, and the
@@ -23332,8 +23381,8 @@ circumstances:
Given an action of assigning to an object, and an action of reading or
updating a part of the same object (or of a neighboring object if the
two are not independently addressable), then the execution of the
-actions is erroneous unless the actions are sequential. Two actions are
-sequential if one of the following is true:
+actions is erroneous unless the actions are <sequential>. Two actions
+are sequential if one of the following is true:
12
* One action signals the other;
@@ -23369,10 +23418,10 @@ have the following structure:
3/2
task body Producer is
- Person : Person_Name; -- see *note 3.10.1::
+ Person : Person_Name; --< see *note 3.10.1::>
begin
loop
- ... -- simulate arrival of the next customer
+ ... --< simulate arrival of the next customer>
Buffer.Append_Wait(Person);
exit when Person = null;
end loop;
@@ -23391,7 +23440,7 @@ and the consuming task might have the following
structure:
loop
Buffer.Remove_First_Wait(Person);
exit when Person = null;
- ... -- simulate serving a customer
+ ... --< simulate serving a customer>
end loop;
end Consumer;
@@ -23409,7 +23458,7 @@ passed to the Transfer class-wide operation defined for
objects of a
type covered by Queue'Class.
8/2
- protected Buffer is new Synchronized_Queue with -- see *note 3.9.4::
+ protected Buffer is new Synchronized_Queue with --< see *note 3.9.4::>
entry Append_Wait(Person : in Person_Name);
entry Remove_First_Wait(Person : out Person_Name);
function Cur_Count return Natural;
@@ -23434,7 +23483,7 @@ type covered by Queue'Class.
procedure Append(Person : in Person_Name) is
begin
if Count = Pool'Length then
- raise Queue_Error with "Buffer Full"; -- see *note 11.3::
+ raise Queue_Error with "Buffer Full"; --< see *note 11.3::>
end if;
Pool(In_Index) := Person;
In_Index := (In_Index mod Pool'Length) + 1;
@@ -23452,7 +23501,7 @@ type covered by Queue'Class.
procedure Remove_First(Person : out Person_Name) is
begin
if Count = 0 then
- raise Queue_Error with "Buffer Empty"; -- see *note 11.3::
+ raise Queue_Error with "Buffer Empty"; --< see *note 11.3::>
end if;
Person := Pool(Out_Index);
Out_Index := (Out_Index mod Pool'Length) + 1;
@@ -23480,16 +23529,16 @@ File: arm2012.info, Node: 10, Next: 11, Prev: 9,
Up: Top
1/3
The overall structure of programs and the facilities for separate
-compilation are described in this clause. A program is a set of
-partitions, each of which may execute in a separate address space,
+compilation are described in this clause. A <program> is a set of
+<partitions>, each of which may execute in a separate address space,
possibly on a separate computer.
2
-As explained below, a partition is constructed from library units.
+As explained below, a partition is constructed from <library units>.
Syntactically, the declaration of a library unit is a library_item, as
is the body of a library unit. An implementation may support a concept
-of a program library (or simply, a "library"), which contains
-library_items and their subunits. Library units may be organized into a
+of a <program library> (or simply, a "library"), which contains
+library_items and their subunits. Library units may be organized into a
hierarchy of children, grandchildren, and so on.
3/3
@@ -23511,7 +23560,7 @@ File: arm2012.info, Node: 10.1, Next: 10.2, Up: 10
=========================
1
-A program unit is either a package, a task unit, a protected unit, a
+A <program unit> is either a package, a task unit, a protected unit, a
protected entry, a generic unit, or an explicitly declared subprogram
other than an enumeration literal. Certain kinds of program units can
be separately compiled. Alternatively, they can appear physically
@@ -23528,8 +23577,8 @@ implementation-defined.
A library unit is a separately compiled program unit, and is always a
package, subprogram, or generic unit. Library units may have other
(logically nested) library units as children, and may have other program
-units physically nested within them. A root library unit, together with
-its children and grandchildren and so on, form a subsystem.
+units physically nested within them. A root library unit, together with
+its children and grandchildren and so on, form a <subsystem>.
_Implementation Permissions_
@@ -23555,9 +23604,9 @@ File: arm2012.info, Node: 10.1.1, Next: 10.1.2, Up:
10.1
1
A library_item is a compilation unit that is the declaration, body, or
renaming of a library unit. Each library unit (except Standard) has a
-parent unit, which is a library package or generic library package. A
-library unit is a child of its parent unit. The root library units are
-the children of the predefined library package Standard.
+<parent unit>, which is a library package or generic library package. A
+library unit is a <child> of its parent unit. The <root> library units
+are the children of the predefined library package Standard.
_Syntax_
@@ -23597,46 +23646,46 @@ the children of the predefined library package
Standard.
declares a library unit.
9
-A library unit is a program unit that is declared by a library_item.
+A <library unit> is a program unit that is declared by a library_item.
When a program unit is a library unit, the prefix "library" is used to
refer to it (or "generic library" if generic), as well as to its
declaration and body, as in "library procedure", "library package_body",
-or "generic library package". The term compilation unit is used to refer
-to a compilation_unit. When the meaning is clear from context, the term
-is also used to refer to the library_item of a compilation_unit or to
-the proper_body of a subunit (that is, the compilation_unit without the
-context_clause and the separate (parent_unit_name)).
+or "generic library package". The term <compilation unit> is used to
+refer to a compilation_unit. When the meaning is clear from context,
+the term is also used to refer to the library_item of a compilation_unit
+or to the proper_body of a subunit (that is, the compilation_unit
+without the context_clause and the separate (parent_unit_name)).
10
-The parent declaration of a library_item (and of the library unit) is
+The <parent declaration> of a library_item (and of the library unit) is
the declaration denoted by the parent_unit_name (*note 10.1.1: S0252.),
if any, of the defining_program_unit_name (*note 6.1: S0169.) of the
-library_item. If there is no parent_unit_name (*note 10.1.1: S0252.),
+library_item. If there is no parent_unit_name (*note 10.1.1: S0252.),
the parent declaration is the declaration of Standard, the library_item
-is a root library_item, and the library unit (renaming) is a root
+is a <root> library_item, and the library unit (renaming) is a <root>
library unit (renaming). The declaration and body of Standard itself
-have no parent declaration. The parent unit of a library_item or library
-unit is the library unit declared by its parent declaration.
+have no parent declaration. The <parent unit> of a library_item or
+library unit is the library unit declared by its parent declaration.
11
The children of a library unit occur immediately within the declarative
-region of the declaration of the library unit. The ancestors of a
+region of the declaration of the library unit. The <ancestors> of a
library unit are itself, its parent, its parent's parent, and so on.
-(Standard is an ancestor of every library unit.) The descendant relation
-is the inverse of the ancestor relation.
+(Standard is an ancestor of every library unit.) The <descendant>
+relation is the inverse of the ancestor relation.
12
A library_unit_declaration or a library_unit_renaming_declaration (*note
-10.1.1: S0250.) is private if the declaration is immediately preceded by
-the reserved word private; it is otherwise public. A library unit is
-private or public according to its declaration. The public descendants
-of a library unit are the library unit itself, and the public
-descendants of its public children. Its other descendants are private
-descendants.
+10.1.1: S0250.) is <private> if the declaration is immediately preceded
+by the reserved word private; it is otherwise <public>. A library unit
+is private or public according to its declaration. The <public
+descendants> of a library unit are the library unit itself, and the
+public descendants of its public children. Its other descendants are
+<private descendants>.
12.1/2
For each library package_declaration in the environment, there is an
-implicit declaration of a limited view of that library package. The
+implicit declaration of a <limited view> of that library package. The
limited view of a package contains:
12.2/3
@@ -23704,13 +23753,13 @@ A child of a parent generic package shall be
instantiated or renamed
only within the declarative region of the parent generic.
19/2
-For each child C of some parent generic package P, there is a
-corresponding declaration C nested immediately within each instance of
-P. For the purposes of this rule, if a child C itself has a child D,
-each corresponding declaration for C has a corresponding child D. The
-corresponding declaration for a child within an instance is visible only
-within the scope of a with_clause that mentions the (original) child
-generic unit.
+For each child <C> of some parent generic package <P>, there is a
+corresponding declaration <C> nested immediately within each instance of
+<P>. For the purposes of this rule, if a child <C> itself has a child
+<D>, each corresponding declaration for <C> has a corresponding child
+<D>. The corresponding declaration for a child within an instance is
+visible only within the scope of a with_clause that mentions the
+(original) child generic unit.
20
A library subprogram shall not override a primitive subprogram.
@@ -23730,15 +23779,15 @@ renaming-as-declaration, not a renaming-as-body.
There are two kinds of dependences among compilation units:
24
- * The semantic dependences (see below) are the ones needed to check
+ * The <semantic dependences> (see below) are the ones needed to check
the compile-time rules across compilation unit boundaries; a
compilation unit depends semantically on the other compilation
units needed to determine its legality. The visibility rules are
based on the semantic dependences.
25
- * The elaboration dependences (see *note 10.2::) determine the order
- of elaboration of library_items.
+ * The <elaboration dependences> (see *note 10.2::) determine the
+ order of elaboration of library_items.
26/2
A library_item depends semantically upon its parent declaration. A
@@ -23783,31 +23832,31 @@ no effect.
_Examples_
29
-Examples of library units:
+<Examples of library units:>
30
- package Rational_Numbers.IO is -- public child of Rational_Numbers, see
*note 7.1::
+ package Rational_Numbers.IO is --< public child of Rational_Numbers, see
*note 7.1::>
procedure Put(R : in Rational);
procedure Get(R : out Rational);
end Rational_Numbers.IO;
31
private procedure Rational_Numbers.Reduce(R : in out Rational);
- -- private child of Rational_Numbers
+ --< private child of Rational_Numbers>
32
- with Rational_Numbers.Reduce; -- refer to a private child
+ with Rational_Numbers.Reduce; --< refer to a private child>
package body Rational_Numbers is
...
end Rational_Numbers;
33
with Rational_Numbers.IO; use Rational_Numbers;
- with Ada.Text_io; -- see *note A.10::
- procedure Main is -- a root library procedure
+ with Ada.Text_io; --< see *note A.10::>
+ procedure Main is --< a root library procedure>
R : Rational;
begin
- R := 5/3; -- construct a rational number, see *note
7.1::
+ R := 5/3; --< construct a rational number, see
*note 7.1::>
Ada.Text_IO.Put("The answer is: ");
IO.Put(R);
Ada.Text_IO.New_Line;
@@ -23816,7 +23865,7 @@ Examples of library units:
34
with Rational_Numbers.IO;
package Rational_IO renames Rational_Numbers.IO;
- -- a library unit renaming declaration
+ --< a library unit renaming declaration>
35
Each of the above library_items can be submitted to the compiler
@@ -23844,17 +23893,17 @@ needed within a compilation unit.
with_clause ::= limited_with_clause | nonlimited_with_clause
4.1/2
- limited_with_clause ::= limited [private] with library_unit_
- name {, library_unit_name};
+ limited_with_clause ::= limited [private] with <library_unit_>
+ name {, <library_unit_>name};
4.2/2
- nonlimited_with_clause ::= [private] with library_unit_
- name {, library_unit_name};
+ nonlimited_with_clause ::= [private] with <library_unit_>
+ name {, <library_unit_>name};
_Name Resolution Rules_
5
-The scope of a with_clause that appears on a library_unit_declaration
+The <scope> of a with_clause that appears on a library_unit_declaration
(*note 10.1.1: S0249.) or library_unit_renaming_declaration (*note
10.1.1: S0250.) consists of the entire declarative region of the
declaration, which includes all children and subunits. The scope of a
@@ -23862,11 +23911,11 @@ with_clause that appears on a body consists of the
body, which includes
all subunits.
6/2
-A library_item (and the corresponding library unit) is named in a
-with_clause if it is denoted by a library_unit_name in the with_clause.
-A library_item (and the corresponding library unit) is mentioned in a
-with_clause if it is named in the with_clause or if it is denoted by a
-prefix in the with_clause.
+A library_item (and the corresponding library unit) is <named> in a
+with_clause if it is denoted by a <library_unit_>name in the
+with_clause. A library_item (and the corresponding library unit) is
+<mentioned> in a with_clause if it is named in the with_clause or if it
+is denoted by a prefix in the with_clause.
7
Outside its own declarative region, the declaration or renaming of a
@@ -23970,8 +24019,8 @@ A limited_with_clause that names a library package
shall not appear:
end Office.Locations;
26/2
- limited with Office.Departments; -- types are incomplete
- private with Office.Locations; -- only visible in private part
+ limited with Office.Departments; --< types are incomplete>
+ private with Office.Locations; --< only visible in private part>
package Office.Employees is
type Employee is private;
@@ -24059,11 +24108,11 @@ parent's body can be visible within the subunits.
_Legality Rules_
8/2
-The parent body of a subunit is the body of the program unit denoted by
-its parent_unit_name. The term subunit is used to refer to a subunit
-and also to the proper_body of a subunit. The subunits of a program
-unit include any subunit that names that program unit as its parent, as
-well as any subunit that names such a subunit as its parent
+The <parent body> of a subunit is the body of the program unit denoted
+by its parent_unit_name. The term <subunit> is used to refer to a
+subunit and also to the proper_body of a subunit. The <subunits of a
+program unit> include any subunit that names that program unit as its
+parent, as well as any subunit that names such a subunit as its parent
(recursively).
9
@@ -24084,13 +24133,13 @@ previous declaration, in which case the _stub
declares the subprogram.
If the _stub is a completion, it shall be the completion of a
subprogram_declaration or generic_subprogram_declaration. The profile
of a subprogram_body_stub that completes a declaration shall conform
-fully to that of the declaration.
+fully to that of the declaration.
12
A subunit that corresponds to a body_stub shall be of the same kind
(package_, subprogram_, task_, or protected_) as the body_stub. The
profile of a subprogram_body subunit shall be fully conformant to that
-of the corresponding body_stub.
+of the corresponding body_stub.
13
A body_stub shall appear immediately within the declarative_part of a
@@ -24171,11 +24220,11 @@ File: arm2012.info, Node: 10.1.4, Next: 10.1.5,
Prev: 10.1.3, Up: 10.1
1
Each compilation unit submitted to the compiler is compiled in the
-context of an environment declarative_part (or simply, an environment),
-which is a conceptual declarative_part that forms the outermost
-declarative region of the context of any compilation. At run time, an
-environment forms the declarative_part of the body of the environment
-task of a partition (see *note 10.2::, "*note 10.2:: Program
+context of an <environment> declarative_part (or simply, an
+<environment>), which is a conceptual declarative_part that forms the
+outermost declarative region of the context of any compilation. At run
+time, an environment forms the declarative_part of the body of the
+environment task of a partition (see *note 10.2::, "*note 10.2:: Program
Execution").
2
@@ -24203,14 +24252,14 @@ already exists in the environment for a subprogram
other than an
instance of a generic subprogram or for a generic subprogram (even if
the profile of the body is not type conformant with that of the
declaration); otherwise, the subprogram_body is interpreted as both the
-declaration and body of a library subprogram.
+declaration and body of a library subprogram.
_Legality Rules_
5
When a compilation unit is compiled, all compilation units upon which it
depends semantically shall already exist in the environment; the set of
-these compilation units shall be consistent in the sense that the new
+these compilation units shall be <consistent> in the sense that the new
compilation unit shall not semantically depend (directly or indirectly)
on two different versions of the same compilation unit, nor on an
earlier version of itself.
@@ -24247,13 +24296,13 @@ that subprogram.
single compilation unit.
9
- 6 An implementation may support a concept of a library, which
+ 6 An implementation may support a concept of a <library>, which
contains library_items. If multiple libraries are supported, the
implementation has to define how a single environment is
constructed when a compilation unit is submitted to the compiler.
Naming conflicts between different libraries might be resolved by
treating each library as the root of a hierarchy of child library
- units.
+ units.
10
7 A compilation unit containing an instantiation of a separately
@@ -24275,8 +24324,8 @@ units, and compilations.
_Name Resolution Rules_
2
-Certain pragmas are defined to be program unit pragmas. A name given as
-the argument of a program unit pragma shall resolve to denote the
+Certain pragmas are defined to be <program unit pragmas>. A name given
+as the argument of a program unit pragma shall resolve to denote the
declarations or renamings of one or more program units that occur
immediately within the declarative region or compilation in which the
pragma immediately occurs, or it shall resolve to denote the declaration
@@ -24315,9 +24364,9 @@ A program unit pragma shall appear in one of these
places:
declarative_part (*note 3.11: S0086.) or program unit declaration.
7/3
-Certain program unit pragmas are defined to be library unit pragmas. If
-a library unit pragma applies to a program unit, the program unit shall
-be a library unit.
+Certain program unit pragmas are defined to be <library unit pragmas>.
+If a library unit pragma applies to a program unit, the program unit
+shall be a library unit.
_Static Semantics_
@@ -24329,7 +24378,7 @@ contrary.
_Post-Compilation Rules_
8
-Certain pragmas are defined to be configuration pragmas; they shall
+Certain pragmas are defined to be <configuration pragmas>; they shall
appear before the first compilation_unit of a compilation. They are
generally used to select a partition-wide or system-wide option. The
pragma applies to all compilation_units appearing in the compilation,
@@ -24414,7 +24463,7 @@ File: arm2012.info, Node: 10.2, Prev: 10.1, Up: 10
======================
1
-An Ada program consists of a set of partitions, which can execute in
+An Ada <program> consists of a set of <partitions>, which can execute in
parallel with one another, possibly in a separate address space, and
possibly on a separate computer.
@@ -24424,10 +24473,10 @@ possibly on a separate computer.
A partition is a program or part of a program that can be invoked from
outside the Ada implementation. For example, on many systems, a
partition might be an executable file generated by the system linker.
-The user can explicitly assign library units to a partition. The
+The user can <explicitly assign> library units to a partition. The
assignment is done in an implementation-defined manner. The compilation
units included in a partition are those of the explicitly assigned
-library units, as well as other compilation units needed by those
+library units, as well as other compilation units <needed by> those
library units. The compilation units needed by a given compilation unit
are determined as follows (unless specified otherwise via an
implementation-defined pragma, or by some other implementation-defined
@@ -24455,19 +24504,19 @@ means):
7
The user can optionally designate (in an implementation-defined manner)
-one subprogram as the main subprogram for the partition. A main
+one subprogram as the <main subprogram> for the partition. A main
subprogram, if specified, shall be a subprogram.
8
-Each partition has an anonymous environment task, which is an implicit
+Each partition has an anonymous <environment task>, which is an implicit
outermost task whose execution elaborates the library_items of the
environment declarative_part, and then calls the main subprogram, if
there is one. A partition's execution is that of its tasks.
9
The order of elaboration of library units is determined primarily by the
-elaboration dependences. There is an elaboration dependence of a given
-library_item upon another if the given library_item or any of its
+<elaboration dependences>. There is an elaboration dependence of a
+given library_item upon another if the given library_item or any of its
subunits depends semantically on the other library_item. In addition,
if a given library_item or any of its subunits has a pragma Elaborate or
Elaborate_All that names another library unit, then there is an
@@ -24479,15 +24528,15 @@ needed by the declaration of the other library unit.
The environment task for a partition has the following structure:
11
- task Environment_Task;
+ task <Environment_Task>;
12
- task body Environment_Task is
- ... (1) -- The environment declarative_part
- -- (that is, the sequence of library_items) goes here.
+ task body <Environment_Task> is
+ ... (1) --< The environment >declarative_part
+ --< (that is, the sequence of >library_item<s) goes here.>
begin
- ... (2) -- Call the main subprogram, if there is one.
- end Environment_Task;
+ ... (2) --< Call the main subprogram, if there is one.>
+ end <Environment_Task>;
13
The environment declarative_part at (1) is a sequence of
@@ -24546,7 +24595,7 @@ in dynamic linking, or "load-and-go" systems.
25
The execution of a program consists of the execution of a set of
-partitions. Further details are implementation defined. The execution
+partitions. Further details are implementation defined. The execution
of a partition starts with the execution of its environment task, ends
when the environment task terminates, and includes the executions of all
tasks of the partition. The execution of the (implicit) task_body of
@@ -24561,7 +24610,7 @@ such tasks, and then finalizes any remaining objects of
the partition.
Once the environment task has awaited the termination of all other tasks
of the partition, any further attempt to create a task (during
finalization) is a bounded error, and may result in the raising of
-Program_Error either upon creation or activation of the task. If such a
+Program_Error either upon creation or activation of the task. If such a
task is activated, it is not specified whether the task is awaited prior
to termination of the environment task.
@@ -24575,9 +24624,9 @@ the rules of the language.
_Implementation Permissions_
28/3
-The kind of partition described in this subclause is known as an active
-partition. An implementation is allowed to support other kinds of
-partitions, with implementation-defined semantics.
+The kind of partition described in this subclause is known as an
+<active> partition. An implementation is allowed to support other kinds
+of partitions, with implementation-defined semantics.
29
An implementation may restrict the kinds of subprograms it supports as
@@ -24642,7 +24691,7 @@ of library_items.
The form of a pragma Preelaborate is as follows:
3
- pragma Preelaborate[(library_unit_name)];
+ pragma Preelaborate[(<library_unit_>name)];
4
A pragma Preelaborate is a library unit pragma.
@@ -24700,22 +24749,22 @@ instance body would not perform any such actions,
presuming that:
11/3
A pragma Preelaborate (or pragma Pure -- see below) is used to specify
-that a library unit is preelaborated, namely that the Preelaborate
+that a library unit is <preelaborated>, namely that the Preelaborate
aspect of the library unit is True; all compilation units of the library
unit are preelaborated. The declaration and body of a preelaborated
library unit, and all subunits that are elaborated as part of
elaborating the library unit, shall be preelaborable. All compilation
units of a preelaborated library unit shall depend semantically only on
-declared pure or preelaborated library_items. In addition to the places
+declared pure or preelaborated library_items. In addition to the places
where Legality Rules normally apply (see *note 12.3::), these rules also
-apply in the private part of an instance of a generic unit. If a library
-unit is preelaborated, then its declaration, if any, and body, if any,
-are elaborated prior to all nonpreelaborated library_items of the
-partition.
+apply in the private part of an instance of a generic unit. If a
+library unit is preelaborated, then its declaration, if any, and body,
+if any, are elaborated prior to all nonpreelaborated library_items of
+the partition.
11.1/2
-The following rules specify which entities have preelaborable
-initialization:
+The following rules specify which entities have <preelaborable
+initialization>:
11.2/3
* The partial view of a private type or private extension, a
@@ -24762,7 +24811,7 @@ have preelaborable initialization. If the pragma is
applied to a
protected type, the protected type shall not have entries, and each
component of the protected type shall have preelaborable initialization.
For any other composite type, the type shall have preelaborable
-initialization. In addition to the places where Legality Rules normally
+initialization. In addition to the places where Legality Rules normally
apply (see *note 12.3::), these rules apply also in the private part of
an instance of a generic unit.
@@ -24788,7 +24837,7 @@ that include the given version.
The form of a pragma Pure is as follows:
14
- pragma Pure[(library_unit_name)];
+ pragma Pure[(<library_unit_>name)];
15
A pragma Pure is a library unit pragma.
@@ -24796,7 +24845,7 @@ that include the given version.
_Static Semantics_
15.1/3
-A pure compilation unit is a preelaborable compilation unit whose
+A <pure> compilation unit is a preelaborable compilation unit whose
elaboration does not perform any of the following actions:
15.2/2
@@ -24834,17 +24883,17 @@ zero.
_Legality Rules_
16/2
-This paragraph was deleted.
+<This paragraph was deleted.>
17/3
-A pragma Pure is used to specify that a library unit is declared pure,
+A pragma Pure is used to specify that a library unit is <declared pure>,
namely that the Pure aspect of the library unit is True; all compilation
units of the library unit are declared pure. In addition, the limited
view of any library package is declared pure. The declaration and body
of a declared pure library unit, and all subunits that are elaborated as
part of elaborating the library unit, shall be pure. All compilation
units of a declared pure library unit shall depend semantically only on
-declared pure library_items. In addition to the places where Legality
+declared pure library_items. In addition to the places where Legality
Rules normally apply (see *note 12.3::), these rules also apply in the
private part of an instance of a generic unit. Furthermore, the full
view of any partial view declared in the visible part of a declared pure
@@ -24882,13 +24931,13 @@ when called.
as follows:
20
- pragma Elaborate(library_unit_name{, library_unit_name});
+ pragma Elaborate(<library_unit_>name{, <library_unit_>name});
21
- pragma Elaborate_All(library_unit_name{, library_unit_name});
+ pragma Elaborate_All(<library_unit_>name{, <library_unit_>name});
22
- pragma Elaborate_Body[(library_unit_name)];
+ pragma Elaborate_Body[(<library_unit_>name)];
23
A pragma Elaborate or Elaborate_All is only allowed within a
@@ -24905,7 +24954,7 @@ pragma Elaborate_Body applies), then the declaration
requires a
completion (a body).
25.1/2
-The library_unit_name of a pragma Elaborate or Elaborate_All shall
+The <library_unit_>name of a pragma Elaborate or Elaborate_All shall
denote a nonlimited view of a library unit.
_Static Semantics_
@@ -24940,13 +24989,12 @@ File: arm2012.info, Node: 11, Next: 12, Prev: 10,
Up: Top
1/3
This clause defines the facilities for dealing with errors or other
-exceptional situations that arise during program execution. An exception
-represents a kind of exceptional situation; an occurrence of such a
-situation (at run time) is called an exception occurrence. To raise an
-exception is to abandon normal program execution so as to draw attention
-to the fact that the corresponding situation has arisen. Performing some
-actions in response to the arising of an exception is called handling
-the exception.
+exceptional situations that arise during program execution. An
+<exception> represents a kind of exceptional situation; an occurrence of
+such a situation (at run time) is called an <exception occurrence>. To
+<raise> an exception is to abandon normal program execution so as to
+draw attention to the fact that the corresponding situation has
arisen.Performing some actions in response to the arising of an exception is
+called <handling> the exception.
2/3
An exception_declaration declares a name for an exception. An exception
@@ -24993,7 +25041,7 @@ name is determined at compilation time and is the same
regardless of how
many times the exception_declaration is elaborated.
4
-The predefined exceptions are the ones declared in the declaration of
+The <predefined> exceptions are the ones declared in the declaration of
package Standard: Constraint_Error, Program_Error, Storage_Error, and
Tasking_Error; one of them is raised when a language-defined check
fails.
@@ -25005,13 +25053,13 @@ The elaboration of an exception_declaration has no
effect.
6
The execution of any construct raises Storage_Error if there is
-insufficient storage for that execution. The amount of storage needed
+insufficient storage for that execution. The amount of storage needed
for the execution of constructs is unspecified.
_Examples_
7
-Examples of user-defined exception declarations:
+<Examples of user-defined exception declarations:>
8
Singular : exception;
@@ -25047,18 +25095,18 @@ exception_handler.
choice_parameter_specification ::= defining_identifier
5
- exception_choice ::= exception_name | others
+ exception_choice ::= <exception_>name | others
_Legality Rules_
5.1/4
-An exception_name of an exception_choice shall denote an exception.
+An <exception_>name of an exception_choice shall denote an exception.
6
-A choice with an exception_name covers the named exception. A choice
-with others covers all exceptions not named by previous choices of the
-same handled_sequence_of_statements (*note 11.2: S0265.). Two choices
-in different exception_handlers of the same
+A choice with an <exception_>name <covers> the named exception. A
+choice with others covers all exceptions not named by previous choices
+of the same handled_sequence_of_statements (*note 11.2: S0265.). Two
+choices in different exception_handlers of the same
handled_sequence_of_statements (*note 11.2: S0265.) shall not cover the
same exception.
@@ -25067,14 +25115,14 @@ A choice with others is allowed only for the last
handler of a
handled_sequence_of_statements and as the only choice of that handler.
8
-An exception_name of a choice shall not denote an exception declared in
-a generic formal package.
+An <exception_>name of a choice shall not denote an exception declared
+in a generic formal package.
_Static Semantics_
9
-A choice_parameter_specification declares a choice parameter, which is a
-constant object of type Exception_Occurrence (see *note 11.4.1::).
+A choice_parameter_specification declares a <choice parameter>, which is
+a constant object of type Exception_Occurrence (see *note 11.4.1::).
During the handling of an exception occurrence, the choice parameter, if
any, of the handler represents the exception occurrence that is being
handled.
@@ -25090,15 +25138,15 @@ by the sequence_of_statements (*note 5.1: S0145.).
_Examples_
11
-Example of an exception handler:
+<Example of an exception handler:>
12
begin
- Open(File, In_File, "input.txt"); -- see *note A.8.2::
+ Open(File, In_File, "input.txt"); --< see *note A.8.2::>
exception
when E : Name_Error =>
Put("Cannot open input file : ");
- Put_Line(Exception_Message(E)); -- see *note 11.4.1::
+ Put_Line(Exception_Message(E)); --< see *note 11.4.1::>
raise;
end;
@@ -25115,10 +25163,10 @@ A raise_statement raises an exception.
2/2
raise_statement ::= raise;
- | raise exception_name [with string_expression];
+ | raise <exception_>name [with <string_>expression];
2.1/4
- raise_expression ::= raise exception_name [with string_
+ raise_expression ::= raise <exception_>name [with <string_>
simple_expression]
2.2/4
@@ -25150,15 +25198,15 @@ A raise_statement raises an exception.
_Legality Rules_
3/4
-The exception_name, if any, of a raise_statement or raise_expression
-shall denote an exception. A raise_statement with no exception_name
-(that is, a re-raise statement) shall be within a handler, but not
+The <exception_>name, if any, of a raise_statement or raise_expression
+shall denote an exception. A raise_statement with no <exception_>name
+(that is, a <re-raise statement>) shall be within a handler, but not
within a body enclosed by that handler.
_Name Resolution Rules_
3.1/4
-The string_expression or string_simple_expression, if any, of a
+The <string_>expression or <string_>simple_expression, if any, of a
raise_statement or raise_expression is expected to be of type String.
3.2/4
@@ -25167,35 +25215,35 @@ The expected type for a raise_expression shall be any
single type.
_Dynamic Semantics_
4/4
-To raise an exception is to raise a new occurrence of that exception, as
-explained in *note 11.4::. For the execution of a raise_statement with
-an exception_name, the named exception is raised. Similarly, for the
-evaluation of a raise_expression, the named exception is raised. In
-both of these cases, if a string_expression or string_simple_expression
-is present, the expression is evaluated and its value is associated with
-the exception occurrence. For the execution of a re-raise statement, the
-exception occurrence that caused transfer of control to the innermost
-enclosing handler is raised again.
+To <raise an exception> is to raise a new occurrence of that exception,
+as explained in *note 11.4::. For the execution of a raise_statement
+with an <exception_>name, the named exception is raised. Similarly, for
+the evaluation of a raise_expression, the named exception is raised. In
+both of these cases, if a <string_>expression or
+<string_>simple_expression is present, the expression is evaluated and
+its value is associated with the exception occurrence. For the
+execution of a re-raise statement, the exception occurrence that caused
+transfer of control to the innermost enclosing handler is raised again.
NOTES
4.1/4
- 1 If the evaluation of a string_expression or
- string_simple_expression raises an exception, that exception is
- propagated instead of the one denoted by the exception_name of the
- raise_statement or raise_expression.
+ 1 If the evaluation of a <string_>expression or
+ <string_>simple_expression raises an exception, that exception is
+ propagated instead of the one denoted by the <exception_>name of
+ the raise_statement or raise_expression.
_Examples_
5
-Examples of raise statements:
+<Examples of raise statements:>
6/2
- raise Ada.IO_Exceptions.Name_Error; -- see *note A.13::
- raise Queue_Error with "Buffer Full"; -- see *note 9.11::
+ raise Ada.IO_Exceptions.Name_Error; --< see *note A.13::>
+ raise Queue_Error with "Buffer Full"; --< see *note 9.11::>
7
- raise; -- re-raise the current exception
+ raise; --< re-raise the current exception>
File: arm2012.info, Node: 11.4, Next: 11.5, Prev: 11.3, Up: 11
@@ -25206,24 +25254,24 @@ File: arm2012.info, Node: 11.4, Next: 11.5, Prev:
11.3, Up: 11
1
When an exception occurrence is raised, normal program execution is
abandoned and control is transferred to an applicable exception_handler,
-if any. To handle an exception occurrence is to respond to the
-exceptional event. To propagate an exception occurrence is to raise it
-again in another context; that is, to fail to respond to the exceptional
-event in the present context.
+if any. To <handle> an exception occurrence is to respond to the
+exceptional event. To <propagate> an exception occurrence is to raise
+it again in another context; that is, to fail to respond to the
+exceptional event in the present context.
_Dynamic Semantics_
2
-Within a given task, if the execution of construct a is defined by this
-International Standard to consist (in part) of the execution of
-construct b, then while b is executing, the execution of a is said to
-dynamically enclose the execution of b. The innermost dynamically
-enclosing execution of a given execution is the dynamically enclosing
-execution that started most recently.
+Within a given task, if the execution of construct <a> is defined by
+this International Standard to consist (in part) of the execution of
+construct <b>, then while <b> is executing, the execution of <a> is said
+to <dynamically enclose> the execution of <b>. The <innermost
+dynamically enclosing> execution of a given execution is the dynamically
+enclosing execution that started most recently.
3
When an exception occurrence is raised by the execution of a given
-construct, the rest of the execution of that construct is abandoned;
+construct, the rest of the execution of that construct is <abandoned>;
that is, any portions of the execution that have not yet taken place are
not performed. The construct is first completed, and then left, as
explained in *note 7.6.1::. Then:
@@ -25238,12 +25286,12 @@ explained in *note 7.6.1::. Then:
covering the exception, the occurrence is handled by that handler;
6
- * Otherwise, the occurrence is propagated to the innermost
+ * Otherwise, the occurrence is <propagated> to the innermost
dynamically enclosing execution, which means that the occurrence is
raised again in that context.
7
-When an occurrence is handled by a given handler, the
+When an occurrence is <handled> by a given handler, the
choice_parameter_specification, if any, is first elaborated, which
creates the choice parameter and initializes it to the occurrence.
Then, the sequence_of_statements of the handler is executed; this
@@ -25303,13 +25351,13 @@ The following language-defined library package exists:
function Exception_Identity(X : Exception_Occurrence)
return Exception_Id;
function Exception_Name(X : Exception_Occurrence) return String;
- -- Same as Exception_Name(Exception_Identity(X)).
+ --< Same as Exception_Name(Exception_Identity(X)).>
function Wide_Exception_Name(X : Exception_Occurrence)
return Wide_String;
- -- Same as Wide_Exception_Name(Exception_Identity(X)).
+ --< Same as Wide_Exception_Name(Exception_Identity(X)).>
function Wide_Wide_Exception_Name(X : Exception_Occurrence)
return Wide_Wide_String;
- -- Same as Wide_Wide_Exception_Name(Exception_Identity(X)).
+ --< Same as Wide_Wide_Exception_Name(Exception_Identity(X)).>
function Exception_Information(X : Exception_Occurrence) return
String;
6/2
@@ -25332,7 +25380,7 @@ The following language-defined library package exists:
6.3/2
private
- ... -- not specified by the language
+ ... --< not specified by the language>
end Ada.Exceptions;
7
@@ -25360,12 +25408,12 @@ Exception_Message returns the message associated with
the given
Exception_Occurrence. For an occurrence raised by a call to
Raise_Exception, the message is the Message parameter passed to
Raise_Exception. For the occurrence raised by a raise_statement or
-raise_expression with an exception_name and a string_expression or
-string_simple_expression, the message is the string_expression or
-string_simple_expression. For the occurrence raised by a
-raise_statement or raise_expression with an exception_name but without a
-string_expression or string_simple_expression, the message is a string
-giving implementation-defined information about the exception
+raise_expression with an <exception_>name and a <string_>expression or
+<string_>simple_expression, the message is the <string_>expression or
+<string_>simple_expression. For the occurrence raised by a
+raise_statement or raise_expression with an <exception_>name but without
+a <string_>expression or <string_>simple_expression, the message is a
+string giving implementation-defined information about the exception
occurrence. For an occurrence originally raised in some other manner
(including by the failure of a language-defined check), the message is
an unspecified string. In all cases, Exception_Message returns a string
@@ -25423,7 +25471,7 @@ occurrence to a stream; Read_Exception_Occurrence
reconstructs an
exception occurrence from a stream (including one written in a different
partition).
-Paragraph 16 was deleted.
+<Paragraph 16 was deleted.>
_Implementation Permissions_
@@ -25460,8 +25508,8 @@ point within a sequence of declarations or statements.
1.1/3
Assert pragmas, subtype predicates (see *note 3.2.4::), preconditions
and postconditions (see *note 6.1.1::), and type invariants (see *note
-7.3.2::) are collectively referred to as assertions; their boolean
-expressions are referred to as assertion expressions.
+7.3.2::) are collectively referred to as <assertions>; their boolean
+expressions are referred to as <assertion expressions>.
1.2/3
Pragma Assertion_Policy is used to control whether assertions are to be
@@ -25474,8 +25522,8 @@ implementation-defined manner.
The form of a pragma Assert is as follows:
3/2
- pragma Assert([Check =>] boolean_expression[, [Message =>]
- string_expression]);
+ pragma Assert([Check =>] <boolean_>expression[, [Message =>]
+ <string_>expression]);
4/2
A pragma Assert is allowed at the place where a declarative_item or
@@ -25485,12 +25533,12 @@ implementation-defined manner.
The form of a pragma Assertion_Policy is as follows:
6/2
- pragma Assertion_Policy(policy_identifier);
+ pragma Assertion_Policy(<policy_>identifier);
6.1/3
pragma Assertion_Policy(
- assertion_aspect_mark => policy_identifier
- {, assertion_aspect_mark => policy_identifier});
+ <assertion_>aspect_mark => <policy_>identifier
+ {, <assertion_>aspect_mark => <policy_>identifier});
7/3
A pragma Assertion_Policy is allowed only immediately within a
@@ -25500,17 +25548,17 @@ implementation-defined manner.
_Name Resolution Rules_
8/2
-The expected type for the boolean_expression of a pragma Assert is any
-boolean type. The expected type for the string_expression of a pragma
+The expected type for the <boolean_>expression of a pragma Assert is any
+boolean type. The expected type for the <string_>expression of a pragma
Assert is type String.
_Legality Rules_
9/3
-The assertion_aspect_mark of a pragma Assertion_Policy shall be one of
+The <assertion_>aspect_mark of a pragma Assertion_Policy shall be one of
Assert, Static_Predicate, Dynamic_Predicate, Pre, Pre'Class, Post,
Post'Class, Type_Invariant, Type_Invariant'Class, or some implementation
-defined aspect_mark. The policy_identifier shall be either Check,
+defined aspect_mark. The <policy_>identifier shall be either Check,
Ignore, or some implementation-defined identifier.
_Static Semantics_
@@ -25518,10 +25566,10 @@ Ignore, or some implementation-defined identifier.
10/3
A pragma Assertion_Policy determines for each assertion aspect named in
the pragma_argument_associations whether assertions of the given aspect
-are to be enforced by a run-time check. The policy_identifier Check
+are to be enforced by a run-time check. The <policy_>identifier Check
requires that assertion expressions of the given aspect be checked that
they evaluate to True at the points specified for the given aspect; the
-policy_identifier Ignore requires that the assertion expression not be
+<policy_>identifier Ignore requires that the assertion expression not be
evaluated at these points, and the run-time checks not be performed.
Note that for subtype predicate aspects (see *note 3.2.4::), even when
the applicable Assertion_Policy is Ignore, the predicate will still be
@@ -25530,8 +25578,8 @@ and if static, will still have an effect on loop
iteration over the
subtype, and the selection of case_statement_alternatives and variants.
10.1/3
-If no assertion_aspect_marks are specified in the pragma, the specified
-policy applies to all assertion aspects.
+If no <assertion_>aspect_marks are specified in the pragma, the
+specified policy applies to all assertion aspects.
10.2/3
A pragma Assertion_Policy applies to the named assertion aspects in a
@@ -25576,7 +25624,7 @@ A compilation unit containing a check for an assertion
(including a
pragma Assert) has a semantic dependence on the Assertions library unit.
17/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Dynamic Semantics_
@@ -25642,11 +25690,11 @@ expression if the evaluation of the expression has a
side effect such
that an immediate reevaluation of the expression could produce a
different value. Similarly, an implementation need not allow the
specification of an assertion expression that is checked as part of a
-call on or return from a callable entity C, if the evaluation of the
+call on or return from a callable entity <C>, if the evaluation of the
expression has a side effect such that the evaluation of some other
-assertion expression associated with the same call of (or return from) C
-could produce a different value than it would if the first expression
-had not been evaluated.
+assertion expression associated with the same call of (or return from)
+<C> could produce a different value than it would if the first
+expression had not been evaluated.
NOTES
@@ -25675,12 +25723,12 @@ from the response to that error:
3
File_Not_Found : exception;
procedure Open(F : in out File_Handle; Name : String);
- -- raises File_Not_Found if named file does not exist
+ --< raises File_Not_Found if named file does not exist>
4
End_Of_File : exception;
procedure Read(F : in out File_Handle; Data : out Data_Type);
- -- raises End_Of_File if the file is not open
+ --< raises End_Of_File if the file is not open>
5
...
@@ -25720,7 +25768,7 @@ from the response to that error:
use Ada;
procedure Main is
begin
- ... -- call operations in File_System
+ ... --< call operations in File_System>
exception
when End_Of_File =>
Close(Some_File);
@@ -25751,17 +25799,17 @@ File: arm2012.info, Node: 11.5, Next: 11.6, Prev:
11.4, Up: 11
=======================
1/2
-Checking pragmas give instructions to an implementation on handling
+<Checking pragmas> give instructions to an implementation on handling
language-defined checks. A pragma Suppress gives permission to an
implementation to omit certain language-defined checks, while a pragma
Unsuppress revokes the permission to omit checks..
2/3
-A language-defined check (or simply, a "check") is one of the situations
-defined by this International Standard that requires a check to be made
-at run time to determine whether some condition is true. A check fails
-when the condition being checked is False, causing an exception to be
-raised.
+A <language-defined check> (or simply, a "check") is one of the
+situations defined by this International Standard that requires a check
+to be made at run time to determine whether some condition is true. A
+check <fails> when the condition being checked is False, causing an
+exception to be raised.
_Syntax_
@@ -25785,7 +25833,7 @@ raised.
The identifier shall be the name of a check.
7/2
-This paragraph was deleted.
+<This paragraph was deleted.>
_Static Semantics_
@@ -25805,8 +25853,8 @@ checking pragma also applies to the entire instance.
8/2
A pragma Suppress gives permission to an implementation to omit the
named check (or every check in the case of All_Checks) for any entities
-to which it applies. If permission has been given to suppress a given
-check, the check is said to be suppressed.
+to which it applies. If permission has been given to suppress a given
+check, the check is said to be <suppressed>.
8.1/2
A pragma Unsuppress revokes the permission to omit the named check (or
@@ -25908,7 +25956,7 @@ Elaboration_Check
21/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
22
* The following check corresponds to situations in which the
@@ -25979,7 +26027,7 @@ have been suppressed.
_Examples_
30/2
-Examples of suppressing and unsuppressing checks:
+<Examples of suppressing and unsuppressing checks:>
31/2
pragma Suppress(Index_Check);
@@ -26000,7 +26048,7 @@ semantics.
2/3
The rest of this International Standard (outside this subclause) defines
-the canonical semantics of the language. The canonical semantics of a
+the <canonical semantics> of the language. The canonical semantics of a
given (legal) program determines a set of possible external effects that
can result from the execution of the program with given inputs.
@@ -26021,13 +26069,13 @@ The following additional permissions are granted to
the implementation:
5
* An implementation need not always raise an exception when a
language-defined check fails. Instead, the operation that failed
- the check can simply yield an undefined result. The exception need
- be raised by the implementation only if, in the absence of raising
- it, the value of this undefined result would have some effect on
- the external interactions of the program. In determining this, the
- implementation shall not presume that an undefined result has a
- value that belongs to its subtype, nor even to the base range of
- its type, if scalar. Having removed the raise of the exception,
+ the check can simply yield an <undefined result>. The exception
+ need be raised by the implementation only if, in the absence of
+ raising it, the value of this undefined result would have some
+ effect on the external interactions of the program. In determining
+ this, the implementation shall not presume that an undefined result
+ has a value that belongs to its subtype, nor even to the base range
+ of its type, if scalar. Having removed the raise of the exception,
the canonical semantics will in general allow the implementation to
omit the code for the check, and some or all of the operation
itself.
@@ -26042,11 +26090,11 @@ The following additional permissions are granted to
the implementation:
interactions are independent of the result of the checked
operation) than that defined by the canonical semantics, but not
within the execution of some abort-deferred operation or
- independent subprogram that does not dynamically enclose the
- execution of the construct whose check failed. An independent
+ <independent> subprogram that does not dynamically enclose the
+ execution of the construct whose check failed. An independent
subprogram is one that is defined outside the library unit
containing the construct whose check failed, and for which the
- Inline aspect is False. Any assignment that occurred outside of
+ Inline aspect is False. Any assignment that occurred outside of
such abort-deferred operations or independent subprograms can be
disrupted by the raising of the exception, causing the object or
its parts to become abnormal, and certain subsequent uses of the
@@ -26066,11 +26114,11 @@ File: arm2012.info, Node: 12, Next: 13, Prev: 11,
Up: Top
****************
1
-A generic unit is a program unit that is either a generic subprogram or
-a generic package. A generic unit is a template, which can be
+A <generic unit> is a program unit that is either a generic subprogram
+or a generic package. A generic unit is a <template>, which can be
parameterized, and from which corresponding (nongeneric) subprograms or
packages can be obtained. The resulting program units are said to be
-instances of the original generic unit.
+<instances> of the original generic unit.
2
A generic unit is declared by a generic_declaration. This form of
@@ -26153,7 +26201,7 @@ A generic_declaration declares a generic unit -- a
generic package,
generic procedure, or generic function, as appropriate.
9
-An entity is a generic formal entity if it is declared by a
+An entity is a <generic formal> entity if it is declared by a
generic_formal_parameter_declaration. "Generic formal," or simply
"formal," is used as a prefix in referring to objects, subtypes (and
types), functions, procedures and packages, that are generic formal
@@ -26191,32 +26239,32 @@ The elaboration of a generic_declaration has no
effect.
_Examples_
14
-Examples of generic formal parts:
+<Examples of generic formal parts:>
15
- generic -- parameterless
+ generic --< parameterless >
16
generic
- Size : Natural; -- formal object
+ Size : Natural; --< formal object >
17
generic
- Length : Integer := 200; -- formal object with a default
expression
+ Length : Integer := 200; --< formal object with a default
expression>
18
- Area : Integer := Length*Length; -- formal object with a default
expression
+ Area : Integer := Length*Length; --< formal object with a default
expression>
19
generic
- type Item is private; -- formal type
- type Index is (<>); -- formal type
- type Row is array(Index range <>) of Item; -- formal type
- with function "<"(X, Y : Item) return Boolean; -- formal subprogram
+ type Item is private; --< formal type>
+ type Index is (<>); --< formal type>
+ type Row is array(Index range <>) of Item; --< formal type>
+ with function "<"(X, Y : Item) return Boolean; --< formal
subprogram >
20
-Examples of generic declarations declaring generic subprograms Exchange
-and Squaring:
+<Examples of generic declarations declaring generic subprograms Exchange
+and Squaring:>
21
generic
@@ -26230,7 +26278,7 @@ and Squaring:
function Squaring(X : Item) return Item;
23
-Example of a generic declaration declaring a generic package:
+<Example of a generic declaration declaring a generic package:>
24
generic
@@ -26250,7 +26298,7 @@ File: arm2012.info, Node: 12.2, Next: 12.3, Prev:
12.1, Up: 12
===================
1
-The body of a generic unit (a generic body) is a template for the
+The body of a generic unit (a <generic body>) is a template for the
instance bodies. The syntax of a generic body is identical to that of a
nongeneric body.
@@ -26273,11 +26321,11 @@ from then on be instantiated without failing the
Elaboration_Check.
_Examples_
4
-Example of a generic procedure body:
+<Example of a generic procedure body:>
5
- procedure Exchange(U, V : in out Elem) is -- see *note 12.1::
- T : Elem; -- the generic formal type
+ procedure Exchange(U, V : in out Elem) is --< see *note 12.1::>
+ T : Elem; --< the generic formal type>
begin
T := U;
U := V;
@@ -26285,23 +26333,23 @@ Example of a generic procedure body:
end Exchange;
6
-Example of a generic function body:
+<Example of a generic function body:>
7
- function Squaring(X : Item) return Item is -- see *note 12.1::
+ function Squaring(X : Item) return Item is --< see *note 12.1::>
begin
- return X*X; -- the formal operator "*"
+ return X*X; --< the formal operator "*">
end Squaring;
8
-Example of a generic package body:
+<Example of a generic package body:>
9
- package body On_Vectors is -- see *note 12.1::
+ package body On_Vectors is --< see *note 12.1::>
10
function Sum(A, B : Vector) return Vector is
- Result : Vector(A'Range); -- the formal type Vector
+ Result : Vector(A'Range); --< the formal type Vector>
Bias : constant Integer := B'First - A'First;
begin
if A'Length /= B'Length then
@@ -26310,17 +26358,17 @@ Example of a generic package body:
11
for N in A'Range loop
- Result(N) := Sum(A(N), B(N + Bias)); -- the formal function Sum
+ Result(N) := Sum(A(N), B(N + Bias)); --< the formal function Sum>
end loop;
return Result;
end Sum;
12
function Sigma(A : Vector) return Item is
- Total : Item := A(A'First); -- the formal type Item
+ Total : Item := A(A'First); --< the formal type Item>
begin
for N in A'First + 1 .. A'Last loop
- Total := Sum(Total, A(N)); -- the formal function Sum
+ Total := Sum(Total, A(N)); --< the formal function Sum>
end loop;
return Total;
end Sigma;
@@ -26340,15 +26388,15 @@ An instance of a generic unit is declared by a
generic_instantiation.
2/3
generic_instantiation ::=
package defining_program_unit_name is
- new generic_package_name [generic_actual_part]
+ new <generic_package_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
procedure defining_program_unit_name is
- new generic_procedure_name [generic_actual_part]
+ new <generic_procedure_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
function defining_designator is
- new generic_function_name [generic_actual_part]
+ new <generic_function_>name [generic_actual_part]
[aspect_specification];
3
@@ -26357,22 +26405,22 @@ An instance of a generic unit is declared by a
generic_instantiation.
4
generic_association ::=
- [generic_formal_parameter_selector_name =>]
+ [<generic_formal_parameter_>selector_name =>]
explicit_generic_actual_parameter
5
- explicit_generic_actual_parameter ::= expression | variable_name
- | subprogram_name | entry_name | subtype_mark
- | package_instance_name
+ explicit_generic_actual_parameter ::= expression | <variable_>name
+ | <subprogram_>name | <entry_>name | subtype_mark
+ | <package_instance_>name
6
- A generic_association is named or positional according to whether
- or not the generic_formal_parameter_selector_name (*note 4.1.3:
- S0099.) is specified. Any positional associations shall precede
- any named associations.
+ A generic_association is <named> or <positional> according to
+ whether or not the <generic_formal_parameter_>selector_name (*note
+ 4.1.3: S0099.) is specified. Any positional associations shall
+ precede any named associations.
7/3
-The generic actual parameter is either the
+The <generic actual parameter> is either the
explicit_generic_actual_parameter given in a generic_association (*note
12.3: S0278.) for each formal, or the corresponding default_expression
(*note 3.7: S0063.) or default_name (*note 12.6: S0300.) if no
@@ -26390,7 +26438,7 @@ of the corresponding kind (generic package, generic
procedure, or
generic function, respectively).
9/3
-The generic_formal_parameter_selector_name of a named
+The <generic_formal_parameter_>selector_name of a named
generic_association shall denote a generic_formal_parameter_declaration
of the generic unit being instantiated. If two or more formal
subprograms have the same defining name, then named associations are not
@@ -26426,7 +26474,7 @@ instance body, both at the place of the instantiation.
13
The instance is a copy of the text of the template. Each use of a
formal parameter becomes (in the copy) a use of the actual, as explained
-below. An instance of a generic package is a package, that of a generic
+below. An instance of a generic package is a package, that of a generic
procedure is a procedure, and that of a generic function is a function.
14
@@ -26515,20 +26563,20 @@ object of mode in (see *note 12.4::).
_Examples_
23
-Examples of generic instantiations (see *note 12.1::):
+<Examples of generic instantiations (see *note 12.1::):>
24
procedure Swap is new Exchange(Elem => Integer);
- procedure Swap is new Exchange(Character); -- Swap is overloaded
- function Square is new Squaring(Integer); -- "*" of Integer used by
default
+ procedure Swap is new Exchange(Character); --< Swap is overloaded >
+ function Square is new Squaring(Integer); --< "*" of Integer used by
default>
function Square is new Squaring(Item => Matrix, "*" => Matrix_Product);
- function Square is new Squaring(Matrix, Matrix_Product); -- same as
previous
+ function Square is new Squaring(Matrix, Matrix_Product); --< same as
previous >
25
package Int_Vectors is new On_Vectors(Integer, Table, "+");
26
-Examples of uses of instantiated units:
+<Examples of uses of instantiated units:>
27
Swap(A, B);
@@ -26536,11 +26584,11 @@ Examples of uses of instantiated units:
28
T : Table(1 .. 5) := (10, 20, 30, 40, 50);
- N : Integer := Int_Vectors.Sigma(T); -- 150 (see *note 12.2::, "*note
12.2:: Generic Bodies" for the body of Sigma)
+ N : Integer := Int_Vectors.Sigma(T); --< 150 (see *note 12.2::, "*note
12.2:: Generic Bodies" for the body of Sigma)>
29
use Int_Vectors;
- M : Integer := Sigma(T); -- 150
+ M : Integer := Sigma(T); --< 150>
File: arm2012.info, Node: 12.4, Next: 12.5, Prev: 12.3, Up: 12
@@ -26582,7 +26630,7 @@ access-to-object type, the type of the actual shall
have the same
designated type as that of the access_definition. If the anonymous
access type is an access-to-subprogram type, the type of the actual
shall have a designated profile which is type conformant with that of
-the access_definition.
+the access_definition.
_Legality Rules_
@@ -26608,7 +26656,7 @@ access_definition, the type of the actual and the type
of the formal:
8.2/2
* shall both be access-to-subprogram types with subtype conformant
- designated profiles.
+ designated profiles.
8.3/2
For a formal_object_declaration with a null_exclusion or an
@@ -26616,15 +26664,15 @@ access_definition that has a null_exclusion:
8.4/2
* if the actual matching the formal_object_declaration denotes the
- generic formal object of another generic unit G, and the
- instantiation containing the actual occurs within the body of G or
- within the body of a generic unit declared within the declarative
- region of G, then the declaration of the formal object of G shall
- have a null_exclusion;
+ generic formal object of another generic unit <G>, and the
+ instantiation containing the actual occurs within the body of <G>
+ or within the body of a generic unit declared within the
+ declarative region of <G>, then the declaration of the formal
+ object of <G> shall have a null_exclusion;
8.5/2
* otherwise, the subtype of the actual matching the
- formal_object_declaration shall exclude null. In addition to the
+ formal_object_declaration shall exclude null. In addition to the
places where Legality Rules normally apply (see *note 12.3::), this
rule applies also in the private part of an instance of a generic
unit.
@@ -26633,9 +26681,9 @@ access_definition that has a null_exclusion:
9/2
A formal_object_declaration declares a generic formal object. The
-default mode is in. For a formal object of mode in, the nominal subtype
+default mode is in. For a formal object of mode in, the nominal subtype
is the one denoted by the subtype_mark or access_definition in the
-declaration of the formal. For a formal object of mode in out, its type
+declaration of the formal. For a formal object of mode in out, its type
is determined by the subtype_mark or access_definition in the
declaration; its nominal subtype is nonstatic, even if the subtype_mark
denotes a static subtype; for a composite type, its nominal subtype is
@@ -26643,8 +26691,8 @@ unconstrained if the first subtype of the type is
unconstrained, even if
the subtype_mark denotes a constrained subtype.
10/2
-In an instance, a formal_object_declaration of mode in is a full
-constant declaration and declares a new stand-alone constant object
+In an instance, a formal_object_declaration of mode in is a <full
+constant declaration> and declares a new stand-alone constant object
whose initialization expression is the actual, whereas a
formal_object_declaration of mode in out declares a view whose
properties are identical to those of the actual.
@@ -26655,7 +26703,7 @@ properties are identical to those of the actual.
For the evaluation of a generic_association for a formal object of mode
in, a constant object is created, the value of the actual parameter is
converted to the nominal subtype of the formal object, and assigned to
-the object, including any value adjustment -- see *note 7.6::.
+the object, including any value adjustment -- see *note 7.6::.
NOTES
@@ -26712,20 +26760,20 @@ whose type is in a certain category of types.
4
For a generic formal subtype, the actual shall be a subtype_mark; it
-denotes the (generic) actual subtype.
+denotes the <(generic) actual subtype>.
_Static Semantics_
5
-A formal_type_declaration declares a (generic) formal type, and its
-first subtype, the (generic) formal subtype.
+A formal_type_declaration declares a <(generic) formal type>, and its
+first subtype, the <(generic) formal subtype>.
6/3
-The form of a formal_type_definition determines a category (of types) to
-which the formal type belongs. For a formal_private_type_definition the
-reserved words tagged and limited indicate the category of types (see
-*note 12.5.1::). The reserved word tagged also plays this role in the
-case of a formal_incomplete_type_declaration. For a
+The form of a formal_type_definition <determines a category (of types)>
+to which the formal type belongs. For a formal_private_type_definition
+the reserved words tagged and limited indicate the category of types
+(see *note 12.5.1::). The reserved word tagged also plays this role in
+the case of a formal_incomplete_type_declaration. For a
formal_derived_type_definition the category of types is the derivation
class rooted at the ancestor type. For other formal types, the name of
the syntactic category indicates the category of types; a
@@ -26770,7 +26818,7 @@ rules specific to formal derived types are given in
*note 12.5.1::.
_Examples_
11
-Examples of generic formal types:
+<Examples of generic formal types:>
12
type Item is private;
@@ -26786,13 +26834,13 @@ Examples of generic formal types:
type Table is array (Enum) of Item;
15
-Example of a generic formal part declaring a formal integer type:
+<Example of a generic formal part declaring a formal integer type:>
16
generic
type Rank is range <>;
First : Rank := Rank'First;
- Second : Rank := First + 1; -- the operator "+" of the type Rank
+ Second : Rank := First + 1; --< the operator "+" of the type Rank >
* Menu:
@@ -26836,8 +26884,8 @@ If a generic formal type declaration has a
known_discriminant_part, then
it shall not include a default_expression for a discriminant.
5/3
-The ancestor subtype of a formal derived type is the subtype denoted by
-the subtype_mark of the formal_derived_type_definition. For a formal
+The <ancestor subtype> of a formal derived type is the subtype denoted
+by the subtype_mark of the formal_derived_type_definition. For a formal
derived type declaration, the reserved words with private shall appear
if and only if the ancestor type is a tagged type; in this case the
formal derived type is a private extension of the ancestor type and the
@@ -26906,7 +26954,7 @@ type with a known_discriminant_part:
14
* The subtype of each discriminant of the actual type shall
statically match the subtype of the corresponding discriminant of
- the formal type.
+ the formal type.
15
For a generic formal type with an unknown_discriminant_part, the actual
@@ -26926,7 +26974,7 @@ type.
The category determined for a formal private type is as follows:
17/2
- Type Definition Determined Category
+ <Type Definition> <Determined Category>
limited private the category of all types
private the category of all nonlimited types
@@ -26986,25 +27034,25 @@ S'Definite
23.1/3
In the case where a formal type has unknown discriminants, and the
-actual type is a class-wide type T'Class:
+actual type is a class-wide type <T>'Class:
23.2/2
* For the purposes of defining the primitive operations of the formal
type, each of the primitive operations of the actual type is
considered to be a subprogram (with an intrinsic calling convention
-- see *note 6.3.1::) whose body consists of a dispatching call
- upon the corresponding operation of T, with its formal parameters
+ upon the corresponding operation of <T>, with its formal parameters
as the actual parameters. If it is a function, the result of the
dispatching call is returned.
23.3/2
- * If the corresponding operation of T has no controlling formal
+ * If the corresponding operation of <T> has no controlling formal
parameters, then the controlling tag value is determined by the
context of the call, according to the rules for tag-indeterminate
calls (see *note 3.9.2:: and *note 5.2::). In the case where the
tag would be statically determined to be that of the formal type,
the call raises Program_Error. If such a function is renamed, any
- call on the renaming raises Program_Error.
+ call on the renaming raises Program_Error.
NOTES
@@ -27035,7 +27083,7 @@ File: arm2012.info, Node: 12.5.2, Next: 12.5.3,
Prev: 12.5.1, Up: 12.5
--------------------------
1/2
-A formal scalar type is one defined by any of the
+A <formal scalar type> is one defined by any of the
formal_type_definitions in this subclause. The category determined for
a formal scalar type is the category of all discrete, signed integer,
modular, floating point, ordinary fixed point, or decimal types.
@@ -27108,11 +27156,11 @@ following conditions:
6
* For each index position, the index types shall be the same, and the
index subtypes (if unconstrained), or the index ranges (if
- constrained), shall statically match (see *note 4.9.1::).
+ constrained), shall statically match (see *note 4.9.1::).
7
* The component subtypes of the formal and actual array types shall
- statically match.
+ statically match.
8
* If the formal type has aliased components, then so shall the
@@ -27121,10 +27169,10 @@ following conditions:
_Examples_
9
-Example of formal array types:
+<Example of formal array types:>
10
- -- given the generic package
+ --< given the generic package >
11
generic
@@ -27137,21 +27185,21 @@ Example of formal array types:
end P;
12
- -- and the types
+ --< and the types >
13
type Mix is array (Color range <>) of Boolean;
type Option is array (Color) of Boolean;
14
- -- then Mix can match Vector and Option can match Table
+ --< then Mix can match Vector and Option can match Table >
15
package R is new P(Item => Boolean, Index => Color,
Vector => Mix, Table => Option);
16
- -- Note that Mix cannot match Table and Option cannot match Vector
+ --< Note that Mix cannot match Table and Option cannot match Vector>
File: arm2012.info, Node: 12.5.4, Next: 12.5.5, Prev: 12.5.3, Up: 12.5
@@ -27172,7 +27220,7 @@ access types.
3
For a formal access-to-object type, the designated subtypes of the
-formal and actual types shall statically match.
+formal and actual types shall statically match.
4/2
If and only if the general_access_modifier constant applies to the
@@ -27183,15 +27231,15 @@ the formal subtype excludes null, the actual subtype
shall exclude null.
5/3
For a formal access-to-subprogram subtype, the designated profiles of
-the formal and the actual shall be subtype conformant.
+the formal and the actual shall be subtype conformant.
_Examples_
6
-Example of formal access types:
+<Example of formal access types:>
7
- -- the formal types of the generic package
+ --< the formal types of the generic package >
8
generic
@@ -27202,7 +27250,7 @@ Example of formal access types:
end P;
9
- -- can be matched by the actual types
+ --< can be matched by the actual types >
10
type Car;
@@ -27217,7 +27265,7 @@ Example of formal access types:
end record;
12
- -- in the following generic instantiation
+ --< in the following generic instantiation >
13
package R is new P(Node => Car, Link => Car_Name);
@@ -27319,10 +27367,10 @@ that of the formal subprogram.
7/3
The profiles of the formal and any named default shall be mode
-conformant.
+conformant.
8/3
-The profiles of the formal and actual shall be mode conformant.
+The profiles of the formal and actual shall be mode conformant.
8.1/2
For a parameter or result subtype of a formal_subprogram_declaration
@@ -27330,32 +27378,32 @@ that has an explicit null_exclusion:
8.2/2
* if the actual matching the formal_subprogram_declaration denotes a
- generic formal object of another generic unit G, and the
+ generic formal object of another generic unit <G>, and the
instantiation containing the actual that occurs within the body of
- a generic unit G or within the body of a generic unit declared
- within the declarative region of the generic unit G, then the
+ a generic unit <G> or within the body of a generic unit declared
+ within the declarative region of the generic unit <G>, then the
corresponding parameter or result type of the formal subprogram of
- G shall have a null_exclusion;
+ <G> shall have a null_exclusion;
8.3/2
* otherwise, the subtype of the corresponding parameter or result
type of the actual matching the formal_subprogram_declaration shall
- exclude null. In addition to the places where Legality Rules
+ exclude null. In addition to the places where Legality Rules
normally apply (see *note 12.3::), this rule applies also in the
private part of an instance of a generic unit.
8.4/3
If a formal parameter of a formal_abstract_subprogram_declaration (*note
-12.6: S0298.) is of a specific tagged type T or of an anonymous access
-type designating a specific tagged type T, T is called a controlling
-type of the formal_abstract_subprogram_declaration (*note 12.6: S0298.).
-Similarly, if the result of a formal_abstract_subprogram_declaration
-(*note 12.6: S0298.) for a function is of a specific tagged type T or of
-an anonymous access type designating a specific tagged type T, T is
-called a controlling type of the formal_abstract_subprogram_declaration
-(*note 12.6: S0298.). A formal_abstract_subprogram_declaration (*note
-12.6: S0298.) shall have exactly one controlling type, and that type
-shall not be incomplete.
+12.6: S0298.) is of a specific tagged type <T> or of an anonymous access
+type designating a specific tagged type <T>, <T> is called a
+<controlling type> of the formal_abstract_subprogram_declaration (*note
+12.6: S0298.). Similarly, if the result of a
+formal_abstract_subprogram_declaration (*note 12.6: S0298.) for a
+function is of a specific tagged type <T> or of an anonymous access type
+designating a specific tagged type <T>, <T> is called a controlling type
+of the formal_abstract_subprogram_declaration (*note 12.6: S0298.). A
+formal_abstract_subprogram_declaration (*note 12.6: S0298.) shall have
+exactly one controlling type, and that type shall not be incomplete.
8.5/2
The actual subprogram for a formal_abstract_subprogram_declaration
@@ -27383,18 +27431,18 @@ a function or procedure, never an entry.
9.1/3
If a subtype_mark in the profile of the formal_subprogram_declaration
denotes a formal private or formal derived type and the actual type for
-this formal type is a class-wide type T'Class, then for the purposes of
-resolving the corresponding actual subprogram at the point of the
+this formal type is a class-wide type <T>'Class, then for the purposes
+of resolving the corresponding actual subprogram at the point of the
instantiation, certain implicit declarations may be available as
possible resolutions as follows:
9.2/3
- For each primitive subprogram of T that is directly visible at
- the point of the instantiation, and that has at least one
+ For each primitive subprogram of <T> that is directly visible
+ at the point of the instantiation, and that has at least one
controlling formal parameter, a corresponding implicitly
declared subprogram with the same defining name, and having
- the same profile as the primitive subprogram except that T is
- systematically replaced by T'Class in the types of its
+ the same profile as the primitive subprogram except that <T>
+ is systematically replaced by <T>'Class in the types of its
profile, is potentially use-visible. The body of such a
subprogram is as defined in *note 12.5.1:: for primitive
subprograms of a formal type when the actual type is
@@ -27415,8 +27463,8 @@ having the profile given in the
formal_subprogram_declaration (*note
10.2/2
The subprogram declared by a formal_abstract_subprogram_declaration
-(*note 12.6: S0298.) with a controlling type T is a dispatching
-operation of type T.
+(*note 12.6: S0298.) with a controlling type <T> is a dispatching
+operation of type <T>.
NOTES
@@ -27474,20 +27522,20 @@ operation of type T.
_Examples_
17
-Examples of generic formal subprograms:
+<Examples of generic formal subprograms:>
18/2
with function "+"(X, Y : Item) return Item is <>;
with function Image(X : Enum) return String is Enum'Image;
with procedure Update is Default_Update;
- with procedure Pre_Action(X : in Item) is null; -- defaults to no action
+ with procedure Pre_Action(X : in Item) is null; --< defaults to no
action>
with procedure Write(S : not null access Root_Stream_Type'Class;
Desc : Descriptor)
- is abstract Descriptor'Write; -- see *note 13.13.2::
- -- Dispatching operation on Descriptor with default
+ is abstract Descriptor'Write; --< see *note
13.13.2::>
+ --< Dispatching operation on Descriptor with default>
19
- -- given the generic procedure declaration
+ --< given the generic procedure declaration >
20
generic
@@ -27495,13 +27543,13 @@ Examples of generic formal subprograms:
procedure Iterate(Seq : in Item_Sequence);
21
- -- and the procedure
+ --< and the procedure >
22
procedure Put_Item(X : in Item);
23
- -- the following instantiation is possible
+ --< the following instantiation is possible >
24
procedure Put_List is new Iterate(Action => Put_Item);
@@ -27522,8 +27570,8 @@ package has to be an instance of that generic package.
2/3
formal_package_declaration ::=
- with package defining_identifier is new generic_package_name
- formal_package_actual_part
+ with package defining_identifier is new <generic_package_>
+ name formal_package_actual_part
[aspect_specification];
3/2
@@ -27536,7 +27584,7 @@ package has to be an instance of that generic package.
3.1/2
formal_package_association ::=
generic_association
- | generic_formal_parameter_selector_name => <>
+ | <generic_formal_parameter_>selector_name => <>
3.2/2
Any positional formal_package_associations shall precede any named
@@ -27545,12 +27593,12 @@ package has to be an instance of that generic package.
_Legality Rules_
4
-The generic_package_name shall denote a generic package (the template
-for the formal package); the formal package is an instance of the
-template.
+The <generic_package_>name shall denote a generic package (the
+<template> for the formal package); the formal package is an instance of
+the template.
4.1/3
-The generic_formal_parameter_selector_name of a
+The <generic_formal_parameter_>selector_name of a
formal_package_association shall denote a
generic_formal_parameter_declaration of the template. If two or more
formal subprograms of the template have the same defining name, then
@@ -27574,10 +27622,10 @@ generic formals of the template are as follows:
the template.
4.5/3
- * If a formal_package_association for a formal type T of the template
- is given by <>, then the formal_package_association for any other
- generic_formal_parameter_declaration of the template that mentions
- T directly or indirectly must be given by <> as well.
+ * If a formal_package_association for a formal type <T> of the
+ template is given by <>, then the formal_package_association for
+ any other generic_formal_parameter_declaration of the template that
+ mentions <T> directly or indirectly must be given by <> as well.
5/2
The actual shall be an instance of the template. If the
@@ -27607,7 +27655,7 @@ and the formal package are as follows:
7
* For a formal subtype, the actuals match if they denote statically
- matching subtypes.
+ matching subtypes.
8
* For other kinds of formals, the actuals match if they statically
@@ -27634,26 +27682,26 @@ declarations of the primitive subprograms of the
formal type are also
included in the visible part of the formal package.
11/2
-For the purposes of matching, if the actual instance A is itself a
-formal package, then the actual parameters of A are those specified
-explicitly or implicitly in the formal_package_actual_part for A, plus,
-for those not specified, the copies of the formal parameters of the
-template included in the visible part of A.
+For the purposes of matching, if the actual instance <A> is itself a
+formal package, then the actual parameters of <A> are those specified
+explicitly or implicitly in the formal_package_actual_part for <A>,
+plus, for those not specified, the copies of the formal parameters of
+the template included in the visible part of <A>.
_Examples_
12/2
-Example of a generic package with formal package parameters:
+<Example of a generic package with formal package parameters:>
13/2
- with Ada.Containers.Ordered_Maps; -- see *note A.18.6::
+ with Ada.Containers.Ordered_Maps; --< see *note A.18.6::>
generic
with package Mapping_1 is new Ada.Containers.Ordered_Maps(<>);
with package Mapping_2 is new Ada.Containers.Ordered_Maps
(Key_Type => Mapping_1.Element_Type,
others => <>);
package Ordered_Join is
- -- Provide a "join" between two mappings
+ --< Provide a "join" between two mappings>
14/2
subtype Key_Type is Mapping_1.Key_Type;
@@ -27667,7 +27715,7 @@ Example of a generic package with formal package
parameters:
end Ordered_Join;
17/2
-Example of an instantiation of a package with formal packages:
+<Example of an instantiation of a package with formal packages:>
18/2
with Ada.Containers.Ordered_Maps;
@@ -27713,7 +27761,7 @@ elements are provided as generic formal parameters.
_Examples_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3
generic
@@ -27857,18 +27905,18 @@ representation item and an operational aspect value
may be specified by
means of an operational item.
1/1
-There are six kinds of representation items: attribute_definition_clause
-(*note 13.3: S0310.)s for representation attributes,
-enumeration_representation_clause (*note 13.4: S0311.)s,
+There are six kinds of <representation items>:
+attribute_definition_clause (*note 13.3: S0310.)s for representation
+attributes, enumeration_representation_clause (*note 13.4: S0311.)s,
record_representation_clause (*note 13.5.1: S0313.)s, at_clauses,
-component_clauses, and representation pragmas. They can be provided to
-give more efficient representation or to interface with features that
+component_clauses, and <representation pragmas>. They can be provided
+to give more efficient representation or to interface with features that
are outside the domain of the language (for example, peripheral
hardware).
1.1/1
-An operational item is an attribute_definition_clause for an operational
-attribute.
+An <operational item> is an attribute_definition_clause for an
+operational attribute.
1.2/1
An operational item or a representation item applies to an entity
@@ -27887,11 +27935,11 @@ preceding a representation pragma in a compilation.
3
local_name ::= direct_name
| direct_name'attribute_designator
- | library_unit_name
+ | <library_unit_>name
4/1
A representation pragma is allowed only at places where an
- aspect_clause or compilation_unit is allowed.
+ aspect_clause or compilation_unit is allowed.
_Name Resolution Rules_
@@ -27903,7 +27951,7 @@ within the same declarative region as the item. If the
local_name has
an attribute_designator, then it shall resolve to denote an
implementation-defined component (see *note 13.5.1::) or a class-wide
type implicitly declared immediately within the same declarative region
-as the item. A local_name that is a library_unit_name (only permitted
+as the item. A local_name that is a <library_unit_>name (only permitted
in a representation pragma) shall resolve to denote the library_item
that immediately precedes (except for other pragmas) the representation
pragma.
@@ -27924,33 +27972,33 @@ resolve ambiguity in the presence of overloading);
otherwise, the
local_name shall not denote a renaming_declaration (*note 8.5: S0199.).
7/2
-The representation of an object consists of a certain number of bits
-(the size of the object). For an object of an elementary type, these
+The <representation> of an object consists of a certain number of bits
+(the <size> of the object). For an object of an elementary type, these
are the bits that are normally read or updated by the machine code when
loading, storing, or operating-on the value of the object. For an
object of a composite type, these are the bits reserved for this object,
and include bits occupied by subcomponents of the object. If the size
of an object is greater than that of its subtype, the additional bits
-are padding bits. For an elementary object, these padding bits are
+are padding bits. For an elementary object, these padding bits are
normally read and updated along with the others. For a composite
object, padding bits might not be read or updated in any given composite
operation, depending on the implementation.
8/3
-A representation item directly specifies a representation aspect of the
-entity denoted by the local_name, except in the case of a type-related
-representation item, whose local_name shall denote a first subtype, and
-which directly specifies an aspect of the subtype's type. A
-representation item that names a subtype is either subtype-specific
-(Size and Alignment clauses) or type-related (all others).
+A representation item <directly specifies> a <representation aspect> of
+the entity denoted by the local_name, except in the case of a
+type-related representation item, whose local_name shall denote a first
+subtype, and which directly specifies an aspect of the subtype's type.
+A representation item that names a subtype is either <subtype-specific>
+(Size and Alignment clauses) or <type-related> (all others).
Subtype-specific aspects may differ for different subtypes of the same
type.
8.1/3
-An operational item directly specifies an operational aspect of the
+An operational item <directly specifies> an <operational aspect> of the
entity denoted by the local_name, except in the case of a type-related
operational item, whose local_name shall denote a first subtype, and
-which directly specifies an aspect of the type of the subtype.
+which directly specifies an aspect of the type of the subtype.
9/4
A representation item that directly specifies an aspect of a subtype or
@@ -28008,7 +28056,7 @@ ancestor. The cases that cause conflicts are
implementation defined.
14
If two subtypes statically match, then their subtype-specific aspects
-(Size and Alignment) are the same.
+(Size and Alignment) are the same.
15/3
A derived type inherits each type-related representation aspect of its
@@ -28045,7 +28093,7 @@ user-defined primitive subprogram from its parent (see
*note 3.4::).
Each aspect of representation of an entity is as follows:
17
- * If the aspect is specified for the entity, meaning that it is
+ * If the aspect is <specified> for the entity, meaning that it is
either directly specified or inherited, then that aspect of the
entity is as specified, except in the case of Storage_Size, which
specifies a minimum.
@@ -28055,19 +28103,19 @@ Each aspect of representation of an entity is as
follows:
chosen by default in an unspecified manner.
18.1/1
-If an operational aspect is specified for an entity (meaning that it is
-either directly specified or inherited), then that aspect of the entity
-is as specified. Otherwise, the aspect of the entity has the default
-value for that aspect.
+If an operational aspect is <specified> for an entity (meaning that it
+is either directly specified or inherited), then that aspect of the
+entity is as specified. Otherwise, the aspect of the entity has the
+default value for that aspect.
18.2/3
An aspect_specification or representation item that specifies a
representation aspect that would have been chosen in the absence of the
-aspect_specification or representation item is said to be confirming.
-The aspect value specified in this case is said to be a confirming
+aspect_specification or representation item is said to be <confirming>.
+The aspect value specified in this case is said to be a <confirming>
representation aspect value. Other values of the aspect are said to be
-nonconfirming, as are the aspect_specifications and representation items
-that specified them.
+<nonconfirming>, as are the aspect_specifications and representation
+items that specified them.
_Dynamic Semantics_
@@ -28081,7 +28129,7 @@ it are evaluated.
An implementation may interpret representation aspects in an
implementation-defined manner. An implementation may place
implementation-defined restrictions on the specification of
-representation aspects. A recommended level of support is defined for
+representation aspects. A <recommended level of support> is defined for
the specification of representation aspects and related features in each
subclause. These recommendations are changed to requirements for
implementations that support the Systems Programming Annex (see *note
@@ -28137,7 +28185,7 @@ representation aspects is qualified as follows:
28/3
For purposes of these rules, the determination of whether specifying a
-representation aspect value for a type could cause an object to have
+representation aspect value for a type <could cause> an object to have
some property is based solely on the properties of the type itself, not
on any available information about how the type is used. In particular,
it presumes that minimally aligned objects of this type might be
@@ -28163,8 +28211,8 @@ File: arm2012.info, Node: 13.1.1, Up: 13.1
Certain representation or operational aspects of an entity may be
specified as part of its declaration using an aspect_specification,
rather than using a separate representation or operational item. The
-declaration with the aspect_specification is termed the associated
-declaration.
+declaration with the aspect_specification is termed the <associated
+declaration>.
_Syntax_
@@ -28174,7 +28222,7 @@ declaration.
aspect_mark [=> aspect_definition] }
3/3
- aspect_mark ::= aspect_identifier['Class]
+ aspect_mark ::= <aspect_>identifier['Class]
4/3
aspect_definition ::= name | expression | identifier
@@ -28183,7 +28231,7 @@ declaration.
5/3
An aspect_mark identifies an aspect of the entity defined by the
-associated declaration (the associated entity); the aspect denotes an
+associated declaration (the <associated entity>); the aspect denotes an
object, a value, an expression, a subprogram, or some other kind of
entity. If the aspect_mark identifies:
@@ -28272,13 +28320,13 @@ to have the value False for the derived type, unless
otherwise specified
in this International Standard.
18.2/4
-Certain type-related aspects are defined to be nonoverridable; all such
-aspects are specified using an aspect_definition that is a name.
+Certain type-related aspects are defined to be <nonoverridable>; all
+such aspects are specified using an aspect_definition that is a name.
18.3/4
-If a nonoverridable aspect is directly specified for a type T, then any
-explicit specification of that aspect for any other descendant of T
-shall be confirming; that is, the specified name shall match the
+If a nonoverridable aspect is directly specified for a type <T>, then
+any explicit specification of that aspect for any other descendant of
+<T> shall be <confirming>; that is, the specified name shall <match> the
inherited aspect, meaning that the specified name shall denote the same
declarations as would the inherited name.
@@ -28320,8 +28368,8 @@ aspect_definition specifies:
The identified aspect of the associated entity, or in some cases, the
view of the entity defined by the declaration, is as specified by the
aspect_definition (or by the default of True when boolean). Whether an
-aspect_specification applies to an entity or only to the particular view
-of the entity defined by the declaration is determined by the
+aspect_specification <applies> to an entity or only to the particular
+view of the entity defined by the declaration is determined by the
aspect_mark and the kind of entity. The following aspects are view
specific:
@@ -28336,21 +28384,21 @@ specific:
27/3
All other aspect_specifications are associated with the entity, and
-apply to all views of the entity, unless otherwise specified in this
+<apply> to all views of the entity, unless otherwise specified in this
International Standard.
28/4
-If the aspect_mark includes 'Class (a class-wide aspect), then, unless
+If the aspect_mark includes 'Class (a <class-wide aspect>), then, unless
specified otherwise for a particular class-wide aspect:
29/3
* if the associated entity is a tagged type, the specification
- applies to all descendants of the type;
+ <applies> to all descendants of the type;
30/3
* if the associated entity is a primitive subprogram of a tagged type
- T, the specification applies to the corresponding primitive
- subprogram of all descendants of T.
+ <T>, the specification <applies> to the corresponding primitive
+ subprogram of all descendants of <T>.
31/3
All specifiable operational and representation attributes may be
@@ -28374,7 +28422,7 @@ with specifiable attributes or representation pragmas
may be specified,
as specified elsewhere in this International Standard.
34/4
-This paragraph was deleted.
+<This paragraph was deleted.>
35/3
If a Legality Rule or Static Semantics rule only applies when a
@@ -28417,8 +28465,8 @@ The Pack aspect having the value True specifies that
storage
minimization should be the main criterion when selecting the
representation of a composite type.
-Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 4 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -28430,9 +28478,9 @@ language-defined representation aspect may be specified:
Pack
The type of aspect Pack is Boolean. When aspect Pack is
True for a type, the type (or the extension part) is said
- to be packed. For a type extension, the parent part is
+ to be <packed>. For a type extension, the parent part is
packed as for the parent type, and specifying Pack causes
- packing only of the extension part.
+ packing only of the extension part.
5.2/3
If directly specified, the aspect_definition shall be a
@@ -28448,7 +28496,7 @@ speed of accessing components, subject to reasonable
complexity in
addressing calculations.
6.1/4
-This paragraph was deleted.
+<This paragraph was deleted.>
7/3
The recommended level of support for the Pack aspect is:
@@ -28485,7 +28533,7 @@ File: arm2012.info, Node: 13.3, Next: 13.4, Prev:
13.2, Up: 13
1/1
The values of certain implementation-dependent characteristics can be
obtained by interrogating appropriate operational or representation
-attributes. Some of these attributes are specifiable via an
+attributes. Some of these attributes are specifiable via an
attribute_definition_clause.
_Syntax_
@@ -28505,7 +28553,7 @@ the form with a name shall be used.
4
For an attribute_definition_clause that specifies an attribute that
denotes a value or an object, the expected type for the expression or
-name is that of the attribute. For an attribute_definition_clause that
+name is that of the attribute. For an attribute_definition_clause that
specifies an attribute that denotes a subprogram, the expected profile
for the name is the profile required for the attribute. For an
attribute_definition_clause that specifies an attribute that denotes
@@ -28517,7 +28565,7 @@ the appropriate kind.
5/3
An attribute_designator is allowed in an attribute_definition_clause
only if this International Standard explicitly allows it, or for an
-implementation-defined attribute if the implementation allows it. Each
+implementation-defined attribute if the implementation allows it. Each
specifiable attribute constitutes an operational aspect or aspect of
representation; the name of the aspect is that of the attribute.
@@ -28525,24 +28573,24 @@ representation; the name of the aspect is that of the
attribute.
For an attribute_definition_clause that specifies an attribute that
denotes a subprogram, the profile shall be mode conformant with the one
required for the attribute, and the convention shall be Ada. Additional
-requirements are defined for particular attributes.
+requirements are defined for particular attributes.
_Static Semantics_
7/2
-A Size clause is an attribute_definition_clause whose
+A <Size clause> is an attribute_definition_clause whose
attribute_designator is Size. Similar definitions apply to the other
specifiable attributes.
8
-A storage element is an addressable element of storage in the machine. A
-word is the largest amount of storage that can be conveniently and
+A <storage element> is an addressable element of storage in the machine.
+A <word> is the largest amount of storage that can be conveniently and
efficiently manipulated by the hardware, given the implementation's
run-time model. A word consists of an integral number of storage
elements.
8.1/3
-A machine scalar is an amount of storage that can be conveniently and
+A <machine scalar> is an amount of storage that can be conveniently and
efficiently loaded, stored, or operated upon by the hardware. Machine
scalars consist of an integral number of storage elements. The set of
machine scalars is implementation defined, but includes at least the
@@ -28601,7 +28649,7 @@ The recommended level of support for the Address
attribute is:
subprograms.
18/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
19
* If the Address of an object is specified, or it is imported or
@@ -28629,17 +28677,17 @@ For a prefix X that denotes an object:
23/2
X'Alignment
- The value of this attribute is of type universal_integer,
- and nonnegative; zero means that the object is not
- necessarily aligned on a storage element boundary. If
- X'Alignment is not zero, then X is aligned on a storage
- unit boundary and X'Address is an integral multiple of
- X'Alignment (that is, the Address modulo the Alignment is
- zero).
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative; zero means that the
+ object is not necessarily aligned on a storage element
+ boundary. If X'Alignment is not zero, then X is aligned
+ on a storage unit boundary and X'Address is an integral
+ multiple of X'Alignment (that is, the Address modulo the
+ Alignment is zero).
24/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
25/2
Alignment may be specified for stand-alone objects via an
@@ -28649,15 +28697,15 @@ X'Alignment
26/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
26.1/2
For every subtype S:
26.2/2
S'Alignment
- The value of this attribute is of type universal_integer,
- and nonnegative.
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative.
26.3/2
For an object X of subtype S, if S'Alignment is not zero,
@@ -28685,8 +28733,8 @@ Alignment.
_Implementation Advice_
28.1/3
-For any tagged specific subtype S, S'Class'Alignment should equal
-S'Alignment.
+For any tagged specific subtype <S>, <S>'Class'Alignment should equal
+<S>'Alignment.
29
The recommended level of support for the Alignment attribute for
@@ -28723,7 +28771,7 @@ The recommended level of support for the Alignment
attribute for objects
is:
34/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
35
* For stand-alone library-level objects of statically constrained
@@ -28747,7 +28795,7 @@ is:
4 Alignment is a subtype-specific attribute.
37/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
38/3
5 A component_clause, Component_Size clause, or specifying the
@@ -28762,7 +28810,7 @@ For a prefix X that denotes an object:
X'Size
Denotes the size in bits of the representation of the
object. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
41
Size may be specified for stand-alone objects via an
@@ -28780,7 +28828,7 @@ the same as for subtypes (see below), except that only
a confirming Size
clause need be supported for an aliased elementary object.
43/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
_Static Semantics_
@@ -28805,9 +28853,9 @@ S'Size
48
If S is indefinite, the meaning is implementation
defined. The value of this attribute is of the type
- universal_integer. The Size of an object is at least as
- large as that of its subtype, unless the object's Size is
- determined by a Size clause, a component_clause, or a
+ <universal_integer>. The Size of an object is at least
+ as large as that of its subtype, unless the object's Size
+ is determined by a Size clause, a component_clause, or a
Component_Size clause. Size may be specified for first
subtypes via an attribute_definition_clause (*note 13.3:
S0310.); the expression of such a clause shall be static
@@ -28890,21 +28938,21 @@ dereference):
T'Storage_Size
Denotes the number of storage elements reserved for the
task. The value of this attribute is of the type
- universal_integer. The Storage_Size includes the size of
- the task's stack, if any. The language does not specify
- whether or not it includes other storage associated with
- the task (such as the "task control block" used by some
- implementations.) If the aspect Storage_Size is
- specified for the type of the object, the value of the
- Storage_Size attribute is at least the value determined
- by the aspect.
+ <universal_integer>. The Storage_Size includes the size
+ of the task's stack, if any. The language does not
+ specify whether or not it includes other storage
+ associated with the task (such as the "task control
+ block" used by some implementations.) If the aspect
+ Storage_Size is specified for the type of the object, the
+ value of the Storage_Size attribute is at least the value
+ determined by the aspect.
61/3
Aspect Storage_Size specifies the amount of storage to be reserved for
the execution of a task.
-Paragraphs 62 through 65 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 62 through 65 were moved to *note Annex J::, "*note Annex
+J:: Obsolescent Features".>
_Static Semantics_
@@ -28946,7 +28994,8 @@ implicit dereference):
69
X'Component_Size
Denotes the size in bits of components of the type of X.
- The value of this attribute is of type universal_integer.
+ The value of this attribute is of type
+ <universal_integer>.
70
Component_Size may be specified for array types via an
@@ -28983,7 +29032,7 @@ X'Has_Same_Storage
specification:
73.3/3
- function X'Has_Same_Storage (Arg : any_type)
+ function X'Has_Same_Storage (<Arg> : <any_type>)
return Boolean
73.4/4
@@ -29005,7 +29054,7 @@ X'Overlaps_Storage
specification:
73.7/3
- function X'Overlaps_Storage (Arg : any_type)
+ function X'Overlaps_Storage (<Arg> : <any_type>)
return Boolean
73.8/3
@@ -29033,7 +29082,7 @@ The following type-related operational attribute is
defined:
External_Tag.
74/1
-For every subtype S of a tagged type T (specific or class-wide):
+For every subtype S of a tagged type <T> (specific or class-wide):
75/3
S'External_Tag
@@ -29096,7 +29145,7 @@ declaration in the partition, the partition may be
rejected.
_Examples_
79
-Examples of attribute definition clauses:
+<Examples of attribute definition clauses:>
80
Byte : constant := 8;
@@ -29115,18 +29164,18 @@ Examples of attribute definition clauses:
for Short'Size use 15;
83
- for Car_Name'Storage_Size use -- specify access type's storage pool size
- 2000*((Car'Size/System.Storage_Unit) +1); -- approximately 2000
cars
+ for Car_Name'Storage_Size use --< specify access type's storage pool size>
+ 2000*((Car'Size/System.Storage_Unit) +1); --< approximately 2000
cars>
84/2
function My_Input(Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
return T;
- for T'Input use My_Input; -- see *note 13.13.2::
+ for T'Input use My_Input; --< see *note 13.13.2::>
NOTES
85
- 12 Notes on the examples: In the Size clause for Short, fifteen
+ 12 <Notes on the examples:> In the Size clause for Short, fifteen
bits is the minimum necessary, since the type definition requires
Short'Small <= 2**(-7).
@@ -29144,7 +29193,7 @@ enumeration literals.
2
enumeration_representation_clause ::=
- for first_subtype_local_name use enumeration_aggregate;
+ for <first_subtype_>local_name use enumeration_aggregate;
3
enumeration_aggregate ::= array_aggregate
@@ -29160,7 +29209,7 @@ expected to be of any integer type.
_Legality Rules_
5
-The first_subtype_local_name of an enumeration_representation_clause
+The <first_subtype_>local_name of an enumeration_representation_clause
shall denote an enumeration subtype.
6/2
@@ -29173,8 +29222,8 @@ predefined ordering relation of the type.
_Static Semantics_
7
-An enumeration_representation_clause specifies the coding aspect of
-representation. The coding consists of the internal code for each
+An enumeration_representation_clause specifies the <coding> aspect of
+representation. The coding consists of the <internal code> for each
enumeration literal, that is, the integral value used internally to
represent each literal.
@@ -29204,13 +29253,13 @@ is:
used for an enumeration type. The attributes of the type, such as
Succ, Pred, and Pos, are unaffected by the
enumeration_representation_clause. For example, Pos always returns
- the position number, not the internal integer code that might have
- been specified in an enumeration_representation_clause.
+ the position number, <not> the internal integer code that might
+ have been specified in an enumeration_representation_clause.
_Examples_
12
-Example of an enumeration representation clause:
+<Example of an enumeration representation clause:>
13
type Mix_Code is (ADD, SUB, MUL, LDA, STA, STZ);
@@ -29226,8 +29275,8 @@ File: arm2012.info, Node: 13.5, Next: 13.6, Prev:
13.4, Up: 13
==================
1
-The (record) layout aspect of representation consists of the storage
-places for some or all components, that is, storage place attributes of
+The <(record) layout> aspect of representation consists of the <storage
+places> for some or all components, that is, storage place attributes of
the components. The layout can be specified with a
record_representation_clause (*note 13.5.1: S0313.).
@@ -29246,29 +29295,29 @@ File: arm2012.info, Node: 13.5.1, Next: 13.5.2,
Up: 13.5
1
A record_representation_clause specifies the storage representation of
records and record extensions, that is, the order, position, and size of
-components (including discriminants, if any).
+components (including discriminants, if any).
_Syntax_
2
record_representation_clause ::=
- for first_subtype_local_name use
+ for <first_subtype_>local_name use
record [mod_clause]
{component_clause}
end record;
3
component_clause ::=
- component_local_name at position range first_bit .. last_bit;
+ <component_>local_name at position range first_bit .. last_bit;
4
- position ::= static_expression
+ position ::= <static_>expression
5
- first_bit ::= static_simple_expression
+ first_bit ::= <static_>simple_expression
6
- last_bit ::= static_simple_expression
+ last_bit ::= <static_>simple_expression
_Name Resolution Rules_
@@ -29279,14 +29328,14 @@ type.
_Legality Rules_
8/2
-The first_subtype_local_name of a record_representation_clause shall
+The <first_subtype_>local_name of a record_representation_clause shall
denote a specific record or record extension subtype.
9
-If the component_local_name is a direct_name, the local_name shall
+If the <component_>local_name is a direct_name, the local_name shall
denote a component of the type. For a record extension, the component
shall not be inherited, and shall not be a discriminant that corresponds
-to a discriminant of the parent type. If the component_local_name
+to a discriminant of the parent type. If the <component_>local_name
(*note 13.1: S0306.) has an attribute_designator (*note 4.1.4: S0101.),
the direct_name (*note 4.1: S0092.) of the local_name (*note 13.1:
S0306.) shall denote either the declaration of the type or a component
@@ -29319,7 +29368,7 @@ distinct variants of the same variant_part.
12
A name that denotes a component of a type is not allowed within a
record_representation_clause for the type, except as the
-component_local_name of a component_clause.
+<component_>local_name of a component_clause.
_Static Semantics_
@@ -29425,10 +29474,10 @@ The recommended level of support for
record_representation_clauses is:
_Examples_
24
-Example of specifying the layout of a record type:
+<Example of specifying the layout of a record type:>
25
- Word : constant := 4; -- storage element is byte, 4 bytes per word
+ Word : constant := 4; --< storage element is byte, 4 bytes per word>
26
type State is (A,M,W,P);
@@ -29456,10 +29505,10 @@ Example of specifying the layout of a record type:
for Program_Status_Word use
record
System_Mask at 0*Word range 0 .. 7;
- Protection_Key at 0*Word range 10 .. 11; -- bits 8,9 unused
+ Protection_Key at 0*Word range 10 .. 11; --< bits 8,9 unused>
Machine_State at 0*Word range 12 .. 15;
Interrupt_Cause at 0*Word range 16 .. 31;
- Ilc at 1*Word range 0 .. 1; -- second word
+ Ilc at 1*Word range 0 .. 1; --< second word>
Cc at 1*Word range 2 .. 3;
Program_Mask at 1*Word range 4 .. 7;
Inst_Address at 1*Word range 8 .. 31;
@@ -29472,7 +29521,7 @@ Example of specifying the layout of a record type:
NOTES
31
- 15 Note on the example: The record_representation_clause defines
+ 15 <Note on the example:> The record_representation_clause defines
the record layout. The Size clause guarantees that (at least)
eight storage elements are used for objects of the type. The
Alignment clause guarantees that aliased, imported, or exported
@@ -29487,8 +29536,8 @@ File: arm2012.info, Node: 13.5.2, Next: 13.5.3,
Prev: 13.5.1, Up: 13.5
_Static Semantics_
1
-For a component C of a composite, non-array object R, the storage place
-attributes are defined:
+For a component C of a composite, non-array object R, the <storage place
+attributes> are defined:
2/2
R.C'Position
@@ -29497,7 +29546,7 @@ R.C'Position
of C, denotes the value given for the position of the
component_clause; otherwise, denotes the same value as
R.C'Address - R'Address. The value of this attribute is
- of the type universal_integer.
+ of the type <universal_integer>.
3/2
R.C'First_Bit
@@ -29509,7 +29558,7 @@ R.C'First_Bit
of the first bit occupied by C. This offset is measured
in bits. The first bit of a storage element is numbered
zero. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
4/2
R.C'Last_Bit
@@ -29520,7 +29569,7 @@ R.C'Last_Bit
start of the first of the storage elements occupied by C,
of the last bit occupied by C. This offset is measured in
bits. The value of this attribute is of the type
- universal_integer.
+ <universal_integer>.
_Implementation Advice_
@@ -29547,10 +29596,10 @@ place attributes.
2
A bit ordering is a method of interpreting the meaning of the storage
-place attributes. High_Order_First (known in the vernacular as "big
+place attributes. High_Order_First (known in the vernacular as "big
endian") means that the first bit of a storage element (bit 0) is the
most significant bit (interpreting the sequence of bits that represent a
-component as an unsigned integer value). Low_Order_First (known in the
+component as an unsigned integer value). Low_Order_First (known in the
vernacular as "little endian") means the opposite: the first bit is the
least significant.
@@ -29560,8 +29609,8 @@ For every specific record subtype S, the following
attribute is defined:
4
S'Bit_Order
Denotes the bit ordering for the type of S. The value of
- this attribute is of type System.Bit_Order. Bit_Order may
- be specified for specific record types via an
+ this attribute is of type System.Bit_Order. Bit_Order
+ may be specified for specific record types via an
attribute_definition_clause; the expression of such a
clause shall be static.
@@ -29569,7 +29618,7 @@ S'Bit_Order
If Word_Size = Storage_Unit, the default bit ordering is implementation
defined. If Word_Size > Storage_Unit, the default bit ordering is the
same as the ordering of storage elements in a word, when interpreted as
-an integer.
+an integer.
6
The storage place attributes of a component of a type are interpreted
@@ -29616,17 +29665,17 @@ effect a change in representation.
_Examples_
3
-Example of change of representation:
+<Example of change of representation:>
4
- -- Packed_Descriptor and Descriptor are two different types
- -- with identical characteristics, apart from their
- -- representation
+ --< Packed_Descriptor and Descriptor are two different types>
+ --< with identical characteristics, apart from their>
+ --< representation>
5
type Descriptor is
record
- -- components of a descriptor
+ --< components of a descriptor>
end record;
6
@@ -29635,19 +29684,19 @@ Example of change of representation:
7
for Packed_Descriptor use
record
- -- component clauses for some or for all components
+ --< component clauses for some or for all components>
end record;
8
- -- Change of representation can now be accomplished by explicit type
conversions:
+ <-- Change of representation can now be accomplished by explicit type
conversions:>
9
D : Descriptor;
P : Packed_Descriptor;
10
- P := Packed_Descriptor(D); -- pack D
- D := Descriptor(P); -- unpack P
+ P := Packed_Descriptor(D); --< pack D>
+ D := Descriptor(P); --< unpack P>
File: arm2012.info, Node: 13.7, Next: 13.8, Prev: 13.6, Up: 13
@@ -29670,45 +29719,45 @@ The following language-defined library package exists:
pragma Pure(System);
4
- type Name is implementation-defined-enumeration-type;
- System_Name : constant Name := implementation-defined;
+ type Name is <implementation-defined-enumeration-type>;
+ System_Name : constant Name := <implementation-defined>;
5
- -- System-Dependent Named Numbers:
+ --< System-Dependent Named Numbers:>
6
- Min_Int : constant := root_integer'First;
- Max_Int : constant := root_integer'Last;
+ Min_Int : constant := <root_integer>'First;
+ Max_Int : constant := <root_integer>'Last;
7
- Max_Binary_Modulus : constant := implementation-defined;
- Max_Nonbinary_Modulus : constant := implementation-defined;
+ Max_Binary_Modulus : constant := <implementation-defined>;
+ Max_Nonbinary_Modulus : constant := <implementation-defined>;
8
- Max_Base_Digits : constant := root_real'Digits;
- Max_Digits : constant := implementation-defined;
+ Max_Base_Digits : constant := <root_real>'Digits;
+ Max_Digits : constant := <implementation-defined>;
9
- Max_Mantissa : constant := implementation-defined;
- Fine_Delta : constant := implementation-defined;
+ Max_Mantissa : constant := <implementation-defined>;
+ Fine_Delta : constant := <implementation-defined>;
10
- Tick : constant := implementation-defined;
+ Tick : constant := <implementation-defined>;
11
- -- Storage-related Declarations:
+ --< Storage-related Declarations:>
12
- type Address is implementation-defined;
+ type Address is <implementation-defined>;
Null_Address : constant Address;
13
- Storage_Unit : constant := implementation-defined;
- Word_Size : constant := implementation-defined * Storage_Unit;
- Memory_Size : constant := implementation-defined;
+ Storage_Unit : constant := <implementation-defined>;
+ Word_Size : constant := <implementation-defined> * Storage_Unit;
+ Memory_Size : constant := <implementation-defined>;
14/3
- -- Address Comparison:
+ --< Address Comparison:>
function "<" (Left, Right : Address) return Boolean
with Convention => Intrinsic;
function "<="(Left, Right : Address) return Boolean
@@ -29720,18 +29769,18 @@ The following language-defined library package exists:
function "=" (Left, Right : Address) return Boolean
with Convention => Intrinsic;
-- function "/=" (Left, Right : Address) return Boolean;
- -- "/=" is implicitly defined
+ --< "/=" is implicitly defined>
15/2
- -- Other System-Dependent Declarations:
+ --< Other System-Dependent Declarations:>
type Bit_Order is (High_Order_First, Low_Order_First);
- Default_Bit_Order : constant Bit_Order := implementation-defined;
+ Default_Bit_Order : constant Bit_Order := <implementation-defined>;
16
- -- Priority-related declarations (see *note D.1::):
- subtype Any_Priority is Integer range implementation-defined;
+ --< Priority-related declarations (see *note D.1::):>
+ subtype Any_Priority is Integer range <implementation-defined>;
subtype Priority is Any_Priority range Any_Priority'First ..
- implementation-defined;
+ <implementation-defined>;
subtype Interrupt_Priority is Any_Priority range Priority'Last+1 ..
Any_Priority'Last;
@@ -29741,7 +29790,7 @@ The following language-defined library package exists:
18
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System;
19
@@ -29750,8 +29799,8 @@ alternative machine configurations handled by the
implementation.
System_Name represents the current machine configuration.
20
-The named numbers Fine_Delta and Tick are of the type universal_real;
-the others are of the type universal_integer.
+The named numbers Fine_Delta and Tick are of the type <universal_real>;
+the others are of the type <universal_integer>.
21
The meanings of the named numbers are:
@@ -29831,7 +29880,7 @@ Memory_Size
Address is a definite, nonlimited type with preelaborable initialization
(see *note 10.2.1::). Address represents machine addresses capable of
addressing individual storage elements. Null_Address is an address that
-is distinct from the address of any object or program unit.
+is distinct from the address of any object or program unit.
35/2
Default_Bit_Order shall be a static constant. See *note 13.5.3:: for an
@@ -29877,20 +29926,20 @@ The following language-defined library package exists:
pragma Pure(Storage_Elements);
3
- type Storage_Offset is range implementation-defined;
+ type Storage_Offset is range <implementation-defined>;
4
subtype Storage_Count is Storage_Offset range 0..Storage_Offset'Last;
5
- type Storage_Element is mod implementation-defined;
+ type Storage_Element is mod <implementation-defined>;
for Storage_Element'Size use Storage_Unit;
type Storage_Array is array
(Storage_Offset range <>) of aliased Storage_Element;
for Storage_Array'Component_Size use Storage_Unit;
6
- -- Address Arithmetic:
+ --< Address Arithmetic:>
7/3
function "+"(Left : Address; Right : Storage_Offset) return Address
@@ -29908,10 +29957,10 @@ The following language-defined library package exists:
with Convention => Intrinsic;
9
- -- Conversion to/from integers:
+ --< Conversion to/from integers:>
10/3
- type Integer_Address is implementation-defined;
+ type Integer_Address is <implementation-defined>;
function To_Address(Value : Integer_Address) return Address
with Convention => Intrinsic;
function To_Integer(Value : Address) return Integer_Address
@@ -29923,7 +29972,7 @@ The following language-defined library package exists:
12
Storage_Element represents a storage element. Storage_Offset represents
an offset in storage elements. Storage_Count represents a number of
-storage elements. Storage_Array represents a contiguous sequence of
+storage elements. Storage_Array represents a contiguous sequence of
storage elements.
13
@@ -29937,7 +29986,7 @@ Storage_Offset'Last shall be greater than or equal to
Integer'Last or
the largest possible storage offset, whichever is smaller.
Storage_Offset'First shall be <= (-Storage_Offset'Last).
-Paragraph 15 was deleted.
+<Paragraph 15 was deleted.>
_Implementation Advice_
@@ -29978,9 +30027,9 @@ The following language-defined generic library package
exists:
The To_Pointer and To_Address subprograms convert back and forth between
values of types Object_Pointer and Address. To_Pointer(X'Address) is
equal to X'Unchecked_Access for any X that allows Unchecked_Access.
-To_Pointer(Null_Address) returns null. For other addresses, the behavior
-is unspecified. To_Address(null) returns Null_Address. To_Address(Y),
-where Y /= null, returns Y.all'Address.
+To_Pointer(Null_Address) returns null. For other addresses, the
+behavior is unspecified. To_Address(null) returns Null_Address.
+To_Address(Y), where Y /= null, returns Y.all'Address.
_Implementation Permissions_
@@ -30065,7 +30114,7 @@ implementation is not required to provide package
System.Machine_Code.
_Examples_
12
-Example of a code statement:
+<Example of a code statement:>
13/3
M : Mask;
@@ -30074,10 +30123,10 @@ Example of a code statement:
14
procedure Set_Mask is
- use System.Machine_Code; -- assume "with System.Machine_Code;" appears
somewhere above
+ use System.Machine_Code; --< assume "with System.Machine_Code;" appears
somewhere above>
begin
SI_Format'(Code => SSM, B => M'Base_Reg, D => M'Disp);
- -- Base_Reg and Disp are implementation-defined attributes
+ --< Base_Reg and Disp are implementation-defined attributes>
end Set_Mask;
@@ -30170,7 +30219,7 @@ The recommended level of support for unchecked
conversions is:
17/3
* Unchecked conversions should be supported and should be reversible
- in the cases where this subclause defines the result. To enable
+ in the cases where this subclause defines the result. To enable
meaningful use of unchecked conversion, a contiguous representation
should be used for elementary subtypes, for statically constrained
array subtypes whose component subtype is one of the subtypes
@@ -30191,13 +30240,13 @@ File: arm2012.info, Node: 13.9.1, Next: 13.9.2,
Up: 13.9
1
Certain actions that can potentially lead to erroneous execution are not
-directly erroneous, but instead can cause objects to become abnormal.
+directly erroneous, but instead can cause objects to become <abnormal>.
Subsequent uses of abnormal objects can be erroneous.
2
-A scalar object can have an invalid representation, which means that the
-object's representation does not represent any value of the object's
-subtype. The primary cause of invalid representations is uninitialized
+A scalar object can have an <invalid representation>, which means that
+the object's representation does not represent any value of the object's
+subtype. The primary cause of invalid representations is uninitialized
variables.
3
@@ -30209,9 +30258,9 @@ subclause.
4
When an object is first created, and any explicit or default
initializations have been performed, the object and all of its parts are
-in the normal state. Subsequent operations generally leave them normal.
-However, an object or part of an object can become abnormal in the
-following ways:
+in the <normal> state. Subsequent operations generally leave them
+normal. However, an object or part of an object can become <abnormal>
+in the following ways:
5
* An assignment to the object is disrupted due to an abort (see *note
@@ -30254,13 +30303,13 @@ object.
9
If the representation of a scalar object does not represent a value of
the object's subtype (perhaps because the object was not initialized),
-the object is said to have an invalid representation. It is a bounded
-error to evaluate the value of such an object. If the error is detected,
-either Constraint_Error or Program_Error is raised. Otherwise,
-execution continues using the invalid representation. The rules of the
-language outside this subclause assume that all objects have valid
-representations. The semantics of operations on invalid representations
-are as follows:
+the object is said to have an <invalid representation>. It is a bounded
+error to evaluate the value of such an object. If the error is
+detected, either Constraint_Error or Program_Error is raised.
+Otherwise, execution continues using the invalid representation. The
+rules of the language outside this subclause assume that all objects
+have valid representations. The semantics of operations on invalid
+representations are as follows:
10
* If the representation of the object represents a value of the
@@ -30279,13 +30328,13 @@ are as follows:
A call to an imported function or an instance of Unchecked_Conversion is
erroneous if the result is scalar, the result object has an invalid
representation, and the result is used other than as the expression of
-an assignment_statement or an object_declaration, as the object_name of
-an object_renaming_declaration, or as the prefix of a Valid attribute.
-If such a result object is used as the source of an assignment, and the
-assigned value is an invalid representation for the target of the
-assignment, then any use of the target object prior to a further
-assignment to the target object, other than as the prefix of a Valid
-attribute reference, is erroneous.
+an assignment_statement or an object_declaration, as the <object_>name
+of an object_renaming_declaration, or as the prefix of a Valid
+attribute. If such a result object is used as the source of an
+assignment, and the assigned value is an invalid representation for the
+target of the assignment, then any use of the target object prior to a
+further assignment to the target object, other than as the prefix of a
+Valid attribute reference, is erroneous.
13/3
The dereference of an access value is erroneous if it does not designate
@@ -30401,7 +30450,7 @@ X'Unchecked_Access
3.10.2::) apply also to X'Unchecked_Access, except that,
for the purposes of accessibility rules and checks, it is
as if X were declared immediately within a library
- package.
+ package.
NOTES
@@ -30431,7 +30480,7 @@ can share the same pool.
2/2
A storage pool is a variable of a type in the class rooted at
Root_Storage_Pool, which is an abstract limited controlled type. By
-default, the implementation chooses a standard storage pool for each
+default, the implementation chooses a <standard storage pool> for each
access-to-object type. The user may define new pool types, and may
override the choice of pool for an access-to-object type by specifying
Storage_Pool for the type.
@@ -30478,13 +30527,13 @@ The following language-defined library package exists:
10
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Storage_Pools;
11
-A storage pool type (or pool type) is a descendant of Root_Storage_Pool.
-The elements of a storage pool are the objects allocated in the pool by
-allocators.
+A <storage pool type> (or <pool type>) is a descendant of
+Root_Storage_Pool. The <elements> of a storage pool are the objects
+allocated in the pool by allocators.
12/2
For every access-to-object subtype S, the following representation
@@ -30501,7 +30550,7 @@ S'Storage_Size
Storage_Size(S'Storage_Pool), which is intended to be a
measure of the number of storage elements reserved for
the pool. The type of this attribute is
- universal_integer.
+ <universal_integer>.
15
Storage_Size or Storage_Pool may be specified for a nonderived
@@ -30509,8 +30558,8 @@ access-to-object type via an
attribute_definition_clause (*note 13.3:
S0310.); the name in a Storage_Pool clause shall denote a variable.
16/3
-An allocator of a type T that does not support subpools allocates
-storage from T's storage pool. If the storage pool is a user-defined
+An allocator of a type <T> that does not support subpools allocates
+storage from <T>'s storage pool. If the storage pool is a user-defined
object, then the storage is allocated by calling Allocate as described
below. Allocators for types that support subpools are described in
*note 13.11.4::.
@@ -30518,23 +30567,23 @@ below. Allocators for types that support subpools
are described in
17
If Storage_Pool is not specified for a type defined by an
access_to_object_definition, then the implementation chooses a standard
-storage pool for it in an implementation-defined manner. In this case,
+storage pool for it in an implementation-defined manner. In this case,
the exception Storage_Error is raised by an allocator if there is not
enough storage. It is implementation defined whether or not the
implementation provides user-accessible names for the standard pool
type(s).
18/4
-If Storage_Size is specified for an access type T, an
-implementation-defined pool P is used for the type. The Storage_Size of
-P is at least that requested, and the storage for P is reclaimed when
-the master containing the declaration of the access type is left. If the
-implementation cannot satisfy the request, Storage_Error is raised at
-the freezing point of type T. The storage pool P is used only for
-allocators returning type T or other access types specified to use
-T'Storage_Pool. Storage_Error is raised by an allocator returning such
-a type if the storage space of P is exhausted (additional memory is not
-allocated).
+If Storage_Size is specified for an access type <T>, an
+implementation-defined pool <P> is used for the type. The Storage_Size
+of <P> is at least that requested, and the storage for <P> is reclaimed
+when the master containing the declaration of the access type is left.
+If the implementation cannot satisfy the request, Storage_Error is
+raised at the freezing point of type <T>. The storage pool <P> is used
+only for allocators returning type <T> or other access types specified
+to use <T>'Storage_Pool. Storage_Error is raised by an allocator
+returning such a type if the storage space of <P> is exhausted
+(additional memory is not allocated).
18.1/4
If neither Storage_Pool nor Storage_Size are specified, then the meaning
@@ -30565,58 +30614,60 @@ any other manner, then the program execution is
erroneous.
_Implementation Requirements_
21.1/3
-The Allocate procedure of a user-defined storage pool object P may be
-called by the implementation only to allocate storage for a type T whose
-pool is P, only at the following points:
+The Allocate procedure of a user-defined storage pool object <P> may be
+called by the implementation only to allocate storage for a type <T>
+whose pool is <P>, only at the following points:
21.2/3
- * During the execution of an allocator of type T;
+ * During the execution of an allocator of type <T>;
21.3/3
* During the execution of a return statement for a function whose
- result is built-in-place in the result of an allocator of type T;
+ result is built-in-place in the result of an allocator of type <T>;
21.4/3
* During the execution of an assignment operation with a target of an
- allocated object of type T with a part that has an unconstrained
+ allocated object of type <T> with a part that has an unconstrained
discriminated subtype with defaults.
21.5/3
-For each of the calls of Allocate described above, P (equivalent to
-T'Storage_Pool) is passed as the Pool parameter. The
+For each of the calls of Allocate described above, <P> (equivalent to
+<T>'Storage_Pool) is passed as the Pool parameter. The
Size_In_Storage_Elements parameter indicates the number of storage
elements to be allocated, and is no more than
-D'Max_Size_In_Storage_Elements, where D is the designated subtype of T.
-The Alignment parameter is a nonzero integral multiple of D'Alignment if
-D is a specific type, and otherwise is a nonzero integral multiple of
-the alignment of the specific type identified by the tag of the object
-being created; it is unspecified if there is no such value. The
-Alignment parameter is no more than D'Max_Alignment_For_Allocation. The
-result returned in the Storage_Address parameter is used as the address
-of the allocated storage, which is a contiguous block of memory of
+<D>'Max_Size_In_Storage_Elements, where <D> is the designated subtype of
+<T>. The Alignment parameter is a nonzero integral multiple of
+<D>'Alignment if <D> is a specific type, and otherwise is a nonzero
+integral multiple of the alignment of the specific type identified by
+the tag of the object being created; it is unspecified if there is no
+such value. The Alignment parameter is no more than
+<D>'Max_Alignment_For_Allocation. The result returned in the
+Storage_Address parameter is used as the address of the allocated
+storage, which is a contiguous block of memory of
Size_In_Storage_Elements storage elements. Any exception propagated by
Allocate is propagated by the construct that contained the call.
21.6/3
The number of calls to Allocate needed to implement an allocator for any
-particular type is unspecified. The number of calls to Deallocate needed
-to implement an instance of Unchecked_Deallocation (see *note 13.11.2::)
-for any particular object is the same as the number of Allocate calls
-for that object.
+particular type is unspecified. The number of calls to Deallocate
+needed to implement an instance of Unchecked_Deallocation (see *note
+13.11.2::) for any particular object is the same as the number of
+Allocate calls for that object.
21.7/3
-The Deallocate procedure of a user-defined storage pool object P may be
-called by the implementation to deallocate storage for a type T whose
-pool is P only at the places when an Allocate call is allowed for P,
-during the execution of an instance of Unchecked_Deallocation for T, or
-as part of the finalization of the collection of T. For such a call of
-Deallocate, P (equivalent to T'Storage_Pool) is passed as the Pool
-parameter. The value of the Storage_Address parameter for a call to
-Deallocate is the value returned in the Storage_Address parameter of the
-corresponding successful call to Allocate. The values of the
-Size_In_Storage_Elements and Alignment parameters are the same values
-passed to the corresponding Allocate call. Any exception propagated by
-Deallocate is propagated by the construct that contained the call.
+The Deallocate procedure of a user-defined storage pool object <P> may
+be called by the implementation to deallocate storage for a type <T>
+whose pool is <P> only at the places when an Allocate call is allowed
+for <P>, during the execution of an instance of Unchecked_Deallocation
+for <T>, or as part of the finalization of the collection of <T>. For
+such a call of Deallocate, <P> (equivalent to <T>'Storage_Pool) is
+passed as the Pool parameter. The value of the Storage_Address
+parameter for a call to Deallocate is the value returned in the
+Storage_Address parameter of the corresponding successful call to
+Allocate. The values of the Size_In_Storage_Elements and Alignment
+parameters are the same values passed to the corresponding Allocate
+call. Any exception propagated by Deallocate is propagated by the
+construct that contained the call.
_Documentation Requirements_
@@ -30738,14 +30789,14 @@ the following is a possible use:
type Mark_Release_Pool_Type
(Pool_Size : Storage_Elements.Storage_Count)
is new Subpools.Root_Storage_Pool_With_Subpools with private;
- -- As defined in package MR_Pool, see *note 13.11.6::
+ -- <As defined in package MR_Pool, see *note 13.11.6::>
40
...
41/3
Our_Pool : Mark_Release_Pool_Type (Pool_Size => 2000);
- My_Mark : MR_Pool.Subpool_Handle; -- See *note 13.11.6::
+ My_Mark : MR_Pool.Subpool_Handle; -- <See *note 13.11.6::>
42/3
type Acc is access ...;
@@ -30754,8 +30805,8 @@ the following is a possible use:
43/3
My_Mark := Mark(Our_Pool);
- ... -- Allocate objects using "new (My_Mark) Designated(...)".
- Release(My_Mark); -- Finalize objects and reclaim storage.
+ ... --< Allocate objects using "new (My_Mark) Designated(...)".>
+ Release(My_Mark); --< Finalize objects and reclaim storage.>
* Menu:
@@ -30787,14 +30838,14 @@ S'Max_Size_In_Storage_Elements
that could be requested by the implementation via
Allocate for an access type whose designated subtype is
S. The value of this attribute is of type
- universal_integer.
+ <universal_integer>.
4/3
S'Max_Alignment_For_Allocation
Denotes the maximum value for Alignment that could be
requested by the implementation via Allocate for an
access type whose designated subtype is S. The value of
- this attribute is of type universal_integer.
+ this attribute is of type <universal_integer>.
5/3
For a type with access discriminants, if the implementation allocates
@@ -30832,7 +30883,7 @@ The following language-defined generic library
procedure exists:
A call on an instance of Unchecked_Deallocation is illegal if the actual
access type of the instance is a type for which the Storage_Size has
been specified by a static expression with value zero or is defined by
-the language to be zero. In addition to the places where Legality Rules
+the language to be zero. In addition to the places where Legality Rules
normally apply (see *note 12.3::), this rule applies also in the private
part of an instance of a generic unit.
@@ -30844,7 +30895,7 @@ Given an instance of Unchecked_Deallocation declared as
follows:
5
procedure Free is
new Ada.Unchecked_Deallocation(
- object_subtype_name, access_to_variable_subtype_name);
+ <object_subtype_name>, <access_to_variable_subtype_name>);
6
Procedure Free has the following effect:
@@ -30894,14 +30945,14 @@ task) is not reclaimed prior to task termination.
15.1/4
An access value that designates a nonexistent object is called a
-dangling reference.
+<dangling reference>.
15.2/4
If a dangling reference is dereferenced (implicitly or explicitly),
execution is erroneous (see below). If there is no explicit or implicit
dereference, then it is a bounded error to evaluate an expression whose
result is a dangling reference. If the error is detected, either
-Constraint_Error or Program_Error is raised. Otherwise, execution
+Constraint_Error or Program_Error is raised. Otherwise, execution
proceeds normally, but with the possibility that the access value
designates some other existing object.
@@ -30956,7 +31007,7 @@ pool or storage size for an access type.
pragma Default_Storage_Pool (storage_pool_indicator);
3.1/4
- storage_pool_indicator ::= storage_pool_name | null | Standard
+ storage_pool_indicator ::= <storage_pool_>name | null | Standard
3.2/3
A pragma Default_Storage_Pool is allowed immediately within the
@@ -30966,12 +31017,13 @@ pool or storage size for an access type.
_Name Resolution Rules_
3.3/3
-The storage_pool_name is expected to be of type Root_Storage_Pool'Class.
+The <storage_pool_>name is expected to be of type
+Root_Storage_Pool'Class.
_Legality Rules_
4/3
-The storage_pool_name shall denote a variable.
+The <storage_pool_>name shall denote a variable.
4.1/4
The Standard storage_pool_indicator is an identifier specific to a
@@ -30983,7 +31035,7 @@ visible at the point of the pragma, other than package
Standard itself.
4.2/4
If the pragma is used as a configuration pragma, the
storage_pool_indicator shall be either null or Standard, and it defines
-the default pool to be the given storage_pool_indicator within all
+the <default pool> to be the given storage_pool_indicator within all
applicable compilation units (see *note 10.1.5::), except within the
immediate scope of another pragma Default_Storage_Pool. Otherwise, the
pragma occurs immediately within a sequence of declarations, and it
@@ -31045,7 +31097,7 @@ the standard storage pool is used for the type as
described in *note
13.11::.
7/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Implementation Permissions_
@@ -31099,7 +31151,7 @@ The following language-defined library package exists:
return not null Subpool_Handle is abstract;
8/3
- -- The following operations are intended for pool implementers:
+ -- <The following operations are intended for pool implementers:>
9/3
function Pool_of_Subpool (Subpool : not null Subpool_Handle)
@@ -31154,27 +31206,27 @@ The following language-defined library package exists:
17/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Storage_Pools.Subpools;
18/3
-A subpool is a separately reclaimable portion of a storage pool,
-identified by an object of type Subpool_Handle (a subpool handle). A
-subpool handle also identifies the enclosing storage pool, a storage
-pool that supports subpools, which is a storage pool whose type is
+A <subpool> is a separately reclaimable portion of a storage pool,
+identified by an object of type Subpool_Handle (a <subpool handle>). A
+subpool handle also identifies the enclosing storage pool, a <storage
+pool that supports subpools>, which is a storage pool whose type is
descended from Root_Storage_Pool_With_Subpools. A subpool is created by
calling Create_Subpool or a similar constructor; the constructor returns
the subpool handle.
19/3
-A subpool object is an object of a type descended from Root_Subpool.
+A <subpool object> is an object of a type descended from Root_Subpool.
Typically, subpool objects are managed by the containing storage pool;
only the handles need be exposed to clients of the storage pool.
Subpool objects are designated by subpool handles, and are the run-time
representation of a subpool.
20/4
-Each subpool belongs to a single storage pool (which will always be a
+Each subpool <belongs> to a single storage pool (which will always be a
pool that supports subpools). An access to the pool that a subpool
belongs to can be obtained by calling Pool_of_Subpool with the subpool
handle. Set_Pool_of_Subpool causes the subpool of the subpool handle to
@@ -31189,7 +31241,7 @@ When an allocator for a type whose storage pool
supports subpools is
evaluated, a call is made on Allocate_From_Subpool passing in a
Subpool_Handle, in addition to the parameters as defined for calls on
Allocate (see *note 13.11::). The subpool designated by the
-subpool_handle_name is used, if specified in an allocator. Otherwise,
+<subpool_handle_>name is used, if specified in an allocator. Otherwise,
Default_Subpool_for_Pool of the Pool is used to provide a subpool
handle. All requirements on the Allocate procedure also apply to
Allocate_from_Subpool.
@@ -31198,8 +31250,8 @@ Allocate_from_Subpool.
22/3
If a storage pool that supports subpools is specified as the
-Storage_Pool for an access type, the access type is called a subpool
-access type. A subpool access type shall be a pool-specific access
+Storage_Pool for an access type, the access type is called a <subpool
+access type>. A subpool access type shall be a pool-specific access
type.
23/3
@@ -31208,7 +31260,7 @@ deeper than that of the storage pool object. If the
specified storage
pool object is a storage pool that supports subpools, then the name that
denotes the object shall not denote part of a formal parameter, nor
shall it denote part of a dereference of a value of a non-library-level
-general access type. In addition to the places where Legality Rules
+general access type. In addition to the places where Legality Rules
normally apply (see *note 12.3::), these rules also apply in the private
part of an instance of a generic unit.
@@ -31364,14 +31416,14 @@ classic Mark/Release pool using subpools:
3/3
use System.Storage_Pools;
- -- For uses of Subpools.
+ -- <For uses of Subpools.>
use System.Storage_Elements;
- -- For uses of Storage_Count and Storage_Array.
+ -- <For uses of Storage_Count and Storage_Array.>
4/3
- -- Mark and Release work in a stack fashion, and allocations are not
allowed
- -- from a subpool other than the one at the top of the stack. This is
also
- -- the default pool.
+ -- <Mark and Release work in a stack fashion, and allocations are not
allowed>
+ -- <from a subpool other than the one at the top of the stack. This is
also>
+ -- <the default pool.>
5/3
subtype Subpool_Handle is Subpools.Subpool_Handle;
@@ -31441,7 +31493,7 @@ classic Mark/Release pool using subpools:
procedure Initialize (Pool : in out Mark_Release_Pool_Type);
18/3
- -- We don't need Finalize.
+ -- <We don't need Finalize.>
19/3
end MR_Pool;
@@ -31454,7 +31506,7 @@ classic Mark/Release pool using subpools:
22/3
procedure Initialize (Pool : in out Mark_Release_Pool_Type) is
- -- Initialize the first default subpool.
+ -- <Initialize the first default subpool.>
begin
Pool.Markers(1).Start := 1;
Subpools.Set_Pool_of_Subpool
@@ -31464,12 +31516,12 @@ classic Mark/Release pool using subpools:
23/3
function Create_Subpool (Pool : in out Mark_Release_Pool_Type)
return not null Subpool_Handle is
- -- Mark the current allocation location.
+ -- <Mark the current allocation location.>
begin
if Pool.Current_Pool = Subpool_Indexes'Last then
- raise Storage_Error; -- No more subpools.
+ raise Storage_Error; -- <No more subpools.>
end if;
- Pool.Current_Pool := Pool.Current_Pool + 1; -- Move to the next
subpool
+ Pool.Current_Pool := Pool.Current_Pool + 1; -- <Move to the next
subpool>
24/3
return Result : constant not null Subpool_Handle :=
@@ -31486,12 +31538,12 @@ classic Mark/Release pool using subpools:
Subpool : in out Subpool_Handle) is
begin
if Subpool /= Pool.Markers(Pool.Current_Pool)'Unchecked_Access then
- raise Program_Error; -- Only the last marked subpool can be
released.
+ raise Program_Error; -- <Only the last marked subpool can be
released.>
end if;
if Pool.Current_Pool /= 1 then
Pool.Next_Allocation := Pool.Markers(Pool.Current_Pool).Start;
- Pool.Current_Pool := Pool.Current_Pool - 1; -- Move to the
previous subpool
- else -- Reinitialize the default subpool:
+ Pool.Current_Pool := Pool.Current_Pool - 1; -- <Move to the
previous subpool>
+ else -- <Reinitialize the default subpool:>
Pool.Next_Allocation := 1;
Subpools.Set_Pool_of_Subpool
(Pool.Markers(1)'Unchecked_Access, Pool);
@@ -31514,20 +31566,20 @@ classic Mark/Release pool using subpools:
Subpool : not null Subpool_Handle) is
begin
if Subpool /= Pool.Markers(Pool.Current_Pool)'Unchecked_Access then
- raise Program_Error; -- Only the last marked subpool can be used
for allocations.
+ raise Program_Error; -- <Only the last marked subpool can be
used for allocations.>
end if;
28/4
- -- Check for the maximum supported alignment, which is the
alignment of the storage area:
+ -- <Check for the maximum supported alignment, which is the
alignment of the storage area:>
if Alignment > Pool.Storage'Alignment then
raise Program_Error;
end if;
- -- Correct the alignment if necessary:
+ -- <Correct the alignment if necessary:>
Pool.Next_Allocation := Pool.Next_Allocation +
((-Pool.Next_Allocation) mod Alignment);
if Pool.Next_Allocation + Size_In_Storage_Elements >
Pool.Pool_Size then
- raise Storage_Error; -- Out of space.
+ raise Storage_Error; -- <Out of space.>
end if;
Storage_Address := Pool.Storage (Pool.Next_Allocation)'Address;
Pool.Next_Allocation :=
@@ -31558,8 +31610,8 @@ facilitate the construction of simpler run-time
environments.
pragma Restrictions(restriction{, restriction});
4/2
- restriction ::= restriction_identifier
- | restriction_parameter_identifier =>
+ restriction ::= <restriction_>identifier
+ | <restriction_parameter_>identifier =>
restriction_parameter_argument
4.1/2
@@ -31577,7 +31629,7 @@ is expected to be of any integer type.
Unless otherwise specified for a particular restriction, the expression
shall be static, and its value shall be nonnegative.
-Paragraph 7 was deleted.
+<Paragraph 7 was deleted.>
_Post-Compilation Rules_
@@ -31649,16 +31701,16 @@ restriction.
The form of a pragma Profile is as follows:
11/3
- pragma Profile (profile_identifier {, profile_
+ pragma Profile (<profile_>identifier {, <profile_>
pragma_argument_association});
_Legality Rules_
12/3
-The profile_identifier shall be the name of a usage profile. The
-semantics of any profile_pragma_argument_association (*note 2.8:
+The <profile_>identifier shall be the name of a usage profile. The
+semantics of any <profile_>pragma_argument_association (*note 2.8:
S0020.)s are defined by the usage profile specified by the
-profile_identifier.
+<profile_>identifier.
_Static Semantics_
@@ -31705,7 +31757,7 @@ File: arm2012.info, Node: 13.12.1, Up: 13.12
_Static Semantics_
1/2
-The following restriction_identifiers are language defined (additional
+The following <restriction_>identifiers are language defined (additional
restrictions are defined in the Specialized Needs Annexes):
1.1/3
@@ -31820,7 +31872,7 @@ No_Obsolescent_Features
environment, not the entire partition.
5/3
-The following restriction_parameter_identifiers are language defined:
+The following <restriction_parameter_>identifiers are language defined:
6/2
No_Dependence
@@ -31873,14 +31925,14 @@ restriction.
_Static Semantics_
9/3
-The following profile_identifier is language defined:
+The following <profile_>identifier is language defined:
10/3
No_Implementation_Extensions
11/3
For usage profile No_Implementation_Extensions, there shall be no
-profile_pragma_argument_associations.
+<profile_>pragma_argument_associations.
12/3
The No_Implementation_Extensions usage profile is equivalent to the
@@ -31900,9 +31952,9 @@ File: arm2012.info, Node: 13.13, Next: 13.14, Prev:
13.12, Up: 13
=============
1
-A stream is a sequence of elements comprising values from possibly
+A <stream> is a sequence of elements comprising values from possibly
different types and allowing sequential access to these values. A
-stream type is a type in the class whose root type is
+<stream type> is a type in the class whose root type is
Streams.Root_Stream_Type. A stream type may be implemented in various
ways, such as an external sequential file, an internal buffer, or a
network channel.
@@ -31941,8 +31993,8 @@ can call the Read and Write attributes of other types.)
pragma Preelaborable_Initialization(Root_Stream_Type);
4/1
- type Stream_Element is mod implementation-defined;
- type Stream_Element_Offset is range implementation-defined;
+ type Stream_Element is mod <implementation-defined>;
+ type Stream_Element_Offset is range <implementation-defined>;
subtype Stream_Element_Count is
Stream_Element_Offset range 0..Stream_Element_Offset'Last;
type Stream_Element_Array is
@@ -31961,7 +32013,7 @@ can call the Read and Write attributes of other types.)
7
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Streams;
8/2
@@ -32007,7 +32059,7 @@ stream.
_Static Semantics_
1.1/2
-For every subtype S of an elementary type T, the following
+For every subtype S of an elementary type <T>, the following
representation attribute is defined:
1.2/3
@@ -32015,14 +32067,15 @@ S'Stream_Size
Denotes the number of bits read from or written to a
stream by the default implementations of S'Read and
S'Write. Hence, the number of stream elements required
- per item of elementary type T is:
+ per item of elementary type <T> is:
1.3/2
- T'Stream_Size / Ada.Streams.Stream_Element'Size
+ <T>'Stream_Size / Ada.Streams.Stream_Element'Size
1.4/2
- The value of this attribute is of type universal_integer
- and is a multiple of Stream_Element'Size.
+ The value of this attribute is of type
+ <universal_integer> and is a multiple of
+ Stream_Element'Size.
1.5/2
Stream_Size may be specified for first subtypes via an
@@ -32044,16 +32097,16 @@ The recommended level of support for the Stream_Size
attribute is:
1.8/2
* A Stream_Size clause should be supported for a discrete or fixed
- point type T if the specified Stream_Size is a multiple of
+ point type <T> if the specified Stream_Size is a multiple of
Stream_Element'Size and is no less than the size of the first
- subtype of T, and no greater than the size of the largest type of
+ subtype of <T>, and no greater than the size of the largest type of
the same elementary class (signed integer, modular integer,
enumeration, ordinary fixed point, or decimal fixed point).
_Static Semantics_
2
-For every subtype S of a specific type T, the following attributes are
+For every subtype S of a specific type <T>, the following attributes are
defined.
3
@@ -32063,11 +32116,11 @@ S'Write
4/2
procedure S'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
5
- S'Write writes the value of Item to Stream.
+ S'Write writes the value of <Item> to <Stream>.
6
S'Read
@@ -32076,16 +32129,16 @@ S'Read
7/2
procedure S'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>)
8
- S'Read reads the value of Item from Stream.
+ S'Read reads the value of <Item> from <Stream>.
8.1/3
For an untagged derived type, the Write (resp. Read) attribute is
inherited according to the rules given in *note 13.1:: if the attribute
-is specified and available for the parent type at the point where T is
+is specified and available for the parent type at the point where <T> is
declared. For a tagged derived type, these attributes are not
inherited, but rather the default implementations are used.
@@ -32095,33 +32148,33 @@ available, execute as follows:
9/3
For elementary types, Read reads (and Write writes) the number of stream
-elements implied by the Stream_Size for the type T; the representation
+elements implied by the Stream_Size for the type <T>; the representation
of those stream elements is implementation defined. For composite
types, the Write or Read attribute for each component is called in
canonical order, which is last dimension varying fastest for an array
(unless the convention of the array is Fortran, in which case it is
first dimension varying fastest), and positional aggregate order for a
-record. Bounds are not included in the stream if T is an array type.
-If T is a discriminated type, discriminants are included only if they
-have defaults. If T is a tagged type, the tag is not included. For
+record. Bounds are not included in the stream if <T> is an array type.
+If <T> is a discriminated type, discriminants are included only if they
+have defaults. If <T> is a tagged type, the tag is not included. For
type extensions, the Write or Read attribute for the parent type is
called, followed by the Write or Read attribute of each component of the
extension part, in canonical order. For a limited type extension, if
-the attribute of the parent type or any progenitor type of T is
-available anywhere within the immediate scope of T, and the attribute of
-the parent type or the type of any of the extension components is not
-available at the freezing point of T, then the attribute of T shall be
-directly specified.
+the attribute of the parent type or any progenitor type of <T> is
+available anywhere within the immediate scope of <T>, and the attribute
+of the parent type or the type of any of the extension components is not
+available at the freezing point of <T>, then the attribute of <T> shall
+be directly specified.
9.1/3
-If T is a discriminated type and its discriminants have defaults, then
+If <T> is a discriminated type and its discriminants have defaults, then
S'Read first reads the discriminants from the stream without modifying
-Item. S'Read then creates an object of type T constrained by these
+<Item>. S'Read then creates an object of type <T> constrained by these
discriminants. The value of this object is then converted to the
-subtype of Item and is assigned to Item. Finally, the Read attribute
-for each nondiscriminant component of Item is called in canonical order
-as described above. Normal default initialization and finalization take
-place for the created object.
+subtype of <Item> and is assigned to <Item>. Finally, the Read
+attribute for each nondiscriminant component of <Item> is called in
+canonical order as described above. Normal default initialization and
+finalization take place for the created object.
9.2/3
Constraint_Error is raised by the predefined Write attribute if the
@@ -32134,7 +32187,7 @@ the first subtype would require more than Stream_Size
bits; otherwise,
the range is signed.
10
-For every subtype S'Class of a class-wide type T'Class:
+For every subtype S'Class of a class-wide type <T>'Class:
11
S'Class'Write
@@ -32143,8 +32196,8 @@ S'Class'Write
12/2
procedure S'Class'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
13
Dispatches to the subprogram denoted by the Write
@@ -32158,20 +32211,20 @@ S'Class'Read
15/2
procedure S'Class'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>'Class)
16
Dispatches to the subprogram denoted by the Read
attribute of the specific type identified by the tag of
Item.
-Paragraph 17 was deleted.
+<Paragraph 17 was deleted.>
_Static Semantics_
18
-For every subtype S of a specific type T, the following attributes are
+For every subtype S of a specific type <T>, the following attributes are
defined.
19
@@ -32181,12 +32234,12 @@ S'Output
20/2
procedure S'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
21
- S'Output writes the value of Item to Stream, including
- any bounds or discriminants.
+ S'Output writes the value of <Item> to <Stream>,
+ including any bounds or discriminants.
22
S'Input
@@ -32195,18 +32248,18 @@ S'Input
23/2
function S'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>
24
- S'Input reads and returns one value from Stream, using
+ S'Input reads and returns one value from <Stream>, using
any bounds or discriminants written by a corresponding
S'Output to determine how much to read.
25/3
For an untagged derived type, the Output (resp. Input) attribute is
inherited according to the rules given in *note 13.1:: if the attribute
-is specified and available for the parent type at the point where T is
+is specified and available for the parent type at the point where <T> is
declared. For a tagged derived type, these attributes are not
inherited, but rather the default implementations are used.
@@ -32215,28 +32268,28 @@ The default implementations of the Output and Input
attributes, where
available, execute as follows:
26/3
- * If T is an array type, S'Output first writes the bounds, and
- S'Input first reads the bounds. If T has discriminants without
+ * If <T> is an array type, S'Output first writes the bounds, and
+ S'Input first reads the bounds. If <T> has discriminants without
defaults, S'Output first writes the discriminants (using the Write
attribute of the discriminant type for each), and S'Input first
reads the discriminants (using the Read attribute of the
discriminant type for each).
27/3
- * S'Output then calls S'Write to write the value of Item to the
- stream. S'Input then creates an object of type T, with the bounds
- or (when without defaults) the discriminants, if any, taken from
- the stream, passes it to S'Read, and returns the value of the
- object. If T has discriminants, then this object is unconstrained
- if and only the discriminants have defaults. Normal default
- initialization and finalization take place for this object (see
- *note 3.3.1::, *note 7.6::, and *note 7.6.1::).
+ * S'Output then calls S'Write to write the value of <Item> to the
+ stream. S'Input then creates an object of type <T>, with the
+ bounds or (when without defaults) the discriminants, if any, taken
+ from the stream, passes it to S'Read, and returns the value of the
+ object. If <T> has discriminants, then this object is
+ unconstrained if and only the discriminants have defaults. Normal
+ default initialization and finalization take place for this object
+ (see *note 3.3.1::, *note 7.6::, and *note 7.6.1::).
27.1/2
-If T is an abstract type, then S'Input is an abstract function.
+If <T> is an abstract type, then S'Input is an abstract function.
28
-For every subtype S'Class of a class-wide type T'Class:
+For every subtype S'Class of a class-wide type <T>'Class:
29
S'Class'Output
@@ -32245,14 +32298,14 @@ S'Class'Output
30/2
procedure S'Class'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
31/2
- First writes the external tag of Item to Stream (by
- calling String'Output(Stream,
- Tags.External_Tag(Item'Tag)) -- see *note 3.9::) and then
- dispatches to the subprogram denoted by the Output
+ First writes the external tag of <Item> to <Stream> (by
+ calling String'Output(<Stream>,
+ Tags.External_Tag(<Item>'Tag)) -- see *note 3.9::) and
+ then dispatches to the subprogram denoted by the Output
attribute of the specific type identified by the tag.
Tag_Error is raised if the tag of Item identifies a type
declared at an accessibility level deeper than that of S.
@@ -32264,13 +32317,13 @@ S'Class'Input
33/2
function S'Class'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T'Class
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>'Class
34/3
- First reads the external tag from Stream and determines
+ First reads the external tag from <Stream> and determines
the corresponding internal tag (by calling
- Tags.Descendant_Tag(String'Input(Stream), S'Tag) which
+ Tags.Descendant_Tag(String'Input(<Stream>), S'Tag) which
might raise Tag_Error -- see *note 3.9::) and then
dispatches to the subprogram denoted by the Input
attribute of the specific type identified by the internal
@@ -32282,7 +32335,7 @@ S'Class'Input
In the default implementation of Read and Input for a composite type,
for each scalar component that is a discriminant or that has an implicit
initial value, a check is made that the value returned by Read for the
-component belongs to its subtype. Constraint_Error is raised if this
+component belongs to its subtype. Constraint_Error is raised if this
check fails. For other scalar components, no check is made. For each
component that is of an access type, if the implementation can detect
that the value returned by Read for the component is not a value of its
@@ -32313,9 +32366,9 @@ stream-oriented attributes may be specified using an
aspect_specification on any type_declaration, with the aspect name being
the corresponding attribute name. Each of the class-wide
stream-oriented attributes may be specified using an
-aspect_specification for a tagged type T using the name of the
+aspect_specification for a tagged type <T> using the name of the
stream-oriented attribute followed by 'Class; such class-wide aspects do
-not apply to other descendants of T.
+not apply to other descendants of <T>.
38.1/4
The subprogram name given in such an attribute_definition_clause (*note
@@ -32327,26 +32380,26 @@ attribute_definition_clause or aspect_specification
shall statically
denote a null procedure.
39/2
-A stream-oriented attribute for a subtype of a specific type T is
-available at places where one of the following conditions is true:
+A stream-oriented attribute for a subtype of a specific type <T> is
+<available> at places where one of the following conditions is true:
40/2
- * T is nonlimited.
+ * <T> is nonlimited.
41/2
- * The attribute_designator is Read (resp. Write) and T is a limited
- record extension, and the attribute Read (resp. Write) is
- available for the parent type of T and for the types of all of the
- extension components.
+ * The attribute_designator is Read (resp. Write) and <T> is a
+ limited record extension, and the attribute Read (resp. Write) is
+ available for the parent type of <T> and for the types of all of
+ the extension components.
42/2
- * T is a limited untagged derived type, and the attribute was
+ * <T> is a limited untagged derived type, and the attribute was
inherited for the type.
43/2
- * The attribute_designator is Input (resp. Output), and T is a
+ * The attribute_designator is Input (resp. Output), and <T> is a
limited type, and the attribute Read (resp. Write) is available
- for T.
+ for <T>.
44/2
* The attribute has been specified via an
@@ -32354,11 +32407,11 @@ available at places where one of the following
conditions is true:
visible.
45/2
-A stream-oriented attribute for a subtype of a class-wide type T'Class
+A stream-oriented attribute for a subtype of a class-wide type <T>'Class
is available at places where one of the following conditions is true:
46/2
- * T is nonlimited;
+ * <T> is nonlimited;
47/2
* the attribute has been specified via an
@@ -32366,15 +32419,15 @@ is available at places where one of the following
conditions is true:
visible; or
48/2
- * the corresponding attribute of T is available, provided that if T
- has a partial view, the corresponding attribute is available at the
- end of the visible part where T is declared.
+ * the corresponding attribute of <T> is available, provided that if
+ <T> has a partial view, the corresponding attribute is available at
+ the end of the visible part where <T> is declared.
49/4
An attribute_reference for one of the stream-oriented attributes is
illegal unless the attribute is available at the place of the
-attribute_reference. Furthermore, an attribute_reference for T'Input is
-illegal if T is an abstract type. In addition to the places where
+attribute_reference. Furthermore, an attribute_reference for <T>'Input
+is illegal if <T> is an abstract type. In addition to the places where
Legality Rules normally apply (see *note 12.3::), these rules also apply
in the private part of an instance of a generic unit.
@@ -32387,17 +32440,17 @@ raises Program_Error and performs no other action.
50/3
In the parameter_and_result_profiles for the default implementations of
the stream-oriented attributes, the subtype of the Item parameter is the
-base subtype of T if T is a scalar type, and the first subtype
+base subtype of <T> if <T> is a scalar type, and the first subtype
otherwise. The same rule applies to the result of the Input attribute.
51/3
For an attribute_definition_clause specifying one of these attributes,
-the subtype of the Item parameter shall be the first subtype or the base
-subtype if scalar, and the first subtype if not scalar. The same rule
-applies to the result of the Input function.
+the subtype of the <Item> parameter shall be the first subtype or the
+base subtype if scalar, and the first subtype if not scalar. The same
+rule applies to the result of the Input function.
52/3
-A type is said to support external streaming if Read and Write
+A type is said to <support external streaming> if Read and Write
attributes are provided for sending values of such a type between active
partitions, with Write marshalling the representation, and Read
unmarshalling the representation. A limited type supports external
@@ -32421,10 +32474,10 @@ execution is erroneous.
_Implementation Requirements_
54/1
-For every subtype S of a language-defined nonlimited specific type T,
-the output generated by S'Output or S'Write shall be readable by S'Input
-or S'Read, respectively. This rule applies across partitions if the
-implementation conforms to the Distributed Systems Annex.
+For every subtype <S> of a language-defined nonlimited specific type
+<T>, the output generated by S'Output or S'Write shall be readable by
+S'Input or S'Read, respectively. This rule applies across partitions if
+the implementation conforms to the Distributed Systems Annex.
55/3
If Constraint_Error is raised during a call to Read because of failure
@@ -32445,15 +32498,15 @@ explicitly in the program text, possibly through a
generic instantiation
(see *note 12.3::).
56.1/3
-If T is a discriminated type and its discriminants have defaults, then
+If <T> is a discriminated type and its discriminants have defaults, then
in two cases an execution of the default implementation of S'Read is not
-required to create an anonymous object of type T: If the discriminant
+required to create an anonymous object of type <T>: If the discriminant
values that are read in are equal to the corresponding discriminant
-values of Item, then no object of type T need be created and Item may be
-used instead. If they are not equal and Item is a constrained variable,
-then Constraint_Error may be raised at that point, before any further
-values are read from the stream and before the object of type T is
-created.
+values of <Item>, then no object of type <T> need be created and <Item>
+may be used instead. If they are not equal and <Item> is a constrained
+variable, then Constraint_Error may be raised at that point, before any
+further values are read from the stream and before the object of type
+<T> is created.
56.2/3
A default implementation of S'Input that calls the default
@@ -32463,11 +32516,11 @@ discriminants that match those in the stream.
NOTES
57
- 40 For a definite subtype S of a type T, only T'Write and T'Read
- are needed to pass an arbitrary value of the subtype through a
- stream. For an indefinite subtype S of a type T, T'Output and
- T'Input will normally be needed, since T'Write and T'Read do not
- pass bounds, discriminants, or tags.
+ 40 For a definite subtype S of a type <T>, only <T>'Write and
+ <T>'Read are needed to pass an arbitrary value of the subtype
+ through a stream. For an indefinite subtype S of a type <T>,
+ <T>'Output and <T>'Input will normally be needed, since <T>'Write
+ and <T>'Read do not pass bounds, discriminants, or tags.
58
41 User-specified attributes of S'Class are not inherited by other
@@ -32476,7 +32529,7 @@ discriminants that match those in the stream.
_Examples_
59
-Example of user-defined Write attribute:
+<Example of user-defined Write attribute:>
60/2
procedure My_Write(
@@ -32499,23 +32552,23 @@ forbid certain kinds of uses of an entity in the
region of text where it
is frozen.
2
-The freezing of an entity occurs at one or more places (freezing points)
-in the program text where the representation for the entity has to be
-fully determined. Each entity is frozen from its first freezing point
-to the end of the program text (given the ordering of compilation units
-defined in *note 10.1.4::).
+The <freezing> of an entity occurs at one or more places (<freezing
+points>) in the program text where the representation for the entity has
+to be fully determined. Each entity is frozen from its first freezing
+point to the end of the program text (given the ordering of compilation
+units defined in *note 10.1.4::).
2.1/3
This subclause also defines a place in the program text where the
-profile of each declared callable entity becomes frozen. A use of a
+profile of each declared callable entity becomes <frozen>. A use of a
callable entity causes freezing of its profile in some contexts, as
described below. At the place where the profile of a callable entity
becomes frozen, the entity itself becomes frozen.
3/4
The end of a declarative_part, protected_body, or a declaration of a
-library package or generic library package, causes freezing of each
-entity and profile declared within it, except for incomplete types. A
+library package or generic library package, causes <freezing> of each
+entity and profile declared within it, except for incomplete types. A
proper_body, body_stub, or entry_body causes freezing of each entity and
profile declared before it within the same declarative_part that is not
an incomplete type; it only causes freezing of an incomplete type if the
@@ -32523,7 +32576,7 @@ body is within the immediate scope of the incomplete
type.
4/1
A construct that (explicitly or implicitly) references an entity can
-cause the freezing of the entity, as defined by subsequent paragraphs.
+cause the <freezing> of the entity, as defined by subsequent paragraphs.
At the place where a construct causes freezing, each name, expression,
implicit_dereference, or range within the construct causes freezing:
@@ -32541,7 +32594,7 @@ implicit_dereference, or range within the construct
causes freezing:
freezing.
5.2/4
- * At the occurrence of a renames-as-body whose callable_entity_name
+ * At the occurrence of a renames-as-body whose <callable_entity_>name
denotes an expression function, the return expression of the
expression function causes freezing.
@@ -32567,7 +32620,7 @@ implicit_dereference, or range within the construct
causes freezing:
8/4
A static expression (other than within an aspect_specification) causes
-freezing where it occurs. An object name or nonstatic expression causes
+freezing where it occurs. An object name or nonstatic expression causes
freezing where it occurs, unless the name or expression is part of a
default_expression, a default_name, the return expression of an
expression function, an aspect_specification, or a per-object expression
@@ -32581,8 +32634,8 @@ frozen by an explicit call. This is true even if the
implicit call is
removed via implementation permissions.
8.2/1
-If an expression is implicitly converted to a type or subtype T, then at
-the place where the expression causes freezing, T is frozen.
+If an expression is implicitly converted to a type or subtype <T>, then
+at the place where the expression causes freezing, <T> is frozen.
9
The following rules define which entities are frozen at the place where
@@ -32641,11 +32694,11 @@ a construct causes freezing:
entry family, the index subtype of the family is frozen.
15
- * At the place where a subtype is frozen, its type is frozen. At the
+ * At the place where a subtype is frozen, its type is frozen. At the
place where a type is frozen, any expressions or names within the
full type definition cause freezing; the first subtype, and any
component subtypes, index subtypes, and parent subtype of the type
- are frozen as well. For a specific tagged type, the corresponding
+ are frozen as well. For a specific tagged type, the corresponding
class-wide type is frozen as well. For a class-wide type, the
corresponding specific type is frozen as well.
@@ -32737,9 +32790,9 @@ Ada, Interfaces, and System; other library units are
children of these:
Indefinite_Ordered_Maps -- *note A.18.14::
Indefinite_Ordered_Sets -- *note A.18.16::
Indefinite_Vectors -- *note
- A.18.11::Standard (...continued)
- Ada (...continued)
- Containers (...continued)
+ A.18.11::Standard (<...continued>)
+ Ada (<...continued>)
+ Containers (<...continued>)
Multiway_Trees -- *note A.18.10::
Ordered_Maps -- *note A.18.6::
Ordered_Sets -- *note A.18.9::
@@ -32778,8 +32831,8 @@ Ada, Interfaces, and System; other library units are
children of these:
IO_Exceptions -- *note A.13::
Iterator_Interfaces -- *note 5.5.1::
Locales -- *note A.19::
- Standard (...continued)
- Ada (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
Numerics -- *note A.5::
Complex_Arrays -- *note G.3.2::
Complex_Elementary_Functions -- *note G.1.2::
@@ -32827,9 +32880,9 @@ Ada, Interfaces, and System; other library units are
children of these:
Strings -- *note A.4.11::
Wide_Strings -- *note A.4.11::
Wide_Wide_Strings -- *note A.4.11::
- Standard (...continued)
- Ada (...continued)
- Strings (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
+ Strings (<...continued>)
Wide_Bounded -- *note A.4.7::
Wide_Equal_Case_Insensitive
-- *note A.4.7::
@@ -32878,8 +32931,8 @@ Ada, Interfaces, and System; other library units are
children of these:
Synchronous_Barriers -- *note D.10.1::
Synchronous_Task_Control -- *note D.10::
EDF -- *note D.10::
- Standard (...continued)
- Ada (...continued)
+ Standard (<...continued>)
+ Ada (<...continued>)
Tags -- *note 3.9::
Generic_Dispatching_Constructor -- *note 3.9::
Task_Attributes -- *note C.7.2::
@@ -32989,14 +33042,15 @@ A.1 The Package Standard
1/3
This subclause outlines the specification of the package Standard
-containing all predefined identifiers in the language. The corresponding
-package body is not specified by the language.
+containing all predefined identifiers in the language. The
+corresponding package body is not specified by the language.
2
The operators that are predefined for the types declared in the package
Standard are given in comments since they are implicitly declared.
-Italics are used for pseudo-names of anonymous types (such as root_real)
-and for undefined information (such as implementation-defined).
+Italics are used for pseudo-names of anonymous types (such as
+<root_real>) and for undefined information (such as
+<implementation-defined>).
_Static Semantics_
@@ -33011,7 +33065,7 @@ The library package Standard has the following
declaration:
type Boolean is (False, True);
6
- -- The predefined relational operators for this type are as follows:
+ --< The predefined relational operators for this type are as follows:>
7/1
-- function "=" (Left, Right : Boolean'Base) return Boolean;
@@ -33022,8 +33076,8 @@ The library package Standard has the following
declaration:
-- function ">=" (Left, Right : Boolean'Base) return Boolean;
8
- -- The predefined logical operators and the predefined logical
- -- negation operator are as follows:
+ --< The predefined logical operators and the predefined logical>
+ --< negation operator are as follows:>
9/1
-- function "and" (Left, Right : Boolean'Base) return Boolean'Base;
@@ -33034,18 +33088,18 @@ The library package Standard has the following
declaration:
-- function "not" (Right : Boolean'Base) return Boolean'Base;
11/2
- -- The integer type root_integer and the
- -- corresponding universal type universal_integer are predefined.
+ --< The integer type root_integer and the>
+ --< corresponding universal type universal_integer are predefined.>
12
- type Integer is range implementation-defined;
+ type Integer is range <implementation-defined>;
13
subtype Natural is Integer range 0 .. Integer'Last;
subtype Positive is Integer range 1 .. Integer'Last;
14
- -- The predefined operators for type Integer are as follows:
+ --< The predefined operators for type Integer are as follows:>
15
-- function "=" (Left, Right : Integer'Base) return Boolean;
@@ -33073,22 +33127,22 @@ The library package Standard has the following
declaration:
-- return Integer'Base;
19
- -- The specification of each operator for the type
- -- root_integer, or for any additional predefined integer
- -- type, is obtained by replacing Integer by the name of the type
- -- in the specification of the corresponding operator of the type
- -- Integer. The right operand of the exponentiation operator
- -- remains as subtype Natural.
+ --< The specification of each operator for the type>
+ --< root_integer, or for any additional predefined integer>
+ --< type, is obtained by replacing Integer by the name of the type>
+ --< in the specification of the corresponding operator of the type>
+ --< Integer. The right operand of the exponentiation operator>
+ --< remains as subtype Natural.>
20/2
- -- The floating point type root_real and the
- -- corresponding universal type universal_real are predefined.
+ --< The floating point type root_real and the>
+ --< corresponding universal type universal_real are predefined.>
21
- type Float is digits implementation-defined;
+ type Float is digits <implementation-defined>;
22
- -- The predefined operators for this type are as follows:
+ --< The predefined operators for this type are as follows:>
23
-- function "=" (Left, Right : Float) return Boolean;
@@ -33113,138 +33167,138 @@ The library package Standard has the following
declaration:
-- function "**" (Left : Float; Right : Integer'Base) return Float;
27
- -- The specification of each operator for the type root_real, or for
- -- any additional predefined floating point type, is obtained by
- -- replacing Float by the name of the type in the specification of the
- -- corresponding operator of the type Float.
+ --< The specification of each operator for the type root_real, or for>
+ --< any additional predefined floating point type, is obtained by>
+ --< replacing Float by the name of the type in the specification of
the>
+ --< corresponding operator of the type Float.>
28
- -- In addition, the following operators are predefined for the root
- -- numeric types:
+ --< In addition, the following operators are predefined for the root>
+ --< numeric types:>
29
- function "*" (Left : root_integer; Right : root_real)
- return root_real;
+ function "*" (Left : <root_integer>; Right : <root_real>)
+ return <root_real>;
30
- function "*" (Left : root_real; Right : root_integer)
- return root_real;
+ function "*" (Left : <root_real>; Right : <root_integer>)
+ return <root_real>;
31
- function "/" (Left : root_real; Right : root_integer)
- return root_real;
+ function "/" (Left : <root_real>; Right : <root_integer>)
+ return <root_real>;
32
- -- The type universal_fixed is predefined.
- -- The only multiplying operators defined between
- -- fixed point types are
+ --< The type universal_fixed is predefined.>
+ --< The only multiplying operators defined between>
+ --< fixed point types are>
33
- function "*" (Left : universal_fixed; Right : universal_fixed)
- return universal_fixed;
+ function "*" (Left : <universal_fixed>; Right : <universal_fixed>)
+ return <universal_fixed>;
34
- function "/" (Left : universal_fixed; Right : universal_fixed)
- return universal_fixed;
+ function "/" (Left : <universal_fixed>; Right : <universal_fixed>)
+ return <universal_fixed>;
34.1/2
- -- The type universal_access is predefined.
- -- The following equality operators are predefined:
+ --< The type universal_access is predefined.>
+ --< The following equality operators are predefined:>
34.2/2
- function "=" (Left, Right: universal_access) return Boolean;
- function "/=" (Left, Right: universal_access) return Boolean;
+ function "=" (Left, Right: <universal_access>) return Boolean;
+ function "/=" (Left, Right: <universal_access>) return Boolean;
35/3
- -- The declaration of type Character is based on the standard ISO
8859-1 character set.
+ --< The declaration of type Character is based on the standard ISO
8859-1 character set.>
- -- There are no character literals corresponding to the positions
for control characters.
- -- They are indicated in italics in this definition. See *note
3.5.2::.
+ --< There are no character literals corresponding to the positions
for control characters.>
+ --< They are indicated in italics in this definition. See *note
3.5.2::.>
type Character is
- (nul, soh, stx, etx, eot, enq, ack, bel, --0
(16#00#) .. 7 (16#07#)
- bs, ht, lf, vt, ff, cr, so, si, --8 (16#08#) .. 15
(16#0F#)
+ (<nul>, <soh>, <stx>, <etx>, <eot>, <enq>, <ack>,
<bel>, --<0 (16#00#) .. 7 (16#07#)>
+ <bs>, <ht>, <lf>, <vt>, <ff>, <cr>, <so>, <si>,
--<8 (16#08#) .. 15 (16#0F#)>
- dle, dc1, dc2, dc3, dc4, nak, syn, etb, --16
(16#10#) .. 23 (16#17#)
- can, em, sub, esc, fs, gs, rs, us, --24 (16#18#) ..
31 (16#1F#)
+ <dle>, <dc1>, <dc2>, <dc3>, <dc4>, <nak>, <syn>,
<etb>, --<16 (16#10#) .. 23 (16#17#)>
+ <can>, <em>, <sub>, <esc>, <fs>, <gs>, <rs>, <us>,
--<24 (16#18#) .. 31 (16#1F#)>
- ' ', '!', '"', '#', '$', '%', '&', ''', --32
(16#20#) .. 39 (16#27#)
- '(', ')', '*', '+', ',', '-', '.', '/', --40
(16#28#) .. 47 (16#2F#)
+ ' ', '!', '"', '#', '$', '%', '&', ''', --<32
(16#20#) .. 39 (16#27#)>
+ '(', ')', '*', '+', ',', '-', '.', '/', --<40
(16#28#) .. 47 (16#2F#)>
- '0', '1', '2', '3', '4', '5', '6', '7', --48
(16#30#) .. 55 (16#37#)
- '8', '9', ':', ';', '<', '=', '>', '?', --56
(16#38#) .. 63 (16#3F#)
+ '0', '1', '2', '3', '4', '5', '6', '7', --<48
(16#30#) .. 55 (16#37#)>
+ '8', '9', ':', ';', '<', '=', '>', '?', --<56
(16#38#) .. 63 (16#3F#)>
- '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', --64
(16#40#) .. 71 (16#47#)
- 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', --72
(16#48#) .. 79 (16#4F#)
+ '@', 'A', 'B', 'C', 'D', 'E', 'F', 'G', --<64
(16#40#) .. 71 (16#47#)>
+ 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', --<72
(16#48#) .. 79 (16#4F#)>
- 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', --80
(16#50#) .. 87 (16#57#)
- 'X', 'Y', 'Z', '[', '\', ']', '^', '_', --88
(16#58#) .. 95 (16#5F#)
+ 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', --<80
(16#50#) .. 87 (16#57#)>
+ 'X', 'Y', 'Z', '[', '\', ']', '^', '_', --<88
(16#58#) .. 95 (16#5F#)>
- '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', --96
(16#60#) .. 103 (16#67#)
- 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', --104
(16#68#) .. 111 (16#6F#)
+ '`', 'a', 'b', 'c', 'd', 'e', 'f', 'g', --<96
(16#60#) .. 103 (16#67#)>
+ 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', --<104
(16#68#) .. 111 (16#6F#)>
- 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', --112
(16#70#) .. 119 (16#77#)
- 'x', 'y', 'z', '{', '|', '}', '~', del, --120
(16#78#) .. 127 (16#7F#)
+ 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', --<112
(16#70#) .. 119 (16#77#)>
+ 'x', 'y', 'z', '{', '|', '}', '~', <del>, --<120
(16#78#) .. 127 (16#7F#)>
- reserved_128, reserved_129, bph, nbh, --128 (16#80#)
.. 131 (16#83#)
- reserved_132, nel, ssa, esa, --132 (16#84#) .. 135
(16#87#)
- hts, htj, vts, pld, plu, ri, ss2, ss3, --136
(16#88#) .. 143 (16#8F#)
+ <reserved_128>, <reserved_129>, <bph>, <nbh>, --<128
(16#80#) .. 131 (16#83#)>
+ <reserved_132>, <nel>, <ssa>, <esa>, --<132
(16#84#) .. 135 (16#87#)>
+ <hts>, <htj>, <vts>, <pld>, <plu>, <ri>, <ss2>,
<ss3>, --<136 (16#88#) .. 143 (16#8F#)>
- dcs, pu1, pu2, sts, cch, mw, spa, epa, --144
(16#90#) .. 151 (16#97#)
- sos, reserved_153, sci, csi, --152 (16#98#) .. 155
(16#9B#)
- st, osc, pm, apc, --156 (16#9C#) .. 159 (16#9F#)
+ <dcs>, <pu1>, <pu2>, <sts>, <cch>, <mw>, <spa>,
<epa>, --<144 (16#90#) .. 151 (16#97#)>
+ <sos>, <reserved_153>, <sci>, <csi>, --<152
(16#98#) .. 155 (16#9B#)>
+ <st>, <osc>, <pm>, <apc>, --<156 (16#9C#) ..
159 (16#9F#)>
- ' ', '�', '�', '�', '�', '�', '�', '�', --160
(16#A0#) .. 167 (16#A7#)
- '�', '�', '�', '�', --168 (16#A8#) .. 171
(16#AB#)
- �', soft_hyphen, '�', '�', --172 (16#AC#) .. 175
(16#AF#)
+ ' ', '�', '�', '�', '�', '�', '�', '�', --<160
(16#A0#) .. 167 (16#A7#)>
+ '�', '�', '�', '�', --<168 (16#A8#) .. 171
(16#AB#)>
+ �', <soft_hyphen>, '�', '�', --<172 (16#AC#) ..
175 (16#AF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --176
(16#B0#) .. 183 (16#B7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --184
(16#B8#) .. 191 (16#BF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<176
(16#B0#) .. 183 (16#B7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<184
(16#B8#) .. 191 (16#BF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --192
(16#C0#) .. 199 (16#C7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --200
(16#C8#) .. 207 (16#CF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<192
(16#C0#) .. 199 (16#C7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<200
(16#C8#) .. 207 (16#CF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --208
(16#D0#) .. 215 (16#D7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --216
(16#D8#) .. 223 (16#DF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<208
(16#D0#) .. 215 (16#D7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<216
(16#D8#) .. 223 (16#DF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --224
(16#E0#) .. 231 (16#E7#)
- '�', '�', '�', '�', '�', '�', '�', '�', --232
(16#E8#) .. 239 (16#EF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<224
(16#E0#) .. 231 (16#E7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�', --<232
(16#E8#) .. 239 (16#EF#)>
- '�', '�', '�', '�', '�', '�', '�', '�', --240
(16#F0#) .. 247 (16#F7#)
- '�', '�', '�', '�', '�', '�', '�', '�');--248
(16#F8#) .. 255 (16#FF#)
+ '�', '�', '�', '�', '�', '�', '�', '�', --<240
(16#F0#) .. 247 (16#F7#)>
+ '�', '�', '�', '�', '�', '�', '�', '�');--<248
(16#F8#) .. 255 (16#FF#)>
36
- -- The predefined operators for the type Character are the same as for
- -- any enumeration type.
+ --< The predefined operators for the type Character are the same as
for>
+ --< any enumeration type.>
36.1/3
- -- The declaration of type Wide_Character is based on the standard
ISO/IEC 10646:2011 BMP character
- -- set. The first 256 positions have the same contents as type
Character. See *note 3.5.2::.
+ --< The declaration of type Wide_Character is based on the standard
ISO/IEC 10646:2011 BMP character>
+ --< set. The first 256 positions have the same contents as type
Character. See *note 3.5.2::.>
- type Wide_Character is (nul, soh ... Hex_0000FFFE, Hex_0000FFFF);
+ type Wide_Character is (<nul>, <soh> ... <Hex_0000FFFE>,
<Hex_0000FFFF>);
36.2/3
- -- The declaration of type Wide_Wide_Character is based on the full
- -- ISO/IEC 10646:2011 character set. The first 65536 positions have the
- -- same contents as type Wide_Character. See *note 3.5.2::.
+ --< The declaration of type Wide_Wide_Character is based on the full>
+ --< ISO/IEC 10646:2011 character set. The first 65536 positions have
the>
+ --< same contents as type Wide_Character. See *note 3.5.2::.>
- type Wide_Wide_Character is (nul, soh ... Hex_7FFFFFFE, Hex_7FFFFFFF);
+ type Wide_Wide_Character is (<nul>, <soh> ... <Hex_7FFFFFFE>,
<Hex_7FFFFFFF>);
for Wide_Wide_Character'Size use 32;
36.3/2
- package ASCII is ... end ASCII; --Obsolescent; see *note J.5::
-
+ package ASCII is ... end ASCII; --<Obsolescent; see *note J.5::>
+
37/3
- -- Predefined string types:
+ --< Predefined string types:>
type String is array(Positive range <>) of Character
with Pack;
38
- -- The predefined operators for this type are as follows:
+ --< The predefined operators for this type are as follows:>
39
-- function "=" (Left, Right: String) return Boolean;
@@ -33265,7 +33319,7 @@ The library package Standard has the following
declaration:
with Pack;
42
- -- The predefined operators for this type correspond to those for
String.
+ --< The predefined operators for this type correspond to those for
String.>
42.1/3
type Wide_Wide_String is array (Positive range <>)
@@ -33273,17 +33327,17 @@ The library package Standard has the following
declaration:
with Pack;
42.2/2
- -- The predefined operators for this type correspond to those for
String.
+ --< The predefined operators for this type correspond to those for
String.>
43
- type Duration is delta implementation-defined range
implementation-defined;
+ type Duration is delta <implementation-defined> range
<implementation-defined>;
44
- -- The predefined operators for the type Duration are the same as
for
- -- any fixed point type.
+ --< The predefined operators for the type Duration are the same as
for>
+ --< any fixed point type.>
45
- -- The predefined exceptions:
+ --< The predefined exceptions:>
46
Constraint_Error: exception;
@@ -33471,7 +33525,7 @@ The library package Characters.Handling has the
following declaration:
pragma Pure(Handling);
3
- --Character classification functions
+ --<Character classification functions>
4/3
function Is_Control (Item : in Character) return Boolean;
@@ -33493,7 +33547,7 @@ The library package Characters.Handling has the
following declaration:
function Is_Space (Item : in Character) return Boolean;
5
- --Conversion functions for Character and String
+ --<Conversion functions for Character and String>
6
function To_Lower (Item : in Character) return Character;
@@ -33506,7 +33560,7 @@ The library package Characters.Handling has the
following declaration:
function To_Basic (Item : in String) return String;
8
- --Classifications of and conversions between Character and ISO 646
+ --<Classifications of and conversions between Character and ISO 646>
9
subtype ISO_646 is
@@ -33527,10 +33581,10 @@ The library package Characters.Handling has the
following declaration:
return String;
13/2
- -- The functions Is_Character, Is_String, To_Character, To_String,
To_Wide_Character,
- -- and To_Wide_String are obsolescent; see *note J.14::.
+ --< The functions Is_Character, Is_String, To_Character, To_String,
To_Wide_Character,>
+ --< and To_Wide_String are obsolescent; see *note J.14::.>
- Paragraphs 14 through 18 were deleted.
+ <Paragraphs 14 through 18 were deleted.>
19
end Ada.Characters.Handling;
@@ -33547,46 +33601,47 @@ parameter, Item, and returns a Boolean result.
22
Is_Control
- True if Item is a control character. A control character
- is a character whose position is in one of the ranges
- 0..31 or 127..159.
+ True if Item is a control character. A <control
+ character> is a character whose position is in one of the
+ ranges 0..31 or 127..159.
23
Is_Graphic
- True if Item is a graphic character. A graphic character
- is a character whose position is in one of the ranges
- 32..126 or 160..255.
+ True if Item is a graphic character. A <graphic
+ character> is a character whose position is in one of the
+ ranges 32..126 or 160..255.
24
Is_Letter
- True if Item is a letter. A letter is a character that
+ True if Item is a letter. A <letter> is a character that
is in one of the ranges 'A'..'Z' or 'a'..'z', or whose
position is in one of the ranges 192..214, 216..246, or
248..255.
25
Is_Lower
- True if Item is a lower-case letter. A lower-case letter
- is a character that is in the range 'a'..'z', or whose
- position is in one of the ranges 223..246 or 248..255.
+ True if Item is a lower-case letter. A <lower-case
+ letter> is a character that is in the range 'a'..'z', or
+ whose position is in one of the ranges 223..246 or
+ 248..255.
26
Is_Upper
- True if Item is an upper-case letter. An upper-case
- letter is a character that is in the range 'A'..'Z' or
+ True if Item is an upper-case letter. An <upper-case
+ letter> is a character that is in the range 'A'..'Z' or
whose position is in one of the ranges 192..214 or 216..
222.
27
Is_Basic
- True if Item is a basic letter. A basic letter is a
+ True if Item is a basic letter. A <basic letter> is a
character that is in one of the ranges 'A'..'Z' and
'a'..'z', or that is one of the following: '�', '�', '�',
'�', '�', '�', or '�'.
28
Is_Digit
- True if Item is a decimal digit. A decimal digit is a
+ True if Item is a decimal digit. A <decimal digit> is a
character in the range '0'..'9'.
29
@@ -33595,20 +33650,20 @@ Is_Decimal_Digit
30
Is_Hexadecimal_Digit
- True if Item is a hexadecimal digit. A hexadecimal digit
- is a character that is either a decimal digit or that is
- in one of the ranges 'A' .. 'F' or 'a' .. 'f'.
+ True if Item is a hexadecimal digit. A <hexadecimal
+ digit> is a character that is either a decimal digit or
+ that is in one of the ranges 'A' .. 'F' or 'a' .. 'f'.
31
Is_Alphanumeric
True if Item is an alphanumeric character. An
- alphanumeric character is a character that is either a
+ <alphanumeric character> is a character that is either a
letter or a decimal digit.
32
Is_Special
- True if Item is a special graphic character. A special
- graphic character is a graphic character that is not
+ True if Item is a special graphic character. A <special
+ graphic character> is a graphic character that is not
alphanumeric.
32.1/3
@@ -33695,7 +33750,7 @@ To_ISO_646
1..Item'Length and each of whose elements is given by
To_ISO_646 of the corresponding element in Item.
-Paragraphs 42 through 49 were deleted.
+<Paragraphs 42 through 49 were deleted.>
NOTES
@@ -33756,7 +33811,7 @@ The library package Characters.Latin_1 has the
following declaration:
pragma Pure(Latin_1);
4
- -- Control characters:
+ --< Control characters:>
5
NUL : constant Character := Character'Val(0);
@@ -33795,87 +33850,87 @@ The library package Characters.Latin_1 has the
following declaration:
US : constant Character := Character'Val(31);
7
- -- ISO 646 graphic characters:
+ --< ISO 646 graphic characters:>
8
- Space : constant Character := ' '; --
Character'Val(32)
- Exclamation : constant Character := '!'; --
Character'Val(33)
- Quotation : constant Character := '"'; --
Character'Val(34)
- Number_Sign : constant Character := '#'; --
Character'Val(35)
- Dollar_Sign : constant Character := '$'; --
Character'Val(36)
- Percent_Sign : constant Character := '%'; --
Character'Val(37)
- Ampersand : constant Character := '&'; --
Character'Val(38)
- Apostrophe : constant Character := '''; --
Character'Val(39)
- Left_Parenthesis : constant Character := '('; --
Character'Val(40)
- Right_Parenthesis : constant Character := ')'; --
Character'Val(41)
- Asterisk : constant Character := '*'; --
Character'Val(42)
- Plus_Sign : constant Character := '+'; --
Character'Val(43)
- Comma : constant Character := ','; --
Character'Val(44)
- Hyphen : constant Character := '-'; --
Character'Val(45)
+ Space : constant Character := ' '; --<
Character'Val(32)>
+ Exclamation : constant Character := '!'; --<
Character'Val(33)>
+ Quotation : constant Character := '"'; --<
Character'Val(34)>
+ Number_Sign : constant Character := '#'; --<
Character'Val(35)>
+ Dollar_Sign : constant Character := '$'; --<
Character'Val(36)>
+ Percent_Sign : constant Character := '%'; --<
Character'Val(37)>
+ Ampersand : constant Character := '&'; --<
Character'Val(38)>
+ Apostrophe : constant Character := '''; --<
Character'Val(39)>
+ Left_Parenthesis : constant Character := '('; --<
Character'Val(40)>
+ Right_Parenthesis : constant Character := ')'; --<
Character'Val(41)>
+ Asterisk : constant Character := '*'; --<
Character'Val(42)>
+ Plus_Sign : constant Character := '+'; --<
Character'Val(43)>
+ Comma : constant Character := ','; --<
Character'Val(44)>
+ Hyphen : constant Character := '-'; --<
Character'Val(45)>
Minus_Sign : Character renames Hyphen;
- Full_Stop : constant Character := '.'; --
Character'Val(46)
- Solidus : constant Character := '/'; --
Character'Val(47)
+ Full_Stop : constant Character := '.'; --<
Character'Val(46)>
+ Solidus : constant Character := '/'; --<
Character'Val(47)>
9
- -- Decimal digits '0' though '9' are at positions 48 through 57
+ --< Decimal digits '0' though '9' are at positions 48 through 57>
10
- Colon : constant Character := ':'; --
Character'Val(58)
- Semicolon : constant Character := ';'; --
Character'Val(59)
- Less_Than_Sign : constant Character := '<'; --
Character'Val(60)
- Equals_Sign : constant Character := '='; --
Character'Val(61)
- Greater_Than_Sign : constant Character := '>'; --
Character'Val(62)
- Question : constant Character := '?'; --
Character'Val(63)
- Commercial_At : constant Character := '@'; --
Character'Val(64)
+ Colon : constant Character := ':'; --<
Character'Val(58)>
+ Semicolon : constant Character := ';'; --<
Character'Val(59)>
+ Less_Than_Sign : constant Character := '<'; --<
Character'Val(60)>
+ Equals_Sign : constant Character := '='; --<
Character'Val(61)>
+ Greater_Than_Sign : constant Character := '>'; --<
Character'Val(62)>
+ Question : constant Character := '?'; --<
Character'Val(63)>
+ Commercial_At : constant Character := '@'; --<
Character'Val(64)>
11
- -- Letters 'A' through 'Z' are at positions 65 through 90
+ --< Letters 'A' through 'Z' are at positions 65 through 90>
12
- Left_Square_Bracket : constant Character := '['; --
Character'Val(91)
- Reverse_Solidus : constant Character := '\'; --
Character'Val(92)
- Right_Square_Bracket : constant Character := ']'; --
Character'Val(93)
- Circumflex : constant Character := '^'; --
Character'Val(94)
- Low_Line : constant Character := '_'; --
Character'Val(95)
+ Left_Square_Bracket : constant Character := '['; --<
Character'Val(91)>
+ Reverse_Solidus : constant Character := '\'; --<
Character'Val(92)>
+ Right_Square_Bracket : constant Character := ']'; --<
Character'Val(93)>
+ Circumflex : constant Character := '^'; --<
Character'Val(94)>
+ Low_Line : constant Character := '_'; --<
Character'Val(95)>
13
- Grave : constant Character := '`'; --
Character'Val(96)
- LC_A : constant Character := 'a'; --
Character'Val(97)
- LC_B : constant Character := 'b'; --
Character'Val(98)
- LC_C : constant Character := 'c'; --
Character'Val(99)
- LC_D : constant Character := 'd'; --
Character'Val(100)
- LC_E : constant Character := 'e'; --
Character'Val(101)
- LC_F : constant Character := 'f'; --
Character'Val(102)
- LC_G : constant Character := 'g'; --
Character'Val(103)
- LC_H : constant Character := 'h'; --
Character'Val(104)
- LC_I : constant Character := 'i'; --
Character'Val(105)
- LC_J : constant Character := 'j'; --
Character'Val(106)
- LC_K : constant Character := 'k'; --
Character'Val(107)
- LC_L : constant Character := 'l'; --
Character'Val(108)
- LC_M : constant Character := 'm'; --
Character'Val(109)
- LC_N : constant Character := 'n'; --
Character'Val(110)
- LC_O : constant Character := 'o'; --
Character'Val(111)
+ Grave : constant Character := '`'; --<
Character'Val(96)>
+ LC_A : constant Character := 'a'; --<
Character'Val(97)>
+ LC_B : constant Character := 'b'; --<
Character'Val(98)>
+ LC_C : constant Character := 'c'; --<
Character'Val(99)>
+ LC_D : constant Character := 'd'; --<
Character'Val(100)>
+ LC_E : constant Character := 'e'; --<
Character'Val(101)>
+ LC_F : constant Character := 'f'; --<
Character'Val(102)>
+ LC_G : constant Character := 'g'; --<
Character'Val(103)>
+ LC_H : constant Character := 'h'; --<
Character'Val(104)>
+ LC_I : constant Character := 'i'; --<
Character'Val(105)>
+ LC_J : constant Character := 'j'; --<
Character'Val(106)>
+ LC_K : constant Character := 'k'; --<
Character'Val(107)>
+ LC_L : constant Character := 'l'; --<
Character'Val(108)>
+ LC_M : constant Character := 'm'; --<
Character'Val(109)>
+ LC_N : constant Character := 'n'; --<
Character'Val(110)>
+ LC_O : constant Character := 'o'; --<
Character'Val(111)>
14
- LC_P : constant Character := 'p'; --
Character'Val(112)
- LC_Q : constant Character := 'q'; --
Character'Val(113)
- LC_R : constant Character := 'r'; --
Character'Val(114)
- LC_S : constant Character := 's'; --
Character'Val(115)
- LC_T : constant Character := 't'; --
Character'Val(116)
- LC_U : constant Character := 'u'; --
Character'Val(117)
- LC_V : constant Character := 'v'; --
Character'Val(118)
- LC_W : constant Character := 'w'; --
Character'Val(119)
- LC_X : constant Character := 'x'; --
Character'Val(120)
- LC_Y : constant Character := 'y'; --
Character'Val(121)
- LC_Z : constant Character := 'z'; --
Character'Val(122)
- Left_Curly_Bracket : constant Character := '{'; --
Character'Val(123)
- Vertical_Line : constant Character := '|'; --
Character'Val(124)
- Right_Curly_Bracket : constant Character := '}'; --
Character'Val(125)
- Tilde : constant Character := '~'; --
Character'Val(126)
+ LC_P : constant Character := 'p'; --<
Character'Val(112)>
+ LC_Q : constant Character := 'q'; --<
Character'Val(113)>
+ LC_R : constant Character := 'r'; --<
Character'Val(114)>
+ LC_S : constant Character := 's'; --<
Character'Val(115)>
+ LC_T : constant Character := 't'; --<
Character'Val(116)>
+ LC_U : constant Character := 'u'; --<
Character'Val(117)>
+ LC_V : constant Character := 'v'; --<
Character'Val(118)>
+ LC_W : constant Character := 'w'; --<
Character'Val(119)>
+ LC_X : constant Character := 'x'; --<
Character'Val(120)>
+ LC_Y : constant Character := 'y'; --<
Character'Val(121)>
+ LC_Z : constant Character := 'z'; --<
Character'Val(122)>
+ Left_Curly_Bracket : constant Character := '{'; --<
Character'Val(123)>
+ Vertical_Line : constant Character := '|'; --<
Character'Val(124)>
+ Right_Curly_Bracket : constant Character := '}'; --<
Character'Val(125)>
+ Tilde : constant Character := '~'; --<
Character'Val(126)>
DEL : constant Character := Character'Val(127);
15
- -- ISO 6429 control characters:
+ --< ISO 6429 control characters:>
16
IS4 : Character renames FS;
@@ -33922,124 +33977,124 @@ The library package Characters.Latin_1 has the
following declaration:
APC : constant Character := Character'Val(159);
20
- -- Other graphic characters:
+ --< Other graphic characters:>
21/3
- -- Character positions 160 (16#A0#) .. 175 (16#AF#):
- No_Break_Space : constant Character := ' ';
--Character'Val(160)
+ --< Character positions 160 (16#A0#) .. 175 (16#AF#):>
+ No_Break_Space : constant Character := ' ';
--<Character'Val(160)>
NBSP : Character renames No_Break_Space;
- Inverted_Exclamation : constant Character := '�';
--Character'Val(161)
- Cent_Sign : constant Character := '�';
--Character'Val(162)
- Pound_Sign : constant Character := '�';
--Character'Val(163)
- Currency_Sign : constant Character := '�';
--Character'Val(164)
- Yen_Sign : constant Character := '�';
--Character'Val(165)
- Broken_Bar : constant Character := '�';
--Character'Val(166)
- Section_Sign : constant Character := '�';
--Character'Val(167)
- Diaeresis : constant Character := '�';
--Character'Val(168)
- Copyright_Sign : constant Character := '�';
--Character'Val(169)
- Feminine_Ordinal_Indicator : constant Character := '�';
--Character'Val(170)
- Left_Angle_Quotation : constant Character := '�';
--Character'Val(171)
- Not_Sign : constant Character := '�';
--Character'Val(172)
+ Inverted_Exclamation : constant Character := '�';
--<Character'Val(161)>
+ Cent_Sign : constant Character := '�';
--<Character'Val(162)>
+ Pound_Sign : constant Character := '�';
--<Character'Val(163)>
+ Currency_Sign : constant Character := '�';
--<Character'Val(164)>
+ Yen_Sign : constant Character := '�';
--<Character'Val(165)>
+ Broken_Bar : constant Character := '�';
--<Character'Val(166)>
+ Section_Sign : constant Character := '�';
--<Character'Val(167)>
+ Diaeresis : constant Character := '�';
--<Character'Val(168)>
+ Copyright_Sign : constant Character := '�';
--<Character'Val(169)>
+ Feminine_Ordinal_Indicator : constant Character := '�';
--<Character'Val(170)>
+ Left_Angle_Quotation : constant Character := '�';
--<Character'Val(171)>
+ Not_Sign : constant Character := '�';
--<Character'Val(172)>
Soft_Hyphen : constant Character := Character'Val(173);
- Registered_Trade_Mark_Sign : constant Character := '�';
--Character'Val(174)
- Macron : constant Character := '�';
--Character'Val(175)
+ Registered_Trade_Mark_Sign : constant Character := '�';
--<Character'Val(174)>
+ Macron : constant Character := '�';
--<Character'Val(175)>
22
- -- Character positions 176 (16#B0#) .. 191 (16#BF#):
- Degree_Sign : constant Character := '�';
--Character'Val(176)
+ --< Character positions 176 (16#B0#) .. 191 (16#BF#):>
+ Degree_Sign : constant Character := '�';
--<Character'Val(176)>
Ring_Above : Character renames Degree_Sign;
- Plus_Minus_Sign : constant Character := '�';
--Character'Val(177)
- Superscript_Two : constant Character := '�';
--Character'Val(178)
- Superscript_Three : constant Character := '�';
--Character'Val(179)
- Acute : constant Character := '�';
--Character'Val(180)
- Micro_Sign : constant Character := '�';
--Character'Val(181)
- Pilcrow_Sign : constant Character := '�';
--Character'Val(182)
+ Plus_Minus_Sign : constant Character := '�';
--<Character'Val(177)>
+ Superscript_Two : constant Character := '�';
--<Character'Val(178)>
+ Superscript_Three : constant Character := '�';
--<Character'Val(179)>
+ Acute : constant Character := '�';
--<Character'Val(180)>
+ Micro_Sign : constant Character := '�';
--<Character'Val(181)>
+ Pilcrow_Sign : constant Character := '�';
--<Character'Val(182)>
Paragraph_Sign : Character renames Pilcrow_Sign;
- Middle_Dot : constant Character := '�';
--Character'Val(183)
- Cedilla : constant Character := '�';
--Character'Val(184)
- Superscript_One : constant Character := '�';
--Character'Val(185)
- Masculine_Ordinal_Indicator: constant Character := '�';
--Character'Val(186)
- Right_Angle_Quotation : constant Character := '�';
--Character'Val(187)
- Fraction_One_Quarter : constant Character := '�';
--Character'Val(188)
- Fraction_One_Half : constant Character := '�';
--Character'Val(189)
- Fraction_Three_Quarters : constant Character := '�';
--Character'Val(190)
- Inverted_Question : constant Character := '�';
--Character'Val(191)
+ Middle_Dot : constant Character := '�';
--<Character'Val(183)>
+ Cedilla : constant Character := '�';
--<Character'Val(184)>
+ Superscript_One : constant Character := '�';
--<Character'Val(185)>
+ Masculine_Ordinal_Indicator: constant Character := '�';
--<Character'Val(186)>
+ Right_Angle_Quotation : constant Character := '�';
--<Character'Val(187)>
+ Fraction_One_Quarter : constant Character := '�';
--<Character'Val(188)>
+ Fraction_One_Half : constant Character := '�';
--<Character'Val(189)>
+ Fraction_Three_Quarters : constant Character := '�';
--<Character'Val(190)>
+ Inverted_Question : constant Character := '�';
--<Character'Val(191)>
23
- -- Character positions 192 (16#C0#) .. 207 (16#CF#):
- UC_A_Grave : constant Character := '�';
--Character'Val(192)
- UC_A_Acute : constant Character := '�';
--Character'Val(193)
- UC_A_Circumflex : constant Character := '�';
--Character'Val(194)
- UC_A_Tilde : constant Character := '�';
--Character'Val(195)
- UC_A_Diaeresis : constant Character := '�';
--Character'Val(196)
- UC_A_Ring : constant Character := '�';
--Character'Val(197)
- UC_AE_Diphthong : constant Character := '�';
--Character'Val(198)
- UC_C_Cedilla : constant Character := '�';
--Character'Val(199)
- UC_E_Grave : constant Character := '�';
--Character'Val(200)
- UC_E_Acute : constant Character := '�';
--Character'Val(201)
- UC_E_Circumflex : constant Character := '�';
--Character'Val(202)
- UC_E_Diaeresis : constant Character := '�';
--Character'Val(203)
- UC_I_Grave : constant Character := '�';
--Character'Val(204)
- UC_I_Acute : constant Character := '�';
--Character'Val(205)
- UC_I_Circumflex : constant Character := '�';
--Character'Val(206)
- UC_I_Diaeresis : constant Character := '�';
--Character'Val(207)
+ --< Character positions 192 (16#C0#) .. 207 (16#CF#):>
+ UC_A_Grave : constant Character := '�';
--<Character'Val(192)>
+ UC_A_Acute : constant Character := '�';
--<Character'Val(193)>
+ UC_A_Circumflex : constant Character := '�';
--<Character'Val(194)>
+ UC_A_Tilde : constant Character := '�';
--<Character'Val(195)>
+ UC_A_Diaeresis : constant Character := '�';
--<Character'Val(196)>
+ UC_A_Ring : constant Character := '�';
--<Character'Val(197)>
+ UC_AE_Diphthong : constant Character := '�';
--<Character'Val(198)>
+ UC_C_Cedilla : constant Character := '�';
--<Character'Val(199)>
+ UC_E_Grave : constant Character := '�';
--<Character'Val(200)>
+ UC_E_Acute : constant Character := '�';
--<Character'Val(201)>
+ UC_E_Circumflex : constant Character := '�';
--<Character'Val(202)>
+ UC_E_Diaeresis : constant Character := '�';
--<Character'Val(203)>
+ UC_I_Grave : constant Character := '�';
--<Character'Val(204)>
+ UC_I_Acute : constant Character := '�';
--<Character'Val(205)>
+ UC_I_Circumflex : constant Character := '�';
--<Character'Val(206)>
+ UC_I_Diaeresis : constant Character := '�';
--<Character'Val(207)>
24
- -- Character positions 208 (16#D0#) .. 223 (16#DF#):
- UC_Icelandic_Eth : constant Character := '�';
--Character'Val(208)
- UC_N_Tilde : constant Character := '�';
--Character'Val(209)
- UC_O_Grave : constant Character := '�';
--Character'Val(210)
- UC_O_Acute : constant Character := '�';
--Character'Val(211)
- UC_O_Circumflex : constant Character := '�';
--Character'Val(212)
- UC_O_Tilde : constant Character := '�';
--Character'Val(213)
- UC_O_Diaeresis : constant Character := '�';
--Character'Val(214)
- Multiplication_Sign : constant Character := '�';
--Character'Val(215)
- UC_O_Oblique_Stroke : constant Character := '�';
--Character'Val(216)
- UC_U_Grave : constant Character := '�';
--Character'Val(217)
- UC_U_Acute : constant Character := '�';
--Character'Val(218)
- UC_U_Circumflex : constant Character := '�';
--Character'Val(219)
- UC_U_Diaeresis : constant Character := '�';
--Character'Val(220)
- UC_Y_Acute : constant Character := '�';
--Character'Val(221)
- UC_Icelandic_Thorn : constant Character := '�';
--Character'Val(222)
- LC_German_Sharp_S : constant Character := '�';
--Character'Val(223)
+ --< Character positions 208 (16#D0#) .. 223 (16#DF#):>
+ UC_Icelandic_Eth : constant Character := '�';
--<Character'Val(208)>
+ UC_N_Tilde : constant Character := '�';
--<Character'Val(209)>
+ UC_O_Grave : constant Character := '�';
--<Character'Val(210)>
+ UC_O_Acute : constant Character := '�';
--<Character'Val(211)>
+ UC_O_Circumflex : constant Character := '�';
--<Character'Val(212)>
+ UC_O_Tilde : constant Character := '�';
--<Character'Val(213)>
+ UC_O_Diaeresis : constant Character := '�';
--<Character'Val(214)>
+ Multiplication_Sign : constant Character := '�';
--<Character'Val(215)>
+ UC_O_Oblique_Stroke : constant Character := '�';
--<Character'Val(216)>
+ UC_U_Grave : constant Character := '�';
--<Character'Val(217)>
+ UC_U_Acute : constant Character := '�';
--<Character'Val(218)>
+ UC_U_Circumflex : constant Character := '�';
--<Character'Val(219)>
+ UC_U_Diaeresis : constant Character := '�';
--<Character'Val(220)>
+ UC_Y_Acute : constant Character := '�';
--<Character'Val(221)>
+ UC_Icelandic_Thorn : constant Character := '�';
--<Character'Val(222)>
+ LC_German_Sharp_S : constant Character := '�';
--<Character'Val(223)>
25
- -- Character positions 224 (16#E0#) .. 239 (16#EF#):
- LC_A_Grave : constant Character := '�';
--Character'Val(224)
- LC_A_Acute : constant Character := '�';
--Character'Val(225)
- LC_A_Circumflex : constant Character := '�';
--Character'Val(226)
- LC_A_Tilde : constant Character := '�';
--Character'Val(227)
- LC_A_Diaeresis : constant Character := '�';
--Character'Val(228)
- LC_A_Ring : constant Character := '�';
--Character'Val(229)
- LC_AE_Diphthong : constant Character := '�';
--Character'Val(230)
- LC_C_Cedilla : constant Character := '�';
--Character'Val(231)
- LC_E_Grave : constant Character := '�';
--Character'Val(232)
- LC_E_Acute : constant Character := '�';
--Character'Val(233)
- LC_E_Circumflex : constant Character := '�';
--Character'Val(234)
- LC_E_Diaeresis : constant Character := '�';
--Character'Val(235)
- LC_I_Grave : constant Character := '�';
--Character'Val(236)
- LC_I_Acute : constant Character := '�';
--Character'Val(237)
- LC_I_Circumflex : constant Character := '�';
--Character'Val(238)
- LC_I_Diaeresis : constant Character := '�';
--Character'Val(239)
+ --< Character positions 224 (16#E0#) .. 239 (16#EF#):>
+ LC_A_Grave : constant Character := '�';
--<Character'Val(224)>
+ LC_A_Acute : constant Character := '�';
--<Character'Val(225)>
+ LC_A_Circumflex : constant Character := '�';
--<Character'Val(226)>
+ LC_A_Tilde : constant Character := '�';
--<Character'Val(227)>
+ LC_A_Diaeresis : constant Character := '�';
--<Character'Val(228)>
+ LC_A_Ring : constant Character := '�';
--<Character'Val(229)>
+ LC_AE_Diphthong : constant Character := '�';
--<Character'Val(230)>
+ LC_C_Cedilla : constant Character := '�';
--<Character'Val(231)>
+ LC_E_Grave : constant Character := '�';
--<Character'Val(232)>
+ LC_E_Acute : constant Character := '�';
--<Character'Val(233)>
+ LC_E_Circumflex : constant Character := '�';
--<Character'Val(234)>
+ LC_E_Diaeresis : constant Character := '�';
--<Character'Val(235)>
+ LC_I_Grave : constant Character := '�';
--<Character'Val(236)>
+ LC_I_Acute : constant Character := '�';
--<Character'Val(237)>
+ LC_I_Circumflex : constant Character := '�';
--<Character'Val(238)>
+ LC_I_Diaeresis : constant Character := '�';
--<Character'Val(239)>
26
- -- Character positions 240 (16#F0#) .. 255 (16#FF#):
- LC_Icelandic_Eth : constant Character := '�';
--Character'Val(240)
- LC_N_Tilde : constant Character := '�';
--Character'Val(241)
- LC_O_Grave : constant Character := '�';
--Character'Val(242)
- LC_O_Acute : constant Character := '�';
--Character'Val(243)
- LC_O_Circumflex : constant Character := '�';
--Character'Val(244)
- LC_O_Tilde : constant Character := '�';
--Character'Val(245)
- LC_O_Diaeresis : constant Character := '�';
--Character'Val(246)
- Division_Sign : constant Character := '�';
--Character'Val(247)
- LC_O_Oblique_Stroke : constant Character := '�';
--Character'Val(248)
- LC_U_Grave : constant Character := '�';
--Character'Val(249)
- LC_U_Acute : constant Character := '�';
--Character'Val(250)
- LC_U_Circumflex : constant Character := '�';
--Character'Val(251)
- LC_U_Diaeresis : constant Character := '�';
--Character'Val(252)
- LC_Y_Acute : constant Character := '�';
--Character'Val(253)
- LC_Icelandic_Thorn : constant Character := '�';
--Character'Val(254)
- LC_Y_Diaeresis : constant Character := '�';
--Character'Val(255)
+ --< Character positions 240 (16#F0#) .. 255 (16#FF#):>
+ LC_Icelandic_Eth : constant Character := '�';
--<Character'Val(240)>
+ LC_N_Tilde : constant Character := '�';
--<Character'Val(241)>
+ LC_O_Grave : constant Character := '�';
--<Character'Val(242)>
+ LC_O_Acute : constant Character := '�';
--<Character'Val(243)>
+ LC_O_Circumflex : constant Character := '�';
--<Character'Val(244)>
+ LC_O_Tilde : constant Character := '�';
--<Character'Val(245)>
+ LC_O_Diaeresis : constant Character := '�';
--<Character'Val(246)>
+ Division_Sign : constant Character := '�';
--<Character'Val(247)>
+ LC_O_Oblique_Stroke : constant Character := '�';
--<Character'Val(248)>
+ LC_U_Grave : constant Character := '�';
--<Character'Val(249)>
+ LC_U_Acute : constant Character := '�';
--<Character'Val(250)>
+ LC_U_Circumflex : constant Character := '�';
--<Character'Val(251)>
+ LC_U_Diaeresis : constant Character := '�';
--<Character'Val(252)>
+ LC_Y_Acute : constant Character := '�';
--<Character'Val(253)>
+ LC_Icelandic_Thorn : constant Character := '�';
--<Character'Val(254)>
+ LC_Y_Diaeresis : constant Character := '�';
--<Character'Val(255)>
end Ada.Characters.Latin_1;
_Implementation Permissions_
@@ -34593,7 +34648,7 @@ The library package Strings.Maps has the following
declaration:
pragma Pure(Maps);
4/2
- -- Representation for a set of character values:
+ --< Representation for a set of character values:>
type Character_Set is private;
pragma Preelaborable_Initialization(Character_Set);
@@ -34606,7 +34661,7 @@ The library package Strings.Maps has the following
declaration:
Low : Character;
High : Character;
end record;
- -- Represents Character range Low..High
+ -- <Represents Character range Low..High>
7
type Character_Ranges is array (Positive range <>) of Character_Range;
@@ -34646,7 +34701,7 @@ The library package Strings.Maps has the following
declaration:
return Boolean renames Is_Subset;
16
- -- Alternative representation for a set of character values:
+ --< Alternative representation for a set of character values:>
subtype Character_Sequence is String;
17
@@ -34659,7 +34714,7 @@ The library package Strings.Maps has the following
declaration:
function To_Sequence (Set : in Character_Set) return
Character_Sequence;
20/2
- -- Representation for a character to character mapping:
+ --< Representation for a character to character mapping:>
type Character_Mapping is private;
pragma Preelaborable_Initialization(Character_Mapping);
@@ -34687,7 +34742,7 @@ The library package Strings.Maps has the following
declaration:
26
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Maps;
27
@@ -34803,8 +34858,8 @@ the operator. "-"(Left, Right) is equivalent to
"and"(Left,
Element maps with respect to the mapping represented by Map.
54
-A character C matches a pattern character P with respect to a given
-Character_Mapping value Map if Value(Map, C) = P. A string S matches a
+A character C <matches> a pattern character P with respect to a given
+Character_Mapping value Map if Value(Map, C) = P. A string S <matches> a
pattern string P with respect to a given Character_Mapping if their
lengths are the same and if each character in S matches its
corresponding character in the pattern string P.
@@ -34849,7 +34904,7 @@ parameters whose type is Character_Mapping.
64
An object F of type Character_Mapping_Function maps a Character value C
-to the Character value F.all(C), which is said to match C with respect
+to the Character value F.all(C), which is said to <match> C with respect
to mapping function F.
NOTES
@@ -34909,7 +34964,7 @@ The library package Strings.Fixed has the following
declaration:
pragma Preelaborate(Fixed);
6
- -- "Copy" procedure for strings of possibly different lengths
+ --< "Copy" procedure for strings of possibly different lengths>
7
procedure Move (Source : in String;
@@ -34919,7 +34974,7 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
8
- -- Search subprograms
+ --< Search subprograms>
8.1/2
function Index (Source : in String;
@@ -35012,7 +35067,7 @@ The library package Strings.Fixed has the following
declaration:
Last : out Natural);
17
- -- String translation subprograms
+ --< String translation subprograms>
18
function Translate (Source : in String;
@@ -35033,7 +35088,7 @@ The library package Strings.Fixed has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
22
- -- String transformation subprograms
+ --< String transformation subprograms>
23
function Replace_Slice (Source : in String;
@@ -35089,7 +35144,7 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
31
- --String selector subprograms
+ --<String selector subprograms>
function Trim (Source : in String;
Side : in Trim_End)
return String;
@@ -35138,7 +35193,7 @@ The library package Strings.Fixed has the following
declaration:
Pad : in Character := Space);
39
- --String constructor functions
+ --<String constructor functions>
40
function "*" (Left : in Natural;
@@ -35657,7 +35712,7 @@ The library package Strings.Bounded has the following
declaration:
4
generic
- Max : Positive; -- Maximum length of a Bounded_String
+ Max : Positive; --< Maximum length of a Bounded_String>
package Generic_Bounded_Length is
5
@@ -35676,7 +35731,7 @@ The library package Strings.Bounded has the following
declaration:
function Length (Source : in Bounded_String) return Length_Range;
10
- -- Conversion, Concatenation, and Selection functions
+ --< Conversion, Concatenation, and Selection functions>
11
function To_Bounded_String (Source : in String;
@@ -35840,7 +35895,7 @@ The library package Strings.Bounded has the following
declaration:
return Boolean;
43/2
- -- Search subprograms
+ --< Search subprograms>
43.1/2
function Index (Source : in Bounded_String;
@@ -35933,7 +35988,7 @@ The library package Strings.Bounded has the following
declaration:
Last : out Natural);
52
- -- String translation subprograms
+ --< String translation subprograms>
53
function Translate (Source : in Bounded_String;
@@ -35954,7 +36009,7 @@ The library package Strings.Bounded has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
57
- -- String transformation subprograms
+ --< String transformation subprograms>
58
function Replace_Slice (Source : in Bounded_String;
@@ -36009,7 +36064,7 @@ The library package Strings.Bounded has the following
declaration:
Through : in Natural);
66
- --String selector subprograms
+ --<String selector subprograms>
67
function Trim (Source : in Bounded_String;
@@ -36056,7 +36111,7 @@ The library package Strings.Bounded has the following
declaration:
Drop : in Truncation := Error);
74
- --String constructor subprograms
+ --<String constructor subprograms>
75
function "*" (Left : in Natural;
@@ -36093,7 +36148,7 @@ The library package Strings.Bounded has the following
declaration:
81
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Generic_Bounded_Length;
82
@@ -36304,7 +36359,7 @@ The library package Strings.Unbounded has the following
declaration:
procedure Free (X : in out String_Access);
8
- -- Conversion, Concatenation, and Selection functions
+ --< Conversion, Concatenation, and Selection functions>
9
function To_Unbounded_String (Source : in String)
@@ -36440,7 +36495,7 @@ The library package Strings.Unbounded has the following
declaration:
return Boolean;
38
- -- Search subprograms
+ --< Search subprograms>
38.1/2
function Index (Source : in Unbounded_String;
@@ -36532,7 +36587,7 @@ The library package Strings.Unbounded has the following
declaration:
Last : out Natural);
47
- -- String translation subprograms
+ --< String translation subprograms>
48
function Translate (Source : in Unbounded_String;
@@ -36553,7 +36608,7 @@ The library package Strings.Unbounded has the following
declaration:
Mapping : in Maps.Character_Mapping_Function);
52
- -- String transformation subprograms
+ --< String transformation subprograms>
53
function Replace_Slice (Source : in Unbounded_String;
@@ -36660,7 +36715,7 @@ The library package Strings.Unbounded has the following
declaration:
72
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Unbounded;
72.1/2
@@ -36799,15 +36854,15 @@ declaration:
5
Lower_Case_Map : constant Character_Mapping;
- --Maps to lower case for letters, else identity
+ --<Maps to lower case for letters, else identity>
Upper_Case_Map : constant Character_Mapping;
- --Maps to upper case for letters, else identity
+ --<Maps to upper case for letters, else identity>
Basic_Map : constant Character_Mapping;
- --Maps to basic letter for letters, else identity
+ --<Maps to basic letter for letters, else identity>
6
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Maps.Constants;
7
@@ -36845,7 +36900,7 @@ Strings.Wide_Fixed.Wide_Equal_Case_Insensitive,
Strings.Wide_Bounded.Wide_Equal_Case_Insensitive, and
Strings.Wide_Unbounded.Wide_Equal_Case_Insensitive. They provide the
same string-handling operations as the corresponding packages and
-functions for strings of Character elements.
+functions for strings of Character elements.
_Static Semantics_
@@ -36857,7 +36912,7 @@ The package Strings.Wide_Maps has the following
declaration.
pragma Preelaborate(Wide_Maps);
4/2
- -- Representation for a set of Wide_Character values:
+ --< Representation for a set of Wide_Character values:>
type Wide_Character_Set is private;
pragma Preelaborable_Initialization(Wide_Character_Set);
@@ -36870,7 +36925,7 @@ The package Strings.Wide_Maps has the following
declaration.
Low : Wide_Character;
High : Wide_Character;
end record;
- -- Represents Wide_Character range Low..High
+ -- <Represents Wide_Character range Low..High>
7
type Wide_Character_Ranges is array (Positive range <>)
@@ -36919,7 +36974,7 @@ The package Strings.Wide_Maps has the following
declaration.
return Boolean renames Is_Subset;
16
- -- Alternative representation for a set of Wide_Character values:
+ --< Alternative representation for a set of Wide_Character values:>
subtype Wide_Character_Sequence is Wide_String;
17
@@ -36935,7 +36990,7 @@ The package Strings.Wide_Maps has the following
declaration.
return Wide_Character_Sequence;
20/2
- -- Representation for a Wide_Character to Wide_Character mapping:
+ --< Representation for a Wide_Character to Wide_Character mapping:>
type Wide_Character_Mapping is private;
pragma Preelaborable_Initialization(Wide_Character_Mapping);
@@ -36965,7 +37020,7 @@ The package Strings.Wide_Maps has the following
declaration.
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Wide_Maps;
28
@@ -37046,8 +37101,8 @@ Strings.Wide_Maps.Wide_Constants:
46/2
Character_Set : constant Wide_Maps.Wide_Character_Set;
- --Contains each Wide_Character value WC such that
- --Characters.Conversions.Is_Character(WC) is True
+ --<Contains each Wide_Character value WC such that>
+ --<Characters.Conversions.Is_Character(WC) is True>
46.1/2
Each Wide_Character_Set constant in the package
@@ -37091,7 +37146,7 @@
Strings.Wide_Wide_Fixed.Wide_Wide_Equal_Case_Insensitive,
Strings.Wide_Wide_Bounded.Wide_Wide_Equal_Case_Insensitive, and
Strings.Wide_Wide_Unbounded.Wide_Wide_Equal_Case_Insensitive. They
provide the same string-handling operations as the corresponding
-packages and functions for strings of Character elements.
+packages and functions for strings of Character elements.
_Static Semantics_
@@ -37104,7 +37159,7 @@ declaration.
pragma Preelaborate(Wide_Wide_Maps);
4/2
- -- Representation for a set of Wide_Wide_Character values:
+ -- <Representation for a set of Wide_Wide_Character values:>
type Wide_Wide_Character_Set is private;
pragma Preelaborable_Initialization(Wide_Wide_Character_Set);
@@ -37117,7 +37172,7 @@ declaration.
Low : Wide_Wide_Character;
High : Wide_Wide_Character;
end record;
- -- Represents Wide_Wide_Character range Low..High
+ -- <Represents Wide_Wide_Character range Low..High>
7/2
type Wide_Wide_Character_Ranges is array (Positive range <>)
@@ -37166,7 +37221,7 @@ declaration.
return Boolean renames Is_Subset;
16/2
- -- Alternative representation for a set of Wide_Wide_Character values:
+ -- <Alternative representation for a set of Wide_Wide_Character
values:>
subtype Wide_Wide_Character_Sequence is Wide_Wide_String;
17/2
@@ -37182,8 +37237,8 @@ declaration.
return Wide_Wide_Character_Sequence;
20/2
- -- Representation for a Wide_Wide_Character to Wide_Wide_Character
- -- mapping:
+ -- <Representation for a Wide_Wide_Character to Wide_Wide_Character>
+ -- <mapping:>
type Wide_Wide_Character_Mapping is private;
pragma Preelaborable_Initialization(Wide_Wide_Character_Mapping);
@@ -37214,7 +37269,7 @@ declaration.
27/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Strings.Wide_Wide_Maps;
28/2
@@ -37297,11 +37352,11 @@ Strings.Wide_Wide_Maps.Wide_Wide_Constants:
48/2
Character_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set;
- -- Contains each Wide_Wide_Character value WWC such that
- -- Characters.Conversions.Is_Character(WWC) is True
+ -- <Contains each Wide_Wide_Character value WWC such that>
+ -- <Characters.Conversions.Is_Character(WWC) is True>
Wide_Character_Set : constant Wide_Wide_Maps.Wide_Wide_Character_Set;
- -- Contains each Wide_Wide_Character value WWC such that
- -- Characters.Conversions.Is_Wide_Character(WWC) is True
+ -- <Contains each Wide_Wide_Character value WWC such that>
+ -- <Characters.Conversions.Is_Wide_Character(WWC) is True>
49/2
Each Wide_Wide_Character_Set constant in the package
@@ -37340,8 +37395,8 @@ The library function Strings.Hash has the following
declaration:
3/2
Returns an implementation-defined value which is a function of
- the value of Key. If A and B are strings such that A equals
- B, Hash(A) equals Hash(B).
+ the value of Key. If <A> and <B> are strings such that <A>
+ equals <B>, Hash(<A>) equals Hash(<B>).
4/2
The library function Strings.Fixed.Hash has the following declaration:
@@ -37582,7 +37637,7 @@ The encoding library packages have the following
declarations:
pragma Pure (UTF_Encoding);
4/3
- -- Declarations common to the string encoding packages
+ -- <Declarations common to the string encoding packages>
type Encoding_Scheme is (UTF_8, UTF_16BE, UTF_16LE);
5/3
@@ -37630,7 +37685,7 @@ The encoding library packages have the following
declarations:
pragma Pure (Conversions);
16/3
- -- Conversions between various encoding schemes
+ -- <Conversions between various encoding schemes>
function Convert (Item : UTF_String;
Input_Scheme : Encoding_Scheme;
Output_Scheme : Encoding_Scheme;
@@ -37664,7 +37719,7 @@ The encoding library packages have the following
declarations:
pragma Pure (Strings);
23/3
- -- Encoding / decoding between String and various encoding schemes
+ -- <Encoding / decoding between String and various encoding schemes>
function Encode (Item : String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -37696,7 +37751,7 @@ The encoding library packages have the following
declarations:
pragma Pure (Wide_Strings);
31/3
- -- Encoding / decoding between Wide_String and various encoding schemes
+ -- <Encoding / decoding between Wide_String and various encoding
schemes>
function Encode (Item : Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -37728,7 +37783,7 @@ The encoding library packages have the following
declarations:
pragma Pure (Wide_Wide_Strings);
39/3
- -- Encoding / decoding between Wide_Wide_String and various encoding
schemes
+ -- <Encoding / decoding between Wide_Wide_String and various encoding
schemes>
function Encode (Item : Wide_Wide_String;
Output_Scheme : Encoding_Scheme;
Output_BOM : Boolean := False) return UTF_String;
@@ -38064,7 +38119,7 @@ Annex G::, "*note Annex G:: Numerics".
_Static Semantics_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3/2
package Ada.Numerics is
@@ -38118,7 +38173,7 @@ the following declaration:
3
generic
type Float_Type is digits <>;
-
+
package Ada.Numerics.Generic_Elementary_Functions is
pragma Pure(Generic_Elementary_Functions);
@@ -38201,29 +38256,29 @@ imply the principal branch:
13
* The result of the Arcsin function is in the quadrant containing the
- point (1.0, x), where x is the value of the parameter X. This
+ point (1.0, <x>), where <x> is the value of the parameter X. This
quadrant is I or IV; thus, the range of the Arcsin function is
approximately -PI/2.0 to PI/2.0 (-Cycle/4.0 to Cycle/4.0, if the
parameter Cycle is specified).
14
* The result of the Arccos function is in the quadrant containing the
- point (x, 1.0), where x is the value of the parameter X. This
+ point (<x>, 1.0), where <x> is the value of the parameter X. This
quadrant is I or II; thus, the Arccos function ranges from 0.0 to
approximately PI (Cycle/2.0, if the parameter Cycle is specified).
15
* The results of the Arctan and Arccot functions are in the quadrant
- containing the point (x, y), where x and y are the values of the
- parameters X and Y, respectively. This may be any quadrant (I
- through IV) when the parameter X (resp., Y) of Arctan (resp.,
+ containing the point (<x>, <y>), where <x> and <y> are the values
+ of the parameters X and Y, respectively. This may be any quadrant
+ (I through IV) when the parameter X (resp., Y) of Arctan (resp.,
Arccot) is specified, but it is restricted to quadrants I and IV
(resp., I and II) when that parameter is omitted. Thus, the range
when that parameter is specified is approximately -PI to PI
(-Cycle/2.0 to Cycle/2.0, if the parameter Cycle is specified);
when omitted, the range of Arctan (resp., Arccot) is that of Arcsin
- (resp., Arccos), as given above. When the point (x, y) lies on the
- negative x-axis, the result approximates
+ (resp., Arccos), as given above. When the point (<x>, <y>) lies on
+ the negative x-axis, the result approximates
16
* PI (resp., -PI) when the sign of the parameter Y is positive
@@ -38304,7 +38359,7 @@ cases, provided that Float_Type'Machine_Overflows is
True:
34
Constraint_Error can also be raised when a finite result overflows (see
-*note G.2.4::); this may occur for parameter values sufficiently near
+*note G.2.4::); this may occur for parameter values sufficiently <near>
poles, and, in the case of some of the functions, for parameter values
with sufficiently large magnitudes. When Float_Type'Machine_Overflows
is False, the result at poles is unspecified.
@@ -38324,8 +38379,8 @@ Float_Type.
37
In the following cases, evaluation of an elementary function shall yield
-the prescribed result, provided that the preceding rules do not call for
-an exception to be raised:
+the <prescribed result>, provided that the preceding rules do not call
+for an exception to be raised:
38
* When the parameter X has the value zero, the Sqrt, Sin, Arcsin,
@@ -38364,15 +38419,16 @@ When Float_Type'Signed_Zeros is True, the sign of a
zero result shall be
as follows:
45
- * A prescribed zero result delivered at the origin by one of the odd
- functions (Sin, Arcsin, Sinh, Arcsinh, Tan, Arctan or Arccot as a
- function of Y when X is fixed and positive, Tanh, and Arctanh) has
- the sign of the parameter X (Y, in the case of Arctan or Arccot).
+ * A prescribed zero result delivered <at the origin> by one of the
+ odd functions (Sin, Arcsin, Sinh, Arcsinh, Tan, Arctan or Arccot as
+ a function of Y when X is fixed and positive, Tanh, and Arctanh)
+ has the sign of the parameter X (Y, in the case of Arctan or
+ Arccot).
46
- * A prescribed zero result delivered by one of the odd functions away
- from the origin, or by some other elementary function, has an
- implementation-defined sign.
+ * A prescribed zero result delivered by one of the odd functions
+ <away from the origin>, or by some other elementary function, has
+ an implementation-defined sign.
47
* A zero result that is not a prescribed result (i.e., one that
@@ -38398,7 +38454,7 @@ are provided in the package Numerics.Float_Random; the
generic package
Numerics.Discrete_Random provides similar facilities for the generation
of pseudo-random integers and pseudo-random values of enumeration types.
For brevity, pseudo-random values of any of these types are called
-random numbers.
+<random numbers>.
2
Some of the facilities provided are basic to all applications of random
@@ -38426,7 +38482,7 @@ The library package Numerics.Float_Random has the
following declaration:
package Ada.Numerics.Float_Random is
6
- -- Basic facilities
+ -- <Basic facilities>
7
type Generator is limited private;
@@ -38441,7 +38497,7 @@ The library package Numerics.Float_Random has the
following declaration:
procedure Reset (Gen : in Generator);
10
- -- Advanced facilities
+ -- <Advanced facilities>
11
type State is private;
@@ -38453,7 +38509,7 @@ The library package Numerics.Float_Random has the
following declaration:
From_State : in State);
13
- Max_Image_Width : constant := implementation-defined integer value;
+ Max_Image_Width : constant := <implementation-defined integer value>;
14
function Image (Of_State : State) return String;
@@ -38461,7 +38517,7 @@ The library package Numerics.Float_Random has the
following declaration:
15
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Numerics.Float_Random;
15.1/2
@@ -38472,13 +38528,13 @@ The generic library package Numerics.Discrete_Random
has the following
declaration:
17
-
+
generic
type Result_Subtype is (<>);
package Ada.Numerics.Discrete_Random is
18
- -- Basic facilities
+ -- <Basic facilities>
19
type Generator is limited private;
@@ -38492,7 +38548,7 @@ declaration:
procedure Reset (Gen : in Generator);
22
- -- Advanced facilities
+ -- <Advanced facilities>
23
type State is private;
@@ -38504,7 +38560,7 @@ declaration:
From_State : in State);
25
- Max_Image_Width : constant := implementation-defined integer value;
+ Max_Image_Width : constant := <implementation-defined integer value>;
26
function Image (Of_State : State) return String;
@@ -38512,7 +38568,7 @@ declaration:
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Numerics.Discrete_Random;
27.1/2
@@ -38523,8 +38579,8 @@ instantiation of Numerics.Discrete_Random.
An object of the limited private type Generator is associated with a
sequence of random numbers. Each generator has a hidden (internal)
state, which the operations on generators use to determine the position
-in the associated sequence. All generators are implicitly initialized to
-an unspecified state that does not vary from one program execution to
+in the associated sequence. All generators are implicitly initialized
+to an unspecified state that does not vary from one program execution to
another; they may also be explicitly initialized, or reinitialized, to a
time-dependent state, to a previously saved state, or to a state
uniquely denoted by an integer value.
@@ -38565,8 +38621,8 @@ generators and states are defined below.
Sets the state of the specified generator to one that is an
unspecified function of the value of the parameter Initiator
(or to a time-dependent state, if only a generator parameter
- is specified). The latter form of the procedure is known as
- the time-dependent Reset procedure.
+ is specified). The latter form of the procedure is known as
+ the <time-dependent Reset procedure>.
35
procedure Save (Gen : in Generator;
@@ -38598,19 +38654,19 @@ Instantiation of Numerics.Discrete_Random with a
subtype having a null
range raises Constraint_Error.
40/1
-This paragraph was deleted.
+<This paragraph was deleted.>
_Bounded (Run-Time) Errors_
40.1/1
It is a bounded error to invoke Value with a string that is not the
-image of any generator state. If the error is detected, Constraint_Error
-or Program_Error is raised. Otherwise, a call to Reset with the
-resulting state will produce a generator such that calls to Random with
-this generator will produce a sequence of values of the appropriate
-subtype, but which might not be random in character. That is, the
-sequence of values might not fulfill the implementation requirements of
-this subclause.
+image of any generator state. If the error is detected,
+Constraint_Error or Program_Error is raised. Otherwise, a call to Reset
+with the resulting state will produce a generator such that calls to
+Random with this generator will produce a sequence of values of the
+appropriate subtype, but which might not be random in character. That
+is, the sequence of values might not fulfill the implementation
+requirements of this subclause.
_Implementation Requirements_
@@ -38718,7 +38774,7 @@ initiator value.
_Examples_
55
-Example of a program that plays a simulated dice game:
+<Example of a program that plays a simulated dice game:>
56
with Ada.Numerics.Discrete_Random;
@@ -38730,16 +38786,16 @@ Example of a program that plays a simulated dice game:
G : Generator;
D : Dice;
begin
- Reset (G); -- Start the generator in a unique state in each run
+ Reset (G); -- <Start the generator in a unique state in each run>
loop
- -- Roll a pair of dice; sum and process the results
+ -- <Roll a pair of dice; sum and process the results>
D := Random(G) + Random(G);
...
end loop;
end Dice_Game;
57
-Example of a program that simulates coin tosses:
+<Example of a program that simulates coin tosses:>
58
with Ada.Numerics.Discrete_Random;
@@ -38749,9 +38805,9 @@ Example of a program that simulates coin tosses:
use Random_Coin;
G : Generator;
begin
- Reset (G); -- Start the generator in a unique state in each run
+ Reset (G); -- <Start the generator in a unique state in each run>
loop
- -- Toss a coin and process the result
+ -- <Toss a coin and process the result>
case Random(G) is
when Heads =>
...
@@ -38763,8 +38819,8 @@ Example of a program that simulates coin tosses:
end Flip_A_Coin;
59
-Example of a parallel simulation of a physical system, with a separate
-generator of event probabilities in each task:
+<Example of a parallel simulation of a physical system, with a separate
+generator of event probabilities in each task:>
60
with Ada.Numerics.Float_Random;
@@ -38789,17 +38845,17 @@ generator of event probabilities in each task:
end loop;
end Worker;
begin
- -- Initialize the generators in the Worker tasks to different states
+ -- <Initialize the generators in the Worker tasks to different states>
for I in W'Range loop
W(I).Initialize_Generator (I);
end loop;
- ... -- Wait for the Worker tasks to terminate
+ ... -- <Wait for the Worker tasks to terminate>
end Parallel_Simulation;
NOTES
61
- 22 Notes on the last example: Although each Worker task
+ 22 <Notes on the last example:> Although each Worker task
initializes its generator to a different state, those states will
be the same in every execution of the program. The generator
states can be initialized uniquely in each program execution by
@@ -38818,84 +38874,84 @@ A.5.3 Attributes of Floating Point Types
_Static Semantics_
1
-The following representation-oriented attributes are defined for every
-subtype S of a floating point type T.
+The following <representation-oriented attributes> are defined for every
+subtype S of a floating point type <T>.
2
S'Machine_Radix
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>.
3
The values of other representation-oriented attributes of a floating
point subtype, and of the "primitive function" attributes of a floating
point subtype described later, are defined in terms of a particular
-representation of nonzero values called the canonical form. The
-canonical form (for the type T) is the form
- � mantissa � T'Machine_Radixexponent
+representation of nonzero values called the <canonical form>. The
+canonical form (for the type <T>) is the form
+ � <mantissa> � <T>'Machine_Radix<exponent>
where
4
- * mantissa is a fraction in the number base T'Machine_Radix, the
+ * <mantissa> is a fraction in the number base <T>'Machine_Radix, the
first digit of which is nonzero, and
5
- * exponent is an integer.
+ * <exponent> is an integer.
6
S'Machine_Mantissa
- Yields the largest value of p such that every value
- expressible in the canonical form (for the type T),
- having a p-digit mantissa and an exponent between
- T'Machine_Emin and T'Machine_Emax, is a machine number
- (see *note 3.5.7::) of the type T. This attribute yields
- a value of the type universal_integer.
+ Yields the largest value of <p> such that every value
+ expressible in the canonical form (for the type <T>),
+ having a <p>-digit <mantissa> and an <exponent> between
+ <T>'Machine_Emin and <T>'Machine_Emax, is a machine
+ number (see *note 3.5.7::) of the type <T>. This
+ attribute yields a value of the type <universal_integer>.
7
S'Machine_Emin
- Yields the smallest (most negative) value of exponent
+ Yields the smallest (most negative) value of <exponent>
such that every value expressible in the canonical form
- (for the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer.
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>.
8
S'Machine_Emax
- Yields the largest (most positive) value of exponent such
- that every value expressible in the canonical form (for
- the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer.
+ Yields the largest (most positive) value of <exponent>
+ such that every value expressible in the canonical form
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>.
9
S'Denorm
Yields the value True if every value expressible in the
form
- � mantissa � T'Machine_RadixT'Machine_Emin
- where mantissa is a nonzero T'Machine_Mantissa-digit
- fraction in the number base T'Machine_Radix, the first
+ � <mantissa> � <T>'Machine_Radix<T>'Machine_Emin
+ where <mantissa> is a nonzero <T>'Machine_Mantissa-digit
+ fraction in the number base <T>'Machine_Radix, the first
digit of which is zero, is a machine number (see *note
- 3.5.7::) of the type T; yields the value False otherwise.
- The value of this attribute is of the predefined type
- Boolean.
+ 3.5.7::) of the type <T>; yields the value False
+ otherwise. The value of this attribute is of the
+ predefined type Boolean.
10
The values described by the formula in the definition of S'Denorm are
-called denormalized numbers. A nonzero machine number that is not a
-denormalized number is a normalized number. A normalized number x of a
-given type T is said to be represented in canonical form when it is
-expressed in the canonical form (for the type T) with a mantissa having
-T'Machine_Mantissa digits; the resulting form is the canonical-form
-representation of x.
+called <denormalized numbers>. A nonzero machine number that is not a
+denormalized number is a <normalized number>. A normalized number <x>
+of a given type <T> is said to be <represented in canonical form> when
+it is expressed in the canonical form (for the type <T>) with a
+<mantissa> having <T>'Machine_Mantissa digits; the resulting form is the
+<canonical-form representation> of <x>.
11
S'Machine_Rounds
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean.
@@ -38904,33 +38960,34 @@ S'Machine_Overflows
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean.
13
S'Signed_Zeros
Yields the value True if the hardware representation for
- the type T has the capability of representing both
+ the type <T> has the capability of representing both
positively and negatively signed zeros, these being
generated and used by the predefined operations of the
- type T as specified in IEC 559:1989; yields the value
+ type <T> as specified in IEC 559:1989; yields the value
False otherwise. The value of this attribute is of the
predefined type Boolean.
14
-For every value x of a floating point type T, the normalized exponent of
-x is defined as follows:
+For every value <x> of a floating point type <T>, the <normalized
+exponent> of <x> is defined as follows:
15
* the normalized exponent of zero is (by convention) zero;
16
- * for nonzero x, the normalized exponent of x is the unique integer k
- such that T'Machine_Radixk-1 <= |x| < T'Machine_Radixk.
+ * for nonzero <x>, the normalized exponent of <x> is the unique
+ integer <k> such that <T>'Machine_Radix<k>-1 <= |<x>| <
+ <T>'Machine_Radix<k>.
17
-The following primitive function attributes are defined for any subtype
-S of a floating point type T.
+The following <primitive function attributes> are defined for any
+subtype S of a floating point type <T>.
18
S'Exponent
@@ -38938,11 +38995,11 @@ S'Exponent
specification:
19
- function S'Exponent (X : T)
- return universal_integer
+ function S'Exponent (<X> : <T>)
+ return <universal_integer>
20
- The function yields the normalized exponent of X.
+ The function yields the normalized exponent of <X>.
21
S'Fraction
@@ -38950,13 +39007,14 @@ S'Fraction
specification:
22
- function S'Fraction (X : T)
- return T
+ function S'Fraction (<X> : <T>)
+ return <T>
23
- The function yields the value X � T'Machine_Radix-k,
- where k is the normalized exponent of X. A zero result,
- which can only occur when X is zero, has the sign of X.
+ The function yields the value <X> �
+ <T>'Machine_Radix-<k>, where <k> is the normalized
+ exponent of <X>. A zero result, which can only occur
+ when <X> is zero, has the sign of <X>.
24
S'Compose
@@ -38964,19 +39022,20 @@ S'Compose
specification:
25
- function S'Compose (Fraction : T;
- Exponent : universal_integer)
- return T
+ function S'Compose (<Fraction> : <T>;
+ <Exponent> : <universal_integer>)
+ return <T>
26
- Let v be the value Fraction � T'Machine_RadixExponent-k,
- where k is the normalized exponent of Fraction. If v is
- a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of Fraction when S'Signed_Zeros is True.
+ Let <v> be the value <Fraction> �
+ <T>'Machine_Radix<Exponent>-<k>, where <k> is the
+ normalized exponent of <Fraction>. If <v> is a machine
+ number of the type <T>, or if |<v>| >= <T>'Model_Small,
+ the function yields <v>; otherwise, it yields either one
+ of the machine numbers of the type <T> adjacent to <v>.
+ Constraint_Error is optionally raised if <v> is outside
+ the base range of S. A zero result has the sign of
+ <Fraction> when S'Signed_Zeros is True.
27
S'Scaling
@@ -38984,18 +39043,18 @@ S'Scaling
specification:
28
- function S'Scaling (X : T;
- Adjustment : universal_integer)
- return T
+ function S'Scaling (<X> : <T>;
+ <Adjustment> : <universal_integer>)
+ return <T>
29
- Let v be the value X � T'Machine_RadixAdjustment. If v
- is a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of X when S'Signed_Zeros is True.
+ Let <v> be the value <X> � <T>'Machine_Radix<Adjustment>.
+ If <v> is a machine number of the type <T>, or if |<v>|
+ >= <T>'Model_Small, the function yields <v>; otherwise,
+ it yields either one of the machine numbers of the type
+ <T> adjacent to <v>. Constraint_Error is optionally
+ raised if <v> is outside the base range of S. A zero
+ result has the sign of <X> when S'Signed_Zeros is True.
30
S'Floor
@@ -39003,14 +39062,14 @@ S'Floor
specification:
31
- function S'Floor (X : T)
- return T
+ function S'Floor (<X> : <T>)
+ return <T>
32
- The function yields the value 'floor(X)', i.e., the
+ The function yields the value 'floor(<X>)', i.e., the
largest (most positive) integral value less than or equal
- to X. When X is zero, the result has the sign of X; a
- zero result otherwise has a positive sign.
+ to <X>. When <X> is zero, the result has the sign of
+ <X>; a zero result otherwise has a positive sign.
33
S'Ceiling
@@ -39018,14 +39077,14 @@ S'Ceiling
specification:
34
- function S'Ceiling (X : T)
- return T
+ function S'Ceiling (<X> : <T>)
+ return <T>
35
- The function yields the value 'ceiling(X)', i.e., the
+ The function yields the value 'ceiling(<X>)', i.e., the
smallest (most negative) integral value greater than or
- equal to X. When X is zero, the result has the sign of X;
- a zero result otherwise has a negative sign when
+ equal to <X>. When <X> is zero, the result has the sign
+ of <X>; a zero result otherwise has a negative sign when
S'Signed_Zeros is True.
36
@@ -39034,14 +39093,14 @@ S'Rounding
specification:
37
- function S'Rounding (X : T)
- return T
+ function S'Rounding (<X> : <T>)
+ return <T>
38
- The function yields the integral value nearest to X,
- rounding away from zero if X lies exactly halfway between
- two integers. A zero result has the sign of X when
- S'Signed_Zeros is True.
+ The function yields the integral value nearest to <X>,
+ rounding away from zero if <X> lies exactly halfway
+ between two integers. A zero result has the sign of <X>
+ when S'Signed_Zeros is True.
39
S'Unbiased_Rounding
@@ -39049,14 +39108,14 @@ S'Unbiased_Rounding
specification:
40
- function S'Unbiased_Rounding (X : T)
- return T
+ function S'Unbiased_Rounding (<X> : <T>)
+ return <T>
41
- The function yields the integral value nearest to X,
- rounding toward the even integer if X lies exactly
+ The function yields the integral value nearest to <X>,
+ rounding toward the even integer if <X> lies exactly
halfway between two integers. A zero result has the sign
- of X when S'Signed_Zeros is True.
+ of <X> when S'Signed_Zeros is True.
41.1/2
S'Machine_Rounding
@@ -39064,14 +39123,14 @@ S'Machine_Rounding
specification:
41.2/2
- function S'Machine_Rounding (X : T)
- return T
+ function S'Machine_Rounding (<X> : <T>)
+ return <T>
41.3/2
- The function yields the integral value nearest to X. If X
- lies exactly halfway between two integers, one of those
- integers is returned, but which of them is returned is
- unspecified. A zero result has the sign of X when
+ The function yields the integral value nearest to <X>.
+ If <X> lies exactly halfway between two integers, one of
+ those integers is returned, but which of them is returned
+ is unspecified. A zero result has the sign of <X> when
S'Signed_Zeros is True. This function provides access to
the rounding behavior which is most efficient on the
target processor.
@@ -39082,13 +39141,13 @@ S'Truncation
specification:
43
- function S'Truncation (X : T)
- return T
+ function S'Truncation (<X> : <T>)
+ return <T>
44
- The function yields the value 'ceiling(X)' when X is
- negative, and 'floor(X)' otherwise. A zero result has
- the sign of X when S'Signed_Zeros is True.
+ The function yields the value 'ceiling(<X>)' when <X> is
+ negative, and 'floor(<X>)' otherwise. A zero result has
+ the sign of <X> when S'Signed_Zeros is True.
45
S'Remainder
@@ -39096,17 +39155,17 @@ S'Remainder
specification:
46
- function S'Remainder (X, Y : T)
- return T
+ function S'Remainder (<X>, <Y> : <T>)
+ return <T>
47
- For nonzero Y, let v be the value X - n � Y, where n is
- the integer nearest to the exact value of X/Y; if |n -
- X/Y| = 1/2, then n is chosen to be even. If v is a
- machine number of the type T, the function yields v;
- otherwise, it yields zero. Constraint_Error is raised if
- Y is zero. A zero result has the sign of X when
- S'Signed_Zeros is True.
+ For nonzero <Y>, let <v> be the value <X> - <n> � <Y>,
+ where <n> is the integer nearest to the exact value of
+ <X>/<Y>; if |<n> - <X>/<Y>| = 1/2, then <n> is chosen to
+ be even. If <v> is a machine number of the type <T>, the
+ function yields <v>; otherwise, it yields zero.
+ Constraint_Error is raised if <Y> is zero. A zero result
+ has the sign of <X> when S'Signed_Zeros is True.
48
S'Adjacent
@@ -39114,17 +39173,17 @@ S'Adjacent
specification:
49
- function S'Adjacent (X, Towards : T)
- return T
+ function S'Adjacent (<X>, <Towards> : <T>)
+ return <T>
50
- If Towards = X, the function yields X; otherwise, it
- yields the machine number of the type T adjacent to X in
- the direction of Towards, if that machine number exists.
- If the result would be outside the base range of S,
- Constraint_Error is raised. When T'Signed_Zeros is True,
- a zero result has the sign of X. When Towards is zero,
- its sign has no bearing on the result.
+ If <Towards> = <X>, the function yields <X>; otherwise,
+ it yields the machine number of the type <T> adjacent to
+ <X> in the direction of <Towards>, if that machine number
+ exists. If the result would be outside the base range of
+ S, Constraint_Error is raised. When <T>'Signed_Zeros is
+ True, a zero result has the sign of <X>. When <Towards>
+ is zero, its sign has no bearing on the result.
51
S'Copy_Sign
@@ -39132,16 +39191,16 @@ S'Copy_Sign
specification:
52
- function S'Copy_Sign (Value, Sign : T)
- return T
+ function S'Copy_Sign (<Value>, <Sign> : <T>)
+ return <T>
53
- If the value of Value is nonzero, the function yields a
- result whose magnitude is that of Value and whose sign is
- that of Sign; otherwise, it yields the value zero.
+ If the value of <Value> is nonzero, the function yields a
+ result whose magnitude is that of <Value> and whose sign
+ is that of <Sign>; otherwise, it yields the value zero.
Constraint_Error is optionally raised if the result is
outside the base range of S. A zero result has the sign
- of Sign when S'Signed_Zeros is True.
+ of <Sign> when S'Signed_Zeros is True.
54
S'Leading_Part
@@ -39149,27 +39208,27 @@ S'Leading_Part
specification:
55
- function S'Leading_Part (X : T;
- Radix_Digits : universal_integer)
- return T
+ function S'Leading_Part (<X> : <T>;
+ <Radix_Digits> :
<universal_integer>)
+ return <T>
56
- Let v be the value T'Machine_Radixk-Radix_Digits, where k
- is the normalized exponent of X. The function yields the
- value
+ Let <v> be the value <T>'Machine_Radix<k>-<Radix_Digits>,
+ where <k> is the normalized exponent of <X>. The
+ function yields the value
57
- * 'floor(X/v)' � v, when X is nonnegative and
- Radix_Digits is positive;
+ * 'floor(<X>/<v>)' � <v>, when <X> is nonnegative and
+ <Radix_Digits> is positive;
58
- * 'ceiling(X/v)' � v, when X is negative and
- Radix_Digits is positive.
+ * 'ceiling(<X>/<v>)' � <v>, when <X> is negative and
+ <Radix_Digits> is positive.
59
- Constraint_Error is raised when Radix_Digits is zero or
- negative. A zero result, which can only occur when X is
- zero, has the sign of X.
+ Constraint_Error is raised when <Radix_Digits> is zero or
+ negative. A zero result, which can only occur when <X>
+ is zero, has the sign of <X>.
60
S'Machine
@@ -39177,54 +39236,55 @@ S'Machine
specification:
61
- function S'Machine (X : T)
- return T
+ function S'Machine (<X> : <T>)
+ return <T>
62
- If X is a machine number of the type T, the function
- yields X; otherwise, it yields the value obtained by
- rounding or truncating X to either one of the adjacent
- machine numbers of the type T. Constraint_Error is raised
- if rounding or truncating X to the precision of the
- machine numbers results in a value outside the base range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True.
+ If <X> is a machine number of the type <T>, the function
+ yields <X>; otherwise, it yields the value obtained by
+ rounding or truncating <X> to either one of the adjacent
+ machine numbers of the type <T>. Constraint_Error is
+ raised if rounding or truncating <X> to the precision of
+ the machine numbers results in a value outside the base
+ range of S. A zero result has the sign of <X> when
+ S'Signed_Zeros is True.
63
-The following model-oriented attributes are defined for any subtype S of
-a floating point type T.
+The following <model-oriented attributes> are defined for any subtype S
+of a floating point type <T>.
64
S'Model_Mantissa
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to 'ceiling(d � log(10) /
- log(T'Machine_Radix))' + 1, where d is the requested
- decimal precision of T, and less than or equal to the
- value of T'Machine_Mantissa. See *note G.2.2:: for
+ than or equal to 'ceiling(<d> � log(10) /
+ log(<T>'Machine_Radix))' + 1, where <d> is the requested
+ decimal precision of <T>, and less than or equal to the
+ value of <T>'Machine_Mantissa. See *note G.2.2:: for
further requirements that apply to implementations
supporting the Numerics Annex. The value of this
- attribute is of the type universal_integer.
+ attribute is of the type <universal_integer>.
65
S'Model_Emin
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to the value of T'Machine_Emin. See *note
- G.2.2:: for further requirements that apply to
+ than or equal to the value of <T>'Machine_Emin. See
+ *note G.2.2:: for further requirements that apply to
implementations supporting the Numerics Annex. The value
- of this attribute is of the type universal_integer.
+ of this attribute is of the type <universal_integer>.
66
S'Model_Epsilon
- Yields the value T'Machine_Radix1 - T'Model_Mantissa.
+ Yields the value <T>'Machine_Radix1 - <T>'Model_Mantissa.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
67
S'Model_Small
- Yields the value T'Machine_RadixT'Model_Emin - 1. The
- value of this attribute is of the type universal_real.
+ Yields the value <T>'Machine_Radix<T>'Model_Emin - 1.
+ The value of this attribute is of the type
+ <universal_real>.
68
S'Model
@@ -39232,8 +39292,8 @@ S'Model
specification:
69
- function S'Model (X : T)
- return T
+ function S'Model (<X> : <T>)
+ return <T>
70
If the Numerics Annex is not supported, the meaning of
@@ -39244,22 +39304,22 @@ S'Model
71
S'Safe_First
Yields the lower bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
72
S'Safe_Last
Yields the upper bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real.
+ <universal_real>.
File: arm2012.info, Node: A.5.4, Prev: A.5.3, Up: A.5
@@ -39270,20 +39330,20 @@ A.5.4 Attributes of Fixed Point Types
_Static Semantics_
1
-The following representation-oriented attributes are defined for every
-subtype S of a fixed point type T.
+The following <representation-oriented> attributes are defined for every
+subtype S of a fixed point type <T>.
2
S'Machine_Radix
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>.
3
S'Machine_Rounds
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean.
@@ -39292,7 +39352,7 @@ S'Machine_Overflows
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean.
@@ -39324,10 +39384,10 @@ A.7 External Files and File Objects
1
Values input from the external environment of the program, or output to
-the external environment, are considered to occupy external files. An
+the external environment, are considered to occupy <external files>. An
external file can be anything external to the program that can produce a
value to be read or receive a value to be written. An external file is
-identified by a string (the name). A second string (the form) gives
+identified by a string (the <name>). A second string (the <form>) gives
further system-dependent characteristics that may be associated with the
file, such as the physical organization or access rights. The
conventions governing the interpretation of such strings shall be
@@ -39335,9 +39395,9 @@ documented.
2/3
Input and output operations are expressed as operations on objects of
-some file type, rather than directly in terms of the external files. In
-the remainder of this clause, the term file is always used to refer to a
-file object; the term external file is used otherwise.
+some <file type>, rather than directly in terms of the external files.
+In the remainder of this clause, the term <file> is always used to refer
+to a file object; the term <external file> is used otherwise.
3
Input-output for sequential files of values of a single element type is
@@ -39362,21 +39422,21 @@ values of possibly different types is defined by
means of the
5
Before input or output operations can be performed on a file, the file
first has to be associated with an external file. While such an
-association is in effect, the file is said to be open, and otherwise the
-file is said to be closed.
+association is in effect, the file is said to be <open>, and otherwise
+the file is said to be <closed>.
6
The language does not define what happens to external files after the
completion of the main program and all the library tasks (in particular,
-if corresponding files have not been closed). The effect of input-output
-for access types is unspecified.
+if corresponding files have not been closed). The effect of
+input-output for access types is unspecified.
7
-An open file has a current mode, which is a value of one of the
+An open file has a <current mode>, which is a value of one of the
following enumeration types:
8
- type File_Mode is (In_File, Inout_File, Out_File); -- for Direct_IO
+ type File_Mode is (In_File, Inout_File, Out_File); --< for Direct_IO>
9
These values correspond respectively to the cases where only
@@ -39385,7 +39445,7 @@ following enumeration types:
10/2
type File_Mode is (In_File, Out_File, Append_File);
- -- for Sequential_IO, Text_IO, Wide_Text_IO, Wide_Wide_Text_IO, and
Stream_IO
+ --< for Sequential_IO, Text_IO, Wide_Text_IO, Wide_Wide_Text_IO, and
Stream_IO>
11
These values correspond respectively to the cases where only
@@ -39405,7 +39465,7 @@ described in subclause *note A.10.2::.
The exceptions that can be propagated by the execution of an
input-output subprogram are defined in the package IO_Exceptions; the
situations in which they can be propagated are described following the
-description of the subprogram (and in subclause *note A.13::). The
+description of the subprogram (and in subclause *note A.13::). The
exceptions Storage_Error and Program_Error may be propagated.
(Program_Error can only be propagated due to errors made by the caller
of the subprogram.) Finally, exceptions can be propagated in certain
@@ -39435,12 +39495,12 @@ A.8 Sequential and Direct Files
1/2
Two kinds of access to external files are defined in this subclause:
-sequential access and direct access. The corresponding file types and
-the associated operations are provided by the generic packages
+<sequential access> and <direct access>. The corresponding file types
+and the associated operations are provided by the generic packages
Sequential_IO and Direct_IO. A file object to be used for sequential
-access is called a sequential file, and one to be used for direct access
-is called a direct file. Access to stream files is described in *note
-A.12.1::.
+access is called a <sequential file>, and one to be used for direct
+access is called a <direct file>. Access to <stream file>s is described
+in *note A.12.1::.
2
For sequential access, the file is viewed as a sequence of values that
@@ -39454,17 +39514,17 @@ transfer to the file starts after the last element of
the file.
For direct access, the file is viewed as a set of elements occupying
consecutive positions in linear order; a value can be transferred to or
from an element of the file at any selected position. The position of
-an element is specified by its index, which is a number, greater than
+an element is specified by its <index>, which is a number, greater than
zero, of the implementation-defined integer type Count. The first
element, if any, has index one; the index of the last element, if any,
-is called the current size; the current size is zero if there are no
+is called the <current size>; the current size is zero if there are no
elements. The current size is a property of the external file.
4
-An open direct file has a current index, which is the index that will be
-used by the next read or write operation. When a direct file is opened,
-the current index is set to one. The current index of a direct file is
-a property of a file object, not of an external file.
+An open direct file has a <current index>, which is the index that will
+be used by the next read or write operation. When a direct file is
+opened, the current index is set to one. The current index of a direct
+file is a property of a file object, not of an external file.
* Menu:
@@ -39498,7 +39558,7 @@ The generic library package Sequential_IO has the
following declaration:
type File_Mode is (In_File, Out_File, Append_File);
5
- -- File management
+ <-- File management>
6
procedure Create(File : in out File_Type;
@@ -39530,7 +39590,7 @@ The generic library package Sequential_IO has the
following declaration:
procedure Flush (File : in File_Type);
11
- -- Input and output operations
+ --< Input and output operations>
12
procedure Read (File : in File_Type; Item : out Element_Type);
@@ -39540,7 +39600,7 @@ The generic library package Sequential_IO has the
following declaration:
function End_Of_File(File : in File_Type) return Boolean;
14
- -- Exceptions
+ --< Exceptions>
15
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -39553,7 +39613,7 @@ The generic library package Sequential_IO has the
following declaration:
16
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Sequential_IO;
17/2
@@ -39577,7 +39637,7 @@ additional effects described in subclause *note
A.10.2::.
2
procedure Create(File : in out File_Type;
- Mode : in File_Mode := default_mode;
+ Mode : in File_Mode := <default_mode>;
Name : in String := "";
Form : in String := "");
@@ -39835,11 +39895,11 @@ The generic library package Direct_IO has the
following declaration:
4
type File_Mode is (In_File, Inout_File, Out_File);
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
5
- -- File management
+ --< File management>
6
procedure Create(File : in out File_Type;
@@ -39871,7 +39931,7 @@ The generic library package Direct_IO has the following
declaration:
procedure Flush (File : in File_Type);
11
- -- Input and output operations
+ --< Input and output operations>
12
procedure Read (File : in File_Type; Item : out Element_Type;
@@ -39894,7 +39954,7 @@ The generic library package Direct_IO has the following
declaration:
function End_Of_File(File : in File_Type) return Boolean;
17
- -- Exceptions
+ --< Exceptions>
18
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -39907,7 +39967,7 @@ The generic library package Direct_IO has the following
declaration:
19
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Direct_IO;
20/2
@@ -40034,12 +40094,12 @@ The generic library package Storage_IO has the
following declaration:
4
Buffer_Size : constant System.Storage_Elements.Storage_Count :=
- implementation-defined;
+ <implementation-defined>;
subtype Buffer_Type is
System.Storage_Elements.Storage_Array(1..Buffer_Size);
5
- -- Input and output operations
+ --< Input and output operations>
6
procedure Read (Buffer : in Buffer_Type; Item : out Element_Type);
@@ -40048,7 +40108,7 @@ The generic library package Storage_IO has the
following declaration:
procedure Write(Buffer : out Buffer_Type; Item : in Element_Type);
8
- -- Exceptions
+ --< Exceptions>
9
Data_Error : exception renames IO_Exceptions.Data_Error;
@@ -40134,14 +40194,14 @@ provided to change the current default error file.
7
From a logical point of view, a text file is a sequence of pages, a page
is a sequence of lines, and a line is a sequence of characters; the end
-of a line is marked by a line terminator; the end of a page is marked by
-the combination of a line terminator immediately followed by a page
-terminator; and the end of a file is marked by the combination of a line
-terminator immediately followed by a page terminator and then a file
-terminator. Terminators are generated during output; either by calls of
-procedures provided expressly for that purpose; or implicitly as part of
-other operations, for example, when a bounded line length, a bounded
-page length, or both, have been specified for a file.
+of a line is marked by a <line terminator>; the end of a page is marked
+by the combination of a line terminator immediately followed by a <page
+terminator>; and the end of a file is marked by the combination of a
+line terminator immediately followed by a page terminator and then a
+<file terminator>. Terminators are generated during output; either by
+calls of procedures provided expressly for that purpose; or implicitly
+as part of other operations, for example, when a bounded line length, a
+bounded page length, or both, have been specified for a file.
8
The actual nature of terminators is not defined by the language and
@@ -40152,11 +40212,11 @@ characters. Whether they are characters (and if so
which ones) in any
particular implementation need not concern a user who neither explicitly
outputs nor explicitly inputs control characters. The effect of input
(Get) or output (Put) of control characters (other than horizontal
-tabulation) is not specified by the language.
+tabulation) is not specified by the language.
9
The characters of a line are numbered, starting from one; the number of
-a character is called its column number. For a line terminator, a
+a character is called its <column number>. For a line terminator, a
column number is also defined: it is one more than the number of
characters in the line. The lines of a page, and the pages of a file,
are similarly numbered. The current column number is the column number
@@ -40167,13 +40227,13 @@ subtype Positive_Count of the type Count (by
convention, the value zero
of the type Count is used to indicate special conditions).
10
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
11
-For an output file or an append file, a maximum line length can be
-specified and a maximum page length can be specified. If a value to be
-output cannot fit on the current line, for a specified maximum line
+For an output file or an append file, a <maximum line length> can be
+specified and a <maximum page length> can be specified. If a value to
+be output cannot fit on the current line, for a specified maximum line
length, then a new line is automatically started before the value is
output; if, further, this new line cannot fit on the current page, for a
specified maximum page length, then a new page is automatically started
@@ -40222,19 +40282,19 @@ The library package Text_IO has the following
declaration:
type File_Mode is (In_File, Out_File, Append_File);
5
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
- Unbounded : constant Count := 0; -- line and page length
+ Unbounded : constant Count := 0; --< line and page length>
6
- subtype Field is Integer range 0 .. implementation-defined;
+ subtype Field is Integer range 0 .. <implementation-defined>;
subtype Number_Base is Integer range 2 .. 16;
7
type Type_Set is (Lower_Case, Upper_Case);
8
- -- File Management
+ --< File Management>
9
procedure Create (File : in out File_Type;
@@ -40263,7 +40323,7 @@ The library package Text_IO has the following
declaration:
function Is_Open(File : in File_Type) return Boolean;
14
- -- Control of default input and output files
+ --< Control of default input and output files>
15
procedure Set_Input (File : in File_Type);
@@ -40294,12 +40354,12 @@ The library package Text_IO has the following
declaration:
function Current_Error return File_Access;
21/1
- --Buffer control
+ --<Buffer control>
procedure Flush (File : in File_Type);
procedure Flush;
22
- -- Specification of line and page lengths
+ --< Specification of line and page lengths>
23
procedure Set_Line_Length(File : in File_Type; To : in Count);
@@ -40318,7 +40378,7 @@ The library package Text_IO has the following
declaration:
function Page_Length return Count;
27
- -- Column, Line, and Page Control
+ --< Column, Line, and Page Control>
28
procedure New_Line (File : in File_Type;
@@ -40371,7 +40431,7 @@ The library package Text_IO has the following
declaration:
function Page return Positive_Count;
40
- -- Character Input-Output
+ --< Character Input-Output>
41
procedure Get(File : in File_Type; Item : out Character);
@@ -40401,7 +40461,7 @@ The library package Text_IO has the following
declaration:
Available : out Boolean);
46
- -- String Input-Output
+ --< String Input-Output>
47
procedure Get(File : in File_Type; Item : out String);
@@ -40426,7 +40486,7 @@ The library package Text_IO has the following
declaration:
procedure Put_Line(Item : in String);
51
- -- Generic packages for Input-Output of Integer Types
+ --< Generic packages for Input-Output of Integer Types>
52
generic
@@ -40497,7 +40557,7 @@ The library package Text_IO has the following
declaration:
end Modular_IO;
62
- -- Generic packages for Input-Output of Real Types
+ --< Generic packages for Input-Output of Real Types>
63
generic
@@ -40614,7 +40674,7 @@ The library package Text_IO has the following
declaration:
end Decimal_IO;
78
- -- Generic package for Input-Output of Enumeration Types
+ --< Generic package for Input-Output of Enumeration Types>
79
generic
@@ -40649,7 +40709,7 @@ The library package Text_IO has the following
declaration:
end Enumeration_IO;
84
- -- Exceptions
+ --< Exceptions>
85
Status_Error : exception renames IO_Exceptions.Status_Error;
@@ -40661,7 +40721,7 @@ The library package Text_IO has the following
declaration:
Data_Error : exception renames IO_Exceptions.Data_Error;
Layout_Error : exception renames IO_Exceptions.Layout_Error;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Text_IO;
86/2
@@ -40840,7 +40900,7 @@ current default input, default output, or default error
file, and if the
corresponding file object is closed or no longer exists.
23/1
-This paragraph was deleted.
+<This paragraph was deleted.>
NOTES
@@ -41238,13 +41298,13 @@ considerations apply to the procedures Get_Line,
Put_Line, and Set_Col.
4
Several Get and Put procedures, for numeric and enumeration types, have
-format parameters which specify field lengths; these parameters are of
+<format> parameters which specify field lengths; these parameters are of
the nonnegative subtype Field of the type Integer.
5/2
Input-output of enumeration values uses the syntax of the corresponding
lexical elements. Any Get procedure for an enumeration type begins by
-skipping any leading blanks, or line or page terminators. A blank is
+skipping any leading blanks, or line or page terminators. A <blank> is
defined as a space or a horizontal tabulation character. Next,
characters are input only so long as the sequence input is an initial
sequence of an identifier or of a character literal (in particular,
@@ -41317,17 +41377,17 @@ transferred: they are shown only to reveal the layout
and spaces.
Get(N);
13
- -- Characters at input Sequence input Value of N
+ <-- Characters at input Sequence input Value of N>
- -- bb-12535b -12535 -12535
- -- bb12_535e1b 12_535e1 125350
- -- bb12_535e; 12_535e (none) Data_Error raised
+ <-- bb-12535b -12535 -12535>
+ <-- bb12_535e1b 12_535e1 125350>
+ <-- bb12_535e; 12_535e (none) Data_Error raised>
14
Example of overridden width parameter:
15
- Put(Item => -23, Width => 2); -- "-23"
+ Put(Item => -23, Width => 2); --< "-23">
File: arm2012.info, Node: A.10.7, Next: A.10.8, Prev: A.10.6, Up: A.10
@@ -41376,7 +41436,7 @@ For an item of type Character the following procedures
are provided:
Mode_Error is propagated if the mode of the file is not
In_File. Sets End_Of_Line to True if at end of line,
including if at end of page or at end of file; in each of
- these cases the value of Item is not specified. Otherwise,
+ these cases the value of Item is not specified. Otherwise,
End_Of_Line is set to False and Item is set to the next
character (without consuming it) from the file.
@@ -41406,8 +41466,8 @@ For an item of type Character the following procedures
are provided:
character is read; Available is True and Item contains the
value of this character. If a character is not available,
then Available is False and the value of Item is not
- specified. Status_Error is propagated if the file is not open.
- Mode_Error is propagated if the mode of the file is not
+ specified. Status_Error is propagated if the file is not
+ open. Mode_Error is propagated if the mode of the file is not
In_File. End_Error is propagated if at the end of the file.
The current column, line and page numbers for the file are not
affected.
@@ -41467,7 +41527,7 @@ For an item of type String the following subprograms
are provided:
Reading stops if the end of the string is met. Reading also
stops if the end of the line is met before meeting the end of
the string; in this case Skip_Line is (in effect) called with
- a spacing of 1. The values of characters not assigned are not
+ a spacing of 1. The values of characters not assigned are not
specified.
20
@@ -41654,20 +41714,20 @@ The nongeneric equivalent packages may, but need not,
be actual
instantiations of the generic package for the appropriate predefined
type.
-Paragraphs 24 and 25 were deleted.
+<Paragraphs 24 and 25 were deleted.>
_Examples_
26/3
subtype Byte_Int is Integer range -127 .. 127;
package Int_IO is new Integer_IO(Byte_Int); use Int_IO;
- -- default format used at instantiation,
- -- Default_Width = 4, Default_Base = 10
+ --< default format used at instantiation,>
+ --< Default_Width = 4, Default_Base = 10>
27
- Put(126); -- "b126"
- Put(-126, 7); -- "bbb-126"
- Put(126, Width => 13, Base => 2); -- "bbb2#1111110#"
+ Put(126); --< "b126">
+ Put(-126, 7); --< "bbb-126">
+ Put(126, Width => 13, Base => 2); --< "bbb2#1111110#">
File: arm2012.info, Node: A.10.9, Next: A.10.10, Prev: A.10.8, Up: A.10
@@ -41891,19 +41951,19 @@ type.
_Examples_
40/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
41
package Real_IO is new Float_IO(Real); use Real_IO;
- -- default format used at instantiation, Default_Exp = 3
+ --< default format used at instantiation, Default_Exp = 3>
42
- X : Real := -123.4567; -- digits 8 (see *note 3.5.7::)
+ X : Real := -123.4567; --< digits 8 (see *note 3.5.7::)>
43
- Put(X); -- default format "-1.2345670E+02"
- Put(X, Fore => 5, Aft => 3, Exp => 2); -- "bbb-1.235E+2"
- Put(X, 5, 3, 0); -- "b-123.457"
+ Put(X); <-- default format> <"-1.2345670E+02">
+ Put(X, Fore => 5, Aft => 3, Exp => 2); <-- "bbb-1.235E+2">
+ Put(X, 5, 3, 0); <-- "b-123.457">
File: arm2012.info, Node: A.10.10, Next: A.10.11, Prev: A.10.9, Up: A.10
@@ -42020,11 +42080,11 @@ is not defined by the language.
for enumeration values. Thus
19
- Ada.Text_IO.Put('A'); -- outputs the character A
+ Ada.Text_IO.Put('A'); --< outputs the character A>
20
package Char_IO is new Ada.Text_IO.Enumeration_IO(Character);
- Char_IO.Put('A'); -- outputs the character 'A', between
apostrophes
+ Char_IO.Put('A'); --< outputs the character 'A', between
apostrophes>
21
37 The type Boolean is an enumeration type, hence Enumeration_IO
@@ -42310,9 +42370,9 @@ The specification of package Wide_Wide_Text_IO is the
same as that for
Text_IO, except that in each Get, Look_Ahead, Get_Immediate, Get_Line,
Put, and Put_Line subprogram, any occurrence of Character is replaced by
Wide_Wide_Character, and any occurrence of String is replaced by
-Wide_Wide_String. Nongeneric equivalents of Wide_Wide_Text_IO.Integer_IO
-and Wide_Wide_Text_IO.Float_IO are provided (as for Text_IO) for each
-predefined numeric type, with names such as
+Wide_Wide_String. Nongeneric equivalents of
+Wide_Wide_Text_IO.Integer_IO and Wide_Wide_Text_IO.Float_IO are provided
+(as for Text_IO) for each predefined numeric type, with names such as
Ada.Integer_Wide_Wide_Text_IO, Ada.Long_Integer_Wide_Wide_Text_IO,
Ada.Float_Wide_Wide_Text_IO, Ada.Long_Float_Wide_Wide_Text_IO.
@@ -42399,9 +42459,9 @@ The library package Streams.Stream_IO has the following
declaration:
type File_Mode is (In_File, Out_File, Append_File);
7
- type Count is range 0 .. implementation-defined;
+ type Count is range 0 .. <implementation-defined>;
subtype Positive_Count is Count range 1 .. Count'Last;
- -- Index into file, in stream elements.
+ -- <Index into file, in stream elements.>
8
procedure Create (File : in out File_Type;
@@ -42432,13 +42492,13 @@ The library package Streams.Stream_IO has the
following declaration:
13
function Stream (File : in File_Type) return Stream_Access;
- -- Return stream access for use with T'Input and T'Output
+ -- <Return stream access for use with T'Input and T'Output>
14/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
15
- -- Read array of stream elements from file
+ -- <Read array of stream elements from file>
procedure Read (File : in File_Type;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset;
@@ -42450,10 +42510,10 @@ The library package Streams.Stream_IO has the
following declaration:
Last : out Stream_Element_Offset);
17/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
18
- -- Write array of stream elements into file
+ -- <Write array of stream elements into file>
procedure Write (File : in File_Type;
Item : in Stream_Element_Array;
To : in Positive_Count);
@@ -42463,10 +42523,10 @@ The library package Streams.Stream_IO has the
following declaration:
Item : in Stream_Element_Array);
20/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
21
- -- Operations on position within file
+ -- <Operations on position within file>
22
procedure Set_Index(File : in File_Type; To : in Positive_Count);
@@ -42482,7 +42542,7 @@ The library package Streams.Stream_IO has the following
declaration:
procedure Flush(File : in File_Type);
26
- -- exceptions
+ -- <exceptions>
Status_Error : exception renames IO_Exceptions.Status_Error;
Mode_Error : exception renames IO_Exceptions.Mode_Error;
Name_Error : exception renames IO_Exceptions.Name_Error;
@@ -42493,7 +42553,7 @@ The library package Streams.Stream_IO has the following
declaration:
27
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Streams.Stream_IO;
27.1/2
@@ -42526,7 +42586,7 @@ Append_File, the file is positioned to its end;
otherwise, the position
in the file is unchanged.
28.6/4
-This paragraph was deleted.
+<This paragraph was deleted.>
29/1
The Stream function returns a Stream_Access result from a File_Type
@@ -42589,7 +42649,7 @@ If positioning is not supported for the given file,
then a call of Index
or Set_Index propagates Use_Error. Similarly, a call of Read or Write
with a Positive_Count parameter propagates Use_Error.
-Paragraphs 34 through 36 were deleted.
+<Paragraphs 34 through 36 were deleted.>
_Erroneous Execution_
@@ -42818,7 +42878,7 @@ If the element read by the procedure Read (or by the
Read attribute)
cannot be interpreted as a value of the required subtype, but this is
not detected and Data_Error is not propagated, then the resulting value
can be abnormal, and subsequent references to the value can lead to
-erroneous execution, as explained in *note 13.9.1::.
+erroneous execution, as explained in *note 13.9.1::.
File: arm2012.info, Node: A.14, Next: A.15, Prev: A.13, Up: Annex A
@@ -42838,7 +42898,7 @@ supported by the implementation, the following effects
are defined:
and page numbers of any other file object.
3/1
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
4
* For direct and stream files, the current index is a property of
@@ -42882,7 +42942,7 @@ The library package Ada.Command_Line has the following
declaration:
function Command_Name return String;
7
- type Exit_Status is implementation-defined integer type;
+ type Exit_Status is <implementation-defined integer type>;
8
Success : constant Exit_Status;
@@ -42893,7 +42953,7 @@ The library package Ada.Command_Line has the following
declaration:
10
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Command_Line;
@@ -42914,7 +42974,7 @@ The library package Ada.Command_Line has the following
declaration:
If the external execution environment supports passing
arguments to a program, then Argument returns an
implementation-defined value corresponding to the argument at
- relative position Number. If Number is outside the range
+ relative position Number. If Number is outside the range
1..Argument_Count, then Constraint_Error is propagated.
15
@@ -42928,7 +42988,7 @@ The library package Ada.Command_Line has the following
declaration:
the null string.
16.1/1
- type Exit_Status is implementation-defined integer type;
+ type Exit_Status is <implementation-defined integer type>;
17
The type Exit_Status represents the range of exit status
@@ -42988,7 +43048,7 @@ The library package Directories has the following
declaration:
package Ada.Directories is
4/2
- -- Directory and file operations:
+ -- <Directory and file operations:>
5/2
function Current_Directory return String;
@@ -43022,7 +43082,7 @@ The library package Directories has the following
declaration:
Form : in String := "");
14/2
- -- File and directory name operations:
+ -- <File and directory name operations:>
15/2
function Full_Name (Name : in String) return String;
@@ -43052,13 +43112,13 @@ The library package Directories has the following
declaration:
function Name_Case_Equivalence (Name : in String) return
Name_Case_Kind;
21/2
- -- File and directory queries:
+ -- <File and directory queries:>
22/2
type File_Kind is (Directory, Ordinary_File, Special_File);
23/2
- type File_Size is range 0 .. implementation-defined;
+ type File_Size is range 0 .. <implementation-defined>;
24/2
function Exists (Name : in String) return Boolean;
@@ -43073,7 +43133,7 @@ The library package Directories has the following
declaration:
function Modification_Time (Name : in String) return Ada.Calendar.Time;
28/2
- -- Directory searching:
+ -- <Directory searching:>
29/2
type Directory_Entry_Type is limited private;
@@ -43109,7 +43169,7 @@ The library package Directories has the following
declaration:
Directory_Entry : in Directory_Entry_Type));
37/2
- -- Operations on Directory Entries:
+ -- <Operations on Directory Entries:>
38/2
function Simple_Name (Directory_Entry : in Directory_Entry_Type)
@@ -43139,42 +43199,43 @@ The library package Directories has the following
declaration:
44/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Directories;
45/2
External files may be classified as directories, special files, or
-ordinary files. A directory is an external file that is a container for
-files on the target system. A special file is an external file that
-cannot be created or read by a predefined Ada input-output package.
+ordinary files. A <directory> is an external file that is a container
+for files on the target system. A <special file> is an external file
+that cannot be created or read by a predefined Ada input-output package.
External files that are not special files or directories are called
-ordinary files.
+<ordinary files>.
46/2
-A file name is a string identifying an external file. Similarly, a
-directory name is a string identifying a directory. The interpretation
-of file names and directory names is implementation-defined.
+A <file name> is a string identifying an external file. Similarly, a
+<directory name> is a string identifying a directory. The
+interpretation of file names and directory names is
+implementation-defined.
47/2
-The full name of an external file is a full specification of the name of
-the file. If the external environment allows alternative specifications
-of the name (for example, abbreviations), the full name should not use
-such alternatives. A full name typically will include the names of all
-of the directories that contain the item. The simple name of an
-external file is the name of the item, not including any containing
-directory names. Unless otherwise specified, a file name or directory
-name parameter in a call to a predefined Ada input-output subprogram can
-be a full name, a simple name, or any other form of name supported by
-the implementation.
+The <full name> of an external file is a full specification of the name
+of the file. If the external environment allows alternative
+specifications of the name (for example, abbreviations), the full name
+should not use such alternatives. A full name typically will include
+the names of all of the directories that contain the item. The <simple
+name> of an external file is the name of the item, not including any
+containing directory names. Unless otherwise specified, a file name or
+directory name parameter in a call to a predefined Ada input-output
+subprogram can be a full name, a simple name, or any other form of name
+supported by the implementation.
48/2
-The default directory is the directory that is used if a directory or
+The <default directory> is the directory that is used if a directory or
file name is not a full name (that is, when the name does not fully
-identify all of the containing directories).
+identify all of the containing directories).
49/2
-A directory entry is a single item in a directory, identifying a single
-external file (including directories and special files).
+A <directory entry> is a single item in a directory, identifying a
+single external file (including directories and special files).
50/2
For each function that returns a string, the lower bound of the returned
@@ -43418,7 +43479,7 @@ The following file and directory queries and types are
provided:
an external file or directory.
86/2
- type File_Size is range 0 .. implementation-defined;
+ type File_Size is range 0 .. <implementation-defined>;
87/2
The type File_Size represents the size of an external file.
@@ -43893,7 +43954,7 @@ A.17 The Package Environment_Variables
The package Environment_Variables allows a program to read or modify
environment variables. Environment variables are name-value pairs,
where both the name and value are strings. The definition of what
-constitutes an environment variable, and the meaning of the name and
+constitutes an <environment variable>, and the meaning of the name and
value, are implementation defined.
_Static Semantics_
@@ -44079,38 +44140,38 @@ of elements.
2/2
A variety of sequence and associative containers are provided. Each
-container includes a cursor type. A cursor is a reference to an element
-within a container. Many operations on cursors are common to all of the
-containers. A cursor referencing an element in a container is
-considered to be overlapping with the container object itself.
+container includes a <cursor> type. A cursor is a reference to an
+element within a container. Many operations on cursors are common to
+all of the containers. A cursor referencing an element in a container
+is considered to be overlapping with the container object itself.
3/2
Within this clause we provide Implementation Advice for the desired
average or worst case time complexity of certain operations on a
-container. This advice is expressed using the Landau symbol O(X).
+container. This advice is expressed using the Landau symbol <O>(X).
Presuming f is some function of a length parameter N and t(N) is the
time the operation takes (on average or worst case, as specified) for
-the length N, a complexity of O(f(N)) means that there exists a finite A
-such that for any N, t(N)/f(N) < A.
+the length N, a complexity of <O>(f(N)) means that there exists a finite
+A such that for any N, t(N)/f(N) < A.
4/2
-If the advice suggests that the complexity should be less than O(f(N)),
-then for any arbitrarily small positive real D, there should exist a
-positive integer M such that for all N > M, t(N)/f(N) < D.
+If the advice suggests that the complexity should be less than
+<O>(f(N)), then for any arbitrarily small positive real D, there should
+exist a positive integer M such that for all N > M, t(N)/f(N) < D.
5/3
When a formal function is used to provide an ordering for a container,
it is generally required to define a strict weak ordering. A function
-"<" defines a strict weak ordering if it is irreflexive, asymmetric,
-transitive, and in addition, if x < y for any values x and y, then for
-all other values z, (x < z) or (z < y).
+"<" defines a <strict weak ordering> if it is irreflexive, asymmetric,
+transitive, and in addition, if <x> < <y> for any values <x> and <y>,
+then for all other values <z>, (<x> < <z>) or (<z> < <y>).
_Static Semantics_
6/4
Certain subprograms declared within instances of some of the generic
-packages presented in this clause are said to perform indefinite
-insertion. These subprograms are those corresponding (in the sense of
+packages presented in this clause are said to <perform indefinite
+insertion>. These subprograms are those corresponding (in the sense of
the copying described in subclause *note 12.3::) to subprograms that
have formal parameters of a generic formal indefinite type and that are
identified as performing indefinite insertion in the subclause defining
@@ -44194,10 +44255,10 @@ The library package Containers has the following
declaration:
pragma Pure(Containers);
4/2
- type Hash_Type is mod implementation-defined;
+ type Hash_Type is mod <implementation-defined>;
5/2
- type Count_Type is range 0 .. implementation-defined;
+ type Count_Type is range 0 .. <implementation-defined>;
5.1/3
Capacity_Error : exception;
@@ -44231,12 +44292,12 @@ types Vector and Cursor, and a set of operations for
each type. A
vector container allows insertion and deletion at any position, but it
is specifically optimized for insertion and deletion at the high end
(the end with the higher index) of the container. A vector container
-also provides random access to its elements.
+also provides random access to its elements.
2/2
A vector container behaves conceptually as an array that expands as
-necessary as items are inserted. The length of a vector is the number
-of elements that the vector contains. The capacity of a vector is the
+necessary as items are inserted. The <length> of a vector is the number
+of elements that the vector contains. The <capacity> of a vector is the
maximum number of elements that can be inserted into the vector prior to
it being automatically expanded.
@@ -44246,7 +44307,7 @@ generic formal type. The first element of a vector
always has its index
value equal to the lower bound of the formal type.
4/2
-A vector container may contain empty elements. Empty elements do not
+A vector container may contain <empty elements>. Empty elements do not
have a specified value.
_Static Semantics_
@@ -44598,7 +44659,7 @@ declaration:
Item : Element_Type) return Boolean;
72/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
73/2
procedure Iterate
@@ -44641,7 +44702,7 @@ declaration:
private
81/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
82/2
end Ada.Containers.Vectors;
@@ -44678,13 +44739,13 @@ Execution of the default implementation of the Input,
Output, Read, or
Write attribute of type Cursor raises Program_Error.
88.1/3
-Vector'Write for a Vector object V writes Length(V) elements of the
+Vector'Write for a Vector object <V> writes Length(<V>) elements of the
vector to the stream. It also may write additional information about
the vector.
88.2/3
Vector'Read reads the representation of a vector from the stream, and
-assigns to Item a vector with the same length and elements as was
+assigns to <Item> a vector with the same length and elements as was
written by Vector'Write.
89/2
@@ -44708,44 +44769,45 @@ constant, and others check for "tampering with
elements" of a container
because they depend on elements of the container not being replaced.
91/2
-A subprogram is said to tamper with cursors of a vector object V if:
+A subprogram is said to <tamper with cursors> of a vector object <V> if:
92/2
- * it inserts or deletes elements of V, that is, it calls the Insert,
- Insert_Space, Clear, Delete, or Set_Length procedures with V as a
- parameter; or
+ * it inserts or deletes elements of <V>, that is, it calls the
+ Insert, Insert_Space, Clear, Delete, or Set_Length procedures with
+ <V> as a parameter; or
93/2
- * it finalizes V; or
+ * it finalizes <V>; or
93.1/3
- * it calls the Assign procedure with V as the Target parameter; or
+ * it calls the Assign procedure with <V> as the Target parameter; or
94/2
- * it calls the Move procedure with V as a parameter.
+ * it calls the Move procedure with <V> as a parameter.
95/2
-A subprogram is said to tamper with elements of a vector object V if:
+A subprogram is said to <tamper with elements> of a vector object <V>
+if:
96/2
- * it tampers with cursors of V; or
+ * it tampers with cursors of <V>; or
97/2
- * it replaces one or more elements of V, that is, it calls the
+ * it replaces one or more elements of <V>, that is, it calls the
Replace_Element, Reverse_Elements, or Swap procedures or the Sort
- or Merge procedures of an instance of Generic_Sorting with V as a
+ or Merge procedures of an instance of Generic_Sorting with <V> as a
parameter.
97.1/4
-When tampering with cursors is prohibited for a particular vector object
-V, Program_Error is propagated by a call of any language-defined
-subprogram that is defined to tamper with the cursors of V, leaving V
-unmodified. Similarly, when tampering with elements is prohibited for a
-particular vector object V, Program_Error is propagated by a call of any
-language-defined subprogram that is defined to tamper with the elements
-of V (or tamper with the cursors of V), leaving V unmodified. These
-checks are made before any other defined behavior of the body of the
-language-defined subprogram.
+When tampering with cursors is <prohibited> for a particular vector
+object <V>, Program_Error is propagated by a call of any
+language-defined subprogram that is defined to tamper with the cursors
+of <V>, leaving <V> unmodified. Similarly, when tampering with elements
+is <prohibited> for a particular vector object <V>, Program_Error is
+propagated by a call of any language-defined subprogram that is defined
+to tamper with the elements of <V> (or tamper with the cursors of <V>),
+leaving <V> unmodified. These checks are made before any other defined
+behavior of the body of the language-defined subprogram.
97.2/3
function Has_Element (Position : Cursor) return Boolean;
@@ -45157,14 +45219,14 @@ language-defined subprogram.
If Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Length(New_Item) is 0, then Insert does
- nothing. Otherwise, it computes the new length NL as the sum
- of the current length and Length (New_Item); if the value of
- Last appropriate for length NL would be greater than
+ nothing. Otherwise, it computes the new length <NL> as the
+ sum of the current length and Length (New_Item); if the value
+ of Last appropriate for length <NL> would be greater than
Index_Type'Last, then Constraint_Error is propagated.
152/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert slides the elements in the range
Before .. Last_Index (Container) up by Length(New_Item)
positions, and then copies the elements of New_Item to the
@@ -45193,10 +45255,10 @@ language-defined subprogram.
156/2
If Before is not No_Element, and does not designate an element
in Container, then Program_Error is propagated. If Before
- equals No_Element, then let T be Last_Index (Container) + 1;
- otherwise, let T be To_Index (Before). Insert (Container, T,
- New_Item) is called, and then Position is set to To_Cursor
- (Container, T).
+ equals No_Element, then let <T> be Last_Index (Container) + 1;
+ otherwise, let <T> be To_Index (Before). Insert (Container,
+ <T>, New_Item) is called, and then Position is set to
+ To_Cursor (Container, <T>).
157/2
procedure Insert (Container : in out Vector;
@@ -45238,14 +45300,14 @@ language-defined subprogram.
If Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Count is 0, then Insert does nothing.
- Otherwise, it computes the new length NL as the sum of the
+ Otherwise, it computes the new length <NL> as the sum of the
current length and Count; if the value of Last appropriate for
- length NL would be greater than Index_Type'Last, then
+ length <NL> would be greater than Index_Type'Last, then
Constraint_Error is propagated.
165/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert slides the elements in the range
Before .. Last_Index (Container) up by Count positions, and
then inserts elements that are initialized by default (see
@@ -45260,10 +45322,10 @@ language-defined subprogram.
167/2
If Before is not No_Element, and does not designate an element
in Container, then Program_Error is propagated. If Before
- equals No_Element, then let T be Last_Index (Container) + 1;
- otherwise, let T be To_Index (Before). Insert (Container, T,
- Count) is called, and then Position is set to To_Cursor
- (Container, T).
+ equals No_Element, then let <T> be Last_Index (Container) + 1;
+ otherwise, let <T> be To_Index (Before). Insert (Container,
+ <T>, Count) is called, and then Position is set to To_Cursor
+ (Container, <T>).
168/4
procedure Prepend (Container : in out Vector;
@@ -45308,14 +45370,14 @@ language-defined subprogram.
If Before is not in the range First_Index (Container) ..
Last_Index (Container) + 1, then Constraint_Error is
propagated. If Count is 0, then Insert_Space does nothing.
- Otherwise, it computes the new length NL as the sum of the
+ Otherwise, it computes the new length <NL> as the sum of the
current length and Count; if the value of Last appropriate for
- length NL would be greater than Index_Type'Last, then
+ length <NL> would be greater than Index_Type'Last, then
Constraint_Error is propagated.
178/2
- If the current vector capacity is less than NL,
- Reserve_Capacity (Container, NL) is called to increase the
+ If the current vector capacity is less than <NL>,
+ Reserve_Capacity (Container, <NL>) is called to increase the
vector capacity. Then Insert_Space slides the elements in the
range Before .. Last_Index (Container) up by Count positions,
and then inserts empty elements in the positions starting at
@@ -45330,10 +45392,10 @@ language-defined subprogram.
180/2
If Before is not No_Element, and does not designate an element
in Container, then Program_Error is propagated. If Before
- equals No_Element, then let T be Last_Index (Container) + 1;
- otherwise, let T be To_Index (Before). Insert_Space
- (Container, T, Count) is called, and then Position is set to
- To_Cursor (Container, T).
+ equals No_Element, then let <T> be Last_Index (Container) + 1;
+ otherwise, let <T> be To_Index (Before). Insert_Space
+ (Container, <T>, Count) is called, and then Position is set to
+ To_Cursor (Container, <T>).
181/2
procedure Delete (Container : in out Vector;
@@ -45551,7 +45613,7 @@ language-defined subprogram.
224/2
Equivalent to Has_Element (Find (Container, Item)).
- Paragraphs 225 and 226 were moved above.
+ <Paragraphs 225 and 226 were moved above.>
227/2
procedure Iterate
@@ -45691,8 +45753,8 @@ operation either proceeds as it would for an empty
container, or it
raises Constraint_Error or Program_Error.
240/2
-A Cursor value is ambiguous if any of the following have occurred since
-it was created:
+A Cursor value is <ambiguous> if any of the following have occurred
+since it was created:
241/2
* Insert, Insert_Space, or Delete has been called on the vector that
@@ -45727,8 +45789,8 @@ invalid, see below) cursor parameter. Possible results
are:
_Erroneous Execution_
248/2
-A Cursor value is invalid if any of the following have occurred since it
-was created:
+A Cursor value is <invalid> if any of the following have occurred since
+it was created:
249/2
* The vector that contains the element it designates has been
@@ -45775,23 +45837,23 @@ that of the source object.
255/2
Containers.Vectors should be implemented similarly to an array. In
-particular, if the length of a vector is N, then
+particular, if the length of a vector is <N>, then
256/2
- * the worst-case time complexity of Element should be O(log N);
+ * the worst-case time complexity of Element should be <O>(log <N>);
257/2
- * the worst-case time complexity of Append with Count=1 when N is
- less than the capacity of the vector should be O(log N); and
+ * the worst-case time complexity of Append with Count=1 when <N> is
+ less than the capacity of the vector should be <O>(log <N>); and
258/2
* the worst-case time complexity of Prepend with Count=1 and
- Delete_First with Count=1 should be O(N log N).
+ Delete_First with Count=1 should be <O>(<N> log <N>).
259/2
The worst-case time complexity of a call on procedure Sort of an
-instance of Containers.Vectors.Generic_Sorting should be O(N**2), and
-the average time complexity should be better than O(N**2).
+instance of Containers.Vectors.Generic_Sorting should be <O>(<N>**2),
+and the average time complexity should be better than <O>(<N>**2).
260/2
Containers.Vectors.Generic_Sorting.Sort and
@@ -45830,11 +45892,11 @@ A.18.3 The Generic Package
Containers.Doubly_Linked_Lists
The language-defined generic package Containers.Doubly_Linked_Lists
provides private types List and Cursor, and a set of operations for each
type. A list container is optimized for insertion and deletion at any
-position.
+position.
2/2
A doubly-linked list container object manages a linked list of internal
-nodes, each of which contains an element and pointers to the next
+<nodes>, each of which contains an element and pointers to the next
(successor) and previous (predecessor) internal nodes. A cursor
designates a particular node within a list (and by extension the element
contained in that node). A cursor keeps designating the same node (and
@@ -45842,7 +45904,7 @@ element) as long as the node is part of the container,
even if the node
is moved in the container.
3/2
-The length of a list is the number of elements it contains.
+The <length> of a list is the number of elements it contains.
_Static Semantics_
@@ -46059,7 +46121,7 @@ following declaration:
Item : Element_Type) return Boolean;
44/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
45/2
procedure Iterate
@@ -46102,7 +46164,7 @@ following declaration:
private
53/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
54/2
end Ada.Containers.Doubly_Linked_Lists;
@@ -46140,13 +46202,13 @@ Execution of the default implementation of the Input,
Output, Read, or
Write attribute of type Cursor raises Program_Error.
60.1/3
-List'Write for a List object L writes Length(L) elements of the list to
-the stream. It also may write additional information about the list.
+List'Write for a List object <L> writes Length(<L>) elements of the list
+to the stream. It also may write additional information about the list.
60.2/3
List'Read reads the representation of a list from the stream, and
-assigns to Item a list with the same length and elements as was written
-by List'Write.
+assigns to <Item> a list with the same length and elements as was
+written by List'Write.
61/2
Some operations of this generic package have access-to-subprogram
@@ -46158,47 +46220,48 @@ constant, and others check for "tampering with
elements" of a container
because they depend on elements of the container not being replaced.
62/2
-A subprogram is said to tamper with cursors of a list object L if:
+A subprogram is said to <tamper with cursors> of a list object <L> if:
63/2
- * it inserts or deletes elements of L, that is, it calls the Insert,
- Clear, Delete, or Delete_Last procedures with L as a parameter; or
+ * it inserts or deletes elements of <L>, that is, it calls the
+ Insert, Clear, Delete, or Delete_Last procedures with <L> as a
+ parameter; or
64/2
- * it reorders the elements of L, that is, it calls the Splice,
+ * it reorders the elements of <L>, that is, it calls the Splice,
Swap_Links, or Reverse_Elements procedures or the Sort or Merge
- procedures of an instance of Generic_Sorting with L as a parameter;
- or
+ procedures of an instance of Generic_Sorting with <L> as a
+ parameter; or
65/2
- * it finalizes L; or
+ * it finalizes <L>; or
65.1/3
- * it calls the Assign procedure with L as the Target parameter; or
+ * it calls the Assign procedure with <L> as the Target parameter; or
66/2
- * it calls the Move procedure with L as a parameter.
+ * it calls the Move procedure with <L> as a parameter.
67/2
-A subprogram is said to tamper with elements of a list object L if:
+A subprogram is said to <tamper with elements> of a list object <L> if:
68/2
- * it tampers with cursors of L; or
+ * it tampers with cursors of <L>; or
69/2
- * it replaces one or more elements of L, that is, it calls the
- Replace_Element or Swap procedures with L as a parameter.
+ * it replaces one or more elements of <L>, that is, it calls the
+ Replace_Element or Swap procedures with <L> as a parameter.
69.1/4
-When tampering with cursors is prohibited for a particular list object
-L, Program_Error is propagated by a call of any language-defined
-subprogram that is defined to tamper with the cursors of L, leaving L
-unmodified. Similarly, when tampering with elements is prohibited for a
-particular list object L, Program_Error is propagated by a call of any
-language-defined subprogram that is defined to tamper with the elements
-of L (or tamper with the cursors of L), leaving L unmodified. These
-checks are made before any other defined behavior of the body of the
-language-defined subprogram.
+When tampering with cursors is <prohibited> for a particular list object
+<L>, Program_Error is propagated by a call of any language-defined
+subprogram that is defined to tamper with the cursors of <L>, leaving
+<L> unmodified. Similarly, when tampering with elements is <prohibited>
+for a particular list object <L>, Program_Error is propagated by a call
+of any language-defined subprogram that is defined to tamper with the
+elements of <L> (or tamper with the cursors of <L>), leaving <L>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
69.2/3
function Has_Element (Position : Cursor) return Boolean;
@@ -46660,7 +46723,7 @@ language-defined subprogram.
138/2
Equivalent to Find (Container, Item) /= No_Element.
- Paragraphs 139 and 140 were moved above.
+ <Paragraphs 139 and 140 were moved above.>
141/2
procedure Iterate
@@ -46796,8 +46859,8 @@ raises Constraint_Error or Program_Error.
_Erroneous Execution_
153/2
-A Cursor value is invalid if any of the following have occurred since it
-was created:
+A Cursor value is <invalid> if any of the following have occurred since
+it was created:
154/2
* The list that contains the element it designates has been
@@ -46820,7 +46883,7 @@ was created:
The result of "=" or Has_Element is unspecified if it is called with an
invalid cursor parameter. Execution is erroneous if any other
subprogram declared in Containers.Doubly_Linked_Lists is called with an
-invalid cursor parameter.
+invalid cursor parameter.
157.1/3
Execution is erroneous if the list associated with the result of a call
@@ -46843,14 +46906,15 @@ source object.
160/2
Containers.Doubly_Linked_Lists should be implemented similarly to a
-linked list. In particular, if N is the length of a list, then the
+linked list. In particular, if <N> is the length of a list, then the
worst-case time complexity of Element, Insert with Count=1, and Delete
-with Count=1 should be O(log N).
+with Count=1 should be <O>(log <N>).
161/2
The worst-case time complexity of a call on procedure Sort of an
instance of Containers.Doubly_Linked_Lists.Generic_Sorting should be
-O(N**2), and the average time complexity should be better than O(N**2).
+<O>(<N>**2), and the average time complexity should be better than
+<O>(<N>**2).
162/2
Move should not copy elements, and should minimize copying of internal
@@ -46881,7 +46945,7 @@ Containers.Ordered_Maps provide private types Map and
Cursor, and a set
of operations for each type. A map container allows an arbitrary type
to be used as a key to find the element associated with that key. A
hashed map uses a hash function to organize the keys, while an ordered
-map orders the keys per a specified relation.
+map orders the keys per a specified relation.
2/3
This subclause describes the declarations that are common to both kinds
@@ -46905,22 +46969,22 @@ The type Map is used to represent maps. The type Map
needs finalization
(see *note 7.6::).
5/2
-A map contains pairs of keys and elements, called nodes. Map cursors
+A map contains pairs of keys and elements, called <nodes>. Map cursors
designate nodes, but also can be thought of as designating an element
(the element contained in the node) for consistency with the other
containers. There exists an equivalence relation on keys, whose
definition is different for hashed maps and ordered maps. A map never
-contains two or more nodes with equivalent keys. The length of a map is
-the number of nodes it contains.
+contains two or more nodes with equivalent keys. The <length> of a map
+is the number of nodes it contains.
6/2
-Each nonempty map has two particular nodes called the first node and the
-last node (which may be the same). Each node except for the last node
-has a successor node. If there are no other intervening operations,
-starting with the first node and repeatedly going to the successor node
-will visit each node in the map exactly once until the last node is
-reached. The exact definition of these terms is different for hashed
-maps and ordered maps.
+Each nonempty map has two particular nodes called the <first node> and
+the <last node> (which may be the same). Each node except for the last
+node has a <successor node>. If there are no other intervening
+operations, starting with the first node and repeatedly going to the
+successor node will visit each node in the map exactly once until the
+last node is reached. The exact definition of these terms is different
+for hashed maps and ordered maps.
7/2
Some operations of these generic packages have access-to-subprogram
@@ -46932,46 +46996,46 @@ constant, and others check for "tampering with
elements" of a container
because they depend on elements of the container not being replaced.
8/2
-A subprogram is said to tamper with cursors of a map object M if:
+A subprogram is said to <tamper with cursors> of a map object <M> if:
9/2
- * it inserts or deletes elements of M, that is, it calls the Insert,
- Include, Clear, Delete, or Exclude procedures with M as a
+ * it inserts or deletes elements of <M>, that is, it calls the
+ Insert, Include, Clear, Delete, or Exclude procedures with <M> as a
parameter; or
10/2
- * it finalizes M; or
+ * it finalizes <M>; or
10.1/3
- * it calls the Assign procedure with M as the Target parameter; or
+ * it calls the Assign procedure with <M> as the Target parameter; or
11/2
- * it calls the Move procedure with M as a parameter; or
+ * it calls the Move procedure with <M> as a parameter; or
12/2
* it calls one of the operations defined to tamper with the cursors
- of M.
+ of <M>.
13/2
-A subprogram is said to tamper with elements of a map object M if:
+A subprogram is said to <tamper with elements> of a map object <M> if:
14/2
- * it tampers with cursors of M; or
+ * it tampers with cursors of <M>; or
15/2
- * it replaces one or more elements of M, that is, it calls the
- Replace or Replace_Element procedures with M as a parameter.
+ * it replaces one or more elements of <M>, that is, it calls the
+ Replace or Replace_Element procedures with <M> as a parameter.
15.1/4
-When tampering with cursors is prohibited for a particular map object M,
-Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the cursors of M, leaving M unmodified.
-Similarly, when tampering with elements is prohibited for a particular
-map object M, Program_Error is propagated by a call of any
-language-defined subprogram that is defined to tamper with the elements
-of M (or tamper with the cursors of M), leaving M unmodified. These
-checks are made before any other defined behavior of the body of the
-language-defined subprogram.
+When tampering with cursors is <prohibited> for a particular map object
+<M>, Program_Error is propagated by a call of any language-defined
+subprogram that is defined to tamper with the cursors of <M>, leaving
+<M> unmodified. Similarly, when tampering with elements is <prohibited>
+for a particular map object <M>, Program_Error is propagated by a call
+of any language-defined subprogram that is defined to tamper with the
+elements of <M> (or tamper with the cursors of <M>), leaving <M>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
16/2
Empty_Map represents the empty Map object. It has a length of 0. If an
@@ -46992,12 +47056,12 @@ Execution of the default implementation of the Input,
Output, Read, or
Write attribute of type Cursor raises Program_Error.
19.1/3
-Map'Write for a Map object M writes Length(M) elements of the map to the
-stream. It also may write additional information about the map.
+Map'Write for a Map object <M> writes Length(<M>) elements of the map to
+the stream. It also may write additional information about the map.
19.2/3
Map'Read reads the representation of a map from the stream, and assigns
-to Item a map with the same length and elements as was written by
+to <Item> a map with the same length and elements as was written by
Map'Write.
19.3/3
@@ -47014,15 +47078,15 @@ Map'Write.
If Left and Right denote the same map object, then the
function returns True. If Left and Right have different
lengths, then the function returns False. Otherwise, for each
- key K in Left, the function returns False if:
+ key <K> in Left, the function returns False if:
22/2
- * a key equivalent to K is not present in Right; or
+ * a key equivalent to <K> is not present in Right; or
23/2
- * the element associated with K in Left is not equal to the
- element associated with K in Right (using the generic
- formal equality operator for elements).
+ * the element associated with <K> in Left is not equal to
+ the element associated with <K> in Right (using the
+ generic formal equality operator for elements).
24/2
If the function has not returned a result after checking all
@@ -47359,7 +47423,7 @@ Map'Write.
71/2
Equivalent to Find (Container, Key) /= No_Element.
- Paragraphs 72 and 73 were moved above.
+ <Paragraphs 72 and 73 were moved above.>
74/2
procedure Iterate
@@ -47395,8 +47459,8 @@ Constraint_Error or Program_Error.
_Erroneous Execution_
76/2
-A Cursor value is invalid if any of the following have occurred since it
-was created:
+A Cursor value is <invalid> if any of the following have occurred since
+it was created:
77/2
* The map that contains the node it designates has been finalized;
@@ -47647,7 +47711,7 @@ declaration:
Key : Key_Type) return Boolean;
33/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
34/2
function Equivalent_Keys (Left, Right : Cursor)
@@ -47676,20 +47740,20 @@ declaration:
private
39/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
40/2
end Ada.Containers.Hashed_Maps;
41/2
An object of type Map contains an expandable hash table, which is used
-to provide direct access to nodes. The capacity of an object of type
+to provide direct access to nodes. The <capacity> of an object of type
Map is the maximum number of nodes that can be inserted into the hash
table prior to it being automatically expanded.
42/2
-Two keys K1 and K2 are defined to be equivalent if Equivalent_Keys (K1,
-K2) returns True.
+Two keys <K1> and <K2> are defined to be <equivalent> if Equivalent_Keys
+(<K1>, <K2>) returns True.
43/2
The actual function for the generic formal function Hash is expected to
@@ -47824,11 +47888,12 @@ general semantics described in *note A.18.4::.
_Implementation Advice_
62/2
-If N is the length of a map, the average time complexity of the
+If <N> is the length of a map, the average time complexity of the
subprograms Element, Insert, Include, Replace, Delete, Exclude and Find
-that take a key parameter should be O(log N). The average time
+that take a key parameter should be <O>(log <N>). The average time
complexity of the subprograms that take a cursor parameter should be
-O(1). The average time complexity of Reserve_Capacity should be O(N).
+<O>(1). The average time complexity of Reserve_Capacity should be
+<O>(<N>).
File: arm2012.info, Node: A.18.6, Next: A.18.7, Prev: A.18.5, Up: A.18
@@ -48054,7 +48119,7 @@ declaration:
Key : Key_Type) return Boolean;
43/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
44/2
function "<" (Left, Right : Cursor) return Boolean;
@@ -48096,16 +48161,16 @@ declaration:
private
53/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
54/2
end Ada.Containers.Ordered_Maps;
55/2
-Two keys K1 and K2 are equivalent if both K1 < K2 and K2 < K1 return
-False, using the generic formal "<" operator for keys. Function
-Equivalent_Keys returns True if Left and Right are equivalent, and False
-otherwise.
+Two keys <K1> and <K2> are <equivalent> if both <K1> < <K2> and <K2> <
+<K1> return False, using the generic formal "<" operator for keys.
+Function Equivalent_Keys returns True if Left and Right are equivalent,
+and False otherwise.
56/3
The actual function for the generic formal function "<" on Key_Type
@@ -48122,14 +48187,14 @@ operation in this package such that at least one of
"<" or "=" give
different results, the behavior of this package is unspecified.
58/3
-The first node of a nonempty map is the one whose key is less than the
-key of all the other nodes in the map. The last node of a nonempty map
-is the one whose key is greater than the key of all the other elements
-in the map. The successor of a node is the node with the smallest key
-that is larger than the key of the given node. The predecessor of a
-node is the node with the largest key that is smaller than the key of
-the given node. All comparisons are done using the generic formal "<"
-operator for keys.
+The <first node> of a nonempty map is the one whose key is less than the
+key of all the other nodes in the map. The <last node> of a nonempty
+map is the one whose key is greater than the key of all the other
+elements in the map. The <successor> of a node is the node with the
+smallest key that is larger than the key of the given node. The
+<predecessor> of a node is the node with the largest key that is smaller
+than the key of the given node. All comparisons are done using the
+generic formal "<" operator for keys.
58.1/3
function Copy (Source : Map) return Map;
@@ -48309,11 +48374,11 @@ operator for keys.
_Implementation Advice_
95/2
-If N is the length of a map, then the worst-case time complexity of the
-Element, Insert, Include, Replace, Delete, Exclude and Find operations
-that take a key parameter should be O((log N)**2) or better. The
-worst-case time complexity of the subprograms that take a cursor
-parameter should be O(1).
+If <N> is the length of a map, then the worst-case time complexity of
+the Element, Insert, Include, Replace, Delete, Exclude and Find
+operations that take a key parameter should be <O>((log <N>)**2) or
+better. The worst-case time complexity of the subprograms that take a
+cursor parameter should be <O>(1).
File: arm2012.info, Node: A.18.7, Next: A.18.8, Prev: A.18.6, Up: A.18
@@ -48327,7 +48392,7 @@ Containers.Ordered_Sets provide private types Set and
Cursor, and a set
of operations for each type. A set container allows elements of an
arbitrary type to be stored without duplication. A hashed set uses a
hash function to organize elements, while an ordered set orders its
-element per a specified relation.
+element per a specified relation.
2/3
This subclause describes the declarations that are common to both kinds
@@ -48354,13 +48419,13 @@ The type Set is used to represent sets. The type Set
needs finalization
A set contains elements. Set cursors designate elements. There exists
an equivalence relation on elements, whose definition is different for
hashed sets and ordered sets. A set never contains two or more
-equivalent elements. The length of a set is the number of elements it
+equivalent elements. The <length> of a set is the number of elements it
contains.
6/2
-Each nonempty set has two particular elements called the first element
-and the last element (which may be the same). Each element except for
-the last element has a successor element. If there are no other
+Each nonempty set has two particular elements called the <first element>
+and the <last element> (which may be the same). Each element except for
+the last element has a <successor element>. If there are no other
intervening operations, starting with the first element and repeatedly
going to the successor element will visit each element in the set
exactly once until the last element is reached. The exact definition of
@@ -48376,41 +48441,42 @@ constant, and others check for "tampering with
elements" of a container
because they depend on elements of the container not being replaced.
8/2
-A subprogram is said to tamper with cursors of a set object S if:
+A subprogram is said to <tamper with cursors> of a set object <S> if:
9/2
- * it inserts or deletes elements of S, that is, it calls the Insert,
- Include, Clear, Delete, Exclude, or Replace_Element procedures with
- S as a parameter; or
+ * it inserts or deletes elements of <S>, that is, it calls the
+ Insert, Include, Clear, Delete, Exclude, or Replace_Element
+ procedures with <S> as a parameter; or
10/2
- * it finalizes S; or
+ * it finalizes <S>; or
10.1/3
- * it calls the Assign procedure with S as the Target parameter; or
+ * it calls the Assign procedure with <S> as the Target parameter; or
11/2
- * it calls the Move procedure with S as a parameter; or
+ * it calls the Move procedure with <S> as a parameter; or
12/2
- * it calls one of the operations defined to tamper with cursors of S.
+ * it calls one of the operations defined to tamper with cursors of
+ <S>.
13/2
-A subprogram is said to tamper with elements of a set object S if:
+A subprogram is said to <tamper with elements> of a set object <S> if:
14/2
- * it tampers with cursors of S.
+ * it tampers with cursors of <S>.
14.1/4
-When tampering with cursors is prohibited for a particular set object S,
-Program_Error is propagated by a call of any language-defined subprogram
-that is defined to tamper with the cursors of S, leaving S unmodified.
-Similarly, when tampering with elements is prohibited for a particular
-set object S, Program_Error is propagated by a call of any
-language-defined subprogram that is defined to tamper with the elements
-of S (or tamper with the cursors of S), leaving S unmodified. These
-checks are made before any other defined behavior of the body of the
-language-defined subprogram.
+When tampering with cursors is <prohibited> for a particular set object
+<S>, Program_Error is propagated by a call of any language-defined
+subprogram that is defined to tamper with the cursors of <S>, leaving
+<S> unmodified. Similarly, when tampering with elements is <prohibited>
+for a particular set object <S>, Program_Error is propagated by a call
+of any language-defined subprogram that is defined to tamper with the
+elements of <S> (or tamper with the cursors of <S>), leaving <S>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
15/2
Empty_Set represents the empty Set object. It has a length of 0. If an
@@ -48431,12 +48497,12 @@ Execution of the default implementation of the Input,
Output, Read, or
Write attribute of type Cursor raises Program_Error.
18.1/3
-Set'Write for a Set object S writes Length(S) elements of the set to the
-stream. It also may write additional information about the set.
+Set'Write for a Set object <S> writes Length(<S>) elements of the set to
+the stream. It also may write additional information about the set.
18.2/3
Set'Read reads the representation of a set from the stream, and assigns
-to Item a set with the same length and elements as was written by
+to <Item> a set with the same length and elements as was written by
Set'Write.
18.3/3
@@ -48453,11 +48519,11 @@ Set'Write.
If Left and Right denote the same set object, then the
function returns True. If Left and Right have different
lengths, then the function returns False. Otherwise, for each
- element E in Left, the function returns False if an element
- equal to E (using the generic formal equality operator) is not
- present in Right. If the function has not returned a result
- after checking all of the elements, it returns True. Any
- exception raised during evaluation of element equality is
+ element <E> in Left, the function returns False if an element
+ equal to <E> (using the generic formal equality operator) is
+ not present in Right. If the function has not returned a
+ result after checking all of the elements, it returns True.
+ Any exception raised during evaluation of element equality is
propagated.
21/2
@@ -48467,10 +48533,10 @@ Set'Write.
If Left and Right denote the same set object, then the
function returns True. If Left and Right have different
lengths, then the function returns False. Otherwise, for each
- element E in Left, the function returns False if an element
- equivalent to E is not present in Right. If the function has
- not returned a result after checking all of the elements, it
- returns True. Any exception raised during evaluation of
+ element <E> in Left, the function returns False if an element
+ equivalent to <E> is not present in Right. If the function
+ has not returned a result after checking all of the elements,
+ it returns True. Any exception raised during evaluation of
element equivalence is propagated.
23/2
@@ -48766,7 +48832,7 @@ Set'Write.
Equivalent to Position := Next (Position).
79/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
80/2
function Find (Container : Set;
@@ -48786,7 +48852,7 @@ Set'Write.
82.1/3
Equivalent to Find (Container, Item) /= No_Element.
- Paragraphs 83 and 84 were moved above.
+ <Paragraphs 83 and 84 were moved above.>
85/2
procedure Iterate
@@ -48847,16 +48913,16 @@ to locate an element in the set.
If Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
- Update_Element_Preserving_Key uses Key to save the key value K
- of the element designated by Position.
+ Update_Element_Preserving_Key uses Key to save the key value
+ <K> of the element designated by Position.
Update_Element_Preserving_Key then calls Process.all with that
element as the argument. Tampering with the elements of
Container is prohibited during the execution of the call on
Process.all. Any exception raised by Process.all is
propagated. After Process.all returns,
- Update_Element_Preserving_Key checks if K determines the same
- equivalence class as that for the new element; if not, the
- element is removed from the set and Program_Error is
+ Update_Element_Preserving_Key checks if <K> determines the
+ same equivalence class as that for the new element; if not,
+ the element is removed from the set and Program_Error is
propagated.
96/2
@@ -48888,13 +48954,13 @@ to locate an element in the set.
If Position equals No_Element, then Constraint_Error is
propagated; if Position does not designate an element in
Container, then Program_Error is propagated. Otherwise,
- Reference_Preserving_Key uses Key to save the key value K;
+ Reference_Preserving_Key uses Key to save the key value <K>;
then returns an object whose discriminant is an access value
that designates the element designated by Position. Tampering
with the elements of Container is prohibited while the object
returned by Reference_Preserving_Key exists and has not been
finalized. When the object returned by
- Reference_Preserving_Key is finalized, a check is made if K
+ Reference_Preserving_Key is finalized, a check is made if <K>
determines the same equivalence class as that for the new
element; if not, the element is removed from the set and
Program_Error is propagated.
@@ -48948,8 +49014,8 @@ Constraint_Error or Program_Error.
_Erroneous Execution_
97/2
-A Cursor value is invalid if any of the following have occurred since it
-was created:
+A Cursor value is <invalid> if any of the following have occurred since
+it was created:
98/2
* The set that contains the element it designates has been finalized;
@@ -49203,7 +49269,7 @@ declaration:
Item : Element_Type) return Boolean;
45/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
46/2
function Equivalent_Elements (Left, Right : Cursor)
@@ -49302,20 +49368,20 @@ declaration:
private
61/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
62/2
end Ada.Containers.Hashed_Sets;
63/2
An object of type Set contains an expandable hash table, which is used
-to provide direct access to elements. The capacity of an object of type
-Set is the maximum number of elements that can be inserted into the hash
-table prior to it being automatically expanded.
+to provide direct access to elements. The <capacity> of an object of
+type Set is the maximum number of elements that can be inserted into the
+hash table prior to it being automatically expanded.
64/2
-Two elements E1 and E2 are defined to be equivalent if
-Equivalent_Elements (E1, E2) returns True.
+Two elements <E1> and <E2> are defined to be <equivalent> if
+Equivalent_Elements (<E1>, <E2>) returns True.
65/2
The actual function for the generic formal function Hash is expected to
@@ -49460,29 +49526,30 @@ other than the general semantics described in *note
A.18.7::.
object needs finalization.
86/2
-For any element E, the actual function for the generic formal function
-Generic_Keys.Hash is expected to be such that Hash (E) =
-Generic_Keys.Hash (Key (E)). If the actuals for Key or Generic_Keys.Hash
-behave in some other manner, the behavior of Generic_Keys is
-unspecified. Which subprograms of Generic_Keys call Generic_Keys.Hash,
-and how many times they call it, is unspecified.
+For any element <E>, the actual function for the generic formal function
+Generic_Keys.Hash is expected to be such that Hash (<E>) =
+Generic_Keys.Hash (Key (<E>)). If the actuals for Key or
+Generic_Keys.Hash behave in some other manner, the behavior of
+Generic_Keys is unspecified. Which subprograms of Generic_Keys call
+Generic_Keys.Hash, and how many times they call it, is unspecified.
87/2
-For any two elements E1 and E2, the boolean values Equivalent_Elements
-(E1, E2) and Equivalent_Keys (Key (E1), Key (E2)) are expected to be
-equal. If the actuals for Key or Equivalent_Keys behave in some other
-manner, the behavior of Generic_Keys is unspecified. Which subprograms
-of Generic_Keys call Equivalent_Keys, and how many times they call it,
-is unspecified.
+For any two elements <E1> and <E2>, the boolean values
+Equivalent_Elements (<E1>, <E2>) and Equivalent_Keys (Key (<E1>), Key
+(<E2>)) are expected to be equal. If the actuals for Key or
+Equivalent_Keys behave in some other manner, the behavior of
+Generic_Keys is unspecified. Which subprograms of Generic_Keys call
+Equivalent_Keys, and how many times they call it, is unspecified.
_Implementation Advice_
88/2
-If N is the length of a set, the average time complexity of the
+If <N> is the length of a set, the average time complexity of the
subprograms Insert, Include, Replace, Delete, Exclude and Find that take
-an element parameter should be O(log N). The average time complexity of
-the subprograms that take a cursor parameter should be O(1). The
-average time complexity of Reserve_Capacity should be O(N).
+an element parameter should be <O>(log <N>). The average time
+complexity of the subprograms that take a cursor parameter should be
+<O>(1). The average time complexity of Reserve_Capacity should be
+<O>(<N>).
File: arm2012.info, Node: A.18.9, Next: A.18.10, Prev: A.18.8, Up: A.18
@@ -49712,7 +49779,7 @@ declaration:
Item : Element_Type) return Boolean;
53/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
54/2
function "<" (Left, Right : Cursor) return Boolean;
@@ -49840,16 +49907,16 @@ declaration:
private
76/2
- ... -- not specified by the language
+ ... -- <not specified by the language>
77/2
end Ada.Containers.Ordered_Sets;
78/2
-Two elements E1 and E2 are equivalent if both E1 < E2 and E2 < E1 return
-False, using the generic formal "<" operator for elements. Function
-Equivalent_Elements returns True if Left and Right are equivalent, and
-False otherwise.
+Two elements <E1> and <E2> are <equivalent> if both <E1> < <E2> and <E2>
+< <E1> return False, using the generic formal "<" operator for elements.
+Function Equivalent_Elements returns True if Left and Right are
+equivalent, and False otherwise.
79/3
The actual function for the generic formal function "<" on Element_Type
@@ -49871,13 +49938,13 @@ operation in this package such that at least one of
"<" or "=" give
different results, the behavior of this package is unspecified.
81/3
-The first element of a nonempty set is the one which is less than all
-the other elements in the set. The last element of a nonempty set is
+The <first element> of a nonempty set is the one which is less than all
+the other elements in the set. The <last element> of a nonempty set is
the one which is greater than all the other elements in the set. The
-successor of an element is the smallest element that is larger than the
-given element. The predecessor of an element is the largest element
-that is smaller than the given element. All comparisons are done using
-the generic formal "<" operator for elements.
+<successor> of an element is the smallest element that is larger than
+the given element. The <predecessor> of an element is the largest
+element that is smaller than the given element. All comparisons are
+done using the generic formal "<" operator for elements.
81.1/3
function Copy (Source : Set) return Set;
@@ -50041,11 +50108,11 @@ the generic formal "<" operator for elements.
object). The iterator object needs finalization.
114/2
-For any two elements E1 and E2, the boolean values (E1 < E2) and
-(Key(E1) < Key(E2)) are expected to be equal. If the actuals for Key or
-Generic_Keys."<" behave in some other manner, the behavior of this
-package is unspecified. Which subprograms of this package call Key and
-Generic_Keys."<", and how many times the functions are called, is
+For any two elements <E1> and <E2>, the boolean values (<E1> < <E2>) and
+(Key(<E1>) < Key(<E2>)) are expected to be equal. If the actuals for
+Key or Generic_Keys."<" behave in some other manner, the behavior of
+this package is unspecified. Which subprograms of this package call Key
+and Generic_Keys."<", and how many times the functions are called, is
unspecified.
115/2
@@ -50061,11 +50128,11 @@ both Left < Right and Right < Left return False using
the generic formal
_Implementation Advice_
116/2
-If N is the length of a set, then the worst-case time complexity of the
-Insert, Include, Replace, Delete, Exclude and Find operations that take
-an element parameter should be O((log N)**2) or better. The worst-case
-time complexity of the subprograms that take a cursor parameter should
-be O(1).
+If <N> is the length of a set, then the worst-case time complexity of
+the Insert, Include, Replace, Delete, Exclude and Find operations that
+take an element parameter should be <O>((log <N>)**2) or better. The
+worst-case time complexity of the subprograms that take a cursor
+parameter should be <O>(1).
File: arm2012.info, Node: A.18.10, Next: A.18.11, Prev: A.18.9, Up: A.18
@@ -50079,36 +50146,36 @@ private types Tree and Cursor, and a set of
operations for each type. A
multiway tree container is well-suited to represent nested structures.
2/4
-A multiway tree container object manages a tree of nodes, consisting of
-a root node and a set of internal nodes; each internal node contains an
-element and pointers to the parent, first child, last child, next
-(successor) sibling, and previous (predecessor) sibling internal nodes.
-A cursor designates a particular node within a tree (and by extension
-the element contained in that node, if any). A cursor keeps designating
-the same node (and element) as long as the node is part of the
-container, even if the node is moved within the container.
+A multiway tree container object manages a tree of <nodes>, consisting
+of a <root node> and a set of <internal nodes>; each internal node
+contains an element and pointers to the parent, first child, last child,
+next (successor) sibling, and previous (predecessor) sibling internal
+nodes. A cursor designates a particular node within a tree (and by
+extension the element contained in that node, if any). A cursor keeps
+designating the same node (and element) as long as the node is part of
+the container, even if the node is moved within the container.
3/4
-A subtree is a particular node (which roots the subtree) and all of its
-child nodes (including all of the children of the child nodes,
-recursively). The root node is always present and has neither an
+A <subtree> is a particular node (which <roots the subtree>) and all of
+its child nodes (including all of the children of the child nodes,
+recursively). The root node is always present and has neither an
associated element value nor any parent node; it has pointers to its
first child and its last child, if any. The root node provides a place
to add nodes to an otherwise empty tree and represents the base of the
tree.
4/3
-A node that has no children is called a leaf node. The ancestors of a
-node are the node itself, its parent node, the parent of the parent
+A node that has no children is called a <leaf node>. The <ancestors> of
+a node are the node itself, its parent node, the parent of the parent
node, and so on until a node with no parent is reached. Similarly, the
-descendants of a node are the node itself, its child nodes, the children
-of each child node, and so on.
+<descendants> of a node are the node itself, its child nodes, the
+children of each child node, and so on.
5/3
The nodes of a subtree can be visited in several different orders. For
-a depth-first order, after visiting a node, the nodes of its child list
-are each visited in depth-first order, with each child node visited in
-natural order (first child to last child).
+a <depth-first order>, after visiting a node, the nodes of its child
+list are each visited in depth-first order, with each child node visited
+in natural order (first child to last child).
_Static Semantics_
@@ -50398,7 +50465,7 @@ declaration:
71/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Containers.Multiway_Trees;
72/3
@@ -50435,13 +50502,13 @@ Execution of the default implementation of the Input,
Output, Read, or
Write attribute of type Cursor raises Program_Error.
78/3
-Tree'Write for a Tree object T writes Node_Count(T) - 1 elements of the
-tree to the stream. It also may write additional information about the
-tree.
+Tree'Write for a Tree object <T> writes Node_Count(<T>) - 1 elements of
+the tree to the stream. It also may write additional information about
+the tree.
79/3
Tree'Read reads the representation of a tree from the stream, and
-assigns to Item a tree with the same elements and structure as was
+assigns to <Item> a tree with the same elements and structure as was
written by Tree'Write.
80/3
@@ -50454,46 +50521,47 @@ constant, and others check for "tampering with
elements" of a container
because they depend on elements of the container not being replaced.
81/3
-A subprogram is said to tamper with cursors of a tree object T if:
+A subprogram is said to <tamper with cursors> of a tree object <T> if:
82/3
- * it inserts or deletes elements of T, that is, it calls the Clear,
+ * it inserts or deletes elements of <T>, that is, it calls the Clear,
Delete_Leaf, Insert_Child, Delete_Children, Delete_Subtree, or
- Copy_Subtree procedures with T as a parameter; or
+ Copy_Subtree procedures with <T> as a parameter; or
83/3
- * it reorders the elements of T, that is, it calls the Splice_Subtree
- or Splice_Children procedures with T as a parameter; or
+ * it reorders the elements of <T>, that is, it calls the
+ Splice_Subtree or Splice_Children procedures with <T> as a
+ parameter; or
84/3
- * it finalizes T; or
+ * it finalizes <T>; or
85/3
- * it calls Assign with T as the Target parameter; or
+ * it calls Assign with <T> as the Target parameter; or
86/3
- * it calls the Move procedure with T as a parameter.
+ * it calls the Move procedure with <T> as a parameter.
87/3
-A subprogram is said to tamper with elements of a tree object T if:
+A subprogram is said to <tamper with elements> of a tree object <T> if:
88/3
- * it tampers with cursors of T; or
+ * it tampers with cursors of <T>; or
89/3
- * it replaces one or more elements of T, that is, it calls the
- Replace_Element or Swap procedures with T as a parameter.
+ * it replaces one or more elements of <T>, that is, it calls the
+ Replace_Element or Swap procedures with <T> as a parameter.
90/4
-When tampering with cursors is prohibited for a particular tree object
-T, Program_Error is propagated by a call of any language-defined
-subprogram that is defined to tamper with the cursors of T, leaving T
-unmodified. Similarly, when tampering with elements is prohibited for a
-particular tree object T, Program_Error is propagated by a call of any
-language-defined subprogram that is defined to tamper with the elements
-of T (or tamper with the cursors of T), leaving T unmodified. These
-checks are made before any other defined behavior of the body of the
-language-defined subprogram.
+When tampering with cursors is <prohibited> for a particular tree object
+<T>, Program_Error is propagated by a call of any language-defined
+subprogram that is defined to tamper with the cursors of <T>, leaving
+<T> unmodified. Similarly, when tampering with elements is <prohibited>
+for a particular tree object <T>, Program_Error is propagated by a call
+of any language-defined subprogram that is defined to tamper with the
+elements of <T> (or tamper with the cursors of <T>), leaving <T>
+unmodified. These checks are made before any other defined behavior of
+the body of the language-defined subprogram.
91/3
function Has_Element (Position : Cursor) return Boolean;
@@ -51356,8 +51424,8 @@ raises Constraint_Error or Program_Error.
_Erroneous Execution_
222/3
-A Cursor value is invalid if any of the following have occurred since it
-was created:
+A Cursor value is <invalid> if any of the following have occurred since
+it was created:
223/3
* The tree that contains the element it designates has been
@@ -51403,10 +51471,10 @@ the source object.
231/3
Containers.Multiway_Trees should be implemented similarly to a multiway
-tree. In particular, if N is the overall number of nodes for a
+tree. In particular, if <N> is the overall number of nodes for a
particular tree, then the worst-case time complexity of Element, Parent,
First_Child, Last_Child, Next_Sibling, Previous_Sibling, Insert_Child
-with Count=1, and Delete should be O(log N).
+with Count=1, and Delete should be <O>(log <N>).
232/3
Move should not copy elements, and should minimize copying of internal
@@ -51732,7 +51800,7 @@ A holder container allows the declaration of an object
that can be used
like an uninitialized variable or component of an indefinite type.
3/3
-A holder container may be empty. An empty holder does not contain an
+A holder container may be <empty>. An empty holder does not contain an
element.
_Static Semantics_
@@ -51815,7 +51883,7 @@ following declaration:
private
24/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
25/3
end Ada.Containers.Indefinite_Holders;
@@ -51846,28 +51914,29 @@ some operations check for "tampering with the
element" of a container
because they depend on the element of the container not being replaced.
30/3
-A subprogram is said to tamper with the element of a holder object H if:
+A subprogram is said to <tamper with the element> of a holder object <H>
+if:
31/3
- * It clears the element contained by H, that is, it calls the Clear
- procedure with H as a parameter;
+ * It clears the element contained by <H>, that is, it calls the Clear
+ procedure with <H> as a parameter;
32/3
- * It replaces the element contained by H, that is, it calls the
- Replace_Element procedure with H as a parameter;
+ * It replaces the element contained by <H>, that is, it calls the
+ Replace_Element procedure with <H> as a parameter;
33/3
- * It calls the Move procedure with H as a parameter;
+ * It calls the Move procedure with <H> as a parameter;
34/3
- * It finalizes H.
+ * It finalizes <H>.
35/4
-When tampering with the element is prohibited for a particular holder
-object H, Program_Error is propagated by a call of any language-defined
-subprogram that is defined to tamper with the element of H, leaving H
-unmodified. These checks are made before any other defined behavior of
-the body of the language-defined subprogram.
+When tampering with the element is <prohibited> for a particular holder
+object <H>, Program_Error is propagated by a call of any
+language-defined subprogram that is defined to tamper with the element
+of <H>, leaving <H> unmodified. These checks are made before any other
+defined behavior of the body of the language-defined subprogram.
36/3
function "=" (Left, Right : Holder) return Boolean;
@@ -52130,9 +52199,9 @@ execution proceeds normally.
_Erroneous Execution_
11/3
-When a bounded vector object V is finalized, if tampering with cursors
-is prohibited for V other than due to an assignment from another vector,
-then execution is erroneous.
+When a bounded vector object <V> is finalized, if tampering with cursors
+is prohibited for <V> other than due to an assignment from another
+vector, then execution is erroneous.
_Implementation Requirements_
@@ -52246,9 +52315,9 @@ execution proceeds normally.
_Erroneous Execution_
15/3
-When a bounded list object L is finalized, if tampering with cursors is
-prohibited for L other than due to an assignment from another list, then
-execution is erroneous.
+When a bounded list object <L> is finalized, if tampering with cursors
+is prohibited for <L> other than due to an assignment from another list,
+then execution is erroneous.
_Implementation Requirements_
@@ -52365,9 +52434,9 @@ execution proceeds normally.
_Erroneous Execution_
16/3
-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.
+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.
_Implementation Requirements_
@@ -52469,9 +52538,9 @@ execution proceeds normally.
_Erroneous Execution_
13/3
-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.
+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.
_Implementation Requirements_
@@ -52592,9 +52661,9 @@ execution proceeds normally.
_Erroneous Execution_
16/3
-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.
+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.
_Implementation Requirements_
@@ -52693,9 +52762,9 @@ execution proceeds normally.
_Erroneous Execution_
13/3
-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.
+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.
_Implementation Requirements_
@@ -52805,9 +52874,9 @@ execution proceeds normally.
_Erroneous Execution_
15/3
-When a bounded tree object T is finalized, if tampering with cursors is
-prohibited for T other than due to an assignment from another tree, then
-execution is erroneous.
+When a bounded tree object <T> is finalized, if tampering with cursors
+is prohibited for <T> other than due to an assignment from another tree,
+then execution is erroneous.
_Implementation Requirements_
@@ -52953,9 +53022,9 @@ declaration:
10/2
The worst-case time complexity of a call on an instance of
Containers.Generic_Array_Sort or
-Containers.Generic_Constrained_Array_Sort should be O(N**2) or better,
-and the average time complexity should be better than O(N**2), where N
-is the length of the Container parameter.
+Containers.Generic_Constrained_Array_Sort should be <O>(<N>**2) or
+better, and the average time complexity should be better than
+<O>(<N>**2), where <N> is the length of the Container parameter.
11/2
Containers.Generic_Array_Sort and
@@ -52964,9 +53033,9 @@ elements.
12/3
The worst-case time complexity of a call on an instance of
-Containers.Generic_Sort should be O(N**2) or better, and the average
-time complexity should be better than O(N**2), where N is the difference
-between the Last and First parameters plus 1.
+Containers.Generic_Sort should be <O>(<N>**2) or better, and the average
+time complexity should be better than <O>(<N>**2), where <N> is the
+difference between the Last and First parameters plus 1.
13/3
Containers.Generic_Sort should minimize calls to the generic formal
@@ -53025,7 +53094,7 @@ the following declaration:
10/3
A queue type that implements this interface is allowed to have
- a bounded capacity. If the queue object has a bounded
+ a bounded <capacity>. If the queue object has a bounded
capacity, and the number of existing elements equals the
capacity, then Enqueue blocks until storage becomes available;
otherwise, Enqueue does not block. In any case, it then
@@ -53089,7 +53158,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -53112,14 +53181,14 @@ Containers.Synchronized_Queue_Interfaces.Queue.
7/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
8/3
private
9/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
10/3
end Ada.Containers.Unbounded_Synchronized_Queues;
@@ -53156,7 +53225,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -53180,14 +53249,14 @@ Containers.Synchronized_Queue_Interfaces.Queue.
7/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
8/3
private
9/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
10/3
end Ada.Containers.Bounded_Synchronized_Queues;
@@ -53235,7 +53304,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -53265,14 +53334,14 @@ Containers.Synchronized_Queue_Interfaces.Queue.
8/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
9/3
private
10/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
11/3
end Ada.Containers.Unbounded_Priority_Queues;
@@ -53284,9 +53353,9 @@ The type Queue is used to represent task-safe priority
queues.
The capacity for instances of type Queue is unbounded.
14/3
-Two elements E1 and E2 are equivalent if Before(Get_Priority(E1),
-Get_Priority(E2)) and Before(Get_Priority(E2), Get_Priority(E1)) both
-return False.
+Two elements <E1> and <E2> are equivalent if Before(Get_Priority(<E1>),
+Get_Priority(<E2>)) and Before(Get_Priority(<E2>), Get_Priority(<E1>))
+both return False.
15/3
The actual functions for Get_Priority and Before are expected to return
@@ -53305,10 +53374,10 @@ after the existing equivalent elements.
17/3
For a call on Dequeue_Only_High_Priority, if the head of the nonempty
-queue is E, and the function Before(At_Least, Get_Priority(E)) returns
-False, then E is assigned to Element and then removed from the queue,
-and Success is set to True; otherwise, Success is set to False and
-Element is unchanged.
+queue is <E>, and the function Before(At_Least, Get_Priority(<E>))
+returns False, then <E> is assigned to Element and then removed from the
+queue, and Success is set to True; otherwise, Success is set to False
+and Element is unchanged.
File: arm2012.info, Node: A.18.31, Next: A.18.32, Prev: A.18.30, Up: A.18
@@ -53340,7 +53409,7 @@ Containers.Synchronized_Queue_Interfaces.Queue.
3/3
package Implementation is
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Implementation;
4/3
@@ -53371,14 +53440,14 @@ Containers.Synchronized_Queue_Interfaces.Queue.
8/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Queue;
9/3
private
10/3
- ... -- not specified by the language
+ ... -- <not specified by the language>
11/3
end Ada.Containers.Bounded_Priority_Queues;
@@ -53424,8 +53493,8 @@ represented by a map from nodes to sets of edges.
3/3
package Node_Maps is new Vectors (Node, Node);
- -- The algorithm builds a map to indicate the node used to reach a
given
- -- node in the shortest distance.
+ -- <The algorithm builds a map to indicate the node used to reach a
given>
+ -- <node in the shortest distance.>
4/3
package Adjacency_Lists is new Doubly_Linked_Lists (Edge);
@@ -53452,7 +53521,7 @@ represented by a map from nodes to sets of edges.
is
use Adjacency_Lists, Node_Maps, Paths, Graphs;
Reached : array (Node) of Boolean := (others => False);
- -- The set of nodes whose shortest distance to the source is known.
+ -- <The set of nodes whose shortest distance to the source is
known.>
10/3
Reached_From : array (Node) of Node;
@@ -53468,8 +53537,8 @@ represented by a map from nodes to sets of edges.
Nearest_Distance := Distance'Last;
12/3
- -- Find closest node not reached yet, by iterating over all
nodes.
- -- A more efficient algorithm uses a priority queue for this
step.
+ -- <Find closest node not reached yet, by iterating over all
nodes.>
+ -- <A more efficient algorithm uses a priority queue for this
step.>
13/3
Next := Source;
@@ -53483,7 +53552,7 @@ represented by a map from nodes to sets of edges.
14/3
if Nearest_Distance = Distance'Last then
- -- No next node found, graph is not connected
+ -- <No next node found, graph is not connected>
return Paths.Empty_List;
15/3
@@ -53492,7 +53561,7 @@ represented by a map from nodes to sets of edges.
end if;
16/3
- -- Update minimum distance to newly reachable nodes.
+ -- <Update minimum distance to newly reachable nodes.>
17/3
for E of G (Next) loop
@@ -53509,7 +53578,7 @@ represented by a map from nodes to sets of edges.
end loop;
19/3
- -- Rebuild path from target to source.
+ -- <Rebuild path from target to source.>
20/3
declare
@@ -53590,7 +53659,7 @@ A.19 The Package Locales
========================
1/3
-A locale identifies a geopolitical place or region and its associated
+A <locale> identifies a geopolitical place or region and its associated
language, which can be used to determine other
internationalization-related characteristics.
@@ -53624,7 +53693,7 @@ The library package Locales has the following
declaration:
end Ada.Locales;
8/3
-The active locale is the locale associated with the partition of the
+The <active locale> is the locale associated with the partition of the
current task.
9/3
@@ -53687,7 +53756,7 @@ B.1 Interfacing Aspects
=======================
0.1/3
-An interfacing aspect is a representation aspect that is one of the
+An <interfacing> aspect is a representation aspect that is one of the
aspects Import, Export, Link_Name, External_Name, or Convention.
1/3
@@ -53703,7 +53772,7 @@ for objects and subprograms, although implementations
are allowed to
support other entities. The Link_Name and External_Name aspects are
used to specify the link name and external name, respectively, to be
used to identify imported or exported entities in the external
-environment.
+environment.
2/3
The Convention aspect is used to indicate that an Ada entity should use
@@ -53722,18 +53791,18 @@ needed when a given compilation unit is included in a
partition.
4/3
The form of a pragma Linker_Options is as follows:
- Paragraphs 5 through 7 were moved to *note Annex J::, "*note Annex
- J:: Obsolescent Features".
+ <Paragraphs 5 through 7 were moved to *note Annex J::, "*note Annex
+ J:: Obsolescent Features".>
8
- pragma Linker_Options(string_expression);
+ pragma Linker_Options(<string_>expression);
9
A pragma Linker_Options is allowed only at the place of a
declarative_item.
9.1/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Name Resolution Rules_
@@ -53744,34 +53813,34 @@ The Import and Export aspects are of type Boolean.
The Link_Name and External_Name aspects are of type String.
10.1/3
-The expected type for the string_expression in pragma Linker_Options is
-String.
+The expected type for the <string_>expression in pragma Linker_Options
+is String.
_Legality Rules_
11/3
-The aspect Convention shall be specified by a convention_identifier
-which shall be the name of a convention. The convention names are
+The aspect Convention shall be specified by a <convention_>identifier
+which shall be the name of a <convention>. The convention names are
implementation defined, except for certain language-defined ones, such
as Ada and Intrinsic, as explained in *note 6.3.1::, "*note 6.3.1::
Conformance Rules". Additional convention names generally represent the
calling conventions of foreign languages, language implementations, or
-specific run-time models. The convention of a callable entity is its
-calling convention.
+specific run-time models. The convention of a callable entity is its
+<calling convention>.
12
-If L is a convention_identifier for a language, then a type T is said to
-be compatible with convention L, (alternatively, is said to be an
-L-compatible type) if any of the following conditions are met:
+If <L> is a <convention_>identifier for a language, then a type T is
+said to be <compatible with convention L>, (alternatively, is said to be
+an <L-compatible type>) if any of the following conditions are met:
13
- * T is declared in a language interface package corresponding to L
- and is defined to be L-compatible (see *note B.3::, *note B.3.1::,
- *note B.3.2::, *note B.4::, *note B.5::),
+ * T is declared in a language interface package corresponding to <L>
+ and is defined to be <L>-compatible (see *note B.3::, *note
+ B.3.1::, *note B.3.2::, *note B.4::, *note B.5::),
14/3
- * Convention L has been specified for T, and T is eligible for
- convention L; that is:
+ * Convention <L> has been specified for T, and T is <eligible for
+ convention L>; that is:
14.1/4
* T is an enumeration type such that all internal codes
@@ -53782,28 +53851,28 @@ L-compatible type) if any of the following conditions
are met:
15
* T is an array type with either an unconstrained or
statically-constrained first subtype, and its component
- type is L-compatible,
+ type is <L>-compatible,
16
* T is a record type that has no discriminants and that
only has components with statically-constrained subtypes,
- and each component type is L-compatible,
+ and each component type is <L>-compatible,
17/3
* T is an access-to-object type, its designated type is
- L-compatible, and its designated subtype is not an
+ <L>-compatible, and its designated subtype is not an
unconstrained array subtype,
18
* T is an access-to-subprogram type, and its designated
profile's parameter and result types are all
- L-compatible.
+ <L>-compatible.
19
- * T is derived from an L-compatible type,
+ * T is derived from an <L>-compatible type,
20
- * The implementation permits T as an L-compatible type.
+ * The implementation permits T as an <L>-compatible type.
21/3
If the Convention aspect is specified for a type, then the type shall
@@ -53814,9 +53883,9 @@ Notwithstanding any rule to the contrary, a declaration
with a True
Import aspect shall not have a completion.
23/3
- An entity with a True Import aspect (or Export aspect) is said to be
-imported (respectively, exported). An entity shall not be both imported
-and exported.
+An entity with a True Import aspect (or Export aspect) is said to be
+<imported> (respectively, <exported>). An entity shall not be both
+imported and exported.
24
The declaration of an imported object shall not include an explicit
@@ -53833,13 +53902,13 @@ shall each be compatible with the specified
Convention aspect, if any.
27/3
The aspect_definition (if any) used to directly specify an Import,
Export, External_Name, or Link_Name aspect shall be a static expression.
-The string_expression of a pragma Linker_Options shall be static. An
+The <string_>expression of a pragma Linker_Options shall be static. An
External_Name or Link_Name aspect shall be specified only for an entity
that is either imported or exported.
_Static Semantics_
-Paragraphs 28 and 29 were deleted.
+<Paragraphs 28 and 29 were deleted.>
30/3
The Convention aspect represents the calling convention or
@@ -53863,12 +53932,12 @@ In addition:
name, link name, or both may also be specified.
34
-An external name is a string value for the name used by a foreign
+An <external name> is a string value for the name used by a foreign
language program either for an entity that an Ada program imports, or
for referring to an entity that an Ada program exports.
35
-A link name is a string value for the name of an exported or imported
+A <link name> is a string value for the name of an exported or imported
entity, based on the conventions of the foreign language's compiler in
interfacing with the system's linker tool.
@@ -53913,20 +53982,21 @@ is to provide two subprograms whose link names are
"adainit" and
"adafinal". Adainit should contain the elaboration code for library
units. Adafinal should contain the finalization code. These
subprograms should have no effect the second and subsequent time they
-are called.
+are called.
40/3
Automatic elaboration of preelaborated packages should be provided when
specifying the Export aspect as True is supported.
41/4
-For each supported convention L other than Intrinsic, an implementation
-should support specifying the Import and Export aspects for objects of
-L-compatible types and for subprograms, and the Convention aspect for
-L-eligible types and for subprograms, presuming the other language has
-corresponding features. Specifying the Convention aspect need not be
-supported for scalar types, other than enumeration types whose internal
-codes fall within the range 0 .. 2**15-1.
+For each supported convention <L> other than Intrinsic, an
+implementation should support specifying the Import and Export aspects
+for objects of <L>-compatible types and for subprograms, and the
+Convention aspect for <L>-eligible types and for subprograms, presuming
+the other language has corresponding features. Specifying the
+Convention aspect need not be supported for scalar types, other than
+enumeration types whose internal codes fall within the range 0 ..
+2**15-1.
NOTES
@@ -53950,7 +54020,7 @@ codes fall within the range 0 .. 2**15-1.
both for the access-to-subprogram type and the specific
subprogram(s) to which 'Access is applied.
- Paragraphs 45 and 46 were deleted.
+ <Paragraphs 45 and 46 were deleted.>
47
4 See also *note 13.8::, "*note 13.8:: Machine Code Insertions".
@@ -53960,12 +54030,12 @@ codes fall within the range 0 .. 2**15-1.
entity, then the External_Name is ignored.
49/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
_Examples_
50/4
-Example of interfacing aspects:
+<Example of interfacing aspects:>
51/3
package Fortran_Library is
@@ -53996,27 +54066,27 @@ assembly language).
The library package Interfaces has the following skeletal declaration:
3
-
+
package Interfaces is
pragma Pure(Interfaces);
4
- type Integer_n is range -2**(n-1) .. 2**(n-1) - 1; --2's complement
+ type Integer_<n> is range -2**(<n>-1) .. 2**(<n>-1) - 1; --<2's
complement>
5
- type Unsigned_n is mod 2**n;
+ type Unsigned_<n> is mod 2**<n>;
6
- function Shift_Left (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Shift_Right (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Shift_Right_Arithmetic (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Rotate_Left (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
- function Rotate_Right (Value : Unsigned_n; Amount : Natural)
- return Unsigned_n;
+ function Shift_Left (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Shift_Right (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Shift_Right_Arithmetic (Value : Unsigned_<n>; Amount :
Natural)
+ return Unsigned_<n>;
+ function Rotate_Left (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
+ function Rotate_Right (Value : Unsigned_<n>; Amount : Natural)
+ return Unsigned_<n>;
...
end Interfaces;
@@ -54027,11 +54097,11 @@ An implementation shall provide the following
declarations in the
visible part of package Interfaces:
8
- * Signed and modular integer types of n bits, if supported by the
- target architecture, for each n that is at least the size of a
+ * Signed and modular integer types of <n> bits, if supported by the
+ target architecture, for each <n> that is at least the size of a
storage element and that is a factor of the word size. The names
- of these types are of the form Integer_n for the signed types, and
- Unsigned_n for the modular types;
+ of these types are of the form Integer_<n> for the signed types,
+ and Unsigned_<n> for the modular types;
9
* For each such modular type in Interfaces, shifting and rotating
@@ -54067,7 +54137,7 @@ should be provided directly in Interfaces.
_Implementation Advice_
12/2
-This paragraph was deleted.
+<This paragraph was deleted.>
13/3
An implementation supporting an interface to C, COBOL, or Fortran should
@@ -54084,8 +54154,8 @@ B.3 Interfacing with C and C++
The facilities relevant to interfacing with the C language and the
corresponding subset of the C++ language are the package Interfaces.C
and its children, and support for specifying the Convention aspect with
-convention_identifiers C, C_Pass_By_Copy, and any of the C_Variadic_n
-conventions described below.
+<convention_>identifiers C, C_Pass_By_Copy, and any of the
+C_Variadic_<n> conventions described below.
2/3
The package Interfaces.C contains the basic types, constants, and
@@ -54103,62 +54173,62 @@ The library package Interfaces.C has the following
declaration:
pragma Pure(C);
5
- -- Declarations based on C's <limits.h>
+ <-- Declarations based on C's <limits.h>>
6
- CHAR_BIT : constant := implementation-defined; -- typically 8
- SCHAR_MIN : constant := implementation-defined; -- typically -128
- SCHAR_MAX : constant := implementation-defined; -- typically 127
- UCHAR_MAX : constant := implementation-defined; -- typically 255
+ CHAR_BIT : constant := <implementation-defined>; <-- typically 8>
+ SCHAR_MIN : constant := <implementation-defined>; <-- typically -128>
+ SCHAR_MAX : constant := <implementation-defined>; <-- typically 127>
+ UCHAR_MAX : constant := <implementation-defined>; <-- typically 255>
7
- -- Signed and Unsigned Integers
- type int is range implementation-defined;
- type short is range implementation-defined;
- type long is range implementation-defined;
+ <-- Signed and Unsigned Integers>
+ type int is range <implementation-defined>;
+ type short is range <implementation-defined>;
+ type long is range <implementation-defined>;
8
type signed_char is range SCHAR_MIN .. SCHAR_MAX;
for signed_char'Size use CHAR_BIT;
9
- type unsigned is mod implementation-defined;
- type unsigned_short is mod implementation-defined;
- type unsigned_long is mod implementation-defined;
+ type unsigned is mod <implementation-defined>;
+ type unsigned_short is mod <implementation-defined>;
+ type unsigned_long is mod <implementation-defined>;
10
type unsigned_char is mod (UCHAR_MAX+1);
for unsigned_char'Size use CHAR_BIT;
11
- subtype plain_char is implementation-defined;
+ subtype plain_char is <implementation-defined>;
12
- type ptrdiff_t is range implementation-defined;
+ type ptrdiff_t is range <implementation-defined>;
13
- type size_t is mod implementation-defined;
+ type size_t is mod <implementation-defined>;
14
- -- Floating Point
+ <-- Floating Point>
15
- type C_float is digits implementation-defined;
+ type C_float is digits <implementation-defined>;
16
- type double is digits implementation-defined;
+ type double is digits <implementation-defined>;
17
- type long_double is digits implementation-defined;
+ type long_double is digits <implementation-defined>;
18
- -- Characters and Strings
+ <-- Characters and Strings >
19
- type char is <implementation-defined character type>;
+ type char is <<implementation-defined character type>>;
20/1
- nul : constant char := implementation-defined;
+ nul : constant char := <implementation-defined>;
21
function To_C (Item : in Character) return char;
@@ -54197,13 +54267,13 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
29
- -- Wide Character and Wide String
+ <-- Wide Character and Wide String>
30/1
- type wchar_t is <implementation-defined character type>;
+ type wchar_t is <<implementation-defined character type>>;
31/1
- wide_nul : constant wchar_t := implementation-defined;
+ wide_nul : constant wchar_t := <implementation-defined>;
32
function To_C (Item : in Wide_Character) return wchar_t;
@@ -54214,7 +54284,7 @@ The library package Interfaces.C has the following
declaration:
with Pack;
34/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
35
function Is_Nul_Terminated (Item : in wchar_array) return Boolean;
@@ -54242,13 +54312,13 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
39.1/2
- -- ISO/IEC 10646:2003 compatible types defined by ISO/IEC TR
19769:2004.
+ -- <ISO/IEC 10646:2003 compatible types defined by ISO/IEC TR
19769:2004.>
39.2/2
- type char16_t is <implementation-defined character type>;
+ type char16_t is <<implementation-defined character type>>;
39.3/2
- char16_nul : constant char16_t := implementation-defined;
+ char16_nul : constant char16_t := <implementation-defined>;
39.4/2
function To_C (Item : in Wide_Character) return char16_t;
@@ -54259,7 +54329,7 @@ The library package Interfaces.C has the following
declaration:
with Pack;
39.6/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
39.7/2
function Is_Nul_Terminated (Item : in char16_array) return Boolean;
@@ -54285,10 +54355,10 @@ The library package Interfaces.C has the following
declaration:
Trim_Nul : in Boolean := True);
39.11/2
- type char32_t is <implementation-defined character type>;
+ type char32_t is <<implementation-defined character type>>;
39.12/2
- char32_nul : constant char32_t := implementation-defined;
+ char32_nul : constant char32_t := <implementation-defined>;
39.13/2
function To_C (Item : in Wide_Wide_Character) return char32_t;
@@ -54299,7 +54369,7 @@ The library package Interfaces.C has the following
declaration:
with Pack;
39.15/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
39.16/2
function Is_Nul_Terminated (Item : in char32_array) return Boolean;
@@ -54404,8 +54474,7 @@ unsigned_char, depending on the C implementation.
To_C function) to a char, which is assigned to the
corresponding element of Target. If Append_Nul is True, nul
is then assigned to the next element of Target. In either
- case, Count is set to the number of Target elements assigned.
- If Target is not long enough, Constraint_Error is propagated.
+ case, Count is set to the number of Target elements assigned.
If Target is not long enough, Constraint_Error is propagated.
54
For procedure To_Ada, each element of Item (if Trim_Nul is
@@ -54413,7 +54482,7 @@ unsigned_char, depending on the C implementation.
Trim_Nul is True) is converted (via the To_Ada function) to a
Character, which is assigned to the corresponding element of
Target. Count is set to the number of Target elements
- assigned. If Target is not long enough, Constraint_Error is
+ assigned. If Target is not long enough, Constraint_Error is
propagated. If Trim_Nul is True and Item does not contain
nul, then Terminator_Error is propagated.
@@ -54538,7 +54607,7 @@ unsigned_char, depending on the C implementation.
and char_array, except that char32_nul is used instead of nul.
60.13/3
-The Convention aspect with convention_identifier C_Pass_By_Copy shall
+The Convention aspect with <convention_>identifier C_Pass_By_Copy shall
only be specified for a type.
60.14/2
@@ -54553,22 +54622,23 @@ If a type is C_Pass_By_Copy-compatible, then it is
also C-compatible.
60.16/4
The identifiers C_Variadic_0, C_Variadic_1, C_Variadic_2, and so on are
-convention_identifiers. These conventions are said to be C_Variadic.
-The convention C_Variadic_n is the calling convention for a variadic C
-function taking n fixed parameters and then a variable number of
-additional parameters. The C_Variadic_n convention shall only be
-specified as the convention aspect for a subprogram, or for an
-access-to-subprogram type, having at least n parameters. A type is
-compatible with a C_Variadic convention if and only if the type is
-C-compatible.
+<convention_>identifiers. These conventions are said to be
+<C_Variadic>. The convention C_Variadic_<n> is the calling convention
+for a variadic C function taking <n> fixed parameters and then a
+variable number of additional parameters. The C_Variadic_<n> convention
+shall only be specified as the convention aspect for a subprogram, or
+for an access-to-subprogram type, having at least <n> parameters. A
+type is compatible with a C_Variadic convention if and only if the type
+is C-compatible.
_Implementation Requirements_
61/3
An implementation shall support specifying aspect Convention with a C
-convention_identifier for a C-eligible type (see *note B.1::). An
+<convention_>identifier for a C-eligible type (see *note B.1::). An
implementation shall support specifying aspect Convention with a
-C_Pass_By_Copy convention_identifier for a C_Pass_By_Copy-eligible type.
+C_Pass_By_Copy <convention_>identifier for a C_Pass_By_Copy-eligible
+type.
_Implementation Permissions_
@@ -54578,7 +54648,7 @@ packages.
62.1/3
An implementation need not support specifying the Convention aspect with
-convention_identifier C in the following cases:
+<convention_>identifier C in the following cases:
62.2/3
* for a subprogram that has a parameter of an unconstrained array
@@ -54660,7 +54730,7 @@ between Ada and C.
also apply to the return object of a function.
71.3/3
-This paragraph was deleted.
+<This paragraph was deleted.>
NOTES
@@ -54676,7 +54746,7 @@ This paragraph was deleted.
size_t(Item_Type'Size/CHAR_BIT).
74/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
75/4
8 A variadic C function can correspond to several Ada subprograms,
@@ -54685,28 +54755,28 @@ This paragraph was deleted.
_Examples_
76
-Example of using the Interfaces.C package:
+<Example of using the Interfaces.C package:>
77
- --Calling the C Library Function strcpy
+ <--Calling the C Library Function strcpy>
with Interfaces.C;
procedure Test is
package C renames Interfaces.C;
use type C.char_array;
- -- Call <string.h>strcpy:
- -- C definition of strcpy: char *strcpy(char *s1, const char *s2);
- -- This function copies the string pointed to by s2 (including the
terminating null character)
- -- into the array pointed to by s1. If copying takes place between
objects that overlap,
- -- the behavior is undefined. The strcpy function returns the
value of s1.
+ <-- Call <string.h>strcpy:>
+ <-- C definition of strcpy: char *strcpy(char *s1, const char *s2);>
+ <-- This function copies the string pointed to by s2 (including the
terminating null character)>
+ <-- into the array pointed to by s1. If copying takes place
between objects that overlap, >
+ <-- the behavior is undefined. The strcpy function returns the
value of s1.>
78/3
- -- Note: since the C function's return value is of no interest, the
Ada interface is a procedure
+ <-- Note: since the C function's return value is of no interest, the
Ada interface is a procedure>
procedure Strcpy (Target : out C.char_array;
Source : in C.char_array)
with Import => True, Convention => C, External_Name => "strcpy";
79/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
80
Chars1 : C.char_array(1..20);
@@ -54720,7 +54790,7 @@ Example of using the Interfaces.C package:
Strcpy(Chars1, Chars2);
83
- -- Now Chars1(1..6) = "qwert" & C.Nul
+ <-- Now Chars1(1..6) = "qwert" & C.Nul>
84
end Test;
@@ -54819,7 +54889,7 @@ The library package Interfaces.C.Strings has the
following declaration:
21
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Interfaces.C.Strings;
22
@@ -54911,7 +54981,7 @@ B.1::).
function Strlen (Item : in chars_ptr) return size_t;
42
- Returns Val'Length-1 where Val = Value(Item); propagates
+ Returns <Val>'Length-1 where <Val> = Value(Item); propagates
Dereference_Error if Item = Null_Ptr.
43
@@ -55050,7 +55120,7 @@ declaration:
Pointer_Error : exception;
9
- -- C-style Pointer arithmetic
+ <-- C-style Pointer arithmetic>
10/3
function "+" (Left : in Pointer; Right : in ptrdiff_t) return Pointer
@@ -55069,7 +55139,7 @@ declaration:
with Convention => Intrinsic;
12/3
- This paragraph was deleted.
+ <This paragraph was deleted.>
13
function Virtual_Length (Ref : in Pointer;
@@ -55230,7 +55300,7 @@ the array containing the Element designated by Target.
_Examples_
45
-Example of Interfaces.C.Pointers:
+<Example of Interfaces.C.Pointers:>
46
with Interfaces.C.Pointers;
@@ -55282,8 +55352,8 @@ interface correspondence between a given discriminated
type and some C
union. The aspect requires that the associated type shall be given a
representation that allocates no space for its discriminant(s).
-Paragraphs 2 through 3 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 3 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -55300,13 +55370,13 @@ Unchecked_Union
_Legality Rules_
-Paragraphs 4 and 5 were deleted.
+<Paragraphs 4 and 5 were deleted.>
6/3
-A type for which aspect Unchecked_Union is True is called an unchecked
-union type. A subtype of an unchecked union type is defined to be an
-unchecked union subtype. An object of an unchecked union type is
-defined to be an unchecked union object.
+A type for which aspect Unchecked_Union is True is called an <unchecked
+union type>. A subtype of an unchecked union type is defined to be an
+<unchecked union subtype>. An object of an unchecked union type is
+defined to be an <unchecked union object>.
7/2
All component subtypes of an unchecked union type shall be C-compatible.
@@ -55377,7 +55447,7 @@ union object is suppressed (see *note 11.5::). These
checks include:
20/2
A view of an unchecked union object (including a type conversion or
-function call) has inferable discriminants if it has a constrained
+function call) has <inferable discriminants> if it has a constrained
nominal subtype, unless the object is a component of an enclosing
unchecked union object that is subject to a per-object constraint and
the enclosing object lacks inferable discriminants.
@@ -55418,7 +55488,7 @@ Program_Error is raised in the following cases:
attribute of an unchecked union type if the type lacks default
discriminant values.
-Paragraph 29 was deleted.
+<Paragraph 29 was deleted.>
NOTES
@@ -55442,7 +55512,7 @@ Paragraph 29 was deleted.
32/2
X : T;
- Y : Integer := X.F2; -- erroneous
+ Y : Integer := X.F2; -- <erroneous>
File: arm2012.info, Node: B.4, Next: B.5, Prev: B.3, Up: Annex B
@@ -55453,7 +55523,7 @@ B.4 Interfacing with COBOL
1/3
The facilities relevant to interfacing with the COBOL language are the
package Interfaces.COBOL and support for specifying the Convention
-aspect with convention_identifier COBOL.
+aspect with <convention_>identifier COBOL.
2
The COBOL interface package supplies several sets of facilities:
@@ -55484,33 +55554,33 @@ The library package Interfaces.COBOL has the
following declaration:
pragma Preelaborate(COBOL);
8
- -- Types and operations for internal data representations
+ <-- Types and operations for internal data representations>
9
- type Floating is digits implementation-defined;
- type Long_Floating is digits implementation-defined;
+ type Floating is digits <implementation-defined>;
+ type Long_Floating is digits <implementation-defined>;
10
- type Binary is range implementation-defined;
- type Long_Binary is range implementation-defined;
+ type Binary is range <implementation-defined>;
+ type Long_Binary is range <implementation-defined>;
11
- Max_Digits_Binary : constant := implementation-defined;
- Max_Digits_Long_Binary : constant := implementation-defined;
+ Max_Digits_Binary : constant := <implementation-defined>;
+ Max_Digits_Long_Binary : constant := <implementation-defined>;
12/3
- type Decimal_Element is mod implementation-defined;
+ type Decimal_Element is mod <implementation-defined>;
type Packed_Decimal is array (Positive range <>) of Decimal_Element
with Pack;
13
- type COBOL_Character is implementation-defined character type;
+ type COBOL_Character is <implementation-defined character type>;
14
- Ada_To_COBOL : array (Character) of COBOL_Character :=
implementation-defined;
+ Ada_To_COBOL : array (Character) of COBOL_Character :=
<implementation-defined>;
15
- COBOL_To_Ada : array (COBOL_Character) of Character :=
implementation-defined;
+ COBOL_To_Ada : array (COBOL_Character) of Character :=
<implementation-defined>;
16/3
type Alphanumeric is array (Positive range <>) of COBOL_Character
@@ -55535,7 +55605,7 @@ The library package Interfaces.COBOL has the following
declaration:
with Pack;
21
- -- Formats for COBOL data representations
+ <-- Formats for COBOL data representations>
22
type Display_Format is private;
@@ -55563,7 +55633,7 @@ The library package Interfaces.COBOL has the following
declaration:
Packed_Signed : constant Packed_Format;
28
- -- Types for external representation of COBOL binary data
+ <-- Types for external representation of COBOL binary data>
29/3
type Byte is mod 2**COBOL_Character'Size;
@@ -55579,7 +55649,7 @@ The library package Interfaces.COBOL has the following
declaration:
package Decimal_Conversions is
32
- -- Display Formats: data values are represented as Numeric
+ <-- Display Formats: data values are represented as Numeric>
33
function Valid (Item : in Numeric;
@@ -55597,7 +55667,7 @@ The library package Interfaces.COBOL has the following
declaration:
Format : in Display_Format) return Numeric;
37
- -- Packed Formats: data values are represented as Packed_Decimal
+ <-- Packed Formats: data values are represented as Packed_Decimal>
38
function Valid (Item : in Packed_Decimal;
@@ -55615,7 +55685,7 @@ The library package Interfaces.COBOL has the following
declaration:
Format : in Packed_Format) return
Packed_Decimal;
42
- -- Binary Formats: external data values are represented as
Byte_Array
+ <-- Binary Formats: external data values are represented as
Byte_Array>
43
function Valid (Item : in Byte_Array;
@@ -55631,7 +55701,7 @@ The library package Interfaces.COBOL has the following
declaration:
Format : in Binary_Format) return Byte_Array;
46
- -- Internal Binary formats: data values are of type Binary or
Long_Binary
+ <-- Internal Binary formats: data values are of type Binary or
Long_Binary>
47
function To_Decimal (Item : in Binary) return Num;
@@ -55646,7 +55716,7 @@ The library package Interfaces.COBOL has the following
declaration:
50
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Interfaces.COBOL;
51
@@ -55688,8 +55758,8 @@ parameter.
Each of the procedures To_COBOL and To_Ada copies converted elements
from Item to Target, using the appropriate mapping (Ada_To_COBOL or
COBOL_To_Ada, respectively). The index in Target of the last element
-assigned is returned in Last (0 if Item is a null array). If Item'Length
-exceeds Target'Length, Constraint_Error is propagated.
+assigned is returned in Last (0 if Item is a null array). If
+Item'Length exceeds Target'Length, Constraint_Error is propagated.
59
Type Numeric corresponds to COBOL's numeric data category with display
@@ -55859,7 +55929,8 @@ implementation.
92/3
An implementation shall support specifying aspect Convention with a
-COBOL convention_identifier for a COBOL-eligible type (see *note B.1::).
+COBOL <convention>_identifier for a COBOL-eligible type (see *note
+B.1::).
_Implementation Permissions_
@@ -55907,21 +55978,21 @@ correspondences between Ada and COBOL.
_Examples_
101
-Examples of Interfaces.COBOL:
+<Examples of Interfaces.COBOL:>
102
with Interfaces.COBOL;
procedure Test_Call is
103
- -- Calling a foreign COBOL program
- -- Assume that a COBOL program PROG has the following declaration
- -- in its LINKAGE section:
- -- 01 Parameter-Area
- -- 05 NAME PIC X(20).
- -- 05 SSN PIC X(9).
- -- 05 SALARY PIC 99999V99 USAGE COMP.
- -- The effect of PROG is to update SALARY based on some algorithm
+ <-- Calling a foreign COBOL program>
+ <-- Assume that a COBOL program PROG has the following declaration>
+ <-- in its LINKAGE section:>
+ <-- 01 Parameter-Area>
+ <-- 05 NAME PIC X(20).>
+ <-- 05 SSN PIC X(9).>
+ <-- 05 SALARY PIC 99999V99 USAGE COMP.>
+ <-- The effect of PROG is to update SALARY based on some algorithm>
104
package COBOL renames Interfaces.COBOL;
@@ -55934,7 +56005,7 @@ Examples of Interfaces.COBOL:
record
Name : COBOL.Numeric(1..20);
SSN : COBOL.Numeric(1..9);
- Salary : COBOL.Binary; -- Assume Binary = 32 bits
+ Salary : COBOL.Binary; <-- Assume Binary = 32 bits>
end record
with Convention => COBOL;
@@ -55961,20 +56032,20 @@ Examples of Interfaces.COBOL:
111
with Interfaces.COBOL;
- with COBOL_Sequential_IO; -- Assumed to be supplied by implementation
+ with COBOL_Sequential_IO; <-- Assumed to be supplied by implementation>
procedure Test_External_Formats is
112
- -- Using data created by a COBOL program
- -- Assume that a COBOL program has created a sequential file with
- -- the following record structure, and that we need to
- -- process the records in an Ada program
- -- 01 EMPLOYEE-RECORD
- -- 05 NAME PIC X(20).
- -- 05 SSN PIC X(9).
- -- 05 SALARY PIC 99999V99 USAGE COMP.
- -- 05 ADJUST PIC S999V999 SIGN LEADING SEPARATE.
- -- The COMP data is binary (32 bits), high-order byte first
+ <-- Using data created by a COBOL program>
+ <-- Assume that a COBOL program has created a sequential file with>
+ <-- the following record structure, and that we need to>
+ <-- process the records in an Ada program>
+ <-- 01 EMPLOYEE-RECORD>
+ <-- 05 NAME PIC X(20).>
+ <-- 05 SSN PIC X(9).>
+ <-- 05 SALARY PIC 99999V99 USAGE COMP.>
+ <-- 05 ADJUST PIC S999V999 SIGN LEADING SEPARATE.>
+ <-- The COMP data is binary (32 bits), high-order byte first>
113
package COBOL renames Interfaces.COBOL;
@@ -55984,12 +56055,12 @@ Examples of Interfaces.COBOL:
type Adjustments_Type is delta 0.001 digits 6;
115/3
- type COBOL_Employee_Record_Type is -- External representation
+ type COBOL_Employee_Record_Type is <-- External representation>
record
Name : COBOL.Alphanumeric(1..20);
SSN : COBOL.Alphanumeric(1..9);
Salary : COBOL.Byte_Array(1..4);
- Adjust : COBOL.Numeric(1..7); -- Sign and 6 digits
+ Adjust : COBOL.Numeric(1..7); <-- Sign and 6 digits>
end record
with Convention => COBOL;
@@ -56002,7 +56073,7 @@ Examples of Interfaces.COBOL:
COBOL_File : File_Type;
118
- type Ada_Employee_Record_Type is -- Internal representation
+ type Ada_Employee_Record_Type is <-- Internal representation>
record
Name : String(1..20);
SSN : String(1..9);
@@ -56039,7 +56110,7 @@ Examples of Interfaces.COBOL:
To_Decimal(COBOL_Record.Salary, COBOL.High_Order_First);
Ada_Record.Adjust :=
To_Decimal(COBOL_Record.Adjust, COBOL.Leading_Separate);
- ... -- Process Ada_Record
+ ... <-- Process Ada_Record>
end loop;
exception
when End_Error => ...
@@ -56054,7 +56125,7 @@ B.5 Interfacing with Fortran
1/3
The facilities relevant to interfacing with the Fortran language are the
package Interfaces.Fortran and support for specifying the Convention
-aspect with convention_identifier Fortran.
+aspect with <convention_>identifier Fortran.
2
The package Interfaces.Fortran defines Ada types whose representations
@@ -56069,17 +56140,17 @@ used to pass objects between Ada and Fortran programs.
The library package Interfaces.Fortran has the following declaration:
4
- with Ada.Numerics.Generic_Complex_Types; -- see *note G.1.1::
+ with Ada.Numerics.Generic_Complex_Types; <-- see *note G.1.1::>
pragma Elaborate_All(Ada.Numerics.Generic_Complex_Types);
package Interfaces.Fortran is
pragma Pure(Fortran);
5
- type Fortran_Integer is range implementation-defined;
+ type Fortran_Integer is range <implementation-defined>;
6
- type Real is digits implementation-defined;
- type Double_Precision is digits implementation-defined;
+ type Real is digits <implementation-defined>;
+ type Double_Precision is digits <implementation-defined>;
7
type Logical is new Boolean;
@@ -56097,7 +56168,7 @@ The library package Interfaces.Fortran has the
following declaration:
j : Imaginary renames Single_Precision_Complex_Types.j;
11
- type Character_Set is implementation-defined character type;
+ type Character_Set is <implementation-defined character type>;
12/3
type Fortran_Character is array (Positive range <>) of Character_Set
@@ -56139,7 +56210,7 @@ found in Interfaces.COBOL.
20/3
An implementation shall support specifying aspect Convention with a
-Fortran convention_identifier for a Fortran-eligible type (see *note
+Fortran <convention>_identifier for a Fortran-eligible type (see *note
B.1::).
_Implementation Permissions_
@@ -56148,16 +56219,17 @@ B.1::).
An implementation may add additional declarations to the Fortran
interface packages. For example, the Fortran interface package for an
implementation of Fortran 77 (ANSI X3.9-1978) that defines types like
-Integer*n, Real*n, Logical*n, and Complex*n may contain the declarations
-of types named Integer_Star_n, Real_Star_n, Logical_Star_n, and
-Complex_Star_n. (This convention should not apply to Character*n, for
-which the Ada analog is the constrained array subtype Fortran_Character
-(1..n).) Similarly, the Fortran interface package for an implementation
-of Fortran 90 that provides multiple kinds of intrinsic types, e.g.
-Integer (Kind=n), Real (Kind=n), Logical (Kind=n), Complex (Kind=n), and
-Character (Kind=n), may contain the declarations of types with the
-recommended names Integer_Kind_n, Real_Kind_n, Logical_Kind_n,
-Complex_Kind_n, and Character_Kind_n.
+Integer*<n>, Real*<n>, Logical*<n>, and Complex*<n> may contain the
+declarations of types named Integer_Star_<n>, Real_Star_<n>,
+Logical_Star_<n>, and Complex_Star_<n>. (This convention should not
+apply to Character*<n>, for which the Ada analog is the constrained
+array subtype Fortran_Character (1..<n>).) Similarly, the Fortran
+interface package for an implementation of Fortran 90 that provides
+multiple <kinds> of intrinsic types, e.g. Integer (Kind=<n>), Real
+(Kind=<n>), Logical (Kind=<n>), Complex (Kind=<n>), and Character
+(Kind=<n>), may contain the declarations of types with the recommended
+names Integer_Kind_<n>, Real_Kind_<n>, Logical_Kind_<n>,
+Complex_Kind_<n>, and Character_Kind_<n>.
_Implementation Advice_
@@ -56195,7 +56267,7 @@ correspondences between Ada and Fortran:
_Examples_
28
-Example of Interfaces.Fortran:
+<Example of Interfaces.Fortran:>
29
with Interfaces.Fortran;
@@ -56205,10 +56277,10 @@ Example of Interfaces.Fortran:
30/3
type Fortran_Matrix is array (Integer range <>,
Integer range <>) of Double_Precision
- with Convention => Fortran; -- stored in Fortran's
- -- column-major order
+ with Convention => Fortran; <-- stored in
Fortran's>
+ <-- column-major order>
procedure Invert (Rank : in Fortran_Integer; X : in out Fortran_Matrix)
- with Import => True, Convention => Fortran; -- a Fortran subroutine
+ with Import => True, Convention => Fortran; <-- a Fortran
subroutine>
31
Rank : constant Fortran_Integer := 100;
@@ -56329,7 +56401,7 @@ constructs. Examples of such instructions include:
and swap, decrement and test, enqueue/dequeue.
13
- * Standard numeric functions -- e.g., sin, log.
+ * Standard numeric functions -- e.g., <sin>, <log>.
14
* String manipulation operations -- e.g., translate and test.
@@ -56364,28 +56436,28 @@ C.3 Interrupt Support
1/3
This subclause specifies the language-defined model for hardware
-interrupts in addition to mechanisms for handling interrupts.
+interrupts in addition to mechanisms for handling interrupts.
_Dynamic Semantics_
2
-An interrupt represents a class of events that are detected by the
-hardware or the system software. Interrupts are said to occur. An
-occurrence of an interrupt is separable into generation and delivery.
-Generation of an interrupt is the event in the underlying hardware or
-system that makes the interrupt available to the program. Delivery is
+An <interrupt> represents a class of events that are detected by the
+hardware or the system software. Interrupts are said to occur. An
+<occurrence> of an interrupt is separable into generation and
delivery.<Generation> of an interrupt is the event in the underlying hardware or
+system that makes the interrupt available to the program. <Delivery> is
the action that invokes part of the program as response to the interrupt
-occurrence. Between generation and delivery, the interrupt occurrence
-(or interrupt) is pending. Some or all interrupts may be blocked. When
-an interrupt is blocked, all occurrences of that interrupt are prevented
-from being delivered. Certain interrupts are reserved. The set of
-reserved interrupts is implementation defined. A reserved interrupt is
-either an interrupt for which user-defined handlers are not supported,
-or one which already has an attached handler by some other
-implementation-defined means. Program units can be connected to
+occurrence. Between generation and delivery, the interrupt occurrence
+(or interrupt) is <pending>. Some or all interrupts may be <blocked>.
+When an interrupt is blocked, all occurrences of that interrupt are
+prevented from being delivered. Certain interrupts are <reserved>. The
+set of reserved interrupts is implementation defined. A reserved
+interrupt is either an interrupt for which user-defined handlers are not
+supported, or one which already has an attached handler by some other
+implementation-defined means. Program units can be connected to
nonreserved interrupts. While connected, the program unit is said to be
-attached to that interrupt. The execution of that program unit, the
-interrupt handler, is invoked upon delivery of the interrupt occurrence.
+<attached> to that interrupt. The execution of that program unit, the
+<interrupt handler>, is invoked upon delivery of the interrupt
+occurrence.
3
While a handler is attached to an interrupt, it is called once for each
@@ -56398,7 +56470,7 @@ prevented from being delivered. Whether such
occurrences remain pending
or are lost is implementation defined.
5
-Each interrupt has a default treatment which determines the system's
+Each interrupt has a <default treatment> which determines the system's
response to an occurrence of that interrupt when no user-defined handler
is attached. The set of possible default treatments is implementation
defined, as is the method (if one exists) for configuring the default
@@ -56557,8 +56629,8 @@ File: arm2012.info, Node: C.3.1, Next: C.3.2, Up: C.3
C.3.1 Protected Procedure Handlers
----------------------------------
-Paragraphs 1 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 1 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -56586,12 +56658,12 @@ If either the Attach_Handler or Interrupt_Handler
aspect are specified
for a protected procedure, the corresponding protected_type_declaration
(*note 9.4: S0210.) or single_protected_declaration (*note 9.4: S0211.)
shall be a library-level declaration and shall not be declared within a
-generic body. In addition to the places where Legality Rules normally
+generic body. In addition to the places where Legality Rules normally
apply (see *note 12.3::), this rule also applies in the private part of
an instance of a generic unit.
8/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Dynamic Semantics_
@@ -56603,13 +56675,13 @@ multiple interrupts.
10/3
The expression specified for the Attach_Handler aspect of a protected
-procedure P is evaluated as part of the creation of the protected object
-that contains P. The value of the expression identifies an interrupt.
-As part of the initialization of that object, P (the handler procedure)
-is attached to the identified interrupt. A check is made that the
-corresponding interrupt is not reserved. Program_Error is raised if the
-check fails, and the existing treatment for the interrupt is not
-affected.
+procedure <P> is evaluated as part of the creation of the protected
+object that contains <P>. The value of the expression identifies an
+interrupt. As part of the initialization of that object, <P> (the
+<handler> procedure) is attached to the identified interrupt. A check
+is made that the corresponding interrupt is not reserved. Program_Error
+is raised if the check fails, and the existing treatment for the
+interrupt is not affected.
11/3
If the Ceiling_Locking policy (see *note D.3::) is in effect, then upon
@@ -56617,7 +56689,7 @@ the initialization of a protected object that contains
a protected
procedure for which either the Attach_Handler aspect is specified or the
Interrupt_Handler aspect is True, a check is made that the initial
ceiling priority of the object is in the range of
-System.Interrupt_Priority. If the check fails, Program_Error is raised.
+System.Interrupt_Priority. If the check fails, Program_Error is raised.
12/3
When a protected object is finalized, for any of its procedures that are
@@ -56736,12 +56808,12 @@ The following language-defined packages exist:
with System;
with System.Multiprocessors;
package Ada.Interrupts is
- type Interrupt_Id is implementation-defined;
+ type Interrupt_Id is <implementation-defined>;
type Parameterless_Handler is
access protected procedure;
3/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
4
function Is_Reserved (Interrupt : Interrupt_Id)
@@ -56780,16 +56852,16 @@ The following language-defined packages exist:
11
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Interrupts;
12
package Ada.Interrupts.Names is
- implementation-defined : constant Interrupt_Id :=
- implementation-defined;
+ <implementation-defined> : constant Interrupt_Id :=
+ <implementation-defined>;
. . .
- implementation-defined : constant Interrupt_Id :=
- implementation-defined;
+ <implementation-defined> : constant Interrupt_Id :=
+ <implementation-defined>;
end Ada.Interrupts.Names;
_Dynamic Semantics_
@@ -56815,7 +56887,7 @@ attached to the interrupt, Current_Handler returns null.
The Attach_Handler procedure attaches the specified handler to the
interrupt, overriding any existing treatment (including a user handler)
in effect for that interrupt. If New_Handler is null, the default
-treatment is restored. If New_Handler designates a protected procedure
+treatment is restored. If New_Handler designates a protected procedure
for which the aspect Interrupt_Handler is False, Program_Error is
raised. In this case, the operation does not modify the existing
interrupt treatment.
@@ -56833,21 +56905,21 @@ specified interrupt.
20
For all operations defined in this package that take a parameter of type
Interrupt_Id, with the exception of Is_Reserved and Reference, a check
-is made that the specified interrupt is not reserved. Program_Error is
+is made that the specified interrupt is not reserved. Program_Error is
raised if this check fails.
21/3
If, by using the Attach_Handler, Detach_Handler, or Exchange_Handler
procedures, an attempt is made to detach a handler that was attached
statically (using the aspect Attach_Handler), the handler is not
-detached and Program_Error is raised.
+detached and Program_Error is raised.
22/2
The Reference function returns a value of type System.Address that can
be used to attach a task entry via an address clause (see *note J.7.1::)
to the interrupt specified by Interrupt. This function raises
Program_Error if attaching task entries to interrupts (or to this
-particular interrupt) is not supported.
+particular interrupt) is not supported.
22.1/3
The function Get_CPU returns the processor on which the handler for
@@ -56890,7 +56962,7 @@ as in the predefined package Interrupts.
_Examples_
27
-Example of interrupt handlers:
+<Example of interrupt handlers:>
28/3
Device_Priority : constant
@@ -56923,7 +56995,7 @@ requirements for the Preelaborate pragma (see *note
10.2.1::).
2
The implementation shall not incur any run-time overhead for the
elaboration checks of subprograms and protected_bodies declared in
-preelaborated library units.
+preelaborated library units.
3
The implementation shall not execute any memory write operations after
@@ -56931,8 +57003,8 @@ load time for the elaboration of constant objects
declared immediately
within the declarative region of a preelaborated library package, so
long as the subtype and initial expression (or default initial
expressions if initialized by default) of the object_declaration satisfy
-the following restrictions. The meaning of load time is implementation
-defined.
+the following restrictions. The meaning of <load time> is
+implementation defined.
4
* Any subtype_mark denotes a statically constrained subtype, with
@@ -57002,7 +57074,7 @@ in storage used for the names of entities with runtime
name text.
_Static Semantics_
1.1/4
-An entity with runtime name text is a nonderived enumeration first
+An entity with <runtime name text> is a nonderived enumeration first
subtype, a tagged first subtype, or an exception.
1.2/4
@@ -57027,7 +57099,7 @@ Discard_Names
4
A pragma Discard_Names is allowed only immediately within a
declarative_part, immediately within a package_specification, or as
- a configuration pragma.
+ a configuration pragma.
_Legality Rules_
@@ -57083,8 +57155,8 @@ C.6 Shared Variable Control
This subclause defines representation aspects that control the use of
shared variables.
-Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -57133,15 +57205,15 @@ shall be a static expression. If not specified
(including by
inheritance), each of these aspects is False.
7/3
-An atomic type is one for which the aspect Atomic is True. An atomic
-object (including a component) is one for which the aspect Atomic is
-True, or a component of an array for which the aspect Atomic_Components
-is True for the associated type, or any object of an atomic type, other
-than objects obtained by evaluating a slice.
+An <atomic> type is one for which the aspect Atomic is True. An
+<atomic> object (including a component) is one for which the aspect
+Atomic is True, or a component of an array for which the aspect
+Atomic_Components is True for the associated type, or any object of an
+atomic type, other than objects obtained by evaluating a slice.
8/3
-A volatile type is one for which the aspect Volatile is True. A
-volatile object (including a component) is one for which the aspect
+A <volatile> type is one for which the aspect Volatile is True. A
+<volatile> object (including a component) is one for which the aspect
Volatile is True, or a component of an array for which the aspect
Volatile_Components is True for the associated type, or any object of a
volatile type. In addition, every atomic type or object is also defined
@@ -57149,14 +57221,14 @@ to be volatile. Finally, if an object is volatile,
then so are all of
its subcomponents (the same does not apply to atomic).
8.1/4
-When True, the aspects Independent and Independent_Components specify as
-independently addressable the named object or component(s), or in the
-case of a type, all objects or components of that type. All atomic
+When True, the aspects Independent and Independent_Components <specify
+as independently addressable> the named object or component(s), or in
+the case of a type, all objects or components of that type. All atomic
objects and aliased objects are considered to be specified as
independently addressable.
-Paragraph 9 was moved to *note Annex J::, "*note Annex J:: Obsolescent
-Features".
+<Paragraph 9 was moved to *note Annex J::, "*note Annex J:: Obsolescent
+Features".>
_Legality Rules_
@@ -57211,8 +57283,8 @@ or type for which the aspect Independent or
Independent_Components is
True, in a way that prevents the implementation from providing the
independent addressability required by the aspect.
-Paragraph 14 was moved to *note Annex J::, "*note Annex J:: Obsolescent
-Features".
+<Paragraph 14 was moved to *note Annex J::, "*note Annex J:: Obsolescent
+Features".>
_Dynamic Semantics_
@@ -57250,7 +57322,7 @@ implementation shall not generate any memory reads or
updates of atomic
or volatile objects other than those specified by the program.
21/4
-This paragraph was deleted.
+<This paragraph was deleted.>
_Implementation Advice_
@@ -57323,7 +57395,7 @@ The following language-defined library package exists:
function Is_Callable (T : Task_Id) return Boolean;
function Activation_Is_Complete (T : Task_Id) return Boolean;
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Task_Identification;
_Dynamic Semantics_
@@ -57496,7 +57568,7 @@ the Val parameter is replaced with Initial_Value.
13
For all the operations declared in this package, Tasking_Error is raised
-if the task identified by T is terminated. Program_Error is raised if
+if the task identified by T is terminated. Program_Error is raised if
the value of T is Null_Task_Id.
13.1/2
@@ -57699,8 +57771,8 @@ The following language-defined library package exists:
8/3
The type Termination_Handler identifies a protected procedure to be
executed by the implementation when a task terminates. Such a protected
-procedure is called a handler. In all cases T identifies the task that
-is terminating. If the task terminates due to completing the last
+procedure is called a <handler>. In all cases T identifies the task
+that is terminating. If the task terminates due to completing the last
statement of its body, or as a result of waiting on a terminate
alternative, and the finalization of the task completes normally, then
Cause is set to Normal and X is set to Null_Occurrence. If the task
@@ -57715,12 +57787,13 @@ Unhandled_Exception or Abnormal, and X is an
exception occurrence that
identifies the Program_Error exception.
9/2
-Each task has two termination handlers, a fall-back handler and a
-specific handler. The specific handler applies only to the task itself,
-while the fall-back handler applies only to the dependent tasks of the
-task. A handler is said to be set if it is associated with a nonnull
-value of type Termination_Handler, and cleared otherwise. When a task
-is created, its specific handler and fall-back handler are cleared.
+Each task has two termination handlers, a <fall-back handler> and a
+<specific handler>. The specific handler applies only to the task
+itself, while the fall-back handler applies only to the dependent tasks
+of the task. A handler is said to be <set> if it is associated with a
+nonnull value of type Termination_Handler, and <cleared> otherwise.
+When a task is created, its specific handler and fall-back handler are
+cleared.
10/3
The procedure Set_Dependents_Fallback_Handler changes the fall-back
@@ -57859,8 +57932,8 @@ D.1 Task Priorities
This subclause specifies the priority model for real-time systems. In
addition, the methods for specifying priorities are defined.
-Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 2 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
@@ -57883,7 +57956,7 @@ Interrupt_Priority
_Legality Rules_
7/3
-This paragraph was deleted.
+<This paragraph was deleted.>
8/3
If the Priority aspect is specified for a subprogram, the expression
@@ -57903,9 +57976,9 @@ for a synchronized interface type.
The following declarations exist in package System:
10
- subtype Any_Priority is Integer range implementation-defined;
+ subtype Any_Priority is Integer range <implementation-defined>;
subtype Priority is Any_Priority
- range Any_Priority'First .. implementation-defined;
+ range Any_Priority'First .. <implementation-defined>;
subtype Interrupt_Priority is Any_Priority
range Priority'Last+1 .. Any_Priority'Last;
@@ -57921,7 +57994,7 @@ priority values below System.Interrupt_Priority'First
is specified by
the subtype System.Priority.
13/3
-This paragraph was deleted.
+<This paragraph was deleted.>
_Dynamic Semantics_
@@ -57931,16 +58004,16 @@ other than the main subprogram; the Priority value is
not associated
with any task.
15
-A task priority is an integer value that indicates a degree of urgency
+A <task priority> is an integer value that indicates a degree of urgency
and is the basis for resolving competing demands of tasks for resources.
Unless otherwise specified, whenever tasks compete for processors or
other implementation-defined resources, the resources are allocated to
-the task with the highest priority value. The base priority of a task
+the task with the highest priority value. The <base priority> of a task
is the priority with which it was created, or to which it was later set
by Dynamic_Priorities.Set_Priority (see *note D.5::). At all times, a
-task also has an active priority, which generally reflects its base
+task also has an <active priority>, which generally reflects its base
priority as well as any priority it inherits from other sources.
-Priority inheritance is the process by which the priority of a task or
+<Priority inheritance> is the process by which the priority of a task or
other entity (e.g. a protected object; see *note D.3::) is used in the
evaluation of another task's active priority.
@@ -57956,7 +58029,7 @@ created (see *note 9.1::). For the Priority aspect,
the value of the
expression is converted to the subtype Priority; for the
Interrupt_Priority aspect, this value is converted to the subtype
Any_Priority. The priority value is then associated with the task
-object.
+object.
18/3
Likewise, the priority value is associated with the environment task if
@@ -58079,38 +58152,38 @@ concerned with task dispatching.
_Dynamic Semantics_
2/2
-A task can become a running task only if it is ready (see *note 9::) and
-the execution resources required by that task are available. Processors
-are allocated to tasks based on each task's active priority.
+A task can become a <running task> only if it is ready (see *note 9::)
+and the execution resources required by that task are available.
+Processors are allocated to tasks based on each task's active priority.
3
It is implementation defined whether, on a multiprocessor, a task that
is waiting for access to a protected object keeps its processor busy.
4/2
-Task dispatching is the process by which one ready task is selected for
-execution on a processor. This selection is done at certain points
-during the execution of a task called task dispatching points. A task
+<Task dispatching> is the process by which one ready task is selected
+for execution on a processor. This selection is done at certain points
+during the execution of a task called <task dispatching points>. A task
reaches a task dispatching point whenever it becomes blocked, and when
it terminates. Other task dispatching points are defined throughout
this Annex for specific policies.
5/2
-Task dispatching policies are specified in terms of conceptual ready
-queues and task states. A ready queue is an ordered list of ready
-tasks. The first position in a queue is called the head of the queue,
-and the last position is called the tail of the queue. A task is ready
-if it is in a ready queue, or if it is running. Each processor has one
-ready queue for each priority value. At any instant, each ready queue
-of a processor contains exactly the set of tasks of that priority that
-are ready for execution on that processor, but are not running on any
-processor; that is, those tasks that are ready, are not running on any
-processor, and can be executed using that processor and other available
-resources. A task can be on the ready queues of more than one
+<Task dispatching policies> are specified in terms of conceptual <ready
+queues> and task states. A ready queue is an ordered list of ready
+tasks. The first position in a queue is called the <head of the queue>,
+and the last position is called the <tail of the queue>. A task is
+<ready> if it is in a ready queue, or if it is running. Each processor
+has one ready queue for each priority value. At any instant, each ready
+queue of a processor contains exactly the set of tasks of that priority
+that are ready for execution on that processor, but are not running on
+any processor; that is, those tasks that are ready, are not running on
+any processor, and can be executed using that processor and other
+available resources. A task can be on the ready queues of more than one
processor.
6/2
-Each processor also has one running task, which is the task currently
+Each processor also has one <running task>, which is the task currently
being executed by that processor. Whenever a task running on a
processor reaches a task dispatching point it goes back to one or more
ready queues; a task (possibly the same task) is then selected to run on
@@ -58123,7 +58196,7 @@ A call of Yield is a task dispatching point. Yield is
a potentially
blocking operation (see *note 9.5.1::).
8/2
-This paragraph was deleted.
+<This paragraph was deleted.>
_Implementation Permissions_
@@ -58148,8 +58221,8 @@ dispatching point.
11/3
7 Clause *note 9:: specifies under which circumstances a task
becomes ready. The ready state is affected by the rules for task
- activation and termination, delay statements, and entry calls. When
- a task is not ready, it is said to be blocked.
+ activation and termination, delay statements, and entry calls.
+ When a task is not ready, it is said to be blocked.
12
8 An example of a possible implementation-defined execution
@@ -58206,37 +58279,37 @@ that are assigned individual dispatching policies.
The form of a pragma Task_Dispatching_Policy is as follows:
3
- pragma Task_Dispatching_Policy(policy_identifier);
+ pragma Task_Dispatching_Policy(<policy_>identifier);
3.1/2
The form of a pragma Priority_Specific_Dispatching is as follows:
3.2/2
pragma Priority_Specific_Dispatching (
- policy_identifier, first_priority_expression, last_priority_
- expression);
+ <policy_>identifier, <first_priority_>expression,
+ <last_priority_>expression);
_Name Resolution Rules_
3.3/2
-The expected type for first_priority_expression and
-last_priority_expression is Integer.
+The expected type for <first_priority_>expression and
+<last_priority_>expression is Integer.
_Legality Rules_
4/2
-The policy_identifier used in a pragma Task_Dispatching_Policy shall be
-the name of a task dispatching policy.
+The <policy_>identifier used in a pragma Task_Dispatching_Policy shall
+be the name of a task dispatching policy.
4.1/2
-The policy_identifier used in a pragma Priority_Specific_Dispatching
+The <policy_>identifier used in a pragma Priority_Specific_Dispatching
shall be the name of a task dispatching policy.
4.2/2
-Both first_priority_expression and last_priority_expression shall be
+Both <first_priority_>expression and <last_priority_>expression shall be
static expressions in the range of System.Any_Priority;
-last_priority_expression shall have a value greater than or equal to
-first_priority_expression.
+<last_priority_>expression shall have a value greater than or equal to
+<first_priority_>expression.
_Static Semantics_
@@ -58263,7 +58336,7 @@ Priority_Specific_Dispatching pragmas is
FIFO_Within_Priorities.
5/2
A Task_Dispatching_Policy pragma is a configuration pragma. A
-Priority_Specific_Dispatching pragma is a configuration pragma.
+Priority_Specific_Dispatching pragma is a configuration pragma.
5.1/2
The priority ranges specified in more than one
@@ -58275,17 +58348,18 @@ If a partition contains one or more
Priority_Specific_Dispatching
pragmas it shall not contain a Task_Dispatching_Policy pragma.
6/2
-This paragraph was deleted.
+<This paragraph was deleted.>
_Dynamic Semantics_
7/2
-A task dispatching policy specifies the details of task dispatching that
-are not covered by the basic task dispatching model. These rules govern
-when tasks are inserted into and deleted from the ready queues. A
-single task dispatching policy is specified by a Task_Dispatching_Policy
-pragma. Pragma Priority_Specific_Dispatching assigns distinct
-dispatching policies to subranges of System.Any_Priority.
+A <task dispatching policy> specifies the details of task dispatching
+that are not covered by the basic task dispatching model. These rules
+govern when tasks are inserted into and deleted from the ready queues.
+A single task dispatching policy is specified by a
+Task_Dispatching_Policy pragma. Pragma Priority_Specific_Dispatching
+assigns distinct dispatching policies to subranges of
+System.Any_Priority.
7.1/2
If neither pragma applies to any of the program units comprising a
@@ -58303,7 +58377,7 @@ A task that has its base priority changed may move from
one dispatching
policy to another. It is immediately subject to the new dispatching
policy.
-Paragraphs 7 through 13 were moved to D.2.3.
+<Paragraphs 7 through 13 were moved to D.2.3.>
_Implementation Requirements_
@@ -58314,7 +58388,7 @@ or more Priority_Specific_Dispatching pragmas to be
given.
_Documentation Requirements_
-Paragraphs 14 through 16 were moved to D.2.3.
+<Paragraphs 14 through 16 were moved to D.2.3.>
_Implementation Permissions_
@@ -58329,7 +58403,7 @@ if it is infeasible to support it in the target
environment.
NOTES
- Paragraphs 19 through 21 were deleted.
+ <Paragraphs 19 through 21 were deleted.>
File: arm2012.info, Node: D.2.3, Next: D.2.4, Prev: D.2.2, Up: D.2
@@ -58343,7 +58417,7 @@ This subclause defines a preemptive task dispatching
policy.
_Static Semantics_
2/2
-The policy_identifier FIFO_Within_Priorities is a task dispatching
+The <policy_>identifier FIFO_Within_Priorities is a task dispatching
policy.
_Dynamic Semantics_
@@ -58383,7 +58457,7 @@ Each of the events specified above is a task
dispatching point (see
A task dispatching point occurs for the currently running task of a
processor whenever there is a nonempty ready queue for that processor
with a higher priority than the priority of the running task. The
-currently running task is said to be preempted and it is added at the
+currently running task is said to be <preempted> and it is added at the
head of the ready queue for its active priority.
_Implementation Requirements_
@@ -58396,8 +58470,8 @@ the locking policy (see *note D.3::) to be specified as
Ceiling_Locking.
_Documentation Requirements_
11/2
-Priority inversion is the duration for which a task remains at the head
-of the highest priority nonempty ready queue while the processor
+<Priority inversion> is the duration for which a task remains at the
+head of the highest priority nonempty ready queue while the processor
executes a lower priority task. The implementation shall document:
12/2
@@ -58436,7 +58510,7 @@ This subclause defines a non-preemptive task
dispatching policy.
_Static Semantics_
2/2
-The policy_identifier Non_Preemptive_FIFO_Within_Priorities is a task
+The <policy_>identifier Non_Preemptive_FIFO_Within_Priorities is a task
dispatching policy.
2.1/3
@@ -58459,7 +58533,7 @@ preempted.
3/2
Non_Preemptive_FIFO_Within_Priorities shall not be specified as the
-policy_identifier of pragma Priority_Specific_Dispatching (see *note
+<policy_>identifier of pragma Priority_Specific_Dispatching (see *note
D.2.2::).
_Dynamic Semantics_
@@ -58491,7 +58565,7 @@ to the ready queues occur only as follows:
9/3
For this policy, blocking or termination of a task, a delay_statement, a
call to Yield_To_Higher, and a call to Yield_To_Same_Or_Higher or Yield
-are the only task dispatching points (see *note D.2.1::).
+are the only task dispatching points (see *note D.2.1::).
_Implementation Requirements_
@@ -58531,7 +58605,7 @@ Round_Robin_Within_Priorities and the package
Round_Robin.
_Static Semantics_
2/2
-The policy_identifier Round_Robin_Within_Priorities is a task
+The <policy>_identifier Round_Robin_Within_Priorities is a task
dispatching policy.
3/2
@@ -58542,7 +58616,7 @@ The following language-defined library package exists:
with Ada.Real_Time;
package Ada.Dispatching.Round_Robin is
Default_Quantum : constant Ada.Real_Time.Time_Span :=
- implementation-defined;
+ <implementation-defined>;
procedure Set_Quantum (Pri : in System.Priority;
Quantum : in Ada.Real_Time.Time_Span);
procedure Set_Quantum (Low, High : in System.Priority;
@@ -58652,13 +58726,13 @@ and a dispatching policy that defines Earliest
Deadline First (EDF)
dispatching. An aspect is defined to assign an initial deadline to a
task.
-Paragraphs 3 through 6 were moved to *note Annex J::, "*note Annex J::
-Obsolescent Features".
+<Paragraphs 3 through 6 were moved to *note Annex J::, "*note Annex J::
+Obsolescent Features".>
_Static Semantics_
7/2
-The policy_identifier EDF_Across_Priorities is a task dispatching
+The <policy_>identifier EDF_Across_Priorities is a task dispatching
policy.
8/2
@@ -58744,20 +58818,20 @@ on a ready queue it is removed and re-entered on to
the ready queue
determined by the rules defined below.
17/2
-When EDF_Across_Priorities is specified for priority range Low..High all
-ready queues in this range are ordered by deadline. The task at the
+When EDF_Across_Priorities is specified for priority range <Low>..<High>
+all ready queues in this range are ordered by deadline. The task at the
head of a queue is the one with the earliest deadline.
18/2
-A task dispatching point occurs for the currently running task T to
+A task dispatching point occurs for the currently running task <T> to
which policy EDF_Across_Priorities applies:
19/2
- * when a change to the deadline of T occurs;
+ * when a change to the deadline of <T> occurs;
20/2
- * there is a task on the ready queue for the active priority of T
- with a deadline earlier than the deadline of T; or
+ * there is a task on the ready queue for the active priority of <T>
+ with a deadline earlier than the deadline of <T>; or
21/2
* there is a nonempty ready queue for that processor with a higher
@@ -58768,31 +58842,33 @@ In these cases, the currently running task is said to
be preempted and
is returned to the ready queue for its active priority.
23/2
-For a task T to which policy EDF_Across_Priorities applies, the base
+For a task <T> to which policy EDF_Across_Priorities applies, the base
priority is not a source of priority inheritance; the active priority
when first activated or while it is blocked is defined as the maximum of
the following:
24/2
* the lowest priority in the range specified as EDF_Across_Priorities
- that includes the base priority of T;
+ that includes the base priority of <T>;
25/2
- * the priorities, if any, currently inherited by T;
+ * the priorities, if any, currently inherited by <T>;
26/3
- * the highest priority P, if any, less than the base priority of T
- such that one or more tasks are executing within a protected object
- with ceiling priority P and task T has an earlier deadline than all
- such tasks; and furthermore T has an earlier deadline than all
- other tasks on ready queues with priorities in the given
- EDF_Across_Priorities range that are strictly less than P.
+ * the highest priority <P>, if any, less than the base priority of
+ <T> such that one or more tasks are executing within a protected
+ object with ceiling priority <P> and task <T> has an earlier
+ deadline than all such tasks; and furthermore <T> has an earlier
+ deadline than all other tasks on ready queues with priorities in
+ the given EDF_Across_Priorities range that are strictly less than
+ <P>.
27/2
-When a task T is first activated or becomes unblocked, it is added to
+When a task <T> is first activated or becomes unblocked, it is added to
the ready queue corresponding to this active priority. Until it becomes
-blocked again, the active priority of T remains no less than this value;
-it will exceed this value only while it is inheriting a higher priority.
+blocked again, the active priority of <T> remains no less than this
+value; it will exceed this value only while it is inheriting a higher
+priority.
28/2
When the setting of the base priority of a ready task takes effect and
@@ -58808,11 +58884,11 @@ raised if the value of T is Null_Task_Id.
_Bounded (Run-Time) Errors_
30/2
-If EDF_Across_Priorities is specified for priority range Low..High, it
-is a bounded error to declare a protected object with ceiling priority
-Low or to assign the value Low to attribute 'Priority. In either case
-either Program_Error is raised or the ceiling of the protected object is
-assigned the value Low+1.
+If EDF_Across_Priorities is specified for priority range <Low>..<High>,
+it is a bounded error to declare a protected object with ceiling
+priority <Low> or to assign the value <Low> to attribute 'Priority. In
+either case either Program_Error is raised or the ceiling of the
+protected object is assigned the value <Low>+1.
_Erroneous Execution_
@@ -58831,9 +58907,10 @@ delayed later than what is specified for a single
processor.
NOTES
33/3
- 18 If two adjacent priority ranges, A..B and B+1..C are specified
- to have policy EDF_Across_Priorities, then this is not equivalent
- to this policy being specified for the single range, A..C.
+ 18 If two adjacent priority ranges, <A>..<B> and <B>+1..<C> are
+ specified to have policy EDF_Across_Priorities, then this is not
+ equivalent to this policy being specified for the single range,
+ <A>..<C>.
34/2
19 The above rules implement the preemption-level protocol (also
@@ -58851,7 +58928,7 @@ D.3 Priority Ceiling Locking
1/3
This subclause specifies the interactions between priority task
scheduling and protected object ceilings. This interaction is based on
-the concept of the ceiling priority of a protected object.
+the concept of the <ceiling priority> of a protected object.
_Syntax_
@@ -58859,12 +58936,12 @@ the concept of the ceiling priority of a protected
object.
The form of a pragma Locking_Policy is as follows:
3
- pragma Locking_Policy(policy_identifier);
+ pragma Locking_Policy(<policy_>identifier);
_Legality Rules_
4
-The policy_identifier shall either be Ceiling_Locking or an
+The <policy_>identifier shall either be Ceiling_Locking or an
implementation-defined identifier.
_Post-Compilation Rules_
@@ -58880,13 +58957,13 @@ protected objects have a priority. The locking
policy specifies the
meaning of the priority of a protected object, and the relationships
between these priorities and task priorities. In addition, the policy
specifies the state of a task when it executes a protected action, and
-how its active priority is affected by the locking. The locking policy
-is specified by a Locking_Policy pragma. For implementation-defined
-locking policies, the meaning of the priority of a protected object is
-implementation defined. If no Locking_Policy pragma applies to any of
-the program units comprising a partition, the locking policy for that
-partition, as well as the meaning of the priority of a protected object,
-are implementation defined.
+how its active priority is affected by the locking. The <locking
+policy> is specified by a Locking_Policy pragma. For
+implementation-defined locking policies, the meaning of the priority of
+a protected object is implementation defined. If no Locking_Policy
+pragma applies to any of the program units comprising a partition, the
+locking policy for that partition, as well as the meaning of the
+priority of a protected object, are implementation defined.
6.1/3
The expression specified for the Priority or Interrupt_Priority aspect
@@ -58896,17 +58973,17 @@ System.Any_Priority or System.Interrupt_Priority,
respectively. The
value of the expression is the initial priority of the corresponding
protected object. If no Priority or Interrupt_Priority aspect is
specified for a protected object, the initial priority is specified by
-the locking policy.
+the locking policy.
7
There is one predefined locking policy, Ceiling_Locking; this policy is
defined as follows:
8/3
- * Every protected object has a ceiling priority, which is determined
- by either a Priority or Interrupt_Priority aspect as defined in
- *note D.1::, or by assignment to the Priority attribute as
- described in *note D.5.2::. The ceiling priority of a protected
+ * Every protected object has a <ceiling priority>, which is
+ determined by either a Priority or Interrupt_Priority aspect as
+ defined in *note D.1::, or by assignment to the Priority attribute
+ as described in *note D.5.2::. The ceiling priority of a protected
object (or ceiling, for short) is an upper bound on the active
priority a task can have when it calls protected operations of that
protected object.
@@ -59037,8 +59114,8 @@ D.4 Entry Queuing Policies
1/3
This subclause specifies a mechanism for a user to choose an entry
-queuing policy. It also defines two such policies. Other policies are
-implementation defined.
+<queuing policy>. It also defines two such policies. Other policies
+are implementation defined.
_Syntax_
@@ -59046,13 +59123,13 @@ implementation defined.
The form of a pragma Queuing_Policy is as follows:
3
- pragma Queuing_Policy(policy_identifier);
+ pragma Queuing_Policy(<policy_>identifier);
_Legality Rules_
4
-The policy_identifier shall be either FIFO_Queuing, Priority_Queuing or
-an implementation-defined identifier.
+The <policy_>identifier shall be either FIFO_Queuing, Priority_Queuing
+or an implementation-defined identifier.
_Post-Compilation Rules_
@@ -59062,7 +59139,7 @@ A Queuing_Policy pragma is a configuration pragma.
_Dynamic Semantics_
6
-A queuing policy governs the order in which tasks are queued for entry
+A <queuing policy> governs the order in which tasks are queued for entry
service, and the order in which different entry queues are considered
for service. The queuing policy is specified by a Queuing_Policy
pragma.
@@ -59080,7 +59157,7 @@ The Priority_Queuing policy is defined as follows:
9
* The calls to an entry (including a member of an entry family) are
queued in an order consistent with the priorities of the calls.
- The priority of an entry call is initialized from the active
+ The <priority of an entry call> is initialized from the active
priority of the calling task at the time the call is made, but can
change later. Within the same priority, the order is consistent
with the calling (or requeuing, or priority setting) time (that is,
@@ -59171,7 +59248,7 @@ The following language-defined library package exists:
3/2
with System;
- with Ada.Task_Identification; -- See *note C.7.1::
+ with Ada.Task_Identification; <-- See *note C.7.1::>
package Ada.Dynamic_Priorities is
pragma Preelaborate(Dynamic_Priorities);
@@ -59205,10 +59282,10 @@ to Null_Task_Id.
10/2
On a system with a single processor, the setting of the base priority of
-a task T to the new value occurs immediately at the first point when T
-is outside the execution of a protected action.
+a task <T> to the new value occurs immediately at the first point when
+<T> is outside the execution of a protected action.
-Paragraph 11 was deleted.
+<Paragraph 11 was deleted.>
_Erroneous Execution_
@@ -59310,15 +59387,15 @@ of the protected object, and can be changed by an
assignment.
5/3
If the locking policy Ceiling_Locking (see *note D.3::) is in effect,
-then the ceiling priority of a protected object P is set to the value of
-P'Priority at the end of each protected action of P.
+then the ceiling priority of a protected object <P> is set to the value
+of <P>'Priority at the end of each protected action of <P>.
6/3
If the locking policy Ceiling_Locking is in effect, then for a protected
-object P with either an Attach_Handler or Interrupt_Handler aspect
+object <P> with either an Attach_Handler or Interrupt_Handler aspect
specified for one of its procedures, a check is made that the value to
-be assigned to P'Priority is in the range System.Interrupt_Priority. If
-the check fails, Program_Error is raised.
+be assigned to <P>'Priority is in the range System.Interrupt_Priority.
+If the check fails, Program_Error is raised.
_Metrics_
@@ -59454,7 +59531,7 @@ highly efficient tasking run-time systems.
_Static Semantics_
2
-The following restriction_identifiers are language defined:
+The following <restriction_>identifiers are language defined:
3/3
No_Task_Hierarchy
@@ -59503,7 +59580,7 @@ No_Implicit_Heap_Allocations
No_Dynamic_Priorities
There are no semantic dependences on the package
Dynamic_Priorities, and no occurrences of the attribute
- Priority.
+ Priority.
10/3
No_Dynamic_Attachment
@@ -59581,7 +59658,7 @@ Simple_Barriers
component of the enclosing protected object.
11
-The following restriction_parameter_identifiers are language defined:
+The following <restriction_parameter_>identifiers are language defined:
12
Max_Select_Alternatives
@@ -59602,12 +59679,12 @@ Max_Protected_Entries
type. The bounds of every entry family of a protected
unit shall be static, or shall be defined by a
discriminant of a subtype whose corresponding bound is
- static.
+ static.
_Dynamic Semantics_
15/2
-The following restriction_identifier is language defined:
+The following <restriction_>identifier is language defined:
15.1/2
No_Task_Termination
@@ -59618,7 +59695,7 @@ No_Task_Termination
task attempts to terminate.
16
-The following restriction_parameter_identifiers are language defined:
+The following <restriction_parameter_>identifiers are language defined:
17/1
Max_Storage_At_Blocking
@@ -59712,7 +59789,7 @@ The following language-defined library package exists:
type Time is private;
Time_First : constant Time;
Time_Last : constant Time;
- Time_Unit : constant := implementation-defined-real-number;
+ Time_Unit : constant := <implementation-defined-real-number>;
5
type Time_Span is private;
@@ -59750,7 +59827,7 @@ The following language-defined library package exists:
function "abs"(Right : Time_Span) return Time_Span;
11/1
- This paragraph was deleted.
+ <This paragraph was deleted.>
12
function "<" (Left, Right : Time_Span) return Boolean;
@@ -59770,7 +59847,7 @@ The following language-defined library package exists:
function Minutes (M : Integer) return Time_Span;
15
- type Seconds_Count is range implementation-defined;
+ type Seconds_Count is range <implementation-defined>;
16
procedure Split(T : in Time; SC : out Seconds_Count; TS : out
Time_Span);
@@ -59778,23 +59855,24 @@ The following language-defined library package exists:
17
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Real_Time;
18
-In this Annex, real time is defined to be the physical time as observed
-in the external environment. The type Time is a time type as defined by
-*note 9.6::; values of this type may be used in a delay_until_statement.
-Values of this type represent segments of an ideal time line. The set
-of values of the type Time corresponds one-to-one with an
-implementation-defined range of mathematical integers.
+In this Annex, <real time> is defined to be the physical time as
+observed in the external environment. The type Time is a <time type> as
+defined by *note 9.6::; values of this type may be used in a
+delay_until_statement. Values of this type represent segments of an
+ideal time line. The set of values of the type Time corresponds
+one-to-one with an implementation-defined range of mathematical
+integers.
19
The Time value I represents the half-open real time interval that starts
with E+I*Time_Unit and is limited by E+(I+1)*Time_Unit, where Time_Unit
is an implementation-defined real number and E is an unspecified origin
-point, the epoch, that is the same for all values of the type Time. It
-is not specified by the language whether the time values are
+point, the <epoch>, that is the same for all values of the type Time.
+It is not specified by the language whether the time values are
synchronized with any standard time reference. For example, E can
correspond to the time of system initialization or it can correspond to
the epoch of some time standard.
@@ -59822,7 +59900,7 @@ Time_Unit is the smallest amount of real time
representable by the Time
type; it is expressed in seconds. Time_Span_Unit is the difference
between two successive values of the Time type. It is also the smallest
positive value of type Time_Span. Time_Unit and Time_Span_Unit
-represent the same real time duration. A clock tick is a real time
+represent the same real time duration. A <clock tick> is a real time
interval during which the clock value (as observed by calling the Clock
function) remains constant. Tick is the average length of such
intervals.
@@ -59882,9 +59960,9 @@ Time_Span_First shall be no greater than -3600 seconds,
and
Time_Span_Last shall be no less than 3600 seconds.
32
-A clock jump is the difference between two successive distinct values of
-the clock (as observed by calling the Clock function). There shall be
-no backward clock jumps.
+A <clock jump> is the difference between two successive distinct values
+of the clock (as observed by calling the Clock function). There shall
+be no backward clock jumps.
_Documentation Requirements_
@@ -59927,7 +60005,7 @@ The implementation shall document the following metrics:
* An upper bound on the size of a clock jump.
41
- * An upper bound on the drift rate of Clock with respect to real
+ * An upper bound on the <drift rate> of Clock with respect to real
time. This is a real number D such that
42
@@ -60055,13 +60133,13 @@ The implementation shall document the following
metrics:
Calendar.Clock.
12
- * An upper bound on the lateness of a delay_relative_statement, for a
- positive value of the delay expression, in a situation where the
+ * An upper bound on the <lateness> of a delay_relative_statement, for
+ a positive value of the delay expression, in a situation where the
task has sufficient priority to preempt the processor as soon as it
becomes ready, and does not need to wait for any other execution
resources. The upper bound is expressed as a function of the value
of the delay expression. The lateness is obtained by subtracting
- the value of the delay expression from the actual duration. The
+ the value of the delay expression from the <actual duration>. The
actual duration is measured from a point immediately before a task
executes the delay_statement to a point immediately after the task
resumes execution following this statement.
@@ -60087,8 +60165,9 @@ D.10 Synchronous Task Control
1/3
This subclause describes a language-defined private semaphore
-(suspension object), which can be used for two-stage suspend operations
-and as a simple building block for implementing higher-level queues.
+(suspension object), which can be used for <two-stage suspend>
+operations and as a simple building block for implementing higher-level
+queues.
_Static Semantics_
@@ -60106,7 +60185,7 @@ The following language-defined package exists:
function Current_State(S : Suspension_Object) return Boolean;
procedure Suspend_Until_True(S : in out Suspension_Object);
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Synchronous_Task_Control;
5
@@ -60194,7 +60273,7 @@ The following language-defined library package exists:
pragma Preelaborate(Synchronous_Barriers);
4/3
- subtype Barrier_Limit is Positive range 1 .. implementation-defined;
+ subtype Barrier_Limit is Positive range 1 .. <implementation-defined>;
5/3
type Synchronous_Barrier (Release_Threshold : Barrier_Limit) is
limited private;
@@ -60205,7 +60284,7 @@ The following language-defined library package exists:
7/3
private
- -- not specified by the language
+ -- <not specified by the language>
end Ada.Synchronous_Barriers;
8/3
@@ -60258,8 +60337,8 @@ D.11 Asynchronous Task Control
1/3
This subclause introduces a language-defined package to do asynchronous
-suspend/resume on tasks. It uses a conceptual held priority value to
-represent the task's held state.
+suspend/resume on tasks. It uses a conceptual <held priority> value to
+represent the task's <held> state.
_Static Semantics_
@@ -60280,10 +60359,10 @@ The following language-defined library package exists:
4/2
After the Hold operation has been applied to a task, the task becomes
-held. For each processor there is a conceptual idle task, which is
+<held>. For each processor there is a conceptual <idle task>, which is
always ready. The base priority of the idle task is below
-System.Any_Priority'First. The held priority is a constant of the type
-Integer whose value is below the base priority of the idle task.
+System.Any_Priority'First. The <held priority> is a constant of the
+type Integer whose value is below the base priority of the idle task.
4.1/2
For any priority below System.Any_Priority'First, the task dispatching
@@ -60304,7 +60383,7 @@ The Is_Held function returns True if and only if T is
in the held state.
8
As part of these operations, a check is made that the task identified by
-T is not terminated. Tasking_Error is raised if the check fails.
+T is not terminated. Tasking_Error is raised if the check fails.
Program_Error is raised if the value of T is Null_Task_Id.
_Erroneous Execution_
@@ -60465,15 +60544,15 @@ D.13 The Ravenscar Profile
1/3
This subclause defines the Ravenscar profile.
-Paragraphs 2 and 3 were moved to *note 13.12::, "*note 13.12:: Pragma
-Restrictions and Pragma Profile".
+<Paragraphs 2 and 3 were moved to *note 13.12::, "*note 13.12:: Pragma
+Restrictions and Pragma Profile".>
_Legality Rules_
4/3
-The profile_identifier Ravenscar is a usage profile (see *note 13.12::).
-For usage profile Ravenscar, there shall be no
-profile_pragma_argument_association (*note 2.8: S0020.)s.
+The <profile_>identifier Ravenscar is a usage profile (see *note
+13.12::). For usage profile Ravenscar, there shall be no
+<profile_>pragma_argument_association (*note 2.8: S0020.)s.
_Static Semantics_
@@ -60513,12 +60592,12 @@ pragmas:
No_Dependence => Ada.Task_Attributes,
No_Dependence =>
System.Multiprocessors.Dispatching_Domains);
-Paragraph 7 was deleted.
+<Paragraph 7 was deleted.>
_Implementation Requirements_
8/4
-This paragraph was deleted.
+<This paragraph was deleted.>
_Implementation Advice_
@@ -60572,7 +60651,7 @@ The following language-defined library package exists:
type CPU_Time is private;
CPU_Time_First : constant CPU_Time;
CPU_Time_Last : constant CPU_Time;
- CPU_Time_Unit : constant := implementation-defined-real-number;
+ CPU_Time_Unit : constant := <implementation-defined-real-number>;
CPU_Tick : constant Time_Span;
5/2
@@ -60602,22 +60681,22 @@ The following language-defined library package exists:
TS : Time_Span := Time_Span_Zero) return CPU_Time;
9.1/3
- Interrupt_Clocks_Supported : constant Boolean :=
implementation-defined;
+ Interrupt_Clocks_Supported : constant Boolean :=
<implementation-defined>;
9.2/3
Separate_Interrupt_Clocks_Supported : constant Boolean :=
- implementation-defined;
+ <implementation-defined>;
9.3/3
function Clock_For_Interrupts return CPU_Time;
10/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Execution_Time;
11/3
-The execution time or CPU time of a given task is defined as the time
+The <execution time> or CPU time of a given task is defined as the time
spent by the system executing that task, including the time spent
executing run-time or system services on its behalf. The mechanism used
to measure execution time is implementation defined. The Boolean
@@ -60653,7 +60732,7 @@ initialized to zero.
15/2
CPU_Time_Unit is the smallest amount of execution time representable by
-the CPU_Time type; it is expressed in seconds. A CPU clock tick is an
+the CPU_Time type; it is expressed in seconds. A <CPU clock tick> is an
execution time interval during which the clock value (as observed by
calling the Clock function) remains constant. CPU_Tick is the average
length of such intervals.
@@ -60783,7 +60862,7 @@ The following language-defined library package exists:
6/2
Min_Handler_Ceiling : constant System.Any_Priority :=
- implementation-defined;
+ <implementation-defined>;
7/2
procedure Set_Handler (TM : in out Timer;
@@ -60804,7 +60883,7 @@ The following language-defined library package exists:
10/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Execution_Time.Timers;
11/2
@@ -60814,14 +60893,14 @@ discriminant T identifies the task concerned. The
type Timer needs
finalization (see *note 7.6::).
12/2
-An object of type Timer is said to be set if it is associated with a
-nonnull value of type Timer_Handler and cleared otherwise. All Timer
-objects are initially cleared.
+An object of type Timer is said to be <set> if it is associated with a
+nonnull value of type Timer_Handler and <cleared> otherwise. All Timer
+objects are initially cleared.
13/2
The type Timer_Handler identifies a protected procedure to be executed
by the implementation when the timer expires. Such a protected
-procedure is called a handler.
+procedure is called a <handler>.
_Dynamic Semantics_
@@ -60837,7 +60916,7 @@ The procedures Set_Handler associate the handler
Handler with the timer
TM: if Handler is null, the timer is cleared; otherwise, it is set. The
first procedure Set_Handler loads the timer TM with an interval
specified by the Time_Span parameter. In this mode, the timer TM
-expires when the execution time of the task identified by TM.T.all has
+<expires> when the execution time of the task identified by TM.T.all has
increased by In_Time; if In_Time is less than or equal to zero, the
timer expires immediately. The second procedure Set_Handler loads the
timer TM with the absolute value specified by At_Time. In this mode,
@@ -60954,7 +61033,7 @@ The following language-defined library package exists:
7/2
Min_Handler_Ceiling : constant System.Any_Priority :=
- implementation-defined;
+ <implementation-defined>;
8/2
procedure Add_Task (GB : in out Group_Budget;
@@ -60986,7 +61065,7 @@ The following language-defined library package exists:
12/2
private
- -- not specified by the language
+ -- <not specified by the language>
end Ada.Execution_Time.Group_Budgets;
13/2
@@ -60997,16 +61076,16 @@ can be added to a group.
14/2
An object of type Group_Budget has an associated nonnegative value of
-type Time_Span known as its budget, which is initially Time_Span_Zero.
+type Time_Span known as its <budget>, which is initially Time_Span_Zero.
The type Group_Budget_Handler identifies a protected procedure to be
-executed by the implementation when the budget is exhausted, that is,
-reaches zero. Such a protected procedure is called a handler.
+executed by the implementation when the budget is <exhausted>, that is,
+reaches zero. Such a protected procedure is called a <handler>.
15/2
An object of type Group_Budget also includes a handler, which is a value
of type Group_Budget_Handler. The handler of the object is said to be
-set if it is not null and cleared otherwise. The handler of all
-Group_Budget objects is initially cleared.
+<set> if it is not null and <cleared> otherwise. The handler of all
+Group_Budget objects is initially cleared.
_Dynamic Semantics_
@@ -61227,7 +61306,7 @@ The following language-defined library package exists:
7/2
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end Ada.Real_Time.Timing_Events;
8/2
@@ -61235,14 +61314,14 @@ The type Timing_Event represents a time in the future
when an event is
to occur. The type Timing_Event needs finalization (see *note 7.6::).
9/2
-An object of type Timing_Event is said to be set if it is associated
-with a nonnull value of type Timing_Event_Handler and cleared otherwise.
-All Timing_Event objects are initially cleared.
+An object of type Timing_Event is said to be <set> if it is associated
+with a nonnull value of type Timing_Event_Handler and <cleared>
+otherwise. All Timing_Event objects are initially cleared.
10/2
The type Timing_Event_Handler identifies a protected procedure to be
executed by the implementation when the timing event occurs. Such a
-protected procedure is called a handler.
+protected procedure is called a <handler>.
_Dynamic Semantics_
@@ -61356,7 +61435,7 @@ The following language-defined library package exists:
pragma Preelaborate(Multiprocessors);
4/3
- type CPU_Range is range 0 .. implementation-defined;
+ type CPU_Range is range 0 .. <implementation-defined>;
Not_A_Specific_CPU : constant CPU_Range := 0;
subtype CPU is CPU_Range range 1 .. CPU_Range'Last;
@@ -61498,12 +61577,12 @@ The following language-defined library package exists:
15/3
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.Multiprocessors.Dispatching_Domains;
16/4
-A dispatching domain represents a set of processors on which a task may
-execute. Each processor is contained within exactly one dispatching
+A <dispatching domain> represents a set of processors on which a task
+may execute. Each processor is contained within exactly one dispatching
domain. An object of type Dispatching_Domain identifies a dispatching
domain. System_Dispatching_Domain identifies a domain that contains the
processor or processors on which the environment task executes. At
@@ -61659,19 +61738,20 @@ part of a single Ada program.
_Post-Compilation Rules_
2
-A distributed system is an interconnection of one or more processing
-nodes (a system resource that has both computational and storage
-capabilities), and zero or more storage nodes (a system resource that
+A <distributed system> is an interconnection of one or more <processing
+nodes> (a system resource that has both computational and storage
+capabilities), and zero or more <storage nodes> (a system resource that
has only storage capabilities, with the storage addressable by one or
more processing nodes).
3
-A distributed program comprises one or more partitions that execute
+A <distributed program> comprises one or more partitions that execute
independently (except when they communicate) in a distributed system.
4
The process of mapping the partitions of a program to the nodes in a
-distributed system is called configuring the partitions of the program.
+distributed system is called <configuring the partitions of the
+program>.
_Implementation Requirements_
@@ -61722,8 +61802,8 @@ or passive.
_Post-Compilation Rules_
2
-An active partition is a partition as defined in *note 10.2::. A
-passive partition is a partition that has no thread of control of its
+An <active partition> is a partition as defined in *note 10.2::. A
+<passive partition> is a partition that has no thread of control of its
own, whose library units are all preelaborated, and whose data and
subprograms are accessible to one or more active partitions.
@@ -61740,9 +61820,9 @@ processing node.
5
The configuration of the partitions of a program onto a distributed
system shall be consistent with the possibility for data references or
-calls between the partitions implied by their semantic dependences. Any
+calls between the partitions implied by their semantic dependences. Any
reference to data or call of a subprogram across partitions is called a
-remote access.
+<remote access>.
_Dynamic Semantics_
@@ -61754,12 +61834,12 @@ partition that elaborates it. The state evolves
independently in each
such partition.
7
-An active partition terminates when its environment task terminates. A
-partition becomes inaccessible if it terminates or if it is aborted. An
-active partition is aborted when its environment task is aborted. In
-addition, if a partition fails during its elaboration, it becomes
-inaccessible to other partitions. Other implementation-defined events
-can also result in a partition becoming inaccessible.
+An active partition <terminates> when its environment task terminates.
+A partition becomes <inaccessible> if it terminates or if it is
+<aborted>. An active partition is aborted when its environment task is
+aborted. In addition, if a partition fails during its elaboration, it
+becomes inaccessible to other partitions. Other implementation-defined
+events can also result in a partition becoming inaccessible.
8/1
For a prefix D that denotes a library-level declaration, excepting a
@@ -61768,7 +61848,7 @@ attribute is defined:
9
D'Partition_Id
- Denotes a value of the type universal_integer that
+ Denotes a value of the type <universal_integer> that
identifies the partition in which D was elaborated. If D
denotes the declaration of a remote call interface
library unit (see *note E.2.3::) the given partition is
@@ -61778,7 +61858,7 @@ D'Partition_Id
10/2
It is a bounded error for there to be cyclic elaboration dependences
-between the active partitions of a single distributed program. The
+between the active partitions of a single distributed program. The
possible effects, in each of the partitions involved, are deadlock
during elaboration, or the raising of Communication_Error or
Program_Error.
@@ -61835,11 +61915,12 @@ category to ensure that the semantics of a
distributed program remain
close to the semantics for a nondistributed program.
2/3
-A categorization pragma is a library unit pragma (see *note 10.1.5::)
-that specifies a corresponding categorization aspect. A categorization
-aspect restricts the declarations, child units, or semantic dependences
-of the library unit to which it applies. A categorized library unit is
-a library unit that has a categorization aspect that is True.
+A <categorization pragma> is a library unit pragma (see *note 10.1.5::)
+that specifies a corresponding <categorization aspect>. A
+categorization aspect restricts the declarations, child units, or
+semantic dependences of the library unit to which it applies. A
+<categorized library unit> is a library unit that has a categorization
+aspect that is True.
3/3
The pragmas Shared_Passive, Remote_Types, and Remote_Call_Interface are
@@ -61849,12 +61930,11 @@ aspects. In addition, for the purposes of this
Annex, the aspect Pure
pragma Pure is considered a categorization pragma.
4/3
-A library package or generic library package is called a shared passive
-library unit if the Shared_Passive aspect of the unit is True. A
-library package or generic library package is called a remote types
+A library package or generic library package is called a <shared
+passive> library unit if the Shared_Passive aspect of the unit is True.A
library package or generic library package is called a <remote types>
library unit if the Remote_Types aspect of the unit is True. A library
-unit is called a remote call interface if the Remote_Call_Interface
-aspect of the unit is True. A normal library unit is one for which no
+unit is called a <remote call interface> if the Remote_Call_Interface
+aspect of the unit is True. A <normal library unit> is one for which no
categorization aspect is True.
5/3
@@ -61888,14 +61968,14 @@ the previous paragraph:
6.5/3
5. Normal (no restrictions)
-Paragraphs 7 through 11 were deleted.
+<Paragraphs 7 through 11 were deleted.>
12
Declared pure and shared passive library units are preelaborated. The
declaration of a remote types or remote call interface library unit is
required to be preelaborable.
-Paragraph 13 was deleted.
+<Paragraph 13 was deleted.>
_Implementation Permissions_
@@ -61927,13 +62007,13 @@ objects declared in the shared passive library unit.
The form of a pragma Shared_Passive is as follows:
3
- pragma Shared_Passive[(library_unit_name)];
+ pragma Shared_Passive[(<library_unit_>name)];
_Legality Rules_
4/3
A pragma Shared_Passive is used to specify that a library unit is a
-shared passive library unit, namely that the Shared_Passive aspect of
+<shared passive library unit>, namely that the Shared_Passive aspect of
the library unit is True. The following restrictions apply to such a
library unit:
@@ -61975,10 +62055,10 @@ within a given program.
11
Notwithstanding the rule given in *note 10.2::, a compilation unit in a
-given partition does not need (in the sense of *note 10.2::) the shared
-passive library units on which it depends semantically to be included in
-that same partition; they will typically reside in separate passive
-partitions.
+given partition does not <need> (in the sense of *note 10.2::) the
+shared passive library units on which it depends semantically to be
+included in that same partition; they will typically reside in separate
+passive partitions.
File: arm2012.info, Node: E.2.2, Next: E.2.3, Prev: E.2.1, Up: E.2
@@ -61996,15 +62076,15 @@ for use in communication between active partitions.
The form of a pragma Remote_Types is as follows:
3
- pragma Remote_Types[(library_unit_name)];
+ pragma Remote_Types[(<library_unit_>name)];
_Legality Rules_
4/3
-A pragma Remote_Types is used to specify that a library unit is a remote
-types library unit, namely that the Remote_Types aspect of the library
-unit is True. The following restrictions apply to the declaration of
-such a library unit:
+A pragma Remote_Types is used to specify that a library unit is a
+<remote types library unit>, namely that the Remote_Types aspect of the
+library unit is True. The following restrictions apply to the
+declaration of such a library unit:
5
* it shall be preelaborable;
@@ -62026,8 +62106,8 @@ such a library unit:
9/3
A named access type declared in the visible part of a remote types or
-remote call interface library unit is called a remote access type. Such
-a type shall be:
+remote call interface library unit is called a <remote access type>.
+Such a type shall be:
9.1/1
* an access-to-subprogram type, or
@@ -62144,13 +62224,13 @@ partitions.
The form of a pragma Remote_Call_Interface is as follows:
3
- pragma Remote_Call_Interface[(library_unit_name)];
+ pragma Remote_Call_Interface[(<library_unit_>name)];
4
The form of a pragma All_Calls_Remote is as follows:
5
- pragma All_Calls_Remote[(library_unit_name)];
+ pragma All_Calls_Remote[(<library_unit_>name)];
6
A pragma All_Calls_Remote is a library unit pragma.
@@ -62159,10 +62239,10 @@ partitions.
7/3
A pragma Remote_Call_Interface is used to specify that a library unit is
-a remote call interface (RCI), namely that the Remote_Call_Interface
+a <remote call interface (RCI)>, namely that the Remote_Call_Interface
aspect of the library unit is True. A subprogram declared in the
visible part of such a library unit, or declared by such a library unit,
-is called a remote subprogram.
+is called a <remote subprogram>.
8/3
The declaration of an RCI library unit shall be preelaborable (see *note
@@ -62215,10 +62295,11 @@ same partition as its parent.
18
Notwithstanding the rule given in *note 10.2::, a compilation unit in a
given partition that semantically depends on the declaration of an RCI
-library unit, needs (in the sense of *note 10.2::) only the declaration
-of the RCI library unit, not the body, to be included in that same
-partition. Therefore, the body of an RCI library unit is included only
-in the partition to which the RCI library unit is explicitly assigned.
+library unit, <needs> (in the sense of *note 10.2::) only the
+declaration of the RCI library unit, not the body, to be included in
+that same partition. Therefore, the body of an RCI library unit is
+included only in the partition to which the RCI library unit is
+explicitly assigned.
_Implementation Requirements_
@@ -62278,11 +62359,12 @@ P'Body_Version
unit.
5/1
-The version of a compilation unit changes whenever the compilation unit
-changes in a semantically significant way. This International Standard
-does not define the exact meaning of "semantically significant". It is
-unspecified whether there are other events (such as recompilation) that
-result in the version of a compilation unit changing.
+The <version> of a compilation unit changes whenever the compilation
+unit changes in a semantically significant way. This International
+Standard does not define the exact meaning of "semantically
+significant". It is unspecified whether there are other events (such as
+recompilation) that result in the version of a compilation unit
+changing.
5.1/1
If P is not a library unit, and P has no completion, then P'Body_Version
@@ -62294,13 +62376,12 @@ any version of P that has a completion.
_Bounded (Run-Time) Errors_
6
-In a distributed program, a library unit is consistent if the same
+In a distributed program, a library unit is <consistent> if the same
version of its declaration is used throughout. It is a bounded error to
elaborate a partition of a distributed program that contains a
compilation unit that depends on a different version of the declaration
of a shared passive or RCI library unit than that included in the
-partition to which the shared passive or RCI library unit was assigned.
-As a result of this error, Program_Error can be raised in one or both
+partition to which the shared passive or RCI library unit was assigned.As a
result of this error, Program_Error can be raised in one or both
partitions during elaboration; in any case, the partitions become
inaccessible to one another.
@@ -62311,13 +62392,13 @@ E.4 Remote Subprogram Calls
===========================
1
-A remote subprogram call is a subprogram call that invokes the execution
-of a subprogram in another partition. The partition that originates the
-remote subprogram call is the calling partition, and the partition that
-executes the corresponding subprogram body is the called partition.
-Some remote procedure calls are allowed to return prior to the
-completion of subprogram execution. These are called asynchronous
-remote procedure calls.
+A <remote subprogram call> is a subprogram call that invokes the
+execution of a subprogram in another partition. The partition that
+originates the remote subprogram call is the <calling partition>, and
+the partition that executes the corresponding subprogram body is the
+<called partition>. Some remote procedure calls are allowed to return
+prior to the completion of subprogram execution. These are called
+<asynchronous remote procedure calls>.
2
There are three different ways of performing a remote subprogram call:
@@ -62335,9 +62416,9 @@ There are three different ways of performing a remote
subprogram call:
value of a remote access-to-class-wide type.
6
-The first way of calling corresponds to a static binding between the
+The first way of calling corresponds to a <static> binding between the
calling and the called partition. The latter two ways correspond to a
-dynamic binding between the calling and the called partition.
+<dynamic> binding between the calling and the called partition.
7/3
Remote types library units (see *note E.2.2::) and remote call interface
@@ -62357,20 +62438,20 @@ access-to-class-wide type, then all shall be.
For the execution of a remote subprogram call, subprogram parameters
(and later the results, if any) are passed using a stream-oriented
representation (see *note 13.13.1::) which is suitable for transmission
-between partitions. This action is called marshalling. Unmarshalling
-is the reverse action of reconstructing the parameters or results from
-the stream-oriented representation. Marshalling is performed initially
-as part of the remote subprogram call in the calling partition;
-unmarshalling is done in the called partition. After the remote
-subprogram completes, marshalling is performed in the called partition,
-and finally unmarshalling is done in the calling partition.
+between partitions. This action is called <marshalling>.
+<Unmarshalling> is the reverse action of reconstructing the parameters
+or results from the stream-oriented representation. Marshalling is
+performed initially as part of the remote subprogram call in the calling
+partition; unmarshalling is done in the called partition. After the
+remote subprogram completes, marshalling is performed in the called
+partition, and finally unmarshalling is done in the calling partition.
10
-A calling stub is the sequence of code that replaces the subprogram body
-of a remotely called subprogram in the calling partition. A receiving
-stub is the sequence of code (the "wrapper") that receives a remote
-subprogram call on the called partition and invokes the appropriate
-subprogram body.
+A <calling stub> is the sequence of code that replaces the subprogram
+body of a remotely called subprogram in the calling partition. A
+<receiving stub> is the sequence of code (the "wrapper") that receives a
+remote subprogram call on the called partition and invokes the
+appropriate subprogram body.
11
Remote subprogram calls are executed at most once, that is, if the
@@ -62385,7 +62466,7 @@ before the procedure in the called partition returns.
13
If a construct containing a remote call is aborted, the remote
-subprogram call is cancelled. Whether the execution of the remote
+subprogram call is <cancelled>. Whether the execution of the remote
subprogram is immediately aborted as a result of the cancellation is
implementation defined.
@@ -62416,7 +62497,7 @@ In a remote subprogram call with a formal parameter of
a class-wide
type, a check is made that the tag of the actual parameter identifies a
tagged type declared in a declared-pure or shared passive library unit,
or in the visible part of a remote types or remote call interface
-library unit. Program_Error is raised if this check fails. In a remote
+library unit. Program_Error is raised if this check fails. In a remote
function call which returns a class-wide type, the same check is made on
the function result.
@@ -62426,7 +62507,7 @@ designated by values of a remote access-to-class-wide
type, a check is
made (in addition to the normal Tag_Check -- see *note 11.5::) that all
the remote access-to-class-wide values originated from Access
attribute_references that were evaluated by tasks of the same active
-partition. Constraint_Error is raised if this check fails.
+partition. Constraint_Error is raised if this check fails.
_Implementation Requirements_
@@ -62476,7 +62557,7 @@ This subclause introduces the aspect Asynchronous which
can be specified
to allow a remote subprogram call to return prior to completion of the
execution of the corresponding remote subprogram body.
-Paragraphs 2 through 7 were deleted.
+<Paragraphs 2 through 7 were deleted.>
_Static Semantics_
@@ -62516,8 +62597,8 @@ designated profile of the type all of mode in.
_Dynamic Semantics_
9/3
-A remote call is asynchronous if it is a call to a procedure, or a call
-through a value of an access-to-procedure type, for which aspect
+A remote call is <asynchronous> if it is a call to a procedure, or a
+call through a value of an access-to-procedure type, for which aspect
Asynchronous is True. In addition, if aspect Asynchronous is True for a
remote access-to-class-wide type, then a dispatching call on a procedure
with a controlling operand designated by a value of the type is
@@ -62539,18 +62620,18 @@ E.4.2 Example of Use of a Remote Access-to-Class-Wide
Type
_Examples_
1
-Example of using a remote access-to-class-wide type to achieve dynamic
-binding across active partitions:
+<Example of using a remote access-to-class-wide type to achieve dynamic
+binding across active partitions:>
2
package Tapes is
pragma Pure(Tapes);
type Tape is abstract tagged limited private;
- -- Primitive dispatching operations where
- -- Tape is controlling operand
+ <-- Primitive dispatching operations where>
+ <-- Tape is controlling operand>
procedure Copy (From, To : access Tape; Num_Recs : in Natural) is
abstract;
procedure Rewind (T : access Tape) is abstract;
- -- More operations
+ <-- More operations>
private
type Tape is ...
end Tapes;
@@ -62559,20 +62640,20 @@ binding across active partitions:
with Tapes;
package Name_Server is
pragma Remote_Call_Interface;
- -- Dynamic binding to remote operations is achieved
- -- using the access-to-limited-class-wide type Tape_Ptr
+ <-- Dynamic binding to remote operations is achieved>
+ <-- using the access-to-limited-class-wide type Tape_Ptr>
type Tape_Ptr is access all Tapes.Tape'Class;
- -- The following statically bound remote operations
- -- allow for a name-server capability in this example
+ <-- The following statically bound remote operations>
+ <-- allow for a name-server capability in this example>
function Find (Name : String) return Tape_Ptr;
procedure Register (Name : in String; T : in Tape_Ptr);
procedure Remove (T : in Tape_Ptr);
- -- More operations
+ <-- More operations>
end Name_Server;
4
package Tape_Driver is
- -- Declarations are not shown, they are irrelevant here
+ <-- Declarations are not shown, they are irrelevant here>
end Tape_Driver;
5
@@ -62588,8 +62669,8 @@ binding across active partitions:
begin
. . .
end Rewind;
- -- Objects remotely accessible through use
- -- of Name_Server operations
+ <-- Objects remotely accessible through use>
+ <-- of Name_Server operations>
Tape1, Tape2 : aliased New_Tape;
begin
Name_Server.Register ("NINE-TRACK", Tape1'Access);
@@ -62598,7 +62679,7 @@ binding across active partitions:
6
with Tapes, Name_Server;
- -- Tape_Driver is not needed and thus not mentioned in the with_clause
+ <-- Tape_Driver is not needed and thus not mentioned in the with_clause>
procedure Tape_Client is
T1, T2 : Name_Server.Tape_Ptr;
begin
@@ -62610,10 +62691,10 @@ binding across active partitions:
end Tape_Client;
7
-Notes on the example:
+<Notes on the example>:
8/1
-This paragraph was deleted.
+<This paragraph was deleted.>
9
* The package Tapes provides the necessary declarations of the type
@@ -62654,7 +62735,7 @@ E.5 Partition Communication Subsystem
=====================================
1/2
-The Partition Communication Subsystem (PCS) provides facilities for
+The <Partition Communication Subsystem> (PCS) provides facilities for
supporting communication between the active partitions of a distributed
program. The package System.RPC is a language-defined interface to the
PCS.
@@ -62665,11 +62746,11 @@ PCS.
The following language-defined library package exists:
3
- with Ada.Streams; -- see *note 13.13.1::
+ with Ada.Streams; <-- see *note 13.13.1::>
package System.RPC is
4
- type Partition_Id is range 0 .. implementation-defined;
+ type Partition_Id is range 0 .. <implementation-defined>;
5
Communication_Error : exception;
@@ -62691,20 +62772,20 @@ The following language-defined library package exists:
Item : in Ada.Streams.Stream_Element_Array);
9
- -- Synchronous call
+ <-- Synchronous call>
procedure Do_RPC(
Partition : in Partition_Id;
Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
10
- -- Asynchronous call
+ <-- Asynchronous call>
procedure Do_APC(
Partition : in Partition_Id;
Params : access Params_Stream_Type);
11
- -- The handler for incoming RPCs
+ <-- The handler for incoming RPCs>
type RPC_Receiver is access procedure(
Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
@@ -62716,7 +62797,7 @@ The following language-defined library package exists:
13
private
- ... -- not specified by the language
+ ... -- <not specified by the language>
end System.RPC;
14
@@ -62755,11 +62836,11 @@ Do_RPC contains the reply message.
21
The procedure System.RPC.Establish_RPC_Receiver is called once,
immediately after elaborating the library units of an active partition
-(that is, right after the elaboration of the partition) if the partition
-includes an RCI library unit, but prior to invoking the main subprogram,
-if any. The Partition parameter is the Partition_Id of the active
-partition being elaborated. The Receiver parameter designates an
-implementation-provided procedure called the RPC-receiver which will
+(that is, right after the <elaboration of the partition>) if the
+partition includes an RCI library unit, but prior to invoking the main
+subprogram, if any. The Partition parameter is the Partition_Id of the
+active partition being elaborated. The Receiver parameter designates an
+implementation-provided procedure called the <RPC-receiver> which will
handle all RPCs received by the partition from the PCS.
Establish_RPC_Receiver saves a reference to the RPC-receiver; when a
message is received at the called partition, the RPC-receiver is called
@@ -62891,7 +62972,7 @@ If COBOL (respectively, C) is widely supported in the
target
environment, implementations supporting the Information Systems Annex
should provide the child package Interfaces.COBOL (respectively,
Interfaces.C) specified in *note Annex B:: and should support a
-convention_identifier of COBOL (respectively, C) for the Convention
+<convention_>identifier of COBOL (respectively, C) for the Convention
aspect (see *note Annex B::), thus allowing Ada programs to interface
with programs written in that language.
@@ -62924,7 +63005,7 @@ of subtype S when S'Machine_Radix = 10.
_Examples_
3
-Example of Machine_Radix attribute definition clause:
+<Example of Machine_Radix attribute definition clause:>
4
type Money is delta 0.01 digits 15;
@@ -62946,15 +63027,15 @@ The library package Decimal has the following
declaration:
pragma Pure(Decimal);
3
- Max_Scale : constant := implementation-defined;
- Min_Scale : constant := implementation-defined;
+ Max_Scale : constant := <implementation-defined>;
+ Min_Scale : constant := <implementation-defined>;
4
Min_Delta : constant := 10.0**(-Max_Scale);
Max_Delta : constant := 10.0**(-Min_Scale);
5
- Max_Decimal_Digits : constant := implementation-defined;
+ Max_Decimal_Digits : constant := <implementation-defined>;
6/3
generic
@@ -62973,23 +63054,23 @@ The library package Decimal has the following
declaration:
8
Max_Scale is the largest N such that 10.0**(-N) is allowed as a decimal
-type's delta. Its type is universal_integer.
+type's delta. Its type is <universal_integer>.
9
Min_Scale is the smallest N such that 10.0**(-N) is allowed as a decimal
-type's delta. Its type is universal_integer.
+type's delta. Its type is <universal_integer>.
10
-Min_Delta is the smallest value allowed for delta in a
-decimal_fixed_point_definition. Its type is universal_real.
+Min_Delta is the smallest value allowed for <delta> in a
+decimal_fixed_point_definition. Its type is <universal_real>.
11
-Max_Delta is the largest value allowed for delta in a
-decimal_fixed_point_definition. Its type is universal_real.
+Max_Delta is the largest value allowed for <delta> in a
+decimal_fixed_point_definition. Its type is <universal_real>.
12
-Max_Decimal_Digits is the largest value allowed for digits in a
-decimal_fixed_point_definition. Its type is universal_integer.
+Max_Decimal_Digits is the largest value allowed for <digits> in a
+decimal_fixed_point_definition. Its type is <universal_integer>.
_Static Semantics_
@@ -63028,9 +63109,9 @@ F.3 Edited Output for Decimal Types
1/2
The child packages Text_IO.Editing, Wide_Text_IO.Editing, and
Wide_Wide_Text_IO.Editing provide localizable formatted text output,
-known as edited output, for decimal types. An edited output string is a
-function of a numeric value, program-specifiable locale elements, and a
-format control value. The numeric value is of some decimal type. The
+known as <edited output>, for decimal types. An edited output string is
+a function of a numeric value, program-specifiable locale elements, and
+a format control value. The numeric value is of some decimal type. The
locale elements are:
2
@@ -63065,8 +63146,8 @@ decimal digits, the presence or absence of a radix
mark, suppression of
leading zeros, and insertion of particular character values.
9
-A Picture object is composed from a String value, known as a picture
-String, that serves as a template for the edited output string, and a
+A Picture object is composed from a String value, known as a <picture
+String>, that serves as a template for the edited output string, and a
Boolean value that controls whether a string of all space characters is
produced when the number's value is zero. A picture String comprises a
sequence of one- or two-Character symbols, each serving as a placeholder
@@ -63162,14 +63243,14 @@ F.3.1 Picture String Formation
------------------------------
1/3
-A well-formed picture String, or simply picture String, is a String
+A <well-formed picture String>, or simply <picture String>, is a String
value that conforms to the syntactic rules, composition constraints, and
character replication conventions specified in this subclause.
_Dynamic Semantics_
2/1
-This paragraph was deleted.
+<This paragraph was deleted.>
3
picture_string ::=
@@ -63377,25 +63458,25 @@ The following composition constraints apply to a
picture String:
except for possible case differences between 'Z' and 'z'.
47
-A replicable Character is a Character that, by the above rules, can
+A <replicable Character> is a Character that, by the above rules, can
occur in two consecutive positions in a picture String.
48
-A Character replication is a String
+A <Character replication> is a String
49
- char & '(' & spaces & count_string & ')'
+ <char> & '(' & <spaces> & <count_string> & ')'
50
-where char is a replicable Character, spaces is a String (possibly
-empty) comprising only space Character values, and count_string is a
+where <char> is a replicable Character, <spaces> is a String (possibly
+empty) comprising only space Character values, and <count_string> is a
String of one or more decimal digit Character values. A Character
replication in a picture String has the same effect as (and is said to
-be equivalent to) a String comprising n consecutive occurrences of char,
-where n=Integer'Value(count_string).
+be <equivalent to>) a String comprising <n> consecutive occurrences of
+<char>, where <n>=Integer'Value(<count_string>).
51
-An expanded picture String is a picture String containing no Character
+An <expanded picture String> is a picture String containing no Character
replications.
NOTES
@@ -63460,7 +63541,7 @@ Pic_String'Length + Currency_Length_Adjustment -
Radix_Adjustment, and
14
Let the magnitude of Item be expressed as a base-10 number
-Ip���I1.F1���Fq, called the displayed magnitude of Item, where:
+Ip���I1.F1���Fq, called the <displayed> <magnitude> of Item, where:
15
* q = Min(Max(Num'Scale, 0), n) where n is 0 if Pic_String has no
@@ -63512,11 +63593,11 @@ An instance of direct_insertion maps to Separator if
direct_insertion =
'_', and to the direct_insertion Character otherwise.
23
-An instance of number maps to a string integer_part & radix_part &
-fraction_part where:
+An instance of number maps to a string <integer_part> & <radix_part> &
+<fraction_part> where:
24
- * The string for integer_part is obtained as follows:
+ * The string for <integer_part> is obtained as follows:
25
1. Occurrences of '9' in fore_digits of number are replaced
@@ -63538,7 +63619,7 @@ fraction_part where:
string is produced.
28
- * The radix_part is:
+ * The <radix_part> is:
29
* "" if number does not include a radix, if radix = 'V', or
@@ -63548,7 +63629,7 @@ fraction_part where:
* Radix_Mark if number includes '.' as radix
31
- * The string for fraction_part is obtained as follows:
+ * The string for <fraction_part> is obtained as follows:
32
1. Occurrences of '9' in aft_digits of number are replaced
@@ -63564,7 +63645,7 @@ An instance of zero_suppression maps to the string
obtained as follows:
35
1. The rightmost 'Z', 'z', or '*' Character values are replaced
- with the excess digits (if any) from the integer_part of the
+ with the excess digits (if any) from the <integer_part> of the
mapping of the number to the right of the zero_suppression
instance,
@@ -63600,8 +63681,8 @@ An instance of floating_LHS_sign maps to the string
obtained as follows.
43
1. Up to all but one of the rightmost LHS_Sign Character values
- are replaced by the excess digits (if any) from the integer_part of
- the mapping of the number to the right of the floating_LHS_sign
+ are replaced by the excess digits (if any) from the <integer_part>
+ of the mapping of the number to the right of the floating_LHS_sign
instance.
44
@@ -63636,7 +63717,7 @@ follows:
50
1. Up to all but one of the rightmost '$' Character values are
- replaced with the excess digits (if any) from the integer_part of
+ replaced with the excess digits (if any) from the <integer_part> of
the mapping of the number to the right of the floating_$_currency
instance.
@@ -63662,7 +63743,7 @@ follows:
56
1. Up to all but one of the rightmost '#' Character values are
- replaced with the excess digits (if any) from the integer_part of
+ replaced with the excess digits (if any) from the <integer_part> of
the mapping of the number to the right of the floating_#_currency
instance.
@@ -63817,7 +63898,7 @@ The library package Text_IO.Editing has the following
declaration:
function Blank_When_Zero (Pic : in Picture) return Boolean;
8
- Max_Picture_Length : constant := implementation_defined;
+ Max_Picture_Length : constant := <implementation_defined>;
9
Picture_Error : exception;
@@ -63884,7 +63965,7 @@ The library package Text_IO.Editing has the following
declaration:
Radix_Mark : in Character := Default_Radix_Mark);
end Decimal_Output;
private
- ... -- not specified by the language
+ ... <-- not specified by the language>
end Ada.Text_IO.Editing;
17
@@ -64186,7 +64267,7 @@ If Fortran (respectively, C) is widely supported in the
target
environment, implementations supporting the Numerics Annex should
provide the child package Interfaces.Fortran (respectively,
Interfaces.C) specified in *note Annex B:: and should support a
-convention_identifier of Fortran (respectively, C) for the Convention
+<convention_>identifier of Fortran (respectively, C) for the Convention
aspect (see *note Annex B::), thus allowing Ada programs to interface
with programs written in that language.
@@ -64470,8 +64551,8 @@ shall not be affected by any range constraint of the
subtype Real.
42
In the following cases, evaluation of a complex arithmetic operation
-shall yield the prescribed result, provided that the preceding rules do
-not call for an exception to be raised:
+shall yield the <prescribed result>, provided that the preceding rules
+do not call for an exception to be raised:
43
* The results of the Re, Im, and Compose_From_Cartesian functions are
@@ -64710,12 +64791,12 @@ eliminated by the following conventions:
16/2
* The real component of the result of the Arctan and Arcsinh
functions is discontinuous as the parameter X crosses the imaginary
- axis below -i or above i.
+ axis below -<i> or above <i>.
17/2
* The real component of the result of the Arccot function is
discontinuous as the parameter X crosses the imaginary axis below
- -i or above i.
+ -<i> or above <i>.
18
* The imaginary component of the Arccosh function is discontinuous as
@@ -64789,7 +64870,7 @@ cases, provided that
Complex_Types.Real'Machine_Overflows is True:
31
* by the Arctan and Arccot functions, when the value of the parameter
- X is � i;
+ X is � <i>;
32
* by the Arctanh and Arccoth functions, when the value of the
@@ -64797,9 +64878,9 @@ cases, provided that
Complex_Types.Real'Machine_Overflows is True:
33
Constraint_Error can also be raised when a finite result overflows (see
-*note G.2.6::); this may occur for parameter values sufficiently near
+*note G.2.6::); this may occur for parameter values sufficiently <near>
poles, and, in the case of some of the functions, for parameter values
-having components of sufficiently large magnitude. When
+having components of sufficiently large magnitude. When
Complex_Types.Real'Machine_Overflows is False, the result at poles is
unspecified.
@@ -64813,7 +64894,7 @@ subtype Complex_Types.Real.
35
In the following cases, evaluation of a complex elementary function
-shall yield the prescribed result (or a result having the prescribed
+shall yield the <prescribed result> (or a result having the prescribed
component), provided that the preceding rules do not call for an
exception to be raised:
@@ -64834,12 +64915,12 @@ exception to be raised:
the result
39
- * i (resp., -i), when the sign of the imaginary component
- of X is positive (resp., negative), if
+ * <i> (resp., -<i>), when the sign of the imaginary
+ component of X is positive (resp., negative), if
Complex_Types.Real'Signed_Zeros is True;
40
- * i, if Complex_Types.Real'Signed_Zeros is False;
+ * <i>, if Complex_Types.Real'Signed_Zeros is False;
41/2
* When the parameter X has the value -1.0, the Log function yields an
@@ -64847,8 +64928,8 @@ exception to be raised:
result.
42
- * When the parameter X has the value � i, the Log function yields an
- imaginary result.
+ * When the parameter X has the value � <i>, the Log function yields
+ an imaginary result.
43
* Exponentiation by a zero exponent yields the value one.
@@ -64893,11 +64974,11 @@ Similarly, the Sin and Cos (resp., Sinh and Cosh)
functions are allowed
to raise the exception Constraint_Error, signaling overflow, when the
absolute value of the imaginary (resp., real) component of the parameter
X exceeds an unspecified threshold that is approximately
-log(Complex_Types.Real'Safe_Last) + log(2.0). This permission recognizes
-the impracticality of avoiding overflow in the marginal case that the
-hyperbolic sine or cosine of the imaginary (resp., real) component of X
-exceeds the safe range of Complex_Types.Real but both components of the
-final result do not.
+log(Complex_Types.Real'Safe_Last) + log(2.0). This permission
+recognizes the impracticality of avoiding overflow in the marginal case
+that the hyperbolic sine or cosine of the imaginary (resp., real)
+component of X exceeds the safe range of Complex_Types.Real but both
+components of the final result do not.
_Implementation Advice_
@@ -65189,13 +65270,13 @@ G.2 Numeric Performance Requirements
1
Implementations shall provide a user-selectable mode in which the
accuracy and other numeric performance requirements detailed in the
-following subclauses are observed. This mode, referred to as the strict
-mode, may or may not be the default mode; it directly affects the
-results of the predefined arithmetic operations of real types and the
-results of the subprograms in children of the Numerics package, and
+following subclauses are observed. This mode, referred to as the
+<strict mode>, may or may not be the default mode; it directly affects
+the results of the predefined arithmetic operations of real types and
+the results of the subprograms in children of the Numerics package, and
indirectly affects the operations in other language defined packages.
Implementations shall also provide the opposing mode, which is known as
-the relaxed mode.
+the <relaxed mode>.
_Implementation Permissions_
@@ -65239,17 +65320,18 @@ declaration. The model numbers of a derived type are
those of the
parent type; the model numbers of a subtype are those of its type.
3
-The model numbers of a floating point type T are zero and all the values
-expressible in the canonical form (for the type T), in which mantissa
-has T'Model_Mantissa digits and exponent has a value greater than or
-equal to T'Model_Emin. (These attributes are defined in *note G.2.2::.)
+The <model numbers> of a floating point type T are zero and all the
+values expressible in the canonical form (for the type T), in which
+<mantissa> has T'Model_Mantissa digits and <exponent> has a value
+greater than or equal to T'Model_Emin. (These attributes are defined in
+*note G.2.2::.)
4
-A model interval of a floating point type is any interval whose bounds
-are model numbers of the type. The model interval of a type T associated
-with a value v is the smallest model interval of T that includes v.
-(The model interval associated with a model number of a type consists of
-that number only.)
+A <model interval> of a floating point type is any interval whose bounds
+are model numbers of the type. The <model interval> of a type T
+<associated with a value> <v> is the smallest model interval of T that
+includes <v>. (The model interval associated with a model number of a
+type consists of that number only.)
_Implementation Requirements_
@@ -65258,14 +65340,14 @@ The accuracy requirements for the evaluation of
certain predefined
operations of floating point types are as follows.
6
-An operand interval is the model interval, of the type specified for the
-operand of an operation, associated with the value of the operand.
+An <operand interval> is the model interval, of the type specified for
+the operand of an operation, associated with the value of the operand.
7
For any predefined arithmetic operation that yields a result of a
floating point type T, the required bounds on the result are given by a
-model interval of T (called the result interval) defined in terms of the
-operand values as follows:
+model interval of T (called the <result interval>) defined in terms of
+the operand values as follows:
8
* The result interval is the smallest model interval of T that
@@ -65283,10 +65365,10 @@ in the case of a negative exponent.
The result interval of a conversion of a numeric value to a floating
point type T is the model interval of T associated with the operand
value, except when the source expression is of a fixed point type with a
-small that is not a power of T'Machine_Radix or is a fixed point
-multiplication or division either of whose operands has a small that is
-not a power of T'Machine_Radix; in these cases, the result interval is
-implementation defined.
+<small> that is not a power of T'Machine_Radix or is a fixed point
+multiplication or division either of whose operands has a <small> that
+is not a power of T'Machine_Radix; in these cases, the result interval
+is implementation defined.
11
For any of the foregoing operations, the implementation shall deliver a
@@ -65336,73 +65418,74 @@ conditions to those in *note A.5.3::.
_Static Semantics_
2
-For every subtype S of a floating point type T:
+For every subtype S of a floating point type <T>:
3/2
S'Model_Mantissa
Yields the number of digits in the mantissa of the
- canonical form of the model numbers of T (see *note
+ canonical form of the model numbers of <T> (see *note
A.5.3::). The value of this attribute shall be greater
than or equal to
3.1/2
- 'ceiling(d � log(10) / log(T'Machine_Radix))' + g
+ 'ceiling(<d> � log(10) / log(<T>'Machine_Radix))' + <g>
3.2/2
- where d is the requested decimal precision of T, and g is
- 0 if T'Machine_Radix is a positive power of 10 and 1
- otherwise. In addition, T'Model_Mantissa shall be less
- than or equal to the value of T'Machine_Mantissa. This
- attribute yields a value of the type universal_integer.
+ where <d> is the requested decimal precision of <T>, and
+ <g> is 0 if <T>'Machine_Radix is a positive power of 10
+ and 1 otherwise. In addition, <T>'Model_Mantissa shall
+ be less than or equal to the value of
+ <T>'Machine_Mantissa. This attribute yields a value of
+ the type <universal_integer>.
4
S'Model_Emin
Yields the minimum exponent of the canonical form of the
- model numbers of T (see *note A.5.3::). The value of
+ model numbers of <T> (see *note A.5.3::). The value of
this attribute shall be greater than or equal to the
- value of T'Machine_Emin. This attribute yields a value
- of the type universal_integer.
+ value of <T>'Machine_Emin. This attribute yields a value
+ of the type <universal_integer>.
5
S'Safe_First
- Yields the lower bound of the safe range of T. The value
- of this attribute shall be a model number of T and
- greater than or equal to the lower bound of the base
- range of T. In addition, if T is declared by a
+ Yields the lower bound of the safe range of <T>. The
+ value of this attribute shall be a model number of <T>
+ and greater than or equal to the lower bound of the base
+ range of <T>. In addition, if <T> is declared by a
floating_point_definition or is derived from such a type,
and the floating_point_definition includes a
- real_range_specification specifying a lower bound of lb,
- then the value of this attribute shall be less than or
- equal to lb; otherwise, it shall be less than or equal to
- -10.0 4 � d, where d is the requested decimal precision
- of T. This attribute yields a value of the type
- universal_real.
+ real_range_specification specifying a lower bound of
+ <lb>, then the value of this attribute shall be less than
+ or equal to <lb>; otherwise, it shall be less than or
+ equal to -10.0 4 � <d>, where <d> is the requested
+ decimal precision of <T>. This attribute yields a value
+ of the type <universal_real>.
6
S'Safe_Last
- Yields the upper bound of the safe range of T. The value
- of this attribute shall be a model number of T and less
- than or equal to the upper bound of the base range of T.
- In addition, if T is declared by a
+ Yields the upper bound of the safe range of <T>. The
+ value of this attribute shall be a model number of <T>
+ and less than or equal to the upper bound of the base
+ range of <T>. In addition, if <T> is declared by a
floating_point_definition or is derived from such a type,
and the floating_point_definition includes a
- real_range_specification specifying an upper bound of ub,
- then the value of this attribute shall be greater than or
- equal to ub; otherwise, it shall be greater than or equal
- to 10.0 4 � d, where d is the requested decimal precision
- of T. This attribute yields a value of the type
- universal_real.
+ real_range_specification specifying an upper bound of
+ <ub>, then the value of this attribute shall be greater
+ than or equal to <ub>; otherwise, it shall be greater
+ than or equal to 10.0 4 � <d>, where d is the requested
+ decimal precision of <T>. This attribute yields a value
+ of the type <universal_real>.
7
S'Model
- Denotes a function (of a parameter X) whose specification
- is given in *note A.5.3::. If X is a model number of T,
- the function yields X; otherwise, it yields the value
- obtained by rounding or truncating X to either one of the
- adjacent model numbers of T. Constraint_Error is raised
- if the resulting model number is outside the safe range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True.
+ Denotes a function (of a parameter <X>) whose
+ specification is given in *note A.5.3::. If <X> is a
+ model number of <T>, the function yields <X>; otherwise,
+ it yields the value obtained by rounding or truncating
+ <X> to either one of the adjacent model numbers of <T>.
+ Constraint_Error is raised if the resulting model number
+ is outside the safe range of S. A zero result has the
+ sign of <X> when S'Signed_Zeros is True.
8
Subject to the constraints given above, the values of S'Model_Mantissa
@@ -65467,77 +65550,79 @@ rounding (see *note 3.5.10::).
5
When the result type is a floating point type, the accuracy is as given
-in *note G.2.1::. For some combinations of the operand and result types
+in *note G.2.1::. For some combinations of the operand and result types
in the remaining cases, the result is required to belong to a small set
-of values called the perfect result set; for other combinations, it is
+of values called the <perfect result set>; for other combinations, it is
required merely to belong to a generally larger and
-implementation-defined set of values called the close result set. When
-the result type is a decimal fixed point type, the perfect result set
-contains a single value; thus, operations on decimal types are always
-fully specified.
+implementation-defined set of values called the <close result set>.
+When the result type is a decimal fixed point type, the perfect result
+set contains a single value; thus, operations on decimal types are
+always fully specified.
6
When one operand of a fixed-fixed multiplication or division is of type
-universal_real, that operand is not implicitly converted in the usual
+<universal_real>, that operand is not implicitly converted in the usual
sense, since the context does not determine a unique target type, but
the accuracy of the result of the multiplication or division (i.e.,
whether the result has to belong to the perfect result set or merely the
close result set) depends on the value of the operand of type
-universal_real and on the types of the other operand and of the result.
+<universal_real> and on the types of the other operand and of the
+result.
7
For a fixed point multiplication or division whose (exact) mathematical
-result is v, and for the conversion of a value v to a fixed point type,
-the perfect result set and close result set are defined as follows:
+result is <v>, and for the conversion of a value <v> to a fixed point
+type, the perfect result set and close result set are defined as
+follows:
8
- * If the result type is an ordinary fixed point type with a small of
- s,
+ * If the result type is an ordinary fixed point type with a <small>
+ of <s>,
9
- * if v is an integer multiple of s, then the perfect result
- set contains only the value v;
+ * if <v> is an integer multiple of <s>, then the perfect
+ result set contains only the value <v>;
10
- * otherwise, it contains the integer multiple of s just
- below v and the integer multiple of s just above v.
+ * otherwise, it contains the integer multiple of <s> just
+ below <v> and the integer multiple of <s> just above <v>.
11
The close result set is an implementation-defined set of
- consecutive integer multiples of s containing the perfect result
+ consecutive integer multiples of <s> containing the perfect result
set as a subset.
12
- * If the result type is a decimal type with a small of s,
+ * If the result type is a decimal type with a <small> of <s>,
13
- * if v is an integer multiple of s, then the perfect result
- set contains only the value v;
+ * if <v> is an integer multiple of <s>, then the perfect
+ result set contains only the value <v>;
14/3
* otherwise, if truncation applies, then it contains only
- the integer multiple of s in the direction toward zero,
+ the integer multiple of <s> in the direction toward zero,
whereas if rounding applies, then it contains only the
- nearest integer multiple of s (with ties broken by
+ nearest integer multiple of <s> (with ties broken by
rounding away from zero).
15
The close result set is an implementation-defined set of
- consecutive integer multiples of s containing the perfect result
+ consecutive integer multiples of <s> containing the perfect result
set as a subset.
16
* If the result type is an integer type,
17
- * if v is an integer, then the perfect result set contains
- only the value v;
+ * if <v> is an integer, then the perfect result set
+ contains only the value <v>;
18
- * otherwise, it contains the integer nearest to the value v
- (if v lies equally distant from two consecutive integers,
- the perfect result set contains the one that is further
- from zero).
+ * otherwise, it contains the integer nearest to the value
+ <v> (if <v> lies equally distant from two consecutive
+ integers, the perfect result set contains the one that is
+ further from zero).
19
The close result set is an implementation-defined set of
@@ -65547,29 +65632,30 @@ the perfect result set and close result set are
defined as follows:
The result of a fixed point multiplication or division shall belong
either to the perfect result set or to the close result set, as
described below, if overflow does not occur. In the following cases, if
-the result type is a fixed point type, let s be its small; otherwise,
-i.e. when the result type is an integer type, let s be 1.0.
+the result type is a fixed point type, let <s> be its <small>;
+otherwise, i.e. when the result type is an integer type, let <s> be
+1.0.
21
* For a multiplication or division neither of whose operands is of
- type universal_real, let l and r be the smalls of the left and
- right operands. For a multiplication, if (l � r) / s is an integer
- or the reciprocal of an integer (the smalls are said to be
- "compatible" in this case), the result shall belong to the perfect
- result set; otherwise, it belongs to the close result set. For a
- division, if l / (r � s) is an integer or the reciprocal of an
- integer (i.e., the smalls are compatible), the result shall belong
- to the perfect result set; otherwise, it belongs to the close
- result set.
+ type <universal_real>, let <l> and <r> be the <smalls> of the left
+ and right operands. For a multiplication, if (<l> � <r>) / <s> is
+ an integer or the reciprocal of an integer (the <smalls> are said
+ to be "compatible" in this case), the result shall belong to the
+ perfect result set; otherwise, it belongs to the close result set.
+ For a division, if <l> / (<r> � <s>) is an integer or the
+ reciprocal of an integer (i.e., the <smalls> are compatible), the
+ result shall belong to the perfect result set; otherwise, it
+ belongs to the close result set.
22
- * For a multiplication or division having one universal_real operand
- with a value of v, note that it is always possible to factor v as
- an integer multiple of a "compatible" small, but the integer
- multiple may be "too big." If there exists a factorization in
- which that multiple is less than some implementation-defined limit,
- the result shall belong to the perfect result set; otherwise, it
- belongs to the close result set.
+ * For a multiplication or division having one <universal_real>
+ operand with a value of <v>, note that it is always possible to
+ factor <v> as an integer multiple of a "compatible" <small>, but
+ the integer multiple may be "too big." If there exists a
+ factorization in which that multiple is less than some
+ implementation-defined limit, the result shall belong to the
+ perfect result set; otherwise, it belongs to the close result set.
23
A multiplication P * Q of an operand of a fixed point type F by an
@@ -65579,23 +65665,24 @@ also allowed. In these cases, the result has a type
of F; explicit
conversion of the result is never required. The accuracy required in
these cases is the same as that required for a multiplication F(P * Q)
or a division F(P / Q) obtained by interpreting the operand of the
-integer type to have a fixed point type with a small of 1.0.
+integer type to have a fixed point type with a <small> of 1.0.
24
The accuracy of the result of a conversion from an integer or fixed
point type to a fixed point type, or from a fixed point type to an
integer type, is the same as that of a fixed point multiplication of the
-source value by a fixed point operand having a small of 1.0 and a value
-of 1.0, as given by the foregoing rules. The result of a conversion
-from a floating point type to a fixed point type shall belong to the
-close result set. The result of a conversion of a universal_real
-operand to a fixed point type shall belong to the perfect result set.
+source value by a fixed point operand having a <small> of 1.0 and a
+value of 1.0, as given by the foregoing rules. The result of a
+conversion from a floating point type to a fixed point type shall belong
+to the close result set. The result of a conversion of a
+<universal_real> operand to a fixed point type shall belong to the
+perfect result set.
25
The possibility of overflow in the result of a predefined arithmetic
operation or conversion yielding a result of a fixed point type T is
analogous to that for floating point types, except for being related to
-the base range instead of the safe range. If all of the permitted
+the base range instead of the safe range. If all of the permitted
results belong to the base range of T, then the implementation shall
deliver one of the permitted results; otherwise,
@@ -65621,54 +65708,54 @@ Numerics.Generic_Elementary_Functions shall be as
specified here.
2
When an exception is not raised, the result of evaluating a function in
-an instance EF of Numerics.Generic_Elementary_Functions belongs to a
-result interval, defined as the smallest model interval of EF.Float_Type
-that contains all the values of the form f � (1.0 + d), where f is the
-exact value of the corresponding mathematical function at the given
-parameter values, d is a real number, and |d| is less than or equal to
-the function's maximum relative error. The function delivers a value
-that belongs to the result interval when both of its bounds belong to
-the safe range of EF.Float_Type; otherwise,
+an instance <EF> of Numerics.Generic_Elementary_Functions belongs to a
+<result interval>, defined as the smallest model interval of
+<EF>.Float_Type that contains all the values of the form <f> � (1.0 +
+<d>), where <f> is the exact value of the corresponding mathematical
+function at the given parameter values, <d> is a real number, and |<d>|
+is less than or equal to the function's <maximum relative error>. The
+function delivers a value that belongs to the result interval when both
+of its bounds belong to the safe range of <EF>.Float_Type; otherwise,
3
- * if EF.Float_Type'Machine_Overflows is True, the function either
+ * if <EF>.Float_Type'Machine_Overflows is True, the function either
delivers a value that belongs to the result interval or raises
Constraint_Error, signaling overflow;
4
- * if EF.Float_Type'Machine_Overflows is False, the result is
+ * if <EF>.Float_Type'Machine_Overflows is False, the result is
implementation defined.
5
The maximum relative error exhibited by each function is as follows:
6
- * 2.0 � EF.Float_Type'Model_Epsilon, in the case of the Sqrt, Sin,
+ * 2.0 � <EF>.Float_Type'Model_Epsilon, in the case of the Sqrt, Sin,
and Cos functions;
7
- * 4.0 � EF.Float_Type'Model_Epsilon, in the case of the Log, Exp,
+ * 4.0 � <EF>.Float_Type'Model_Epsilon, in the case of the Log, Exp,
Tan, Cot, and inverse trigonometric functions; and
8
- * 8.0 � EF.Float_Type'Model_Epsilon, in the case of the forward and
+ * 8.0 � <EF>.Float_Type'Model_Epsilon, in the case of the forward and
inverse hyperbolic functions.
9
The maximum relative error exhibited by the exponentiation operator,
which depends on the values of the operands, is (4.0 + |Right �
-log(Left)| / 32.0) � EF.Float_Type'Model_Epsilon.
+log(Left)| / 32.0) � <EF>.Float_Type'Model_Epsilon.
10
The maximum relative error given above applies throughout the domain of
the forward trigonometric functions when the Cycle parameter is
-specified. When the Cycle parameter is omitted, the maximum relative
+specified. When the Cycle parameter is omitted, the maximum relative
error given above applies only when the absolute value of the angle
-parameter X is less than or equal to some implementation-defined angle
-threshold, which shall be at least EF.Float_Type'Machine_Radix
-'floor(EF.Float_Type'Machine_Mantissa/2)'. Beyond the angle threshold,
-the accuracy of the forward trigonometric functions is implementation
-defined.
+parameter X is less than or equal to some implementation-defined <angle
+threshold>, which shall be at least <EF>.Float_Type'Machine_Radix
+'floor(<EF>.Float_Type'Machine_Mantissa/2)'. Beyond the angle
+threshold, the accuracy of the forward trigonometric functions is
+implementation defined.
11/2
The prescribed results specified in *note A.5.1:: for certain functions
@@ -65677,22 +65764,22 @@ error bounds; effectively, they narrow to a single
value the result
interval allowed by the maximum relative error bounds. Additional rules
with a similar effect are given by table G-1 for the inverse
trigonometric functions, at particular parameter values for which the
-mathematical result is possibly not a model number of EF.Float_Type (or
-is, indeed, even transcendental). In each table entry, the values of
-the parameters are such that the result lies on the axis between two
+mathematical result is possibly not a model number of <EF>.Float_Type
+(or is, indeed, even transcendental). In each table entry, the values
+of the parameters are such that the result lies on the axis between two
quadrants; the corresponding accuracy rule, which takes precedence over
the maximum relative error bounds, is that the result interval is the
-model interval of EF.Float_Type associated with the exact mathematical
+model interval of <EF>.Float_Type associated with the exact mathematical
result given in the table.
12/1
-This paragraph was deleted.
+<This paragraph was deleted.>
13
The last line of the table is meant to apply when
-EF.Float_Type'Signed_Zeros is False; the two lines just above it, when
-EF.Float_Type'Signed_Zeros is True and the parameter Y has a zero value
-with the indicated sign.
+<EF>.Float_Type'Signed_Zeros is False; the two lines just above it, when
+<EF>.Float_Type'Signed_Zeros is True and the parameter Y has a zero
+value with the indicated sign.
Table G-1: Tightly Approximated Elementary Function Results
Function Value of X Value of Y Exact Result Exact Result
@@ -65722,7 +65809,7 @@ The amount by which the result of an inverse
trigonometric function is
allowed to spill over into a quadrant adjacent to the one corresponding
to the principal branch, as given in *note A.5.1::, is limited. The
rule is that the result belongs to the smallest model interval of
-EF.Float_Type that contains both boundaries of the quadrant
+<EF>.Float_Type that contains both boundaries of the quadrant
corresponding to the principal branch. This rule also takes precedence
over the maximum relative error bounds, effectively narrowing the result
interval allowed by them.
@@ -65807,50 +65894,50 @@ here.
2
When an exception is not raised, the result of evaluating a real
-function of an instance CT of Numerics.Generic_Complex_Types (i.e., a
-function that yields a value of subtype CT.Real'Base or CT.Imaginary)
-belongs to a result interval defined as for a real elementary function
-(see *note G.2.4::).
+function of an instance <CT> of Numerics.Generic_Complex_Types (i.e., a
+function that yields a value of subtype <CT>.Real'Base or
+<CT>.Imaginary) belongs to a result interval defined as for a real
+elementary function (see *note G.2.4::).
3
When an exception is not raised, each component of the result of
evaluating a complex function of such an instance, or of an instance of
Numerics.Generic_Complex_Elementary_Functions obtained by instantiating
-the latter with CT (i.e., a function that yields a value of subtype
-CT.Complex), also belongs to a result interval. The result intervals
-for the components of the result are either defined by a maximum
-relative error bound or by a maximum box error bound. When the result
-interval for the real (resp., imaginary) component is defined by maximum
-relative error, it is defined as for that of a real function, relative
-to the exact value of the real (resp., imaginary) part of the result of
-the corresponding mathematical function. When defined by maximum box
-error, the result interval for a component of the result is the smallest
-model interval of CT.Real that contains all the values of the
-corresponding part of f � (1.0 + d), where f is the exact complex value
-of the corresponding mathematical function at the given parameter
-values, d is complex, and |d| is less than or equal to the given maximum
-box error. The function delivers a value that belongs to the result
-interval (or a value both of whose components belong to their respective
-result intervals) when both bounds of the result interval(s) belong to
-the safe range of CT.Real; otherwise,
+the latter with <CT> (i.e., a function that yields a value of subtype
+<CT>.Complex), also belongs to a <result interval>. The result
+intervals for the components of the result are either defined by a
+<maximum relative error> bound or by a <maximum box error> bound. When
+the result interval for the real (resp., imaginary) component is defined
+by maximum relative error, it is defined as for that of a real function,
+relative to the exact value of the real (resp., imaginary) part of the
+result of the corresponding mathematical function. When defined by
+maximum box error, the result interval for a component of the result is
+the smallest model interval of <CT>.Real that contains all the values of
+the corresponding part of <f> � (1.0 + <d>), where <f> is the exact
+complex value of the corresponding mathematical function at the given
+parameter values, <d> is complex, and |<d>| is less than or equal to the
+given maximum box error. The function delivers a value that belongs to
+the result interval (or a value both of whose components belong to their
+respective result intervals) when both bounds of the result interval(s)
+belong to the safe range of <CT>.Real; otherwise,
4
- * if CT.Real'Machine_Overflows is True, the function either delivers
- a value that belongs to the result interval (or a value both of
- whose components belong to their respective result intervals) or
- raises Constraint_Error, signaling overflow;
+ * if <CT>.Real'Machine_Overflows is True, the function either
+ delivers a value that belongs to the result interval (or a value
+ both of whose components belong to their respective result
+ intervals) or raises Constraint_Error, signaling overflow;
5
- * if CT.Real'Machine_Overflows is False, the result is implementation
- defined.
+ * if <CT>.Real'Machine_Overflows is False, the result is
+ implementation defined.
6/2
The error bounds for particular complex functions are tabulated in table
G-2. In the table, the error bound is given as the coefficient of
-CT.Real'Model_Epsilon.
+<CT>.Real'Model_Epsilon.
7/1
-This paragraph was deleted.
+<This paragraph was deleted.>
Table G-2: Error Bounds for Particular Complex Functions
Function or Operator Nature of Nature of Error Bound
@@ -65918,31 +66005,32 @@ and inverse hyperbolic functions, at particular
parameter values for
which a component of the mathematical result is transcendental. In each
case, the accuracy rule, which takes precedence over the error bounds,
is that the result interval for the stated result component is the model
-interval of CT.Real associated with the component's exact mathematical
+interval of <CT>.Real associated with the component's exact mathematical
value. The cases in question are as follows:
10
* When the parameter X has the value zero, the real (resp.,
imaginary) component of the result of the Arccot (resp., Arccoth)
- function is in the model interval of CT.Real associated with the
+ function is in the model interval of <CT>.Real associated with the
value PI/2.0.
11
* When the parameter X has the value one, the real component of the
- result of the Arcsin function is in the model interval of CT.Real
+ result of the Arcsin function is in the model interval of <CT>.Real
associated with the value PI/2.0.
12
* When the parameter X has the value -1.0, the real component of the
result of the Arcsin (resp., Arccos) function is in the model
- interval of CT.Real associated with the value -PI/2.0 (resp., PI).
+ interval of <CT>.Real associated with the value -PI/2.0 (resp.,
+ PI).
13/2
The amount by which a component of the result of an inverse
trigonometric or inverse hyperbolic function is allowed to spill over
into a quadrant adjacent to the one corresponding to the principal
branch, as given in *note G.1.2::, is limited. The rule is that the
-result belongs to the smallest model interval of CT.Real that contains
+result belongs to the smallest model interval of <CT>.Real that contains
both boundaries of the quadrant corresponding to the principal branch.
This rule also takes precedence over the maximum error bounds,
effectively narrowing the result interval allowed by them.
@@ -66000,7 +66088,7 @@ following declaration:
pragma Pure(Generic_Real_Arrays);
3/2
- -- Types
+ -- <Types>
4/2
type Real_Vector is array (Integer range <>) of Real'Base;
@@ -66008,10 +66096,10 @@ following declaration:
of Real'Base;
5/2
- -- Subprograms for Real_Vector types
+ -- <Subprograms for Real_Vector types>
6/2
- -- Real_Vector arithmetic operations
+ -- <Real_Vector arithmetic operations>
7/2
function "+" (Right : Real_Vector) return Real_Vector;
@@ -66029,7 +66117,7 @@ following declaration:
function "abs" (Right : Real_Vector) return Real'Base;
11/2
- -- Real_Vector scaling operations
+ -- <Real_Vector scaling operations>
12/2
function "*" (Left : Real'Base; Right : Real_Vector)
@@ -66040,7 +66128,7 @@ following declaration:
return Real_Vector;
13/2
- -- Other Real_Vector operations
+ -- <Other Real_Vector operations>
14/2
function Unit_Vector (Index : Integer;
@@ -66048,10 +66136,10 @@ following declaration:
First : Integer := 1) return Real_Vector;
15/2
- -- Subprograms for Real_Matrix types
+ -- <Subprograms for Real_Matrix types>
16/2
- -- Real_Matrix arithmetic operations
+ -- <Real_Matrix arithmetic operations>
17/2
function "+" (Right : Real_Matrix) return Real_Matrix;
@@ -66074,7 +66162,7 @@ following declaration:
return Real_Vector;
21/2
- -- Real_Matrix scaling operations
+ -- <Real_Matrix scaling operations>
22/2
function "*" (Left : Real'Base; Right : Real_Matrix)
@@ -66085,7 +66173,7 @@ following declaration:
return Real_Matrix;
23/2
- -- Real_Matrix inversion and related operations
+ -- <Real_Matrix inversion and related operations>
24/2
function Solve (A : Real_Matrix; X : Real_Vector) return Real_Vector;
@@ -66094,7 +66182,7 @@ following declaration:
function Determinant (A : Real_Matrix) return Real'Base;
25/2
- -- Eigenvalues and vectors of a real symmetric matrix
+ -- <Eigenvalues and vectors of a real symmetric matrix>
26/2
function Eigenvalues (A : Real_Matrix) return Real_Vector;
@@ -66105,7 +66193,7 @@ following declaration:
Vectors : out Real_Matrix);
28/2
- -- Other Real_Matrix operations
+ -- <Other Real_Matrix operations>
29/2
function Unit_Matrix (Order : Positive;
@@ -66141,8 +66229,8 @@ for each individual component is as defined for the
scalar operation
unless stated otherwise.
34/2
-In the case of those operations which are defined to involve an inner
-product, Constraint_Error may be raised if an intermediate result is
+In the case of those operations which are defined to <involve an inner
+product>, Constraint_Error may be raised if an intermediate result is
outside the range of Real'Base even though the mathematical final result
would not be.
@@ -66207,11 +66295,11 @@ would not be.
First : Integer := 1) return Real_Vector;
48/2
- This function returns a unit vector with Order components and
- a lower bound of First. All components are set to 0.0 except
- for the Index component which is set to 1.0. Constraint_Error
- is raised if Index < First, Index > First + Order - 1 or if
- First + Order - 1 > Integer'Last.
+ This function returns a <unit vector> with Order components
+ and a lower bound of First. All components are set to 0.0
+ except for the Index component which is set to 1.0.
+ Constraint_Error is raised if Index < First, Index > First +
+ Order - 1 or if First + Order - 1 > Integer'Last.
49/2
function "+" (Right : Real_Matrix) return Real_Matrix;
@@ -66382,7 +66470,7 @@ would not be.
First_1, First_2 : Integer := 1) return Real_Matrix;
80/2
- This function returns a square unit matrix with Order**2
+ This function returns a square <unit matrix> with Order**2
components and lower bounds of First_1 and First_2 (for the
first and second index ranges respectively). All components
are set to 0.0 except for the main diagonal, whose components
@@ -66403,16 +66491,17 @@ strict mode and the relaxed mode (see *note G.2::).
83/2
For operations involving an inner product, no requirements are specified
in the relaxed mode. In the strict mode the modulus of the absolute
-error of the inner product X*Y shall not exceed g*abs(X)*abs(Y) where g
-is defined as
+error of the inner product <X>*<Y> shall not exceed
+<g>*abs(<X>)*abs(<Y>) where <g> is defined as
84/2
- g = X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = <X>'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
85/2
For the L2-norm, no accuracy requirements are specified in the relaxed
mode. In the strict mode the relative error on the norm shall not
-exceed g / 2.0 + 3.0 * Real'Model_Epsilon where g is defined as above.
+exceed <g> / 2.0 + 3.0 * Real'Model_Epsilon where <g> is defined as
+above.
_Documentation Requirements_
@@ -66476,7 +66565,7 @@ following declaration:
pragma Pure(Generic_Complex_Arrays);
3/2
- -- Types
+ -- <Types>
4/2
type Complex_Vector is array (Integer range <>) of Complex;
@@ -66484,10 +66573,10 @@ following declaration:
Integer range <>) of Complex;
5/2
- -- Subprograms for Complex_Vector types
+ -- <Subprograms for Complex_Vector types>
6/2
- -- Complex_Vector selection, conversion and composition operations
+ -- <Complex_Vector selection, conversion and composition operations>
7/2
function Re (X : Complex_Vector) return Real_Vector;
@@ -66521,7 +66610,7 @@ following declaration:
return Complex_Vector;
12/2
- -- Complex_Vector arithmetic operations
+ -- <Complex_Vector arithmetic operations>
13/2
function "+" (Right : Complex_Vector) return Complex_Vector;
@@ -66539,7 +66628,7 @@ following declaration:
function "abs" (Right : Complex_Vector) return Real'Base;
17/2
- -- Mixed Real_Vector and Complex_Vector arithmetic operations
+ -- <Mixed Real_Vector and Complex_Vector arithmetic operations>
18/2
function "+" (Left : Real_Vector;
@@ -66558,7 +66647,7 @@ following declaration:
return Complex;
20/2
- -- Complex_Vector scaling operations
+ -- <Complex_Vector scaling operations>
21/2
function "*" (Left : Complex;
@@ -66577,7 +66666,7 @@ following declaration:
Right : Real'Base) return Complex_Vector;
23/2
- -- Other Complex_Vector operations
+ -- <Other Complex_Vector operations>
24/2
function Unit_Vector (Index : Integer;
@@ -66585,10 +66674,10 @@ following declaration:
First : Integer := 1) return Complex_Vector;
25/2
- -- Subprograms for Complex_Matrix types
+ -- <Subprograms for Complex_Matrix types>
26/2
- -- Complex_Matrix selection, conversion and composition operations
+ -- <Complex_Matrix selection, conversion and composition operations>
27/2
function Re (X : Complex_Matrix) return Real_Matrix;
@@ -66624,7 +66713,7 @@ following declaration:
return Complex_Matrix;
33/2
- -- Complex_Matrix arithmetic operations
+ -- <Complex_Matrix arithmetic operations>
34/2
function "+" (Right : Complex_Matrix) return Complex_Matrix;
@@ -66647,7 +66736,7 @@ following declaration:
Right : Complex_Vector) return Complex_Vector;
38/2
- -- Mixed Real_Matrix and Complex_Matrix arithmetic operations
+ -- <Mixed Real_Matrix and Complex_Matrix arithmetic operations>
39/2
function "+" (Left : Real_Matrix;
@@ -66680,7 +66769,7 @@ following declaration:
Right : Real_Vector) return Complex_Vector;
42/2
- -- Complex_Matrix scaling operations
+ -- <Complex_Matrix scaling operations>
43/2
function "*" (Left : Complex;
@@ -66699,7 +66788,7 @@ following declaration:
Right : Real'Base) return Complex_Matrix;
45/2
- -- Complex_Matrix inversion and related operations
+ -- <Complex_Matrix inversion and related operations>
46/2
function Solve (A : Complex_Matrix; X : Complex_Vector)
@@ -66709,7 +66798,7 @@ following declaration:
function Determinant (A : Complex_Matrix) return Complex;
47/2
- -- Eigenvalues and vectors of a Hermitian matrix
+ -- <Eigenvalues and vectors of a Hermitian matrix>
48/2
function Eigenvalues(A : Complex_Matrix) return Real_Vector;
@@ -66720,7 +66809,7 @@ following declaration:
Vectors : out Complex_Matrix);
50/2
- -- Other Complex_Matrix operations
+ -- <Other Complex_Matrix operations>
51/2
function Unit_Matrix (Order : Positive;
@@ -66760,8 +66849,8 @@ constraints on the parameters and the accuracy of the
result for each
individual component are as defined for the scalar operation.
56/2
-In the case of those operations which are defined to involve an inner
-product, Constraint_Error may be raised if an intermediate result has a
+In the case of those operations which are defined to <involve an inner
+product>, Constraint_Error may be raised if an intermediate result has a
component outside the range of Real'Base even though the final
mathematical result would not.
@@ -66946,11 +67035,11 @@ mathematical result would not.
First : Integer := 1) return Complex_Vector;
90/2
- This function returns a unit vector with Order components and
- a lower bound of First. All components are set to (0.0, 0.0)
- except for the Index component which is set to (1.0, 0.0).
- Constraint_Error is raised if Index < First, Index > First +
- Order - 1, or if First + Order - 1 > Integer'Last.
+ This function returns a <unit vector> with Order components
+ and a lower bound of First. All components are set to (0.0,
+ 0.0) except for the Index component which is set to (1.0,
+ 0.0). Constraint_Error is raised if Index < First, Index >
+ First + Order - 1, or if First + Order - 1 > Integer'Last.
91/2
function Re (X : Complex_Matrix) return Real_Matrix;
@@ -67294,7 +67383,7 @@ mathematical result would not.
return Complex_Matrix;
148/2
- This function returns a square unit matrix with Order**2
+ This function returns a square <unit matrix> with Order**2
components and lower bounds of First_1 and First_2 (for the
first and second index ranges respectively). All components
are set to (0.0, 0.0) except for the main diagonal, whose
@@ -67316,21 +67405,21 @@ Complex in both the strict mode and the relaxed mode
(see *note G.2::).
151/2
For operations involving an inner product, no requirements are specified
in the relaxed mode. In the strict mode the modulus of the absolute
-error of the inner product X*Y shall not exceed g*abs(X)*abs(Y) where g
-is defined as
+error of the inner product <X>*<Y> shall not exceed
+<g>*abs(<X>)*abs(<Y>) where <g> is defined as
152/2
- g = X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = <X>'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
for mixed complex and real operands
153/2
- g = sqrt(2.0) * X'Length * Real'Machine_Radix**(1 - Real'Model_Mantissa)
+ <g> = sqrt(2.0) * <X>'Length * Real'Machine_Radix**(1 -
Real'Model_Mantissa)
for two complex operands
154/2
For the L2-norm, no accuracy requirements are specified in the relaxed
mode. In the strict mode the relative error on the norm shall not
-exceed g / 2.0 + 3.0 * Real'Model_Epsilon where g has the definition
+exceed <g> / 2.0 + 3.0 * Real'Model_Epsilon where <g> has the definition
appropriate for two complex operands.
_Documentation Requirements_
@@ -67406,7 +67495,7 @@ several needs:
Execution understandability is supported by pragma Normalize_Scalars,
and also by requirements for the implementation to document the effect
of a program in the presence of a bounded error or where the language
-rules leave the effect unspecified.
+rules leave the effect unspecified.
5
The pragmas Reviewable and Restrictions relate to the other requirements
@@ -67654,24 +67743,24 @@ unit. The purpose of such a pragma is to facilitate
code validation.
The form of a pragma Inspection_Point is as follows:
3
- pragma Inspection_Point[(object_name {, object_name})];
+ pragma Inspection_Point[(<object_>name {, <object_>name})];
_Legality Rules_
4
A pragma Inspection_Point is allowed wherever a declarative_item or
-statement is allowed. Each object_name shall statically denote the
+statement is allowed. Each <object_>name shall statically denote the
declaration of an object.
_Static Semantics_
5/2
-An inspection point is a point in the object code corresponding to the
-occurrence of a pragma Inspection_Point in the compilation unit. An
-object is inspectable at an inspection point if the corresponding pragma
-Inspection_Point either has an argument denoting that object, or has no
-arguments and the declaration of the object is visible at the inspection
-point.
+An <inspection point> is a point in the object code corresponding to the
+occurrence of a pragma Inspection_Point in the compilation unit. An
+object is <inspectable> at an inspection point if the corresponding
+pragma Inspection_Point either has an argument denoting that object, or
+has no arguments and the declaration of the object is visible at the
+inspection point.
_Dynamic Semantics_
@@ -67728,10 +67817,10 @@ system.
_Static Semantics_
2/2
-This paragraph was deleted.
+<This paragraph was deleted.>
3/2
-The following restriction_identifiers are language defined:
+The following <restriction_>identifiers are language defined:
4
Tasking-related restriction:
@@ -67768,7 +67857,7 @@ No_Access_Parameter_Allocators
9/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
10
Immediate_Reclamation
@@ -67776,7 +67865,7 @@ Immediate_Reclamation
allocators and not deallocated via unchecked
deallocation, any storage reserved at run time for an
object is immediately reclaimed when the object no longer
- exists.
+ exists.
11
Exception-related restriction:
@@ -67804,12 +67893,12 @@ No_Fixed_Point
16/2
- This paragraph was deleted.
+ <This paragraph was deleted.>
17
No_Access_Subprograms
The declaration of access-to-subprogram types is not
- allowed.
+ allowed.
18
No_Unchecked_Access
@@ -67858,8 +67947,8 @@ An implementation of this Annex shall support:
* the pragma Profile(Ravenscar); and
23.5/2
- * the following uses of restriction_parameter_identifiers defined in
- *note D.7::, which are checked prior to program execution:
+ * the following uses of <restriction_parameter_>identifiers defined
+ in *note D.7::, which are checked prior to program execution:
23.6/2
* Max_Task_Entries => 0,
@@ -67903,11 +67992,12 @@ subprogram.
NOTES
28/2
- 10 Uses of restriction_parameter_identifier No_Dependence defined
- in *note 13.12.1::: No_Dependence => Ada.Unchecked_Deallocation and
- No_Dependence => Ada.Unchecked_Conversion may be appropriate for
- high-integrity systems. Other uses of No_Dependence can also be
- appropriate for high-integrity systems.
+ 10 Uses of <restriction_parameter_>identifier No_Dependence
+ defined in *note 13.12.1::: No_Dependence =>
+ Ada.Unchecked_Deallocation and No_Dependence =>
+ Ada.Unchecked_Conversion may be appropriate for high-integrity
+ systems. Other uses of No_Dependence can also be appropriate for
+ high-integrity systems.
File: arm2012.info, Node: H.5, Next: H.6, Prev: H.4, Up: Annex H
@@ -67969,11 +68059,11 @@ policy.
The form of a pragma Partition_Elaboration_Policy is as follows:
3/2
- pragma Partition_Elaboration_Policy (policy_identifier);
+ pragma Partition_Elaboration_Policy (<policy_>identifier);
4/2
- The policy_identifier shall be either Sequential, Concurrent or an
- implementation-defined identifier.
+ The <policy_>identifier shall be either Sequential, Concurrent or
+ an implementation-defined identifier.
_Post-Compilation Rules_
@@ -67992,7 +68082,7 @@ partition.
7/2
Notwithstanding what this International Standard says elsewhere, this
pragma allows partition elaboration rules concerning task activation and
-interrupt attachment to be changed. If the policy_identifier is
+interrupt attachment to be changed. If the <policy_>identifier is
Concurrent, or if there is no pragma Partition_Elaboration_Policy
defined for the partition, then the rules defined elsewhere in this
Standard apply.
@@ -68125,7 +68215,7 @@ The following library_unit_renaming_declarations exist:
9
with System.Machine_Code;
- package Machine_Code renames System.Machine_Code; -- If supported.
+ package Machine_Code renames System.Machine_Code; --< If supported.>
_Implementation Requirements_
@@ -68175,13 +68265,13 @@ J.3 Reduced Accuracy Subtypes
A digits_constraint may be used to define a floating point subtype with
a new value for its requested decimal precision, as reflected by its
Digits attribute. Similarly, a delta_constraint may be used to define
-an ordinary fixed point subtype with a new value for its delta, as
+an ordinary fixed point subtype with a new value for its <delta>, as
reflected by its Delta attribute.
_Syntax_
2/4
- delta_constraint ::= delta static_simple_expression [
+ delta_constraint ::= delta <static_>simple_expression [
range_constraint]
_Name Resolution Rules_
@@ -68210,10 +68300,10 @@ allows a decimal fixed point subtype).
7/4
A subtype_indication with a subtype_mark that denotes an ordinary fixed
point subtype and a delta_constraint defines an ordinary fixed point
-subtype with a delta given by the value of the simple_expression of the
-delta_constraint. If the delta_constraint includes a range_constraint
-(*note 3.5: S0036.), then the ordinary fixed point subtype is
-constrained by the range_constraint (*note 3.5: S0036.).
+subtype with a <delta> given by the value of the simple_expression of
+the delta_constraint. If the delta_constraint includes a
+range_constraint (*note 3.5: S0036.), then the ordinary fixed point
+subtype is constrained by the range_constraint (*note 3.5: S0036.).
8/4
A subtype_indication with a subtype_mark that denotes a floating point
@@ -68227,13 +68317,13 @@ the floating point subtype is constrained by the
range_constraint (*note
_Dynamic Semantics_
9/4
-A delta_constraint is compatible with an ordinary fixed point subtype if
-the value of the simple_expression is no less than the delta of the
+A delta_constraint is <compatible> with an ordinary fixed point subtype
+if the value of the simple_expression is no less than the <delta> of the
subtype, and the range_constraint, if any, is compatible with the
subtype.
10/4
-A digits_constraint is compatible with a floating point subtype if the
+A digits_constraint is <compatible> with a floating point subtype if the
value of the simple_expression is no greater than the requested decimal
precision of the subtype, and the range_constraint, if any, is
compatible with the subtype.
@@ -68279,29 +68369,29 @@ The following declaration exists in the declaration
of package Standard:
package ASCII is
3
- -- Control characters:
+ --< Control characters:>
4
- NUL : constant Character := nul; SOH : constant Character := soh;
- STX : constant Character := stx; ETX : constant Character := etx;
- EOT : constant Character := eot; ENQ : constant Character := enq;
- ACK : constant Character := ack; BEL : constant Character := bel;
- BS : constant Character := bs; HT : constant Character := ht;
- LF : constant Character := lf; VT : constant Character := vt;
- FF : constant Character := ff; CR : constant Character := cr;
- SO : constant Character := so; SI : constant Character := si;
- DLE : constant Character := dle; DC1 : constant Character := dc1;
- DC2 : constant Character := dc2; DC3 : constant Character := dc3;
- DC4 : constant Character := dc4; NAK : constant Character := nak;
- SYN : constant Character := syn; ETB : constant Character := etb;
- CAN : constant Character := can; EM : constant Character := em;
- SUB : constant Character := sub; ESC : constant Character := esc;
- FS : constant Character := fs; GS : constant Character := gs;
- RS : constant Character := rs; US : constant Character := us;
- DEL : constant Character := del;
+ NUL : constant Character := <nul>; SOH : constant Character :=
<soh>;
+ STX : constant Character := <stx>; ETX : constant Character :=
<etx>;
+ EOT : constant Character := <eot>; ENQ : constant Character :=
<enq>;
+ ACK : constant Character := <ack>; BEL : constant Character :=
<bel>;
+ BS : constant Character := <bs>; HT : constant Character :=
<ht>;
+ LF : constant Character := <lf>; VT : constant Character :=
<vt>;
+ FF : constant Character := <ff>; CR : constant Character :=
<cr>;
+ SO : constant Character := <so>; SI : constant Character :=
<si>;
+ DLE : constant Character := <dle>; DC1 : constant Character :=
<dc1>;
+ DC2 : constant Character := <dc2>; DC3 : constant Character :=
<dc3>;
+ DC4 : constant Character := <dc4>; NAK : constant Character :=
<nak>;
+ SYN : constant Character := <syn>; ETB : constant Character :=
<etb>;
+ CAN : constant Character := <can>; EM : constant Character :=
<em>;
+ SUB : constant Character := <sub>; ESC : constant Character :=
<esc>;
+ FS : constant Character := <fs>; GS : constant Character :=
<gs>;
+ RS : constant Character := <rs>; US : constant Character :=
<us>;
+ DEL : constant Character := <del>;
5
- -- Other characters:
+ --< Other characters:>
6
Exclam : constant Character:= '!'; Quotation : constant Character:=
'"';
@@ -68316,7 +68406,7 @@ The following declaration exists in the declaration of
package Standard:
R_Brace : constant Character:= '}'; Tilde : constant Character:=
'~';
7
- -- Lower case letters:
+ --< Lower case letters:>
8
LC_A: constant Character:= 'a';
@@ -68354,8 +68444,8 @@ J.7 At Clauses
_Static Semantics_
2
-An at_clause of the form "for x use at y;" is equivalent to an
-attribute_definition_clause of the form "for x'Address use y;".
+An at_clause of the form "for <x> use at <y>;" is equivalent to an
+attribute_definition_clause of the form "for <x>'Address use <y>;".
* Menu:
@@ -68370,7 +68460,7 @@ J.7.1 Interrupt Entries
1
Implementations are permitted to allow the attachment of task entries to
interrupts via the address clause. Such an entry is referred to as an
-interrupt entry.
+<interrupt entry>.
2
The address of the task entry corresponds to a hardware interrupt in an
@@ -68387,10 +68477,10 @@ For any task entry X:
5
X'Address
- For a task entry whose address is specified (an interrupt
- entry), the value refers to the corresponding hardware
- interrupt. For such an entry, as for any other task
- entry, the meaning of this value is implementation
+ For a task entry whose address is specified (an
+ <interrupt entry>), the value refers to the corresponding
+ hardware interrupt. For such an entry, as for any other
+ task entry, the meaning of this value is implementation
defined. The value of this attribute is of the type of
the subtype System.Address.
@@ -68404,8 +68494,8 @@ X'Address
As part of the initialization of a task object, the address clause for
an interrupt entry is elaborated, which evaluates the expression of the
address clause. A check is made that the address specified is
-associated with some interrupt to which a task entry may be attached. If
-this check fails, Program_Error is raised. Otherwise, the interrupt
+associated with some interrupt to which a task entry may be attached.
+If this check fails, Program_Error is raised. Otherwise, the interrupt
entry is attached to the interrupt associated with the specified
address.
@@ -68495,7 +68585,7 @@ terminate_alternative in addition to those given in
*note 9.3::.
_Examples_
22
-Example of an interrupt entry:
+<Example of an interrupt entry:>
23
task Interrupt_Handler is
@@ -68512,7 +68602,7 @@ J.8 Mod Clauses
_Syntax_
1
- mod_clause ::= at mod static_expression;
+ mod_clause ::= at mod <static_>expression;
_Static Semantics_
@@ -68520,8 +68610,8 @@ J.8 Mod Clauses
A record_representation_clause of the form:
3/3
- for r use
- record at mod a;
+ for <r> use
+ record at mod <a>;
...
end record;
@@ -68529,8 +68619,8 @@ A record_representation_clause of the form:
is equivalent to:
5
- for r'Alignment use a;
- for r use
+ for <r>'Alignment use <a>;
+ for <r> use
record
...
end record;
@@ -68549,7 +68639,7 @@ For any task subtype T, the following attribute is
defined:
2
T'Storage_Size
Denotes an implementation-defined value of type
- universal_integer representing the number of storage
+ <universal_integer> representing the number of storage
elements reserved for a task of the subtype T.
3/3
@@ -68621,16 +68711,17 @@ J.11 The Class Attribute of Untagged Incomplete Types
_Static Semantics_
1/2
-For the first subtype S of a type T declared by an
+For the first subtype S of a type <T> declared by an
incomplete_type_declaration that is not tagged, the following attribute
is defined:
2/2
S'Class
Denotes the first subtype of the incomplete class-wide
- type rooted at T. The completion of T shall declare a
- tagged type. Such an attribute reference shall occur in
- the same library unit as the incomplete_type_declaration.
+ type rooted at <T>. The completion of <T> shall declare
+ a tagged type. Such an attribute reference shall occur
+ in the same library unit as the
+ incomplete_type_declaration.
File: arm2012.info, Node: J.12, Next: J.13, Prev: J.11, Up: Annex J
@@ -68659,7 +68750,7 @@ language-defined units. The more general restriction
No_Dependence (see
_Static Semantics_
2/2
-The following restriction_identifiers exist:
+The following <restriction_>identifiers exist:
3/2
No_Asynchronous_Control
@@ -68794,14 +68885,15 @@ J.15.2 Pragma No_Return
(see *note 13.1::), is as follows:
2/3
- pragma No_Return (procedure_local_name{, procedure_local_name});
+ pragma No_Return (<procedure_>local_name{, <procedure_>
+ local_name});
_Legality Rules_
3/3
-Each procedure_local_name shall denote one or more procedures or generic
-procedures. The procedure_local_name shall not denote a null procedure
-nor an instance of a generic unit.
+Each <procedure_>local_name shall denote one or more procedures or
+generic procedures. The <procedure_>local_name shall not denote a null
+procedure nor an instance of a generic unit.
_Static Semantics_
@@ -68823,19 +68915,19 @@ J.15.3 Pragma Pack
*note 13.1::), is as follows:
2/3
- pragma Pack (first_subtype_local_name);
+ pragma Pack (<first_subtype_>local_name);
_Legality Rules_
3/3
-The first_subtype_local_name of a pragma Pack shall denote a composite
+The <first_subtype_>local_name of a pragma Pack shall denote a composite
subtype.
_Static Semantics_
4/3
Pragma Pack specifies that the Pack aspect (see *note 13.2::) for the
-type denoted by first_subtype_local_name has the value True.
+type denoted by <first_subtype_>local_name has the value True.
File: arm2012.info, Node: J.15.4, Next: J.15.5, Prev: J.15.3, Up: J.15
@@ -68877,41 +68969,44 @@ J.15.5 Interfacing Pragmas
_Syntax_
1/3
- An interfacing pragma is a representation pragma that is one of the
- pragmas Import, Export, or Convention. Their forms are as follows:
+ An <interfacing pragma> is a representation pragma that is one of
+ the pragmas Import, Export, or Convention. Their forms are as
+ follows:
2/3
pragma Import(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]);
+ [Convention =>] <convention_>identifier, [Entity =>]
+ local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]);
3/3
pragma Export(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]);
+ [Convention =>] <convention_>identifier, [Entity =>]
+ local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]);
4/3
- pragma Convention([Convention =>] convention_identifier,[Entity
+ pragma Convention([Convention =>] <convention_>identifier,[Entity
=>] local_name);
5/3
For pragmas Import and Export, the argument for Link_Name shall not
- be given without the pragma_argument_identifier unless the argument
- for External_Name is given.
+ be given without the <pragma_argument_>identifier unless the
+ argument for External_Name is given.
_Name Resolution Rules_
6/3
- The expected type for an external_name_string_expression and a
-link_name_string_expression in an interfacing pragma is String.
+The expected type for an <external_name_string_>expression and a
+<link_name_string_>expression in an interfacing pragma is String.
_Legality Rules_
7/3
-The convention_identifier of an interfacing pragma shall be the name of
-a convention (see *note B.1::).
+The <convention_>identifier of an interfacing pragma shall be the name
+of a convention (see *note B.1::).
8/3
A pragma Import shall be the completion of a declaration.
@@ -68926,8 +69021,8 @@ If the local_name denotes more than one entity, then
the pragma Import
is the completion of all of them.
9/3
-The external_name_string_expression and link_name_string_expression of a
-pragma Import or Export shall be static.
+The <external_name_string_>expression and <link_name_string_>expression
+of a pragma Import or Export shall be static.
10/3
The local_name of each of these pragmas shall denote a declaration that
@@ -68940,7 +69035,7 @@ An interfacing pragma specifies various aspects of the
entity denoted by
the local_name as follows:
12/3
- * The Convention aspect (see *note B.1::) is convention_identifier.
+ * The Convention aspect (see *note B.1::) is <convention_>identifier.
13/3
* A pragma Import specifies that the Import aspect (see *note B.1::)
@@ -68953,9 +69048,9 @@ the local_name as follows:
15/3
* For both pragma Import and Export, if an external name is given in
the pragma, the External_Name aspect (see *note B.1::) is specified
- to be external_name_string_expression. If a link name is given in
- the pragma, the Link_Name aspect (see *note B.1::) is specified to
- be the link_name_string_expression.
+ to be <external_name_string_>expression. If a link name is given
+ in the pragma, the Link_Name aspect (see *note B.1::) is specified
+ to be the <link_name_string_>expression.
File: arm2012.info, Node: J.15.6, Next: J.15.7, Prev: J.15.5, Up: J.15
@@ -68970,20 +69065,20 @@ J.15.6 Pragma Unchecked_Union
pragma (see *note 13.1::), is as follows:
2/3
- pragma Unchecked_Union (first_subtype_local_name);
+ pragma Unchecked_Union (<first_subtype_>local_name);
_Legality Rules_
3/3
-The first_subtype_local_name of a pragma Unchecked_Union shall denote an
-unconstrained discriminated record subtype having a variant_part.
+The <first_subtype_>local_name of a pragma Unchecked_Union shall denote
+an unconstrained discriminated record subtype having a variant_part.
_Static Semantics_
4/3
A pragma Unchecked_Union specifies that the Unchecked_Union aspect (see
-*note B.3.3::) for the type denoted by first_subtype_local_name has the
-value True.
+*note B.3.3::) for the type denoted by <first_subtype_>local_name has
+the value True.
File: arm2012.info, Node: J.15.7, Next: J.15.8, Prev: J.15.6, Up: J.15
@@ -68997,24 +69092,24 @@ J.15.7 Pragmas Interrupt_Handler and Attach_Handler
The form of a pragma Interrupt_Handler is as follows:
2/3
- pragma Interrupt_Handler (handler_name);
+ pragma Interrupt_Handler (<handler_>name);
3/3
The form of a pragma Attach_Handler is as follows:
4/3
- pragma Attach_Handler (handler_name, expression);
+ pragma Attach_Handler (<handler_>name, expression);
_Name Resolution Rules_
5/3
-For the Interrupt_Handler and Attach_Handler pragmas, the handler_name
+For the Interrupt_Handler and Attach_Handler pragmas, the <handler_>name
shall resolve to denote a protected procedure with a parameterless
profile.
6/3
For the Attach_Handler pragma, the expected type for the expression is
-Interrupts.Interrupt_Id (see *note C.3.2::).
+Interrupts.Interrupt_Id (see *note C.3.2::).
_Legality Rules_
@@ -69023,7 +69118,7 @@ The Attach_Handler and Interrupt_Handler pragmas are
only allowed
immediately within the protected_definition where the corresponding
subprogram is declared. The corresponding protected_type_declaration or
single_protected_declaration shall be a library-level declaration, and
-shall not be declared within a generic body. In addition to the places
+shall not be declared within a generic body. In addition to the places
where Legality Rules normally apply (see *note 12.3::), these rules also
apply in the private part of an instance of a generic unit.
@@ -69032,10 +69127,10 @@ apply in the private part of an instance of a generic
unit.
8/3
For an implementation that supports Annex C, a pragma Interrupt_Handler
specifies the Interrupt_Handler aspect (see *note C.3.1::) for the
-protected procedure handler_name to have the value True. For an
+protected procedure <handler_>name to have the value True. For an
implementation that supports Annex C, a pragma Attach_Handler specifies
the Attach_Handler aspect (see *note C.3.1::) for the protected
-procedure handler_name to have the value of the given expression as
+procedure <handler_>name to have the value of the given expression as
evaluated at object creation time.
@@ -69058,13 +69153,13 @@ J.15.8 Shared Variable Pragmas
pragma Volatile (local_name);
4/3
- pragma Independent (component_local_name);
+ pragma Independent (<component_>local_name);
5/3
- pragma Atomic_Components (array_local_name);
+ pragma Atomic_Components (<array_>local_name);
6/3
- pragma Volatile_Components (array_local_name);
+ pragma Volatile_Components (<array_>local_name);
7/3
pragma Independent_Components (local_name);
@@ -69074,9 +69169,9 @@ J.15.8 Shared Variable Pragmas
8/3
The local_name in an Atomic or Volatile pragma shall resolve to denote
either an object_declaration, a noninherited component_declaration, or a
-full_type_declaration. The component_local_name in an Independent
+full_type_declaration. The <component_>local_name in an Independent
pragma shall resolve to denote a noninherited component_declaration.
-The array_local_name in an Atomic_Components or Volatile_Components
+The <array_>local_name in an Atomic_Components or Volatile_Components
pragma shall resolve to denote the declaration of an array type or an
array object of an anonymous type. The local_name in an
Independent_Components pragma shall resolve to denote the declaration of
@@ -69088,7 +69183,7 @@ an array or record type or an array object of an
anonymous type.
These pragmas are representation pragmas (see *note 13.1::). Each of
these pragmas specifies that the similarly named aspect (see *note
C.6::) of the type, object, or component denoted by its argument is
-True.
+True.
_Legality Rules_
@@ -69154,7 +69249,7 @@ J.15.10 Pragma Dispatching_Domain
3/3
The expected type for the expression is
-System.Multiprocessors.Dispatching_Domains.Dispatching_Domain.
+System.Multiprocessors.Dispatching_Domains.Dispatching_Domain.
_Legality Rules_
@@ -69194,7 +69289,7 @@ J.15.11 Pragmas Priority and Interrupt_Priority
5/3
The expected type for the expression in a Priority or Interrupt_Priority
-pragma is Integer.
+pragma is Integer.
_Legality Rules_
@@ -69248,12 +69343,12 @@ J.15.12 Pragma Relative_Deadline
The form of a pragma Relative_Deadline is as follows:
2/3
- pragma Relative_Deadline (relative_deadline_expression);
+ pragma Relative_Deadline (<relative_deadline_>expression);
_Name Resolution Rules_
3/3
-The expected type for a relative_deadline_expression is
+The expected type for a <relative_deadline_>expression is
Real_Time.Time_Span.
_Legality Rules_
@@ -69726,7 +69821,7 @@ P'Access
3
P'Access yields an access value that designates the
subprogram denoted by P. The type of P'Access is an
- access-to-subprogram type (S), as determined by the
+ access-to-subprogram type (<S>), as determined by the
expected type. See *note 3.10.2::.
4
@@ -69754,25 +69849,25 @@ X'Address
8
S'Adjacent
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
9
S'Adjacent denotes a function with the following
specification:
10
- function S'Adjacent (X, Towards : T)
- return T
+ function S'Adjacent (<X>, <Towards> : <T>)
+ return <T>
11
- If Towards = X, the function yields X; otherwise, it
- yields the machine number of the type T adjacent to X in
- the direction of Towards, if that machine number exists.
- If the result would be outside the base range of S,
- Constraint_Error is raised. When T'Signed_Zeros is True,
- a zero result has the sign of X. When Towards is zero,
- its sign has no bearing on the result. See *note
- A.5.3::.
+ If <Towards> = <X>, the function yields <X>; otherwise,
+ it yields the machine number of the type <T> adjacent to
+ <X> in the direction of <Towards>, if that machine number
+ exists. If the result would be outside the base range of
+ S, Constraint_Error is raised. When <T>'Signed_Zeros is
+ True, a zero result has the sign of <X>. When <Towards>
+ is zero, its sign has no bearing on the result. See
+ *note A.5.3::.
12
S'Aft
@@ -69780,21 +69875,21 @@ S'Aft
13
S'Aft yields the number of decimal digits needed after
- the decimal point to accommodate the delta of the subtype
- S, unless the delta of the subtype S is greater than 0.1,
- in which case the attribute yields the value one. (S'Aft
- is the smallest positive integer N for which
+ the decimal point to accommodate the <delta> of the
+ subtype S, unless the <delta> of the subtype S is greater
+ than 0.1, in which case the attribute yields the value
+ one. (S'Aft is the smallest positive integer N for which
(10**N)*S'Delta is greater than or equal to one.) The
- value of this attribute is of the type universal_integer.
- See *note 3.5.10::.
+ value of this attribute is of the type
+ <universal_integer>. See *note 3.5.10::.
13.1/2
S'Alignment
For every subtype S:
13.2/2
- The value of this attribute is of type universal_integer,
- and nonnegative.
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative.
13.3/2
For an object X of subtype S, if S'Alignment is not zero,
@@ -69807,17 +69902,17 @@ X'Alignment
For a prefix X that denotes an object:
15/2
- The value of this attribute is of type universal_integer,
- and nonnegative; zero means that the object is not
- necessarily aligned on a storage element boundary. If
- X'Alignment is not zero, then X is aligned on a storage
- unit boundary and X'Address is an integral multiple of
- X'Alignment (that is, the Address modulo the Alignment is
- zero).
+ The value of this attribute is of type
+ <universal_integer>, and nonnegative; zero means that the
+ object is not necessarily aligned on a storage element
+ boundary. If X'Alignment is not zero, then X is aligned
+ on a storage unit boundary and X'Address is an integral
+ multiple of X'Alignment (that is, the Address modulo the
+ Alignment is zero).
16/2
- This paragraph was deleted. See *note 13.3::.
+ <This paragraph was deleted.> See *note 13.3::.
17
S'Base
@@ -69825,8 +69920,8 @@ S'Base
18
S'Base denotes an unconstrained subtype of the type of S.
- This unconstrained subtype is called the base subtype of
- the type. See *note 3.5::.
+ This unconstrained subtype is called the <base subtype>
+ of the type. See *note 3.5::.
19
S'Bit_Order
@@ -69854,7 +69949,7 @@ T'Callable
24
Yields the value True when the task denoted by T is
- callable, and False otherwise; See *note 9.9::.
+ <callable>, and False otherwise; See *note 9.9::.
25
E'Caller
@@ -69869,38 +69964,38 @@ E'Caller
27
S'Ceiling
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
28
S'Ceiling denotes a function with the following
specification:
29
- function S'Ceiling (X : T)
- return T
+ function S'Ceiling (<X> : <T>)
+ return <T>
30
- The function yields the value 'ceiling(X)', i.e., the
+ The function yields the value 'ceiling(<X>)', i.e., the
smallest (most negative) integral value greater than or
- equal to X. When X is zero, the result has the sign of X;
- a zero result otherwise has a negative sign when
+ equal to <X>. When <X> is zero, the result has the sign
+ of <X>; a zero result otherwise has a negative sign when
S'Signed_Zeros is True. See *note A.5.3::.
31
S'Class
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
32
S'Class denotes a subtype of the class-wide type (called
- T'Class in this International Standard) for the class
- rooted at T (or if S already denotes a class-wide
+ <T>'Class in this International Standard) for the class
+ rooted at <T> (or if S already denotes a class-wide
subtype, then S'Class is the same as S).
33
S'Class is unconstrained. However, if S is constrained,
then the values of S'Class are only those that when
- converted to the type T belong to S. See *note 3.9::.
+ converted to the type <T> belong to S. See *note 3.9::.
34
S'Class
@@ -69922,31 +70017,32 @@ X'Component_Size
37
Denotes the size in bits of components of the type of X.
- The value of this attribute is of type universal_integer.
- See *note 13.3::.
+ The value of this attribute is of type
+ <universal_integer>. See *note 13.3::.
38
S'Compose
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
39
S'Compose denotes a function with the following
specification:
40
- function S'Compose (Fraction : T;
- Exponent : universal_integer)
- return T
+ function S'Compose (<Fraction> : <T>;
+ <Exponent> : <universal_integer>)
+ return <T>
41
- Let v be the value Fraction � T'Machine_RadixExponent-k,
- where k is the normalized exponent of Fraction. If v is
- a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of Fraction when S'Signed_Zeros is True. See *note
+ Let <v> be the value <Fraction> �
+ <T>'Machine_Radix<Exponent>-<k>, where <k> is the
+ normalized exponent of <Fraction>. If <v> is a machine
+ number of the type <T>, or if |<v>| >= <T>'Model_Small,
+ the function yields <v>; otherwise, it yields either one
+ of the machine numbers of the type <T> adjacent to <v>.
+ Constraint_Error is optionally raised if <v> is outside
+ the base range of S. A zero result has the sign of
+ <Fraction> when S'Signed_Zeros is True. See *note
A.5.3::.
42
@@ -69961,23 +70057,24 @@ A'Constrained
44
S'Copy_Sign
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
45
S'Copy_Sign denotes a function with the following
specification:
46
- function S'Copy_Sign (Value, Sign : T)
- return T
+ function S'Copy_Sign (<Value>, <Sign> : <T>)
+ return <T>
47
- If the value of Value is nonzero, the function yields a
- result whose magnitude is that of Value and whose sign is
- that of Sign; otherwise, it yields the value zero.
+ If the value of <Value> is nonzero, the function yields a
+ result whose magnitude is that of <Value> and whose sign
+ is that of <Sign>; otherwise, it yields the value zero.
Constraint_Error is optionally raised if the result is
outside the base range of S. A zero result has the sign
- of Sign when S'Signed_Zeros is True. See *note A.5.3::.
+ of <Sign> when S'Signed_Zeros is True. See *note
+ A.5.3::.
48
E'Count
@@ -69987,7 +70084,7 @@ E'Count
49
Yields the number of calls presently queued on the entry
E of the current instance of the unit. The value of this
- attribute is of the type universal_integer. See *note
+ attribute is of the type <universal_integer>. See *note
9.9::.
50/1
@@ -70005,24 +70102,24 @@ S'Delta
For every fixed point subtype S:
53
- S'Delta denotes the delta of the fixed point subtype S.
+ S'Delta denotes the <delta> of the fixed point subtype S.
The value of this attribute is of the type
- universal_real. See *note 3.5.10::.
+ <universal_real>. See *note 3.5.10::.
54
S'Denorm
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
55
Yields the value True if every value expressible in the
form
- � mantissa � T'Machine_RadixT'Machine_Emin
- where mantissa is a nonzero T'Machine_Mantissa-digit
- fraction in the number base T'Machine_Radix, the first
+ � <mantissa> � <T>'Machine_Radix<T>'Machine_Emin
+ where <mantissa> is a nonzero <T>'Machine_Mantissa-digit
+ fraction in the number base <T>'Machine_Radix, the first
digit of which is zero, is a machine number (see *note
- 3.5.7::) of the type T; yields the value False otherwise.
- The value of this attribute is of the predefined type
- Boolean. See *note A.5.3::.
+ 3.5.7::) of the type <T>; yields the value False
+ otherwise. The value of this attribute is of the
+ predefined type Boolean. See *note A.5.3::.
56
S'Digits
@@ -70031,38 +70128,38 @@ S'Digits
57
S'Digits denotes the requested decimal precision for the
subtype S. The value of this attribute is of the type
- universal_integer. See *note 3.5.8::.
+ <universal_integer>. See *note 3.5.8::.
58
S'Digits
For every decimal fixed point subtype S:
59
- S'Digits denotes the digits of the decimal fixed point
+ S'Digits denotes the <digits> of the decimal fixed point
subtype S, which corresponds to the number of decimal
digits that are representable in objects of the subtype.
The value of this attribute is of the type
- universal_integer. See *note 3.5.10::.
+ <universal_integer>. See *note 3.5.10::.
60
S'Exponent
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
61
S'Exponent denotes a function with the following
specification:
62
- function S'Exponent (X : T)
- return universal_integer
+ function S'Exponent (<X> : <T>)
+ return <universal_integer>
63
- The function yields the normalized exponent of X. See
+ The function yields the normalized exponent of <X>. See
*note A.5.3::.
64
S'External_Tag
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
65
@@ -70118,7 +70215,7 @@ R.C'First_Bit
of the first bit occupied by C. This offset is measured
in bits. The first bit of a storage element is numbered
zero. The value of this attribute is of the type
- universal_integer. See *note 13.5.2::.
+ <universal_integer>. See *note 13.5.2::.
73.1/4
S'First_Valid
@@ -70133,22 +70230,22 @@ S'First_Valid
74
S'Floor
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
75
S'Floor denotes a function with the following
specification:
76
- function S'Floor (X : T)
- return T
+ function S'Floor (<X> : <T>)
+ return <T>
77
- The function yields the value 'floor(X)', i.e., the
+ The function yields the value 'floor(<X>)', i.e., the
largest (most positive) integral value less than or equal
- to X. When X is zero, the result has the sign of X; a
- zero result otherwise has a positive sign. See *note
- A.5.3::.
+ to <X>. When <X> is zero, the result has the sign of
+ <X>; a zero result otherwise has a positive sign. See
+ *note A.5.3::.
78
S'Fore
@@ -70162,26 +70259,27 @@ S'Fore
a one-character prefix that is either a minus sign or a
space. (This minimum number does not include superfluous
zeros or underlines, and is at least 2.) The value of
- this attribute is of the type universal_integer. See
+ this attribute is of the type <universal_integer>. See
*note 3.5.10::.
80
S'Fraction
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
81
S'Fraction denotes a function with the following
specification:
82
- function S'Fraction (X : T)
- return T
+ function S'Fraction (<X> : <T>)
+ return <T>
83
- The function yields the value X � T'Machine_Radix-k,
- where k is the normalized exponent of X. A zero result,
- which can only occur when X is zero, has the sign of X.
- See *note A.5.3::.
+ The function yields the value <X> �
+ <T>'Machine_Radix-<k>, where <k> is the normalized
+ exponent of <X>. A zero result, which can only occur
+ when <X> is zero, has the sign of <X>. See *note
+ A.5.3::.
83.1/3
X'Has_Same_Storage
@@ -70192,7 +70290,7 @@ X'Has_Same_Storage
specification:
83.3/3
- function X'Has_Same_Storage (Arg : any_type)
+ function X'Has_Same_Storage (<Arg> : <any_type>)
return Boolean
83.4/4
@@ -70232,11 +70330,11 @@ S'Image
specification:
90
- function S'Image(Arg : S'Base)
+ function S'Image(<Arg> : S'Base)
return String
91/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
String. See *note 3.5::.
91.1/4
@@ -70246,12 +70344,12 @@ X'Image
91.2/4
X'Image denotes the result of calling function S'Image
- with Arg being X, where S is the nominal subtype of X.
+ with <Arg> being X, where S is the nominal subtype of X.
See *note 3.5::.
92
S'Class'Input
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
93
S'Class'Input denotes a function with the following
@@ -70259,13 +70357,13 @@ S'Class'Input
94/2
function S'Class'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T'Class
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>'Class
95/3
- First reads the external tag from Stream and determines
+ First reads the external tag from <Stream> and determines
the corresponding internal tag (by calling
- Tags.Descendant_Tag(String'Input(Stream), S'Tag) which
+ Tags.Descendant_Tag(String'Input(<Stream>), S'Tag) which
might raise Tag_Error -- see *note 3.9::) and then
dispatches to the subprogram denoted by the Input
attribute of the specific type identified by the internal
@@ -70275,7 +70373,7 @@ S'Class'Input
96
S'Input
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
97
S'Input denotes a function with the following
@@ -70283,11 +70381,11 @@ S'Input
98/2
function S'Input(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class)
- return T
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class)
+ return <T>
99
- S'Input reads and returns one value from Stream, using
+ S'Input reads and returns one value from <Stream>, using
any bounds or discriminants written by a corresponding
S'Output to determine how much to read. See *note
13.13.2::.
@@ -70335,7 +70433,7 @@ R.C'Last_Bit
start of the first of the storage elements occupied by C,
of the last bit occupied by C. This offset is measured in
bits. The value of this attribute is of the type
- universal_integer. See *note 13.5.2::.
+ <universal_integer>. See *note 13.5.2::.
107.1/4
S'Last_Valid
@@ -70350,34 +70448,34 @@ S'Last_Valid
108
S'Leading_Part
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
109
S'Leading_Part denotes a function with the following
specification:
110
- function S'Leading_Part (X : T;
- Radix_Digits : universal_integer)
- return T
+ function S'Leading_Part (<X> : <T>;
+ <Radix_Digits> :
<universal_integer>)
+ return <T>
111
- Let v be the value T'Machine_Radixk-Radix_Digits, where k
- is the normalized exponent of X. The function yields the
- value
+ Let <v> be the value <T>'Machine_Radix<k>-<Radix_Digits>,
+ where <k> is the normalized exponent of <X>. The
+ function yields the value
112
- * 'floor(X/v)' � v, when X is nonnegative and
- Radix_Digits is positive;
+ * 'floor(<X>/<v>)' � <v>, when <X> is nonnegative and
+ <Radix_Digits> is positive;
113
- * 'ceiling(X/v)' � v, when X is negative and
- Radix_Digits is positive.
+ * 'ceiling(<X>/<v>)' � <v>, when <X> is negative and
+ <Radix_Digits> is positive.
114
- Constraint_Error is raised when Radix_Digits is zero or
- negative. A zero result, which can only occur when X is
- zero, has the sign of X. See *note A.5.3::.
+ Constraint_Error is raised when <Radix_Digits> is zero or
+ negative. A zero result, which can only occur when <X>
+ is zero, has the sign of <X>. See *note A.5.3::.
115/1
A'Length
@@ -70388,7 +70486,7 @@ A'Length
116
A'Length denotes the number of values of the first index
range (zero for a null range); its type is
- universal_integer. See *note 3.6.2::.
+ <universal_integer>. See *note 3.6.2::.
117/1
A'Length(N)
@@ -70399,149 +70497,151 @@ A'Length(N)
118
A'Length(N) denotes the number of values of the N-th
index range (zero for a null range); its type is
- universal_integer. See *note 3.6.2::.
+ <universal_integer>. See *note 3.6.2::.
119
S'Machine
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
120
S'Machine denotes a function with the following
specification:
121
- function S'Machine (X : T)
- return T
+ function S'Machine (<X> : <T>)
+ return <T>
122
- If X is a machine number of the type T, the function
- yields X; otherwise, it yields the value obtained by
- rounding or truncating X to either one of the adjacent
- machine numbers of the type T. Constraint_Error is raised
- if rounding or truncating X to the precision of the
- machine numbers results in a value outside the base range
- of S. A zero result has the sign of X when S'Signed_Zeros
- is True. See *note A.5.3::.
+ If <X> is a machine number of the type <T>, the function
+ yields <X>; otherwise, it yields the value obtained by
+ rounding or truncating <X> to either one of the adjacent
+ machine numbers of the type <T>. Constraint_Error is
+ raised if rounding or truncating <X> to the precision of
+ the machine numbers results in a value outside the base
+ range of S. A zero result has the sign of <X> when
+ S'Signed_Zeros is True. See *note A.5.3::.
123
S'Machine_Emax
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
124
- Yields the largest (most positive) value of exponent such
- that every value expressible in the canonical form (for
- the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer. See *note A.5.3::.
+ Yields the largest (most positive) value of <exponent>
+ such that every value expressible in the canonical form
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>. See *note
+ A.5.3::.
125
S'Machine_Emin
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
126
- Yields the smallest (most negative) value of exponent
+ Yields the smallest (most negative) value of <exponent>
such that every value expressible in the canonical form
- (for the type T), having a mantissa of T'Machine_Mantissa
- digits, is a machine number (see *note 3.5.7::) of the
- type T. This attribute yields a value of the type
- universal_integer. See *note A.5.3::.
+ (for the type <T>), having a <mantissa> of
+ <T>'Machine_Mantissa digits, is a machine number (see
+ *note 3.5.7::) of the type <T>. This attribute yields a
+ value of the type <universal_integer>. See *note
+ A.5.3::.
127
S'Machine_Mantissa
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
128
- Yields the largest value of p such that every value
- expressible in the canonical form (for the type T),
- having a p-digit mantissa and an exponent between
- T'Machine_Emin and T'Machine_Emax, is a machine number
- (see *note 3.5.7::) of the type T. This attribute yields
- a value of the type universal_integer. See *note
- A.5.3::.
+ Yields the largest value of <p> such that every value
+ expressible in the canonical form (for the type <T>),
+ having a <p>-digit <mantissa> and an <exponent> between
+ <T>'Machine_Emin and <T>'Machine_Emax, is a machine
+ number (see *note 3.5.7::) of the type <T>. This
+ attribute yields a value of the type <universal_integer>.
+ See *note A.5.3::.
129
S'Machine_Overflows
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
130
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean. See
*note A.5.3::.
131
S'Machine_Overflows
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
132
Yields the value True if overflow and divide-by-zero are
detected and reported by raising Constraint_Error for
every predefined operation that yields a result of the
- type T; yields the value False otherwise. The value of
+ type <T>; yields the value False otherwise. The value of
this attribute is of the predefined type Boolean. See
*note A.5.4::.
133
S'Machine_Radix
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
134
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer. See *note A.5.3::.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>. See *note A.5.3::.
135
S'Machine_Radix
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
136
Yields the radix of the hardware representation of the
- type T. The value of this attribute is of the type
- universal_integer. See *note A.5.4::.
+ type <T>. The value of this attribute is of the type
+ <universal_integer>. See *note A.5.4::.
136.1/2
S'Machine_Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
136.2/2
S'Machine_Rounding denotes a function with the following
specification:
136.3/2
- function S'Machine_Rounding (X : T)
- return T
+ function S'Machine_Rounding (<X> : <T>)
+ return <T>
136.4/2
- The function yields the integral value nearest to X. If X
- lies exactly halfway between two integers, one of those
- integers is returned, but which of them is returned is
- unspecified. A zero result has the sign of X when
+ The function yields the integral value nearest to <X>.
+ If <X> lies exactly halfway between two integers, one of
+ those integers is returned, but which of them is returned
+ is unspecified. A zero result has the sign of <X> when
S'Signed_Zeros is True. This function provides access to
the rounding behavior which is most efficient on the
target processor. See *note A.5.3::.
137
S'Machine_Rounds
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
138
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean. See *note A.5.3::.
139
S'Machine_Rounds
- For every subtype S of a fixed point type T:
+ For every subtype S of a fixed point type <T>:
140
Yields the value True if rounding is performed on inexact
results of every predefined operation that yields a
- result of the type T; yields the value False otherwise.
+ result of the type <T>; yields the value False otherwise.
The value of this attribute is of the predefined type
Boolean. See *note A.5.4::.
@@ -70554,7 +70654,7 @@ S'Max
specification:
143
- function S'Max(Left, Right : S'Base)
+ function S'Max(<Left>, <Right> : S'Base)
return S'Base
144
@@ -70569,7 +70669,7 @@ S'Max_Alignment_For_Allocation
Denotes the maximum value for Alignment that could be
requested by the implementation via Allocate for an
access type whose designated subtype is S. The value of
- this attribute is of type universal_integer. See *note
+ this attribute is of type <universal_integer>. See *note
13.11.1::.
145
@@ -70581,7 +70681,7 @@ S'Max_Size_In_Storage_Elements
that could be requested by the implementation via
Allocate for an access type whose designated subtype is
S. The value of this attribute is of type
- universal_integer. See *note 13.11.1::.
+ <universal_integer>. See *note 13.11.1::.
147
S'Min
@@ -70592,7 +70692,7 @@ S'Min
specification:
149
- function S'Min(Left, Right : S'Base)
+ function S'Min(<Left>, <Right> : S'Base)
return S'Base
150
@@ -70608,24 +70708,24 @@ S'Mod
specification:
150.3/2
- function S'Mod (Arg : universal_integer)
+ function S'Mod (<Arg> : <universal_integer>)
return S'Base
150.4/2
- This function returns Arg mod S'Modulus, as a value of
+ This function returns <Arg> mod S'Modulus, as a value of
the type of S. See *note 3.5.4::.
151
S'Model
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
152
S'Model denotes a function with the following
specification:
153
- function S'Model (X : T)
- return T
+ function S'Model (<X> : <T>)
+ return <T>
154
If the Numerics Annex is not supported, the meaning of
@@ -70636,50 +70736,50 @@ S'Model
155
S'Model_Emin
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
156
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to the value of T'Machine_Emin. See *note
- G.2.2:: for further requirements that apply to
+ than or equal to the value of <T>'Machine_Emin. See
+ *note G.2.2:: for further requirements that apply to
implementations supporting the Numerics Annex. The value
- of this attribute is of the type universal_integer. See
- *note A.5.3::.
+ of this attribute is of the type <universal_integer>.
+ See *note A.5.3::.
157
S'Model_Epsilon
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
158
- Yields the value T'Machine_Radix1 - T'Model_Mantissa.
+ Yields the value <T>'Machine_Radix1 - <T>'Model_Mantissa.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
159
S'Model_Mantissa
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
160
If the Numerics Annex is not supported, this attribute
yields an implementation defined value that is greater
- than or equal to 'ceiling(d � log(10) /
- log(T'Machine_Radix))' + 1, where d is the requested
- decimal precision of T, and less than or equal to the
- value of T'Machine_Mantissa. See *note G.2.2:: for
+ than or equal to 'ceiling(<d> � log(10) /
+ log(<T>'Machine_Radix))' + 1, where <d> is the requested
+ decimal precision of <T>, and less than or equal to the
+ value of <T>'Machine_Mantissa. See *note G.2.2:: for
further requirements that apply to implementations
supporting the Numerics Annex. The value of this
- attribute is of the type universal_integer. See *note
+ attribute is of the type <universal_integer>. See *note
A.5.3::.
161
S'Model_Small
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
162
- Yields the value T'Machine_RadixT'Model_Emin - 1. The
- value of this attribute is of the type universal_real.
- See *note A.5.3::.
+ Yields the value <T>'Machine_Radix<T>'Model_Emin - 1.
+ The value of this attribute is of the type
+ <universal_real>. See *note A.5.3::.
163
S'Modulus
@@ -70687,7 +70787,7 @@ S'Modulus
164
S'Modulus yields the modulus of the type of S, as a value
- of the type universal_integer. See *note 3.5.4::.
+ of the type <universal_integer>. See *note 3.5.4::.
164.1/3
X'Old
@@ -70702,7 +70802,7 @@ X'Old
165
S'Class'Output
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
166
S'Class'Output denotes a procedure with the following
@@ -70710,14 +70810,14 @@ S'Class'Output
167/2
procedure S'Class'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
168/2
- First writes the external tag of Item to Stream (by
- calling String'Output(Stream,
- Tags.External_Tag(Item'Tag)) -- see *note 3.9::) and then
- dispatches to the subprogram denoted by the Output
+ First writes the external tag of <Item> to <Stream> (by
+ calling String'Output(<Stream>,
+ Tags.External_Tag(<Item>'Tag)) -- see *note 3.9::) and
+ then dispatches to the subprogram denoted by the Output
attribute of the specific type identified by the tag.
Tag_Error is raised if the tag of Item identifies a type
declared at an accessibility level deeper than that of S.
@@ -70725,7 +70825,7 @@ S'Class'Output
169
S'Output
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
170
S'Output denotes a procedure with the following
@@ -70733,12 +70833,13 @@ S'Output
171/2
procedure S'Output(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
172
- S'Output writes the value of Item to Stream, including
- any bounds or discriminants. See *note 13.13.2::.
+ S'Output writes the value of <Item> to <Stream>,
+ including any bounds or discriminants. See *note
+ 13.13.2::.
172.1/3
X'Overlaps_Storage
@@ -70749,7 +70850,7 @@ X'Overlaps_Storage
specification:
172.3/3
- function X'Overlaps_Storage (Arg : any_type)
+ function X'Overlaps_Storage (<Arg> : <any_type>)
return Boolean
172.4/3
@@ -70769,7 +70870,7 @@ D'Partition_Id
library unit:
174
- Denotes a value of the type universal_integer that
+ Denotes a value of the type <universal_integer> that
identifies the partition in which D was elaborated. If D
denotes the declaration of a remote call interface
library unit (see *note E.2.3::) the given partition is
@@ -70785,12 +70886,12 @@ S'Pos
specification:
177
- function S'Pos(Arg : S'Base)
- return universal_integer
+ function S'Pos(<Arg> : S'Base)
+ return <universal_integer>
178
This function returns the position number of the value of
- Arg, as a value of type universal_integer. See *note
+ <Arg>, as a value of type <universal_integer>. See *note
3.5.5::.
179
@@ -70803,7 +70904,7 @@ R.C'Position
of C, denotes the value given for the position of the
component_clause; otherwise, denotes the same value as
R.C'Address - R'Address. The value of this attribute is
- of the type universal_integer. See *note 13.5.2::.
+ of the type <universal_integer>. See *note 13.5.2::.
181
S'Pred
@@ -70814,21 +70915,21 @@ S'Pred
specification:
183
- function S'Pred(Arg : S'Base)
+ function S'Pred(<Arg> : S'Base)
return S'Base
184
For an enumeration type, the function returns the value
whose position number is one less than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
returns the result of subtracting one from the value of
- Arg. For a fixed point type, the function returns the
- result of subtracting small from the value of Arg. For a
- floating point type, the function returns the machine
- number (as defined in *note 3.5.7::) immediately below
- the value of Arg; Constraint_Error is raised if there is
- no such machine number. See *note 3.5::.
+ <Arg>. For a fixed point type, the function returns the
+ result of subtracting <small> from the value of <Arg>.
+ For a floating point type, the function returns the
+ machine number (as defined in *note 3.5.7::) immediately
+ below the value of <Arg>; Constraint_Error is raised if
+ there is no such machine number. See *note 3.5::.
184.1/2
P'Priority
@@ -70874,7 +70975,7 @@ A'Range(N)
191
S'Class'Read
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
192
S'Class'Read denotes a procedure with the following
@@ -70882,8 +70983,8 @@ S'Class'Read
193/2
procedure S'Class'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>'Class)
194
Dispatches to the subprogram denoted by the Read
@@ -70892,7 +70993,7 @@ S'Class'Read
195
S'Read
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
196
S'Read denotes a procedure with the following
@@ -70900,33 +71001,34 @@ S'Read
197/2
procedure S'Read(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : out T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : out <T>)
198
- S'Read reads the value of Item from Stream. See *note
- 13.13.2::.
+ S'Read reads the value of <Item> from <Stream>. See
+ *note 13.13.2::.
199
S'Remainder
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
200
S'Remainder denotes a function with the following
specification:
201
- function S'Remainder (X, Y : T)
- return T
+ function S'Remainder (<X>, <Y> : <T>)
+ return <T>
202
- For nonzero Y, let v be the value X - n � Y, where n is
- the integer nearest to the exact value of X/Y; if |n -
- X/Y| = 1/2, then n is chosen to be even. If v is a
- machine number of the type T, the function yields v;
- otherwise, it yields zero. Constraint_Error is raised if
- Y is zero. A zero result has the sign of X when
- S'Signed_Zeros is True. See *note A.5.3::.
+ For nonzero <Y>, let <v> be the value <X> - <n> � <Y>,
+ where <n> is the integer nearest to the exact value of
+ <X>/<Y>; if |<n> - <X>/<Y>| = 1/2, then <n> is chosen to
+ be even. If <v> is a machine number of the type <T>, the
+ function yields <v>; otherwise, it yields zero.
+ Constraint_Error is raised if <Y> is zero. A zero result
+ has the sign of <X> when S'Signed_Zeros is True. See
+ *note A.5.3::.
202.1/3
F'Result
@@ -70939,11 +71041,11 @@ F'Result
Post'Class postcondition expression for a function with a
controlling result or with a controlling access result.
For a controlling result, the type of the attribute is
- T'Class, where T is the function result type. For a
+ <T>'Class, where <T> is the function result type. For a
controlling access result, the type of the attribute is
an anonymous access type whose designated type is
- T'Class, where T is the designated type of the function
- result type. See *note 6.1.1::.
+ <T>'Class, where <T> is the designated type of the
+ function result type. See *note 6.1.1::.
203
S'Round
@@ -70954,7 +71056,7 @@ S'Round
specification:
205
- function S'Round(X : universal_real)
+ function S'Round(<X> : <universal_real>)
return S'Base
206
@@ -70964,93 +71066,93 @@ S'Round
207
S'Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
208
S'Rounding denotes a function with the following
specification:
209
- function S'Rounding (X : T)
- return T
+ function S'Rounding (<X> : <T>)
+ return <T>
210
- The function yields the integral value nearest to X,
- rounding away from zero if X lies exactly halfway between
- two integers. A zero result has the sign of X when
- S'Signed_Zeros is True. See *note A.5.3::.
+ The function yields the integral value nearest to <X>,
+ rounding away from zero if <X> lies exactly halfway
+ between two integers. A zero result has the sign of <X>
+ when S'Signed_Zeros is True. See *note A.5.3::.
211
S'Safe_First
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
212
Yields the lower bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
213
S'Safe_Last
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
214
Yields the upper bound of the safe range (see *note
- 3.5.7::) of the type T. If the Numerics Annex is not
+ 3.5.7::) of the type <T>. If the Numerics Annex is not
supported, the value of this attribute is implementation
defined; see *note G.2.2:: for the definition that
applies to implementations supporting the Numerics Annex.
The value of this attribute is of the type
- universal_real. See *note A.5.3::.
+ <universal_real>. See *note A.5.3::.
215
S'Scale
For every decimal fixed point subtype S:
216
- S'Scale denotes the scale of the subtype S, defined as
+ S'Scale denotes the <scale> of the subtype S, defined as
the value N such that S'Delta = 10.0**(-N). The scale
indicates the position of the point relative to the
rightmost significant digits of values of subtype S. The
- value of this attribute is of the type universal_integer.
- See *note 3.5.10::.
+ value of this attribute is of the type
+ <universal_integer>. See *note 3.5.10::.
217
S'Scaling
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
218
S'Scaling denotes a function with the following
specification:
219
- function S'Scaling (X : T;
- Adjustment : universal_integer)
- return T
+ function S'Scaling (<X> : <T>;
+ <Adjustment> : <universal_integer>)
+ return <T>
220
- Let v be the value X � T'Machine_RadixAdjustment. If v
- is a machine number of the type T, or if |v| >=
- T'Model_Small, the function yields v; otherwise, it
- yields either one of the machine numbers of the type T
- adjacent to v. Constraint_Error is optionally raised if v
- is outside the base range of S. A zero result has the
- sign of X when S'Signed_Zeros is True. See *note
- A.5.3::.
+ Let <v> be the value <X> � <T>'Machine_Radix<Adjustment>.
+ If <v> is a machine number of the type <T>, or if |<v>|
+ >= <T>'Model_Small, the function yields <v>; otherwise,
+ it yields either one of the machine numbers of the type
+ <T> adjacent to <v>. Constraint_Error is optionally
+ raised if <v> is outside the base range of S. A zero
+ result has the sign of <X> when S'Signed_Zeros is True.
+ See *note A.5.3::.
221
S'Signed_Zeros
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
222
Yields the value True if the hardware representation for
- the type T has the capability of representing both
+ the type <T> has the capability of representing both
positively and negatively signed zeros, these being
generated and used by the predefined operations of the
- type T as specified in IEC 559:1989; yields the value
+ type <T> as specified in IEC 559:1989; yields the value
False otherwise. The value of this attribute is of the
predefined type Boolean. See *note A.5.3::.
@@ -71075,7 +71177,7 @@ S'Size
227
If S is indefinite, the meaning is implementation
defined. The value of this attribute is of the type
- universal_integer. See *note 13.3::.
+ <universal_integer>. See *note 13.3::.
228/1
X'Size
@@ -71084,16 +71186,16 @@ X'Size
229
Denotes the size in bits of the representation of the
object. The value of this attribute is of the type
- universal_integer. See *note 13.3::.
+ <universal_integer>. See *note 13.3::.
230
S'Small
For every fixed point subtype S:
231
- S'Small denotes the small of the type of S. The value of
- this attribute is of the type universal_real. See *note
- 3.5.10::.
+ S'Small denotes the <small> of the type of S. The value
+ of this attribute is of the type <universal_real>. See
+ *note 3.5.10::.
232
S'Storage_Pool
@@ -71113,7 +71215,7 @@ S'Storage_Size
Storage_Size(S'Storage_Pool), which is intended to be a
measure of the number of storage elements reserved for
the pool. The type of this attribute is
- universal_integer. See *note 13.11::.
+ <universal_integer>. See *note 13.11::.
236/1
T'Storage_Size
@@ -71123,29 +71225,29 @@ T'Storage_Size
237
Denotes the number of storage elements reserved for the
task. The value of this attribute is of the type
- universal_integer. The Storage_Size includes the size of
- the task's stack, if any. The language does not specify
- whether or not it includes other storage associated with
- the task (such as the "task control block" used by some
- implementations.) See *note 13.3::.
+ <universal_integer>. The Storage_Size includes the size
+ of the task's stack, if any. The language does not
+ specify whether or not it includes other storage
+ associated with the task (such as the "task control
+ block" used by some implementations.) See *note 13.3::.
237.1/2
S'Stream_Size
- For every subtype S of an elementary type T:
+ For every subtype S of an elementary type <T>:
237.2/3
Denotes the number of bits read from or written to a
stream by the default implementations of S'Read and
S'Write. Hence, the number of stream elements required
- per item of elementary type T is:
+ per item of elementary type <T> is:
237.3/2
- T'Stream_Size / Ada.Streams.Stream_Element'Size
+ <T>'Stream_Size / Ada.Streams.Stream_Element'Size
237.4/2
- The value of this attribute is of type universal_integer
- and is a multiple of Stream_Element'Size. See *note
- 13.13.2::.
+ The value of this attribute is of type
+ <universal_integer> and is a multiple of
+ Stream_Element'Size. See *note 13.13.2::.
238
S'Succ
@@ -71156,29 +71258,29 @@ S'Succ
specification:
240
- function S'Succ(Arg : S'Base)
+ function S'Succ(<Arg> : S'Base)
return S'Base
241
For an enumeration type, the function returns the value
whose position number is one more than that of the value
- of Arg; Constraint_Error is raised if there is no such
+ of <Arg>; Constraint_Error is raised if there is no such
value of the type. For an integer type, the function
- returns the result of adding one to the value of Arg.
+ returns the result of adding one to the value of <Arg>.
For a fixed point type, the function returns the result
- of adding small to the value of Arg. For a floating
+ of adding <small> to the value of <Arg>. For a floating
point type, the function returns the machine number (as
defined in *note 3.5.7::) immediately above the value of
- Arg; Constraint_Error is raised if there is no such
+ <Arg>; Constraint_Error is raised if there is no such
machine number. See *note 3.5::.
242
S'Tag
- For every subtype S of a tagged type T (specific or
+ For every subtype S of a tagged type <T> (specific or
class-wide):
243
- S'Tag denotes the tag of the type T (or if T is
+ S'Tag denotes the tag of the type <T> (or if <T> is
class-wide, the tag of the root type of the corresponding
class). The value of this attribute is of type Tag. See
*note 3.9::.
@@ -71205,39 +71307,39 @@ T'Terminated
248
S'Truncation
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
249
S'Truncation denotes a function with the following
specification:
250
- function S'Truncation (X : T)
- return T
+ function S'Truncation (<X> : <T>)
+ return <T>
251
- The function yields the value 'ceiling(X)' when X is
- negative, and 'floor(X)' otherwise. A zero result has
- the sign of X when S'Signed_Zeros is True. See *note
+ The function yields the value 'ceiling(<X>)' when <X> is
+ negative, and 'floor(<X>)' otherwise. A zero result has
+ the sign of <X> when S'Signed_Zeros is True. See *note
A.5.3::.
252
S'Unbiased_Rounding
- For every subtype S of a floating point type T:
+ For every subtype S of a floating point type <T>:
253
S'Unbiased_Rounding denotes a function with the following
specification:
254
- function S'Unbiased_Rounding (X : T)
- return T
+ function S'Unbiased_Rounding (<X> : <T>)
+ return <T>
255
- The function yields the integral value nearest to X,
- rounding toward the even integer if X lies exactly
+ The function yields the integral value nearest to <X>,
+ rounding toward the even integer if <X> lies exactly
halfway between two integers. A zero result has the sign
- of X when S'Signed_Zeros is True. See *note A.5.3::.
+ of <X> when S'Signed_Zeros is True. See *note A.5.3::.
256
X'Unchecked_Access
@@ -71259,12 +71361,12 @@ S'Val
specification:
260
- function S'Val(Arg : universal_integer)
+ function S'Val(<Arg> : <universal_integer>)
return S'Base
261
This function returns a value of the type of S whose
- position number equals the value of Arg. See *note
+ position number equals the value of <Arg>. See *note
3.5.5::.
262
@@ -71289,7 +71391,7 @@ S'Value
specification:
266
- function S'Value(Arg : String)
+ function S'Value(<Arg> : String)
return S'Base
267
@@ -71316,11 +71418,11 @@ S'Wide_Image
specification:
272
- function S'Wide_Image(Arg : S'Base)
+ function S'Wide_Image(<Arg> : S'Base)
return Wide_String
273/3
- The function returns an image of the value of Arg as a
+ The function returns an image of the value of <Arg> as a
Wide_String. See *note 3.5::.
273.1/4
@@ -71330,7 +71432,7 @@ X'Wide_Image
273.2/4
X'Wide_Image denotes the result of calling function
- S'Wide_Image with Arg being X, where S is the nominal
+ S'Wide_Image with <Arg> being X, where S is the nominal
subtype of X. See *note 3.5::.
274
@@ -71342,7 +71444,7 @@ S'Wide_Value
specification:
276
- function S'Wide_Value(Arg : Wide_String)
+ function S'Wide_Value(<Arg> : Wide_String)
return S'Base
277
@@ -71359,13 +71461,13 @@ S'Wide_Wide_Image
specification:
277.3/2
- function S'Wide_Wide_Image(Arg : S'Base)
+ function S'Wide_Wide_Image(<Arg> : S'Base)
return Wide_Wide_String
277.4/2
- The function returns an image of the value of Arg, that
- is, a sequence of characters representing the value in
- display form. See *note 3.5::.
+ The function returns an <image> of the value of <Arg>,
+ that is, a sequence of characters representing the value
+ in display form. See *note 3.5::.
277.5/4
X'Wide_Wide_Image
@@ -71374,7 +71476,7 @@ X'Wide_Wide_Image
277.6/4
X'Wide_Wide_Image denotes the result of calling function
- S'Wide_Wide_Image with Arg being X, where S is the
+ S'Wide_Wide_Image with <Arg> being X, where S is the
nominal subtype of X. See *note 3.5::.
277.7/2
@@ -71386,7 +71488,7 @@ S'Wide_Wide_Value
specification:
277.9/2
- function S'Wide_Wide_Value(Arg : Wide_Wide_String)
+ function S'Wide_Wide_Value(<Arg> : Wide_Wide_String)
return S'Base
277.10/2
@@ -71402,7 +71504,7 @@ S'Wide_Wide_Width
S'Wide_Wide_Width denotes the maximum length of a
Wide_Wide_String returned by S'Wide_Wide_Image over all
values of the subtype S. It denotes zero for a subtype
- that has a null range. Its type is universal_integer.
+ that has a null range. Its type is <universal_integer>.
See *note 3.5::.
278
@@ -71413,7 +71515,7 @@ S'Wide_Width
S'Wide_Width denotes the maximum length of a Wide_String
returned by S'Wide_Image over all values of the subtype
S. It denotes zero for a subtype that has a null range.
- Its type is universal_integer. See *note 3.5::.
+ Its type is <universal_integer>. See *note 3.5::.
280
S'Width
@@ -71423,11 +71525,11 @@ S'Width
S'Width denotes the maximum length of a String returned
by S'Image over all values of the subtype S. It denotes
zero for a subtype that has a null range. Its type is
- universal_integer. See *note 3.5::.
+ <universal_integer>. See *note 3.5::.
282
S'Class'Write
- For every subtype S'Class of a class-wide type T'Class:
+ For every subtype S'Class of a class-wide type <T>'Class:
283
S'Class'Write denotes a procedure with the following
@@ -71435,8 +71537,8 @@ S'Class'Write
284/2
procedure S'Class'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T'Class)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>'Class)
285
Dispatches to the subprogram denoted by the Write
@@ -71445,7 +71547,7 @@ S'Class'Write
286
S'Write
- For every subtype S of a specific type T:
+ For every subtype S of a specific type <T>:
287
S'Write denotes a procedure with the following
@@ -71453,12 +71555,12 @@ S'Write
288/2
procedure S'Write(
- Stream : not null access
Ada.Streams.Root_Stream_Type'Class;
- Item : in T)
+ <Stream> : not null access
Ada.Streams.Root_Stream_Type'Class;
+ <Item> : in <T>)
289
- S'Write writes the value of Item to Stream. See *note
- 13.13.2::.
+ S'Write writes the value of <Item> to <Stream>. See
+ *note 13.13.2::.
File: arm2012.info, Node: Annex L, Next: Annex M, Prev: Annex K, Up: Top
@@ -71471,53 +71573,54 @@ This Annex summarizes the definitions given elsewhere
of the
language-defined pragmas.
2
-pragma All_Calls_Remote[(library_unit_name)]; -- See *note E.2.3::.
+pragma All_Calls_Remote[(<library_unit_>name)]; -- See *note E.2.3::.
2.1/2
-pragma Assert([Check =>] boolean_expression[, [Message =>] string_
+pragma Assert([Check =>] <boolean_>expression[, [Message =>] <string_>
expression]); -- See *note 11.4.2::.
2.2/2
-pragma Assertion_Policy(policy_identifier); -- See *note 11.4.2::.
+pragma Assertion_Policy(<policy_>identifier); -- See *note 11.4.2::.
2.3/3
pragma Assertion_Policy(
- assertion_aspect_mark => policy_identifier
- {, assertion_aspect_mark => policy_identifier}); -- See *note
+ <assertion_>aspect_mark => <policy_>identifier
+ {, <assertion_>aspect_mark => <policy_>identifier}); -- See *note
11.4.2::.
3/3
-This paragraph was deleted.
+<This paragraph was deleted.>
3.1/3
pragma Asynchronous (local_name); -- See *note J.15.13::.
4/3
-This paragraph was deleted.
+<This paragraph was deleted.>
4.1/3
pragma Atomic (local_name); -- See *note J.15.8::.
5/3
-This paragraph was deleted.
+<This paragraph was deleted.>
5.1/3
-pragma Atomic_Components (array_local_name); -- See *note J.15.8::.
+pragma Atomic_Components (<array_>local_name); -- See *note J.15.8::.
6/3
-This paragraph was deleted.
+<This paragraph was deleted.>
6.1/3
-pragma Attach_Handler (handler_name, expression); -- See *note J.15.7::.
+pragma Attach_Handler (<handler_>name, expression); -- See *note
+J.15.7::.
7/3
-This paragraph was deleted.
+<This paragraph was deleted.>
8/3
-This paragraph was deleted.
+<This paragraph was deleted.>
8.1/3
-pragma Convention([Convention =>] convention_identifier,[Entity =>]
+pragma Convention([Convention =>] <convention_>identifier,[Entity =>]
local_name); -- See *note J.15.5::.
8.2/3
@@ -71537,79 +71640,79 @@ pragma Discard_Names[([On => ] local_name)]; -- See
*note C.5::.
pragma Dispatching_Domain (expression); -- See *note J.15.10::.
10
-pragma Elaborate(library_unit_name{, library_unit_name}); -- See *note
-10.2.1::.
+pragma Elaborate(<library_unit_>name{, <library_unit_>name}); -- See
+*note 10.2.1::.
11
-pragma Elaborate_All(library_unit_name{, library_unit_name}); -- See
+pragma Elaborate_All(<library_unit_>name{, <library_unit_>name}); -- See
*note 10.2.1::.
12
-pragma Elaborate_Body[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Elaborate_Body[(<library_unit_>name)]; -- See *note 10.2.1::.
13/3
-This paragraph was deleted.
+<This paragraph was deleted.>
13.1/3
pragma Export(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]); -- See *note
+ [Convention =>] <convention_>identifier, [Entity =>] local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]); -- See *note
J.15.5::.
14/3
-This paragraph was deleted.
+<This paragraph was deleted.>
14.1/3
pragma Import(
- [Convention =>] convention_identifier, [Entity =>] local_name
- [, [External_Name =>] external_name_string_expression]
- [, [Link_Name =>] link_name_string_expression]); -- See *note
+ [Convention =>] <convention_>identifier, [Entity =>] local_name
+ [, [External_Name =>] <external_name_string_>expression]
+ [, [Link_Name =>] <link_name_string_>expression]); -- See *note
J.15.5::.
14.2/3
-pragma Independent (component_local_name); -- See *note J.15.8::.
+pragma Independent (<component_>local_name); -- See *note J.15.8::.
14.3/3
pragma Independent_Components (local_name); -- See *note J.15.8::.
15/3
-This paragraph was deleted.
+<This paragraph was deleted.>
15.1/3
pragma Inline (name{, name}); -- See *note J.15.1::.
16
-pragma Inspection_Point[(object_name {, object_name})]; -- See *note
+pragma Inspection_Point[(<object_>name {, <object_>name})]; -- See *note
H.3.2::.
17/3
-This paragraph was deleted.
+<This paragraph was deleted.>
17.1/3
-pragma Interrupt_Handler (handler_name); -- See *note J.15.7::.
+pragma Interrupt_Handler (<handler_>name); -- See *note J.15.7::.
18/3
-This paragraph was deleted.
+<This paragraph was deleted.>
18.1/3
pragma Interrupt_Priority [(expression);] -- See *note J.15.11::.
19
-pragma Linker_Options(string_expression); -- See *note B.1::.
+pragma Linker_Options(<string_>expression); -- See *note B.1::.
20
pragma List(identifier); -- See *note 2.8::.
21
-pragma Locking_Policy(policy_identifier); -- See *note D.3::.
+pragma Locking_Policy(<policy_>identifier); -- See *note D.3::.
21.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
21.2/3
-pragma No_Return (procedure_local_name{, procedure_local_name}); -- See
-*note J.15.2::.
+pragma No_Return (<procedure_>local_name{, <procedure_>local_name}); --
+See *note J.15.2::.
22
pragma Normalize_Scalars; -- See *note H.1::.
@@ -71618,60 +71721,61 @@ pragma Normalize_Scalars; -- See *note H.1::.
pragma Optimize(identifier); -- See *note 2.8::.
24/3
-This paragraph was deleted.
+<This paragraph was deleted.>
24.1/3
-pragma Pack (first_subtype_local_name); -- See *note J.15.3::.
+pragma Pack (<first_subtype_>local_name); -- See *note J.15.3::.
25
pragma Page; -- See *note 2.8::.
25.1/2
-pragma Partition_Elaboration_Policy (policy_identifier); -- See *note
+pragma Partition_Elaboration_Policy (<policy_>identifier); -- See *note
H.6::.
25.2/2
pragma Preelaborable_Initialization(direct_name); -- See *note 10.2.1::.
26
-pragma Preelaborate[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Preelaborate[(<library_unit_>name)]; -- See *note 10.2.1::.
27/3
-This paragraph was deleted.
+<This paragraph was deleted.>
27.1/3
pragma Priority (expression); -- See *note J.15.11::.
27.2/2
pragma Priority_Specific_Dispatching (
- policy_identifier, first_priority_expression, last_priority_
+ <policy_>identifier, <first_priority_>expression, <last_priority_>
expression); -- See *note D.2.2::.
27.3/3
-pragma Profile (profile_identifier {, profile_
+pragma Profile (<profile_>identifier {, <profile_>
pragma_argument_association}); -- See *note 13.12::.
27.4/3
-This paragraph was deleted.
+<This paragraph was deleted.>
28
-pragma Pure[(library_unit_name)]; -- See *note 10.2.1::.
+pragma Pure[(<library_unit_>name)]; -- See *note 10.2.1::.
29
-pragma Queuing_Policy(policy_identifier); -- See *note D.4::.
+pragma Queuing_Policy(<policy_>identifier); -- See *note D.4::.
29.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
29.2/3
-pragma Relative_Deadline (relative_deadline_expression); -- See *note
+pragma Relative_Deadline (<relative_deadline_>expression); -- See *note
J.15.12::.
30
-pragma Remote_Call_Interface[(library_unit_name)]; -- See *note E.2.3::.
+pragma Remote_Call_Interface[(<library_unit_>name)]; -- See *note
+E.2.3::.
31
-pragma Remote_Types[(library_unit_name)]; -- See *note E.2.2::.
+pragma Remote_Types[(<library_unit_>name)]; -- See *note E.2.2::.
32
pragma Restrictions(restriction{, restriction}); -- See *note 13.12::.
@@ -71680,10 +71784,10 @@ pragma Restrictions(restriction{, restriction}); --
See *note 13.12::.
pragma Reviewable; -- See *note H.3.1::.
34
-pragma Shared_Passive[(library_unit_name)]; -- See *note E.2.1::.
+pragma Shared_Passive[(<library_unit_>name)]; -- See *note E.2.1::.
35/3
-This paragraph was deleted.
+<This paragraph was deleted.>
35.1/3
pragma Storage_Size (expression); -- See *note J.15.4::.
@@ -71692,29 +71796,30 @@ pragma Storage_Size (expression); -- See *note
J.15.4::.
pragma Suppress(identifier); -- See *note 11.5::.
37
-pragma Task_Dispatching_Policy(policy_identifier); -- See *note D.2.2::.
+pragma Task_Dispatching_Policy(<policy_>identifier); -- See *note
+D.2.2::.
37.1/3
-This paragraph was deleted.
+<This paragraph was deleted.>
37.2/3
-pragma Unchecked_Union (first_subtype_local_name); -- See *note
+pragma Unchecked_Union (<first_subtype_>local_name); -- See *note
J.15.6::.
37.3/2
pragma Unsuppress(identifier); -- See *note 11.5::.
38/3
-This paragraph was deleted.
+<This paragraph was deleted.>
38.1/3
pragma Volatile (local_name); -- See *note J.15.8::.
39/3
-This paragraph was deleted.
+<This paragraph was deleted.>
39.1/3
-pragma Volatile_Components (array_local_name); -- See *note J.15.8::.
+pragma Volatile_Components (<array_>local_name); -- See *note J.15.8::.
File: arm2012.info, Node: Annex M, Next: Annex N, Prev: Annex L, Up: Top
@@ -71986,8 +72091,8 @@ M.2 Implementation-Defined Characteristics
1/2
The Ada language allows for certain machine dependences in a controlled
-manner. Each Ada implementation must document all implementation-defined
-characteristics:
+manner. Each Ada implementation must document all
+implementation-defined characteristics:
2/2
* Whether or not each recommendation given in Implementation Advice
@@ -72014,7 +72119,7 @@ characteristics:
Form KC. See *note 2.1::(4.1/3).
7/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
8
* The representation for an end of line. See *note 2.2::(2/3).
@@ -72065,10 +72170,11 @@ characteristics:
*note 3.5.7::(16).
18
- * The small of an ordinary fixed point type. See *note 3.5.9::(8/2).
+ * The <small> of an ordinary fixed point type. See *note
+ 3.5.9::(8/2).
19
- * What combinations of small, range, and digits are supported for
+ * What combinations of <small>, range, and <digits> are supported for
fixed point types. See *note 3.5.9::(10).
20/2
@@ -72112,7 +72218,7 @@ characteristics:
more than 100 hours. See *note 9.6.1::(86/2).
27/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
28
* The representation for a compilation. See *note 10.1::(2).
@@ -72182,8 +72288,8 @@ characteristics:
11.4.1::(13/2).
41.1/3
- * Implementation-defined policy_identifiers and
- assertion_aspect_marks allowed in a pragma Assertion_Policy. See
+ * Implementation-defined <policy_>identifiers and
+ <assertion_>aspect_marks allowed in a pragma Assertion_Policy. See
*note 11.4.2::(9/3).
41.2/2
@@ -72258,7 +72364,7 @@ characteristics:
*note 13.9::(11).
53/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
54
* Whether or not the implementation provides user-accessible names
@@ -72270,14 +72376,14 @@ characteristics:
13.11::(18).
56/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
56.1/4
* The effect of specifying aspect Default_Storage_Pool on an instance
of a language-defined generic unit. See *note 13.11.3::(5).
57/3
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
57.1/3
* Implementation-defined restrictions allowed in a pragma
@@ -72320,14 +72426,14 @@ characteristics:
A.5.2::(27).
65/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
66
* The string representation of a random number generator's state.
See *note A.5.2::(38).
67/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
68
* The values of the Model_Mantissa, Model_Emin, Model_Epsilon, Model,
@@ -72335,7 +72441,7 @@ characteristics:
supported. See *note A.5.3::(72).
69/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
70
* The value of Buffer_Size in Storage_IO. See *note A.9::(10).
@@ -72438,10 +72544,10 @@ characteristics:
C.1::(1/3).
82/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
83/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
83.1/3
* Any restrictions on a protected procedure or its containing type
@@ -72454,7 +72560,7 @@ characteristics:
C.3.1::(19).
84/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
85/4
* The semantics of some attributes and functions of an entity for
@@ -72470,17 +72576,17 @@ characteristics:
C.7.1::(17/3).
88/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
88.1/1
* Granularity of locking for Task_Attributes. See *note
C.7.2::(16/1).
89/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
90/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
91
* The declarations of Any_Priority and Priority. See *note
@@ -72498,10 +72604,10 @@ characteristics:
dispatching. See *note D.2.1::(9/2).
95/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
96/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
97/2
* Implementation defined task dispatching policies. See *note
@@ -72512,7 +72618,7 @@ characteristics:
D.2.5::(4).
98
- * Implementation-defined policy_identifiers allowed in a pragma
+ * Implementation-defined <policy_>identifiers allowed in a pragma
Locking_Policy. See *note D.3::(4).
98.1/2
@@ -72530,7 +72636,7 @@ characteristics:
* Implementation-defined queuing policies. See *note D.4::(1/3).
102/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
103
* Any operations that implicitly require heap storage allocation.
@@ -72562,10 +72668,10 @@ characteristics:
program code or data size or execution time. See *note D.7::(20).
105/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
106/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
106.1/3
* The value of Barrier_Limit'Last in Synchronous_Barriers. See *note
@@ -72576,7 +72682,7 @@ characteristics:
aborted. See *note D.10.1::(13/3).
107/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
107.1/3
* The value of Min_Handler_Ceiling in Execution_Time.Group_Budgets.
@@ -72604,7 +72710,7 @@ characteristics:
E.1::(11).
111/1
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
112
* Whether the execution of the remote subprogram is immediately
@@ -72614,7 +72720,7 @@ characteristics:
* The range of type System.RPC.Partition_Id. See *note E.5::(14).
113/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
114
* Implementation-defined interfaces in the PCS. See *note E.5::(26).
@@ -72669,14 +72775,14 @@ characteristics:
multiplication by a reciprocal. See *note G.2.1::(16).
125
- * The definition of close result set, which determines the accuracy
+ * The definition of <close result set>, which determines the accuracy
of certain fixed point multiplications and divisions. See *note
G.2.3::(5).
126
- * Conditions on a universal_real operand of a fixed point
+ * Conditions on a <universal_real> operand of a fixed point
multiplication or division for which the result shall be in the
- perfect result set. See *note G.2.3::(22).
+ <perfect result set>. See *note G.2.3::(22).
127
* The result of a fixed point arithmetic operation in overflow
@@ -72689,7 +72795,7 @@ characteristics:
is False. See *note G.2.4::(4).
129
- * The value of the angle threshold, within which certain elementary
+ * The value of the <angle threshold>, within which certain elementary
functions, complex arithmetic operations, and complex elementary
functions yield results conforming to a maximum relative error
bound. See *note G.2.4::(10).
@@ -72720,19 +72826,19 @@ characteristics:
See *note G.3.2::(149/2).
133/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
134/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
135/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
136/2
- * This paragraph was deleted.
+ * <This paragraph was deleted.>
136.1/2
- * Implementation-defined policy_identifiers allowed in a pragma
+ * Implementation-defined <policy_>identifiers allowed in a pragma
Partition_Elaboration_Policy. See *note H.6::(4/2).
@@ -72862,8 +72968,8 @@ document whether that advice is followed:
be followed. See *note 13.3::(19).
26.1/3
- * For any tagged specific subtype S, S'Class'Alignment should equal
- S'Alignment. See *note 13.3::(28).
+ * For any tagged specific subtype <S>, <S>'Class'Alignment should
+ equal <S>'Alignment. See *note 13.3::(28).
27/2
* The recommended level of support for the Alignment attribute should
@@ -73058,23 +73164,23 @@ document whether that advice is followed:
61/2
* The worst-case time complexity of Element for Containers.Vector
- should be O(log N). See *note A.18.2::(256/2).
+ should be <O>(log <N>). See *note A.18.2::(256/2).
62/2
- * The worst-case time complexity of Append with Count = 1 when N is
- less than the capacity for Containers.Vector should be O(log N).
- See *note A.18.2::(257/2).
+ * The worst-case time complexity of Append with Count = 1 when <N> is
+ less than the capacity for Containers.Vector should be <O>(log
+ <N>). See *note A.18.2::(257/2).
63/2
* The worst-case time complexity of Prepend with Count = 1 and
- Delete_First with Count=1 for Containers.Vectors should be O(N log
- N). See *note A.18.2::(258/2).
+ Delete_First with Count=1 for Containers.Vectors should be <O>(<N>
+ log <N>). See *note A.18.2::(258/2).
64/2
* The worst-case time complexity of a call on procedure Sort of an
- instance of Containers.Vectors.Generic_Sorting should be O(N**2),
- and the average time complexity should be better than O(N**2). See
- *note A.18.2::(259/2).
+ instance of Containers.Vectors.Generic_Sorting should be
+ <O>(<N>**2), and the average time complexity should be better than
+ <O>(<N>**2). See *note A.18.2::(259/2).
65/2
* Containers.Vectors.Generic_Sorting.Sort and
@@ -73094,13 +73200,13 @@ document whether that advice is followed:
68/2
* The worst-case time complexity of Element, Insert with Count=1, and
Delete with Count=1 for Containers.Doubly_Linked_Lists should be
- O(log N). See *note A.18.3::(160/2).
+ <O>(log <N>). See *note A.18.3::(160/2).
69/2
* A call on procedure Sort of an instance of
Containers.Doubly_Linked_Lists.Generic_Sorting should have an
- average time complexity better than O(N**2) and worst case no worse
- than O(N**2). See *note A.18.3::(161/2).
+ average time complexity better than <O>(<N>**2) and worst case no
+ worse than <O>(<N>**2). See *note A.18.3::(161/2).
70/2
* Containers.Doubly_Linked_Lists.Move should not copy elements, and
@@ -73124,19 +73230,19 @@ document whether that advice is followed:
74/2
* The average time complexity of Element, Insert, Include, Replace,
Delete, Exclude and Find operations that take a key parameter for
- Containers.Hashed_Maps should be O(log N). The average time
+ Containers.Hashed_Maps should be <O>(log <N>). The average time
complexity of the subprograms of Containers.Hashed_Maps that take a
- cursor parameter should be O(1). The average time complexity of
- Containers.Hashed_Maps.Reserve_Capacity should be O(N). See *note
- A.18.5::(62/2).
+ cursor parameter should be <O>(1). The average time complexity of
+ Containers.Hashed_Maps.Reserve_Capacity should be <O>(<N>). See
+ *note A.18.5::(62/2).
75/2
* The worst-case time complexity of Element, Insert, Include,
Replace, Delete, Exclude and Find operations that take a key
- parameter for Containers.Ordered_Maps should be O((log N)**2) or
- better. The worst-case time complexity of the subprograms of
+ parameter for Containers.Ordered_Maps should be <O>((log <N>)**2)
+ or better. The worst-case time complexity of the subprograms of
Containers.Ordered_Maps that take a cursor parameter should be
- O(1). See *note A.18.6::(95/2).
+ <O>(1). See *note A.18.6::(95/2).
76/2
* Move for sets should not copy elements, and should minimize copying
@@ -73150,24 +73256,25 @@ document whether that advice is followed:
78/2
* The average time complexity of the Insert, Include, Replace,
Delete, Exclude and Find operations of Containers.Hashed_Sets that
- take an element parameter should be O(log N). The average time
+ take an element parameter should be <O>(log <N>). The average time
complexity of the subprograms of Containers.Hashed_Sets that take a
- cursor parameter should be O(1). The average time complexity of
- Containers.Hashed_Sets.Reserve_Capacity should be O(N). See *note
- A.18.8::(88/2).
+ cursor parameter should be <O>(1). The average time complexity of
+ Containers.Hashed_Sets.Reserve_Capacity should be <O>(<N>). See
+ *note A.18.8::(88/2).
79/2
* The worst-case time complexity of the Insert, Include, Replace,
Delete, Exclude and Find operations of Containers.Ordered_Sets that
- take an element parameter should be O((log N)**2). The worst-case
- time complexity of the subprograms of Containers.Ordered_Sets that
- take a cursor parameter should be O(1). See *note A.18.9::(116/2).
+ take an element parameter should be <O>((log <N>)**2). The
+ worst-case time complexity of the subprograms of
+ Containers.Ordered_Sets that take a cursor parameter should be
+ <O>(1). See *note A.18.9::(116/2).
79.1/3
* The worst-case time complexity of the Element, Parent, First_Child,
Last_Child, Next_Sibling, Previous_Sibling, Insert_Child with
Count=1, and Delete operations of Containers.Multiway_Trees should
- be O(log N). See *note A.18.10::(231/3).
+ be <O>(log <N>). See *note A.18.10::(231/3).
79.2/3
* Containers.Multiway_Trees.Move should not copy elements, and should
@@ -73249,8 +73356,8 @@ document whether that advice is followed:
80/2
* Containers.Generic_Array_Sort and
Containers.Generic_Constrained_Array_Sort should have an average
- time complexity better than O(N**2) and worst case no worse than
- O(N**2). See *note A.18.26::(10/2).
+ time complexity better than <O>(<N>**2) and worst case no worse
+ than <O>(<N>**2). See *note A.18.26::(10/2).
81/2
* Containers.Generic_Array_Sort and
@@ -73259,8 +73366,8 @@ document whether that advice is followed:
81.1/3
* Containers.Generic_Sort should have an average time complexity
- better than O(N**2) and worst case no worse than O(N**2). See
- *note A.18.26::(12/3).
+ better than <O>(<N>**2) and worst case no worse than <O>(<N>**2).
+ See *note A.18.26::(12/3).
81.2/3
* Containers.Generic_Sort should minimize calls to the generic formal
@@ -73287,11 +73394,11 @@ document whether that advice is followed:
B.1::(40/3).
84/3
- * For each supported convention L other than Intrinsic, specifying
+ * For each supported convention <L> other than Intrinsic, specifying
the aspects Import and Export should be supported for objects of
- L-compatible types and for subprograms, and aspect Convention
- should be supported for L-eligible types and for subprograms. See
- *note B.1::(41/4).
+ <L>-compatible types and for subprograms, and aspect Convention
+ should be supported for <L>-eligible types and for subprograms.
+ See *note B.1::(41/4).
85/2
* If an interface to C, COBOL, or Fortran is provided, the
@@ -73462,7 +73569,7 @@ document whether that advice is followed:
118/2
* Packed decimal should be used as the internal representation for
- objects of subtype S when S'Machine_Radix = 10. See *note
+ objects of subtype <S> when <S>'Machine_Radix = 10. See *note
F.1::(2).
119/2
@@ -73604,14 +73711,14 @@ places.
4.3/2
Category (of types). A category of types is a set of types with one or
more common properties, such as primitive operations. A category of
-types that is closed under derivation is also known as a class.
+types that is closed under derivation is also known as a <class>.
5
Character type. A character type is an enumeration type whose values
include characters.
6/2
-Class (of types). A class is a set of types that is closed under
+Class (of types). A class is a set of types that is closed under
derivation, which means that if a given type is in the class, then all
types derived from that type are also in the class. The set of types of
a class share common properties, such as their primitive operations.
@@ -73626,7 +73733,7 @@ declaration, the body, or a renaming of a program unit.
Composite type. A composite type may have components.
9
-Construct. A construct is a piece of text (explicit or implicit) that
+Construct. A <construct> is a piece of text (explicit or implicit) that
is an instance of a syntactic category defined under "Syntax".
9.1/3
@@ -73640,14 +73747,14 @@ Controlled type. A controlled type supports
user-defined assignment and
finalization. Objects are always finalized before being destroyed.
11
-Declaration. A declaration is a language construct that associates a
-name with (a view of) an entity. A declaration may appear explicitly in
-the program text (an explicit declaration), or may be supposed to occur
-at a given place in the text as a consequence of the semantics of
-another construct (an implicit declaration).
+Declaration. A <declaration> is a language construct that associates a
+name with (a view of) an entity. A declaration may appear explicitly in
+the program text (an <explicit> declaration), or may be supposed to
+occur at a given place in the text as a consequence of the semantics of
+another construct (an <implicit> declaration).
12/2
-This paragraph was deleted.
+<This paragraph was deleted.>
13/2
Derived type. A derived type is a type defined in terms of one or more
@@ -73693,17 +73800,17 @@ effect is called evaluation. Evaluation is one of
the forms of
execution.
18
-Exception. An exception represents a kind of exceptional situation; an
-occurrence of such a situation (at run time) is called an exception
-occurrence. To raise an exception is to abandon normal program execution
-so as to draw attention to the fact that the corresponding situation has
-arisen. Performing some actions in response to the arising of an
-exception is called handling the exception.
+Exception. An <exception> represents a kind of exceptional situation;
+an occurrence of such a situation (at run time) is called an <exception
+occurrence>. To <raise> an exception is to abandon normal program
+execution so as to draw attention to the fact that the corresponding
+situation has arisen. Performing some actions in response to the
+arising of an exception is called <handling> the exception.
19
Execution. The process by which a construct achieves its run-time
-effect is called execution. Execution of a declaration is also called
-elaboration. Execution of an expression is also called evaluation.
+effect is called <execution>. Execution of a declaration is also called
+<elaboration>. Execution of an expression is also called <evaluation>.
19.1/2
Function. A function is a form of subprogram that returns a result and
@@ -73767,9 +73874,9 @@ may perform arbitrary computations to access elements
from a container.
Library unit. A library unit is a separately compiled program unit, and
is always a package, subprogram, or generic unit. Library units may
have other (logically nested) library units as children, and may have
-other program units physically nested within them. A root library unit,
+other program units physically nested within them. A root library unit,
together with its children and grandchildren and so on, form a
-subsystem.
+<subsystem>.
23/2
Limited type. A limited type is a type for which copying (such as in an
@@ -73801,11 +73908,11 @@ definition of the derived type. The parent can be
almost any kind of
type, including an interface type.
26
-Partition. A partition is a part of a program. Each partition consists
-of a set of library units. Each partition may run in a separate address
-space, possibly on a separate computer. A program may contain just one
-partition. A distributed program typically contains multiple
-partitions, which can execute concurrently.
+Partition. A <partition> is a part of a program. Each partition
+consists of a set of library units. Each partition may run in a
+separate address space, possibly on a separate computer. A program may
+contain just one partition. A distributed program typically contains
+multiple partitions, which can execute concurrently.
26.1/3
Postcondition. A postcondition is an assertion that is expected to be
@@ -73857,12 +73964,12 @@ is always an interface type. Interfaces, tasks, and
protected types may
also have progenitors.
31
-Program. A program is a set of partitions, each of which may execute in
-a separate address space, possibly on a separate computer. A partition
-consists of a set of library units.
+Program. A <program> is a set of <partitions>, each of which may
+execute in a separate address space, possibly on a separate computer. A
+partition consists of a set of library units.
32
-Program unit. A program unit is either a package, a task unit, a
+Program unit. A <program unit> is either a package, a task unit, a
protected unit, a protected entry, a generic unit, or an explicitly
declared subprogram other than an enumeration literal. Certain kinds of
program units can be separately compiled. Alternatively, they can
@@ -73943,10 +74050,11 @@ task entries. The top-level task of a partition is
called the
environment task.
41/2
-Type. Each object has a type. A type has an associated set of values,
-and a set of primitive operations which implement the fundamental
-aspects of its semantics. Types are grouped into categories. Most
-language-defined categories of types are also classes of types.
+Type. Each object has a type. A <type> has an associated set of
+values, and a set of <primitive operations> which implement the
+fundamental aspects of its semantics. Types are grouped into
+<categories>. Most language-defined categories of types are also
+<classes> of types.
41.1/4
Type Invariant. See Invariant.
@@ -74020,10 +74128,10 @@ This Annex summarizes the complete syntax of the
language. See *note
string_literal ::= "{string_element}"
*note 2.6:::
- string_element ::= "" | non_quotation_mark_graphic_character
+ string_element ::= "" | <non_quotation_mark_>graphic_character
*note 2.7:::
- comment ::= --{non_end_of_line_character}
+ comment ::= --{<non_end_of_line_>character}
*note 2.8:::
pragma ::=
@@ -74032,10 +74140,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 2.8:::
pragma_argument_association ::=
- [pragma_argument_identifier =>] name
- | [pragma_argument_identifier =>] expression
- | pragma_argument_aspect_mark => name
- | pragma_argument_aspect_mark => expression
+ [<pragma_argument_>identifier =>] name
+ | [<pragma_argument_>identifier =>] expression
+ | <pragma_argument_>aspect_mark => name
+ | <pragma_argument_>aspect_mark => expression
*note 3.1:::
basic_declaration ::=
@@ -74080,7 +74188,7 @@ This Annex summarizes the complete syntax of the
language. See *note
subtype_indication ::= [null_exclusion] subtype_mark [constraint]
*note 3.2.2:::
- subtype_mark ::= subtype_name
+ subtype_mark ::= <subtype_>name
*note 3.2.2:::
constraint ::= scalar_constraint | composite_constraint
@@ -74113,11 +74221,11 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.3.2:::
number_declaration ::=
- defining_identifier_list : constant := static_expression;
+ defining_identifier_list : constant := <static_>expression;
*note 3.4:::
derived_type_definition ::=
- [abstract] [limited] new parent_subtype_indication [[and
+ [abstract] [limited] new <parent_>subtype_indication [[and
interface_list] record_extension_part]
*note 3.5:::
@@ -74144,11 +74252,11 @@ This Annex summarizes the complete syntax of the
language. See *note
modular_type_definition
*note 3.5.4:::
- signed_integer_type_definition ::= range static_
- simple_expression .. static_simple_expression
+ signed_integer_type_definition ::= range <static_>
+ simple_expression .. <static_>simple_expression
*note 3.5.4:::
- modular_type_definition ::= mod static_expression
+ modular_type_definition ::= mod <static_>expression
*note 3.5.6:::
real_type_definition ::=
@@ -74156,11 +74264,11 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.5.7:::
floating_point_definition ::=
- digits static_expression [real_range_specification]
+ digits <static_>expression [real_range_specification]
*note 3.5.7:::
real_range_specification ::=
- range static_simple_expression .. static_simple_expression
+ range <static_>simple_expression .. <static_>simple_expression
*note 3.5.9:::
fixed_point_definition ::= ordinary_fixed_point_definition |
@@ -74168,16 +74276,16 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.5.9:::
ordinary_fixed_point_definition ::=
- delta static_expression real_range_specification
+ delta <static_>expression real_range_specification
*note 3.5.9:::
decimal_fixed_point_definition ::=
- delta static_expression digits static_expression [
+ delta <static_>expression digits <static_>expression [
real_range_specification]
*note 3.5.9:::
digits_constraint ::=
- digits static_simple_expression [range_constraint]
+ digits <static_>simple_expression [range_constraint]
*note 3.6:::
array_type_definition ::=
@@ -74197,7 +74305,8 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_subtype_definition}) of component_definition
*note 3.6:::
- discrete_subtype_definition ::= discrete_subtype_indication | range
+ discrete_subtype_definition ::= <discrete_>subtype_indication |
+ range
*note 3.6:::
component_definition ::=
@@ -74208,7 +74317,7 @@ This Annex summarizes the complete syntax of the
language. See *note
index_constraint ::= (discrete_range {, discrete_range})
*note 3.6.1:::
- discrete_range ::= discrete_subtype_indication | range
+ discrete_range ::= <discrete_>subtype_indication | range
*note 3.7:::
discriminant_part ::= unknown_discriminant_part |
@@ -74237,8 +74346,8 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.7.1:::
discriminant_association ::=
- [discriminant_selector_name {| discriminant_selector_name} =>]
- expression
+ [<discriminant_>selector_name {| <discriminant_>
+ selector_name} =>] expression
*note 3.8:::
record_type_definition ::= [[abstract] tagged] [limited]
@@ -74268,7 +74377,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 3.8.1:::
variant_part ::=
- case discriminant_direct_name is
+ case <discriminant_>direct_name is
variant
{variant}
end case;
@@ -74282,7 +74391,7 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_choice_list ::= discrete_choice {| discrete_choice}
*note 3.8.1:::
- discrete_choice ::= choice_expression | discrete_
+ discrete_choice ::= choice_expression | <discrete_>
subtype_indication | range | others
*note 3.9.1:::
@@ -74300,7 +74409,7 @@ This Annex summarizes the complete syntax of the
language. See *note
interface_list]
*note 3.9.4:::
- interface_list ::= interface_subtype_mark {and interface_
+ interface_list ::= <interface_>subtype_mark {and <interface_>
subtype_mark}
*note 3.10:::
@@ -74390,20 +74499,20 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.1.4:::
attribute_designator ::=
- identifier[(static_expression)]
+ identifier[(<static_>expression)]
| Access | Delta | Digits | Mod
*note 4.1.4:::
range_attribute_reference ::= prefix'range_attribute_designator
*note 4.1.4:::
- range_attribute_designator ::= Range[(static_expression)]
+ range_attribute_designator ::= Range[(<static_>expression)]
*note 4.1.5:::
- generalized_reference ::= reference_object_name
+ generalized_reference ::= <reference_object_>name
*note 4.1.6:::
- generalized_indexing ::= indexable_container_object_prefix
+ generalized_indexing ::= <indexable_container_object_>prefix
actual_parameter_part
*note 4.3:::
@@ -74425,7 +74534,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.3.1:::
component_choice_list ::=
- component_selector_name {| component_selector_name}
+ <component_>selector_name {| <component_>selector_name}
| others
*note 4.3.2:::
@@ -74475,14 +74584,14 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.4:::
relation ::=
simple_expression [relational_operator simple_expression]
- | tested_simple_expression [not] in membership_choice_list
+ | <tested_>simple_expression [not] in membership_choice_list
| raise_expression
*note 4.4:::
membership_choice_list ::= membership_choice {| membership_choice}
*note 4.4:::
- membership_choice ::= choice_simple_expression | range |
+ membership_choice ::= <choice_>simple_expression | range |
subtype_mark
*note 4.4:::
@@ -74524,23 +74633,23 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 4.5.7:::
if_expression ::=
- if condition then dependent_expression
- {elsif condition then dependent_expression}
- [else dependent_expression]
+ if condition then <dependent_>expression
+ {elsif condition then <dependent_>expression}
+ [else <dependent_>expression]
*note 4.5.7:::
- condition ::= boolean_expression
+ condition ::= <boolean_>expression
*note 4.5.7:::
case_expression ::=
- case selecting_expression is
+ case <selecting_>expression is
case_expression_alternative {,
case_expression_alternative}
*note 4.5.7:::
case_expression_alternative ::=
when discrete_choice_list =>
- dependent_expression
+ <dependent_>expression
*note 4.5.8:::
quantified_expression ::= for quantifier
@@ -74551,7 +74660,7 @@ This Annex summarizes the complete syntax of the
language. See *note
quantifier ::= all | some
*note 4.5.8:::
- predicate ::= boolean_expression
+ predicate ::= <boolean_>expression
*note 4.6:::
type_conversion ::=
@@ -74568,7 +74677,7 @@ This Annex summarizes the complete syntax of the
language. See *note
| new [subpool_specification] qualified_expression
*note 4.8:::
- subpool_specification ::= (subpool_handle_name)
+ subpool_specification ::= (<subpool_handle_>name)
*note 5.1:::
sequence_of_statements ::= statement {statement} {label}
@@ -74597,14 +74706,14 @@ This Annex summarizes the complete syntax of the
language. See *note
null_statement ::= null;
*note 5.1:::
- label ::= <<label_statement_identifier>>
+ label ::= <<<label_>statement_identifier>>
*note 5.1:::
statement_identifier ::= direct_name
*note 5.2:::
assignment_statement ::=
- variable_name := expression;
+ <variable_>name := expression;
*note 5.3:::
if_statement ::=
@@ -74618,7 +74727,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.4:::
case_statement ::=
- case selecting_expression is
+ case <selecting_>expression is
case_statement_alternative
{case_statement_alternative}
end case;
@@ -74630,10 +74739,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.5:::
loop_statement ::=
- [loop_statement_identifier:]
+ [<loop_>statement_identifier:]
[iteration_scheme] loop
sequence_of_statements
- end loop [loop_identifier];
+ end loop [<loop_>identifier];
*note 5.5:::
iteration_scheme ::= while condition
@@ -74646,25 +74755,25 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 5.5.2:::
iterator_specification ::=
- defining_identifier in [reverse] iterator_name
+ defining_identifier in [reverse] <iterator_>name
| defining_identifier [:
- subtype_indication] of [reverse] iterable_name
+ subtype_indication] of [reverse] <iterable_>name
*note 5.6:::
block_statement ::=
- [block_statement_identifier:]
+ [<block_>statement_identifier:]
[declare
declarative_part]
begin
handled_sequence_of_statements
- end [block_identifier];
+ end [<block_>identifier];
*note 5.7:::
exit_statement ::=
- exit [loop_name] [when condition];
+ exit [<loop_>name] [when condition];
*note 5.8:::
- goto_statement ::= goto label_name;
+ goto_statement ::= goto <label_>name;
*note 6.1:::
subprogram_declaration ::=
@@ -74736,13 +74845,13 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 6.4:::
procedure_call_statement ::=
- procedure_name;
- | procedure_prefix actual_parameter_part;
+ <procedure_>name;
+ | <procedure_>prefix actual_parameter_part;
*note 6.4:::
function_call ::=
- function_name
- | function_prefix actual_parameter_part
+ <function_>name
+ | <function_>prefix actual_parameter_part
*note 6.4:::
actual_parameter_part ::=
@@ -74750,10 +74859,10 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 6.4:::
parameter_association ::=
- [formal_parameter_selector_name =>] explicit_actual_parameter
+ [<formal_parameter_>selector_name =>] explicit_actual_parameter
*note 6.4:::
- explicit_actual_parameter ::= expression | variable_name
+ explicit_actual_parameter ::= expression | <variable_>name
*note 6.5:::
simple_return_statement ::= return [expression];
@@ -74820,7 +74929,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 7.3:::
private_extension_declaration ::=
type defining_identifier [discriminant_part] is
- [abstract] [limited | synchronized] new ancestor_
+ [abstract] [limited | synchronized] new <ancestor_>
subtype_indication
[and interface_list] with private
[aspect_specification];
@@ -74832,7 +74941,7 @@ This Annex summarizes the complete syntax of the
language. See *note
use_clause ::= use_package_clause | use_type_clause
*note 8.4:::
- use_package_clause ::= use package_name {, package_name};
+ use_package_clause ::= use <package_>name {, <package_>name};
*note 8.4:::
use_type_clause ::= use [all] type subtype_mark {, subtype_mark};
@@ -74848,37 +74957,37 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 8.5.1:::
object_renaming_declaration ::=
defining_identifier : [null_exclusion]
- subtype_mark renames object_name
+ subtype_mark renames <object_>name
[aspect_specification];
- | defining_identifier : access_definition renames object_name
+ | defining_identifier : access_definition renames <object_>name
[aspect_specification];
*note 8.5.2:::
exception_renaming_declaration ::=
- defining_identifier : exception renames exception_name
+ defining_identifier : exception renames <exception_>name
[aspect_specification];
*note 8.5.3:::
package_renaming_declaration ::= package
- defining_program_unit_name renames package_name
+ defining_program_unit_name renames <package_>name
[aspect_specification];
*note 8.5.4:::
subprogram_renaming_declaration ::=
[overriding_indicator]
- subprogram_specification renames callable_entity_name
+ subprogram_specification renames <callable_entity_>name
[aspect_specification];
*note 8.5.5:::
generic_renaming_declaration ::=
generic package
- defining_program_unit_name renames generic_package_name
+ defining_program_unit_name renames <generic_package_>name
[aspect_specification];
| generic procedure
- defining_program_unit_name renames generic_procedure_name
+ defining_program_unit_name renames <generic_procedure_>name
[aspect_specification];
| generic function
- defining_program_unit_name renames generic_function_name
+ defining_program_unit_name renames <generic_function_>name
[aspect_specification];
*note 9.1:::
@@ -74900,7 +75009,7 @@ This Annex summarizes the complete syntax of the
language. See *note
{task_item}
[ private
{task_item}]
- end [task_identifier]
+ end [<task_>identifier]
*note 9.1:::
task_item ::= entry_declaration | aspect_clause
@@ -74912,7 +75021,7 @@ This Annex summarizes the complete syntax of the
language. See *note
declarative_part
begin
handled_sequence_of_statements
- end [task_identifier];
+ end [<task_>identifier];
*note 9.4:::
protected_type_declaration ::=
@@ -74933,7 +75042,7 @@ This Annex summarizes the complete syntax of the
language. See *note
{ protected_operation_declaration }
[ private
{ protected_element_declaration } ]
- end [protected_identifier]
+ end [<protected_>identifier]
*note 9.4:::
protected_operation_declaration ::= subprogram_declaration
@@ -74949,7 +75058,7 @@ This Annex summarizes the complete syntax of the
language. See *note
protected body defining_identifier
[aspect_specification] is
{ protected_operation_item }
- end [protected_identifier];
+ end [<protected_>identifier];
*note 9.4:::
protected_operation_item ::= subprogram_declaration
@@ -74971,9 +75080,9 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 9.5.2:::
accept_statement ::=
- accept entry_direct_name [(entry_index)] parameter_profile [do
+ accept <entry_>direct_name [(entry_index)] parameter_profile [do
handled_sequence_of_statements
- end [entry_identifier]];
+ end [<entry_>identifier]];
*note 9.5.2:::
entry_index ::= expression
@@ -74985,7 +75094,7 @@ This Annex summarizes the complete syntax of the
language. See *note
declarative_part
begin
handled_sequence_of_statements
- end [entry_identifier];
+ end [<entry_>identifier];
*note 9.5.2:::
entry_body_formal_part ::= [(entry_index_specification)]
@@ -74999,20 +75108,21 @@ This Annex summarizes the complete syntax of the
language. See *note
discrete_subtype_definition
*note 9.5.3:::
- entry_call_statement ::= entry_name [actual_parameter_part];
+ entry_call_statement ::= <entry_>name [actual_parameter_part];
*note 9.5.4:::
- requeue_statement ::= requeue procedure_or_entry_name [with abort];
+ requeue_statement ::= requeue <procedure_or_entry_>
+ name [with abort];
*note 9.6:::
delay_statement ::= delay_until_statement |
delay_relative_statement
*note 9.6:::
- delay_until_statement ::= delay until delay_expression;
+ delay_until_statement ::= delay until <delay_>expression;
*note 9.6:::
- delay_relative_statement ::= delay delay_expression;
+ delay_relative_statement ::= delay <delay_>expression;
*note 9.7:::
select_statement ::=
@@ -75096,7 +75206,7 @@ This Annex summarizes the complete syntax of the
language. See *note
abortable_part ::= sequence_of_statements
*note 9.8:::
- abort_statement ::= abort task_name {, task_name};
+ abort_statement ::= abort <task_>name {, <task_>name};
*note 10.1.1:::
compilation ::= {compilation_unit}
@@ -75138,12 +75248,12 @@ This Annex summarizes the complete syntax of the
language. See *note
with_clause ::= limited_with_clause | nonlimited_with_clause
*note 10.1.2:::
- limited_with_clause ::= limited [private] with library_unit_
- name {, library_unit_name};
+ limited_with_clause ::= limited [private] with <library_unit_>
+ name {, <library_unit_>name};
*note 10.1.2:::
- nonlimited_with_clause ::= [private] with library_unit_
- name {, library_unit_name};
+ nonlimited_with_clause ::= [private] with <library_unit_>
+ name {, <library_unit_>name};
*note 10.1.3:::
body_stub ::= subprogram_body_stub | package_body_stub |
@@ -75194,14 +75304,14 @@ This Annex summarizes the complete syntax of the
language. See *note
choice_parameter_specification ::= defining_identifier
*note 11.2:::
- exception_choice ::= exception_name | others
+ exception_choice ::= <exception_>name | others
*note 11.3:::
raise_statement ::= raise;
- | raise exception_name [with string_expression];
+ | raise <exception_>name [with <string_>expression];
*note 11.3:::
- raise_expression ::= raise exception_name [with string_
+ raise_expression ::= raise <exception_>name [with <string_>
simple_expression]
*note 12.1:::
@@ -75231,15 +75341,15 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.3:::
generic_instantiation ::=
package defining_program_unit_name is
- new generic_package_name [generic_actual_part]
+ new <generic_package_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
procedure defining_program_unit_name is
- new generic_procedure_name [generic_actual_part]
+ new <generic_procedure_>name [generic_actual_part]
[aspect_specification];
| [overriding_indicator]
function defining_designator is
- new generic_function_name [generic_actual_part]
+ new <generic_function_>name [generic_actual_part]
[aspect_specification];
*note 12.3:::
@@ -75248,13 +75358,13 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.3:::
generic_association ::=
- [generic_formal_parameter_selector_name =>]
+ [<generic_formal_parameter_>selector_name =>]
explicit_generic_actual_parameter
*note 12.3:::
- explicit_generic_actual_parameter ::= expression | variable_name
- | subprogram_name | entry_name | subtype_mark
- | package_instance_name
+ explicit_generic_actual_parameter ::= expression | <variable_>name
+ | <subprogram_>name | <entry_>name | subtype_mark
+ | <package_instance_>name
*note 12.4:::
formal_object_declaration ::=
@@ -75352,8 +75462,8 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.7:::
formal_package_declaration ::=
- with package defining_identifier is new generic_package_name
- formal_package_actual_part
+ with package defining_identifier is new <generic_package_>
+ name formal_package_actual_part
[aspect_specification];
*note 12.7:::
@@ -75366,7 +75476,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 12.7:::
formal_package_association ::=
generic_association
- | generic_formal_parameter_selector_name => <>
+ | <generic_formal_parameter_>selector_name => <>
*note 13.1:::
aspect_clause ::= attribute_definition_clause
@@ -75377,7 +75487,7 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 13.1:::
local_name ::= direct_name
| direct_name'attribute_designator
- | library_unit_name
+ | <library_unit_>name
*note 13.1.1:::
aspect_specification ::=
@@ -75385,7 +75495,7 @@ This Annex summarizes the complete syntax of the
language. See *note
aspect_mark [=> aspect_definition] }
*note 13.1.1:::
- aspect_mark ::= aspect_identifier['Class]
+ aspect_mark ::= <aspect_>identifier['Class]
*note 13.1.1:::
aspect_definition ::= name | expression | identifier
@@ -75397,54 +75507,54 @@ This Annex summarizes the complete syntax of the
language. See *note
*note 13.4:::
enumeration_representation_clause ::=
- for first_subtype_local_name use enumeration_aggregate;
+ for <first_subtype_>local_name use enumeration_aggregate;
*note 13.4:::
enumeration_aggregate ::= array_aggregate
*note 13.5.1:::
record_representation_clause ::=
- for first_subtype_local_name use
+ for <first_subtype_>local_name use
record [mod_clause]
{component_clause}
end record;
*note 13.5.1:::
component_clause ::=
- component_local_name at position range first_bit .. last_bit;
+ <component_>local_name at position range first_bit .. last_bit;
*note 13.5.1:::
- position ::= static_expression
+ position ::= <static_>expression
*note 13.5.1:::
- first_bit ::= static_simple_expression
+ first_bit ::= <static_>simple_expression
*note 13.5.1:::
- last_bit ::= static_simple_expression
+ last_bit ::= <static_>simple_expression
*note 13.8:::
code_statement ::= qualified_expression;
*note 13.11.3:::
- storage_pool_indicator ::= storage_pool_name | null | Standard
+ storage_pool_indicator ::= <storage_pool_>name | null | Standard
*note 13.12:::
- restriction ::= restriction_identifier
- | restriction_parameter_identifier =>
+ restriction ::= <restriction_>identifier
+ | <restriction_parameter_>identifier =>
restriction_parameter_argument
*note 13.12:::
restriction_parameter_argument ::= name | expression
*note J.3:::
- delta_constraint ::= delta static_simple_expression [
+ delta_constraint ::= delta <static_>simple_expression [
range_constraint]
*note J.7:::
at_clause ::= for direct_name use at expression;
*note J.8:::
- mod_clause ::= at mod static_expression;
+ mod_clause ::= at mod <static_>expression;
Syntax Cross Reference
@@ -75452,9 +75562,9 @@ Syntax Cross Reference
1/3
In the following syntax cross reference, each syntactic category is
followed by the subclause number where it is defined. In addition, each
-syntactic category S is followed by a list of the categories that use S
-in their definitions. For example, the first listing below shows that
-abort_statement appears in the definition of simple_statement.
+syntactic category <S> is followed by a list of the categories that use
+<S> in their definitions. For example, the first listing below shows
+that abort_statement appears in the definition of simple_statement.
abort_statement *note 9.8::
simple_statement *note 5.1::
@@ -76875,485 +76985,485 @@ This subclause lists all language-defined packages.
Ada *note A.2(2): 5456.
Address_To_Access_Conversions
- child of System *note 13.7.2(2): 5144.
+ <child of> System *note 13.7.2(2): 5144.
Arithmetic
- child of Ada.Calendar *note 9.6.1(8/2): 4173.
+ <child of> Ada.Calendar *note 9.6.1(8/2): 4173.
ASCII
- in Standard *note A.1(36.3/2): 5445.
+ <in> Standard *note A.1(36.3/2): 5445.
Assertions
- child of Ada *note 11.4.2(12/2): 4604.
+ <child of> Ada *note 11.4.2(12/2): 4604.
Asynchronous_Task_Control
- child of Ada *note D.11(3/2): 7988.
+ <child of> Ada *note D.11(3/2): 7988.
Bounded
- child of Ada.Strings *note A.4.4(3): 5843.
+ <child of> Ada.Strings *note A.4.4(3): 5843.
Bounded_IO
- child of Ada.Text_IO *note A.10.11(3/2): 6537.
- child of Ada.Wide_Text_IO *note A.11(4/3): 6561.
- child of Ada.Wide_Wide_Text_IO *note A.11(4/3): 6562.
+ <child of> Ada.Text_IO *note A.10.11(3/2): 6537.
+ <child of> Ada.Wide_Text_IO *note A.11(4/3): 6561.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(4/3): 6562.
Bounded_Priority_Queues
- child of Ada.Containers *note A.18.31(2/3): 7362.
+ <child of> Ada.Containers *note A.18.31(2/3): 7362.
Bounded_Synchronized_Queues
- child of Ada.Containers *note A.18.29(2/3): 7349.
+ <child of> Ada.Containers *note A.18.29(2/3): 7349.
C
- child of Interfaces *note B.3(4): 7432.
+ <child of> Interfaces *note B.3(4): 7432.
Calendar
- child of Ada *note 9.6(10): 4145.
+ <child of> Ada *note 9.6(10): 4145.
Characters
- child of Ada *note A.3.1(2): 5457.
+ <child of> Ada *note A.3.1(2): 5457.
COBOL
- child of Interfaces *note B.4(7): 7545.
+ <child of> Interfaces *note B.4(7): 7545.
Command_Line
- child of Ada *note A.15(3): 6626.
+ <child of> Ada *note A.15(3): 6626.
Complex_Arrays
- child of Ada.Numerics *note G.3.2(53/2): 8422.
+ <child of> Ada.Numerics *note G.3.2(53/2): 8422.
Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(9/1): 8306.
+ <child of> Ada.Numerics *note G.1.2(9/1): 8306.
Complex_Text_IO
- child of Ada *note G.1.3(9.1/2): 8324.
+ <child of> Ada *note G.1.3(9.1/2): 8324.
Complex_Types
- child of Ada.Numerics *note G.1.1(25/1): 8279.
+ <child of> Ada.Numerics *note G.1.1(25/1): 8279.
Complex_IO
- child of Ada.Text_IO *note G.1.3(3): 8314.
- child of Ada.Wide_Text_IO *note G.1.4(1): 8326.
- child of Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 8328.
+ <child of> Ada.Text_IO *note G.1.3(3): 8314.
+ <child of> Ada.Wide_Text_IO *note G.1.4(1): 8326.
+ <child of> Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 8328.
Constants
- child of Ada.Strings.Maps *note A.4.6(3/2): 5954.
+ <child of> Ada.Strings.Maps *note A.4.6(3/2): 5954.
Containers
- child of Ada *note A.18.1(3/2): 6715.
+ <child of> Ada *note A.18.1(3/2): 6715.
Conversions
- child of Ada.Characters *note A.3.4(2/2): 5729.
- child of Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6075.
+ <child of> Ada.Characters *note A.3.4(2/2): 5729.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6075.
Decimal
- child of Ada *note F.2(2): 8223.
+ <child of> Ada *note F.2(2): 8223.
Decimal_Conversions
- in Interfaces.COBOL *note B.4(31): 7579.
+ <in> Interfaces.COBOL *note B.4(31): 7579.
Decimal_IO
- in Ada.Text_IO *note A.10.1(73): 6501.
+ <in> Ada.Text_IO *note A.10.1(73): 6501.
Decimal_Output
- in Ada.Text_IO.Editing *note F.3.3(11): 8246.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8246.
Direct_IO
- child of Ada *note A.8.4(2): 6323.
+ <child of> Ada *note A.8.4(2): 6323.
Directories
- child of Ada *note A.16(3/2): 6635.
+ <child of> Ada *note A.16(3/2): 6635.
Discrete_Random
- child of Ada.Numerics *note A.5.2(17): 6160.
+ <child of> Ada.Numerics *note A.5.2(17): 6160.
Dispatching
- child of Ada *note D.2.1(1.2/3): 7769.
+ <child of> Ada *note D.2.1(1.2/3): 7769.
Dispatching_Domains
- child of System.Multiprocessors *note D.16.1(3/3): 8077.
+ <child of> System.Multiprocessors *note D.16.1(3/3): 8077.
Doubly_Linked_Lists
- child of Ada.Containers *note A.18.3(5/3): 6822.
+ <child of> Ada.Containers *note A.18.3(5/3): 6822.
Dynamic_Priorities
- child of Ada *note D.5.1(3/2): 7865.
+ <child of> Ada *note D.5.1(3/2): 7865.
EDF
- child of Ada.Dispatching *note D.2.6(9/2): 7821.
- child of Ada.Synchronous_Task_Control *note D.10(5.2/3): 7979.
+ <child of> Ada.Dispatching *note D.2.6(9/2): 7821.
+ <child of> Ada.Synchronous_Task_Control *note D.10(5.2/3): 7979.
Editing
- child of Ada.Text_IO *note F.3.3(3): 8234.
- child of Ada.Wide_Text_IO *note F.3.4(1): 8254.
- child of Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 8256.
+ <child of> Ada.Text_IO *note F.3.3(3): 8234.
+ <child of> Ada.Wide_Text_IO *note F.3.4(1): 8254.
+ <child of> Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 8256.
Elementary_Functions
- child of Ada.Numerics *note A.5.1(9/1): 6139.
+ <child of> Ada.Numerics *note A.5.1(9/1): 6139.
Enumeration_IO
- in Ada.Text_IO *note A.10.1(79): 6511.
+ <in> Ada.Text_IO *note A.10.1(79): 6511.
Environment_Variables
- child of Ada *note A.17(3/2): 6699.
+ <child of> Ada *note A.17(3/2): 6699.
Exceptions
- child of Ada *note 11.4.1(2/2): 4564.
+ <child of> Ada *note 11.4.1(2/2): 4564.
Execution_Time
- child of Ada *note D.14(3/2): 7999.
+ <child of> Ada *note D.14(3/2): 7999.
Finalization
- child of Ada *note 7.6(4/3): 3661.
+ <child of> Ada *note 7.6(4/3): 3661.
Fixed
- child of Ada.Strings *note A.4.3(5): 5807.
+ <child of> Ada.Strings *note A.4.3(5): 5807.
Fixed_IO
- in Ada.Text_IO *note A.10.1(68): 6491.
+ <in> Ada.Text_IO *note A.10.1(68): 6491.
Float_Random
- child of Ada.Numerics *note A.5.2(5): 6147.
+ <child of> Ada.Numerics *note A.5.2(5): 6147.
Float_Text_IO
- child of Ada *note A.10.9(33): 6536.
+ <child of> Ada *note A.10.9(33): 6536.
Float_Wide_Text_IO
- child of Ada *note A.11(2/2): 6557.
+ <child of> Ada *note A.11(2/2): 6557.
Float_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6560.
+ <child of> Ada *note A.11(3/2): 6560.
Float_IO
- in Ada.Text_IO *note A.10.1(63): 6481.
+ <in> Ada.Text_IO *note A.10.1(63): 6481.
Formatting
- child of Ada.Calendar *note 9.6.1(15/2): 4177.
+ <child of> Ada.Calendar *note 9.6.1(15/2): 4177.
Fortran
- child of Interfaces *note B.5(4): 7599.
+ <child of> Interfaces *note B.5(4): 7599.
Generic_Complex_Arrays
- child of Ada.Numerics *note G.3.2(2/2): 8386.
+ <child of> Ada.Numerics *note G.3.2(2/2): 8386.
Generic_Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(2/2): 8285.
+ <child of> Ada.Numerics *note G.1.2(2/2): 8285.
Generic_Complex_Types
- child of Ada.Numerics *note G.1.1(2/1): 8258.
+ <child of> Ada.Numerics *note G.1.1(2/1): 8258.
Generic_Dispatching_Constructor
- child of Ada.Tags *note 3.9(18.2/3): 2125.
+ <child of> Ada.Tags *note 3.9(18.2/3): 2125.
Generic_Elementary_Functions
- child of Ada.Numerics *note A.5.1(3): 6110.
+ <child of> Ada.Numerics *note A.5.1(3): 6110.
Generic_Bounded_Length
- in Ada.Strings.Bounded *note A.4.4(4): 5844.
+ <in> Ada.Strings.Bounded *note A.4.4(4): 5844.
Generic_Keys
- in Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7087.
- in Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7165.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7087.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7165.
Generic_Real_Arrays
- child of Ada.Numerics *note G.3.1(2/2): 8370.
+ <child of> Ada.Numerics *note G.3.1(2/2): 8370.
Generic_Sorting
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 6869.
- in Ada.Containers.Vectors *note A.18.2(75/2): 6797.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 6869.
+ <in> Ada.Containers.Vectors *note A.18.2(75/2): 6797.
Group_Budgets
- child of Ada.Execution_Time *note D.14.2(3/3): 8030.
+ <child of> Ada.Execution_Time *note D.14.2(3/3): 8030.
Handling
- child of Ada.Characters *note A.3.2(2/2): 5460.
- child of Ada.Wide_Characters *note A.3.5(3/3): 5748.
- child of Ada.Wide_Wide_Characters *note A.3.6(1/3): 5769.
+ <child of> Ada.Characters *note A.3.2(2/2): 5460.
+ <child of> Ada.Wide_Characters *note A.3.5(3/3): 5748.
+ <child of> Ada.Wide_Wide_Characters *note A.3.6(1/3): 5769.
Hashed_Maps
- child of Ada.Containers *note A.18.5(2/3): 6908.
+ <child of> Ada.Containers *note A.18.5(2/3): 6908.
Hashed_Sets
- child of Ada.Containers *note A.18.8(2/3): 7040.
+ <child of> Ada.Containers *note A.18.8(2/3): 7040.
Hierarchical_File_Names
- child of Ada.Directories *note A.16.1(3/3): 6686.
+ <child of> Ada.Directories *note A.16.1(3/3): 6686.
Indefinite_Doubly_Linked_Lists
- child of Ada.Containers *note A.18.12(2/3): 7277.
+ <child of> Ada.Containers *note A.18.12(2/3): 7277.
Indefinite_Hashed_Maps
- child of Ada.Containers *note A.18.13(2/3): 7278.
+ <child of> Ada.Containers *note A.18.13(2/3): 7278.
Indefinite_Hashed_Sets
- child of Ada.Containers *note A.18.15(2/3): 7280.
+ <child of> Ada.Containers *note A.18.15(2/3): 7280.
Indefinite_Holders
- child of Ada.Containers *note A.18.18(5/3): 7284.
+ <child of> Ada.Containers *note A.18.18(5/3): 7284.
Indefinite_Multiway_Trees
- child of Ada.Containers *note A.18.17(2/3): 7282.
+ <child of> Ada.Containers *note A.18.17(2/3): 7282.
Indefinite_Ordered_Maps
- child of Ada.Containers *note A.18.14(2/3): 7279.
+ <child of> Ada.Containers *note A.18.14(2/3): 7279.
Indefinite_Ordered_Sets
- child of Ada.Containers *note A.18.16(2/3): 7281.
+ <child of> Ada.Containers *note A.18.16(2/3): 7281.
Indefinite_Vectors
- child of Ada.Containers *note A.18.11(2/3): 7276.
+ <child of> Ada.Containers *note A.18.11(2/3): 7276.
Information
- child of Ada.Directories *note A.16(124/2): 6685.
+ <child of> Ada.Directories *note A.16(124/2): 6685.
Integer_Text_IO
- child of Ada *note A.10.8(21): 6535.
+ <child of> Ada *note A.10.8(21): 6535.
Integer_Wide_Text_IO
- child of Ada *note A.11(2/2): 6556.
+ <child of> Ada *note A.11(2/2): 6556.
Integer_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6559.
+ <child of> Ada *note A.11(3/2): 6559.
Integer_IO
- in Ada.Text_IO *note A.10.1(52): 6463.
+ <in> Ada.Text_IO *note A.10.1(52): 6463.
Interfaces *note B.2(3): 7420.
Interrupts
- child of Ada *note C.3.2(2/3): 7659.
- child of Ada.Execution_Time *note D.14.3(3/3): 8055.
+ <child of> Ada *note C.3.2(2/3): 7659.
+ <child of> Ada.Execution_Time *note D.14.3(3/3): 8055.
IO_Exceptions
- child of Ada *note A.13(3): 6613.
+ <child of> Ada *note A.13(3): 6613.
Iterator_Interfaces
- child of Ada *note 5.5.1(2/3): 3209.
+ <child of> Ada *note 5.5.1(2/3): 3209.
Latin_1
- child of Ada.Characters *note A.3.3(3): 5498.
+ <child of> Ada.Characters *note A.3.3(3): 5498.
List_Iterator_Interfaces
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 6828.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 6828.
Locales
- child of Ada *note A.19(3/3): 7370.
+ <child of> Ada *note A.19(3/3): 7370.
Machine_Code
- child of System *note 13.8(7): 5153.
+ <child of> System *note 13.8(7): 5153.
Map_Iterator_Interfaces
- in Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 6914.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 6967.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 6914.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 6967.
Maps
- child of Ada.Strings *note A.4.2(3/2): 5783.
+ <child of> Ada.Strings *note A.4.2(3/2): 5783.
Modular_IO
- in Ada.Text_IO *note A.10.1(57): 6472.
+ <in> Ada.Text_IO *note A.10.1(57): 6472.
Multiprocessors
- child of System *note D.16(3/3): 8070.
+ <child of> System *note D.16(3/3): 8070.
Multiway_Trees
- child of Ada.Containers *note A.18.10(7/3): 7201.
+ <child of> Ada.Containers *note A.18.10(7/3): 7201.
Names
- child of Ada.Interrupts *note C.3.2(12): 7670.
+ <child of> Ada.Interrupts *note C.3.2(12): 7670.
Non_Preemptive
- child of Ada.Dispatching *note D.2.4(2.2/3): 7806.
+ <child of> Ada.Dispatching *note D.2.4(2.2/3): 7806.
Numerics
- child of Ada *note A.5(3/2): 6106.
+ <child of> Ada *note A.5(3/2): 6106.
Ordered_Maps
- child of Ada.Containers *note A.18.6(2/3): 6960.
+ <child of> Ada.Containers *note A.18.6(2/3): 6960.
Ordered_Sets
- child of Ada.Containers *note A.18.9(2/3): 7112.
+ <child of> Ada.Containers *note A.18.9(2/3): 7112.
Pointers
- child of Interfaces.C *note B.3.2(4): 7518.
+ <child of> Interfaces.C *note B.3.2(4): 7518.
Real_Arrays
- child of Ada.Numerics *note G.3.1(31/2): 8382.
+ <child of> Ada.Numerics *note G.3.1(31/2): 8382.
Real_Time
- child of Ada *note D.8(3): 7941.
+ <child of> Ada *note D.8(3): 7941.
Round_Robin
- child of Ada.Dispatching *note D.2.5(4/2): 7813.
+ <child of> Ada.Dispatching *note D.2.5(4/2): 7813.
RPC
- child of System *note E.5(3): 8204.
+ <child of> System *note E.5(3): 8204.
Sequential_IO
- child of Ada *note A.8.1(2): 6298.
+ <child of> Ada *note A.8.1(2): 6298.
Set_Iterator_Interfaces
- in Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7046.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7119.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7046.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7119.
Single_Precision_Complex_Types
- in Interfaces.Fortran *note B.5(8): 7604.
+ <in> Interfaces.Fortran *note B.5(8): 7604.
Standard *note A.1(4): 5436.
Storage_Elements
- child of System *note 13.7.1(2/2): 5132.
+ <child of> System *note 13.7.1(2/2): 5132.
Storage_IO
- child of Ada *note A.9(3): 6355.
+ <child of> Ada *note A.9(3): 6355.
Storage_Pools
- child of System *note 13.11(5): 5187.
+ <child of> System *note 13.11(5): 5187.
Stream_IO
- child of Ada.Streams *note A.12.1(3/3): 6568.
+ <child of> Ada.Streams *note A.12.1(3/3): 6568.
Streams
- child of Ada *note 13.13.1(2): 5333.
+ <child of> Ada *note 13.13.1(2): 5333.
Strings
- child of Ada *note A.4.1(3): 5770.
- child of Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6081.
- child of Interfaces.C *note B.3.1(3): 7496.
+ <child of> Ada *note A.4.1(3): 5770.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6081.
+ <child of> Interfaces.C *note B.3.1(3): 7496.
Subpools
- child of System.Storage_Pools *note 13.11.4(3/3): 5256.
+ <child of> System.Storage_Pools *note 13.11.4(3/3): 5256.
Synchronized_Queue_Interfaces
- child of Ada.Containers *note A.18.27(3/3): 7336.
+ <child of> Ada.Containers *note A.18.27(3/3): 7336.
Synchronous_Barriers
- child of Ada *note D.10.1(3/3): 7984.
+ <child of> Ada *note D.10.1(3/3): 7984.
Synchronous_Task_Control
- child of Ada *note D.10(3/2): 7973.
+ <child of> Ada *note D.10(3/2): 7973.
System *note 13.7(3/2): 5105.
Tags
- child of Ada *note 3.9(6/2): 2100.
+ <child of> Ada *note 3.9(6/2): 2100.
Task_Attributes
- child of Ada *note C.7.2(2): 7728.
+ <child of> Ada *note C.7.2(2): 7728.
Task_Identification
- child of Ada *note C.7.1(2/2): 7708.
+ <child of> Ada *note C.7.1(2/2): 7708.
Task_Termination
- child of Ada *note C.7.3(2/2): 7740.
+ <child of> Ada *note C.7.3(2/2): 7740.
Text_Streams
- child of Ada.Text_IO *note A.12.2(3): 6604.
- child of Ada.Wide_Text_IO *note A.12.3(3): 6607.
- child of Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 6610.
+ <child of> Ada.Text_IO *note A.12.2(3): 6604.
+ <child of> Ada.Wide_Text_IO *note A.12.3(3): 6607.
+ <child of> Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 6610.
Text_IO
- child of Ada *note A.10.1(2): 6374.
+ <child of> Ada *note A.10.1(2): 6374.
Time_Zones
- child of Ada.Calendar *note 9.6.1(2/2): 4169.
+ <child of> Ada.Calendar *note 9.6.1(2/2): 4169.
Timers
- child of Ada.Execution_Time *note D.14.1(3/2): 8015.
+ <child of> Ada.Execution_Time *note D.14.1(3/2): 8015.
Timing_Events
- child of Ada.Real_Time *note D.15(3/2): 8058.
+ <child of> Ada.Real_Time *note D.15(3/2): 8058.
Tree_Iterator_Interfaces
- in Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7207.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7207.
Unbounded
- child of Ada.Strings *note A.4.5(3): 5902.
+ <child of> Ada.Strings *note A.4.5(3): 5902.
Unbounded_IO
- child of Ada.Text_IO *note A.10.12(3/2): 6546.
- child of Ada.Wide_Text_IO *note A.11(5/3): 6563.
- child of Ada.Wide_Wide_Text_IO *note A.11(5/3): 6564.
+ <child of> Ada.Text_IO *note A.10.12(3/2): 6546.
+ <child of> Ada.Wide_Text_IO *note A.11(5/3): 6563.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(5/3): 6564.
Unbounded_Priority_Queues
- child of Ada.Containers *note A.18.30(2/3): 7355.
+ <child of> Ada.Containers *note A.18.30(2/3): 7355.
Unbounded_Synchronized_Queues
- child of Ada.Containers *note A.18.28(2/3): 7343.
+ <child of> Ada.Containers *note A.18.28(2/3): 7343.
UTF_Encoding
- child of Ada.Strings *note A.4.11(3/3): 6064.
+ <child of> Ada.Strings *note A.4.11(3/3): 6064.
Vector_Iterator_Interfaces
- in Ada.Containers.Vectors *note A.18.2(11.2/3): 6732.
+ <in> Ada.Containers.Vectors *note A.18.2(11.2/3): 6732.
Vectors
- child of Ada.Containers *note A.18.2(6/3): 6724.
+ <child of> Ada.Containers *note A.18.2(6/3): 6724.
Wide_Bounded
- child of Ada.Strings *note A.4.7(1/3): 5970.
+ <child of> Ada.Strings *note A.4.7(1/3): 5970.
Wide_Constants
- child of Ada.Strings.Wide_Maps *note A.4.7(1/3): 5984, *note
+ <child of> Ada.Strings.Wide_Maps *note A.4.7(1/3): 5984, *note
A.4.8(28/2): 6045.
Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 5976.
+ <child of> Ada.Strings *note A.4.7(1/3): 5976.
Wide_Fixed
- child of Ada.Strings *note A.4.7(1/3): 5969.
+ <child of> Ada.Strings *note A.4.7(1/3): 5969.
Wide_Hash
- child of Ada.Strings *note A.4.7(1/3): 5972.
+ <child of> Ada.Strings *note A.4.7(1/3): 5972.
Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 5980.
+ <child of> Ada.Strings *note A.4.7(1/3): 5980.
Wide_Maps
- child of Ada.Strings *note A.4.7(3): 5985.
+ <child of> Ada.Strings *note A.4.7(3): 5985.
Wide_Text_IO
- child of Ada *note A.11(2/2): 6555.
+ <child of> Ada *note A.11(2/2): 6555.
Wide_Unbounded
- child of Ada.Strings *note A.4.7(1/3): 5971.
+ <child of> Ada.Strings *note A.4.7(1/3): 5971.
Wide_Characters
- child of Ada *note A.3.1(4/2): 5458.
+ <child of> Ada *note A.3.1(4/2): 5458.
Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6088.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6088.
Wide_Wide_Constants
- child of Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6023.
+ <child of> Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6023.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6015.
+ <child of> Ada.Strings *note A.4.8(1/3): 6015.
Wide_Wide_Hash
- child of Ada.Strings *note A.4.8(1/3): 6011.
+ <child of> Ada.Strings *note A.4.8(1/3): 6011.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6019.
+ <child of> Ada.Strings *note A.4.8(1/3): 6019.
Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6558.
+ <child of> Ada *note A.11(3/2): 6558.
Wide_Wide_Bounded
- child of Ada.Strings *note A.4.8(1/3): 6009.
+ <child of> Ada.Strings *note A.4.8(1/3): 6009.
Wide_Wide_Characters
- child of Ada *note A.3.1(6/2): 5459.
+ <child of> Ada *note A.3.1(6/2): 5459.
Wide_Wide_Fixed
- child of Ada.Strings *note A.4.8(1/3): 6008.
+ <child of> Ada.Strings *note A.4.8(1/3): 6008.
Wide_Wide_Maps
- child of Ada.Strings *note A.4.8(3/2): 6024.
+ <child of> Ada.Strings *note A.4.8(3/2): 6024.
Wide_Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6095.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6095.
Wide_Wide_Unbounded
- child of Ada.Strings *note A.4.8(1/3): 6010.
+ <child of> Ada.Strings *note A.4.8(1/3): 6010.
File: arm2012.info, Node: Q.2, Next: Q.3, Prev: Q.1, Up: Annex Q
@@ -77367,651 +77477,652 @@ This subclause lists all language-defined types and
subtypes.
Address
- in System *note 13.7(12): 5117.
+ <in> System *note 13.7(12): 5117.
Alignment
- in Ada.Strings *note A.4.1(6): 5778.
+ <in> Ada.Strings *note A.4.1(6): 5778.
Alphanumeric
- in Interfaces.COBOL *note B.4(16/3): 7557.
+ <in> Interfaces.COBOL *note B.4(16/3): 7557.
-Any_Priority subtype of Integer
- in System *note 13.7(16): 5127.
+Any_Priority <subtype of> Integer
+ <in> System *note 13.7(16): 5127.
Attribute_Handle
- in Ada.Task_Attributes *note C.7.2(3): 7729.
+ <in> Ada.Task_Attributes *note C.7.2(3): 7729.
-Barrier_Limit subtype of Positive
- in Ada.Synchronous_Barriers *note D.10.1(4/3): 7985.
+Barrier_Limit <subtype of> Positive
+ <in> Ada.Synchronous_Barriers *note D.10.1(4/3): 7985.
Binary
- in Interfaces.COBOL *note B.4(10): 7548.
+ <in> Interfaces.COBOL *note B.4(10): 7548.
Binary_Format
- in Interfaces.COBOL *note B.4(24): 7569.
+ <in> Interfaces.COBOL *note B.4(24): 7569.
Bit_Order
- in System *note 13.7(15/2): 5123.
+ <in> System *note 13.7(15/2): 5123.
Boolean
- in Standard *note A.1(5): 5437.
+ <in> Standard *note A.1(5): 5437.
Bounded_String
- in Ada.Strings.Bounded *note A.4.4(6): 5846.
+ <in> Ada.Strings.Bounded *note A.4.4(6): 5846.
-Buffer_Type subtype of Storage_Array
- in Ada.Storage_IO *note A.9(4): 6357.
+Buffer_Type <subtype of> Storage_Array
+ <in> Ada.Storage_IO *note A.9(4): 6357.
Byte
- in Interfaces.COBOL *note B.4(29/3): 7576.
+ <in> Interfaces.COBOL *note B.4(29/3): 7576.
Byte_Array
- in Interfaces.COBOL *note B.4(29/3): 7577.
+ <in> Interfaces.COBOL *note B.4(29/3): 7577.
C_float
- in Interfaces.C *note B.3(15): 7448.
+ <in> Interfaces.C *note B.3(15): 7448.
Cause_Of_Termination
- in Ada.Task_Termination *note C.7.3(3/2): 7741.
+ <in> Ada.Task_Termination *note C.7.3(3/2): 7741.
char
- in Interfaces.C *note B.3(19): 7451.
+ <in> Interfaces.C *note B.3(19): 7451.
char16_array
- in Interfaces.C *note B.3(39.5/3): 7475.
+ <in> Interfaces.C *note B.3(39.5/3): 7475.
char16_t
- in Interfaces.C *note B.3(39.2/2): 7471.
+ <in> Interfaces.C *note B.3(39.2/2): 7471.
char32_array
- in Interfaces.C *note B.3(39.14/3): 7485.
+ <in> Interfaces.C *note B.3(39.14/3): 7485.
char32_t
- in Interfaces.C *note B.3(39.11/2): 7481.
+ <in> Interfaces.C *note B.3(39.11/2): 7481.
char_array
- in Interfaces.C *note B.3(23/3): 7455.
+ <in> Interfaces.C *note B.3(23/3): 7455.
char_array_access
- in Interfaces.C.Strings *note B.3.1(4): 7497.
+ <in> Interfaces.C.Strings *note B.3.1(4): 7497.
Character
- in Standard *note A.1(35/3): 5442.
+ <in> Standard *note A.1(35/3): 5442.
Character_Mapping
- in Ada.Strings.Maps *note A.4.2(20/2): 5797.
+ <in> Ada.Strings.Maps *note A.4.2(20/2): 5797.
Character_Mapping_Function
- in Ada.Strings.Maps *note A.4.2(25): 5803.
+ <in> Ada.Strings.Maps *note A.4.2(25): 5803.
Character_Range
- in Ada.Strings.Maps *note A.4.2(6): 5786.
+ <in> Ada.Strings.Maps *note A.4.2(6): 5786.
Character_Ranges
- in Ada.Strings.Maps *note A.4.2(7): 5787.
+ <in> Ada.Strings.Maps *note A.4.2(7): 5787.
-Character_Sequence subtype of String
- in Ada.Strings.Maps *note A.4.2(16): 5793.
+Character_Sequence <subtype of> String
+ <in> Ada.Strings.Maps *note A.4.2(16): 5793.
Character_Set
- in Ada.Strings.Maps *note A.4.2(4/2): 5784.
- in Interfaces.Fortran *note B.5(11): 7609.
+ <in> Ada.Strings.Maps *note A.4.2(4/2): 5784.
+ <in> Interfaces.Fortran *note B.5(11): 7609.
chars_ptr
- in Interfaces.C.Strings *note B.3.1(5/2): 7498.
+ <in> Interfaces.C.Strings *note B.3.1(5/2): 7498.
chars_ptr_array
- in Interfaces.C.Strings *note B.3.1(6/2): 7499.
+ <in> Interfaces.C.Strings *note B.3.1(6/2): 7499.
COBOL_Character
- in Interfaces.COBOL *note B.4(13): 7554.
+ <in> Interfaces.COBOL *note B.4(13): 7554.
Complex
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 8259.
- in Interfaces.Fortran *note B.5(9): 7605.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 8259.
+ <in> Interfaces.Fortran *note B.5(9): 7605.
Complex_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8388.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8388.
Complex_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8387.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8387.
Constant_Reference_Type
- in Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7294.
- in Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7221.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7294.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7221.
Controlled
- in Ada.Finalization *note 7.6(5/2): 3662.
+ <in> Ada.Finalization *note 7.6(5/2): 3662.
Count
- in Ada.Direct_IO *note A.8.4(4): 6326.
- in Ada.Streams.Stream_IO *note A.12.1(7): 6572.
- in Ada.Text_IO *note A.10.1(5): 6377.
+ <in> Ada.Direct_IO *note A.8.4(4): 6326.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 6572.
+ <in> Ada.Text_IO *note A.10.1(5): 6377.
Count_Type
- in Ada.Containers *note A.18.1(5/2): 6717.
+ <in> Ada.Containers *note A.18.1(5/2): 6717.
Country_Code
- in Ada.Locales *note A.19(4/4): 7372.
+ <in> Ada.Locales *note A.19(4/4): 7372.
-CPU subtype of CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8073.
+CPU <subtype of> CPU_Range
+ <in> System.Multiprocessors *note D.16(4/3): 8073.
CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8071.
+ <in> System.Multiprocessors *note D.16(4/3): 8071.
CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.1/4):
-8084.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.1/4): 8084.
CPU_Time
- in Ada.Execution_Time *note D.14(4/2): 8000.
+ <in> Ada.Execution_Time *note D.14(4/2): 8000.
Cursor
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 6824.
- in Ada.Containers.Hashed_Maps *note A.18.5(4/2): 6910.
- in Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7042.
- in Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7203.
- in Ada.Containers.Ordered_Maps *note A.18.6(5/2): 6963.
- in Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7115.
- in Ada.Containers.Vectors *note A.18.2(9/2): 6728.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 6824.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(4/2): 6910.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7042.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7203.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(5/2): 6963.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7115.
+ <in> Ada.Containers.Vectors *note A.18.2(9/2): 6728.
Day_Count
- in Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4174.
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4174.
-Day_Duration subtype of Duration
- in Ada.Calendar *note 9.6(11/2): 4150.
+Day_Duration <subtype of> Duration
+ <in> Ada.Calendar *note 9.6(11/2): 4150.
Day_Name
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4178.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4178.
-Day_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4149.
+Day_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4149.
-Deadline subtype of Time
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7822.
+Deadline <subtype of> Time
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7822.
Decimal_Element
- in Interfaces.COBOL *note B.4(12/3): 7552.
+ <in> Interfaces.COBOL *note B.4(12/3): 7552.
Direction
- in Ada.Strings *note A.4.1(6): 5781.
+ <in> Ada.Strings *note A.4.1(6): 5781.
Directory_Entry_Type
- in Ada.Directories *note A.16(29/2): 6659.
+ <in> Ada.Directories *note A.16(29/2): 6659.
Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
8079.
Display_Format
- in Interfaces.COBOL *note B.4(22): 7563.
+ <in> Interfaces.COBOL *note B.4(22): 7563.
double
- in Interfaces.C *note B.3(16): 7449.
+ <in> Interfaces.C *note B.3(16): 7449.
Double_Precision
- in Interfaces.Fortran *note B.5(6): 7602.
+ <in> Interfaces.Fortran *note B.5(6): 7602.
Duration
- in Standard *note A.1(43): 5450.
+ <in> Standard *note A.1(43): 5450.
Encoding_Scheme
- in Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6065.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6065.
Exception_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4565.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4565.
Exception_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4570.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4570.
Exception_Occurrence_Access
- in Ada.Exceptions *note 11.4.1(3/2): 4571.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4571.
Exit_Status
- in Ada.Command_Line *note A.15(7): 6630.
+ <in> Ada.Command_Line *note A.15(7): 6630.
-Extended_Index subtype of Index_Type'Base
- in Ada.Containers.Vectors *note A.18.2(7/2): 6725.
+Extended_Index <subtype of> Index_Type'Base
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 6725.
-Field subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6380.
+Field <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6380.
File_Access
- in Ada.Text_IO *note A.10.1(18): 6402.
+ <in> Ada.Text_IO *note A.10.1(18): 6402.
File_Kind
- in Ada.Directories *note A.16(22/2): 6653.
+ <in> Ada.Directories *note A.16(22/2): 6653.
File_Mode
- in Ada.Direct_IO *note A.8.4(4): 6325.
- in Ada.Sequential_IO *note A.8.1(4): 6300.
- in Ada.Streams.Stream_IO *note A.12.1(6): 6571.
- in Ada.Text_IO *note A.10.1(4): 6376.
+ <in> Ada.Direct_IO *note A.8.4(4): 6325.
+ <in> Ada.Sequential_IO *note A.8.1(4): 6300.
+ <in> Ada.Streams.Stream_IO *note A.12.1(6): 6571.
+ <in> Ada.Text_IO *note A.10.1(4): 6376.
File_Size
- in Ada.Directories *note A.16(23/2): 6654.
+ <in> Ada.Directories *note A.16(23/2): 6654.
File_Type
- in Ada.Direct_IO *note A.8.4(3): 6324.
- in Ada.Sequential_IO *note A.8.1(3): 6299.
- in Ada.Streams.Stream_IO *note A.12.1(5/4): 6570.
- in Ada.Text_IO *note A.10.1(3): 6375.
+ <in> Ada.Direct_IO *note A.8.4(3): 6324.
+ <in> Ada.Sequential_IO *note A.8.1(3): 6299.
+ <in> Ada.Streams.Stream_IO *note A.12.1(5/4): 6570.
+ <in> Ada.Text_IO *note A.10.1(3): 6375.
Filter_Type
- in Ada.Directories *note A.16(30/2): 6660.
+ <in> Ada.Directories *note A.16(30/2): 6660.
Float
- in Standard *note A.1(21): 5441.
+ <in> Standard *note A.1(21): 5441.
Floating
- in Interfaces.COBOL *note B.4(9): 7546.
+ <in> Interfaces.COBOL *note B.4(9): 7546.
Fortran_Character
- in Interfaces.Fortran *note B.5(12/3): 7610.
+ <in> Interfaces.Fortran *note B.5(12/3): 7610.
Fortran_Integer
- in Interfaces.Fortran *note B.5(5): 7600.
+ <in> Interfaces.Fortran *note B.5(5): 7600.
Forward_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3210.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3210.
Generator
- in Ada.Numerics.Discrete_Random *note A.5.2(19): 6161.
- in Ada.Numerics.Float_Random *note A.5.2(7): 6148.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(19): 6161.
+ <in> Ada.Numerics.Float_Random *note A.5.2(7): 6148.
Group_Budget
- in Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8031.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8031.
Group_Budget_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8032.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8032.
Hash_Type
- in Ada.Containers *note A.18.1(4/2): 6716.
+ <in> Ada.Containers *note A.18.1(4/2): 6716.
Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7285.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7285.
-Hour_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4187.
+Hour_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4187.
Imaginary
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 8260.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 8260.
-Imaginary subtype of Imaginary
- in Interfaces.Fortran *note B.5(10): 7606.
+Imaginary <subtype of> Imaginary
+ <in> Interfaces.Fortran *note B.5(10): 7606.
int
- in Interfaces.C *note B.3(7): 7437.
+ <in> Interfaces.C *note B.3(7): 7437.
Integer
- in Standard *note A.1(12): 5438.
+ <in> Standard *note A.1(12): 5438.
Integer_Address
- in System.Storage_Elements *note 13.7.1(10/3): 5138.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5138.
Interrupt_Id
- in Ada.Interrupts *note C.3.2(2/3): 7660.
+ <in> Ada.Interrupts *note C.3.2(2/3): 7660.
-Interrupt_Priority subtype of Any_Priority
- in System *note 13.7(16): 5129.
+Interrupt_Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5129.
-ISO_646 subtype of Character
- in Ada.Characters.Handling *note A.3.2(9): 5483.
+ISO_646 <subtype of> Character
+ <in> Ada.Characters.Handling *note A.3.2(9): 5483.
Language_Code
- in Ada.Locales *note A.19(4/4): 7371.
+ <in> Ada.Locales *note A.19(4/4): 7371.
-Leap_Seconds_Count subtype of Integer
- in Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4175.
+Leap_Seconds_Count <subtype of> Integer
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4175.
-Length_Range subtype of Natural
- in Ada.Strings.Bounded *note A.4.4(8): 5848.
+Length_Range <subtype of> Natural
+ <in> Ada.Strings.Bounded *note A.4.4(8): 5848.
Limited_Controlled
- in Ada.Finalization *note 7.6(7/2): 3666.
+ <in> Ada.Finalization *note 7.6(7/2): 3666.
List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 6823.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 6823.
Logical
- in Interfaces.Fortran *note B.5(7): 7603.
+ <in> Interfaces.Fortran *note B.5(7): 7603.
long
- in Interfaces.C *note B.3(7): 7439.
+ <in> Interfaces.C *note B.3(7): 7439.
Long_Binary
- in Interfaces.COBOL *note B.4(10): 7549.
+ <in> Interfaces.COBOL *note B.4(10): 7549.
long_double
- in Interfaces.C *note B.3(17): 7450.
+ <in> Interfaces.C *note B.3(17): 7450.
Long_Floating
- in Interfaces.COBOL *note B.4(9): 7547.
+ <in> Interfaces.COBOL *note B.4(9): 7547.
Map
- in Ada.Containers.Hashed_Maps *note A.18.5(3/3): 6909.
- in Ada.Containers.Ordered_Maps *note A.18.6(4/3): 6962.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(3/3): 6909.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(4/3): 6962.
Membership
- in Ada.Strings *note A.4.1(6): 5780.
+ <in> Ada.Strings *note A.4.1(6): 5780.
-Minute_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4188.
+Minute_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4188.
-Month_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4148.
+Month_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4148.
Name
- in System *note 13.7(4): 5106.
+ <in> System *note 13.7(4): 5106.
Name_Case_Kind
- in Ada.Directories *note A.16(20.1/3): 6651.
+ <in> Ada.Directories *note A.16(20.1/3): 6651.
-Natural subtype of Integer
- in Standard *note A.1(13): 5439.
+Natural <subtype of> Integer
+ <in> Standard *note A.1(13): 5439.
-Number_Base subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6381.
+Number_Base <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6381.
Numeric
- in Interfaces.COBOL *note B.4(20/3): 7562.
+ <in> Interfaces.COBOL *note B.4(20/3): 7562.
Packed_Decimal
- in Interfaces.COBOL *note B.4(12/3): 7553.
+ <in> Interfaces.COBOL *note B.4(12/3): 7553.
Packed_Format
- in Interfaces.COBOL *note B.4(26): 7573.
+ <in> Interfaces.COBOL *note B.4(26): 7573.
Parameterless_Handler
- in Ada.Interrupts *note C.3.2(2/3): 7661.
+ <in> Ada.Interrupts *note C.3.2(2/3): 7661.
Params_Stream_Type
- in System.RPC *note E.5(6): 8207.
+ <in> System.RPC *note E.5(6): 8207.
Partition_Id
- in System.RPC *note E.5(4): 8205.
+ <in> System.RPC *note E.5(4): 8205.
Picture
- in Ada.Text_IO.Editing *note F.3.3(4): 8235.
+ <in> Ada.Text_IO.Editing *note F.3.3(4): 8235.
plain_char
- in Interfaces.C *note B.3(11): 7445.
+ <in> Interfaces.C *note B.3(11): 7445.
Pointer
- in Interfaces.C.Pointers *note B.3.2(5): 7519.
+ <in> Interfaces.C.Pointers *note B.3.2(5): 7519.
-Positive subtype of Integer
- in Standard *note A.1(13): 5440.
+Positive <subtype of> Integer
+ <in> Standard *note A.1(13): 5440.
-Positive_Count subtype of Count
- in Ada.Direct_IO *note A.8.4(4): 6327.
- in Ada.Streams.Stream_IO *note A.12.1(7): 6573.
- in Ada.Text_IO *note A.10.1(5): 6378.
+Positive_Count <subtype of> Count
+ <in> Ada.Direct_IO *note A.8.4(4): 6327.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 6573.
+ <in> Ada.Text_IO *note A.10.1(5): 6378.
-Priority subtype of Any_Priority
- in System *note 13.7(16): 5128.
+Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5128.
ptrdiff_t
- in Interfaces.C *note B.3(12): 7446.
+ <in> Interfaces.C *note B.3(12): 7446.
Queue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3): 7363.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3):
+7363.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
7350.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(4/3):
-7337.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(4/3): 7337.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
7356.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(4/3):
-7344.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(4/3): 7344.
Real
- in Interfaces.Fortran *note B.5(6): 7601.
+ <in> Interfaces.Fortran *note B.5(6): 7601.
Real_Matrix
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8372.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8372.
Real_Vector
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8371.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8371.
Reference_Type
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 6836.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 6925.
- in Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7096.
- in Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7295.
- in Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7222.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 6976.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7177.
- in Ada.Containers.Vectors *note A.18.2(34.2/3): 6751.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 6836.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 6925.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7096.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7295.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7222.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 6976.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7177.
+ <in> Ada.Containers.Vectors *note A.18.2(34.2/3): 6751.
Reversible_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3213.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3213.
Root_Storage_Pool
- in System.Storage_Pools *note 13.11(6/2): 5188.
+ <in> System.Storage_Pools *note 13.11(6/2): 5188.
Root_Storage_Pool_With_Subpools
- in System.Storage_Pools.Subpools *note 13.11.4(4/3): 5257.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(4/3): 5257.
Root_Stream_Type
- in Ada.Streams *note 13.13.1(3/2): 5335.
+ <in> Ada.Streams *note 13.13.1(3/2): 5335.
Root_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(5/3): 5258.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(5/3): 5258.
RPC_Receiver
- in System.RPC *note E.5(11): 8212.
+ <in> System.RPC *note E.5(11): 8212.
Search_Type
- in Ada.Directories *note A.16(31/2): 6661.
+ <in> Ada.Directories *note A.16(31/2): 6661.
-Second_Duration subtype of Day_Duration
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4190.
+Second_Duration <subtype of> Day_Duration
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4190.
-Second_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4189.
+Second_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4189.
Seconds_Count
- in Ada.Real_Time *note D.8(15): 7960.
+ <in> Ada.Real_Time *note D.8(15): 7960.
Set
- in Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7041.
- in Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7114.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7041.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7114.
short
- in Interfaces.C *note B.3(7): 7438.
+ <in> Interfaces.C *note B.3(7): 7438.
signed_char
- in Interfaces.C *note B.3(8): 7440.
+ <in> Interfaces.C *note B.3(8): 7440.
size_t
- in Interfaces.C *note B.3(13): 7447.
+ <in> Interfaces.C *note B.3(13): 7447.
State
- in Ada.Numerics.Discrete_Random *note A.5.2(23): 6165.
- in Ada.Numerics.Float_Random *note A.5.2(11): 6153.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(23): 6165.
+ <in> Ada.Numerics.Float_Random *note A.5.2(11): 6153.
Storage_Array
- in System.Storage_Elements *note 13.7.1(5): 5136.
+ <in> System.Storage_Elements *note 13.7.1(5): 5136.
-Storage_Count subtype of Storage_Offset
- in System.Storage_Elements *note 13.7.1(4): 5134.
+Storage_Count <subtype of> Storage_Offset
+ <in> System.Storage_Elements *note 13.7.1(4): 5134.
Storage_Element
- in System.Storage_Elements *note 13.7.1(5): 5135.
+ <in> System.Storage_Elements *note 13.7.1(5): 5135.
Storage_Offset
- in System.Storage_Elements *note 13.7.1(3): 5133.
+ <in> System.Storage_Elements *note 13.7.1(3): 5133.
Stream_Access
- in Ada.Streams.Stream_IO *note A.12.1(4): 6569.
- in Ada.Text_IO.Text_Streams *note A.12.2(3): 6605.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 6608.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 6611.
+ <in> Ada.Streams.Stream_IO *note A.12.1(4): 6569.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(3): 6605.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 6608.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 6611.
Stream_Element
- in Ada.Streams *note 13.13.1(4/1): 5336.
+ <in> Ada.Streams *note 13.13.1(4/1): 5336.
Stream_Element_Array
- in Ada.Streams *note 13.13.1(4/1): 5339.
+ <in> Ada.Streams *note 13.13.1(4/1): 5339.
-Stream_Element_Count subtype of Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5338.
+Stream_Element_Count <subtype of> Stream_Element_Offset
+ <in> Ada.Streams *note 13.13.1(4/1): 5338.
Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5337.
+ <in> Ada.Streams *note 13.13.1(4/1): 5337.
String
- in Standard *note A.1(37/3): 5447.
+ <in> Standard *note A.1(37/3): 5447.
String_Access
- in Ada.Strings.Unbounded *note A.4.5(7): 5906.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 5906.
Subpool_Handle
- in System.Storage_Pools.Subpools *note 13.11.4(6/3): 5259.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(6/3): 5259.
Suspension_Object
- in Ada.Synchronous_Task_Control *note D.10(4): 7974.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7974.
Synchronous_Barrier
- in Ada.Synchronous_Barriers *note D.10.1(5/3): 7986.
+ <in> Ada.Synchronous_Barriers *note D.10.1(5/3): 7986.
Tag
- in Ada.Tags *note 3.9(6/2): 2101.
+ <in> Ada.Tags *note 3.9(6/2): 2101.
Tag_Array
- in Ada.Tags *note 3.9(7.3/2): 2111.
+ <in> Ada.Tags *note 3.9(7.3/2): 2111.
Task_Array
- in Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8033.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8033.
Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 7709.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 7709.
Termination_Handler
- in Ada.Task_Termination *note C.7.3(4/2): 7742.
+ <in> Ada.Task_Termination *note C.7.3(4/2): 7742.
Time
- in Ada.Calendar *note 9.6(10): 4146.
- in Ada.Real_Time *note D.8(4): 7942.
+ <in> Ada.Calendar *note 9.6(10): 4146.
+ <in> Ada.Real_Time *note D.8(4): 7942.
Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4170.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4170.
Time_Span
- in Ada.Real_Time *note D.8(5): 7946.
+ <in> Ada.Real_Time *note D.8(5): 7946.
Timer
- in Ada.Execution_Time.Timers *note D.14.1(4/2): 8016.
+ <in> Ada.Execution_Time.Timers *note D.14.1(4/2): 8016.
Timer_Handler
- in Ada.Execution_Time.Timers *note D.14.1(5/2): 8017.
+ <in> Ada.Execution_Time.Timers *note D.14.1(5/2): 8017.
Timing_Event
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8059.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8059.
Timing_Event_Handler
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8060.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8060.
Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7202.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7202.
Trim_End
- in Ada.Strings *note A.4.1(6): 5782.
+ <in> Ada.Strings *note A.4.1(6): 5782.
Truncation
- in Ada.Strings *note A.4.1(6): 5779.
+ <in> Ada.Strings *note A.4.1(6): 5779.
Type_Set
- in Ada.Text_IO *note A.10.1(7): 6382.
+ <in> Ada.Text_IO *note A.10.1(7): 6382.
Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(4/2): 5903.
+ <in> Ada.Strings.Unbounded *note A.4.5(4/2): 5903.
-Uniformly_Distributed subtype of Float
- in Ada.Numerics.Float_Random *note A.5.2(8): 6149.
+Uniformly_Distributed <subtype of> Float
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6149.
unsigned
- in Interfaces.C *note B.3(9): 7441.
+ <in> Interfaces.C *note B.3(9): 7441.
unsigned_char
- in Interfaces.C *note B.3(10): 7444.
+ <in> Interfaces.C *note B.3(10): 7444.
unsigned_long
- in Interfaces.C *note B.3(9): 7443.
+ <in> Interfaces.C *note B.3(9): 7443.
unsigned_short
- in Interfaces.C *note B.3(9): 7442.
+ <in> Interfaces.C *note B.3(9): 7442.
-UTF_16_Wide_String subtype of Wide_String
- in Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6068.
+UTF_16_Wide_String <subtype of> Wide_String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6068.
-UTF_8_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6067.
+UTF_8_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6067.
-UTF_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6066.
+UTF_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6066.
Vector
- in Ada.Containers.Vectors *note A.18.2(8/3): 6727.
+ <in> Ada.Containers.Vectors *note A.18.2(8/3): 6727.
wchar_array
- in Interfaces.C *note B.3(33/3): 7465.
+ <in> Interfaces.C *note B.3(33/3): 7465.
wchar_t
- in Interfaces.C *note B.3(30/1): 7461.
+ <in> Interfaces.C *note B.3(30/1): 7461.
Wide_Character
- in Standard *note A.1(36.1/3): 5443.
+ <in> Standard *note A.1(36.1/3): 5443.
Wide_Character_Mapping
- in Ada.Strings.Wide_Maps *note A.4.7(20/2): 5999.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(20/2): 5999.
Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Maps *note A.4.7(26): 6005.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(26): 6005.
Wide_Character_Range
- in Ada.Strings.Wide_Maps *note A.4.7(6): 5988.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(6): 5988.
Wide_Character_Ranges
- in Ada.Strings.Wide_Maps *note A.4.7(7): 5989.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(7): 5989.
-Wide_Character_Sequence subtype of Wide_String
- in Ada.Strings.Wide_Maps *note A.4.7(16): 5995.
+Wide_Character_Sequence <subtype of> Wide_String
+ <in> Ada.Strings.Wide_Maps *note A.4.7(16): 5995.
Wide_Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(4/2): 5986.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(4/2): 5986.
Wide_String
- in Standard *note A.1(41/3): 5448.
+ <in> Standard *note A.1(41/3): 5448.
Wide_Wide_Character
- in Standard *note A.1(36.2/3): 5444.
+ <in> Standard *note A.1(36.2/3): 5444.
Wide_Wide_Character_Mapping
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6038.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6038.
Wide_Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6044.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6044.
Wide_Wide_Character_Range
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6027.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6027.
Wide_Wide_Character_Ranges
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6028.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6028.
-Wide_Wide_Character_Sequence subtype of Wide_Wide_String
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6034.
+Wide_Wide_Character_Sequence <subtype of> Wide_Wide_String
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6034.
Wide_Wide_Character_Set
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6025.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6025.
Wide_Wide_String
- in Standard *note A.1(42.1/3): 5449.
+ <in> Standard *note A.1(42.1/3): 5449.
-Year_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4147.
+Year_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4147.
File: arm2012.info, Node: Q.3, Next: Q.4, Prev: Q.2, Up: Annex Q
@@ -78024,1950 +78135,1992 @@ This subclause lists all language-defined
subprograms.
-Abort_Task in Ada.Task_Identification *note C.7.1(3/3): 7714.
+Abort_Task <in> Ada.Task_Identification *note C.7.1(3/3): 7714.
Activation_Is_Complete
- in Ada.Task_Identification *note C.7.1(4/3): 7717.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7717.
Actual_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7817.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7817.
Ada.Unchecked_Deallocate_Subpool
- child of Ada *note 13.11.5(3/3): 5287.
+ <child of> Ada *note 13.11.5(3/3): 5287.
Add
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8041.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8041.
Add_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8035.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8035.
-Adjust in Ada.Finalization *note 7.6(6/2): 3664.
+Adjust <in> Ada.Finalization *note 7.6(6/2): 3664.
Allocate
- in System.Storage_Pools *note 13.11(7): 5189.
- in System.Storage_Pools.Subpools *note 13.11.4(14/3): 5266.
+ <in> System.Storage_Pools *note 13.11(7): 5189.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(14/3): 5266.
Allocate_From_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(11/3): 5263.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(11/3): 5263.
Ancestor_Find
- in Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7233.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7233.
Append
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 6846.
- in Ada.Containers.Vectors *note A.18.2(46/2): 6769, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 6846.
+ <in> Ada.Containers.Vectors *note A.18.2(46/2): 6769, *note
A.18.2(47/2): 6770.
- in Ada.Strings.Bounded *note A.4.4(13): 5853, *note A.4.4(14):
+ <in> Ada.Strings.Bounded *note A.4.4(13): 5853, *note A.4.4(14):
5854, *note A.4.4(15): 5855, *note A.4.4(16): 5856, *note A.4.4(17):
5857, *note A.4.4(18): 5858, *note A.4.4(19): 5859, *note A.4.4(20):
5860.
- in Ada.Strings.Unbounded *note A.4.5(12): 5912, *note A.4.5(13):
+ <in> Ada.Strings.Unbounded *note A.4.5(12): 5912, *note A.4.5(13):
5913, *note A.4.5(14): 5914.
Append_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7245.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7245.
Arccos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8295.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6125.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6125.
Arccosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8303.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6136.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6136.
Arccot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8297.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6130.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6130.
Arccoth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8305.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6138.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6138.
Arcsin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8294.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6124.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6124.
Arcsinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8302.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6135.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6135.
Arctan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8296.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6128.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6128.
Arctanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8304.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6137.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6137.
Argument
- in Ada.Command_Line *note A.15(5): 6628.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8397,
+ <in> Ada.Command_Line *note A.15(5): 6628.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8397,
*note G.3.2(31/2): 8409.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 8273.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 8273.
-Argument_Count in Ada.Command_Line *note A.15(4): 6627.
+Argument_Count <in> Ada.Command_Line *note A.15(4): 6627.
-Assert in Ada.Assertions *note 11.4.2(14/2): 4606.
+Assert <in> Ada.Assertions *note 11.4.2(14/2): 4606.
Assign
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 6839.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 6930.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7058.
- in Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7298.
- in Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7225.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 6981.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7129.
- in Ada.Containers.Vectors *note A.18.2(34.7/3): 6756.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 6839.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 6930.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7058.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7298.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7225.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 6981.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7129.
+ <in> Ada.Containers.Vectors *note A.18.2(34.7/3): 6756.
Assign_Task
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
8088.
-Attach_Handler in Ada.Interrupts *note C.3.2(7): 7665.
+Attach_Handler <in> Ada.Interrupts *note C.3.2(7): 7665.
-Base_Name in Ada.Directories *note A.16(19/2): 6649.
+Base_Name <in> Ada.Directories *note A.16(19/2): 6649.
Blank_When_Zero
- in Ada.Text_IO.Editing *note F.3.3(7): 8239.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8239.
-Bounded_Slice in Ada.Strings.Bounded *note A.4.4(28.1/2): 5864, *note
-A.4.4(28.2/2): 5865.
+Bounded_Slice <in> Ada.Strings.Bounded *note A.4.4(28.1/2): 5864,
+*note A.4.4(28.2/2): 5865.
Budget_Has_Expired
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8042.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8042.
Budget_Remaining
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8043.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8043.
Cancel_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8046.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8022.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8064.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8046.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8022.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8064.
Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(8/2): 6915.
- in Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7049.
- in Ada.Containers.Vectors *note A.18.2(19/2): 6735.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(8/2): 6915.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7049.
+ <in> Ada.Containers.Vectors *note A.18.2(19/2): 6735.
Ceiling
- in Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7007.
- in Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7161, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7007.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7161, *note
A.18.9(71/2): 7174.
Character_Set_Version
- in Ada.Wide_Characters.Handling *note A.3.5(4/3): 5749.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(4/3): 5749.
Child_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7239.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7239.
Child_Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7240.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7240.
Clear
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 6831.
- in Ada.Containers.Hashed_Maps *note A.18.5(12/2): 6919.
- in Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7053.
- in Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7289.
- in Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7216.
- in Ada.Containers.Ordered_Maps *note A.18.6(11/2): 6970.
- in Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7124.
- in Ada.Containers.Vectors *note A.18.2(24/2): 6740.
- in Ada.Environment_Variables *note A.17(7/2): 6704.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 6831.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(12/2): 6919.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7053.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7289.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7216.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(11/2): 6970.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7124.
+ <in> Ada.Containers.Vectors *note A.18.2(24/2): 6740.
+ <in> Ada.Environment_Variables *note A.17(7/2): 6704.
Clock
- in Ada.Calendar *note 9.6(12): 4151.
- in Ada.Execution_Time *note D.14(5/2): 8005.
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8056.
- in Ada.Real_Time *note D.8(6): 7952.
+ <in> Ada.Calendar *note 9.6(12): 4151.
+ <in> Ada.Execution_Time *note D.14(5/2): 8005.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8056.
+ <in> Ada.Real_Time *note D.8(6): 7952.
Clock_For_Interrupts
- in Ada.Execution_Time *note D.14(9.3/3): 8010.
+ <in> Ada.Execution_Time *note D.14(9.3/3): 8010.
Close
- in Ada.Direct_IO *note A.8.4(8): 6330.
- in Ada.Sequential_IO *note A.8.1(8): 6303.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6576.
- in Ada.Text_IO *note A.10.1(11): 6385.
+ <in> Ada.Direct_IO *note A.8.4(8): 6330.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6303.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6576.
+ <in> Ada.Text_IO *note A.10.1(11): 6385.
-Col in Ada.Text_IO *note A.10.1(37): 6438.
+Col <in> Ada.Text_IO *note A.10.1(37): 6438.
-Command_Name in Ada.Command_Line *note A.15(6): 6629.
+Command_Name <in> Ada.Command_Line *note A.15(6): 6629.
Compose
- in Ada.Directories *note A.16(20/2): 6650.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
+ <in> Ada.Directories *note A.16(20/2): 6650.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
6697.
Compose_From_Cartesian
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 8394,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 8394,
*note G.3.2(29/2): 8406.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 8270.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 8270.
Compose_From_Polar
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 8398,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 8398,
*note G.3.2(32/2): 8411.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 8275.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 8275.
Conjugate
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 8400,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 8400,
*note G.3.2(34/2): 8413.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 8277, *note
-G.1.1(15): 8278.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 8277,
+*note G.1.1(15): 8278.
Constant_Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 6837.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 6926, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 6837.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 6926, *note
A.18.5(17.5/3): 6928.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7057, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7057, *note
A.18.8(58.3/3): 7098.
- in Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7296.
- in Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7223.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 6977, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7296.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7223.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 6977, *note
A.18.6(16.5/3): 6979.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7128, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7128, *note
A.18.9(73.3/3): 7179.
- in Ada.Containers.Vectors *note A.18.2(34.3/3): 6752, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.3/3): 6752, *note
A.18.2(34.5/3): 6754.
Containing_Directory
- in Ada.Directories *note A.16(17/2): 6647.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
+ <in> Ada.Directories *note A.16(17/2): 6647.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
6694.
Contains
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 6866.
- in Ada.Containers.Hashed_Maps *note A.18.5(32/2): 6946.
- in Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7082, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 6866.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(32/2): 6946.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7082, *note
A.18.8(57/2): 7094.
- in Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7234.
- in Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7008.
- in Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7162, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7234.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7008.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7162, *note
A.18.9(72/2): 7175.
- in Ada.Containers.Vectors *note A.18.2(71/2): 6794.
+ <in> Ada.Containers.Vectors *note A.18.2(71/2): 6794.
Continue
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 7990.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7990.
Convert
- in Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6076,
+ <in> Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6076,
*note A.4.11(17/3): 6077, *note A.4.11(18/3): 6078, *note A.4.11(19/3):
6079, *note A.4.11(20/3): 6080.
Copy
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 6840.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 6931.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7059.
- in Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7299,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 6840.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 6931.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7059.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7299,
*note A.18.20(10/3): 7311, *note A.18.21(13/3): 7315, *note
A.18.22(10/3): 7318, *note A.18.23(13/3): 7322, *note A.18.24(10/3):
7325.
- in Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7226.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 6982.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7130.
- in Ada.Containers.Vectors *note A.18.2(34.8/3): 6757.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7226.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 6982.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7130.
+ <in> Ada.Containers.Vectors *note A.18.2(34.8/3): 6757.
-Copy_Array in Interfaces.C.Pointers *note B.3.2(15): 7527.
+Copy_Array <in> Interfaces.C.Pointers *note B.3.2(15): 7527.
-Copy_File in Ada.Directories *note A.16(13/2): 6644.
+Copy_File <in> Ada.Directories *note A.16(13/2): 6644.
Copy_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7247.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7247.
Copy_Terminated_Array
- in Interfaces.C.Pointers *note B.3.2(14): 7526.
+ <in> Interfaces.C.Pointers *note B.3.2(14): 7526.
Cos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8291.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6117.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6117.
Cosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8299.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6132.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6132.
Cot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8293.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6121.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6121.
Coth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8301.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6134.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6134.
Count
- in Ada.Strings.Bounded *note A.4.4(48): 5874, *note A.4.4(49):
+ <in> Ada.Strings.Bounded *note A.4.4(48): 5874, *note A.4.4(49):
5875, *note A.4.4(50): 5876.
- in Ada.Strings.Fixed *note A.4.3(13): 5817, *note A.4.3(14): 5818,
-*note A.4.3(15): 5819.
- in Ada.Strings.Unbounded *note A.4.5(43): 5928, *note A.4.5(44):
+ <in> Ada.Strings.Fixed *note A.4.3(13): 5817, *note A.4.3(14):
+5818, *note A.4.3(15): 5819.
+ <in> Ada.Strings.Unbounded *note A.4.5(43): 5928, *note A.4.5(44):
5929, *note A.4.5(45): 5930.
-Country in Ada.Locales *note A.19(6/3): 7376.
+Country <in> Ada.Locales *note A.19(6/3): 7376.
Create
- in Ada.Direct_IO *note A.8.4(6): 6328.
- in Ada.Sequential_IO *note A.8.1(6): 6301.
- in Ada.Streams.Stream_IO *note A.12.1(8): 6574.
- in Ada.Text_IO *note A.10.1(9): 6383.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
+ <in> Ada.Direct_IO *note A.8.4(6): 6328.
+ <in> Ada.Sequential_IO *note A.8.1(6): 6301.
+ <in> Ada.Streams.Stream_IO *note A.12.1(8): 6574.
+ <in> Ada.Text_IO *note A.10.1(9): 6383.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
8081, *note D.16.1(9.2/4): 8085.
-Create_Directory in Ada.Directories *note A.16(7/2): 6638.
+Create_Directory <in> Ada.Directories *note A.16(7/2): 6638.
-Create_Path in Ada.Directories *note A.16(9/2): 6640.
+Create_Path <in> Ada.Directories *note A.16(9/2): 6640.
Create_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(7/3): 5260.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(7/3): 5260.
-Current_Directory in Ada.Directories *note A.16(5/2): 6636.
+Current_Directory <in> Ada.Directories *note A.16(5/2): 6636.
-Current_Error in Ada.Text_IO *note A.10.1(17): 6401, *note A.10.1(20):
-6408.
+Current_Error <in> Ada.Text_IO *note A.10.1(17): 6401, *note
+A.10.1(20): 6408.
Current_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8045.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8021.
- in Ada.Interrupts *note C.3.2(6): 7664.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8063.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8045.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8021.
+ <in> Ada.Interrupts *note C.3.2(6): 7664.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8063.
-Current_Input in Ada.Text_IO *note A.10.1(17): 6399, *note A.10.1(20):
-6406.
+Current_Input <in> Ada.Text_IO *note A.10.1(17): 6399, *note
+A.10.1(20): 6406.
-Current_Output in Ada.Text_IO *note A.10.1(17): 6400, *note
+Current_Output <in> Ada.Text_IO *note A.10.1(17): 6400, *note
A.10.1(20): 6407.
Current_State
- in Ada.Synchronous_Task_Control *note D.10(4): 7977.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7977.
Current_Task
- in Ada.Task_Identification *note C.7.1(3/3): 7712.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7712.
Current_Task_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 7744.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 7744.
Current_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 7367.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+7367.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
7353.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7340.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7340.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
7360.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-7347.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 7347.
Day
- in Ada.Calendar *note 9.6(13): 4154.
- in Ada.Calendar.Formatting *note 9.6.1(23/2): 4193.
+ <in> Ada.Calendar *note 9.6(13): 4154.
+ <in> Ada.Calendar.Formatting *note 9.6.1(23/2): 4193.
Day_of_Week
- in Ada.Calendar.Formatting *note 9.6.1(18/2): 4186.
+ <in> Ada.Calendar.Formatting *note 9.6.1(18/2): 4186.
Deallocate
- in System.Storage_Pools *note 13.11(8): 5190.
- in System.Storage_Pools.Subpools *note 13.11.4(15/3): 5267.
+ <in> System.Storage_Pools *note 13.11(8): 5190.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(15/3): 5267.
Deallocate_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(12/3): 5264.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(12/3): 5264.
Decode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6085, *note
-A.4.11(27/3): 6086, *note A.4.11(28/3): 6087.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3): 6092,
-*note A.4.11(35/3): 6093, *note A.4.11(36/3): 6094.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6085,
+*note A.4.11(27/3): 6086, *note A.4.11(28/3): 6087.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3):
+6092, *note A.4.11(35/3): 6093, *note A.4.11(36/3): 6094.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
6099, *note A.4.11(43/3): 6100, *note A.4.11(44/3): 6101.
-Decrement in Interfaces.C.Pointers *note B.3.2(11/3): 7524.
+Decrement <in> Interfaces.C.Pointers *note B.3.2(11/3): 7524.
Default_Modulus
- in Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7314,
+ <in> Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7314,
*note A.18.23(10/3): 7321.
Default_Subpool_for_Pool
- in System.Storage_Pools.Subpools *note 13.11.4(13/3): 5265.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(13/3): 5265.
Delay_Until_And_Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
8091.
Delay_Until_And_Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7825.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7825.
Delete
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 6847.
- in Ada.Containers.Hashed_Maps *note A.18.5(25/2): 6939, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 6847.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(25/2): 6939, *note
A.18.5(26/2): 6940.
- in Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7066, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7066, *note
A.18.8(25/2): 7067, *note A.18.8(55/2): 7092.
- in Ada.Containers.Ordered_Maps *note A.18.6(24/2): 6990, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(24/2): 6990, *note
A.18.6(25/2): 6991.
- in Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7137, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7137, *note
A.18.9(24/2): 7138, *note A.18.9(68/2): 7171.
- in Ada.Containers.Vectors *note A.18.2(50/2): 6773, *note
+ <in> Ada.Containers.Vectors *note A.18.2(50/2): 6773, *note
A.18.2(51/2): 6774.
- in Ada.Direct_IO *note A.8.4(8): 6331.
- in Ada.Sequential_IO *note A.8.1(8): 6304.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6577.
- in Ada.Strings.Bounded *note A.4.4(64): 5889, *note A.4.4(65):
+ <in> Ada.Direct_IO *note A.8.4(8): 6331.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6304.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6577.
+ <in> Ada.Strings.Bounded *note A.4.4(64): 5889, *note A.4.4(65):
5890.
- in Ada.Strings.Fixed *note A.4.3(29): 5832, *note A.4.3(30): 5833.
- in Ada.Strings.Unbounded *note A.4.5(59): 5943, *note A.4.5(60):
+ <in> Ada.Strings.Fixed *note A.4.3(29): 5832, *note A.4.3(30):
+5833.
+ <in> Ada.Strings.Unbounded *note A.4.5(59): 5943, *note A.4.5(60):
5944.
- in Ada.Text_IO *note A.10.1(11): 6386.
+ <in> Ada.Text_IO *note A.10.1(11): 6386.
Delete_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7246.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7246.
-Delete_Directory in Ada.Directories *note A.16(8/2): 6639.
+Delete_Directory <in> Ada.Directories *note A.16(8/2): 6639.
-Delete_File in Ada.Directories *note A.16(11/2): 6642.
+Delete_File <in> Ada.Directories *note A.16(11/2): 6642.
Delete_First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 6848.
- in Ada.Containers.Ordered_Maps *note A.18.6(26/2): 6992.
- in Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7139.
- in Ada.Containers.Vectors *note A.18.2(52/2): 6775.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 6848.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(26/2): 6992.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7139.
+ <in> Ada.Containers.Vectors *note A.18.2(52/2): 6775.
Delete_Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 6849.
- in Ada.Containers.Ordered_Maps *note A.18.6(27/2): 6993.
- in Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7140.
- in Ada.Containers.Vectors *note A.18.2(53/2): 6776.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 6849.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(27/2): 6993.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7140.
+ <in> Ada.Containers.Vectors *note A.18.2(53/2): 6776.
Delete_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7228.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7228.
Delete_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7229.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7229.
-Delete_Tree in Ada.Directories *note A.16(10/2): 6641.
+Delete_Tree <in> Ada.Directories *note A.16(10/2): 6641.
Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7212.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7212.
Dequeue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 7365.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+7365.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
7352.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(6/3):
-7339.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(6/3): 7339.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
7358.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-7346.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 7346.
Dequeue_Only_High_Priority
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3): 7366.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3):
+7366.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
7359.
Dereference_Error
- in Interfaces.C.Strings *note B.3.1(12): 7505.
+ <in> Interfaces.C.Strings *note B.3.1(12): 7505.
-Descendant_Tag in Ada.Tags *note 3.9(7.1/2): 2108.
+Descendant_Tag <in> Ada.Tags *note 3.9(7.1/2): 2108.
-Detach_Handler in Ada.Interrupts *note C.3.2(9): 7667.
+Detach_Handler <in> Ada.Interrupts *note C.3.2(9): 7667.
Determinant
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8418.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8378.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8418.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8378.
Difference
- in Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4176.
- in Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7072, *note
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4176.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7072, *note
A.18.8(33/2): 7073.
- in Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7145, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7145, *note
A.18.9(34/2): 7146.
-Divide in Ada.Decimal *note F.2(6/3): 8229.
+Divide <in> Ada.Decimal *note F.2(6/3): 8229.
-Do_APC in System.RPC *note E.5(10): 8211.
+Do_APC <in> System.RPC *note E.5(10): 8211.
-Do_RPC in System.RPC *note E.5(9): 8210.
+Do_RPC <in> System.RPC *note E.5(9): 8210.
Eigensystem
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 8420.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 8380.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 8420.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 8380.
Eigenvalues
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 8419.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 8379.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 8419.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 8379.
Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 6832.
- in Ada.Containers.Hashed_Maps *note A.18.5(14/2): 6921, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 6832.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(14/2): 6921, *note
A.18.5(31/2): 6945.
- in Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7054, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7054, *note
A.18.8(52/2): 7089.
- in Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7290.
- in Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7217.
- in Ada.Containers.Ordered_Maps *note A.18.6(13/2): 6972, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7290.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7217.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(13/2): 6972, *note
A.18.6(39/2): 7005.
- in Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7125, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7125, *note
A.18.9(65/2): 7168.
- in Ada.Containers.Vectors *note A.18.2(27/2): 6743, *note
+ <in> Ada.Containers.Vectors *note A.18.2(27/2): 6743, *note
A.18.2(28/2): 6744.
- in Ada.Strings.Bounded *note A.4.4(26): 5861.
- in Ada.Strings.Unbounded *note A.4.5(20): 5915.
+ <in> Ada.Strings.Bounded *note A.4.4(26): 5861.
+ <in> Ada.Strings.Unbounded *note A.4.5(20): 5915.
Encode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6082, *note
-A.4.11(24/3): 6083, *note A.4.11(25/3): 6084.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3): 6089,
-*note A.4.11(32/3): 6090, *note A.4.11(33/3): 6091.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6082,
+*note A.4.11(24/3): 6083, *note A.4.11(25/3): 6084.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3):
+6089, *note A.4.11(32/3): 6090, *note A.4.11(33/3): 6091.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
6096, *note A.4.11(40/3): 6097, *note A.4.11(41/3): 6098.
-Encoding in Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6074.
+Encoding <in> Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6074.
End_Of_File
- in Ada.Direct_IO *note A.8.4(16): 6346.
- in Ada.Sequential_IO *note A.8.1(13): 6314.
- in Ada.Streams.Stream_IO *note A.12.1(12): 6584.
- in Ada.Text_IO *note A.10.1(34): 6431.
+ <in> Ada.Direct_IO *note A.8.4(16): 6346.
+ <in> Ada.Sequential_IO *note A.8.1(13): 6314.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 6584.
+ <in> Ada.Text_IO *note A.10.1(34): 6431.
-End_Of_Line in Ada.Text_IO *note A.10.1(30): 6424.
+End_Of_Line <in> Ada.Text_IO *note A.10.1(30): 6424.
-End_Of_Page in Ada.Text_IO *note A.10.1(33): 6430.
+End_Of_Page <in> Ada.Text_IO *note A.10.1(33): 6430.
-End_Search in Ada.Directories *note A.16(33/2): 6663.
+End_Search <in> Ada.Directories *note A.16(33/2): 6663.
Enqueue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 7364.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+7364.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
7351.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(5/3):
-7338.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(5/3): 7338.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
7357.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-7345.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 7345.
Environment_Task
- in Ada.Task_Identification *note C.7.1(3/3): 7713.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7713.
Equal_Case_Insensitive
- child of Ada.Strings *note A.4.10(2/3): 6056.
- child of Ada.Strings.Bounded *note A.4.10(7/3): 6058.
- child of Ada.Strings.Fixed *note A.4.10(5/3): 6057.
- child of Ada.Strings.Unbounded *note A.4.10(10/3): 6059.
+ <child of> Ada.Strings *note A.4.10(2/3): 6056.
+ <child of> Ada.Strings.Bounded *note A.4.10(7/3): 6058.
+ <child of> Ada.Strings.Fixed *note A.4.10(5/3): 6057.
+ <child of> Ada.Strings.Unbounded *note A.4.10(10/3): 6059.
Equal_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7208.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7208.
Equivalent_Elements
- in Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7083, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7083, *note
A.18.8(47/2): 7084, *note A.18.8(48/2): 7085.
- in Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7113.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7113.
Equivalent_Keys
- in Ada.Containers.Hashed_Maps *note A.18.5(34/2): 6947, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(34/2): 6947, *note
A.18.5(35/2): 6948, *note A.18.5(36/2): 6949.
- in Ada.Containers.Ordered_Maps *note A.18.6(3/2): 6961.
- in Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7166.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(3/2): 6961.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7166.
Equivalent_Sets
- in Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7047.
- in Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7120.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7047.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7120.
-Establish_RPC_Receiver in System.RPC *note E.5(12): 8213.
+Establish_RPC_Receiver <in> System.RPC *note E.5(12): 8213.
-Exception_Identity in Ada.Exceptions *note 11.4.1(5/2): 4576.
+Exception_Identity <in> Ada.Exceptions *note 11.4.1(5/2): 4576.
Exception_Information
- in Ada.Exceptions *note 11.4.1(5/2): 4580.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 4580.
-Exception_Message in Ada.Exceptions *note 11.4.1(4/3): 4574.
+Exception_Message <in> Ada.Exceptions *note 11.4.1(4/3): 4574.
-Exception_Name in Ada.Exceptions *note 11.4.1(2/2): 4567, *note
+Exception_Name <in> Ada.Exceptions *note 11.4.1(2/2): 4567, *note
11.4.1(5/2): 4577.
-Exchange_Handler in Ada.Interrupts *note C.3.2(8): 7666.
+Exchange_Handler <in> Ada.Interrupts *note C.3.2(8): 7666.
Exclude
- in Ada.Containers.Hashed_Maps *note A.18.5(24/2): 6938.
- in Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7065, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(24/2): 6938.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7065, *note
A.18.8(54/2): 7091.
- in Ada.Containers.Ordered_Maps *note A.18.6(23/2): 6989.
- in Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7136, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(23/2): 6989.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7136, *note
A.18.9(67/2): 7170.
Exists
- in Ada.Directories *note A.16(24/2): 6655.
- in Ada.Environment_Variables *note A.17(5/2): 6702.
+ <in> Ada.Directories *note A.16(24/2): 6655.
+ <in> Ada.Environment_Variables *note A.17(5/2): 6702.
Exp
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8288.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6114.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6114.
-Expanded_Name in Ada.Tags *note 3.9(7/2): 2103.
+Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2103.
-Extension in Ada.Directories *note A.16(18/2): 6648.
+Extension <in> Ada.Directories *note A.16(18/2): 6648.
-External_Tag in Ada.Tags *note 3.9(7/2): 2106.
+External_Tag <in> Ada.Tags *note 3.9(7/2): 2106.
-Finalize in Ada.Finalization *note 7.6(6/2): 3665, *note 7.6(8/2):
+Finalize <in> Ada.Finalization *note 7.6(6/2): 3665, *note 7.6(8/2):
3668.
Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 6864.
- in Ada.Containers.Hashed_Maps *note A.18.5(30/2): 6944.
- in Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7081, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 6864.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(30/2): 6944.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7081, *note
A.18.8(56/2): 7093.
- in Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7231.
- in Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7004.
- in Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7159, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7231.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7004.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7159, *note
A.18.9(69/2): 7172.
- in Ada.Containers.Vectors *note A.18.2(68/2): 6791.
+ <in> Ada.Containers.Vectors *note A.18.2(68/2): 6791.
Find_In_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7232.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7232.
-Find_Index in Ada.Containers.Vectors *note A.18.2(67/2): 6790.
+Find_Index <in> Ada.Containers.Vectors *note A.18.2(67/2): 6790.
Find_Token
- in Ada.Strings.Bounded *note A.4.4(50.1/3): 5877, *note A.4.4(51):
-5878.
- in Ada.Strings.Fixed *note A.4.3(15.1/3): 5820, *note A.4.3(16):
+ <in> Ada.Strings.Bounded *note A.4.4(50.1/3): 5877, *note
+A.4.4(51): 5878.
+ <in> Ada.Strings.Fixed *note A.4.3(15.1/3): 5820, *note A.4.3(16):
5821.
- in Ada.Strings.Unbounded *note A.4.5(45.1/3): 5931, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(45.1/3): 5931, *note
A.4.5(46): 5932.
First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 6856.
- in Ada.Containers.Hashed_Maps *note A.18.5(27/2): 6941.
- in Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7078.
- in Ada.Containers.Ordered_Maps *note A.18.6(28/2): 6994.
- in Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7151.
- in Ada.Containers.Vectors *note A.18.2(58/2): 6781.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3211.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 6856.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(27/2): 6941.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7078.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(28/2): 6994.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7151.
+ <in> Ada.Containers.Vectors *note A.18.2(58/2): 6781.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3211.
First_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7253.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7253.
First_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7254.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7254.
First_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 6857.
- in Ada.Containers.Ordered_Maps *note A.18.6(29/2): 6995.
- in Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7152.
- in Ada.Containers.Vectors *note A.18.2(59/2): 6782.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 6857.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(29/2): 6995.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7152.
+ <in> Ada.Containers.Vectors *note A.18.2(59/2): 6782.
-First_Index in Ada.Containers.Vectors *note A.18.2(57/2): 6780.
+First_Index <in> Ada.Containers.Vectors *note A.18.2(57/2): 6780.
First_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(30/2): 6996.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(30/2): 6996.
Floor
- in Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7006.
- in Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7160, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7006.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7160, *note
A.18.9(70/2): 7173.
Flush
- in Ada.Direct_IO *note A.8.4(10.1/4): 6338.
- in Ada.Sequential_IO *note A.8.1(10.1/4): 6311.
- in Ada.Streams.Stream_IO *note A.12.1(25/1): 6594.
- in Ada.Text_IO *note A.10.1(21/1): 6410.
+ <in> Ada.Direct_IO *note A.8.4(10.1/4): 6338.
+ <in> Ada.Sequential_IO *note A.8.1(10.1/4): 6311.
+ <in> Ada.Streams.Stream_IO *note A.12.1(25/1): 6594.
+ <in> Ada.Text_IO *note A.10.1(21/1): 6410.
Form
- in Ada.Direct_IO *note A.8.4(9): 6336.
- in Ada.Sequential_IO *note A.8.1(9): 6309.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6582.
- in Ada.Text_IO *note A.10.1(12): 6391.
+ <in> Ada.Direct_IO *note A.8.4(9): 6336.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6309.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6582.
+ <in> Ada.Text_IO *note A.10.1(12): 6391.
Free
- in Ada.Strings.Unbounded *note A.4.5(7): 5907.
- in Interfaces.C.Strings *note B.3.1(11): 7504.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 5907.
+ <in> Interfaces.C.Strings *note B.3.1(11): 7504.
-Full_Name in Ada.Directories *note A.16(15/2): 6645, *note A.16(39/2):
-6667.
+Full_Name <in> Ada.Directories *note A.16(15/2): 6645, *note
+A.16(39/2): 6667.
Generic_Array_Sort
- child of Ada.Containers *note A.18.26(3/2): 7330.
+ <child of> Ada.Containers *note A.18.26(3/2): 7330.
Generic_Constrained_Array_Sort
- child of Ada.Containers *note A.18.26(7/2): 7332.
+ <child of> Ada.Containers *note A.18.26(7/2): 7332.
Generic_Sort
- child of Ada.Containers *note A.18.26(9.2/4): 7334.
+ <child of> Ada.Containers *note A.18.26(9.2/4): 7334.
Get
- in Ada.Text_IO *note A.10.1(41): 6444, *note A.10.1(47): 6453,
+ <in> Ada.Text_IO *note A.10.1(41): 6444, *note A.10.1(47): 6453,
*note A.10.1(54): 6466, *note A.10.1(55): 6470, *note A.10.1(59): 6476,
*note A.10.1(60): 6479, *note A.10.1(65): 6486, *note A.10.1(67): 6489,
*note A.10.1(70): 6496, *note A.10.1(72): 6499, *note A.10.1(75): 6506,
*note A.10.1(77): 6509, *note A.10.1(81): 6515, *note A.10.1(83): 6518.
- in Ada.Text_IO.Complex_IO *note G.1.3(6): 8319, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(6): 8319, *note G.1.3(8):
8322.
Get_CPU
- in Ada.Interrupts *note C.3.2(10.1/3): 7669.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
+ <in> Ada.Interrupts *note C.3.2(10.1/3): 7669.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
8090.
Get_CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.3/4):
-8086.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.3/4): 8086.
-Get_Deadline in Ada.Dispatching.EDF *note D.2.6(9/2): 7826.
+Get_Deadline <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7826.
Get_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
8087.
Get_First_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
8082.
-Get_Immediate in Ada.Text_IO *note A.10.1(44): 6450, *note A.10.1(45):
-6451.
+Get_Immediate <in> Ada.Text_IO *note A.10.1(44): 6450, *note
+A.10.1(45): 6451.
Get_Last_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
8083.
Get_Line
- in Ada.Text_IO *note A.10.1(49): 6458, *note A.10.1(49.1/2): 6459.
- in Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 6542, *note
+ <in> Ada.Text_IO *note A.10.1(49): 6458, *note A.10.1(49.1/2):
+6459.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 6542, *note
A.10.11(9/2): 6543, *note A.10.11(10/2): 6544, *note A.10.11(11/2):
6545.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 6551, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 6551, *note
A.10.12(9/2): 6552, *note A.10.12(10/2): 6553, *note A.10.12(11/2):
6554.
-Get_Next_Entry in Ada.Directories *note A.16(35/2): 6665.
+Get_Next_Entry <in> Ada.Directories *note A.16(35/2): 6665.
Get_Priority
- in Ada.Dynamic_Priorities *note D.5.1(5): 7867.
+ <in> Ada.Dynamic_Priorities *note D.5.1(5): 7867.
Has_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 6827.
- in Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 6913.
- in Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7045.
- in Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7206.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 6966.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7118.
- in Ada.Containers.Vectors *note A.18.2(11.1/3): 6731.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 6827.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 6913.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7045.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7206.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 6966.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7118.
+ <in> Ada.Containers.Vectors *note A.18.2(11.1/3): 6731.
Hash
- child of Ada.Strings *note A.4.9(2/3): 6049.
- child of Ada.Strings.Bounded *note A.4.9(7/3): 6050.
- child of Ada.Strings.Unbounded *note A.4.9(10/3): 6051.
+ <child of> Ada.Strings *note A.4.9(2/3): 6049.
+ <child of> Ada.Strings.Bounded *note A.4.9(7/3): 6050.
+ <child of> Ada.Strings.Unbounded *note A.4.9(10/3): 6051.
Hash_Case_Insensitive
- child of Ada.Strings *note A.4.9(11.2/3): 6052.
- child of Ada.Strings.Bounded *note A.4.9(11.7/3): 6054.
- child of Ada.Strings.Fixed *note A.4.9(11.5/3): 6053.
- child of Ada.Strings.Unbounded *note A.4.9(11.10/3): 6055.
+ <child of> Ada.Strings *note A.4.9(11.2/3): 6052.
+ <child of> Ada.Strings.Bounded *note A.4.9(11.7/3): 6054.
+ <child of> Ada.Strings.Fixed *note A.4.9(11.5/3): 6053.
+ <child of> Ada.Strings.Unbounded *note A.4.9(11.10/3): 6055.
Head
- in Ada.Strings.Bounded *note A.4.4(70): 5895, *note A.4.4(71):
+ <in> Ada.Strings.Bounded *note A.4.4(70): 5895, *note A.4.4(71):
5896.
- in Ada.Strings.Fixed *note A.4.3(35): 5838, *note A.4.3(36): 5839.
- in Ada.Strings.Unbounded *note A.4.5(65): 5949, *note A.4.5(66):
+ <in> Ada.Strings.Fixed *note A.4.3(35): 5838, *note A.4.3(36):
+5839.
+ <in> Ada.Strings.Unbounded *note A.4.5(65): 5949, *note A.4.5(66):
5950.
-Hold in Ada.Asynchronous_Task_Control *note D.11(3/2): 7989.
+Hold <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7989.
-Hour in Ada.Calendar.Formatting *note 9.6.1(24/2): 4194.
+Hour <in> Ada.Calendar.Formatting *note 9.6.1(24/2): 4194.
Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8390,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8390,
*note G.3.2(27/2): 8403.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8264.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8264.
Image
- in Ada.Calendar.Formatting *note 9.6.1(35/2): 4205, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(35/2): 4205, *note
9.6.1(37/2): 4207.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6169.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6157.
- in Ada.Task_Identification *note C.7.1(3/3): 7711.
- in Ada.Text_IO.Editing *note F.3.3(13): 8249.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6169.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6157.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7711.
+ <in> Ada.Text_IO.Editing *note F.3.3(13): 8249.
Include
- in Ada.Containers.Hashed_Maps *note A.18.5(22/2): 6936.
- in Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7063.
- in Ada.Containers.Ordered_Maps *note A.18.6(21/2): 6987.
- in Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7134.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(22/2): 6936.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7063.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(21/2): 6987.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7134.
-Increment in Interfaces.C.Pointers *note B.3.2(11/3): 7523.
+Increment <in> Interfaces.C.Pointers *note B.3.2(11/3): 7523.
Index
- in Ada.Direct_IO *note A.8.4(15): 6344.
- in Ada.Streams.Stream_IO *note A.12.1(23): 6591.
- in Ada.Strings.Bounded *note A.4.4(43.1/2): 5866, *note
+ <in> Ada.Direct_IO *note A.8.4(15): 6344.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 6591.
+ <in> Ada.Strings.Bounded *note A.4.4(43.1/2): 5866, *note
A.4.4(43.2/2): 5867, *note A.4.4(44): 5868, *note A.4.4(45): 5869, *note
A.4.4(45.1/2): 5870, *note A.4.4(46): 5871.
- in Ada.Strings.Fixed *note A.4.3(8.1/2): 5809, *note A.4.3(8.2/2):
-5810, *note A.4.3(9): 5811, *note A.4.3(10): 5812, *note A.4.3(10.1/2):
-5813, *note A.4.3(11): 5814.
- in Ada.Strings.Unbounded *note A.4.5(38.1/2): 5920, *note
+ <in> Ada.Strings.Fixed *note A.4.3(8.1/2): 5809, *note
+A.4.3(8.2/2): 5810, *note A.4.3(9): 5811, *note A.4.3(10): 5812, *note
+A.4.3(10.1/2): 5813, *note A.4.3(11): 5814.
+ <in> Ada.Strings.Unbounded *note A.4.5(38.1/2): 5920, *note
A.4.5(38.2/2): 5921, *note A.4.5(39): 5922, *note A.4.5(40): 5923, *note
A.4.5(40.1/2): 5924, *note A.4.5(41): 5925.
Index_Non_Blank
- in Ada.Strings.Bounded *note A.4.4(46.1/2): 5872, *note A.4.4(47):
-5873.
- in Ada.Strings.Fixed *note A.4.3(11.1/2): 5815, *note A.4.3(12):
+ <in> Ada.Strings.Bounded *note A.4.4(46.1/2): 5872, *note
+A.4.4(47): 5873.
+ <in> Ada.Strings.Fixed *note A.4.3(11.1/2): 5815, *note A.4.3(12):
5816.
- in Ada.Strings.Unbounded *note A.4.5(41.1/2): 5926, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(41.1/2): 5926, *note
A.4.5(42): 5927.
Initial_Directory
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
6695.
-Initialize in Ada.Finalization *note 7.6(6/2): 3663, *note 7.6(8/2):
+Initialize <in> Ada.Finalization *note 7.6(6/2): 3663, *note 7.6(8/2):
3667.
Insert
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 6842,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 6842,
*note A.18.3(20/2): 6843, *note A.18.3(21/2): 6844.
- in Ada.Containers.Hashed_Maps *note A.18.5(19/2): 6933, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(19/2): 6933, *note
A.18.5(20/2): 6934, *note A.18.5(21/2): 6935.
- in Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7061, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7061, *note
A.18.8(20/2): 7062.
- in Ada.Containers.Ordered_Maps *note A.18.6(18/2): 6984, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(18/2): 6984, *note
A.18.6(19/2): 6985, *note A.18.6(20/2): 6986.
- in Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7132, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7132, *note
A.18.9(19/2): 7133.
- in Ada.Containers.Vectors *note A.18.2(36/2): 6759, *note
+ <in> Ada.Containers.Vectors *note A.18.2(36/2): 6759, *note
A.18.2(37/2): 6760, *note A.18.2(38/2): 6761, *note A.18.2(39/2): 6762,
*note A.18.2(40/2): 6763, *note A.18.2(41/2): 6764, *note A.18.2(42/2):
6765, *note A.18.2(43/2): 6766.
- in Ada.Strings.Bounded *note A.4.4(60): 5885, *note A.4.4(61):
+ <in> Ada.Strings.Bounded *note A.4.4(60): 5885, *note A.4.4(61):
5886.
- in Ada.Strings.Fixed *note A.4.3(25): 5828, *note A.4.3(26): 5829.
- in Ada.Strings.Unbounded *note A.4.5(55): 5939, *note A.4.5(56):
+ <in> Ada.Strings.Fixed *note A.4.3(25): 5828, *note A.4.3(26):
+5829.
+ <in> Ada.Strings.Unbounded *note A.4.5(55): 5939, *note A.4.5(56):
5940.
Insert_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7241, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7241, *note
A.18.10(49/3): 7242, *note A.18.10(50/3): 7243.
Insert_Space
- in Ada.Containers.Vectors *note A.18.2(48/2): 6771, *note
+ <in> Ada.Containers.Vectors *note A.18.2(48/2): 6771, *note
A.18.2(49/2): 6772.
-Interface_Ancestor_Tags in Ada.Tags *note 3.9(7.4/2): 2112.
+Interface_Ancestor_Tags <in> Ada.Tags *note 3.9(7.4/2): 2112.
-Internal_Tag in Ada.Tags *note 3.9(7/2): 2107.
+Internal_Tag <in> Ada.Tags *note 3.9(7/2): 2107.
Intersection
- in Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7070, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7070, *note
A.18.8(30/2): 7071.
- in Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7143, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7143, *note
A.18.9(31/2): 7144.
Inverse
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8417.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8377.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8417.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8377.
Is_A_Group_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8038.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8038.
-Is_Abstract in Ada.Tags *note 3.9(7.5/3): 2113.
+Is_Abstract <in> Ada.Tags *note 3.9(7.5/3): 2113.
Is_Alphanumeric
- in Ada.Characters.Handling *note A.3.2(4/3): 5470.
- in Ada.Wide_Characters.Handling *note A.3.5(12/3): 5757.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5470.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(12/3): 5757.
-Is_Attached in Ada.Interrupts *note C.3.2(5): 7663.
+Is_Attached <in> Ada.Interrupts *note C.3.2(5): 7663.
-Is_Basic in Ada.Characters.Handling *note A.3.2(4/3): 5466.
+Is_Basic <in> Ada.Characters.Handling *note A.3.2(4/3): 5466.
Is_Callable
- in Ada.Task_Identification *note C.7.1(4/3): 7716.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7716.
Is_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 5732.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5732.
Is_Control
- in Ada.Characters.Handling *note A.3.2(4/3): 5461.
- in Ada.Wide_Characters.Handling *note A.3.5(5/3): 5750.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5461.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(5/3): 5750.
Is_Current_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3): 6690.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3):
+6690.
Is_Decimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5468.
- in Ada.Wide_Characters.Handling *note A.3.5(10/3): 5755.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5468.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(10/3): 5755.
Is_Descendant_At_Same_Level
- in Ada.Tags *note 3.9(7.1/2): 2109.
+ <in> Ada.Tags *note 3.9(7.1/2): 2109.
Is_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5467.
- in Ada.Wide_Characters.Handling *note A.3.5(9/3): 5754.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5467.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(9/3): 5754.
Is_Empty
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 6830.
- in Ada.Containers.Hashed_Maps *note A.18.5(11/2): 6918.
- in Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7052.
- in Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7288.
- in Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7209.
- in Ada.Containers.Ordered_Maps *note A.18.6(10/2): 6969.
- in Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7123.
- in Ada.Containers.Vectors *note A.18.2(23/2): 6739.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 6830.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(11/2): 6918.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7052.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7288.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7209.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(10/2): 6969.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7123.
+ <in> Ada.Containers.Vectors *note A.18.2(23/2): 6739.
Is_Full_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3): 6691.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3):
+6691.
Is_Graphic
- in Ada.Characters.Handling *note A.3.2(4/3): 5462.
- in Ada.Wide_Characters.Handling *note A.3.5(19/3): 5764.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5462.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(19/3): 5764.
Is_Held
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 7991.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7991.
Is_Hexadecimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5469.
- in Ada.Wide_Characters.Handling *note A.3.5(11/3): 5756.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5469.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(11/3): 5756.
Is_In
- in Ada.Strings.Maps *note A.4.2(13): 5791.
- in Ada.Strings.Wide_Maps *note A.4.7(13): 5993.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6032.
+ <in> Ada.Strings.Maps *note A.4.2(13): 5791.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(13): 5993.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6032.
-Is_ISO_646 in Ada.Characters.Handling *note A.3.2(10): 5485.
+Is_ISO_646 <in> Ada.Characters.Handling *note A.3.2(10): 5485.
Is_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7214.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7214.
Is_Letter
- in Ada.Characters.Handling *note A.3.2(4/3): 5463.
- in Ada.Wide_Characters.Handling *note A.3.5(6/3): 5751.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5463.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(6/3): 5751.
Is_Line_Terminator
- in Ada.Characters.Handling *note A.3.2(4/3): 5472.
- in Ada.Wide_Characters.Handling *note A.3.5(14/3): 5759.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5472.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(14/3): 5759.
Is_Lower
- in Ada.Characters.Handling *note A.3.2(4/3): 5464.
- in Ada.Wide_Characters.Handling *note A.3.5(7/3): 5752.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5464.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(7/3): 5752.
Is_Mark
- in Ada.Characters.Handling *note A.3.2(4/3): 5473.
- in Ada.Wide_Characters.Handling *note A.3.5(15/3): 5760.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5473.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(15/3): 5760.
Is_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8037.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8037.
-Is_Nul_Terminated in Interfaces.C *note B.3(24): 7456, *note B.3(35):
-7466, *note B.3(39.16/2): 7486, *note B.3(39.7/2): 7476.
+Is_Nul_Terminated <in> Interfaces.C *note B.3(24): 7456, *note
+B.3(35): 7466, *note B.3(39.16/2): 7486, *note B.3(39.7/2): 7476.
Is_Open
- in Ada.Direct_IO *note A.8.4(10): 6337.
- in Ada.Sequential_IO *note A.8.1(10): 6310.
- in Ada.Streams.Stream_IO *note A.12.1(12): 6583.
- in Ada.Text_IO *note A.10.1(13): 6392.
+ <in> Ada.Direct_IO *note A.8.4(10): 6337.
+ <in> Ada.Sequential_IO *note A.8.1(10): 6310.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 6583.
+ <in> Ada.Text_IO *note A.10.1(13): 6392.
Is_Other_Format
- in Ada.Characters.Handling *note A.3.2(4/3): 5474.
- in Ada.Wide_Characters.Handling *note A.3.5(16/3): 5761.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5474.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(16/3): 5761.
Is_Parent_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3): 6689.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3):
+6689.
Is_Punctuation_Connector
- in Ada.Characters.Handling *note A.3.2(4/3): 5475.
- in Ada.Wide_Characters.Handling *note A.3.5(17/3): 5762.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5475.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(17/3): 5762.
Is_Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3): 6692.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3):
+6692.
-Is_Reserved in Ada.Interrupts *note C.3.2(4): 7662.
+Is_Reserved <in> Ada.Interrupts *note C.3.2(4): 7662.
Is_Root
- in Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7213.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7213.
Is_Root_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3): 6688.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3):
+6688.
Is_Round_Robin
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7818.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7818.
Is_Simple_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3): 6687.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3):
+6687.
Is_Sorted
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 6870.
- in Ada.Containers.Vectors *note A.18.2(76/2): 6798.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 6870.
+ <in> Ada.Containers.Vectors *note A.18.2(76/2): 6798.
Is_Space
- in Ada.Characters.Handling *note A.3.2(4/3): 5476.
- in Ada.Wide_Characters.Handling *note A.3.5(18/3): 5763.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5476.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(18/3): 5763.
Is_Special
- in Ada.Characters.Handling *note A.3.2(4/3): 5471.
- in Ada.Wide_Characters.Handling *note A.3.5(13/3): 5758.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5471.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(13/3): 5758.
Is_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 5731.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5731.
Is_Subset
- in Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7077.
- in Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7150.
- in Ada.Strings.Maps *note A.4.2(14): 5792.
- in Ada.Strings.Wide_Maps *note A.4.7(14): 5994.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6033.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7077.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7150.
+ <in> Ada.Strings.Maps *note A.4.2(14): 5792.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(14): 5994.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6033.
Is_Terminated
- in Ada.Task_Identification *note C.7.1(4/3): 7715.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7715.
Is_Upper
- in Ada.Characters.Handling *note A.3.2(4/3): 5465.
- in Ada.Wide_Characters.Handling *note A.3.5(8/3): 5753.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5465.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(8/3): 5753.
Is_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 5734.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5734.
Is_Wide_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 5735.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5735.
Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 6867.
- in Ada.Containers.Hashed_Maps *note A.18.5(37/2): 6950.
- in Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7086.
- in Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7235, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 6867.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(37/2): 6950.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7086.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7235, *note
A.18.10(44/3): 7237.
- in Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7009.
- in Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7163.
- in Ada.Containers.Vectors *note A.18.2(73/2): 6795.
- in Ada.Environment_Variables *note A.17(8/3): 6706.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7009.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7163.
+ <in> Ada.Containers.Vectors *note A.18.2(73/2): 6795.
+ <in> Ada.Environment_Variables *note A.17(8/3): 6706.
Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7261, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7261, *note
A.18.10(70/3): 7263.
Iterate_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7236, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7236, *note
A.18.10(45/3): 7238.
Key
- in Ada.Containers.Hashed_Maps *note A.18.5(13/2): 6920.
- in Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7088.
- in Ada.Containers.Ordered_Maps *note A.18.6(12/2): 6971.
- in Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7167.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(13/2): 6920.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7088.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(12/2): 6971.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7167.
-Kind in Ada.Directories *note A.16(25/2): 6656, *note A.16(40/2):
+Kind <in> Ada.Directories *note A.16(25/2): 6656, *note A.16(40/2):
6668.
-Language in Ada.Locales *note A.19(6/3): 7375.
+Language <in> Ada.Locales *note A.19(6/3): 7375.
Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 6858.
- in Ada.Containers.Ordered_Maps *note A.18.6(31/2): 6997.
- in Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7153.
- in Ada.Containers.Vectors *note A.18.2(61/2): 6784.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3214.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 6858.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(31/2): 6997.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7153.
+ <in> Ada.Containers.Vectors *note A.18.2(61/2): 6784.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3214.
Last_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7255.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7255.
Last_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7256.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7256.
Last_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 6859.
- in Ada.Containers.Ordered_Maps *note A.18.6(32/2): 6998.
- in Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7154.
- in Ada.Containers.Vectors *note A.18.2(62/2): 6785.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 6859.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(32/2): 6998.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7154.
+ <in> Ada.Containers.Vectors *note A.18.2(62/2): 6785.
-Last_Index in Ada.Containers.Vectors *note A.18.2(60/2): 6783.
+Last_Index <in> Ada.Containers.Vectors *note A.18.2(60/2): 6783.
Last_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(33/2): 6999.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(33/2): 6999.
Length
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 6829.
- in Ada.Containers.Hashed_Maps *note A.18.5(10/2): 6917.
- in Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7051.
- in Ada.Containers.Ordered_Maps *note A.18.6(9/2): 6968.
- in Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7122.
- in Ada.Containers.Vectors *note A.18.2(21/2): 6737.
- in Ada.Strings.Bounded *note A.4.4(9): 5849.
- in Ada.Strings.Unbounded *note A.4.5(6): 5905.
- in Ada.Text_IO.Editing *note F.3.3(11): 8247.
- in Interfaces.COBOL *note B.4(34): 7581, *note B.4(39): 7585, *note
-B.4(44): 7589.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 6829.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(10/2): 6917.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7051.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(9/2): 6968.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7122.
+ <in> Ada.Containers.Vectors *note A.18.2(21/2): 6737.
+ <in> Ada.Strings.Bounded *note A.4.4(9): 5849.
+ <in> Ada.Strings.Unbounded *note A.4.5(6): 5905.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8247.
+ <in> Interfaces.COBOL *note B.4(34): 7581, *note B.4(39): 7585,
+*note B.4(44): 7589.
Less_Case_Insensitive
- child of Ada.Strings *note A.4.10(13/3): 6060.
- child of Ada.Strings.Bounded *note A.4.10(18/3): 6062.
- child of Ada.Strings.Fixed *note A.4.10(16/3): 6061.
- child of Ada.Strings.Unbounded *note A.4.10(21/3): 6063.
+ <child of> Ada.Strings *note A.4.10(13/3): 6060.
+ <child of> Ada.Strings.Bounded *note A.4.10(18/3): 6062.
+ <child of> Ada.Strings.Fixed *note A.4.10(16/3): 6061.
+ <child of> Ada.Strings.Unbounded *note A.4.10(21/3): 6063.
-Line in Ada.Text_IO *note A.10.1(38): 6440.
+Line <in> Ada.Text_IO *note A.10.1(38): 6440.
-Line_Length in Ada.Text_IO *note A.10.1(25): 6415.
+Line_Length <in> Ada.Text_IO *note A.10.1(25): 6415.
Log
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8287.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6113.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6113.
-Look_Ahead in Ada.Text_IO *note A.10.1(43): 6448.
+Look_Ahead <in> Ada.Text_IO *note A.10.1(43): 6448.
Members
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8039.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8039.
Merge
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 6872.
- in Ada.Containers.Vectors *note A.18.2(78/2): 6800.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 6872.
+ <in> Ada.Containers.Vectors *note A.18.2(78/2): 6800.
-Microseconds in Ada.Real_Time *note D.8(14/2): 7956.
+Microseconds <in> Ada.Real_Time *note D.8(14/2): 7956.
-Milliseconds in Ada.Real_Time *note D.8(14/2): 7957.
+Milliseconds <in> Ada.Real_Time *note D.8(14/2): 7957.
-Minute in Ada.Calendar.Formatting *note 9.6.1(25/2): 4195.
+Minute <in> Ada.Calendar.Formatting *note 9.6.1(25/2): 4195.
-Minutes in Ada.Real_Time *note D.8(14/2): 7959.
+Minutes <in> Ada.Real_Time *note D.8(14/2): 7959.
Mode
- in Ada.Direct_IO *note A.8.4(9): 6334.
- in Ada.Sequential_IO *note A.8.1(9): 6307.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6580.
- in Ada.Text_IO *note A.10.1(12): 6389.
+ <in> Ada.Direct_IO *note A.8.4(9): 6334.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6307.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6580.
+ <in> Ada.Text_IO *note A.10.1(12): 6389.
-Modification_Time in Ada.Directories *note A.16(27/2): 6658, *note
+Modification_Time <in> Ada.Directories *note A.16(27/2): 6658, *note
A.16(42/2): 6670.
Modulus
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8395,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8395,
*note G.3.2(30/2): 8408.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 8272.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 8272.
Month
- in Ada.Calendar *note 9.6(13): 4153.
- in Ada.Calendar.Formatting *note 9.6.1(22/2): 4192.
+ <in> Ada.Calendar *note 9.6(13): 4153.
+ <in> Ada.Calendar.Formatting *note 9.6.1(22/2): 4192.
-More_Entries in Ada.Directories *note A.16(34/2): 6664.
+More_Entries <in> Ada.Directories *note A.16(34/2): 6664.
Move
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 6841.
- in Ada.Containers.Hashed_Maps *note A.18.5(18/2): 6932.
- in Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7060.
- in Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7300.
- in Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7227.
- in Ada.Containers.Ordered_Maps *note A.18.6(17/2): 6983.
- in Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7131.
- in Ada.Containers.Vectors *note A.18.2(35/2): 6758.
- in Ada.Strings.Fixed *note A.4.3(7): 5808.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 6841.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(18/2): 6932.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7060.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7300.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7227.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(17/2): 6983.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7131.
+ <in> Ada.Containers.Vectors *note A.18.2(35/2): 6758.
+ <in> Ada.Strings.Fixed *note A.4.3(7): 5808.
Name
- in Ada.Direct_IO *note A.8.4(9): 6335.
- in Ada.Sequential_IO *note A.8.1(9): 6308.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6581.
- in Ada.Text_IO *note A.10.1(12): 6390.
+ <in> Ada.Direct_IO *note A.8.4(9): 6335.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6308.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6581.
+ <in> Ada.Text_IO *note A.10.1(12): 6390.
Name_Case_Equivalence
- in Ada.Directories *note A.16(20.2/3): 6652.
+ <in> Ada.Directories *note A.16(20.2/3): 6652.
-Nanoseconds in Ada.Real_Time *note D.8(14/2): 7955.
+Nanoseconds <in> Ada.Real_Time *note D.8(14/2): 7955.
New_Char_Array
- in Interfaces.C.Strings *note B.3.1(9): 7502.
+ <in> Interfaces.C.Strings *note B.3.1(9): 7502.
-New_Line in Ada.Text_IO *note A.10.1(28): 6420.
+New_Line <in> Ada.Text_IO *note A.10.1(28): 6420.
-New_Page in Ada.Text_IO *note A.10.1(31): 6426.
+New_Page <in> Ada.Text_IO *note A.10.1(31): 6426.
-New_String in Interfaces.C.Strings *note B.3.1(10): 7503.
+New_String <in> Interfaces.C.Strings *note B.3.1(10): 7503.
Next
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 6860,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 6860,
*note A.18.3(39/2): 6862.
- in Ada.Containers.Hashed_Maps *note A.18.5(28/2): 6942, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(28/2): 6942, *note
A.18.5(29/2): 6943.
- in Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7079, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7079, *note
A.18.8(42/2): 7080.
- in Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7000, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7000, *note
A.18.6(35/2): 7001.
- in Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7155, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7155, *note
A.18.9(46/2): 7156.
- in Ada.Containers.Vectors *note A.18.2(63/2): 6786, *note
+ <in> Ada.Containers.Vectors *note A.18.2(63/2): 6786, *note
A.18.2(64/2): 6787.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3212.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3212.
Next_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7257, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7257, *note
A.18.10(66/3): 7259.
Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7210.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7210.
Null_Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 7710.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 7710.
Number_Of_CPUs
- in System.Multiprocessors *note D.16(5/3): 8074.
+ <in> System.Multiprocessors *note D.16(5/3): 8074.
Open
- in Ada.Direct_IO *note A.8.4(7): 6329.
- in Ada.Sequential_IO *note A.8.1(7): 6302.
- in Ada.Streams.Stream_IO *note A.12.1(9): 6575.
- in Ada.Text_IO *note A.10.1(10): 6384.
+ <in> Ada.Direct_IO *note A.8.4(7): 6329.
+ <in> Ada.Sequential_IO *note A.8.1(7): 6302.
+ <in> Ada.Streams.Stream_IO *note A.12.1(9): 6575.
+ <in> Ada.Text_IO *note A.10.1(10): 6384.
Overlap
- in Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7076.
- in Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7149.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7076.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7149.
Overwrite
- in Ada.Strings.Bounded *note A.4.4(62): 5887, *note A.4.4(63):
+ <in> Ada.Strings.Bounded *note A.4.4(62): 5887, *note A.4.4(63):
5888.
- in Ada.Strings.Fixed *note A.4.3(27): 5830, *note A.4.3(28): 5831.
- in Ada.Strings.Unbounded *note A.4.5(57): 5941, *note A.4.5(58):
+ <in> Ada.Strings.Fixed *note A.4.3(27): 5830, *note A.4.3(28):
+5831.
+ <in> Ada.Strings.Unbounded *note A.4.5(57): 5941, *note A.4.5(58):
5942.
-Page in Ada.Text_IO *note A.10.1(39): 6441.
+Page <in> Ada.Text_IO *note A.10.1(39): 6441.
-Page_Length in Ada.Text_IO *note A.10.1(26): 6417.
+Page_Length <in> Ada.Text_IO *note A.10.1(26): 6417.
Parent
- in Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7252.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7252.
-Parent_Tag in Ada.Tags *note 3.9(7.2/2): 2110.
+Parent_Tag <in> Ada.Tags *note 3.9(7.2/2): 2110.
Peak_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 7368.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+7368.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
7354.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7341.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7341.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
7361.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-7348.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 7348.
-Pic_String in Ada.Text_IO.Editing *note F.3.3(7): 8238.
+Pic_String <in> Ada.Text_IO.Editing *note F.3.3(7): 8238.
Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(9/3): 5261.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(9/3): 5261.
Prepend
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 6845.
- in Ada.Containers.Vectors *note A.18.2(44/2): 6767, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 6845.
+ <in> Ada.Containers.Vectors *note A.18.2(44/2): 6767, *note
A.18.2(45/2): 6768.
Prepend_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7244.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7244.
Previous
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 6861,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 6861,
*note A.18.3(40/2): 6863.
- in Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7002, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7002, *note
A.18.6(37/2): 7003.
- in Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7157, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7157, *note
A.18.9(48/2): 7158.
- in Ada.Containers.Vectors *note A.18.2(65/2): 6788, *note
+ <in> Ada.Containers.Vectors *note A.18.2(65/2): 6788, *note
A.18.2(66/2): 6789.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3215.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3215.
Previous_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7258, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7258, *note
A.18.10(67/3): 7260.
Put
- in Ada.Text_IO *note A.10.1(42): 6446, *note A.10.1(48): 6456,
+ <in> Ada.Text_IO *note A.10.1(42): 6446, *note A.10.1(48): 6456,
*note A.10.1(55): 6471, *note A.10.1(60): 6478, *note A.10.1(66): 6487,
*note A.10.1(67): 6490, *note A.10.1(71): 6498, *note A.10.1(72): 6500,
*note A.10.1(76): 6507, *note A.10.1(77): 6510, *note A.10.1(82): 6516,
*note A.10.1(83): 6519.
- in Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 6538, *note
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 6538, *note
A.10.11(5/2): 6539.
- in Ada.Text_IO.Complex_IO *note G.1.3(7): 8321, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(7): 8321, *note G.1.3(8):
8323.
- in Ada.Text_IO.Editing *note F.3.3(14): 8250, *note F.3.3(15):
+ <in> Ada.Text_IO.Editing *note F.3.3(14): 8250, *note F.3.3(15):
8251, *note F.3.3(16): 8252.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 6547, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 6547, *note
A.10.12(5/2): 6548.
Put_Line
- in Ada.Text_IO *note A.10.1(50): 6462.
- in Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 6540, *note
+ <in> Ada.Text_IO *note A.10.1(50): 6462.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 6540, *note
A.10.11(7/2): 6541.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 6549, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 6549, *note
A.10.12(7/2): 6550.
Query_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 6834.
- in Ada.Containers.Hashed_Maps *note A.18.5(16/2): 6923.
- in Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7056.
- in Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7292.
- in Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7219.
- in Ada.Containers.Ordered_Maps *note A.18.6(15/2): 6974.
- in Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7127.
- in Ada.Containers.Vectors *note A.18.2(31/2): 6747, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 6834.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(16/2): 6923.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7056.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7292.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7219.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(15/2): 6974.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7127.
+ <in> Ada.Containers.Vectors *note A.18.2(31/2): 6747, *note
A.18.2(32/2): 6748.
-Raise_Exception in Ada.Exceptions *note 11.4.1(4/3): 4573.
+Raise_Exception <in> Ada.Exceptions *note 11.4.1(4/3): 4573.
Random
- in Ada.Numerics.Discrete_Random *note A.5.2(20): 6162.
- in Ada.Numerics.Float_Random *note A.5.2(8): 6150.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(20): 6162.
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6150.
Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8389,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8389,
*note G.3.2(27/2): 8402.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8263.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8263.
Read
- in Ada.Direct_IO *note A.8.4(12): 6339.
- in Ada.Sequential_IO *note A.8.1(12): 6312.
- in Ada.Storage_IO *note A.9(6): 6358.
- in Ada.Streams *note 13.13.1(5): 5340.
- in Ada.Streams.Stream_IO *note A.12.1(15): 6586, *note A.12.1(16):
-6587.
- in System.RPC *note E.5(7): 8208.
+ <in> Ada.Direct_IO *note A.8.4(12): 6339.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6312.
+ <in> Ada.Storage_IO *note A.9(6): 6358.
+ <in> Ada.Streams *note 13.13.1(5): 5340.
+ <in> Ada.Streams.Stream_IO *note A.12.1(15): 6586, *note
+A.12.1(16): 6587.
+ <in> System.RPC *note E.5(7): 8208.
Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 6838.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 6927, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 6838.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 6927, *note
A.18.5(17.6/3): 6929.
- in Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7297.
- in Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7224.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 6978, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7297.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7224.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 6978, *note
A.18.6(16.6/3): 6980.
- in Ada.Containers.Vectors *note A.18.2(34.4/3): 6753, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.4/3): 6753, *note
A.18.2(34.6/3): 6755.
- in Ada.Interrupts *note C.3.2(10): 7668.
- in Ada.Task_Attributes *note C.7.2(5): 7731.
+ <in> Ada.Interrupts *note C.3.2(10): 7668.
+ <in> Ada.Task_Attributes *note C.7.2(5): 7731.
Reference_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7097, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7097, *note
A.18.8(58.4/3): 7099.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7178, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7178, *note
A.18.9(73.4/3): 7180.
-Reinitialize in Ada.Task_Attributes *note C.7.2(6): 7733.
+Reinitialize <in> Ada.Task_Attributes *note C.7.2(6): 7733.
Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
6696.
Remove_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8036.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8036.
-Rename in Ada.Directories *note A.16(12/2): 6643.
+Rename <in> Ada.Directories *note A.16(12/2): 6643.
Replace
- in Ada.Containers.Hashed_Maps *note A.18.5(23/2): 6937.
- in Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7064, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(23/2): 6937.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7064, *note
A.18.8(53/2): 7090.
- in Ada.Containers.Ordered_Maps *note A.18.6(22/2): 6988.
- in Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7135, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(22/2): 6988.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7135, *note
A.18.9(66/2): 7169.
Replace_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 6833.
- in Ada.Containers.Hashed_Maps *note A.18.5(15/2): 6922.
- in Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7055.
- in Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7291.
- in Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7218.
- in Ada.Containers.Ordered_Maps *note A.18.6(14/2): 6973.
- in Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7126.
- in Ada.Containers.Vectors *note A.18.2(29/2): 6745, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 6833.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(15/2): 6922.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7055.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7291.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7218.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(14/2): 6973.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7126.
+ <in> Ada.Containers.Vectors *note A.18.2(29/2): 6745, *note
A.18.2(30/2): 6746.
- in Ada.Strings.Bounded *note A.4.4(27): 5862.
- in Ada.Strings.Unbounded *note A.4.5(21): 5916.
+ <in> Ada.Strings.Bounded *note A.4.4(27): 5862.
+ <in> Ada.Strings.Unbounded *note A.4.5(21): 5916.
Replace_Slice
- in Ada.Strings.Bounded *note A.4.4(58): 5883, *note A.4.4(59):
+ <in> Ada.Strings.Bounded *note A.4.4(58): 5883, *note A.4.4(59):
5884.
- in Ada.Strings.Fixed *note A.4.3(23): 5826, *note A.4.3(24): 5827.
- in Ada.Strings.Unbounded *note A.4.5(53): 5937, *note A.4.5(54):
+ <in> Ada.Strings.Fixed *note A.4.3(23): 5826, *note A.4.3(24):
+5827.
+ <in> Ada.Strings.Unbounded *note A.4.5(53): 5937, *note A.4.5(54):
5938.
Replenish
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8040.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8040.
-Replicate in Ada.Strings.Bounded *note A.4.4(78): 5899, *note
+Replicate <in> Ada.Strings.Bounded *note A.4.4(78): 5899, *note
A.4.4(79): 5900, *note A.4.4(80): 5901.
-Reraise_Occurrence in Ada.Exceptions *note 11.4.1(4/3): 4575.
+Reraise_Occurrence <in> Ada.Exceptions *note 11.4.1(4/3): 4575.
Reserve_Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(9/2): 6916.
- in Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7050.
- in Ada.Containers.Vectors *note A.18.2(20/2): 6736.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(9/2): 6916.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7050.
+ <in> Ada.Containers.Vectors *note A.18.2(20/2): 6736.
Reset
- in Ada.Direct_IO *note A.8.4(8): 6333.
- in Ada.Numerics.Discrete_Random *note A.5.2(21): 6164, *note
+ <in> Ada.Direct_IO *note A.8.4(8): 6333.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(21): 6164, *note
A.5.2(24): 6167.
- in Ada.Numerics.Float_Random *note A.5.2(9): 6151, *note A.5.2(12):
-6155.
- in Ada.Sequential_IO *note A.8.1(8): 6306.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6578.
- in Ada.Text_IO *note A.10.1(11): 6388.
+ <in> Ada.Numerics.Float_Random *note A.5.2(9): 6151, *note
+A.5.2(12): 6155.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6306.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6578.
+ <in> Ada.Text_IO *note A.10.1(11): 6388.
Reverse_Elements
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 6850.
- in Ada.Containers.Vectors *note A.18.2(54/2): 6777.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 6850.
+ <in> Ada.Containers.Vectors *note A.18.2(54/2): 6777.
Reverse_Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 6865.
- in Ada.Containers.Vectors *note A.18.2(70/2): 6793.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 6865.
+ <in> Ada.Containers.Vectors *note A.18.2(70/2): 6793.
Reverse_Find_Index
- in Ada.Containers.Vectors *note A.18.2(69/2): 6792.
+ <in> Ada.Containers.Vectors *note A.18.2(69/2): 6792.
Reverse_Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 6868.
- in Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7010.
- in Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7164.
- in Ada.Containers.Vectors *note A.18.2(74/2): 6796.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 6868.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7010.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7164.
+ <in> Ada.Containers.Vectors *note A.18.2(74/2): 6796.
Reverse_Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7262.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7262.
-Root in Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7215.
+Root <in> Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7215.
Save
- in Ada.Numerics.Discrete_Random *note A.5.2(24): 6166.
- in Ada.Numerics.Float_Random *note A.5.2(12): 6154.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(24): 6166.
+ <in> Ada.Numerics.Float_Random *note A.5.2(12): 6154.
-Save_Occurrence in Ada.Exceptions *note 11.4.1(6/2): 4582.
+Save_Occurrence <in> Ada.Exceptions *note 11.4.1(6/2): 4582.
-Second in Ada.Calendar.Formatting *note 9.6.1(26/2): 4196.
+Second <in> Ada.Calendar.Formatting *note 9.6.1(26/2): 4196.
Seconds
- in Ada.Calendar *note 9.6(13): 4155.
- in Ada.Real_Time *note D.8(14/2): 7958.
+ <in> Ada.Calendar *note 9.6(13): 4155.
+ <in> Ada.Real_Time *note D.8(14/2): 7958.
-Seconds_Of in Ada.Calendar.Formatting *note 9.6.1(28/2): 4198.
+Seconds_Of <in> Ada.Calendar.Formatting *note 9.6.1(28/2): 4198.
-Set in Ada.Environment_Variables *note A.17(6/2): 6703.
+Set <in> Ada.Environment_Variables *note A.17(6/2): 6703.
Set_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(12.1/2): 5852.
+ <in> Ada.Strings.Bounded *note A.4.4(12.1/2): 5852.
-Set_Col in Ada.Text_IO *note A.10.1(35): 6434.
+Set_Col <in> Ada.Text_IO *note A.10.1(35): 6434.
Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
8089.
-Set_Deadline in Ada.Dispatching.EDF *note D.2.6(9/2): 7824.
+Set_Deadline <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7824.
Set_Dependents_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 7743.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 7743.
-Set_Directory in Ada.Directories *note A.16(6/2): 6637.
+Set_Directory <in> Ada.Directories *note A.16(6/2): 6637.
-Set_Error in Ada.Text_IO *note A.10.1(15): 6395.
+Set_Error <in> Ada.Text_IO *note A.10.1(15): 6395.
-Set_Exit_Status in Ada.Command_Line *note A.15(9): 6633.
+Set_Exit_Status <in> Ada.Command_Line *note A.15(9): 6633.
Set_False
- in Ada.Synchronous_Task_Control *note D.10(4): 7976.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7976.
Set_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8044.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8020.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8061.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8044.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8020.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8061.
Set_Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8392,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8392,
*note G.3.2(28/2): 8405.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8267.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8267.
Set_Index
- in Ada.Direct_IO *note A.8.4(14): 6343.
- in Ada.Streams.Stream_IO *note A.12.1(22): 6590.
+ <in> Ada.Direct_IO *note A.8.4(14): 6343.
+ <in> Ada.Streams.Stream_IO *note A.12.1(22): 6590.
-Set_Input in Ada.Text_IO *note A.10.1(15): 6393.
+Set_Input <in> Ada.Text_IO *note A.10.1(15): 6393.
-Set_Length in Ada.Containers.Vectors *note A.18.2(22/2): 6738.
+Set_Length <in> Ada.Containers.Vectors *note A.18.2(22/2): 6738.
-Set_Line in Ada.Text_IO *note A.10.1(36): 6436.
+Set_Line <in> Ada.Text_IO *note A.10.1(36): 6436.
-Set_Line_Length in Ada.Text_IO *note A.10.1(23): 6411.
+Set_Line_Length <in> Ada.Text_IO *note A.10.1(23): 6411.
-Set_Mode in Ada.Streams.Stream_IO *note A.12.1(24): 6593.
+Set_Mode <in> Ada.Streams.Stream_IO *note A.12.1(24): 6593.
-Set_Output in Ada.Text_IO *note A.10.1(15): 6394.
+Set_Output <in> Ada.Text_IO *note A.10.1(15): 6394.
-Set_Page_Length in Ada.Text_IO *note A.10.1(24): 6414.
+Set_Page_Length <in> Ada.Text_IO *note A.10.1(24): 6414.
Set_Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(10/3): 5262.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(10/3): 5262.
Set_Priority
- in Ada.Dynamic_Priorities *note D.5.1(4): 7866.
+ <in> Ada.Dynamic_Priorities *note D.5.1(4): 7866.
Set_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7815.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7815.
Set_Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8391,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8391,
*note G.3.2(28/2): 8404.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8266.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8266.
Set_Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 7745.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 7745.
Set_True
- in Ada.Synchronous_Task_Control *note D.10(4): 7975.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7975.
Set_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(11.1/2): 5911.
+ <in> Ada.Strings.Unbounded *note A.4.5(11.1/2): 5911.
-Set_Value in Ada.Task_Attributes *note C.7.2(6): 7732.
+Set_Value <in> Ada.Task_Attributes *note C.7.2(6): 7732.
Simple_Name
- in Ada.Directories *note A.16(16/2): 6646, *note A.16(38/2): 6666.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
+ <in> Ada.Directories *note A.16(16/2): 6646, *note A.16(38/2):
+6666.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
6693.
Sin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8290.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6116.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6116.
Sinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8298.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6131.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6131.
Size
- in Ada.Direct_IO *note A.8.4(15): 6345.
- in Ada.Directories *note A.16(26/2): 6657, *note A.16(41/2): 6669.
- in Ada.Streams.Stream_IO *note A.12.1(23): 6592.
+ <in> Ada.Direct_IO *note A.8.4(15): 6345.
+ <in> Ada.Directories *note A.16(26/2): 6657, *note A.16(41/2):
+6669.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 6592.
-Skip_Line in Ada.Text_IO *note A.10.1(29): 6422.
+Skip_Line <in> Ada.Text_IO *note A.10.1(29): 6422.
-Skip_Page in Ada.Text_IO *note A.10.1(32): 6428.
+Skip_Page <in> Ada.Text_IO *note A.10.1(32): 6428.
Slice
- in Ada.Strings.Bounded *note A.4.4(28): 5863.
- in Ada.Strings.Unbounded *note A.4.5(22): 5917.
+ <in> Ada.Strings.Bounded *note A.4.4(28): 5863.
+ <in> Ada.Strings.Unbounded *note A.4.5(22): 5917.
Solve
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8415.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8376.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8415.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8376.
Sort
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 6871.
- in Ada.Containers.Vectors *note A.18.2(77/2): 6799.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 6871.
+ <in> Ada.Containers.Vectors *note A.18.2(77/2): 6799.
Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 7746.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 7746.
Splice
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 6853,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 6853,
*note A.18.3(31/2): 6854, *note A.18.3(32/2): 6855.
Splice_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7250, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7250, *note
A.18.10(58/3): 7251.
Splice_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7248, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7248, *note
A.18.10(56/3): 7249.
Split
- in Ada.Calendar *note 9.6(14): 4156.
- in Ada.Calendar.Formatting *note 9.6.1(29/2): 4199, *note
+ <in> Ada.Calendar *note 9.6(14): 4156.
+ <in> Ada.Calendar.Formatting *note 9.6.1(29/2): 4199, *note
9.6.1(32/2): 4202, *note 9.6.1(33/2): 4203, *note 9.6.1(34/2): 4204.
- in Ada.Execution_Time *note D.14(8/2): 8006.
- in Ada.Real_Time *note D.8(16): 7961.
+ <in> Ada.Execution_Time *note D.14(8/2): 8006.
+ <in> Ada.Real_Time *note D.8(16): 7961.
Sqrt
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8286.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6111.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6111.
-Standard_Error in Ada.Text_IO *note A.10.1(16): 6398, *note
+Standard_Error <in> Ada.Text_IO *note A.10.1(16): 6398, *note
A.10.1(19): 6405.
-Standard_Input in Ada.Text_IO *note A.10.1(16): 6396, *note
+Standard_Input <in> Ada.Text_IO *note A.10.1(16): 6396, *note
A.10.1(19): 6403.
-Standard_Output in Ada.Text_IO *note A.10.1(16): 6397, *note
+Standard_Output <in> Ada.Text_IO *note A.10.1(16): 6397, *note
A.10.1(19): 6404.
-Start_Search in Ada.Directories *note A.16(32/2): 6662.
+Start_Search <in> Ada.Directories *note A.16(32/2): 6662.
Storage_Size
- in System.Storage_Pools *note 13.11(9): 5191.
- in System.Storage_Pools.Subpools *note 13.11.4(16/3): 5268.
+ <in> System.Storage_Pools *note 13.11(9): 5191.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(16/3): 5268.
Stream
- in Ada.Streams.Stream_IO *note A.12.1(13): 6585.
- in Ada.Text_IO.Text_Streams *note A.12.2(4): 6606.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 6609.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 6612.
+ <in> Ada.Streams.Stream_IO *note A.12.1(13): 6585.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(4): 6606.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 6609.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 6612.
-Strlen in Interfaces.C.Strings *note B.3.1(17): 7510.
+Strlen <in> Interfaces.C.Strings *note B.3.1(17): 7510.
-Sub_Second in Ada.Calendar.Formatting *note 9.6.1(27/2): 4197.
+Sub_Second <in> Ada.Calendar.Formatting *note 9.6.1(27/2): 4197.
Subtree_Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7211.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7211.
Supported
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8057.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8057.
Suspend_Until_True
- in Ada.Synchronous_Task_Control *note D.10(4): 7978.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7978.
Suspend_Until_True_And_Set_Deadline
- in Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 7980.
+ <in> Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 7980.
Swap
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 6851.
- in Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7230.
- in Ada.Containers.Vectors *note A.18.2(55/2): 6778, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 6851.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7230.
+ <in> Ada.Containers.Vectors *note A.18.2(55/2): 6778, *note
A.18.2(56/2): 6779.
Swap_Links
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 6852.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 6852.
Symmetric_Difference
- in Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7074, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7074, *note
A.18.8(36/2): 7075.
- in Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7147, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7147, *note
A.18.9(37/2): 7148.
Tail
- in Ada.Strings.Bounded *note A.4.4(72): 5897, *note A.4.4(73):
+ <in> Ada.Strings.Bounded *note A.4.4(72): 5897, *note A.4.4(73):
5898.
- in Ada.Strings.Fixed *note A.4.3(37): 5840, *note A.4.3(38): 5841.
- in Ada.Strings.Unbounded *note A.4.5(67): 5951, *note A.4.5(68):
+ <in> Ada.Strings.Fixed *note A.4.3(37): 5840, *note A.4.3(38):
+5841.
+ <in> Ada.Strings.Unbounded *note A.4.5(67): 5951, *note A.4.5(68):
5952.
Tan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8292.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6119.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6119.
Tanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8300.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6133.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6133.
Time_Of
- in Ada.Calendar *note 9.6(15): 4157.
- in Ada.Calendar.Formatting *note 9.6.1(30/2): 4200, *note
+ <in> Ada.Calendar *note 9.6(15): 4157.
+ <in> Ada.Calendar.Formatting *note 9.6.1(30/2): 4200, *note
9.6.1(31/2): 4201.
- in Ada.Execution_Time *note D.14(9/2): 8007.
- in Ada.Real_Time *note D.8(16): 7962.
+ <in> Ada.Execution_Time *note D.14(9/2): 8007.
+ <in> Ada.Real_Time *note D.8(16): 7962.
Time_Of_Event
- in Ada.Real_Time.Timing_Events *note D.15(6/2): 8065.
+ <in> Ada.Real_Time.Timing_Events *note D.15(6/2): 8065.
Time_Remaining
- in Ada.Execution_Time.Timers *note D.14.1(8/2): 8023.
+ <in> Ada.Execution_Time.Timers *note D.14.1(8/2): 8023.
To_Ada
- in Interfaces.C *note B.3(22): 7454, *note B.3(26): 7458, *note
+ <in> Interfaces.C *note B.3(22): 7454, *note B.3(26): 7458, *note
B.3(28): 7460, *note B.3(32): 7464, *note B.3(37): 7468, *note B.3(39):
7470, *note B.3(39.10/2): 7480, *note B.3(39.13/2): 7484, *note
B.3(39.17/2): 7488, *note B.3(39.19/2): 7490, *note B.3(39.4/2): 7474,
*note B.3(39.8/2): 7478.
- in Interfaces.COBOL *note B.4(17): 7559, *note B.4(19): 7561.
- in Interfaces.Fortran *note B.5(13): 7612, *note B.5(14): 7614,
+ <in> Interfaces.COBOL *note B.4(17): 7559, *note B.4(19): 7561.
+ <in> Interfaces.Fortran *note B.5(13): 7612, *note B.5(14): 7614,
*note B.5(16): 7616.
To_Address
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5146.
- in System.Storage_Elements *note 13.7.1(10/3): 5139.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5146.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5139.
-To_Basic in Ada.Characters.Handling *note A.3.2(6): 5479, *note
+To_Basic <in> Ada.Characters.Handling *note A.3.2(6): 5479, *note
A.3.2(7): 5482.
-To_Binary in Interfaces.COBOL *note B.4(45): 7591, *note B.4(48):
+To_Binary <in> Interfaces.COBOL *note B.4(45): 7591, *note B.4(48):
7594.
To_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(11): 5850.
+ <in> Ada.Strings.Bounded *note A.4.4(11): 5850.
-To_C in Interfaces.C *note B.3(21): 7453, *note B.3(25): 7457, *note
+To_C <in> Interfaces.C *note B.3(21): 7453, *note B.3(25): 7457, *note
B.3(27): 7459, *note B.3(32): 7463, *note B.3(36): 7467, *note B.3(38):
7469, *note B.3(39.13/2): 7483, *note B.3(39.16/2): 7487, *note
B.3(39.18/2): 7489, *note B.3(39.4/2): 7473, *note B.3(39.7/2): 7477,
*note B.3(39.9/2): 7479.
To_Character
- in Ada.Characters.Conversions *note A.3.4(5/2): 5744.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 5744.
-To_Chars_Ptr in Interfaces.C.Strings *note B.3.1(8): 7501.
+To_Chars_Ptr <in> Interfaces.C.Strings *note B.3.1(8): 7501.
-To_COBOL in Interfaces.COBOL *note B.4(17): 7558, *note B.4(18): 7560.
+To_COBOL <in> Interfaces.COBOL *note B.4(17): 7558, *note B.4(18):
+7560.
-To_Cursor in Ada.Containers.Vectors *note A.18.2(25/2): 6741.
+To_Cursor <in> Ada.Containers.Vectors *note A.18.2(25/2): 6741.
-To_Decimal in Interfaces.COBOL *note B.4(35): 7582, *note B.4(40):
+To_Decimal <in> Interfaces.COBOL *note B.4(35): 7582, *note B.4(40):
7586, *note B.4(44): 7590, *note B.4(47): 7592.
-To_Display in Interfaces.COBOL *note B.4(36): 7583.
+To_Display <in> Interfaces.COBOL *note B.4(36): 7583.
To_Domain
- in Ada.Strings.Maps *note A.4.2(24): 5801.
- in Ada.Strings.Wide_Maps *note A.4.7(24): 6003.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6042.
+ <in> Ada.Strings.Maps *note A.4.2(24): 5801.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(24): 6003.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6042.
-To_Duration in Ada.Real_Time *note D.8(13): 7953.
+To_Duration <in> Ada.Real_Time *note D.8(13): 7953.
-To_Fortran in Interfaces.Fortran *note B.5(13): 7611, *note B.5(14):
+To_Fortran <in> Interfaces.Fortran *note B.5(13): 7611, *note B.5(14):
7613, *note B.5(15): 7615.
To_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7287.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7287.
-To_Index in Ada.Containers.Vectors *note A.18.2(26/2): 6742.
+To_Index <in> Ada.Containers.Vectors *note A.18.2(26/2): 6742.
-To_Integer in System.Storage_Elements *note 13.7.1(10/3): 5140.
+To_Integer <in> System.Storage_Elements *note 13.7.1(10/3): 5140.
-To_ISO_646 in Ada.Characters.Handling *note A.3.2(11): 5486, *note
+To_ISO_646 <in> Ada.Characters.Handling *note A.3.2(11): 5486, *note
A.3.2(12): 5487.
-To_Long_Binary in Interfaces.COBOL *note B.4(48): 7595.
+To_Long_Binary <in> Interfaces.COBOL *note B.4(48): 7595.
To_Lower
- in Ada.Characters.Handling *note A.3.2(6): 5477, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 5477, *note A.3.2(7):
5480.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 5765, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 5765, *note
A.3.5(21/3): 5767.
To_Mapping
- in Ada.Strings.Maps *note A.4.2(23): 5800.
- in Ada.Strings.Wide_Maps *note A.4.7(23): 6002.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6041.
+ <in> Ada.Strings.Maps *note A.4.2(23): 5800.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(23): 6002.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6041.
-To_Packed in Interfaces.COBOL *note B.4(41): 7587.
+To_Packed <in> Interfaces.COBOL *note B.4(41): 7587.
-To_Picture in Ada.Text_IO.Editing *note F.3.3(6): 8237.
+To_Picture <in> Ada.Text_IO.Editing *note F.3.3(6): 8237.
To_Pointer
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5145.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5145.
To_Range
- in Ada.Strings.Maps *note A.4.2(24): 5802.
- in Ada.Strings.Wide_Maps *note A.4.7(25): 6004.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6043.
+ <in> Ada.Strings.Maps *note A.4.2(24): 5802.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(25): 6004.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6043.
To_Ranges
- in Ada.Strings.Maps *note A.4.2(10): 5790.
- in Ada.Strings.Wide_Maps *note A.4.7(10): 5992.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6031.
+ <in> Ada.Strings.Maps *note A.4.2(10): 5790.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(10): 5992.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6031.
To_Sequence
- in Ada.Strings.Maps *note A.4.2(19): 5796.
- in Ada.Strings.Wide_Maps *note A.4.7(19): 5998.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6037.
+ <in> Ada.Strings.Maps *note A.4.2(19): 5796.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(19): 5998.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6037.
To_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7048.
- in Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7121.
- in Ada.Strings.Maps *note A.4.2(8): 5788, *note A.4.2(9): 5789,
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7048.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7121.
+ <in> Ada.Strings.Maps *note A.4.2(8): 5788, *note A.4.2(9): 5789,
*note A.4.2(17): 5794, *note A.4.2(18): 5795.
- in Ada.Strings.Wide_Maps *note A.4.7(8): 5990, *note A.4.7(9):
+ <in> Ada.Strings.Wide_Maps *note A.4.7(8): 5990, *note A.4.7(9):
5991, *note A.4.7(17): 5996, *note A.4.7(18): 5997.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6029, *note
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6029, *note
A.4.8(9/2): 6030, *note A.4.8(17/2): 6035, *note A.4.8(18/2): 6036.
To_String
- in Ada.Characters.Conversions *note A.3.4(5/2): 5743.
- in Ada.Strings.Bounded *note A.4.4(12): 5851.
- in Ada.Strings.Unbounded *note A.4.5(11): 5910.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 5743.
+ <in> Ada.Strings.Bounded *note A.4.4(12): 5851.
+ <in> Ada.Strings.Unbounded *note A.4.5(11): 5910.
-To_Time_Span in Ada.Real_Time *note D.8(13): 7954.
+To_Time_Span <in> Ada.Real_Time *note D.8(13): 7954.
To_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(9): 5908, *note A.4.5(10):
+ <in> Ada.Strings.Unbounded *note A.4.5(9): 5908, *note A.4.5(10):
5909.
To_Upper
- in Ada.Characters.Handling *note A.3.2(6): 5478, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 5478, *note A.3.2(7):
5481.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 5766, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 5766, *note
A.3.5(21/3): 5768.
-To_Vector in Ada.Containers.Vectors *note A.18.2(13/2): 6733, *note
+To_Vector <in> Ada.Containers.Vectors *note A.18.2(13/2): 6733, *note
A.18.2(14/2): 6734.
To_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 5736, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5736, *note
A.3.4(5/2): 5746.
To_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 5737, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5737, *note
A.3.4(5/2): 5747.
To_Wide_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 5740.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5740.
To_Wide_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 5741.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5741.
Translate
- in Ada.Strings.Bounded *note A.4.4(53): 5879, *note A.4.4(54):
+ <in> Ada.Strings.Bounded *note A.4.4(53): 5879, *note A.4.4(54):
5880, *note A.4.4(55): 5881, *note A.4.4(56): 5882.
- in Ada.Strings.Fixed *note A.4.3(18): 5822, *note A.4.3(19): 5823,
-*note A.4.3(20): 5824, *note A.4.3(21): 5825.
- in Ada.Strings.Unbounded *note A.4.5(48): 5933, *note A.4.5(49):
+ <in> Ada.Strings.Fixed *note A.4.3(18): 5822, *note A.4.3(19):
+5823, *note A.4.3(20): 5824, *note A.4.3(21): 5825.
+ <in> Ada.Strings.Unbounded *note A.4.5(48): 5933, *note A.4.5(49):
5934, *note A.4.5(50): 5935, *note A.4.5(51): 5936.
Transpose
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 8414.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 8374.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 8414.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 8374.
Trim
- in Ada.Strings.Bounded *note A.4.4(67): 5891, *note A.4.4(68):
+ <in> Ada.Strings.Bounded *note A.4.4(67): 5891, *note A.4.4(68):
5893, *note A.4.4(69): 5894.
- in Ada.Strings.Fixed *note A.4.3(31): 5834, *note A.4.3(32): 5835,
-*note A.4.3(33): 5836, *note A.4.3(34): 5837.
- in Ada.Strings.Unbounded *note A.4.5(61): 5945, *note A.4.5(62):
+ <in> Ada.Strings.Fixed *note A.4.3(31): 5834, *note A.4.3(32):
+5835, *note A.4.3(33): 5836, *note A.4.3(34): 5837.
+ <in> Ada.Strings.Unbounded *note A.4.5(61): 5945, *note A.4.5(62):
5946, *note A.4.5(63): 5947, *note A.4.5(64): 5948.
Unbounded_Slice
- in Ada.Strings.Unbounded *note A.4.5(22.1/2): 5918, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(22.1/2): 5918, *note
A.4.5(22.2/2): 5919.
Unchecked_Conversion
- child of Ada *note 13.9(3/3): 5159.
+ <child of> Ada *note 13.9(3/3): 5159.
Unchecked_Deallocation
- child of Ada *note 13.11.2(3/3): 5228.
+ <child of> Ada *note 13.11.2(3/3): 5228.
Union
- in Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7068, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7068, *note
A.18.8(27/2): 7069.
- in Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7141, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7141, *note
A.18.9(28/2): 7142.
Unit_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 8421.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 8381.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 8421.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 8381.
Unit_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 8401.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 8373.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 8401.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 8373.
-Update in Interfaces.C.Strings *note B.3.1(18): 7511, *note B.3.1(19):
-7512.
+Update <in> Interfaces.C.Strings *note B.3.1(18): 7511, *note
+B.3.1(19): 7512.
Update_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 6835.
- in Ada.Containers.Hashed_Maps *note A.18.5(17/2): 6924.
- in Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7293.
- in Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7220.
- in Ada.Containers.Ordered_Maps *note A.18.6(16/2): 6975.
- in Ada.Containers.Vectors *note A.18.2(33/2): 6749, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 6835.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17/2): 6924.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7293.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7220.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16/2): 6975.
+ <in> Ada.Containers.Vectors *note A.18.2(33/2): 6749, *note
A.18.2(34/2): 6750.
Update_Element_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7095.
- in Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7176.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7095.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7176.
-Update_Error in Interfaces.C.Strings *note B.3.1(20): 7513.
+Update_Error <in> Interfaces.C.Strings *note B.3.1(20): 7513.
UTC_Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4172.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4172.
Valid
- in Ada.Text_IO.Editing *note F.3.3(5): 8236, *note F.3.3(12): 8248.
- in Interfaces.COBOL *note B.4(33): 7580, *note B.4(38): 7584, *note
-B.4(43): 7588.
+ <in> Ada.Text_IO.Editing *note F.3.3(5): 8236, *note F.3.3(12):
+8248.
+ <in> Interfaces.COBOL *note B.4(33): 7580, *note B.4(38): 7584,
+*note B.4(43): 7588.
Value
- in Ada.Calendar.Formatting *note 9.6.1(36/2): 4206, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(36/2): 4206, *note
9.6.1(38/2): 4208.
- in Ada.Environment_Variables *note A.17(4.1/3): 6701, *note
+ <in> Ada.Environment_Variables *note A.17(4.1/3): 6701, *note
A.17(4/2): 6700.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6170.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6158.
- in Ada.Strings.Maps *note A.4.2(21): 5798.
- in Ada.Strings.Wide_Maps *note A.4.7(21): 6000.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6039.
- in Ada.Task_Attributes *note C.7.2(4): 7730.
- in Interfaces.C.Pointers *note B.3.2(6): 7520, *note B.3.2(7):
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6170.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6158.
+ <in> Ada.Strings.Maps *note A.4.2(21): 5798.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(21): 6000.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6039.
+ <in> Ada.Task_Attributes *note C.7.2(4): 7730.
+ <in> Interfaces.C.Pointers *note B.3.2(6): 7520, *note B.3.2(7):
7521.
- in Interfaces.C.Strings *note B.3.1(13): 7506, *note B.3.1(14):
+ <in> Interfaces.C.Strings *note B.3.1(13): 7506, *note B.3.1(14):
7507, *note B.3.1(15): 7508, *note B.3.1(16): 7509.
Virtual_Length
- in Interfaces.C.Pointers *note B.3.2(13): 7525.
+ <in> Interfaces.C.Pointers *note B.3.2(13): 7525.
Wait_For_Release
- in Ada.Synchronous_Barriers *note D.10.1(6/3): 7987.
+ <in> Ada.Synchronous_Barriers *note D.10.1(6/3): 7987.
Wide_Equal_Case_Insensitive
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5978.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5977.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5979.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5978.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5977.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5979.
Wide_Hash
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5974.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5973.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5975.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5974.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5973.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5975.
Wide_Hash_Case_Insensitive
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5982.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5981.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5983.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5982.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5981.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5983.
-Wide_Exception_Name in Ada.Exceptions *note 11.4.1(2/2): 4568, *note
+Wide_Exception_Name <in> Ada.Exceptions *note 11.4.1(2/2): 4568, *note
11.4.1(5/2): 4578.
-Wide_Expanded_Name in Ada.Tags *note 3.9(7/2): 2104.
+Wide_Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2104.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6017.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6016.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6018.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6017.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6016.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6018.
Wide_Wide_Hash
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6013.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6012.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6014.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6013.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6012.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6014.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6021.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6020.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6022.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6021.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6020.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6022.
Wide_Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4569, *note 11.4.1(5/2): 4579.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4569, *note 11.4.1(5/2):
+4579.
-Wide_Wide_Expanded_Name in Ada.Tags *note 3.9(7/2): 2105.
+Wide_Wide_Expanded_Name <in> Ada.Tags *note 3.9(7/2): 2105.
Write
- in Ada.Direct_IO *note A.8.4(13): 6341.
- in Ada.Sequential_IO *note A.8.1(12): 6313.
- in Ada.Storage_IO *note A.9(7): 6359.
- in Ada.Streams *note 13.13.1(6): 5341.
- in Ada.Streams.Stream_IO *note A.12.1(18): 6588, *note A.12.1(19):
-6589.
- in System.RPC *note E.5(8): 8209.
+ <in> Ada.Direct_IO *note A.8.4(13): 6341.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6313.
+ <in> Ada.Storage_IO *note A.9(7): 6359.
+ <in> Ada.Streams *note 13.13.1(6): 5341.
+ <in> Ada.Streams.Stream_IO *note A.12.1(18): 6588, *note
+A.12.1(19): 6589.
+ <in> System.RPC *note E.5(8): 8209.
Year
- in Ada.Calendar *note 9.6(13): 4152.
- in Ada.Calendar.Formatting *note 9.6.1(21/2): 4191.
+ <in> Ada.Calendar *note 9.6(13): 4152.
+ <in> Ada.Calendar.Formatting *note 9.6.1(21/2): 4191.
-Yield in Ada.Dispatching *note D.2.1(1.3/3): 7770.
+Yield <in> Ada.Dispatching *note D.2.1(1.3/3): 7770.
Yield_To_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7807.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7807.
Yield_To_Same_Or_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7808.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7808.
File: arm2012.info, Node: Q.4, Next: Q.5, Prev: Q.3, Up: Annex Q
@@ -79981,135 +80134,135 @@ This subclause lists all language-defined
exceptions.
Argument_Error
- in Ada.Numerics *note A.5(3/2): 6107.
+ <in> Ada.Numerics *note A.5(3/2): 6107.
Assertion_Error
- in Ada.Assertions *note 11.4.2(13/2): 4605.
+ <in> Ada.Assertions *note 11.4.2(13/2): 4605.
Capacity_Error
- in Ada.Containers *note A.18.1(5.1/3): 6718.
+ <in> Ada.Containers *note A.18.1(5.1/3): 6718.
Communication_Error
- in System.RPC *note E.5(5): 8206.
+ <in> System.RPC *note E.5(5): 8206.
Constraint_Error
- in Standard *note A.1(46): 5451.
+ <in> Standard *note A.1(46): 5451.
Conversion_Error
- in Interfaces.COBOL *note B.4(30): 7578.
+ <in> Interfaces.COBOL *note B.4(30): 7578.
Data_Error
- in Ada.Direct_IO *note A.8.4(18): 6353.
- in Ada.IO_Exceptions *note A.13(4): 6620.
- in Ada.Sequential_IO *note A.8.1(15): 6321.
- in Ada.Storage_IO *note A.9(9): 6360.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6601.
- in Ada.Text_IO *note A.10.1(85): 6526.
+ <in> Ada.Direct_IO *note A.8.4(18): 6353.
+ <in> Ada.IO_Exceptions *note A.13(4): 6620.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6321.
+ <in> Ada.Storage_IO *note A.9(9): 6360.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6601.
+ <in> Ada.Text_IO *note A.10.1(85): 6526.
Device_Error
- in Ada.Direct_IO *note A.8.4(18): 6351.
- in Ada.Directories *note A.16(43/2): 6674.
- in Ada.IO_Exceptions *note A.13(4): 6618.
- in Ada.Sequential_IO *note A.8.1(15): 6319.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6599.
- in Ada.Text_IO *note A.10.1(85): 6524.
+ <in> Ada.Direct_IO *note A.8.4(18): 6351.
+ <in> Ada.Directories *note A.16(43/2): 6674.
+ <in> Ada.IO_Exceptions *note A.13(4): 6618.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6319.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6599.
+ <in> Ada.Text_IO *note A.10.1(85): 6524.
Dispatching_Domain_Error
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
8078.
Dispatching_Policy_Error
- in Ada.Dispatching *note D.2.1(1.4/3): 7771.
+ <in> Ada.Dispatching *note D.2.1(1.4/3): 7771.
Encoding_Error
- in Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6069.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6069.
End_Error
- in Ada.Direct_IO *note A.8.4(18): 6352.
- in Ada.IO_Exceptions *note A.13(4): 6619.
- in Ada.Sequential_IO *note A.8.1(15): 6320.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6600.
- in Ada.Text_IO *note A.10.1(85): 6525.
+ <in> Ada.Direct_IO *note A.8.4(18): 6352.
+ <in> Ada.IO_Exceptions *note A.13(4): 6619.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6320.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6600.
+ <in> Ada.Text_IO *note A.10.1(85): 6525.
Group_Budget_Error
- in Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8047.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8047.
Index_Error
- in Ada.Strings *note A.4.1(5): 5776.
+ <in> Ada.Strings *note A.4.1(5): 5776.
Layout_Error
- in Ada.IO_Exceptions *note A.13(4): 6621.
- in Ada.Text_IO *note A.10.1(85): 6527.
+ <in> Ada.IO_Exceptions *note A.13(4): 6621.
+ <in> Ada.Text_IO *note A.10.1(85): 6527.
Length_Error
- in Ada.Strings *note A.4.1(5): 5774.
+ <in> Ada.Strings *note A.4.1(5): 5774.
Mode_Error
- in Ada.Direct_IO *note A.8.4(18): 6348.
- in Ada.IO_Exceptions *note A.13(4): 6615.
- in Ada.Sequential_IO *note A.8.1(15): 6316.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6596.
- in Ada.Text_IO *note A.10.1(85): 6521.
+ <in> Ada.Direct_IO *note A.8.4(18): 6348.
+ <in> Ada.IO_Exceptions *note A.13(4): 6615.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6316.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6596.
+ <in> Ada.Text_IO *note A.10.1(85): 6521.
Name_Error
- in Ada.Direct_IO *note A.8.4(18): 6349.
- in Ada.Directories *note A.16(43/2): 6672.
- in Ada.IO_Exceptions *note A.13(4): 6616.
- in Ada.Sequential_IO *note A.8.1(15): 6317.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6597.
- in Ada.Text_IO *note A.10.1(85): 6522.
+ <in> Ada.Direct_IO *note A.8.4(18): 6349.
+ <in> Ada.Directories *note A.16(43/2): 6672.
+ <in> Ada.IO_Exceptions *note A.13(4): 6616.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6317.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6597.
+ <in> Ada.Text_IO *note A.10.1(85): 6522.
Pattern_Error
- in Ada.Strings *note A.4.1(5): 5775.
+ <in> Ada.Strings *note A.4.1(5): 5775.
Picture_Error
- in Ada.Text_IO.Editing *note F.3.3(9): 8241.
+ <in> Ada.Text_IO.Editing *note F.3.3(9): 8241.
Pointer_Error
- in Interfaces.C.Pointers *note B.3.2(8): 7522.
+ <in> Interfaces.C.Pointers *note B.3.2(8): 7522.
Program_Error
- in Standard *note A.1(46): 5452.
+ <in> Standard *note A.1(46): 5452.
Status_Error
- in Ada.Direct_IO *note A.8.4(18): 6347.
- in Ada.Directories *note A.16(43/2): 6671.
- in Ada.IO_Exceptions *note A.13(4): 6614.
- in Ada.Sequential_IO *note A.8.1(15): 6315.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6595.
- in Ada.Text_IO *note A.10.1(85): 6520.
+ <in> Ada.Direct_IO *note A.8.4(18): 6347.
+ <in> Ada.Directories *note A.16(43/2): 6671.
+ <in> Ada.IO_Exceptions *note A.13(4): 6614.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6315.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6595.
+ <in> Ada.Text_IO *note A.10.1(85): 6520.
Storage_Error
- in Standard *note A.1(46): 5453.
+ <in> Standard *note A.1(46): 5453.
Tag_Error
- in Ada.Tags *note 3.9(8): 2114.
+ <in> Ada.Tags *note 3.9(8): 2114.
Tasking_Error
- in Standard *note A.1(46): 5454.
+ <in> Standard *note A.1(46): 5454.
Terminator_Error
- in Interfaces.C *note B.3(40): 7491.
+ <in> Interfaces.C *note B.3(40): 7491.
Time_Error
- in Ada.Calendar *note 9.6(18): 4158.
+ <in> Ada.Calendar *note 9.6(18): 4158.
Timer_Resource_Error
- in Ada.Execution_Time.Timers *note D.14.1(9/2): 8024.
+ <in> Ada.Execution_Time.Timers *note D.14.1(9/2): 8024.
Translation_Error
- in Ada.Strings *note A.4.1(5): 5777.
+ <in> Ada.Strings *note A.4.1(5): 5777.
Unknown_Zone_Error
- in Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4171.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4171.
Use_Error
- in Ada.Direct_IO *note A.8.4(18): 6350.
- in Ada.Directories *note A.16(43/2): 6673.
- in Ada.IO_Exceptions *note A.13(4): 6617.
- in Ada.Sequential_IO *note A.8.1(15): 6318.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6598.
- in Ada.Text_IO *note A.10.1(85): 6523.
+ <in> Ada.Direct_IO *note A.8.4(18): 6350.
+ <in> Ada.Directories *note A.16(43/2): 6673.
+ <in> Ada.IO_Exceptions *note A.13(4): 6617.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6318.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6598.
+ <in> Ada.Text_IO *note A.10.1(85): 6523.
File: arm2012.info, Node: Q.5, Prev: Q.4, Up: Annex Q
@@ -80123,870 +80276,870 @@ numbers, and enumeration literals.
-ACK in Ada.Characters.Latin_1 *note A.3.3(5): 5506.
+ACK <in> Ada.Characters.Latin_1 *note A.3.3(5): 5506.
-Acute in Ada.Characters.Latin_1 *note A.3.3(22): 5652.
+Acute <in> Ada.Characters.Latin_1 *note A.3.3(22): 5652.
-Ada_To_COBOL in Interfaces.COBOL *note B.4(14): 7555.
+Ada_To_COBOL <in> Interfaces.COBOL *note B.4(14): 7555.
Alphanumeric_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5963.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5963.
-Ampersand in Ada.Characters.Latin_1 *note A.3.3(8): 5538.
+Ampersand <in> Ada.Characters.Latin_1 *note A.3.3(8): 5538.
-APC in Ada.Characters.Latin_1 *note A.3.3(19): 5629.
+APC <in> Ada.Characters.Latin_1 *note A.3.3(19): 5629.
-Apostrophe in Ada.Characters.Latin_1 *note A.3.3(8): 5539.
+Apostrophe <in> Ada.Characters.Latin_1 *note A.3.3(8): 5539.
-Asterisk in Ada.Characters.Latin_1 *note A.3.3(8): 5542.
+Asterisk <in> Ada.Characters.Latin_1 *note A.3.3(8): 5542.
Basic_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5968.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5968.
Basic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5960.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5960.
-BEL in Ada.Characters.Latin_1 *note A.3.3(5): 5507.
+BEL <in> Ada.Characters.Latin_1 *note A.3.3(5): 5507.
-BOM_16 in Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6073.
+BOM_16 <in> Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6073.
-BOM_16BE in Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6071.
+BOM_16BE <in> Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6071.
-BOM_16LE in Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6072.
+BOM_16LE <in> Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6072.
-BOM_8 in Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6070.
+BOM_8 <in> Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6070.
-BPH in Ada.Characters.Latin_1 *note A.3.3(17): 5600.
+BPH <in> Ada.Characters.Latin_1 *note A.3.3(17): 5600.
-Broken_Bar in Ada.Characters.Latin_1 *note A.3.3(21/3): 5637.
+Broken_Bar <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5637.
-BS in Ada.Characters.Latin_1 *note A.3.3(5): 5508.
+BS <in> Ada.Characters.Latin_1 *note A.3.3(5): 5508.
-Buffer_Size in Ada.Storage_IO *note A.9(4): 6356.
+Buffer_Size <in> Ada.Storage_IO *note A.9(4): 6356.
-CAN in Ada.Characters.Latin_1 *note A.3.3(6): 5524.
+CAN <in> Ada.Characters.Latin_1 *note A.3.3(6): 5524.
-CCH in Ada.Characters.Latin_1 *note A.3.3(18): 5618.
+CCH <in> Ada.Characters.Latin_1 *note A.3.3(18): 5618.
-Cedilla in Ada.Characters.Latin_1 *note A.3.3(22): 5657.
+Cedilla <in> Ada.Characters.Latin_1 *note A.3.3(22): 5657.
-Cent_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 5633.
+Cent_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5633.
-char16_nul in Interfaces.C *note B.3(39.3/2): 7472.
+char16_nul <in> Interfaces.C *note B.3(39.3/2): 7472.
-char32_nul in Interfaces.C *note B.3(39.12/2): 7482.
+char32_nul <in> Interfaces.C *note B.3(39.12/2): 7482.
-CHAR_BIT in Interfaces.C *note B.3(6): 7433.
+CHAR_BIT <in> Interfaces.C *note B.3(6): 7433.
Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(46/2): 6006.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6046.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(46/2): 6006.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6046.
-Circumflex in Ada.Characters.Latin_1 *note A.3.3(12): 5559.
+Circumflex <in> Ada.Characters.Latin_1 *note A.3.3(12): 5559.
-COBOL_To_Ada in Interfaces.COBOL *note B.4(15): 7556.
+COBOL_To_Ada <in> Interfaces.COBOL *note B.4(15): 7556.
-Colon in Ada.Characters.Latin_1 *note A.3.3(10): 5549.
+Colon <in> Ada.Characters.Latin_1 *note A.3.3(10): 5549.
-Comma in Ada.Characters.Latin_1 *note A.3.3(8): 5544.
+Comma <in> Ada.Characters.Latin_1 *note A.3.3(8): 5544.
Commercial_At
- in Ada.Characters.Latin_1 *note A.3.3(10): 5555.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5555.
Control_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5955.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5955.
Copyright_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5640.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5640.
-Country_Unknown in Ada.Locales *note A.19(5/3): 7374.
+Country_Unknown <in> Ada.Locales *note A.19(5/3): 7374.
-CPU_Tick in Ada.Execution_Time *note D.14(4/2): 8004.
+CPU_Tick <in> Ada.Execution_Time *note D.14(4/2): 8004.
-CPU_Time_First in Ada.Execution_Time *note D.14(4/2): 8001.
+CPU_Time_First <in> Ada.Execution_Time *note D.14(4/2): 8001.
-CPU_Time_Last in Ada.Execution_Time *note D.14(4/2): 8002.
+CPU_Time_Last <in> Ada.Execution_Time *note D.14(4/2): 8002.
-CPU_Time_Unit in Ada.Execution_Time *note D.14(4/2): 8003.
+CPU_Time_Unit <in> Ada.Execution_Time *note D.14(4/2): 8003.
-CR in Ada.Characters.Latin_1 *note A.3.3(5): 5513.
+CR <in> Ada.Characters.Latin_1 *note A.3.3(5): 5513.
-CSI in Ada.Characters.Latin_1 *note A.3.3(19): 5625.
+CSI <in> Ada.Characters.Latin_1 *note A.3.3(19): 5625.
Currency_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5635.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5635.
-DC1 in Ada.Characters.Latin_1 *note A.3.3(6): 5517.
+DC1 <in> Ada.Characters.Latin_1 *note A.3.3(6): 5517.
-DC2 in Ada.Characters.Latin_1 *note A.3.3(6): 5518.
+DC2 <in> Ada.Characters.Latin_1 *note A.3.3(6): 5518.
-DC3 in Ada.Characters.Latin_1 *note A.3.3(6): 5519.
+DC3 <in> Ada.Characters.Latin_1 *note A.3.3(6): 5519.
-DC4 in Ada.Characters.Latin_1 *note A.3.3(6): 5520.
+DC4 <in> Ada.Characters.Latin_1 *note A.3.3(6): 5520.
-DCS in Ada.Characters.Latin_1 *note A.3.3(18): 5614.
+DCS <in> Ada.Characters.Latin_1 *note A.3.3(18): 5614.
Decimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5961.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5961.
Default_Aft
- in Ada.Text_IO *note A.10.1(64): 6483, *note A.10.1(69): 6493,
+ <in> Ada.Text_IO *note A.10.1(64): 6483, *note A.10.1(69): 6493,
*note A.10.1(74): 6503.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8316.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8316.
-Default_Base in Ada.Text_IO *note A.10.1(53): 6465, *note A.10.1(58):
-6474.
+Default_Base <in> Ada.Text_IO *note A.10.1(53): 6465, *note
+A.10.1(58): 6474.
-Default_Bit_Order in System *note 13.7(15/2): 5126.
+Default_Bit_Order <in> System *note 13.7(15/2): 5126.
Default_Currency
- in Ada.Text_IO.Editing *note F.3.3(10): 8242.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8242.
Default_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7823.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7823.
Default_Exp
- in Ada.Text_IO *note A.10.1(64): 6484, *note A.10.1(69): 6494,
+ <in> Ada.Text_IO *note A.10.1(64): 6484, *note A.10.1(69): 6494,
*note A.10.1(74): 6504.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8317.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8317.
-Default_Fill in Ada.Text_IO.Editing *note F.3.3(10): 8243.
+Default_Fill <in> Ada.Text_IO.Editing *note F.3.3(10): 8243.
Default_Fore
- in Ada.Text_IO *note A.10.1(64): 6482, *note A.10.1(69): 6492,
+ <in> Ada.Text_IO *note A.10.1(64): 6482, *note A.10.1(69): 6492,
*note A.10.1(74): 6502.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8315.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8315.
-Default_Priority in System *note 13.7(17): 5130.
+Default_Priority <in> System *note 13.7(17): 5130.
Default_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7814.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7814.
Default_Radix_Mark
- in Ada.Text_IO.Editing *note F.3.3(10): 8245.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8245.
Default_Separator
- in Ada.Text_IO.Editing *note F.3.3(10): 8244.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8244.
-Default_Setting in Ada.Text_IO *note A.10.1(80): 6513.
+Default_Setting <in> Ada.Text_IO *note A.10.1(80): 6513.
-Default_Width in Ada.Text_IO *note A.10.1(53): 6464, *note A.10.1(58):
-6473, *note A.10.1(80): 6512.
+Default_Width <in> Ada.Text_IO *note A.10.1(53): 6464, *note
+A.10.1(58): 6473, *note A.10.1(80): 6512.
-Degree_Sign in Ada.Characters.Latin_1 *note A.3.3(22): 5647.
+Degree_Sign <in> Ada.Characters.Latin_1 *note A.3.3(22): 5647.
-DEL in Ada.Characters.Latin_1 *note A.3.3(14): 5592.
+DEL <in> Ada.Characters.Latin_1 *note A.3.3(14): 5592.
-Diaeresis in Ada.Characters.Latin_1 *note A.3.3(21/3): 5639.
+Diaeresis <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5639.
Division_Sign
- in Ada.Characters.Latin_1 *note A.3.3(26): 5720.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5720.
-DLE in Ada.Characters.Latin_1 *note A.3.3(6): 5516.
+DLE <in> Ada.Characters.Latin_1 *note A.3.3(6): 5516.
-Dollar_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 5536.
+Dollar_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 5536.
-e in Ada.Numerics *note A.5(3/2): 6109.
+e <in> Ada.Numerics *note A.5(3/2): 6109.
-EM in Ada.Characters.Latin_1 *note A.3.3(6): 5525.
+EM <in> Ada.Characters.Latin_1 *note A.3.3(6): 5525.
Empty_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7286.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7286.
Empty_List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 6825.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 6825.
Empty_Map
- in Ada.Containers.Hashed_Maps *note A.18.5(5/2): 6911.
- in Ada.Containers.Ordered_Maps *note A.18.6(6/2): 6964.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(5/2): 6911.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(6/2): 6964.
Empty_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7043.
- in Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7116.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7043.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7116.
Empty_Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7204.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7204.
Empty_Vector
- in Ada.Containers.Vectors *note A.18.2(10/2): 6729.
+ <in> Ada.Containers.Vectors *note A.18.2(10/2): 6729.
-ENQ in Ada.Characters.Latin_1 *note A.3.3(5): 5505.
+ENQ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5505.
-EOT in Ada.Characters.Latin_1 *note A.3.3(5): 5504.
+EOT <in> Ada.Characters.Latin_1 *note A.3.3(5): 5504.
-EPA in Ada.Characters.Latin_1 *note A.3.3(18): 5621.
+EPA <in> Ada.Characters.Latin_1 *note A.3.3(18): 5621.
-Equals_Sign in Ada.Characters.Latin_1 *note A.3.3(10): 5552.
+Equals_Sign <in> Ada.Characters.Latin_1 *note A.3.3(10): 5552.
-ESA in Ada.Characters.Latin_1 *note A.3.3(17): 5605.
+ESA <in> Ada.Characters.Latin_1 *note A.3.3(17): 5605.
-ESC in Ada.Characters.Latin_1 *note A.3.3(6): 5527.
+ESC <in> Ada.Characters.Latin_1 *note A.3.3(6): 5527.
-ETB in Ada.Characters.Latin_1 *note A.3.3(6): 5523.
+ETB <in> Ada.Characters.Latin_1 *note A.3.3(6): 5523.
-ETX in Ada.Characters.Latin_1 *note A.3.3(5): 5503.
+ETX <in> Ada.Characters.Latin_1 *note A.3.3(5): 5503.
-Exclamation in Ada.Characters.Latin_1 *note A.3.3(8): 5533.
+Exclamation <in> Ada.Characters.Latin_1 *note A.3.3(8): 5533.
-Failure in Ada.Command_Line *note A.15(8): 6632.
+Failure <in> Ada.Command_Line *note A.15(8): 6632.
Feminine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5641.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5641.
-FF in Ada.Characters.Latin_1 *note A.3.3(5): 5512.
+FF <in> Ada.Characters.Latin_1 *note A.3.3(5): 5512.
-Fine_Delta in System *note 13.7(9): 5115.
+Fine_Delta <in> System *note 13.7(9): 5115.
Fraction_One_Half
- in Ada.Characters.Latin_1 *note A.3.3(22): 5662.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5662.
Fraction_One_Quarter
- in Ada.Characters.Latin_1 *note A.3.3(22): 5661.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5661.
Fraction_Three_Quarters
- in Ada.Characters.Latin_1 *note A.3.3(22): 5663.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5663.
-Friday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4183.
+Friday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4183.
-FS in Ada.Characters.Latin_1 *note A.3.3(6): 5528.
+FS <in> Ada.Characters.Latin_1 *note A.3.3(6): 5528.
-Full_Stop in Ada.Characters.Latin_1 *note A.3.3(8): 5547.
+Full_Stop <in> Ada.Characters.Latin_1 *note A.3.3(8): 5547.
Graphic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5956.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5956.
-Grave in Ada.Characters.Latin_1 *note A.3.3(13): 5561.
+Grave <in> Ada.Characters.Latin_1 *note A.3.3(13): 5561.
Greater_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 5553.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5553.
-GS in Ada.Characters.Latin_1 *note A.3.3(6): 5529.
+GS <in> Ada.Characters.Latin_1 *note A.3.3(6): 5529.
Hexadecimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5962.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5962.
High_Order_First
- in Interfaces.COBOL *note B.4(25): 7570.
- in System *note 13.7(15/2): 5124.
+ <in> Interfaces.COBOL *note B.4(25): 7570.
+ <in> System *note 13.7(15/2): 5124.
-HT in Ada.Characters.Latin_1 *note A.3.3(5): 5509.
+HT <in> Ada.Characters.Latin_1 *note A.3.3(5): 5509.
-HTJ in Ada.Characters.Latin_1 *note A.3.3(17): 5607.
+HTJ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5607.
-HTS in Ada.Characters.Latin_1 *note A.3.3(17): 5606.
+HTS <in> Ada.Characters.Latin_1 *note A.3.3(17): 5606.
-Hyphen in Ada.Characters.Latin_1 *note A.3.3(8): 5545.
+Hyphen <in> Ada.Characters.Latin_1 *note A.3.3(8): 5545.
i
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8261.
- in Interfaces.Fortran *note B.5(10): 7607.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8261.
+ <in> Interfaces.Fortran *note B.5(10): 7607.
Identity
- in Ada.Strings.Maps *note A.4.2(22): 5799.
- in Ada.Strings.Wide_Maps *note A.4.7(22): 6001.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6040.
+ <in> Ada.Strings.Maps *note A.4.2(22): 5799.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(22): 6001.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6040.
Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.1/3): 8008.
+ <in> Ada.Execution_Time *note D.14(9.1/3): 8008.
Inverted_Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5632.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5632.
Inverted_Question
- in Ada.Characters.Latin_1 *note A.3.3(22): 5664.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5664.
-IS1 in Ada.Characters.Latin_1 *note A.3.3(16): 5597.
+IS1 <in> Ada.Characters.Latin_1 *note A.3.3(16): 5597.
-IS2 in Ada.Characters.Latin_1 *note A.3.3(16): 5596.
+IS2 <in> Ada.Characters.Latin_1 *note A.3.3(16): 5596.
-IS3 in Ada.Characters.Latin_1 *note A.3.3(16): 5595.
+IS3 <in> Ada.Characters.Latin_1 *note A.3.3(16): 5595.
-IS4 in Ada.Characters.Latin_1 *note A.3.3(16): 5594.
+IS4 <in> Ada.Characters.Latin_1 *note A.3.3(16): 5594.
ISO_646_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5965.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5965.
j
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8262.
- in Interfaces.Fortran *note B.5(10): 7608.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8262.
+ <in> Interfaces.Fortran *note B.5(10): 7608.
-Language_Unknown in Ada.Locales *note A.19(5/3): 7373.
+Language_Unknown <in> Ada.Locales *note A.19(5/3): 7373.
-LC_A in Ada.Characters.Latin_1 *note A.3.3(13): 5562.
+LC_A <in> Ada.Characters.Latin_1 *note A.3.3(13): 5562.
-LC_A_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 5698.
+LC_A_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 5698.
LC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5699.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5699.
LC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5701.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5701.
-LC_A_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 5697.
+LC_A_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 5697.
-LC_A_Ring in Ada.Characters.Latin_1 *note A.3.3(25): 5702.
+LC_A_Ring <in> Ada.Characters.Latin_1 *note A.3.3(25): 5702.
-LC_A_Tilde in Ada.Characters.Latin_1 *note A.3.3(25): 5700.
+LC_A_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(25): 5700.
LC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(25): 5703.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5703.
-LC_B in Ada.Characters.Latin_1 *note A.3.3(13): 5563.
+LC_B <in> Ada.Characters.Latin_1 *note A.3.3(13): 5563.
-LC_C in Ada.Characters.Latin_1 *note A.3.3(13): 5564.
+LC_C <in> Ada.Characters.Latin_1 *note A.3.3(13): 5564.
LC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(25): 5704.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5704.
-LC_D in Ada.Characters.Latin_1 *note A.3.3(13): 5565.
+LC_D <in> Ada.Characters.Latin_1 *note A.3.3(13): 5565.
-LC_E in Ada.Characters.Latin_1 *note A.3.3(13): 5566.
+LC_E <in> Ada.Characters.Latin_1 *note A.3.3(13): 5566.
-LC_E_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 5706.
+LC_E_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 5706.
LC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5707.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5707.
LC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5708.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5708.
-LC_E_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 5705.
+LC_E_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 5705.
-LC_F in Ada.Characters.Latin_1 *note A.3.3(13): 5567.
+LC_F <in> Ada.Characters.Latin_1 *note A.3.3(13): 5567.
-LC_G in Ada.Characters.Latin_1 *note A.3.3(13): 5568.
+LC_G <in> Ada.Characters.Latin_1 *note A.3.3(13): 5568.
LC_German_Sharp_S
- in Ada.Characters.Latin_1 *note A.3.3(24): 5696.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5696.
-LC_H in Ada.Characters.Latin_1 *note A.3.3(13): 5569.
+LC_H <in> Ada.Characters.Latin_1 *note A.3.3(13): 5569.
-LC_I in Ada.Characters.Latin_1 *note A.3.3(13): 5570.
+LC_I <in> Ada.Characters.Latin_1 *note A.3.3(13): 5570.
-LC_I_Acute in Ada.Characters.Latin_1 *note A.3.3(25): 5710.
+LC_I_Acute <in> Ada.Characters.Latin_1 *note A.3.3(25): 5710.
LC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5711.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5711.
LC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5712.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5712.
-LC_I_Grave in Ada.Characters.Latin_1 *note A.3.3(25): 5709.
+LC_I_Grave <in> Ada.Characters.Latin_1 *note A.3.3(25): 5709.
LC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(26): 5713.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5713.
LC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(26): 5727.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5727.
-LC_J in Ada.Characters.Latin_1 *note A.3.3(13): 5571.
+LC_J <in> Ada.Characters.Latin_1 *note A.3.3(13): 5571.
-LC_K in Ada.Characters.Latin_1 *note A.3.3(13): 5572.
+LC_K <in> Ada.Characters.Latin_1 *note A.3.3(13): 5572.
-LC_L in Ada.Characters.Latin_1 *note A.3.3(13): 5573.
+LC_L <in> Ada.Characters.Latin_1 *note A.3.3(13): 5573.
-LC_M in Ada.Characters.Latin_1 *note A.3.3(13): 5574.
+LC_M <in> Ada.Characters.Latin_1 *note A.3.3(13): 5574.
-LC_N in Ada.Characters.Latin_1 *note A.3.3(13): 5575.
+LC_N <in> Ada.Characters.Latin_1 *note A.3.3(13): 5575.
-LC_N_Tilde in Ada.Characters.Latin_1 *note A.3.3(26): 5714.
+LC_N_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(26): 5714.
-LC_O in Ada.Characters.Latin_1 *note A.3.3(13): 5576.
+LC_O <in> Ada.Characters.Latin_1 *note A.3.3(13): 5576.
-LC_O_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 5716.
+LC_O_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 5716.
LC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 5717.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5717.
LC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5719.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5719.
-LC_O_Grave in Ada.Characters.Latin_1 *note A.3.3(26): 5715.
+LC_O_Grave <in> Ada.Characters.Latin_1 *note A.3.3(26): 5715.
LC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(26): 5721.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5721.
-LC_O_Tilde in Ada.Characters.Latin_1 *note A.3.3(26): 5718.
+LC_O_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(26): 5718.
-LC_P in Ada.Characters.Latin_1 *note A.3.3(14): 5577.
+LC_P <in> Ada.Characters.Latin_1 *note A.3.3(14): 5577.
-LC_Q in Ada.Characters.Latin_1 *note A.3.3(14): 5578.
+LC_Q <in> Ada.Characters.Latin_1 *note A.3.3(14): 5578.
-LC_R in Ada.Characters.Latin_1 *note A.3.3(14): 5579.
+LC_R <in> Ada.Characters.Latin_1 *note A.3.3(14): 5579.
-LC_S in Ada.Characters.Latin_1 *note A.3.3(14): 5580.
+LC_S <in> Ada.Characters.Latin_1 *note A.3.3(14): 5580.
-LC_T in Ada.Characters.Latin_1 *note A.3.3(14): 5581.
+LC_T <in> Ada.Characters.Latin_1 *note A.3.3(14): 5581.
-LC_U in Ada.Characters.Latin_1 *note A.3.3(14): 5582.
+LC_U <in> Ada.Characters.Latin_1 *note A.3.3(14): 5582.
-LC_U_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 5723.
+LC_U_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 5723.
LC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 5724.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5724.
LC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5725.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5725.
-LC_U_Grave in Ada.Characters.Latin_1 *note A.3.3(26): 5722.
+LC_U_Grave <in> Ada.Characters.Latin_1 *note A.3.3(26): 5722.
-LC_V in Ada.Characters.Latin_1 *note A.3.3(14): 5583.
+LC_V <in> Ada.Characters.Latin_1 *note A.3.3(14): 5583.
-LC_W in Ada.Characters.Latin_1 *note A.3.3(14): 5584.
+LC_W <in> Ada.Characters.Latin_1 *note A.3.3(14): 5584.
-LC_X in Ada.Characters.Latin_1 *note A.3.3(14): 5585.
+LC_X <in> Ada.Characters.Latin_1 *note A.3.3(14): 5585.
-LC_Y in Ada.Characters.Latin_1 *note A.3.3(14): 5586.
+LC_Y <in> Ada.Characters.Latin_1 *note A.3.3(14): 5586.
-LC_Y_Acute in Ada.Characters.Latin_1 *note A.3.3(26): 5726.
+LC_Y_Acute <in> Ada.Characters.Latin_1 *note A.3.3(26): 5726.
LC_Y_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5728.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5728.
-LC_Z in Ada.Characters.Latin_1 *note A.3.3(14): 5587.
+LC_Z <in> Ada.Characters.Latin_1 *note A.3.3(14): 5587.
Leading_Nonseparate
- in Interfaces.COBOL *note B.4(23): 7567.
+ <in> Interfaces.COBOL *note B.4(23): 7567.
-Leading_Separate in Interfaces.COBOL *note B.4(23): 7565.
+Leading_Separate <in> Interfaces.COBOL *note B.4(23): 7565.
Left_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5642.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5642.
Left_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 5588.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5588.
Left_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 5540.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5540.
Left_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 5556.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5556.
Less_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 5551.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5551.
Letter_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5957.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5957.
-LF in Ada.Characters.Latin_1 *note A.3.3(5): 5510.
+LF <in> Ada.Characters.Latin_1 *note A.3.3(5): 5510.
-Low_Line in Ada.Characters.Latin_1 *note A.3.3(12): 5560.
+Low_Line <in> Ada.Characters.Latin_1 *note A.3.3(12): 5560.
Low_Order_First
- in Interfaces.COBOL *note B.4(25): 7571.
- in System *note 13.7(15/2): 5125.
+ <in> Interfaces.COBOL *note B.4(25): 7571.
+ <in> System *note 13.7(15/2): 5125.
Lower_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5966.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5966.
Lower_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5958.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5958.
-Macron in Ada.Characters.Latin_1 *note A.3.3(21/3): 5646.
+Macron <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5646.
Masculine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(22): 5659.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5659.
-Max_Base_Digits in System *note 13.7(8): 5112.
+Max_Base_Digits <in> System *note 13.7(8): 5112.
-Max_Binary_Modulus in System *note 13.7(7): 5110.
+Max_Binary_Modulus <in> System *note 13.7(7): 5110.
-Max_Decimal_Digits in Ada.Decimal *note F.2(5): 8228.
+Max_Decimal_Digits <in> Ada.Decimal *note F.2(5): 8228.
-Max_Delta in Ada.Decimal *note F.2(4): 8227.
+Max_Delta <in> Ada.Decimal *note F.2(4): 8227.
-Max_Digits in System *note 13.7(8): 5113.
+Max_Digits <in> System *note 13.7(8): 5113.
-Max_Digits_Binary in Interfaces.COBOL *note B.4(11): 7550.
+Max_Digits_Binary <in> Interfaces.COBOL *note B.4(11): 7550.
Max_Digits_Long_Binary
- in Interfaces.COBOL *note B.4(11): 7551.
+ <in> Interfaces.COBOL *note B.4(11): 7551.
Max_Image_Width
- in Ada.Numerics.Discrete_Random *note A.5.2(25): 6168.
- in Ada.Numerics.Float_Random *note A.5.2(13): 6156.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(25): 6168.
+ <in> Ada.Numerics.Float_Random *note A.5.2(13): 6156.
-Max_Int in System *note 13.7(6): 5109.
+Max_Int <in> System *note 13.7(6): 5109.
-Max_Length in Ada.Strings.Bounded *note A.4.4(5): 5845.
+Max_Length <in> Ada.Strings.Bounded *note A.4.4(5): 5845.
-Max_Mantissa in System *note 13.7(9): 5114.
+Max_Mantissa <in> System *note 13.7(9): 5114.
-Max_Nonbinary_Modulus in System *note 13.7(7): 5111.
+Max_Nonbinary_Modulus <in> System *note 13.7(7): 5111.
Max_Picture_Length
- in Ada.Text_IO.Editing *note F.3.3(8): 8240.
+ <in> Ada.Text_IO.Editing *note F.3.3(8): 8240.
-Max_Scale in Ada.Decimal *note F.2(3): 8224.
+Max_Scale <in> Ada.Decimal *note F.2(3): 8224.
-Memory_Size in System *note 13.7(13): 5121.
+Memory_Size <in> System *note 13.7(13): 5121.
-Micro_Sign in Ada.Characters.Latin_1 *note A.3.3(22): 5653.
+Micro_Sign <in> Ada.Characters.Latin_1 *note A.3.3(22): 5653.
-Middle_Dot in Ada.Characters.Latin_1 *note A.3.3(22): 5656.
+Middle_Dot <in> Ada.Characters.Latin_1 *note A.3.3(22): 5656.
-Min_Delta in Ada.Decimal *note F.2(4): 8226.
+Min_Delta <in> Ada.Decimal *note F.2(4): 8226.
Min_Handler_Ceiling
- in Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8034.
- in Ada.Execution_Time.Timers *note D.14.1(6/2): 8018.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8034.
+ <in> Ada.Execution_Time.Timers *note D.14.1(6/2): 8018.
-Min_Int in System *note 13.7(6): 5108.
+Min_Int <in> System *note 13.7(6): 5108.
-Min_Scale in Ada.Decimal *note F.2(3): 8225.
+Min_Scale <in> Ada.Decimal *note F.2(3): 8225.
-Minus_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 5546.
+Minus_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 5546.
-Monday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4179.
+Monday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4179.
Multiplication_Sign
- in Ada.Characters.Latin_1 *note A.3.3(24): 5688.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5688.
-MW in Ada.Characters.Latin_1 *note A.3.3(18): 5619.
+MW <in> Ada.Characters.Latin_1 *note A.3.3(18): 5619.
-NAK in Ada.Characters.Latin_1 *note A.3.3(6): 5521.
+NAK <in> Ada.Characters.Latin_1 *note A.3.3(6): 5521.
-Native_Binary in Interfaces.COBOL *note B.4(25): 7572.
+Native_Binary <in> Interfaces.COBOL *note B.4(25): 7572.
-NBH in Ada.Characters.Latin_1 *note A.3.3(17): 5601.
+NBH <in> Ada.Characters.Latin_1 *note A.3.3(17): 5601.
-NBSP in Ada.Characters.Latin_1 *note A.3.3(21/3): 5631.
+NBSP <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5631.
-NEL in Ada.Characters.Latin_1 *note A.3.3(17): 5603.
+NEL <in> Ada.Characters.Latin_1 *note A.3.3(17): 5603.
No_Break_Space
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5630.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5630.
No_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 6826.
- in Ada.Containers.Hashed_Maps *note A.18.5(6/2): 6912.
- in Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7044.
- in Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7205.
- in Ada.Containers.Ordered_Maps *note A.18.6(7/2): 6965.
- in Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7117.
- in Ada.Containers.Vectors *note A.18.2(11/2): 6730.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 6826.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6/2): 6912.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7044.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7205.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7/2): 6965.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7117.
+ <in> Ada.Containers.Vectors *note A.18.2(11/2): 6730.
-No_Index in Ada.Containers.Vectors *note A.18.2(7/2): 6726.
+No_Index <in> Ada.Containers.Vectors *note A.18.2(7/2): 6726.
-No_Tag in Ada.Tags *note 3.9(6.1/2): 2102.
+No_Tag <in> Ada.Tags *note 3.9(6.1/2): 2102.
Not_A_Specific_CPU
- in System.Multiprocessors *note D.16(4/3): 8072.
+ <in> System.Multiprocessors *note D.16(4/3): 8072.
-Not_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 5643.
+Not_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5643.
NUL
- in Ada.Characters.Latin_1 *note A.3.3(5): 5500.
- in Interfaces.C *note B.3(20/1): 7452.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5500.
+ <in> Interfaces.C *note B.3(20/1): 7452.
-Null_Address in System *note 13.7(12): 5118.
+Null_Address <in> System *note 13.7(12): 5118.
Null_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(7): 5847.
+ <in> Ada.Strings.Bounded *note A.4.4(7): 5847.
-Null_Id in Ada.Exceptions *note 11.4.1(2/2): 4566.
+Null_Id <in> Ada.Exceptions *note 11.4.1(2/2): 4566.
-Null_Occurrence in Ada.Exceptions *note 11.4.1(3/2): 4572.
+Null_Occurrence <in> Ada.Exceptions *note 11.4.1(3/2): 4572.
-Null_Ptr in Interfaces.C.Strings *note B.3.1(7): 7500.
+Null_Ptr <in> Interfaces.C.Strings *note B.3.1(7): 7500.
Null_Set
- in Ada.Strings.Maps *note A.4.2(5): 5785.
- in Ada.Strings.Wide_Maps *note A.4.7(5): 5987.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6026.
+ <in> Ada.Strings.Maps *note A.4.2(5): 5785.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(5): 5987.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6026.
Null_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(5): 5904.
+ <in> Ada.Strings.Unbounded *note A.4.5(5): 5904.
-Number_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 5535.
+Number_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 5535.
-OSC in Ada.Characters.Latin_1 *note A.3.3(19): 5627.
+OSC <in> Ada.Characters.Latin_1 *note A.3.3(19): 5627.
-Packed_Signed in Interfaces.COBOL *note B.4(27): 7575.
+Packed_Signed <in> Interfaces.COBOL *note B.4(27): 7575.
-Packed_Unsigned in Interfaces.COBOL *note B.4(27): 7574.
+Packed_Unsigned <in> Interfaces.COBOL *note B.4(27): 7574.
Paragraph_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5655.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5655.
Percent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5537.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5537.
-Pi in Ada.Numerics *note A.5(3/2): 6108.
+Pi <in> Ada.Numerics *note A.5(3/2): 6108.
Pilcrow_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5654.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5654.
-PLD in Ada.Characters.Latin_1 *note A.3.3(17): 5609.
+PLD <in> Ada.Characters.Latin_1 *note A.3.3(17): 5609.
-PLU in Ada.Characters.Latin_1 *note A.3.3(17): 5610.
+PLU <in> Ada.Characters.Latin_1 *note A.3.3(17): 5610.
Plus_Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5649.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5649.
-Plus_Sign in Ada.Characters.Latin_1 *note A.3.3(8): 5543.
+Plus_Sign <in> Ada.Characters.Latin_1 *note A.3.3(8): 5543.
-PM in Ada.Characters.Latin_1 *note A.3.3(19): 5628.
+PM <in> Ada.Characters.Latin_1 *note A.3.3(19): 5628.
-Pound_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 5634.
+Pound_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5634.
-PU1 in Ada.Characters.Latin_1 *note A.3.3(18): 5615.
+PU1 <in> Ada.Characters.Latin_1 *note A.3.3(18): 5615.
-PU2 in Ada.Characters.Latin_1 *note A.3.3(18): 5616.
+PU2 <in> Ada.Characters.Latin_1 *note A.3.3(18): 5616.
-Question in Ada.Characters.Latin_1 *note A.3.3(10): 5554.
+Question <in> Ada.Characters.Latin_1 *note A.3.3(10): 5554.
-Quotation in Ada.Characters.Latin_1 *note A.3.3(8): 5534.
+Quotation <in> Ada.Characters.Latin_1 *note A.3.3(8): 5534.
Registered_Trade_Mark_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5645.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5645.
Reserved_128
- in Ada.Characters.Latin_1 *note A.3.3(17): 5598.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5598.
Reserved_129
- in Ada.Characters.Latin_1 *note A.3.3(17): 5599.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5599.
Reserved_132
- in Ada.Characters.Latin_1 *note A.3.3(17): 5602.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5602.
Reserved_153
- in Ada.Characters.Latin_1 *note A.3.3(19): 5623.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5623.
Reverse_Solidus
- in Ada.Characters.Latin_1 *note A.3.3(12): 5557.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5557.
-RI in Ada.Characters.Latin_1 *note A.3.3(17): 5611.
+RI <in> Ada.Characters.Latin_1 *note A.3.3(17): 5611.
Right_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(22): 5660.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5660.
Right_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 5590.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5590.
Right_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 5541.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5541.
Right_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 5558.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5558.
-Ring_Above in Ada.Characters.Latin_1 *note A.3.3(22): 5648.
+Ring_Above <in> Ada.Characters.Latin_1 *note A.3.3(22): 5648.
-RS in Ada.Characters.Latin_1 *note A.3.3(6): 5530.
+RS <in> Ada.Characters.Latin_1 *note A.3.3(6): 5530.
-Saturday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4184.
+Saturday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4184.
-SCHAR_MAX in Interfaces.C *note B.3(6): 7435.
+SCHAR_MAX <in> Interfaces.C *note B.3(6): 7435.
-SCHAR_MIN in Interfaces.C *note B.3(6): 7434.
+SCHAR_MIN <in> Interfaces.C *note B.3(6): 7434.
-SCI in Ada.Characters.Latin_1 *note A.3.3(19): 5624.
+SCI <in> Ada.Characters.Latin_1 *note A.3.3(19): 5624.
Section_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5638.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5638.
-Semicolon in Ada.Characters.Latin_1 *note A.3.3(10): 5550.
+Semicolon <in> Ada.Characters.Latin_1 *note A.3.3(10): 5550.
Separate_Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.2/3): 8009.
+ <in> Ada.Execution_Time *note D.14(9.2/3): 8009.
-SI in Ada.Characters.Latin_1 *note A.3.3(5): 5515.
+SI <in> Ada.Characters.Latin_1 *note A.3.3(5): 5515.
-SO in Ada.Characters.Latin_1 *note A.3.3(5): 5514.
+SO <in> Ada.Characters.Latin_1 *note A.3.3(5): 5514.
-Soft_Hyphen in Ada.Characters.Latin_1 *note A.3.3(21/3): 5644.
+Soft_Hyphen <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5644.
-SOH in Ada.Characters.Latin_1 *note A.3.3(5): 5501.
+SOH <in> Ada.Characters.Latin_1 *note A.3.3(5): 5501.
-Solidus in Ada.Characters.Latin_1 *note A.3.3(8): 5548.
+Solidus <in> Ada.Characters.Latin_1 *note A.3.3(8): 5548.
-SOS in Ada.Characters.Latin_1 *note A.3.3(19): 5622.
+SOS <in> Ada.Characters.Latin_1 *note A.3.3(19): 5622.
-SPA in Ada.Characters.Latin_1 *note A.3.3(18): 5620.
+SPA <in> Ada.Characters.Latin_1 *note A.3.3(18): 5620.
Space
- in Ada.Characters.Latin_1 *note A.3.3(8): 5532.
- in Ada.Strings *note A.4.1(4/2): 5771.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5532.
+ <in> Ada.Strings *note A.4.1(4/2): 5771.
Special_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5964.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5964.
-SS2 in Ada.Characters.Latin_1 *note A.3.3(17): 5612.
+SS2 <in> Ada.Characters.Latin_1 *note A.3.3(17): 5612.
-SS3 in Ada.Characters.Latin_1 *note A.3.3(17): 5613.
+SS3 <in> Ada.Characters.Latin_1 *note A.3.3(17): 5613.
-SSA in Ada.Characters.Latin_1 *note A.3.3(17): 5604.
+SSA <in> Ada.Characters.Latin_1 *note A.3.3(17): 5604.
-ST in Ada.Characters.Latin_1 *note A.3.3(19): 5626.
+ST <in> Ada.Characters.Latin_1 *note A.3.3(19): 5626.
-Storage_Unit in System *note 13.7(13): 5119.
+Storage_Unit <in> System *note 13.7(13): 5119.
-STS in Ada.Characters.Latin_1 *note A.3.3(18): 5617.
+STS <in> Ada.Characters.Latin_1 *note A.3.3(18): 5617.
-STX in Ada.Characters.Latin_1 *note A.3.3(5): 5502.
+STX <in> Ada.Characters.Latin_1 *note A.3.3(5): 5502.
-SUB in Ada.Characters.Latin_1 *note A.3.3(6): 5526.
+SUB <in> Ada.Characters.Latin_1 *note A.3.3(6): 5526.
-Success in Ada.Command_Line *note A.15(8): 6631.
+Success <in> Ada.Command_Line *note A.15(8): 6631.
-Sunday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4185.
+Sunday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4185.
Superscript_One
- in Ada.Characters.Latin_1 *note A.3.3(22): 5658.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5658.
Superscript_Three
- in Ada.Characters.Latin_1 *note A.3.3(22): 5651.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5651.
Superscript_Two
- in Ada.Characters.Latin_1 *note A.3.3(22): 5650.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5650.
-SYN in Ada.Characters.Latin_1 *note A.3.3(6): 5522.
+SYN <in> Ada.Characters.Latin_1 *note A.3.3(6): 5522.
System_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
8080.
-System_Name in System *note 13.7(4): 5107.
+System_Name <in> System *note 13.7(4): 5107.
-Thursday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4182.
+Thursday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4182.
Tick
- in Ada.Real_Time *note D.8(6): 7951.
- in System *note 13.7(10): 5116.
+ <in> Ada.Real_Time *note D.8(6): 7951.
+ <in> System *note 13.7(10): 5116.
-Tilde in Ada.Characters.Latin_1 *note A.3.3(14): 5591.
+Tilde <in> Ada.Characters.Latin_1 *note A.3.3(14): 5591.
-Time_First in Ada.Real_Time *note D.8(4): 7943.
+Time_First <in> Ada.Real_Time *note D.8(4): 7943.
-Time_Last in Ada.Real_Time *note D.8(4): 7944.
+Time_Last <in> Ada.Real_Time *note D.8(4): 7944.
-Time_Span_First in Ada.Real_Time *note D.8(5): 7947.
+Time_Span_First <in> Ada.Real_Time *note D.8(5): 7947.
-Time_Span_Last in Ada.Real_Time *note D.8(5): 7948.
+Time_Span_Last <in> Ada.Real_Time *note D.8(5): 7948.
-Time_Span_Unit in Ada.Real_Time *note D.8(5): 7950.
+Time_Span_Unit <in> Ada.Real_Time *note D.8(5): 7950.
-Time_Span_Zero in Ada.Real_Time *note D.8(5): 7949.
+Time_Span_Zero <in> Ada.Real_Time *note D.8(5): 7949.
-Time_Unit in Ada.Real_Time *note D.8(4): 7945.
+Time_Unit <in> Ada.Real_Time *note D.8(4): 7945.
Trailing_Nonseparate
- in Interfaces.COBOL *note B.4(23): 7568.
+ <in> Interfaces.COBOL *note B.4(23): 7568.
-Trailing_Separate in Interfaces.COBOL *note B.4(23): 7566.
+Trailing_Separate <in> Interfaces.COBOL *note B.4(23): 7566.
-Tuesday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4180.
+Tuesday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4180.
-UC_A_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 5666.
+UC_A_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 5666.
UC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5667.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5667.
UC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5669.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5669.
-UC_A_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 5665.
+UC_A_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 5665.
-UC_A_Ring in Ada.Characters.Latin_1 *note A.3.3(23): 5670.
+UC_A_Ring <in> Ada.Characters.Latin_1 *note A.3.3(23): 5670.
-UC_A_Tilde in Ada.Characters.Latin_1 *note A.3.3(23): 5668.
+UC_A_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(23): 5668.
UC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(23): 5671.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5671.
UC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(23): 5672.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5672.
-UC_E_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 5674.
+UC_E_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 5674.
UC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5675.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5675.
UC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5676.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5676.
-UC_E_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 5673.
+UC_E_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 5673.
-UC_I_Acute in Ada.Characters.Latin_1 *note A.3.3(23): 5678.
+UC_I_Acute <in> Ada.Characters.Latin_1 *note A.3.3(23): 5678.
UC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5679.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5679.
UC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5680.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5680.
-UC_I_Grave in Ada.Characters.Latin_1 *note A.3.3(23): 5677.
+UC_I_Grave <in> Ada.Characters.Latin_1 *note A.3.3(23): 5677.
UC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(24): 5681.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5681.
UC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(24): 5695.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5695.
-UC_N_Tilde in Ada.Characters.Latin_1 *note A.3.3(24): 5682.
+UC_N_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(24): 5682.
-UC_O_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 5684.
+UC_O_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 5684.
UC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 5685.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5685.
UC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 5687.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5687.
-UC_O_Grave in Ada.Characters.Latin_1 *note A.3.3(24): 5683.
+UC_O_Grave <in> Ada.Characters.Latin_1 *note A.3.3(24): 5683.
UC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(24): 5689.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5689.
-UC_O_Tilde in Ada.Characters.Latin_1 *note A.3.3(24): 5686.
+UC_O_Tilde <in> Ada.Characters.Latin_1 *note A.3.3(24): 5686.
-UC_U_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 5691.
+UC_U_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 5691.
UC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 5692.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5692.
UC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 5693.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5693.
-UC_U_Grave in Ada.Characters.Latin_1 *note A.3.3(24): 5690.
+UC_U_Grave <in> Ada.Characters.Latin_1 *note A.3.3(24): 5690.
-UC_Y_Acute in Ada.Characters.Latin_1 *note A.3.3(24): 5694.
+UC_Y_Acute <in> Ada.Characters.Latin_1 *note A.3.3(24): 5694.
-UCHAR_MAX in Interfaces.C *note B.3(6): 7436.
+UCHAR_MAX <in> Interfaces.C *note B.3(6): 7436.
-Unbounded in Ada.Text_IO *note A.10.1(5): 6379.
+Unbounded <in> Ada.Text_IO *note A.10.1(5): 6379.
-Unsigned in Interfaces.COBOL *note B.4(23): 7564.
+Unsigned <in> Interfaces.COBOL *note B.4(23): 7564.
Upper_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5967.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5967.
Upper_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5959.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5959.
-US in Ada.Characters.Latin_1 *note A.3.3(6): 5531.
+US <in> Ada.Characters.Latin_1 *note A.3.3(6): 5531.
Vertical_Line
- in Ada.Characters.Latin_1 *note A.3.3(14): 5589.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5589.
-VT in Ada.Characters.Latin_1 *note A.3.3(5): 5511.
+VT <in> Ada.Characters.Latin_1 *note A.3.3(5): 5511.
-VTS in Ada.Characters.Latin_1 *note A.3.3(17): 5608.
+VTS <in> Ada.Characters.Latin_1 *note A.3.3(17): 5608.
-Wednesday in Ada.Calendar.Formatting *note 9.6.1(17/2): 4181.
+Wednesday <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4181.
Wide_Character_Set
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6047.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6047.
-wide_nul in Interfaces.C *note B.3(31/1): 7462.
+wide_nul <in> Interfaces.C *note B.3(31/1): 7462.
-Wide_Space in Ada.Strings *note A.4.1(4/2): 5772.
+Wide_Space <in> Ada.Strings *note A.4.1(4/2): 5772.
-Wide_Wide_Space in Ada.Strings *note A.4.1(4/2): 5773.
+Wide_Wide_Space <in> Ada.Strings *note A.4.1(4/2): 5773.
-Word_Size in System *note 13.7(13): 5120.
+Word_Size <in> System *note 13.7(13): 5120.
-Yen_Sign in Ada.Characters.Latin_1 *note A.3.3(21/3): 5636.
+Yen_Sign <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5636.
File: arm2012.info, Node: Index, Prev: Annex Q, Up: Top
@@ -81083,7 +81236,7 @@ A
AARM *note 0.3(5/3): 1002.
abnormal completion *note 7.6.1(2/2): 3691.
abnormal state of an object *note 13.9.1(4): 5167.
- [partial] *note 9.8(21): 4294, *note 11.6(6/3): 4660, *note
+ [<partial>] *note 9.8(21): 4294, *note 11.6(6/3): 4660, *note
A.13(17): 6624.
abnormal task *note 9.8(4): 4284.
abort
@@ -81093,28 +81246,28 @@ abort
abort completion point *note 9.8(15): 4290.
abort-deferred operation *note 9.8(5): 4288.
abort_statement *note 9.8(2): 4277.
- used *note 5.1(4/2): 3131, *note P: 9366.
+ <used> *note 5.1(4/2): 3131, *note P: 9366.
Abort_Task
- in Ada.Task_Identification *note C.7.1(3/3): 7714.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7714.
abortable_part *note 9.7.4(5): 4264.
- used *note 9.7.4(2): 4257, *note P: 9643.
+ <used> *note 9.7.4(2): 4257, *note P: 9643.
abs operator *note 4.4(1/3): 2650, *note 4.5.6(1): 2860.
absolute value *note 4.4(1/3): 2652, *note 4.5.6(1): 2862.
abstract data type (ADT)
- See private types and private extensions *note 7.3(1): 3598.
- See also abstract type *note 3.9.3(1/2): 2180.
+ <See> private types and private extensions *note 7.3(1): 3598.
+ <See also> abstract type *note 3.9.3(1/2): 2180.
abstract subprogram *note 3.9.3(1/2): 2183, *note 3.9.3(3/2): 2191.
abstract type *note 3.9.3(1.2/2): 2189, *note 3.9.3(1/2): 2179, *note
N(1.1/2): 8879.
abstract_subprogram_declaration *note 3.9.3(1.1/3): 2185.
- used *note 3.1(3/3): 1298, *note P: 9014.
+ <used> *note 3.1(3/3): 1298, *note P: 9014.
accept_alternative *note 9.7.1(5): 4227.
- used *note 9.7.1(4): 4224, *note P: 9627.
+ <used> *note 9.7.1(4): 4224, *note P: 9627.
accept_statement *note 9.5.2(3): 4044.
- used *note 5.1(5/2): 3140, *note 9.7.1(5): 4228, *note P: 9630.
+ <used> *note 5.1(5/2): 3140, *note 9.7.1(5): 4228, *note P: 9630.
acceptable interpretation *note 8.6(14): 3852.
Access attribute *note 3.10.2(25/1): 2307, *note 3.10.2(33/3): 2317.
- See also Unchecked_Access attribute *note 13.10(3): 5182.
+ <See also> Unchecked_Access attribute *note 13.10(3): 5182.
access discriminant *note 3.7(9/2): 1986.
access parameter *note 6.1(24/2): 3340.
access paths
@@ -81130,18 +81283,20 @@ access-to-object type *note 3.10(7/1): 2247.
access-to-subprogram type *note 3.10(7/1): 2248, *note 3.10(11): 2260.
access-to-variable type *note 3.10(10): 2259.
Access_Check *note 11.5(11/2): 4629.
- [partial] *note 4.1(13): 2390, *note 4.1.5(8/3): 2459, *note
+ [<partial>] *note 4.1(13): 2390, *note 4.1.5(8/3): 2459, *note
4.6(51/4): 3004, *note 4.8(10.4/3): 3078.
access_definition *note 3.10(6/2): 2240.
- used *note 3.3.1(2/3): 1485, *note 3.6(7/2): 1905, *note 3.7(5/2):
-1980, *note 6.1(13/2): 3315, *note 6.1(15/3): 3326, *note 6.5(2.3/2):
-3508, *note 8.5.1(2/3): 3805, *note 12.4(2/3): 4750, *note P: 9520.
+ <used> *note 3.3.1(2/3): 1485, *note 3.6(7/2): 1905, *note
+3.7(5/2): 1980, *note 6.1(13/2): 3315, *note 6.1(15/3): 3326, *note
+6.5(2.3/2): 3508, *note 8.5.1(2/3): 3805, *note 12.4(2/3): 4750, *note
+P: 9520.
access_to_object_definition *note 3.10(3): 2232.
- used *note 3.10(2/2): 2229, *note P: 9169.
+ <used> *note 3.10(2/2): 2229, *note P: 9169.
access_to_subprogram_definition *note 3.10(5): 2236.
- used *note 3.10(2/2): 2231, *note P: 9171.
+ <used> *note 3.10(2/2): 2231, *note P: 9171.
access_type_definition *note 3.10(2/2): 2227.
- used *note 3.2.1(4/2): 1386, *note 12.5.4(2): 4821, *note P: 9038.
+ <used> *note 3.2.1(4/2): 1386, *note 12.5.4(2): 4821, *note P:
+9038.
accessibility
distributed *note 3.10.2(33.1/3): 2322.
from shared passive library units *note E.2.1(8): 8130.
@@ -81153,14 +81308,14 @@ accessibility rule
type conversion *note 4.6(24.17/4): 2955, *note 4.6(24.21/4): 2961.
type conversion, array components *note 4.6(24.6/2): 2950.
Accessibility_Check *note 11.5(19.1/2): 4638.
- [partial] *note 3.10.2(30): 2312, *note 4.6(39.1/2): 2982, *note
+ [<partial>] *note 3.10.2(30): 2312, *note 4.6(39.1/2): 2982, *note
4.6(48/3): 2996, *note 4.8(10.1/3): 3069, *note 6.5(8/4): 3526, *note
6.5(21/3): 3532, *note 13.11.4(25/3): 5278, *note 13.11.4(26/3): 5280,
*note E.4(18/1): 8192.
accessible partition *note E.1(7): 8107.
accuracy *note 4.6(32): 2972, *note G.2(1): 8329.
ACK
- in Ada.Characters.Latin_1 *note A.3.3(5): 5506.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5506.
acquire
execution resource associated with protected object *note
9.5.1(5/4): 4031.
@@ -81168,7 +81323,7 @@ activation
of a task *note 9.2(1): 3935.
activation failure *note 9.2(1): 3937.
Activation_Is_Complete
- in Ada.Task_Identification *note C.7.1(4/3): 7717.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7717.
activator
of a task *note 9.2(5): 3938.
active locale *note A.19(8/3): 7377.
@@ -81182,12 +81337,12 @@ actual subtype *note 3.3(23/3): 1466, *note
12.5(4): 4791.
of an object *note 3.3.1(9/2): 1506.
actual type *note 12.5(4): 4793.
actual_parameter_part *note 6.4(4): 3454.
- used *note 4.1.6(10/3): 2470, *note 6.4(2): 3449, *note 6.4(3):
+ <used> *note 4.1.6(10/3): 2470, *note 6.4(2): 3449, *note 6.4(3):
3453, *note 9.5.3(2): 4094, *note P: 9453.
Actual_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7817.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7817.
Acute
- in Ada.Characters.Latin_1 *note A.3.3(22): 5652.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5652.
Ada *note A.2(2): 5456.
Ada calling convention *note 6.3.1(3/3): 3419.
Ada.Ada.Unchecked_Deallocate_Subpool *note 13.11.5(3/3): 5287.
@@ -81367,7 +81522,7 @@ Ada.Text_IO.Text_Streams *note A.12.2(3): 6604.
Ada.Text_IO.Unbounded_IO *note A.10.12(3/2): 6546.
Ada.Unchecked_Conversion *note 13.9(3/3): 5159.
Ada.Unchecked_Deallocate_Subpool
- child of Ada *note 13.11.5(3/3): 5287.
+ <child of> Ada *note 13.11.5(3/3): 5287.
Ada.Unchecked_Deallocation *note 13.11.2(3/3): 5228.
Ada.Wide_Characters *note A.3.1(4/2): 5458.
Ada.Wide_Characters.Handling *note A.3.5(3/3): 5748.
@@ -81386,43 +81541,43 @@ Ada.Wide_Wide_Text_IO.Editing *note F.3.5(1/2):
8255.
Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 6610.
Ada.Wide_Wide_Text_IO.Unbounded_IO *note A.11(5/3): 6564.
Ada_To_COBOL
- in Interfaces.COBOL *note B.4(14): 7555.
+ <in> Interfaces.COBOL *note B.4(14): 7555.
adafinal *note B.1(39/3): 7417.
adainit *note B.1(39/3): 7416.
Add
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8041.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8041.
Add_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8035.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8035.
address
arithmetic *note 13.7.1(6): 5137.
comparison *note 13.7(14/3): 5122.
- in System *note 13.7(12): 5117.
+ <in> System *note 13.7(12): 5117.
Address aspect *note 13.3(12): 4983.
Address attribute *note 13.3(11): 4979, *note J.7.1(5): 8510.
Address clause *note 13.3(7/2): 4959, *note 13.3(12): 4981.
Address_To_Access_Conversions
- child of System *note 13.7.2(2): 5144.
+ <child of> System *note 13.7.2(2): 5144.
Adjacent attribute *note A.5.3(48): 6237.
Adjust *note 7.6(2): 3660.
- in Ada.Finalization *note 7.6(6/2): 3664.
+ <in> Ada.Finalization *note 7.6(6/2): 3664.
adjusting the value of an object *note 7.6(15): 3674, *note 7.6(16/3):
3676.
adjustment *note 7.6(15): 3675, *note 7.6(16/3): 3677.
as part of assignment *note 5.2(14/3): 3168.
ADT (abstract data type)
- See private types and private extensions *note 7.3(1): 3599.
- See also abstract type *note 3.9.3(1/2): 2181.
+ <See> private types and private extensions *note 7.3(1): 3599.
+ <See also> abstract type *note 3.9.3(1/2): 2181.
advice *note 1.1.2(37): 1048.
Aft attribute *note 3.5.10(5): 1875.
aggregate *note 4.3(1): 2492, *note 4.3(2): 2494.
- used *note 4.4(7/3): 2712, *note 4.7(2): 3029, *note 6.8(2/4):
+ <used> *note 4.4(7/3): 2712, *note 4.7(2): 3029, *note 6.8(2/4):
3558, *note P: 9344.
- See also composite type *note 3.2(2/2): 1338.
+ <See also> composite type *note 3.2(2/2): 1338.
aliased *note 3.10(9/3): 2255, *note N(3): 8881.
aliasing
- See distinct access paths *note 6.2(12/3): 3399.
+ <See> distinct access paths *note 6.2(12/3): 3399.
Alignment
- in Ada.Strings *note A.4.1(6): 5778.
+ <in> Ada.Strings *note A.4.1(6): 5778.
Alignment (subtype) aspect *note 13.3(26.4/2): 4995.
Alignment attribute *note 13.3(23/2): 4987, *note 13.3(26.2/2): 4991.
Alignment clause *note 13.3(7/2): 4960, *note 13.3(25/2): 4989, *note
@@ -81431,26 +81586,26 @@ All_Calls_Remote aspect *note E.2.3(16/3): 8165.
All_Calls_Remote pragma *note E.2.3(5): 8153, *note L(2): 8696.
All_Checks *note 11.5(25/3): 4643.
Allocate
- in System.Storage_Pools *note 13.11(7): 5189.
- in System.Storage_Pools.Subpools *note 13.11.4(14/3): 5266.
+ <in> System.Storage_Pools *note 13.11(7): 5189.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(14/3): 5266.
Allocate_From_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(11/3): 5263.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(11/3): 5263.
Allocation_Check *note 11.5(19.2/2): 4639.
- [partial] *note 4.8(10.2/2): 3072, *note 4.8(10.3/2): 3075, *note
+ [<partial>] *note 4.8(10.2/2): 3072, *note 4.8(10.3/2): 3075, *note
4.8(10.4/3): 3080, *note 13.11.4(30/3): 5283.
allocator *note 4.8(2/3): 3043.
- used *note 4.4(7/3): 2714, *note P: 9313.
+ <used> *note 4.4(7/3): 2714, *note P: 9313.
Alphanumeric
- in Interfaces.COBOL *note B.4(16/3): 7557.
+ <in> Interfaces.COBOL *note B.4(16/3): 7557.
alphanumeric character
a category of Character *note A.3.2(31): 5496.
Alphanumeric_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5963.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5963.
ambiguous *note 8.6(30): 3872.
ambiguous cursor
of a vector *note A.18.2(240/2): 6811.
ampersand *note 2.1(15/3): 1153.
- in Ada.Characters.Latin_1 *note A.3.3(8): 5538.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5538.
ampersand operator *note 4.4(1/3): 2627, *note 4.5.3(3): 2817.
ancestor *note N(3.1/2): 8882.
of a library unit *note 10.1.1(11): 4357.
@@ -81463,9 +81618,9 @@ ancestor subtype
ancestor type
of an extension_aggregate *note 4.3.2(5/3): 2535.
Ancestor_Find
- in Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7233.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(40/3): 7233.
ancestor_part *note 4.3.2(3): 2530.
- used *note 4.3.2(2): 2528, *note P: 9245.
+ <used> *note 4.3.2(2): 2528, *note P: 9245.
and operator *note 4.4(1/3): 2583, *note 4.5.1(2): 2745.
and then (short-circuit control form) *note 4.4(1/3): 2589, *note
4.5.1(1): 2740.
@@ -81481,24 +81636,24 @@ anonymous array type *note 3.3.1(1/3): 1476.
anonymous protected type *note 3.3.1(1/3): 1478.
anonymous task type *note 3.3.1(1/3): 1477.
anonymous type *note 3.2.1(7/2): 1391.
-Any_Priority subtype of Integer
- in System *note 13.7(16): 5127.
+Any_Priority <subtype of> Integer
+ <in> System *note 13.7(16): 5127.
APC
- in Ada.Characters.Latin_1 *note A.3.3(19): 5629.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5629.
apostrophe *note 2.1(15/3): 1154.
- in Ada.Characters.Latin_1 *note A.3.3(8): 5539.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5539.
Append
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 6846.
- in Ada.Containers.Vectors *note A.18.2(46/2): 6769, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(23/2): 6846.
+ <in> Ada.Containers.Vectors *note A.18.2(46/2): 6769, *note
A.18.2(47/2): 6770.
- in Ada.Strings.Bounded *note A.4.4(13): 5853, *note A.4.4(14):
+ <in> Ada.Strings.Bounded *note A.4.4(13): 5853, *note A.4.4(14):
5854, *note A.4.4(15): 5855, *note A.4.4(16): 5856, *note A.4.4(17):
5857, *note A.4.4(18): 5858, *note A.4.4(19): 5859, *note A.4.4(20):
5860.
- in Ada.Strings.Unbounded *note A.4.5(12): 5912, *note A.4.5(13):
+ <in> Ada.Strings.Unbounded *note A.4.5(12): 5912, *note A.4.5(13):
5913, *note A.4.5(14): 5914.
Append_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7245.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(52/3): 7245.
applicable index constraint *note 4.3.3(10): 2568.
application areas *note 1.1.2(7): 1008.
applies
@@ -81520,68 +81675,76 @@ arbitrary order *note 1.1.4(18): 1069.
7.6.1(11.1/3): 3704, *note 7.6.1(20.2/3): 3712, *note 9.7.1(15): 4237,
*note 9.8(4): 4282, *note 12.3(20): 4737, *note 13.11.5(7/3): 5288.
Arccos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8295.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6125.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6125.
Arccosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8303.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6136.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6136.
Arccot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8297.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6129.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6129.
Arccoth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8305.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6138.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6138.
Arcsin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8294.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6124.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6124.
Arcsinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8302.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6135.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6135.
Arctan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(5): 8296.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6): 6128.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(6):
+6128.
Arctanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(7): 8304.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6137.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6137.
Argument
- in Ada.Command_Line *note A.15(5): 6628.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8396,
+ <in> Ada.Command_Line *note A.15(5): 6628.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8396,
*note G.3.2(31/2): 8410.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 8273.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(10): 8273.
argument of a pragma *note 2.8(9): 1275.
Argument_Count
- in Ada.Command_Line *note A.15(4): 6627.
+ <in> Ada.Command_Line *note A.15(4): 6627.
Argument_Error
- in Ada.Numerics *note A.5(3/2): 6107.
+ <in> Ada.Numerics *note A.5(3/2): 6107.
Arithmetic
- child of Ada.Calendar *note 9.6.1(8/2): 4173.
+ <child of> Ada.Calendar *note 9.6.1(8/2): 4173.
array *note 3.6(1): 1885.
array component expression *note 4.3.3(6): 2563.
array component iterator *note 5.5.2(3/3): 3245.
array for a loop *note 5.5.2(11/3): 3255.
array indexing
- See indexed_component *note 4.1.1(1): 2393.
+ <See> indexed_component *note 4.1.1(1): 2393.
array slice *note 4.1.2(1): 2406.
array type *note 3.6(1): 1886, *note N(4): 8883.
array_aggregate *note 4.3.3(2): 2542.
- used *note 4.3(2): 2497, *note 13.4(3): 5042, *note P: 9823.
+ <used> *note 4.3(2): 2497, *note 13.4(3): 5042, *note P: 9823.
array_component_association *note 4.3.3(5/2): 2557.
- used *note 4.3.3(4): 2556, *note P: 9259.
+ <used> *note 4.3.3(4): 2556, *note P: 9259.
array_type_definition *note 3.6(2): 1887.
- used *note 3.2.1(4/2): 1384, *note 3.3.1(2/3): 1489, *note
+ <used> *note 3.2.1(4/2): 1384, *note 3.3.1(2/3): 1489, *note
12.5.3(2): 4817, *note P: 9777.
ASCII
package physically nested within the declaration of Standard *note
A.1(36.3/2): 5446.
- in Standard *note A.1(36.3/2): 5445.
+ <in> Standard *note A.1(36.3/2): 5445.
aspect *note 13.1(0.1/3): 4867, *note K.1(1/3): 8648, *note N(4.1/3):
8884.
class-wide *note 13.1.1(28/4): 4934.
@@ -81589,15 +81752,15 @@ aspect *note 13.1(0.1/3): 4867, *note K.1(1/3):
8648, *note N(4.1/3):
predicate *note 3.2.4(1/3): 1435.
aspect of representation *note 13.1(8/3): 4886.
aspect_clause *note 13.1(2/1): 4872.
- used *note 3.8(5/1): 2035, *note 3.11(4/1): 2334, *note 9.1(5/1):
+ <used> *note 3.8(5/1): 2035, *note 3.11(4/1): 2334, *note 9.1(5/1):
3910, *note 9.4(5/1): 3973, *note 9.4(8/4): 3988, *note P: 9188.
aspect_definition *note 13.1.1(4/3): 4918.
- used *note 13.1.1(2/3): 4913, *note P: 9810.
+ <used> *note 13.1.1(2/3): 4913, *note P: 9810.
aspect_mark *note 13.1.1(3/3): 4916.
- used *note 2.8(3/3): 1270, *note 11.4.2(6.1/3): 4598, *note
+ <used> *note 2.8(3/3): 1270, *note 11.4.2(6.1/3): 4598, *note
13.1.1(2/3): 4912, *note L(2.3/3): 8707, *note P: 9809.
aspect_specification *note 13.1.1(2/3): 4911.
- used *note 3.2.1(3/3): 1377, *note 3.2.2(2/3): 1403, *note
+ <used> *note 3.2.1(3/3): 1377, *note 3.2.2(2/3): 1403, *note
3.3.1(2/3): 1487, *note 3.8(6/3): 2040, *note 3.9.3(1.1/3): 2188, *note
6.1(2/3): 3284, *note 6.3(2/3): 3405, *note 6.7(2/3): 3546, *note
6.8(2/4): 3555, *note 7.1(3/3): 3575, *note 7.2(2/3): 3588, *note
@@ -81686,7 +81849,7 @@ aspects
Write'Class *note 13.13.2(38/4): 5388.
assembly language *note C.1(4/3): 7627.
Assert
- in Ada.Assertions *note 11.4.2(14/2): 4607.
+ <in> Ada.Assertions *note 11.4.2(14/2): 4607.
Assert pragma *note 11.4.2(3/2): 4590, *note L(2.1/2): 8699.
assertion *note N(4.2/3): 8885.
assertion expressions *note 11.4.2(1.1/3): 4588.
@@ -81697,23 +81860,23 @@ Assertion_Error
raised by failure of run-time check *note 3.2.4(31.1/4): 1453,
*note 4.6(57/4): 3019, *note 6.1.1(32/3): 3374, *note 6.1.1(33/3): 3377,
*note 6.1.1(35/3): 3384, *note 7.3.2(22/3): 3639.
- in Ada.Assertions *note 11.4.2(13/2): 4605.
+ <in> Ada.Assertions *note 11.4.2(13/2): 4605.
Assertion_Policy pragma *note 11.4.2(6.1/3): 4597, *note 11.4.2(6/2):
4594, *note L(2.2/2): 8703, *note L(2.3/3): 8706.
assertions *note 11.4.2(1.1/3): 4587.
- child of Ada *note 11.4.2(12/2): 4604.
+ <child of> Ada *note 11.4.2(12/2): 4604.
Assign
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 6839.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 6930.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7058.
- in Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7298.
- in Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7225.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 6981.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7129.
- in Ada.Containers.Vectors *note A.18.2(34.7/3): 6756.
- See assignment operation *note 5.2(3): 3154.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.5/3): 6839.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.7/3): 6930.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.3/3): 7058.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(20/3): 7298.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(32/3): 7225.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.7/3): 6981.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.3/3): 7129.
+ <in> Ada.Containers.Vectors *note A.18.2(34.7/3): 6756.
+ <See> assignment operation *note 5.2(3): 3154.
Assign_Task
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(11/3):
8088.
assigning back of parameters *note 6.4.1(17): 3491.
assignment
@@ -81734,7 +81897,7 @@ mode in *note 12.4(11): 4765.
during execution of an assignment_statement *note 5.2(12): 3167.
during parameter copy back *note 6.4.1(17): 3492.
assignment_statement *note 5.2(2): 3150.
- used *note 5.1(4/2): 3123, *note P: 9358.
+ <used> *note 5.1(4/2): 3123, *note P: 9358.
associated components
of a record_component_association *note 4.3.1(10): 2522.
associated declaration
@@ -81747,19 +81910,19 @@ associated entity
associated object
of a value of a by-reference type *note 6.2(10/4): 3395.
asterisk *note 2.1(15/3): 1158.
- in Ada.Characters.Latin_1 *note A.3.3(8): 5542.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5542.
asynchronous
remote procedure call *note E.4.1(9/3): 8201.
Asynchronous aspect *note E.4.1(8.1/3): 8199.
Asynchronous pragma *note J.15.13(2/3): 8646, *note L(3.1/3): 8712.
asynchronous remote procedure call *note E.4(1): 8179.
asynchronous_select *note 9.7.4(2): 4255.
- used *note 9.7(2): 4213, *note P: 9620.
+ <used> *note 9.7(2): 4213, *note P: 9620.
Asynchronous_Task_Control
- child of Ada *note D.11(3/2): 7988.
+ <child of> Ada *note D.11(3/2): 7988.
at-most-once execution *note E.4(11): 8188.
at_clause *note J.7(1): 8505.
- used *note 13.1(2/1): 4876, *note P: 9802.
+ <used> *note 13.1(2/1): 4876, *note P: 9802.
atomic *note C.6(7/3): 7700.
Atomic aspect *note C.6(6.2/3): 7689.
Atomic pragma *note J.15.8(2/3): 8598, *note L(4.1/3): 8715.
@@ -81767,7 +81930,7 @@ Atomic_Components aspect *note C.6(6.6/3): 7695.
Atomic_Components pragma *note J.15.8(5/3): 8607, *note L(5.1/3):
8718.
Attach_Handler
- in Ada.Interrupts *note C.3.2(7): 7665.
+ <in> Ada.Interrupts *note C.3.2(7): 7665.
Attach_Handler aspect *note C.3.1(6.3/3): 7644.
Attach_Handler pragma *note J.15.7(4/3): 8592, *note L(6.1/3): 8721.
attaching
@@ -81778,14 +81941,14 @@ attribute *note 4.1.4(1): 2433, *note K.2(1/3):
8649.
specifying *note 13.3(1/1): 4944.
stream-oriented *note 13.13.2(1/3): 5343.
attribute_definition_clause *note 13.3(2): 4945.
- used *note 13.1(2/1): 4873, *note P: 9799.
+ <used> *note 13.1(2/1): 4873, *note P: 9799.
attribute_designator *note 4.1.4(3/2): 2437.
- used *note 4.1.4(2): 2436, *note 13.1(3): 4880, *note 13.3(2):
+ <used> *note 4.1.4(2): 2436, *note 13.1(3): 4880, *note 13.3(2):
4950, *note P: 9819.
Attribute_Handle
- in Ada.Task_Attributes *note C.7.2(3): 7729.
+ <in> Ada.Task_Attributes *note C.7.2(3): 7729.
attribute_reference *note 4.1.4(2): 2434.
- used *note 4.1(2/3): 2365, *note P: 9201.
+ <used> *note 4.1(2/3): 2365, *note P: 9201.
attributes
Access *note 3.10.2(25/1): 2306, *note 3.10.2(33/3): 2316.
Address *note 13.3(11): 4978, *note J.7.1(5): 8509.
@@ -81909,10 +82072,10 @@ Backus-Naur Form (BNF)
cross reference *note P: 9850.
notation *note 1.1.4(3): 1064.
under Syntax heading *note 1.1.2(25): 1018.
-Barrier_Limit subtype of Positive
- in Ada.Synchronous_Barriers *note D.10.1(4/3): 7985.
+Barrier_Limit <subtype of> Positive
+ <in> Ada.Synchronous_Barriers *note D.10.1(4/3): 7985.
base *note 2.4.2(3): 1238, *note 2.4.2(6): 1246.
- used *note 2.4.2(2): 1234, *note P: 8985.
+ <used> *note 2.4.2(2): 1234, *note P: 8985.
base 16 literal *note 2.4.2(1): 1231.
base 2 literal *note 2.4.2(1): 1225.
base 8 literal *note 2.4.2(1): 1228.
@@ -81933,24 +82096,24 @@ base range
base subtype
of a type *note 3.5(15): 1619.
Base_Name
- in Ada.Directories *note A.16(19/2): 6649.
+ <in> Ada.Directories *note A.16(19/2): 6649.
based_literal *note 2.4.2(2): 1233.
- used *note 2.4(2): 1209, *note P: 8976.
+ <used> *note 2.4(2): 1209, *note P: 8976.
based_numeral *note 2.4.2(4): 1240.
- used *note 2.4.2(2): 1236, *note P: 8987.
+ <used> *note 2.4.2(2): 1236, *note P: 8987.
basic letter
a category of Character *note A.3.2(27): 5493.
basic_declaration *note 3.1(3/3): 1292.
- used *note 3.11(4/1): 2333, *note P: 9187.
+ <used> *note 3.11(4/1): 2333, *note P: 9187.
basic_declarative_item *note 3.11(4/1): 2332.
- used *note 3.11(3): 2330, *note 7.1(3/3): 3576, *note P: 9486.
+ <used> *note 3.11(3): 2330, *note 7.1(3/3): 3576, *note P: 9486.
Basic_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5968.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5968.
Basic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5960.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5960.
become nonlimited *note 7.3.1(5/1): 3621, *note 7.5(16): 3649.
BEL
- in Ada.Characters.Latin_1 *note A.3.3(5): 5507.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5507.
belong
to a range *note 3.5(4): 1596.
to a subtype *note 3.2(8/2): 1359.
@@ -81960,21 +82123,21 @@ bibliography *note 1.2(1/3): 1087.
big endian *note 13.5.3(2): 5090.
binary
literal *note 2.4.2(1): 1226.
- in Interfaces.COBOL *note B.4(10): 7548.
+ <in> Interfaces.COBOL *note B.4(10): 7548.
binary adding operator *note 4.5.3(1): 2805.
binary literal *note 2.4.2(1): 1224.
binary operator *note 4.5(9): 2732.
binary_adding_operator *note 4.5(4): 2726.
- used *note 4.4(4): 2698, *note P: 9300.
+ <used> *note 4.4(4): 2698, *note P: 9300.
Binary_Format
- in Interfaces.COBOL *note B.4(24): 7569.
+ <in> Interfaces.COBOL *note B.4(24): 7569.
bit field
- See record_representation_clause *note 13.5.1(1): 5058.
+ <See> record_representation_clause *note 13.5.1(1): 5058.
bit ordering *note 13.5.3(2): 5088.
bit string
- See logical operators on boolean arrays *note 4.5.1(2): 2751.
+ <See> logical operators on boolean arrays *note 4.5.1(2): 2751.
Bit_Order
- in System *note 13.7(15/2): 5123.
+ <in> System *note 13.7(15/2): 5123.
Bit_Order aspect *note 13.5.3(4): 5100.
Bit_Order attribute *note 13.5.3(4): 5096.
Bit_Order clause *note 13.3(7/2): 4965, *note 13.5.3(4): 5098.
@@ -81982,11 +82145,11 @@ blank
in text input for enumeration and numeric types *note A.10.6(5/2):
6530.
Blank_When_Zero
- in Ada.Text_IO.Editing *note F.3.3(7): 8239.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8239.
block_statement *note 5.6(2): 3260.
- used *note 5.1(5/2): 3138, *note P: 9372.
+ <used> *note 5.1(5/2): 3138, *note P: 9372.
blocked
- [partial] *note D.2.1(11/3): 7783.
+ [<partial>] *note D.2.1(11/3): 7783.
a task state *note 9(10): 3886.
during an entry call *note 9.5.3(19): 4114.
execution of a selective_accept *note 9.7.1(16): 4238.
@@ -82008,23 +82171,23 @@ BNF (Backus-Naur Form)
notation *note 1.1.4(3): 1063.
under Syntax heading *note 1.1.2(25): 1017.
body *note 3.11(5): 2336, *note 3.11.1(1/3): 2355.
- used *note 3.11(3): 2331, *note P: 9186.
+ <used> *note 3.11(3): 2331, *note P: 9186.
body_stub *note 10.1.3(2): 4387.
- used *note 3.11(5): 2338, *note P: 9191.
+ <used> *note 3.11(5): 2338, *note P: 9191.
Body_Version attribute *note E.3(4): 8172.
BOM_16
- in Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6073.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(12/3): 6073.
BOM_16BE
- in Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6071.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(10/3): 6071.
BOM_16LE
- in Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6072.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(11/3): 6072.
BOM_8
- in Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6070.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(9/3): 6070.
Boolean *note 3.5.3(1): 1713.
- in Standard *note A.1(5): 5437.
+ <in> Standard *note A.1(5): 5437.
boolean type *note 3.5.3(1): 1716.
Bounded
- child of Ada.Strings *note A.4.4(3): 5843.
+ <child of> Ada.Strings *note A.4.4(3): 5843.
bounded error *note 1.1.2(31): 1039, *note 1.1.5(8): 1078.
cause *note 4.8(11.1/2): 3084, *note 6.2(12/3): 3400, *note
7.6.1(14/1): 3706, *note 9.4(20.1/2): 4009, *note 9.5.1(8): 4034, *note
@@ -82042,18 +82205,18 @@ A.18.24(12/3): 7326, *note A.18.25(14/3): 7328, *note
C.7.1(17/3): 7725,
*note C.7.2(13.2/1): 7736, *note D.2.6(30/2): 7829, *note D.3(13.1/2):
7848, *note E.1(10/2): 8110, *note E.3(6): 8175, *note J.7.1(11): 8515.
Bounded_IO
- child of Ada.Text_IO *note A.10.11(3/2): 6537.
- child of Ada.Wide_Text_IO *note A.11(4/3): 6561.
- child of Ada.Wide_Wide_Text_IO *note A.11(4/3): 6562.
+ <child of> Ada.Text_IO *note A.10.11(3/2): 6537.
+ <child of> Ada.Wide_Text_IO *note A.11(4/3): 6561.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(4/3): 6562.
Bounded_Priority_Queues
- child of Ada.Containers *note A.18.31(2/3): 7362.
+ <child of> Ada.Containers *note A.18.31(2/3): 7362.
Bounded_Slice
- in Ada.Strings.Bounded *note A.4.4(28.1/2): 5864, *note
+ <in> Ada.Strings.Bounded *note A.4.4(28.1/2): 5864, *note
A.4.4(28.2/2): 5865.
Bounded_String
- in Ada.Strings.Bounded *note A.4.4(6): 5846.
+ <in> Ada.Strings.Bounded *note A.4.4(6): 5846.
Bounded_Synchronized_Queues
- child of Ada.Containers *note A.18.29(2/3): 7349.
+ <child of> Ada.Containers *note A.18.29(2/3): 7349.
bounds
of a discrete_range *note 3.6.1(6): 1940.
of an array *note 3.6(13): 1914.
@@ -82061,25 +82224,25 @@ bounds
box
compound delimiter *note 3.6(15): 1919.
BPH
- in Ada.Characters.Latin_1 *note A.3.3(17): 5600.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5600.
broadcast signal
- See protected object *note 9.4(1): 3954.
- See requeue *note 9.5.4(1): 4119.
+ <See> protected object *note 9.4(1): 3954.
+ <See> requeue *note 9.5.4(1): 4119.
Broken_Bar
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5637.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5637.
BS
- in Ada.Characters.Latin_1 *note A.3.3(5): 5508.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5508.
budget *note D.14.2(14/2): 8049.
Budget_Has_Expired
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8042.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8042.
Budget_Remaining
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8043.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8043.
Buffer_Size
- in Ada.Storage_IO *note A.9(4): 6356.
-Buffer_Type subtype of Storage_Array
- in Ada.Storage_IO *note A.9(4): 6357.
+ <in> Ada.Storage_IO *note A.9(4): 6356.
+Buffer_Type <subtype of> Storage_Array
+ <in> Ada.Storage_IO *note A.9(4): 6357.
build-in-place
- See built in place
+ <See> built in place
built in place *note 7.6(17.1/3): 3680.
by copy parameter passing *note 6.2(2): 3388.
by reference parameter passing *note 6.2(2): 3391.
@@ -82087,12 +82250,12 @@ by-copy type *note 6.2(3/3): 3393.
by-reference type *note 6.2(4): 3394.
atomic or volatile *note C.6(18): 7706.
Byte
- in Interfaces.COBOL *note B.4(29/3): 7576.
- See storage element *note 13.3(8): 4975.
+ <in> Interfaces.COBOL *note B.4(29/3): 7576.
+ <See> storage element *note 13.3(8): 4975.
byte sex
- See ordering of storage elements in a word *note 13.5.3(5): 5101.
+ <See> ordering of storage elements in a word *note 13.5.3(5): 5101.
Byte_Array
- in Interfaces.COBOL *note B.4(29/3): 7577.
+ <in> Interfaces.COBOL *note B.4(29/3): 7577.
@@ -82104,15 +82267,15 @@ C
C
- child of Interfaces *note B.3(4): 7432.
+ <child of> Interfaces *note B.3(4): 7432.
C interface *note B.3(1/4): 7431.
C standard *note 1.2(7/3): 1113.
C++ standard *note 1.2(9/3): 1119.
C_float
- in Interfaces.C *note B.3(15): 7448.
+ <in> Interfaces.C *note B.3(15): 7448.
C_Variadic *note B.3(60.16/4): 7494.
Calendar
- child of Ada *note 9.6(10): 4145.
+ <child of> Ada *note 9.6(10): 4145.
call *note 6(2/3): 3279.
master of *note 3.10.2(10.1/3): 2298.
call on a dispatching operation *note 3.9.2(2/3): 2159.
@@ -82131,11 +82294,11 @@ calling convention *note 6.3.1(2/1): 3418, *note
B.1(11/3): 7405.
calling partition *note E.4(1): 8180.
calling stub *note E.4(10): 8186.
CAN
- in Ada.Characters.Latin_1 *note A.3.3(6): 5524.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5524.
Cancel_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8046.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8022.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8064.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8046.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8022.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8064.
cancellation
of a delay_statement *note 9.6(22/3): 4164.
of an entry call *note 9.5.3(20): 4115.
@@ -82149,25 +82312,25 @@ capacity
of a hashed set *note A.18.8(63/2): 7100.
of a queue *note A.18.27(10/3): 7342.
of a vector *note A.18.2(2/2): 6722.
- in Ada.Containers.Hashed_Maps *note A.18.5(8/2): 6915.
- in Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7049.
- in Ada.Containers.Vectors *note A.18.2(19/2): 6735.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(8/2): 6915.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(10/2): 7049.
+ <in> Ada.Containers.Vectors *note A.18.2(19/2): 6735.
Capacity_Error
- in Ada.Containers *note A.18.1(5.1/3): 6718.
+ <in> Ada.Containers *note A.18.1(5.1/3): 6718.
case insensitive *note 2.3(5/3): 1203.
case_expression *note 4.5.7(5/3): 2889.
- used *note 4.5.7(2/3): 2880, *note P: 9318.
+ <used> *note 4.5.7(2/3): 2880, *note P: 9318.
case_expression_alternative *note 4.5.7(6/3): 2893.
- used *note 4.5.7(5/3): 2891, *note P: 9326.
+ <used> *note 4.5.7(5/3): 2891, *note P: 9326.
case_statement *note 5.4(2/3): 3176.
- used *note 5.1(5/2): 3136, *note P: 9370.
+ <used> *note 5.1(5/2): 3136, *note P: 9370.
case_statement_alternative *note 5.4(3): 3180.
- used *note 5.4(2/3): 3179, *note P: 9387.
+ <used> *note 5.4(2/3): 3179, *note P: 9387.
cast
- See type conversion *note 4.6(1/3): 2922.
- See unchecked type conversion *note 13.9(1): 5158.
+ <See> type conversion *note 4.6(1/3): 2922.
+ <See> unchecked type conversion *note 13.9(1): 5158.
catch (an exception)
- See handle *note 11(1/3): 4510.
+ <See> handle *note 11(1/3): 4510.
categorization aspect *note E.2(2/3): 8116.
categorization pragma *note E.2(2/3): 8112.
Remote_Call_Interface *note E.2.3(2): 8147.
@@ -82179,53 +82342,53 @@ category
category (of types) *note N(4.3/2): 8886.
category determined for a formal type *note 12.5(6/3): 4799.
catenation operator
- See concatenation operator *note 4.4(1/3): 2631.
- See concatenation operator *note 4.5.3(3): 2821.
+ <See> concatenation operator *note 4.4(1/3): 2631.
+ <See> concatenation operator *note 4.5.3(3): 2821.
Cause_Of_Termination
- in Ada.Task_Termination *note C.7.3(3/2): 7741.
+ <in> Ada.Task_Termination *note C.7.3(3/2): 7741.
CCH
- in Ada.Characters.Latin_1 *note A.3.3(18): 5618.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5618.
cease to exist
object *note 7.6.1(11/3): 3701, *note 13.11.2(10/4): 5233.
type *note 7.6.1(11/3): 3702.
Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(22): 5657.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5657.
Ceiling
- in Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7007.
- in Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7161, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(41/2): 7007.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(51/2): 7161, *note
A.18.9(71/2): 7174.
Ceiling attribute *note A.5.3(33): 6221.
ceiling priority
of a protected object *note D.3(8/3): 7844.
Ceiling_Check
- [partial] *note C.3.1(11/3): 7652, *note D.3(13): 7845.
+ [<partial>] *note C.3.1(11/3): 7652, *note D.3(13): 7845.
Ceiling_Locking locking policy *note D.3(7): 7843.
Cent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5633.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5633.
change of representation *note 13.6(1/3): 5103.
char
- in Interfaces.C *note B.3(19): 7451.
+ <in> Interfaces.C *note B.3(19): 7451.
char16_array
- in Interfaces.C *note B.3(39.5/3): 7475.
+ <in> Interfaces.C *note B.3(39.5/3): 7475.
char16_nul
- in Interfaces.C *note B.3(39.3/2): 7472.
+ <in> Interfaces.C *note B.3(39.3/2): 7472.
char16_t
- in Interfaces.C *note B.3(39.2/2): 7471.
+ <in> Interfaces.C *note B.3(39.2/2): 7471.
char32_array
- in Interfaces.C *note B.3(39.14/3): 7485.
+ <in> Interfaces.C *note B.3(39.14/3): 7485.
char32_nul
- in Interfaces.C *note B.3(39.12/2): 7482.
+ <in> Interfaces.C *note B.3(39.12/2): 7482.
char32_t
- in Interfaces.C *note B.3(39.11/2): 7481.
+ <in> Interfaces.C *note B.3(39.11/2): 7481.
char_array
- in Interfaces.C *note B.3(23/3): 7455.
+ <in> Interfaces.C *note B.3(23/3): 7455.
char_array_access
- in Interfaces.C.Strings *note B.3.1(4): 7497.
+ <in> Interfaces.C.Strings *note B.3.1(4): 7497.
CHAR_BIT
- in Interfaces.C *note B.3(6): 7433.
+ <in> Interfaces.C *note B.3(6): 7433.
Character *note 3.5.2(2/3): 1705.
- used *note 2.7(2): 1257, *note P: 8997.
- in Standard *note A.1(35/3): 5442.
+ <used> *note 2.7(2): 1257, *note P: 8997.
+ <in> Standard *note A.1(35/3): 5442.
character encoding *note A.4.11(46/3): 6103.
character plane *note 2.1(1/3): 1129.
character set *note 2.1(1/3): 1127.
@@ -82236,33 +82399,33 @@ character set standard
control functions *note 1.2(5): 1105.
character type *note 3.5.2(1): 1701, *note N(5): 8887.
character_literal *note 2.5(2): 1247.
- used *note 3.5.1(4): 1694, *note 4.1(2/3): 2368, *note 4.1.3(3):
+ <used> *note 3.5.1(4): 1694, *note 4.1(2/3): 2368, *note 4.1.3(3):
2423, *note P: 9084.
Character_Mapping
- in Ada.Strings.Maps *note A.4.2(20/2): 5797.
+ <in> Ada.Strings.Maps *note A.4.2(20/2): 5797.
Character_Mapping_Function
- in Ada.Strings.Maps *note A.4.2(25): 5803.
+ <in> Ada.Strings.Maps *note A.4.2(25): 5803.
Character_Range
- in Ada.Strings.Maps *note A.4.2(6): 5786.
+ <in> Ada.Strings.Maps *note A.4.2(6): 5786.
Character_Ranges
- in Ada.Strings.Maps *note A.4.2(7): 5787.
-Character_Sequence subtype of String
- in Ada.Strings.Maps *note A.4.2(16): 5793.
+ <in> Ada.Strings.Maps *note A.4.2(7): 5787.
+Character_Sequence <subtype of> String
+ <in> Ada.Strings.Maps *note A.4.2(16): 5793.
Character_Set
- in Ada.Strings.Maps *note A.4.2(4/2): 5784.
- in Ada.Strings.Wide_Maps *note A.4.7(46/2): 6006.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6046.
- in Interfaces.Fortran *note B.5(11): 7609.
+ <in> Ada.Strings.Maps *note A.4.2(4/2): 5784.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(46/2): 6006.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6046.
+ <in> Interfaces.Fortran *note B.5(11): 7609.
Character_Set_Version
- in Ada.Wide_Characters.Handling *note A.3.5(4/3): 5749.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(4/3): 5749.
characteristics
- [partial] *note 3.4(7/3): 1544.
+ [<partial>] *note 3.4(7/3): 1544.
Characters
- child of Ada *note A.3.1(2): 5457.
+ <child of> Ada *note A.3.1(2): 5457.
chars_ptr
- in Interfaces.C.Strings *note B.3.1(5/2): 7498.
+ <in> Interfaces.C.Strings *note B.3.1(5/2): 7498.
chars_ptr_array
- in Interfaces.C.Strings *note B.3.1(6/2): 7499.
+ <in> Interfaces.C.Strings *note B.3.1(6/2): 7499.
check
language-defined *note 11.5(2/3): 4612, *note 11.6(1/3): 4649.
check, language-defined
@@ -82319,22 +82482,22 @@ checking pragmas *note 11.5(1/2): 4610.
child
of a library unit *note 10.1.1(1): 4321.
Child_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7239.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(46/3): 7239.
Child_Depth
- in Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7240.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(47/3): 7240.
choice parameter *note 11.2(9): 4542.
choice_expression *note 4.4(2.1/3): 2666.
- used *note 3.8.1(5/3): 2069, *note P: 9158.
+ <used> *note 3.8.1(5/3): 2069, *note P: 9158.
choice_parameter_specification *note 11.2(4): 4537.
- used *note 11.2(3): 4533, *note P: 9698.
+ <used> *note 11.2(3): 4533, *note P: 9698.
choice_relation *note 4.4(2.2/3): 2677.
- used *note 4.4(2.1/3): 2673, *note P: 9277.
+ <used> *note 4.4(2.1/3): 2673, *note P: 9277.
Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(12): 5559.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5559.
class
of types *note 3.2(2/2): 1332, *note 3.4(1.1/2): 1531.
- See also package *note 7(1): 3570.
- See also tag *note 3.9(3): 2098.
+ <See also> package *note 7(1): 3570.
+ <See also> tag *note 3.9(3): 2098.
class (of types) *note N(6/2): 8888.
Class attribute *note 3.9(14): 2118, *note 7.3.1(9): 3626, *note
J.11(2/2): 8526.
@@ -82345,36 +82508,36 @@ class-wide precondition expression *note
6.1.1(3/3): 3349.
class-wide type *note 3.4.1(4): 1566, *note 3.7(26): 1998.
class-wide type invariant *note 7.3.2(3/4): 3632.
cleanup
- See finalization *note 7.6.1(1): 3685.
+ <See> finalization *note 7.6.1(1): 3685.
clear
execution timer object *note D.14.1(12/2): 8026.
group budget object *note D.14.2(15/2): 8053.
timing event object *note D.15(9/2): 8068.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 6831.
- in Ada.Containers.Hashed_Maps *note A.18.5(12/2): 6919.
- in Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7053.
- in Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7289.
- in Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7216.
- in Ada.Containers.Ordered_Maps *note A.18.6(11/2): 6970.
- in Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7124.
- in Ada.Containers.Vectors *note A.18.2(24/2): 6740.
- in Ada.Environment_Variables *note A.17(7/2): 6704.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(13/2): 6831.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(12/2): 6919.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(14/2): 7053.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(11/3): 7289.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(23/3): 7216.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(11/2): 6970.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(13/2): 7124.
+ <in> Ada.Containers.Vectors *note A.18.2(24/2): 6740.
+ <in> Ada.Environment_Variables *note A.17(7/2): 6704.
cleared
termination handler *note C.7.3(9/2): 7754.
clock *note 9.6(6/3): 4144.
- in Ada.Calendar *note 9.6(12): 4151.
- in Ada.Execution_Time *note D.14(5/2): 8005.
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8056.
- in Ada.Real_Time *note D.8(6): 7952.
+ <in> Ada.Calendar *note 9.6(12): 4151.
+ <in> Ada.Execution_Time *note D.14(5/2): 8005.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8056.
+ <in> Ada.Real_Time *note D.8(6): 7952.
clock jump *note D.8(32): 7967.
clock tick *note D.8(23): 7966.
Clock_For_Interrupts
- in Ada.Execution_Time *note D.14(9.3/3): 8010.
+ <in> Ada.Execution_Time *note D.14(9.3/3): 8010.
Close
- in Ada.Direct_IO *note A.8.4(8): 6330.
- in Ada.Sequential_IO *note A.8.1(8): 6303.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6576.
- in Ada.Text_IO *note A.10.1(11): 6385.
+ <in> Ada.Direct_IO *note A.8.4(8): 6330.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6303.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6576.
+ <in> Ada.Text_IO *note A.10.1(11): 6385.
close result set *note G.2.3(5): 8354.
closed entry *note 9.5.3(5): 4097.
of a protected object *note 9.5.3(7/3): 4102.
@@ -82383,41 +82546,41 @@ closed under derivation *note 3.4(28): 1559, *note
N(6/2): 8889.
closure
downward *note 3.10.2(38/2): 2326.
COBOL
- child of Interfaces *note B.4(7): 7545.
+ <child of> Interfaces *note B.4(7): 7545.
COBOL interface *note B.4(1/3): 7544.
COBOL standard *note 1.2(4/2): 1099.
COBOL_Character
- in Interfaces.COBOL *note B.4(13): 7554.
+ <in> Interfaces.COBOL *note B.4(13): 7554.
COBOL_To_Ada
- in Interfaces.COBOL *note B.4(15): 7556.
+ <in> Interfaces.COBOL *note B.4(15): 7556.
code point
for characters *note 3.5.2(2/3): 1707.
code_statement *note 13.8(2): 5149.
- used *note 5.1(4/2): 3133, *note P: 9368.
+ <used> *note 5.1(4/2): 3133, *note P: 9368.
Coding aspect *note 13.4(7): 5047.
coextension
of an object *note 3.10.2(14.4/3): 2301.
Col
- in Ada.Text_IO *note A.10.1(37): 6437.
+ <in> Ada.Text_IO *note A.10.1(37): 6437.
collection
of an access type *note 7.6.1(11.1/3): 3703.
colon *note 2.1(15/3): 1169.
- in Ada.Characters.Latin_1 *note A.3.3(10): 5549.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5549.
column number *note A.10(9): 6368.
comma *note 2.1(15/3): 1161.
- in Ada.Characters.Latin_1 *note A.3.3(8): 5544.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5544.
Command_Line
- child of Ada *note A.15(3): 6626.
+ <child of> Ada *note A.15(3): 6626.
Command_Name
- in Ada.Command_Line *note A.15(6): 6629.
+ <in> Ada.Command_Line *note A.15(6): 6629.
comment *note 2.7(2): 1256.
comments, instructions for submission *note 0.3(58/1): 1004.
Commercial_At
- in Ada.Characters.Latin_1 *note A.3.3(10): 5555.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5555.
Communication_Error
- in System.RPC *note E.5(5): 8206.
+ <in> System.RPC *note E.5(5): 8206.
comparison operator
- See relational operator *note 4.5.2(1): 2760.
+ <See> relational operator *note 4.5.2(1): 2760.
compatibility
composite_constraint with an access subtype *note 3.10(15/2): 2271.
constraint with a subtype *note 3.2.2(12): 1425.
@@ -82442,7 +82605,7 @@ compilation units needed
remote call interface *note E.2.3(18): 8166.
shared passive library unit *note E.2.1(11): 8133.
compilation_unit *note 10.1.1(3): 4324.
- used *note 10.1.1(2): 4323, *note P: 9651.
+ <used> *note 10.1.1(2): 4323, *note P: 9651.
compile-time error *note 1.1.2(27): 1023, *note 1.1.5(4): 1072.
compile-time semantics *note 1.1.2(28): 1028.
complete context *note 8.6(4): 3848.
@@ -82454,83 +82617,83 @@ completion
run-time concept *note 7.6.1(2/2): 3688.
completion and leaving (completed and left) *note 7.6.1(2/2): 3687.
completion legality
- [partial] *note 3.10.1(13): 2285.
+ [<partial>] *note 3.10.1(13): 2285.
entry_body *note 9.5.2(16): 4073.
Complex
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 8259.
- in Interfaces.Fortran *note B.5(9): 7605.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(3): 8259.
+ <in> Interfaces.Fortran *note B.5(9): 7605.
Complex_Arrays
- child of Ada.Numerics *note G.3.2(53/2): 8422.
+ <child of> Ada.Numerics *note G.3.2(53/2): 8422.
Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(9/1): 8306.
+ <child of> Ada.Numerics *note G.1.2(9/1): 8306.
Complex_IO
- child of Ada.Text_IO *note G.1.3(3): 8314.
- child of Ada.Wide_Text_IO *note G.1.4(1): 8326.
- child of Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 8328.
+ <child of> Ada.Text_IO *note G.1.3(3): 8314.
+ <child of> Ada.Wide_Text_IO *note G.1.4(1): 8326.
+ <child of> Ada.Wide_Wide_Text_IO *note G.1.5(1/2): 8328.
Complex_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8388.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8388.
Complex_Text_IO
- child of Ada *note G.1.3(9.1/2): 8324.
+ <child of> Ada *note G.1.3(9.1/2): 8324.
Complex_Types
- child of Ada.Numerics *note G.1.1(25/1): 8279.
+ <child of> Ada.Numerics *note G.1.1(25/1): 8279.
Complex_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8387.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(4/2): 8387.
component *note 3.2(2/2): 1337.
of a type *note 3.2(6/2): 1350.
component subtype *note 3.6(10): 1909.
component_choice_list *note 4.3.1(5): 2514.
- used *note 4.3.1(4/2): 2513, *note P: 9240.
+ <used> *note 4.3.1(4/2): 2513, *note P: 9240.
component_clause *note 13.5.1(3): 5063.
- used *note 13.5.1(2): 5062, *note P: 9826.
+ <used> *note 13.5.1(2): 5062, *note P: 9826.
component_declaration *note 3.8(6/3): 2036.
- used *note 3.8(5/1): 2034, *note 9.4(6): 3976, *note P: 9577.
+ <used> *note 3.8(5/1): 2034, *note 9.4(6): 3976, *note P: 9577.
component_definition *note 3.6(7/2): 1903.
- used *note 3.6(3): 1893, *note 3.6(5): 1899, *note 3.8(6/3): 2038,
-*note P: 9148.
+ <used> *note 3.6(3): 1893, *note 3.6(5): 1899, *note 3.8(6/3):
+2038, *note P: 9148.
component_item *note 3.8(5/1): 2033.
- used *note 3.8(4): 2029, *note P: 9141.
+ <used> *note 3.8(4): 2029, *note P: 9141.
component_list *note 3.8(4): 2028.
- used *note 3.8(3): 2027, *note 3.8.1(3): 2064, *note P: 9140.
+ <used> *note 3.8(3): 2027, *note 3.8.1(3): 2064, *note P: 9140.
Component_Size aspect *note 13.3(70): 5026.
Component_Size attribute *note 13.3(69): 5022.
Component_Size clause *note 13.3(7/2): 4962, *note 13.3(70): 5024.
components
of a record type *note 3.8(9/2): 2042.
Compose
- in Ada.Directories *note A.16(20/2): 6650.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
+ <in> Ada.Directories *note A.16(20/2): 6650.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(14/3):
6697.
Compose attribute *note A.5.3(24): 6209.
Compose_From_Cartesian
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 8393,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(9/2): 8393,
*note G.3.2(29/2): 8406.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 8269.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(8): 8269.
Compose_From_Polar
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 8399,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(11/2): 8399,
*note G.3.2(32/2): 8412.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 8275.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(11): 8275.
composite type *note 3.2(2/2): 1336, *note N(8/2): 8891.
composite_constraint *note 3.2.2(7): 1417.
- used *note 3.2.2(5): 1412, *note P: 9049.
+ <used> *note 3.2.2(5): 1412, *note P: 9049.
compound delimiter *note 2.2(10): 1186.
compound_statement *note 5.1(5/2): 3134.
- used *note 5.1(3): 3120, *note P: 9356.
+ <used> *note 5.1(3): 3120, *note P: 9356.
concatenation operator *note 4.4(1/3): 2629, *note 4.5.3(3): 2819.
concrete subprogram
- See nonabstract subprogram *note 3.9.3(1/2): 2184.
+ <See> nonabstract subprogram *note 3.9.3(1/2): 2184.
concrete type
- See nonabstract type *note 3.9.3(1/2): 2182.
+ <See> nonabstract type *note 3.9.3(1/2): 2182.
concurrent processing
- See task *note 9(1/3): 3879.
+ <See> task *note 9(1/3): 3879.
condition *note 4.5.7(4/3): 2887.
- used *note 4.5.7(3/3): 2884, *note 5.3(2): 3172, *note 5.5(3/3):
+ <used> *note 4.5.7(3/3): 2884, *note 5.3(2): 3172, *note 5.5(3/3):
3196, *note 5.7(2): 3268, *note 9.5.2(7): 4063, *note 9.7.1(3): 4222,
*note P: 9382.
- See also exception *note 11(1/3): 4507.
+ <See also> exception *note 11(1/3): 4507.
conditional_entry_call *note 9.7.3(2): 4251.
- used *note 9.7(2): 4212, *note P: 9619.
+ <used> *note 9.7(2): 4212, *note P: 9619.
conditional_expression *note 4.5.7(2/3): 2878.
- used *note 4.4(7/3): 2716, *note P: 9315.
+ <used> *note 4.4(7/3): 2716, *note P: 9315.
configuration
of the partitions of a program *note E(4): 8099.
configuration pragma *note 10.1.5(8): 4426.
@@ -82555,42 +82718,42 @@ confirming
representation value *note 13.1(18.2/3): 4902.
conformance *note 6.3.1(1): 3412.
of an implementation with the Standard *note 1.1.3(1): 1050.
- See also full conformance, mode conformance, subtype conformance,
+ <See also> full conformance, mode conformance, subtype conformance,
type conformance
Conjugate
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 8400,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(13/2): 8400,
*note G.3.2(34/2): 8413.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 8277, *note
-G.1.1(15): 8278.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(12): 8277,
+*note G.1.1(15): 8278.
consistency
among compilation units *note 10.1.4(5): 4416.
constant *note 3.3(13/3): 1456.
result of a function_call *note 6.4(12/2): 3469.
- See also literal *note 4.2(1): 2477.
- See also static *note 4.9(1): 3087.
+ <See also> literal *note 4.2(1): 2477.
+ <See also> static *note 4.9(1): 3087.
constant indexing *note 4.1.6(12/3): 2472.
constant object *note 3.3(13/3): 1458.
constant view *note 3.3(13/3): 1460.
Constant_Indexing aspect *note 4.1.6(2/3): 2463.
Constant_Reference
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 6837.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 6926, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.3/3): 6837.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.3/3): 6926, *note
A.18.5(17.5/3): 6928.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7057, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.2/3): 7057, *note
A.18.8(58.3/3): 7098.
- in Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7296.
- in Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7223.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 6977, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(18/3): 7296.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(30/3): 7223.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.3/3): 6977, *note
A.18.6(16.5/3): 6979.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7128, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.2/3): 7128, *note
A.18.9(73.3/3): 7179.
- in Ada.Containers.Vectors *note A.18.2(34.3/3): 6752, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.3/3): 6752, *note
A.18.2(34.5/3): 6754.
Constant_Reference_Type
- in Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7294.
- in Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7221.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(16/3): 7294.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(28/3): 7221.
Constants
- child of Ada.Strings.Maps *note A.4.6(3/2): 5954.
+ <child of> Ada.Strings.Maps *note A.4.6(3/2): 5954.
constituent
of a construct *note 1.1.4(17): 1068.
constrained *note 3.2(9): 1362.
@@ -82606,16 +82769,16 @@ constrained *note 3.2(9): 1362.
subtype *note K.2(33): 8654.
Constrained attribute *note 3.7.2(3/3): 2019, *note J.4(2): 8504.
constrained by its initial value *note 3.3.1(9/2): 1505.
- [partial] *note 4.8(6/3): 3056, *note 6.5(5.11/3): 3518.
+ [<partial>] *note 4.8(6/3): 3056, *note 6.5(5.11/3): 3518.
constrained_array_definition *note 3.6(5): 1896.
- used *note 3.6(2): 1889, *note P: 9106.
+ <used> *note 3.6(2): 1889, *note P: 9106.
constraint *note 3.2.2(5): 1410.
- [partial] *note 3.2(7/2): 1351.
+ [<partial>] *note 3.2(7/2): 1351.
null *note 3.2(7/2): 1353.
of a first array subtype *note 3.6(16): 1922.
of a subtype *note 3.2(8/2): 1357.
of an object *note 3.3.1(9/2): 1504.
- used *note 3.2.2(3/2): 1407, *note P: 9046.
+ <used> *note 3.2.2(3/2): 1407, *note P: 9046.
Constraint_Error
raised by failure of run-time check *note 3.2.2(12): 1426, *note
3.5(24): 1626, *note 3.5(27): 1633, *note 3.5(39.12/3): 1662, *note
@@ -82646,14 +82809,14 @@ K.2(11): 8650, *note K.2(114): 8665, *note K.2(122):
8668, *note
K.2(184): 8672, *note K.2(202): 8677, *note K.2(220): 8681, *note
K.2(241): 8684, *note K.2(261): 8690, *note K.2(41): 8655, *note
K.2(47): 8658.
- in Standard *note A.1(46): 5451.
+ <in> Standard *note A.1(46): 5451.
Construct *note 1.1.4(16): 1067, *note N(9): 8892.
constructor
- See initialization *note 3.3.1(18/2): 1518.
- See initialization *note 7.6(1): 3654.
- See initialization expression *note 3.3.1(4): 1499.
- See Initialize *note 7.6(1): 3655.
- See initialized allocator *note 4.8(4): 3054.
+ <See> initialization *note 3.3.1(18/2): 1518.
+ <See> initialization *note 7.6(1): 3654.
+ <See> initialization expression *note 3.3.1(4): 1499.
+ <See> Initialize *note 7.6(1): 3655.
+ <See> initialized allocator *note 4.8(4): 3054.
container *note N(9.1/3): 8893.
cursor *note A.18(2/2): 6710.
list *note A.18.3(1/2): 6819.
@@ -82662,44 +82825,44 @@ container *note N(9.1/3): 8893.
vector *note A.18.2(1/2): 6720.
container element iterator *note 5.5.2(3/3): 3247.
Containers
- child of Ada *note A.18.1(3/2): 6715.
+ <child of> Ada *note A.18.1(3/2): 6715.
Containing_Directory
- in Ada.Directories *note A.16(17/2): 6647.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
+ <in> Ada.Directories *note A.16(17/2): 6647.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(11/3):
6694.
Contains
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 6866.
- in Ada.Containers.Hashed_Maps *note A.18.5(32/2): 6946.
- in Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7082, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(43/2): 6866.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(32/2): 6946.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(44/2): 7082, *note
A.18.8(57/2): 7094.
- in Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7234.
- in Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7008.
- in Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7162, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(41/3): 7234.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(42/2): 7008.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(52/2): 7162, *note
A.18.9(72/2): 7175.
- in Ada.Containers.Vectors *note A.18.2(71/2): 6794.
+ <in> Ada.Containers.Vectors *note A.18.2(71/2): 6794.
context free grammar
complete listing *note P: 8959.
cross reference *note P: 9848.
notation *note 1.1.4(3): 1062.
under Syntax heading *note 1.1.2(25): 1016.
context_clause *note 10.1.2(2): 4368.
- used *note 10.1.1(3): 4325, *note P: 9652.
+ <used> *note 10.1.1(3): 4325, *note P: 9652.
context_item *note 10.1.2(3): 4370.
- used *note 10.1.2(2): 4369, *note P: 9669.
+ <used> *note 10.1.2(2): 4369, *note P: 9669.
contiguous representation
- [partial] *note 13.5.2(5): 5086, *note 13.7.1(12): 5141, *note
+ [<partial>] *note 13.5.2(5): 5086, *note 13.7.1(12): 5141, *note
13.9(9): 5160, *note 13.9(17/3): 5163, *note 13.11(21.6/3): 5217.
Continue
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 7990.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7990.
control character
a category of Character *note A.3.2(22): 5488.
a category of Character *note A.3.3(4): 5499, *note A.3.3(15):
5593.
- See also format_effector *note 2.1(13/3): 1146.
+ <See also> format_effector *note 2.1(13/3): 1146.
Control_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5955.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5955.
Controlled
- in Ada.Finalization *note 7.6(5/2): 3662.
+ <in> Ada.Finalization *note 7.6(5/2): 3662.
controlled type *note 7.6(2): 3657, *note 7.6(9/2): 3669, *note N(10):
8894.
controlling access result *note 3.9.2(2/3): 2165.
@@ -82728,42 +82891,42 @@ conversion *note 4.6(1/3): 2921, *note 4.6(28):
2966.
value *note 4.6(5/2): 2937.
view *note 4.6(5/2): 2935.
Conversion_Error
- in Interfaces.COBOL *note B.4(30): 7578.
+ <in> Interfaces.COBOL *note B.4(30): 7578.
Conversions
- child of Ada.Characters *note A.3.4(2/2): 5729.
- child of Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6075.
+ <child of> Ada.Characters *note A.3.4(2/2): 5729.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(15/3): 6075.
Convert
- in Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6076,
+ <in> Ada.Strings.UTF_Encoding.Conversions *note A.4.11(16/3): 6076,
*note A.4.11(17/3): 6077, *note A.4.11(18/3): 6078, *note A.4.11(19/3):
6079, *note A.4.11(20/3): 6080.
convertible *note 4.6(4/3): 2933.
required *note 4.6(24.13/2): 2953, *note 4.6(24.4/2): 2948, *note
8.6(27.1/4): 3869.
Copy
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 6840.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 6931.
- in Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7059.
- in Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7299,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.6/3): 6840.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.8/3): 6931.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17.4/3): 7059.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(21/3): 7299,
*note A.18.20(10/3): 7311, *note A.18.21(13/3): 7315, *note
A.18.22(10/3): 7318, *note A.18.23(13/3): 7322, *note A.18.24(10/3):
7325.
- in Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7226.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 6982.
- in Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7130.
- in Ada.Containers.Vectors *note A.18.2(34.8/3): 6757.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(33/3): 7226.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.8/3): 6982.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16.4/3): 7130.
+ <in> Ada.Containers.Vectors *note A.18.2(34.8/3): 6757.
copy back of parameters *note 6.4.1(17): 3489.
copy parameter passing *note 6.2(2): 3389.
Copy_Array
- in Interfaces.C.Pointers *note B.3.2(15): 7527.
+ <in> Interfaces.C.Pointers *note B.3.2(15): 7527.
Copy_File
- in Ada.Directories *note A.16(13/2): 6644.
+ <in> Ada.Directories *note A.16(13/2): 6644.
Copy_Sign attribute *note A.5.3(51): 6242.
Copy_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7247.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(54/3): 7247.
Copy_Terminated_Array
- in Interfaces.C.Pointers *note B.3.2(14): 7526.
+ <in> Interfaces.C.Pointers *note B.3.2(14): 7526.
Copyright_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5640.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5640.
core language *note 1.1.2(2): 1005.
corresponding constraint *note 3.4(6): 1543.
corresponding discriminants *note 3.7(18): 1988.
@@ -82776,41 +82939,45 @@ corresponding subtype *note 3.4(18/3): 1553.
corresponding value
of the target type of a conversion *note 4.6(28): 2965.
Cos
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8291.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6117.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6117.
Cosh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8299.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6132.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6132.
Cot
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8293.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6121.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6121.
Coth
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8301.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6134.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6134.
Count
- in Ada.Direct_IO *note A.8.4(4): 6326.
- in Ada.Streams.Stream_IO *note A.12.1(7): 6572.
- in Ada.Strings.Bounded *note A.4.4(48): 5874, *note A.4.4(49):
+ <in> Ada.Direct_IO *note A.8.4(4): 6326.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 6572.
+ <in> Ada.Strings.Bounded *note A.4.4(48): 5874, *note A.4.4(49):
5875, *note A.4.4(50): 5876.
- in Ada.Strings.Fixed *note A.4.3(13): 5817, *note A.4.3(14): 5818,
-*note A.4.3(15): 5819.
- in Ada.Strings.Unbounded *note A.4.5(43): 5928, *note A.4.5(44):
+ <in> Ada.Strings.Fixed *note A.4.3(13): 5817, *note A.4.3(14):
+5818, *note A.4.3(15): 5819.
+ <in> Ada.Strings.Unbounded *note A.4.5(43): 5928, *note A.4.5(44):
5929, *note A.4.5(45): 5930.
- in Ada.Text_IO *note A.10.1(5): 6377.
+ <in> Ada.Text_IO *note A.10.1(5): 6377.
Count attribute *note 9.9(5): 4304.
Count_Type
- in Ada.Containers *note A.18.1(5/2): 6717.
+ <in> Ada.Containers *note A.18.1(5/2): 6717.
Country
- in Ada.Locales *note A.19(6/3): 7376.
+ <in> Ada.Locales *note A.19(6/3): 7376.
Country code standard *note 1.2(4.1/3): 1102.
Country_Code
- in Ada.Locales *note A.19(4/4): 7372.
+ <in> Ada.Locales *note A.19(4/4): 7372.
Country_Unknown
- in Ada.Locales *note A.19(5/3): 7374.
+ <in> Ada.Locales *note A.19(5/3): 7374.
cover
a type *note 3.4.1(9): 1575.
of a choice and an exception *note 11.2(6): 4541.
@@ -82820,40 +82987,40 @@ cover a value
CPU aspect *note D.16(8/3): 8076.
CPU clock tick *note D.14(15/2): 8013.
CPU pragma *note J.15.9(2/3): 8628, *note L(8.2/3): 8729.
-CPU subtype of CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8073.
+CPU <subtype of> CPU_Range
+ <in> System.Multiprocessors *note D.16(4/3): 8073.
CPU time
of a task *note D.14(11/3): 8012.
CPU_Range
- in System.Multiprocessors *note D.16(4/3): 8071.
+ <in> System.Multiprocessors *note D.16(4/3): 8071.
CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.1/4):
-8084.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.1/4): 8084.
CPU_Tick
- in Ada.Execution_Time *note D.14(4/2): 8004.
+ <in> Ada.Execution_Time *note D.14(4/2): 8004.
CPU_Time
- in Ada.Execution_Time *note D.14(4/2): 8000.
+ <in> Ada.Execution_Time *note D.14(4/2): 8000.
CPU_Time_First
- in Ada.Execution_Time *note D.14(4/2): 8001.
+ <in> Ada.Execution_Time *note D.14(4/2): 8001.
CPU_Time_Last
- in Ada.Execution_Time *note D.14(4/2): 8002.
+ <in> Ada.Execution_Time *note D.14(4/2): 8002.
CPU_Time_Unit
- in Ada.Execution_Time *note D.14(4/2): 8003.
+ <in> Ada.Execution_Time *note D.14(4/2): 8003.
CR
- in Ada.Characters.Latin_1 *note A.3.3(5): 5513.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5513.
create *note 3.1(12): 1327.
- in Ada.Direct_IO *note A.8.4(6): 6328.
- in Ada.Sequential_IO *note A.8.1(6): 6301.
- in Ada.Streams.Stream_IO *note A.12.1(8): 6574.
- in Ada.Text_IO *note A.10.1(9): 6383.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
+ <in> Ada.Direct_IO *note A.8.4(6): 6328.
+ <in> Ada.Sequential_IO *note A.8.1(6): 6301.
+ <in> Ada.Streams.Stream_IO *note A.12.1(8): 6574.
+ <in> Ada.Text_IO *note A.10.1(9): 6383.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(7/4):
8081, *note D.16.1(9.2/4): 8085.
Create_Directory
- in Ada.Directories *note A.16(7/2): 6638.
+ <in> Ada.Directories *note A.16(7/2): 6638.
Create_Path
- in Ada.Directories *note A.16(9/2): 6640.
+ <in> Ada.Directories *note A.16(9/2): 6640.
Create_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(7/3): 5260.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(7/3): 5260.
creation
of a protected object *note C.3.1(10/3): 7646.
of a return object *note 6.5(5.11/3): 3517.
@@ -82861,11 +83028,11 @@ creation
of a task object *note D.1(17/4): 7766.
of an object *note 3.3(1): 1454.
critical section
- See intertask communication *note 9.5(1): 4011.
+ <See> intertask communication *note 9.5(1): 4011.
CSI
- in Ada.Characters.Latin_1 *note A.3.3(19): 5625.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5625.
Currency_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5635.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5635.
current column number *note A.10(9): 6369.
current index
of an open direct file *note A.8(4): 6297.
@@ -82881,47 +83048,48 @@ Current size
of a stream file *note A.12.1(1.1/1): 6567.
of an external file *note A.8(3): 6296.
Current_Directory
- in Ada.Directories *note A.16(5/2): 6636.
+ <in> Ada.Directories *note A.16(5/2): 6636.
Current_Error
- in Ada.Text_IO *note A.10.1(17): 6401, *note A.10.1(20): 6408.
+ <in> Ada.Text_IO *note A.10.1(17): 6401, *note A.10.1(20): 6408.
Current_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8045.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8021.
- in Ada.Interrupts *note C.3.2(6): 7664.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8063.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8045.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8021.
+ <in> Ada.Interrupts *note C.3.2(6): 7664.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8063.
Current_Input
- in Ada.Text_IO *note A.10.1(17): 6399, *note A.10.1(20): 6406.
+ <in> Ada.Text_IO *note A.10.1(17): 6399, *note A.10.1(20): 6406.
Current_Output
- in Ada.Text_IO *note A.10.1(17): 6400, *note A.10.1(20): 6407.
+ <in> Ada.Text_IO *note A.10.1(17): 6400, *note A.10.1(20): 6407.
Current_State
- in Ada.Synchronous_Task_Control *note D.10(4): 7977.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7977.
Current_Task
- in Ada.Task_Identification *note C.7.1(3/3): 7712.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7712.
Current_Task_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 7744.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 7744.
Current_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 7367.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+7367.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
7353.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7340.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7340.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
7360.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-7347.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 7347.
cursor
ambiguous *note A.18.2(240/2): 6812.
for a container *note A.18(2/2): 6709.
invalid *note A.18.2(248/2): 6815, *note A.18.3(153/2): 6885, *note
A.18.4(76/2): 6905, *note A.18.7(97/2): 7037, *note A.18.10(222/3):
7274.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 6824.
- in Ada.Containers.Hashed_Maps *note A.18.5(4/2): 6910.
- in Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7042.
- in Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7203.
- in Ada.Containers.Ordered_Maps *note A.18.6(5/2): 6963.
- in Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7115.
- in Ada.Containers.Vectors *note A.18.2(9/2): 6728.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(7/2): 6824.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(4/2): 6910.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(4/2): 7042.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(9/3): 7203.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(5/2): 6963.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(5/2): 7115.
+ <in> Ada.Containers.Vectors *note A.18.2(9/2): 6728.
@@ -82936,63 +83104,63 @@ dangling reference *note 13.11.2(15.1/4): 5239.
dangling references
prevention via accessibility rules *note 3.10.2(3/2): 2293.
Data_Error
- in Ada.Direct_IO *note A.8.4(18): 6353.
- in Ada.IO_Exceptions *note A.13(4): 6620.
- in Ada.Sequential_IO *note A.8.1(15): 6321.
- in Ada.Storage_IO *note A.9(9): 6360.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6601.
- in Ada.Text_IO *note A.10.1(85): 6526.
+ <in> Ada.Direct_IO *note A.8.4(18): 6353.
+ <in> Ada.IO_Exceptions *note A.13(4): 6620.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6321.
+ <in> Ada.Storage_IO *note A.9(9): 6360.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6601.
+ <in> Ada.Text_IO *note A.10.1(85): 6526.
date and time formatting standard *note 1.2(5.1/2): 1107.
Day
- in Ada.Calendar *note 9.6(13): 4154.
- in Ada.Calendar.Formatting *note 9.6.1(23/2): 4193.
+ <in> Ada.Calendar *note 9.6(13): 4154.
+ <in> Ada.Calendar.Formatting *note 9.6.1(23/2): 4193.
Day_Count
- in Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4174.
-Day_Duration subtype of Duration
- in Ada.Calendar *note 9.6(11/2): 4150.
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(10/2): 4174.
+Day_Duration <subtype of> Duration
+ <in> Ada.Calendar *note 9.6(11/2): 4150.
Day_Name
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4178.
-Day_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4149.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4178.
+Day_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4149.
Day_of_Week
- in Ada.Calendar.Formatting *note 9.6.1(18/2): 4186.
+ <in> Ada.Calendar.Formatting *note 9.6.1(18/2): 4186.
DC1
- in Ada.Characters.Latin_1 *note A.3.3(6): 5517.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5517.
DC2
- in Ada.Characters.Latin_1 *note A.3.3(6): 5518.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5518.
DC3
- in Ada.Characters.Latin_1 *note A.3.3(6): 5519.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5519.
DC4
- in Ada.Characters.Latin_1 *note A.3.3(6): 5520.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5520.
DCS
- in Ada.Characters.Latin_1 *note A.3.3(18): 5614.
-Deadline subtype of Time
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7822.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5614.
+Deadline <subtype of> Time
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7822.
Deallocate
- in System.Storage_Pools *note 13.11(8): 5190.
- in System.Storage_Pools.Subpools *note 13.11.4(15/3): 5267.
+ <in> System.Storage_Pools *note 13.11(8): 5190.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(15/3): 5267.
Deallocate_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(12/3): 5264.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(12/3): 5264.
deallocation of storage *note 13.11.2(1): 5225.
Decimal
- child of Ada *note F.2(2): 8223.
+ <child of> Ada *note F.2(2): 8223.
decimal digit
a category of Character *note A.3.2(28): 5494.
decimal fixed point type *note 3.5.9(1): 1827, *note 3.5.9(6): 1845.
Decimal_Conversions
- in Interfaces.COBOL *note B.4(31): 7579.
+ <in> Interfaces.COBOL *note B.4(31): 7579.
Decimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5961.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5961.
Decimal_Element
- in Interfaces.COBOL *note B.4(12/3): 7552.
+ <in> Interfaces.COBOL *note B.4(12/3): 7552.
decimal_fixed_point_definition *note 3.5.9(4): 1835.
- used *note 3.5.9(2): 1831, *note P: 9097.
+ <used> *note 3.5.9(2): 1831, *note P: 9097.
Decimal_IO
- in Ada.Text_IO *note A.10.1(73): 6501.
+ <in> Ada.Text_IO *note A.10.1(73): 6501.
decimal_literal *note 2.4.1(2): 1211.
- used *note 2.4(2): 1208, *note P: 8975.
+ <used> *note 2.4(2): 1208, *note P: 8975.
Decimal_Output
- in Ada.Text_IO.Editing *note F.3.3(11): 8246.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8246.
Declaration *note 3.1(5): 1308, *note 3.1(6/3): 1311, *note N(11):
8895.
declaration list
@@ -83001,21 +83169,21 @@ declaration list
declarative region
of a construct *note 8.1(1): 3713.
declarative_item *note 3.11(3): 2329.
- used *note 3.11(2): 2328, *note P: 9184.
+ <used> *note 3.11(2): 2328, *note P: 9184.
declarative_part *note 3.11(2): 2327.
- used *note 5.6(2): 3262, *note 6.3(2/3): 3406, *note 7.2(2/3):
+ <used> *note 5.6(2): 3262, *note 6.3(2/3): 3406, *note 7.2(2/3):
3589, *note 9.1(6/3): 3914, *note 9.5.2(5): 4056, *note P: 9405.
declare *note 3.1(8): 1320, *note 3.1(12): 1326.
declared pure *note 10.2.1(17/3): 4485.
Decode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6085, *note
-A.4.11(27/3): 6086, *note A.4.11(28/3): 6087.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3): 6092,
-*note A.4.11(35/3): 6093, *note A.4.11(36/3): 6094.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(26/3): 6085,
+*note A.4.11(27/3): 6086, *note A.4.11(28/3): 6087.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(34/3):
+6092, *note A.4.11(35/3): 6093, *note A.4.11(36/3): 6094.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(42/3):
6099, *note A.4.11(43/3): 6100, *note A.4.11(44/3): 6101.
Decrement
- in Interfaces.C.Pointers *note B.3.2(11/3): 7524.
+ <in> Interfaces.C.Pointers *note B.3.2(11/3): 7524.
deeper
accessibility level *note 3.10.2(3/2): 2291.
statically *note 3.10.2(4): 2296, *note 3.10.2(17): 2303.
@@ -83030,66 +83198,67 @@ default pool *note 13.11.3(4.2/4): 5251.
default treatment *note C.3(5): 7640.
default variable indexing function *note 5.5.1(21/3): 3234.
Default_Aft
- in Ada.Text_IO *note A.10.1(64): 6483, *note A.10.1(69): 6493,
+ <in> Ada.Text_IO *note A.10.1(64): 6483, *note A.10.1(69): 6493,
*note A.10.1(74): 6503.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8316.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8316.
Default_Base
- in Ada.Text_IO *note A.10.1(53): 6465, *note A.10.1(58): 6474.
+ <in> Ada.Text_IO *note A.10.1(53): 6465, *note A.10.1(58): 6474.
Default_Bit_Order
- in System *note 13.7(15/2): 5126.
+ <in> System *note 13.7(15/2): 5126.
Default_Component_Value aspect *note 3.6(22.2/3): 1930.
Default_Currency
- in Ada.Text_IO.Editing *note F.3.3(10): 8242.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8242.
Default_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7823.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7823.
Default_Exp
- in Ada.Text_IO *note A.10.1(64): 6484, *note A.10.1(69): 6494,
+ <in> Ada.Text_IO *note A.10.1(64): 6484, *note A.10.1(69): 6494,
*note A.10.1(74): 6504.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8317.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8317.
default_expression *note 3.7(6): 1982.
- used *note 3.7(5/2): 1978, *note 3.8(6/3): 2039, *note 6.1(15/3):
+ <used> *note 3.7(5/2): 1978, *note 3.8(6/3): 2039, *note 6.1(15/3):
3327, *note 12.4(2/3): 4746, *note P: 9754.
Default_Fill
- in Ada.Text_IO.Editing *note F.3.3(10): 8243.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8243.
Default_Fore
- in Ada.Text_IO *note A.10.1(64): 6482, *note A.10.1(69): 6492,
+ <in> Ada.Text_IO *note A.10.1(64): 6482, *note A.10.1(69): 6492,
*note A.10.1(74): 6502.
- in Ada.Text_IO.Complex_IO *note G.1.3(5): 8315.
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(5): 8315.
Default_Iterator aspect *note 5.5.1(8/3): 3225.
Default_Modulus
- in Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7314,
+ <in> Ada.Containers.Indefinite_Holders *note A.18.21(10/3): 7314,
*note A.18.23(10/3): 7321.
default_name *note 12.6(4): 4841.
- used *note 12.6(3/2): 4840, *note P: 9788.
+ <used> *note 12.6(3/2): 4840, *note P: 9788.
Default_Priority
- in System *note 13.7(17): 5130.
+ <in> System *note 13.7(17): 5130.
Default_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7814.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7814.
Default_Radix_Mark
- in Ada.Text_IO.Editing *note F.3.3(10): 8245.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8245.
Default_Separator
- in Ada.Text_IO.Editing *note F.3.3(10): 8244.
+ <in> Ada.Text_IO.Editing *note F.3.3(10): 8244.
Default_Setting
- in Ada.Text_IO *note A.10.1(80): 6513.
+ <in> Ada.Text_IO *note A.10.1(80): 6513.
Default_Storage_Pool aspect *note 13.11.3(5/4): 5255.
Default_Storage_Pool pragma *note 13.11.3(3/3): 5247, *note L(8.3/3):
8732.
Default_Subpool_for_Pool
- in System.Storage_Pools.Subpools *note 13.11.4(13/3): 5265.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(13/3): 5265.
Default_Value aspect *note 3.5(56.3/3): 1684.
Default_Width
- in Ada.Text_IO *note A.10.1(53): 6464, *note A.10.1(58): 6473,
+ <in> Ada.Text_IO *note A.10.1(53): 6464, *note A.10.1(58): 6473,
*note A.10.1(80): 6512.
deferred constant *note 7.4(2/3): 3641.
deferred constant declaration *note 3.3.1(6/3): 1501, *note 7.4(2/3):
3640.
defining name *note 3.1(10): 1321.
defining_character_literal *note 3.5.1(4): 1693.
- used *note 3.5.1(3): 1692, *note P: 9083.
+ <used> *note 3.5.1(3): 1692, *note P: 9083.
defining_designator *note 6.1(6): 3298.
- used *note 6.1(4.2/2): 3292, *note 12.3(2/3): 4705, *note P: 9731.
+ <used> *note 6.1(4.2/2): 3292, *note 12.3(2/3): 4705, *note P:
+9731.
defining_identifier *note 3.1(4): 1306.
- used *note 3.2.1(3/3): 1374, *note 3.2.2(2/3): 1401, *note
+ <used> *note 3.2.1(3/3): 1374, *note 3.2.2(2/3): 1401, *note
3.3.1(3): 1495, *note 3.5.1(3): 1691, *note 3.10.1(2/2): 2276, *note
5.5(4): 3200, *note 5.5.2(2/3): 3238, *note 6.1(7): 3303, *note
6.5(2.1/3): 3500, *note 7.3(2/3): 3601, *note 7.3(3/3): 3605, *note
@@ -83101,79 +83270,80 @@ defining_identifier *note 3.1(4): 1306.
12.5(2.1/3): 4771, *note 12.5(2.2/3): 4776, *note 12.7(2/3): 4853, *note
P: 9519.
defining_identifier_list *note 3.3.1(3): 1494.
- used *note 3.3.1(2/3): 1488, *note 3.3.2(2): 1524, *note 3.7(5/2):
-1975, *note 3.8(6/3): 2037, *note 6.1(15/3): 3320, *note 11.1(2/3):
-4516, *note 12.4(2/3): 4748, *note P: 9071.
+ <used> *note 3.3.1(2/3): 1488, *note 3.3.2(2): 1524, *note
+3.7(5/2): 1975, *note 3.8(6/3): 2037, *note 6.1(15/3): 3320, *note
+11.1(2/3): 4516, *note 12.4(2/3): 4748, *note P: 9071.
defining_operator_symbol *note 6.1(11): 3306.
- used *note 6.1(6): 3300, *note P: 9424.
+ <used> *note 6.1(6): 3300, *note P: 9424.
defining_program_unit_name *note 6.1(7): 3301.
- used *note 6.1(4.1/2): 3289, *note 6.1(6): 3299, *note 7.1(3/3):
+ <used> *note 6.1(4.1/2): 3289, *note 6.1(6): 3299, *note 7.1(3/3):
3574, *note 7.2(2/3): 3587, *note 8.5.3(2/3): 3817, *note 8.5.5(2/3):
3836, *note 12.3(2/3): 4700, *note P: 9483.
Definite attribute *note 12.5.1(23/3): 4808.
definite subtype *note 3.3(23/3): 1469.
definition *note 3.1(7): 1313.
Degree_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5647.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5647.
DEL
- in Ada.Characters.Latin_1 *note A.3.3(14): 5592.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5592.
delay_alternative *note 9.7.1(6): 4230.
- used *note 9.7.1(4): 4225, *note 9.7.2(2): 4243, *note P: 9635.
+ <used> *note 9.7.1(4): 4225, *note 9.7.2(2): 4243, *note P: 9635.
delay_relative_statement *note 9.6(4): 4138.
- used *note 9.6(2): 4135, *note P: 9614.
+ <used> *note 9.6(2): 4135, *note P: 9614.
delay_statement *note 9.6(2): 4133.
- used *note 5.1(4/2): 3130, *note 9.7.1(6): 4231, *note 9.7.4(4/2):
-4263, *note P: 9647.
+ <used> *note 5.1(4/2): 3130, *note 9.7.1(6): 4231, *note
+9.7.4(4/2): 4263, *note P: 9647.
Delay_Until_And_Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(14/3):
8091.
Delay_Until_And_Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7825.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7825.
delay_until_statement *note 9.6(3): 4136.
- used *note 9.6(2): 4134, *note P: 9613.
+ <used> *note 9.6(2): 4134, *note P: 9613.
Delete
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 6847.
- in Ada.Containers.Hashed_Maps *note A.18.5(25/2): 6939, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(24/2): 6847.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(25/2): 6939, *note
A.18.5(26/2): 6940.
- in Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7066, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(24/2): 7066, *note
A.18.8(25/2): 7067, *note A.18.8(55/2): 7092.
- in Ada.Containers.Ordered_Maps *note A.18.6(24/2): 6990, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(24/2): 6990, *note
A.18.6(25/2): 6991.
- in Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7137, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(23/2): 7137, *note
A.18.9(24/2): 7138, *note A.18.9(68/2): 7171.
- in Ada.Containers.Vectors *note A.18.2(50/2): 6773, *note
+ <in> Ada.Containers.Vectors *note A.18.2(50/2): 6773, *note
A.18.2(51/2): 6774.
- in Ada.Direct_IO *note A.8.4(8): 6331.
- in Ada.Sequential_IO *note A.8.1(8): 6304.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6577.
- in Ada.Strings.Bounded *note A.4.4(64): 5889, *note A.4.4(65):
+ <in> Ada.Direct_IO *note A.8.4(8): 6331.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6304.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6577.
+ <in> Ada.Strings.Bounded *note A.4.4(64): 5889, *note A.4.4(65):
5890.
- in Ada.Strings.Fixed *note A.4.3(29): 5832, *note A.4.3(30): 5833.
- in Ada.Strings.Unbounded *note A.4.5(59): 5943, *note A.4.5(60):
+ <in> Ada.Strings.Fixed *note A.4.3(29): 5832, *note A.4.3(30):
+5833.
+ <in> Ada.Strings.Unbounded *note A.4.5(59): 5943, *note A.4.5(60):
5944.
- in Ada.Text_IO *note A.10.1(11): 6386.
+ <in> Ada.Text_IO *note A.10.1(11): 6386.
Delete_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7246.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(53/3): 7246.
Delete_Directory
- in Ada.Directories *note A.16(8/2): 6639.
+ <in> Ada.Directories *note A.16(8/2): 6639.
Delete_File
- in Ada.Directories *note A.16(11/2): 6642.
+ <in> Ada.Directories *note A.16(11/2): 6642.
Delete_First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 6848.
- in Ada.Containers.Ordered_Maps *note A.18.6(26/2): 6992.
- in Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7139.
- in Ada.Containers.Vectors *note A.18.2(52/2): 6775.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(25/2): 6848.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(26/2): 6992.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(25/2): 7139.
+ <in> Ada.Containers.Vectors *note A.18.2(52/2): 6775.
Delete_Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 6849.
- in Ada.Containers.Ordered_Maps *note A.18.6(27/2): 6993.
- in Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7140.
- in Ada.Containers.Vectors *note A.18.2(53/2): 6776.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(26/2): 6849.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(27/2): 6993.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(26/2): 7140.
+ <in> Ada.Containers.Vectors *note A.18.2(53/2): 6776.
Delete_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7228.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(35/3): 7228.
Delete_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7229.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(36/3): 7229.
Delete_Tree
- in Ada.Directories *note A.16(10/2): 6641.
+ <in> Ada.Directories *note A.16(10/2): 6641.
delimiter *note 2.2(8/2): 1185.
delivery
of an interrupt *note C.3(2): 7633.
@@ -83181,7 +83351,7 @@ delta
of a fixed point type *note 3.5.9(1): 1828.
Delta attribute *note 3.5.10(3): 1871.
delta_constraint *note J.3(2/4): 8495.
- used *note 3.2.2(6): 1416, *note P: 9052.
+ <used> *note 3.2.2(6): 1416, *note P: 9052.
Denorm attribute *note A.5.3(9): 6191.
denormalized number *note A.5.3(10): 6192.
denote *note 8.6(16): 3856.
@@ -83197,33 +83367,35 @@ dependence
semantic *note 10.1.1(26/2): 4367.
depth
accessibility level *note 3.10.2(3/2): 2292.
- in Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7212.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(19/3): 7212.
depth-first order *note A.18.10(5/3): 7200.
Dequeue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 7365.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+7365.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
7352.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(6/3):
-7339.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(6/3): 7339.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
7358.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-7346.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 7346.
Dequeue_Only_High_Priority
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3): 7366.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(6/3):
+7366.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(6/3):
7359.
dereference *note 4.1(8): 2382.
Dereference_Error
- in Interfaces.C.Strings *note B.3.1(12): 7505.
+ <in> Interfaces.C.Strings *note B.3.1(12): 7505.
derivation class
for a type *note 3.4.1(2/2): 1562.
derived from
directly or indirectly *note 3.4.1(2/2): 1561.
derived type *note 3.4(1/2): 1529, *note N(13/2): 8898.
- [partial] *note 3.4(24): 1555.
+ [<partial>] *note 3.4(24): 1555.
derived_type_definition *note 3.4(2/2): 1533.
- used *note 3.2.1(4/2): 1387, *note P: 9039.
+ <used> *note 3.2.1(4/2): 1387, *note P: 9039.
descendant *note 10.1.1(11): 4358, *note N(13.1/2): 8899.
at run-time *note 3.9(12.3/3): 2115.
of a tree node *note A.18.10(4/3): 7199.
@@ -83231,7 +83403,7 @@ descendant *note 10.1.1(11): 4358, *note N(13.1/2):
8899.
of the full view of a type *note 7.3.1(5.1/3): 3624.
relationship with scope *note 8.2(4): 3722.
Descendant_Tag
- in Ada.Tags *note 3.9(7.1/2): 2108.
+ <in> Ada.Tags *note 3.9(7.1/2): 2108.
designate *note 3.10(1): 2224.
designated profile
of an access-to-subprogram type *note 3.10(11): 2261.
@@ -83243,54 +83415,54 @@ designated type
of a named access type *note 3.10(10): 2257.
of an anonymous access type *note 3.10(12/3): 2265.
designator *note 6.1(5): 3294.
- used *note 6.3(2/3): 3408, *note P: 9450.
+ <used> *note 6.3(2/3): 3408, *note P: 9450.
destructor
- See finalization *note 7.6(1): 3656.
- See finalization *note 7.6.1(1): 3686.
+ <See> finalization *note 7.6(1): 3656.
+ <See> finalization *note 7.6.1(1): 3686.
Detach_Handler
- in Ada.Interrupts *note C.3.2(9): 7667.
+ <in> Ada.Interrupts *note C.3.2(9): 7667.
Detect_Blocking pragma *note H.5(3/2): 8485, *note L(8.4/2): 8735.
Determinant
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8418.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8378.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8418.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8378.
determined category for a formal type *note 12.5(6/3): 4798.
determines
a type by a subtype_mark *note 3.2.2(8): 1420.
Device_Error
- in Ada.Direct_IO *note A.8.4(18): 6351.
- in Ada.Directories *note A.16(43/2): 6674.
- in Ada.IO_Exceptions *note A.13(4): 6618.
- in Ada.Sequential_IO *note A.8.1(15): 6319.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6599.
- in Ada.Text_IO *note A.10.1(85): 6524.
+ <in> Ada.Direct_IO *note A.8.4(18): 6351.
+ <in> Ada.Directories *note A.16(43/2): 6674.
+ <in> Ada.IO_Exceptions *note A.13(4): 6618.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6319.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6599.
+ <in> Ada.Text_IO *note A.10.1(85): 6524.
Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5639.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5639.
Difference
- in Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4176.
- in Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7072, *note
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(12/2): 4176.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(32/2): 7072, *note
A.18.8(33/2): 7073.
- in Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7145, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(33/2): 7145, *note
A.18.9(34/2): 7146.
digit *note 2.4.1(4.1/2): 1222.
- used *note 2.4.1(3): 1218, *note 2.4.2(5): 1245, *note P: 8993.
+ <used> *note 2.4.1(3): 1218, *note 2.4.2(5): 1245, *note P: 8993.
digits
of a decimal fixed point subtype *note 3.5.9(6): 1844, *note
3.5.10(7): 1878.
Digits attribute *note 3.5.8(2/1): 1823, *note 3.5.10(7): 1877.
digits_constraint *note 3.5.9(5/4): 1839.
- used *note 3.2.2(6): 1415, *note P: 9051.
+ <used> *note 3.2.2(6): 1415, *note P: 9051.
dimensionality
of an array *note 3.6(12): 1910.
direct access *note A.8(3): 6294.
direct file *note A.8(1/2): 6291.
Direct_IO
- child of Ada *note A.8.4(2): 6323.
+ <child of> Ada *note A.8.4(2): 6323.
direct_name *note 4.1(3): 2372.
- used *note 3.8.1(2): 2059, *note 4.1(2/3): 2360, *note 5.1(8):
+ <used> *note 3.8.1(2): 2059, *note 4.1(2/3): 2360, *note 5.1(8):
3146, *note 9.5.2(3): 4045, *note 10.2.1(4.2/2): 4469, *note 13.1(3):
4878, *note J.7(1): 8506, *note L(25.2/2): 8811, *note P: 9803.
Direction
- in Ada.Strings *note A.4.1(6): 5781.
+ <in> Ada.Strings *note A.4.1(6): 5781.
directly specified
of a representation aspect of an entity *note 13.1(8/3): 4888.
of an operational aspect of an entity *note 13.1(8.1/3): 4894.
@@ -83304,132 +83476,133 @@ directly visible *note 8.3(2): 3736, *note
8.3(21): 3759.
4428.
within the parent_unit_name of a subunit *note 10.1.6(4): 4436.
Directories
- child of Ada *note A.16(3/2): 6635.
+ <child of> Ada *note A.16(3/2): 6635.
directory *note A.16(45/2): 6675.
directory entry *note A.16(49/2): 6683.
directory name *note A.16(46/2): 6678.
Directory_Entry_Type
- in Ada.Directories *note A.16(29/2): 6659.
+ <in> Ada.Directories *note A.16(29/2): 6659.
disabled
predicate checks *note 3.2.4(7/3): 1442.
Discard_Names aspect *note C.5(1.3/4): 7680.
Discard_Names pragma *note C.5(3): 7682, *note L(9): 8737.
discontiguous representation
- [partial] *note 13.5.2(5): 5087, *note 13.7.1(12): 5142, *note
+ [<partial>] *note 13.5.2(5): 5087, *note 13.7.1(12): 5142, *note
13.9(9): 5161, *note 13.9(17/3): 5164, *note 13.11(21.6/3): 5218.
discrete array type *note 4.5.2(1): 2789.
discrete type *note 3.2(3): 1340, *note 3.5(1): 1582, *note N(14):
8900.
discrete_choice *note 3.8.1(5/3): 2068.
- used *note 3.8.1(4): 2067, *note P: 9156.
+ <used> *note 3.8.1(4): 2067, *note P: 9156.
discrete_choice_list *note 3.8.1(4): 2065.
- used *note 3.8.1(3): 2063, *note 4.3.3(5/2): 2558, *note
+ <used> *note 3.8.1(3): 2063, *note 4.3.3(5/2): 2558, *note
4.5.7(6/3): 2894, *note 5.4(3): 3181, *note P: 9263.
Discrete_Random
- child of Ada.Numerics *note A.5.2(17): 6160.
+ <child of> Ada.Numerics *note A.5.2(17): 6160.
discrete_range *note 3.6.1(3): 1935.
- used *note 3.6.1(2): 1934, *note 4.1.2(2): 2409, *note P: 9119.
+ <used> *note 3.6.1(2): 1934, *note 4.1.2(2): 2409, *note P: 9119.
discrete_subtype_definition *note 3.6(6): 1900.
- used *note 3.6(5): 1898, *note 5.5(4): 3201, *note 9.5.2(2/3):
+ <used> *note 3.6(5): 1898, *note 5.5(4): 3201, *note 9.5.2(2/3):
4041, *note 9.5.2(8): 4066, *note P: 9112.
discriminant *note 3.2(5/2): 1346, *note 3.7(1/2): 1964, *note
N(15/2): 8901.
of a variant_part *note 3.8.1(6): 2072.
use in a record definition *note 3.8(12/3): 2043.
discriminant_association *note 3.7.1(3): 2004.
- used *note 3.7.1(2): 2002, *note P: 9135.
+ <used> *note 3.7.1(2): 2002, *note P: 9135.
Discriminant_Check *note 11.5(12): 4630.
- [partial] *note 4.1.3(15): 2429, *note 4.3(6): 2502, *note
+ [<partial>] *note 4.1.3(15): 2429, *note 4.3(6): 2502, *note
4.3.2(8/3): 2539, *note 4.6(43): 2988, *note 4.6(45): 2990, *note
4.6(51/4): 3000, *note 4.6(52): 3013, *note 4.7(4/4): 3034, *note
4.8(10/2): 3065, *note 6.5(5.11/3): 3520.
discriminant_constraint *note 3.7.1(2): 2001.
- used *note 3.2.2(7): 1419, *note P: 9054.
+ <used> *note 3.2.2(7): 1419, *note P: 9054.
discriminant_part *note 3.7(2/2): 1967.
- used *note 3.10.1(2/2): 2277, *note 7.3(2/3): 3602, *note 7.3(3/3):
-3606, *note 12.5(2.1/3): 4772, *note 12.5(2.2/3): 4777, *note P: 9759.
+ <used> *note 3.10.1(2/2): 2277, *note 7.3(2/3): 3602, *note
+7.3(3/3): 3606, *note 12.5(2.1/3): 4772, *note 12.5(2.2/3): 4777, *note
+P: 9759.
discriminant_specification *note 3.7(5/2): 1974.
- used *note 3.7(4): 1973, *note P: 9125.
+ <used> *note 3.7(4): 1973, *note P: 9125.
discriminants
known *note 3.7(26): 1993.
unknown *note 3.7(26): 1997.
discriminated type *note 3.7(8/2): 1985.
dispatching *note 3.9(3): 2094.
- child of Ada *note D.2.1(1.2/3): 7769.
+ <child of> Ada *note D.2.1(1.2/3): 7769.
dispatching call
on a dispatching operation *note 3.9.2(1/2): 2147.
dispatching domain *note D.16.1(16/4): 8092.
dispatching operation *note 3.9.2(1/2): 2146, *note 3.9.2(2/3): 2160.
- [partial] *note 3.9(1): 2079.
+ [<partial>] *note 3.9(1): 2079.
dispatching point *note D.2.1(4/2): 7775.
- [partial] *note D.2.3(8/2): 7801, *note D.2.4(9/3): 7810.
+ [<partial>] *note D.2.3(8/2): 7801, *note D.2.4(9/3): 7810.
dispatching policy for tasks
- [partial] *note D.2.1(5/2): 7781.
+ [<partial>] *note D.2.1(5/2): 7781.
dispatching, task *note D.2.1(4/2): 7773.
Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(5/3):
8079.
Dispatching_Domain aspect *note D.16.1(18/3): 8094.
Dispatching_Domain pragma *note J.15.10(2/3): 8632, *note L(9.1/3):
8740.
Dispatching_Domain_Error
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(4/3):
8078.
Dispatching_Domains
- child of System.Multiprocessors *note D.16.1(3/3): 8077.
+ <child of> System.Multiprocessors *note D.16.1(3/3): 8077.
Dispatching_Policy_Error
- in Ada.Dispatching *note D.2.1(1.4/3): 7771.
+ <in> Ada.Dispatching *note D.2.1(1.4/3): 7771.
Display_Format
- in Interfaces.COBOL *note B.4(22): 7563.
+ <in> Interfaces.COBOL *note B.4(22): 7563.
displayed magnitude (of a decimal value) *note F.3.2(14): 8233.
disruption of an assignment *note 9.8(21): 4295, *note 13.9.1(5):
5168.
- [partial] *note 11.6(6/3): 4661.
+ [<partial>] *note 11.6(6/3): 4661.
distinct access paths *note 6.2(12/3): 3397.
distributed accessibility *note 3.10.2(33.1/3): 2321.
distributed program *note E(3): 8098.
distributed system *note E(2): 8097.
distributed systems *note C(1): 7621.
divide *note 2.1(15/3): 1168.
- in Ada.Decimal *note F.2(6/3): 8229.
+ <in> Ada.Decimal *note F.2(6/3): 8229.
divide operator *note 4.4(1/3): 2640, *note 4.5.5(1): 2848.
Division_Check *note 11.5(13/2): 4631.
- [partial] *note 3.5.4(20): 1757, *note 4.5.5(22): 2855, *note
+ [<partial>] *note 3.5.4(20): 1757, *note 4.5.5(22): 2855, *note
A.5.1(28): 6140, *note A.5.3(47): 6234, *note G.1.1(40): 8280, *note
G.1.2(28): 8307, *note K.2(202): 8678.
Division_Sign
- in Ada.Characters.Latin_1 *note A.3.3(26): 5720.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5720.
DLE
- in Ada.Characters.Latin_1 *note A.3.3(6): 5516.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5516.
Do_APC
- in System.RPC *note E.5(10): 8211.
+ <in> System.RPC *note E.5(10): 8211.
Do_RPC
- in System.RPC *note E.5(9): 8210.
+ <in> System.RPC *note E.5(9): 8210.
documentation (required of an implementation) *note 1.1.3(18): 1058,
*note M.1(1/2): 8872, *note M.2(1/2): 8874, *note M.3(1/2): 8877.
documentation requirements *note 1.1.2(34): 1044, *note M(1/3): 8870.
summary of requirements *note M.1(1/2): 8871.
Dollar_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5536.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5536.
dot *note 2.1(15/3): 1165.
dot selection
- See selected_component *note 4.1.3(1): 2417.
+ <See> selected_component *note 4.1.3(1): 2417.
double
- in Interfaces.C *note B.3(16): 7449.
+ <in> Interfaces.C *note B.3(16): 7449.
Double_Precision
- in Interfaces.Fortran *note B.5(6): 7602.
+ <in> Interfaces.Fortran *note B.5(6): 7602.
Doubly_Linked_Lists
- child of Ada.Containers *note A.18.3(5/3): 6822.
+ <child of> Ada.Containers *note A.18.3(5/3): 6822.
downward closure *note 3.10.2(38/2): 2325.
drift rate *note D.8(41): 7968.
Duration
- in Standard *note A.1(43): 5450.
+ <in> Standard *note A.1(43): 5450.
dynamic binding
- See dispatching operation *note 3.9(1): 2081.
+ <See> dispatching operation *note 3.9(1): 2081.
dynamic semantics *note 1.1.2(30): 1035.
Dynamic_Predicate aspect *note 3.2.4(1/3): 1439.
Dynamic_Priorities
- child of Ada *note D.5.1(3/2): 7865.
+ <child of> Ada *note D.5.1(3/2): 7865.
dynamically determined tag *note 3.9.2(1/2): 2150.
dynamically enclosing
of one execution by another *note 11.4(2): 4556.
@@ -83445,25 +83618,25 @@ E
e
- in Ada.Numerics *note A.5(3/2): 6109.
+ <in> Ada.Numerics *note A.5(3/2): 6109.
EDF
- child of Ada.Dispatching *note D.2.6(9/2): 7821.
- child of Ada.Synchronous_Task_Control *note D.10(5.2/3): 7979.
+ <child of> Ada.Dispatching *note D.2.6(9/2): 7821.
+ <child of> Ada.Synchronous_Task_Control *note D.10(5.2/3): 7979.
EDF_Across_Priorities task dispatching policy *note D.2.6(7/2): 7820.
edited output *note F.3(1/2): 8230.
Editing
- child of Ada.Text_IO *note F.3.3(3): 8234.
- child of Ada.Wide_Text_IO *note F.3.4(1): 8254.
- child of Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 8256.
+ <child of> Ada.Text_IO *note F.3.3(3): 8234.
+ <child of> Ada.Wide_Text_IO *note F.3.4(1): 8254.
+ <child of> Ada.Wide_Wide_Text_IO *note F.3.5(1/2): 8256.
effect
external *note 1.1.3(8): 1052.
efficiency *note 11.5(29): 4647, *note 11.6(1/3): 4653.
Eigensystem
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 8420.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 8380.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(49/2): 8420.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(27/2): 8380.
Eigenvalues
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 8419.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 8379.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(48/2): 8419.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(26/2): 8379.
Elaborate pragma *note 10.2.1(20): 4490, *note L(10): 8742.
Elaborate_All pragma *note 10.2.1(21): 4494, *note L(11): 8746.
Elaborate_Body aspect *note 10.2.1(26.1/3): 4505.
@@ -83541,110 +83714,111 @@ elaboration control *note 10.2.1(1): 4461.
elaboration dependence
library_item on another *note 10.2(9): 4452.
Elaboration_Check *note 11.5(20): 4640.
- [partial] *note 3.11(9): 2347.
+ [<partial>] *note 3.11(9): 2347.
element
of a storage pool *note 13.11(11): 5196.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 6832.
- in Ada.Containers.Hashed_Maps *note A.18.5(14/2): 6921, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(14/2): 6832.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(14/2): 6921, *note
A.18.5(31/2): 6945.
- in Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7054, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(15/2): 7054, *note
A.18.8(52/2): 7089.
- in Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7290.
- in Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7217.
- in Ada.Containers.Ordered_Maps *note A.18.6(13/2): 6972, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(12/3): 7290.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(24/3): 7217.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(13/2): 6972, *note
A.18.6(39/2): 7005.
- in Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7125, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(14/2): 7125, *note
A.18.9(65/2): 7168.
- in Ada.Containers.Vectors *note A.18.2(27/2): 6743, *note
+ <in> Ada.Containers.Vectors *note A.18.2(27/2): 6743, *note
A.18.2(28/2): 6744.
- in Ada.Strings.Bounded *note A.4.4(26): 5861.
- in Ada.Strings.Unbounded *note A.4.5(20): 5915.
+ <in> Ada.Strings.Bounded *note A.4.4(26): 5861.
+ <in> Ada.Strings.Unbounded *note A.4.5(20): 5915.
elementary type *note 3.2(2/2): 1335, *note N(16): 8903.
Elementary_Functions
- child of Ada.Numerics *note A.5.1(9/1): 6139.
+ <child of> Ada.Numerics *note A.5.1(9/1): 6139.
eligible
a type, for a convention *note B.1(14/3): 7407.
else part
of a selective_accept *note 9.7.1(11): 4234.
EM
- in Ada.Characters.Latin_1 *note A.3.3(6): 5525.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5525.
embedded systems *note C(1): 7620, *note D(1): 7756.
empty element
of a vector *note A.18.2(4/2): 6723.
empty holder *note A.18.18(3/3): 7283.
Empty_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7286.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(7/3): 7286.
Empty_List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 6825.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(8/2): 6825.
Empty_Map
- in Ada.Containers.Hashed_Maps *note A.18.5(5/2): 6911.
- in Ada.Containers.Ordered_Maps *note A.18.6(6/2): 6964.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(5/2): 6911.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(6/2): 6964.
Empty_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7043.
- in Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7116.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(5/2): 7043.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(6/2): 7116.
Empty_Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7204.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(10/3): 7204.
Empty_Vector
- in Ada.Containers.Vectors *note A.18.2(10/2): 6729.
+ <in> Ada.Containers.Vectors *note A.18.2(10/2): 6729.
enabled
invariant expression *note 7.3.2(21/4): 3638.
postcondition expression *note 6.1.1(19/3): 3368.
precondition expression *note 6.1.1(19/3): 3367.
predicate checks *note 3.2.4(7/3): 1441.
encapsulation
- See package *note 7(1): 3568.
+ <See> package *note 7(1): 3568.
enclosing
immediately *note 8.1(13): 3718.
Encode
- in Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6082, *note
-A.4.11(24/3): 6083, *note A.4.11(25/3): 6084.
- in Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3): 6089,
-*note A.4.11(32/3): 6090, *note A.4.11(33/3): 6091.
- in Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
+ <in> Ada.Strings.UTF_Encoding.Strings *note A.4.11(23/3): 6082,
+*note A.4.11(24/3): 6083, *note A.4.11(25/3): 6084.
+ <in> Ada.Strings.UTF_Encoding.Wide_Strings *note A.4.11(31/3):
+6089, *note A.4.11(32/3): 6090, *note A.4.11(33/3): 6091.
+ <in> Ada.Strings.UTF_Encoding.Wide_Wide_Strings *note A.4.11(39/3):
6096, *note A.4.11(40/3): 6097, *note A.4.11(41/3): 6098.
Encoding
- in Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6074.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(13/3): 6074.
encoding scheme *note A.4.11(46/3): 6102.
Encoding_Error
- in Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6069.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(8/3): 6069.
Encoding_Scheme
- in Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6065.
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(4/3): 6065.
end of a line *note 2.2(2/3): 1183.
End_Error
raised by failure of run-time check *note 13.13.2(37/1): 5369.
- in Ada.Direct_IO *note A.8.4(18): 6352.
- in Ada.IO_Exceptions *note A.13(4): 6619.
- in Ada.Sequential_IO *note A.8.1(15): 6320.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6600.
- in Ada.Text_IO *note A.10.1(85): 6525.
+ <in> Ada.Direct_IO *note A.8.4(18): 6352.
+ <in> Ada.IO_Exceptions *note A.13(4): 6619.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6320.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6600.
+ <in> Ada.Text_IO *note A.10.1(85): 6525.
End_Of_File
- in Ada.Direct_IO *note A.8.4(16): 6346.
- in Ada.Sequential_IO *note A.8.1(13): 6314.
- in Ada.Streams.Stream_IO *note A.12.1(12): 6584.
- in Ada.Text_IO *note A.10.1(34): 6431.
+ <in> Ada.Direct_IO *note A.8.4(16): 6346.
+ <in> Ada.Sequential_IO *note A.8.1(13): 6314.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 6584.
+ <in> Ada.Text_IO *note A.10.1(34): 6431.
End_Of_Line
- in Ada.Text_IO *note A.10.1(30): 6423.
+ <in> Ada.Text_IO *note A.10.1(30): 6423.
End_Of_Page
- in Ada.Text_IO *note A.10.1(33): 6429.
+ <in> Ada.Text_IO *note A.10.1(33): 6429.
End_Search
- in Ada.Directories *note A.16(33/2): 6663.
+ <in> Ada.Directories *note A.16(33/2): 6663.
endian
big *note 13.5.3(2): 5091.
little *note 13.5.3(2): 5094.
ENQ
- in Ada.Characters.Latin_1 *note A.3.3(5): 5505.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5505.
Enqueue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3): 7364.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(5/3):
+7364.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(5/3):
7351.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(5/3):
-7338.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(5/3): 7338.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(5/3):
7357.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(5/3):
-7345.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(5/3): 7345.
entity
- [partial] *note 3.1(1): 1290.
+ [<partial>] *note 3.1(1): 1290.
entity with runtime name text *note C.5(1.1/4): 7677.
entry
closed *note 9.5.3(5): 4098.
@@ -83659,62 +83833,63 @@ entry queue *note 9.5.3(12): 4107.
entry queuing policy *note 9.5.3(17): 4111.
default policy *note 9.5.3(17): 4113.
entry_barrier *note 9.5.2(7): 4062.
- used *note 9.5.2(5): 4055, *note P: 9601.
+ <used> *note 9.5.2(5): 4055, *note P: 9601.
entry_body *note 9.5.2(5): 4052.
- used *note 9.4(8/4): 3987, *note P: 9586.
+ <used> *note 9.4(8/4): 3987, *note P: 9586.
entry_body_formal_part *note 9.5.2(6): 4059.
- used *note 9.5.2(5): 4054, *note P: 9600.
+ <used> *note 9.5.2(5): 4054, *note P: 9600.
entry_call_alternative *note 9.7.2(3/2): 4244.
- used *note 9.7.2(2): 4242, *note 9.7.3(2): 4252, *note P: 9640.
+ <used> *note 9.7.2(2): 4242, *note 9.7.3(2): 4252, *note P: 9640.
entry_call_statement *note 9.5.3(2): 4092.
- used *note 5.1(4/2): 3128, *note 9.7.2(3.1/2): 4249, *note P: 9363.
+ <used> *note 5.1(4/2): 3128, *note 9.7.2(3.1/2): 4249, *note P:
+9363.
entry_declaration *note 9.5.2(2/3): 4038.
- used *note 9.1(5/1): 3909, *note 9.4(5/1): 3972, *note P: 9574.
+ <used> *note 9.1(5/1): 3909, *note 9.4(5/1): 3972, *note P: 9574.
entry_index *note 9.5.2(4): 4050.
- used *note 9.5.2(3): 4046, *note P: 9594.
+ <used> *note 9.5.2(3): 4046, *note P: 9594.
entry_index_specification *note 9.5.2(8): 4064.
- used *note 9.5.2(6): 4060, *note P: 9605.
+ <used> *note 9.5.2(6): 4060, *note P: 9605.
enumeration literal *note 3.5.1(6/3): 1695.
enumeration type *note 3.2(3): 1341, *note 3.5.1(1): 1686, *note
N(17): 8904.
enumeration_aggregate *note 13.4(3): 5041.
- used *note 13.4(2): 5040, *note P: 9822.
+ <used> *note 13.4(2): 5040, *note P: 9822.
Enumeration_IO
- in Ada.Text_IO *note A.10.1(79): 6511.
+ <in> Ada.Text_IO *note A.10.1(79): 6511.
enumeration_literal_specification *note 3.5.1(3): 1690.
- used *note 3.5.1(2): 1688, *note P: 9080.
+ <used> *note 3.5.1(2): 1688, *note P: 9080.
enumeration_representation_clause *note 13.4(2): 5038.
- used *note 13.1(2/1): 4874, *note P: 9800.
+ <used> *note 13.1(2/1): 4874, *note P: 9800.
enumeration_type_definition *note 3.5.1(2): 1687.
- used *note 3.2.1(4/2): 1381, *note P: 9033.
+ <used> *note 3.2.1(4/2): 1381, *note P: 9033.
environment *note 10.1.4(1): 4413.
environment declarative_part *note 10.1.4(1): 4414.
for the environment task of a partition *note 10.2(13): 4454.
environment task *note 10.2(8): 4451.
environment variable *note A.17(1/2): 6698.
Environment_Task
- in Ada.Task_Identification *note C.7.1(3/3): 7713.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7713.
Environment_Variables
- child of Ada *note A.17(3/2): 6699.
+ <child of> Ada *note A.17(3/2): 6699.
EOT
- in Ada.Characters.Latin_1 *note A.3.3(5): 5504.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5504.
EPA
- in Ada.Characters.Latin_1 *note A.3.3(18): 5621.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5621.
epoch *note D.8(19): 7964.
equal operator *note 4.4(1/3): 2593, *note 4.5.2(1): 2767.
Equal_Case_Insensitive
- child of Ada.Strings *note A.4.10(2/3): 6056.
- child of Ada.Strings.Bounded *note A.4.10(7/3): 6058.
- child of Ada.Strings.Fixed *note A.4.10(5/3): 6057.
- child of Ada.Strings.Unbounded *note A.4.10(10/3): 6059.
+ <child of> Ada.Strings *note A.4.10(2/3): 6056.
+ <child of> Ada.Strings.Bounded *note A.4.10(7/3): 6058.
+ <child of> Ada.Strings.Fixed *note A.4.10(5/3): 6057.
+ <child of> Ada.Strings.Unbounded *note A.4.10(10/3): 6059.
Equal_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7208.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(14/3): 7208.
equality operator *note 4.5.2(1): 2761.
special inheritance rule for tagged types *note 3.4(17/2): 1551,
*note 4.5.2(14/3): 2797.
equals sign *note 2.1(15/3): 1172.
Equals_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 5552.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5552.
equivalent element
of a hashed set *note A.18.8(64/2): 7101.
of an ordered set *note A.18.9(78/2): 7181.
@@ -83722,17 +83897,17 @@ equivalent key
of a hashed map *note A.18.5(42/2): 6952.
of an ordered map *note A.18.6(55/2): 7011.
Equivalent_Elements
- in Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7083, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(46/2): 7083, *note
A.18.8(47/2): 7084, *note A.18.8(48/2): 7085.
- in Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7113.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(3/2): 7113.
Equivalent_Keys
- in Ada.Containers.Hashed_Maps *note A.18.5(34/2): 6947, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(34/2): 6947, *note
A.18.5(35/2): 6948, *note A.18.5(36/2): 6949.
- in Ada.Containers.Ordered_Maps *note A.18.6(3/2): 6961.
- in Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7166.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(3/2): 6961.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(63/2): 7166.
Equivalent_Sets
- in Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7047.
- in Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7120.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(8/2): 7047.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(9/2): 7120.
erroneous execution *note 1.1.2(32): 1041, *note 1.1.5(10): 1080.
cause *note 3.7.2(4): 2020, *note 3.9(25.3/2): 2132, *note
6.4.1(18/3): 3495, *note 9.8(21): 4296, *note 9.10(11): 4309, *note
@@ -83760,17 +83935,17 @@ error
link-time *note 1.1.2(29): 1032, *note 1.1.5(4): 1075.
run-time *note 1.1.2(30): 1038, *note 1.1.5(6): 1077, *note
11.5(2/3): 4615, *note 11.6(1/3): 4651.
- See also bounded error, erroneous execution
+ <See also> bounded error, erroneous execution
ESA
- in Ada.Characters.Latin_1 *note A.3.3(17): 5605.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5605.
ESC
- in Ada.Characters.Latin_1 *note A.3.3(6): 5527.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5527.
Establish_RPC_Receiver
- in System.RPC *note E.5(12): 8213.
+ <in> System.RPC *note E.5(12): 8213.
ETB
- in Ada.Characters.Latin_1 *note A.3.3(6): 5523.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5523.
ETX
- in Ada.Characters.Latin_1 *note A.3.3(5): 5503.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5503.
evaluation *note 3.1(11): 1325, *note N(17.1/2): 8905, *note N(19):
8911.
aggregate *note 4.3(5): 2499.
@@ -83817,40 +83992,41 @@ evaluation *note 3.1(11): 1325, *note N(17.1/2):
8905, *note N(19):
Exception *note 11(1/3): 4511, *note 11.1(1): 4514, *note N(18): 8906.
exception occurrence *note 11(1/3): 4506.
exception_choice *note 11.2(5): 4539.
- used *note 11.2(3): 4534, *note P: 9699.
+ <used> *note 11.2(3): 4534, *note P: 9699.
exception_declaration *note 11.1(2/3): 4515.
- used *note 3.1(3/3): 1303, *note P: 9019.
+ <used> *note 3.1(3/3): 1303, *note P: 9019.
exception_handler *note 11.2(3): 4532.
- used *note 11.2(2): 4531, *note P: 9696.
+ <used> *note 11.2(2): 4531, *note P: 9696.
Exception_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4565.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4565.
Exception_Identity
- in Ada.Exceptions *note 11.4.1(5/2): 4576.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 4576.
Exception_Information
- in Ada.Exceptions *note 11.4.1(5/2): 4580.
+ <in> Ada.Exceptions *note 11.4.1(5/2): 4580.
Exception_Message
- in Ada.Exceptions *note 11.4.1(4/3): 4574.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 4574.
Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4567, *note 11.4.1(5/2): 4577.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4567, *note 11.4.1(5/2):
+4577.
Exception_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4570.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4570.
Exception_Occurrence_Access
- in Ada.Exceptions *note 11.4.1(3/2): 4571.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4571.
exception_renaming_declaration *note 8.5.2(2/3): 3812.
- used *note 8.5(2): 3791, *note P: 9510.
+ <used> *note 8.5(2): 3791, *note P: 9510.
Exceptions
- child of Ada *note 11.4.1(2/2): 4564.
+ <child of> Ada *note 11.4.1(2/2): 4564.
Exchange_Handler
- in Ada.Interrupts *note C.3.2(8): 7666.
+ <in> Ada.Interrupts *note C.3.2(8): 7666.
Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(8): 5533.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5533.
exclamation point *note 2.1(15/3): 1177.
Exclude
- in Ada.Containers.Hashed_Maps *note A.18.5(24/2): 6938.
- in Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7065, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(24/2): 6938.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(23/2): 7065, *note
A.18.8(54/2): 7091.
- in Ada.Containers.Ordered_Maps *note A.18.6(23/2): 6989.
- in Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7136, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(23/2): 6989.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(22/2): 7136, *note
A.18.9(67/2): 7170.
excludes null
subtype *note 3.10(13.1/2): 2268.
@@ -83914,26 +84090,27 @@ execution resource
execution time
of a task *note D.14(11/3): 8011.
Execution_Time
- child of Ada *note D.14(3/2): 7999.
+ <child of> Ada *note D.14(3/2): 7999.
exhaust
a budget *note D.14.2(14/2): 8050.
exist
cease to *note 7.6.1(11/3): 3700, *note 13.11.2(10/4): 5232, *note
13.11.5(7.1/4): 5289.
Exists
- in Ada.Directories *note A.16(24/2): 6655.
- in Ada.Environment_Variables *note A.17(5/2): 6702.
+ <in> Ada.Directories *note A.16(24/2): 6655.
+ <in> Ada.Environment_Variables *note A.17(5/2): 6702.
exit_statement *note 5.7(2): 3266.
- used *note 5.1(4/2): 3124, *note P: 9359.
+ <used> *note 5.1(4/2): 3124, *note P: 9359.
Exit_Status
- in Ada.Command_Line *note A.15(7): 6630.
+ <in> Ada.Command_Line *note A.15(7): 6630.
Exp
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8288.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6114.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6114.
expanded name *note 4.1.3(4): 2425.
Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2103.
+ <in> Ada.Tags *note 3.9(7/2): 2103.
expected profile *note 8.6(26): 3864.
accept_statement entry_direct_name *note 9.5.2(11): 4067.
Access attribute_reference prefix *note 3.10.2(2.3/2): 2287.
@@ -84040,7 +84217,7 @@ expected type *note 8.6(20/2): 3859.
type_conversion operand *note 4.6(6): 2939.
variant_part discrete_choice *note 3.8.1(6): 2073.
expiration time
- [partial] *note 9.6(1): 4131.
+ [<partial>] *note 9.6(1): 4131.
for a delay_relative_statement *note 9.6(20): 4161.
for a delay_until_statement *note 9.6(20): 4160.
expires
@@ -84048,16 +84225,16 @@ expires
explicit declaration *note 3.1(5): 1309, *note N(11): 8896.
explicit initial value *note 3.3.1(1/3): 1474.
explicit_actual_parameter *note 6.4(6): 3460.
- used *note 6.4(5): 3459, *note P: 9460.
+ <used> *note 6.4(5): 3459, *note P: 9460.
explicit_dereference *note 4.1(5): 2378.
- used *note 4.1(2/3): 2361, *note P: 9197.
+ <used> *note 4.1(2/3): 2361, *note P: 9197.
explicit_generic_actual_parameter *note 12.3(5): 4715.
- used *note 12.3(4): 4714, *note P: 9738.
+ <used> *note 12.3(4): 4714, *note P: 9738.
explicitly aliased parameter *note 6.1(23.1/3): 3338.
explicitly assign *note 10.2(2): 4446.
explicitly limited record *note 3.8(13.1/3): 2044.
exponent *note 2.4.1(4): 1219, *note 4.5.6(11/3): 2873.
- used *note 2.4.1(2): 1214, *note 2.4.2(2): 1237, *note P: 8979.
+ <used> *note 2.4.1(2): 1214, *note 2.4.2(2): 1237, *note P: 8979.
Exponent attribute *note A.5.3(18): 6205.
exponentiation operator *note 4.4(1/3): 2648, *note 4.5.6(7): 2869.
Export aspect *note B.1(1/3): 7387.
@@ -84065,44 +84242,44 @@ Export pragma *note J.15.5(3/3): 8571, *note
L(13.1/3): 8753.
exported entity *note B.1(23/3): 7410.
expression *note 4.4(1/3): 2582, *note 4.4(2): 2655.
predicate-static *note 3.2.4(15/3): 1445.
- used *note 2.8(3/3): 1267, *note 3.3.1(2/3): 1486, *note 3.3.2(2):
-1525, *note 3.5.4(4): 1728, *note 3.5.7(2): 1796, *note 3.5.9(3): 1833,
-*note 3.5.9(4): 1837, *note 3.7(6): 1983, *note 3.7.1(3): 2007, *note
-4.1.1(2): 2396, *note 4.1.4(3/2): 2439, *note 4.1.4(5): 2444, *note
-4.3.1(4/2): 2512, *note 4.3.2(3): 2531, *note 4.3.3(3/2): 2548, *note
-4.3.3(5/2): 2559, *note 4.4(7/3): 2715, *note 4.5.7(3/3): 2885, *note
-4.5.7(4/3): 2888, *note 4.5.7(5/3): 2890, *note 4.5.7(6/3): 2895, *note
-4.5.8(3/3): 2915, *note 4.6(2): 2927, *note 4.7(2): 3027, *note 5.2(2):
-3152, *note 5.4(2/3): 3177, *note 6.4(6): 3461, *note 6.5(2.1/3): 3502,
-*note 6.5(2/2): 3498, *note 6.8(2/4): 3554, *note 9.5.2(4): 4051, *note
-9.6(3): 4137, *note 9.6(4): 4139, *note 11.3(2/2): 4546, *note
-11.4.2(3/2): 4592, *note 12.3(5): 4716, *note 13.1.1(4/3): 4920, *note
-13.3(2): 4948, *note 13.5.1(4): 5069, *note 13.12(4.1/2): 5300, *note
-B.1(8): 7401, *note B.1(10.1/3): 7403, *note D.2.2(3.2/2): 7791, *note
-J.7(1): 8507, *note J.8(1): 8517, *note J.15.4(2/3): 8549, *note
-J.15.5(2/3): 8568, *note J.15.5(3/3): 8574, *note J.15.7(4/3): 8594,
-*note J.15.9(2/3): 8629, *note L(2.1/2): 8701, *note L(6.1/3): 8723,
-*note L(8.2/3): 8730, *note L(13.1/3): 8757, *note L(14.1/3): 8762,
-*note L(19): 8785, *note L(27.2/2): 8820, *note L(35.1/3): 8851, *note
-P: 9845.
+ <used> *note 2.8(3/3): 1267, *note 3.3.1(2/3): 1486, *note
+3.3.2(2): 1525, *note 3.5.4(4): 1728, *note 3.5.7(2): 1796, *note
+3.5.9(3): 1833, *note 3.5.9(4): 1837, *note 3.7(6): 1983, *note
+3.7.1(3): 2007, *note 4.1.1(2): 2396, *note 4.1.4(3/2): 2439, *note
+4.1.4(5): 2444, *note 4.3.1(4/2): 2512, *note 4.3.2(3): 2531, *note
+4.3.3(3/2): 2548, *note 4.3.3(5/2): 2559, *note 4.4(7/3): 2715, *note
+4.5.7(3/3): 2885, *note 4.5.7(4/3): 2888, *note 4.5.7(5/3): 2890, *note
+4.5.7(6/3): 2895, *note 4.5.8(3/3): 2915, *note 4.6(2): 2927, *note
+4.7(2): 3027, *note 5.2(2): 3152, *note 5.4(2/3): 3177, *note 6.4(6):
+3461, *note 6.5(2.1/3): 3502, *note 6.5(2/2): 3498, *note 6.8(2/4):
+3554, *note 9.5.2(4): 4051, *note 9.6(3): 4137, *note 9.6(4): 4139,
+*note 11.3(2/2): 4546, *note 11.4.2(3/2): 4592, *note 12.3(5): 4716,
+*note 13.1.1(4/3): 4920, *note 13.3(2): 4948, *note 13.5.1(4): 5069,
+*note 13.12(4.1/2): 5300, *note B.1(8): 7401, *note B.1(10.1/3): 7403,
+*note D.2.2(3.2/2): 7791, *note J.7(1): 8507, *note J.8(1): 8517, *note
+J.15.4(2/3): 8549, *note J.15.5(2/3): 8568, *note J.15.5(3/3): 8574,
+*note J.15.7(4/3): 8594, *note J.15.9(2/3): 8629, *note L(2.1/2): 8701,
+*note L(6.1/3): 8723, *note L(8.2/3): 8730, *note L(13.1/3): 8757, *note
+L(14.1/3): 8762, *note L(19): 8785, *note L(27.2/2): 8820, *note
+L(35.1/3): 8851, *note P: 9845.
expression function *note 6.8(6/4): 3562.
expression_function_declaration *note 6.8(2/4): 3551.
- used *note 3.1(3/3): 1300, *note 9.4(8/4): 3986, *note P: 9016.
+ <used> *note 3.1(3/3): 1300, *note 9.4(8/4): 3986, *note P: 9016.
extended_digit *note 2.4.2(5): 1244.
- used *note 2.4.2(4): 1243, *note P: 8990.
-Extended_Index subtype of Index_Type'Base
- in Ada.Containers.Vectors *note A.18.2(7/2): 6725.
+ <used> *note 2.4.2(4): 1243, *note P: 8990.
+Extended_Index <subtype of> Index_Type'Base
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 6725.
extended_return_object_declaration *note 6.5(2.1/3): 3499.
- used *note 6.5(2.2/3): 3504, *note P: 9467.
+ <used> *note 6.5(2.2/3): 3504, *note P: 9467.
extended_return_statement *note 6.5(2.2/3): 3503.
- used *note 5.1(5/2): 3139, *note P: 9373.
+ <used> *note 5.1(5/2): 3139, *note P: 9373.
extension
of a private type *note 3.9(2.1/2): 2092, *note 3.9.1(1/2): 2140.
of a record type *note 3.9(2.1/2): 2090, *note 3.9.1(1/2): 2138.
of a type *note 3.9(2/2): 2089, *note 3.9.1(1/2): 2136.
- in Ada.Directories *note A.16(18/2): 6648.
+ <in> Ada.Directories *note A.16(18/2): 6648.
extension_aggregate *note 4.3.2(2): 2527.
- used *note 4.3(2): 2496, *note P: 9235.
+ <used> *note 4.3(2): 2496, *note P: 9235.
external call *note 9.5(4/3): 4014.
external effect
of the execution of an Ada program *note 1.1.3(8): 1051.
@@ -84115,7 +84292,7 @@ external streaming
type supports *note 13.13.2(52/3): 5397.
External_Name aspect *note B.1(1/3): 7391.
External_Tag
- in Ada.Tags *note 3.9(7/2): 2106.
+ <in> Ada.Tags *note 3.9(7/2): 2106.
External_Tag aspect *note 13.3(75/3): 5037, *note K.2(65): 8664.
External_Tag attribute *note 13.3(75/3): 5033.
External_Tag clause *note 13.3(7/2): 4963, *note 13.3(75/3): 5034,
@@ -84133,21 +84310,21 @@ F
factor *note 4.4(6): 2704.
- used *note 4.4(5): 2701, *note P: 9302.
+ <used> *note 4.4(5): 2701, *note P: 9302.
factory *note 3.9(30/2): 2133.
failure
of a language-defined check *note 11.5(2/3): 4616.
- in Ada.Command_Line *note A.15(8): 6632.
+ <in> Ada.Command_Line *note A.15(8): 6632.
fall-back handler *note C.7.3(9/2): 7749.
False *note 3.5.3(1): 1714.
family
entry *note 9.5.2(20): 4076.
Feminine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5641.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5641.
FF
- in Ada.Characters.Latin_1 *note A.3.3(5): 5512.
-Field subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6380.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5512.
+Field <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6380.
FIFO_Queuing queuing policy *note D.4(7/2): 7861.
FIFO_Within_Priorities task dispatching policy *note D.2.3(2/2): 7799.
file
@@ -84155,23 +84332,23 @@ file
file name *note A.16(46/2): 6679.
file terminator *note A.10(7): 6366.
File_Access
- in Ada.Text_IO *note A.10.1(18): 6402.
+ <in> Ada.Text_IO *note A.10.1(18): 6402.
File_Kind
- in Ada.Directories *note A.16(22/2): 6653.
+ <in> Ada.Directories *note A.16(22/2): 6653.
File_Mode
- in Ada.Direct_IO *note A.8.4(4): 6325.
- in Ada.Sequential_IO *note A.8.1(4): 6300.
- in Ada.Streams.Stream_IO *note A.12.1(6): 6571.
- in Ada.Text_IO *note A.10.1(4): 6376.
+ <in> Ada.Direct_IO *note A.8.4(4): 6325.
+ <in> Ada.Sequential_IO *note A.8.1(4): 6300.
+ <in> Ada.Streams.Stream_IO *note A.12.1(6): 6571.
+ <in> Ada.Text_IO *note A.10.1(4): 6376.
File_Size
- in Ada.Directories *note A.16(23/2): 6654.
+ <in> Ada.Directories *note A.16(23/2): 6654.
File_Type
- in Ada.Direct_IO *note A.8.4(3): 6324.
- in Ada.Sequential_IO *note A.8.1(3): 6299.
- in Ada.Streams.Stream_IO *note A.12.1(5/4): 6570.
- in Ada.Text_IO *note A.10.1(3): 6375.
+ <in> Ada.Direct_IO *note A.8.4(3): 6324.
+ <in> Ada.Sequential_IO *note A.8.1(3): 6299.
+ <in> Ada.Streams.Stream_IO *note A.12.1(5/4): 6570.
+ <in> Ada.Text_IO *note A.10.1(3): 6375.
Filter_Type
- in Ada.Directories *note A.16(30/2): 6660.
+ <in> Ada.Directories *note A.16(30/2): 6660.
finalization
of a master *note 7.6.1(4): 3696.
of a protected object *note 9.4(20): 4007.
@@ -84180,40 +84357,40 @@ finalization
of an object *note 7.6.1(5): 3697.
of environment task for a foreign language main subprogram *note
B.1(39/3): 7419.
- child of Ada *note 7.6(4/3): 3661.
+ <child of> Ada *note 7.6(4/3): 3661.
Finalize *note 7.6(2): 3659.
- in Ada.Finalization *note 7.6(6/2): 3665, *note 7.6(8/2): 3668.
+ <in> Ada.Finalization *note 7.6(6/2): 3665, *note 7.6(8/2): 3668.
Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 6864.
- in Ada.Containers.Hashed_Maps *note A.18.5(30/2): 6944.
- in Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7081, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(41/2): 6864.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(30/2): 6944.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(43/2): 7081, *note
A.18.8(56/2): 7093.
- in Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7231.
- in Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7004.
- in Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7159, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(38/3): 7231.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(38/2): 7004.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(49/2): 7159, *note
A.18.9(69/2): 7172.
- in Ada.Containers.Vectors *note A.18.2(68/2): 6791.
+ <in> Ada.Containers.Vectors *note A.18.2(68/2): 6791.
Find_In_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7232.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(39/3): 7232.
Find_Index
- in Ada.Containers.Vectors *note A.18.2(67/2): 6790.
+ <in> Ada.Containers.Vectors *note A.18.2(67/2): 6790.
Find_Token
- in Ada.Strings.Bounded *note A.4.4(50.1/3): 5877, *note A.4.4(51):
-5878.
- in Ada.Strings.Fixed *note A.4.3(15.1/3): 5820, *note A.4.3(16):
+ <in> Ada.Strings.Bounded *note A.4.4(50.1/3): 5877, *note
+A.4.4(51): 5878.
+ <in> Ada.Strings.Fixed *note A.4.3(15.1/3): 5820, *note A.4.3(16):
5821.
- in Ada.Strings.Unbounded *note A.4.5(45.1/3): 5931, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(45.1/3): 5931, *note
A.4.5(46): 5932.
Fine_Delta
- in System *note 13.7(9): 5115.
+ <in> System *note 13.7(9): 5115.
First
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 6856.
- in Ada.Containers.Hashed_Maps *note A.18.5(27/2): 6941.
- in Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7078.
- in Ada.Containers.Ordered_Maps *note A.18.6(28/2): 6994.
- in Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7151.
- in Ada.Containers.Vectors *note A.18.2(58/2): 6781.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3211.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(33/2): 6856.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(27/2): 6941.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(40/2): 7078.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(28/2): 6994.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(41/2): 7151.
+ <in> Ada.Containers.Vectors *note A.18.2(58/2): 6781.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3211.
First attribute *note 3.5(12): 1612, *note 3.6.2(3): 1947.
first element
of a hashed set *note A.18.8(68/2): 7106.
@@ -84226,63 +84403,63 @@ first node
first subtype *note 3.2.1(6): 1389, *note 3.4.1(5): 1567.
First(N) attribute *note 3.6.2(4): 1949.
first_bit *note 13.5.1(5): 5070.
- used *note 13.5.1(3): 5066, *note P: 9829.
+ <used> *note 13.5.1(3): 5066, *note P: 9829.
First_Bit attribute *note 13.5.2(3/2): 5083.
First_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7253.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(60/3): 7253.
First_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7254.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(61/3): 7254.
First_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 6857.
- in Ada.Containers.Ordered_Maps *note A.18.6(29/2): 6995.
- in Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7152.
- in Ada.Containers.Vectors *note A.18.2(59/2): 6782.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(34/2): 6857.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(29/2): 6995.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(42/2): 7152.
+ <in> Ada.Containers.Vectors *note A.18.2(59/2): 6782.
First_Index
- in Ada.Containers.Vectors *note A.18.2(57/2): 6780.
+ <in> Ada.Containers.Vectors *note A.18.2(57/2): 6780.
First_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(30/2): 6996.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(30/2): 6996.
First_Valid attribute *note 3.5.5(7.2/4): 1779.
Fixed
- child of Ada.Strings *note A.4.3(5): 5807.
+ <child of> Ada.Strings *note A.4.3(5): 5807.
fixed point type *note 3.5.9(1): 1825.
Fixed_IO
- in Ada.Text_IO *note A.10.1(68): 6491.
+ <in> Ada.Text_IO *note A.10.1(68): 6491.
fixed_point_definition *note 3.5.9(2): 1829.
- used *note 3.5.6(2): 1787, *note P: 9091.
+ <used> *note 3.5.6(2): 1787, *note P: 9091.
Float *note 3.5.7(12): 1815, *note 3.5.7(14): 1817.
- in Standard *note A.1(21): 5441.
+ <in> Standard *note A.1(21): 5441.
Float_IO
- in Ada.Text_IO *note A.10.1(63): 6481.
+ <in> Ada.Text_IO *note A.10.1(63): 6481.
Float_Random
- child of Ada.Numerics *note A.5.2(5): 6147.
+ <child of> Ada.Numerics *note A.5.2(5): 6147.
Float_Text_IO
- child of Ada *note A.10.9(33): 6536.
+ <child of> Ada *note A.10.9(33): 6536.
Float_Wide_Text_IO
- child of Ada *note A.11(2/2): 6557.
+ <child of> Ada *note A.11(2/2): 6557.
Float_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6560.
+ <child of> Ada *note A.11(3/2): 6560.
Floating
- in Interfaces.COBOL *note B.4(9): 7546.
+ <in> Interfaces.COBOL *note B.4(9): 7546.
floating point type *note 3.5.7(1): 1794.
floating_point_definition *note 3.5.7(2): 1795.
- used *note 3.5.6(2): 1786, *note P: 9090.
+ <used> *note 3.5.6(2): 1786, *note P: 9090.
Floor
- in Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7006.
- in Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7160, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(40/2): 7006.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(50/2): 7160, *note
A.18.9(70/2): 7173.
Floor attribute *note A.5.3(30): 6219.
Flush
- in Ada.Direct_IO *note A.8.4(10.1/4): 6338.
- in Ada.Sequential_IO *note A.8.1(10.1/4): 6311.
- in Ada.Streams.Stream_IO *note A.12.1(25/1): 6594.
- in Ada.Text_IO *note A.10.1(21/1): 6410.
+ <in> Ada.Direct_IO *note A.8.4(10.1/4): 6338.
+ <in> Ada.Sequential_IO *note A.8.1(10.1/4): 6311.
+ <in> Ada.Streams.Stream_IO *note A.12.1(25/1): 6594.
+ <in> Ada.Text_IO *note A.10.1(21/1): 6410.
Fore attribute *note 3.5.10(4): 1873.
form
of an external file *note A.7(1): 6282.
- in Ada.Direct_IO *note A.8.4(9): 6336.
- in Ada.Sequential_IO *note A.8.1(9): 6309.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6582.
- in Ada.Text_IO *note A.10.1(12): 6391.
+ <in> Ada.Direct_IO *note A.8.4(9): 6336.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6309.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6582.
+ <in> Ada.Text_IO *note A.10.1(12): 6391.
formal object, generic *note 12.4(1): 4740.
formal package, generic *note 12.7(1): 4851.
formal parameter
@@ -84291,77 +84468,77 @@ formal subprogram, generic *note 12.6(1): 4827.
formal subtype *note 12.5(5): 4797.
formal type *note 12.5(5): 4795.
formal_abstract_subprogram_declaration *note 12.6(2.2/3): 4835.
- used *note 12.6(2/2): 4830, *note P: 9781.
+ <used> *note 12.6(2/2): 4830, *note P: 9781.
formal_access_type_definition *note 12.5.4(2): 4820.
- used *note 12.5(3/2): 4788, *note P: 9773.
+ <used> *note 12.5(3/2): 4788, *note P: 9773.
formal_array_type_definition *note 12.5.3(2): 4816.
- used *note 12.5(3/2): 4787, *note P: 9772.
+ <used> *note 12.5(3/2): 4787, *note P: 9772.
formal_complete_type_declaration *note 12.5(2.1/3): 4770.
- used *note 12.5(2/3): 4768, *note P: 9756.
+ <used> *note 12.5(2/3): 4768, *note P: 9756.
formal_concrete_subprogram_declaration *note 12.6(2.1/3): 4831.
- used *note 12.6(2/2): 4829, *note P: 9780.
+ <used> *note 12.6(2/2): 4829, *note P: 9780.
formal_decimal_fixed_point_definition *note 12.5.2(7): 4815.
- used *note 12.5(3/2): 4786, *note P: 9771.
+ <used> *note 12.5(3/2): 4786, *note P: 9771.
formal_derived_type_definition *note 12.5.1(3/2): 4801.
- used *note 12.5(3/2): 4780, *note P: 9765.
+ <used> *note 12.5(3/2): 4780, *note P: 9765.
formal_discrete_type_definition *note 12.5.2(2): 4810.
- used *note 12.5(3/2): 4781, *note P: 9766.
+ <used> *note 12.5(3/2): 4781, *note P: 9766.
formal_floating_point_definition *note 12.5.2(5): 4813.
- used *note 12.5(3/2): 4784, *note P: 9769.
+ <used> *note 12.5(3/2): 4784, *note P: 9769.
formal_incomplete_type_declaration *note 12.5(2.2/3): 4775.
- used *note 12.5(2/3): 4769, *note P: 9757.
+ <used> *note 12.5(2/3): 4769, *note P: 9757.
formal_interface_type_definition *note 12.5.5(2/2): 4824.
- used *note 12.5(3/2): 4789, *note P: 9774.
+ <used> *note 12.5(3/2): 4789, *note P: 9774.
formal_modular_type_definition *note 12.5.2(4): 4812.
- used *note 12.5(3/2): 4783, *note P: 9768.
+ <used> *note 12.5(3/2): 4783, *note P: 9768.
formal_object_declaration *note 12.4(2/3): 4741.
- used *note 12.1(6): 4681, *note P: 9717.
+ <used> *note 12.1(6): 4681, *note P: 9717.
formal_ordinary_fixed_point_definition *note 12.5.2(6): 4814.
- used *note 12.5(3/2): 4785, *note P: 9770.
+ <used> *note 12.5(3/2): 4785, *note P: 9770.
formal_package_actual_part *note 12.7(3/2): 4857.
- used *note 12.7(2/3): 4855, *note P: 9792.
+ <used> *note 12.7(2/3): 4855, *note P: 9792.
formal_package_association *note 12.7(3.1/2): 4861.
- used *note 12.7(3/2): 4860, *note P: 9796.
+ <used> *note 12.7(3/2): 4860, *note P: 9796.
formal_package_declaration *note 12.7(2/3): 4852.
- used *note 12.1(6): 4684, *note P: 9720.
+ <used> *note 12.1(6): 4684, *note P: 9720.
formal_part *note 6.1(14): 3316.
- used *note 6.1(12): 3309, *note 6.1(13/2): 3314, *note P: 9430.
+ <used> *note 6.1(12): 3309, *note 6.1(13/2): 3314, *note P: 9430.
formal_private_type_definition *note 12.5.1(2): 4800.
- used *note 12.5(3/2): 4779, *note P: 9764.
+ <used> *note 12.5(3/2): 4779, *note P: 9764.
formal_signed_integer_type_definition *note 12.5.2(3): 4811.
- used *note 12.5(3/2): 4782, *note P: 9767.
+ <used> *note 12.5(3/2): 4782, *note P: 9767.
formal_subprogram_declaration *note 12.6(2/2): 4828.
- used *note 12.1(6): 4683, *note P: 9719.
+ <used> *note 12.1(6): 4683, *note P: 9719.
formal_type_declaration *note 12.5(2/3): 4767.
- used *note 12.1(6): 4682, *note P: 9718.
+ <used> *note 12.1(6): 4682, *note P: 9718.
formal_type_definition *note 12.5(3/2): 4778.
- used *note 12.5(2.1/3): 4773, *note P: 9760.
+ <used> *note 12.5(2.1/3): 4773, *note P: 9760.
format_effector *note 2.1(13/3): 1145.
Formatting
- child of Ada.Calendar *note 9.6.1(15/2): 4177.
+ <child of> Ada.Calendar *note 9.6.1(15/2): 4177.
Fortran
- child of Interfaces *note B.5(4): 7599.
+ <child of> Interfaces *note B.5(4): 7599.
Fortran interface *note B.5(1/3): 7598.
Fortran standard *note 1.2(3/2): 1096.
Fortran_Character
- in Interfaces.Fortran *note B.5(12/3): 7610.
+ <in> Interfaces.Fortran *note B.5(12/3): 7610.
Fortran_Integer
- in Interfaces.Fortran *note B.5(5): 7600.
+ <in> Interfaces.Fortran *note B.5(5): 7600.
forward iterator *note 5.5.2(4/3): 3251.
Forward_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3210.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3210.
Fraction attribute *note A.5.3(21): 6207.
Fraction_One_Half
- in Ada.Characters.Latin_1 *note A.3.3(22): 5662.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5662.
Fraction_One_Quarter
- in Ada.Characters.Latin_1 *note A.3.3(22): 5661.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5661.
Fraction_Three_Quarters
- in Ada.Characters.Latin_1 *note A.3.3(22): 5663.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5663.
Free
- in Ada.Strings.Unbounded *note A.4.5(7): 5907.
- in Interfaces.C.Strings *note B.3.1(11): 7504.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 5907.
+ <in> Interfaces.C.Strings *note B.3.1(11): 7504.
freed
- See nonexistent *note 13.11.2(10/4): 5230.
+ <See> nonexistent *note 13.11.2(10/4): 5230.
freeing storage *note 13.11.2(1): 5227.
freezing
by a constituent of a construct *note 13.14(4/1): 5405.
@@ -84407,9 +84584,9 @@ freezing
freezing points
entity *note 13.14(2): 5400.
Friday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4183.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4183.
FS
- in Ada.Characters.Latin_1 *note A.3.3(6): 5528.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5528.
full conformance
for discrete_subtype_definitions *note 6.3.1(24): 3441.
for expressions *note 6.3.1(19): 3438.
@@ -84431,11 +84608,12 @@ full type definition *note 3.2.1(8/2): 1394.
full view
of a type *note 3.2.1(8/2): 1395.
Full_Name
- in Ada.Directories *note A.16(15/2): 6645, *note A.16(39/2): 6667.
+ <in> Ada.Directories *note A.16(15/2): 6645, *note A.16(39/2):
+6667.
Full_Stop
- in Ada.Characters.Latin_1 *note A.3.3(8): 5547.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5547.
full_type_declaration *note 3.2.1(3/3): 1373.
- used *note 3.2.1(2): 1369, *note P: 9023.
+ <used> *note 3.2.1(2): 1369, *note P: 9023.
function *note 6(1): 3277, *note N(19.1/2): 8912.
expression *note 6.8(6/4): 3563.
with a controlling access result *note 3.9.2(2/3): 2166.
@@ -84444,9 +84622,9 @@ function call
master of *note 3.10.2(10.1/3): 2299.
function instance *note 12.3(13): 4730.
function_call *note 6.4(3): 3450.
- used *note 4.1(2/3): 2367, *note P: 9203.
+ <used> *note 4.1(2/3): 2367, *note P: 9203.
function_specification *note 6.1(4.2/2): 3291.
- used *note 6.1(4/2): 3287, *note 6.8(2/4): 3553, *note P: 9475.
+ <used> *note 6.1(4/2): 3287, *note 6.8(2/4): 3553, *note P: 9475.
@@ -84459,24 +84637,24 @@ G
general access type *note 3.10(7/1): 2250, *note 3.10(8): 2254.
general_access_modifier *note 3.10(4): 2235.
- used *note 3.10(3): 2233, *note P: 9172.
+ <used> *note 3.10(3): 2233, *note P: 9172.
generalized iterator *note 5.5.2(3/3): 3241.
generalized_indexing *note 4.1.6(10/3): 2468.
- used *note 4.1(2/3): 2371, *note P: 9207.
+ <used> *note 4.1(2/3): 2371, *note P: 9207.
generalized_reference *note 4.1.5(4/3): 2455.
- used *note 4.1(2/3): 2370, *note P: 9206.
+ <used> *note 4.1(2/3): 2370, *note P: 9206.
generation
of an interrupt *note C.3(2): 7632.
Generator
- in Ada.Numerics.Discrete_Random *note A.5.2(19): 6161.
- in Ada.Numerics.Float_Random *note A.5.2(7): 6148.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(19): 6161.
+ <in> Ada.Numerics.Float_Random *note A.5.2(7): 6148.
generic actual *note 12.3(7/3): 4725.
generic actual parameter *note 12.3(7/3): 4724.
generic actual subtype *note 12.5(4): 4790.
generic actual type *note 12.5(4): 4792.
generic body *note 12.2(1): 4691.
generic contract issue *note 10.2.1(10/2): 4471.
- [partial] *note 3.2.4(29/3): 1446, *note 3.4(5.1/3): 1540, *note
+ [<partial>] *note 3.2.4(29/3): 1446, *note 3.4(5.1/3): 1540, *note
3.7(10/3): 1987, *note 3.7.1(7/3): 2013, *note 3.9.1(3/2): 2143, *note
3.9.4(17/2): 2221, *note 3.10.2(29.1/3): 2311, *note 3.10.2(33/3): 2319,
*note 4.5.2(9.8/4): 2795, *note 4.6(24.22/4): 2962, *note 4.8(5.6/3):
@@ -84502,95 +84680,96 @@ generic package *note 12.1(8/2): 4685.
generic procedure *note 12.1(8/2): 4687.
generic subprogram *note 12.1(8/2): 4686.
generic unit *note 12(1): 4662, *note N(20): 8913.
- See also dispatching operation *note 3.9(1): 2082.
+ <See also> dispatching operation *note 3.9(1): 2082.
generic_actual_part *note 12.3(3): 4709.
- used *note 12.3(2/3): 4702, *note 12.7(3/2): 4858, *note P: 9728.
+ <used> *note 12.3(2/3): 4702, *note 12.7(3/2): 4858, *note P: 9728.
Generic_Array_Sort
- child of Ada.Containers *note A.18.26(3/2): 7330.
+ <child of> Ada.Containers *note A.18.26(3/2): 7330.
generic_association *note 12.3(4): 4712.
- used *note 12.3(3): 4711, *note 12.7(3.1/2): 4862, *note P: 9797.
+ <used> *note 12.3(3): 4711, *note 12.7(3.1/2): 4862, *note P: 9797.
Generic_Bounded_Length
- in Ada.Strings.Bounded *note A.4.4(4): 5844.
+ <in> Ada.Strings.Bounded *note A.4.4(4): 5844.
Generic_Complex_Arrays
- child of Ada.Numerics *note G.3.2(2/2): 8386.
+ <child of> Ada.Numerics *note G.3.2(2/2): 8386.
Generic_Complex_Elementary_Functions
- child of Ada.Numerics *note G.1.2(2/2): 8285.
+ <child of> Ada.Numerics *note G.1.2(2/2): 8285.
Generic_Complex_Types
- child of Ada.Numerics *note G.1.1(2/1): 8258.
+ <child of> Ada.Numerics *note G.1.1(2/1): 8258.
Generic_Constrained_Array_Sort
- child of Ada.Containers *note A.18.26(7/2): 7332.
+ <child of> Ada.Containers *note A.18.26(7/2): 7332.
generic_declaration *note 12.1(2): 4667.
- used *note 3.1(3/3): 1304, *note 10.1.1(5): 4336, *note P: 9020.
+ <used> *note 3.1(3/3): 1304, *note 10.1.1(5): 4336, *note P: 9020.
Generic_Dispatching_Constructor
- child of Ada.Tags *note 3.9(18.2/3): 2125.
+ <child of> Ada.Tags *note 3.9(18.2/3): 2125.
Generic_Elementary_Functions
- child of Ada.Numerics *note A.5.1(3): 6110.
+ <child of> Ada.Numerics *note A.5.1(3): 6110.
generic_formal_parameter_declaration *note 12.1(6): 4680.
- used *note 12.1(5): 4678, *note P: 9715.
+ <used> *note 12.1(5): 4678, *note P: 9715.
generic_formal_part *note 12.1(5): 4677.
- used *note 12.1(3/3): 4671, *note 12.1(4): 4675, *note P: 9713.
+ <used> *note 12.1(3/3): 4671, *note 12.1(4): 4675, *note P: 9713.
generic_instantiation *note 12.3(2/3): 4694.
- used *note 3.1(3/3): 1305, *note 10.1.1(5): 4337, *note P: 9021.
+ <used> *note 3.1(3/3): 1305, *note 10.1.1(5): 4337, *note P: 9021.
Generic_Keys
- in Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7087.
- in Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7165.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(50/2): 7087.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(62/2): 7165.
generic_package_declaration *note 12.1(4): 4674.
- used *note 12.1(2): 4669, *note P: 9709.
+ <used> *note 12.1(2): 4669, *note P: 9709.
Generic_Real_Arrays
- child of Ada.Numerics *note G.3.1(2/2): 8370.
+ <child of> Ada.Numerics *note G.3.1(2/2): 8370.
generic_renaming_declaration *note 8.5.5(2/3): 3835.
- used *note 8.5(2): 3794, *note 10.1.1(6): 4340, *note P: 9664.
+ <used> *note 8.5(2): 3794, *note 10.1.1(6): 4340, *note P: 9664.
Generic_Sort
- child of Ada.Containers *note A.18.26(9.2/4): 7334.
+ <child of> Ada.Containers *note A.18.26(9.2/4): 7334.
Generic_Sorting
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 6869.
- in Ada.Containers.Vectors *note A.18.2(75/2): 6797.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(47/2): 6869.
+ <in> Ada.Containers.Vectors *note A.18.2(75/2): 6797.
generic_subprogram_declaration *note 12.1(3/3): 4670.
- used *note 12.1(2): 4668, *note P: 9708.
+ <used> *note 12.1(2): 4668, *note P: 9708.
Get
- in Ada.Text_IO *note A.10.1(41): 6443, *note A.10.1(47): 6453,
+ <in> Ada.Text_IO *note A.10.1(41): 6443, *note A.10.1(47): 6453,
*note A.10.1(54): 6466, *note A.10.1(55): 6470, *note A.10.1(59): 6476,
*note A.10.1(60): 6479, *note A.10.1(65): 6485, *note A.10.1(67): 6489,
*note A.10.1(70): 6495, *note A.10.1(72): 6499, *note A.10.1(75): 6505,
*note A.10.1(77): 6509, *note A.10.1(81): 6515, *note A.10.1(83): 6518.
- in Ada.Text_IO.Complex_IO *note G.1.3(6): 8318, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(6): 8318, *note G.1.3(8):
8322.
Get_CPU
- in Ada.Interrupts *note C.3.2(10.1/3): 7669.
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
+ <in> Ada.Interrupts *note C.3.2(10.1/3): 7669.
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(13/3):
8090.
Get_CPU_Set
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9.3/4):
-8086.
+ <in> System.Multiprocessors.Dispatching_Domains *note
+D.16.1(9.3/4): 8086.
Get_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7826.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7826.
Get_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(10/3):
8087.
Get_First_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(8/3):
8082.
Get_Immediate
- in Ada.Text_IO *note A.10.1(44): 6450, *note A.10.1(45): 6451.
+ <in> Ada.Text_IO *note A.10.1(44): 6450, *note A.10.1(45): 6451.
Get_Last_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(9/4):
8083.
Get_Line
- in Ada.Text_IO *note A.10.1(49): 6458, *note A.10.1(49.1/2): 6459.
- in Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 6542, *note
+ <in> Ada.Text_IO *note A.10.1(49): 6458, *note A.10.1(49.1/2):
+6459.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(8/2): 6542, *note
A.10.11(9/2): 6543, *note A.10.11(10/2): 6544, *note A.10.11(11/2):
6545.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 6551, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(8/2): 6551, *note
A.10.12(9/2): 6552, *note A.10.12(10/2): 6553, *note A.10.12(11/2):
6554.
Get_Next_Entry
- in Ada.Directories *note A.16(35/2): 6665.
+ <in> Ada.Directories *note A.16(35/2): 6665.
Get_Priority
- in Ada.Dynamic_Priorities *note D.5.1(5): 7867.
+ <in> Ada.Dynamic_Priorities *note D.5.1(5): 7867.
global to *note 8.1(15): 3720.
Glossary *note N(1/2): 8878.
goto_statement *note 5.8(2): 3271.
- used *note 5.1(4/2): 3125, *note P: 9360.
+ <used> *note 5.1(4/2): 3125, *note P: 9360.
govern a variant *note 3.8.1(20): 2077.
govern a variant_part *note 3.8.1(20): 2076.
grammar
@@ -84602,29 +84781,29 @@ grammar
graphic character
a category of Character *note A.3.2(23): 5489.
graphic_character *note 2.1(14/3): 1150.
- used *note 2.5(2): 1248, *note 2.6(3): 1253, *note P: 8994.
+ <used> *note 2.5(2): 1248, *note 2.6(3): 1253, *note P: 8994.
Graphic_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5956.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5956.
Grave
- in Ada.Characters.Latin_1 *note A.3.3(13): 5561.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5561.
greater than operator *note 4.4(1/3): 2609, *note 4.5.2(1): 2783.
greater than or equal operator *note 4.4(1/3): 2613, *note 4.5.2(1):
2787.
greater-than sign *note 2.1(15/3): 1173.
Greater_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 5553.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5553.
Group_Budget
- in Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8031.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(4/3): 8031.
Group_Budget_Error
- in Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8047.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(11/2): 8047.
Group_Budget_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8032.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(5/2): 8032.
Group_Budgets
- child of Ada.Execution_Time *note D.14.2(3/3): 8030.
+ <child of> Ada.Execution_Time *note D.14.2(3/3): 8030.
GS
- in Ada.Characters.Latin_1 *note A.3.3(6): 5529.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5529.
guard *note 9.7.1(3): 4221.
- used *note 9.7.1(2): 4218, *note P: 9623.
+ <used> *note 9.7.1(2): 4218, *note P: 9623.
@@ -84640,7 +84819,7 @@ handle
an exception occurrence *note 11.4(1): 4554, *note 11.4(7): 4561.
subpool *note 13.11.4(18/3): 5272.
handled_sequence_of_statements *note 11.2(2): 4528.
- used *note 5.6(2): 3263, *note 6.3(2/3): 3407, *note 6.5(2.2/3):
+ <used> *note 5.6(2): 3263, *note 6.3(2/3): 3407, *note 6.5(2.2/3):
3505, *note 7.2(2/3): 3590, *note 9.1(6/3): 3915, *note 9.5.2(3): 4048,
*note 9.5.2(5): 4057, *note P: 9406.
handler
@@ -84650,43 +84829,44 @@ handler
termination *note C.7.3(8/3): 7748.
timing event *note D.15(10/2): 8069.
Handling
- child of Ada.Characters *note A.3.2(2/2): 5460.
- child of Ada.Wide_Characters *note A.3.5(3/3): 5748.
- child of Ada.Wide_Wide_Characters *note A.3.6(1/3): 5769.
+ <child of> Ada.Characters *note A.3.2(2/2): 5460.
+ <child of> Ada.Wide_Characters *note A.3.5(3/3): 5748.
+ <child of> Ada.Wide_Wide_Characters *note A.3.6(1/3): 5769.
Has_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 6827.
- in Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 6913.
- in Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7045.
- in Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7206.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 6966.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7118.
- in Ada.Containers.Vectors *note A.18.2(11.1/3): 6731.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.1/3): 6827.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.1/3): 6913.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.1/3): 7045.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(12/3): 7206.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.1/3): 6966.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.1/3): 7118.
+ <in> Ada.Containers.Vectors *note A.18.2(11.1/3): 6731.
Has_Same_Storage attribute *note 13.3(73.2/4): 5029.
Hash
- child of Ada.Strings *note A.4.9(2/3): 6049.
- child of Ada.Strings.Bounded *note A.4.9(7/3): 6050.
- child of Ada.Strings.Unbounded *note A.4.9(10/3): 6051.
+ <child of> Ada.Strings *note A.4.9(2/3): 6049.
+ <child of> Ada.Strings.Bounded *note A.4.9(7/3): 6050.
+ <child of> Ada.Strings.Unbounded *note A.4.9(10/3): 6051.
Hash_Case_Insensitive
- child of Ada.Strings *note A.4.9(11.2/3): 6052.
- child of Ada.Strings.Bounded *note A.4.9(11.7/3): 6054.
- child of Ada.Strings.Fixed *note A.4.9(11.5/3): 6053.
- child of Ada.Strings.Unbounded *note A.4.9(11.10/3): 6055.
+ <child of> Ada.Strings *note A.4.9(11.2/3): 6052.
+ <child of> Ada.Strings.Bounded *note A.4.9(11.7/3): 6054.
+ <child of> Ada.Strings.Fixed *note A.4.9(11.5/3): 6053.
+ <child of> Ada.Strings.Unbounded *note A.4.9(11.10/3): 6055.
Hash_Type
- in Ada.Containers *note A.18.1(4/2): 6716.
+ <in> Ada.Containers *note A.18.1(4/2): 6716.
Hashed_Maps
- child of Ada.Containers *note A.18.5(2/3): 6908.
+ <child of> Ada.Containers *note A.18.5(2/3): 6908.
Hashed_Sets
- child of Ada.Containers *note A.18.8(2/3): 7040.
+ <child of> Ada.Containers *note A.18.8(2/3): 7040.
Head
- in Ada.Strings.Bounded *note A.4.4(70): 5895, *note A.4.4(71):
+ <in> Ada.Strings.Bounded *note A.4.4(70): 5895, *note A.4.4(71):
5896.
- in Ada.Strings.Fixed *note A.4.3(35): 5838, *note A.4.3(36): 5839.
- in Ada.Strings.Unbounded *note A.4.5(65): 5949, *note A.4.5(66):
+ <in> Ada.Strings.Fixed *note A.4.3(35): 5838, *note A.4.3(36):
+5839.
+ <in> Ada.Strings.Unbounded *note A.4.5(65): 5949, *note A.4.5(66):
5950.
head (of a queue) *note D.2.1(5/2): 7777.
heap management
user-defined *note 13.11(1): 5186.
- See also allocator *note 4.8(1): 3042.
+ <See also> allocator *note 4.8(1): 3042.
held priority *note D.11(4/2): 7993.
heterogeneous input-output *note A.12.1(1): 6565.
hexadecimal
@@ -84695,7 +84875,7 @@ hexadecimal digit
a category of Character *note A.3.2(30): 5495.
hexadecimal literal *note 2.4.2(1): 1230.
Hexadecimal_Digit_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5962.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5962.
hidden from all visibility *note 8.3(5): 3744, *note 8.3(14): 3754.
by lack of a with_clause *note 8.3(20/2): 3758.
for a declaration completed by a subsequent declaration *note
@@ -84707,29 +84887,29 @@ hidden from direct visibility *note 8.3(5): 3745,
*note 8.3(21): 3763.
where hidden from all visibility *note 8.3(23): 3765.
hiding *note 8.3(5): 3743.
Hierarchical_File_Names
- child of Ada.Directories *note A.16.1(3/3): 6686.
+ <child of> Ada.Directories *note A.16.1(3/3): 6686.
High_Order_First *note 13.5.3(2): 5089.
- in Interfaces.COBOL *note B.4(25): 7570.
- in System *note 13.7(15/2): 5124.
+ <in> Interfaces.COBOL *note B.4(25): 7570.
+ <in> System *note 13.7(15/2): 5124.
highest precedence operator *note 4.5.6(1): 2858.
highest_precedence_operator *note 4.5(7): 2729.
Hold
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 7989.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7989.
Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7285.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(6/3): 7285.
homograph *note 8.3(8): 3748.
Hour
- in Ada.Calendar.Formatting *note 9.6.1(24/2): 4194.
-Hour_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4187.
+ <in> Ada.Calendar.Formatting *note 9.6.1(24/2): 4194.
+Hour_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4187.
HT
- in Ada.Characters.Latin_1 *note A.3.3(5): 5509.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5509.
HTJ
- in Ada.Characters.Latin_1 *note A.3.3(17): 5607.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5607.
HTS
- in Ada.Characters.Latin_1 *note A.3.3(17): 5606.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5606.
Hyphen
- in Ada.Characters.Latin_1 *note A.3.3(8): 5545.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5545.
hyphen-minus *note 2.1(15/3): 1162.
@@ -84742,11 +84922,11 @@ I
i
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8261.
- in Interfaces.Fortran *note B.5(10): 7607.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8261.
+ <in> Interfaces.Fortran *note B.5(10): 7607.
identifier *note 2.3(2/2): 1187.
- used *note 2.8(2): 1260, *note 2.8(3/3): 1264, *note 2.8(21): 1283,
-*note 2.8(23): 1288, *note 3.1(4): 1307, *note 4.1(3): 2373, *note
+ <used> *note 2.8(2): 1260, *note 2.8(3/3): 1264, *note 2.8(21):
+1283, *note 2.8(23): 1288, *note 3.1(4): 1307, *note 4.1(3): 2373, *note
4.1.3(3): 2422, *note 4.1.4(3/2): 2438, *note 5.5(2): 3194, *note
5.6(2): 3264, *note 6.1(5): 3296, *note 7.1(3/3): 3579, *note 7.2(2/3):
3592, *note 9.1(4): 3907, *note 9.1(6/3): 3916, *note 9.4(4): 3969,
@@ -84765,40 +84945,40 @@ L(20): 8788, *note L(21): 8791, *note L(23): 8800,
*note L(25.1/2):
M.2(98): 8875, *note P: 9560.
identifier specific to a pragma *note 2.8(10/3): 1276.
identifier_extend *note 2.3(3.1/3): 1198.
- used *note 2.3(2/2): 1190, *note P: 8964.
+ <used> *note 2.3(2/2): 1190, *note P: 8964.
identifier_start *note 2.3(3/2): 1191.
- used *note 2.3(2/2): 1188, *note P: 8962.
+ <used> *note 2.3(2/2): 1188, *note P: 8962.
Identity
- in Ada.Strings.Maps *note A.4.2(22): 5799.
- in Ada.Strings.Wide_Maps *note A.4.7(22): 6001.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6040.
+ <in> Ada.Strings.Maps *note A.4.2(22): 5799.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(22): 6001.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(22/2): 6040.
Identity attribute *note 11.4.1(9): 4584, *note C.7.1(12): 7719.
idle task *note D.11(4/2): 7994.
if_expression *note 4.5.7(3/3): 2881.
- used *note 4.5.7(2/3): 2879, *note P: 9317.
+ <used> *note 4.5.7(2/3): 2879, *note P: 9317.
if_statement *note 5.3(2): 3169.
- used *note 5.1(5/2): 3135, *note P: 9369.
+ <used> *note 5.1(5/2): 3135, *note P: 9369.
illegal
construct *note 1.1.2(27): 1026.
partition *note 1.1.2(29): 1034.
Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8390,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8390,
*note G.3.2(27/2): 8403.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8264.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8264.
image
of a value *note 3.5(27.3/2): 1640, *note 3.5(30/3): 1644, *note
K.2(273/3): 8692, *note K.2(277.4/2): 8693.
- in Ada.Calendar.Formatting *note 9.6.1(35/2): 4205, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(35/2): 4205, *note
9.6.1(37/2): 4207.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6169.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6157.
- in Ada.Task_Identification *note C.7.1(3/3): 7711.
- in Ada.Text_IO.Editing *note F.3.3(13): 8249.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6169.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6157.
+ <in> Ada.Task_Identification *note C.7.1(3/3): 7711.
+ <in> Ada.Text_IO.Editing *note F.3.3(13): 8249.
Image attribute *note 3.5(35): 1646, *note 3.5(55.4/4): 1682.
Imaginary
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 8260.
-Imaginary subtype of Imaginary
- in Interfaces.Fortran *note B.5(10): 7606.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(4/2): 8260.
+Imaginary <subtype of> Imaginary
+ <in> Interfaces.Fortran *note B.5(10): 7606.
immediate scope
of (a view of) an entity *note 8.2(11): 3731.
of a declaration *note 8.2(2): 3721.
@@ -84815,7 +84995,7 @@ implementation defined *note 1.1.3(18): 1054.
implementation permissions *note 1.1.2(36): 1046.
implementation requirements *note 1.1.2(33): 1043.
implementation-dependent
- See unspecified *note 1.1.3(18): 1057.
+ <See> unspecified *note 1.1.3(18): 1057.
implemented
by a protected entry *note 9.4(11.1/3): 3993.
by a protected subprogram *note 9.4(11.1/3): 3992.
@@ -84860,7 +85040,7 @@ implicit subtype conversion *note 4.6(59): 3021,
*note 4.6(60): 3022.
reading a view conversion *note 4.6(56/4): 3016.
result of inherited function *note 3.4(27/2): 1558.
implicit_dereference *note 4.1(6): 2380.
- used *note 4.1(4): 2377, *note P: 9211.
+ <used> *note 4.1(4): 2377, *note P: 9211.
Implicit_Dereference aspect *note 4.1.5(2/3): 2451.
Import aspect *note B.1(1/3): 7385.
Import pragma *note J.15.5(2/3): 8565, *note L(14.1/3): 8759.
@@ -84870,10 +85050,10 @@ inaccessible partition *note E.1(7): 8106.
inactive
a task state *note 9(10): 3884.
Include
- in Ada.Containers.Hashed_Maps *note A.18.5(22/2): 6936.
- in Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7063.
- in Ada.Containers.Ordered_Maps *note A.18.6(21/2): 6987.
- in Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7134.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(22/2): 6936.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(21/2): 7063.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(21/2): 6987.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(20/2): 7134.
included
one range in another *note 3.5(4): 1598.
incomplete type *note 3.2(4.1/2): 1343, *note 3.10.1(2.1/4): 2278,
@@ -84881,26 +85061,26 @@ incomplete type *note 3.2(4.1/2): 1343, *note
3.10.1(2.1/4): 2278,
incomplete view *note 3.10.1(2.1/4): 2279.
tagged *note 3.10.1(2.1/4): 2280.
incomplete_type_declaration *note 3.10.1(2/2): 2275.
- used *note 3.2.1(2): 1370, *note P: 9024.
+ <used> *note 3.2.1(2): 1370, *note P: 9024.
Increment
- in Interfaces.C.Pointers *note B.3.2(11/3): 7523.
+ <in> Interfaces.C.Pointers *note B.3.2(11/3): 7523.
indefinite subtype *note 3.3(23/3): 1468, *note 3.7(26): 1999.
Indefinite_Doubly_Linked_Lists
- child of Ada.Containers *note A.18.12(2/3): 7277.
+ <child of> Ada.Containers *note A.18.12(2/3): 7277.
Indefinite_Hashed_Maps
- child of Ada.Containers *note A.18.13(2/3): 7278.
+ <child of> Ada.Containers *note A.18.13(2/3): 7278.
Indefinite_Hashed_Sets
- child of Ada.Containers *note A.18.15(2/3): 7280.
+ <child of> Ada.Containers *note A.18.15(2/3): 7280.
Indefinite_Holders
- child of Ada.Containers *note A.18.18(5/3): 7284.
+ <child of> Ada.Containers *note A.18.18(5/3): 7284.
Indefinite_Multiway_Trees
- child of Ada.Containers *note A.18.17(2/3): 7282.
+ <child of> Ada.Containers *note A.18.17(2/3): 7282.
Indefinite_Ordered_Maps
- child of Ada.Containers *note A.18.14(2/3): 7279.
+ <child of> Ada.Containers *note A.18.14(2/3): 7279.
Indefinite_Ordered_Sets
- child of Ada.Containers *note A.18.16(2/3): 7281.
+ <child of> Ada.Containers *note A.18.16(2/3): 7281.
Indefinite_Vectors
- child of Ada.Containers *note A.18.11(2/3): 7276.
+ <child of> Ada.Containers *note A.18.11(2/3): 7276.
Independent aspect *note C.6(6.3/3): 7691.
Independent pragma *note J.15.8(4/3): 8604, *note L(14.2/3): 8765.
independent subprogram *note 11.6(6/3): 4658.
@@ -84911,42 +85091,42 @@ independently addressable *note 9.10(1/3): 4306.
specified *note C.6(8.1/4): 7703.
index
of an element of an open direct file *note A.8(3): 6295.
- in Ada.Direct_IO *note A.8.4(15): 6344.
- in Ada.Streams.Stream_IO *note A.12.1(23): 6591.
- in Ada.Strings.Bounded *note A.4.4(43.1/2): 5866, *note
+ <in> Ada.Direct_IO *note A.8.4(15): 6344.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 6591.
+ <in> Ada.Strings.Bounded *note A.4.4(43.1/2): 5866, *note
A.4.4(43.2/2): 5867, *note A.4.4(44): 5868, *note A.4.4(45): 5869, *note
A.4.4(45.1/2): 5870, *note A.4.4(46): 5871.
- in Ada.Strings.Fixed *note A.4.3(8.1/2): 5809, *note A.4.3(8.2/2):
-5810, *note A.4.3(9): 5811, *note A.4.3(10): 5812, *note A.4.3(10.1/2):
-5813, *note A.4.3(11): 5814.
- in Ada.Strings.Unbounded *note A.4.5(38.1/2): 5920, *note
+ <in> Ada.Strings.Fixed *note A.4.3(8.1/2): 5809, *note
+A.4.3(8.2/2): 5810, *note A.4.3(9): 5811, *note A.4.3(10): 5812, *note
+A.4.3(10.1/2): 5813, *note A.4.3(11): 5814.
+ <in> Ada.Strings.Unbounded *note A.4.5(38.1/2): 5920, *note
A.4.5(38.2/2): 5921, *note A.4.5(39): 5922, *note A.4.5(40): 5923, *note
A.4.5(40.1/2): 5924, *note A.4.5(41): 5925.
index range *note 3.6(13): 1913.
index subtype *note 3.6(9): 1907.
index type *note 3.6(9): 1908.
Index_Check *note 11.5(14): 4632.
- [partial] *note 4.1.1(7): 2403, *note 4.1.2(7): 2413, *note
+ [<partial>] *note 4.1.1(7): 2403, *note 4.1.2(7): 2413, *note
4.3.3(29/3): 2577, *note 4.3.3(30): 2579, *note 4.5.3(8): 2823, *note
4.6(51/4): 3002, *note 4.7(4/4): 3036, *note 4.8(10/2): 3063.
index_constraint *note 3.6.1(2): 1932.
- used *note 3.2.2(7): 1418, *note P: 9053.
+ <used> *note 3.2.2(7): 1418, *note P: 9053.
Index_Error
- in Ada.Strings *note A.4.1(5): 5776.
+ <in> Ada.Strings *note A.4.1(5): 5776.
Index_Non_Blank
- in Ada.Strings.Bounded *note A.4.4(46.1/2): 5872, *note A.4.4(47):
-5873.
- in Ada.Strings.Fixed *note A.4.3(11.1/2): 5815, *note A.4.3(12):
+ <in> Ada.Strings.Bounded *note A.4.4(46.1/2): 5872, *note
+A.4.4(47): 5873.
+ <in> Ada.Strings.Fixed *note A.4.3(11.1/2): 5815, *note A.4.3(12):
5816.
- in Ada.Strings.Unbounded *note A.4.5(41.1/2): 5926, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(41.1/2): 5926, *note
A.4.5(42): 5927.
index_subtype_definition *note 3.6(4): 1894.
- used *note 3.6(3): 1892, *note P: 9108.
+ <used> *note 3.6(3): 1892, *note P: 9108.
indexable container object *note 4.1.6(5/3): 2467.
indexable container type *note 4.1.6(5/3): 2466, *note N(20.2/3):
8915.
indexed_component *note 4.1.1(2): 2394.
- used *note 4.1(2/3): 2362, *note P: 9198.
+ <used> *note 4.1(2/3): 2362, *note P: 9198.
indexing
constant *note 4.1.6(12/3): 2473.
variable *note 4.1.6(16/3): 2475.
@@ -84954,16 +85134,16 @@ individual membership test *note 4.5.2(26.1/3):
2801.
indivisible *note C.6(10/4): 7704.
inferable discriminants *note B.3.3(20/2): 7541.
Information
- child of Ada.Directories *note A.16(124/2): 6685.
+ <child of> Ada.Directories *note A.16(124/2): 6685.
information hiding
- See package *note 7(1): 3567.
- See private types and private extensions *note 7.3(1): 3596.
+ <See> package *note 7(1): 3567.
+ <See> private types and private extensions *note 7.3(1): 3596.
information systems *note C(1): 7622, *note F(1): 8218.
informative *note 1.1.2(18): 1011.
inherently mutable object *note 3.3(13/3): 1462.
inheritance
- See derived types and classes *note 3.4(1/2): 1530.
- See also tagged types and type extension *note 3.9(1): 2086.
+ <See> derived types and classes *note 3.4(1/2): 1530.
+ <See also> tagged types and type extension *note 3.9(1): 2086.
inherited
from an ancestor type *note 3.4.1(11): 1580.
inherited component *note 3.4(11): 1546, *note 3.4(12): 1547.
@@ -84972,7 +85152,7 @@ inherited entry *note 3.4(12): 1549.
inherited protected subprogram *note 3.4(12): 1548.
inherited subprogram *note 3.4(17/2): 1550.
Initial_Directory
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(12/3):
6695.
initialization
of a protected object *note 9.4(14): 4004.
@@ -84983,7 +85163,7 @@ initialization
initialization expression *note 3.3.1(1/3): 1475, *note 3.3.1(4):
1498.
Initialize *note 7.6(2): 3658.
- in Ada.Finalization *note 7.6(6/2): 3663, *note 7.6(8/2): 3667.
+ <in> Ada.Finalization *note 7.6(6/2): 3663, *note 7.6(8/2): 3667.
initialized allocator *note 4.8(4): 3052.
initialized by default *note 3.3.1(18/2): 1515.
Inline aspect *note 6.3.2(5.1/3): 3444.
@@ -84997,30 +85177,31 @@ Input'Class aspect *note 13.13.2(38/4): 5391.
input-output
unspecified for access types *note A.7(6): 6285.
Insert
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 6842,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(19/2): 6842,
*note A.18.3(20/2): 6843, *note A.18.3(21/2): 6844.
- in Ada.Containers.Hashed_Maps *note A.18.5(19/2): 6933, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(19/2): 6933, *note
A.18.5(20/2): 6934, *note A.18.5(21/2): 6935.
- in Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7061, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(19/2): 7061, *note
A.18.8(20/2): 7062.
- in Ada.Containers.Ordered_Maps *note A.18.6(18/2): 6984, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(18/2): 6984, *note
A.18.6(19/2): 6985, *note A.18.6(20/2): 6986.
- in Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7132, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(18/2): 7132, *note
A.18.9(19/2): 7133.
- in Ada.Containers.Vectors *note A.18.2(36/2): 6759, *note
+ <in> Ada.Containers.Vectors *note A.18.2(36/2): 6759, *note
A.18.2(37/2): 6760, *note A.18.2(38/2): 6761, *note A.18.2(39/2): 6762,
*note A.18.2(40/2): 6763, *note A.18.2(41/2): 6764, *note A.18.2(42/2):
6765, *note A.18.2(43/2): 6766.
- in Ada.Strings.Bounded *note A.4.4(60): 5885, *note A.4.4(61):
+ <in> Ada.Strings.Bounded *note A.4.4(60): 5885, *note A.4.4(61):
5886.
- in Ada.Strings.Fixed *note A.4.3(25): 5828, *note A.4.3(26): 5829.
- in Ada.Strings.Unbounded *note A.4.5(55): 5939, *note A.4.5(56):
+ <in> Ada.Strings.Fixed *note A.4.3(25): 5828, *note A.4.3(26):
+5829.
+ <in> Ada.Strings.Unbounded *note A.4.5(55): 5939, *note A.4.5(56):
5940.
Insert_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7241, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(48/3): 7241, *note
A.18.10(49/3): 7242, *note A.18.10(50/3): 7243.
Insert_Space
- in Ada.Containers.Vectors *note A.18.2(48/2): 6771, *note
+ <in> Ada.Containers.Vectors *note A.18.2(48/2): 6771, *note
A.18.2(49/2): 6772.
inspectable object *note H.3.2(5/2): 8445.
inspection point *note H.3.2(5/2): 8444.
@@ -85033,25 +85214,25 @@ instance
of a generic unit *note 12.3(1): 4693.
instructions for comment submission *note 0.3(58/1): 1003.
int
- in Interfaces.C *note B.3(7): 7437.
+ <in> Interfaces.C *note B.3(7): 7437.
Integer *note 3.5.4(11): 1740, *note 3.5.4(21): 1760.
- in Standard *note A.1(12): 5438.
+ <in> Standard *note A.1(12): 5438.
integer literal *note 2.4(1): 1206.
integer literals *note 3.5.4(14): 1747, *note 3.5.4(30): 1769.
integer type *note 3.5.4(1): 1717, *note N(21): 8916.
Integer_Address
- in System.Storage_Elements *note 13.7.1(10/3): 5138.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5138.
Integer_IO
- in Ada.Text_IO *note A.10.1(52): 6463.
+ <in> Ada.Text_IO *note A.10.1(52): 6463.
Integer_N *note B.2(8): 7427.
Integer_Text_IO
- child of Ada *note A.10.8(21): 6535.
+ <child of> Ada *note A.10.8(21): 6535.
integer_type_definition *note 3.5.4(2): 1721.
- used *note 3.2.1(4/2): 1382, *note P: 9034.
+ <used> *note 3.2.1(4/2): 1382, *note P: 9034.
Integer_Wide_Text_IO
- child of Ada *note A.11(2/2): 6556.
+ <child of> Ada *note A.11(2/2): 6556.
Integer_Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6559.
+ <child of> Ada *note A.11(3/2): 6559.
interaction
between tasks *note 9(1/3): 3876.
interface *note 3.9.4(4/2): 2200.
@@ -85068,13 +85249,14 @@ interface to Fortran *note B.5(1/3): 7597.
interface to other languages *note B(1): 7379.
interface type *note N(21.1/2): 8917.
Interface_Ancestor_Tags
- in Ada.Tags *note 3.9(7.4/2): 2112.
+ <in> Ada.Tags *note 3.9(7.4/2): 2112.
interface_list *note 3.9.4(3/2): 2197.
- used *note 3.4(2/2): 1535, *note 3.9.4(2/2): 2196, *note 7.3(3/3):
-3608, *note 9.1(2/3): 3897, *note 9.1(3/3): 3902, *note 9.4(2/3): 3959,
-*note 9.4(3/3): 3964, *note 12.5.1(3/2): 4803, *note P: 9074.
+ <used> *note 3.4(2/2): 1535, *note 3.9.4(2/2): 2196, *note
+7.3(3/3): 3608, *note 9.1(2/3): 3897, *note 9.1(3/3): 3902, *note
+9.4(2/3): 3959, *note 9.4(3/3): 3964, *note 12.5.1(3/2): 4803, *note P:
+9074.
interface_type_definition *note 3.9.4(2/2): 2195.
- used *note 3.2.1(4/2): 1388, *note 12.5.5(2/2): 4825, *note P:
+ <used> *note 3.2.1(4/2): 1388, *note 12.5.5(2/2): 4825, *note P:
9779.
Interfaces *note B.2(3): 7420.
Interfaces.C *note B.3(4): 7432.
@@ -85093,7 +85275,7 @@ internal node
of a tree *note A.18.10(2/4): 7192.
internal requeue *note 9.5(7): 4016.
Internal_Tag
- in Ada.Tags *note 3.9(7/2): 2107.
+ <in> Ada.Tags *note 3.9(7/2): 2107.
interpretation
of a complete context *note 8.6(10): 3849.
of a constituent of a complete context *note 8.6(15): 3855.
@@ -85104,27 +85286,27 @@ interrupt *note C.3(2): 7630.
interrupt entry *note J.7.1(5): 8508.
interrupt handler *note C.3(2): 7638.
Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.1/3): 8008.
+ <in> Ada.Execution_Time *note D.14(9.1/3): 8008.
Interrupt_Handler aspect *note C.3.1(6.2/3): 7642.
Interrupt_Handler pragma *note J.15.7(2/3): 8589, *note L(17.1/3):
8779.
Interrupt_Id
- in Ada.Interrupts *note C.3.2(2/3): 7660.
+ <in> Ada.Interrupts *note C.3.2(2/3): 7660.
Interrupt_Priority aspect *note D.1(6.3/3): 7760.
Interrupt_Priority pragma *note J.15.11(4/3): 8637, *note L(18.1/3):
8782.
-Interrupt_Priority subtype of Any_Priority
- in System *note 13.7(16): 5129.
+Interrupt_Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5129.
Interrupts
- child of Ada *note C.3.2(2/3): 7659.
- child of Ada.Execution_Time *note D.14.3(3/3): 8055.
+ <child of> Ada *note C.3.2(2/3): 7659.
+ <child of> Ada.Execution_Time *note D.14.3(3/3): 8055.
Intersection
- in Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7070, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(29/2): 7070, *note
A.18.8(30/2): 7071.
- in Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7143, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(30/2): 7143, *note
A.18.9(31/2): 7144.
intertask communication *note 9.5(1): 4010.
- See also task *note 9(1/3): 3880.
+ <See also> task *note 9(1/3): 3880.
Intrinsic calling convention *note 6.3.1(4): 3421.
invalid cursor
of a list container *note A.18.3(153/2): 6884.
@@ -85138,148 +85320,154 @@ invariant *note N(21.2/4): 8918.
invariant check *note 7.3.2(9/4): 3636.
invariant expression *note 7.3.2(2/3): 3627.
Inverse
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8417.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8377.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8417.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8377.
Inverted_Exclamation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5632.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5632.
Inverted_Question
- in Ada.Characters.Latin_1 *note A.3.3(22): 5664.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5664.
involve an inner product
complex *note G.3.2(56/2): 8423.
real *note G.3.1(34/2): 8383.
IO_Exceptions
- child of Ada *note A.13(3): 6613.
+ <child of> Ada *note A.13(3): 6613.
IS1
- in Ada.Characters.Latin_1 *note A.3.3(16): 5597.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 5597.
IS2
- in Ada.Characters.Latin_1 *note A.3.3(16): 5596.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 5596.
IS3
- in Ada.Characters.Latin_1 *note A.3.3(16): 5595.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 5595.
IS4
- in Ada.Characters.Latin_1 *note A.3.3(16): 5594.
+ <in> Ada.Characters.Latin_1 *note A.3.3(16): 5594.
Is_A_Group_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8038.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8038.
Is_Abstract
- in Ada.Tags *note 3.9(7.5/3): 2113.
+ <in> Ada.Tags *note 3.9(7.5/3): 2113.
Is_Alphanumeric
- in Ada.Characters.Handling *note A.3.2(4/3): 5470.
- in Ada.Wide_Characters.Handling *note A.3.5(12/3): 5757.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5470.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(12/3): 5757.
Is_Attached
- in Ada.Interrupts *note C.3.2(5): 7663.
+ <in> Ada.Interrupts *note C.3.2(5): 7663.
Is_Basic
- in Ada.Characters.Handling *note A.3.2(4/3): 5466.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5466.
Is_Callable
- in Ada.Task_Identification *note C.7.1(4/3): 7716.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7716.
Is_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 5730.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5730.
Is_Control
- in Ada.Characters.Handling *note A.3.2(4/3): 5461.
- in Ada.Wide_Characters.Handling *note A.3.5(5/3): 5750.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5461.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(5/3): 5750.
Is_Current_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3): 6690.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(7/3):
+6690.
Is_Decimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5468.
- in Ada.Wide_Characters.Handling *note A.3.5(10/3): 5755.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5468.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(10/3): 5755.
Is_Descendant_At_Same_Level
- in Ada.Tags *note 3.9(7.1/2): 2109.
+ <in> Ada.Tags *note 3.9(7.1/2): 2109.
Is_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5467.
- in Ada.Wide_Characters.Handling *note A.3.5(9/3): 5754.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5467.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(9/3): 5754.
Is_Empty
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 6830.
- in Ada.Containers.Hashed_Maps *note A.18.5(11/2): 6918.
- in Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7052.
- in Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7288.
- in Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7209.
- in Ada.Containers.Ordered_Maps *note A.18.6(10/2): 6969.
- in Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7123.
- in Ada.Containers.Vectors *note A.18.2(23/2): 6739.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(12/2): 6830.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(11/2): 6918.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(13/2): 7052.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(10/3): 7288.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(16/3): 7209.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(10/2): 6969.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(12/2): 7123.
+ <in> Ada.Containers.Vectors *note A.18.2(23/2): 6739.
Is_Full_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3): 6691.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(8/3):
+6691.
Is_Graphic
- in Ada.Characters.Handling *note A.3.2(4/3): 5462.
- in Ada.Wide_Characters.Handling *note A.3.5(19/3): 5764.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5462.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(19/3): 5764.
Is_Held
- in Ada.Asynchronous_Task_Control *note D.11(3/2): 7991.
+ <in> Ada.Asynchronous_Task_Control *note D.11(3/2): 7991.
Is_Hexadecimal_Digit
- in Ada.Characters.Handling *note A.3.2(4/3): 5469.
- in Ada.Wide_Characters.Handling *note A.3.5(11/3): 5756.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5469.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(11/3): 5756.
Is_In
- in Ada.Strings.Maps *note A.4.2(13): 5791.
- in Ada.Strings.Wide_Maps *note A.4.7(13): 5993.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6032.
+ <in> Ada.Strings.Maps *note A.4.2(13): 5791.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(13): 5993.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(13/2): 6032.
Is_ISO_646
- in Ada.Characters.Handling *note A.3.2(10): 5484.
+ <in> Ada.Characters.Handling *note A.3.2(10): 5484.
Is_Leaf
- in Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7214.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(21/3): 7214.
Is_Letter
- in Ada.Characters.Handling *note A.3.2(4/3): 5463.
- in Ada.Wide_Characters.Handling *note A.3.5(6/3): 5751.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5463.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(6/3): 5751.
Is_Line_Terminator
- in Ada.Characters.Handling *note A.3.2(4/3): 5472.
- in Ada.Wide_Characters.Handling *note A.3.5(14/3): 5759.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5472.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(14/3): 5759.
Is_Lower
- in Ada.Characters.Handling *note A.3.2(4/3): 5464.
- in Ada.Wide_Characters.Handling *note A.3.5(7/3): 5752.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5464.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(7/3): 5752.
Is_Mark
- in Ada.Characters.Handling *note A.3.2(4/3): 5473.
- in Ada.Wide_Characters.Handling *note A.3.5(15/3): 5760.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5473.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(15/3): 5760.
Is_Member
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8037.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8037.
Is_Nul_Terminated
- in Interfaces.C *note B.3(24): 7456, *note B.3(35): 7466, *note
+ <in> Interfaces.C *note B.3(24): 7456, *note B.3(35): 7466, *note
B.3(39.16/2): 7486, *note B.3(39.7/2): 7476.
Is_Open
- in Ada.Direct_IO *note A.8.4(10): 6337.
- in Ada.Sequential_IO *note A.8.1(10): 6310.
- in Ada.Streams.Stream_IO *note A.12.1(12): 6583.
- in Ada.Text_IO *note A.10.1(13): 6392.
+ <in> Ada.Direct_IO *note A.8.4(10): 6337.
+ <in> Ada.Sequential_IO *note A.8.1(10): 6310.
+ <in> Ada.Streams.Stream_IO *note A.12.1(12): 6583.
+ <in> Ada.Text_IO *note A.10.1(13): 6392.
Is_Other_Format
- in Ada.Characters.Handling *note A.3.2(4/3): 5474.
- in Ada.Wide_Characters.Handling *note A.3.5(16/3): 5761.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5474.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(16/3): 5761.
Is_Parent_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3): 6689.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(6/3):
+6689.
Is_Punctuation_Connector
- in Ada.Characters.Handling *note A.3.2(4/3): 5475.
- in Ada.Wide_Characters.Handling *note A.3.5(17/3): 5762.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5475.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(17/3): 5762.
Is_Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3): 6692.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(9/3):
+6692.
Is_Reserved
- in Ada.Interrupts *note C.3.2(4): 7662.
+ <in> Ada.Interrupts *note C.3.2(4): 7662.
Is_Root
- in Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7213.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(20/3): 7213.
Is_Root_Directory_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3): 6688.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(5/3):
+6688.
Is_Round_Robin
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7818.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7818.
Is_Simple_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3): 6687.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(4/3):
+6687.
Is_Sorted
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 6870.
- in Ada.Containers.Vectors *note A.18.2(76/2): 6798.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(48/2): 6870.
+ <in> Ada.Containers.Vectors *note A.18.2(76/2): 6798.
Is_Space
- in Ada.Characters.Handling *note A.3.2(4/3): 5476.
- in Ada.Wide_Characters.Handling *note A.3.5(18/3): 5763.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5476.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(18/3): 5763.
Is_Special
- in Ada.Characters.Handling *note A.3.2(4/3): 5471.
- in Ada.Wide_Characters.Handling *note A.3.5(13/3): 5758.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5471.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(13/3): 5758.
Is_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 5733.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5733.
Is_Subset
- in Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7077.
- in Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7150.
- in Ada.Strings.Maps *note A.4.2(14): 5792.
- in Ada.Strings.Wide_Maps *note A.4.7(14): 5994.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6033.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(39/2): 7077.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(40/2): 7150.
+ <in> Ada.Strings.Maps *note A.4.2(14): 5792.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(14): 5994.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(14/2): 6033.
Is_Terminated
- in Ada.Task_Identification *note C.7.1(4/3): 7715.
+ <in> Ada.Task_Identification *note C.7.1(4/3): 7715.
Is_Upper
- in Ada.Characters.Handling *note A.3.2(4/3): 5465.
- in Ada.Wide_Characters.Handling *note A.3.5(8/3): 5753.
+ <in> Ada.Characters.Handling *note A.3.2(4/3): 5465.
+ <in> Ada.Wide_Characters.Handling *note A.3.5(8/3): 5753.
Is_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(3/2): 5734.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5734.
Is_Wide_String
- in Ada.Characters.Conversions *note A.3.4(3/2): 5735.
+ <in> Ada.Characters.Conversions *note A.3.4(3/2): 5735.
ISO 1989:2002 *note 1.2(4/2): 1097.
ISO 639-3:2007 *note 1.2(1.1/3): 1088.
ISO 8601:2004 *note 1.2(5.1/2): 1106.
@@ -85293,10 +85481,10 @@ ISO/IEC 646:1991 *note 1.2(2): 1091.
ISO/IEC 8859-1:1998 *note 1.2(6/3): 1108.
ISO/IEC 9899:2011 *note 1.2(7/3): 1111.
ISO/IEC TR 19769:2004 *note 1.2(10/2): 1120.
-ISO_646 subtype of Character
- in Ada.Characters.Handling *note A.3.2(9): 5483.
+ISO_646 <subtype of> Character
+ <in> Ada.Characters.Handling *note A.3.2(9): 5483.
ISO_646_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5965.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5965.
issue
an entry call *note 9.5.3(8): 4105.
italics
@@ -85310,24 +85498,24 @@ iterable container object for a loop *note
5.5.2(12/3): 3257.
iterable container type *note 5.5.1(11/3): 3229, *note N(21.3/3):
8919.
Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 6867.
- in Ada.Containers.Hashed_Maps *note A.18.5(37/2): 6950.
- in Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7086.
- in Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7235, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(45/2): 6867.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(37/2): 6950.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(49/2): 7086.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(42/3): 7235, *note
A.18.10(44/3): 7237.
- in Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7009.
- in Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7163.
- in Ada.Containers.Vectors *note A.18.2(73/2): 6795.
- in Ada.Environment_Variables *note A.17(8/3): 6706.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(50/2): 7009.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(60/2): 7163.
+ <in> Ada.Containers.Vectors *note A.18.2(73/2): 6795.
+ <in> Ada.Environment_Variables *note A.17(8/3): 6706.
Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7261, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(68/3): 7261, *note
A.18.10(70/3): 7263.
Iterate_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7236, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(43/3): 7236, *note
A.18.10(45/3): 7238.
iteration cursor subtype *note 5.5.1(6/3): 3220.
iteration_scheme *note 5.5(3/3): 3195.
- used *note 5.5(2): 3192, *note P: 9391.
+ <used> *note 5.5(2): 3192, *note P: 9391.
iterator *note N(21.4/3): 8920.
array component *note 5.5.2(3/3): 3246.
container element *note 5.5.2(3/3): 3248.
@@ -85338,9 +85526,9 @@ iterator object *note 5.5.1(6/3): 3218.
iterator type *note 5.5.1(6/3): 3216.
Iterator_Element aspect *note 5.5.1(9/3): 3228.
Iterator_Interfaces
- child of Ada *note 5.5.1(2/3): 3209.
+ <child of> Ada *note 5.5.1(2/3): 3209.
iterator_specification *note 5.5.2(2/3): 3235.
- used *note 4.5.8(1/3): 2911, *note 5.5(3/3): 3198, *note P: 9334.
+ <used> *note 4.5.8(1/3): 2911, *note 5.5(3/3): 3198, *note P: 9334.
@@ -85352,8 +85540,8 @@ J
j
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8262.
- in Interfaces.Fortran *note B.5(10): 7608.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(5): 8262.
+ <in> Interfaces.Fortran *note B.5(10): 7608.
@@ -85365,19 +85553,20 @@ K
Key
- in Ada.Containers.Hashed_Maps *note A.18.5(13/2): 6920.
- in Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7088.
- in Ada.Containers.Ordered_Maps *note A.18.6(12/2): 6971.
- in Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7167.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(13/2): 6920.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(51/2): 7088.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(12/2): 6971.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(64/2): 7167.
Kind
- in Ada.Directories *note A.16(25/2): 6656, *note A.16(40/2): 6668.
+ <in> Ada.Directories *note A.16(25/2): 6656, *note A.16(40/2):
+6668.
known discriminants *note 3.7(26): 1992.
known to be constrained *note 3.3(23.1/3): 1470.
known to denote the same object *note 6.4.1(6.5/3): 3479.
known to refer to the same object *note 6.4.1(6.12/3): 3480.
known_discriminant_part *note 3.7(4): 1971.
- used *note 3.2.1(3/3): 1375, *note 3.7(2/2): 1969, *note 9.1(2/3):
-3895, *note 9.4(2/3): 3957, *note P: 9543.
+ <used> *note 3.2.1(3/3): 1375, *note 3.7(2/2): 1969, *note
+9.1(2/3): 3895, *note 9.4(2/3): 3957, *note P: 9543.
@@ -85389,20 +85578,20 @@ L
label *note 5.1(7): 3143.
- used *note 5.1(2/3): 3115, *note 5.1(3): 3119, *note P: 9353.
+ <used> *note 5.1(2/3): 3115, *note 5.1(3): 3119, *note P: 9353.
Landau symbol O(X) *note A.18(3/2): 6711.
language
interface to assembly *note C.1(4/3): 7625.
interface to non-Ada *note B(1): 7380.
- in Ada.Locales *note A.19(6/3): 7375.
+ <in> Ada.Locales *note A.19(6/3): 7375.
Language code standard *note 1.2(1.1/3): 1090.
language-defined categories
- [partial] *note 3.2(10/2): 1367.
+ [<partial>] *note 3.2(10/2): 1367.
language-defined category
of types *note 3.2(2/2): 1334.
language-defined check *note 11.5(2/3): 4611, *note 11.6(1/3): 4648.
language-defined class
- [partial] *note 3.2(10/2): 1366.
+ [<partial>] *note 3.2(10/2): 1366.
of types *note 3.2(2/2): 1333.
Language-defined constants *note Q.5(1/3): 9857.
Language-defined exceptions *note Q.4(1/3): 9855.
@@ -85414,15 +85603,15 @@ Language-defined subtypes *note Q.2(1/3): 9853.
Language-defined types *note Q.2(1/3): 9852.
Language-defined values *note Q.5(1/3): 9858.
Language_Code
- in Ada.Locales *note A.19(4/4): 7371.
+ <in> Ada.Locales *note A.19(4/4): 7371.
Language_Unknown
- in Ada.Locales *note A.19(5/3): 7373.
+ <in> Ada.Locales *note A.19(5/3): 7373.
Last
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 6858.
- in Ada.Containers.Ordered_Maps *note A.18.6(31/2): 6997.
- in Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7153.
- in Ada.Containers.Vectors *note A.18.2(61/2): 6784.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3214.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(35/2): 6858.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(31/2): 6997.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(43/2): 7153.
+ <in> Ada.Containers.Vectors *note A.18.2(61/2): 6784.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3214.
Last attribute *note 3.5(13): 1614, *note 3.6.2(5): 1951.
last element
of a hashed set *note A.18.8(68/2): 7107.
@@ -85434,166 +85623,166 @@ last node
of an ordered map *note A.18.6(58/3): 7015.
Last(N) attribute *note 3.6.2(6): 1953.
last_bit *note 13.5.1(6): 5072.
- used *note 13.5.1(3): 5067, *note P: 9830.
+ <used> *note 13.5.1(3): 5067, *note P: 9830.
Last_Bit attribute *note 13.5.2(4/2): 5085.
Last_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7255.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(62/3): 7255.
Last_Child_Element
- in Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7256.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(63/3): 7256.
Last_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 6859.
- in Ada.Containers.Ordered_Maps *note A.18.6(32/2): 6998.
- in Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7154.
- in Ada.Containers.Vectors *note A.18.2(62/2): 6785.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(36/2): 6859.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(32/2): 6998.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(44/2): 7154.
+ <in> Ada.Containers.Vectors *note A.18.2(62/2): 6785.
Last_Index
- in Ada.Containers.Vectors *note A.18.2(60/2): 6783.
+ <in> Ada.Containers.Vectors *note A.18.2(60/2): 6783.
Last_Key
- in Ada.Containers.Ordered_Maps *note A.18.6(33/2): 6999.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(33/2): 6999.
Last_Valid attribute *note 3.5.5(7.3/4): 1781.
lateness *note D.9(12): 7971.
Latin-1 *note 3.5.2(2/3): 1702.
Latin_1
- child of Ada.Characters *note A.3.3(3): 5498.
+ <child of> Ada.Characters *note A.3.3(3): 5498.
Layout aspect *note 13.5(1): 5050.
Layout_Error
- in Ada.IO_Exceptions *note A.13(4): 6621.
- in Ada.Text_IO *note A.10.1(85): 6527.
+ <in> Ada.IO_Exceptions *note A.13(4): 6621.
+ <in> Ada.Text_IO *note A.10.1(85): 6527.
LC_A
- in Ada.Characters.Latin_1 *note A.3.3(13): 5562.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5562.
LC_A_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 5698.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5698.
LC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5699.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5699.
LC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5701.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5701.
LC_A_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 5697.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5697.
LC_A_Ring
- in Ada.Characters.Latin_1 *note A.3.3(25): 5702.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5702.
LC_A_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(25): 5700.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5700.
LC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(25): 5703.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5703.
LC_B
- in Ada.Characters.Latin_1 *note A.3.3(13): 5563.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5563.
LC_C
- in Ada.Characters.Latin_1 *note A.3.3(13): 5564.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5564.
LC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(25): 5704.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5704.
LC_D
- in Ada.Characters.Latin_1 *note A.3.3(13): 5565.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5565.
LC_E
- in Ada.Characters.Latin_1 *note A.3.3(13): 5566.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5566.
LC_E_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 5706.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5706.
LC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5707.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5707.
LC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5708.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5708.
LC_E_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 5705.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5705.
LC_F
- in Ada.Characters.Latin_1 *note A.3.3(13): 5567.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5567.
LC_G
- in Ada.Characters.Latin_1 *note A.3.3(13): 5568.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5568.
LC_German_Sharp_S
- in Ada.Characters.Latin_1 *note A.3.3(24): 5696.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5696.
LC_H
- in Ada.Characters.Latin_1 *note A.3.3(13): 5569.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5569.
LC_I
- in Ada.Characters.Latin_1 *note A.3.3(13): 5570.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5570.
LC_I_Acute
- in Ada.Characters.Latin_1 *note A.3.3(25): 5710.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5710.
LC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(25): 5711.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5711.
LC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(25): 5712.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5712.
LC_I_Grave
- in Ada.Characters.Latin_1 *note A.3.3(25): 5709.
+ <in> Ada.Characters.Latin_1 *note A.3.3(25): 5709.
LC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(26): 5713.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5713.
LC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(26): 5727.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5727.
LC_J
- in Ada.Characters.Latin_1 *note A.3.3(13): 5571.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5571.
LC_K
- in Ada.Characters.Latin_1 *note A.3.3(13): 5572.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5572.
LC_L
- in Ada.Characters.Latin_1 *note A.3.3(13): 5573.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5573.
LC_M
- in Ada.Characters.Latin_1 *note A.3.3(13): 5574.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5574.
LC_N
- in Ada.Characters.Latin_1 *note A.3.3(13): 5575.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5575.
LC_N_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(26): 5714.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5714.
LC_O
- in Ada.Characters.Latin_1 *note A.3.3(13): 5576.
+ <in> Ada.Characters.Latin_1 *note A.3.3(13): 5576.
LC_O_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 5716.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5716.
LC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 5717.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5717.
LC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5719.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5719.
LC_O_Grave
- in Ada.Characters.Latin_1 *note A.3.3(26): 5715.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5715.
LC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(26): 5721.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5721.
LC_O_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(26): 5718.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5718.
LC_P
- in Ada.Characters.Latin_1 *note A.3.3(14): 5577.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5577.
LC_Q
- in Ada.Characters.Latin_1 *note A.3.3(14): 5578.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5578.
LC_R
- in Ada.Characters.Latin_1 *note A.3.3(14): 5579.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5579.
LC_S
- in Ada.Characters.Latin_1 *note A.3.3(14): 5580.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5580.
LC_T
- in Ada.Characters.Latin_1 *note A.3.3(14): 5581.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5581.
LC_U
- in Ada.Characters.Latin_1 *note A.3.3(14): 5582.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5582.
LC_U_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 5723.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5723.
LC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(26): 5724.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5724.
LC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5725.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5725.
LC_U_Grave
- in Ada.Characters.Latin_1 *note A.3.3(26): 5722.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5722.
LC_V
- in Ada.Characters.Latin_1 *note A.3.3(14): 5583.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5583.
LC_W
- in Ada.Characters.Latin_1 *note A.3.3(14): 5584.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5584.
LC_X
- in Ada.Characters.Latin_1 *note A.3.3(14): 5585.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5585.
LC_Y
- in Ada.Characters.Latin_1 *note A.3.3(14): 5586.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5586.
LC_Y_Acute
- in Ada.Characters.Latin_1 *note A.3.3(26): 5726.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5726.
LC_Y_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(26): 5728.
+ <in> Ada.Characters.Latin_1 *note A.3.3(26): 5728.
LC_Z
- in Ada.Characters.Latin_1 *note A.3.3(14): 5587.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5587.
Leading_Nonseparate
- in Interfaces.COBOL *note B.4(23): 7567.
+ <in> Interfaces.COBOL *note B.4(23): 7567.
Leading_Part attribute *note A.5.3(54): 6247.
Leading_Separate
- in Interfaces.COBOL *note B.4(23): 7565.
+ <in> Interfaces.COBOL *note B.4(23): 7565.
leaf node
of a tree *note A.18.10(4/3): 7197.
-Leap_Seconds_Count subtype of Integer
- in Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4175.
+Leap_Seconds_Count <subtype of> Integer
+ <in> Ada.Calendar.Arithmetic *note 9.6.1(11/2): 4175.
leaving *note 7.6.1(3/2): 3693.
left *note 7.6.1(3/2): 3694.
left parenthesis *note 2.1(15/3): 1156.
Left_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5642.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5642.
Left_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 5588.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5588.
Left_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 5540.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5540.
Left_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 5556.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5556.
legal
construct *note 1.1.2(27): 1025.
partition *note 1.1.2(29): 1033.
@@ -85605,67 +85794,67 @@ length
of a one-dimensional array *note 3.6(13): 1916.
of a set *note A.18.7(5/2): 7022.
of a vector container *note A.18.2(2/2): 6721.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 6829.
- in Ada.Containers.Hashed_Maps *note A.18.5(10/2): 6917.
- in Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7051.
- in Ada.Containers.Ordered_Maps *note A.18.6(9/2): 6968.
- in Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7122.
- in Ada.Containers.Vectors *note A.18.2(21/2): 6737.
- in Ada.Strings.Bounded *note A.4.4(9): 5849.
- in Ada.Strings.Unbounded *note A.4.5(6): 5905.
- in Ada.Text_IO.Editing *note F.3.3(11): 8247.
- in Interfaces.COBOL *note B.4(34): 7581, *note B.4(39): 7585, *note
-B.4(44): 7589.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(11/2): 6829.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(10/2): 6917.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(12/2): 7051.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(9/2): 6968.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(11/2): 7122.
+ <in> Ada.Containers.Vectors *note A.18.2(21/2): 6737.
+ <in> Ada.Strings.Bounded *note A.4.4(9): 5849.
+ <in> Ada.Strings.Unbounded *note A.4.5(6): 5905.
+ <in> Ada.Text_IO.Editing *note F.3.3(11): 8247.
+ <in> Interfaces.COBOL *note B.4(34): 7581, *note B.4(39): 7585,
+*note B.4(44): 7589.
Length attribute *note 3.6.2(9): 1959.
Length(N) attribute *note 3.6.2(10): 1961.
Length_Check *note 11.5(15): 4633.
- [partial] *note 4.5.1(8): 2753, *note 4.6(37): 2977, *note 4.6(52):
-3009.
+ [<partial>] *note 4.5.1(8): 2753, *note 4.6(37): 2977, *note
+4.6(52): 3009.
Length_Error
- in Ada.Strings *note A.4.1(5): 5774.
-Length_Range subtype of Natural
- in Ada.Strings.Bounded *note A.4.4(8): 5848.
+ <in> Ada.Strings *note A.4.1(5): 5774.
+Length_Range <subtype of> Natural
+ <in> Ada.Strings.Bounded *note A.4.4(8): 5848.
less than operator *note 4.4(1/3): 2601, *note 4.5.2(1): 2775.
less than or equal operator *note 4.4(1/3): 2605, *note 4.5.2(1):
2779.
less-than sign *note 2.1(15/3): 1171.
Less_Case_Insensitive
- child of Ada.Strings *note A.4.10(13/3): 6060.
- child of Ada.Strings.Bounded *note A.4.10(18/3): 6062.
- child of Ada.Strings.Fixed *note A.4.10(16/3): 6061.
- child of Ada.Strings.Unbounded *note A.4.10(21/3): 6063.
+ <child of> Ada.Strings *note A.4.10(13/3): 6060.
+ <child of> Ada.Strings.Bounded *note A.4.10(18/3): 6062.
+ <child of> Ada.Strings.Fixed *note A.4.10(16/3): 6061.
+ <child of> Ada.Strings.Unbounded *note A.4.10(21/3): 6063.
Less_Than_Sign
- in Ada.Characters.Latin_1 *note A.3.3(10): 5551.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5551.
letter
a category of Character *note A.3.2(24): 5490.
letter_lowercase *note 2.1(9/2): 1132.
- used *note 2.3(3/2): 1193, *note P: 8966.
+ <used> *note 2.3(3/2): 1193, *note P: 8966.
letter_modifier *note 2.1(9.2/2): 1134.
- used *note 2.3(3/2): 1195, *note P: 8968.
+ <used> *note 2.3(3/2): 1195, *note P: 8968.
letter_other *note 2.1(9.3/2): 1135.
- used *note 2.3(3/2): 1196, *note P: 8969.
+ <used> *note 2.3(3/2): 1196, *note P: 8969.
Letter_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5957.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5957.
letter_titlecase *note 2.1(9.1/2): 1133.
- used *note 2.3(3/2): 1194, *note P: 8967.
+ <used> *note 2.3(3/2): 1194, *note P: 8967.
letter_uppercase *note 2.1(8/2): 1131.
- used *note 2.3(3/2): 1192, *note P: 8965.
+ <used> *note 2.3(3/2): 1192, *note P: 8965.
level
accessibility *note 3.10.2(3/2): 2290.
library *note 3.10.2(23): 2305.
lexical element *note 2.2(1): 1180.
lexicographic order *note 4.5.2(26/3): 2800.
LF
- in Ada.Characters.Latin_1 *note A.3.3(5): 5510.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5510.
library *note 10.1.4(9): 4417.
- [partial] *note 10.1.1(9): 4348.
+ [<partial>] *note 10.1.1(9): 4348.
informal introduction *note 10(2): 4313.
- See also library level, library unit, library_item
+ <See also> library level, library unit, library_item
library level *note 3.10.2(23): 2304.
Library unit *note 10.1(3): 4319, *note 10.1.1(9): 4347, *note N(22):
8921.
informal introduction *note 10(2): 4311.
- See also language-defined library units
+ <See also> language-defined library units
library unit pragma *note 10.1.5(7/3): 4422.
All_Calls_Remote *note E.2.3(6): 8155.
categorization pragmas *note E.2(2/3): 8114.
@@ -85674,13 +85863,13 @@ library unit pragma *note 10.1.5(7/3): 4422.
Pure *note 10.2.1(15): 4482.
library_item *note 10.1.1(4): 4329.
informal introduction *note 10(2): 4312.
- used *note 10.1.1(3): 4326, *note P: 9653.
+ <used> *note 10.1.1(3): 4326, *note P: 9653.
library_unit_body *note 10.1.1(7): 4342.
- used *note 10.1.1(4): 4331, *note P: 9657.
+ <used> *note 10.1.1(4): 4331, *note P: 9657.
library_unit_declaration *note 10.1.1(5): 4333.
- used *note 10.1.1(4): 4330, *note P: 9656.
+ <used> *note 10.1.1(4): 4330, *note P: 9656.
library_unit_renaming_declaration *note 10.1.1(6): 4338.
- used *note 10.1.1(4): 4332, *note P: 9658.
+ <used> *note 10.1.1(4): 4332, *note P: 9658.
lifetime *note 3.10.2(3/2): 2294.
limited interface *note 3.9.4(5/2): 2210.
limited type *note 7.5(3/3): 3645, *note N(23/2): 8923.
@@ -85688,38 +85877,38 @@ limited type *note 7.5(3/3): 3645, *note N(23/2):
8923.
immutably *note 7.5(8.1/3): 3648.
limited view *note 10.1.1(12.1/2): 4365.
Limited_Controlled
- in Ada.Finalization *note 7.6(7/2): 3666.
+ <in> Ada.Finalization *note 7.6(7/2): 3666.
limited_with_clause *note 10.1.2(4.1/2): 4376.
- used *note 10.1.2(4/2): 4374, *note P: 9672.
+ <used> *note 10.1.2(4/2): 4374, *note P: 9672.
line *note 2.2(2/3): 1182.
- in Ada.Text_IO *note A.10.1(38): 6440.
+ <in> Ada.Text_IO *note A.10.1(38): 6440.
line terminator *note A.10(7): 6364.
Line_Length
- in Ada.Text_IO *note A.10.1(25): 6415.
+ <in> Ada.Text_IO *note A.10.1(25): 6415.
link name *note B.1(35): 7412.
link-time error
- See post-compilation error *note 1.1.2(29): 1031.
- See post-compilation error *note 1.1.5(4): 1074.
+ <See> post-compilation error *note 1.1.2(29): 1031.
+ <See> post-compilation error *note 1.1.5(4): 1074.
Link_Name aspect *note B.1(1/3): 7389.
Linker_Options pragma *note B.1(8): 7400, *note L(19): 8784.
linking
- See partition building *note 10.2(2): 4447.
+ <See> partition building *note 10.2(2): 4447.
List
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 6823.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(6/3): 6823.
list container *note A.18.3(1/2): 6818.
List pragma *note 2.8(21): 1282, *note L(20): 8787.
List_Iterator_Interfaces
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 6828.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9.2/3): 6828.
literal *note 4.2(1): 2476.
based *note 2.4.2(1): 1223.
decimal *note 2.4.1(1): 1210.
numeric *note 2.4(1): 1204.
- See also aggregate *note 4.3(1): 2493.
+ <See also> aggregate *note 4.3(1): 2493.
little endian *note 13.5.3(2): 5093.
load time *note C.4(3): 7676.
local to *note 8.1(14): 3719.
local_name *note 13.1(3): 4877.
- used *note 13.3(2): 4949, *note 13.4(2): 5039, *note 13.5.1(2):
+ <used> *note 13.3(2): 4949, *note 13.4(2): 5039, *note 13.5.1(2):
5060, *note 13.5.1(3): 5064, *note C.5(3): 7683, *note J.15.2(2/3):
8540, *note J.15.3(2/3): 8546, *note J.15.5(2/3): 8567, *note
J.15.5(3/3): 8573, *note J.15.5(4/3): 8579, *note J.15.6(2/3): 8587,
@@ -85734,56 +85923,57 @@ L(4.1/3): 8716, *note L(5.1/3): 8719, *note L(8.1/3):
8727, *note L(9):
locale *note A.19(1/3): 7369.
active *note A.19(8/3): 7378.
Locales
- child of Ada *note A.19(3/3): 7370.
+ <child of> Ada *note A.19(3/3): 7370.
locking policy *note D.3(6/2): 7838.
Ceiling_Locking *note D.3(7): 7842.
Locking_Policy pragma *note D.3(3): 7832, *note L(21): 8790.
Log
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8287.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6113.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6113.
Logical
- in Interfaces.Fortran *note B.5(7): 7603.
+ <in> Interfaces.Fortran *note B.5(7): 7603.
logical operator *note 4.5.1(2): 2743.
- See also not operator *note 4.5.6(3): 2865.
+ <See also> not operator *note 4.5.6(3): 2865.
logical_operator *note 4.5(2): 2724.
long
- in Interfaces.C *note B.3(7): 7439.
+ <in> Interfaces.C *note B.3(7): 7439.
Long_Binary
- in Interfaces.COBOL *note B.4(10): 7549.
+ <in> Interfaces.COBOL *note B.4(10): 7549.
long_double
- in Interfaces.C *note B.3(17): 7450.
+ <in> Interfaces.C *note B.3(17): 7450.
Long_Float *note 3.5.7(15): 1818, *note 3.5.7(16): 1820, *note
3.5.7(17): 1821.
Long_Floating
- in Interfaces.COBOL *note B.4(9): 7547.
+ <in> Interfaces.COBOL *note B.4(9): 7547.
Long_Integer *note 3.5.4(22): 1761, *note 3.5.4(25): 1762, *note
3.5.4(28): 1766.
Look_Ahead
- in Ada.Text_IO *note A.10.1(43): 6448.
+ <in> Ada.Text_IO *note A.10.1(43): 6448.
loop cursor *note 5.5.2(12/3): 3259.
loop iterator *note 5.5.2(10/3): 3254.
container element iterator *note 5.5.2(12/3): 3258.
loop parameter *note 5.5(6): 3202, *note 5.5.2(7/3): 3253.
loop_parameter_specification *note 5.5(4): 3199.
- used *note 4.5.8(1/3): 2908, *note 5.5(3/3): 3197, *note P: 9395.
+ <used> *note 4.5.8(1/3): 2908, *note 5.5(3/3): 3197, *note P: 9395.
loop_statement *note 5.5(2): 3190.
- used *note 5.1(5/2): 3137, *note P: 9371.
+ <used> *note 5.1(5/2): 3137, *note P: 9371.
low line *note 2.1(15/3): 1174.
low-level programming *note C(1): 7618.
Low_Line
- in Ada.Characters.Latin_1 *note A.3.3(12): 5560.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5560.
Low_Order_First *note 13.5.3(2): 5092.
- in Interfaces.COBOL *note B.4(25): 7571.
- in System *note 13.7(15/2): 5125.
+ <in> Interfaces.COBOL *note B.4(25): 7571.
+ <in> System *note 13.7(15/2): 5125.
lower bound
of a range *note 3.5(4): 1592.
lower-case letter
a category of Character *note A.3.2(25): 5491.
Lower_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5966.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5966.
Lower_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5958.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5958.
@@ -85801,7 +85991,7 @@ machine numbers
of a floating point type *note 3.5.7(8): 1806.
machine scalar *note 13.3(8.1/3): 4977.
Machine_Code
- child of System *note 13.8(7): 5153.
+ <child of> System *note 13.8(7): 5153.
Machine_Emax attribute *note A.5.3(8): 6189.
Machine_Emin attribute *note A.5.3(7): 6187.
Machine_Mantissa attribute *note A.5.3(6): 6185.
@@ -85813,29 +86003,29 @@ Machine_Radix clause *note 13.3(7/2): 4973, *note
F.1(1): 8220.
Machine_Rounding attribute *note A.5.3(41.1/2): 6227.
Machine_Rounds attribute *note A.5.3(11): 6197, *note A.5.4(3): 6275.
macro
- See generic unit *note 12(1): 4665.
+ <See> generic unit *note 12(1): 4665.
Macron
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5646.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5646.
main subprogram
for a partition *note 10.2(7): 4450.
malloc
- See allocator *note 4.8(1): 3041.
+ <See> allocator *note 4.8(1): 3041.
Map
- in Ada.Containers.Hashed_Maps *note A.18.5(3/3): 6909.
- in Ada.Containers.Ordered_Maps *note A.18.6(4/3): 6962.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(3/3): 6909.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(4/3): 6962.
map container *note A.18.4(1/2): 6888.
Map_Iterator_Interfaces
- in Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 6914.
- in Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 6967.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6.2/3): 6914.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7.2/3): 6967.
Maps
- child of Ada.Strings *note A.4.2(3/2): 5783.
+ <child of> Ada.Strings *note A.4.2(3/2): 5783.
mark_non_spacing *note 2.1(9.4/2): 1136, *note 2.1(9.5/2): 1137.
- used *note 2.3(3.1/3): 1199, *note P: 8971.
+ <used> *note 2.3(3.1/3): 1199, *note P: 8971.
mark_spacing_combining
- used *note 2.3(3.1/3): 1200, *note P: 8972.
+ <used> *note 2.3(3.1/3): 1200, *note P: 8972.
marshalling *note E.4(9): 8183.
Masculine_Ordinal_Indicator
- in Ada.Characters.Latin_1 *note A.3.3(22): 5659.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5659.
master *note 7.6.1(3/2): 3695.
master of a call *note 3.10.2(10.1/3): 2297.
match
@@ -85849,36 +86039,36 @@ Max attribute *note 3.5(19): 1623.
Max_Alignment_For_Allocation attribute *note 13.11.1(4/3): 5222.
Max_Asynchronous_Select_Nesting restriction *note D.7(18/1): 7926.
Max_Base_Digits *note 3.5.7(6): 1804.
- in System *note 13.7(8): 5112.
+ <in> System *note 13.7(8): 5112.
Max_Binary_Modulus *note 3.5.4(7): 1732.
- in System *note 13.7(7): 5110.
+ <in> System *note 13.7(7): 5110.
Max_Decimal_Digits
- in Ada.Decimal *note F.2(5): 8228.
+ <in> Ada.Decimal *note F.2(5): 8228.
Max_Delta
- in Ada.Decimal *note F.2(4): 8227.
+ <in> Ada.Decimal *note F.2(4): 8227.
Max_Digits *note 3.5.7(6): 1805.
- in System *note 13.7(8): 5113.
+ <in> System *note 13.7(8): 5113.
Max_Digits_Binary
- in Interfaces.COBOL *note B.4(11): 7550.
+ <in> Interfaces.COBOL *note B.4(11): 7550.
Max_Digits_Long_Binary
- in Interfaces.COBOL *note B.4(11): 7551.
+ <in> Interfaces.COBOL *note B.4(11): 7551.
Max_Entry_Queue_Length restriction *note D.7(19.1/2): 7936.
Max_Image_Width
- in Ada.Numerics.Discrete_Random *note A.5.2(25): 6168.
- in Ada.Numerics.Float_Random *note A.5.2(13): 6156.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(25): 6168.
+ <in> Ada.Numerics.Float_Random *note A.5.2(13): 6156.
Max_Int *note 3.5.4(14): 1745.
- in System *note 13.7(6): 5109.
+ <in> System *note 13.7(6): 5109.
Max_Length
- in Ada.Strings.Bounded *note A.4.4(5): 5845.
+ <in> Ada.Strings.Bounded *note A.4.4(5): 5845.
Max_Mantissa
- in System *note 13.7(9): 5114.
+ <in> System *note 13.7(9): 5114.
Max_Nonbinary_Modulus *note 3.5.4(7): 1733.
- in System *note 13.7(7): 5111.
+ <in> System *note 13.7(7): 5111.
Max_Picture_Length
- in Ada.Text_IO.Editing *note F.3.3(8): 8240.
+ <in> Ada.Text_IO.Editing *note F.3.3(8): 8240.
Max_Protected_Entries restriction *note D.7(14): 7917.
Max_Scale
- in Ada.Decimal *note F.2(3): 8224.
+ <in> Ada.Decimal *note F.2(3): 8224.
Max_Select_Alternatives restriction *note D.7(12): 7913.
Max_Size_In_Storage_Elements attribute *note 13.11.1(3/3): 5220.
Max_Storage_At_Blocking restriction *note D.7(17/1): 7921.
@@ -85894,66 +86084,66 @@ maximum relative error
*note G.2.6(3): 8365.
for the evaluation of an elementary function *note G.2.4(2): 8359.
Members
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8039.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8039.
Membership
- in Ada.Strings *note A.4.1(6): 5780.
+ <in> Ada.Strings *note A.4.1(6): 5780.
membership test *note 4.5.2(2/3): 2790.
membership_choice *note 4.4(3.2/4): 2691.
- used *note 4.4(3.1/3): 2689, *note P: 9294.
+ <used> *note 4.4(3.1/3): 2689, *note P: 9294.
membership_choice_list *note 4.4(3.1/3): 2688.
- used *note 4.4(3/4): 2686, *note P: 9291.
+ <used> *note 4.4(3/4): 2686, *note P: 9291.
Memory_Size
- in System *note 13.7(13): 5121.
+ <in> System *note 13.7(13): 5121.
mentioned
in a with_clause *note 10.1.2(6/2): 4383.
Merge
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 6872.
- in Ada.Containers.Vectors *note A.18.2(78/2): 6800.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(50/2): 6872.
+ <in> Ada.Containers.Vectors *note A.18.2(78/2): 6800.
message
- See dispatching call *note 3.9.2(1/2): 2156.
+ <See> dispatching call *note 3.9.2(1/2): 2156.
method
- See dispatching subprogram *note 3.9.2(1/2): 2157.
+ <See> dispatching subprogram *note 3.9.2(1/2): 2157.
metrics *note 1.1.2(35): 1045.
Micro_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5653.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5653.
Microseconds
- in Ada.Real_Time *note D.8(14/2): 7956.
+ <in> Ada.Real_Time *note D.8(14/2): 7956.
Middle_Dot
- in Ada.Characters.Latin_1 *note A.3.3(22): 5656.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5656.
Milliseconds
- in Ada.Real_Time *note D.8(14/2): 7957.
+ <in> Ada.Real_Time *note D.8(14/2): 7957.
Min attribute *note 3.5(16): 1621.
Min_Delta
- in Ada.Decimal *note F.2(4): 8226.
+ <in> Ada.Decimal *note F.2(4): 8226.
Min_Handler_Ceiling
- in Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8034.
- in Ada.Execution_Time.Timers *note D.14.1(6/2): 8018.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(7/2): 8034.
+ <in> Ada.Execution_Time.Timers *note D.14.1(6/2): 8018.
Min_Int *note 3.5.4(14): 1744.
- in System *note 13.7(6): 5108.
+ <in> System *note 13.7(6): 5108.
Min_Scale
- in Ada.Decimal *note F.2(3): 8225.
+ <in> Ada.Decimal *note F.2(3): 8225.
minus *note 2.1(15/3): 1163.
minus operator *note 4.4(1/3): 2623, *note 4.5.3(1): 2813, *note
4.5.4(1): 2836.
Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5546.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5546.
Minute
- in Ada.Calendar.Formatting *note 9.6.1(25/2): 4195.
-Minute_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4188.
+ <in> Ada.Calendar.Formatting *note 9.6.1(25/2): 4195.
+Minute_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4188.
Minutes
- in Ada.Real_Time *note D.8(14/2): 7959.
+ <in> Ada.Real_Time *note D.8(14/2): 7959.
mixed-language programs *note B(1): 7381, *note C.1(4/3): 7626.
Mod attribute *note 3.5.4(16.1/2): 1750.
mod operator *note 4.4(1/3): 2642, *note 4.5.5(1): 2850.
mod_clause *note J.8(1): 8516.
- used *note 13.5.1(2): 5061, *note P: 9825.
+ <used> *note 13.5.1(2): 5061, *note P: 9825.
mode *note 6.1(16): 3328.
- used *note 6.1(15/3): 3321, *note 12.4(2/3): 4743, *note P: 9438.
- in Ada.Direct_IO *note A.8.4(9): 6334.
- in Ada.Sequential_IO *note A.8.1(9): 6307.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6580.
- in Ada.Text_IO *note A.10.1(12): 6389.
+ <used> *note 6.1(15/3): 3321, *note 12.4(2/3): 4743, *note P: 9438.
+ <in> Ada.Direct_IO *note A.8.4(9): 6334.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6307.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6580.
+ <in> Ada.Text_IO *note A.10.1(12): 6389.
mode conformance *note 6.3.1(16/3): 3430.
required *note 8.5.4(4/3): 3828, *note 8.5.4(5/3): 3831, *note
12.6(7/3): 4845, *note 12.6(8/3): 4846, *note 13.3(6): 4958.
@@ -85961,11 +86151,11 @@ mode of operation
nonstandard *note 1.1.5(11): 1081.
standard *note 1.1.5(11): 1083.
Mode_Error
- in Ada.Direct_IO *note A.8.4(18): 6348.
- in Ada.IO_Exceptions *note A.13(4): 6615.
- in Ada.Sequential_IO *note A.8.1(15): 6316.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6596.
- in Ada.Text_IO *note A.10.1(85): 6521.
+ <in> Ada.Direct_IO *note A.8.4(18): 6348.
+ <in> Ada.IO_Exceptions *note A.13(4): 6615.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6316.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6596.
+ <in> Ada.Text_IO *note A.10.1(85): 6521.
Model attribute *note A.5.3(68): 6266, *note G.2.2(7): 8350.
model interval *note G.2.1(4): 8333.
associated with a value *note G.2.1(4): 8334.
@@ -85978,54 +86168,55 @@ Model_Mantissa attribute *note A.5.3(64): 6258,
*note G.2.2(3/2):
8341.
Model_Small attribute *note A.5.3(67): 6264.
Modification_Time
- in Ada.Directories *note A.16(27/2): 6658, *note A.16(42/2): 6670.
+ <in> Ada.Directories *note A.16(27/2): 6658, *note A.16(42/2):
+6670.
modular type *note 3.5.4(1): 1719.
Modular_IO
- in Ada.Text_IO *note A.10.1(57): 6472.
+ <in> Ada.Text_IO *note A.10.1(57): 6472.
modular_type_definition *note 3.5.4(4): 1727.
- used *note 3.5.4(2): 1723, *note P: 9086.
+ <used> *note 3.5.4(2): 1723, *note P: 9086.
module
- See package *note 7(1): 3569.
+ <See> package *note 7(1): 3569.
modulus
of a modular type *note 3.5.4(7): 1731.
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8395,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(10/2): 8395,
*note G.3.2(30/2): 8408.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 8272.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(9): 8272.
Modulus attribute *note 3.5.4(17): 1752.
Monday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4179.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4179.
Month
- in Ada.Calendar *note 9.6(13): 4153.
- in Ada.Calendar.Formatting *note 9.6.1(22/2): 4192.
-Month_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4148.
+ <in> Ada.Calendar *note 9.6(13): 4153.
+ <in> Ada.Calendar.Formatting *note 9.6.1(22/2): 4192.
+Month_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4148.
More_Entries
- in Ada.Directories *note A.16(34/2): 6664.
+ <in> Ada.Directories *note A.16(34/2): 6664.
Move
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 6841.
- in Ada.Containers.Hashed_Maps *note A.18.5(18/2): 6932.
- in Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7060.
- in Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7300.
- in Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7227.
- in Ada.Containers.Ordered_Maps *note A.18.6(17/2): 6983.
- in Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7131.
- in Ada.Containers.Vectors *note A.18.2(35/2): 6758.
- in Ada.Strings.Fixed *note A.4.3(7): 5808.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(18/2): 6841.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(18/2): 6932.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(18/2): 7060.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(22/3): 7300.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(34/3): 7227.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(17/2): 6983.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(17/2): 7131.
+ <in> Ada.Containers.Vectors *note A.18.2(35/2): 6758.
+ <in> Ada.Strings.Fixed *note A.4.3(7): 5808.
multi-dimensional array *note 3.6(12): 1912.
Multiplication_Sign
- in Ada.Characters.Latin_1 *note A.3.3(24): 5688.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5688.
multiply *note 2.1(15/3): 1159.
multiply operator *note 4.4(1/3): 2634, *note 4.5.5(1): 2842.
multiplying operator *note 4.5.5(1): 2838.
multiplying_operator *note 4.5(6): 2728.
- used *note 4.4(5): 2702, *note P: 9303.
+ <used> *note 4.4(5): 2702, *note P: 9303.
Multiprocessors
- child of System *note D.16(3/3): 8070.
+ <child of> System *note D.16(3/3): 8070.
Multiway_Trees
- child of Ada.Containers *note A.18.10(7/3): 7201.
+ <child of> Ada.Containers *note A.18.10(7/3): 7201.
mutates *note 7.6(17.6/3): 3684.
MW
- in Ada.Characters.Latin_1 *note A.3.3(18): 5619.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5619.
@@ -86038,13 +86229,13 @@ N
n-dimensional array_aggregate *note 4.3.3(6): 2561.
NAK
- in Ada.Characters.Latin_1 *note A.3.3(6): 5521.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5521.
name *note 4.1(2/3): 2359.
- [partial] *note 3.1(1): 1291.
+ [<partial>] *note 3.1(1): 1291.
of (a view of) an entity *note 3.1(8): 1318.
of a pragma *note 2.8(9): 1272.
of an external file *note A.7(1): 6281.
- used *note 2.8(3/3): 1269, *note 3.2.2(4): 1409, *note 4.1(4):
+ <used> *note 2.8(3/3): 1269, *note 3.2.2(4): 1409, *note 4.1(4):
2376, *note 4.1(5): 2379, *note 4.1(6): 2381, *note 4.1.5(4/3): 2456,
*note 4.4(7/3): 2713, *note 4.6(2): 2929, *note 4.8(2.1/3): 3049, *note
5.2(2): 3151, *note 5.5.2(2/3): 3237, *note 5.7(2): 3267, *note 5.8(2):
@@ -86066,23 +86257,23 @@ L(6.1/3): 8722, *note L(10): 8744, *note L(11): 8748,
*note L(12): 8751,
*note L(15.1/3): 8773, *note L(16): 8776, *note L(17.1/3): 8780, *note
L(26): 8814, *note L(28): 8828, *note L(30): 8836, *note L(31): 8839,
*note L(34): 8848, *note P: 9462.
- in Ada.Direct_IO *note A.8.4(9): 6335.
- in Ada.Sequential_IO *note A.8.1(9): 6308.
- in Ada.Streams.Stream_IO *note A.12.1(11): 6581.
- in Ada.Text_IO *note A.10.1(12): 6390.
- in System *note 13.7(4): 5106.
+ <in> Ada.Direct_IO *note A.8.4(9): 6335.
+ <in> Ada.Sequential_IO *note A.8.1(9): 6308.
+ <in> Ada.Streams.Stream_IO *note A.12.1(11): 6581.
+ <in> Ada.Text_IO *note A.10.1(12): 6390.
+ <in> System *note 13.7(4): 5106.
name resolution rules *note 1.1.2(26/3): 1019.
Name_Case_Equivalence
- in Ada.Directories *note A.16(20.2/3): 6652.
+ <in> Ada.Directories *note A.16(20.2/3): 6652.
Name_Case_Kind
- in Ada.Directories *note A.16(20.1/3): 6651.
+ <in> Ada.Directories *note A.16(20.1/3): 6651.
Name_Error
- in Ada.Direct_IO *note A.8.4(18): 6349.
- in Ada.Directories *note A.16(43/2): 6672.
- in Ada.IO_Exceptions *note A.13(4): 6616.
- in Ada.Sequential_IO *note A.8.1(15): 6317.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6597.
- in Ada.Text_IO *note A.10.1(85): 6522.
+ <in> Ada.Direct_IO *note A.8.4(18): 6349.
+ <in> Ada.Directories *note A.16(43/2): 6672.
+ <in> Ada.IO_Exceptions *note A.13(4): 6616.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6317.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6597.
+ <in> Ada.Text_IO *note A.10.1(85): 6522.
named
in a use clause *note 8.4(7.1/2): 3784.
in a with_clause *note 10.1.2(6/2): 4385.
@@ -86095,20 +86286,20 @@ named number *note 3.3(24): 1472.
named parameter association *note 6.4.1(2/3): 3473.
named type *note 3.2.1(7/2): 1390.
named_array_aggregate *note 4.3.3(4): 2554.
- used *note 4.3.3(2): 2544, *note P: 9250.
+ <used> *note 4.3.3(2): 2544, *note P: 9250.
Names
- child of Ada.Interrupts *note C.3.2(12): 7670.
+ <child of> Ada.Interrupts *note C.3.2(12): 7670.
Nanoseconds
- in Ada.Real_Time *note D.8(14/2): 7955.
+ <in> Ada.Real_Time *note D.8(14/2): 7955.
Native_Binary
- in Interfaces.COBOL *note B.4(25): 7572.
+ <in> Interfaces.COBOL *note B.4(25): 7572.
Natural *note 3.5.4(12): 1741.
-Natural subtype of Integer
- in Standard *note A.1(13): 5439.
+Natural <subtype of> Integer
+ <in> Standard *note A.1(13): 5439.
NBH
- in Ada.Characters.Latin_1 *note A.3.3(17): 5601.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5601.
NBSP
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5631.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5631.
needed
of a compilation unit by another *note 10.2(2): 4449.
remote call interface *note E.2.3(18): 8167.
@@ -86130,33 +86321,33 @@ A.18.7(4/2): 7021, *note A.18.7(36.2/3): 7030, *note
A.18.7(96.2/3):
A.18.18(27/3): 7301, *note A.18.18(54/3): 7305, *note D.14.2(13/2):
8048, *note D.15(8/2): 8066.
NEL
- in Ada.Characters.Latin_1 *note A.3.3(17): 5603.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5603.
new
- See allocator *note 4.8(1): 3040.
+ <See> allocator *note 4.8(1): 3040.
New_Char_Array
- in Interfaces.C.Strings *note B.3.1(9): 7502.
+ <in> Interfaces.C.Strings *note B.3.1(9): 7502.
New_Line
- in Ada.Text_IO *note A.10.1(28): 6419.
+ <in> Ada.Text_IO *note A.10.1(28): 6419.
New_Page
- in Ada.Text_IO *note A.10.1(31): 6426.
+ <in> Ada.Text_IO *note A.10.1(31): 6426.
New_String
- in Interfaces.C.Strings *note B.3.1(10): 7503.
+ <in> Interfaces.C.Strings *note B.3.1(10): 7503.
Next
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 6860,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(37/2): 6860,
*note A.18.3(39/2): 6862.
- in Ada.Containers.Hashed_Maps *note A.18.5(28/2): 6942, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(28/2): 6942, *note
A.18.5(29/2): 6943.
- in Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7079, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(41/2): 7079, *note
A.18.8(42/2): 7080.
- in Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7000, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(34/2): 7000, *note
A.18.6(35/2): 7001.
- in Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7155, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(45/2): 7155, *note
A.18.9(46/2): 7156.
- in Ada.Containers.Vectors *note A.18.2(63/2): 6786, *note
+ <in> Ada.Containers.Vectors *note A.18.2(63/2): 6786, *note
A.18.2(64/2): 6787.
- in Ada.Iterator_Interfaces *note 5.5.1(3/3): 3212.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(3/3): 3212.
Next_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7257, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(64/3): 7257, *note
A.18.10(66/3): 7259.
No_Abort_Statements restriction *note D.7(5/3): 7879.
No_Access_Parameter_Allocators restriction *note H.4(8.3/3): 8457.
@@ -86164,7 +86355,7 @@ No_Access_Subprograms restriction *note H.4(17): 8467.
No_Allocators restriction *note H.4(7): 8449.
No_Anonymous_Allocators restriction *note H.4(8.1/3): 8453.
No_Break_Space
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5630.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5630.
No_Coextensions restriction *note H.4(8.2/3): 8455.
No_Delay restriction *note H.4(21): 8477.
No_Dependence restriction *note 13.12.1(6/2): 5323.
@@ -86173,13 +86364,13 @@ No_Dynamic_Attachment restriction *note D.7(10/3):
7890.
No_Dynamic_CPU_Assigmment restriction *note D.7(10.1/4): 7892.
No_Dynamic_Priorities restriction *note D.7(9/2): 7888.
No_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 6826.
- in Ada.Containers.Hashed_Maps *note A.18.5(6/2): 6912.
- in Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7044.
- in Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7205.
- in Ada.Containers.Ordered_Maps *note A.18.6(7/2): 6965.
- in Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7117.
- in Ada.Containers.Vectors *note A.18.2(11/2): 6730.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(9/2): 6826.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(6/2): 6912.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6/2): 7044.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(11/3): 7205.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(7/2): 6965.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7/2): 7117.
+ <in> Ada.Containers.Vectors *note A.18.2(11/2): 6730.
No_Exceptions restriction *note H.4(12): 8461.
No_Fixed_Point restriction *note H.4(15): 8465.
No_Floating_Point restriction *note H.4(14): 8463.
@@ -86191,7 +86382,7 @@ No_Implementation_Pragmas restriction *note
13.12.1(3/2): 5317.
No_Implementation_Units restriction *note 13.12.1(3.1/3): 5319.
No_Implicit_Heap_Allocations restriction *note D.7(8): 7886.
No_Index
- in Ada.Containers.Vectors *note A.18.2(7/2): 6726.
+ <in> Ada.Containers.Vectors *note A.18.2(7/2): 6726.
No_IO restriction *note H.4(20/2): 8475.
No_Local_Allocators restriction *note H.4(8/1): 8451.
No_Local_Protected_Objects restriction *note D.7(10.2/3): 7894.
@@ -86212,7 +86403,7 @@ No_Specification_of_Aspect restriction *note
13.12.1(6.1/3): 5325.
No_Standard_Allocators_After_Elaboration restriction *note
D.7(19.2/3): 7939.
No_Tag
- in Ada.Tags *note 3.9(6.1/2): 2102.
+ <in> Ada.Tags *note 3.9(6.1/2): 2102.
No_Task_Allocators restriction *note D.7(7): 7883.
No_Task_Hierarchy restriction *note D.7(3/3): 7875.
No_Task_Termination restriction *note D.7(15.1/2): 7919.
@@ -86226,7 +86417,7 @@ node
of a map *note A.18.4(5/2): 6892.
of a tree *note A.18.10(2/4): 7193.
Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7210.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(17/3): 7210.
nominal subtype *note 3.3(23/3): 1465, *note 3.3.1(8/2): 1502.
associated with a dereference *note 4.1(9/3): 2384.
associated with a type_conversion *note 4.6(27): 2963.
@@ -86238,7 +86429,7 @@ nominal subtype *note 3.3(23/3): 1465, *note
3.3.1(8/2): 1502.
of a record component *note 3.8(14): 2046.
of the result of a function_call *note 6.4(12/2): 3468.
Non_Preemptive
- child of Ada.Dispatching *note D.2.4(2.2/3): 7806.
+ <child of> Ada.Dispatching *note D.2.4(2.2/3): 7806.
Non_Preemptive_FIFO_Within_Priorities task disp. policy *note
D.2.4(2/2): 7805.
nonconfirming
@@ -86253,9 +86444,9 @@ nonlimited interface *note 3.9.4(5/2): 2211.
nonlimited type *note 7.5(7): 3646.
becoming nonlimited *note 7.3.1(5/1): 3622, *note 7.5(16): 3650.
nonlimited_with_clause *note 10.1.2(4.2/2): 4379.
- used *note 10.1.2(4/2): 4375, *note P: 9673.
+ <used> *note 10.1.2(4/2): 4375, *note P: 9673.
nonnormative
- See informative *note 1.1.2(18): 1012.
+ <See> informative *note 1.1.2(18): 1012.
nonoverridable
aspect *note 13.1.1(18.2/4): 4927.
nonreturning *note 6.5.1(3.2/3): 3534.
@@ -86266,7 +86457,7 @@ normal completion *note 7.6.1(2/2): 3689.
normal library unit *note E.2(4/3): 8121.
normal state of an object *note 11.6(6/3): 4659, *note 13.9.1(4):
5166.
- [partial] *note 9.8(21): 4293, *note A.13(17): 6623.
+ [<partial>] *note 9.8(21): 4293, *note A.13(17): 6623.
Normalize_Scalars pragma *note H.1(3): 8432, *note L(22): 8797.
normalized exponent *note A.5.3(14): 6202.
normalized number *note A.5.3(10): 6193.
@@ -86275,24 +86466,24 @@ not equal operator *note 4.4(1/3): 2597, *note
4.5.2(1): 2771.
not in (membership test) *note 4.4(1/3): 2616, *note 4.5.2(2/3): 2792.
not operator *note 4.4(1/3): 2653, *note 4.5.6(3): 2863.
Not_A_Specific_CPU
- in System.Multiprocessors *note D.16(4/3): 8072.
+ <in> System.Multiprocessors *note D.16(4/3): 8072.
Not_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5643.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5643.
notes *note 1.1.2(38): 1049.
notwithstanding *note 7.6(17.5/3): 3683, *note 10.1.6(6/2): 4440,
*note 13.1.1(32/4): 4937, *note B.1(22/3): 7408, *note B.1(38/3): 7414,
*note C.3.1(19/3): 7658, *note E.2.1(8): 8131, *note E.2.1(11): 8135,
*note E.2.3(18): 8168, *note H.6(7/2): 8493, *note J.3(6): 8499.
- [partial] *note J.15.5(8/3): 8582.
+ [<partial>] *note J.15.5(8/3): 8582.
NUL
- in Ada.Characters.Latin_1 *note A.3.3(5): 5500.
- in Interfaces.C *note B.3(20/1): 7452.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5500.
+ <in> Interfaces.C *note B.3(20/1): 7452.
null access value *note 4.2(9): 2486.
null array *note 3.6.1(7): 1942.
null constraint *note 3.2(7/2): 1352.
null extension *note 3.9.1(4.1/2): 2144.
null pointer
- See null access value *note 4.2(9): 2487.
+ <See> null access value *note 4.2(9): 2487.
null procedure *note 6.7(3/3): 3548.
null range *note 3.5(4): 1595.
null record *note 3.8(15): 2047.
@@ -86301,54 +86492,55 @@ null string literal *note 2.6(6): 1255.
null value
of an access type *note 3.10(13/2): 2267.
Null_Address
- in System *note 13.7(12): 5118.
+ <in> System *note 13.7(12): 5118.
Null_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(7): 5847.
+ <in> Ada.Strings.Bounded *note A.4.4(7): 5847.
null_exclusion *note 3.10(5.1/2): 2239.
- used *note 3.2.2(3/2): 1405, *note 3.7(5/2): 1976, *note 3.10(2/2):
-2230, *note 3.10(6/2): 2241, *note 6.1(13/2): 3312, *note 6.1(15/3):
-3322, *note 8.5.1(2/3): 3800, *note 12.4(2/3): 4744, *note P: 9431.
+ <used> *note 3.2.2(3/2): 1405, *note 3.7(5/2): 1976, *note
+3.10(2/2): 2230, *note 3.10(6/2): 2241, *note 6.1(13/2): 3312, *note
+6.1(15/3): 3322, *note 8.5.1(2/3): 3800, *note 12.4(2/3): 4744, *note P:
+9431.
Null_Id
- in Ada.Exceptions *note 11.4.1(2/2): 4566.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4566.
Null_Occurrence
- in Ada.Exceptions *note 11.4.1(3/2): 4572.
+ <in> Ada.Exceptions *note 11.4.1(3/2): 4572.
null_procedure_declaration *note 6.7(2/3): 3543.
- used *note 3.1(3/3): 1299, *note 9.4(8/4): 3985, *note P: 9015.
+ <used> *note 3.1(3/3): 1299, *note 9.4(8/4): 3985, *note P: 9015.
Null_Ptr
- in Interfaces.C.Strings *note B.3.1(7): 7500.
+ <in> Interfaces.C.Strings *note B.3.1(7): 7500.
Null_Set
- in Ada.Strings.Maps *note A.4.2(5): 5785.
- in Ada.Strings.Wide_Maps *note A.4.7(5): 5987.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6026.
+ <in> Ada.Strings.Maps *note A.4.2(5): 5785.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(5): 5987.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(5/2): 6026.
null_statement *note 5.1(6): 3142.
- used *note 5.1(4/2): 3122, *note P: 9357.
+ <used> *note 5.1(4/2): 3122, *note P: 9357.
Null_Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 7710.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 7710.
Null_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(5): 5904.
+ <in> Ada.Strings.Unbounded *note A.4.5(5): 5904.
number sign *note 2.1(15/3): 1152.
-Number_Base subtype of Integer
- in Ada.Text_IO *note A.10.1(6): 6381.
+Number_Base <subtype of> Integer
+ <in> Ada.Text_IO *note A.10.1(6): 6381.
number_decimal *note 2.1(10/2): 1138.
- used *note 2.3(3.1/3): 1201, *note P: 8973.
+ <used> *note 2.3(3.1/3): 1201, *note P: 8973.
number_declaration *note 3.3.2(2): 1523.
- used *note 3.1(3/3): 1296, *note P: 9012.
+ <used> *note 3.1(3/3): 1296, *note P: 9012.
number_letter *note 2.1(10.1/2): 1139.
- used *note 2.3(3/2): 1197, *note P: 8970.
+ <used> *note 2.3(3/2): 1197, *note P: 8970.
Number_Of_CPUs
- in System.Multiprocessors *note D.16(5/3): 8074.
+ <in> System.Multiprocessors *note D.16(5/3): 8074.
Number_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5535.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5535.
numeral *note 2.4.1(3): 1215.
- used *note 2.4.1(2): 1212, *note 2.4.1(4): 1221, *note 2.4.2(3):
+ <used> *note 2.4.1(2): 1212, *note 2.4.1(4): 1221, *note 2.4.2(3):
1239, *note P: 8989.
Numeric
- in Interfaces.COBOL *note B.4(20/3): 7562.
+ <in> Interfaces.COBOL *note B.4(20/3): 7562.
numeric type *note 3.5(1): 1584.
numeric_literal *note 2.4(2): 1207.
- used *note 4.4(7/3): 2710, *note P: 9309.
+ <used> *note 4.4(7/3): 2710, *note P: 9309.
numerics *note G(1): 8257.
- child of Ada *note A.5(3/2): 6106.
+ <child of> Ada *note A.5(3/2): 6106.
@@ -86361,14 +86553,15 @@ O
O(f(N)) *note A.18(3/2): 6712.
object *note 3.3(2): 1455, *note N(24): 8924.
- [partial] *note 3.2(1): 1330.
+ [<partial>] *note 3.2(1): 1330.
object-oriented programming (OOP)
- See dispatching operations of tagged types *note 3.9.2(1/2): 2154.
- See tagged types and type extensions *note 3.9(1): 2084.
+ <See> dispatching operations of tagged types *note 3.9.2(1/2):
+2154.
+ <See> tagged types and type extensions *note 3.9(1): 2084.
object_declaration *note 3.3.1(2/3): 1479.
- used *note 3.1(3/3): 1295, *note P: 9011.
+ <used> *note 3.1(3/3): 1295, *note P: 9011.
object_renaming_declaration *note 8.5.1(2/3): 3798.
- used *note 8.5(2): 3790, *note P: 9509.
+ <used> *note 8.5(2): 3790, *note P: 9509.
obsolescent feature *note J(1/2): 8494.
occur immediately within *note 8.1(13): 3714.
occurrence
@@ -86383,15 +86576,16 @@ one-dimensional array *note 3.6(12): 1911.
only as a completion
entry_body *note 9.5.2(16): 4072.
OOP (object-oriented programming)
- See dispatching operations of tagged types *note 3.9.2(1/2): 2155.
- See tagged types and type extensions *note 3.9(1): 2085.
+ <See> dispatching operations of tagged types *note 3.9.2(1/2):
+2155.
+ <See> tagged types and type extensions *note 3.9(1): 2085.
opaque type
- See private types and private extensions *note 7.3(1): 3597.
+ <See> private types and private extensions *note 7.3(1): 3597.
Open
- in Ada.Direct_IO *note A.8.4(7): 6329.
- in Ada.Sequential_IO *note A.8.1(7): 6302.
- in Ada.Streams.Stream_IO *note A.12.1(9): 6575.
- in Ada.Text_IO *note A.10.1(10): 6384.
+ <in> Ada.Direct_IO *note A.8.4(7): 6329.
+ <in> Ada.Sequential_IO *note A.8.1(7): 6302.
+ <in> Ada.Streams.Stream_IO *note A.12.1(9): 6575.
+ <in> Ada.Text_IO *note A.10.1(10): 6384.
open alternative *note 9.7.1(14): 4235.
open entry *note 9.5.3(5): 4095.
of a protected object *note 9.5.3(7/3): 4101.
@@ -86456,25 +86650,25 @@ operator *note 6.6(1): 3539.
xor *note 4.4(1/3): 2588, *note 4.5.1(2): 2750.
operator precedence *note 4.5(1): 2723.
operator_symbol *note 6.1(9): 3304.
- used *note 4.1(3): 2374, *note 4.1.3(3): 2424, *note 6.1(5): 3297,
-*note 6.1(11): 3307, *note P: 9209.
+ <used> *note 4.1(3): 2374, *note 4.1.3(3): 2424, *note 6.1(5):
+3297, *note 6.1(11): 3307, *note P: 9209.
optimization *note 11.5(29): 4646, *note 11.6(1/3): 4652.
Optimize pragma *note 2.8(23): 1287, *note L(23): 8799.
or else (short-circuit control form) *note 4.4(1/3): 2590, *note
4.5.1(1): 2741.
or operator *note 4.4(1/3): 2585, *note 4.5.1(2): 2747.
Ordered_Maps
- child of Ada.Containers *note A.18.6(2/3): 6960.
+ <child of> Ada.Containers *note A.18.6(2/3): 6960.
Ordered_Sets
- child of Ada.Containers *note A.18.9(2/3): 7112.
+ <child of> Ada.Containers *note A.18.9(2/3): 7112.
ordering operator *note 4.5.2(1): 2763.
ordinary file *note A.16(45/2): 6677.
ordinary fixed point type *note 3.5.9(1): 1826, *note 3.5.9(8/2):
1848.
ordinary_fixed_point_definition *note 3.5.9(3): 1832.
- used *note 3.5.9(2): 1830, *note P: 9096.
+ <used> *note 3.5.9(2): 1830, *note P: 9096.
OSC
- in Ada.Characters.Latin_1 *note A.3.3(19): 5627.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5627.
other_control *note 2.1(13.1/2): 1147.
other_format *note 2.1(10.3/2): 1141.
other_private_use *note 2.1(13.2/2): 1148.
@@ -86487,13 +86681,13 @@ Output'Class aspect *note 13.13.2(38/4): 5393.
overall interpretation
of a complete context *note 8.6(10): 3850.
Overflow_Check *note 11.5(16): 4634.
- [partial] *note 3.5.4(20): 1754, *note 4.4(11): 2719, *note
+ [<partial>] *note 3.5.4(20): 1754, *note 4.4(11): 2719, *note
4.5.7(21/3): 2902, *note 5.4(13): 3187, *note G.2.1(11): 8337, *note
G.2.2(7): 8351, *note G.2.3(25): 8355, *note G.2.4(2): 8360, *note
G.2.6(3): 8367.
Overlap
- in Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7076.
- in Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7149.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(38/2): 7076.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(39/2): 7149.
Overlaps_Storage attribute *note 13.3(73.6/3): 5031.
overload resolution *note 8.6(1/3): 3845.
overloadable *note 8.3(7): 3747.
@@ -86507,15 +86701,16 @@ override *note 8.3(9/1): 3750, *note 12.3(17): 4735.
3991.
overriding operation *note N(24.1/2): 8925.
overriding_indicator *note 8.3.1(2/2): 3772.
- used *note 3.9.3(1.1/3): 2186, *note 6.1(2/3): 3282, *note
+ <used> *note 3.9.3(1.1/3): 2186, *note 6.1(2/3): 3282, *note
6.3(2/3): 3403, *note 6.7(2/3): 3544, *note 6.8(2/4): 3552, *note
8.5.4(2/3): 3823, *note 9.5.2(2/3): 4039, *note 10.1.3(3/3): 4393, *note
12.3(2/3): 4699, *note P: 9529.
Overwrite
- in Ada.Strings.Bounded *note A.4.4(62): 5887, *note A.4.4(63):
+ <in> Ada.Strings.Bounded *note A.4.4(62): 5887, *note A.4.4(63):
5888.
- in Ada.Strings.Fixed *note A.4.3(27): 5830, *note A.4.3(28): 5831.
- in Ada.Strings.Unbounded *note A.4.5(57): 5941, *note A.4.5(58):
+ <in> Ada.Strings.Fixed *note A.4.3(27): 5830, *note A.4.3(28):
+5831.
+ <in> Ada.Strings.Unbounded *note A.4.5(57): 5941, *note A.4.5(58):
5942.
@@ -86532,62 +86727,62 @@ Pack pragma *note J.15.3(2/3): 8545, *note
L(24.1/3): 8802.
Package *note 7(1): 3566, *note N(25): 8926.
package instance *note 12.3(13): 4727.
package_body *note 7.2(2/3): 3586.
- used *note 3.11(6): 2341, *note 10.1.1(7): 4344, *note P: 9193.
+ <used> *note 3.11(6): 2341, *note 10.1.1(7): 4344, *note P: 9193.
package_body_stub *note 10.1.3(4/3): 4396.
- used *note 10.1.3(2): 4389, *note P: 9679.
+ <used> *note 10.1.3(2): 4389, *note P: 9679.
package_declaration *note 7.1(2): 3571.
- used *note 3.1(3/3): 1301, *note 10.1.1(5): 4335, *note P: 9660.
+ <used> *note 3.1(3/3): 1301, *note 10.1.1(5): 4335, *note P: 9660.
package_renaming_declaration *note 8.5.3(2/3): 3816.
- used *note 8.5(2): 3792, *note 10.1.1(6): 4339, *note P: 9663.
+ <used> *note 8.5(2): 3792, *note 10.1.1(6): 4339, *note P: 9663.
package_specification *note 7.1(3/3): 3573.
- used *note 7.1(2): 3572, *note 12.1(4): 4676, *note P: 9482.
+ <used> *note 7.1(2): 3572, *note 12.1(4): 4676, *note P: 9482.
packed *note 13.2(5.1/3): 4938.
Packed_Decimal
- in Interfaces.COBOL *note B.4(12/3): 7553.
+ <in> Interfaces.COBOL *note B.4(12/3): 7553.
Packed_Format
- in Interfaces.COBOL *note B.4(26): 7573.
+ <in> Interfaces.COBOL *note B.4(26): 7573.
Packed_Signed
- in Interfaces.COBOL *note B.4(27): 7575.
+ <in> Interfaces.COBOL *note B.4(27): 7575.
Packed_Unsigned
- in Interfaces.COBOL *note B.4(27): 7574.
+ <in> Interfaces.COBOL *note B.4(27): 7574.
padding bits *note 13.1(7/2): 4885.
Page
- in Ada.Text_IO *note A.10.1(39): 6442.
+ <in> Ada.Text_IO *note A.10.1(39): 6442.
Page pragma *note 2.8(22): 1285, *note L(25): 8805.
page terminator *note A.10(7): 6365.
Page_Length
- in Ada.Text_IO *note A.10.1(26): 6417.
+ <in> Ada.Text_IO *note A.10.1(26): 6417.
Paragraph_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5655.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5655.
parallel processing
- See task *note 9(1/3): 3877.
+ <See> task *note 9(1/3): 3877.
parameter
explicitly aliased *note 6.1(23.1/3): 3339.
- See formal parameter *note 6.1(17): 3331.
- See generic formal parameter *note 12(1): 4666.
- See also discriminant *note 3.7(1/2): 1966.
- See also loop parameter *note 5.5(6): 3203.
+ <See> formal parameter *note 6.1(17): 3331.
+ <See> generic formal parameter *note 12(1): 4666.
+ <See also> discriminant *note 3.7(1/2): 1966.
+ <See also> loop parameter *note 5.5(6): 3203.
parameter assigning back *note 6.4.1(17): 3490.
parameter copy back *note 6.4.1(17): 3488.
parameter mode *note 6.1(18/3): 3332.
parameter passing *note 6.4.1(1): 3470.
parameter_and_result_profile *note 6.1(13/2): 3310.
- used *note 3.10(5): 2238, *note 3.10(6/2): 2246, *note 6.1(4.2/2):
-3293, *note P: 9181.
+ <used> *note 3.10(5): 2238, *note 3.10(6/2): 2246, *note
+6.1(4.2/2): 3293, *note P: 9181.
parameter_association *note 6.4(5): 3457.
- used *note 6.4(4): 3456, *note P: 9458.
+ <used> *note 6.4(4): 3456, *note P: 9458.
parameter_profile *note 6.1(12): 3308.
- used *note 3.10(5): 2237, *note 3.10(6/2): 2244, *note 6.1(4.1/2):
-3290, *note 9.5.2(2/3): 4042, *note 9.5.2(3): 4047, *note 9.5.2(6):
-4061, *note P: 9417.
+ <used> *note 3.10(5): 2237, *note 3.10(6/2): 2244, *note
+6.1(4.1/2): 3290, *note 9.5.2(2/3): 4042, *note 9.5.2(3): 4047, *note
+9.5.2(6): 4061, *note P: 9417.
parameter_specification *note 6.1(15/3): 3319.
- used *note 6.1(14): 3318, *note P: 9435.
+ <used> *note 6.1(14): 3318, *note P: 9435.
Parameterless_Handler
- in Ada.Interrupts *note C.3.2(2/3): 7661.
+ <in> Ada.Interrupts *note C.3.2(2/3): 7661.
Params_Stream_Type
- in System.RPC *note E.5(6): 8207.
+ <in> System.RPC *note E.5(6): 8207.
parent *note N(25.1/2): 8927.
- in Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7252.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(59/3): 7252.
parent body
of a subunit *note 10.1.3(8/2): 4408.
parent declaration
@@ -86598,10 +86793,10 @@ parent type *note 3.4(3/2): 1538.
parent unit
of a library unit *note 10.1.1(10): 4356.
Parent_Tag
- in Ada.Tags *note 3.9(7.2/2): 2110.
+ <in> Ada.Tags *note 3.9(7.2/2): 2110.
parent_unit_name *note 10.1.1(8): 4345.
- used *note 6.1(5): 3295, *note 6.1(7): 3302, *note 7.1(3/3): 3578,
-*note 7.2(2/3): 3591, *note 10.1.3(7): 4406, *note P: 9487.
+ <used> *note 6.1(5): 3295, *note 6.1(7): 3302, *note 7.1(3/3):
+3578, *note 7.2(2/3): 3591, *note 10.1.3(7): 4406, *note P: 9487.
part
of a type *note 3.2(6/2): 1349.
of an object or value *note 3.2(6/2): 1348.
@@ -86611,79 +86806,80 @@ partition *note 10.2(2): 4444, *note N(26): 8928.
partition building *note 10.2(2): 4445.
partition communication subsystem (PCS) *note E.5(1/2): 8202.
Partition_Check
- [partial] *note E.4(19): 8195.
+ [<partial>] *note E.4(19): 8195.
Partition_Elaboration_Policy pragma *note H.6(3/2): 8489, *note
L(25.1/2): 8807.
Partition_Id
- in System.RPC *note E.5(4): 8205.
+ <in> System.RPC *note E.5(4): 8205.
Partition_Id attribute *note E.1(9): 8109.
pass by copy *note 6.2(2): 3387.
pass by reference *note 6.2(2): 3390.
passive partition *note E.1(2): 8101.
Pattern_Error
- in Ada.Strings *note A.4.1(5): 5775.
+ <in> Ada.Strings *note A.4.1(5): 5775.
PCS (partition communication subsystem) *note E.5(1/2): 8203.
Peak_Use
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3): 7368.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(7/3):
+7368.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(6/3):
7354.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(7/3):
-7341.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(7/3): 7341.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(7/3):
7361.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(6/3):
-7348.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(6/3): 7348.
pending interrupt occurrence *note C.3(2): 7634.
per-object constraint *note 3.8(18/2): 2053.
per-object expression *note 3.8(18/2): 2052.
percent sign *note 2.1(15/3): 1178.
Percent_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5537.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5537.
perfect result set *note G.2.3(5): 8353.
perform indefinite insertion *note A.18(6/4): 6714.
periodic task
example *note 9.6(39): 4167.
- See delay_until_statement *note 9.6(39): 4168.
+ <See> delay_until_statement *note 9.6(39): 4168.
Pi
- in Ada.Numerics *note A.5(3/2): 6108.
+ <in> Ada.Numerics *note A.5(3/2): 6108.
Pic_String
- in Ada.Text_IO.Editing *note F.3.3(7): 8238.
+ <in> Ada.Text_IO.Editing *note F.3.3(7): 8238.
Picture
- in Ada.Text_IO.Editing *note F.3.3(4): 8235.
+ <in> Ada.Text_IO.Editing *note F.3.3(4): 8235.
picture String
for edited output *note F.3.1(1/3): 8231.
Picture_Error
- in Ada.Text_IO.Editing *note F.3.3(9): 8241.
+ <in> Ada.Text_IO.Editing *note F.3.3(9): 8241.
Pilcrow_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5654.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5654.
plain_char
- in Interfaces.C *note B.3(11): 7445.
+ <in> Interfaces.C *note B.3(11): 7445.
plane
character *note 2.1(1/3): 1128.
PLD
- in Ada.Characters.Latin_1 *note A.3.3(17): 5609.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5609.
PLU
- in Ada.Characters.Latin_1 *note A.3.3(17): 5610.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5610.
plus operator *note 4.4(1/3): 2619, *note 4.5.3(1): 2809, *note
4.5.4(1): 2832.
plus sign *note 2.1(15/3): 1160.
Plus_Minus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(22): 5649.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5649.
Plus_Sign
- in Ada.Characters.Latin_1 *note A.3.3(8): 5543.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5543.
PM
- in Ada.Characters.Latin_1 *note A.3.3(19): 5628.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5628.
point *note 2.1(15/3): 1166.
Pointer
- in Interfaces.C.Pointers *note B.3.2(5): 7519.
- See access value *note 3.10(1): 2225.
- See type System.Address *note 13.7(34/2): 5131.
+ <in> Interfaces.C.Pointers *note B.3.2(5): 7519.
+ <See> access value *note 3.10(1): 2225.
+ <See> type System.Address *note 13.7(34/2): 5131.
pointer type
- See access type *note 3.10(1): 2226.
+ <See> access type *note 3.10(1): 2226.
Pointer_Error
- in Interfaces.C.Pointers *note B.3.2(8): 7522.
+ <in> Interfaces.C.Pointers *note B.3.2(8): 7522.
Pointers
- child of Interfaces.C *note B.3.2(4): 7518.
+ <child of> Interfaces.C *note B.3.2(4): 7518.
polymorphism *note 3.9(1): 2080, *note 3.9.2(1/2): 2151.
pool
default *note 13.11.3(4.2/4): 5253.
@@ -86692,10 +86888,10 @@ pool element *note 3.10(7/1): 2252, *note
13.11(11): 5195.
pool type *note 13.11(11): 5193.
pool-specific access type *note 3.10(7/1): 2249, *note 3.10(8): 2253.
Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(9/3): 5261.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(9/3): 5261.
Pos attribute *note 3.5.5(2): 1771.
position *note 13.5.1(4): 5068.
- used *note 13.5.1(3): 5065, *note P: 9828.
+ <used> *note 13.5.1(3): 5065, *note P: 9828.
Position attribute *note 13.5.2(2/2): 5081.
position number *note 3.5(1): 1583.
of an enumeration value *note 3.5.1(7): 1696.
@@ -86706,14 +86902,14 @@ positional component association *note 4.3.1(6):
2518.
positional discriminant association *note 3.7.1(4): 2009.
positional parameter association *note 6.4.1(2/3): 3474.
positional_array_aggregate *note 4.3.3(3/2): 2545.
- used *note 4.3.3(2): 2543, *note P: 9249.
+ <used> *note 4.3.3(2): 2543, *note P: 9249.
Positive *note 3.5.4(12): 1742.
-Positive subtype of Integer
- in Standard *note A.1(13): 5440.
-Positive_Count subtype of Count
- in Ada.Direct_IO *note A.8.4(4): 6327.
- in Ada.Streams.Stream_IO *note A.12.1(7): 6573.
- in Ada.Text_IO *note A.10.1(5): 6378.
+Positive <subtype of> Integer
+ <in> Standard *note A.1(13): 5440.
+Positive_Count <subtype of> Count
+ <in> Ada.Direct_IO *note A.8.4(4): 6327.
+ <in> Ada.Streams.Stream_IO *note A.12.1(7): 6573.
+ <in> Ada.Text_IO *note A.10.1(5): 6378.
possible interpretation *note 8.6(14): 3851.
for direct_names *note 8.3(24): 3768.
for selector_names *note 8.3(24): 3769.
@@ -86734,9 +86930,9 @@ potentially blocking operation *note 9.5.1(8): 4035.
Suspend_Until_True *note D.10(10): 7981.
potentially unevaluated expression *note 6.1.1(20/3): 3369.
potentially use-visible *note 8.4(8/3): 3785.
- [partial] *note 12.6(9.2/3): 4849.
+ [<partial>] *note 12.6(9.2/3): 4849.
Pound_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5634.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5634.
Pragma *note 2.8(1): 1258, *note 2.8(2): 1259, *note L(1): 8694, *note
N(27): 8930.
pragma argument *note 2.8(9): 1274.
@@ -86790,8 +86986,8 @@ pragma, representation *note 13.1(1/1): 4870.
Volatile *note J.15.8(9/3): 8618.
Volatile_Components *note J.15.8(9/3): 8622.
pragma_argument_association *note 2.8(3/3): 1263.
- used *note 2.8(2): 1261, *note 13.12(11/3): 5307, *note L(27.3/3):
-8825, *note P: 8999.
+ <used> *note 2.8(2): 1261, *note 13.12(11/3): 5307, *note
+L(27.3/3): 8825, *note P: 8999.
pragmas
All_Calls_Remote *note E.2.3(5): 8152, *note L(2): 8695.
Assert *note 11.4.2(3/2): 4589, *note L(2.1/2): 8698.
@@ -86871,7 +87067,7 @@ predecessor node
predefined environment *note A(1): 5432.
predefined exception *note 11.1(4): 4518.
predefined library unit
- See language-defined library units
+ <See> language-defined library units
predefined operation
of a type *note 3.2.3(1/2): 1428.
predefined operations
@@ -86882,11 +87078,11 @@ predefined operations
of an access type *note 3.10.2(35/2): 2323.
of an array type *note 3.6.2(15): 1962.
predefined operator *note 4.5(9): 2730.
- [partial] *note 3.2.1(9): 1396.
+ [<partial>] *note 3.2.1(9): 1396.
predefined type *note 3.2.1(10): 1397.
- See language-defined types
+ <See> language-defined types
predicate *note 4.5.8(3/3): 2914, *note N(27.2/3): 8932.
- used *note 4.5.8(1/3): 2909, *note P: 9332.
+ <used> *note 4.5.8(1/3): 2909, *note P: 9332.
predicate aspect *note 3.2.4(1/3): 1433.
predicate check
allocator *note 3.2.4(31/4): 1451.
@@ -86908,7 +87104,7 @@ L(25.2/2): 8810.
Preelaborate aspect *note 10.2.1(11/3): 4474.
Preelaborate pragma *note 10.2.1(3): 4463, *note L(26): 8813.
preelaborated *note 10.2.1(11/3): 4476.
- [partial] *note 10.2.1(11/3): 4472, *note E.2.1(9): 8132.
+ [<partial>] *note 10.2.1(11/3): 4472, *note E.2.1(9): 8132.
implementation requirements *note C.4(2): 7675.
preempt
a running task *note D.2.3(9/2): 7802.
@@ -86916,20 +87112,20 @@ preference
for root numeric operators and ranges *note 8.6(29): 3870.
for universal access equality operators *note 8.6(29.1/3): 3871.
preference control
- See requeue *note 9.5.4(1): 4118.
+ <See> requeue *note 9.5.4(1): 4118.
prefix *note 4.1(4): 2375.
of a prefixed view *note 4.1.3(9.2/3): 2427.
- used *note 4.1.1(2): 2395, *note 4.1.2(2): 2408, *note 4.1.3(2):
+ <used> *note 4.1.1(2): 2395, *note 4.1.2(2): 2408, *note 4.1.3(2):
2419, *note 4.1.4(2): 2435, *note 4.1.4(4): 2441, *note 4.1.6(10/3):
2469, *note 6.4(2): 3448, *note 6.4(3): 3452, *note P: 9228.
prefixed view *note 4.1.3(9.2/3): 2426.
prefixed view profile *note 6.3.1(24.1/2): 3442.
Prepend
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 6845.
- in Ada.Containers.Vectors *note A.18.2(44/2): 6767, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(22/2): 6845.
+ <in> Ada.Containers.Vectors *note A.18.2(44/2): 6767, *note
A.18.2(45/2): 6768.
Prepend_Child
- in Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7244.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(51/3): 7244.
prescribed result
for the evaluation of a complex arithmetic operation *note
G.1.1(42): 8284.
@@ -86937,23 +87133,23 @@ G.1.1(42): 8284.
G.1.2(35): 8311.
for the evaluation of an elementary function *note A.5.1(37): 6145.
Previous
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 6861,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(38/2): 6861,
*note A.18.3(40/2): 6863.
- in Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7002, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(36/2): 7002, *note
A.18.6(37/2): 7003.
- in Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7157, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(47/2): 7157, *note
A.18.9(48/2): 7158.
- in Ada.Containers.Vectors *note A.18.2(65/2): 6788, *note
+ <in> Ada.Containers.Vectors *note A.18.2(65/2): 6788, *note
A.18.2(66/2): 6789.
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3215.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3215.
Previous_Sibling
- in Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7258, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(65/3): 7258, *note
A.18.10(67/3): 7260.
primary *note 4.4(7/3): 2709.
- used *note 4.4(6): 2708, *note P: 9308.
+ <used> *note 4.4(6): 2708, *note P: 9308.
primitive function *note A.5.3(17): 6203.
primitive operation
- [partial] *note 3.2(1): 1329.
+ [<partial>] *note 3.2(1): 1329.
primitive operations *note N(28): 8933.
of a type *note 3.2.3(1/2): 1429.
primitive operator
@@ -86968,8 +87164,8 @@ priority inheritance *note D.1(15): 7763.
priority inversion *note D.2.3(11/2): 7803.
priority of an entry call *note D.4(9): 7864.
Priority pragma *note J.15.11(2/3): 8635, *note L(27.1/3): 8816.
-Priority subtype of Any_Priority
- in System *note 13.7(16): 5128.
+Priority <subtype of> Any_Priority
+ <in> System *note 13.7(16): 5128.
Priority_Queuing queuing policy *note D.4(8): 7863.
Priority_Specific_Dispatching pragma *note D.2.2(3.2/2): 7788, *note
L(27.2/2): 8818.
@@ -86978,7 +87174,7 @@ private descendant
of a library unit *note 10.1.1(12): 4364.
private extension *note 3.2(4.1/2): 1345, *note 3.9(2.1/2): 2091,
*note 3.9.1(1/2): 2139, *note N(29/2): 8934.
- [partial] *note 7.3(14): 3617, *note 12.5.1(5/3): 4805.
+ [<partial>] *note 7.3(14): 3617, *note 12.5.1(5/3): 4805.
private library unit *note 10.1.1(12): 4361.
private operations *note 7.3.1(1): 3620.
private part *note 8.2(5): 3724.
@@ -86986,21 +87182,23 @@ private part *note 8.2(5): 3724.
of a protected unit *note 9.4(11/2): 3990.
of a task unit *note 9.1(9): 3918.
private type *note 3.2(4.1/2): 1344, *note N(30/2): 8935.
- [partial] *note 7.3(14): 3616.
+ [<partial>] *note 7.3(14): 3616.
private types and private extensions *note 7.3(1): 3595.
private_extension_declaration *note 7.3(3/3): 3604.
- used *note 3.2.1(2): 1372, *note P: 9026.
+ <used> *note 3.2.1(2): 1372, *note P: 9026.
private_type_declaration *note 7.3(2/3): 3600.
- used *note 3.2.1(2): 1371, *note P: 9025.
+ <used> *note 3.2.1(2): 1371, *note P: 9025.
procedure *note 6(1): 3276, *note N(30.1/2): 8936.
null *note 6.7(3/3): 3549.
procedure instance *note 12.3(13): 4729.
procedure_call_statement *note 6.4(2): 3446.
- used *note 5.1(4/2): 3126, *note 9.7.2(3.1/2): 4248, *note P: 9638.
+ <used> *note 5.1(4/2): 3126, *note 9.7.2(3.1/2): 4248, *note P:
+9638.
procedure_or_entry_call *note 9.7.2(3.1/2): 4247.
- used *note 9.7.2(3/2): 4245, *note 9.7.4(4/2): 4262, *note P: 9646.
+ <used> *note 9.7.2(3/2): 4245, *note 9.7.4(4/2): 4262, *note P:
+9646.
procedure_specification *note 6.1(4.1/2): 3288.
- used *note 6.1(4/2): 3286, *note 6.7(2/3): 3545, *note P: 9472.
+ <used> *note 6.1(4/2): 3286, *note 6.7(2/3): 3545, *note P: 9472.
processing node *note E(2): 8095.
profile *note 6.1(22): 3335.
associated with a dereference *note 4.1(10): 2385.
@@ -87018,8 +87216,8 @@ progenitor type *note 3.9.4(9/2): 2220.
program *note 10.2(1): 4441, *note N(31): 8938.
program execution *note 10.2(1): 4442.
program library
- See library *note 10(2): 4314.
- See library *note 10.1.4(9): 4418.
+ <See> library *note 10(2): 4314.
+ <See> library *note 10.1.4(9): 4418.
Program unit *note 10.1(1): 4317, *note N(32): 8939.
program unit pragma *note 10.1.5(2): 4419.
Inline *note J.15.1(1/3): 8530.
@@ -87048,7 +87246,7 @@ B.3.3(22/2): 7542, *note C.3.1(10/3): 7650, *note
C.3.1(11/3): 7654,
*note D.7(7.1/3): 7884, *note D.7(10.5/3): 7899, *note D.7(19.1/2):
7937, *note D.10(10): 7983, *note D.11(8): 7996, *note E.1(10/2): 8111,
*note E.3(6): 8177, *note E.4(18/1): 8194, *note J.7.1(7): 8513.
- in Standard *note A.1(46): 5452.
+ <in> Standard *note A.1(46): 5452.
prohibited
tampering with a holder *note A.18.18(35/4): 7303.
tampering with a list *note A.18.3(69.1/4): 6877.
@@ -87060,7 +87258,7 @@ propagate *note 11.4(1): 4555.
an exception occurrence by an execution, to a dynamically enclosing
execution *note 11.4(6): 4560.
proper_body *note 3.11(6): 2339.
- used *note 3.11(5): 2337, *note 10.1.3(7): 4407, *note P: 9692.
+ <used> *note 3.11(5): 2337, *note 10.1.3(7): 4407, *note P: 9692.
protected action *note 9.5.1(4/4): 4029.
complete *note 9.5.1(6): 4032.
start *note 9.5.1(5/4): 4030.
@@ -87077,53 +87275,53 @@ protected tagged type *note 3.9.4(6/2): 2218.
protected type *note N(33/2): 8940.
protected unit *note 9.4(1): 3952.
protected_body *note 9.4(7/3): 3977.
- used *note 3.11(6): 2343, *note P: 9195.
+ <used> *note 3.11(6): 2343, *note P: 9195.
protected_body_stub *note 10.1.3(6/3): 4402.
- used *note 10.1.3(2): 4391, *note P: 9681.
+ <used> *note 10.1.3(2): 4391, *note P: 9681.
protected_definition *note 9.4(4): 3966.
- used *note 9.4(2/3): 3960, *note 9.4(3/3): 3965, *note P: 9569.
+ <used> *note 9.4(2/3): 3960, *note 9.4(3/3): 3965, *note P: 9569.
protected_element_declaration *note 9.4(6): 3974.
- used *note 9.4(4): 3968, *note P: 9571.
+ <used> *note 9.4(4): 3968, *note P: 9571.
protected_operation_declaration *note 9.4(5/1): 3970.
- used *note 9.4(4): 3967, *note 9.4(6): 3975, *note P: 9570.
+ <used> *note 9.4(4): 3967, *note 9.4(6): 3975, *note P: 9570.
protected_operation_item *note 9.4(8/4): 3982.
- used *note 9.4(7/3): 3980, *note P: 9580.
+ <used> *note 9.4(7/3): 3980, *note P: 9580.
protected_type_declaration *note 9.4(2/3): 3955.
- used *note 3.2.1(3/3): 1379, *note P: 9032.
+ <used> *note 3.2.1(3/3): 1379, *note P: 9032.
ptrdiff_t
- in Interfaces.C *note B.3(12): 7446.
+ <in> Interfaces.C *note B.3(12): 7446.
PU1
- in Ada.Characters.Latin_1 *note A.3.3(18): 5615.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5615.
PU2
- in Ada.Characters.Latin_1 *note A.3.3(18): 5616.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5616.
public declaration of a library unit *note 10.1.1(12): 4360.
public descendant
of a library unit *note 10.1.1(12): 4363.
public library unit *note 10.1.1(12): 4359.
punctuation_connector *note 2.1(10.2/2): 1140.
- used *note 2.3(3.1/3): 1202, *note P: 8974.
+ <used> *note 2.3(3.1/3): 1202, *note P: 8974.
pure *note 10.2.1(15.1/3): 4484.
Pure aspect *note 10.2.1(17/3): 4487.
Pure pragma *note 10.2.1(14): 4480, *note L(28): 8827.
Put
- in Ada.Text_IO *note A.10.1(42): 6446, *note A.10.1(48): 6456,
+ <in> Ada.Text_IO *note A.10.1(42): 6446, *note A.10.1(48): 6456,
*note A.10.1(55): 6471, *note A.10.1(60): 6480, *note A.10.1(66): 6488,
*note A.10.1(67): 6490, *note A.10.1(71): 6498, *note A.10.1(72): 6500,
*note A.10.1(76): 6508, *note A.10.1(77): 6510, *note A.10.1(82): 6517,
*note A.10.1(83): 6519.
- in Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 6538, *note
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(4/2): 6538, *note
A.10.11(5/2): 6539.
- in Ada.Text_IO.Complex_IO *note G.1.3(7): 8321, *note G.1.3(8):
+ <in> Ada.Text_IO.Complex_IO *note G.1.3(7): 8321, *note G.1.3(8):
8323.
- in Ada.Text_IO.Editing *note F.3.3(14): 8250, *note F.3.3(15):
+ <in> Ada.Text_IO.Editing *note F.3.3(14): 8250, *note F.3.3(15):
8251, *note F.3.3(16): 8252.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 6547, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(4/2): 6547, *note
A.10.12(5/2): 6548.
Put_Line
- in Ada.Text_IO *note A.10.1(50): 6461.
- in Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 6540, *note
+ <in> Ada.Text_IO *note A.10.1(50): 6461.
+ <in> Ada.Text_IO.Bounded_IO *note A.10.11(6/2): 6540, *note
A.10.11(7/2): 6541.
- in Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 6549, *note
+ <in> Ada.Text_IO.Unbounded_IO *note A.10.12(6/2): 6549, *note
A.10.12(7/2): 6550.
@@ -87136,44 +87334,45 @@ Q
qualified_expression *note 4.7(2): 3025.
- used *note 4.1(2/3): 2369, *note 4.8(2/3): 3047, *note 13.8(2):
+ <used> *note 4.1(2/3): 2369, *note 4.8(2/3): 3047, *note 13.8(2):
5150, *note P: 9834.
quantified expressions *note 4.5.8(5/3): 2917.
quantified_expression *note 4.5.8(1/3): 2906.
- used *note 4.4(7/3): 2717, *note P: 9316.
+ <used> *note 4.4(7/3): 2717, *note P: 9316.
quantifier *note 4.5.8(2/3): 2913.
- used *note 4.5.8(1/3): 2910, *note P: 9333.
+ <used> *note 4.5.8(1/3): 2910, *note P: 9333.
Query_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 6834.
- in Ada.Containers.Hashed_Maps *note A.18.5(16/2): 6923.
- in Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7056.
- in Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7292.
- in Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7219.
- in Ada.Containers.Ordered_Maps *note A.18.6(15/2): 6974.
- in Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7127.
- in Ada.Containers.Vectors *note A.18.2(31/2): 6747, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(16/2): 6834.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(16/2): 6923.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(17/2): 7056.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(14/3): 7292.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(26/3): 7219.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(15/2): 6974.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(16/2): 7127.
+ <in> Ada.Containers.Vectors *note A.18.2(31/2): 6747, *note
A.18.2(32/2): 6748.
Question
- in Ada.Characters.Latin_1 *note A.3.3(10): 5554.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5554.
Queue
- in Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3): 7363.
- in Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
+ <in> Ada.Containers.Bounded_Priority_Queues *note A.18.31(4/3):
+7363.
+ <in> Ada.Containers.Bounded_Synchronized_Queues *note A.18.29(4/3):
7350.
- in Ada.Containers.Synchronized_Queue_Interfaces *note A.18.27(4/3):
-7337.
- in Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
+ <in> Ada.Containers.Synchronized_Queue_Interfaces *note
+A.18.27(4/3): 7337.
+ <in> Ada.Containers.Unbounded_Priority_Queues *note A.18.30(4/3):
7356.
- in Ada.Containers.Unbounded_Synchronized_Queues *note A.18.28(4/3):
-7344.
+ <in> Ada.Containers.Unbounded_Synchronized_Queues *note
+A.18.28(4/3): 7344.
queuing policy *note D.4(1/3): 7851, *note D.4(6): 7859.
FIFO_Queuing *note D.4(7/2): 7860.
Priority_Queuing *note D.4(8): 7862.
Queuing_Policy pragma *note D.4(3): 7853, *note L(29): 8830.
Quotation
- in Ada.Characters.Latin_1 *note A.3.3(8): 5534.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5534.
quotation mark *note 2.1(15/3): 1151.
quoted string
- See string_literal *note 2.6(1): 1249.
+ <See> string_literal *note 2.6(1): 1249.
@@ -87190,27 +87389,27 @@ raise
an exception *note N(18): 8907.
an exception occurrence *note 11.4(3): 4559.
Raise_Exception
- in Ada.Exceptions *note 11.4.1(4/3): 4573.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 4573.
raise_expression *note 11.3(2.1/4): 4547.
- used *note 4.4(3/4): 2687, *note P: 9292.
+ <used> *note 4.4(3/4): 2687, *note P: 9292.
raise_statement *note 11.3(2/2): 4544.
- used *note 5.1(4/2): 3132, *note P: 9367.
+ <used> *note 5.1(4/2): 3132, *note P: 9367.
Random
- in Ada.Numerics.Discrete_Random *note A.5.2(20): 6162.
- in Ada.Numerics.Float_Random *note A.5.2(8): 6150.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(20): 6162.
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6150.
random number *note A.5.2(1): 6146.
range *note 3.5(3): 1587, *note 3.5(4): 1591.
of a scalar subtype *note 3.5(7): 1604.
- used *note 3.5(2): 1586, *note 3.6(6): 1902, *note 3.6.1(3): 1937,
-*note 3.8.1(5/3): 2071, *note 4.4(3.2/4): 2693, *note P: 9076.
+ <used> *note 3.5(2): 1586, *note 3.6(6): 1902, *note 3.6.1(3):
+1937, *note 3.8.1(5/3): 2071, *note 4.4(3.2/4): 2693, *note P: 9076.
Range attribute *note 3.5(14): 1616, *note 3.6.2(7): 1955.
Range(N) attribute *note 3.6.2(8): 1957.
range_attribute_designator *note 4.1.4(5): 2443.
- used *note 4.1.4(4): 2442, *note P: 9229.
+ <used> *note 4.1.4(4): 2442, *note P: 9229.
range_attribute_reference *note 4.1.4(4): 2440.
- used *note 3.5(3): 1588, *note P: 9077.
+ <used> *note 3.5(3): 1588, *note P: 9077.
Range_Check *note 11.5(17): 4635.
- [partial] *note 3.2.2(11): 1423, *note 3.5(24): 1629, *note
+ [<partial>] *note 3.2.2(11): 1423, *note 3.5(24): 1629, *note
3.5(27): 1636, *note 3.5(39.12/3): 1663, *note 3.5(39.4/3): 1657, *note
3.5(39.5/3): 1660, *note 3.5(43/3): 1669, *note 3.5(55/3): 1675, *note
3.5.5(7): 1776, *note 3.5.9(19/4): 1861, *note 4.2(11): 2489, *note
@@ -87224,27 +87423,27 @@ K.2(114): 8666, *note K.2(122): 8669, *note K.2(184):
8675, *note
K.2(220): 8682, *note K.2(241): 8685, *note K.2(41): 8656, *note
K.2(47): 8659.
range_constraint *note 3.5(2): 1585.
- used *note 3.2.2(6): 1414, *note 3.5.9(5/4): 1841, *note J.3(2/4):
-8497, *note P: 9050.
+ <used> *note 3.2.2(6): 1414, *note 3.5.9(5/4): 1841, *note
+J.3(2/4): 8497, *note P: 9050.
Ravenscar *note D.13(1/3): 7998.
RCI
generic *note E.2.3(7/3): 8160.
library unit *note E.2.3(7/3): 8158.
package *note E.2.3(7/3): 8159.
Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8389,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(7/2): 8389,
*note G.3.2(27/2): 8402.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8263.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(6): 8263.
re-raise statement *note 11.3(3/4): 4550.
read
the value of an object *note 3.3(14): 1463.
- in Ada.Direct_IO *note A.8.4(12): 6339.
- in Ada.Sequential_IO *note A.8.1(12): 6312.
- in Ada.Storage_IO *note A.9(6): 6358.
- in Ada.Streams *note 13.13.1(5): 5340.
- in Ada.Streams.Stream_IO *note A.12.1(15): 6586, *note A.12.1(16):
-6587.
- in System.RPC *note E.5(7): 8208.
+ <in> Ada.Direct_IO *note A.8.4(12): 6339.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6312.
+ <in> Ada.Storage_IO *note A.9(6): 6358.
+ <in> Ada.Streams *note 13.13.1(5): 5340.
+ <in> Ada.Streams.Stream_IO *note A.12.1(15): 6586, *note
+A.12.1(16): 6587.
+ <in> System.RPC *note E.5(7): 8208.
Read aspect *note 13.13.2(38/4): 5379.
Read attribute *note 13.13.2(6): 5352, *note 13.13.2(14): 5356.
Read clause *note 13.3(7/2): 4969, *note 13.13.2(38/4): 5374.
@@ -87254,25 +87453,25 @@ ready
ready queue *note D.2.1(5/2): 7776.
ready task *note D.2.1(5/2): 7779.
Real
- in Interfaces.Fortran *note B.5(6): 7601.
+ <in> Interfaces.Fortran *note B.5(6): 7601.
real literal *note 2.4(1): 1205.
real literals *note 3.5.6(4): 1790.
real time *note D.8(18): 7963.
real type *note 3.2(3): 1342, *note 3.5.6(1): 1784, *note N(34): 8941.
real-time systems *note C(1): 7619, *note D(1): 7755.
Real_Arrays
- child of Ada.Numerics *note G.3.1(31/2): 8382.
+ <child of> Ada.Numerics *note G.3.1(31/2): 8382.
Real_Matrix
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8372.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8372.
real_range_specification *note 3.5.7(3): 1798.
- used *note 3.5.7(2): 1797, *note 3.5.9(3): 1834, *note 3.5.9(4):
+ <used> *note 3.5.7(2): 1797, *note 3.5.9(3): 1834, *note 3.5.9(4):
1838, *note P: 9093.
Real_Time
- child of Ada *note D.8(3): 7941.
+ <child of> Ada *note D.8(3): 7941.
real_type_definition *note 3.5.6(2): 1785.
- used *note 3.2.1(4/2): 1383, *note P: 9035.
+ <used> *note 3.2.1(4/2): 1383, *note P: 9035.
Real_Vector
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8371.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(4/2): 8371.
receiving stub *note E.4(10): 8187.
reclamation of storage *note 13.11.2(1): 5226.
recommended level of support *note 13.1(20/3): 4908.
@@ -87296,66 +87495,66 @@ N(35): 8942.
Record layout aspect *note 13.5(1): 5054.
record type *note 3.8(1): 2022, *note N(36): 8943.
record_aggregate *note 4.3.1(2): 2505.
- used *note 4.3(2): 2495, *note P: 9234.
+ <used> *note 4.3(2): 2495, *note P: 9234.
record_component_association *note 4.3.1(4/2): 2510.
- used *note 4.3.1(3): 2508, *note P: 9238.
+ <used> *note 4.3.1(3): 2508, *note P: 9238.
record_component_association_list *note 4.3.1(3): 2507.
- used *note 4.3.1(2): 2506, *note 4.3.2(2): 2529, *note P: 9246.
+ <used> *note 4.3.1(2): 2506, *note 4.3.2(2): 2529, *note P: 9246.
record_definition *note 3.8(3): 2026.
- used *note 3.8(2): 2025, *note 3.9.1(2): 2142, *note P: 9139.
+ <used> *note 3.8(2): 2025, *note 3.9.1(2): 2142, *note P: 9139.
record_extension_part *note 3.9.1(2): 2141.
- used *note 3.4(2/2): 1536, *note P: 9075.
+ <used> *note 3.4(2/2): 1536, *note P: 9075.
record_representation_clause *note 13.5.1(2): 5059.
- used *note 13.1(2/1): 4875, *note P: 9801.
+ <used> *note 13.1(2/1): 4875, *note P: 9801.
record_type_definition *note 3.8(2): 2024.
- used *note 3.2.1(4/2): 1385, *note P: 9037.
+ <used> *note 3.2.1(4/2): 1385, *note P: 9037.
reentrant *note A(3/4): 5433.
reference
dangling *note 13.11.2(15.1/4): 5240.
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 6838.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 6927, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.4/3): 6838.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.4/3): 6927, *note
A.18.5(17.6/3): 6929.
- in Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7297.
- in Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7224.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 6978, *note
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(19/3): 7297.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(31/3): 7224.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.4/3): 6978, *note
A.18.6(16.6/3): 6980.
- in Ada.Containers.Vectors *note A.18.2(34.4/3): 6753, *note
+ <in> Ada.Containers.Vectors *note A.18.2(34.4/3): 6753, *note
A.18.2(34.6/3): 6755.
- in Ada.Interrupts *note C.3.2(10): 7668.
- in Ada.Task_Attributes *note C.7.2(5): 7731.
+ <in> Ada.Interrupts *note C.3.2(10): 7668.
+ <in> Ada.Task_Attributes *note C.7.2(5): 7731.
reference discriminant *note 4.1.5(3/3): 2454.
reference object *note 4.1.5(3/3): 2453.
reference parameter passing *note 6.2(2): 3392.
reference type *note 4.1.5(3/3): 2452, *note N(36.1/3): 8944.
Reference_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7097, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.2/3): 7097, *note
A.18.8(58.4/3): 7099.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7178, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.2/3): 7178, *note
A.18.9(73.4/3): 7180.
Reference_Type
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 6836.
- in Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 6925.
- in Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7096.
- in Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7295.
- in Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7222.
- in Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 6976.
- in Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7177.
- in Ada.Containers.Vectors *note A.18.2(34.2/3): 6751.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17.2/3): 6836.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17.2/3): 6925.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58.1/3): 7096.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(17/3): 7295.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(29/3): 7222.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16.2/3): 6976.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73.1/3): 7177.
+ <in> Ada.Containers.Vectors *note A.18.2(34.2/3): 6751.
references *note 1.2(1/3): 1086.
Registered_Trade_Mark_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5645.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5645.
Reinitialize
- in Ada.Task_Attributes *note C.7.2(6): 7733.
+ <in> Ada.Task_Attributes *note C.7.2(6): 7733.
relation *note 4.4(3/4): 2681.
- used *note 4.4(2): 2656, *note P: 9266.
+ <used> *note 4.4(2): 2656, *note P: 9266.
relational operator *note 4.5.2(1): 2758.
relational_operator *note 4.5(3): 2725.
- used *note 4.4(2.2/3): 2679, *note 4.4(3/4): 2683, *note P: 9285.
+ <used> *note 4.4(2.2/3): 2679, *note 4.4(3/4): 2683, *note P: 9285.
Relative_Deadline aspect *note D.2.6(9.2/3): 7828.
Relative_Deadline pragma *note J.15.12(2/3): 8641, *note L(29.2/3):
8833.
Relative_Name
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(13/3):
6696.
relaxed mode *note G.2(1): 8331.
release
@@ -87380,46 +87579,47 @@ Remote_Call_Interface pragma *note E.2.3(3): 8150,
*note L(30): 8835.
Remote_Types aspect *note E.2.2(4/3): 8143.
Remote_Types pragma *note E.2.2(3): 8139, *note L(31): 8838.
Remove_Task
- in Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8036.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(8/2): 8036.
Rename
- in Ada.Directories *note A.16(12/2): 6643.
+ <in> Ada.Directories *note A.16(12/2): 6643.
renamed entity *note 8.5(3): 3797.
renamed view *note 8.5(3): 3796.
renaming *note N(36.2/2): 8945.
renaming-as-body *note 8.5.4(1/3): 3820.
renaming-as-declaration *note 8.5.4(1/3): 3821.
renaming_declaration *note 8.5(2): 3789.
- used *note 3.1(3/3): 1302, *note P: 9018.
+ <used> *note 3.1(3/3): 1302, *note P: 9018.
rendezvous *note 9.5.2(25): 4087.
Replace
- in Ada.Containers.Hashed_Maps *note A.18.5(23/2): 6937.
- in Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7064, *note
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(23/2): 6937.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(22/2): 7064, *note
A.18.8(53/2): 7090.
- in Ada.Containers.Ordered_Maps *note A.18.6(22/2): 6988.
- in Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7135, *note
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(22/2): 6988.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(21/2): 7135, *note
A.18.9(66/2): 7169.
Replace_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 6833.
- in Ada.Containers.Hashed_Maps *note A.18.5(15/2): 6922.
- in Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7055.
- in Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7291.
- in Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7218.
- in Ada.Containers.Ordered_Maps *note A.18.6(14/2): 6973.
- in Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7126.
- in Ada.Containers.Vectors *note A.18.2(29/2): 6745, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(15/2): 6833.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(15/2): 6922.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(16/2): 7055.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(13/3): 7291.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(25/3): 7218.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(14/2): 6973.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(15/2): 7126.
+ <in> Ada.Containers.Vectors *note A.18.2(29/2): 6745, *note
A.18.2(30/2): 6746.
- in Ada.Strings.Bounded *note A.4.4(27): 5862.
- in Ada.Strings.Unbounded *note A.4.5(21): 5916.
+ <in> Ada.Strings.Bounded *note A.4.4(27): 5862.
+ <in> Ada.Strings.Unbounded *note A.4.5(21): 5916.
Replace_Slice
- in Ada.Strings.Bounded *note A.4.4(58): 5883, *note A.4.4(59):
+ <in> Ada.Strings.Bounded *note A.4.4(58): 5883, *note A.4.4(59):
5884.
- in Ada.Strings.Fixed *note A.4.3(23): 5826, *note A.4.3(24): 5827.
- in Ada.Strings.Unbounded *note A.4.5(53): 5937, *note A.4.5(54):
+ <in> Ada.Strings.Fixed *note A.4.3(23): 5826, *note A.4.3(24):
+5827.
+ <in> Ada.Strings.Unbounded *note A.4.5(53): 5937, *note A.4.5(54):
5938.
Replenish
- in Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8040.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(9/2): 8040.
Replicate
- in Ada.Strings.Bounded *note A.4.4(78): 5899, *note A.4.4(79):
+ <in> Ada.Strings.Bounded *note A.4.4(78): 5899, *note A.4.4(79):
5900, *note A.4.4(80): 5901.
representation
change of *note 13.6(1/3): 5104.
@@ -87456,7 +87656,7 @@ representation-oriented attributes
of a fixed point subtype *note A.5.4(1): 6271.
of a floating point subtype *note A.5.3(1): 6180.
representation_clause
- See aspect_clause *note 13.1(4/1): 4882.
+ <See> aspect_clause *note 13.1(4/1): 4882.
represented in canonical form *note A.5.3(10): 6194.
requested decimal precision
of a floating point type *note 3.5.7(4): 1801.
@@ -87464,7 +87664,7 @@ requeue *note 9.5.4(1): 4117.
requeue target *note 9.5.4(3/3): 4122.
requeue-with-abort *note 9.5.4(13): 4129.
requeue_statement *note 9.5.4(2/3): 4120.
- used *note 5.1(4/2): 3129, *note P: 9364.
+ <used> *note 5.1(4/2): 3129, *note P: 9364.
require overriding *note 3.9.3(6/4): 2193.
requires a completion *note 3.11.1(1/3): 2353, *note 3.11.1(6/3):
2357.
@@ -87484,41 +87684,41 @@ requires a completion *note 3.11.1(1/3): 2353,
*note 3.11.1(6/3):
task_declaration *note 9.1(9.3/2): 3922.
requires late initialization *note 3.3.1(8.1/2): 1503.
requires overriding
- [partial] *note 6.1.1(16/3): 3363.
+ [<partial>] *note 6.1.1(16/3): 3363.
Reraise_Occurrence
- in Ada.Exceptions *note 11.4.1(4/3): 4575.
+ <in> Ada.Exceptions *note 11.4.1(4/3): 4575.
Reserve_Capacity
- in Ada.Containers.Hashed_Maps *note A.18.5(9/2): 6916.
- in Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7050.
- in Ada.Containers.Vectors *note A.18.2(20/2): 6736.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(9/2): 6916.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(11/2): 7050.
+ <in> Ada.Containers.Vectors *note A.18.2(20/2): 6736.
reserved interrupt *note C.3(2): 7637.
reserved word *note 2.9(2/3): 1289.
Reserved_128
- in Ada.Characters.Latin_1 *note A.3.3(17): 5598.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5598.
Reserved_129
- in Ada.Characters.Latin_1 *note A.3.3(17): 5599.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5599.
Reserved_132
- in Ada.Characters.Latin_1 *note A.3.3(17): 5602.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5602.
Reserved_153
- in Ada.Characters.Latin_1 *note A.3.3(19): 5623.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5623.
Reserved_Check
- [partial] *note C.3.1(10/3): 7648.
+ [<partial>] *note C.3.1(10/3): 7648.
Reset
- in Ada.Direct_IO *note A.8.4(8): 6332.
- in Ada.Numerics.Discrete_Random *note A.5.2(21): 6164, *note
+ <in> Ada.Direct_IO *note A.8.4(8): 6332.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(21): 6164, *note
A.5.2(24): 6167.
- in Ada.Numerics.Float_Random *note A.5.2(9): 6151, *note A.5.2(12):
-6155.
- in Ada.Sequential_IO *note A.8.1(8): 6305.
- in Ada.Streams.Stream_IO *note A.12.1(10): 6579.
- in Ada.Text_IO *note A.10.1(11): 6387.
+ <in> Ada.Numerics.Float_Random *note A.5.2(9): 6151, *note
+A.5.2(12): 6155.
+ <in> Ada.Sequential_IO *note A.8.1(8): 6305.
+ <in> Ada.Streams.Stream_IO *note A.12.1(10): 6579.
+ <in> Ada.Text_IO *note A.10.1(11): 6387.
resolution rules *note 1.1.2(26/3): 1021.
resolve
overload resolution *note 8.6(14): 3853.
restriction *note 13.12(4/2): 5294.
- used *note 13.12(3): 5293, *note L(32): 8842.
+ <used> *note 13.12(3): 5293, *note L(32): 8842.
restriction_parameter_argument *note 13.12(4.1/2): 5298.
- used *note 13.12(4/2): 5297, *note P: 9838.
+ <used> *note 13.12(4/2): 5297, *note P: 9838.
restrictions
Immediate_Reclamation *note H.4(10): 8458.
Max_Asynchronous_Select_Nesting *note D.7(18/1): 7925.
@@ -87594,65 +87794,65 @@ return object
simple_return_statement *note 6.5(6/2): 3523.
return statement *note 6.5(1/2): 3496.
return_subtype_indication *note 6.5(2.3/2): 3506.
- used *note 6.5(2.1/3): 3501, *note P: 9465.
+ <used> *note 6.5(2.1/3): 3501, *note P: 9465.
reverse iterator *note 5.5.2(4/3): 3249.
Reverse_Elements
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 6850.
- in Ada.Containers.Vectors *note A.18.2(54/2): 6777.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(27/2): 6850.
+ <in> Ada.Containers.Vectors *note A.18.2(54/2): 6777.
Reverse_Find
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 6865.
- in Ada.Containers.Vectors *note A.18.2(70/2): 6793.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(42/2): 6865.
+ <in> Ada.Containers.Vectors *note A.18.2(70/2): 6793.
Reverse_Find_Index
- in Ada.Containers.Vectors *note A.18.2(69/2): 6792.
+ <in> Ada.Containers.Vectors *note A.18.2(69/2): 6792.
Reverse_Iterate
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 6868.
- in Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7010.
- in Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7164.
- in Ada.Containers.Vectors *note A.18.2(74/2): 6796.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(46/2): 6868.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(51/2): 7010.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(61/2): 7164.
+ <in> Ada.Containers.Vectors *note A.18.2(74/2): 6796.
Reverse_Iterate_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7262.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(69/3): 7262.
Reverse_Solidus
- in Ada.Characters.Latin_1 *note A.3.3(12): 5557.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5557.
reversible iterable container object *note 5.5.1(11/3): 3232.
reversible iterable container type *note 5.5.1(11/3): 3230.
reversible iterator object *note 5.5.1(6/3): 3219.
reversible iterator type *note 5.5.1(6/3): 3217.
Reversible_Iterator
- in Ada.Iterator_Interfaces *note 5.5.1(4/3): 3213.
+ <in> Ada.Iterator_Interfaces *note 5.5.1(4/3): 3213.
Reviewable pragma *note H.3.1(3): 8437, *note L(33): 8845.
RI
- in Ada.Characters.Latin_1 *note A.3.3(17): 5611.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5611.
right parenthesis *note 2.1(15/3): 1157.
Right_Angle_Quotation
- in Ada.Characters.Latin_1 *note A.3.3(22): 5660.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5660.
Right_Curly_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(14): 5590.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5590.
Right_Parenthesis
- in Ada.Characters.Latin_1 *note A.3.3(8): 5541.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5541.
Right_Square_Bracket
- in Ada.Characters.Latin_1 *note A.3.3(12): 5558.
+ <in> Ada.Characters.Latin_1 *note A.3.3(12): 5558.
Ring_Above
- in Ada.Characters.Latin_1 *note A.3.3(22): 5648.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5648.
root
of a tree *note A.18.10(2/4): 7190.
- in Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7215.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(22/3): 7215.
root library unit *note 10.1.1(10): 4355.
root node
of a tree *note A.18.10(2/4): 7191.
root type
of a class *note 3.4.1(2/2): 1563.
root_integer *note 3.5.4(14): 1743.
- [partial] *note 3.4.1(8): 1573.
+ [<partial>] *note 3.4.1(8): 1573.
root_real *note 3.5.6(3): 1788.
- [partial] *note 3.4.1(8): 1574.
+ [<partial>] *note 3.4.1(8): 1574.
Root_Storage_Pool
- in System.Storage_Pools *note 13.11(6/2): 5188.
+ <in> System.Storage_Pools *note 13.11(6/2): 5188.
Root_Storage_Pool_With_Subpools
- in System.Storage_Pools.Subpools *note 13.11.4(4/3): 5257.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(4/3): 5257.
Root_Stream_Type
- in Ada.Streams *note 13.13.1(3/2): 5335.
+ <in> Ada.Streams *note 13.13.1(3/2): 5335.
Root_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(5/3): 5258.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(5/3): 5258.
rooted at a type *note 3.4.1(2/2): 1564.
roots the subtree *note A.18.10(3/4): 7195.
rotate *note B.2(9): 7429.
@@ -87660,27 +87860,27 @@ Rotate_Left *note B.2(6): 7424.
Rotate_Right *note B.2(6): 7425.
Round attribute *note 3.5.10(12): 1883.
Round_Robin
- child of Ada.Dispatching *note D.2.5(4/2): 7813.
+ <child of> Ada.Dispatching *note D.2.5(4/2): 7813.
Round_Robin_Within_Priorities task dispatching policy *note
D.2.5(2/2): 7812.
Rounding attribute *note A.5.3(36): 6223.
RPC
- child of System *note E.5(3): 8204.
+ <child of> System *note E.5(3): 8204.
RPC-receiver *note E.5(21): 8215.
RPC_Receiver
- in System.RPC *note E.5(11): 8212.
+ <in> System.RPC *note E.5(11): 8212.
RS
- in Ada.Characters.Latin_1 *note A.3.3(6): 5530.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5530.
run-time check
- See language-defined check *note 11.5(2/3): 4613.
+ <See> language-defined check *note 11.5(2/3): 4613.
run-time error *note 1.1.2(30): 1037, *note 1.1.5(6): 1076, *note
11.5(2/3): 4614, *note 11.6(1/3): 4650.
run-time polymorphism *note 3.9.2(1/2): 2152.
run-time semantics *note 1.1.2(30): 1036.
run-time type
- See tag *note 3.9(3): 2096.
+ <See> tag *note 3.9(3): 2096.
running a program
- See program execution *note 10.2(1): 4443.
+ <See> program execution *note 10.2(1): 4443.
running task *note D.2.1(6/2): 7782.
runtime name text
entity with *note C.5(1.1/4): 7678.
@@ -87708,26 +87908,26 @@ satisfies
satisfies the predicates
of a subtype *note 3.2.4(29.2/4): 1447.
Saturday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4184.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4184.
Save
- in Ada.Numerics.Discrete_Random *note A.5.2(24): 6166.
- in Ada.Numerics.Float_Random *note A.5.2(12): 6154.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(24): 6166.
+ <in> Ada.Numerics.Float_Random *note A.5.2(12): 6154.
Save_Occurrence
- in Ada.Exceptions *note 11.4.1(6/2): 4582.
+ <in> Ada.Exceptions *note 11.4.1(6/2): 4582.
scalar type *note 3.2(3): 1339, *note 3.5(1): 1581, *note N(37): 8946.
scalar_constraint *note 3.2.2(6): 1413.
- used *note 3.2.2(5): 1411, *note P: 9048.
+ <used> *note 3.2.2(5): 1411, *note P: 9048.
scale
of a decimal fixed point subtype *note 3.5.10(11): 1881, *note
K.2(216): 8680.
Scale attribute *note 3.5.10(11): 1880.
Scaling attribute *note A.5.3(27): 6214.
SCHAR_MAX
- in Interfaces.C *note B.3(6): 7435.
+ <in> Interfaces.C *note B.3(6): 7435.
SCHAR_MIN
- in Interfaces.C *note B.3(6): 7434.
+ <in> Interfaces.C *note B.3(6): 7434.
SCI
- in Ada.Characters.Latin_1 *note A.3.3(19): 5624.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5624.
scope
informal definition *note 3.1(8): 1317.
of (a view of) an entity *note 8.2(11): 3732.
@@ -87737,47 +87937,47 @@ scope
of an aspect_specification *note 8.2(10.1/3): 3730.
of an attribute_definition_clause *note 8.2(10.1/3): 3729.
Search_Type
- in Ada.Directories *note A.16(31/2): 6661.
+ <in> Ada.Directories *note A.16(31/2): 6661.
Second
- in Ada.Calendar.Formatting *note 9.6.1(26/2): 4196.
-Second_Duration subtype of Day_Duration
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4190.
-Second_Number subtype of Natural
- in Ada.Calendar.Formatting *note 9.6.1(20/2): 4189.
+ <in> Ada.Calendar.Formatting *note 9.6.1(26/2): 4196.
+Second_Duration <subtype of> Day_Duration
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4190.
+Second_Number <subtype of> Natural
+ <in> Ada.Calendar.Formatting *note 9.6.1(20/2): 4189.
Seconds
- in Ada.Calendar *note 9.6(13): 4155.
- in Ada.Real_Time *note D.8(14/2): 7958.
+ <in> Ada.Calendar *note 9.6(13): 4155.
+ <in> Ada.Real_Time *note D.8(14/2): 7958.
Seconds_Count
- in Ada.Real_Time *note D.8(15): 7960.
+ <in> Ada.Real_Time *note D.8(15): 7960.
Seconds_Of
- in Ada.Calendar.Formatting *note 9.6.1(28/2): 4198.
+ <in> Ada.Calendar.Formatting *note 9.6.1(28/2): 4198.
Section_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5638.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5638.
secure systems *note H(1/2): 8427.
select an entry call
from an entry queue *note 9.5.3(13): 4109, *note 9.5.3(16): 4110.
immediately *note 9.5.3(8): 4106.
select_alternative *note 9.7.1(4): 4223.
- used *note 9.7.1(2): 4217, *note P: 9624.
+ <used> *note 9.7.1(2): 4217, *note P: 9624.
select_statement *note 9.7(2): 4209.
- used *note 5.1(5/2): 3141, *note P: 9375.
+ <used> *note 5.1(5/2): 3141, *note P: 9375.
selected_component *note 4.1.3(2): 2418.
- used *note 4.1(2/3): 2364, *note P: 9200.
+ <used> *note 4.1(2/3): 2364, *note P: 9200.
selection
of an entry caller *note 9.5.2(24): 4086.
selective_accept *note 9.7.1(2): 4215.
- used *note 9.7(2): 4210, *note P: 9617.
+ <used> *note 9.7(2): 4210, *note P: 9617.
selector_name *note 4.1.3(3): 2421.
- used *note 3.7.1(3): 2005, *note 4.1.3(2): 2420, *note 4.3.1(5):
+ <used> *note 3.7.1(3): 2005, *note 4.1.3(2): 2420, *note 4.3.1(5):
2516, *note 6.4(5): 3458, *note 12.3(4): 4713, *note 12.7(3.1/2): 4863,
*note P: 9136.
semantic dependence
of one compilation unit upon another *note 10.1.1(26/2): 4366.
semicolon *note 2.1(15/3): 1170.
- in Ada.Characters.Latin_1 *note A.3.3(10): 5550.
+ <in> Ada.Characters.Latin_1 *note A.3.3(10): 5550.
separate compilation *note 10.1(1): 4315.
Separate_Interrupt_Clocks_Supported
- in Ada.Execution_Time *note D.14(9.2/3): 8009.
+ <in> Ada.Execution_Time *note D.14(9.2/3): 8009.
separator *note 2.2(3/2): 1184.
separator_line *note 2.1(12/2): 1143.
separator_paragraph *note 2.1(12.1/2): 1144.
@@ -87785,7 +87985,7 @@ separator_space *note 2.1(11/2): 1142.
sequence of characters
of a string_literal *note 2.6(5): 1254.
sequence_of_statements *note 5.1(2/3): 3112.
- used *note 5.3(2): 3171, *note 5.4(3): 3182, *note 5.5(2): 3193,
+ <used> *note 5.3(2): 3171, *note 5.4(3): 3182, *note 5.5(2): 3193,
*note 9.7.1(2): 4220, *note 9.7.1(5): 4229, *note 9.7.1(6): 4232, *note
9.7.2(3/2): 4246, *note 9.7.3(2): 4253, *note 9.7.4(3): 4260, *note
9.7.4(5): 4265, *note 11.2(2): 4529, *note 11.2(3): 4536, *note P: 9631.
@@ -87794,7 +87994,7 @@ sequential
sequential access *note A.8(2): 6293.
sequential file *note A.8(1/2): 6290.
Sequential_IO
- child of Ada *note A.8.1(2): 6298.
+ <child of> Ada *note A.8.1(2): 6298.
service
an entry queue *note 9.5.3(13): 4108.
set
@@ -87802,75 +88002,75 @@ set
group budget object *note D.14.2(15/2): 8052.
termination handler *note C.7.3(9/2): 7753.
timing event object *note D.15(9/2): 8067.
- in Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7041.
- in Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7114.
- in Ada.Environment_Variables *note A.17(6/2): 6703.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(3/3): 7041.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(4/3): 7114.
+ <in> Ada.Environment_Variables *note A.17(6/2): 6703.
set container *note A.18.7(1/2): 7018.
Set_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(12.1/2): 5852.
+ <in> Ada.Strings.Bounded *note A.4.4(12.1/2): 5852.
Set_Col
- in Ada.Text_IO *note A.10.1(35): 6434.
+ <in> Ada.Text_IO *note A.10.1(35): 6434.
Set_CPU
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(12/3):
8089.
Set_Deadline
- in Ada.Dispatching.EDF *note D.2.6(9/2): 7824.
+ <in> Ada.Dispatching.EDF *note D.2.6(9/2): 7824.
Set_Dependents_Fallback_Handler
- in Ada.Task_Termination *note C.7.3(5/2): 7743.
+ <in> Ada.Task_Termination *note C.7.3(5/2): 7743.
Set_Directory
- in Ada.Directories *note A.16(6/2): 6637.
+ <in> Ada.Directories *note A.16(6/2): 6637.
Set_Error
- in Ada.Text_IO *note A.10.1(15): 6395.
+ <in> Ada.Text_IO *note A.10.1(15): 6395.
Set_Exit_Status
- in Ada.Command_Line *note A.15(9): 6633.
+ <in> Ada.Command_Line *note A.15(9): 6633.
Set_False
- in Ada.Synchronous_Task_Control *note D.10(4): 7976.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7976.
Set_Handler
- in Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8044.
- in Ada.Execution_Time.Timers *note D.14.1(7/2): 8019.
- in Ada.Real_Time.Timing_Events *note D.15(5/2): 8061.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(10/2): 8044.
+ <in> Ada.Execution_Time.Timers *note D.14.1(7/2): 8019.
+ <in> Ada.Real_Time.Timing_Events *note D.15(5/2): 8061.
Set_Im
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8392,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8392,
*note G.3.2(28/2): 8405.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8268.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8268.
Set_Index
- in Ada.Direct_IO *note A.8.4(14): 6343.
- in Ada.Streams.Stream_IO *note A.12.1(22): 6590.
+ <in> Ada.Direct_IO *note A.8.4(14): 6343.
+ <in> Ada.Streams.Stream_IO *note A.12.1(22): 6590.
Set_Input
- in Ada.Text_IO *note A.10.1(15): 6393.
+ <in> Ada.Text_IO *note A.10.1(15): 6393.
Set_Iterator_Interfaces
- in Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7046.
- in Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7119.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(6.2/3): 7046.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(7.2/3): 7119.
Set_Length
- in Ada.Containers.Vectors *note A.18.2(22/2): 6738.
+ <in> Ada.Containers.Vectors *note A.18.2(22/2): 6738.
Set_Line
- in Ada.Text_IO *note A.10.1(36): 6436.
+ <in> Ada.Text_IO *note A.10.1(36): 6436.
Set_Line_Length
- in Ada.Text_IO *note A.10.1(23): 6411.
+ <in> Ada.Text_IO *note A.10.1(23): 6411.
Set_Mode
- in Ada.Streams.Stream_IO *note A.12.1(24): 6593.
+ <in> Ada.Streams.Stream_IO *note A.12.1(24): 6593.
Set_Output
- in Ada.Text_IO *note A.10.1(15): 6394.
+ <in> Ada.Text_IO *note A.10.1(15): 6394.
Set_Page_Length
- in Ada.Text_IO *note A.10.1(24): 6413.
+ <in> Ada.Text_IO *note A.10.1(24): 6413.
Set_Pool_of_Subpool
- in System.Storage_Pools.Subpools *note 13.11.4(10/3): 5262.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(10/3): 5262.
Set_Priority
- in Ada.Dynamic_Priorities *note D.5.1(4): 7866.
+ <in> Ada.Dynamic_Priorities *note D.5.1(4): 7866.
Set_Quantum
- in Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7816.
+ <in> Ada.Dispatching.Round_Robin *note D.2.5(4/2): 7816.
Set_Re
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8391,
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(8/2): 8391,
*note G.3.2(28/2): 8404.
- in Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8266.
+ <in> Ada.Numerics.Generic_Complex_Types *note G.1.1(7): 8266.
Set_Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 7745.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 7745.
Set_True
- in Ada.Synchronous_Task_Control *note D.10(4): 7975.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7975.
Set_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(11.1/2): 5911.
+ <in> Ada.Strings.Unbounded *note A.4.5(11.1/2): 5911.
Set_Value
- in Ada.Task_Attributes *note C.7.2(6): 7732.
+ <in> Ada.Task_Attributes *note C.7.2(6): 7732.
shared passive library unit *note E.2(4/3): 8118, *note E.2.1(4/3):
8127.
shared variable
@@ -87882,110 +88082,114 @@ Shift_Left *note B.2(6): 7421.
Shift_Right *note B.2(6): 7422.
Shift_Right_Arithmetic *note B.2(6): 7423.
short
- in Interfaces.C *note B.3(7): 7438.
+ <in> Interfaces.C *note B.3(7): 7438.
short-circuit control form *note 4.5.1(1): 2739.
Short_Float *note 3.5.7(16): 1819.
Short_Integer *note 3.5.4(25): 1763.
SI
- in Ada.Characters.Latin_1 *note A.3.3(5): 5515.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5515.
signal
as defined between actions *note 9.10(2): 4308.
- See interrupt *note C.3(1/3): 7629.
+ <See> interrupt *note C.3(1/3): 7629.
signal (an exception)
- See raise *note 11(1/3): 4508.
+ <See> raise *note 11(1/3): 4508.
signal handling
example *note 9.7.4(10): 4269.
signed integer type *note 3.5.4(1): 1718.
signed_char
- in Interfaces.C *note B.3(8): 7440.
+ <in> Interfaces.C *note B.3(8): 7440.
signed_integer_type_definition *note 3.5.4(3): 1724.
- used *note 3.5.4(2): 1722, *note P: 9085.
+ <used> *note 3.5.4(2): 1722, *note P: 9085.
Signed_Zeros attribute *note A.5.3(13): 6201.
simple entry call *note 9.5.3(1): 4090.
simple name
of a file *note A.16(47/2): 6681.
Simple_Barriers restriction *note D.7(10.11/3): 7911.
simple_expression *note 4.4(4): 2695.
- used *note 3.5(3): 1589, *note 3.5.4(3): 1725, *note 3.5.7(3):
+ <used> *note 3.5(3): 1589, *note 3.5.4(3): 1725, *note 3.5.7(3):
1799, *note 3.5.9(5/4): 1840, *note 4.4(2.2/3): 2680, *note 4.4(3.2/4):
2692, *note 4.4(3/4): 2685, *note 11.3(2.1/4): 4549, *note 13.5.1(5):
5071, *note 13.5.1(6): 5073, *note J.3(2/4): 8496, *note P: 9078.
Simple_Name
- in Ada.Directories *note A.16(16/2): 6646, *note A.16(38/2): 6666.
- in Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
+ <in> Ada.Directories *note A.16(16/2): 6646, *note A.16(38/2):
+6666.
+ <in> Ada.Directories.Hierarchical_File_Names *note A.16.1(10/3):
6693.
simple_return_statement *note 6.5(2/2): 3497.
- used *note 5.1(4/2): 3127, *note P: 9362.
+ <used> *note 5.1(4/2): 3127, *note P: 9362.
simple_statement *note 5.1(4/2): 3121.
- used *note 5.1(3): 3118, *note P: 9354.
+ <used> *note 5.1(3): 3118, *note P: 9354.
Sin
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8290.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6116.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6116.
single
class expected type *note 8.6(27/2): 3867.
single entry *note 9.5.2(20): 4079.
Single_Precision_Complex_Types
- in Interfaces.Fortran *note B.5(8): 7604.
+ <in> Interfaces.Fortran *note B.5(8): 7604.
single_protected_declaration *note 9.4(3/3): 3961.
- used *note 3.3.1(2/3): 1493, *note P: 9068.
+ <used> *note 3.3.1(2/3): 1493, *note P: 9068.
single_task_declaration *note 9.1(3/3): 3899.
- used *note 3.3.1(2/3): 1492, *note P: 9067.
+ <used> *note 3.3.1(2/3): 1492, *note P: 9067.
Sinh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8298.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6131.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6131.
size
of an object *note 13.1(7/2): 4884.
- in Ada.Direct_IO *note A.8.4(15): 6345.
- in Ada.Directories *note A.16(26/2): 6657, *note A.16(41/2): 6669.
- in Ada.Streams.Stream_IO *note A.12.1(23): 6592.
+ <in> Ada.Direct_IO *note A.8.4(15): 6345.
+ <in> Ada.Directories *note A.16(26/2): 6657, *note A.16(41/2):
+6669.
+ <in> Ada.Streams.Stream_IO *note A.12.1(23): 6592.
Size (object) aspect *note 13.3(41): 5005.
Size (subtype) aspect *note 13.3(48): 5012.
Size attribute *note 13.3(40): 5001, *note 13.3(45): 5008.
Size clause *note 13.3(7/2): 4961, *note 13.3(41): 5003, *note
13.3(48): 5010.
size_t
- in Interfaces.C *note B.3(13): 7447.
+ <in> Interfaces.C *note B.3(13): 7447.
Skip_Line
- in Ada.Text_IO *note A.10.1(29): 6421.
+ <in> Ada.Text_IO *note A.10.1(29): 6421.
Skip_Page
- in Ada.Text_IO *note A.10.1(32): 6428.
+ <in> Ada.Text_IO *note A.10.1(32): 6428.
slice *note 4.1.2(2): 2407.
- used *note 4.1(2/3): 2363, *note P: 9199.
- in Ada.Strings.Bounded *note A.4.4(28): 5863.
- in Ada.Strings.Unbounded *note A.4.5(22): 5917.
+ <used> *note 4.1(2/3): 2363, *note P: 9199.
+ <in> Ada.Strings.Bounded *note A.4.4(28): 5863.
+ <in> Ada.Strings.Unbounded *note A.4.5(22): 5917.
small
of a fixed point type *note 3.5.9(8/2): 1846.
Small aspect *note 3.5.10(2/1): 1869.
Small attribute *note 3.5.10(2/1): 1865.
Small clause *note 3.5.10(2/1): 1867, *note 13.3(7/2): 4964.
SO
- in Ada.Characters.Latin_1 *note A.3.3(5): 5514.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5514.
Soft_Hyphen
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5644.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5644.
SOH
- in Ada.Characters.Latin_1 *note A.3.3(5): 5501.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5501.
solidus *note 2.1(15/3): 1167.
- in Ada.Characters.Latin_1 *note A.3.3(8): 5548.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5548.
Solve
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8415.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8375.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(46/2): 8415.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(24/2): 8375.
Sort
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 6871.
- in Ada.Containers.Vectors *note A.18.2(77/2): 6799.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(49/2): 6871.
+ <in> Ada.Containers.Vectors *note A.18.2(77/2): 6799.
SOS
- in Ada.Characters.Latin_1 *note A.3.3(19): 5622.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5622.
SPA
- in Ada.Characters.Latin_1 *note A.3.3(18): 5620.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5620.
Space
- in Ada.Characters.Latin_1 *note A.3.3(8): 5532.
- in Ada.Strings *note A.4.1(4/2): 5771.
+ <in> Ada.Characters.Latin_1 *note A.3.3(8): 5532.
+ <in> Ada.Strings *note A.4.1(4/2): 5771.
special file *note A.16(45/2): 6676.
special graphic character
a category of Character *note A.3.2(32): 5497.
Special_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5964.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5964.
Specialized Needs Annexes *note 1.1.2(7): 1006.
specifiable
of Address for entries *note J.7.1(6): 8511.
@@ -88017,7 +88221,7 @@ specific postcondition expression *note 6.1.1(4/3):
3353.
specific precondition expression *note 6.1.1(2/3): 3345.
specific type *note 3.4.1(3/2): 1565.
Specific_Handler
- in Ada.Task_Termination *note C.7.3(6/2): 7746.
+ <in> Ada.Task_Termination *note C.7.3(6/2): 7746.
specified
of an aspect of representation of an entity *note 13.1(17): 4898.
of an operational aspect of an entity *note 13.1(18.1/1): 4900.
@@ -88025,36 +88229,37 @@ specified (not!) *note 1.1.3(18): 1056.
specified as independently addressable *note C.6(8.1/4): 7702.
specified discriminant *note 3.7(18): 1989.
Splice
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 6853,
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(30/2): 6853,
*note A.18.3(31/2): 6854, *note A.18.3(32/2): 6855.
Splice_Children
- in Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7250, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(57/3): 7250, *note
A.18.10(58/3): 7251.
Splice_Subtree
- in Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7248, *note
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(55/3): 7248, *note
A.18.10(56/3): 7249.
Split
- in Ada.Calendar *note 9.6(14): 4156.
- in Ada.Calendar.Formatting *note 9.6.1(29/2): 4199, *note
+ <in> Ada.Calendar *note 9.6(14): 4156.
+ <in> Ada.Calendar.Formatting *note 9.6.1(29/2): 4199, *note
9.6.1(32/2): 4202, *note 9.6.1(33/2): 4203, *note 9.6.1(34/2): 4204.
- in Ada.Execution_Time *note D.14(8/2): 8006.
- in Ada.Real_Time *note D.8(16): 7961.
+ <in> Ada.Execution_Time *note D.14(8/2): 8006.
+ <in> Ada.Real_Time *note D.8(16): 7961.
Sqrt
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(3): 8286.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4): 6111.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(4):
+6111.
SS2
- in Ada.Characters.Latin_1 *note A.3.3(17): 5612.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5612.
SS3
- in Ada.Characters.Latin_1 *note A.3.3(17): 5613.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5613.
SSA
- in Ada.Characters.Latin_1 *note A.3.3(17): 5604.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5604.
ST
- in Ada.Characters.Latin_1 *note A.3.3(19): 5626.
+ <in> Ada.Characters.Latin_1 *note A.3.3(19): 5626.
stand-alone constant *note 3.3.1(23/3): 1521.
corresponding to a formal object of mode in *note 12.4(10/2): 4762.
stand-alone object *note 3.3.1(1/3): 1473.
- [partial] *note 12.4(10/2): 4763.
+ [<partial>] *note 12.4(10/2): 4763.
stand-alone variable *note 3.3.1(23/3): 1522.
Standard *note A.1(4): 5436.
standard error file *note A.10(6): 6363.
@@ -88063,20 +88268,20 @@ standard mode *note 1.1.5(11): 1084.
standard output file *note A.10(5): 6362.
standard storage pool *note 13.11(17): 5209.
Standard_Error
- in Ada.Text_IO *note A.10.1(16): 6398, *note A.10.1(19): 6405.
+ <in> Ada.Text_IO *note A.10.1(16): 6398, *note A.10.1(19): 6405.
Standard_Input
- in Ada.Text_IO *note A.10.1(16): 6396, *note A.10.1(19): 6403.
+ <in> Ada.Text_IO *note A.10.1(16): 6396, *note A.10.1(19): 6403.
Standard_Output
- in Ada.Text_IO *note A.10.1(16): 6397, *note A.10.1(19): 6404.
+ <in> Ada.Text_IO *note A.10.1(16): 6397, *note A.10.1(19): 6404.
Start_Search
- in Ada.Directories *note A.16(32/2): 6662.
+ <in> Ada.Directories *note A.16(32/2): 6662.
State
- in Ada.Numerics.Discrete_Random *note A.5.2(23): 6165.
- in Ada.Numerics.Float_Random *note A.5.2(11): 6153.
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(23): 6165.
+ <in> Ada.Numerics.Float_Random *note A.5.2(11): 6153.
statement *note 5.1(3): 3116.
- used *note 5.1(2/3): 3114, *note P: 9350.
+ <used> *note 5.1(2/3): 3114, *note P: 9350.
statement_identifier *note 5.1(8): 3145.
- used *note 5.1(7): 3144, *note 5.5(2): 3191, *note 5.6(2): 3261,
+ <used> *note 5.1(7): 3144, *note 5.5(2): 3191, *note 5.6(2): 3261,
*note P: 9390.
static *note 4.9(1): 3086.
constant *note 4.9(24): 3091.
@@ -88106,7 +88311,7 @@ statically compatible
for two subtypes *note 4.9.1(5/3): 3111.
statically deeper *note 3.10.2(4): 2295, *note 3.10.2(17): 2302.
statically determined tag *note 3.9.2(1/2): 2149.
- [partial] *note 3.9.2(15): 2174, *note 3.9.2(19): 2178.
+ [<partial>] *note 3.9.2(15): 2174, *note 3.9.2(19): 2178.
statically matching
effect on subtype-specific aspects *note 13.1(14): 4897.
for constraints *note 4.9.1(1/2): 3106.
@@ -88121,12 +88326,12 @@ statically matching
statically tagged *note 3.9.2(4/2): 2167.
statically unevaluated *note 4.9(32.1/3): 3104.
Status_Error
- in Ada.Direct_IO *note A.8.4(18): 6347.
- in Ada.Directories *note A.16(43/2): 6671.
- in Ada.IO_Exceptions *note A.13(4): 6614.
- in Ada.Sequential_IO *note A.8.1(15): 6315.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6595.
- in Ada.Text_IO *note A.10.1(85): 6520.
+ <in> Ada.Direct_IO *note A.8.4(18): 6347.
+ <in> Ada.Directories *note A.16(43/2): 6671.
+ <in> Ada.IO_Exceptions *note A.13(4): 6614.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6315.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6595.
+ <in> Ada.Text_IO *note A.10.1(85): 6520.
storage deallocation
unchecked *note 13.11.2(1): 5224.
storage element *note 13.3(8): 4974.
@@ -88144,38 +88349,38 @@ storage pool element *note 13.11(11): 5194.
storage pool that supports subpools *note 13.11.4(18/3): 5273.
storage pool type *note 13.11(11): 5192.
Storage_Array
- in System.Storage_Elements *note 13.7.1(5): 5136.
+ <in> System.Storage_Elements *note 13.7.1(5): 5136.
Storage_Check *note 11.5(23): 4641.
- [partial] *note 11.1(6): 4524, *note 13.3(67): 5018, *note
+ [<partial>] *note 11.1(6): 4524, *note 13.3(67): 5018, *note
13.11(17): 5210, *note D.7(17/1): 7922, *note D.7(18/1): 7927, *note
D.7(19/1): 7932.
-Storage_Count subtype of Storage_Offset
- in System.Storage_Elements *note 13.7.1(4): 5134.
+Storage_Count <subtype of> Storage_Offset
+ <in> System.Storage_Elements *note 13.7.1(4): 5134.
Storage_Element
- in System.Storage_Elements *note 13.7.1(5): 5135.
+ <in> System.Storage_Elements *note 13.7.1(5): 5135.
Storage_Elements
- child of System *note 13.7.1(2/2): 5132.
+ <child of> System *note 13.7.1(2/2): 5132.
Storage_Error
raised by failure of run-time check *note 4.8(14): 3085, *note
8.5.4(8.1/1): 3834, *note 11.1(4): 4521, *note 11.1(6): 4526, *note
11.5(23): 4642, *note 13.3(67): 5020, *note 13.11(17): 5212, *note
13.11(18/4): 5213, *note A.7(14/3): 6288, *note D.7(17/1): 7924, *note
D.7(18/1): 7929, *note D.7(19.3/3): 7940, *note D.7(19/1): 7934.
- in Standard *note A.1(46): 5453.
+ <in> Standard *note A.1(46): 5453.
Storage_IO
- child of Ada *note A.9(3): 6355.
+ <child of> Ada *note A.9(3): 6355.
Storage_Offset
- in System.Storage_Elements *note 13.7.1(3): 5133.
+ <in> System.Storage_Elements *note 13.7.1(3): 5133.
Storage_Pool aspect *note 13.11(15): 5206.
Storage_Pool attribute *note 13.11(13): 5198.
Storage_Pool clause *note 13.3(7/2): 4966, *note 13.11(15): 5203.
storage_pool_indicator *note 13.11.3(3.1/4): 5249.
- used *note 13.11.3(3/3): 5248, *note L(8.3/3): 8733.
+ <used> *note 13.11.3(3/3): 5248, *note L(8.3/3): 8733.
Storage_Pools
- child of System *note 13.11(5): 5187.
+ <child of> System *note 13.11(5): 5187.
Storage_Size
- in System.Storage_Pools *note 13.11(9): 5191.
- in System.Storage_Pools.Subpools *note 13.11.4(16/3): 5268.
+ <in> System.Storage_Pools *note 13.11(9): 5191.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(16/3): 5268.
Storage_Size (access) aspect *note 13.11(15): 5208.
Storage_Size (task) aspect *note 13.3(65.2/3): 5017.
Storage_Size attribute *note 13.3(60/3): 5015, *note 13.11(14): 5200,
@@ -88183,62 +88388,62 @@ Storage_Size attribute *note 13.3(60/3): 5015,
*note 13.11(14): 5200,
Storage_Size clause *note 13.3(7/2): 4967, *note 13.11(15): 5204.
Storage_Size pragma *note J.15.4(2/3): 8548, *note L(35.1/3): 8850.
Storage_Unit
- in System *note 13.7(13): 5119.
+ <in> System *note 13.7(13): 5119.
stream *note 13.13(1): 5331, *note N(37.2/3): 8948.
- in Ada.Streams.Stream_IO *note A.12.1(13): 6585.
- in Ada.Text_IO.Text_Streams *note A.12.2(4): 6606.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 6609.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 6612.
+ <in> Ada.Streams.Stream_IO *note A.12.1(13): 6585.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(4): 6606.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(4): 6609.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(4/2): 6612.
stream file *note A.8(1/2): 6292.
stream type *note 13.13(1): 5332.
stream-oriented attributes *note 13.13.2(1/3): 5342.
Stream_Access
- in Ada.Streams.Stream_IO *note A.12.1(4): 6569.
- in Ada.Text_IO.Text_Streams *note A.12.2(3): 6605.
- in Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 6608.
- in Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 6611.
+ <in> Ada.Streams.Stream_IO *note A.12.1(4): 6569.
+ <in> Ada.Text_IO.Text_Streams *note A.12.2(3): 6605.
+ <in> Ada.Wide_Text_IO.Text_Streams *note A.12.3(3): 6608.
+ <in> Ada.Wide_Wide_Text_IO.Text_Streams *note A.12.4(3/2): 6611.
Stream_Element
- in Ada.Streams *note 13.13.1(4/1): 5336.
+ <in> Ada.Streams *note 13.13.1(4/1): 5336.
Stream_Element_Array
- in Ada.Streams *note 13.13.1(4/1): 5339.
-Stream_Element_Count subtype of Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5338.
+ <in> Ada.Streams *note 13.13.1(4/1): 5339.
+Stream_Element_Count <subtype of> Stream_Element_Offset
+ <in> Ada.Streams *note 13.13.1(4/1): 5338.
Stream_Element_Offset
- in Ada.Streams *note 13.13.1(4/1): 5337.
+ <in> Ada.Streams *note 13.13.1(4/1): 5337.
Stream_IO
- child of Ada.Streams *note A.12.1(3/3): 6568.
+ <child of> Ada.Streams *note A.12.1(3/3): 6568.
Stream_Size aspect *note 13.13.2(1.5/2): 5347.
Stream_Size attribute *note 13.13.2(1.2/3): 5345.
Stream_Size clause *note 13.3(7/2): 4968.
Streams
- child of Ada *note 13.13.1(2): 5333.
+ <child of> Ada *note 13.13.1(2): 5333.
strict mode *note G.2(1): 8330.
strict weak ordering *note A.18(5/3): 6713.
String
- in Standard *note A.1(37/3): 5447.
+ <in> Standard *note A.1(37/3): 5447.
string type *note 3.6.3(1): 1963.
String_Access
- in Ada.Strings.Unbounded *note A.4.5(7): 5906.
+ <in> Ada.Strings.Unbounded *note A.4.5(7): 5906.
string_element *note 2.6(3): 1252.
- used *note 2.6(2): 1251, *note P: 8995.
+ <used> *note 2.6(2): 1251, *note P: 8995.
string_literal *note 2.6(2): 1250.
- used *note 4.4(7/3): 2711, *note 6.1(9): 3305, *note P: 9310.
+ <used> *note 4.4(7/3): 2711, *note 6.1(9): 3305, *note P: 9310.
Strings
- child of Ada *note A.4.1(3): 5770.
- child of Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6081.
- child of Interfaces.C *note B.3.1(3): 7496.
+ <child of> Ada *note A.4.1(3): 5770.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(22/3): 6081.
+ <child of> Interfaces.C *note B.3.1(3): 7496.
Strlen
- in Interfaces.C.Strings *note B.3.1(17): 7510.
+ <in> Interfaces.C.Strings *note B.3.1(17): 7510.
structure
- See record type *note 3.8(1): 2023.
+ <See> record type *note 3.8(1): 2023.
STS
- in Ada.Characters.Latin_1 *note A.3.3(18): 5617.
+ <in> Ada.Characters.Latin_1 *note A.3.3(18): 5617.
STX
- in Ada.Characters.Latin_1 *note A.3.3(5): 5502.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5502.
SUB
- in Ada.Characters.Latin_1 *note A.3.3(6): 5526.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5526.
Sub_Second
- in Ada.Calendar.Formatting *note 9.6.1(27/2): 4197.
+ <in> Ada.Calendar.Formatting *note 9.6.1(27/2): 4197.
subaggregate
of an array_aggregate *note 4.3.3(6): 2562.
subcomponent *note 3.2(6/2): 1347.
@@ -88246,30 +88451,30 @@ subpool *note 13.11.4(18/3): 5269.
subpool access type *note 13.11.4(22/3): 5275.
subpool handle *note 13.11.4(18/3): 5271.
Subpool_Handle
- in System.Storage_Pools.Subpools *note 13.11.4(6/3): 5259.
+ <in> System.Storage_Pools.Subpools *note 13.11.4(6/3): 5259.
subpool_specification *note 4.8(2.1/3): 3048.
- used *note 4.8(2/3): 3044, *note P: 9347.
+ <used> *note 4.8(2/3): 3044, *note P: 9347.
Subpools
- child of System.Storage_Pools *note 13.11.4(3/3): 5256.
+ <child of> System.Storage_Pools *note 13.11.4(3/3): 5256.
subprogram *note 6(1): 3275, *note N(37.3/2): 8949.
abstract *note 3.9.3(3/2): 2192.
subprogram call *note 6.4(1): 3445.
subprogram instance *note 12.3(13): 4728.
subprogram_body *note 6.3(2/3): 3402.
- used *note 3.11(6): 2340, *note 9.4(8/4): 3984, *note 10.1.1(7):
+ <used> *note 3.11(6): 2340, *note 9.4(8/4): 3984, *note 10.1.1(7):
4343, *note P: 9666.
subprogram_body_stub *note 10.1.3(3/3): 4392.
- used *note 10.1.3(2): 4388, *note P: 9678.
+ <used> *note 10.1.3(2): 4388, *note P: 9678.
subprogram_declaration *note 6.1(2/3): 3281.
- used *note 3.1(3/3): 1297, *note 9.4(5/1): 3971, *note 9.4(8/4):
+ <used> *note 3.1(3/3): 1297, *note 9.4(5/1): 3971, *note 9.4(8/4):
3983, *note 10.1.1(5): 4334, *note P: 9659.
subprogram_default *note 12.6(3/2): 4839.
- used *note 12.6(2.1/3): 4833, *note 12.6(2.2/3): 4837, *note P:
+ <used> *note 12.6(2.1/3): 4833, *note 12.6(2.2/3): 4837, *note P:
9786.
subprogram_renaming_declaration *note 8.5.4(2/3): 3822.
- used *note 8.5(2): 3793, *note 10.1.1(6): 4341, *note P: 9512.
+ <used> *note 8.5(2): 3793, *note 10.1.1(6): 4341, *note P: 9512.
subprogram_specification *note 6.1(4/2): 3285.
- used *note 3.9.3(1.1/3): 2187, *note 6.1(2/3): 3283, *note
+ <used> *note 3.9.3(1.1/3): 2187, *note 6.1(2/3): 3283, *note
6.3(2/3): 3404, *note 8.5.4(2/3): 3824, *note 10.1.3(3/3): 4394, *note
12.1(3/3): 4672, *note 12.6(2.1/3): 4832, *note 12.6(2.2/3): 4836, *note
P: 9412.
@@ -88278,37 +88483,37 @@ subtree
node which roots *note A.18.10(3/4): 7196.
of a tree *note A.18.10(3/4): 7194.
Subtree_Node_Count
- in Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7211.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(18/3): 7211.
subtype *note 3.2(8/2): 1354, *note N(38/3): 8950.
constraint of *note 3.2(8/2): 1358.
type of *note 3.2(8/2): 1356.
values belonging to *note 3.2(8/2): 1361.
subtype (of an object)
- See actual subtype of an object *note 3.3(23/3): 1467.
- See actual subtype of an object *note 3.3.1(9/2): 1507.
+ <See> actual subtype of an object *note 3.3(23/3): 1467.
+ <See> actual subtype of an object *note 3.3.1(9/2): 1507.
subtype conformance *note 6.3.1(17/3): 3433.
- [partial] *note 3.10.2(35/2): 2324, *note 9.5.4(17): 4130.
+ [<partial>] *note 3.10.2(35/2): 2324, *note 9.5.4(17): 4130.
required *note 3.9.2(10/2): 2171, *note 3.10.2(33/3): 2320, *note
4.6(24.20/3): 2960, *note 8.5.1(4.3/2): 3809, *note 8.5.4(5/3): 3832,
*note 9.1(9.7/2): 3924, *note 9.1(9.8/2): 3925, *note 9.4(11.6/2): 3997,
*note 9.4(11.7/2): 3998, *note 9.5.4(5/3): 4124, *note 12.4(8.2/2):
4757, *note 12.5.4(5/3): 4823.
subtype conversion
- See type conversion *note 4.6(1/3): 2919.
- See also implicit subtype conversion *note 4.6(1/3): 2923.
+ <See> type conversion *note 4.6(1/3): 2919.
+ <See also> implicit subtype conversion *note 4.6(1/3): 2923.
subtype-specific
of a representation item *note 13.1(8/3): 4890.
of an aspect *note 13.1(8/3): 4892.
subtype_declaration *note 3.2.2(2/3): 1400.
- used *note 3.1(3/3): 1294, *note P: 9010.
+ <used> *note 3.1(3/3): 1294, *note P: 9010.
subtype_indication *note 3.2.2(3/2): 1404.
- used *note 3.2.2(2/3): 1402, *note 3.3.1(2/3): 1481, *note
+ <used> *note 3.2.2(2/3): 1402, *note 3.3.1(2/3): 1481, *note
3.4(2/2): 1534, *note 3.6(6): 1901, *note 3.6(7/2): 1904, *note
3.6.1(3): 1936, *note 3.8.1(5/3): 2070, *note 3.10(3): 2234, *note
4.8(2/3): 3045, *note 5.5.2(2/3): 3239, *note 6.5(2.3/2): 3507, *note
7.3(3/3): 3607, *note P: 9346.
subtype_mark *note 3.2.2(4): 1408.
- used *note 3.2.2(3/2): 1406, *note 3.6(4): 1895, *note 3.7(5/2):
+ <used> *note 3.2.2(3/2): 1406, *note 3.6(4): 1895, *note 3.7(5/2):
1977, *note 3.9.4(3/2): 2198, *note 3.10(6/2): 2242, *note 4.3.2(3):
2532, *note 4.4(3.2/4): 2694, *note 4.6(2): 2928, *note 4.7(2): 3028,
*note 6.1(13/2): 3313, *note 6.1(15/3): 3323, *note 8.4(4/3): 3781,
@@ -88318,10 +88523,10 @@ subtypes
of a profile *note 6.1(25): 3342.
subunit *note 10.1.3(7): 4405, *note 10.1.3(8/2): 4409.
of a program unit *note 10.1.3(8/2): 4410.
- used *note 10.1.1(3): 4328, *note P: 9655.
+ <used> *note 10.1.1(3): 4328, *note P: 9655.
Succ attribute *note 3.5(22): 1625.
Success
- in Ada.Command_Line *note A.15(8): 6631.
+ <in> Ada.Command_Line *note A.15(8): 6631.
successor element
of a hashed set *note A.18.8(68/2): 7108.
of a set *note A.18.7(6/2): 7025.
@@ -88331,41 +88536,41 @@ successor node
of a map *note A.18.4(6/2): 6896.
of an ordered map *note A.18.6(58/3): 7016.
Sunday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4185.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4185.
super
- See view conversion *note 4.6(5/2): 2938.
+ <See> view conversion *note 4.6(5/2): 2938.
Superscript_One
- in Ada.Characters.Latin_1 *note A.3.3(22): 5658.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5658.
Superscript_Three
- in Ada.Characters.Latin_1 *note A.3.3(22): 5651.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5651.
Superscript_Two
- in Ada.Characters.Latin_1 *note A.3.3(22): 5650.
+ <in> Ada.Characters.Latin_1 *note A.3.3(22): 5650.
support external streaming *note 13.13.2(52/3): 5396.
Supported
- in Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8057.
+ <in> Ada.Execution_Time.Interrupts *note D.14.3(3/3): 8057.
Suppress pragma *note 11.5(4/2): 4618, *note J.10(3/2): 8522, *note
L(36): 8853.
suppressed check *note 11.5(8/2): 4627.
Suspend_Until_True
- in Ada.Synchronous_Task_Control *note D.10(4): 7978.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7978.
Suspend_Until_True_And_Set_Deadline
- in Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 7980.
+ <in> Ada.Synchronous_Task_Control.EDF *note D.10(5.2/3): 7980.
Suspension_Object
- in Ada.Synchronous_Task_Control *note D.10(4): 7974.
+ <in> Ada.Synchronous_Task_Control *note D.10(4): 7974.
Swap
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 6851.
- in Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7230.
- in Ada.Containers.Vectors *note A.18.2(55/2): 6778, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(28/2): 6851.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(37/3): 7230.
+ <in> Ada.Containers.Vectors *note A.18.2(55/2): 6778, *note
A.18.2(56/2): 6779.
Swap_Links
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 6852.
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(29/2): 6852.
Symmetric_Difference
- in Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7074, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(35/2): 7074, *note
A.18.8(36/2): 7075.
- in Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7147, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(36/2): 7147, *note
A.18.9(37/2): 7148.
SYN
- in Ada.Characters.Latin_1 *note A.3.3(6): 5522.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5522.
synchronization *note 9(1/3): 3878.
Synchronization aspect *note 9.5(12/3): 4020.
synchronization_kind *note 9.5(10/3): 4018.
@@ -88373,13 +88578,13 @@ synchronized *note N(38.1/2): 8951.
synchronized interface *note 3.9.4(5/2): 2207.
synchronized tagged type *note 3.9.4(6/2): 2212.
Synchronized_Queue_Interfaces
- child of Ada.Containers *note A.18.27(3/3): 7336.
+ <child of> Ada.Containers *note A.18.27(3/3): 7336.
Synchronous_Barrier
- in Ada.Synchronous_Barriers *note D.10.1(5/3): 7986.
+ <in> Ada.Synchronous_Barriers *note D.10.1(5/3): 7986.
Synchronous_Barriers
- child of Ada *note D.10.1(3/3): 7984.
+ <child of> Ada *note D.10.1(3/3): 7984.
Synchronous_Task_Control
- child of Ada *note D.10(3/2): 7973.
+ <child of> Ada *note D.10(3/2): 7973.
syntactic category *note 1.1.4(15): 1066.
syntax
complete listing *note P(1): 8957.
@@ -88396,10 +88601,10 @@ System.Storage_Elements *note 13.7.1(2/2): 5132.
System.Storage_Pools *note 13.11(5): 5187.
System.Storage_Pools.Subpools *note 13.11.4(3/3): 5256.
System_Dispatching_Domain
- in System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
+ <in> System.Multiprocessors.Dispatching_Domains *note D.16.1(6/3):
8080.
System_Name
- in System *note 13.7(4): 5107.
+ <in> System *note 13.7(4): 5107.
systems programming *note C(1): 7617.
@@ -88412,7 +88617,7 @@ T
Tag
- in Ada.Tags *note 3.9(6/2): 2101.
+ <in> Ada.Tags *note 3.9(6/2): 2101.
Tag attribute *note 3.9(16): 2122, *note 3.9(18): 2124.
tag indeterminate *note 3.9.2(6/2): 2169.
tag of an object *note 3.9(3): 2093.
@@ -88423,24 +88628,25 @@ tag of an object *note 3.9(3): 2093.
returned by a function *note 3.9(23): 2129, *note 3.9(24/2): 2130.
stand-alone object, component, or aggregate *note 3.9(20): 2126.
Tag_Array
- in Ada.Tags *note 3.9(7.3/2): 2111.
+ <in> Ada.Tags *note 3.9(7.3/2): 2111.
Tag_Check *note 11.5(18): 4636.
- [partial] *note 3.9.2(16): 2175, *note 4.6(42): 2986, *note
+ [<partial>] *note 3.9.2(16): 2175, *note 4.6(42): 2986, *note
4.6(52): 3011, *note 5.2(10): 3162, *note 6.5(8.1/3): 3528.
Tag_Error
- in Ada.Tags *note 3.9(8): 2114.
+ <in> Ada.Tags *note 3.9(8): 2114.
tagged incomplete view *note 3.10.1(2.1/4): 2281.
tagged type *note 3.9(2/2): 2087, *note N(39): 8952.
protected *note 3.9.4(6/2): 2216.
synchronized *note 3.9.4(6/2): 2214.
task *note 3.9.4(6/2): 2215.
Tags
- child of Ada *note 3.9(6/2): 2100.
+ <child of> Ada *note 3.9(6/2): 2100.
Tail
- in Ada.Strings.Bounded *note A.4.4(72): 5897, *note A.4.4(73):
+ <in> Ada.Strings.Bounded *note A.4.4(72): 5897, *note A.4.4(73):
5898.
- in Ada.Strings.Fixed *note A.4.3(37): 5840, *note A.4.3(38): 5841.
- in Ada.Strings.Unbounded *note A.4.5(67): 5951, *note A.4.5(68):
+ <in> Ada.Strings.Fixed *note A.4.3(37): 5840, *note A.4.3(38):
+5841.
+ <in> Ada.Strings.Unbounded *note A.4.5(67): 5951, *note A.4.5(68):
5952.
tail (of a queue) *note D.2.1(5/2): 7778.
tamper with cursors
@@ -88464,13 +88670,15 @@ tampering
prohibited for a tree *note A.18.10(90/4): 7269.
prohibited for a vector *note A.18.2(97.1/4): 6806.
Tan
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(4): 8292.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5): 6119.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(5):
+6119.
Tanh
- in Ada.Numerics.Generic_Complex_Elementary_Functions *note
+ <in> Ada.Numerics.Generic_Complex_Elementary_Functions *note
G.1.2(6): 8300.
- in Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7): 6133.
+ <in> Ada.Numerics.Generic_Elementary_Functions *note A.5.1(7):
+6133.
target
of an assignment operation *note 5.2(3): 3155.
of an assignment_statement *note 5.2(3): 3156.
@@ -88491,9 +88699,9 @@ task *note 9(1/3): 3875.
task declaration *note 9.1(1): 3892.
task dispatching *note D.2.1(4/2): 7772.
task dispatching point *note D.2.1(4/2): 7774.
- [partial] *note D.2.3(8/2): 7800, *note D.2.4(9/3): 7809.
+ [<partial>] *note D.2.3(8/2): 7800, *note D.2.4(9/3): 7809.
task dispatching policy *note D.2.2(7/2): 7796.
- [partial] *note D.2.1(5/2): 7780.
+ [<partial>] *note D.2.1(5/2): 7780.
EDF_Across_Priorities *note D.2.6(7/2): 7819.
FIFO_Within_Priorities *note D.2.3(2/2): 7798.
Non_Preemptive_FIFO_Within_Priorities *note D.2.4(2/2): 7804.
@@ -88512,42 +88720,42 @@ task tagged type *note 3.9.4(6/2): 2217.
task type *note N(40/2): 8953.
task unit *note 9(9): 3882.
Task_Array
- in Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8033.
+ <in> Ada.Execution_Time.Group_Budgets *note D.14.2(6/2): 8033.
Task_Attributes
- child of Ada *note C.7.2(2): 7728.
+ <child of> Ada *note C.7.2(2): 7728.
task_body *note 9.1(6/3): 3911.
- used *note 3.11(6): 2342, *note P: 9194.
+ <used> *note 3.11(6): 2342, *note P: 9194.
task_body_stub *note 10.1.3(5/3): 4399.
- used *note 10.1.3(2): 4390, *note P: 9680.
+ <used> *note 10.1.3(2): 4390, *note P: 9680.
task_definition *note 9.1(4): 3904.
- used *note 9.1(2/3): 3898, *note 9.1(3/3): 3903, *note P: 9550.
+ <used> *note 9.1(2/3): 3898, *note 9.1(3/3): 3903, *note P: 9550.
Task_Dispatching_Policy pragma *note D.2.2(3): 7785, *note L(37):
8856.
Task_Id
- in Ada.Task_Identification *note C.7.1(2/2): 7709.
+ <in> Ada.Task_Identification *note C.7.1(2/2): 7709.
Task_Identification
- child of Ada *note C.7.1(2/2): 7708.
+ <child of> Ada *note C.7.1(2/2): 7708.
task_item *note 9.1(5/1): 3908.
- used *note 9.1(4): 3906, *note P: 9551.
+ <used> *note 9.1(4): 3906, *note P: 9551.
Task_Termination
- child of Ada *note C.7.3(2/2): 7740.
+ <child of> Ada *note C.7.3(2/2): 7740.
task_type_declaration *note 9.1(2/3): 3893.
- used *note 3.2.1(3/3): 1378, *note P: 9031.
+ <used> *note 3.2.1(3/3): 1378, *note P: 9031.
Tasking_Error
raised by failure of run-time check *note 9.2(5): 3940, *note
9.5.3(21): 4116, *note 11.1(4): 4522, *note 13.11.2(13): 5236, *note
13.11.2(14): 5238, *note C.7.2(13): 7734, *note D.5.1(8): 7868, *note
D.11(8): 7995.
- in Standard *note A.1(46): 5454.
+ <in> Standard *note A.1(46): 5454.
template *note 12(1): 4663.
for a formal package *note 12.7(4): 4864.
- See generic unit *note 12(1): 4664.
+ <See> generic unit *note 12(1): 4664.
term *note 4.4(5): 2700.
- used *note 4.4(4): 2697, *note P: 9301.
+ <used> *note 4.4(4): 2697, *note P: 9301.
terminal interrupt
example *note 9.7.4(10): 4271.
terminate_alternative *note 9.7.1(7): 4233.
- used *note 9.7.1(4): 4226, *note P: 9629.
+ <used> *note 9.7.1(4): 4226, *note P: 9629.
terminated
a task state *note 9(10): 3890.
Terminated attribute *note 9.9(3): 4302.
@@ -88557,30 +88765,30 @@ termination handler *note C.7.3(8/3): 7747.
fall-back *note C.7.3(9/2): 7750.
specific *note C.7.3(9/2): 7752.
Termination_Handler
- in Ada.Task_Termination *note C.7.3(4/2): 7742.
+ <in> Ada.Task_Termination *note C.7.3(4/2): 7742.
Terminator_Error
- in Interfaces.C *note B.3(40): 7491.
+ <in> Interfaces.C *note B.3(40): 7491.
tested type
of a membership test *note 4.5.2(3/3): 2794.
text of a program *note 2.2(1): 1179.
Text_IO
- child of Ada *note A.10.1(2): 6374.
+ <child of> Ada *note A.10.1(2): 6374.
Text_Streams
- child of Ada.Text_IO *note A.12.2(3): 6604.
- child of Ada.Wide_Text_IO *note A.12.3(3): 6607.
- child of Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 6610.
+ <child of> Ada.Text_IO *note A.12.2(3): 6604.
+ <child of> Ada.Wide_Text_IO *note A.12.3(3): 6607.
+ <child of> Ada.Wide_Wide_Text_IO *note A.12.4(3/2): 6610.
throw (an exception)
- See raise *note 11(1/3): 4509.
+ <See> raise *note 11(1/3): 4509.
Thursday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4182.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4182.
tick *note 2.1(15/3): 1155.
- in Ada.Real_Time *note D.8(6): 7951.
- in System *note 13.7(10): 5116.
+ <in> Ada.Real_Time *note D.8(6): 7951.
+ <in> System *note 13.7(10): 5116.
Tilde
- in Ada.Characters.Latin_1 *note A.3.3(14): 5591.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5591.
Time
- in Ada.Calendar *note 9.6(10): 4146.
- in Ada.Real_Time *note D.8(4): 7942.
+ <in> Ada.Calendar *note 9.6(10): 4146.
+ <in> Ada.Real_Time *note D.8(4): 7942.
time base *note 9.6(6/3): 4143.
time limit
example *note 9.7.4(12): 4274.
@@ -88589,225 +88797,225 @@ Time-dependent Reset procedure
of the random number generator *note A.5.2(34): 6174.
time-out
example *note 9.7.4(12): 4273.
- See asynchronous_select *note 9.7.4(12): 4272.
- See selective_accept *note 9.7.1(1): 4214.
- See timed_entry_call *note 9.7.2(1/2): 4240.
+ <See> asynchronous_select *note 9.7.4(12): 4272.
+ <See> selective_accept *note 9.7.1(1): 4214.
+ <See> timed_entry_call *note 9.7.2(1/2): 4240.
Time_Error
- in Ada.Calendar *note 9.6(18): 4158.
+ <in> Ada.Calendar *note 9.6(18): 4158.
Time_First
- in Ada.Real_Time *note D.8(4): 7943.
+ <in> Ada.Real_Time *note D.8(4): 7943.
Time_Last
- in Ada.Real_Time *note D.8(4): 7944.
+ <in> Ada.Real_Time *note D.8(4): 7944.
Time_Of
- in Ada.Calendar *note 9.6(15): 4157.
- in Ada.Calendar.Formatting *note 9.6.1(30/2): 4200, *note
+ <in> Ada.Calendar *note 9.6(15): 4157.
+ <in> Ada.Calendar.Formatting *note 9.6.1(30/2): 4200, *note
9.6.1(31/2): 4201.
- in Ada.Execution_Time *note D.14(9/2): 8007.
- in Ada.Real_Time *note D.8(16): 7962.
+ <in> Ada.Execution_Time *note D.14(9/2): 8007.
+ <in> Ada.Real_Time *note D.8(16): 7962.
Time_Of_Event
- in Ada.Real_Time.Timing_Events *note D.15(6/2): 8065.
+ <in> Ada.Real_Time.Timing_Events *note D.15(6/2): 8065.
Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4170.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(4/2): 4170.
Time_Remaining
- in Ada.Execution_Time.Timers *note D.14.1(8/2): 8023.
+ <in> Ada.Execution_Time.Timers *note D.14.1(8/2): 8023.
Time_Span
- in Ada.Real_Time *note D.8(5): 7946.
+ <in> Ada.Real_Time *note D.8(5): 7946.
Time_Span_First
- in Ada.Real_Time *note D.8(5): 7947.
+ <in> Ada.Real_Time *note D.8(5): 7947.
Time_Span_Last
- in Ada.Real_Time *note D.8(5): 7948.
+ <in> Ada.Real_Time *note D.8(5): 7948.
Time_Span_Unit
- in Ada.Real_Time *note D.8(5): 7950.
+ <in> Ada.Real_Time *note D.8(5): 7950.
Time_Span_Zero
- in Ada.Real_Time *note D.8(5): 7949.
+ <in> Ada.Real_Time *note D.8(5): 7949.
Time_Unit
- in Ada.Real_Time *note D.8(4): 7945.
+ <in> Ada.Real_Time *note D.8(4): 7945.
Time_Zones
- child of Ada.Calendar *note 9.6.1(2/2): 4169.
+ <child of> Ada.Calendar *note 9.6.1(2/2): 4169.
timed_entry_call *note 9.7.2(2): 4241.
- used *note 9.7(2): 4211, *note P: 9618.
+ <used> *note 9.7(2): 4211, *note P: 9618.
Timer
- in Ada.Execution_Time.Timers *note D.14.1(4/2): 8016.
+ <in> Ada.Execution_Time.Timers *note D.14.1(4/2): 8016.
timer interrupt
example *note 9.7.4(12): 4276.
Timer_Handler
- in Ada.Execution_Time.Timers *note D.14.1(5/2): 8017.
+ <in> Ada.Execution_Time.Timers *note D.14.1(5/2): 8017.
Timer_Resource_Error
- in Ada.Execution_Time.Timers *note D.14.1(9/2): 8024.
+ <in> Ada.Execution_Time.Timers *note D.14.1(9/2): 8024.
Timers
- child of Ada.Execution_Time *note D.14.1(3/2): 8015.
+ <child of> Ada.Execution_Time *note D.14.1(3/2): 8015.
times operator *note 4.4(1/3): 2636, *note 4.5.5(1): 2844.
timing
- See delay_statement *note 9.6(1): 4132.
+ <See> delay_statement *note 9.6(1): 4132.
Timing_Event
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8059.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8059.
Timing_Event_Handler
- in Ada.Real_Time.Timing_Events *note D.15(4/2): 8060.
+ <in> Ada.Real_Time.Timing_Events *note D.15(4/2): 8060.
Timing_Events
- child of Ada.Real_Time *note D.15(3/2): 8058.
+ <child of> Ada.Real_Time *note D.15(3/2): 8058.
To_Ada
- in Interfaces.C *note B.3(22): 7454, *note B.3(26): 7458, *note
+ <in> Interfaces.C *note B.3(22): 7454, *note B.3(26): 7458, *note
B.3(28): 7460, *note B.3(32): 7464, *note B.3(37): 7468, *note B.3(39):
7470, *note B.3(39.10/2): 7480, *note B.3(39.13/2): 7484, *note
B.3(39.17/2): 7488, *note B.3(39.19/2): 7490, *note B.3(39.4/2): 7474,
*note B.3(39.8/2): 7478.
- in Interfaces.COBOL *note B.4(17): 7559, *note B.4(19): 7561.
- in Interfaces.Fortran *note B.5(13): 7612, *note B.5(14): 7614,
+ <in> Interfaces.COBOL *note B.4(17): 7559, *note B.4(19): 7561.
+ <in> Interfaces.Fortran *note B.5(13): 7612, *note B.5(14): 7614,
*note B.5(16): 7616.
To_Address
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5146.
- in System.Storage_Elements *note 13.7.1(10/3): 5139.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5146.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5139.
To_Basic
- in Ada.Characters.Handling *note A.3.2(6): 5479, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 5479, *note A.3.2(7):
5482.
To_Binary
- in Interfaces.COBOL *note B.4(45): 7591, *note B.4(48): 7594.
+ <in> Interfaces.COBOL *note B.4(45): 7591, *note B.4(48): 7594.
To_Bounded_String
- in Ada.Strings.Bounded *note A.4.4(11): 5850.
+ <in> Ada.Strings.Bounded *note A.4.4(11): 5850.
To_C
- in Interfaces.C *note B.3(21): 7453, *note B.3(25): 7457, *note
+ <in> Interfaces.C *note B.3(21): 7453, *note B.3(25): 7457, *note
B.3(27): 7459, *note B.3(32): 7463, *note B.3(36): 7467, *note B.3(38):
7469, *note B.3(39.13/2): 7483, *note B.3(39.16/2): 7487, *note
B.3(39.18/2): 7489, *note B.3(39.4/2): 7473, *note B.3(39.7/2): 7477,
*note B.3(39.9/2): 7479.
To_Character
- in Ada.Characters.Conversions *note A.3.4(5/2): 5744.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 5744.
To_Chars_Ptr
- in Interfaces.C.Strings *note B.3.1(8): 7501.
+ <in> Interfaces.C.Strings *note B.3.1(8): 7501.
To_COBOL
- in Interfaces.COBOL *note B.4(17): 7558, *note B.4(18): 7560.
+ <in> Interfaces.COBOL *note B.4(17): 7558, *note B.4(18): 7560.
To_Cursor
- in Ada.Containers.Vectors *note A.18.2(25/2): 6741.
+ <in> Ada.Containers.Vectors *note A.18.2(25/2): 6741.
To_Decimal
- in Interfaces.COBOL *note B.4(35): 7582, *note B.4(40): 7586, *note
-B.4(44): 7590, *note B.4(47): 7593.
+ <in> Interfaces.COBOL *note B.4(35): 7582, *note B.4(40): 7586,
+*note B.4(44): 7590, *note B.4(47): 7593.
To_Display
- in Interfaces.COBOL *note B.4(36): 7583.
+ <in> Interfaces.COBOL *note B.4(36): 7583.
To_Domain
- in Ada.Strings.Maps *note A.4.2(24): 5801.
- in Ada.Strings.Wide_Maps *note A.4.7(24): 6003.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6042.
+ <in> Ada.Strings.Maps *note A.4.2(24): 5801.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(24): 6003.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(24/2): 6042.
To_Duration
- in Ada.Real_Time *note D.8(13): 7953.
+ <in> Ada.Real_Time *note D.8(13): 7953.
To_Fortran
- in Interfaces.Fortran *note B.5(13): 7611, *note B.5(14): 7613,
+ <in> Interfaces.Fortran *note B.5(13): 7611, *note B.5(14): 7613,
*note B.5(15): 7615.
To_Holder
- in Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7287.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(9/3): 7287.
To_Index
- in Ada.Containers.Vectors *note A.18.2(26/2): 6742.
+ <in> Ada.Containers.Vectors *note A.18.2(26/2): 6742.
To_Integer
- in System.Storage_Elements *note 13.7.1(10/3): 5140.
+ <in> System.Storage_Elements *note 13.7.1(10/3): 5140.
To_ISO_646
- in Ada.Characters.Handling *note A.3.2(11): 5486, *note A.3.2(12):
-5487.
+ <in> Ada.Characters.Handling *note A.3.2(11): 5486, *note
+A.3.2(12): 5487.
To_Long_Binary
- in Interfaces.COBOL *note B.4(48): 7595.
+ <in> Interfaces.COBOL *note B.4(48): 7595.
To_Lower
- in Ada.Characters.Handling *note A.3.2(6): 5477, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 5477, *note A.3.2(7):
5480.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 5765, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 5765, *note
A.3.5(21/3): 5767.
To_Mapping
- in Ada.Strings.Maps *note A.4.2(23): 5800.
- in Ada.Strings.Wide_Maps *note A.4.7(23): 6002.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6041.
+ <in> Ada.Strings.Maps *note A.4.2(23): 5800.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(23): 6002.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(23/2): 6041.
To_Packed
- in Interfaces.COBOL *note B.4(41): 7587.
+ <in> Interfaces.COBOL *note B.4(41): 7587.
To_Picture
- in Ada.Text_IO.Editing *note F.3.3(6): 8237.
+ <in> Ada.Text_IO.Editing *note F.3.3(6): 8237.
To_Pointer
- in System.Address_To_Access_Conversions *note 13.7.2(3/3): 5145.
+ <in> System.Address_To_Access_Conversions *note 13.7.2(3/3): 5145.
To_Range
- in Ada.Strings.Maps *note A.4.2(24): 5802.
- in Ada.Strings.Wide_Maps *note A.4.7(25): 6004.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6043.
+ <in> Ada.Strings.Maps *note A.4.2(24): 5802.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(25): 6004.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(25/2): 6043.
To_Ranges
- in Ada.Strings.Maps *note A.4.2(10): 5790.
- in Ada.Strings.Wide_Maps *note A.4.7(10): 5992.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6031.
+ <in> Ada.Strings.Maps *note A.4.2(10): 5790.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(10): 5992.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(10/2): 6031.
To_Sequence
- in Ada.Strings.Maps *note A.4.2(19): 5796.
- in Ada.Strings.Wide_Maps *note A.4.7(19): 5998.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6037.
+ <in> Ada.Strings.Maps *note A.4.2(19): 5796.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(19): 5998.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(19/2): 6037.
To_Set
- in Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7048.
- in Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7121.
- in Ada.Strings.Maps *note A.4.2(8): 5788, *note A.4.2(9): 5789,
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(9/2): 7048.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(10/2): 7121.
+ <in> Ada.Strings.Maps *note A.4.2(8): 5788, *note A.4.2(9): 5789,
*note A.4.2(17): 5794, *note A.4.2(18): 5795.
- in Ada.Strings.Wide_Maps *note A.4.7(8): 5990, *note A.4.7(9):
+ <in> Ada.Strings.Wide_Maps *note A.4.7(8): 5990, *note A.4.7(9):
5991, *note A.4.7(17): 5996, *note A.4.7(18): 5997.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6029, *note
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(8/2): 6029, *note
A.4.8(9/2): 6030, *note A.4.8(17/2): 6035, *note A.4.8(18/2): 6036.
To_String
- in Ada.Characters.Conversions *note A.3.4(5/2): 5745.
- in Ada.Strings.Bounded *note A.4.4(12): 5851.
- in Ada.Strings.Unbounded *note A.4.5(11): 5910.
+ <in> Ada.Characters.Conversions *note A.3.4(5/2): 5745.
+ <in> Ada.Strings.Bounded *note A.4.4(12): 5851.
+ <in> Ada.Strings.Unbounded *note A.4.5(11): 5910.
To_Time_Span
- in Ada.Real_Time *note D.8(13): 7954.
+ <in> Ada.Real_Time *note D.8(13): 7954.
To_Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(9): 5908, *note A.4.5(10):
+ <in> Ada.Strings.Unbounded *note A.4.5(9): 5908, *note A.4.5(10):
5909.
To_Upper
- in Ada.Characters.Handling *note A.3.2(6): 5478, *note A.3.2(7):
+ <in> Ada.Characters.Handling *note A.3.2(6): 5478, *note A.3.2(7):
5481.
- in Ada.Wide_Characters.Handling *note A.3.5(20/3): 5766, *note
+ <in> Ada.Wide_Characters.Handling *note A.3.5(20/3): 5766, *note
A.3.5(21/3): 5768.
To_Vector
- in Ada.Containers.Vectors *note A.18.2(13/2): 6733, *note
+ <in> Ada.Containers.Vectors *note A.18.2(13/2): 6733, *note
A.18.2(14/2): 6734.
To_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 5736, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5736, *note
A.3.4(5/2): 5746.
To_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 5737, *note
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5737, *note
A.3.4(5/2): 5747.
To_Wide_Wide_Character
- in Ada.Characters.Conversions *note A.3.4(4/2): 5738.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5738.
To_Wide_Wide_String
- in Ada.Characters.Conversions *note A.3.4(4/2): 5739.
+ <in> Ada.Characters.Conversions *note A.3.4(4/2): 5739.
token
- See lexical element *note 2.2(1): 1181.
+ <See> lexical element *note 2.2(1): 1181.
Trailing_Nonseparate
- in Interfaces.COBOL *note B.4(23): 7568.
+ <in> Interfaces.COBOL *note B.4(23): 7568.
Trailing_Separate
- in Interfaces.COBOL *note B.4(23): 7566.
+ <in> Interfaces.COBOL *note B.4(23): 7566.
transfer of control *note 5.1(14/2): 3148.
Translate
- in Ada.Strings.Bounded *note A.4.4(53): 5879, *note A.4.4(54):
+ <in> Ada.Strings.Bounded *note A.4.4(53): 5879, *note A.4.4(54):
5880, *note A.4.4(55): 5881, *note A.4.4(56): 5882.
- in Ada.Strings.Fixed *note A.4.3(18): 5822, *note A.4.3(19): 5823,
-*note A.4.3(20): 5824, *note A.4.3(21): 5825.
- in Ada.Strings.Unbounded *note A.4.5(48): 5933, *note A.4.5(49):
+ <in> Ada.Strings.Fixed *note A.4.3(18): 5822, *note A.4.3(19):
+5823, *note A.4.3(20): 5824, *note A.4.3(21): 5825.
+ <in> Ada.Strings.Unbounded *note A.4.5(48): 5933, *note A.4.5(49):
5934, *note A.4.5(50): 5935, *note A.4.5(51): 5936.
Translation_Error
- in Ada.Strings *note A.4.1(5): 5777.
+ <in> Ada.Strings *note A.4.1(5): 5777.
Transpose
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 8414.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 8374.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(34/2): 8414.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(17/2): 8374.
Tree
- in Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7202.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(8/3): 7202.
Tree_Iterator_Interfaces
- in Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7207.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(13/3): 7207.
triggering_alternative *note 9.7.4(3): 4258.
- used *note 9.7.4(2): 4256, *note P: 9642.
+ <used> *note 9.7.4(2): 4256, *note P: 9642.
triggering_statement *note 9.7.4(4/2): 4261.
- used *note 9.7.4(3): 4259, *note P: 9644.
+ <used> *note 9.7.4(3): 4259, *note P: 9644.
Trim
- in Ada.Strings.Bounded *note A.4.4(67): 5891, *note A.4.4(68):
+ <in> Ada.Strings.Bounded *note A.4.4(67): 5891, *note A.4.4(68):
5893, *note A.4.4(69): 5894.
- in Ada.Strings.Fixed *note A.4.3(31): 5834, *note A.4.3(32): 5835,
-*note A.4.3(33): 5836, *note A.4.3(34): 5837.
- in Ada.Strings.Unbounded *note A.4.5(61): 5945, *note A.4.5(62):
+ <in> Ada.Strings.Fixed *note A.4.3(31): 5834, *note A.4.3(32):
+5835, *note A.4.3(33): 5836, *note A.4.3(34): 5837.
+ <in> Ada.Strings.Unbounded *note A.4.5(61): 5945, *note A.4.5(62):
5946, *note A.4.5(63): 5947, *note A.4.5(64): 5948.
Trim_End
- in Ada.Strings *note A.4.1(6): 5782.
+ <in> Ada.Strings *note A.4.1(6): 5782.
True *note 3.5.3(1): 1715.
Truncation
- in Ada.Strings *note A.4.1(6): 5779.
+ <in> Ada.Strings *note A.4.1(6): 5779.
Truncation attribute *note A.5.3(42): 6230.
Tuesday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4180.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4180.
two's complement
modular types *note 3.5.4(29): 1767.
type *note 3.2(1): 1328, *note N(41/2): 8954.
@@ -88815,10 +89023,10 @@ type *note 3.2(1): 1328, *note N(41/2): 8954.
needs finalization *note 7.6(9.1/2): 3671.
of a subtype *note 3.2(8/2): 1355.
synchronized tagged *note 3.9.4(6/2): 2213.
- See also tag *note 3.9(3): 2097.
- See also language-defined types
+ <See also> tag *note 3.9(3): 2097.
+ <See also> language-defined types
type conformance *note 6.3.1(15/2): 3427.
- [partial] *note 3.4(17/2): 1552, *note 8.3(8): 3749, *note
+ [<partial>] *note 3.4(17/2): 1552, *note 8.3(8): 3749, *note
8.3(26/2): 3771, *note 10.1.4(4/3): 4415.
required *note 3.11.1(5): 2356, *note 4.1.4(14/2): 2449, *note
8.6(26): 3866, *note 9.1(9.2/3): 3921, *note 9.1(9.5/3): 3923, *note
@@ -88833,40 +89041,40 @@ type conversion *note 4.6(1/3): 2920.
enumeration *note 4.6(21.1/2): 2942, *note 4.6(34): 2973.
numeric *note 4.6(24.1/2): 2944, *note 4.6(29): 2970.
unchecked *note 13.9(1): 5155.
- See also qualified_expression *note 4.7(1): 3024.
+ <See also> qualified_expression *note 4.7(1): 3024.
type conversion, implicit
- See implicit subtype conversion *note 4.6(1/3): 2924.
+ <See> implicit subtype conversion *note 4.6(1/3): 2924.
type extension *note 3.9(2/2): 2088, *note 3.9.1(1/2): 2135.
type invariant *note N(41.1/4): 8955.
class-wide *note 7.3.2(3/4): 3633.
type of a discrete_range *note 3.6.1(4): 1938.
type of a range *note 3.5(4): 1594.
type parameter
- See discriminant *note 3.7(1/2): 1965.
+ <See> discriminant *note 3.7(1/2): 1965.
type profile
- See profile, type conformant *note 6.3.1(15/2): 3429.
+ <See> profile, type conformant *note 6.3.1(15/2): 3429.
type resolution rules *note 8.6(20/2): 3860.
if any type in a specified class of types is expected *note
8.6(21): 3861.
if expected type is specific *note 8.6(22): 3863.
if expected type is universal or class-wide *note 8.6(21): 3862.
type tag
- See tag *note 3.9(3): 2095.
+ <See> tag *note 3.9(3): 2095.
type-related
aspect *note 13.1(8.1/3): 4896, *note 13.1(8/3): 4891.
operational item *note 13.1(8.1/3): 4895.
representation item *note 13.1(8/3): 4889.
type_conversion *note 4.6(2): 2925.
- used *note 4.1(2/3): 2366, *note P: 9202.
- See also unchecked type conversion *note 13.9(1): 5157.
+ <used> *note 4.1(2/3): 2366, *note P: 9202.
+ <See also> unchecked type conversion *note 13.9(1): 5157.
type_declaration *note 3.2.1(2): 1368.
- used *note 3.1(3/3): 1293, *note P: 9009.
+ <used> *note 3.1(3/3): 1293, *note P: 9009.
type_definition *note 3.2.1(4/2): 1380.
- used *note 3.2.1(3/3): 1376, *note P: 9029.
+ <used> *note 3.2.1(3/3): 1376, *note P: 9029.
Type_Invariant aspect *note 7.3.2(2/3): 3629.
Type_Invariant'Class aspect *note 7.3.2(3/4): 3631.
Type_Set
- in Ada.Text_IO *note A.10.1(7): 6382.
+ <in> Ada.Text_IO *note A.10.1(7): 6382.
types
of a profile *note 6.1(29): 3343.
@@ -88880,101 +89088,101 @@ U
UC_A_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 5666.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5666.
UC_A_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5667.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5667.
UC_A_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5669.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5669.
UC_A_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 5665.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5665.
UC_A_Ring
- in Ada.Characters.Latin_1 *note A.3.3(23): 5670.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5670.
UC_A_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(23): 5668.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5668.
UC_AE_Diphthong
- in Ada.Characters.Latin_1 *note A.3.3(23): 5671.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5671.
UC_C_Cedilla
- in Ada.Characters.Latin_1 *note A.3.3(23): 5672.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5672.
UC_E_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 5674.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5674.
UC_E_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5675.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5675.
UC_E_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5676.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5676.
UC_E_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 5673.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5673.
UC_I_Acute
- in Ada.Characters.Latin_1 *note A.3.3(23): 5678.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5678.
UC_I_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(23): 5679.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5679.
UC_I_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(23): 5680.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5680.
UC_I_Grave
- in Ada.Characters.Latin_1 *note A.3.3(23): 5677.
+ <in> Ada.Characters.Latin_1 *note A.3.3(23): 5677.
UC_Icelandic_Eth
- in Ada.Characters.Latin_1 *note A.3.3(24): 5681.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5681.
UC_Icelandic_Thorn
- in Ada.Characters.Latin_1 *note A.3.3(24): 5695.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5695.
UC_N_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(24): 5682.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5682.
UC_O_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 5684.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5684.
UC_O_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 5685.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5685.
UC_O_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 5687.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5687.
UC_O_Grave
- in Ada.Characters.Latin_1 *note A.3.3(24): 5683.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5683.
UC_O_Oblique_Stroke
- in Ada.Characters.Latin_1 *note A.3.3(24): 5689.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5689.
UC_O_Tilde
- in Ada.Characters.Latin_1 *note A.3.3(24): 5686.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5686.
UC_U_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 5691.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5691.
UC_U_Circumflex
- in Ada.Characters.Latin_1 *note A.3.3(24): 5692.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5692.
UC_U_Diaeresis
- in Ada.Characters.Latin_1 *note A.3.3(24): 5693.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5693.
UC_U_Grave
- in Ada.Characters.Latin_1 *note A.3.3(24): 5690.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5690.
UC_Y_Acute
- in Ada.Characters.Latin_1 *note A.3.3(24): 5694.
+ <in> Ada.Characters.Latin_1 *note A.3.3(24): 5694.
UCHAR_MAX
- in Interfaces.C *note B.3(6): 7436.
+ <in> Interfaces.C *note B.3(6): 7436.
ultimate ancestor
of a type *note 3.4.1(10/2): 1578.
unary adding operator *note 4.5.4(1): 2828.
unary operator *note 4.5(9): 2734.
unary_adding_operator *note 4.5(5): 2727.
- used *note 4.4(4): 2696, *note P: 9298.
+ <used> *note 4.4(4): 2696, *note P: 9298.
Unbiased_Rounding attribute *note A.5.3(39): 6225.
Unbounded
- child of Ada.Strings *note A.4.5(3): 5902.
- in Ada.Text_IO *note A.10.1(5): 6379.
+ <child of> Ada.Strings *note A.4.5(3): 5902.
+ <in> Ada.Text_IO *note A.10.1(5): 6379.
Unbounded_IO
- child of Ada.Text_IO *note A.10.12(3/2): 6546.
- child of Ada.Wide_Text_IO *note A.11(5/3): 6563.
- child of Ada.Wide_Wide_Text_IO *note A.11(5/3): 6564.
+ <child of> Ada.Text_IO *note A.10.12(3/2): 6546.
+ <child of> Ada.Wide_Text_IO *note A.11(5/3): 6563.
+ <child of> Ada.Wide_Wide_Text_IO *note A.11(5/3): 6564.
Unbounded_Priority_Queues
- child of Ada.Containers *note A.18.30(2/3): 7355.
+ <child of> Ada.Containers *note A.18.30(2/3): 7355.
Unbounded_Slice
- in Ada.Strings.Unbounded *note A.4.5(22.1/2): 5918, *note
+ <in> Ada.Strings.Unbounded *note A.4.5(22.1/2): 5918, *note
A.4.5(22.2/2): 5919.
Unbounded_String
- in Ada.Strings.Unbounded *note A.4.5(4/2): 5903.
+ <in> Ada.Strings.Unbounded *note A.4.5(4/2): 5903.
Unbounded_Synchronized_Queues
- child of Ada.Containers *note A.18.28(2/3): 7343.
+ <child of> Ada.Containers *note A.18.28(2/3): 7343.
unchecked storage deallocation *note 13.11.2(1): 5223.
unchecked type conversion *note 13.9(1): 5154.
unchecked union object *note B.3.3(6/3): 7539.
unchecked union subtype *note B.3.3(6/3): 7538.
unchecked union type *note B.3.3(6/3): 7537.
Unchecked_Access attribute *note 13.10(3): 5181, *note H.4(18): 8471.
- See also Access attribute *note 3.10.2(25/1): 2308.
+ <See also> Access attribute *note 3.10.2(25/1): 2308.
Unchecked_Conversion
- child of Ada *note 13.9(3/3): 5159.
+ <child of> Ada *note 13.9(3/3): 5159.
Unchecked_Deallocation
- child of Ada *note 13.11.2(3/3): 5228.
+ <child of> Ada *note 13.11.2(3/3): 5228.
Unchecked_Union aspect *note B.3.3(3.2/3): 7536.
Unchecked_Union pragma *note J.15.6(2/3): 8586, *note L(37.2/3): 8859.
unconstrained *note 3.2(9): 1363.
@@ -88988,20 +89196,20 @@ unconstrained *note 3.2(9): 1363.
subtype *note 3.10(14/3): 2270.
subtype *note K.2(33): 8653.
unconstrained_array_definition *note 3.6(3): 1890.
- used *note 3.6(2): 1888, *note P: 9105.
+ <used> *note 3.6(2): 1888, *note P: 9105.
undefined result *note 11.6(5): 4656.
underline *note 2.1(15/3): 1175.
- used *note 2.4.1(3): 1217, *note 2.4.2(4): 1242, *note P: 8981.
-Uniformly_Distributed subtype of Float
- in Ada.Numerics.Float_Random *note A.5.2(8): 6149.
+ <used> *note 2.4.1(3): 1217, *note 2.4.2(4): 1242, *note P: 8981.
+Uniformly_Distributed <subtype of> Float
+ <in> Ada.Numerics.Float_Random *note A.5.2(8): 6149.
uninitialized allocator *note 4.8(4): 3053.
uninitialized variables *note 13.9.1(2): 5165.
- [partial] *note 3.3.1(21/3): 1520.
+ [<partial>] *note 3.3.1(21/3): 1520.
union
C *note B.3.3(1/3): 7534.
- in Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7068, *note
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(26/2): 7068, *note
A.18.8(27/2): 7069.
- in Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7141, *note
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(27/2): 7141, *note
A.18.9(28/2): 7142.
unit consistency *note E.3(6): 8176.
unit matrix
@@ -89011,43 +89219,43 @@ unit vector
complex vector *note G.3.2(90/2): 8424.
real vector *note G.3.1(48/2): 8384.
Unit_Matrix
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 8421.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 8381.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(51/2): 8421.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(29/2): 8381.
Unit_Vector
- in Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 8401.
- in Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 8373.
+ <in> Ada.Numerics.Generic_Complex_Arrays *note G.3.2(24/2): 8401.
+ <in> Ada.Numerics.Generic_Real_Arrays *note G.3.1(14/2): 8373.
universal type *note 3.4.1(6/2): 1568.
universal_access
- [partial] *note 3.4.1(6/2): 1572, *note 4.2(8/2): 2483.
+ [<partial>] *note 3.4.1(6/2): 1572, *note 4.2(8/2): 2483.
universal_fixed
- [partial] *note 3.4.1(6/2): 1571, *note 3.5.6(4): 1791.
+ [<partial>] *note 3.4.1(6/2): 1571, *note 3.5.6(4): 1791.
universal_integer
- [partial] *note 3.4.1(6/2): 1569, *note 3.5.4(14): 1746, *note
+ [<partial>] *note 3.4.1(6/2): 1569, *note 3.5.4(14): 1746, *note
3.5.4(30): 1768, *note 4.2(8/2): 2481.
universal_real
- [partial] *note 3.4.1(6/2): 1570, *note 3.5.6(4): 1789, *note
+ [<partial>] *note 3.4.1(6/2): 1570, *note 3.5.6(4): 1789, *note
4.2(8/2): 2482.
unknown discriminants *note 3.7(26): 1996.
unknown_discriminant_part *note 3.7(3): 1970.
- used *note 3.7(2/2): 1968, *note P: 9122.
+ <used> *note 3.7(2/2): 1968, *note P: 9122.
Unknown_Zone_Error
- in Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4171.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(5/2): 4171.
unmarshalling *note E.4(9): 8184.
unpolluted *note 13.13.1(2): 5334.
unsigned
- in Interfaces.C *note B.3(9): 7441.
- in Interfaces.COBOL *note B.4(23): 7564.
+ <in> Interfaces.C *note B.3(9): 7441.
+ <in> Interfaces.COBOL *note B.4(23): 7564.
unsigned type
- See modular type *note 3.5.4(1): 1720.
+ <See> modular type *note 3.5.4(1): 1720.
unsigned_char
- in Interfaces.C *note B.3(10): 7444.
+ <in> Interfaces.C *note B.3(10): 7444.
unsigned_long
- in Interfaces.C *note B.3(9): 7443.
+ <in> Interfaces.C *note B.3(9): 7443.
Unsigned_N *note B.2(8): 7426.
unsigned_short
- in Interfaces.C *note B.3(9): 7442.
+ <in> Interfaces.C *note B.3(9): 7442.
unspecified *note 1.1.3(18): 1055.
- [partial] *note 2.1(5/3): 1130, *note 3.9(4/2): 2099, *note
+ [<partial>] *note 2.1(5/3): 1130, *note 3.9(4/2): 2099, *note
3.9(12.5/3): 2116, *note 4.5.2(13): 2796, *note 4.5.2(24.2/1): 2799,
*note 4.5.5(21): 2854, *note 4.6(58.4/4): 3020, *note 6.1.1(34/3): 3381,
*note 6.1.1(35/3): 3386, *note 6.2(11/3): 3396, *note 7.2(5/3): 3593,
@@ -89079,63 +89287,63 @@ K.2(136.4/2): 8671.
Unsuppress pragma *note 11.5(4.1/2): 4621, *note L(37.3/2): 8862.
update
the value of an object *note 3.3(14): 1464.
- in Interfaces.C.Strings *note B.3.1(18): 7511, *note B.3.1(19):
+ <in> Interfaces.C.Strings *note B.3.1(18): 7511, *note B.3.1(19):
7512.
Update_Element
- in Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 6835.
- in Ada.Containers.Hashed_Maps *note A.18.5(17/2): 6924.
- in Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7293.
- in Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7220.
- in Ada.Containers.Ordered_Maps *note A.18.6(16/2): 6975.
- in Ada.Containers.Vectors *note A.18.2(33/2): 6749, *note
+ <in> Ada.Containers.Doubly_Linked_Lists *note A.18.3(17/2): 6835.
+ <in> Ada.Containers.Hashed_Maps *note A.18.5(17/2): 6924.
+ <in> Ada.Containers.Indefinite_Holders *note A.18.18(15/3): 7293.
+ <in> Ada.Containers.Multiway_Trees *note A.18.10(27/3): 7220.
+ <in> Ada.Containers.Ordered_Maps *note A.18.6(16/2): 6975.
+ <in> Ada.Containers.Vectors *note A.18.2(33/2): 6749, *note
A.18.2(34/2): 6750.
Update_Element_Preserving_Key
- in Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7095.
- in Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7176.
+ <in> Ada.Containers.Hashed_Sets *note A.18.8(58/2): 7095.
+ <in> Ada.Containers.Ordered_Sets *note A.18.9(73/2): 7176.
Update_Error
- in Interfaces.C.Strings *note B.3.1(20): 7513.
+ <in> Interfaces.C.Strings *note B.3.1(20): 7513.
upper bound
of a range *note 3.5(4): 1593.
upper-case letter
a category of Character *note A.3.2(26): 5492.
Upper_Case_Map
- in Ada.Strings.Maps.Constants *note A.4.6(5): 5967.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(5): 5967.
Upper_Set
- in Ada.Strings.Maps.Constants *note A.4.6(4): 5959.
+ <in> Ada.Strings.Maps.Constants *note A.4.6(4): 5959.
US
- in Ada.Characters.Latin_1 *note A.3.3(6): 5531.
+ <in> Ada.Characters.Latin_1 *note A.3.3(6): 5531.
usage name *note 3.1(10): 1322.
use-visible *note 8.3(4): 3742, *note 8.4(9): 3786.
use_clause *note 8.4(2): 3774.
- used *note 3.11(4/1): 2335, *note 10.1.2(3): 4372, *note 12.1(5):
+ <used> *note 3.11(4/1): 2335, *note 10.1.2(3): 4372, *note 12.1(5):
4679, *note P: 9716.
Use_Error
- in Ada.Direct_IO *note A.8.4(18): 6350.
- in Ada.Directories *note A.16(43/2): 6673.
- in Ada.IO_Exceptions *note A.13(4): 6617.
- in Ada.Sequential_IO *note A.8.1(15): 6318.
- in Ada.Streams.Stream_IO *note A.12.1(26): 6598.
- in Ada.Text_IO *note A.10.1(85): 6523.
+ <in> Ada.Direct_IO *note A.8.4(18): 6350.
+ <in> Ada.Directories *note A.16(43/2): 6673.
+ <in> Ada.IO_Exceptions *note A.13(4): 6617.
+ <in> Ada.Sequential_IO *note A.8.1(15): 6318.
+ <in> Ada.Streams.Stream_IO *note A.12.1(26): 6598.
+ <in> Ada.Text_IO *note A.10.1(85): 6523.
use_package_clause *note 8.4(3): 3777.
- used *note 8.4(2): 3775, *note P: 9503.
+ <used> *note 8.4(2): 3775, *note P: 9503.
use_type_clause *note 8.4(4/3): 3780.
- used *note 8.4(2): 3776, *note P: 9504.
+ <used> *note 8.4(2): 3776, *note P: 9504.
user-defined assignment *note 7.6(1): 3652.
user-defined heap management *note 13.11(1): 5185.
user-defined operator *note 6.6(1): 3540.
user-defined storage management *note 13.11(1): 5183.
UTC_Time_Offset
- in Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4172.
+ <in> Ada.Calendar.Time_Zones *note 9.6.1(6/2): 4172.
UTF-16 *note A.4.11(46/3): 6105.
UTF-8 *note A.4.11(46/3): 6104.
-UTF_16_Wide_String subtype of Wide_String
- in Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6068.
-UTF_8_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6067.
+UTF_16_Wide_String <subtype of> Wide_String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(7/3): 6068.
+UTF_8_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(6/3): 6067.
UTF_Encoding
- child of Ada.Strings *note A.4.11(3/3): 6064.
-UTF_String subtype of String
- in Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6066.
+ <child of> Ada.Strings *note A.4.11(3/3): 6064.
+UTF_String <subtype of> String
+ <in> Ada.Strings.UTF_Encoding *note A.4.11(5/3): 6066.
@@ -89148,24 +89356,25 @@ V
Val attribute *note 3.5.5(5): 1773.
Valid
- in Ada.Text_IO.Editing *note F.3.3(5): 8236, *note F.3.3(12): 8248.
- in Interfaces.COBOL *note B.4(33): 7580, *note B.4(38): 7584, *note
-B.4(43): 7588.
+ <in> Ada.Text_IO.Editing *note F.3.3(5): 8236, *note F.3.3(12):
+8248.
+ <in> Interfaces.COBOL *note B.4(33): 7580, *note B.4(38): 7584,
+*note B.4(43): 7588.
Valid attribute *note 13.9.2(3/4): 5178, *note H(6): 8430.
Value
- in Ada.Calendar.Formatting *note 9.6.1(36/2): 4206, *note
+ <in> Ada.Calendar.Formatting *note 9.6.1(36/2): 4206, *note
9.6.1(38/2): 4208.
- in Ada.Environment_Variables *note A.17(4.1/3): 6701, *note
+ <in> Ada.Environment_Variables *note A.17(4.1/3): 6701, *note
A.17(4/2): 6700.
- in Ada.Numerics.Discrete_Random *note A.5.2(26): 6170.
- in Ada.Numerics.Float_Random *note A.5.2(14): 6158.
- in Ada.Strings.Maps *note A.4.2(21): 5798.
- in Ada.Strings.Wide_Maps *note A.4.7(21): 6000.
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6039.
- in Ada.Task_Attributes *note C.7.2(4): 7730.
- in Interfaces.C.Pointers *note B.3.2(6): 7520, *note B.3.2(7):
+ <in> Ada.Numerics.Discrete_Random *note A.5.2(26): 6170.
+ <in> Ada.Numerics.Float_Random *note A.5.2(14): 6158.
+ <in> Ada.Strings.Maps *note A.4.2(21): 5798.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(21): 6000.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(21/2): 6039.
+ <in> Ada.Task_Attributes *note C.7.2(4): 7730.
+ <in> Interfaces.C.Pointers *note B.3.2(6): 7520, *note B.3.2(7):
7521.
- in Interfaces.C.Strings *note B.3.1(13): 7506, *note B.3.1(14):
+ <in> Interfaces.C.Strings *note B.3.1(13): 7506, *note B.3.1(14):
7507, *note B.3.1(15): 7508, *note B.3.1(16): 7509.
Value attribute *note 3.5(52): 1672.
value conversion *note 4.6(5/2): 2936.
@@ -89179,32 +89388,32 @@ Variable_Indexing aspect *note 4.1.6(3/3): 2465.
variadic
C *note B.3(60.16/4): 7495.
variant *note 3.8.1(3): 2062.
- used *note 3.8.1(2): 2061, *note P: 9152.
- See also tagged type *note 3.9(1): 2083.
+ <used> *note 3.8.1(2): 2061, *note P: 9152.
+ <See also> tagged type *note 3.9(1): 2083.
variant_part *note 3.8.1(2): 2058.
- used *note 3.8(4): 2032, *note P: 9144.
+ <used> *note 3.8(4): 2032, *note P: 9144.
Vector
- in Ada.Containers.Vectors *note A.18.2(8/3): 6727.
+ <in> Ada.Containers.Vectors *note A.18.2(8/3): 6727.
vector container *note A.18.2(1/2): 6719.
Vector_Iterator_Interfaces
- in Ada.Containers.Vectors *note A.18.2(11.2/3): 6732.
+ <in> Ada.Containers.Vectors *note A.18.2(11.2/3): 6732.
Vectors
- child of Ada.Containers *note A.18.2(6/3): 6724.
+ <child of> Ada.Containers *note A.18.2(6/3): 6724.
version
of a compilation unit *note E.3(5/1): 8173.
Version attribute *note E.3(3): 8170.
vertical line *note 2.1(15/3): 1176.
Vertical_Line
- in Ada.Characters.Latin_1 *note A.3.3(14): 5589.
+ <in> Ada.Characters.Latin_1 *note A.3.3(14): 5589.
view *note 3.1(7): 1312, *note N(42/2): 8956.
of a subtype (implied) *note 3.1(7.1/3): 1316.
of a type (implied) *note 3.1(7.1/3): 1315.
of an object (implied) *note 3.1(7.1/3): 1314.
view conversion *note 4.6(5/2): 2934.
virtual function
- See dispatching subprogram *note 3.9.2(1/2): 2158.
+ <See> dispatching subprogram *note 3.9.2(1/2): 2158.
Virtual_Length
- in Interfaces.C.Pointers *note B.3.2(13): 7525.
+ <in> Interfaces.C.Pointers *note B.3.2(13): 7525.
visibility
direct *note 8.3(2): 3735, *note 8.3(21): 3761.
immediate *note 8.3(4): 3739, *note 8.3(21): 3762.
@@ -89237,9 +89446,9 @@ Volatile_Components aspect *note C.6(6.7/3): 7697.
Volatile_Components pragma *note J.15.8(6/3): 8610, *note L(39.1/3):
8868.
VT
- in Ada.Characters.Latin_1 *note A.3.3(5): 5511.
+ <in> Ada.Characters.Latin_1 *note A.3.3(5): 5511.
VTS
- in Ada.Characters.Latin_1 *note A.3.3(17): 5608.
+ <in> Ada.Characters.Latin_1 *note A.3.3(17): 5608.
@@ -89251,129 +89460,131 @@ W
Wait_For_Release
- in Ada.Synchronous_Barriers *note D.10.1(6/3): 7987.
+ <in> Ada.Synchronous_Barriers *note D.10.1(6/3): 7987.
wchar_array
- in Interfaces.C *note B.3(33/3): 7465.
+ <in> Interfaces.C *note B.3(33/3): 7465.
wchar_t
- in Interfaces.C *note B.3(30/1): 7461.
+ <in> Interfaces.C *note B.3(30/1): 7461.
Wednesday
- in Ada.Calendar.Formatting *note 9.6.1(17/2): 4181.
+ <in> Ada.Calendar.Formatting *note 9.6.1(17/2): 4181.
well-formed picture String
for edited output *note F.3.1(1/3): 8232.
Wide_Bounded
- child of Ada.Strings *note A.4.7(1/3): 5970.
+ <child of> Ada.Strings *note A.4.7(1/3): 5970.
Wide_Character *note 3.5.2(3/3): 1708.
- in Standard *note A.1(36.1/3): 5443.
+ <in> Standard *note A.1(36.1/3): 5443.
Wide_Character_Mapping
- in Ada.Strings.Wide_Maps *note A.4.7(20/2): 5999.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(20/2): 5999.
Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Maps *note A.4.7(26): 6005.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(26): 6005.
Wide_Character_Range
- in Ada.Strings.Wide_Maps *note A.4.7(6): 5988.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(6): 5988.
Wide_Character_Ranges
- in Ada.Strings.Wide_Maps *note A.4.7(7): 5989.
-Wide_Character_Sequence subtype of Wide_String
- in Ada.Strings.Wide_Maps *note A.4.7(16): 5995.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(7): 5989.
+Wide_Character_Sequence <subtype of> Wide_String
+ <in> Ada.Strings.Wide_Maps *note A.4.7(16): 5995.
Wide_Character_Set
- in Ada.Strings.Wide_Maps *note A.4.7(4/2): 5986.
- in Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6047.
+ <in> Ada.Strings.Wide_Maps *note A.4.7(4/2): 5986.
+ <in> Ada.Strings.Wide_Maps.Wide_Constants *note A.4.8(48/2): 6047.
Wide_Characters
- child of Ada *note A.3.1(4/2): 5458.
+ <child of> Ada *note A.3.1(4/2): 5458.
Wide_Constants
- child of Ada.Strings.Wide_Maps *note A.4.7(1/3): 5984, *note
+ <child of> Ada.Strings.Wide_Maps *note A.4.7(1/3): 5984, *note
A.4.8(28/2): 6045.
Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 5976.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5978.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5977.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5979.
+ <child of> Ada.Strings *note A.4.7(1/3): 5976.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5978.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5977.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5979.
Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4568, *note 11.4.1(5/2): 4578.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4568, *note 11.4.1(5/2):
+4578.
Wide_Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2104.
+ <in> Ada.Tags *note 3.9(7/2): 2104.
Wide_Fixed
- child of Ada.Strings *note A.4.7(1/3): 5969.
+ <child of> Ada.Strings *note A.4.7(1/3): 5969.
Wide_Hash
- child of Ada.Strings *note A.4.7(1/3): 5972.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5974.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5973.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5975.
+ <child of> Ada.Strings *note A.4.7(1/3): 5972.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5974.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5973.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5975.
Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.7(1/3): 5980.
- child of Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5982.
- child of Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5981.
- child of Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5983.
+ <child of> Ada.Strings *note A.4.7(1/3): 5980.
+ <child of> Ada.Strings.Wide_Bounded *note A.4.7(1/3): 5982.
+ <child of> Ada.Strings.Wide_Fixed *note A.4.7(1/3): 5981.
+ <child of> Ada.Strings.Wide_Unbounded *note A.4.7(1/3): 5983.
Wide_Image attribute *note 3.5(28): 1643, *note 3.5(55.3/4): 1680.
Wide_Maps
- child of Ada.Strings *note A.4.7(3): 5985.
+ <child of> Ada.Strings *note A.4.7(3): 5985.
wide_nul
- in Interfaces.C *note B.3(31/1): 7462.
+ <in> Interfaces.C *note B.3(31/1): 7462.
Wide_Space
- in Ada.Strings *note A.4.1(4/2): 5772.
+ <in> Ada.Strings *note A.4.1(4/2): 5772.
Wide_String
- in Standard *note A.1(41/3): 5448.
+ <in> Standard *note A.1(41/3): 5448.
Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6088.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(30/3): 6088.
Wide_Text_IO
- child of Ada *note A.11(2/2): 6555.
+ <child of> Ada *note A.11(2/2): 6555.
Wide_Unbounded
- child of Ada.Strings *note A.4.7(1/3): 5971.
+ <child of> Ada.Strings *note A.4.7(1/3): 5971.
Wide_Value attribute *note 3.5(40): 1666.
Wide_Wide_Bounded
- child of Ada.Strings *note A.4.8(1/3): 6009.
+ <child of> Ada.Strings *note A.4.8(1/3): 6009.
Wide_Wide_Character *note 3.5.2(4/3): 1711.
- in Standard *note A.1(36.2/3): 5444.
+ <in> Standard *note A.1(36.2/3): 5444.
Wide_Wide_Character_Mapping
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6038.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(20/2): 6038.
Wide_Wide_Character_Mapping_Function
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6044.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(26/2): 6044.
Wide_Wide_Character_Range
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6027.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(6/2): 6027.
Wide_Wide_Character_Ranges
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6028.
-Wide_Wide_Character_Sequence subtype of Wide_Wide_String
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6034.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(7/2): 6028.
+Wide_Wide_Character_Sequence <subtype of> Wide_Wide_String
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(16/2): 6034.
Wide_Wide_Character_Set
- in Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6025.
+ <in> Ada.Strings.Wide_Wide_Maps *note A.4.8(4/2): 6025.
Wide_Wide_Characters
- child of Ada *note A.3.1(6/2): 5459.
+ <child of> Ada *note A.3.1(6/2): 5459.
Wide_Wide_Constants
- child of Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6023.
+ <child of> Ada.Strings.Wide_Wide_Maps *note A.4.8(1/3): 6023.
Wide_Wide_Equal_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6015.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6017.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6016.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6018.
+ <child of> Ada.Strings *note A.4.8(1/3): 6015.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6017.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6016.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6018.
Wide_Wide_Exception_Name
- in Ada.Exceptions *note 11.4.1(2/2): 4569, *note 11.4.1(5/2): 4579.
+ <in> Ada.Exceptions *note 11.4.1(2/2): 4569, *note 11.4.1(5/2):
+4579.
Wide_Wide_Expanded_Name
- in Ada.Tags *note 3.9(7/2): 2105.
+ <in> Ada.Tags *note 3.9(7/2): 2105.
Wide_Wide_Fixed
- child of Ada.Strings *note A.4.8(1/3): 6008.
+ <child of> Ada.Strings *note A.4.8(1/3): 6008.
Wide_Wide_Hash
- child of Ada.Strings *note A.4.8(1/3): 6011.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6013.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6012.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6014.
+ <child of> Ada.Strings *note A.4.8(1/3): 6011.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6013.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6012.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6014.
Wide_Wide_Hash_Case_Insensitive
- child of Ada.Strings *note A.4.8(1/3): 6019.
- child of Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6021.
- child of Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6020.
- child of Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6022.
+ <child of> Ada.Strings *note A.4.8(1/3): 6019.
+ <child of> Ada.Strings.Wide_Wide_Bounded *note A.4.8(1/3): 6021.
+ <child of> Ada.Strings.Wide_Wide_Fixed *note A.4.8(1/3): 6020.
+ <child of> Ada.Strings.Wide_Wide_Unbounded *note A.4.8(1/3): 6022.
Wide_Wide_Image attribute *note 3.5(27.1/2): 1639, *note 3.5(55.2/4):
1678.
Wide_Wide_Maps
- child of Ada.Strings *note A.4.8(3/2): 6024.
+ <child of> Ada.Strings *note A.4.8(3/2): 6024.
Wide_Wide_Space
- in Ada.Strings *note A.4.1(4/2): 5773.
+ <in> Ada.Strings *note A.4.1(4/2): 5773.
Wide_Wide_String
- in Standard *note A.1(42.1/3): 5449.
+ <in> Standard *note A.1(42.1/3): 5449.
Wide_Wide_Strings
- child of Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6095.
+ <child of> Ada.Strings.UTF_Encoding *note A.4.11(38/3): 6095.
Wide_Wide_Text_IO
- child of Ada *note A.11(3/2): 6558.
+ <child of> Ada *note A.11(3/2): 6558.
Wide_Wide_Unbounded
- child of Ada.Strings *note A.4.8(1/3): 6010.
+ <child of> Ada.Strings *note A.4.8(1/3): 6010.
Wide_Wide_Value attribute *note 3.5(39.1/2): 1654.
Wide_Wide_Width attribute *note 3.5(37.1/2): 1648.
Wide_Width attribute *note 3.5(38): 1650.
@@ -89381,20 +89592,20 @@ Width attribute *note 3.5(39): 1652.
with_clause *note 10.1.2(4/2): 4373.
mentioned in *note 10.1.2(6/2): 4384.
named in *note 10.1.2(6/2): 4386.
- used *note 10.1.2(3): 4371, *note P: 9670.
+ <used> *note 10.1.2(3): 4371, *note P: 9670.
within
immediately *note 8.1(13): 3716.
word *note 13.3(8): 4976.
Word_Size
- in System *note 13.7(13): 5120.
+ <in> System *note 13.7(13): 5120.
Write
- in Ada.Direct_IO *note A.8.4(13): 6341.
- in Ada.Sequential_IO *note A.8.1(12): 6313.
- in Ada.Storage_IO *note A.9(7): 6359.
- in Ada.Streams *note 13.13.1(6): 5341.
- in Ada.Streams.Stream_IO *note A.12.1(18): 6588, *note A.12.1(19):
-6589.
- in System.RPC *note E.5(8): 8209.
+ <in> Ada.Direct_IO *note A.8.4(13): 6341.
+ <in> Ada.Sequential_IO *note A.8.1(12): 6313.
+ <in> Ada.Storage_IO *note A.9(7): 6359.
+ <in> Ada.Streams *note 13.13.1(6): 5341.
+ <in> Ada.Streams.Stream_IO *note A.12.1(18): 6588, *note
+A.12.1(19): 6589.
+ <in> System.RPC *note E.5(8): 8209.
Write aspect *note 13.13.2(38/4): 5381.
Write attribute *note 13.13.2(3): 5350, *note 13.13.2(11): 5354.
Write clause *note 13.3(7/2): 4970, *note 13.13.2(38/4): 5375.
@@ -89421,18 +89632,18 @@ Y
Year
- in Ada.Calendar *note 9.6(13): 4152.
- in Ada.Calendar.Formatting *note 9.6.1(21/2): 4191.
-Year_Number subtype of Integer
- in Ada.Calendar *note 9.6(11/2): 4147.
+ <in> Ada.Calendar *note 9.6(13): 4152.
+ <in> Ada.Calendar.Formatting *note 9.6.1(21/2): 4191.
+Year_Number <subtype of> Integer
+ <in> Ada.Calendar *note 9.6(11/2): 4147.
Yen_Sign
- in Ada.Characters.Latin_1 *note A.3.3(21/3): 5636.
+ <in> Ada.Characters.Latin_1 *note A.3.3(21/3): 5636.
Yield
- in Ada.Dispatching *note D.2.1(1.3/3): 7770.
+ <in> Ada.Dispatching *note D.2.1(1.3/3): 7770.
Yield_To_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7807.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7807.
Yield_To_Same_Or_Higher
- in Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7808.
+ <in> Ada.Dispatching.Non_Preemptive *note D.2.4(2.2/3): 7808.
Tag Table:
@@ -89440,9681 +89651,9681 @@ Node: Top221
Node: Front Matter1632
Node: 0.18786
Node: 0.211486
-Node: 0.313261
-Ref: 100113848
-Ref: 100213848
-Ref: 100336763
-Ref: 100436763
-Node: 0.9953246
-Node: 153470
-Node: 1.153665
-Node: 1.1.155574
-Node: 1.1.257138
-Ref: 100557338
-Ref: 100657625
-Ref: 100757625
-Ref: 100857625
-Ref: 100958103
-Ref: 101058103
-Ref: 101158544
-Ref: 101258544
-Ref: 101358544
-Ref: 101459267
-Ref: 101559272
-Ref: 101659272
-Ref: 101759272
-Ref: 101859272
-Ref: 101959352
-Ref: 102059352
-Ref: 102159352
-Ref: 102259485
-Ref: 102359485
-Ref: 102459485
-Ref: 102559525
-Ref: 102659526
-Ref: 102759636
-Ref: 102859636
-Ref: 102959748
-Ref: 103059748
-Ref: 103159748
-Ref: 103259748
-Ref: 103359799
-Ref: 103459800
-Ref: 103559955
-Ref: 103659955
-Ref: 103759955
-Ref: 103859955
-Ref: 103960065
-Ref: 104060065
-Ref: 104160190
-Ref: 104260190
-Ref: 104360313
-Ref: 104460424
-Ref: 104560529
-Ref: 104660690
-Ref: 104760792
-Ref: 104860792
-Ref: 104961032
-Node: 1.1.361298
-Ref: 105061539
-Ref: 105162450
-Ref: 105262450
-Ref: 105362575
-Ref: 105464781
-Ref: 105564781
-Ref: 105664781
-Ref: 105764781
-Ref: 105864781
-Ref: 105965484
-Node: 1.1.466067
-Ref: 106066550
-Ref: 106166550
-Ref: 106266550
-Ref: 106366550
-Ref: 106466550
-Ref: 106567820
-Ref: 106668887
-Ref: 106769046
-Ref: 106869172
-Ref: 106969268
-Ref: 107069843
-Ref: 107169844
-Node: 1.1.570716
-Ref: 107271555
-Ref: 107371560
-Ref: 107471560
-Ref: 107571560
-Ref: 107671988
-Ref: 107771993
-Ref: 107872671
-Ref: 107972731
-Ref: 108072963
-Ref: 108173419
-Ref: 108273419
-Ref: 108374045
-Ref: 108474046
-Ref: 108574311
-Node: 1.274412
-Ref: 108674533
-Ref: 108774533
-Ref: 108874835
-Ref: 108974835
-Ref: 109074835
-Ref: 109174970
-Ref: 109274970
-Ref: 109374970
-Ref: 109475078
-Ref: 109575078
-Ref: 109675078
-Ref: 109775189
-Ref: 109875189
-Ref: 109975189
-Ref: 110075273
-Ref: 110175273
-Ref: 110275273
-Ref: 110375397
-Ref: 110475397
-Ref: 110575397
-Ref: 110675501
-Ref: 110775501
-Ref: 110875624
-Ref: 110975624
-Ref: 111075624
-Ref: 111175757
-Ref: 111275757
-Ref: 111375757
-Ref: 111475835
-Ref: 111575835
-Ref: 111675835
-Ref: 111775938
-Ref: 111875938
-Ref: 111975938
-Ref: 112076020
-Ref: 112176020
-Node: 1.376225
-Ref: 112276336
-Ref: 112376979
-Ref: 112476980
-Ref: 112576980
-Ref: 112676980
-Node: 276982
-Node: 2.177690
-Ref: 112777785
-Ref: 112878041
-Ref: 112978041
-Ref: 113079363
-Ref: 113179463
-Ref: 113279590
-Ref: 113379719
-Ref: 113479848
-Ref: 113579975
-Ref: 113680096
-Ref: 113780225
-Ref: 113880365
-Ref: 113980491
-Ref: 114080615
-Ref: 114180755
-Ref: 114280875
-Ref: 114381001
-Ref: 114481127
-Ref: 114581261
-Ref: 114681604
-Ref: 114781614
-Ref: 114881803
-Ref: 114981935
-Ref: 115082061
-Ref: 115182453
-Ref: 115282454
-Ref: 115382454
-Ref: 115482454
-Ref: 115582454
-Ref: 115682454
-Ref: 115782454
-Ref: 115882454
-Ref: 115982454
-Ref: 116082454
-Ref: 116182454
-Ref: 116282454
-Ref: 116382454
-Ref: 116482454
-Ref: 116582454
-Ref: 116682454
-Ref: 116782454
-Ref: 116882454
-Ref: 116982454
-Ref: 117082454
-Ref: 117182454
-Ref: 117282454
-Ref: 117382454
-Ref: 117482454
-Ref: 117582454
-Ref: 117682454
-Ref: 117782454
-Ref: 117882454
-Node: 2.284204
-Ref: 117984417
-Ref: 118084490
-Ref: 118184490
-Ref: 118284937
-Ref: 118384944
-Ref: 118485191
-Ref: 118586113
-Ref: 118686257
-Node: 2.387366
-Ref: 118787559
-Ref: S000287559
-Ref: 118887572
-Ref: 118987590
-Ref: 119087609
-Ref: 119187654
-Ref: S000387654
-Ref: S000487654
-Ref: 119287669
-Ref: 119387696
-Ref: 119487723
-Ref: 119587750
-Ref: 119687776
-Ref: 119787799
-Ref: 119887842
-Ref: S000587842
-Ref: 119987857
-Ref: 120087884
-Ref: 120187917
-Ref: 120287942
-Ref: 120388398
-Node: 2.489327
-Ref: 120489438
-Ref: 120589514
-Ref: 120689573
-Ref: 120789695
-Ref: S000689695
-Ref: 120889699
-Ref: 120989718
-Node: 2.4.189931
-Ref: 121090040
-Ref: 121190208
-Ref: S000790208
-Ref: 121290212
-Ref: 121390223
-Ref: 121490233
-Ref: 121590258
-Ref: S000890258
-Ref: 121690262
-Ref: 121790271
-Ref: 121890282
-Ref: 121990305
-Ref: S000990305
-Ref: 122090316
-Ref: 122190330
-Ref: 122290355
-Ref: S001090355
-Node: 2.4.291083
-Ref: 122391188
-Ref: 122491188
-Ref: 122591188
-Ref: 122691188
-Ref: 122791188
-Ref: 122891188
-Ref: 122991188
-Ref: 123091188
-Ref: 123191188
-Ref: 123291188
-Ref: 123391343
-Ref: S001191343
-Ref: 123491356
-Ref: 123591363
-Ref: 123691379
-Ref: 123791397
-Ref: 123891419
-Ref: S001291419
-Ref: 123991423
-Ref: 124091453
-Ref: S001391453
-Ref: 124191466
-Ref: 124291483
-Ref: 124391494
-Ref: 124491532
-Ref: S001491532
-Ref: 124591536
-Ref: 124691615
-Node: 2.592675
-Ref: 124792954
-Ref: S001592954
-Ref: 124892960
-Node: 2.693370
-Ref: 124993770
-Ref: 125093835
-Ref: S001693835
-Ref: 125193842
-Ref: 125293881
-Ref: S001793881
-Ref: 125393910
-Ref: 125494108
-Ref: 125594425
-Node: 2.795134
-Ref: 125695367
-Ref: S001895367
-Ref: 125795391
-Node: 2.896059
-Ref: 125896152
-Ref: 125996416
-Ref: S001996416
-Ref: 126096436
-Ref: 126196449
-Ref: 126296480
-Ref: 126396555
-Ref: S002096555
-Ref: 126496587
-Ref: 126596602
-Ref: 126696634
-Ref: 126796649
-Ref: 126896686
-Ref: 126996702
-Ref: 127096733
-Ref: 127196749
-Ref: 127297855
-Ref: 127397855
-Ref: 127497929
-Ref: 127597930
-Ref: 127698014
-Ref: 127798014
-Ref: 127898444
-Ref: 127998444
-Ref: 128098672
-Ref: 128199918
-Ref: 128299919
-Ref: 128399924
-Ref: 128499954
-Ref: 128599955
-Ref: 128699978
-Ref: 128799979
-Ref: 128899988
-Node: 2.9101638
-Ref: 1289101814
-Node: 3103278
-Node: 3.1103877
-Ref: 1290103968
-Ref: 1291104055
-Ref: 1292104453
-Ref: S0021104453
-Ref: 1293104468
-Ref: 1294104489
-Ref: 1295104519
-Ref: 1296104542
-Ref: 1297104571
-Ref: 1298104598
-Ref: 1299104640
-Ref: 1300104671
-Ref: 1301104713
-Ref: 1302104737
-Ref: 1303104768
-Ref: 1304104794
-Ref: 1305104824
-Ref: 1306104873
-Ref: S0022104873
-Ref: 1307104877
-Ref: 1308104938
-Ref: 1309105026
-Ref: 1310105027
-Ref: 1311105254
-Ref: 1312105967
-Ref: 1313105967
-Ref: 1314106771
-Ref: 1315106771
-Ref: 1316106771
-Ref: 1317106775
-Ref: 1318107209
-Ref: 1319107310
-Ref: 1320107409
-Ref: 1321107729
-Ref: 1322107964
-Ref: 1323108189
-Ref: 1324108271
-Ref: 1325108272
-Ref: 1326108530
-Ref: 1327108601
-Node: 3.2108676
-Ref: 1328108837
-Ref: 1329108837
-Ref: 1330108972
-Ref: 1331109066
-Ref: 1332109066
-Ref: 1333109109
-Ref: 1334109253
-Ref: 1335109302
-Ref: 1336109369
-Ref: 1337109370
-Ref: 1338109442
-Ref: 1339109447
-Ref: 1340109586
-Ref: 1341109587
-Ref: 1342109694
-Ref: 1343109896
-Ref: 1344109896
-Ref: 1345109896
-Ref: 1346110437
-Ref: 1347110677
-Ref: 1348110917
-Ref: 1349111184
-Ref: 1350111184
-Ref: 1351111190
-Ref: 1352111306
-Ref: 1353111307
-Ref: 1354111733
-Ref: 1355111923
-Ref: 1356111923
-Ref: 1357112001
-Ref: 1358112001
-Ref: 1359112134
-Ref: 1360112169
-Ref: 1361112169
-Ref: 1362112174
-Ref: 1363112174
-Ref: 1364112174
-Ref: 1365112174
-Ref: 1366113012
-Ref: 1367113615
-Node: 3.2.1115248
-Ref: 1368115482
-Ref: S0023115482
-Ref: 1369115488
-Ref: 1370115520
-Ref: 1371115558
-Ref: 1372115593
-Ref: 1373115654
-Ref: S0024115654
-Ref: 1374115674
-Ref: 1375115695
-Ref: 1376115723
-Ref: 1377115759
-Ref: 1378115792
-Ref: 1379115824
-Ref: 1380115876
-Ref: S0025115876
-Ref: 1381115891
-Ref: 1382115923
-Ref: 1383115957
-Ref: 1384115982
-Ref: 1385116014
-Ref: 1386116041
-Ref: 1387116074
-Ref: 1388116102
-Ref: 1389116305
-Ref: 1390116707
-Ref: 1391116829
-Ref: 1392117021
-Ref: 1393117374
-Ref: 1394117584
-Ref: 1395117657
-Ref: 1396118038
-Ref: 1397118266
-Ref: 1398118648
-Ref: 1399118747
-Node: 3.2.2119873
-Ref: 1400120185
-Ref: S0026120185
-Ref: 1401120206
-Ref: 1402120229
-Ref: 1403120262
-Ref: 1404120313
-Ref: S0027120313
-Ref: 1405120320
-Ref: 1406120336
-Ref: 1407120350
-Ref: 1408120382
-Ref: S0028120382
-Ref: 1409120395
-Ref: 1410120418
-Ref: S0029120418
-Ref: 1411120422
-Ref: 1412120443
-Ref: 1413120489
-Ref: S0030120489
-Ref: 1414120504
-Ref: 1415120523
-Ref: 1416120543
-Ref: 1417120588
-Ref: S0031120588
-Ref: 1418120603
-Ref: 1419120622
-Ref: 1420120747
-Ref: 1421120892
-Ref: 1422120987
-Ref: 1423121345
-Ref: 1424121345
-Ref: 1425121555
-Ref: 1426121852
-Node: 3.2.3122962
-Ref: 1427123157
-Ref: 1428123375
-Ref: 1429123546
-Ref: 1430123673
-Ref: 1431124476
-Ref: 1432124735
-Node: 3.2.4124830
-Ref: 1433125160
-Ref: 1434125160
-Ref: 1435125160
-Ref: 1436125160
-Ref: 1437125160
-Ref: 1438125160
-Ref: 1439125160
-Ref: 1440125419
-Ref: 1441126042
-Ref: 1442126042
-Ref: 1443126042
-Ref: 1444128242
-Ref: 1445128242
-Ref: 1446130174
-Ref: 1447130687
-Ref: 1448130687
-Ref: 1449132437
-Ref: 1450132437
-Ref: 1451132437
-Ref: 1452132437
-Ref: 1453133275
-Node: 3.3136128
-Ref: 1454136325
-Ref: 1455136638
-Ref: 1456137272
-Ref: 1457137272
-Ref: 1458137272
-Ref: 1459137272
-Ref: 1460137272
-Ref: 1461137272
-Ref: 1462137734
-Ref: 1463137902
-Ref: 1464138042
-Ref: 1465139267
-Ref: 1466139364
-Ref: 1467139365
-Ref: 1468139539
-Ref: 1469139540
-Ref: 1470140226
-Ref: 1471140226
-Ref: 1472141404
-Node: 3.3.1142241
-Ref: 1473142358
-Ref: 1474142358
-Ref: 1475142358
-Ref: 1476142520
-Ref: 1477142521
-Ref: 1478142521
-Ref: 1479142728
-Ref: S0032142728
-Ref: 1480142742
-Ref: 1481142790
-Ref: 1482142819
-Ref: 1483142845
-Ref: 1484142877
-Ref: 1485142925
-Ref: 1486142953
-Ref: 1487142979
-Ref: 1488143011
-Ref: 1489143059
-Ref: 1490143091
-Ref: 1491143117
-Ref: 1492143149
-Ref: 1493143182
-Ref: 1494143243
-Ref: S0033143243
-Ref: 1495143255
-Ref: 1496143278
-Ref: 1497143351
-Ref: 1498143492
-Ref: 1499143549
-Ref: 1500143964
-Ref: 1501144051
-Ref: 1502144731
-Ref: 1503144952
-Ref: 1504145288
-Ref: 1505145583
-Ref: 1506145642
-Ref: 1507145643
-Ref: 1508145745
-Ref: 1509145746
-Ref: 1510145831
-Ref: 1511146416
-Ref: 1512146967
-Ref: 1513147512
-Ref: 1514148228
-Ref: 1515148361
-Ref: 1516148606
-Ref: 1517148607
-Ref: 1518148830
-Ref: 1519149007
-Ref: 1520150038
-Ref: 1521150467
-Ref: 1522150467
-Node: 3.3.2152244
-Ref: 1523152472
-Ref: S0034152472
-Ref: 1524152487
-Ref: 1525152533
-Ref: 1526152597
-Ref: 1527153260
-Ref: 1528153312
-Node: 3.4153862
-Ref: 1529153993
-Ref: 1530154164
-Ref: 1531154173
-Ref: 1532154173
-Ref: 1533154839
-Ref: S0035154839
-Ref: 1534154885
-Ref: 1535154910
-Ref: 1536154932
-Ref: 1537155005
-Ref: 1538155005
-Ref: 1539155494
-Ref: 1540156091
-Ref: 1541156141
-Ref: 1542156141
-Ref: 1543156319
-Ref: 1544156785
-Ref: 1545158366
-Ref: 1546158367
-Ref: 1547158741
-Ref: 1548158742
-Ref: 1549158742
-Ref: 1550159374
-Ref: 1551159717
-Ref: 1552160285
-Ref: 1553160789
-Ref: 1554161735
-Ref: 1555162426
-Ref: 1556162902
-Ref: 1557163298
-Ref: 1558164001
-Ref: 1559164028
-Ref: 1560164518
-Node: 3.4.1166755
-Ref: 1561167013
-Ref: 1562167323
-Ref: 1563167324
-Ref: 1564167324
-Ref: 1565167662
-Ref: 1566167928
-Ref: 1567168547
-Ref: 1568169306
-Ref: 1569169623
-Ref: 1570169623
-Ref: 1571169623
-Ref: 1572169623
-Ref: 1573170683
-Ref: 1574170683
-Ref: 1575170838
-Ref: 1576170960
-Ref: 1577171304
-Ref: 1578171384
-Ref: 1579171385
-Ref: 1580171552
-Node: 3.5172504
-Ref: 1581172607
-Ref: 1582172678
-Ref: 1583172741
-Ref: 1584172820
-Ref: 1585173039
-Ref: S0036173039
-Ref: 1586173051
-Ref: 1587173070
-Ref: S0037173070
-Ref: 1588173076
-Ref: 1589173112
-Ref: 1590173133
-Ref: 1591173154
-Ref: 1592173154
-Ref: 1593173154
-Ref: 1594173154
-Ref: 1595173353
-Ref: 1596173551
-Ref: 1597173668
-Ref: 1598173744
-Ref: 1599173902
-Ref: 1600174131
-Ref: 1601174382
-Ref: 1602174675
-Ref: 1603174675
-Ref: 1604174748
-Ref: 1605174983
-Ref: 1606175131
-Ref: 1607175247
-Ref: 1608175325
-Ref: 1609175578
-Ref: 1610175578
-Ref: 1611175806
-Ref: 1612175821
-Ref: 1613175947
-Ref: 1614175962
-Ref: 1615176088
-Ref: 1616176103
-Ref: 1617176169
-Ref: 1618176184
-Ref: 1619176338
-Ref: 1620176350
-Ref: 1621176365
-Ref: 1622176649
-Ref: 1623176664
-Ref: 1624176950
-Ref: 1625176965
-Ref: 1626177134
-Ref: 1627177299
-Ref: 1628177300
-Ref: 1629177786
-Ref: 1630177787
-Ref: 1631177876
-Ref: 1632177891
-Ref: 1633178060
-Ref: 1634178225
-Ref: 1635178226
-Ref: 1636178727
-Ref: 1637178728
-Ref: 1638178832
-Ref: 1639178847
-Ref: 1640179056
-Ref: 1641179550
-Ref: 1642181506
-Ref: 1643181521
-Ref: 1644181709
-Ref: 1645182308
-Ref: 1646182323
-Ref: 1647183032
-Ref: 1648183047
-Ref: 1649183325
-Ref: 1650183340
-Ref: 1651183597
-Ref: 1652183612
-Ref: 1653183869
-Ref: 1654183884
-Ref: 1655184268
-Ref: 1656184283
-Ref: 1657184789
-Ref: 1658184790
-Ref: 1659184837
-Ref: 1660185372
-Ref: 1661185373
-Ref: 1662185960
-Ref: 1663186190
-Ref: 1664186191
-Ref: 1665186381
-Ref: 1666186396
-Ref: 1667186750
-Ref: 1668186765
-Ref: 1669187231
-Ref: 1670187232
-Ref: 1671187622
-Ref: 1672187637
-Ref: 1673187956
-Ref: 1674187971
-Ref: 1675188427
-Ref: 1676188428
-Ref: 1677188869
-Ref: 1678188884
-Ref: 1679189065
-Ref: 1680189080
-Ref: 1681189246
-Ref: 1682189261
-Ref: 1683190512
-Ref: 1684190512
-Ref: 1685190880
-Node: 3.5.1192418
-Ref: 1686192529
-Ref: 1687192665
-Ref: S0038192665
-Ref: 1688192679
-Ref: 1689192716
-Ref: 1690192799
-Ref: S0039192799
-Ref: 1691192805
-Ref: 1692192827
-Ref: 1693192894
-Ref: S0040192894
-Ref: 1694192898
-Ref: 1695193153
-Ref: 1696193609
-Ref: 1697193946
-Ref: 1698194388
-Ref: 1699194388
-Ref: 1700194388
-Node: 3.5.2195669
-Ref: 1701195836
-Ref: 1702195960
-Ref: 1703195960
-Ref: 1704195960
-Ref: 1705195960
-Ref: 1706196637
-Ref: 1707196638
-Ref: 1708196644
-Ref: 1709196644
-Ref: 1710196644
-Ref: 1711197104
-Ref: 1712197104
-Node: 3.5.3198598
-Ref: 1713198761
-Ref: 1714198864
-Ref: 1715198865
-Ref: 1716198955
-Node: 3.5.4199029
-Ref: 1717199146
-Ref: 1718199146
-Ref: 1719199146
-Ref: 1720199522
-Ref: 1721199596
-Ref: S0041199596
-Ref: 1722199600
-Ref: 1723199634
-Ref: 1724199702
-Ref: S0042199702
-Ref: 1725199720
-Ref: 1726199754
-Ref: 1727199803
-Ref: S0043199803
-Ref: 1728199819
-Ref: 1729199882
-Ref: 1730200014
-Ref: 1731200307
-Ref: 1732200307
-Ref: 1733200307
-Ref: 1734200890
-Ref: 1735201091
-Ref: 1736201092
-Ref: 1737201297
-Ref: 1738201411
-Ref: 1739201412
-Ref: 1740201556
-Ref: 1741201720
-Ref: 1742201720
-Ref: 1743201931
-Ref: 1744201931
-Ref: 1745201931
-Ref: 1746202289
-Ref: 1747202290
-Ref: 1748202487
-Ref: 1749202637
-Ref: 1750202652
-Ref: 1751202953
-Ref: 1752202968
-Ref: 1753203123
-Ref: 1754203465
-Ref: 1755203465
-Ref: 1756203465
-Ref: 1757203654
-Ref: 1758203655
-Ref: 1759203655
-Ref: 1760203829
-Ref: 1761203923
-Ref: 1762204369
-Ref: 1763204369
-Ref: 1764205108
-Ref: 1765205944
-Ref: 1766206537
-Ref: 1767206860
-Ref: 1768207085
-Ref: 1769207085
-Node: 3.5.5208588
-Ref: 1770208858
-Ref: 1771208873
-Ref: 1772209189
-Ref: 1773209204
-Ref: 1774209380
-Ref: 1775209395
-Ref: 1776209503
-Ref: 1777209504
-Ref: 1778209894
-Ref: 1779209909
-Ref: 1780210102
-Ref: 1781210117
-Ref: 1782210784
-Ref: 1783211041
-Node: 3.5.6212643
-Ref: 1784212754
-Ref: 1785212983
-Ref: S0044212983
-Ref: 1786212996
-Ref: 1787213024
-Ref: 1788213096
-Ref: 1789213336
-Ref: 1790213336
-Ref: 1791213516
-Ref: 1792213825
-Ref: 1793214570
-Node: 3.5.7215796
-Ref: 1794215927
-Ref: 1795216149
-Ref: S0045216149
-Ref: 1796216175
-Ref: 1797216187
-Ref: 1798216245
-Ref: S0046216245
-Ref: 1799216270
-Ref: 1800216298
-Ref: 1801216368
-Ref: 1802216578
-Ref: 1803216637
-Ref: 1804216806
-Ref: 1805217023
-Ref: 1806217440
-Ref: 1807217589
-Ref: 1808217756
-Ref: 1809217890
-Ref: 1810218076
-Ref: 1811218211
-Ref: 1812218212
-Ref: 1813218827
-Ref: 1814218828
-Ref: 1815219095
-Ref: 1816219270
-Ref: 1817219428
-Ref: 1818219587
-Ref: 1819219752
-Ref: 1820219752
-Ref: 1821220535
-Node: 3.5.8221366
-Ref: 1822221656
-Ref: 1823221671
-Ref: 1824222216
-Node: 3.5.9222854
-Ref: 1825222980
-Ref: 1826222980
-Ref: 1827222980
-Ref: 1828223069
-Ref: 1829223256
-Ref: S0047223256
-Ref: 1830223260
-Ref: 1831223295
-Ref: 1832223371
-Ref: S0048223371
-Ref: 1833223397
-Ref: 1834223409
-Ref: 1835223472
-Ref: S0049223472
-Ref: 1836223498
-Ref: 1837223523
-Ref: 1838223535
-Ref: 1839223594
-Ref: S0050223594
-Ref: 1840223621
-Ref: 1841223640
-Ref: 1842223710
-Ref: 1843223912
-Ref: 1844223913
-Ref: 1845223913
-Ref: 1846224526
-Ref: 1847224639
-Ref: 1848224786
-Ref: 1849225731
-Ref: 1850225885
-Ref: 1851226175
-Ref: 1852226176
-Ref: 1853226478
-Ref: 1854226536
-Ref: 1855226696
-Ref: 1856226697
-Ref: 1857226948
-Ref: 1858227093
-Ref: 1859227433
-Ref: 1860227685
-Ref: 1861227784
-Ref: 1862227785
-Ref: 1863228015
-Node: 3.5.10229678
-Ref: 1864229949
-Ref: 1865229964
-Ref: 1866230081
-Ref: 1867230082
-Ref: 1868230331
-Ref: 1869230331
-Ref: 1870230343
-Ref: 1871230358
-Ref: 1872230513
-Ref: 1873230528
-Ref: 1874231077
-Ref: 1875231092
-Ref: 1876231673
-Ref: 1877231688
-Ref: 1878232012
-Ref: 1879232792
-Ref: 1880232807
-Ref: 1881232920
-Ref: 1882233155
-Ref: 1883233170
-Ref: 1884233848
-Node: 3.6234436
-Ref: 1885234537
-Ref: 1886234537
-Ref: 1887234905
-Ref: S0051234905
-Ref: 1888234918
-Ref: 1889234951
-Ref: 1890235018
-Ref: S0052235018
-Ref: 1891235037
-Ref: 1892235065
-Ref: 1893235095
-Ref: 1894235154
-Ref: S0053235154
-Ref: 1895235158
-Ref: 1896235217
-Ref: S0054235217
-Ref: 1897235237
-Ref: 1898235268
-Ref: 1899235307
-Ref: 1900235363
-Ref: S0055235363
-Ref: 1901235377
-Ref: 1902235398
-Ref: 1903235434
-Ref: S0056235434
-Ref: 1904235457
-Ref: 1905235494
-Ref: 1906235564
-Ref: 1907235892
-Ref: 1908236006
-Ref: 1909236056
-Ref: 1910236265
-Ref: 1911236265
-Ref: 1912236265
-Ref: 1913236878
-Ref: 1914236926
-Ref: 1915236985
-Ref: 1916237108
-Ref: 1917237578
-Ref: 1918237578
-Ref: 1919237830
-Ref: 1920238000
-Ref: 1921238000
-Ref: 1922238257
-Ref: 1923238778
-Ref: 1924238921
-Ref: 1925239203
-Ref: 1926239437
-Ref: 1927239802
-Ref: 1928240188
-Ref: 1929240713
-Ref: 1930240713
-Ref: 1931241129
-Node: 3.6.1242989
-Ref: 1932243346
-Ref: S0057243346
-Ref: 1933243353
-Ref: 1934243371
-Ref: 1935243410
-Ref: S0058243410
-Ref: 1936243424
-Ref: 1937243445
-Ref: 1938243503
-Ref: 1939243619
-Ref: 1940244147
-Ref: 1941244333
-Ref: 1942244534
-Ref: 1943244652
-Ref: 1944244796
-Ref: 1945244910
-Node: 3.6.2246283
-Ref: 1946246914
-Ref: 1947246929
-Ref: 1948247058
-Ref: 1949247073
-Ref: 1950247200
-Ref: 1951247215
-Ref: 1952247342
-Ref: 1953247357
-Ref: 1954247484
-Ref: 1955247499
-Ref: 1956247632
-Ref: 1957247647
-Ref: 1958247801
-Ref: 1959247816
-Ref: 1960247981
-Ref: 1961247996
-Ref: 1962249063
-Node: 3.6.3250160
-Ref: 1963250307
-Node: 3.7251810
-Ref: 1964251917
-Ref: 1965251917
-Ref: 1966251917
-Ref: 1967252481
-Ref: S0059252481
-Ref: 1968252485
-Ref: 1969252514
-Ref: 1970252577
-Ref: S0060252577
-Ref: 1971252618
-Ref: S0061252618
-Ref: 1972252632
-Ref: 1973252662
-Ref: 1974252727
-Ref: S0062252727
-Ref: 1975252740
-Ref: 1976252768
-Ref: 1977252784
-Ref: 1978252801
-Ref: 1979252835
-Ref: 1980252862
-Ref: 1981252884
-Ref: 1982252936
-Ref: S0063252936
-Ref: 1983252940
-Ref: 1984253004
-Ref: 1985253406
-Ref: 1986253676
-Ref: 1987254446
-Ref: 1988255605
-Ref: 1989255906
-Ref: 1990256091
-Ref: 1991256410
-Ref: 1992257154
-Ref: 1993257154
-Ref: 1994257154
-Ref: 1995257154
-Ref: 1996257273
-Ref: 1997257274
-Ref: 1998257635
-Ref: 1999257636
-Ref: 2000258078
-Node: 3.7.1260403
-Ref: 2001260700
-Ref: S0064260700
-Ref: 2002260714
-Ref: 2003260742
-Ref: 2004260801
-Ref: S0065260801
-Ref: 2005260828
-Ref: 2006260858
-Ref: 2007260877
-Ref: 2008260897
-Ref: 2009261004
-Ref: 2010261352
-Ref: 2011261438
-Ref: 2012261719
-Ref: 2013262482
-Ref: 2014262820
-Ref: 2015262993
-Ref: 2016263161
-Ref: 2017263515
-Node: 3.7.2264321
-Ref: 2018265017
-Ref: 2019265032
-Ref: 2020265234
-Node: 3.8265565
-Ref: 2021265668
-Ref: 2022265668
-Ref: 2023265831
-Ref: 2024265904
-Ref: S0066265904
-Ref: 2025265939
-Ref: 2026265988
-Ref: S0067265988
-Ref: 2027266021
-Ref: 2028266099
-Ref: S0068266099
-Ref: 2029266115
-Ref: 2030266131
-Ref: 2031266158
-Ref: 2032266174
-Ref: 2033266228
-Ref: S0069266228
-Ref: 2034266232
-Ref: 2035266257
-Ref: 2036266302
-Ref: S0070266302
-Ref: 2037266315
-Ref: 2038266342
-Ref: 2039266367
-Ref: 2040266407
-Ref: 2041266482
-Ref: 2042266676
-Ref: 2043267918
-Ref: 2044268256
-Ref: 2045268256
-Ref: 2046268378
-Ref: 2047268599
-Ref: 2048268921
-Ref: 2049269069
-Ref: 2050269172
-Ref: 2051269319
-Ref: 2052269426
-Ref: 2053269426
-Ref: 2054269426
-Ref: 2055269838
-Ref: 2056270750
-Ref: 2057272108
-Node: 3.8.1273091
-Ref: 2058273478
-Ref: S0071273478
-Ref: 2059273509
-Ref: 2060273536
-Ref: 2061273556
-Ref: 2062273598
-Ref: S0072273598
-Ref: 2063273616
-Ref: 2064273651
-Ref: 2065273694
-Ref: S0073273694
-Ref: 2066273698
-Ref: 2067273718
-Ref: 2068273760
-Ref: S0074273760
-Ref: 2069273764
-Ref: 2070273794
-Ref: 2071273821
-Ref: 2072273888
-Ref: 2073274103
-Ref: 2074274624
-Ref: 2075275346
-Ref: 2076276484
-Ref: 2077276484
-Ref: 2078277530
-Node: 3.9278460
-Ref: 2079278604
-Ref: 2080278604
-Ref: 2081278604
-Ref: 2082278604
-Ref: 2083278604
-Ref: 2084278763
-Ref: 2085278764
-Ref: 2086278764
-Ref: 2087278816
-Ref: 2088279215
-Ref: 2089279216
-Ref: 2090279314
-Ref: 2091279314
-Ref: 2092279314
-Ref: 2093279889
-Ref: 2094280220
-Ref: 2095280288
-Ref: 2096280289
-Ref: 2097280289
-Ref: 2098280289
-Ref: 2099280931
-Ref: 2100280995
-Ref: 2101281070
-Ref: 2102281153
-Ref: 2103281199
-Ref: 2104281255
-Ref: 2105281321
-Ref: 2106281397
-Ref: 2107281452
-Ref: 2108281521
-Ref: 2109281601
-Ref: 2110281711
-Ref: 2111281765
-Ref: 2112281837
-Ref: 2113281914
-Ref: 2114281964
-Ref: 2115284670
-Ref: 2116285276
-Ref: 2117285503
-Ref: 2118285518
-Ref: 2119285769
-Ref: 2120285784
-Ref: 2121285970
-Ref: 2122285985
-Ref: 2123286311
-Ref: 2124286326
-Ref: 2125286485
-Ref: 2126287330
-Ref: 2127287448
-Ref: 2128287582
-Ref: 2129287687
-Ref: 2130287808
-Ref: 2131287922
-Ref: 2132288813
-Ref: 2133290455
-Ref: 2134290455
-Node: 3.9.1290897
-Ref: 2135291006
-Ref: 2136291006
-Ref: 2137291006
-Ref: 2138291006
-Ref: 2139291006
-Ref: 2140291006
-Ref: 2141291235
-Ref: S0075291235
-Ref: 2142291245
-Ref: 2143291576
-Ref: 2144292003
-Ref: 2145292208
-Node: 3.9.2294772
-Ref: 2146294941
-Ref: 2147294941
-Ref: 2148294941
-Ref: 2149294941
-Ref: 2150294941
-Ref: 2151294941
-Ref: 2152294941
-Ref: 2153294941
-Ref: 2154295923
-Ref: 2155295924
-Ref: 2156295924
-Ref: 2157295924
-Ref: 2158295924
-Ref: 2159295976
-Ref: 2160295976
-Ref: 2161296092
-Ref: 2162296285
-Ref: 2163296538
-Ref: 2164296539
-Ref: 2165296959
-Ref: 2166296959
-Ref: 2167297492
-Ref: 2168297732
-Ref: 2169297961
-Ref: 2170299671
-Ref: 2171299797
-Ref: 2172301165
-Ref: 2173301165
-Ref: 2174301364
-Ref: 2175301709
-Ref: 2176301710
-Ref: 2177301834
-Ref: 2178303152
-Node: 3.9.3305881
-Ref: 2179306034
-Ref: 2180306034
-Ref: 2181306034
-Ref: 2182306034
-Ref: 2183306168
-Ref: 2184306169
-Ref: 2185306517
-Ref: S0076306517
-Ref: 2186306532
-Ref: 2187306563
-Ref: 2188306614
-Ref: 2189306690
-Ref: 2190306690
-Ref: 2191307082
-Ref: 2192307082
-Ref: 2193308241
-Ref: 2194310357
-Node: 3.9.4311909
-Ref: 2195312292
-Ref: S0077312292
-Ref: 2196312365
-Ref: 2197312411
-Ref: S0078312411
-Ref: 2198312426
-Ref: 2199312454
-Ref: 2200312572
-Ref: 2201312572
-Ref: 2202312884
-Ref: 2203312884
-Ref: 2204312885
-Ref: 2205312885
-Ref: 2206312885
-Ref: 2207312885
-Ref: 2208312885
-Ref: 2209312885
-Ref: 2210312885
-Ref: 2211312885
-Ref: 2212313009
-Ref: 2213313009
-Ref: 2214313009
-Ref: 2215313009
-Ref: 2216313009
-Ref: 2217313009
-Ref: 2218313009
-Ref: 2219313397
-Ref: 2220313397
-Ref: 2221315128
-Node: 3.10319476
-Ref: 2222319583
-Ref: 2223319583
-Ref: 2224319583
-Ref: 2225319875
-Ref: 2226319876
-Ref: 2227319950
-Ref: S0079319950
-Ref: 2228319965
-Ref: 2229319981
-Ref: 2230320019
-Ref: 2231320035
-Ref: 2232320102
-Ref: S0080320102
-Ref: 2233320124
-Ref: 2234320149
-Ref: 2235320199
-Ref: S0081320199
-Ref: 2236320258
-Ref: S0082320258
-Ref: 2237320301
-Ref: 2238320357
-Ref: 2239320412
-Ref: S0083320412
-Ref: 2240320453
-Ref: S0084320453
-Ref: 2241320468
-Ref: 2242320502
-Ref: 2243320525
-Ref: 2244320570
-Ref: 2245320598
-Ref: 2246320642
-Ref: 2247320728
-Ref: 2248320728
-Ref: 2249320728
-Ref: 2250320728
-Ref: 2251320888
-Ref: 2252321066
-Ref: 2253321286
-Ref: 2254321286
-Ref: 2255321655
-Ref: 2256322459
-Ref: 2257322460
-Ref: 2258322662
-Ref: 2259322824
-Ref: 2260323174
-Ref: 2261323268
-Ref: 2262323373
-Ref: 2263323711
-Ref: 2264323711
-Ref: 2265323711
-Ref: 2266324208
-Ref: 2267324215
-Ref: 2268324954
-Ref: 2269325492
-Ref: 2270325492
-Ref: 2271326330
-Ref: 2272326536
-Ref: 2273326826
-Ref: 2274327062
-Node: 3.10.1328881
-Ref: 2275329529
-Ref: S0085329529
-Ref: 2276329539
-Ref: 2277329560
-Ref: 2278329651
-Ref: 2279329651
-Ref: 2280329941
-Ref: 2281329941
-Ref: 2282331083
-Ref: 2283332476
-Ref: 2284335091
-Ref: 2285335181
-Node: 3.10.2337045
-Ref: 2286337482
-Ref: 2287338048
-Ref: 2288338049
-Ref: 2289338227
-Ref: 2290338227
-Ref: 2291338227
-Ref: 2292338227
-Ref: 2293338227
-Ref: 2294338227
-Ref: 2295339156
-Ref: 2296339156
-Ref: 2297341377
-Ref: 2298341377
-Ref: 2299341377
-Ref: 2300346770
-Ref: 2301348004
-Ref: 2302349712
-Ref: 2303349712
-Ref: 2304352546
-Ref: 2305352546
-Ref: 2306352825
-Ref: 2307352840
-Ref: 2308353094
-Ref: 2309354644
-Ref: 2310355054
-Ref: 2311355274
-Ref: 2312355279
-Ref: 2313355294
-Ref: 2314355294
-Ref: 2315355470
-Ref: 2316355890
-Ref: 2317355905
-Ref: 2318356120
-Ref: 2319356211
-Ref: 2320356553
-Ref: 2321357161
-Ref: 2322357161
-Ref: 2323358421
-Ref: 2324358778
-Ref: 2325359307
-Ref: 2326359307
-Node: 3.11360655
-Ref: 2327360888
-Ref: S0086360888
-Ref: 2328360894
-Ref: 2329360936
-Ref: S0087360936
-Ref: 2330360950
-Ref: 2331360975
-Ref: 2332361012
-Ref: S0088361012
-Ref: 2333361026
-Ref: 2334361046
-Ref: 2335361062
-Ref: 2336361085
-Ref: S0089361085
-Ref: 2337361089
-Ref: 2338361104
-Ref: 2339361133
-Ref: S0090361133
-Ref: 2340361147
-Ref: 2341361165
-Ref: 2342361180
-Ref: 2343361192
-Ref: 2344361367
-Ref: 2345361418
-Ref: 2346361583
-Ref: 2347361727
-Ref: 2348361727
-Ref: 2349362075
-Ref: 2350362423
-Ref: 2351363076
-Ref: 2352363081
-Node: 3.11.1363202
-Ref: 2353363366
-Ref: 2354363439
-Ref: 2355363588
-Ref: 2356364330
-Ref: 2357364434
-Ref: 2358364769
-Node: 4365748
-Node: 4.1366282
-Ref: 2359366839
-Ref: S0091366839
-Ref: 2360366854
-Ref: 2361366870
-Ref: 2362366901
-Ref: 2363366923
-Ref: 2364366939
-Ref: 2365366962
-Ref: 2366366992
-Ref: 2367367012
-Ref: 2368367036
-Ref: 2369367058
-Ref: 2370367089
-Ref: 2371367115
-Ref: 2372367155
-Ref: S0092367155
-Ref: 2373367159
-Ref: 2374367173
-Ref: 2375367203
-Ref: S0093367203
-Ref: 2376367207
-Ref: 2377367215
-Ref: 2378367264
-Ref: S0094367264
-Ref: 2379367268
-Ref: 2380367306
-Ref: S0095367306
-Ref: 2381367310
-Ref: 2382367634
-Ref: 2383367634
-Ref: 2384367809
-Ref: 2385368357
-Ref: 2386368600
-Ref: 2387368765
-Ref: 2388368846
-Ref: 2389369026
-Ref: 2390369191
-Ref: 2391369192
-Ref: 2392369264
-Node: 4.1.1370484
-Ref: 2393370692
-Ref: 2394370760
-Ref: S0096370760
-Ref: 2395370764
-Ref: 2396370772
-Ref: 2397370786
-Ref: 2398371165
-Ref: 2399371410
-Ref: 2400371697
-Ref: 2401371808
-Ref: 2402371884
-Ref: 2403371885
-Ref: 2404371885
-Ref: 2405372015
-Node: 4.1.2373127
-Ref: 2406373230
-Ref: 2407373505
-Ref: S0097373505
-Ref: 2408373509
-Ref: 2409373517
-Ref: 2410373692
-Ref: 2411374185
-Ref: 2412374286
-Ref: 2413374286
-Ref: 2414374287
-Ref: 2415374287
-Ref: 2416374492
-Node: 4.1.3375603
-Ref: 2417375917
-Ref: 2418375986
-Ref: S0098375986
-Ref: 2419375990
-Ref: 2420376000
-Ref: 2421376035
-Ref: S0099376035
-Ref: 2422376039
-Ref: 2423376053
-Ref: 2424376073
-Ref: 2425376141
-Ref: 2426378786
-Ref: 2427378787
-Ref: 2428380566
-Ref: 2429380648
-Ref: 2430380648
-Ref: 2431380840
-Ref: 2432380841
-Node: 4.1.4382352
-Ref: 2433382463
-Ref: 2434382700
-Ref: S0100382700
-Ref: 2435382704
-Ref: 2436382712
-Ref: 2437382763
-Ref: S0101382763
-Ref: 2438382777
-Ref: 2439382796
-Ref: 2440382881
-Ref: S0102382881
-Ref: 2441382885
-Ref: 2442382893
-Ref: 2443382954
-Ref: S0103382954
-Ref: 2444382973
-Ref: 2445383738
-Ref: 2446383738
-Ref: 2447385240
-Ref: 2448385240
-Ref: 2449386357
-Node: 4.1.5387124
-Ref: 2450387554
-Ref: 2451387554
-Ref: 2452387644
-Ref: 2453387698
-Ref: 2454387829
-Ref: 2455388076
-Ref: S0104388076
-Ref: 2456388098
-Ref: 2457388254
-Ref: 2458389162
-Ref: 2459389379
-Ref: 2460389380
-Ref: 2461389470
-Node: 4.1.6390356
-Ref: 2462391066
-Ref: 2463391066
-Ref: 2464391693
-Ref: 2465391693
-Ref: 2466391932
-Ref: 2467392008
-Ref: 2468392356
-Ref: S0105392356
-Ref: 2469392388
-Ref: 2470392395
-Ref: 2471392596
-Ref: 2472392831
-Ref: 2473392831
-Ref: 2474393226
-Ref: 2475393226
-Node: 4.2394751
-Ref: 2476394846
-Ref: 2477395035
-Ref: 2478395122
-Ref: 2479395122
-Ref: 2480395702
-Ref: 2481396399
-Ref: 2482396399
-Ref: 2483396399
-Ref: 2484396450
-Ref: 2485396450
-Ref: 2486396450
-Ref: 2487396450
-Ref: 2488396542
-Ref: 2489396957
-Ref: 2490396957
-Ref: 2491397267
-Node: 4.3397891
-Ref: 2492397990
-Ref: 2493398103
-Ref: 2494398163
-Ref: S0106398163
-Ref: 2495398167
-Ref: 2496398187
-Ref: 2497398209
-Ref: 2498398285
-Ref: 2499398530
-Ref: 2500398819
-Ref: 2501398889
-Ref: 2502398950
-Ref: 2503398950
-Ref: 2504399059
-Node: 4.3.1399217
-Ref: 2505399547
-Ref: S0107399547
-Ref: 2506399553
-Ref: 2507399629
-Ref: S0108399629
-Ref: 2508399643
-Ref: 2509399675
-Ref: 2510399764
-Ref: S0109399764
-Ref: 2511399779
-Ref: 2512399805
-Ref: 2513399826
-Ref: 2514399883
-Ref: S0110399883
-Ref: 2515399908
-Ref: 2516399935
-Ref: 2517399970
-Ref: 2518400100
-Ref: 2519400602
-Ref: 2520400697
-Ref: 2521401211
-Ref: 2522401347
-Ref: 2523403208
-Ref: 2524403340
-Ref: 2525403621
-Ref: 2526404000
-Node: 4.3.2405916
-Ref: 2527406337
-Ref: S0111406337
-Ref: 2528406352
-Ref: 2529406371
-Ref: 2530406427
-Ref: S0112406427
-Ref: 2531406431
-Ref: 2532406445
-Ref: 2533406512
-Ref: 2534406607
-Ref: 2535407008
-Ref: 2536407743
-Ref: 2537408227
-Ref: 2538408840
-Ref: 2539408846
-Ref: 2540408846
-Ref: 2541409284
-Node: 4.3.3410224
-Ref: 2542410772
-Ref: S0113410772
-Ref: 2543410784
-Ref: 2544410813
-Ref: 2545410871
-Ref: S0114410871
-Ref: 2546410886
-Ref: 2547410898
-Ref: 2548410912
-Ref: 2549410935
-Ref: 2550410949
-Ref: 2551410972
-Ref: 2552410994
-Ref: 2553411008
-Ref: 2554411064
-Ref: S0115411064
-Ref: 2555411079
-Ref: 2556411110
-Ref: 2557411177
-Ref: S0116411177
-Ref: 2558411191
-Ref: 2559411215
-Ref: 2560411235
-Ref: 2561411265
-Ref: 2562411413
-Ref: 2563411603
-Ref: 2564411852
-Ref: 2565411951
-Ref: 2566412074
-Ref: 2567412211
-Ref: 2568412739
-Ref: 2569416116
-Ref: 2570416368
-Ref: 2571416368
-Ref: 2572416636
-Ref: 2573416637
-Ref: 2574417060
-Ref: 2575417921
-Ref: 2576417921
-Ref: 2577418062
-Ref: 2578418062
-Ref: 2579418251
-Ref: 2580418251
-Ref: 2581418390
-Node: 4.4420505
-Ref: 2582420608
-Ref: 2583420976
-Ref: 2584420977
-Ref: 2585420977
-Ref: 2586420977
-Ref: 2587420977
-Ref: 2588420977
-Ref: 2589420977
-Ref: 2590420977
-Ref: 2591420977
-Ref: 2592420977
-Ref: 2593420977
-Ref: 2594420977
-Ref: 2595420977
-Ref: 2596420977
-Ref: 2597420977
-Ref: 2598420977
-Ref: 2599420977
-Ref: 2600420977
-Ref: 2601420977
-Ref: 2602420977
-Ref: 2603420977
-Ref: 2604420977
-Ref: 2605420977
-Ref: 2606420977
-Ref: 2607420977
-Ref: 2608420977
-Ref: 2609420977
-Ref: 2610420977
-Ref: 2611420977
-Ref: 2612420977
-Ref: 2613420977
-Ref: 2614420977
-Ref: 2615420977
-Ref: 2616420977
-Ref: 2617420977
-Ref: 2618420977
-Ref: 2619420977
-Ref: 2620420977
-Ref: 2621420977
-Ref: 2622420977
-Ref: 2623420977
-Ref: 2624420977
-Ref: 2625420977
-Ref: 2626420977
-Ref: 2627420977
-Ref: 2628420977
-Ref: 2629420977
-Ref: 2630420977
-Ref: 2631420977
-Ref: 2632420977
-Ref: 2633420977
-Ref: 2634420977
-Ref: 2635420977
-Ref: 2636420977
-Ref: 2637420977
-Ref: 2638420977
-Ref: 2639420977
-Ref: 2640420977
-Ref: 2641420977
-Ref: 2642420977
-Ref: 2643420977
-Ref: 2644420977
-Ref: 2645420977
-Ref: 2646420977
-Ref: 2647420977
-Ref: 2648420977
-Ref: 2649420977
-Ref: 2650420977
-Ref: 2651420977
-Ref: 2652420977
-Ref: 2653420977
-Ref: 2654420977
-Ref: 2655421037
-Ref: S0117421037
-Ref: 2656421052
-Ref: 2657421066
-Ref: 2658421081
-Ref: 2659421100
-Ref: 2660421120
-Ref: 2661421133
-Ref: 2662421148
-Ref: 2663421166
-Ref: 2664421186
-Ref: 2665421200
-Ref: 2666421239
-Ref: S0118421239
-Ref: 2667421254
-Ref: 2668421275
-Ref: 2669421302
-Ref: 2670421322
-Ref: 2671421349
-Ref: 2672421370
-Ref: 2673421397
-Ref: 2674421423
-Ref: 2675421450
-Ref: 2676421475
-Ref: 2677421519
-Ref: S0119421519
-Ref: 2678421534
-Ref: 2679421553
-Ref: 2680421573
-Ref: 2681421610
-Ref: S0120421610
-Ref: 2682421625
-Ref: 2683421644
-Ref: 2684421664
-Ref: 2685421700
-Ref: 2686421727
-Ref: 2687421760
-Ref: 2688421811
-Ref: S0121421811
-Ref: 2689421815
-Ref: 2690421837
-Ref: 2691421885
-Ref: S0122421885
-Ref: 2692421897
-Ref: 2693421917
-Ref: 2694421925
-Ref: 2695421969
-Ref: S0123421969
-Ref: 2696421975
-Ref: 2697421998
-Ref: 2698422004
-Ref: 2699422033
-Ref: 2700422051
-Ref: S0124422051
-Ref: 2701422055
-Ref: 2702422064
-Ref: 2703422085
-Ref: 2704422107
-Ref: S0125422107
-Ref: 2705422111
-Ref: 2706422124
-Ref: 2707422139
-Ref: 2708422153
-Ref: 2709422178
-Ref: S0126422178
-Ref: 2710422191
-Ref: 2711422216
-Ref: 2712422233
-Ref: 2713422251
-Ref: 2714422258
-Ref: 2715422271
-Ref: 2716422292
-Ref: 2717422319
-Ref: 2718422660
-Ref: 2719422800
-Ref: 2720422800
-Ref: 2721422800
-Node: 4.5424249
-Ref: 2722424398
-Ref: 2723424398
-Ref: 2724424764
-Ref: S0127424764
-Ref: 2725424816
-Ref: S0128424816
-Ref: 2726424885
-Ref: S0129424885
-Ref: 2727424937
-Ref: S0130424937
-Ref: 2728424982
-Ref: S0131424982
-Ref: 2729425048
-Ref: S0132425048
-Ref: 2730425326
-Ref: 2731425326
-Ref: 2732425483
-Ref: 2733425484
-Ref: 2734425484
-Ref: 2735425484
-Ref: 2736426048
-Ref: 2737426429
-Ref: 2738426626
-Node: 4.5.1428330
-Ref: 2739428554
-Ref: 2740428554
-Ref: 2741428554
-Ref: 2742428701
-Ref: 2743428815
-Ref: 2744428815
-Ref: 2745428815
-Ref: 2746428815
-Ref: 2747428815
-Ref: 2748428815
-Ref: 2749428815
-Ref: 2750428815
-Ref: 2751428996
-Ref: 2752430060
-Ref: 2753430363
-Ref: 2754430363
-Ref: 2755430527
-Ref: 2756430528
-Ref: 2757430617
-Node: 4.5.2431436
-Ref: 2758431609
-Ref: 2759431609
-Ref: 2760431609
-Ref: 2761431609
-Ref: 2762431609
-Ref: 2763431699
-Ref: 2764431700
-Ref: 2765431847
-Ref: 2766431848
-Ref: 2767431848
-Ref: 2768431848
-Ref: 2769431848
-Ref: 2770431848
-Ref: 2771431848
-Ref: 2772431848
-Ref: 2773431848
-Ref: 2774431848
-Ref: 2775431848
-Ref: 2776431848
-Ref: 2777431848
-Ref: 2778431848
-Ref: 2779431848
-Ref: 2780431848
-Ref: 2781431848
-Ref: 2782431848
-Ref: 2783431848
-Ref: 2784431848
-Ref: 2785431848
-Ref: 2786431848
-Ref: 2787431848
-Ref: 2788431848
-Ref: 2789431848
-Ref: 2790432017
-Ref: 2791432017
-Ref: 2792432017
-Ref: 2793432412
-Ref: 2794432412
-Ref: 2795436207
-Ref: 2796437187
-Ref: 2797437369
-Ref: 2798438082
-Ref: 2799440068
-Ref: 2800440171
-Ref: 2801440956
-Ref: 2802440963
-Ref: 2803441250
-Ref: 2804442384
-Node: 4.5.3445311
-Ref: 2805445494
-Ref: 2806445494
-Ref: 2807445494
-Ref: 2808445494
-Ref: 2809445494
-Ref: 2810445494
-Ref: 2811445494
-Ref: 2812445494
-Ref: 2813445494
-Ref: 2814445494
-Ref: 2815445772
-Ref: 2816445772
-Ref: 2817445772
-Ref: 2818445772
-Ref: 2819445772
-Ref: 2820445772
-Ref: 2821445772
-Ref: 2822446176
-Ref: 2823447070
-Ref: 2824447071
-Ref: 2825447220
-Ref: 2826447586
-Ref: 2827447592
-Node: 4.5.4448334
-Ref: 2828448515
-Ref: 2829448515
-Ref: 2830448515
-Ref: 2831448515
-Ref: 2832448515
-Ref: 2833448515
-Ref: 2834448515
-Ref: 2835448515
-Ref: 2836448515
-Ref: 2837448515
-Node: 4.5.5449017
-Ref: 2838449196
-Ref: 2839449196
-Ref: 2840449196
-Ref: 2841449196
-Ref: 2842449196
-Ref: 2843449196
-Ref: 2844449196
-Ref: 2845449196
-Ref: 2846449196
-Ref: 2847449196
-Ref: 2848449196
-Ref: 2849449196
-Ref: 2850449196
-Ref: 2851449196
-Ref: 2852449196
-Ref: 2853449196
-Ref: 2854453478
-Ref: 2855453484
-Ref: 2856453484
-Ref: 2857453484
-Node: 4.5.6456341
-Ref: 2858456534
-Ref: 2859456534
-Ref: 2860456534
-Ref: 2861456534
-Ref: 2862456534
-Ref: 2863456722
-Ref: 2864456722
-Ref: 2865456722
-Ref: 2866457598
-Ref: 2867457599
-Ref: 2868457599
-Ref: 2869457748
-Ref: 2870457748
-Ref: 2871457748
-Ref: 2872457748
-Ref: 2873458190
-Ref: 2874458703
-Ref: 2875459099
-Ref: 2876459099
-Ref: 2877459242
-Node: 4.5.7459292
-Ref: 2878460051
-Ref: S0133460051
-Ref: 2879460055
-Ref: 2880460072
-Ref: 2881460111
-Ref: S0134460111
-Ref: 2882460127
-Ref: 2883460152
-Ref: 2884460178
-Ref: 2885460203
-Ref: 2886460239
-Ref: 2887460270
-Ref: S0135460270
-Ref: 2888460283
-Ref: 2889460319
-Ref: S0136460319
-Ref: 2890460348
-Ref: 2891460371
-Ref: 2892460411
-Ref: 2893460477
-Ref: S0137460477
-Ref: 2894460496
-Ref: 2895460543
-Ref: 2896461246
-Ref: 2897461951
-Ref: 2898462125
-Ref: 2899462125
-Ref: 2900462126
-Ref: 2901463625
-Ref: 2902464021
-Ref: 2903464021
-Ref: 2904464021
-Ref: 2905464160
-Node: 4.5.8464162
-Ref: 2906464485
-Ref: S0138464485
-Ref: 2907464494
-Ref: 2908464505
-Ref: 2909464543
-Ref: 2910464566
-Ref: 2911464577
-Ref: 2912464603
-Ref: 2913464633
-Ref: S0139464633
-Ref: 2914464668
-Ref: S0140464668
-Ref: 2915464681
-Ref: 2916464933
-Ref: 2917465076
-Ref: 2918465488
-Node: 4.6466689
-Ref: 2919467093
-Ref: 2920467094
-Ref: 2921467094
-Ref: 2922467094
-Ref: 2923467094
-Ref: 2924467094
-Ref: 2925467159
-Ref: S0141467159
-Ref: 2926467173
-Ref: 2927467186
-Ref: 2928467207
-Ref: 2929467220
-Ref: 2930467229
-Ref: 2931467312
-Ref: 2932467395
-Ref: 2933467431
-Ref: 2934467684
-Ref: 2935467684
-Ref: 2936467894
-Ref: 2937467895
-Ref: 2938467948
-Ref: 2939468002
-Ref: 2940468423
-Ref: 2941468423
-Ref: 2942468644
-Ref: 2943468644
-Ref: 2944469252
-Ref: 2945469252
-Ref: 2946469355
-Ref: 2947469355
-Ref: 2948469592
-Ref: 2949469663
-Ref: 2950469878
-Ref: 2951470375
-Ref: 2952470375
-Ref: 2953470898
-Ref: 2954471120
-Ref: 2955471392
-Ref: 2956471866
-Ref: 2957471866
-Ref: 2958471995
-Ref: 2959471995
-Ref: 2960472269
-Ref: 2961472295
-Ref: 2962472569
-Ref: 2963473156
-Ref: 2964473271
-Ref: 2965473271
-Ref: 2966473271
-Ref: 2967473464
-Ref: 2968473465
-Ref: 2969473465
-Ref: 2970473740
-Ref: 2971473740
-Ref: 2972474254
-Ref: 2973474780
-Ref: 2974474780
-Ref: 2975474954
-Ref: 2976474954
-Ref: 2977474995
-Ref: 2978474995
-Ref: 2979475342
-Ref: 2980475342
-Ref: 2981475591
-Ref: 2982476180
-Ref: 2983476181
-Ref: 2984476191
-Ref: 2985476191
-Ref: 2986476441
-Ref: 2987476442
-Ref: 2988476868
-Ref: 2989476869
-Ref: 2990477519
-Ref: 2991477519
-Ref: 2992477842
-Ref: 2993477842
-Ref: 2994477958
-Ref: 2995477958
-Ref: 2996478649
-Ref: 2997478650
-Ref: 2998479182
-Ref: 2999479182
-Ref: 3000479182
-Ref: 3001479182
-Ref: 3002479182
-Ref: 3003479182
-Ref: 3004479182
-Ref: 3005479182
-Ref: 3006479580
-Ref: 3007479580
-Ref: 3008479585
-Ref: 3009479751
-Ref: 3010479752
-Ref: 3011479752
-Ref: 3012479752
-Ref: 3013479752
-Ref: 3014479752
-Ref: 3015480757
-Ref: 3016481269
-Ref: 3017481277
-Ref: 3018481277
-Ref: 3019481277
-Ref: 3020482323
-Ref: 3021482452
-Ref: 3022483023
-Ref: 3023483028
-Node: 4.7484940
-Ref: 3024485208
-Ref: 3025485279
-Ref: S0142485279
-Ref: 3026485292
-Ref: 3027485306
-Ref: 3028485320
-Ref: 3029485333
-Ref: 3030485395
-Ref: 3031485880
-Ref: 3032485880
-Ref: 3033485880
-Ref: 3034485880
-Ref: 3035485880
-Ref: 3036485880
-Ref: 3037485880
-Ref: 3038486105
-Ref: 3039486106
-Node: 4.8487349
-Ref: 3040487551
-Ref: 3041487552
-Ref: 3042487552
-Ref: 3043487613
-Ref: S0143487613
-Ref: 3044487631
-Ref: 3045487654
-Ref: 3046487686
-Ref: 3047487709
-Ref: 3048487763
-Ref: S0144487763
-Ref: 3049487784
-Ref: 3050487964
-Ref: 3051488493
-Ref: 3052488542
-Ref: 3053488611
-Ref: 3054488907
-Ref: 3055490141
-Ref: 3056490844
-Ref: 3057490898
-Ref: 3058491008
-Ref: 3059491009
-Ref: 3060491161
-Ref: 3061491166
-Ref: 3062491295
-Ref: 3063491743
-Ref: 3064491744
-Ref: 3065491744
-Ref: 3066491744
-Ref: 3067491828
-Ref: 3068491972
-Ref: 3069492704
-Ref: 3070492704
-Ref: 3071492704
-Ref: 3072492919
-Ref: 3073492919
-Ref: 3074492919
-Ref: 3075493159
-Ref: 3076493159
-Ref: 3077493159
-Ref: 3078493410
-Ref: 3079493410
-Ref: 3080493410
-Ref: 3081493410
-Ref: 3082493410
-Ref: 3083493411
-Ref: 3084493629
-Ref: 3085494320
-Node: 4.9495479
-Ref: 3086495829
-Ref: 3087495937
-Ref: 3088495942
-Ref: 3089497618
-Ref: 3090498022
-Ref: 3091498568
-Ref: 3092498943
-Ref: 3093499094
-Ref: 3094499373
-Ref: 3095499451
-Ref: 3096499669
-Ref: 3097500119
-Ref: 3098500238
-Ref: 3099500238
-Ref: 3100500238
-Ref: 3101500341
-Ref: 3102500485
-Ref: 3103500740
-Ref: 3104501063
-Ref: 3105503118
-Node: 4.9.1505240
-Ref: 3106505439
-Ref: 3107505946
-Ref: 3108506554
-Ref: 3109506715
-Ref: 3110506903
-Ref: 3111507075
-Node: 5507870
-Node: 5.1509095
-Ref: 3112509521
-Ref: S0145509521
-Ref: 3113509525
-Ref: 3114509537
-Ref: 3115509549
-Ref: 3116509573
-Ref: S0146509573
-Ref: 3117509587
-Ref: 3118509594
-Ref: 3119509614
-Ref: 3120509621
-Ref: 3121509666
-Ref: S0147509666
-Ref: 3122509670
-Ref: 3123509696
-Ref: 3124509721
-Ref: 3125509746
-Ref: 3126509765
-Ref: 3127509800
-Ref: 3128509828
-Ref: 3129509859
-Ref: 3130509881
-Ref: 3131509907
-Ref: 3132509927
-Ref: 3133509953
-Ref: 3134509996
-Ref: S0148509996
-Ref: 3135510011
-Ref: 3136510028
-Ref: 3137510053
-Ref: 3138510072
-Ref: 3139510098
-Ref: 3140510134
-Ref: 3141510155
-Ref: 3142510194
-Ref: S0149510194
-Ref: 3143510218
-Ref: S0150510218
-Ref: 3144510231
-Ref: 3145510282
-Ref: S0151510282
-Ref: 3146510286
-Ref: 3147511507
-Ref: 3148511562
-Ref: 3149512050
-Node: 5.2512911
-Ref: 3150513211
-Ref: S0152513211
-Ref: 3151513233
-Ref: 3152513241
-Ref: 3153513405
-Ref: 3154513406
-Ref: 3155513592
-Ref: 3156513593
-Ref: 3157513851
-Ref: 3158513926
-Ref: 3159514342
-Ref: 3160514467
-Ref: 3161514522
-Ref: 3162514677
-Ref: 3163514677
-Ref: 3164514677
-Ref: 3165515014
-Ref: 3166515234
-Ref: 3167515234
-Ref: 3168515539
-Node: 5.3517045
-Ref: 3169517374
-Ref: S0153517374
-Ref: 3170517391
-Ref: 3171517417
-Ref: 3172517455
-Ref: 3173517481
-Ref: 3174517530
-Ref: 3175517657
-Node: 5.4518549
-Ref: 3176518883
-Ref: S0154518883
-Ref: 3177518911
-Ref: 3178518937
-Ref: 3179518976
-Ref: 3180519056
-Ref: S0155519056
-Ref: 3181519074
-Ref: 3182519109
-Ref: 3183519186
-Ref: 3184519186
-Ref: 3185519250
-Ref: 3186520650
-Ref: 3187520986
-Ref: 3188520986
-Ref: 3189520986
-Node: 5.5522164
-Ref: 3190522442
-Ref: S0156522442
-Ref: 3191522461
-Ref: 3192522496
-Ref: 3193522533
-Ref: 3194522583
-Ref: 3195522622
-Ref: S0157522622
-Ref: 3196522633
-Ref: 3197522657
-Ref: 3198522700
-Ref: 3199522759
-Ref: S0158522759
-Ref: 3200522772
-Ref: 3201522805
-Ref: 3202523075
-Ref: 3203523218
-Ref: 3204523268
-Ref: 3205523585
-Ref: 3206523937
-Ref: 3207523937
-Ref: 3208524682
-Node: 5.5.1526914
-Ref: 3209527161
-Ref: 3210527366
-Ref: 3211527422
-Ref: 3212527500
-Ref: 3213527608
-Ref: 3214527688
-Ref: 3215527768
-Ref: 3216528028
-Ref: 3217528162
-Ref: 3218528216
-Ref: 3219528290
-Ref: 3220528428
-Ref: 3221529110
-Ref: 3222529183
-Ref: 3223529312
-Ref: 3224529312
-Ref: 3225529312
-Ref: 3226529467
-Ref: 3227529467
-Ref: 3228529467
-Ref: 3229529673
-Ref: 3230529806
-Ref: 3231529880
-Ref: 3232529974
-Ref: 3233530785
-Ref: 3234531400
-Node: 5.5.2531402
-Ref: 3235531685
-Ref: S0159531685
-Ref: 3236531699
-Ref: 3237531741
-Ref: 3238531755
-Ref: 3239531778
-Ref: 3240531826
-Ref: 3241531961
-Ref: 3242531961
-Ref: 3243532023
-Ref: 3244532151
-Ref: 3245532264
-Ref: 3246532264
-Ref: 3247532317
-Ref: 3248532317
-Ref: 3249532455
-Ref: 3250532455
-Ref: 3251532491
-Ref: 3252532491
-Ref: 3253534100
-Ref: 3254535533
-Ref: 3255536448
-Ref: 3256536711
-Ref: 3257537579
-Ref: 3258537749
-Ref: 3259537820
-Node: 5.6539585
-Ref: 3260539863
-Ref: S0160539863
-Ref: 3261539883
-Ref: 3262539944
-Ref: 3263539998
-Ref: 3264540053
-Ref: 3265540446
-Node: 5.7540826
-Ref: 3266541156
-Ref: S0161541156
-Ref: 3267541180
-Ref: 3268541192
-Ref: 3269541390
-Ref: 3270542177
-Node: 5.8543032
-Ref: 3271543313
-Ref: S0162543313
-Ref: 3272543329
-Ref: 3273543387
-Ref: 3274543852
-Node: 6544728
-Ref: 3275544821
-Ref: 3276544821
-Ref: 3277544821
-Ref: 3278545284
-Ref: 3279545343
-Ref: 3280545425
-Node: 6.1545857
-Ref: 3281546102
-Ref: S0163546102
-Ref: 3282546117
-Ref: 3283546148
-Ref: 3284546187
-Ref: 3285546282
-Ref: S0164546282
-Ref: 3286546296
-Ref: 3287546329
-Ref: 3288546387
-Ref: S0165546387
-Ref: 3289546402
-Ref: 3290546429
-Ref: 3291546487
-Ref: S0166546487
-Ref: 3292546501
-Ref: 3293546521
-Ref: 3294546574
-Ref: S0167546574
-Ref: 3295546580
-Ref: 3296546600
-Ref: 3297546613
-Ref: 3298546656
-Ref: S0168546656
-Ref: 3299546660
-Ref: 3300546690
-Ref: 3301546755
-Ref: S0169546755
-Ref: 3302546761
-Ref: 3303546781
-Ref: 3304546929
-Ref: S0170546929
-Ref: 3305546933
-Ref: 3306547238
-Ref: S0171547238
-Ref: 3307547242
-Ref: 3308547285
-Ref: S0172547285
-Ref: 3309547291
-Ref: 3310547343
-Ref: S0173547343
-Ref: 3311547358
-Ref: 3312547379
-Ref: 3313547395
-Ref: 3314547418
-Ref: 3315547438
-Ref: 3316547476
-Ref: S0174547476
-Ref: 3317547490
-Ref: 3318547517
-Ref: 3319547577
-Ref: S0175547577
-Ref: 3320547591
-Ref: 3321547628
-Ref: 3322547634
-Ref: 3323547650
-Ref: 3324547673
-Ref: 3325547702
-Ref: 3326547729
-Ref: 3327547751
-Ref: 3328547790
-Ref: S0176547790
-Ref: 3329547868
-Ref: 3330548059
-Ref: 3331548170
-Ref: 3332548223
-Ref: 3333548556
-Ref: 3334548556
-Ref: 3335549209
-Ref: 3336549839
-Ref: 3337550223
-Ref: 3338550233
-Ref: 3339550233
-Ref: 3340550359
-Ref: 3341550438
-Ref: 3342550862
-Ref: 3343551577
-Ref: 3344552431
-Node: 6.1.1554368
-Ref: 3345554874
-Ref: 3346554874
-Ref: 3347555037
-Ref: 3348555037
-Ref: 3349555300
-Ref: 3350555300
-Ref: 3351555529
-Ref: 3352555529
-Ref: 3353555738
-Ref: 3354555738
-Ref: 3355555902
-Ref: 3356555902
-Ref: 3357556168
-Ref: 3358556168
-Ref: 3359556319
-Ref: 3360556319
-Ref: 3361556459
-Ref: 3362556459
-Ref: 3363558366
-Ref: 3364558982
-Ref: 3365559527
-Ref: 3366559527
-Ref: 3367560253
-Ref: 3368560253
-Ref: 3369560321
-Ref: 3370560761
-Ref: 3371560776
-Ref: 3372562991
-Ref: 3373563006
-Ref: 3374564333
-Ref: 3375564333
-Ref: 3376564333
-Ref: 3377564632
-Ref: 3378564632
-Ref: 3379564632
-Ref: 3380565202
-Ref: 3381565202
-Ref: 3382565955
-Ref: 3383565955
-Ref: 3384565955
-Ref: 3385565955
-Ref: 3386565955
-Node: 6.2568862
-Ref: 3387569116
-Ref: 3388569116
-Ref: 3389569116
-Ref: 3390569116
-Ref: 3391569116
-Ref: 3392569116
-Ref: 3393569603
-Ref: 3394569839
-Ref: 3395570265
-Ref: 3396570745
-Ref: 3397570899
-Ref: 3398570899
-Ref: 3399570899
-Ref: 3400570899
-Ref: 3401571567
-Node: 6.3572136
-Ref: 3402572374
-Ref: S0177572374
-Ref: 3403572389
-Ref: 3404572420
-Ref: 3405572458
-Ref: 3406572495
-Ref: 3407572540
-Ref: 3408572585
-Ref: 3409573168
-Ref: 3410573420
-Ref: 3411573595
-Node: 6.3.1574532
-Ref: 3412574643
-Ref: 3413574643
-Ref: 3414574643
-Ref: 3415574643
-Ref: 3416574643
-Ref: 3417574881
-Ref: 3418574881
-Ref: 3419575255
-Ref: 3420575255
-Ref: 3421575450
-Ref: 3422575450
-Ref: 3423576444
-Ref: 3424576444
-Ref: 3425576727
-Ref: 3426576727
-Ref: 3427577643
-Ref: 3428577643
-Ref: 3429577965
-Ref: 3430577973
-Ref: 3431577973
-Ref: 3432578410
-Ref: 3433578418
-Ref: 3434578418
-Ref: 3435578685
-Ref: 3436578693
-Ref: 3437578693
-Ref: 3438579224
-Ref: 3439580294
-Ref: 3440580549
-Ref: 3441580555
-Ref: 3442580805
-Node: 6.3.2581324
-Ref: 3443582172
-Ref: 3444582172
-Node: 6.4582554
-Ref: 3445582665
-Ref: 3446582974
-Ref: S0178582974
-Ref: 3447582998
-Ref: 3448583023
-Ref: 3449583030
-Ref: 3450583074
-Ref: S0179583074
-Ref: 3451583097
-Ref: 3452583120
-Ref: 3453583127
-Ref: 3454583178
-Ref: S0180583178
-Ref: 3455583193
-Ref: 3456583218
-Ref: 3457583271
-Ref: S0181583271
-Ref: 3458583302
-Ref: 3459583320
-Ref: 3460583379
-Ref: S0182583379
-Ref: 3461583383
-Ref: 3462583406
-Ref: 3463583414
-Ref: 3464583419
-Ref: 3465584701
-Ref: 3466585353
-Ref: 3467585787
-Ref: 3468586090
-Ref: 3469586091
-Node: 6.4.1588349
-Ref: 3470588456
-Ref: 3471588793
-Ref: 3472588794
-Ref: 3473588794
-Ref: 3474588794
-Ref: 3475589021
-Ref: 3476589247
-Ref: 3477590083
-Ref: 3478590708
-Ref: 3479591141
-Ref: 3480592423
-Ref: 3481594663
-Ref: 3482595128
-Ref: 3483595139
-Ref: 3484595391
-Ref: 3485596442
-Ref: 3486597317
-Ref: 3487597317
-Ref: 3488597466
-Ref: 3489597466
-Ref: 3490597466
-Ref: 3491597466
-Ref: 3492597466
-Ref: 3493597703
-Ref: 3494597766
-Ref: 3495597821
-Node: 6.5598158
-Ref: 3496598408
-Ref: 3497598659
-Ref: S0183598659
-Ref: S0184598659
-Ref: 3498598672
-Ref: 3499598731
-Ref: S0185598731
-Ref: 3500598745
-Ref: 3501598787
-Ref: 3502598823
-Ref: 3503598872
-Ref: S0186598872
-Ref: 3504598893
-Ref: 3505598945
-Ref: 3506599035
-Ref: S0187599035
-Ref: 3507599039
-Ref: 3508599061
-Ref: 3509599139
-Ref: 3510599315
-Ref: 3511599461
-Ref: 3512599643
-Ref: 3513600915
-Ref: 3514602808
-Ref: 3515603203
-Ref: 3516603504
-Ref: 3517603827
-Ref: 3518603827
-Ref: 3519603969
-Ref: 3520603969
-Ref: 3521603970
-Ref: 3522603976
-Ref: 3523604173
-Ref: 3524604174
-Ref: 3525604940
-Ref: 3526604940
-Ref: 3527604941
-Ref: 3528604949
-Ref: 3529604949
-Ref: 3530605175
-Ref: 3531605805
-Ref: 3532605806
-Ref: 3533605806
-Node: 6.5.1608133
-Ref: 3534608833
-Ref: 3535608833
-Ref: 3536608833
-Ref: 3537609577
-Ref: 3538610049
-Node: 6.6610267
-Ref: 3539610394
-Ref: 3540610394
-Ref: 3541610394
-Ref: 3542611673
-Node: 6.7612192
-Ref: 3543612473
-Ref: S0188612473
-Ref: 3544612487
-Ref: 3545612517
-Ref: 3546612562
-Ref: 3547612897
-Ref: 3548613004
-Ref: 3549613004
-Ref: 3550613380
-Node: 6.8613765
-Ref: 3551614084
-Ref: S0189614084
-Ref: 3552614098
-Ref: 3553614128
-Ref: 3554614167
-Ref: 3555614192
-Ref: 3556614224
-Ref: 3557614254
-Ref: 3558614292
-Ref: 3559614315
-Ref: 3560614553
-Ref: 3561614916
-Ref: 3562615449
-Ref: 3563615449
-Ref: 3564615472
-Ref: 3565616140
-Node: 7616493
-Ref: 3566616580
-Ref: 3567616950
-Ref: 3568616951
-Ref: 3569616951
-Ref: 3570616951
-Node: 7.1617200
-Ref: 3571617589
-Ref: S0190617589
-Ref: 3572617593
-Ref: 3573617648
-Ref: S0191617648
-Ref: 3574617670
-Ref: 3575617711
-Ref: 3576617748
-Ref: 3577617801
-Ref: 3578617841
-Ref: 3579617859
-Ref: 3580618118
-Ref: 3581618118
-Ref: 3582618381
-Ref: 3583618541
-Ref: 3584618893
-Ref: 3585619357
-Node: 7.2620656
-Ref: 3586621206
-Ref: S0192621206
-Ref: 3587621233
-Ref: 3588621274
-Ref: 3589621311
-Ref: 3590621356
-Ref: 3591621403
-Ref: 3592621421
-Ref: 3593622747
-Ref: 3594623037
-Node: 7.3625188
-Ref: 3595625740
-Ref: 3596625741
-Ref: 3597625741
-Ref: 3598625741
-Ref: 3599625741
-Ref: 3600625817
-Ref: S0193625817
-Ref: 3601625835
-Ref: 3602625856
-Ref: 3603625934
-Ref: 3604625996
-Ref: S0194625996
-Ref: 3605626014
-Ref: 3606626035
-Ref: 3607626116
-Ref: 3608626156
-Ref: 3609626198
-Ref: 3610626269
-Ref: 3611626269
-Ref: 3612628489
-Ref: 3613628976
-Ref: 3614629454
-Ref: 3615630583
-Ref: 3616630635
-Ref: 3617630708
-Ref: 3618632175
-Ref: 3619632254
-Node: 7.3.1634623
-Ref: 3620634931
-Ref: 3621636494
-Ref: 3622636494
-Ref: 3623636494
-Ref: 3624636900
-Ref: 3625639177
-Ref: 3626639192
-Node: 7.3.2642943
-Ref: 3627643342
-Ref: 3628643678
-Ref: 3629643678
-Ref: 3630644090
-Ref: 3631644090
-Ref: 3632644185
-Ref: 3633644185
-Ref: 3634644185
-Ref: 3635644306
-Ref: 3636645893
-Ref: 3637645893
-Ref: 3638649122
-Ref: 3639649407
-Node: 7.4650952
-Ref: 3640651374
-Ref: 3641651496
-Ref: 3642651584
-Ref: 3643651828
-Ref: 3644653418
-Node: 7.5654222
-Ref: 3645656033
-Ref: 3646656422
-Ref: 3647656588
-Ref: 3648656588
-Ref: 3649657647
-Ref: 3650657647
-Ref: 3651657647
-Node: 7.6660072
-Ref: 3652660193
-Ref: 3653660193
-Ref: 3654660762
-Ref: 3655660763
-Ref: 3656660763
-Ref: 3657660859
-Ref: 3658660943
-Ref: 3659660944
-Ref: 3660660944
-Ref: 3661661492
-Ref: 3662661548
-Ref: 3663661669
-Ref: 3664661737
-Ref: 3665661805
-Ref: 3666661873
-Ref: 3667662018
-Ref: 3668662094
-Ref: 3669662242
-Ref: 3670662709
-Ref: 3671662709
-Ref: 3672663817
-Ref: 3673664376
-Ref: 3674664621
-Ref: 3675664621
-Ref: 3676664664
-Ref: 3677664664
-Ref: 3678664859
-Ref: 3679665001
-Ref: 3680665950
-Ref: 3681665950
-Ref: 3682666497
-Ref: 3683666521
-Ref: 3684666853
-Node: 7.6.1669713
-Ref: 3685670175
-Ref: 3686670176
-Ref: 3687670229
-Ref: 3688670229
-Ref: 3689670403
-Ref: 3690670404
-Ref: 3691670404
-Ref: 3692670404
-Ref: 3693670767
-Ref: 3694670767
-Ref: 3695670938
-Ref: 3696671411
-Ref: 3697671912
-Ref: 3698672665
-Ref: 3699673187
-Ref: 3700673828
-Ref: 3701673828
-Ref: 3702673829
-Ref: 3703673897
-Ref: 3704674245
-Ref: 3705674670
-Ref: 3706675821
-Ref: 3707676059
-Ref: 3708676513
-Ref: 3709676687
-Ref: 3710676927
-Ref: 3711677162
-Ref: 3712678699
-Node: 8679961
-Node: 8.1681063
-Ref: 3713681212
-Ref: 3714682488
-Ref: 3715682488
-Ref: 3716682488
-Ref: 3717682488
-Ref: 3718682488
-Ref: 3719682767
-Ref: 3720683015
-Node: 8.2684408
-Ref: 3721684991
-Ref: 3722685828
-Ref: 3723685833
-Ref: 3724685973
-Ref: 3725686330
-Ref: 3726686402
-Ref: 3727686605
-Ref: 3728687183
-Ref: 3729687603
-Ref: 3730687850
-Ref: 3731687855
-Ref: 3732687970
-Ref: 3733688179
-Node: 8.3688852
-Ref: 3734688951
-Ref: 3735689201
-Ref: 3736689201
-Ref: 3737689201
-Ref: 3738689509
-Ref: 3739689916
-Ref: 3740689916
-Ref: 3741689998
-Ref: 3742690121
-Ref: 3743690251
-Ref: 3744690369
-Ref: 3745690479
-Ref: 3746690604
-Ref: 3747690745
-Ref: 3748690883
-Ref: 3749691018
-Ref: 3750691241
-Ref: 3751691272
-Ref: 3752692935
-Ref: 3753693564
-Ref: 3754693564
-Ref: 3755693669
-Ref: 3756693787
-Ref: 3757694719
-Ref: 3758695258
-Ref: 3759696426
-Ref: 3760696426
-Ref: 3761696426
-Ref: 3762696426
-Ref: 3763696573
-Ref: 3764696640
-Ref: 3765696828
-Ref: 3766696927
-Ref: 3767696984
-Ref: 3768697078
-Ref: 3769697198
-Ref: 3770698346
-Ref: 3771698690
-Node: 8.3.1699594
-Ref: 3772699899
-Ref: S0195699899
-Ref: 3773700797
-Node: 8.4702232
-Ref: 3774702585
-Ref: S0196702585
-Ref: 3775702589
-Ref: 3776702611
-Ref: 3777702653
-Ref: S0197702653
-Ref: 3778702670
-Ref: 3779702686
-Ref: 3780702718
-Ref: S0198702718
-Ref: 3781702738
-Ref: 3782702754
-Ref: 3783702952
-Ref: 3784703955
-Ref: 3785703961
-Ref: 3786705063
-Ref: 3787705063
-Ref: 3788705539
-Node: 8.5705864
-Ref: 3789706298
-Ref: S0199706298
-Ref: 3790706314
-Ref: 3791706353
-Ref: 3792706395
-Ref: 3793706435
-Ref: 3794706478
-Ref: 3795706557
-Ref: 3796706720
-Ref: 3797706721
-Node: 8.5.1707964
-Ref: 3798708235
-Ref: S0200708235
-Ref: 3799708249
-Ref: 3800708272
-Ref: 3801708288
-Ref: 3802708322
-Ref: 3803708341
-Ref: 3804708373
-Ref: 3805708395
-Ref: 3806708428
-Ref: 3807708447
-Ref: 3808709443
-Ref: 3809709547
-Ref: 3810710063
-Ref: 3811710512
-Node: 8.5.2711425
-Ref: 3812711725
-Ref: S0201711725
-Ref: 3813711729
-Ref: 3814711785
-Ref: 3815711799
-Node: 8.5.3712202
-Ref: 3816712490
-Ref: S0202712490
-Ref: 3817712503
-Ref: 3818712552
-Ref: 3819712566
-Node: 8.5.4713475
-Ref: 3820713722
-Ref: 3821713780
-Ref: 3822714041
-Ref: S0203714041
-Ref: 3823714056
-Ref: 3824714087
-Ref: 3825714136
-Ref: 3826714155
-Ref: 3827714230
-Ref: 3828714492
-Ref: 3829715154
-Ref: 3830715428
-Ref: 3831715561
-Ref: 3832715844
-Ref: 3833717759
-Ref: 3834717759
-Node: 8.5.5720704
-Ref: 3835720983
-Ref: S0204720983
-Ref: 3836721015
-Ref: 3837721072
-Ref: 3838721091
-Ref: 3839721143
-Ref: 3840721202
-Ref: 3841721221
-Ref: 3842721272
-Ref: 3843721330
-Ref: 3844721349
-Node: 8.6722176
-Ref: 3845722313
-Ref: 3846722589
-Ref: 3847723192
-Ref: 3848723583
-Ref: 3849723952
-Ref: 3850723952
-Ref: 3851724595
-Ref: 3852724681
-Ref: 3853724682
-Ref: 3854724682
-Ref: 3855724910
-Ref: 3856725211
-Ref: 3857725406
-Ref: 3858726729
-Ref: 3859727115
-Ref: 3860727312
-Ref: 3861727464
-Ref: 3862727464
-Ref: 3863727721
-Ref: 3864728651
-Ref: 3865728788
-Ref: 3866728919
-Ref: 3867728972
-Ref: 3868729714
-Ref: 3869729714
-Ref: 3870730253
-Ref: 3871731066
-Ref: 3872731360
-Ref: 3873731761
-Node: 9732563
-Ref: 3874732687
-Ref: 3875732766
-Ref: 3876732767
-Ref: 3877732999
-Ref: 3878733000
-Ref: 3879733000
-Ref: 3880733000
-Ref: 3881733059
-Ref: 3882734220
-Ref: 3883734464
-Ref: 3884734465
-Ref: 3885734465
-Ref: 3886734465
-Ref: 3887734465
-Ref: 3888734465
-Ref: 3889734465
-Ref: 3890734465
-Ref: 3891734613
-Node: 9.1735685
-Ref: 3892735806
-Ref: 3893736215
-Ref: S0205736215
-Ref: 3894736238
-Ref: 3895736259
-Ref: 3896736298
-Ref: 3897736339
-Ref: 3898736370
-Ref: 3899736421
-Ref: S0206736421
-Ref: 3900736439
-Ref: 3901736474
-Ref: 3902736514
-Ref: 3903736545
-Ref: 3904736586
-Ref: S0207736586
-Ref: 3905736602
-Ref: 3906736641
-Ref: 3907736670
-Ref: 3908736701
-Ref: S0208736701
-Ref: 3909736705
-Ref: 3910736726
-Ref: 3911736759
-Ref: S0209736759
-Ref: 3912736782
-Ref: 3913736816
-Ref: 3914736851
-Ref: 3915736892
-Ref: 3916736941
-Ref: 3917737218
-Ref: 3918737405
-Ref: 3919738444
-Ref: 3920738445
-Ref: 3921738445
-Ref: 3922738498
-Ref: 3923739139
-Ref: 3924739503
-Ref: 3925739698
-Ref: 3926739778
-Ref: 3927739989
-Ref: 3928740058
-Ref: 3929740180
-Ref: 3930740347
-Ref: 3931740598
-Node: 9.2743438
-Ref: 3932743628
-Ref: 3933743730
-Ref: 3934743731
-Ref: 3935743731
-Ref: 3936743731
-Ref: 3937743876
-Ref: 3938745824
-Ref: 3939745824
-Ref: 3940745981
-Node: 9.3747573
-Ref: 3941747775
-Ref: 3942747775
-Ref: 3943747775
-Ref: 3944747775
-Ref: 3945748596
-Ref: 3946749094
-Node: 9.4751995
-Ref: 3947752148
-Ref: 3948752148
-Ref: 3949752148
-Ref: 3950752148
-Ref: 3951752318
-Ref: 3952752319
-Ref: 3953752319
-Ref: 3954752700
-Ref: 3955752779
-Ref: S0210752779
-Ref: 3956752806
-Ref: 3957752827
-Ref: 3958752866
-Ref: 3959752906
-Ref: 3960752937
-Ref: 3961752997
-Ref: S0211752997
-Ref: 3962753019
-Ref: 3963753053
-Ref: 3964753093
-Ref: 3965753124
-Ref: 3966753174
-Ref: S0212753174
-Ref: 3967753190
-Ref: 3968753250
-Ref: 3969753306
-Ref: 3970753359
-Ref: S0213753359
-Ref: 3971753363
-Ref: 3972753399
-Ref: 3973753429
-Ref: 3974753480
-Ref: S0214753480
-Ref: 3975753484
-Ref: 3976753529
-Ref: 3977753575
-Ref: S0215753575
-Ref: 3978753602
-Ref: 3979753636
-Ref: 3980753671
-Ref: 3981753720
-Ref: 3982753767
-Ref: S0216753767
-Ref: 3983753771
-Ref: 3984753807
-Ref: 3985753835
-Ref: 3986753874
-Ref: 3987753918
-Ref: 3988753941
-Ref: 3989754253
-Ref: 3990754486
-Ref: 3991755546
-Ref: 3992755547
-Ref: 3993755547
-Ref: 3994755547
-Ref: 3995755602
-Ref: 3996756353
-Ref: 3997756729
-Ref: 3998756978
-Ref: 3999757059
-Ref: 4000757989
-Ref: 4001758199
-Ref: 4002758278
-Ref: 4003758410
-Ref: 4004758626
-Ref: 4005758744
-Ref: 4006759157
-Ref: 4007759613
-Ref: 4008759613
-Ref: 4009759918
-Node: 9.5762551
-Ref: 4010762676
-Ref: 4011762676
-Ref: 4012763185
-Ref: 4013763686
-Ref: 4014763930
-Ref: 4015764872
-Ref: 4016764872
-Ref: 4017764872
-Ref: 4018765864
-Ref: S0217765864
-Ref: 4019766287
-Ref: 4020766287
-Ref: 4021767474
-Node: 9.5.1767928
-Ref: 4022768091
-Ref: 4023768091
-Ref: 4024768091
-Ref: 4025769254
-Ref: 4026769254
-Ref: 4027769577
-Ref: 4028769756
-Ref: 4029770423
-Ref: 4030770748
-Ref: 4031770748
-Ref: 4032771072
-Ref: 4033771072
-Ref: 4034771442
-Ref: 4035771543
-Ref: 4036771544
-Ref: 4037772034
-Node: 9.5.2774349
-Ref: 4038774725
-Ref: S0218774725
-Ref: 4039774739
-Ref: 4040774775
-Ref: 4041774797
-Ref: 4042774827
-Ref: 4043774863
-Ref: 4044774910
-Ref: S0219774910
-Ref: 4045774936
-Ref: 4046774950
-Ref: 4047774964
-Ref: 4048774996
-Ref: 4049775046
-Ref: 4050775079
-Ref: S0220775079
-Ref: 4051775083
-Ref: 4052775113
-Ref: S0221775113
-Ref: 4053775131
-Ref: 4054775152
-Ref: 4055775176
-Ref: 4056775208
-Ref: 4057775247
-Ref: 4058775296
-Ref: 4059775339
-Ref: S0222775339
-Ref: 4060775346
-Ref: 4061775374
-Ref: 4062775419
-Ref: S0223775419
-Ref: 4063775429
-Ref: 4064775472
-Ref: S0224775472
-Ref: 4065775481
-Ref: 4066775504
-Ref: 4067776101
-Ref: 4068776227
-Ref: 4069777488
-Ref: 4070778015
-Ref: 4071778480
-Ref: 4072778573
-Ref: 4073778707
-Ref: 4074778821
-Ref: 4075779268
-Ref: 4076779625
-Ref: 4077779625
-Ref: 4078779625
-Ref: 4079780083
-Ref: 4080780084
-Ref: 4081780363
-Ref: 4082780501
-Ref: 4083781036
-Ref: 4084781236
-Ref: 4085781237
-Ref: 4086781237
-Ref: 4087781863
-Ref: 4088782247
-Node: 9.5.3784491
-Ref: 4089784604
-Ref: 4090784675
-Ref: 4091784676
-Ref: 4092784959
-Ref: S0225784959
-Ref: 4093784970
-Ref: 4094784976
-Ref: 4095785529
-Ref: 4096785529
-Ref: 4097785529
-Ref: 4098785529
-Ref: 4099785672
-Ref: 4100785672
-Ref: 4101785959
-Ref: 4102785959
-Ref: 4103786121
-Ref: 4104786300
-Ref: 4105786449
-Ref: 4106786645
-Ref: 4107787654
-Ref: 4108787795
-Ref: 4109787795
-Ref: 4110788385
-Ref: 4111788676
-Ref: 4112788780
-Ref: 4113788781
-Ref: 4114789288
-Ref: 4115789670
-Ref: 4116790455
-Node: 9.5.4793688
-Ref: 4117793962
-Ref: 4118794107
-Ref: 4119794108
-Ref: 4120794177
-Ref: S0226794177
-Ref: 4121794209
-Ref: 4122794282
-Ref: 4123794677
-Ref: 4124795079
-Ref: 4125796637
-Ref: 4126797334
-Ref: 4127797799
-Ref: 4128798071
-Ref: 4129799228
-Ref: 4130800157
-Node: 9.6800507
-Ref: 4131800658
-Ref: 4132801131
-Ref: 4133801197
-Ref: S0227801197
-Ref: 4134801201
-Ref: 4135801226
-Ref: 4136801286
-Ref: S0228801286
-Ref: 4137801309
-Ref: 4138801353
-Ref: S0229801353
-Ref: 4139801370
-Ref: 4140801434
-Ref: 4141801539
-Ref: 4142801680
-Ref: 4143801680
-Ref: 4144801680
-Ref: 4145802604
-Ref: 4146802651
-Ref: 4147802689
-Ref: 4148802748
-Ref: 4149802802
-Ref: 4150802856
-Ref: 4151802924
-Ref: 4152802963
-Ref: 4153803020
-Ref: 4154803078
-Ref: 4155803134
-Ref: 4156803197
-Ref: 4157803447
-Ref: 4158804159
-Ref: 4159804319
-Ref: 4160804399
-Ref: 4161804561
-Ref: 4162804810
-Ref: 4163804950
-Ref: 4164805150
-Ref: 4165808633
-Ref: 4166808633
-Ref: 4167809209
-Ref: 4168809209
-Node: 9.6.1809694
-Ref: 4169809971
-Ref: 4170810069
-Ref: 4171810120
-Ref: 4172810174
-Ref: 4173810277
-Ref: 4174810378
-Ref: 4175810544
-Ref: 4176810619
-Ref: 4177811143
-Ref: 4178811277
-Ref: 4179811290
-Ref: 4180811298
-Ref: 4181811307
-Ref: 4182811318
-Ref: 4183811340
-Ref: 4184811348
-Ref: 4185811358
-Ref: 4186811390
-Ref: 4187811502
-Ref: 4188811564
-Ref: 4189811626
-Ref: 4190811688
-Ref: 4191811765
-Ref: 4192811936
-Ref: 4193812108
-Ref: 4194812278
-Ref: 4195812449
-Ref: 4196812622
-Ref: 4197812724
-Ref: 4198812828
-Ref: 4199813097
-Ref: 4200813386
-Ref: 4201813943
-Ref: 4202814338
-Ref: 4203814855
-Ref: 4204815423
-Ref: 4205815853
-Ref: 4206816043
-Ref: 4207816167
-Ref: 4208816303
-Node: 9.7830021
-Ref: 4209830421
-Ref: S0230830421
-Ref: 4210830434
-Ref: 4211830460
-Ref: 4212830486
-Ref: 4213830518
-Node: 9.7.1830901
-Ref: 4214831224
-Ref: 4215831291
-Ref: S0231831291
-Ref: 4216831319
-Ref: 4217831336
-Ref: 4218831374
-Ref: 4219831391
-Ref: 4220831432
-Ref: 4221831489
-Ref: S0232831489
-Ref: 4222831499
-Ref: 4223831538
-Ref: S0233831538
-Ref: 4224831551
-Ref: 4225831579
-Ref: 4226831606
-Ref: 4227831654
-Ref: S0234831654
-Ref: 4228831666
-Ref: 4229831684
-Ref: 4230831733
-Ref: S0235831733
-Ref: 4231831745
-Ref: 4232831762
-Ref: 4233831815
-Ref: S0236831815
-Ref: 4234832054
-Ref: 4235832511
-Ref: 4236832688
-Ref: 4237833333
-Ref: 4238833982
-Ref: 4239835136
-Node: 9.7.2836044
-Ref: 4240836452
-Ref: 4241836519
-Ref: S0237836519
-Ref: 4242836546
-Ref: 4243836587
-Ref: 4244836656
-Ref: S0238836656
-Ref: 4245836668
-Ref: 4246836693
-Ref: 4247836752
-Ref: S0239836752
-Ref: 4248836764
-Ref: 4249836791
-Ref: 4250837243
-Node: 9.7.3838717
-Ref: 4251839219
-Ref: S0240839219
-Ref: 4252839246
-Ref: 4253839289
-Ref: 4254839381
-Node: 9.7.4840172
-Ref: 4255840519
-Ref: S0241840519
-Ref: 4256840546
-Ref: 4257840595
-Ref: 4258840659
-Ref: S0242840659
-Ref: 4259840663
-Ref: 4260840686
-Ref: 4261840746
-Ref: S0243840746
-Ref: 4262840750
-Ref: 4263840777
-Ref: 4264840815
-Ref: S0244840815
-Ref: 4265840819
-Ref: 4266840895
-Ref: 4267840895
-Ref: 4268841772
-Ref: 4269842828
-Ref: 4270842828
-Ref: 4271842828
-Ref: 4272843258
-Ref: 4273843259
-Ref: 4274843259
-Ref: 4275843259
-Ref: 4276843259
-Node: 9.8843661
-Ref: 4277844186
-Ref: S0245844186
-Ref: 4278844202
-Ref: 4279844215
-Ref: 4280844274
-Ref: 4281844419
-Ref: 4282844517
-Ref: 4283844517
-Ref: 4284844518
-Ref: 4285844518
-Ref: 4286844688
-Ref: 4287844688
-Ref: 4288845114
-Ref: 4289845812
-Ref: 4290846798
-Ref: 4291847311
-Ref: 4292847594
-Ref: 4293847917
-Ref: 4294847917
-Ref: 4295847917
-Ref: 4296847917
-Node: 9.9848506
-Ref: 4297848807
-Ref: 4298848822
-Ref: 4299848919
-Ref: 4300848920
-Ref: 4301849085
-Ref: 4302849100
-Ref: 4303849604
-Ref: 4304849619
-Node: 9.10850660
-Ref: 4305850823
-Ref: 4306850823
-Ref: 4307851514
-Ref: 4308851986
-Ref: 4309853528
-Ref: 4310853790
-Node: 9.11854303
-Node: 10857826
-Ref: 4311858217
-Ref: 4312858217
-Ref: 4313858217
-Ref: 4314858522
-Node: 10.1859010
-Ref: 4315859122
-Ref: 4316859122
-Ref: 4317859122
-Ref: 4318859437
-Ref: 4319859741
-Ref: 4320859988
-Node: 10.1.1860535
-Ref: 4321860892
-Ref: 4322861084
-Ref: S0246861084
-Ref: 4323861090
-Ref: 4324861132
-Ref: S0247861132
-Ref: 4325861146
-Ref: 4326861161
-Ref: 4327861183
-Ref: 4328861198
-Ref: 4329861226
-Ref: S0248861226
-Ref: 4330861241
-Ref: 4331861275
-Ref: 4332861312
-Ref: 4333861378
-Ref: S0249861378
-Ref: 4334861393
-Ref: 4335861420
-Ref: 4336861450
-Ref: 4337861474
-Ref: 4338861537
-Ref: S0250861537
-Ref: 4339861550
-Ref: 4340861587
-Ref: 4341861624
-Ref: 4342861681
-Ref: S0251861681
-Ref: 4343861685
-Ref: 4344861704
-Ref: 4345861741
-Ref: S0252861741
-Ref: 4346861745
-Ref: 4347861932
-Ref: 4348861932
-Ref: 4349861932
-Ref: 4350861932
-Ref: 4351861932
-Ref: 4352862239
-Ref: 4353862555
-Ref: 4354862555
-Ref: 4355862779
-Ref: 4356863071
-Ref: 4357863300
-Ref: 4358863437
-Ref: 4359863507
-Ref: 4360863507
-Ref: 4361863507
-Ref: 4362863507
-Ref: 4363863770
-Ref: 4364863891
-Ref: 4365864079
-Ref: 4366867945
-Ref: 4367867945
-Node: 10.1.2871068
-Ref: 4368871392
-Ref: S0253871392
-Ref: 4369871398
-Ref: 4370871432
-Ref: S0254871432
-Ref: 4371871436
-Ref: 4372871451
-Ref: 4373871483
-Ref: S0255871483
-Ref: 4374871487
-Ref: 4375871510
-Ref: 4376871564
-Ref: S0256871564
-Ref: 4377871605
-Ref: 4378871632
-Ref: 4379871673
-Ref: S0257871673
-Ref: 4380871706
-Ref: 4381871733
-Ref: 4382871792
-Ref: 4383872156
-Ref: 4384872156
-Ref: 4385872216
-Ref: 4386872217
-Node: 10.1.3877506
-Ref: 4387878036
-Ref: S0258878036
-Ref: 4388878040
-Ref: 4389878064
-Ref: 4390878084
-Ref: 4391878107
-Ref: 4392878157
-Ref: S0259878157
-Ref: 4393878171
-Ref: 4394878201
-Ref: 4395878250
-Ref: 4396878300
-Ref: S0260878300
-Ref: 4397878326
-Ref: 4398878370
-Ref: 4399878417
-Ref: S0261878417
-Ref: 4400878440
-Ref: 4401878484
-Ref: 4402878536
-Ref: S0262878536
-Ref: 4403878564
-Ref: 4404878608
-Ref: 4405878646
-Ref: S0263878646
-Ref: 4406878661
-Ref: 4407878679
-Ref: 4408878741
-Ref: 4409878834
-Ref: 4410879099
-Ref: 4411879981
-Ref: 4412880226
-Node: 10.1.4882031
-Ref: 4413882174
-Ref: 4414882174
-Ref: 4415883842
-Ref: 4416884025
-Ref: 4417885672
-Ref: 4418886089
-Node: 10.1.5886414
-Ref: 4419886705
-Ref: 4420886705
-Ref: 4421886760
-Ref: 4422888623
-Ref: 4423888623
-Ref: 4424888623
-Ref: 4425888623
-Ref: 4426889040
-Ref: 4427889040
-Node: 10.1.6890152
-Ref: 4428890575
-Ref: 4429890575
-Ref: 4430890575
-Ref: 4431890575
-Ref: 4432891227
-Ref: 4433891227
-Ref: 4434891227
-Ref: 4435891227
-Ref: 4436891699
-Ref: 4437891699
-Ref: 4438891922
-Ref: 4439891922
-Ref: 4440892121
-Node: 10.2892476
-Ref: 4441892582
-Ref: 4442892582
-Ref: 4443892582
-Ref: 4444892805
-Ref: 4445892805
-Ref: 4446893010
-Ref: 4447893495
-Ref: 4448893496
-Ref: 4449893496
-Ref: 4450894022
-Ref: 4451894211
-Ref: 4452894579
-Ref: 4453894580
-Ref: 4454895466
-Ref: 4455897148
-Ref: 4456897269
-Ref: 4457897832
-Ref: 4458897832
-Ref: 4459898096
-Ref: 4460898503
-Node: 10.2.1900604
-Ref: 4461900709
-Ref: 4462900912
-Ref: 4463900913
-Ref: 4464900940
-Ref: 4465900951
-Ref: 4466900956
-Ref: 4467901101
-Ref: 4468901102
-Ref: 4469901131
-Ref: 4470901193
-Ref: 4471902074
-Ref: 4472902615
-Ref: 4473902759
-Ref: 4474902759
-Ref: 4475903145
-Ref: 4476903304
-Ref: 4477903474
-Ref: 4478905803
-Ref: 4479906748
-Ref: 4480906749
-Ref: 4481906768
-Ref: 4482906780
-Ref: 4483906785
-Ref: 4484906879
-Ref: 4485908279
-Ref: 4486908377
-Ref: 4487908377
-Ref: 4488908809
-Ref: 4489910474
-Ref: 4490910475
-Ref: 4491910498
-Ref: 4492910518
-Ref: 4493910543
-Ref: 4494910544
-Ref: 4495910571
-Ref: 4496910591
-Ref: 4497910616
-Ref: 4498910617
-Ref: 4499910646
-Ref: 4500910749
-Ref: 4501910754
-Ref: 4502910855
-Ref: 4503911010
-Ref: 4504911726
-Ref: 4505911726
-Node: 11911924
-Ref: 4506912149
-Ref: 4507912150
-Ref: 4508912150
-Ref: 4509912150
-Ref: 4510912150
-Ref: 4511912150
-Ref: 4512912289
-Ref: 4513912431
-Node: 11.1913208
-Ref: 4514913324
-Ref: 4515913455
-Ref: S0264913455
-Ref: 4516913459
-Ref: 4517913506
-Ref: 4518914057
-Ref: 4519914057
-Ref: 4520914057
-Ref: 4521914057
-Ref: 4522914057
-Ref: 4523914321
-Ref: 4524914383
-Ref: 4525914383
-Ref: 4526914383
-Ref: 4527914487
-Node: 11.2914755
-Ref: 4528915032
-Ref: S0265915032
-Ref: 4529915047
-Ref: 4530915098
-Ref: 4531915126
-Ref: 4532915171
-Ref: S0266915171
-Ref: 4533915189
-Ref: 4534915222
-Ref: 4535915242
-Ref: 4536915279
-Ref: 4537915340
-Ref: S0267915340
-Ref: 4538915344
-Ref: 4539915389
-Ref: S0268915389
-Ref: 4540915404
-Ref: 4541915541
-Ref: 4542916172
-Ref: 4543916515
-Node: 11.3917115
-Ref: 4544917381
-Ref: S0269917381
-Ref: 4545917422
-Ref: 4546917440
-Ref: 4547917481
-Ref: S0270917481
-Ref: 4548917502
-Ref: 4549917520
-Ref: 4550918175
-Ref: 4551918640
-Ref: 4552918739
-Ref: 4553919093
-Node: 11.4919787
-Ref: 4554920056
-Ref: 4555920130
-Ref: 4556920336
-Ref: 4557920336
-Ref: 4558920581
-Ref: 4559920719
-Ref: 4560921328
-Ref: 4561921496
-Ref: 4562921496
-Ref: 4563921496
-Node: 11.4.1922179
-Ref: 4564922411
-Ref: 4565922521
-Ref: 4566922615
-Ref: 4567922666
-Ref: 4568922733
-Ref: 4569922810
-Ref: 4570922911
-Ref: 4571923034
-Ref: 4572923107
-Ref: 4573923180
-Ref: 4574923326
-Ref: 4575923404
-Ref: 4576923476
-Ref: 4577923597
-Ref: 4578923734
-Ref: 4579923899
-Ref: 4580924079
-Ref: 4581924166
-Ref: 4582924305
-Ref: 4583925496
-Ref: 4584925511
-Ref: 4585926527
-Ref: 4586927875
-Node: 11.4.2929545
-Ref: 4587930108
-Ref: 4588930108
-Ref: 4589930402
-Ref: 4590930403
-Ref: 4591930429
-Ref: 4592930467
-Ref: 4593930669
-Ref: 4594930670
-Ref: 4595930694
-Ref: 4596930727
-Ref: 4597930728
-Ref: 4598930770
-Ref: 4599930792
-Ref: 4600930826
-Ref: 4601930848
-Ref: 4602930867
-Ref: 4603930872
-Ref: 4604933723
-Ref: 4605933801
-Ref: 4606933854
-Ref: 4607933900
-Ref: 4608934572
-Ref: 4609934572
-Node: 11.4.3936942
-Node: 11.5939473
-Ref: 4610939612
-Ref: 4611939858
-Ref: 4612939858
-Ref: 4613939858
-Ref: 4614939858
-Ref: 4615939858
-Ref: 4616940059
-Ref: 4617940267
-Ref: 4618940268
-Ref: 4619940277
-Ref: 4620940310
-Ref: 4621940311
-Ref: 4622940322
-Ref: 4623940340
-Ref: 4624940345
-Ref: 4625940345
-Ref: 4626940345
-Ref: 4627941449
-Ref: 4628942032
-Ref: 4629942153
-Ref: 4630942424
-Ref: 4631942713
-Ref: 4632942839
-Ref: 4633943405
-Ref: 4634943613
-Ref: 4635943874
-Ref: 4636944450
-Ref: 4637944734
-Ref: 4638944854
-Ref: 4639944949
-Ref: 4640945240
-Ref: 4641945693
-Ref: 4642945693
-Ref: 4643946066
-Ref: 4644946525
-Ref: 4645946993
-Ref: 4646947492
-Ref: 4647947492
-Node: 11.6948209
-Ref: 4648948337
-Ref: 4649948337
-Ref: 4650948337
-Ref: 4651948337
-Ref: 4652948337
-Ref: 4653948337
-Ref: 4654948536
-Ref: 4655949407
-Ref: 4656949407
-Ref: 4657950198
-Ref: 4658950932
-Ref: 4659951108
-Ref: 4660951109
-Ref: 4661951109
-Node: 12951599
-Ref: 4662951701
-Ref: 4663951791
-Ref: 4664952016
-Ref: 4665952017
-Ref: 4666952017
-Node: 12.1953102
-Ref: 4667953627
-Ref: S0271953627
-Ref: 4668953631
-Ref: 4669953665
-Ref: 4670953739
-Ref: S0272953739
-Ref: 4671953754
-Ref: 4672953775
-Ref: 4673953814
-Ref: 4674953872
-Ref: S0273953872
-Ref: 4675953887
-Ref: 4676953908
-Ref: 4677953958
-Ref: S0274953958
-Ref: 4678953972
-Ref: 4679954017
-Ref: 4680954073
-Ref: S0275954073
-Ref: 4681954089
-Ref: 4682954126
-Ref: 4683954161
-Ref: 4684954202
-Ref: 4685954567
-Ref: 4686954567
-Ref: 4687954567
-Ref: 4688954567
-Ref: 4689954694
-Ref: 4690955142
-Node: 12.2957591
-Ref: 4691957704
-Ref: 4692957910
-Node: 12.3959837
-Ref: 4693959964
-Ref: 4694960106
-Ref: S0276960106
-Ref: 4695960129
-Ref: 4696960193
-Ref: 4697960199
-Ref: 4698960238
-Ref: 4699960272
-Ref: 4700960314
-Ref: 4701960380
-Ref: 4702960386
-Ref: 4703960425
-Ref: 4704960459
-Ref: 4705960500
-Ref: 4706960558
-Ref: 4707960564
-Ref: 4708960603
-Ref: 4709960653
-Ref: S0277960653
-Ref: 4710960667
-Ref: 4711960690
-Ref: 4712960739
-Ref: S0278960739
-Ref: 4713960778
-Ref: 4714960796
-Ref: 4715960877
-Ref: S0279960877
-Ref: 4716960881
-Ref: 4717960904
-Ref: 4718960930
-Ref: 4719960943
-Ref: 4720960950
-Ref: 4721960990
-Ref: 4722960998
-Ref: 4723961003
-Ref: 4724961242
-Ref: 4725961242
-Ref: 4726961242
-Ref: 4727963645
-Ref: 4728963646
-Ref: 4729963646
-Ref: 4730963646
-Ref: 4731963646
-Ref: 4732963646
-Ref: 4733963646
-Ref: 4734963646
-Ref: 4735965434
-Ref: 4736966711
-Ref: 4737967094
-Ref: 4738967159
-Node: 12.4968602
-Ref: 4739968715
-Ref: 4740968715
-Ref: 4741968874
-Ref: S0280968874
-Ref: 4742968888
-Ref: 4743968915
-Ref: 4744968921
-Ref: 4745968937
-Ref: 4746968960
-Ref: 4747968994
-Ref: 4748969027
-Ref: 4749969054
-Ref: 4750969059
-Ref: 4751969081
-Ref: 4752969121
-Ref: 4753969196
-Ref: 4754969306
-Ref: 4755969965
-Ref: 4756970700
-Ref: 4757970804
-Ref: 4758971411
-Ref: 4759971723
-Ref: 4760971869
-Ref: 4761972247
-Ref: 4762972247
-Ref: 4763972247
-Ref: 4764972600
-Ref: 4765972600
-Ref: 4766972876
-Node: 12.5973276
-Ref: 4767973580
-Ref: S0281973580
-Ref: 4768973596
-Ref: 4769973640
-Ref: 4770973719
-Ref: S0282973719
-Ref: 4771973738
-Ref: 4772973758
-Ref: 4773973780
-Ref: 4774973823
-Ref: 4775973892
-Ref: S0283973892
-Ref: 4776973911
-Ref: 4777973931
-Ref: 4778973995
-Ref: S0284973995
-Ref: 4779974011
-Ref: 4780974053
-Ref: 4781974095
-Ref: 4782974138
-Ref: 4783974187
-Ref: 4784974229
-Ref: 4785974273
-Ref: 4786974323
-Ref: 4787974372
-Ref: 4788974412
-Ref: 4789974453
-Ref: 4790974534
-Ref: 4791974534
-Ref: 4792974534
-Ref: 4793974534
-Ref: 4794974690
-Ref: 4795974690
-Ref: 4796974690
-Ref: 4797974690
-Ref: 4798974808
-Ref: 4799974808
-Node: 12.5.1977754
-Ref: 4800978486
-Ref: S0285978486
-Ref: 4801978574
-Ref: S0286978574
-Ref: 4802978629
-Ref: 4803978648
-Ref: 4804978871
-Ref: 4805978871
-Ref: 4806981852
-Ref: 4807984607
-Ref: 4808984622
-Ref: 4809985942
-Node: 12.5.2986591
-Ref: 4810987065
-Ref: S0287987065
-Ref: 4811987120
-Ref: S0288987120
-Ref: 4812987172
-Ref: S0289987172
-Ref: 4813987224
-Ref: S0290987224
-Ref: 4814987285
-Ref: S0291987285
-Ref: 4815987344
-Ref: S0292987344
-Node: 12.5.3987785
-Ref: 4816988081
-Ref: S0293988081
-Ref: 4817988085
-Ref: 4818988799
-Ref: 4819988897
-Node: 12.5.4989720
-Ref: 4820990021
-Ref: S0294990021
-Ref: 4821990025
-Ref: 4822990211
-Ref: 4823990697
-Node: 12.5.5991328
-Ref: 4824991631
-Ref: S0295991631
-Ref: 4825991635
-Node: 12.6992558
-Ref: 4826992679
-Ref: 4827992679
-Ref: 4828992835
-Ref: S0296992835
-Ref: 4829992839
-Ref: 4830992895
-Ref: 4831992984
-Ref: S0297992984
-Ref: 4832993004
-Ref: 4833993033
-Ref: 4834993067
-Ref: 4835993140
-Ref: S0298993140
-Ref: 4836993160
-Ref: 4837993198
-Ref: 4838993232
-Ref: 4839993283
-Ref: S0299993283
-Ref: 4840993287
-Ref: 4841993333
-Ref: S0300993333
-Ref: 4842993337
-Ref: 4843993535
-Ref: 4844993623
-Ref: 4845993850
-Ref: 4846993920
-Ref: 4847994658
-Ref: 4848995567
-Ref: 4849997807
-Node: 12.71001692
-Ref: 48501001807
-Ref: 48511001807
-Ref: 48521002143
-Ref: S03011002143
-Ref: 48531002170
-Ref: 48541002213
-Ref: 48551002219
-Ref: 48561002266
-Ref: 48571002325
-Ref: S03021002325
-Ref: 48581002366
-Ref: 48591002397
-Ref: 48601002427
-Ref: 48611002517
-Ref: S03031002517
-Ref: 48621002531
-Ref: 48631002585
-Ref: 48641002766
-Ref: 48651005260
-Ref: 48661005656
-Node: 12.81008073
-Node: 131010576
-Node: 13.11011380
-Ref: 48671011532
-Ref: 48681012339
-Ref: 48691012339
-Ref: 48701012339
-Ref: 48711012814
-Ref: 48721013226
-Ref: S03041013226
-Ref: S03051013226
-Ref: 48731013230
-Ref: 48741013272
-Ref: 48751013319
-Ref: 48761013361
-Ref: 48771013389
-Ref: S03061013389
-Ref: 48781013393
-Ref: 48791013419
-Ref: 48801013431
-Ref: 48811013478
-Ref: 48821013602
-Ref: 48831015161
-Ref: 48841015161
-Ref: 48851015670
-Ref: 48861015908
-Ref: 48871015908
-Ref: 48881015908
-Ref: 48891016180
-Ref: 48901016181
-Ref: 48911016181
-Ref: 48921016181
-Ref: 48931016664
-Ref: 48941016665
-Ref: 48951016665
-Ref: 48961016665
-Ref: 48971018931
-Ref: 48981020692
-Ref: 48991020929
-Ref: 49001021054
-Ref: 49011021504
-Ref: 49021021737
-Ref: 49031021737
-Ref: 49041021738
-Ref: 49051021738
-Ref: 49061021738
-Ref: 49071021792
-Ref: 49081022144
-Ref: 49091022510
-Node: 13.1.11024956
-Ref: 49101025350
-Ref: 49111025422
-Ref: S03071025422
-Ref: 49121025440
-Ref: 49131025456
-Ref: 49141025494
-Ref: 49151025510
-Ref: 49161025552
-Ref: S03081025552
-Ref: 49171025564
-Ref: 49181025610
-Ref: S03091025610
-Ref: 49191025614
-Ref: 49201025622
-Ref: 49211025635
-Ref: 49221025810
-Ref: 49231026130
-Ref: 49241026341
-Ref: 49251026341
-Ref: 49261026536
-Ref: 49271029534
-Ref: 49281029703
-Ref: 49291029743
-Ref: 49301030283
-Ref: 49311031499
-Ref: 49321031841
-Ref: 49331031904
-Ref: 49341031904
-Ref: 49351032091
-Ref: 49361032276
-Ref: 49371033033
-Node: 13.21034566
-Ref: 49381035452
-Ref: 49391035453
-Ref: 49401035453
-Ref: 49411035969
-Node: 13.31037069
-Ref: 49421037238
-Ref: 49431037238
-Ref: 49441037387
-Ref: 49451037541
-Ref: S03101037541
-Ref: 49461037561
-Ref: 49471037572
-Ref: 49481037597
-Ref: 49491037624
-Ref: 49501037635
-Ref: 49511037660
-Ref: 49521037897
-Ref: 49531038065
-Ref: 49541038455
-Ref: 49551038455
-Ref: 49561038657
-Ref: 49571038699
-Ref: 49581039064
-Ref: 49591039117
-Ref: 49601039117
-Ref: 49611039117
-Ref: 49621039117
-Ref: 49631039117
-Ref: 49641039117
-Ref: 49651039117
-Ref: 49661039117
-Ref: 49671039117
-Ref: 49681039117
-Ref: 49691039117
-Ref: 49701039117
-Ref: 49711039117
-Ref: 49721039117
-Ref: 49731039117
-Ref: 49741039268
-Ref: 49751039268
-Ref: 49761039338
-Ref: 49771039559
-Ref: 49781040206
-Ref: 49791040221
-Ref: 49801040787
-Ref: 49811040802
-Ref: 49821040923
-Ref: 49831040923
-Ref: 49841040978
-Ref: 49851041329
-Ref: 49861042501
-Ref: 49871042516
-Ref: 49881043002
-Ref: 49891043017
-Ref: 49901043345
-Ref: 49911043360
-Ref: 49921043700
-Ref: 49931043715
-Ref: 49941043938
-Ref: 49951043938
-Ref: 49961043991
-Ref: 49971044093
-Ref: 49981044386
-Ref: 49991045629
-Ref: 50001046780
-Ref: 50011046795
-Ref: 50021046954
-Ref: 50031046969
-Ref: 50041047155
-Ref: 50051047155
-Ref: 50061047278
-Ref: 50071047601
-Ref: 50081047616
-Ref: 50091048222
-Ref: 50101048223
-Ref: 50111048658
-Ref: 50121048658
-Ref: 50131049307
-Ref: 50141051141
-Ref: 50151051156
-Ref: 50161052329
-Ref: 50171052329
-Ref: 50181052736
-Ref: 50191052736
-Ref: 50201052736
-Ref: 50211053072
-Ref: 50221053087
-Ref: 50231053221
-Ref: 50241053236
-Ref: 50251053461
-Ref: 50261053461
-Ref: 50271053515
-Ref: 50281054296
-Ref: 50291054311
-Ref: 50301055130
-Ref: 50311055145
-Ref: 50321056245
-Ref: 50331056260
-Ref: 50341056260
-Ref: 50351056260
-Ref: 50361056566
-Ref: 50371056566
-Node: 13.41059836
-Ref: 50381060163
-Ref: S03111060163
-Ref: 50391060195
-Ref: 50401060210
-Ref: 50411060262
-Ref: S03121060262
-Ref: 50421060266
-Ref: 50431060335
-Ref: 50441061096
-Ref: 50451061179
-Ref: 50461061321
-Ref: 50471061321
-Ref: 50481061598
-Node: 13.51062580
-Ref: 50491062691
-Ref: 50501062691
-Ref: 50511062691
-Ref: 50521062691
-Ref: 50531062691
-Ref: 50541062691
-Ref: 50551062691
-Ref: 50561062691
-Ref: 50571062691
-Node: 13.5.11063058
-Ref: 50581063387
-Ref: 50591063466
-Ref: S03131063466
-Ref: 50601063498
-Ref: 50611063532
-Ref: 50621063558
-Ref: 50631063623
-Ref: S03141063623
-Ref: 50641063647
-Ref: 50651063661
-Ref: 50661063676
-Ref: 50671063689
-Ref: 50681063715
-Ref: S03151063715
-Ref: 50691063727
-Ref: 50701063755
-Ref: S03161063755
-Ref: 50711063767
-Ref: 50721063801
-Ref: S03171063801
-Ref: 50731063813
-Ref: 50741063883
-Ref: 50751063883
-Ref: 50761063883
-Ref: 50771063883
-Ref: 50781068031
-Node: 13.5.21071587
-Ref: 50791071778
-Ref: 50801071892
-Ref: 50811071907
-Ref: 50821072310
-Ref: 50831072325
-Ref: 50841072928
-Ref: 50851072943
-Ref: 50861073509
-Ref: 50871073509
-Node: 13.5.31073941
-Ref: 50881074182
-Ref: 50891074269
-Ref: 50901074270
-Ref: 50911074270
-Ref: 50921074503
-Ref: 50931074504
-Ref: 50941074504
-Ref: 50951074716
-Ref: 50961074731
-Ref: 50971074846
-Ref: 50981074847
-Ref: 50991075029
-Ref: 51001075029
-Ref: 51011075259
-Ref: 51021075429
-Node: 13.61075874
-Ref: 51031076009
-Ref: 51041076009
-Node: 13.71077483
-Ref: 51051077861
-Ref: 51061077929
-Ref: 51071077986
-Ref: 51081078098
-Ref: 51091078162
-Ref: 51101078228
-Ref: 51111078296
-Ref: 51121078367
-Ref: 51131078429
-Ref: 51141078500
-Ref: 51151078568
-Ref: 51161078640
-Ref: 51171078762
-Ref: 51181078805
-Ref: 51191078850
-Ref: 51201078909
-Ref: 51211078983
-Ref: 51221079051
-Ref: 51231079743
-Ref: 51241079757
-Ref: 51251079775
-Ref: 51261079801
-Ref: 51271079947
-Ref: 51281080017
-Ref: 51291080128
-Ref: 51301080237
-Ref: 51311083220
-Node: 13.7.11083974
-Ref: 51321084232
-Ref: 51331084327
-Ref: 51341084394
-Ref: 51351084472
-Ref: 51361084583
-Ref: 51371084743
-Ref: 51381085433
-Ref: 51391085493
-Ref: 51401085602
-Ref: 51411085897
-Ref: 51421085898
-Ref: 51431086633
-Node: 13.7.21086697
-Ref: 51441086987
-Ref: 51451087230
-Ref: 51461087338
-Ref: 51471087735
-Node: 13.81088030
-Ref: 51481088161
-Ref: 51491088346
-Ref: S03181088346
-Ref: 51501088350
-Ref: 51511089047
-Ref: 51521089400
-Ref: 51531089400
-Node: 13.91090904
-Ref: 51541091042
-Ref: 51551091042
-Ref: 51561091042
-Ref: 51571091042
-Ref: 51581091042
-Ref: 51591091377
-Ref: 51601092299
-Ref: 51611092299
-Ref: 51621093655
-Ref: 51631093854
-Ref: 51641093854
-Node: 13.9.11094298
-Ref: 51651094756
-Ref: 51661094961
-Ref: 51671094961
-Ref: 51681095259
-Ref: 51691096250
-Ref: 51701096496
-Ref: 51711096689
-Ref: 51721096689
-Ref: 51731096948
-Ref: 51741096949
-Ref: 51751097744
-Ref: 51761098412
-Node: 13.9.21099171
-Ref: 51771099616
-Ref: 51781099631
-Ref: 51791099854
-Node: 13.101101457
-Ref: 51801101926
-Ref: 51811101941
-Ref: 51821102233
-Node: 13.111102718
-Ref: 51831102844
-Ref: 51841102844
-Ref: 51851102844
-Ref: 51861102844
-Ref: 51871103761
-Ref: 51881103869
-Ref: 51891104053
-Ref: 51901104315
-Ref: 51911104577
-Ref: 51921104777
-Ref: 51931104777
-Ref: 51941104850
-Ref: 51951104850
-Ref: 51961104850
-Ref: 51971105050
-Ref: 51981105065
-Ref: 51991105197
-Ref: 52001105212
-Ref: 52011105476
-Ref: 52021105476
-Ref: 52031105476
-Ref: 52041105476
-Ref: 52051105676
-Ref: 52061105676
-Ref: 52071105676
-Ref: 52081105676
-Ref: 52091105979
-Ref: 52101106165
-Ref: 52111106166
-Ref: 52121106166
-Ref: 52131106660
-Ref: 52141107241
-Ref: 52151107475
-Ref: 52161109800
-Ref: 52171109800
-Ref: 52181109801
-Node: 13.11.11115844
-Ref: 52191116264
-Ref: 52201116279
-Ref: 52211116597
-Ref: 52221116612
-Node: 13.11.21117155
-Ref: 52231117318
-Ref: 52241117318
-Ref: 52251117318
-Ref: 52261117318
-Ref: 52271117318
-Ref: 52281117703
-Ref: 52291118143
-Ref: 52301119299
-Ref: 52311119299
-Ref: 52321119299
-Ref: 52331119299
-Ref: 52341119537
-Ref: 52351119683
-Ref: 52361119683
-Ref: 52371119772
-Ref: 52381119772
-Ref: 52391120171
-Ref: 52401120171
-Ref: 52411120360
-Ref: 52421120503
-Ref: 52431120504
-Ref: 52441120684
-Ref: 52451120684
-Node: 13.11.31121683
-Ref: 52461122136
-Ref: 52471122137
-Ref: 52481122159
-Ref: 52491122218
-Ref: S03191122218
-Ref: 52501122236
-Ref: 52511123173
-Ref: 52521123173
-Ref: 52531123173
-Ref: 52541124056
-Ref: 52551124056
-Node: 13.11.41126095
-Ref: 52561126624
-Ref: 52571126728
-Ref: 52581126837
-Ref: 52591126904
-Ref: 52601127022
-Ref: 52611127239
-Ref: 52621127379
-Ref: 52631127537
-Ref: 52641127949
-Ref: 52651128179
-Ref: 52661128353
-Ref: 52671128639
-Ref: 52681128933
-Ref: 52691129203
-Ref: 52701129203
-Ref: 52711129203
-Ref: 52721129203
-Ref: 52731129203
-Ref: 52741129978
-Ref: 52751131213
-Ref: 52761131213
-Ref: 52771131658
-Ref: 52781132268
-Ref: 52791132268
-Ref: 52801132379
-Ref: 52811132379
-Ref: 52821132441
-Ref: 52831132845
-Ref: 52841132845
-Ref: 52851132845
-Ref: 52861132978
-Node: 13.11.51135131
-Ref: 52871135504
-Ref: 52881135995
-Ref: 52891136069
-Node: 13.11.61136343
-Node: 13.121142718
-Ref: 52901143275
-Ref: 52911143276
-Ref: 52921143289
-Ref: 52931143302
-Ref: 52941143339
-Ref: S03201143339
-Ref: 52951143356
-Ref: 52961143400
-Ref: 52971143414
-Ref: 52981143493
-Ref: S03211143493
-Ref: 52991143497
-Ref: 53001143505
-Ref: 53011143568
-Ref: 53021143932
-Ref: 53031143932
-Ref: 53041146404
-Ref: 53051146405
-Ref: 53061146422
-Ref: 53071146444
-Ref: 53081146949
-Ref: 53091146949
-Node: 13.12.11147828
-Ref: 53101148169
-Ref: 53111148169
-Ref: 53121148456
-Ref: 53131148456
-Ref: 53141148685
-Ref: 53151148685
-Ref: 53161151109
-Ref: 53171151109
-Ref: 53181151352
-Ref: 53191151352
-Ref: 53201151680
-Ref: 53211151680
-Ref: 53221152174
-Ref: 53231152174
-Ref: 53241152294
-Ref: 53251152294
-Ref: 53261152463
-Ref: 53271152463
-Ref: 53281152618
-Ref: 53291152618
-Ref: 53301153863
-Node: 13.131154286
-Ref: 53311154390
-Ref: 53321154390
-Node: 13.13.11154820
-Ref: 53331155666
-Ref: 53341155723
-Ref: 53351155744
-Ref: 53361155880
-Ref: 53371155940
-Ref: 53381156012
-Ref: 53391156122
-Ref: 53401156246
-Ref: 53411156425
-Node: 13.13.21157603
-Ref: 53421157891
-Ref: 53431157891
-Ref: 53441158062
-Ref: 53451158077
-Ref: 53461158779
-Ref: 53471158779
-Ref: 53481159153
-Ref: 53491159769
-Ref: 53501159784
-Ref: 53511160097
-Ref: 53521160112
-Ref: 53531163174
-Ref: 53541163189
-Ref: 53551163629
-Ref: 53561163644
-Ref: 53571164233
-Ref: 53581164248
-Ref: 53591164622
-Ref: 53601164637
-Ref: 53611166593
-Ref: 53621166608
-Ref: 53631167361
-Ref: 53641167376
-Ref: 53651168210
-Ref: 53661168210
-Ref: 53671168457
-Ref: 53681169210
-Ref: 53691169460
-Ref: 53701169638
-Ref: 53711169638
-Ref: 53721169638
-Ref: 53731169638
-Ref: 53741169638
-Ref: 53751169638
-Ref: 53761169638
-Ref: 53771169638
-Ref: 53781170181
-Ref: 53791170182
-Ref: 53801170182
-Ref: 53811170182
-Ref: 53821170182
-Ref: 53831170182
-Ref: 53841170182
-Ref: 53851170182
-Ref: 53861170182
-Ref: 53871170182
-Ref: 53881170182
-Ref: 53891170182
-Ref: 53901170182
-Ref: 53911170182
-Ref: 53921170182
-Ref: 53931170182
-Ref: 53941170751
-Ref: 53951172173
-Ref: 53961173162
-Ref: 53971173162
-Ref: 53981174019
-Node: 13.141176905
-Ref: 53991177381
-Ref: 54001177381
-Ref: 54011177702
-Ref: 54021178030
-Ref: 54031178234
-Ref: 54041178519
-Ref: 54051178658
-Ref: 54061178809
-Ref: 54071179566
-Ref: 54081179673
-Ref: 54091180251
-Ref: 54101180347
-Ref: 54111180756
-Ref: 54121180944
-Ref: 54131181191
-Ref: 54141181493
-Ref: 54151181493
-Ref: 54161181849
-Ref: 54171181849
-Ref: 54181182251
-Ref: 54191182471
-Ref: 54201182614
-Ref: 54211182740
-Ref: 54221182886
-Ref: 54231182977
-Ref: 54241183183
-Ref: 54251183394
-Ref: 54261183453
-Ref: 54271183454
-Ref: 54281183697
-Ref: 54291183698
-Ref: 54301184792
-Node: Annex A1184794
-Ref: 54311184952
-Ref: 54321184952
-Ref: 54331195612
-Node: A.11197520
-Ref: 54341197755
-Ref: 54351197962
-Ref: 54361198212
-Ref: 54371198284
-Ref: 54381199395
-Ref: 54391199456
-Ref: 54401199517
-Ref: 54411201383
-Ref: 54421204002
-Ref: 54431207693
-Ref: 54441208000
-Ref: 54451208135
-Ref: 54461208191
-Ref: 54471208254
-Ref: 54481209139
-Ref: 54491209326
-Ref: 54501209538
-Ref: 54511209784
-Ref: 54521209821
-Ref: 54531209858
-Ref: 54541209895
-Ref: 54551210652
-Node: A.21212788
-Ref: 54561213007
-Node: A.31213324
-Node: A.3.11214258
-Ref: 54571214578
-Ref: 54581214743
-Ref: 54591214928
-Node: A.3.21215487
-Ref: 54601215839
-Ref: 54611215936
-Ref: 54621216011
-Ref: 54631216086
-Ref: 54641216161
-Ref: 54651216236
-Ref: 54661216311
-Ref: 54671216386
-Ref: 54681216461
-Ref: 54691216579
-Ref: 54701216654
-Ref: 54711216729
-Ref: 54721216804
-Ref: 54731216879
-Ref: 54741216954
-Ref: 54751217029
-Ref: 54761217108
-Ref: 54771217242
-Ref: 54781217307
-Ref: 54791217372
-Ref: 54801217440
-Ref: 54811217499
-Ref: 54821217558
-Ref: 54831217694
-Ref: 54841217790
-Ref: 54851217855
-Ref: 54861217924
-Ref: 54871218068
-Ref: 54881218791
-Ref: 54891218982
-Ref: 54901219175
-Ref: 54911219426
-Ref: 54921219652
-Ref: 54931219895
-Ref: 54941220154
-Ref: 54951220345
-Ref: 54961220579
-Ref: 54971220773
-Node: A.3.31224746
-Ref: 54981225137
-Ref: 54991225199
-Ref: 55001225212
-Ref: 55011225284
-Ref: 55021225356
-Ref: 55031225428
-Ref: 55041225500
-Ref: 55051225572
-Ref: 55061225644
-Ref: 55071225716
-Ref: 55081225788
-Ref: 55091225860
-Ref: 55101225932
-Ref: 55111226005
-Ref: 55121226078
-Ref: 55131226151
-Ref: 55141226224
-Ref: 55151226297
-Ref: 55161226373
-Ref: 55171226446
-Ref: 55181226519
-Ref: 55191226592
-Ref: 55201226665
-Ref: 55211226738
-Ref: 55221226811
-Ref: 55231226884
-Ref: 55241226957
-Ref: 55251227030
-Ref: 55261227103
-Ref: 55271227176
-Ref: 55281227249
-Ref: 55291227322
-Ref: 55301227395
-Ref: 55311227468
-Ref: 55321227583
-Ref: 55331227664
-Ref: 55341227745
-Ref: 55351227826
-Ref: 55361227907
-Ref: 55371227988
-Ref: 55381228069
-Ref: 55391228150
-Ref: 55401228231
-Ref: 55411228312
-Ref: 55421228393
-Ref: 55431228474
-Ref: 55441228555
-Ref: 55451228636
-Ref: 55461228717
-Ref: 55471228775
-Ref: 55481228856
-Ref: 55491229017
-Ref: 55501229098
-Ref: 55511229179
-Ref: 55521229260
-Ref: 55531229341
-Ref: 55541229422
-Ref: 55551229503
-Ref: 55561229659
-Ref: 55571229740
-Ref: 55581229821
-Ref: 55591229902
-Ref: 55601229983
-Ref: 55611230068
-Ref: 55621230149
-Ref: 55631230230
-Ref: 55641230311
-Ref: 55651230392
-Ref: 55661230474
-Ref: 55671230556
-Ref: 55681230638
-Ref: 55691230720
-Ref: 55701230802
-Ref: 55711230884
-Ref: 55721230966
-Ref: 55731231048
-Ref: 55741231130
-Ref: 55751231212
-Ref: 55761231294
-Ref: 55771231380
-Ref: 55781231462
-Ref: 55791231544
-Ref: 55801231626
-Ref: 55811231708
-Ref: 55821231790
-Ref: 55831231872
-Ref: 55841231954
-Ref: 55851232036
-Ref: 55861232118
-Ref: 55871232200
-Ref: 55881232282
-Ref: 55891232364
-Ref: 55901232446
-Ref: 55911232528
-Ref: 55921232610
-Ref: 55931232715
-Ref: 55941232729
-Ref: 55951232783
-Ref: 55961232837
-Ref: 55971232891
-Ref: 55981232949
-Ref: 55991233023
-Ref: 56001233097
-Ref: 56011233171
-Ref: 56021233245
-Ref: 56031233319
-Ref: 56041233393
-Ref: 56051233467
-Ref: 56061233541
-Ref: 56071233615
-Ref: 56081233689
-Ref: 56091233763
-Ref: 56101233837
-Ref: 56111233911
-Ref: 56121233985
-Ref: 56131234059
-Ref: 56141234137
-Ref: 56151234211
-Ref: 56161234285
-Ref: 56171234359
-Ref: 56181234433
-Ref: 56191234507
-Ref: 56201234581
-Ref: 56211234655
-Ref: 56221234733
-Ref: 56231234807
-Ref: 56241234881
-Ref: 56251234955
-Ref: 56261235029
-Ref: 56271235103
-Ref: 56281235177
-Ref: 56291235251
-Ref: 56301235427
-Ref: 56311235513
-Ref: 56321235585
-Ref: 56331235671
-Ref: 56341235757
-Ref: 56351235843
-Ref: 56361235929
-Ref: 56371236015
-Ref: 56381236101
-Ref: 56391236187
-Ref: 56401236273
-Ref: 56411236359
-Ref: 56421236445
-Ref: 56431236531
-Ref: 56441236617
-Ref: 56451236697
-Ref: 56461236783
-Ref: 56471236931
-Ref: 56481237017
-Ref: 56491237086
-Ref: 56501237172
-Ref: 56511237258
-Ref: 56521237344
-Ref: 56531237430
-Ref: 56541237516
-Ref: 56551237602
-Ref: 56561237672
-Ref: 56571237758
-Ref: 56581237844
-Ref: 56591237930
-Ref: 56601238016
-Ref: 56611238102
-Ref: 56621238188
-Ref: 56631238274
-Ref: 56641238360
-Ref: 56651238508
-Ref: 56661238594
-Ref: 56671238680
-Ref: 56681238766
-Ref: 56691238852
-Ref: 56701238938
-Ref: 56711239024
-Ref: 56721239110
-Ref: 56731239196
-Ref: 56741239282
-Ref: 56751239368
-Ref: 56761239454
-Ref: 56771239540
-Ref: 56781239626
-Ref: 56791239712
-Ref: 56801239798
-Ref: 56811239946
-Ref: 56821240032
-Ref: 56831240118
-Ref: 56841240204
-Ref: 56851240290
-Ref: 56861240376
-Ref: 56871240462
-Ref: 56881240548
-Ref: 56891240634
-Ref: 56901240720
-Ref: 56911240806
-Ref: 56921240892
-Ref: 56931240978
-Ref: 56941241064
-Ref: 56951241150
-Ref: 56961241236
-Ref: 56971241384
-Ref: 56981241470
-Ref: 56991241556
-Ref: 57001241642
-Ref: 57011241728
-Ref: 57021241814
-Ref: 57031241900
-Ref: 57041241986
-Ref: 57051242072
-Ref: 57061242158
-Ref: 57071242244
-Ref: 57081242330
-Ref: 57091242416
-Ref: 57101242502
-Ref: 57111242588
-Ref: 57121242674
-Ref: 57131242822
-Ref: 57141242908
-Ref: 57151242994
-Ref: 57161243080
-Ref: 57171243166
-Ref: 57181243252
-Ref: 57191243338
-Ref: 57201243424
-Ref: 57211243510
-Ref: 57221243596
-Ref: 57231243682
-Ref: 57241243768
-Ref: 57251243854
-Ref: 57261243940
-Ref: 57271244026
-Ref: 57281244112
-Node: A.3.41244444
-Ref: 57291244772
-Ref: 57301244829
-Ref: 57311244907
-Ref: 57321244985
-Ref: 57331245063
-Ref: 57341245141
-Ref: 57351245235
-Ref: 57361245331
-Ref: 57371245411
-Ref: 57381245488
-Ref: 57391245589
-Ref: 57401245684
-Ref: 57411245790
-Ref: 57421245895
-Ref: 57431246051
-Ref: 57441246202
-Ref: 57451246364
-Ref: 57461246520
-Ref: 57471246702
-Node: A.3.51251051
-Ref: 57481251519
-Ref: 57491251573
-Ref: 57501251632
-Ref: 57511251705
-Ref: 57521251777
-Ref: 57531251848
-Ref: 57541251919
-Ref: 57551251991
-Ref: 57561252099
-Ref: 57571252183
-Ref: 57581252262
-Ref: 57591252336
-Ref: 57601252418
-Ref: 57611252489
-Ref: 57621252568
-Ref: 57631252656
-Ref: 57641252728
-Ref: 57651252802
-Ref: 57661252875
-Ref: 57671252954
-Ref: 57681253021
-Node: A.3.61259280
-Ref: 57691259482
-Node: A.41259684
-Node: A.4.11260757
-Ref: 57701261065
-Ref: 57711261136
-Ref: 57721261189
-Ref: 57731261242
-Ref: 57741261308
-Ref: 57751261322
-Ref: 57761261337
-Ref: 57771261350
-Ref: 57781261397
-Ref: 57791261447
-Ref: 57801261496
-Ref: 57811261542
-Ref: 57821261590
-Node: A.4.21261648
-Ref: 57831262043
-Ref: 57841262178
-Ref: 57851262275
-Ref: 57861262326
-Ref: 57871262510
-Ref: 57881262596
-Ref: 57891262678
-Ref: 57901262760
-Ref: 57911263315
-Ref: 57921263446
-Ref: 57931263806
-Ref: 57941263857
-Ref: 57951263942
-Ref: 57961264023
-Ref: 57971264171
-Ref: 57981264286
-Ref: 57991264414
-Ref: 58001264474
-Ref: 58011264578
-Ref: 58021264672
-Ref: 58031264766
-Ref: 58041268352
-Ref: 58051268469
-Ref: 58061270072
-Node: A.4.31270617
-Ref: 58071271928
-Ref: 58081272089
-Ref: 58091272394
-Ref: 58101272702
-Ref: 58111272998
-Ref: 58121273297
-Ref: 58131273555
-Ref: 58141273853
-Ref: 58151274105
-Ref: 58161274314
-Ref: 58171274467
-Ref: 58181274707
-Ref: 58191274901
-Ref: 58201275041
-Ref: 58211275369
-Ref: 58221275687
-Ref: 58231275832
-Ref: 58241275956
-Ref: 58251276110
-Ref: 58261276289
-Ref: 58271276539
-Ref: 58281276973
-Ref: 58291277147
-Ref: 58301277362
-Ref: 58311277545
-Ref: 58321277772
-Ref: 58331277944
-Ref: 58341278249
-Ref: 58351278368
-Ref: 58361278581
-Ref: 58371278765
-Ref: 58381279053
-Ref: 58391279226
-Ref: 58401279438
-Ref: 58411279611
-Ref: 58421296810
-Node: A.4.41296938
-Ref: 58431297875
-Ref: 58441298054
-Ref: 58451298094
-Ref: 58461298152
-Ref: 58471298193
-Ref: 58481298262
-Ref: 58491298332
-Ref: 58501298479
-Ref: 58511298651
-Ref: 58521298734
-Ref: 58531298916
-Ref: 58541299085
-Ref: 58551299288
-Ref: 58561299491
-Ref: 58571299697
-Ref: 58581299904
-Ref: 58591300096
-Ref: 58601300280
-Ref: 58611301015
-Ref: 58621301160
-Ref: 58631301355
-Ref: 58641301544
-Ref: 58651301744
-Ref: 58661303433
-Ref: 58671303768
-Ref: 58681304091
-Ref: 58691304414
-Ref: 58701304695
-Ref: 58711305019
-Ref: 58721305294
-Ref: 58731305523
-Ref: 58741305693
-Ref: 58751305955
-Ref: 58761306169
-Ref: 58771306326
-Ref: 58781306680
-Ref: 58791307024
-Ref: 58801307194
-Ref: 58811307332
-Ref: 58821307511
-Ref: 58831307707
-Ref: 58841308058
-Ref: 58851308380
-Ref: 58861308645
-Ref: 58871308880
-Ref: 58881309161
-Ref: 58891309412
-Ref: 58901309612
-Ref: 58911309823
-Ref: 58921309963
-Ref: 58931310075
-Ref: 58941310287
-Ref: 58951310468
-Ref: 58961310729
-Ref: 58971310960
-Ref: 58981311221
-Ref: 58991311898
-Ref: 59001312106
-Ref: 59011312311
-Node: A.4.51318519
-Ref: 59021319351
-Ref: 59031319447
-Ref: 59041319550
-Ref: 59051319621
-Ref: 59061319691
-Ref: 59071319745
-Ref: 59081319860
-Ref: 59091319958
-Ref: 59101320057
-Ref: 59111320139
-Ref: 59121320263
-Ref: 59131320388
-Ref: 59141320503
-Ref: 59151321159
-Ref: 59161321297
-Ref: 59171321485
-Ref: 59181321664
-Ref: 59191321855
-Ref: 59201323489
-Ref: 59211323808
-Ref: 59221324115
-Ref: 59231324424
-Ref: 59241324692
-Ref: 59251325001
-Ref: 59261325252
-Ref: 59271325471
-Ref: 59281325634
-Ref: 59291325883
-Ref: 59301326087
-Ref: 59311326237
-Ref: 59321326575
-Ref: 59331326903
-Ref: 59341327068
-Ref: 59351327202
-Ref: 59361327376
-Ref: 59371327565
-Ref: 59381327835
-Ref: 59391328076
-Ref: 59401328270
-Ref: 59411328434
-Ref: 59421328640
-Ref: 59431328816
-Ref: 59441329008
-Ref: 59451329170
-Ref: 59461329309
-Ref: 59471329417
-Ref: 59481329621
-Ref: 59491329795
-Ref: 59501329988
-Ref: 59511330151
-Ref: 59521330344
-Ref: 59531331014
-Node: A.4.61334734
-Ref: 59541335215
-Ref: 59551335301
-Ref: 59561335357
-Ref: 59571335413
-Ref: 59581335469
-Ref: 59591335525
-Ref: 59601335581
-Ref: 59611335637
-Ref: 59621335693
-Ref: 59631335749
-Ref: 59641335805
-Ref: 59651335861
-Ref: 59661335920
-Ref: 59671336038
-Ref: 59681336156
-Node: A.4.71336753
-Ref: 59691337740
-Ref: 59701337741
-Ref: 59711337741
-Ref: 59721337741
-Ref: 59731337741
-Ref: 59741337741
-Ref: 59751337741
-Ref: 59761337741
-Ref: 59771337741
-Ref: 59781337741
-Ref: 59791337741
-Ref: 59801337741
-Ref: 59811337741
-Ref: 59821337741
-Ref: 59831337741
-Ref: 59841337741
-Ref: 59851337855
-Ref: 59861338013
-Ref: 59871338120
-Ref: 59881338176
-Ref: 59891338382
-Ref: 59901338489
-Ref: 59911338593
-Ref: 59921338697
-Ref: 59931339376
-Ref: 59941339517
-Ref: 59951339902
-Ref: 59961339963
-Ref: 59971340070
-Ref: 59981340168
-Ref: 59991340347
-Ref: 60001340472
-Ref: 60011340615
-Ref: 60021340680
-Ref: 60031340794
-Ref: 60041340902
-Ref: 60051341006
-Ref: 60061343086
-Ref: 60071343696
-Node: A.4.81343839
-Ref: 60081344976
-Ref: 60091344977
-Ref: 60101344977
-Ref: 60111344977
-Ref: 60121344977
-Ref: 60131344977
-Ref: 60141344977
-Ref: 60151344977
-Ref: 60161344977
-Ref: 60171344977
-Ref: 60181344977
-Ref: 60191344977
-Ref: 60201344977
-Ref: 60211344977
-Ref: 60221344977
-Ref: 60231344977
-Ref: 60241345150
-Ref: 60251345281
-Ref: 60261345400
-Ref: 60271345463
-Ref: 60281345693
-Ref: 60291345815
-Ref: 60301345931
-Ref: 60311346045
-Ref: 60321346805
-Ref: 60331346961
-Ref: 60341347381
-Ref: 60351347454
-Ref: 60361347575
-Ref: 60371347688
-Ref: 60381347900
-Ref: 60391348037
-Ref: 60401348200
-Ref: 60411348272
-Ref: 60421348401
-Ref: 60431348524
-Ref: 60441348642
-Ref: 60451348893
-Ref: 60461350928
-Ref: 60471351117
-Ref: 60481351794
-Node: A.4.91351947
-Ref: 60491352285
-Ref: 60501352876
-Ref: 60511353378
-Ref: 60521353718
-Ref: 60531354371
-Ref: 60541354755
-Ref: 60551355184
-Node: A.4.101355638
-Ref: 60561355974
-Ref: 60571356649
-Ref: 60581357025
-Ref: 60591357446
-Ref: 60601357850
-Ref: 60611358240
-Ref: 60621358615
-Ref: 60631359033
-Node: A.4.111359271
-Ref: 60641359789
-Ref: 60651359947
-Ref: 60661360016
-Ref: 60671360059
-Ref: 60681360104
-Ref: 60691360152
-Ref: 60701360193
-Ref: 60711360377
-Ref: 60721360514
-Ref: 60731360651
-Ref: 60741360773
-Ref: 60751360950
-Ref: 60761361117
-Ref: 60771361374
-Ref: 60781361591
-Ref: 60791361751
-Ref: 60801361957
-Ref: 60811362142
-Ref: 60821362320
-Ref: 60831362512
-Ref: 60841362642
-Ref: 60851362789
-Ref: 60861362919
-Ref: 60871362986
-Ref: 60881363091
-Ref: 60891363284
-Ref: 60901363481
-Ref: 60911363616
-Ref: 60921363768
-Ref: 60931363903
-Ref: 60941363975
-Ref: 60951364090
-Ref: 60961364298
-Ref: 60971364500
-Ref: 60981364640
-Ref: 60991364797
-Ref: 61001364937
-Ref: 61011365014
-Ref: 61021365476
-Ref: 61031365476
-Ref: 61041365476
-Ref: 61051365476
-Node: A.51375236
-Ref: 61061375924
-Ref: 61071375964
-Ref: 61081376000
-Ref: 61091376133
-Node: A.5.11376797
-Ref: 61101377431
-Ref: 61111377566
-Ref: 61121377647
-Ref: 61131377728
-Ref: 61141377809
-Ref: 61151377974
-Ref: 61161378055
-Ref: 61171378136
-Ref: 61181378217
-Ref: 61191378298
-Ref: 61201378379
-Ref: 61211378460
-Ref: 61221378541
-Ref: 61231378625
-Ref: 61241378706
-Ref: 61251378787
-Ref: 61261378868
-Ref: 61271378949
-Ref: 61281379151
-Ref: 61291379353
-Ref: 61301379555
-Ref: 61311379760
-Ref: 61321379841
-Ref: 61331379922
-Ref: 61341380003
-Ref: 61351380084
-Ref: 61361380165
-Ref: 61371380246
-Ref: 61381380327
-Ref: 61391380451
-Ref: 61401384703
-Ref: 61411384703
-Ref: 61421384703
-Ref: 61431385499
-Ref: 61441385747
-Ref: 61451386305
-Node: A.5.21388630
-Ref: 61461389055
-Ref: 61471390147
-Ref: 61481390195
-Ref: 61491390244
-Ref: 61501390310
-Ref: 61511390386
-Ref: 61521390487
-Ref: 61531390573
-Ref: 61541390613
-Ref: 61551390716
-Ref: 61561390813
-Ref: 61571390902
-Ref: 61581390963
-Ref: 61591391149
-Ref: 61601391261
-Ref: 61611391411
-Ref: 61621391462
-Ref: 61631391532
-Ref: 61641391633
-Ref: 61651391719
-Ref: 61661391759
-Ref: 61671391862
-Ref: 61681391959
-Ref: 61691392048
-Ref: 61701392109
-Ref: 61711392298
-Ref: 61721392609
-Ref: 61731394282
-Ref: 61741394518
-Ref: 61751395577
-Ref: 61761395577
-Ref: 61771395577
-Ref: 61781395869
-Ref: 61791395870
-Node: A.5.31403670
-Ref: 61801403875
-Ref: 61811404003
-Ref: 61821404018
-Ref: 61831404176
-Ref: 61841404708
-Ref: 61851404723
-Ref: 61861405121
-Ref: 61871405136
-Ref: 61881405521
-Ref: 61891405536
-Ref: 61901405914
-Ref: 61911405929
-Ref: 61921406445
-Ref: 61931406543
-Ref: 61941406626
-Ref: 61951406627
-Ref: 61961406904
-Ref: 61971406919
-Ref: 61981407232
-Ref: 61991407247
-Ref: 62001407598
-Ref: 62011407613
-Ref: 62021408057
-Ref: 62031408363
-Ref: 62041408480
-Ref: 62051408495
-Ref: 62061408757
-Ref: 62071408772
-Ref: 62081409162
-Ref: 62091409177
-Ref: 62101409418
-Ref: 62111409788
-Ref: 62121409789
-Ref: 62131409976
-Ref: 62141409991
-Ref: 62151410227
-Ref: 62161410527
-Ref: 62171410528
-Ref: 62181410706
-Ref: 62191410721
-Ref: 62201411162
-Ref: 62211411177
-Ref: 62221411672
-Ref: 62231411687
-Ref: 62241412124
-Ref: 62251412139
-Ref: 62261412606
-Ref: 62271412621
-Ref: 62281413264
-Ref: 62291413282
-Ref: 62301413297
-Ref: 62311413679
-Ref: 62321413694
-Ref: 62331413865
-Ref: 62341414182
-Ref: 62351414183
-Ref: 62361414331
-Ref: 62371414346
-Ref: 62381414521
-Ref: 62391414732
-Ref: 62401414733
-Ref: 62411415014
-Ref: 62421415029
-Ref: 62431415207
-Ref: 62441415416
-Ref: 62451415417
-Ref: 62461415630
-Ref: 62471415645
-Ref: 62481416295
-Ref: 62491416310
-Ref: 62501416310
-Ref: 62511416492
-Ref: 62521416507
-Ref: 62531416671
-Ref: 62541416922
-Ref: 62551416923
-Ref: 62561417191
-Ref: 62571417310
-Ref: 62581417325
-Ref: 62591417916
-Ref: 62601417931
-Ref: 62611418350
-Ref: 62621418365
-Ref: 62631418526
-Ref: 62641418541
-Ref: 62651418678
-Ref: 62661418693
-Ref: 62671419127
-Ref: 62681419142
-Ref: 62691419578
-Ref: 62701419593
-Node: A.5.41420014
-Ref: 62711420199
-Ref: 62721420324
-Ref: 62731420339
-Ref: 62741420514
-Ref: 62751420529
-Ref: 62761420841
-Ref: 62771420856
-Node: A.61421189
-Ref: 62781421300
-Ref: 62791421300
-Node: A.71421991
-Ref: 62801422184
-Ref: 62811422184
-Ref: 62821422184
-Ref: 62831422760
-Ref: 62841424481
-Ref: 62851424482
-Ref: 62861424482
-Ref: 62871424545
-Ref: 62881425809
-Ref: 62891425810
-Node: A.81426602
-Ref: 62901426789
-Ref: 62911426789
-Ref: 62921426789
-Ref: 62931427218
-Ref: 62941427637
-Ref: 62951427637
-Ref: 62961427637
-Ref: 62971428193
-Node: A.8.11428692
-Ref: 62981429074
-Ref: 62991429091
-Ref: 63001429137
-Ref: 63011429235
-Ref: 63021429445
-Ref: 63031429637
-Ref: 63041429688
-Ref: 63051429739
-Ref: 63061429811
-Ref: 63071429864
-Ref: 63081429928
-Ref: 63091429989
-Ref: 63101430054
-Ref: 63111430125
-Ref: 63121430219
-Ref: 63131430291
-Ref: 63141430365
-Ref: 63151430452
-Ref: 63161430521
-Ref: 63171430588
-Ref: 63181430655
-Ref: 63191430721
-Ref: 63201430790
-Ref: 63211430856
-Ref: 63221431048
-Node: A.8.21431109
-Node: A.8.31439214
-Node: A.8.41440986
-Ref: 63231441362
-Ref: 63241441379
-Ref: 63251441425
-Ref: 63261441484
-Ref: 63271441548
-Ref: 63281441646
-Ref: 63291441858
-Ref: 63301442050
-Ref: 63311442101
-Ref: 63321442152
-Ref: 63331442224
-Ref: 63341442277
-Ref: 63351442341
-Ref: 63361442402
-Ref: 63371442467
-Ref: 63381442538
-Ref: 63391442632
-Ref: 63401442774
-Ref: 63411442849
-Ref: 63421442991
-Ref: 63431443065
-Ref: 63441443142
-Ref: 63451443209
-Ref: 63461443271
-Ref: 63471443358
-Ref: 63481443427
-Ref: 63491443494
-Ref: 63501443561
-Ref: 63511443627
-Ref: 63521443696
-Ref: 63531443762
-Ref: 63541443950
-Node: A.8.51444007
-Node: A.91447361
-Ref: 63551447954
-Ref: 63561448007
-Ref: 63571448122
-Ref: 63581448266
-Ref: 63591448345
-Ref: 63601448439
-Node: A.101449190
-Ref: 63611451416
-Ref: 63621451416
-Ref: 63631451807
-Ref: 63641452131
-Ref: 63651452131
-Ref: 63661452131
-Ref: 63671453425
-Ref: 63681453430
-Ref: 63691453430
-Ref: 63701453430
-Ref: 63711453430
-Ref: 63721454243
-Ref: 63731454243
-Node: A.10.11455688
-Ref: 63741455972
-Ref: 63751455989
-Ref: 63761456035
-Ref: 63771456098
-Ref: 63781456158
-Ref: 63791456213
-Ref: 63801456289
-Ref: 63811456363
-Ref: 63821456417
-Ref: 63831456506
-Ref: 63841456727
-Ref: 63851456924
-Ref: 63861456976
-Ref: 63871457028
-Ref: 63881457101
-Ref: 63891457157
-Ref: 63901457222
-Ref: 63911457284
-Ref: 63921457350
-Ref: 63931457474
-Ref: 63941457525
-Ref: 63951457576
-Ref: 63961457630
-Ref: 63971457681
-Ref: 63981457732
-Ref: 63991457787
-Ref: 64001457838
-Ref: 64011457889
-Ref: 64021457940
-Ref: 64031458003
-Ref: 64041458056
-Ref: 64051458109
-Ref: 64061458166
-Ref: 64071458219
-Ref: 64081458272
-Ref: 64091458354
-Ref: 64101458401
-Ref: 64111458484
-Ref: 64121458555
-Ref: 64131458611
-Ref: 64141458682
-Ref: 64151458738
-Ref: 64161458803
-Ref: 64171458851
-Ref: 64181458916
-Ref: 64191459010
-Ref: 64201459129
-Ref: 64211459198
-Ref: 64221459317
-Ref: 64231459386
-Ref: 64241459453
-Ref: 64251459503
-Ref: 64261459555
-Ref: 64271459587
-Ref: 64281459639
-Ref: 64291459672
-Ref: 64301459739
-Ref: 64311459789
-Ref: 64321459856
-Ref: 64331459906
-Ref: 64341459979
-Ref: 64351460037
-Ref: 64361460110
-Ref: 64371460167
-Ref: 64381460233
-Ref: 64391460282
-Ref: 64401460348
-Ref: 64411460397
-Ref: 64421460463
-Ref: 64431460551
-Ref: 64441460618
-Ref: 64451460667
-Ref: 64461460733
-Ref: 64471460782
-Ref: 64481460958
-Ref: 64491461079
-Ref: 64501461198
-Ref: 64511461262
-Ref: 64521461438
-Ref: 64531461594
-Ref: 64541461658
-Ref: 64551461704
-Ref: 64561461767
-Ref: 64571461813
-Ref: 64581461956
-Ref: 64591462030
-Ref: 64601462093
-Ref: 64611462139
-Ref: 64621462207
-Ref: 64631462368
-Ref: 64641462397
-Ref: 64651462444
-Ref: 64661462504
-Ref: 64671462643
-Ref: 64681462739
-Ref: 64691462953
-Ref: 64701463120
-Ref: 64711463252
-Ref: 64721463475
-Ref: 64731463504
-Ref: 64741463551
-Ref: 64751463611
-Ref: 64761463750
-Ref: 64771463846
-Ref: 64781464060
-Ref: 64791464227
-Ref: 64801464359
-Ref: 64811464648
-Ref: 64821464675
-Ref: 64831464713
-Ref: 64841464762
-Ref: 64851464814
-Ref: 64861464954
-Ref: 64871465050
-Ref: 64881465309
-Ref: 64891465526
-Ref: 64901465657
-Ref: 64911465926
-Ref: 64921465953
-Ref: 64931465998
-Ref: 64941466042
-Ref: 64951466094
-Ref: 64961466234
-Ref: 64971466330
-Ref: 64981466589
-Ref: 64991466806
-Ref: 65001466938
-Ref: 65011467217
-Ref: 65021467246
-Ref: 65031467291
-Ref: 65041467335
-Ref: 65051467387
-Ref: 65061467527
-Ref: 65071467623
-Ref: 65081467882
-Ref: 65091468099
-Ref: 65101468231
-Ref: 65111468568
-Ref: 65121468601
-Ref: 65131468642
-Ref: 65141468709
-Ref: 65151468799
-Ref: 65161468846
-Ref: 65171469064
-Ref: 65181469239
-Ref: 65191469372
-Ref: 65201469566
-Ref: 65211469635
-Ref: 65221469702
-Ref: 65231469769
-Ref: 65241469835
-Ref: 65251469904
-Ref: 65261469970
-Ref: 65271470037
-Ref: 65281470221
-Node: A.10.21470242
-Node: A.10.31472664
-Ref: 65291475998
-Node: A.10.41476616
-Node: A.10.51479149
-Node: A.10.61489179
-Ref: 65301491265
-Node: A.10.71495285
-Ref: 65311497045
-Ref: 65321498399
-Ref: 65331500231
-Ref: 65341500944
-Node: A.10.81503009
-Ref: 65351507522
-Node: A.10.91508400
-Ref: 65361515106
-Node: A.10.101516752
-Node: A.10.111521333
-Ref: 65371521925
-Ref: 65381521949
-Ref: 65391522056
-Ref: 65401522130
-Ref: 65411522242
-Ref: 65421522320
-Ref: 65431522426
-Ref: 65441522501
-Ref: 65451522603
-Node: A.10.121524020
-Ref: 65461524478
-Ref: 65471524502
-Ref: 65481524621
-Ref: 65491524707
-Ref: 65501524831
-Ref: 65511524921
-Ref: 65521525039
-Ref: 65531525126
-Ref: 65541525240
-Node: A.111526873
-Ref: 65551527406
-Ref: 65561527689
-Ref: 65571527689
-Ref: 65581527963
-Ref: 65591528260
-Ref: 65601528261
-Ref: 65611528565
-Ref: 65621528565
-Ref: 65631529091
-Ref: 65641529091
-Node: A.121529637
-Node: A.12.11530139
-Ref: 65651530279
-Ref: 65661531239
-Ref: 65671531239
-Ref: 65681531345
-Ref: 65691531442
-Ref: 65701531513
-Ref: 65711531617
-Ref: 65721531684
-Ref: 65731531754
-Ref: 65741531874
-Ref: 65751532098
-Ref: 65761532291
-Ref: 65771532344
-Ref: 65781532397
-Ref: 65791532471
-Ref: 65801532527
-Ref: 65811532590
-Ref: 65821532650
-Ref: 65831532714
-Ref: 65841532782
-Ref: 65851532854
-Ref: 65861533090
-Ref: 65871533311
-Ref: 65881533572
-Ref: 65891533734
-Ref: 65901533934
-Ref: 65911534012
-Ref: 65921534080
-Ref: 65931534144
-Ref: 65941534225
-Ref: 65951534289
-Ref: 65961534359
-Ref: 65971534427
-Ref: 65981534495
-Ref: 65991534562
-Ref: 66001534632
-Ref: 66011534699
-Ref: 66021534897
-Ref: 66031538287
-Node: A.12.21538620
-Ref: 66041539018
-Ref: 66051539073
-Ref: 66061539153
-Node: A.12.31539777
-Ref: 66071540200
-Ref: 66081540260
-Ref: 66091540340
-Node: A.12.41540527
-Ref: 66101540966
-Ref: 66111541031
-Ref: 66121541113
-Node: A.131541307
-Ref: 66131541696
-Ref: 66141541744
-Ref: 66151541778
-Ref: 66161541812
-Ref: 66171541846
-Ref: 66181541880
-Ref: 66191541914
-Ref: 66201541948
-Ref: 66211541982
-Ref: 66221545484
-Ref: 66231545815
-Ref: 66241545816
-Node: A.141545818
-Ref: 66251545979
-Node: A.151546681
-Ref: 66261547121
-Ref: 66271547183
-Ref: 66281547233
-Ref: 66291547299
-Ref: 66301547342
-Ref: 66311547404
-Ref: 66321547443
-Ref: 66331547495
-Ref: 66341548296
-Node: A.161550160
-Ref: 66351550602
-Ref: 66361550672
-Ref: 66371550728
-Ref: 66381550790
-Ref: 66391550928
-Ref: 66401550993
-Ref: 66411551122
-Ref: 66421551183
-Ref: 66431551239
-Ref: 66441551304
-Ref: 66451551519
-Ref: 66461551586
-Ref: 66471551655
-Ref: 66481551733
-Ref: 66491551800
-Ref: 66501551867
-Ref: 66511552078
-Ref: 66521552194
-Ref: 66531552322
-Ref: 66541552396
-Ref: 66551552467
-Ref: 66561552532
-Ref: 66571552597
-Ref: 66581552662
-Ref: 66591552782
-Ref: 66601552842
-Ref: 66611552906
-Ref: 66621552962
-Ref: 66631553223
-Ref: 66641553288
-Ref: 66651553367
-Ref: 66661553835
-Ref: 66671553941
-Ref: 66681554045
-Ref: 66691554147
-Ref: 66701554249
-Ref: 66711554363
-Ref: 66721554436
-Ref: 66731554507
-Ref: 66741554577
-Ref: 66751555099
-Ref: 66761555100
-Ref: 66771555100
-Ref: 66781555307
-Ref: 66791555308
-Ref: 66801555970
-Ref: 66811555971
-Ref: 66821556160
-Ref: 66831556296
-Ref: 66841570655
-Ref: 66851577503
-Node: A.16.11579507
-Ref: 66861580069
-Ref: 66871580092
-Ref: 66881580164
-Ref: 66891580244
-Ref: 66901580326
-Ref: 66911580409
-Ref: 66921580479
-Ref: 66931580554
-Ref: 66941580670
-Ref: 66951580804
-Ref: 66961580879
-Ref: 66971580950
-Node: A.171585538
-Ref: 66981585696
-Ref: 66991586174
-Ref: 67001586249
-Ref: 67011586313
-Ref: 67021586396
-Ref: 67031586461
-Ref: 67041586527
-Ref: 67051586571
-Ref: 67061586601
-Ref: 67071589695
-Ref: 67081590071
-Node: A.181591726
-Ref: 67091592339
-Ref: 67101592339
-Ref: 67111592793
-Ref: 67121592794
-Ref: 67131593181
-Ref: 67141593816
-Node: A.18.11596794
-Ref: 67151597134
-Ref: 67161597186
-Ref: 67171597245
-Ref: 67181597309
-Node: A.18.21597742
-Ref: 67191598311
-Ref: 67201598311
-Ref: 67211598318
-Ref: 67221598318
-Ref: 67231598841
-Ref: 67241599318
-Ref: 67251599416
-Ref: 67261599589
-Ref: 67271599667
-Ref: 67281599965
-Ref: 67291600051
-Ref: 67301600097
-Ref: 67311600152
-Ref: 67321600224
-Ref: 67331600406
-Ref: 67341600476
-Ref: 67351600937
-Ref: 67361601010
-Ref: 67371601146
-Ref: 67381601217
-Ref: 67391601341
-Ref: 67401601411
-Ref: 67411601469
-Ref: 67421601594
-Ref: 67431601670
-Ref: 67441601804
-Ref: 67451601877
-Ref: 67461602080
-Ref: 67471602279
-Ref: 67481602468
-Ref: 67491602617
-Ref: 67501602846
-Ref: 67511603237
-Ref: 67521603378
-Ref: 67531603561
-Ref: 67541603721
-Ref: 67551603900
-Ref: 67561604057
-Ref: 67571604135
-Ref: 67581604236
-Ref: 67591604339
-Ref: 67601604513
-Ref: 67611604679
-Ref: 67621604898
-Ref: 67631605140
-Ref: 67641605374
-Ref: 67651605661
-Ref: 67661605844
-Ref: 67671606072
-Ref: 67681606187
-Ref: 67691606371
-Ref: 67701606484
-Ref: 67711606665
-Ref: 67721606866
-Ref: 67731607118
-Ref: 67741607301
-Ref: 67751607476
-Ref: 67761607610
-Ref: 67771607742
-Ref: 67781607812
-Ref: 67791607925
-Ref: 67801608033
-Ref: 67811608108
-Ref: 67821608173
-Ref: 67831608263
-Ref: 67841608341
-Ref: 67851608405
-Ref: 67861608494
-Ref: 67871608558
-Ref: 67881608614
-Ref: 67891608682
-Ref: 67901608742
-Ref: 67911608959
-Ref: 67921609140
-Ref: 67931609380
-Ref: 67941609585
-Ref: 67951609748
-Ref: 67961609888
-Ref: 67971610421
-Ref: 67981610466
-Ref: 67991610540
-Ref: 68001610601
-Ref: 68011611289
-Ref: 68021611377
-Ref: 68031613272
-Ref: 68041613685
-Ref: 68051614037
-Ref: 68061614037
-Ref: 68071624408
-Ref: 68081648630
-Ref: 68091650138
-Ref: 68101650525
-Ref: 68111651602
-Ref: 68121651602
-Ref: 68131652195
-Ref: 68141652815
-Ref: 68151652815
-Ref: 68161653432
-Ref: 68171653555
-Node: A.18.31655708
-Ref: 68181656128
-Ref: 68191656129
-Ref: 68201656135
-Ref: 68211656646
-Ref: 68221657017
-Ref: 68231657136
-Ref: 68241657430
-Ref: 68251657515
-Ref: 68261657556
-Ref: 68271657610
-Ref: 68281657681
-Ref: 68291657859
-Ref: 68301657927
-Ref: 68311657995
-Ref: 68321658051
-Ref: 68331658135
-Ref: 68341658332
-Ref: 68351658481
-Ref: 68361658870
-Ref: 68371659011
-Ref: 68381659188
-Ref: 68391659343
-Ref: 68401659417
-Ref: 68411659475
-Ref: 68421659574
-Ref: 68431659806
-Ref: 68441660091
-Ref: 68451660317
-Ref: 68461660499
-Ref: 68471660678
-Ref: 68481660851
-Ref: 68491660983
-Ref: 68501661113
-Ref: 68511661181
-Ref: 68521661288
-Ref: 68531661407
-Ref: 68541661566
-Ref: 68551661777
-Ref: 68561661937
-Ref: 68571662000
-Ref: 68581662088
-Ref: 68591662150
-Ref: 68601662237
-Ref: 68611662300
-Ref: 68621662368
-Ref: 68631662425
-Ref: 68641662485
-Ref: 68651662664
-Ref: 68661662867
-Ref: 68671663027
-Ref: 68681663165
-Ref: 68691663688
-Ref: 68701663733
-Ref: 68711663805
-Ref: 68721663864
-Ref: 68731664610
-Ref: 68741664692
-Ref: 68751666151
-Ref: 68761666766
-Ref: 68771667021
-Ref: 68781667021
-Ref: 68791671285
-Ref: 68801688912
-Ref: 68811690430
-Ref: 68821690725
-Ref: 68831691115
-Ref: 68841691647
-Ref: 68851691647
-Ref: 68861692380
-Ref: 68871692381
-Node: A.18.41694032
-Ref: 68881694532
-Ref: 68891694533
-Ref: 68901695303
-Ref: 68911695381
-Ref: 68921695406
-Ref: 68931695854
-Ref: 68941695860
-Ref: 68951695860
-Ref: 68961695860
-Ref: 68971696799
-Ref: 68981697291
-Ref: 68991697548
-Ref: 69001697548
-Ref: 69011703417
-Ref: 69021712615
-Ref: 69031713002
-Ref: 69041713515
-Ref: 69051713515
-Ref: 69061714098
-Ref: 69071714252
-Node: A.18.51715148
-Ref: 69081715866
-Ref: 69091715969
-Ref: 69101716261
-Ref: 69111716346
-Ref: 69121716385
-Ref: 69131716439
-Ref: 69141716510
-Ref: 69151716684
-Ref: 69161716753
-Ref: 69171716886
-Ref: 69181716953
-Ref: 69191717020
-Ref: 69201717075
-Ref: 69211717139
-Ref: 69221717212
-Ref: 69231717408
-Ref: 69241717629
-Ref: 69251718072
-Ref: 69261718213
-Ref: 69271718389
-Ref: 69281718542
-Ref: 69291718720
-Ref: 69301718876
-Ref: 69311718948
-Ref: 69321719032
-Ref: 69331719129
-Ref: 69341719407
-Ref: 69351719626
-Ref: 69361719797
-Ref: 69371719971
-Ref: 69381720145
-Ref: 69391720259
-Ref: 69401720371
-Ref: 69411720480
-Ref: 69421720553
-Ref: 69431720618
-Ref: 69441720675
-Ref: 69451720792
-Ref: 69461720921
-Ref: 69471721075
-Ref: 69481721164
-Ref: 69491721299
-Ref: 69501721435
-Ref: 69511722045
-Ref: 69521722052
-Ref: 69531722581
-Ref: 69541723085
-Ref: 69551723312
-Ref: 69561723319
-Ref: 69571723319
-Ref: 69581723319
-Ref: 69591723505
-Node: A.18.61727559
-Ref: 69601728191
-Ref: 69611728300
-Ref: 69621728375
-Ref: 69631728667
-Ref: 69641728752
-Ref: 69651728791
-Ref: 69661728845
-Ref: 69671728916
-Ref: 69681729090
-Ref: 69691729157
-Ref: 69701729224
-Ref: 69711729279
-Ref: 69721729343
-Ref: 69731729416
-Ref: 69741729612
-Ref: 69751729833
-Ref: 69761730276
-Ref: 69771730417
-Ref: 69781730593
-Ref: 69791730746
-Ref: 69801730924
-Ref: 69811731080
-Ref: 69821731152
-Ref: 69831731208
-Ref: 69841731305
-Ref: 69851731583
-Ref: 69861731802
-Ref: 69871731973
-Ref: 69881732147
-Ref: 69891732321
-Ref: 69901732435
-Ref: 69911732547
-Ref: 69921732657
-Ref: 69931732720
-Ref: 69941732781
-Ref: 69951732843
-Ref: 69961732919
-Ref: 69971732987
-Ref: 69981733048
-Ref: 69991733123
-Ref: 70001733190
-Ref: 70011733254
-Ref: 70021733310
-Ref: 70031733378
-Ref: 70041733438
-Ref: 70051733544
-Ref: 70061733662
-Ref: 70071733770
-Ref: 70081733882
-Ref: 70091734477
-Ref: 70101734614
-Ref: 70111735120
-Ref: 70121735780
-Ref: 70131735984
-Ref: 70141735991
-Ref: 70151735991
-Ref: 70161735991
-Ref: 70171735991
-Node: A.18.71742610
-Ref: 70181743093
-Ref: 70191743093
-Ref: 70201743864
-Ref: 70211743942
-Ref: 70221744254
-Ref: 70231744260
-Ref: 70241744260
-Ref: 70251744260
-Ref: 70261745229
-Ref: 70271745729
-Ref: 70281745845
-Ref: 70291745845
-Ref: 70301751037
-Ref: 70311760472
-Ref: 70321760679
-Ref: 70331762768
-Ref: 70341765140
-Ref: 70351765528
-Ref: 70361766041
-Ref: 70371766041
-Ref: 70381766641
-Ref: 70391766795
-Node: A.18.81767696
-Ref: 70401768396
-Ref: 70411768499
-Ref: 70421768743
-Ref: 70431768828
-Ref: 70441768867
-Ref: 70451768921
-Ref: 70461768992
-Ref: 70471769166
-Ref: 70481769240
-Ref: 70491769308
-Ref: 70501769378
-Ref: 70511769511
-Ref: 70521769578
-Ref: 70531769645
-Ref: 70541769700
-Ref: 70551769773
-Ref: 70561769969
-Ref: 70571770288
-Ref: 70581770465
-Ref: 70591770537
-Ref: 70601770621
-Ref: 70611770718
-Ref: 70621770941
-Ref: 70631771057
-Ref: 70641771175
-Ref: 70651771293
-Ref: 70661771411
-Ref: 70671771527
-Ref: 70681771637
-Ref: 70691771735
-Ref: 70701771871
-Ref: 70711771983
-Ref: 70721772134
-Ref: 70731772242
-Ref: 70741772387
-Ref: 70751772515
-Ref: 70761772691
-Ref: 70771772758
-Ref: 70781772864
-Ref: 70791772926
-Ref: 70801772990
-Ref: 70811773046
-Ref: 70821773156
-Ref: 70831773314
-Ref: 70841773406
-Ref: 70851773552
-Ref: 70861773699
-Ref: 70871774272
-Ref: 70881774314
-Ref: 70891774381
-Ref: 70901774519
-Ref: 70911774702
-Ref: 70921774822
-Ref: 70931774939
-Ref: 70941775065
-Ref: 70951775201
-Ref: 70961775450
-Ref: 70971775614
-Ref: 70981775806
-Ref: 70991775993
-Ref: 71001776310
-Ref: 71011776581
-Ref: 71021777120
-Ref: 71031777621
-Ref: 71041777805
-Ref: 71051778031
-Ref: 71061778038
-Ref: 71071778038
-Ref: 71081778038
-Ref: 71091778239
-Ref: 71101782523
-Ref: 71111782899
-Node: A.18.91783291
-Ref: 71121783894
-Ref: 71131784003
-Ref: 71141784086
-Ref: 71151784330
-Ref: 71161784415
-Ref: 71171784454
-Ref: 71181784508
-Ref: 71191784579
-Ref: 71201784753
-Ref: 71211784828
-Ref: 71221784896
-Ref: 71231784963
-Ref: 71241785030
-Ref: 71251785085
-Ref: 71261785158
-Ref: 71271785354
-Ref: 71281785673
-Ref: 71291785850
-Ref: 71301785922
-Ref: 71311785978
-Ref: 71321786075
-Ref: 71331786298
-Ref: 71341786414
-Ref: 71351786532
-Ref: 71361786650
-Ref: 71371786768
-Ref: 71381786884
-Ref: 71391786994
-Ref: 71401787057
-Ref: 71411787119
-Ref: 71421787217
-Ref: 71431787353
-Ref: 71441787465
-Ref: 71451787616
-Ref: 71461787724
-Ref: 71471787869
-Ref: 71481787997
-Ref: 71491788174
-Ref: 71501788241
-Ref: 71511788347
-Ref: 71521788409
-Ref: 71531788485
-Ref: 71541788546
-Ref: 71551788621
-Ref: 71561788685
-Ref: 71571788741
-Ref: 71581788809
-Ref: 71591788869
-Ref: 71601788990
-Ref: 71611789113
-Ref: 71621789240
-Ref: 71631789899
-Ref: 71641790036
-Ref: 71651790663
-Ref: 71661790706
-Ref: 71671790805
-Ref: 71681790873
-Ref: 71691791015
-Ref: 71701791201
-Ref: 71711791323
-Ref: 71721791442
-Ref: 71731791571
-Ref: 71741791702
-Ref: 71751791837
-Ref: 71761791961
-Ref: 71771792214
-Ref: 71781792378
-Ref: 71791792570
-Ref: 71801792757
-Ref: 71811793206
-Ref: 71821793751
-Ref: 71831793935
-Ref: 71841794144
-Ref: 71851794151
-Ref: 71861794151
-Ref: 71871794151
-Ref: 71881794151
-Ref: 71891800482
-Node: A.18.101801371
-Ref: 71901801868
-Ref: 71911801868
-Ref: 71921801881
-Ref: 71931802066
-Ref: 71941802485
-Ref: 71951802486
-Ref: 71961802486
-Ref: 71971802810
-Ref: 71981802954
-Ref: 71991803074
-Ref: 72001803337
-Ref: 72011803687
-Ref: 72021803796
-Ref: 72031804090
-Ref: 72041804176
-Ref: 72051804218
-Ref: 72061804271
-Ref: 72071804341
-Ref: 72081804454
-Ref: 72091804652
-Ref: 72101804719
-Ref: 72111804791
-Ref: 72121804872
-Ref: 72131804940
-Ref: 72141805007
-Ref: 72151805074
-Ref: 72161805137
-Ref: 72171805193
-Ref: 72181805266
-Ref: 72191805463
-Ref: 72201805612
-Ref: 72211805830
-Ref: 72221805997
-Ref: 72231806136
-Ref: 72241806311
-Ref: 72251806464
-Ref: 72261806536
-Ref: 72271806594
-Ref: 72281806693
-Ref: 72291806814
-Ref: 72301806941
-Ref: 72311807047
-Ref: 72321807169
-Ref: 72331807313
-Ref: 72341807453
-Ref: 72351807574
-Ref: 72361807712
-Ref: 72371807859
-Ref: 72381807979
-Ref: 72391808108
-Ref: 72401808180
-Ref: 72411808260
-Ref: 72421808575
-Ref: 72431808949
-Ref: 72441809258
-Ref: 72451809518
-Ref: 72461809774
-Ref: 72471809903
-Ref: 72481810140
-Ref: 72491810443
-Ref: 72501810688
-Ref: 72511811031
-Ref: 72521811307
-Ref: 72531811372
-Ref: 72541811440
-Ref: 72551811522
-Ref: 72561811589
-Ref: 72571811670
-Ref: 72581811741
-Ref: 72591811817
-Ref: 72601811882
-Ref: 72611811951
-Ref: 72621812096
-Ref: 72631812248
-Ref: 72641813019
-Ref: 72651813101
-Ref: 72661814613
-Ref: 72671815180
-Ref: 72681815433
-Ref: 72691815433
-Ref: 72701822390
-Ref: 72711853462
-Ref: 72721853850
-Ref: 72731854377
-Ref: 72741854377
-Ref: 72751854966
-Node: A.18.111856346
-Ref: 72761856959
-Node: A.18.121857888
-Ref: 72771858584
-Node: A.18.131859331
-Ref: 72781859935
-Node: A.18.141860721
-Ref: 72791861330
-Node: A.18.151862117
-Ref: 72801862706
-Node: A.18.161863192
-Ref: 72811863786
-Node: A.18.171864273
-Ref: 72821864883
-Node: A.18.181865723
-Ref: 72831866355
-Ref: 72841866683
-Ref: 72851866800
-Ref: 72861866893
-Ref: 72871867012
-Ref: 72881867086
-Ref: 72891867156
-Ref: 72901867214
-Ref: 72911867288
-Ref: 72921867425
-Ref: 72931867570
-Ref: 72941867719
-Ref: 72951867880
-Ref: 72961868016
-Ref: 72971868130
-Ref: 72981868231
-Ref: 72991868307
-Ref: 73001868369
-Ref: 73011869105
-Ref: 73021869649
-Ref: 73031870059
-Ref: 73041870059
-Ref: 73051873466
-Ref: 73061875922
-Ref: 73071876317
-Ref: 73081876988
-Node: A.18.191877646
-Ref: 73091879124
-Ref: 73101879655
-Node: A.18.201880746
-Ref: 73111882175
-Ref: 73121882980
-Ref: 73131883505
-Node: A.18.211884503
-Ref: 73141886018
-Ref: 73151886340
-Ref: 73161887147
-Ref: 73171887669
-Node: A.18.221888758
-Ref: 73181890147
-Ref: 73191890641
-Ref: 73201891163
-Node: A.18.231892255
-Ref: 73211893753
-Ref: 73221894075
-Ref: 73231894878
-Ref: 73241895400
-Node: A.18.241896384
-Ref: 73251897771
-Ref: 73261898261
-Ref: 73271898783
-Node: A.18.251899770
-Ref: 73281902095
-Ref: 73291902620
-Node: A.18.261903608
-Ref: 73301904394
-Ref: 73311905253
-Ref: 73321905662
-Ref: 73331906623
-Ref: 73341906942
-Ref: 73351908302
-Node: A.18.271909087
-Ref: 73361909782
-Ref: 73371909853
-Ref: 73381909909
-Ref: 73391910079
-Ref: 73401910248
-Ref: 73411910328
-Ref: 73421910671
-Node: A.18.281912021
-Ref: 73431912793
-Ref: 73441912997
-Ref: 73451913200
-Ref: 73461913294
-Ref: 73471913396
-Ref: 73481913469
-Node: A.18.291913836
-Ref: 73491914640
-Ref: 73501914842
-Ref: 73511915103
-Ref: 73521915197
-Ref: 73531915299
-Ref: 73541915372
-Node: A.18.301915955
-Ref: 73551916959
-Ref: 73561917159
-Ref: 73571917362
-Ref: 73581917456
-Ref: 73591917563
-Ref: 73601917790
-Ref: 73611917863
-Node: A.18.311919390
-Ref: 73621920426
-Ref: 73631920624
-Ref: 73641920883
-Ref: 73651920977
-Ref: 73661921084
-Ref: 73671921311
-Ref: 73681921384
-Node: A.18.321921969
-Node: A.191926745
-Ref: 73691926870
-Ref: 73701927167
-Ref: 73711927262
-Ref: 73721927412
-Ref: 73731927561
-Ref: 73741927621
-Ref: 73751927692
-Ref: 73761927740
-Ref: 73771927818
-Ref: 73781927818
-Node: Annex B1928571
-Ref: 73791928728
-Ref: 73801928728
-Ref: 73811928728
-Node: B.11929840
-Ref: 73821930087
-Ref: 73831930087
-Ref: 73841930093
-Ref: 73851930093
-Ref: 73861930360
-Ref: 73871930361
-Ref: 73881930932
-Ref: 73891930932
-Ref: 73901930932
-Ref: 73911930932
-Ref: 73921930932
-Ref: 73931930933
-Ref: 73941930933
-Ref: 73951930933
-Ref: 73961930933
-Ref: 73971930960
-Ref: 73981930960
-Ref: 73991931700
-Ref: 74001931701
-Ref: 74011931723
-Ref: 74021932046
-Ref: 74031932079
-Ref: 74041932177
-Ref: 74051932620
-Ref: 74061932688
-Ref: 74071933094
-Ref: 74081934439
-Ref: 74091934556
-Ref: 74101934556
-Ref: 74111936269
-Ref: 74121936465
-Ref: 74131937346
-Ref: 74141937346
-Ref: 74151937658
-Ref: 74161938503
-Ref: 74171938504
-Ref: 74181938504
-Ref: 74191938504
-Node: B.21940711
-Ref: 74201941259
-Ref: 74211941962
-Ref: 74221941962
-Ref: 74231941962
-Ref: 74241941962
-Ref: 74251941962
-Ref: 74261942462
-Ref: 74271942462
-Ref: 74281942471
-Ref: 74291942471
-Node: B.31944140
-Ref: 74301944279
-Ref: 74311944279
-Ref: 74321944997
-Ref: 74331945084
-Ref: 74341945156
-Ref: 74351945231
-Ref: 74361945305
-Ref: 74371945427
-Ref: 74381945479
-Ref: 74391945531
-Ref: 74401945586
-Ref: 74411945690
-Ref: 74421945749
-Ref: 74431945808
-Ref: 74441945871
-Ref: 74451945972
-Ref: 74461946027
-Ref: 74471946087
-Ref: 74481946172
-Ref: 74491946235
-Ref: 74501946298
-Ref: 74511946400
-Ref: 74521946463
-Ref: 74531946531
-Ref: 74541946594
-Ref: 74551946655
-Ref: 74561946804
-Ref: 74571946882
-Ref: 74581947023
-Ref: 74591947161
-Ref: 74601947375
-Ref: 74611947633
-Ref: 74621947699
-Ref: 74631947775
-Ref: 74641947842
-Ref: 74651947918
-Ref: 74661948058
-Ref: 74671948137
-Ref: 74681948284
-Ref: 74691948428
-Ref: 74701948648
-Ref: 74711948957
-Ref: 74721949026
-Ref: 74731949109
-Ref: 74741949175
-Ref: 74751949247
-Ref: 74761949395
-Ref: 74771949471
-Ref: 74781949619
-Ref: 74791949768
-Ref: 74801949994
-Ref: 74811950216
-Ref: 74821950286
-Ref: 74831950370
-Ref: 74841950441
-Ref: 74851950519
-Ref: 74861950669
-Ref: 74871950745
-Ref: 74881950899
-Ref: 74891951054
-Ref: 74901951285
-Ref: 74911951502
-Ref: 74921954635
-Ref: 74931955077
-Ref: 74941960580
-Ref: 74951960580
-Node: B.3.11965820
-Ref: 74961966559
-Ref: 74971966614
-Ref: 74981966676
-Ref: 74991966772
-Ref: 75001966848
-Ref: 75011966899
-Ref: 75021967060
-Ref: 75031967140
-Ref: 75041967209
-Ref: 75051967253
-Ref: 75061967305
-Ref: 75071967373
-Ref: 75081967472
-Ref: 75091967536
-Ref: 75101967631
-Ref: 75111967697
-Ref: 75121967902
-Ref: 75131968093
-Ref: 75141972558
-Ref: 75151972823
-Ref: 75161972935
-Ref: 75171972992
-Node: B.3.21973605
-Ref: 75181974885
-Ref: 75191974941
-Ref: 75201974992
-Ref: 75211975146
-Ref: 75221975263
-Ref: 75231975845
-Ref: 75241975937
-Ref: 75251976071
-Ref: 75261976243
-Ref: 75271976479
-Ref: 75281979518
-Ref: 75291979607
-Ref: 75301979751
-Ref: 75311979969
-Ref: 75321980122
-Ref: 75331980449
-Node: B.3.31982210
-Ref: 75341982331
-Ref: 75351983150
-Ref: 75361983150
-Ref: 75371983235
-Ref: 75381983235
-Ref: 75391983235
-Ref: 75401984187
-Ref: 75411986255
-Ref: 75421986525
-Node: B.41988171
-Ref: 75431988302
-Ref: 75441988302
-Ref: 75451989313
-Ref: 75461989432
-Ref: 75471989493
-Ref: 75481989558
-Ref: 75491989616
-Ref: 75501989673
-Ref: 75511989742
-Ref: 75521989822
-Ref: 75531989883
-Ref: 75541989985
-Ref: 75551990055
-Ref: 75561990146
-Ref: 75571990244
-Ref: 75581990348
-Ref: 75591990414
-Ref: 75601990485
-Ref: 75611990655
-Ref: 75621990810
-Ref: 75631990956
-Ref: 75641990995
-Ref: 75651991051
-Ref: 75661991107
-Ref: 75671991163
-Ref: 75681991219
-Ref: 75691991284
-Ref: 75701991322
-Ref: 75711991374
-Ref: 75721991426
-Ref: 75731991487
-Ref: 75741991525
-Ref: 75751991577
-Ref: 75761991707
-Ref: 75771991757
-Ref: 75781991839
-Ref: 75791991948
-Ref: 75801992069
-Ref: 75811992192
-Ref: 75821992268
-Ref: 75831992397
-Ref: 75841992606
-Ref: 75851992735
-Ref: 75861992810
-Ref: 75871992945
-Ref: 75881993163
-Ref: 75891993288
-Ref: 75901993359
-Ref: 75911993490
-Ref: 75921993706
-Ref: 75931993773
-Ref: 75941993844
-Ref: 75951993911
-Ref: 75961995672
-Node: B.52007215
-Ref: 75972007338
-Ref: 75982007338
-Ref: 75992008153
-Ref: 76002008200
-Ref: 76012008265
-Ref: 76022008329
-Ref: 76032008396
-Ref: 76042008439
-Ref: 76052008547
-Ref: 76062008622
-Ref: 76072008685
-Ref: 76082008749
-Ref: 76092008822
-Ref: 76102008897
-Ref: 76112009004
-Ref: 76122009076
-Ref: 76132009148
-Ref: 76142009221
-Ref: 76152009299
-Ref: 76162009480
-Node: Annex C2013266
-Ref: 76172013405
-Ref: 76182013405
-Ref: 76192013405
-Ref: 76202013405
-Ref: 76212013405
-Ref: 76222013405
-Node: C.12013888
-Ref: 76232014174
-Ref: 76242014661
-Ref: 76252014661
-Ref: 76262014661
-Ref: 76272014661
-Node: C.22017010
-Ref: 76282017324
-Node: C.32017452
-Ref: 76292017699
-Ref: 76302017751
-Ref: 76312017850
-Ref: 76322017954
-Ref: 76332018082
-Ref: 76342018179
-Ref: 76352018264
-Ref: 76362018404
-Ref: 76372018405
-Ref: 76382018681
-Ref: 76392018682
-Ref: 76402019302
-Node: C.3.12024850
-Ref: 76412025531
-Ref: 76422025531
-Ref: 76432025723
-Ref: 76442025723
-Ref: 76452026074
-Ref: 76462026556
-Ref: 76472026556
-Ref: 76482026881
-Ref: 76492026882
-Ref: 76502026947
-Ref: 76512027060
-Ref: 76522027060
-Ref: 76532027060
-Ref: 76542027415
-Ref: 76552027467
-Ref: 76562028267
-Ref: 76572028534
-Ref: 76582030318
-Node: C.3.22031597
-Ref: 76592031833
-Ref: 76602031912
-Ref: 76612031965
-Ref: 76622032087
-Ref: 76632032173
-Ref: 76642032259
-Ref: 76652032364
-Ref: 76662032496
-Ref: 76672032683
-Ref: 76682032761
-Ref: 76692032857
-Ref: 76702033071
-Ref: 76712034093
-Ref: 76722034868
-Ref: 76732035160
-Ref: 76742035480
-Node: C.42037422
-Ref: 76752037910
-Ref: 76762038289
-Node: C.52039952
-Ref: 76772040385
-Ref: 76782040385
-Ref: 76792040770
-Ref: 76802040770
-Ref: 76812040886
-Ref: 76822040887
-Ref: 76832040910
-Ref: 76842041094
-Ref: 76852041095
-Ref: 76862041821
-Ref: 76872041821
-Node: C.62043113
-Ref: 76882043683
-Ref: 76892043683
-Ref: 76902043760
-Ref: 76912043760
-Ref: 76922043831
-Ref: 76932043831
-Ref: 76942044113
-Ref: 76952044113
-Ref: 76962044206
-Ref: 76972044206
-Ref: 76982044480
-Ref: 76992044480
-Ref: 77002044672
-Ref: 77012045005
-Ref: 77022045781
-Ref: 77032045781
-Ref: 77042046056
-Ref: 77052048706
-Ref: 77062048813
-Ref: 77072049224
-Node: C.72050240
-Node: C.7.12050779
-Ref: 77082051063
-Ref: 77092051127
-Ref: 77102051210
-Ref: 77112051328
-Ref: 77122051398
-Ref: 77132051449
-Ref: 77142051500
-Ref: 77152051564
-Ref: 77162051635
-Ref: 77172051706
-Ref: 77182053301
-Ref: 77192053316
-Ref: 77202053510
-Ref: 77212053525
-Ref: 77222053842
-Ref: 77232053969
-Ref: 77242053969
-Ref: 77252054094
-Ref: 77262054225
-Ref: 77272054371
-Node: C.7.22055200
-Ref: 77282055642
-Ref: 77292055659
-Ref: 77302055721
-Ref: 77312055804
-Ref: 77322055899
-Ref: 77332056008
-Ref: 77342057188
-Ref: 77352057303
-Ref: 77362057704
-Ref: 77372058189
-Ref: 77382058389
-Ref: 77392058589
-Node: C.7.32063537
-Ref: 77402063875
-Ref: 77412063941
-Ref: 77422064024
-Ref: 77432064256
-Ref: 77442064350
-Ref: 77452064431
-Ref: 77462064572
-Ref: 77472064754
-Ref: 77482064754
-Ref: 77492065851
-Ref: 77502065851
-Ref: 77512065851
-Ref: 77522065851
-Ref: 77532065851
-Ref: 77542065851
-Node: Annex D2068093
-Ref: 77552068228
-Ref: 77562068228
-Node: D.12071512
-Ref: 77572072257
-Ref: 77582072257
-Ref: 77592072393
-Ref: 77602072393
-Ref: 77612073916
-Ref: 77622073916
-Ref: 77632073916
-Ref: 77642073916
-Ref: 77652073916
-Ref: 77662074895
-Ref: 77672075301
-Ref: 77682075302
-Node: D.22077964
-Node: D.2.12078483
-Ref: 77692078865
-Ref: 77702078931
-Ref: 77712078952
-Ref: 77722079537
-Ref: 77732079537
-Ref: 77742079537
-Ref: 77752079537
-Ref: 77762079927
-Ref: 77772079927
-Ref: 77782079927
-Ref: 77792079927
-Ref: 77802079927
-Ref: 77812079927
-Ref: 77822080712
-Ref: 77832082180
-Node: D.2.22083876
-Ref: 77842084336
-Ref: 77852084337
-Ref: 77862084368
-Ref: 77872084479
-Ref: 77882084480
-Ref: 77892084529
-Ref: 77902084556
-Ref: 77912084582
-Ref: 77922086141
-Ref: 77932086141
-Ref: 77942086267
-Ref: 77952086268
-Ref: 77962086633
-Ref: 77972087047
-Node: D.2.32088433
-Ref: 77982088756
-Ref: 77992088756
-Ref: 78002089845
-Ref: 78012089845
-Ref: 78022090257
-Ref: 78032090585
-Node: D.2.42091675
-Ref: 78042092025
-Ref: 78052092025
-Ref: 78062092141
-Ref: 78072092203
-Ref: 78082092237
-Ref: 78092093843
-Ref: 78102093843
-Node: D.2.52095035
-Ref: 78112095416
-Ref: 78122095416
-Ref: 78132095568
-Ref: 78142095576
-Ref: 78152095689
-Ref: 78162095818
-Ref: 78172095950
-Ref: 78182096055
-Node: D.2.62099014
-Ref: 78192099794
-Ref: 78202099794
-Ref: 78212099955
-Ref: 78222099971
-Ref: 78232100010
-Ref: 78242100111
-Ref: 78252100278
-Ref: 78262100452
-Ref: 78272100923
-Ref: 78282100923
-Ref: 78292105305
-Ref: 78302105671
-Node: D.32106705
-Ref: 78312107151
-Ref: 78322107152
-Ref: 78332107174
-Ref: 78342107246
-Ref: 78352107317
-Ref: 78362107382
-Ref: 78372107382
-Ref: 78382107485
-Ref: 78392108291
-Ref: 78402108787
-Ref: 78412108788
-Ref: 78422108883
-Ref: 78432108883
-Ref: 78442108894
-Ref: 78452110269
-Ref: 78462110269
-Ref: 78472110269
-Ref: 78482110743
-Ref: 78492110895
-Ref: 78502111191
-Node: D.42113900
-Ref: 78512114031
-Ref: 78522114310
-Ref: 78532114311
-Ref: 78542114333
-Ref: 78552114405
-Ref: 78562114491
-Ref: 78572114556
-Ref: 78582114556
-Ref: 78592114657
-Ref: 78602115101
-Ref: 78612115101
-Ref: 78622115232
-Ref: 78632115232
-Ref: 78642115241
-Node: D.52117926
-Node: D.5.12118253
-Ref: 78652118706
-Ref: 78662118779
-Ref: 78672118993
-Ref: 78682119485
-Ref: 78692119540
-Ref: 78702119905
-Node: D.5.22122717
-Ref: 78712123130
-Ref: 78722123145
-Ref: 78732124202
-Node: D.62125143
-Node: D.72128222
-Ref: 78742128640
-Ref: 78752128640
-Ref: 78762128758
-Ref: 78772128758
-Ref: 78782129191
-Ref: 78792129191
-Ref: 78802129346
-Ref: 78812129346
-Ref: 78822129465
-Ref: 78832129465
-Ref: 78842129917
-Ref: 78852129921
-Ref: 78862129921
-Ref: 78872130398
-Ref: 78882130399
-Ref: 78892130406
-Ref: 78902130406
-Ref: 78912130693
-Ref: 78922130693
-Ref: 78932131265
-Ref: 78942131265
-Ref: 78952131369
-Ref: 78962131369
-Ref: 78972131465
-Ref: 78982131465
-Ref: 78992131948
-Ref: 79002131957
-Ref: 79012131957
-Ref: 79022132184
-Ref: 79032132184
-Ref: 79042132262
-Ref: 79052132262
-Ref: 79062132338
-Ref: 79072132338
-Ref: 79082132539
-Ref: 79092132539
-Ref: 79102133059
-Ref: 79112133059
-Ref: 79122133354
-Ref: 79132133354
-Ref: 79142133480
-Ref: 79152133480
-Ref: 79162134155
-Ref: 79172134156
-Ref: 79182134276
-Ref: 79192134276
-Ref: 79202134687
-Ref: 79212134687
-Ref: 79222134992
-Ref: 79232134993
-Ref: 79242134993
-Ref: 79252135066
-Ref: 79262135066
-Ref: 79272135574
-Ref: 79282135575
-Ref: 79292135575
-Ref: 79302135647
-Ref: 79312135647
-Ref: 79322136122
-Ref: 79332136123
-Ref: 79342136123
-Ref: 79352136197
-Ref: 79362136197
-Ref: 79372136475
-Ref: 79382136484
-Ref: 79392136484
-Ref: 79402137194
-Node: D.82137750
-Ref: 79412138070
-Ref: 79422138086
-Ref: 79432138110
-Ref: 79442138145
-Ref: 79452138179
-Ref: 79462138254
-Ref: 79472138283
-Ref: 79482138328
-Ref: 79492138372
-Ref: 79502138416
-Ref: 79512138463
-Ref: 79522138506
-Ref: 79532139870
-Ref: 79542139932
-Ref: 79552140000
-Ref: 79562140062
-Ref: 79572140124
-Ref: 79582140186
-Ref: 79592140248
-Ref: 79602140310
-Ref: 79612140378
-Ref: 79622140458
-Ref: 79632140605
-Ref: 79642141011
-Ref: 79652141011
-Ref: 79662142505
-Ref: 79672145027
-Ref: 79682146539
-Node: D.92148251
-Ref: 79692149249
-Ref: 79702149249
-Ref: 79712150826
-Ref: 79722150826
-Node: D.102152246
-Ref: 79732152733
-Ref: 79742152803
-Ref: 79752152858
-Ref: 79762152915
-Ref: 79772152972
-Ref: 79782153042
-Ref: 79792153354
-Ref: 79802153373
-Ref: 79812154143
-Ref: 79822154143
-Ref: 79832154143
-Node: D.10.12155246
-Ref: 79842155668
-Ref: 79852155741
-Ref: 79862155820
-Ref: 79872155919
-Node: D.112157556
-Ref: 79882158062
-Ref: 79892158135
-Ref: 79902158198
-Ref: 79912158264
-Ref: 79922158425
-Ref: 79932158425
-Ref: 79942158425
-Ref: 79952159392
-Ref: 79962159436
-Ref: 79972159547
-Node: D.122161760
-Node: D.132164585
-Ref: 79982164764
-Node: D.142167807
-Ref: 79992168230
-Ref: 80002168249
-Ref: 80012168278
-Ref: 80022168322
-Ref: 80032168366
-Ref: 80042168439
-Ref: 80052168492
-Ref: 80062169218
-Ref: 80072169319
-Ref: 80082169440
-Ref: 80092169528
-Ref: 80102169644
-Ref: 80112169781
-Ref: 80122169781
-Ref: 80132171267
-Ref: 80142172672
-Node: D.14.12174761
-Ref: 80152175207
-Ref: 80162175226
-Ref: 80172175379
-Ref: 80182175468
-Ref: 80192175577
-Ref: 80202175747
-Ref: 80212175915
-Ref: 80222175984
-Ref: 80232176111
-Ref: 80242176170
-Ref: 80252176718
-Ref: 80262176719
-Ref: 80272176891
-Ref: 80282178045
-Ref: 80292179547
-Node: D.14.22180474
-Ref: 80302180945
-Ref: 80312180963
-Ref: 80322181133
-Ref: 80332181241
-Ref: 80342181368
-Ref: 80352181477
-Ref: 80362181599
-Ref: 80372181725
-Ref: 80382181851
-Ref: 80392181949
-Ref: 80402182018
-Ref: 80412182092
-Ref: 80422182165
-Ref: 80432182236
-Ref: 80442182314
-Ref: 80452182440
-Ref: 80462182532
-Ref: 80472182653
-Ref: 80482182927
-Ref: 80492183384
-Ref: 80502183384
-Ref: 80512183384
-Ref: 80522183643
-Ref: 80532183644
-Ref: 80542187503
-Node: D.14.32188386
-Ref: 80552188829
-Ref: 80562188847
-Ref: 80572188942
-Node: D.152190129
-Ref: 80582190581
-Ref: 80592190599
-Ref: 80602190651
-Ref: 80612190767
-Ref: 80622190943
-Ref: 80632191123
-Ref: 80642191220
-Ref: 80652191349
-Ref: 80662191626
-Ref: 80672191840
-Ref: 80682191841
-Ref: 80692192026
-Node: D.162195198
-Ref: 80702195568
-Ref: 80712195633
-Ref: 80722195689
-Ref: 80732195751
-Ref: 80742195817
-Ref: 80752196344
-Ref: 80762196344
-Node: D.16.12197840
-Ref: 80772198348
-Ref: 80782198362
-Ref: 80792198418
-Ref: 80802198475
-Ref: 80812198554
-Ref: 80822198642
-Ref: 80832198720
-Ref: 80842198802
-Ref: 80852198869
-Ref: 80862198943
-Ref: 80872199024
-Ref: 80882199227
-Ref: 80892199496
-Ref: 80902199676
-Ref: 80912199855
-Ref: 80922200097
-Ref: 80932200962
-Ref: 80942200962
-Node: Annex E2206456
-Ref: 80952206815
-Ref: 80962206815
-Ref: 80972206815
-Ref: 80982207116
-Ref: 80992207257
-Node: E.12208554
-Ref: 81002208783
-Ref: 81012208783
-Ref: 81022209560
-Ref: 81032209702
-Ref: 81042209995
-Ref: 81052209995
-Ref: 81062209995
-Ref: 81072209995
-Ref: 81082210584
-Ref: 81092210599
-Ref: 81102210976
-Ref: 81112211107
-Node: E.22212817
-Ref: 81122213230
-Ref: 81132213230
-Ref: 81142213230
-Ref: 81152213230
-Ref: 81162213230
-Ref: 81172213230
-Ref: 81182213919
-Ref: 81192214053
-Ref: 81202214186
-Ref: 81212214294
-Node: E.2.12215844
-Ref: 81222216352
-Ref: 81232216357
-Ref: 81242216424
-Ref: 81252216425
-Ref: 81262216454
-Ref: 81272216512
-Ref: 81282216646
-Ref: 81292216646
-Ref: 81302217447
-Ref: 81312217447
-Ref: 81322217766
-Ref: 81332217968
-Ref: 81342217968
-Ref: 81352217968
-Node: E.2.22218266
-Ref: 81362218575
-Ref: 81372218580
-Ref: 81382218645
-Ref: 81392218646
-Ref: 81402218673
-Ref: 81412218731
-Ref: 81422218859
-Ref: 81432218859
-Ref: 81442219552
-Ref: 81452219688
-Ref: 81462219689
-Node: E.2.32223535
-Ref: 81472223879
-Ref: 81482223884
-Ref: 81492223958
-Ref: 81502223959
-Ref: 81512223995
-Ref: 81522224080
-Ref: 81532224081
-Ref: 81542224112
-Ref: 81552224123
-Ref: 81562224128
-Ref: 81572224230
-Ref: 81582224230
-Ref: 81592224230
-Ref: 81602224230
-Ref: 81612224230
-Ref: 81622224378
-Ref: 81632224378
-Ref: 81642225760
-Ref: 81652225761
-Ref: 81662226231
-Ref: 81672226231
-Ref: 81682226231
-Node: E.32227599
-Ref: 81692228025
-Ref: 81702228040
-Ref: 81712228236
-Ref: 81722228251
-Ref: 81732228465
-Ref: 81742228806
-Ref: 81752229193
-Ref: 81762229193
-Ref: 81772229605
-Node: E.42229772
-Ref: 81782229903
-Ref: 81792229903
-Ref: 81802229903
-Ref: 81812229903
-Ref: 81822229903
-Ref: 81832231404
-Ref: 81842231404
-Ref: 81852231404
-Ref: 81862232091
-Ref: 81872232091
-Ref: 81882232392
-Ref: 81892232832
-Ref: 81902233832
-Ref: 81912233832
-Ref: 81922233932
-Ref: 81932233932
-Ref: 81942234223
-Ref: 81952234380
-Ref: 81962234380
-Ref: 81972234733
-Node: E.4.12236228
-Ref: 81982236964
-Ref: 81992236964
-Ref: 82002237823
-Ref: 82012237823
-Node: E.4.22238439
-Node: E.52242419
-Ref: 82022242560
-Ref: 82032242560
-Ref: 82042242956
-Ref: 82052242973
-Ref: 82062243035
-Ref: 82072243084
-Ref: 82082243247
-Ref: 82092243435
-Ref: 82102243594
-Ref: 82112243797
-Ref: 82122243956
-Ref: 82132244115
-Ref: 82142245411
-Ref: 82152245786
-Ref: 82162246452
-Ref: 82172246452
-Node: Annex F2249145
-Ref: 82182249284
-Node: F.12251143
-Ref: 82192251344
-Ref: 82202251344
-Ref: 82212251626
-Ref: 82222251626
-Node: F.22251973
-Ref: 82232252231
-Ref: 82242252273
-Ref: 82252252329
-Ref: 82262252388
-Ref: 82272252440
-Ref: 82282252495
-Ref: 82292252807
-Node: F.32254486
-Ref: 82302254776
-Node: F.3.12259692
-Ref: 82312259819
-Ref: 82322259819
-Node: F.3.22266843
-Ref: 82332268084
-Node: F.3.32279057
-Ref: 82342279812
-Ref: 82352279829
-Ref: 82362279869
-Ref: 82372280004
-Ref: 82382280160
-Ref: 82392280227
-Ref: 82402280289
-Ref: 82412280358
-Ref: 82422280403
-Ref: 82432280460
-Ref: 82442280517
-Ref: 82452280574
-Ref: 82462281099
-Ref: 82472281137
-Ref: 82482281292
-Ref: 82492281491
-Ref: 82502281920
-Ref: 82512282367
-Ref: 82522282761
-Node: F.3.42289878
-Ref: 82532290079
-Ref: 82542290079
-Node: F.3.52290716
-Ref: 82552290915
-Ref: 82562290915
-Node: Annex G2291602
-Ref: 82572291719
-Node: G.12293294
-Node: G.1.12294233
-Ref: 82582294489
-Ref: 82592294633
-Ref: 82602294737
-Ref: 82612294826
-Ref: 82622294858
-Ref: 82632294902
-Ref: 82642294956
-Ref: 82652295010
-Ref: 82662295068
-Ref: 82672295165
-Ref: 82682295262
-Ref: 82692295363
-Ref: 82702295440
-Ref: 82712295517
-Ref: 82722295597
-Ref: 82732295739
-Ref: 82742295803
-Ref: 82752295915
-Ref: 82762296017
-Ref: 82772296245
-Ref: 82782296764
-Ref: 82792299506
-Ref: 82802303202
-Ref: 82812303202
-Ref: 82822303202
-Ref: 82832303544
-Ref: 82842303899
-Node: G.1.22309970
-Ref: 82852310331
-Ref: 82862310601
-Ref: 82872310655
-Ref: 82882310709
-Ref: 82892310763
-Ref: 82902311048
-Ref: 82912311099
-Ref: 82922311150
-Ref: 82932311201
-Ref: 82942311255
-Ref: 82952311309
-Ref: 82962311363
-Ref: 82972311417
-Ref: 82982311474
-Ref: 82992311526
-Ref: 83002311578
-Ref: 83012311630
-Ref: 83022311685
-Ref: 83032311740
-Ref: 83042311795
-Ref: 83052311850
-Ref: 83062311956
-Ref: 83072316459
-Ref: 83082316459
-Ref: 83092316459
-Ref: 83102317409
-Ref: 83112317793
-Ref: 83122320357
-Ref: 83132321159
-Node: G.1.32322037
-Ref: 83142322715
-Ref: 83152322893
-Ref: 83162322928
-Ref: 83172322977
-Ref: 83182323025
-Ref: 83192323163
-Ref: 83202323258
-Ref: 83212323511
-Ref: 83222323723
-Ref: 83232323853
-Ref: 83242324076
-Node: G.1.42330748
-Ref: 83252330955
-Ref: 83262330955
-Node: G.1.52331366
-Ref: 83272331571
-Ref: 83282331571
-Node: G.22332002
-Ref: 83292332203
-Ref: 83302332203
-Ref: 83312332683
-Node: G.2.12333276
-Ref: 83322334298
-Ref: 83332334586
-Ref: 83342334687
-Ref: 83352335066
-Ref: 83362335455
-Ref: 83372336414
-Ref: 83382336414
-Ref: 83392336693
-Node: G.2.22337657
-Ref: 83402338196
-Ref: 83412338196
-Ref: 83422338890
-Ref: 83432338890
-Ref: 83442339232
-Ref: 83452339232
-Ref: 83462340029
-Ref: 83472340029
-Ref: 83482340826
-Ref: 83492340828
-Ref: 83502340828
-Ref: 83512341164
-Ref: 83522341165
-Node: G.2.32342621
-Ref: 83532343985
-Ref: 83542344152
-Ref: 83552349700
-Ref: 83562349701
-Ref: 83572349852
-Node: G.2.42350071
-Ref: 83582350422
-Ref: 83592350422
-Ref: 83602350884
-Ref: 83612350885
-Ref: 83622351037
-Ref: 83632352050
-Node: G.2.52355741
-Node: G.2.62357508
-Ref: 83642358176
-Ref: 83652358641
-Ref: 83662358914
-Ref: 83672359299
-Ref: 83682359300
-Ref: 83692359547
-Node: G.32365045
-Node: G.3.12365803
-Ref: 83702366164
-Ref: 83712366247
-Ref: 83722366314
-Ref: 83732367457
-Ref: 83742367939
-Ref: 83752368890
-Ref: 83762368968
-Ref: 83772369032
-Ref: 83782369095
-Ref: 83792369234
-Ref: 83802369308
-Ref: 83812369534
-Ref: 83822369763
-Ref: 83832371224
-Ref: 83842373491
-Ref: 83852380875
-Node: G.3.22383499
-Ref: 83862384162
-Ref: 83872384248
-Ref: 83882384316
-Ref: 83892384582
-Ref: 83902384643
-Ref: 83912384710
-Ref: 83922384816
-Ref: 83932384926
-Ref: 83942385023
-Ref: 83952385126
-Ref: 83962385338
-Ref: 83972385409
-Ref: 83982385537
-Ref: 83992385641
-Ref: 84002386025
-Ref: 84012387939
-Ref: 84022388250
-Ref: 84032388311
-Ref: 84042388379
-Ref: 84052388485
-Ref: 84062388596
-Ref: 84072388693
-Ref: 84082388796
-Ref: 84092389014
-Ref: 84102389085
-Ref: 84112389213
-Ref: 84122389317
-Ref: 84132389699
-Ref: 84142389774
-Ref: 84152392665
-Ref: 84162392763
-Ref: 84172392833
-Ref: 84182392902
-Ref: 84192393037
-Ref: 84202393113
-Ref: 84212393345
-Ref: 84222393580
-Ref: 84232395338
-Ref: 84242402743
-Ref: 84252417735
-Node: Annex H2420948
-Ref: 84262421095
-Ref: 84272421095
-Ref: 84282421756
-Ref: 84292421885
-Ref: 84302421886
-Node: H.12422369
-Ref: 84312422736
-Ref: 84322422737
-Ref: 84332422808
-Ref: 84342422808
-Node: H.22424181
-Ref: 84352424399
-Node: H.32425198
-Node: H.3.12425500
-Ref: 84362425995
-Ref: 84372425996
-Ref: 84382426060
-Ref: 84392426060
-Node: H.3.22428855
-Ref: 84402429381
-Ref: 84412429382
-Ref: 84422429407
-Ref: 84432429422
-Ref: 84442429692
-Ref: 84452429827
-Node: H.42431553
-Ref: 84462432084
-Ref: 84472432084
-Ref: 84482432246
-Ref: 84492432246
-Ref: 84502432322
-Ref: 84512432322
-Ref: 84522432467
-Ref: 84532432467
-Ref: 84542432564
-Ref: 84552432564
-Ref: 84562432650
-Ref: 84572432650
-Ref: 84582433170
-Ref: 84592433171
-Ref: 84602433211
-Ref: 84612433211
-Ref: 84622433501
-Ref: 84632433501
-Ref: 84642433687
-Ref: 84652433687
-Ref: 84662434012
-Ref: 84672434013
-Ref: 84682434018
-Ref: 84692434018
-Ref: 84702434056
-Ref: 84712434057
-Ref: 84722434104
-Ref: 84732434104
-Ref: 84742434220
-Ref: 84752434220
-Ref: 84762434420
-Ref: 84772434420
-Ref: 84782434541
-Ref: 84792434541
-Ref: 84802434666
-Ref: 84812434666
-Ref: 84822436228
-Ref: 84832436413
-Node: H.52437061
-Ref: 84842437431
-Ref: 84852437432
-Ref: 84862437503
-Ref: 84872437503
-Node: H.62438173
-Ref: 84882438526
-Ref: 84892438527
-Ref: 84902438564
-Ref: 84912438748
-Ref: 84922438748
-Ref: 84932439150
-Node: Annex J2441358
-Ref: 84942441501
-Node: J.12442459
-Node: J.22443557
-Node: J.32444722
-Ref: 84952445237
-Ref: S03222445237
-Ref: 84962445255
-Ref: 84972445274
-Ref: 84982445352
-Ref: 84992445662
-Ref: 85002446864
-Ref: 85012447086
-Ref: 85022447325
-Node: J.42447425
-Ref: 85032447676
-Ref: 85042447676
-Node: J.52448206
-Node: J.62450810
-Node: J.72451101
-Ref: 85052451261
-Ref: S03232451261
-Ref: 85062451270
-Ref: 85072451289
-Node: J.7.12451520
-Ref: 85082452047
-Ref: 85092452049
-Ref: 85102452049
-Ref: 85112452451
-Ref: 85122452611
-Ref: 85132452886
-Ref: 85142453036
-Ref: 85152453705
-Node: J.82456240
-Ref: 85162456403
-Ref: S03242456403
-Ref: 85172456422
-Node: J.92456733
-Ref: 85182456982
-Ref: 85192456982
-Ref: 85202457193
-Node: J.102457497
-Ref: 85212457840
-Ref: 85222457841
-Ref: 85232457850
-Ref: 85242457869
-Node: J.112459134
-Ref: 85252459510
-Ref: 85262459510
-Node: J.122459801
-Node: J.132460147
-Ref: 85272460589
-Ref: 85282460736
-Ref: 85292460887
-Node: J.142461039
-Node: J.152462303
-Node: J.15.12463007
-Ref: 85302463264
-Ref: 85312463264
-Ref: 85322463284
-Ref: 85332463285
-Ref: 85342463293
-Ref: 85352463299
-Node: J.15.22464013
-Ref: 85362464294
-Ref: 85372464294
-Ref: 85382464314
-Ref: 85392464315
-Ref: 85402464336
-Ref: 85412464359
-Node: J.15.32464814
-Ref: 85422465080
-Ref: 85432465080
-Ref: 85442465100
-Ref: 85452465101
-Ref: 85462465121
-Node: J.15.42465447
-Ref: 85472465697
-Ref: 85482465698
-Ref: 85492465712
-Ref: 85502465948
-Node: J.15.52466184
-Ref: 85512466362
-Ref: 85522466367
-Ref: 85532466367
-Ref: 85542466367
-Ref: 85552466367
-Ref: 85562466367
-Ref: 85572466367
-Ref: 85582466367
-Ref: 85592466367
-Ref: 85602466367
-Ref: 85612466367
-Ref: 85622466367
-Ref: 85632466367
-Ref: 85642466526
-Ref: 85652466527
-Ref: 85662466572
-Ref: 85672466595
-Ref: 85682466657
-Ref: 85692466711
-Ref: 85702466743
-Ref: 85712466744
-Ref: 85722466789
-Ref: 85732466812
-Ref: 85742466874
-Ref: 85752466928
-Ref: 85762466960
-Ref: 85772466961
-Ref: 85782466999
-Ref: 85792467026
-Ref: 85802467278
-Ref: 85812467278
-Ref: 85822467622
-Node: J.15.62469204
-Ref: 85832469503
-Ref: 85842469503
-Ref: 85852469523
-Ref: 85862469524
-Ref: 85872469555
-Node: J.15.72469965
-Ref: 85882470270
-Ref: 85892470271
-Ref: 85902470298
-Ref: 85912470384
-Ref: 85922470385
-Ref: 85932470409
-Ref: 85942470414
-Ref: 85952470749
-Ref: 85962471123
-Node: J.15.82471778
-Ref: 85972472135
-Ref: 85982472136
-Ref: 85992472144
-Ref: 86002472175
-Ref: 86012472176
-Ref: 86022472186
-Ref: 86032472217
-Ref: 86042472218
-Ref: 86052472241
-Ref: 86062472272
-Ref: 86072472273
-Ref: 86082472298
-Ref: 86092472329
-Ref: 86102472330
-Ref: 86112472357
-Ref: 86122472388
-Ref: 86132472389
-Ref: 86142472413
-Ref: 86152473354
-Ref: 86162473355
-Ref: 86172473355
-Ref: 86182473355
-Ref: 86192473355
-Ref: 86202473355
-Ref: 86212473355
-Ref: 86222473355
-Ref: 86232473355
-Ref: 86242473355
-Ref: 86252473355
-Ref: 86262473355
-Node: J.15.92473527
-Ref: 86272473751
-Ref: 86282473752
-Ref: 86292473757
-Ref: 86302473913
-Node: J.15.102474620
-Ref: 86312474892
-Ref: 86322474893
-Ref: 86332475082
-Node: J.15.112475533
-Ref: 86342475824
-Ref: 86352475825
-Ref: 86362475931
-Ref: 86372475932
-Ref: 86382476112
-Ref: 86392476112
-Node: J.15.122477551
-Ref: 86402477821
-Ref: 86412477822
-Ref: 86422478002
-Node: J.15.132478637
-Ref: 86432478916
-Ref: 86442478916
-Ref: 86452478936
-Ref: 86462478937
-Ref: 86472478951
-Node: Annex K2479372
-Node: K.12479802
-Ref: 86482479925
-Node: K.22490474
-Ref: 86492490603
-Ref: 86502492216
-Ref: 86512492427
-Ref: 86522492428
-Ref: 86532496816
-Ref: 86542496831
-Ref: 86552498208
-Ref: 86562498578
-Ref: 86572498579
-Ref: 86582499384
-Ref: 86592499593
-Ref: 86602499594
-Ref: 86612502530
-Ref: 86622502545
-Ref: 86632502851
-Ref: 86642502851
-Ref: 86652513013
-Ref: 86662513028
-Ref: 86672513028
-Ref: 86682514212
-Ref: 86692514463
-Ref: 86702514464
-Ref: 86712518511
-Ref: 86722528107
-Ref: 86732528272
-Ref: 86742528273
-Ref: 86752528774
-Ref: 86762528775
-Ref: 86772531478
-Ref: 86782531795
-Ref: 86792531796
-Ref: 86802535064
-Ref: 86812535658
-Ref: 86822535958
-Ref: 86832535959
-Ref: 86842539985
-Ref: 86852540150
-Ref: 86862540151
-Ref: 86872540637
-Ref: 86882540638
-Ref: 86892543443
-Ref: 86902543458
-Ref: 86912543968
-Ref: 86922545124
-Ref: 86932546326
-Node: Annex L2549402
-Ref: 86942549551
-Ref: 86952549647
-Ref: 86962549648
-Ref: 86972549679
-Ref: 86982549722
-Ref: 86992549723
-Ref: 87002549749
-Ref: 87012549782
-Ref: 87022549833
-Ref: 87032549834
-Ref: 87042549858
-Ref: 87052549907
-Ref: 87062549908
-Ref: 87072549945
-Ref: 87082549967
-Ref: 87092549996
-Ref: 87102550018
-Ref: 87112550102
-Ref: 87122550103
-Ref: 87132550117
-Ref: 87142550201
-Ref: 87152550202
-Ref: 87162550210
-Ref: 87172550293
-Ref: 87182550294
-Ref: 87192550319
-Ref: 87202550402
-Ref: 87212550403
-Ref: 87222550427
-Ref: 87232550432
-Ref: 87242550550
-Ref: 87252550551
-Ref: 87262550589
-Ref: 87272550611
-Ref: 87282550661
-Ref: 87292550662
-Ref: 87302550667
-Ref: 87312550716
-Ref: 87322550717
-Ref: 87332550739
-Ref: 87342550801
-Ref: 87352550802
-Ref: 87362550848
-Ref: 87372550849
-Ref: 87382550872
-Ref: 87392550920
-Ref: 87402550921
-Ref: 87412550988
-Ref: 87422550989
-Ref: 87432551012
-Ref: 87442551032
-Ref: 87452551073
-Ref: 87462551074
-Ref: 87472551101
-Ref: 87482551121
-Ref: 87492551162
-Ref: 87502551163
-Ref: 87512551192
-Ref: 87522551272
-Ref: 87532551273
-Ref: 87542551313
-Ref: 87552551336
-Ref: 87562551393
-Ref: 87572551442
-Ref: 87582551528
-Ref: 87592551529
-Ref: 87602551569
-Ref: 87612551592
-Ref: 87622551649
-Ref: 87632551698
-Ref: 87642551749
-Ref: 87652551750
-Ref: 87662551773
-Ref: 87672551823
-Ref: 87682551824
-Ref: 87692551848
-Ref: 87702551933
-Ref: 87712551934
-Ref: 87722551942
-Ref: 87732551948
-Ref: 87742551990
-Ref: 87752551991
-Ref: 87762552016
-Ref: 87772552031
-Ref: 87782552111
-Ref: 87792552112
-Ref: 87802552139
-Ref: 87812552218
-Ref: 87822552219
-Ref: 87832552288
-Ref: 87842552289
-Ref: 87852552311
-Ref: 87862552354
-Ref: 87872552355
-Ref: 87882552360
-Ref: 87892552403
-Ref: 87902552404
-Ref: 87912552426
-Ref: 87922552510
-Ref: 87932552511
-Ref: 87942552532
-Ref: 87952552555
-Ref: 87962552602
-Ref: 87972552603
-Ref: 87982552652
-Ref: 87992552653
-Ref: 88002552662
-Ref: 88012552744
-Ref: 88022552745
-Ref: 88032552765
-Ref: 88042552811
-Ref: 88052552812
-Ref: 88062552852
-Ref: 88072552853
-Ref: 88082552890
-Ref: 88092552937
-Ref: 88102552938
-Ref: 88112552967
-Ref: 88122553014
-Ref: 88132553015
-Ref: 88142553042
-Ref: 88152553122
-Ref: 88162553123
-Ref: 88172553184
-Ref: 88182553185
-Ref: 88192553229
-Ref: 88202553256
-Ref: 88212553282
-Ref: 88222553332
-Ref: 88232553333
-Ref: 88242553350
-Ref: 88252553372
-Ref: 88262553473
-Ref: 88272553474
-Ref: 88282553493
-Ref: 88292553534
-Ref: 88302553535
-Ref: 88312553557
-Ref: 88322553641
-Ref: 88332553642
-Ref: 88342553726
-Ref: 88352553727
-Ref: 88362553763
-Ref: 88372553803
-Ref: 88382553804
-Ref: 88392553831
-Ref: 88402553871
-Ref: 88412553872
-Ref: 88422553885
-Ref: 88432553898
-Ref: 88442553946
-Ref: 88452553947
-Ref: 88462553991
-Ref: 88472553992
-Ref: 88482554021
-Ref: 88492554100
-Ref: 88502554101
-Ref: 88512554115
-Ref: 88522554161
-Ref: 88532554162
-Ref: 88542554171
-Ref: 88552554215
-Ref: 88562554216
-Ref: 88572554247
-Ref: 88582554333
-Ref: 88592554334
-Ref: 88602554365
-Ref: 88612554415
-Ref: 88622554416
-Ref: 88632554427
-Ref: 88642554510
-Ref: 88652554511
-Ref: 88662554521
-Ref: 88672554606
-Ref: 88682554607
-Ref: 88692554634
-Node: Annex M2554671
-Ref: 88702554848
-Node: M.12555593
-Ref: 88712555738
-Ref: 88722555738
-Node: M.22563007
-Ref: 88732563170
-Ref: 88742563249
-Ref: 88752577766
-Node: M.32584325
-Ref: 88762584442
-Ref: 88772584442
-Node: Annex N2614839
-Ref: 88782614958
-Ref: 88792615180
-Ref: 88802615334
-Ref: 88812615498
-Ref: 88822615815
-Ref: 88832616058
-Ref: 88842616193
-Ref: 88852616393
-Ref: 88862616677
-Ref: 88872616885
-Ref: 88882616980
-Ref: 88892616997
-Ref: 88902617261
-Ref: 88912617521
-Ref: 88922617579
-Ref: 88932617720
-Ref: 88942617950
-Ref: 88952618095
-Ref: 88962618197
-Ref: 88972618198
-Ref: 88982618460
-Ref: 88992618995
-Ref: 89002619162
-Ref: 89012619333
-Ref: 89022619600
-Ref: 89032619752
-Ref: 89042619819
-Ref: 89052619967
-Ref: 89062620116
-Ref: 89072620267
-Ref: 89082620409
-Ref: 89092620515
-Ref: 89102620609
-Ref: 89112620610
-Ref: 89122620728
-Ref: 89132620844
-Ref: 89142621487
-Ref: 89152621740
-Ref: 89162621907
-Ref: 89172622370
-Ref: 89182622712
-Ref: 89192622876
-Ref: 89202623045
-Ref: 89212623260
-Ref: 89222623522
-Ref: 89232623624
-Ref: 89242623798
-Ref: 89252624046
-Ref: 89262624222
-Ref: 89272624611
-Ref: 89282624789
-Ref: 89292625121
-Ref: 89302625243
-Ref: 89312625468
-Ref: 89322625585
-Ref: 89332625693
-Ref: 89342626310
-Ref: 89352626449
-Ref: 89362626728
-Ref: 89372626853
-Ref: 89382627097
-Ref: 89392627282
-Ref: 89402627615
-Ref: 89412627805
-Ref: 89422627943
-Ref: 89432628054
-Ref: 89442628184
-Ref: 89452628320
-Ref: 89462628460
-Ref: 89472628538
-Ref: 89482628843
-Ref: 89492629022
-Ref: 89502629337
-Ref: 89512629582
-Ref: 89522629830
-Ref: 89532630279
-Ref: 89542630508
-Ref: 89552630786
-Ref: 89562630824
-Node: Annex P2630947
-Ref: 89572631074
-Ref: 89582631074
-Ref: 89592631074
-Ref: 89602631074
-Ref: 89612631074
-Ref: 89622631240
-Ref: 89632631258
-Ref: 89642631277
-Ref: 89652631352
-Ref: 89662631379
-Ref: 89672631406
-Ref: 89682631433
-Ref: 89692631459
-Ref: 89702631482
-Ref: 89712631553
-Ref: 89722631580
-Ref: 89732631613
-Ref: 89742631638
-Ref: 89752631704
-Ref: 89762631722
-Ref: 89772631782
-Ref: 89782631792
-Ref: 89792631802
-Ref: 89802631850
-Ref: 89812631858
-Ref: 89822631869
-Ref: 89832631921
-Ref: 89842631935
-Ref: 89852632070
-Ref: 89862632077
-Ref: 89872632093
-Ref: 89882632111
-Ref: 89892632156
-Ref: 89902632217
-Ref: 89912632234
-Ref: 89922632245
-Ref: 89932632306
-Ref: 89942632383
-Ref: 89952632447
-Ref: 89962632531
-Ref: 89972632604
-Ref: 89982632666
-Ref: 89992632679
-Ref: 90002632710
-Ref: 90012632832
-Ref: 90022632847
-Ref: 90032632879
-Ref: 90042632894
-Ref: 90052632931
-Ref: 90062632947
-Ref: 90072632978
-Ref: 90082632994
-Ref: 90092633062
-Ref: 90102633083
-Ref: 90112633113
-Ref: 90122633136
-Ref: 90132633165
-Ref: 90142633192
-Ref: 90152633234
-Ref: 90162633265
-Ref: 90172633307
-Ref: 90182633331
-Ref: 90192633362
-Ref: 90202633388
-Ref: 90212633418
-Ref: 90222633488
-Ref: 90232633547
-Ref: 90242633579
-Ref: 90252633617
-Ref: 90262633652
-Ref: 90272633750
-Ref: 90282633771
-Ref: 90292633799
-Ref: 90302633835
-Ref: 90312633868
-Ref: 90322633900
-Ref: 90332633984
-Ref: 90342634016
-Ref: 90352634050
-Ref: 90362634075
-Ref: 90372634107
-Ref: 90382634134
-Ref: 90392634167
-Ref: 90402634195
-Ref: 90412634288
-Ref: 90422634311
-Ref: 90432634344
-Ref: 90442634418
-Ref: 90452634434
-Ref: 90462634448
-Ref: 90472634511
-Ref: 90482634557
-Ref: 90492634577
-Ref: 90502634657
-Ref: 90512634676
-Ref: 90522634696
-Ref: 90532634775
-Ref: 90542634794
-Ref: 90552634877
-Ref: 90562634925
-Ref: 90572634954
-Ref: 90582634980
-Ref: 90592635012
-Ref: 90602635060
-Ref: 90612635088
-Ref: 90622635114
-Ref: 90632635146
-Ref: 90642635194
-Ref: 90652635226
-Ref: 90662635252
-Ref: 90672635284
-Ref: 90682635317
-Ref: 90692635409
-Ref: 90702635432
-Ref: 90712635513
-Ref: 90722635559
-Ref: 90732635665
-Ref: 90742635690
-Ref: 90752635712
-Ref: 90762635787
-Ref: 90772635828
-Ref: 90782635864
-Ref: 90792635885
-Ref: 90802635971
-Ref: 90812636008
-Ref: 90822636115
-Ref: 90832636137
-Ref: 90842636227
-Ref: 90852636299
-Ref: 90862636332
-Ref: 90872636436
-Ref: 90882636470
-Ref: 90892636553
-Ref: 90902636624
-Ref: 90912636652
-Ref: 90922636753
-Ref: 90932636765
-Ref: 90942636867
-Ref: 90952636895
-Ref: 90962636966
-Ref: 90972637000
-Ref: 90982637121
-Ref: 90992637133
-Ref: 91002637241
-Ref: 91012637266
-Ref: 91022637278
-Ref: 91032637381
-Ref: 91042637400
-Ref: 91052637477
-Ref: 91062637510
-Ref: 91072637613
-Ref: 91082637641
-Ref: 91092637671
-Ref: 91102637751
-Ref: 91112637846
-Ref: 91122637877
-Ref: 91132637916
-Ref: 91142638002
-Ref: 91152638023
-Ref: 91162638097
-Ref: 91172638134
-Ref: 91182638201
-Ref: 91192638219
-Ref: 91202638290
-Ref: 91212638311
-Ref: 91222638363
-Ref: 91232638391
-Ref: 91242638542
-Ref: 91252638572
-Ref: 91262638665
-Ref: 91272638693
-Ref: 91282638709
-Ref: 91292638726
-Ref: 91302638760
-Ref: 91312638787
-Ref: 91322638809
-Ref: 91332638882
-Ref: 91342638957
-Ref: 91352638985
-Ref: 91362639090
-Ref: 91372639120
-Ref: 91382639139
-Ref: 91392639237
-Ref: 91402639336
-Ref: 91412639447
-Ref: 91422639463
-Ref: 91432639490
-Ref: 91442639506
-Ref: 91452639579
-Ref: 91462639603
-Ref: 91472639676
-Ref: 91482639703
-Ref: 91492639728
-Ref: 91502639768
-Ref: 91512639861
-Ref: 91522639888
-Ref: 91532639908
-Ref: 91542639987
-Ref: 91552640022
-Ref: 91562640088
-Ref: 91572640107
-Ref: 91582640170
-Ref: 91592640199
-Ref: 91602640226
-Ref: 91612640298
-Ref: 91622640389
-Ref: 91632640420
-Ref: 91642640471
-Ref: 91652640619
-Ref: 91662640696
-Ref: 91672640724
-Ref: 91682640807
-Ref: 91692640823
-Ref: 91702640861
-Ref: 91712640877
-Ref: 91722640984
-Ref: 91732641009
-Ref: 91742641196
-Ref: 91752641252
-Ref: 91762641392
-Ref: 91772641426
-Ref: 91782641449
-Ref: 91792641494
-Ref: 91802641522
-Ref: 91812641566
-Ref: 91822641665
-Ref: 91832641686
-Ref: 91842641771
-Ref: 91852641845
-Ref: 91862641870
-Ref: 91872641937
-Ref: 91882641957
-Ref: 91892641973
-Ref: 91902642018
-Ref: 91912642032
-Ref: 91922642093
-Ref: 91932642111
-Ref: 91942642126
-Ref: 91952642138
-Ref: 91962642197
-Ref: 91972642213
-Ref: 91982642244
-Ref: 91992642266
-Ref: 92002642282
-Ref: 92012642305
-Ref: 92022642335
-Ref: 92032642355
-Ref: 92042642379
-Ref: 92052642401
-Ref: 92062642432
-Ref: 92072642458
-Ref: 92082642519
-Ref: 92092642532
-Ref: 92102642583
-Ref: 92112642590
-Ref: 92122642660
-Ref: 92132642718
-Ref: 92142642771
-Ref: 92152642778
-Ref: 92162642792
-Ref: 92172642841
-Ref: 92182642848
-Ref: 92192642913
-Ref: 92202642922
-Ref: 92212642980
-Ref: 92222642993
-Ref: 92232643013
-Ref: 92242643079
-Ref: 92252643086
-Ref: 92262643168
-Ref: 92272643187
-Ref: 92282643295
-Ref: 92292643302
-Ref: 92302643400
-Ref: 92312643482
-Ref: 92322643565
-Ref: 92332643572
-Ref: 92342643638
-Ref: 92352643657
-Ref: 92362643679
-Ref: 92372643749
-Ref: 92382643858
-Ref: 92392643890
-Ref: 92402644011
-Ref: 92412644037
-Ref: 92422644058
-Ref: 92432644159
-Ref: 92442644186
-Ref: 92452644279
-Ref: 92462644298
-Ref: 92472644377
-Ref: 92482644390
-Ref: 92492644457
-Ref: 92502644486
-Ref: 92512644576
-Ref: 92522644588
-Ref: 92532644602
-Ref: 92542644625
-Ref: 92552644639
-Ref: 92562644662
-Ref: 92572644684
-Ref: 92582644698
-Ref: 92592644788
-Ref: 92602644819
-Ref: 92612644917
-Ref: 92622644941
-Ref: 92632644961
-Ref: 92642645038
-Ref: 92652645052
-Ref: 92662645067
-Ref: 92672645086
-Ref: 92682645106
-Ref: 92692645119
-Ref: 92702645134
-Ref: 92712645152
-Ref: 92722645172
-Ref: 92732645186
-Ref: 92742645253
-Ref: 92752645274
-Ref: 92762645301
-Ref: 92772645321
-Ref: 92782645348
-Ref: 92792645369
-Ref: 92802645396
-Ref: 92812645422
-Ref: 92822645449
-Ref: 92832645474
-Ref: 92842645546
-Ref: 92852645565
-Ref: 92862645585
-Ref: 92872645652
-Ref: 92882645671
-Ref: 92892645691
-Ref: 92902645727
-Ref: 92912645754
-Ref: 92922645787
-Ref: 92932645855
-Ref: 92942645876
-Ref: 92952645948
-Ref: 92962645968
-Ref: 92972645976
-Ref: 92982646042
-Ref: 92992646065
-Ref: 93002646071
-Ref: 93012646100
-Ref: 93022646139
-Ref: 93032646147
-Ref: 93042646168
-Ref: 93052646211
-Ref: 93062646223
-Ref: 93072646238
-Ref: 93082646252
-Ref: 93092646305
-Ref: 93102646330
-Ref: 93112646347
-Ref: 93122646365
-Ref: 93132646372
-Ref: 93142646385
-Ref: 93152646406
-Ref: 93162646433
-Ref: 93172646938
-Ref: 93182646954
-Ref: 93192647026
-Ref: 93202647051
-Ref: 93212647077
-Ref: 93222647102
-Ref: 93232647138
-Ref: 93242647198
-Ref: 93252647280
-Ref: 93262647303
-Ref: 93272647343
-Ref: 93282647445
-Ref: 93292647492
-Ref: 93302647559
-Ref: 93312647570
-Ref: 93322647608
-Ref: 93332647631
-Ref: 93342647642
-Ref: 93352647668
-Ref: 93362647778
-Ref: 93372647843
-Ref: 93382647856
-Ref: 93392647877
-Ref: 93402647890
-Ref: 93412647954
-Ref: 93422647968
-Ref: 93432647982
-Ref: 93442647995
-Ref: 93452648057
-Ref: 93462648080
-Ref: 93472648112
-Ref: 93482648135
-Ref: 93492648222
-Ref: 93502648279
-Ref: 93512648290
-Ref: 93522648302
-Ref: 93532648357
-Ref: 93542648364
-Ref: 93552648384
-Ref: 93562648391
-Ref: 93572648455
-Ref: 93582648480
-Ref: 93592648505
-Ref: 93602648530
-Ref: 93612648549
-Ref: 93622648584
-Ref: 93632648612
-Ref: 93642648643
-Ref: 93652648665
-Ref: 93662648691
-Ref: 93672648711
-Ref: 93682648737
-Ref: 93692648810
-Ref: 93702648827
-Ref: 93712648852
-Ref: 93722648871
-Ref: 93732648897
-Ref: 93742648933
-Ref: 93752648954
-Ref: 93762649062
-Ref: 93772649134
-Ref: 93782649213
-Ref: 93792649221
-Ref: 93802649287
-Ref: 93812649313
-Ref: 93822649351
-Ref: 93832649377
-Ref: 93842649426
-Ref: 93852649534
-Ref: 93862649560
-Ref: 93872649599
-Ref: 93882649714
-Ref: 93892649749
-Ref: 93902649830
-Ref: 93912649865
-Ref: 93922649902
-Ref: 93932649952
-Ref: 93942650016
-Ref: 93952650040
-Ref: 93962650083
-Ref: 93972650172
-Ref: 93982650205
-Ref: 93992650296
-Ref: 94002650338
-Ref: 94012650352
-Ref: 94022650375
-Ref: 94032650423
-Ref: 94042650488
-Ref: 94052650549
-Ref: 94062650603
-Ref: 94072650658
-Ref: 94082650734
-Ref: 94092650746
-Ref: 94102650812
-Ref: 94112650880
-Ref: 94122650911
-Ref: 94132650950
-Ref: 94142651036
-Ref: 94152651069
-Ref: 94162651154
-Ref: 94172651181
-Ref: 94182651265
-Ref: 94192651285
-Ref: 94202651360
-Ref: 94212651380
-Ref: 94222651393
-Ref: 94232651457
-Ref: 94242651486
-Ref: 94252651573
-Ref: 94262651593
-Ref: 94272651663
-Ref: 94282651731
-Ref: 94292651794
-Ref: 94302651875
-Ref: 94312651896
-Ref: 94322651912
-Ref: 94332651935
-Ref: 94342651955
-Ref: 94352652023
-Ref: 94362652050
-Ref: 94372652138
-Ref: 94382652175
-Ref: 94392652181
-Ref: 94402652197
-Ref: 94412652220
-Ref: 94422652249
-Ref: 94432652276
-Ref: 94442652298
-Ref: 94452652432
-Ref: 94462652463
-Ref: 94472652501
-Ref: 94482652538
-Ref: 94492652583
-Ref: 94502652628
-Ref: 94512652714
-Ref: 94522652739
-Ref: 94532652746
-Ref: 94542652830
-Ref: 94552652853
-Ref: 94562652860
-Ref: 94572652943
-Ref: 94582652968
-Ref: 94592653069
-Ref: 94602653087
-Ref: 94612653167
-Ref: 94622653189
-Ref: 94632653254
-Ref: 94642653340
-Ref: 94652653382
-Ref: 94662653418
-Ref: 94672653501
-Ref: 94682653553
-Ref: 94692653660
-Ref: 94702653681
-Ref: 94712653770
-Ref: 94722653800
-Ref: 94732653845
-Ref: 94742653938
-Ref: 94752653968
-Ref: 94762654007
-Ref: 94772654032
-Ref: 94782654064
-Ref: 94792654094
-Ref: 94802654132
-Ref: 94812654155
-Ref: 94822654226
-Ref: 94832654317
-Ref: 94842654358
-Ref: 94852654395
-Ref: 94862654448
-Ref: 94872654488
-Ref: 94882654506
-Ref: 94892654582
-Ref: 94902654623
-Ref: 94912654660
-Ref: 94922654705
-Ref: 94932654752
-Ref: 94942654770
-Ref: 94952654850
-Ref: 94962654871
-Ref: 94972654949
-Ref: 94982655044
-Ref: 94992655065
-Ref: 95002655146
-Ref: 95012655186
-Ref: 95022655228
-Ref: 95032655358
-Ref: 95042655379
-Ref: 95052655454
-Ref: 95062655470
-Ref: 95072655536
-Ref: 95082655552
-Ref: 95092655628
-Ref: 95102655667
-Ref: 95112655709
-Ref: 95122655749
-Ref: 95132655792
-Ref: 95142655889
-Ref: 95152655912
-Ref: 95162655928
-Ref: 95172655962
-Ref: 95182655981
-Ref: 95192656013
-Ref: 95202656035
-Ref: 95212656068
-Ref: 95222656087
-Ref: 95232656171
-Ref: 95242656227
-Ref: 95252656241
-Ref: 95262656331
-Ref: 95272656380
-Ref: 95282656394
-Ref: 95292656490
-Ref: 95302656521
-Ref: 95312656570
-Ref: 95322656589
-Ref: 95332656699
-Ref: 95342656756
-Ref: 95352656775
-Ref: 95362656827
-Ref: 95372656886
-Ref: 95382656905
-Ref: 95392656956
-Ref: 95402657014
-Ref: 95412657033
-Ref: 95422657125
-Ref: 95432657146
-Ref: 95442657185
-Ref: 95452657226
-Ref: 95462657257
-Ref: 95472657341
-Ref: 95482657376
-Ref: 95492657416
-Ref: 95502657447
-Ref: 95512657521
-Ref: 95522657560
-Ref: 95532657589
-Ref: 95542657639
-Ref: 95552657659
-Ref: 95562657730
-Ref: 95572657764
-Ref: 95582657799
-Ref: 95592657840
-Ref: 95602657889
-Ref: 95612657980
-Ref: 95622658001
-Ref: 95632658040
-Ref: 95642658080
-Ref: 95652658111
-Ref: 95662658208
-Ref: 95672658242
-Ref: 95682658282
-Ref: 95692658313
-Ref: 95702658396
-Ref: 95712658456
-Ref: 95722658512
-Ref: 95732658584
-Ref: 95742658619
-Ref: 95752658649
-Ref: 95762658721
-Ref: 95772658765
-Ref: 95782658853
-Ref: 95792658887
-Ref: 95802658922
-Ref: 95812658971
-Ref: 95822659037
-Ref: 95832659072
-Ref: 95842659100
-Ref: 95852659139
-Ref: 95862659183
-Ref: 95872659206
-Ref: 95882659372
-Ref: 95892659408
-Ref: 95902659430
-Ref: 95912659460
-Ref: 95922659496
-Ref: 95932659588
-Ref: 95942659602
-Ref: 95952659616
-Ref: 95962659648
-Ref: 95972659698
-Ref: 95982659754
-Ref: 95992659820
-Ref: 96002659841
-Ref: 96012659865
-Ref: 96022659897
-Ref: 96032659936
-Ref: 96042659985
-Ref: 96052660053
-Ref: 96062660081
-Ref: 96072660154
-Ref: 96082660224
-Ref: 96092660247
-Ref: 96102660338
-Ref: 96112660344
-Ref: 96122660443
-Ref: 96132660506
-Ref: 96142660530
-Ref: 96152660629
-Ref: 96162660706
-Ref: 96172660772
-Ref: 96182660798
-Ref: 96192660824
-Ref: 96202660856
-Ref: 96212660947
-Ref: 96222660964
-Ref: 96232661002
-Ref: 96242661019
-Ref: 96252661060
-Ref: 96262661145
-Ref: 96272661216
-Ref: 96282661244
-Ref: 96292661271
-Ref: 96302661350
-Ref: 96312661368
-Ref: 96322661448
-Ref: 96332661465
-Ref: 96342661622
-Ref: 96352661663
-Ref: 96362661761
-Ref: 96372661786
-Ref: 96382661872
-Ref: 96392661899
-Ref: 96402661996
-Ref: 96412662039
-Ref: 96422662154
-Ref: 96432662203
-Ref: 96442662290
-Ref: 96452662312
-Ref: 96462662393
-Ref: 96472662419
-Ref: 96482662480
-Ref: 96492662558
-Ref: 96502662571
-Ref: 96512662622
-Ref: 96522662698
-Ref: 96532662713
-Ref: 96542662735
-Ref: 96552662750
-Ref: 96562662812
-Ref: 96572662846
-Ref: 96582662883
-Ref: 96592662984
-Ref: 96602663011
-Ref: 96612663041
-Ref: 96622663065
-Ref: 96632663161
-Ref: 96642663198
-Ref: 96652663235
-Ref: 96662663316
-Ref: 96672663334
-Ref: 96682663395
-Ref: 96692663447
-Ref: 96702663505
-Ref: 96712663519
-Ref: 96722663573
-Ref: 96732663595
-Ref: 96742663705
-Ref: 96752663732
-Ref: 96762663821
-Ref: 96772663848
-Ref: 96782663896
-Ref: 96792663919
-Ref: 96802663939
-Ref: 96812663962
-Ref: 96822664044
-Ref: 96832664074
-Ref: 96842664123
-Ref: 96852664217
-Ref: 96862664261
-Ref: 96872664349
-Ref: 96882664393
-Ref: 96892664491
-Ref: 96902664535
-Ref: 96912664607
-Ref: 96922664625
-Ref: 96932664688
-Ref: 96942664734
-Ref: 96952664828
-Ref: 96962664879
-Ref: 96972664907
-Ref: 96982664988
-Ref: 96992665021
-Ref: 97002665041
-Ref: 97012665078
-Ref: 97022665161
-Ref: 97032665237
-Ref: 97042665332
-Ref: 97052665350
-Ref: 97062665425
-Ref: 97072665443
-Ref: 97082665517
-Ref: 97092665550
-Ref: 97102665655
-Ref: 97112665676
-Ref: 97122665715
-Ref: 97132665806
-Ref: 97142665827
-Ref: 97152665908
-Ref: 97162665953
-Ref: 97172666043
-Ref: 97182666080
-Ref: 97192666115
-Ref: 97202666156
-Ref: 97212666253
-Ref: 97222666317
-Ref: 97232666323
-Ref: 97242666362
-Ref: 97252666396
-Ref: 97262666438
-Ref: 97272666504
-Ref: 97282666510
-Ref: 97292666549
-Ref: 97302666583
-Ref: 97312666624
-Ref: 97322666682
-Ref: 97332666688
-Ref: 97342666727
-Ref: 97352666809
-Ref: 97362666832
-Ref: 97372666938
-Ref: 97382666956
-Ref: 97392667059
-Ref: 97402667081
-Ref: 97412667107
-Ref: 97422667120
-Ref: 97432667127
-Ref: 97442667167
-Ref: 97452667237
-Ref: 97462667264
-Ref: 97472667270
-Ref: 97482667286
-Ref: 97492667309
-Ref: 97502667343
-Ref: 97512667376
-Ref: 97522667403
-Ref: 97532667408
-Ref: 97542667430
-Ref: 97552667470
-Ref: 97562667558
-Ref: 97572667602
-Ref: 97582667714
-Ref: 97592667734
-Ref: 97602667756
-Ref: 97612667799
-Ref: 97622667901
-Ref: 97632667921
-Ref: 97642668017
-Ref: 97652668059
-Ref: 97662668101
-Ref: 97672668144
-Ref: 97682668193
-Ref: 97692668235
-Ref: 97702668279
-Ref: 97712668329
-Ref: 97722668378
-Ref: 97732668418
-Ref: 97742668459
-Ref: 97752668705
-Ref: 97762668724
-Ref: 97772669275
-Ref: 97782669358
-Ref: 97792669445
-Ref: 97802669530
-Ref: 97812669586
-Ref: 97822669709
-Ref: 97832669738
-Ref: 97842669772
-Ref: 97852669879
-Ref: 97862669917
-Ref: 97872669951
-Ref: 97882670022
-Ref: 97892670089
-Ref: 97902670173
-Ref: 97912670216
-Ref: 97922670222
-Ref: 97932670269
-Ref: 97942670385
-Ref: 97952670416
-Ref: 97962670446
-Ref: 97972670564
-Ref: 97982670618
-Ref: 97992670681
-Ref: 98002670722
-Ref: 98012670769
-Ref: 98022670811
-Ref: 98032670861
-Ref: 98042670886
-Ref: 98052670898
-Ref: 98062670945
-Ref: 98072671016
-Ref: 98082671032
-Ref: 98092671070
-Ref: 98102671086
-Ref: 98112671157
-Ref: 98122671225
-Ref: 98132671232
-Ref: 98142671245
-Ref: 98152671329
-Ref: 98162671340
-Ref: 98172671365
-Ref: 98182671392
-Ref: 98192671403
-Ref: 98202671428
-Ref: 98212671525
-Ref: 98222671540
-Ref: 98232671614
-Ref: 98242671718
-Ref: 98252671752
-Ref: 98262671778
-Ref: 98272671887
-Ref: 98282671901
-Ref: 98292671916
-Ref: 98302671929
-Ref: 98312671986
-Ref: 98322672045
-Ref: 98332672110
-Ref: 98342672172
-Ref: 98352672262
-Ref: 98362672339
-Ref: 98372672383
-Ref: 98382672397
-Ref: 98392672495
-Ref: 98402672502
-Ref: 98412672571
-Ref: 98422672590
-Ref: 98432672656
-Ref: 98442672675
-Ref: 98452672740
-Ref: 98462672777
-Ref: 98472672777
-Ref: 98482672777
-Ref: 98492672777
-Ref: 98502672777
-Node: Annex Q2718321
-Node: Q.12718887
-Ref: 98512719063
-Node: Q.22730412
-Ref: 98522730630
-Ref: 98532730630
-Node: Q.32746557
-Ref: 98542746754
-Node: Q.42813832
-Ref: 98552814026
-Node: Q.52817679
-Ref: 98562817906
-Ref: 98572817906
-Ref: 98582817906
-Node: Index2841608
-Node: operators2841902
-Node: A2843350
-Node: B2881069
-Node: C2888811
-Node: D2923996
-Node: E2945268
-Node: F2976775
-Node: G2990214
-Node: H2997764
-Node: I3001908
-Node: J3028207
-Node: K3028397
-Node: L3029177
-Node: M3044566
-Node: N3054056
-Node: O3068491
-Node: P3075695
-Node: Q3102318
-Node: R3104119
-Node: S3126219
-Node: T3155536
-Node: U3173507
-Node: V3184463
-Node: W3188518
-Node: X3194703
-Node: Y3194837
+Node: 0.313265
+Ref: 100113854
+Ref: 100213854
+Ref: 100336779
+Ref: 100436779
+Node: 0.9953283
+Node: 153507
+Node: 1.153702
+Node: 1.1.155611
+Node: 1.1.257175
+Ref: 100557375
+Ref: 100657664
+Ref: 100757664
+Ref: 100857664
+Ref: 100958144
+Ref: 101058144
+Ref: 101158585
+Ref: 101258585
+Ref: 101358585
+Ref: 101459308
+Ref: 101559313
+Ref: 101659313
+Ref: 101759313
+Ref: 101859313
+Ref: 101959393
+Ref: 102059393
+Ref: 102159393
+Ref: 102259526
+Ref: 102359526
+Ref: 102459526
+Ref: 102559566
+Ref: 102659568
+Ref: 102759680
+Ref: 102859680
+Ref: 102959792
+Ref: 103059792
+Ref: 103159792
+Ref: 103259792
+Ref: 103359843
+Ref: 103459845
+Ref: 103560000
+Ref: 103660000
+Ref: 103760000
+Ref: 103860000
+Ref: 103960110
+Ref: 104060110
+Ref: 104160235
+Ref: 104260235
+Ref: 104360358
+Ref: 104460469
+Ref: 104560574
+Ref: 104660735
+Ref: 104760837
+Ref: 104860837
+Ref: 104961077
+Node: 1.1.361343
+Ref: 105061584
+Ref: 105162495
+Ref: 105262495
+Ref: 105362622
+Ref: 105464831
+Ref: 105564831
+Ref: 105664831
+Ref: 105764831
+Ref: 105864831
+Ref: 105965539
+Node: 1.1.466122
+Ref: 106066605
+Ref: 106166605
+Ref: 106266605
+Ref: 106366605
+Ref: 106466605
+Ref: 106567875
+Ref: 106668946
+Ref: 106769107
+Ref: 106869235
+Ref: 106969333
+Ref: 107069910
+Ref: 107169912
+Node: 1.1.570784
+Ref: 107271625
+Ref: 107371630
+Ref: 107471630
+Ref: 107571630
+Ref: 107672058
+Ref: 107772063
+Ref: 107872741
+Ref: 107972804
+Ref: 108073037
+Ref: 108173495
+Ref: 108273495
+Ref: 108374121
+Ref: 108474121
+Ref: 108574387
+Node: 1.274488
+Ref: 108674609
+Ref: 108774609
+Ref: 108874911
+Ref: 108974911
+Ref: 109074911
+Ref: 109175048
+Ref: 109275048
+Ref: 109375048
+Ref: 109475158
+Ref: 109575158
+Ref: 109675158
+Ref: 109775271
+Ref: 109875271
+Ref: 109975271
+Ref: 110075357
+Ref: 110175357
+Ref: 110275357
+Ref: 110375483
+Ref: 110475483
+Ref: 110575483
+Ref: 110675589
+Ref: 110775589
+Ref: 110875714
+Ref: 110975714
+Ref: 111075714
+Ref: 111175849
+Ref: 111275849
+Ref: 111375849
+Ref: 111475929
+Ref: 111575929
+Ref: 111675929
+Ref: 111776034
+Ref: 111876034
+Ref: 111976034
+Ref: 112076118
+Ref: 112176118
+Node: 1.376325
+Ref: 112276436
+Ref: 112377084
+Ref: 112477086
+Ref: 112577086
+Ref: 112677086
+Node: 277088
+Node: 2.177796
+Ref: 112777891
+Ref: 112878149
+Ref: 112978149
+Ref: 113079474
+Ref: 113179577
+Ref: 113279704
+Ref: 113379833
+Ref: 113479962
+Ref: 113580089
+Ref: 113680210
+Ref: 113780339
+Ref: 113880479
+Ref: 113980605
+Ref: 114080729
+Ref: 114180869
+Ref: 114280989
+Ref: 114381115
+Ref: 114481241
+Ref: 114581375
+Ref: 114681718
+Ref: 114781729
+Ref: 114881918
+Ref: 114982050
+Ref: 115082176
+Ref: 115182568
+Ref: 115282569
+Ref: 115382569
+Ref: 115482569
+Ref: 115582569
+Ref: 115682569
+Ref: 115782569
+Ref: 115882569
+Ref: 115982569
+Ref: 116082569
+Ref: 116182569
+Ref: 116282569
+Ref: 116382569
+Ref: 116482569
+Ref: 116582569
+Ref: 116682569
+Ref: 116782569
+Ref: 116882569
+Ref: 116982569
+Ref: 117082569
+Ref: 117182569
+Ref: 117282569
+Ref: 117382569
+Ref: 117482569
+Ref: 117582569
+Ref: 117682569
+Ref: 117782569
+Ref: 117882569
+Node: 2.284319
+Ref: 117984532
+Ref: 118084605
+Ref: 118184605
+Ref: 118285054
+Ref: 118385063
+Ref: 118485311
+Ref: 118586235
+Ref: 118686381
+Node: 2.387643
+Ref: 118787836
+Ref: S000287836
+Ref: 118887849
+Ref: 118987867
+Ref: 119087886
+Ref: 119187931
+Ref: S000387931
+Ref: S000487931
+Ref: 119287946
+Ref: 119387973
+Ref: 119488000
+Ref: 119588027
+Ref: 119688053
+Ref: 119788076
+Ref: 119888119
+Ref: S000588119
+Ref: 119988134
+Ref: 120088161
+Ref: 120188194
+Ref: 120288219
+Ref: 120388675
+Node: 2.489612
+Ref: 120489723
+Ref: 120589803
+Ref: 120689863
+Ref: 120789985
+Ref: S000689985
+Ref: 120889989
+Ref: 120990008
+Node: 2.4.190225
+Ref: 121090334
+Ref: 121190502
+Ref: S000790502
+Ref: 121290506
+Ref: 121390517
+Ref: 121490527
+Ref: 121590552
+Ref: S000890552
+Ref: 121690556
+Ref: 121790565
+Ref: 121890576
+Ref: 121990599
+Ref: S000990599
+Ref: 122090610
+Ref: 122190624
+Ref: 122290649
+Ref: S001090649
+Node: 2.4.291383
+Ref: 122391488
+Ref: 122491488
+Ref: 122591488
+Ref: 122691488
+Ref: 122791488
+Ref: 122891488
+Ref: 122991488
+Ref: 123091488
+Ref: 123191488
+Ref: 123291488
+Ref: 123391643
+Ref: S001191643
+Ref: 123491656
+Ref: 123591663
+Ref: 123691679
+Ref: 123791697
+Ref: 123891719
+Ref: S001291719
+Ref: 123991723
+Ref: 124091753
+Ref: S001391753
+Ref: 124191766
+Ref: 124291783
+Ref: 124391794
+Ref: 124491832
+Ref: S001491832
+Ref: 124591836
+Ref: 124691915
+Node: 2.592985
+Ref: 124793264
+Ref: S001593264
+Ref: 124893270
+Node: 2.693686
+Ref: 124994086
+Ref: 125094152
+Ref: S001694152
+Ref: 125194159
+Ref: 125294198
+Ref: S001794198
+Ref: 125394229
+Ref: 125494427
+Ref: 125594746
+Node: 2.795463
+Ref: 125695696
+Ref: S001895696
+Ref: 125795722
+Node: 2.896402
+Ref: 125896495
+Ref: 125996759
+Ref: S001996759
+Ref: 126096779
+Ref: 126196792
+Ref: 126296823
+Ref: 126396898
+Ref: S002096898
+Ref: 126496932
+Ref: 126596947
+Ref: 126696981
+Ref: 126796996
+Ref: 126897035
+Ref: 126997051
+Ref: 127097084
+Ref: 127197100
+Ref: 127298214
+Ref: 127398214
+Ref: 127498290
+Ref: 127598292
+Ref: 127698378
+Ref: 127798378
+Ref: 127898810
+Ref: 127998810
+Ref: 128099038
+Ref: 1281100284
+Ref: 1282100285
+Ref: 1283100290
+Ref: 1284100320
+Ref: 1285100321
+Ref: 1286100344
+Ref: 1287100345
+Ref: 1288100354
+Node: 2.9102014
+Ref: 1289102192
+Node: 3103658
+Node: 3.1104257
+Ref: 1290104348
+Ref: 1291104437
+Ref: 1292104838
+Ref: S0021104838
+Ref: 1293104853
+Ref: 1294104874
+Ref: 1295104904
+Ref: 1296104927
+Ref: 1297104956
+Ref: 1298104983
+Ref: 1299105025
+Ref: 1300105056
+Ref: 1301105098
+Ref: 1302105122
+Ref: 1303105153
+Ref: 1304105179
+Ref: 1305105209
+Ref: 1306105258
+Ref: S0022105258
+Ref: 1307105262
+Ref: 1308105323
+Ref: 1309105413
+Ref: 1310105415
+Ref: 1311105646
+Ref: 1312106359
+Ref: 1313106359
+Ref: 1314107181
+Ref: 1315107181
+Ref: 1316107181
+Ref: 1317107185
+Ref: 1318107621
+Ref: 1319107725
+Ref: 1320107826
+Ref: 1321108149
+Ref: 1322108386
+Ref: 1323108614
+Ref: 1324108698
+Ref: 1325108700
+Ref: 1326108962
+Ref: 1327109035
+Node: 3.2109113
+Ref: 1328109274
+Ref: 1329109274
+Ref: 1330109413
+Ref: 1331109509
+Ref: 1332109509
+Ref: 1333109554
+Ref: 1334109701
+Ref: 1335109752
+Ref: 1336109822
+Ref: 1337109823
+Ref: 1338109899
+Ref: 1339109905
+Ref: 1340110052
+Ref: 1341110054
+Ref: 1342110164
+Ref: 1343110383
+Ref: 1344110383
+Ref: 1345110383
+Ref: 1346110930
+Ref: 1347111172
+Ref: 1348111414
+Ref: 1349111684
+Ref: 1350111684
+Ref: 1351111690
+Ref: 1352111808
+Ref: 1353111809
+Ref: 1354112237
+Ref: 1355112430
+Ref: 1356112430
+Ref: 1357112511
+Ref: 1358112511
+Ref: 1359112644
+Ref: 1360112682
+Ref: 1361112682
+Ref: 1362112688
+Ref: 1363112688
+Ref: 1364112688
+Ref: 1365112688
+Ref: 1366113530
+Ref: 1367114138
+Node: 3.2.1115771
+Ref: 1368116005
+Ref: S0023116005
+Ref: 1369116011
+Ref: 1370116043
+Ref: 1371116081
+Ref: 1372116116
+Ref: 1373116177
+Ref: S0024116177
+Ref: 1374116197
+Ref: 1375116218
+Ref: 1376116246
+Ref: 1377116282
+Ref: 1378116315
+Ref: 1379116347
+Ref: 1380116399
+Ref: S0025116399
+Ref: 1381116414
+Ref: 1382116446
+Ref: 1383116480
+Ref: 1384116505
+Ref: 1385116537
+Ref: 1386116564
+Ref: 1387116597
+Ref: 1388116625
+Ref: 1389116828
+Ref: 1390117232
+Ref: 1391117356
+Ref: 1392117551
+Ref: 1393117905
+Ref: 1394118117
+Ref: 1395118191
+Ref: 1396118574
+Ref: 1397118804
+Ref: 1398119192
+Ref: 1399119291
+Node: 3.2.2120422
+Ref: 1400120734
+Ref: S0026120734
+Ref: 1401120755
+Ref: 1402120778
+Ref: 1403120811
+Ref: 1404120862
+Ref: S0027120862
+Ref: 1405120869
+Ref: 1406120885
+Ref: 1407120899
+Ref: 1408120931
+Ref: S0028120931
+Ref: 1409120946
+Ref: 1410120969
+Ref: S0029120969
+Ref: 1411120973
+Ref: 1412120994
+Ref: 1413121040
+Ref: S0030121040
+Ref: 1414121055
+Ref: 1415121074
+Ref: 1416121094
+Ref: 1417121139
+Ref: S0031121139
+Ref: 1418121154
+Ref: 1419121173
+Ref: 1420121298
+Ref: 1421121446
+Ref: 1422121541
+Ref: 1423121900
+Ref: 1424121900
+Ref: 1425122112
+Ref: 1426122412
+Node: 3.2.3123535
+Ref: 1427123730
+Ref: 1428123958
+Ref: 1429124132
+Ref: 1430124262
+Ref: 1431125067
+Ref: 1432125326
+Node: 3.2.4125423
+Ref: 1433125757
+Ref: 1434125757
+Ref: 1435125757
+Ref: 1436125757
+Ref: 1437125757
+Ref: 1438125757
+Ref: 1439125757
+Ref: 1440126016
+Ref: 1441126645
+Ref: 1442126645
+Ref: 1443126645
+Ref: 1444128847
+Ref: 1445128847
+Ref: 1446130785
+Ref: 1447131302
+Ref: 1448131302
+Ref: 1449133062
+Ref: 1450133062
+Ref: 1451133062
+Ref: 1452133062
+Ref: 1453133900
+Node: 3.3136767
+Ref: 1454136964
+Ref: 1455137278
+Ref: 1456137912
+Ref: 1457137912
+Ref: 1458137912
+Ref: 1459137912
+Ref: 1460137912
+Ref: 1461137912
+Ref: 1462138382
+Ref: 1463138550
+Ref: 1464138692
+Ref: 1465139920
+Ref: 1466140019
+Ref: 1467140021
+Ref: 1468140199
+Ref: 1469140201
+Ref: 1470140890
+Ref: 1471140890
+Ref: 1472142068
+Node: 3.3.1142907
+Ref: 1473143024
+Ref: 1474143024
+Ref: 1475143024
+Ref: 1476143188
+Ref: 1477143190
+Ref: 1478143190
+Ref: 1479143397
+Ref: S0032143397
+Ref: 1480143411
+Ref: 1481143459
+Ref: 1482143488
+Ref: 1483143514
+Ref: 1484143546
+Ref: 1485143594
+Ref: 1486143622
+Ref: 1487143648
+Ref: 1488143680
+Ref: 1489143728
+Ref: 1490143760
+Ref: 1491143786
+Ref: 1492143818
+Ref: 1493143851
+Ref: 1494143912
+Ref: S0033143912
+Ref: 1495143924
+Ref: 1496143947
+Ref: 1497144020
+Ref: 1498144161
+Ref: 1499144221
+Ref: 1500144637
+Ref: 1501144727
+Ref: 1502145410
+Ref: 1503145631
+Ref: 1504145969
+Ref: 1505146264
+Ref: 1506146325
+Ref: 1507146327
+Ref: 1508146429
+Ref: 1509146431
+Ref: 1510146518
+Ref: 1511147105
+Ref: 1512147656
+Ref: 1513148202
+Ref: 1514148918
+Ref: 1515149054
+Ref: 1516149300
+Ref: 1517149302
+Ref: 1518149525
+Ref: 1519149705
+Ref: 1520150736
+Ref: 1521151166
+Ref: 1522151166
+Node: 3.3.2152957
+Ref: 1523153185
+Ref: S0034153185
+Ref: 1524153200
+Ref: 1525153248
+Ref: 1526153312
+Ref: 1527153989
+Ref: 1528154042
+Node: 3.4154604
+Ref: 1529154735
+Ref: 1530154910
+Ref: 1531154920
+Ref: 1532154920
+Ref: 1533155590
+Ref: S0035155590
+Ref: 1534155638
+Ref: 1535155663
+Ref: 1536155685
+Ref: 1537155758
+Ref: 1538155758
+Ref: 1539156253
+Ref: 1540156852
+Ref: 1541156902
+Ref: 1542156902
+Ref: 1543157080
+Ref: 1544157551
+Ref: 1545159132
+Ref: 1546159133
+Ref: 1547159509
+Ref: 1548159510
+Ref: 1549159510
+Ref: 1550160146
+Ref: 1551160491
+Ref: 1552161060
+Ref: 1553161567
+Ref: 1554162514
+Ref: 1555163206
+Ref: 1556163682
+Ref: 1557164078
+Ref: 1558164781
+Ref: 1559164806
+Ref: 1560165296
+Node: 3.4.1167550
+Ref: 1561167810
+Ref: 1562168126
+Ref: 1563168128
+Ref: 1564168128
+Ref: 1565168484
+Ref: 1566168751
+Ref: 1567169378
+Ref: 1568170151
+Ref: 1569170476
+Ref: 1570170476
+Ref: 1571170476
+Ref: 1572170476
+Ref: 1573171551
+Ref: 1574171551
+Ref: 1575171710
+Ref: 1576171834
+Ref: 1577172200
+Ref: 1578172291
+Ref: 1579172293
+Ref: 1580172461
+Node: 3.5173427
+Ref: 1581173530
+Ref: 1582173603
+Ref: 1583173670
+Ref: 1584173750
+Ref: 1585173971
+Ref: S0036173971
+Ref: 1586173983
+Ref: 1587174002
+Ref: S0037174002
+Ref: 1588174008
+Ref: 1589174044
+Ref: 1590174065
+Ref: 1591174086
+Ref: 1592174086
+Ref: 1593174086
+Ref: 1594174086
+Ref: 1595174293
+Ref: 1596174493
+Ref: 1597174613
+Ref: 1598174692
+Ref: 1599174853
+Ref: 1600175082
+Ref: 1601175334
+Ref: 1602175629
+Ref: 1603175629
+Ref: 1604175702
+Ref: 1605175941
+Ref: 1606176091
+Ref: 1607176210
+Ref: 1608176288
+Ref: 1609176542
+Ref: 1610176542
+Ref: 1611176773
+Ref: 1612176788
+Ref: 1613176914
+Ref: 1614176929
+Ref: 1615177055
+Ref: 1616177070
+Ref: 1617177136
+Ref: 1618177151
+Ref: 1619177307
+Ref: 1620177320
+Ref: 1621177335
+Ref: 1622177623
+Ref: 1623177638
+Ref: 1624177928
+Ref: 1625177943
+Ref: 1626178114
+Ref: 1627178281
+Ref: 1628178282
+Ref: 1629178776
+Ref: 1630178777
+Ref: 1631178866
+Ref: 1632178881
+Ref: 1633179052
+Ref: 1634179219
+Ref: 1635179220
+Ref: 1636179728
+Ref: 1637179729
+Ref: 1638179833
+Ref: 1639179848
+Ref: 1640180059
+Ref: 1641180557
+Ref: 1642182517
+Ref: 1643182532
+Ref: 1644182722
+Ref: 1645183325
+Ref: 1646183340
+Ref: 1647184055
+Ref: 1648184070
+Ref: 1649184350
+Ref: 1650184365
+Ref: 1651184624
+Ref: 1652184639
+Ref: 1653184898
+Ref: 1654184913
+Ref: 1655185299
+Ref: 1656185314
+Ref: 1657185820
+Ref: 1658185821
+Ref: 1659185868
+Ref: 1660186403
+Ref: 1661186404
+Ref: 1662186991
+Ref: 1663187221
+Ref: 1664187222
+Ref: 1665187412
+Ref: 1666187427
+Ref: 1667187783
+Ref: 1668187798
+Ref: 1669188264
+Ref: 1670188265
+Ref: 1671188661
+Ref: 1672188676
+Ref: 1673188997
+Ref: 1674189012
+Ref: 1675189468
+Ref: 1676189469
+Ref: 1677189914
+Ref: 1678189929
+Ref: 1679190112
+Ref: 1680190127
+Ref: 1681190295
+Ref: 1682190310
+Ref: 1683191569
+Ref: 1684191569
+Ref: 1685191937
+Node: 3.5.1193485
+Ref: 1686193596
+Ref: 1687193732
+Ref: S0038193732
+Ref: 1688193746
+Ref: 1689193783
+Ref: 1690193866
+Ref: S0039193866
+Ref: 1691193872
+Ref: 1692193894
+Ref: 1693193961
+Ref: S0040193961
+Ref: 1694193965
+Ref: 1695194220
+Ref: 1696194678
+Ref: 1697195016
+Ref: 1698195460
+Ref: 1699195460
+Ref: 1700195460
+Node: 3.5.2196748
+Ref: 1701196915
+Ref: 1702197041
+Ref: 1703197041
+Ref: 1704197041
+Ref: 1705197041
+Ref: 1706197720
+Ref: 1707197722
+Ref: 1708197728
+Ref: 1709197728
+Ref: 1710197728
+Ref: 1711198188
+Ref: 1712198188
+Node: 3.5.3199689
+Ref: 1713199852
+Ref: 1714199955
+Ref: 1715199957
+Ref: 1716200047
+Node: 3.5.4200124
+Ref: 1717200241
+Ref: 1718200241
+Ref: 1719200241
+Ref: 1720200623
+Ref: 1721200698
+Ref: S0041200698
+Ref: 1722200702
+Ref: 1723200736
+Ref: 1724200804
+Ref: S0042200804
+Ref: 1725200824
+Ref: 1726200860
+Ref: 1727200909
+Ref: S0043200909
+Ref: 1728200927
+Ref: 1729200990
+Ref: 1730201122
+Ref: 1731201416
+Ref: 1732201416
+Ref: 1733201416
+Ref: 1734202001
+Ref: 1735202202
+Ref: 1736202204
+Ref: 1737202409
+Ref: 1738202523
+Ref: 1739202525
+Ref: 1740202669
+Ref: 1741202833
+Ref: 1742202833
+Ref: 1743203044
+Ref: 1744203044
+Ref: 1745203044
+Ref: 1746203406
+Ref: 1747203408
+Ref: 1748203609
+Ref: 1749203761
+Ref: 1750203776
+Ref: 1751204083
+Ref: 1752204098
+Ref: 1753204255
+Ref: 1754204597
+Ref: 1755204597
+Ref: 1756204597
+Ref: 1757204786
+Ref: 1758204788
+Ref: 1759204788
+Ref: 1760204962
+Ref: 1761205056
+Ref: 1762205502
+Ref: 1763205502
+Ref: 1764206241
+Ref: 1765207081
+Ref: 1766207674
+Ref: 1767207997
+Ref: 1768208222
+Ref: 1769208222
+Node: 3.5.5209735
+Ref: 1770210005
+Ref: 1771210020
+Ref: 1772210344
+Ref: 1773210359
+Ref: 1774210539
+Ref: 1775210554
+Ref: 1776210664
+Ref: 1777210666
+Ref: 1778211056
+Ref: 1779211071
+Ref: 1780211264
+Ref: 1781211279
+Ref: 1782211946
+Ref: 1783212204
+Node: 3.5.6213811
+Ref: 1784213922
+Ref: 1785214151
+Ref: S0044214151
+Ref: 1786214164
+Ref: 1787214192
+Ref: 1788214264
+Ref: 1789214508
+Ref: 1790214508
+Ref: 1791214692
+Ref: 1792215004
+Ref: 1793215751
+Node: 3.5.7216989
+Ref: 1794217120
+Ref: 1795217342
+Ref: S0045217342
+Ref: 1796217370
+Ref: 1797217382
+Ref: 1798217440
+Ref: S0046217440
+Ref: 1799217467
+Ref: 1800217497
+Ref: 1801217567
+Ref: 1802217779
+Ref: 1803217839
+Ref: 1804218008
+Ref: 1805218225
+Ref: 1806218643
+Ref: 1807218795
+Ref: 1808218963
+Ref: 1809219099
+Ref: 1810219288
+Ref: 1811219423
+Ref: 1812219425
+Ref: 1813220040
+Ref: 1814220042
+Ref: 1815220310
+Ref: 1816220485
+Ref: 1817220643
+Ref: 1818220802
+Ref: 1819220967
+Ref: 1820220967
+Ref: 1821221750
+Node: 3.5.8222585
+Ref: 1822222875
+Ref: 1823222890
+Ref: 1824223445
+Node: 3.5.9224083
+Ref: 1825224209
+Ref: 1826224209
+Ref: 1827224209
+Ref: 1828224298
+Ref: 1829224488
+Ref: S0047224488
+Ref: 1830224492
+Ref: 1831224527
+Ref: 1832224603
+Ref: S0048224603
+Ref: 1833224631
+Ref: 1834224643
+Ref: 1835224706
+Ref: S0049224706
+Ref: 1836224734
+Ref: 1837224761
+Ref: 1838224773
+Ref: 1839224832
+Ref: S0050224832
+Ref: 1840224861
+Ref: 1841224880
+Ref: 1842224950
+Ref: 1843225154
+Ref: 1844225156
+Ref: 1845225156
+Ref: 1846225773
+Ref: 1847225888
+Ref: 1848226037
+Ref: 1849227012
+Ref: 1850227166
+Ref: 1851227458
+Ref: 1852227460
+Ref: 1853227762
+Ref: 1854227820
+Ref: 1855227989
+Ref: 1856227991
+Ref: 1857228242
+Ref: 1858228397
+Ref: 1859228749
+Ref: 1860229006
+Ref: 1861229105
+Ref: 1862229107
+Ref: 1863229347
+Node: 3.5.10231019
+Ref: 1864231290
+Ref: 1865231305
+Ref: 1866231426
+Ref: 1867231428
+Ref: 1868231677
+Ref: 1869231677
+Ref: 1870231689
+Ref: 1871231704
+Ref: 1872231863
+Ref: 1873231878
+Ref: 1874232429
+Ref: 1875232444
+Ref: 1876233046
+Ref: 1877233061
+Ref: 1878233390
+Ref: 1879234194
+Ref: 1880234209
+Ref: 1881234324
+Ref: 1882234576
+Ref: 1883234591
+Ref: 1884235273
+Node: 3.6235861
+Ref: 1885235962
+Ref: 1886235962
+Ref: 1887236332
+Ref: S0051236332
+Ref: 1888236345
+Ref: 1889236378
+Ref: 1890236445
+Ref: S0052236445
+Ref: 1891236464
+Ref: 1892236492
+Ref: 1893236522
+Ref: 1894236581
+Ref: S0053236581
+Ref: 1895236585
+Ref: 1896236644
+Ref: S0054236644
+Ref: 1897236664
+Ref: 1898236695
+Ref: 1899236734
+Ref: 1900236790
+Ref: S0055236790
+Ref: 1901236806
+Ref: 1902236827
+Ref: 1903236869
+Ref: S0056236869
+Ref: 1904236892
+Ref: 1905236929
+Ref: 1906236999
+Ref: 1907237329
+Ref: 1908237445
+Ref: 1909237497
+Ref: 1910237710
+Ref: 1911237710
+Ref: 1912237710
+Ref: 1913238325
+Ref: 1914238375
+Ref: 1915238437
+Ref: 1916238563
+Ref: 1917239036
+Ref: 1918239036
+Ref: 1919239288
+Ref: 1920239461
+Ref: 1921239461
+Ref: 1922239718
+Ref: 1923240244
+Ref: 1924240387
+Ref: 1925240669
+Ref: 1926240903
+Ref: 1927241268
+Ref: 1928241655
+Ref: 1929242180
+Ref: 1930242180
+Ref: 1931242596
+Node: 3.6.1244473
+Ref: 1932244830
+Ref: S0057244830
+Ref: 1933244837
+Ref: 1934244855
+Ref: 1935244894
+Ref: S0058244894
+Ref: 1936244910
+Ref: 1937244931
+Ref: 1938244989
+Ref: 1939245105
+Ref: 1940245634
+Ref: 1941245820
+Ref: 1942246023
+Ref: 1943246144
+Ref: 1944246291
+Ref: 1945246405
+Node: 3.6.2247796
+Ref: 1946248427
+Ref: 1947248442
+Ref: 1948248571
+Ref: 1949248586
+Ref: 1950248713
+Ref: 1951248728
+Ref: 1952248855
+Ref: 1953248870
+Ref: 1954248997
+Ref: 1955249012
+Ref: 1956249145
+Ref: 1957249160
+Ref: 1958249314
+Ref: 1959249329
+Ref: 1960249496
+Ref: 1961249511
+Ref: 1962250580
+Node: 3.6.3251679
+Ref: 1963251826
+Node: 3.7253341
+Ref: 1964253448
+Ref: 1965253448
+Ref: 1966253448
+Ref: 1967254012
+Ref: S0059254012
+Ref: 1968254016
+Ref: 1969254045
+Ref: 1970254108
+Ref: S0060254108
+Ref: 1971254149
+Ref: S0061254149
+Ref: 1972254163
+Ref: 1973254193
+Ref: 1974254258
+Ref: S0062254258
+Ref: 1975254271
+Ref: 1976254299
+Ref: 1977254315
+Ref: 1978254332
+Ref: 1979254366
+Ref: 1980254393
+Ref: 1981254415
+Ref: 1982254467
+Ref: S0063254467
+Ref: 1983254471
+Ref: 1984254535
+Ref: 1985254939
+Ref: 1986255209
+Ref: 1987255982
+Ref: 1988257145
+Ref: 1989257449
+Ref: 1990257637
+Ref: 1991257958
+Ref: 1992258706
+Ref: 1993258706
+Ref: 1994258706
+Ref: 1995258706
+Ref: 1996258827
+Ref: 1997258829
+Ref: 1998259192
+Ref: 1999259194
+Ref: 2000259636
+Node: 3.7.1261972
+Ref: 2001262269
+Ref: S0064262269
+Ref: 2002262283
+Ref: 2003262311
+Ref: 2004262370
+Ref: S0065262370
+Ref: 2005262399
+Ref: 2006262431
+Ref: 2007262456
+Ref: 2008262470
+Ref: 2009262581
+Ref: 2010262931
+Ref: 2011263019
+Ref: 2012263303
+Ref: 2013264066
+Ref: 2014264406
+Ref: 2015264581
+Ref: 2016264751
+Ref: 2017265105
+Node: 3.7.2265926
+Ref: 2018266622
+Ref: 2019266637
+Ref: 2020266839
+Node: 3.8267170
+Ref: 2021267273
+Ref: 2022267273
+Ref: 2023267436
+Ref: 2024267510
+Ref: S0066267510
+Ref: 2025267545
+Ref: 2026267594
+Ref: S0067267594
+Ref: 2027267627
+Ref: 2028267705
+Ref: S0068267705
+Ref: 2029267721
+Ref: 2030267737
+Ref: 2031267764
+Ref: 2032267780
+Ref: 2033267834
+Ref: S0069267834
+Ref: 2034267838
+Ref: 2035267863
+Ref: 2036267908
+Ref: S0070267908
+Ref: 2037267921
+Ref: 2038267948
+Ref: 2039267973
+Ref: 2040268013
+Ref: 2041268088
+Ref: 2042268284
+Ref: 2043269526
+Ref: 2044269864
+Ref: 2045269864
+Ref: 2046269988
+Ref: 2047270209
+Ref: 2048270533
+Ref: 2049270681
+Ref: 2050270785
+Ref: 2051270932
+Ref: 2052271040
+Ref: 2053271040
+Ref: 2054271040
+Ref: 2055271456
+Ref: 2056272368
+Ref: 2057273726
+Node: 3.8.1274717
+Ref: 2058275104
+Ref: S0071275104
+Ref: 2059275137
+Ref: 2060275164
+Ref: 2061275184
+Ref: 2062275226
+Ref: S0072275226
+Ref: 2063275244
+Ref: 2064275279
+Ref: 2065275322
+Ref: S0073275322
+Ref: 2066275326
+Ref: 2067275346
+Ref: 2068275388
+Ref: S0074275388
+Ref: 2069275392
+Ref: 2070275424
+Ref: 2071275451
+Ref: 2072275518
+Ref: 2073275737
+Ref: 2074276259
+Ref: 2075276983
+Ref: 2076278121
+Ref: 2077278121
+Ref: 2078279179
+Node: 3.9280116
+Ref: 2079280260
+Ref: 2080280260
+Ref: 2081280260
+Ref: 2082280260
+Ref: 2083280260
+Ref: 2084280421
+Ref: 2085280423
+Ref: 2086280423
+Ref: 2087280475
+Ref: 2088280876
+Ref: 2089280878
+Ref: 2090280980
+Ref: 2091280980
+Ref: 2092280980
+Ref: 2093281559
+Ref: 2094281896
+Ref: 2095281966
+Ref: 2096281968
+Ref: 2097281968
+Ref: 2098281968
+Ref: 2099282610
+Ref: 2100282674
+Ref: 2101282749
+Ref: 2102282827
+Ref: 2103282878
+Ref: 2104282934
+Ref: 2105283000
+Ref: 2106283076
+Ref: 2107283131
+Ref: 2108283200
+Ref: 2109283280
+Ref: 2110283390
+Ref: 2111283444
+Ref: 2112283516
+Ref: 2113283593
+Ref: 2114283638
+Ref: 2115286353
+Ref: 2116286959
+Ref: 2117287188
+Ref: 2118287203
+Ref: 2119287458
+Ref: 2120287473
+Ref: 2121287661
+Ref: 2122287676
+Ref: 2123288006
+Ref: 2124288021
+Ref: 2125288180
+Ref: 2126289025
+Ref: 2127289147
+Ref: 2128289285
+Ref: 2129289390
+Ref: 2130289515
+Ref: 2131289629
+Ref: 2132290520
+Ref: 2133292164
+Ref: 2134292164
+Node: 3.9.1292610
+Ref: 2135292719
+Ref: 2136292719
+Ref: 2137292719
+Ref: 2138292719
+Ref: 2139292719
+Ref: 2140292719
+Ref: 2141292952
+Ref: S0075292952
+Ref: 2142292962
+Ref: 2143293293
+Ref: 2144293721
+Ref: 2145293928
+Node: 3.9.2296506
+Ref: 2146296675
+Ref: 2147296675
+Ref: 2148296675
+Ref: 2149296675
+Ref: 2150296675
+Ref: 2151296675
+Ref: 2152296675
+Ref: 2153296675
+Ref: 2154297664
+Ref: 2155297666
+Ref: 2156297666
+Ref: 2157297666
+Ref: 2158297666
+Ref: 2159297718
+Ref: 2160297718
+Ref: 2161297836
+Ref: 2162298038
+Ref: 2163298293
+Ref: 2164298295
+Ref: 2165298728
+Ref: 2166298728
+Ref: 2167299267
+Ref: 2168299509
+Ref: 2169299740
+Ref: 2170301452
+Ref: 2171301579
+Ref: 2172302948
+Ref: 2173302948
+Ref: 2174303151
+Ref: 2175303505
+Ref: 2176303507
+Ref: 2177303631
+Ref: 2178304957
+Node: 3.9.3307688
+Ref: 2179307841
+Ref: 2180307841
+Ref: 2181307841
+Ref: 2182307841
+Ref: 2183307977
+Ref: 2184307979
+Ref: 2185308329
+Ref: S0076308329
+Ref: 2186308344
+Ref: 2187308375
+Ref: 2188308426
+Ref: 2189308502
+Ref: 2190308502
+Ref: 2191308894
+Ref: 2192308894
+Ref: 2193310059
+Ref: 2194312175
+Node: 3.9.4313731
+Ref: 2195314114
+Ref: S0077314114
+Ref: 2196314187
+Ref: 2197314233
+Ref: S0078314233
+Ref: 2198314250
+Ref: 2199314280
+Ref: 2200314400
+Ref: 2201314400
+Ref: 2202314720
+Ref: 2203314720
+Ref: 2204314721
+Ref: 2205314721
+Ref: 2206314721
+Ref: 2207314721
+Ref: 2208314721
+Ref: 2209314721
+Ref: 2210314721
+Ref: 2211314721
+Ref: 2212314845
+Ref: 2213314845
+Ref: 2214314845
+Ref: 2215314845
+Ref: 2216314845
+Ref: 2217314845
+Ref: 2218314845
+Ref: 2219315235
+Ref: 2220315235
+Ref: 2221316972
+Node: 3.10321340
+Ref: 2222321447
+Ref: 2223321447
+Ref: 2224321447
+Ref: 2225321745
+Ref: 2226321747
+Ref: 2227321821
+Ref: S0079321821
+Ref: 2228321836
+Ref: 2229321852
+Ref: 2230321890
+Ref: 2231321906
+Ref: 2232321973
+Ref: S0080321973
+Ref: 2233321995
+Ref: 2234322020
+Ref: 2235322070
+Ref: S0081322070
+Ref: 2236322129
+Ref: S0082322129
+Ref: 2237322172
+Ref: 2238322228
+Ref: 2239322283
+Ref: S0083322283
+Ref: 2240322324
+Ref: S0084322324
+Ref: 2241322339
+Ref: 2242322373
+Ref: 2243322396
+Ref: 2244322441
+Ref: 2245322469
+Ref: 2246322513
+Ref: 2247322599
+Ref: 2248322599
+Ref: 2249322599
+Ref: 2250322599
+Ref: 2251322763
+Ref: 2252322943
+Ref: 2253323166
+Ref: 2254323166
+Ref: 2255323539
+Ref: 2256324345
+Ref: 2257324346
+Ref: 2258324550
+Ref: 2259324715
+Ref: 2260325068
+Ref: 2261325162
+Ref: 2262325269
+Ref: 2263325612
+Ref: 2264325612
+Ref: 2265325612
+Ref: 2266326113
+Ref: 2267326120
+Ref: 2268326859
+Ref: 2269327399
+Ref: 2270327399
+Ref: 2271328237
+Ref: 2272328445
+Ref: 2273328738
+Ref: 2274328974
+Node: 3.10.1330811
+Ref: 2275331459
+Ref: S0085331459
+Ref: 2276331469
+Ref: 2277331490
+Ref: 2278331581
+Ref: 2279331581
+Ref: 2280331875
+Ref: 2281331875
+Ref: 2282333041
+Ref: 2283334434
+Ref: 2284337056
+Ref: 2285337146
+Node: 3.10.2339022
+Ref: 2286339459
+Ref: 2287340037
+Ref: 2288340039
+Ref: 2289340217
+Ref: 2290340217
+Ref: 2291340217
+Ref: 2292340217
+Ref: 2293340217
+Ref: 2294340217
+Ref: 2295341151
+Ref: 2296341151
+Ref: 2297343378
+Ref: 2298343378
+Ref: 2299343378
+Ref: 2300348773
+Ref: 2301350009
+Ref: 2302351721
+Ref: 2303351721
+Ref: 2304354579
+Ref: 2305354579
+Ref: 2306354860
+Ref: 2307354875
+Ref: 2308355129
+Ref: 2309356706
+Ref: 2310357122
+Ref: 2311357361
+Ref: 2312357366
+Ref: 2313357381
+Ref: 2314357381
+Ref: 2315357560
+Ref: 2316357982
+Ref: 2317357997
+Ref: 2318358214
+Ref: 2319358308
+Ref: 2320358653
+Ref: 2321359266
+Ref: 2322359266
+Ref: 2323360530
+Ref: 2324360887
+Ref: 2325361419
+Ref: 2326361419
+Node: 3.11362771
+Ref: 2327363004
+Ref: S0086363004
+Ref: 2328363010
+Ref: 2329363052
+Ref: S0087363052
+Ref: 2330363066
+Ref: 2331363091
+Ref: 2332363128
+Ref: S0088363128
+Ref: 2333363142
+Ref: 2334363162
+Ref: 2335363178
+Ref: 2336363201
+Ref: S0089363201
+Ref: 2337363205
+Ref: 2338363220
+Ref: 2339363249
+Ref: S0090363249
+Ref: 2340363263
+Ref: 2341363281
+Ref: 2342363296
+Ref: 2343363308
+Ref: 2344363485
+Ref: 2345363536
+Ref: 2346363701
+Ref: 2347363849
+Ref: 2348363849
+Ref: 2349364197
+Ref: 2350364545
+Ref: 2351365198
+Ref: 2352365203
+Node: 3.11.1365324
+Ref: 2353365488
+Ref: 2354365564
+Ref: 2355365716
+Ref: 2356366460
+Ref: 2357366565
+Ref: 2358366903
+Node: 4367884
+Node: 4.1368418
+Ref: 2359368975
+Ref: S0091368975
+Ref: 2360368990
+Ref: 2361369006
+Ref: 2362369037
+Ref: 2363369059
+Ref: 2364369075
+Ref: 2365369098
+Ref: 2366369128
+Ref: 2367369148
+Ref: 2368369172
+Ref: 2369369194
+Ref: 2370369225
+Ref: 2371369251
+Ref: 2372369291
+Ref: S0092369291
+Ref: 2373369295
+Ref: 2374369309
+Ref: 2375369339
+Ref: S0093369339
+Ref: 2376369343
+Ref: 2377369351
+Ref: 2378369400
+Ref: S0094369400
+Ref: 2379369404
+Ref: 2380369442
+Ref: S0095369442
+Ref: 2381369446
+Ref: 2382369770
+Ref: 2383369770
+Ref: 2384369947
+Ref: 2385370502
+Ref: 2386370751
+Ref: 2387370916
+Ref: 2388370997
+Ref: 2389371178
+Ref: 2390371343
+Ref: 2391371345
+Ref: 2392371417
+Node: 4.1.1372665
+Ref: 2393372873
+Ref: 2394372942
+Ref: S0096372942
+Ref: 2395372946
+Ref: 2396372954
+Ref: 2397372968
+Ref: 2398373347
+Ref: 2399373592
+Ref: 2400373880
+Ref: 2401373991
+Ref: 2402374067
+Ref: 2403374069
+Ref: 2404374069
+Ref: 2405374199
+Node: 4.1.2375328
+Ref: 2406375431
+Ref: 2407375706
+Ref: S0097375706
+Ref: 2408375710
+Ref: 2409375718
+Ref: 2410375893
+Ref: 2411376386
+Ref: 2412376487
+Ref: 2413376487
+Ref: 2414376489
+Ref: 2415376489
+Ref: 2416376696
+Node: 4.1.3377824
+Ref: 2417378138
+Ref: 2418378208
+Ref: S0098378208
+Ref: 2419378212
+Ref: 2420378222
+Ref: 2421378257
+Ref: S0099378257
+Ref: 2422378261
+Ref: 2423378275
+Ref: 2424378295
+Ref: 2425378363
+Ref: 2426381026
+Ref: 2427381031
+Ref: 2428382810
+Ref: 2429382892
+Ref: 2430382892
+Ref: 2431383084
+Ref: 2432383086
+Node: 4.1.4384633
+Ref: 2433384744
+Ref: 2434384983
+Ref: S0100384983
+Ref: 2435384987
+Ref: 2436384995
+Ref: 2437385046
+Ref: S0101385046
+Ref: 2438385060
+Ref: 2439385081
+Ref: 2440385166
+Ref: S0102385166
+Ref: 2441385170
+Ref: 2442385178
+Ref: 2443385239
+Ref: S0103385239
+Ref: 2444385260
+Ref: 2445386025
+Ref: 2446386025
+Ref: 2447387527
+Ref: 2448387527
+Ref: 2449388644
+Node: 4.1.5389430
+Ref: 2450389864
+Ref: 2451389864
+Ref: 2452389956
+Ref: 2453390012
+Ref: 2454390146
+Ref: 2455390393
+Ref: S0104390393
+Ref: 2456390417
+Ref: 2457390575
+Ref: 2458391491
+Ref: 2459391710
+Ref: 2460391712
+Ref: 2461391802
+Node: 4.1.6392701
+Ref: 2462393423
+Ref: 2463393423
+Ref: 2464394060
+Ref: 2465394060
+Ref: 2466394305
+Ref: 2467394383
+Ref: 2468394734
+Ref: S0105394734
+Ref: 2469394768
+Ref: 2470394775
+Ref: 2471394978
+Ref: 2472395217
+Ref: 2473395217
+Ref: 2474395618
+Ref: 2475395618
+Node: 4.2397165
+Ref: 2476397260
+Ref: 2477397451
+Ref: 2478397541
+Ref: 2479397541
+Ref: 2480398121
+Ref: 2481398826
+Ref: 2482398826
+Ref: 2483398826
+Ref: 2484398877
+Ref: 2485398877
+Ref: 2486398877
+Ref: 2487398877
+Ref: 2488398969
+Ref: 2489399384
+Ref: 2490399384
+Ref: 2491399699
+Node: 4.3400334
+Ref: 2492400433
+Ref: 2493400548
+Ref: 2494400609
+Ref: S0106400609
+Ref: 2495400613
+Ref: 2496400633
+Ref: 2497400655
+Ref: 2498400731
+Ref: 2499400976
+Ref: 2500401265
+Ref: 2501401336
+Ref: 2502401397
+Ref: 2503401397
+Ref: 2504401506
+Node: 4.3.1401665
+Ref: 2505401995
+Ref: S0107401995
+Ref: 2506402001
+Ref: 2507402077
+Ref: S0108402077
+Ref: 2508402091
+Ref: 2509402123
+Ref: 2510402212
+Ref: S0109402212
+Ref: 2511402227
+Ref: 2512402253
+Ref: 2513402274
+Ref: 2514402331
+Ref: S0110402331
+Ref: 2515402358
+Ref: 2516402387
+Ref: 2517402422
+Ref: 2518402554
+Ref: 2519403058
+Ref: 2520403153
+Ref: 2521403669
+Ref: 2522403807
+Ref: 2523405678
+Ref: 2524405810
+Ref: 2525406091
+Ref: 2526406471
+Node: 4.3.2408407
+Ref: 2527408828
+Ref: S0111408828
+Ref: 2528408843
+Ref: 2529408862
+Ref: 2530408918
+Ref: S0112408918
+Ref: 2531408922
+Ref: 2532408936
+Ref: 2533409003
+Ref: 2534409098
+Ref: 2535409502
+Ref: 2536410239
+Ref: 2537410725
+Ref: 2538411338
+Ref: 2539411344
+Ref: 2540411344
+Ref: 2541411782
+Node: 4.3.3412727
+Ref: 2542413275
+Ref: S0113413275
+Ref: 2543413287
+Ref: 2544413316
+Ref: 2545413374
+Ref: S0114413374
+Ref: 2546413389
+Ref: 2547413401
+Ref: 2548413415
+Ref: 2549413438
+Ref: 2550413452
+Ref: 2551413475
+Ref: 2552413497
+Ref: 2553413511
+Ref: 2554413567
+Ref: S0115413567
+Ref: 2555413582
+Ref: 2556413613
+Ref: 2557413680
+Ref: S0116413680
+Ref: 2558413694
+Ref: 2559413718
+Ref: 2560413738
+Ref: 2561413768
+Ref: 2562413918
+Ref: 2563414110
+Ref: 2564414363
+Ref: 2565414462
+Ref: 2566414586
+Ref: 2567414725
+Ref: 2568415255
+Ref: 2569418637
+Ref: 2570418889
+Ref: 2571418889
+Ref: 2572419157
+Ref: 2573419159
+Ref: 2574419582
+Ref: 2575420443
+Ref: 2576420443
+Ref: 2577420584
+Ref: 2578420584
+Ref: 2579420773
+Ref: 2580420773
+Ref: 2581420912
+Node: 4.4423061
+Ref: 2582423164
+Ref: 2583423534
+Ref: 2584423536
+Ref: 2585423536
+Ref: 2586423536
+Ref: 2587423536
+Ref: 2588423536
+Ref: 2589423536
+Ref: 2590423536
+Ref: 2591423536
+Ref: 2592423536
+Ref: 2593423536
+Ref: 2594423536
+Ref: 2595423536
+Ref: 2596423536
+Ref: 2597423536
+Ref: 2598423536
+Ref: 2599423536
+Ref: 2600423536
+Ref: 2601423536
+Ref: 2602423536
+Ref: 2603423536
+Ref: 2604423536
+Ref: 2605423536
+Ref: 2606423536
+Ref: 2607423536
+Ref: 2608423536
+Ref: 2609423536
+Ref: 2610423536
+Ref: 2611423536
+Ref: 2612423536
+Ref: 2613423536
+Ref: 2614423536
+Ref: 2615423536
+Ref: 2616423536
+Ref: 2617423536
+Ref: 2618423536
+Ref: 2619423536
+Ref: 2620423536
+Ref: 2621423536
+Ref: 2622423536
+Ref: 2623423536
+Ref: 2624423536
+Ref: 2625423536
+Ref: 2626423536
+Ref: 2627423536
+Ref: 2628423536
+Ref: 2629423536
+Ref: 2630423536
+Ref: 2631423536
+Ref: 2632423536
+Ref: 2633423536
+Ref: 2634423536
+Ref: 2635423536
+Ref: 2636423536
+Ref: 2637423536
+Ref: 2638423536
+Ref: 2639423536
+Ref: 2640423536
+Ref: 2641423536
+Ref: 2642423536
+Ref: 2643423536
+Ref: 2644423536
+Ref: 2645423536
+Ref: 2646423536
+Ref: 2647423536
+Ref: 2648423536
+Ref: 2649423536
+Ref: 2650423536
+Ref: 2651423536
+Ref: 2652423536
+Ref: 2653423536
+Ref: 2654423536
+Ref: 2655423596
+Ref: S0117423596
+Ref: 2656423611
+Ref: 2657423625
+Ref: 2658423640
+Ref: 2659423659
+Ref: 2660423679
+Ref: 2661423692
+Ref: 2662423707
+Ref: 2663423725
+Ref: 2664423745
+Ref: 2665423759
+Ref: 2666423798
+Ref: S0118423798
+Ref: 2667423813
+Ref: 2668423834
+Ref: 2669423861
+Ref: 2670423881
+Ref: 2671423908
+Ref: 2672423929
+Ref: 2673423956
+Ref: 2674423982
+Ref: 2675424009
+Ref: 2676424034
+Ref: 2677424078
+Ref: S0119424078
+Ref: 2678424093
+Ref: 2679424112
+Ref: 2680424132
+Ref: 2681424169
+Ref: S0120424169
+Ref: 2682424184
+Ref: 2683424203
+Ref: 2684424223
+Ref: 2685424261
+Ref: 2686424288
+Ref: 2687424321
+Ref: 2688424372
+Ref: S0121424372
+Ref: 2689424376
+Ref: 2690424398
+Ref: 2691424446
+Ref: S0122424446
+Ref: 2692424460
+Ref: 2693424480
+Ref: 2694424488
+Ref: 2695424532
+Ref: S0123424532
+Ref: 2696424538
+Ref: 2697424561
+Ref: 2698424567
+Ref: 2699424596
+Ref: 2700424614
+Ref: S0124424614
+Ref: 2701424618
+Ref: 2702424627
+Ref: 2703424648
+Ref: 2704424670
+Ref: S0125424670
+Ref: 2705424674
+Ref: 2706424687
+Ref: 2707424702
+Ref: 2708424716
+Ref: 2709424741
+Ref: S0126424741
+Ref: 2710424754
+Ref: 2711424779
+Ref: 2712424796
+Ref: 2713424814
+Ref: 2714424821
+Ref: 2715424834
+Ref: 2716424855
+Ref: 2717424882
+Ref: 2718425223
+Ref: 2719425363
+Ref: 2720425363
+Ref: 2721425363
+Node: 4.5426860
+Ref: 2722427009
+Ref: 2723427009
+Ref: 2724427375
+Ref: S0127427375
+Ref: 2725427427
+Ref: S0128427427
+Ref: 2726427496
+Ref: S0129427496
+Ref: 2727427548
+Ref: S0130427548
+Ref: 2728427593
+Ref: S0131427593
+Ref: 2729427659
+Ref: S0132427659
+Ref: 2730427937
+Ref: 2731427937
+Ref: 2732428096
+Ref: 2733428098
+Ref: 2734428098
+Ref: 2735428098
+Ref: 2736428666
+Ref: 2737429047
+Ref: 2738429244
+Node: 4.5.1430964
+Ref: 2739431188
+Ref: 2740431188
+Ref: 2741431188
+Ref: 2742431337
+Ref: 2743431451
+Ref: 2744431451
+Ref: 2745431451
+Ref: 2746431451
+Ref: 2747431451
+Ref: 2748431451
+Ref: 2749431451
+Ref: 2750431451
+Ref: 2751431638
+Ref: 2752432714
+Ref: 2753433017
+Ref: 2754433017
+Ref: 2755433181
+Ref: 2756433183
+Ref: 2757433272
+Node: 4.5.2434100
+Ref: 2758434273
+Ref: 2759434273
+Ref: 2760434273
+Ref: 2761434273
+Ref: 2762434273
+Ref: 2763434365
+Ref: 2764434367
+Ref: 2765434516
+Ref: 2766434518
+Ref: 2767434518
+Ref: 2768434518
+Ref: 2769434518
+Ref: 2770434518
+Ref: 2771434518
+Ref: 2772434518
+Ref: 2773434518
+Ref: 2774434518
+Ref: 2775434518
+Ref: 2776434518
+Ref: 2777434518
+Ref: 2778434518
+Ref: 2779434518
+Ref: 2780434518
+Ref: 2781434518
+Ref: 2782434518
+Ref: 2783434518
+Ref: 2784434518
+Ref: 2785434518
+Ref: 2786434518
+Ref: 2787434518
+Ref: 2788434518
+Ref: 2789434518
+Ref: 2790434689
+Ref: 2791434689
+Ref: 2792434689
+Ref: 2793435086
+Ref: 2794435086
+Ref: 2795438936
+Ref: 2796439917
+Ref: 2797440100
+Ref: 2798440813
+Ref: 2799442801
+Ref: 2800442904
+Ref: 2801443695
+Ref: 2802443702
+Ref: 2803443991
+Ref: 2804445135
+Node: 4.5.3448100
+Ref: 2805448283
+Ref: 2806448283
+Ref: 2807448283
+Ref: 2808448283
+Ref: 2809448283
+Ref: 2810448283
+Ref: 2811448283
+Ref: 2812448283
+Ref: 2813448283
+Ref: 2814448283
+Ref: 2815448571
+Ref: 2816448571
+Ref: 2817448571
+Ref: 2818448571
+Ref: 2819448571
+Ref: 2820448571
+Ref: 2821448571
+Ref: 2822449004
+Ref: 2823449902
+Ref: 2824449904
+Ref: 2825450053
+Ref: 2826450422
+Ref: 2827450429
+Node: 4.5.4451181
+Ref: 2828451362
+Ref: 2829451362
+Ref: 2830451362
+Ref: 2831451362
+Ref: 2832451362
+Ref: 2833451362
+Ref: 2834451362
+Ref: 2835451362
+Ref: 2836451362
+Ref: 2837451362
+Node: 4.5.5451873
+Ref: 2838452052
+Ref: 2839452052
+Ref: 2840452052
+Ref: 2841452052
+Ref: 2842452052
+Ref: 2843452052
+Ref: 2844452052
+Ref: 2845452052
+Ref: 2846452052
+Ref: 2847452052
+Ref: 2848452052
+Ref: 2849452052
+Ref: 2850452052
+Ref: 2851452052
+Ref: 2852452052
+Ref: 2853452052
+Ref: 2854456421
+Ref: 2855456428
+Ref: 2856456428
+Ref: 2857456428
+Node: 4.5.6459323
+Ref: 2858459516
+Ref: 2859459516
+Ref: 2860459516
+Ref: 2861459516
+Ref: 2862459516
+Ref: 2863459710
+Ref: 2864459710
+Ref: 2865459710
+Ref: 2866460596
+Ref: 2867460598
+Ref: 2868460598
+Ref: 2869460747
+Ref: 2870460747
+Ref: 2871460747
+Ref: 2872460747
+Ref: 2873461207
+Ref: 2874461722
+Ref: 2875462118
+Ref: 2876462118
+Ref: 2877462261
+Node: 4.5.7462312
+Ref: 2878463079
+Ref: S0133463079
+Ref: 2879463083
+Ref: 2880463100
+Ref: 2881463139
+Ref: S0134463139
+Ref: 2882463155
+Ref: 2883463182
+Ref: 2884463208
+Ref: 2885463235
+Ref: 2886463273
+Ref: 2887463304
+Ref: S0135463304
+Ref: 2888463319
+Ref: 2889463355
+Ref: S0136463355
+Ref: 2890463386
+Ref: 2891463409
+Ref: 2892463449
+Ref: 2893463515
+Ref: S0137463515
+Ref: 2894463534
+Ref: 2895463583
+Ref: 2896464301
+Ref: 2897465026
+Ref: 2898465202
+Ref: 2899465202
+Ref: 2900465204
+Ref: 2901466715
+Ref: 2902467117
+Ref: 2903467117
+Ref: 2904467117
+Ref: 2905467257
+Node: 4.5.8467259
+Ref: 2906467582
+Ref: S0138467582
+Ref: 2907467591
+Ref: 2908467602
+Ref: 2909467640
+Ref: 2910467663
+Ref: 2911467674
+Ref: 2912467700
+Ref: 2913467730
+Ref: S0139467730
+Ref: 2914467765
+Ref: S0140467765
+Ref: 2915467780
+Ref: 2916468032
+Ref: 2917468175
+Ref: 2918468587
+Node: 4.6469788
+Ref: 2919470192
+Ref: 2920470194
+Ref: 2921470194
+Ref: 2922470194
+Ref: 2923470194
+Ref: 2924470194
+Ref: 2925470259
+Ref: S0141470259
+Ref: 2926470273
+Ref: 2927470286
+Ref: 2928470307
+Ref: 2929470320
+Ref: 2930470329
+Ref: 2931470414
+Ref: 2932470500
+Ref: 2933470538
+Ref: 2934470793
+Ref: 2935470793
+Ref: 2936471006
+Ref: 2937471006
+Ref: 2938471060
+Ref: 2939471115
+Ref: 2940471538
+Ref: 2941471538
+Ref: 2942471759
+Ref: 2943471759
+Ref: 2944472367
+Ref: 2945472367
+Ref: 2946472470
+Ref: 2947472470
+Ref: 2948472707
+Ref: 2949472778
+Ref: 2950472993
+Ref: 2951473492
+Ref: 2952473492
+Ref: 2953474020
+Ref: 2954474242
+Ref: 2955474514
+Ref: 2956474988
+Ref: 2957474988
+Ref: 2958475119
+Ref: 2959475119
+Ref: 2960475397
+Ref: 2961475424
+Ref: 2962475698
+Ref: 2963476285
+Ref: 2964476400
+Ref: 2965476400
+Ref: 2966476400
+Ref: 2967476597
+Ref: 2968476599
+Ref: 2969476599
+Ref: 2970476874
+Ref: 2971476874
+Ref: 2972477390
+Ref: 2973477916
+Ref: 2974477916
+Ref: 2975478090
+Ref: 2976478090
+Ref: 2977478131
+Ref: 2978478131
+Ref: 2979478478
+Ref: 2980478478
+Ref: 2981478727
+Ref: 2982479317
+Ref: 2983479319
+Ref: 2984479329
+Ref: 2985479329
+Ref: 2986479579
+Ref: 2987479581
+Ref: 2988480007
+Ref: 2989480008
+Ref: 2990480658
+Ref: 2991480658
+Ref: 2992480981
+Ref: 2993480981
+Ref: 2994481097
+Ref: 2995481097
+Ref: 2996481788
+Ref: 2997481790
+Ref: 2998482322
+Ref: 2999482322
+Ref: 3000482322
+Ref: 3001482322
+Ref: 3002482322
+Ref: 3003482322
+Ref: 3004482322
+Ref: 3005482322
+Ref: 3006482720
+Ref: 3007482720
+Ref: 3008482725
+Ref: 3009482891
+Ref: 3010482892
+Ref: 3011482892
+Ref: 3012482892
+Ref: 3013482892
+Ref: 3014482892
+Ref: 3015483897
+Ref: 3016484409
+Ref: 3017484418
+Ref: 3018484418
+Ref: 3019484418
+Ref: 3020485464
+Ref: 3021485593
+Ref: 3022486166
+Ref: 3023486171
+Node: 4.7488103
+Ref: 3024488371
+Ref: 3025488443
+Ref: S0142488443
+Ref: 3026488456
+Ref: 3027488470
+Ref: 3028488484
+Ref: 3029488497
+Ref: 3030488559
+Ref: 3031489046
+Ref: 3032489046
+Ref: 3033489046
+Ref: 3034489046
+Ref: 3035489046
+Ref: 3036489046
+Ref: 3037489046
+Ref: 3038489271
+Ref: 3039489273
+Node: 4.8490530
+Ref: 3040490732
+Ref: 3041490734
+Ref: 3042490734
+Ref: 3043490795
+Ref: S0143490795
+Ref: 3044490813
+Ref: 3045490836
+Ref: 3046490868
+Ref: 3047490891
+Ref: 3048490945
+Ref: S0144490945
+Ref: 3049490968
+Ref: 3050491148
+Ref: 3051491685
+Ref: 3052491734
+Ref: 3053491805
+Ref: 3054492102
+Ref: 3055493337
+Ref: 3056494040
+Ref: 3057494095
+Ref: 3058494205
+Ref: 3059494207
+Ref: 3060494359
+Ref: 3061494365
+Ref: 3062494494
+Ref: 3063494942
+Ref: 3064494944
+Ref: 3065494944
+Ref: 3066494944
+Ref: 3067495028
+Ref: 3068495173
+Ref: 3069495905
+Ref: 3070495905
+Ref: 3071495905
+Ref: 3072496121
+Ref: 3073496121
+Ref: 3074496121
+Ref: 3075496359
+Ref: 3076496359
+Ref: 3077496359
+Ref: 3078496615
+Ref: 3079496615
+Ref: 3080496615
+Ref: 3081496615
+Ref: 3082496615
+Ref: 3083496617
+Ref: 3084496835
+Ref: 3085497525
+Node: 4.9498705
+Ref: 3086499055
+Ref: 3087499166
+Ref: 3088499172
+Ref: 3089500860
+Ref: 3090501266
+Ref: 3091501814
+Ref: 3092502191
+Ref: 3093502344
+Ref: 3094502626
+Ref: 3095502710
+Ref: 3096502929
+Ref: 3097503380
+Ref: 3098503501
+Ref: 3099503501
+Ref: 3100503501
+Ref: 3101503604
+Ref: 3102503748
+Ref: 3103504003
+Ref: 3104504332
+Ref: 3105506403
+Node: 4.9.1508537
+Ref: 3106508736
+Ref: 3107509245
+Ref: 3108509855
+Ref: 3109510018
+Ref: 3110510208
+Ref: 3111510383
+Node: 5511202
+Node: 5.1512427
+Ref: 3112512853
+Ref: S0145512853
+Ref: 3113512857
+Ref: 3114512869
+Ref: 3115512881
+Ref: 3116512905
+Ref: S0146512905
+Ref: 3117512919
+Ref: 3118512926
+Ref: 3119512946
+Ref: 3120512953
+Ref: 3121512998
+Ref: S0147512998
+Ref: 3122513002
+Ref: 3123513028
+Ref: 3124513053
+Ref: 3125513078
+Ref: 3126513097
+Ref: 3127513132
+Ref: 3128513160
+Ref: 3129513191
+Ref: 3130513213
+Ref: 3131513239
+Ref: 3132513259
+Ref: 3133513285
+Ref: 3134513328
+Ref: S0148513328
+Ref: 3135513343
+Ref: 3136513360
+Ref: 3137513385
+Ref: 3138513404
+Ref: 3139513430
+Ref: 3140513466
+Ref: 3141513487
+Ref: 3142513526
+Ref: S0149513526
+Ref: 3143513550
+Ref: S0150513550
+Ref: 3144513565
+Ref: 3145513616
+Ref: S0151513616
+Ref: 3146513620
+Ref: 3147514841
+Ref: 3148514896
+Ref: 3149515386
+Node: 5.2516249
+Ref: 3150516549
+Ref: S0152516549
+Ref: 3151516573
+Ref: 3152516581
+Ref: 3153516749
+Ref: 3154516751
+Ref: 3155516937
+Ref: 3156516937
+Ref: 3157517199
+Ref: 3158517276
+Ref: 3159517699
+Ref: 3160517826
+Ref: 3161517881
+Ref: 3162518036
+Ref: 3163518036
+Ref: 3164518036
+Ref: 3165518373
+Ref: 3166518594
+Ref: 3167518594
+Ref: 3168518901
+Node: 5.3520443
+Ref: 3169520772
+Ref: S0153520772
+Ref: 3170520789
+Ref: 3171520815
+Ref: 3172520853
+Ref: 3173520879
+Ref: 3174520928
+Ref: 3175521057
+Node: 5.4521953
+Ref: 3176522287
+Ref: S0154522287
+Ref: 3177522317
+Ref: 3178522343
+Ref: 3179522382
+Ref: 3180522462
+Ref: S0155522462
+Ref: 3181522480
+Ref: 3182522515
+Ref: 3183522592
+Ref: 3184522592
+Ref: 3185522658
+Ref: 3186524073
+Ref: 3187524413
+Ref: 3188524413
+Ref: 3189524413
+Node: 5.5525593
+Ref: 3190525871
+Ref: S0156525871
+Ref: 3191525892
+Ref: 3192525927
+Ref: 3193525964
+Ref: 3194526016
+Ref: 3195526055
+Ref: S0157526055
+Ref: 3196526066
+Ref: 3197526090
+Ref: 3198526133
+Ref: 3199526192
+Ref: S0158526192
+Ref: 3200526205
+Ref: 3201526238
+Ref: 3202526510
+Ref: 3203526655
+Ref: 3204526705
+Ref: 3205527022
+Ref: 3206527374
+Ref: 3207527374
+Ref: 3208528119
+Node: 5.5.1530363
+Ref: 3209530610
+Ref: 3210530815
+Ref: 3211530871
+Ref: 3212530949
+Ref: 3213531057
+Ref: 3214531137
+Ref: 3215531217
+Ref: 3216531479
+Ref: 3217531615
+Ref: 3218531671
+Ref: 3219531747
+Ref: 3220531887
+Ref: 3221532585
+Ref: 3222532663
+Ref: 3223532797
+Ref: 3224532797
+Ref: 3225532797
+Ref: 3226532956
+Ref: 3227532956
+Ref: 3228532956
+Ref: 3229533168
+Ref: 3230533303
+Ref: 3231533379
+Ref: 3232533475
+Ref: 3233534298
+Ref: 3234534923
+Node: 5.5.2534925
+Ref: 3235535208
+Ref: S0159535208
+Ref: 3236535222
+Ref: 3237535266
+Ref: 3238535280
+Ref: 3239535303
+Ref: 3240535353
+Ref: 3241535490
+Ref: 3242535490
+Ref: 3243535554
+Ref: 3244535685
+Ref: 3245535802
+Ref: 3246535802
+Ref: 3247535857
+Ref: 3248535857
+Ref: 3249535997
+Ref: 3250535997
+Ref: 3251536035
+Ref: 3252536035
+Ref: 3253537672
+Ref: 3254539118
+Ref: 3255540037
+Ref: 3256540302
+Ref: 3257541174
+Ref: 3258541346
+Ref: 3259541419
+Node: 5.6543190
+Ref: 3260543468
+Ref: S0160543468
+Ref: 3261543490
+Ref: 3262543551
+Ref: 3263543605
+Ref: 3264543662
+Ref: 3265544057
+Node: 5.7544439
+Ref: 3266544769
+Ref: S0161544769
+Ref: 3267544795
+Ref: 3268544807
+Ref: 3269545007
+Ref: 3270545796
+Node: 5.8546657
+Ref: 3271546938
+Ref: S0162546938
+Ref: 3272546956
+Ref: 3273547014
+Ref: 3274547483
+Node: 6548361
+Ref: 3275548454
+Ref: 3276548454
+Ref: 3277548454
+Ref: 3278548917
+Ref: 3279548978
+Ref: 3280549063
+Node: 6.1549498
+Ref: 3281549743
+Ref: S0163549743
+Ref: 3282549758
+Ref: 3283549789
+Ref: 3284549828
+Ref: 3285549925
+Ref: S0164549925
+Ref: 3286549939
+Ref: 3287549972
+Ref: 3288550030
+Ref: S0165550030
+Ref: 3289550045
+Ref: 3290550072
+Ref: 3291550130
+Ref: S0166550130
+Ref: 3292550144
+Ref: 3293550164
+Ref: 3294550217
+Ref: S0167550217
+Ref: 3295550223
+Ref: 3296550243
+Ref: 3297550256
+Ref: 3298550299
+Ref: S0168550299
+Ref: 3299550303
+Ref: 3300550333
+Ref: 3301550398
+Ref: S0169550398
+Ref: 3302550404
+Ref: 3303550424
+Ref: 3304550572
+Ref: S0170550572
+Ref: 3305550576
+Ref: 3306550881
+Ref: S0171550881
+Ref: 3307550885
+Ref: 3308550928
+Ref: S0172550928
+Ref: 3309550934
+Ref: 3310550986
+Ref: S0173550986
+Ref: 3311551001
+Ref: 3312551022
+Ref: 3313551038
+Ref: 3314551061
+Ref: 3315551081
+Ref: 3316551119
+Ref: S0174551119
+Ref: 3317551133
+Ref: 3318551160
+Ref: 3319551220
+Ref: S0175551220
+Ref: 3320551234
+Ref: 3321551271
+Ref: 3322551277
+Ref: 3323551293
+Ref: 3324551316
+Ref: 3325551345
+Ref: 3326551372
+Ref: 3327551394
+Ref: 3328551433
+Ref: S0176551433
+Ref: 3329551511
+Ref: 3330551704
+Ref: 3331551816
+Ref: 3332551870
+Ref: 3333552205
+Ref: 3334552205
+Ref: 3335552858
+Ref: 3336553490
+Ref: 3337553874
+Ref: 3338553885
+Ref: 3339553885
+Ref: 3340554013
+Ref: 3341554094
+Ref: 3342554521
+Ref: 3343555238
+Ref: 3344556094
+Node: 6.1.1558053
+Ref: 3345558561
+Ref: 3346558561
+Ref: 3347558724
+Ref: 3348558724
+Ref: 3349558989
+Ref: 3350558989
+Ref: 3351559218
+Ref: 3352559218
+Ref: 3353559429
+Ref: 3354559429
+Ref: 3355559593
+Ref: 3356559593
+Ref: 3357559861
+Ref: 3358559861
+Ref: 3359560012
+Ref: 3360560012
+Ref: 3361560152
+Ref: 3362560152
+Ref: 3363562110
+Ref: 3364562742
+Ref: 3365563298
+Ref: 3366563298
+Ref: 3367564036
+Ref: 3368564036
+Ref: 3369564106
+Ref: 3370564548
+Ref: 3371564563
+Ref: 3372566808
+Ref: 3373566823
+Ref: 3374568158
+Ref: 3375568158
+Ref: 3376568158
+Ref: 3377568457
+Ref: 3378568457
+Ref: 3379568457
+Ref: 3380569027
+Ref: 3381569027
+Ref: 3382569780
+Ref: 3383569780
+Ref: 3384569780
+Ref: 3385569780
+Ref: 3386569780
+Node: 6.2572713
+Ref: 3387572967
+Ref: 3388572967
+Ref: 3389572967
+Ref: 3390572967
+Ref: 3391572967
+Ref: 3392572967
+Ref: 3393573458
+Ref: 3394573696
+Ref: 3395574124
+Ref: 3396574607
+Ref: 3397574761
+Ref: 3398574761
+Ref: 3399574761
+Ref: 3400574761
+Ref: 3401575431
+Node: 6.3576001
+Ref: 3402576239
+Ref: S0177576239
+Ref: 3403576254
+Ref: 3404576285
+Ref: 3405576323
+Ref: 3406576360
+Ref: 3407576405
+Ref: 3408576450
+Ref: 3409577033
+Ref: 3410577286
+Ref: 3411577461
+Node: 6.3.1578402
+Ref: 3412578513
+Ref: 3413578513
+Ref: 3414578513
+Ref: 3415578513
+Ref: 3416578513
+Ref: 3417578751
+Ref: 3418578751
+Ref: 3419579129
+Ref: 3420579129
+Ref: 3421579326
+Ref: 3422579326
+Ref: 3423580322
+Ref: 3424580322
+Ref: 3425580607
+Ref: 3426580607
+Ref: 3427581534
+Ref: 3428581534
+Ref: 3429581858
+Ref: 3430581867
+Ref: 3431581867
+Ref: 3432582306
+Ref: 3433582315
+Ref: 3434582315
+Ref: 3435582584
+Ref: 3436582593
+Ref: 3437582593
+Ref: 3438583126
+Ref: 3439584198
+Ref: 3440584455
+Ref: 3441584462
+Ref: 3442584714
+Node: 6.3.2585235
+Ref: 3443586085
+Ref: 3444586085
+Node: 6.4586467
+Ref: 3445586578
+Ref: 3446586889
+Ref: S0178586889
+Ref: 3447586915
+Ref: 3448586942
+Ref: 3449586949
+Ref: 3450586993
+Ref: S0179586993
+Ref: 3451587018
+Ref: 3452587043
+Ref: 3453587050
+Ref: 3454587101
+Ref: S0180587101
+Ref: 3455587116
+Ref: 3456587141
+Ref: 3457587194
+Ref: S0181587194
+Ref: 3458587227
+Ref: 3459587245
+Ref: 3460587304
+Ref: S0182587304
+Ref: 3461587308
+Ref: 3462587333
+Ref: 3463587341
+Ref: 3464587346
+Ref: 3465588639
+Ref: 3466589291
+Ref: 3467589725
+Ref: 3468590028
+Ref: 3469590030
+Node: 6.4.1592322
+Ref: 3470592429
+Ref: 3471592768
+Ref: 3472592769
+Ref: 3473592769
+Ref: 3474592769
+Ref: 3475592996
+Ref: 3476593224
+Ref: 3477594061
+Ref: 3478594692
+Ref: 3479595127
+Ref: 3480596417
+Ref: 3481598684
+Ref: 3482599149
+Ref: 3483599161
+Ref: 3484599413
+Ref: 3485600465
+Ref: 3486601340
+Ref: 3487601340
+Ref: 3488601489
+Ref: 3489601489
+Ref: 3490601489
+Ref: 3491601489
+Ref: 3492601489
+Ref: 3493601726
+Ref: 3494601790
+Ref: 3495601845
+Node: 6.5602182
+Ref: 3496602434
+Ref: 3497602685
+Ref: S0183602685
+Ref: S0184602685
+Ref: 3498602698
+Ref: 3499602757
+Ref: S0185602757
+Ref: 3500602771
+Ref: 3501602813
+Ref: 3502602849
+Ref: 3503602898
+Ref: S0186602898
+Ref: 3504602919
+Ref: 3505602971
+Ref: 3506603061
+Ref: S0187603061
+Ref: 3507603065
+Ref: 3508603087
+Ref: 3509603165
+Ref: 3510603343
+Ref: 3511603489
+Ref: 3512603672
+Ref: 3513604946
+Ref: 3514606839
+Ref: 3515607236
+Ref: 3516607537
+Ref: 3517607860
+Ref: 3518607860
+Ref: 3519608002
+Ref: 3520608002
+Ref: 3521608004
+Ref: 3522608010
+Ref: 3523608209
+Ref: 3524608211
+Ref: 3525608977
+Ref: 3526608977
+Ref: 3527608979
+Ref: 3528608987
+Ref: 3529608987
+Ref: 3530609217
+Ref: 3531609850
+Ref: 3532609852
+Ref: 3533609852
+Node: 6.5.1612191
+Ref: 3534612895
+Ref: 3535612895
+Ref: 3536612895
+Ref: 3537613639
+Ref: 3538614114
+Node: 6.6614337
+Ref: 3539614464
+Ref: 3540614464
+Ref: 3541614464
+Ref: 3542615747
+Node: 6.7616272
+Ref: 3543616553
+Ref: S0188616553
+Ref: 3544616567
+Ref: 3545616597
+Ref: 3546616642
+Ref: 3547616977
+Ref: 3548617086
+Ref: 3549617086
+Ref: 3550617462
+Node: 6.8617851
+Ref: 3551618170
+Ref: S0189618170
+Ref: 3552618184
+Ref: 3553618214
+Ref: 3554618253
+Ref: 3555618278
+Ref: 3556618310
+Ref: 3557618340
+Ref: 3558618378
+Ref: 3559618401
+Ref: 3560618639
+Ref: 3561619002
+Ref: 3562619537
+Ref: 3563619537
+Ref: 3564619562
+Ref: 3565620230
+Node: 7620585
+Ref: 3566620672
+Ref: 3567621042
+Ref: 3568621044
+Ref: 3569621044
+Ref: 3570621044
+Node: 7.1621293
+Ref: 3571621682
+Ref: S0190621682
+Ref: 3572621686
+Ref: 3573621741
+Ref: S0191621741
+Ref: 3574621763
+Ref: 3575621804
+Ref: 3576621841
+Ref: 3577621894
+Ref: 3578621934
+Ref: 3579621952
+Ref: 3580622211
+Ref: 3581622211
+Ref: 3582622474
+Ref: 3583622636
+Ref: 3584622993
+Ref: 3585623457
+Node: 7.2624760
+Ref: 3586625310
+Ref: S0192625310
+Ref: 3587625337
+Ref: 3588625378
+Ref: 3589625415
+Ref: 3590625460
+Ref: 3591625507
+Ref: 3592625525
+Ref: 3593626851
+Ref: 3594627142
+Node: 7.3629297
+Ref: 3595629849
+Ref: 3596629851
+Ref: 3597629851
+Ref: 3598629851
+Ref: 3599629851
+Ref: 3600629927
+Ref: S0193629927
+Ref: 3601629945
+Ref: 3602629966
+Ref: 3603630044
+Ref: 3604630106
+Ref: S0194630106
+Ref: 3605630124
+Ref: 3606630145
+Ref: 3607630228
+Ref: 3608630268
+Ref: 3609630310
+Ref: 3610630381
+Ref: 3611630381
+Ref: 3612632605
+Ref: 3613633096
+Ref: 3614633574
+Ref: 3615634704
+Ref: 3616634757
+Ref: 3617634830
+Ref: 3618636298
+Ref: 3619636377
+Node: 7.3.1638753
+Ref: 3620639061
+Ref: 3621640627
+Ref: 3622640627
+Ref: 3623640627
+Ref: 3624641035
+Ref: 3625643314
+Ref: 3626643329
+Node: 7.3.2647086
+Ref: 3627647487
+Ref: 3628647823
+Ref: 3629647823
+Ref: 3630648237
+Ref: 3631648237
+Ref: 3632648334
+Ref: 3633648334
+Ref: 3634648334
+Ref: 3635648455
+Ref: 3636650064
+Ref: 3637650064
+Ref: 3638653359
+Ref: 3639653646
+Node: 7.4655215
+Ref: 3640655637
+Ref: 3641655761
+Ref: 3642655852
+Ref: 3643656099
+Ref: 3644657694
+Node: 7.5658504
+Ref: 3645660317
+Ref: 3646660708
+Ref: 3647660876
+Ref: 3648660876
+Ref: 3649661937
+Ref: 3650661937
+Ref: 3651661937
+Node: 7.6664366
+Ref: 3652664487
+Ref: 3653664487
+Ref: 3654665056
+Ref: 3655665058
+Ref: 3656665058
+Ref: 3657665154
+Ref: 3658665240
+Ref: 3659665242
+Ref: 3660665242
+Ref: 3661665790
+Ref: 3662665846
+Ref: 3663665967
+Ref: 3664666035
+Ref: 3665666103
+Ref: 3666666171
+Ref: 3667666316
+Ref: 3668666392
+Ref: 3669666542
+Ref: 3670667011
+Ref: 3671667011
+Ref: 3672668119
+Ref: 3673668678
+Ref: 3674668925
+Ref: 3675668925
+Ref: 3676668970
+Ref: 3677668970
+Ref: 3678669165
+Ref: 3679669307
+Ref: 3680670258
+Ref: 3681670258
+Ref: 3682670805
+Ref: 3683670829
+Ref: 3684671163
+Node: 7.6.1674023
+Ref: 3685674492
+Ref: 3686674494
+Ref: 3687674547
+Ref: 3688674547
+Ref: 3689674723
+Ref: 3690674725
+Ref: 3691674725
+Ref: 3692674725
+Ref: 3693675091
+Ref: 3694675091
+Ref: 3695675264
+Ref: 3696675740
+Ref: 3697676243
+Ref: 3698676998
+Ref: 3699677520
+Ref: 3700678163
+Ref: 3701678163
+Ref: 3702678165
+Ref: 3703678237
+Ref: 3704678590
+Ref: 3705679015
+Ref: 3706680166
+Ref: 3707680404
+Ref: 3708680858
+Ref: 3709681033
+Ref: 3710681275
+Ref: 3711681510
+Ref: 3712683047
+Node: 8684309
+Node: 8.1685411
+Ref: 3713685560
+Ref: 3714686840
+Ref: 3715686840
+Ref: 3716686840
+Ref: 3717686840
+Ref: 3718686840
+Ref: 3719687123
+Ref: 3720687375
+Node: 8.2688776
+Ref: 3721689361
+Ref: 3722690200
+Ref: 3723690206
+Ref: 3724690348
+Ref: 3725690707
+Ref: 3726690779
+Ref: 3727690982
+Ref: 3728691560
+Ref: 3729691980
+Ref: 3730692227
+Ref: 3731692232
+Ref: 3732692347
+Ref: 3733692557
+Node: 8.3693230
+Ref: 3734693329
+Ref: 3735693581
+Ref: 3736693581
+Ref: 3737693581
+Ref: 3738693891
+Ref: 3739694301
+Ref: 3740694301
+Ref: 3741694387
+Ref: 3742694511
+Ref: 3743694642
+Ref: 3744694762
+Ref: 3745694875
+Ref: 3746695003
+Ref: 3747695146
+Ref: 3748695286
+Ref: 3749695423
+Ref: 3750695649
+Ref: 3751695681
+Ref: 3752697346
+Ref: 3753697976
+Ref: 3754697976
+Ref: 3755698081
+Ref: 3756698199
+Ref: 3757699131
+Ref: 3758699670
+Ref: 3759700838
+Ref: 3760700838
+Ref: 3761700838
+Ref: 3762700838
+Ref: 3763700985
+Ref: 3764701052
+Ref: 3765701240
+Ref: 3766701339
+Ref: 3767701396
+Ref: 3768701492
+Ref: 3769701612
+Ref: 3770702761
+Ref: 3771703105
+Node: 8.3.1704010
+Ref: 3772704315
+Ref: S0195704315
+Ref: 3773705213
+Node: 8.4706648
+Ref: 3774707001
+Ref: S0196707001
+Ref: 3775707005
+Ref: 3776707027
+Ref: 3777707069
+Ref: S0197707069
+Ref: 3778707088
+Ref: 3779707106
+Ref: 3780707138
+Ref: S0198707138
+Ref: 3781707158
+Ref: 3782707174
+Ref: 3783707374
+Ref: 3784708385
+Ref: 3785708391
+Ref: 3786709507
+Ref: 3787709507
+Ref: 3788709985
+Node: 8.5710316
+Ref: 3789710750
+Ref: S0199710750
+Ref: 3790710766
+Ref: 3791710805
+Ref: 3792710847
+Ref: 3793710887
+Ref: 3794710930
+Ref: 3795711009
+Ref: 3796711172
+Ref: 3797711173
+Node: 8.5.1712419
+Ref: 3798712690
+Ref: S0200712690
+Ref: 3799712704
+Ref: 3800712727
+Ref: 3801712743
+Ref: 3802712779
+Ref: 3803712798
+Ref: 3804712830
+Ref: 3805712852
+Ref: 3806712887
+Ref: 3807712906
+Ref: 3808713908
+Ref: 3809714012
+Ref: 3810714541
+Ref: 3811714991
+Node: 8.5.2715909
+Ref: 3812716209
+Ref: S0201716209
+Ref: 3813716213
+Ref: 3814716271
+Ref: 3815716285
+Node: 8.5.3716692
+Ref: 3816716980
+Ref: S0202716980
+Ref: 3817716993
+Ref: 3818717044
+Ref: 3819717058
+Node: 8.5.4717979
+Ref: 3820718226
+Ref: 3821718286
+Ref: 3822718550
+Ref: S0203718550
+Ref: 3823718565
+Ref: 3824718596
+Ref: 3825718647
+Ref: 3826718666
+Ref: 3827718741
+Ref: 3828719005
+Ref: 3829719683
+Ref: 3830719958
+Ref: 3831720092
+Ref: 3832720375
+Ref: 3833722297
+Ref: 3834722297
+Node: 8.5.5725258
+Ref: 3835725537
+Ref: S0204725537
+Ref: 3836725569
+Ref: 3837725628
+Ref: 3838725647
+Ref: 3839725699
+Ref: 3840725760
+Ref: 3841725779
+Ref: 3842725830
+Ref: 3843725890
+Ref: 3844725909
+Node: 8.6726740
+Ref: 3845726877
+Ref: 3846727153
+Ref: 3847727756
+Ref: 3848728147
+Ref: 3849728522
+Ref: 3850728522
+Ref: 3851729167
+Ref: 3852729255
+Ref: 3853729257
+Ref: 3854729257
+Ref: 3855729493
+Ref: 3856729797
+Ref: 3857729994
+Ref: 3858731319
+Ref: 3859731708
+Ref: 3860731909
+Ref: 3861732062
+Ref: 3862732062
+Ref: 3863732319
+Ref: 3864733275
+Ref: 3865733414
+Ref: 3866733545
+Ref: 3867733599
+Ref: 3868734345
+Ref: 3869734345
+Ref: 3870734892
+Ref: 3871735723
+Ref: 3872736017
+Ref: 3873736421
+Node: 9737224
+Ref: 3874737348
+Ref: 3875737429
+Ref: 3876737431
+Ref: 3877737665
+Ref: 3878737666
+Ref: 3879737666
+Ref: 3880737666
+Ref: 3881737725
+Ref: 3882738888
+Ref: 3883739136
+Ref: 3884739138
+Ref: 3885739138
+Ref: 3886739138
+Ref: 3887739138
+Ref: 3888739138
+Ref: 3889739138
+Ref: 3890739138
+Ref: 3891739294
+Node: 9.1740369
+Ref: 3892740490
+Ref: 3893740901
+Ref: S0205740901
+Ref: 3894740924
+Ref: 3895740945
+Ref: 3896740984
+Ref: 3897741025
+Ref: 3898741056
+Ref: 3899741107
+Ref: S0206741107
+Ref: 3900741125
+Ref: 3901741160
+Ref: 3902741200
+Ref: 3903741231
+Ref: 3904741272
+Ref: S0207741272
+Ref: 3905741288
+Ref: 3906741327
+Ref: 3907741358
+Ref: 3908741389
+Ref: S0208741389
+Ref: 3909741393
+Ref: 3910741414
+Ref: 3911741447
+Ref: S0209741447
+Ref: 3912741470
+Ref: 3913741504
+Ref: 3914741539
+Ref: 3915741580
+Ref: 3916741631
+Ref: 3917741912
+Ref: 3918742100
+Ref: 3919743142
+Ref: 3920743143
+Ref: 3921743143
+Ref: 3922743196
+Ref: 3923743839
+Ref: 3924744203
+Ref: 3925744398
+Ref: 3926744479
+Ref: 3927744689
+Ref: 3928744758
+Ref: 3929744880
+Ref: 3930745047
+Ref: 3931745298
+Node: 9.2748152
+Ref: 3932748342
+Ref: 3933748444
+Ref: 3934748446
+Ref: 3935748446
+Ref: 3936748446
+Ref: 3937748593
+Ref: 3938750544
+Ref: 3939750544
+Ref: 3940750703
+Node: 9.3752310
+Ref: 3941752512
+Ref: 3942752512
+Ref: 3943752512
+Ref: 3944752512
+Ref: 3945753335
+Ref: 3946753837
+Node: 9.4756757
+Ref: 3947756910
+Ref: 3948756910
+Ref: 3949756910
+Ref: 3950756910
+Ref: 3951757088
+Ref: 3952757090
+Ref: 3953757090
+Ref: 3954757475
+Ref: 3955757555
+Ref: S0210757555
+Ref: 3956757582
+Ref: 3957757603
+Ref: 3958757642
+Ref: 3959757682
+Ref: 3960757713
+Ref: 3961757773
+Ref: S0211757773
+Ref: 3962757795
+Ref: 3963757829
+Ref: 3964757869
+Ref: 3965757900
+Ref: 3966757950
+Ref: S0212757950
+Ref: 3967757966
+Ref: 3968758026
+Ref: 3969758084
+Ref: 3970758137
+Ref: S0213758137
+Ref: 3971758141
+Ref: 3972758177
+Ref: 3973758207
+Ref: 3974758258
+Ref: S0214758258
+Ref: 3975758262
+Ref: 3976758307
+Ref: 3977758353
+Ref: S0215758353
+Ref: 3978758380
+Ref: 3979758414
+Ref: 3980758449
+Ref: 3981758500
+Ref: 3982758547
+Ref: S0216758547
+Ref: 3983758551
+Ref: 3984758587
+Ref: 3985758615
+Ref: 3986758654
+Ref: 3987758698
+Ref: 3988758721
+Ref: 3989759037
+Ref: 3990759270
+Ref: 3991760333
+Ref: 3992760334
+Ref: 3993760334
+Ref: 3994760334
+Ref: 3995760390
+Ref: 3996761143
+Ref: 3997761519
+Ref: 3998761768
+Ref: 3999761850
+Ref: 4000762779
+Ref: 4001762989
+Ref: 4002763068
+Ref: 4003763201
+Ref: 4004763417
+Ref: 4005763535
+Ref: 4006763948
+Ref: 4007764406
+Ref: 4008764406
+Ref: 4009764713
+Node: 9.5767354
+Ref: 4010767479
+Ref: 4011767479
+Ref: 4012767988
+Ref: 4013768491
+Ref: 4014768737
+Ref: 4015769685
+Ref: 4016769685
+Ref: 4017769685
+Ref: 4018770681
+Ref: S0217770681
+Ref: 4019771104
+Ref: 4020771104
+Ref: 4021772291
+Node: 9.5.1772745
+Ref: 4022772908
+Ref: 4023772908
+Ref: 4024772908
+Ref: 4025774073
+Ref: 4026774073
+Ref: 4027774398
+Ref: 4028774581
+Ref: 4029775250
+Ref: 4030775575
+Ref: 4031775575
+Ref: 4032775903
+Ref: 4033775903
+Ref: 4034776277
+Ref: 4035776380
+Ref: 4036776382
+Ref: 4037776872
+Node: 9.5.2779189
+Ref: 4038779565
+Ref: S0218779565
+Ref: 4039779579
+Ref: 4040779615
+Ref: 4041779637
+Ref: 4042779667
+Ref: 4043779703
+Ref: 4044779750
+Ref: S0219779750
+Ref: 4045779778
+Ref: 4046779792
+Ref: 4047779806
+Ref: 4048779838
+Ref: 4049779890
+Ref: 4050779923
+Ref: S0220779923
+Ref: 4051779927
+Ref: 4052779957
+Ref: S0221779957
+Ref: 4053779975
+Ref: 4054779996
+Ref: 4055780020
+Ref: 4056780052
+Ref: 4057780091
+Ref: 4058780142
+Ref: 4059780185
+Ref: S0222780185
+Ref: 4060780192
+Ref: 4061780220
+Ref: 4062780265
+Ref: S0223780265
+Ref: 4063780275
+Ref: 4064780318
+Ref: S0224780318
+Ref: 4065780327
+Ref: 4066780350
+Ref: 4067780953
+Ref: 4068781081
+Ref: 4069782342
+Ref: 4070782871
+Ref: 4071783337
+Ref: 4072783430
+Ref: 4073783564
+Ref: 4074783679
+Ref: 4075784127
+Ref: 4076784485
+Ref: 4077784485
+Ref: 4078784485
+Ref: 4079784947
+Ref: 4080784949
+Ref: 4081785230
+Ref: 4082785370
+Ref: 4083785905
+Ref: 4084786105
+Ref: 4085786107
+Ref: 4086786107
+Ref: 4087786733
+Ref: 4088787119
+Node: 9.5.3789372
+Ref: 4089789485
+Ref: 4090789558
+Ref: 4091789560
+Ref: 4092789845
+Ref: S0225789845
+Ref: 4093789858
+Ref: 4094789864
+Ref: 4095790421
+Ref: 4096790421
+Ref: 4097790421
+Ref: 4098790421
+Ref: 4099790568
+Ref: 4100790568
+Ref: 4101790855
+Ref: 4102790855
+Ref: 4103791017
+Ref: 4104791197
+Ref: 4105791346
+Ref: 4106791545
+Ref: 4107792558
+Ref: 4108792699
+Ref: 4109792699
+Ref: 4110793293
+Ref: 4111793586
+Ref: 4112793690
+Ref: 4113793692
+Ref: 4114794199
+Ref: 4115794581
+Ref: 4116795366
+Node: 9.5.4798611
+Ref: 4117798885
+Ref: 4118799033
+Ref: 4119799035
+Ref: 4120799104
+Ref: S0226799104
+Ref: 4121799138
+Ref: 4122799217
+Ref: 4123799618
+Ref: 4124800021
+Ref: 4125801602
+Ref: 4126802299
+Ref: 4127802766
+Ref: 4128803038
+Ref: 4129804195
+Ref: 4130805128
+Node: 9.6805485
+Ref: 4131805636
+Ref: 4132806111
+Ref: 4133806178
+Ref: S0227806178
+Ref: 4134806182
+Ref: 4135806207
+Ref: 4136806267
+Ref: S0228806267
+Ref: 4137806292
+Ref: 4138806336
+Ref: S0229806336
+Ref: 4139806355
+Ref: 4140806419
+Ref: 4141806526
+Ref: 4142806670
+Ref: 4143806670
+Ref: 4144806670
+Ref: 4145807598
+Ref: 4146807640
+Ref: 4147807678
+Ref: 4148807737
+Ref: 4149807791
+Ref: 4150807845
+Ref: 4151807913
+Ref: 4152807952
+Ref: 4153808009
+Ref: 4154808067
+Ref: 4155808123
+Ref: 4156808186
+Ref: 4157808436
+Ref: 4158809143
+Ref: 4159809310
+Ref: 4160809392
+Ref: 4161809557
+Ref: 4162809809
+Ref: 4163809950
+Ref: 4164810150
+Ref: 4165813639
+Ref: 4166813639
+Ref: 4167814221
+Ref: 4168814221
+Node: 9.6.1814714
+Ref: 4169814991
+Ref: 4170815091
+Ref: 4171815137
+Ref: 4172815196
+Ref: 4173815299
+Ref: 4174815397
+Ref: 4175815563
+Ref: 4176815638
+Ref: 4177816162
+Ref: 4178816293
+Ref: 4179816306
+Ref: 4180816314
+Ref: 4181816323
+Ref: 4182816334
+Ref: 4183816351
+Ref: 4184816364
+Ref: 4185816374
+Ref: 4186816406
+Ref: 4187816520
+Ref: 4188816582
+Ref: 4189816644
+Ref: 4190816706
+Ref: 4191816783
+Ref: 4192816954
+Ref: 4193817126
+Ref: 4194817296
+Ref: 4195817467
+Ref: 4196817640
+Ref: 4197817742
+Ref: 4198817846
+Ref: 4199818115
+Ref: 4200818404
+Ref: 4201818961
+Ref: 4202819356
+Ref: 4203819873
+Ref: 4204820441
+Ref: 4205820873
+Ref: 4206821063
+Ref: 4207821187
+Ref: 4208821323
+Node: 9.7835041
+Ref: 4209835441
+Ref: S0230835441
+Ref: 4210835454
+Ref: 4211835480
+Ref: 4212835506
+Ref: 4213835538
+Node: 9.7.1835923
+Ref: 4214836246
+Ref: 4215836311
+Ref: S0231836311
+Ref: 4216836339
+Ref: 4217836356
+Ref: 4218836394
+Ref: 4219836411
+Ref: 4220836452
+Ref: 4221836509
+Ref: S0232836509
+Ref: 4222836519
+Ref: 4223836558
+Ref: S0233836558
+Ref: 4224836571
+Ref: 4225836599
+Ref: 4226836626
+Ref: 4227836674
+Ref: S0234836674
+Ref: 4228836686
+Ref: 4229836704
+Ref: 4230836753
+Ref: S0235836753
+Ref: 4231836765
+Ref: 4232836782
+Ref: 4233836835
+Ref: S0236836835
+Ref: 4234837074
+Ref: 4235837533
+Ref: 4236837714
+Ref: 4237838363
+Ref: 4238839012
+Ref: 4239840167
+Node: 9.7.2841081
+Ref: 4240841489
+Ref: 4241841557
+Ref: S0237841557
+Ref: 4242841584
+Ref: 4243841625
+Ref: 4244841694
+Ref: S0238841694
+Ref: 4245841706
+Ref: 4246841731
+Ref: 4247841790
+Ref: S0239841790
+Ref: 4248841802
+Ref: 4249841829
+Ref: 4250842285
+Node: 9.7.3843771
+Ref: 4251844273
+Ref: S0240844273
+Ref: 4252844300
+Ref: 4253844343
+Ref: 4254844435
+Node: 9.7.4845230
+Ref: 4255845577
+Ref: S0241845577
+Ref: 4256845604
+Ref: 4257845653
+Ref: 4258845717
+Ref: S0242845717
+Ref: 4259845721
+Ref: 4260845744
+Ref: 4261845804
+Ref: S0243845804
+Ref: 4262845808
+Ref: 4263845835
+Ref: 4264845873
+Ref: S0244845873
+Ref: 4265845877
+Ref: 4266845953
+Ref: 4267845953
+Ref: 4268846837
+Ref: 4269847895
+Ref: 4270847895
+Ref: 4271847895
+Ref: 4272848331
+Ref: 4273848332
+Ref: 4274848332
+Ref: 4275848332
+Ref: 4276848332
+Node: 9.8848738
+Ref: 4277849263
+Ref: S0245849263
+Ref: 4278849281
+Ref: 4279849296
+Ref: 4280849355
+Ref: 4281849502
+Ref: 4282849602
+Ref: 4283849602
+Ref: 4284849604
+Ref: 4285849604
+Ref: 4286849778
+Ref: 4287849778
+Ref: 4288850208
+Ref: 4289850906
+Ref: 4290851894
+Ref: 4291852407
+Ref: 4292852690
+Ref: 4293853012
+Ref: 4294853012
+Ref: 4295853012
+Ref: 4296853012
+Node: 9.9853603
+Ref: 4297853904
+Ref: 4298853919
+Ref: 4299854018
+Ref: 4300854019
+Ref: 4301854184
+Ref: 4302854199
+Ref: 4303854703
+Ref: 4304854718
+Node: 9.10855761
+Ref: 4305855924
+Ref: 4306855924
+Ref: 4307856617
+Ref: 4308857091
+Ref: 4309858633
+Ref: 4310858897
+Node: 9.11859411
+Node: 10862946
+Ref: 4311863341
+Ref: 4312863341
+Ref: 4313863341
+Ref: 4314863650
+Node: 10.1864139
+Ref: 4315864251
+Ref: 4316864251
+Ref: 4317864251
+Ref: 4318864568
+Ref: 4319864872
+Ref: 4320865119
+Node: 10.1.1865669
+Ref: 4321866028
+Ref: 4322866225
+Ref: S0246866225
+Ref: 4323866231
+Ref: 4324866273
+Ref: S0247866273
+Ref: 4325866287
+Ref: 4326866302
+Ref: 4327866324
+Ref: 4328866339
+Ref: 4329866367
+Ref: S0248866367
+Ref: 4330866382
+Ref: 4331866416
+Ref: 4332866453
+Ref: 4333866519
+Ref: S0249866519
+Ref: 4334866534
+Ref: 4335866561
+Ref: 4336866591
+Ref: 4337866615
+Ref: 4338866678
+Ref: S0250866678
+Ref: 4339866691
+Ref: 4340866728
+Ref: 4341866765
+Ref: 4342866822
+Ref: S0251866822
+Ref: 4343866826
+Ref: 4344866845
+Ref: 4345866882
+Ref: S0252866882
+Ref: 4346866886
+Ref: 4347867073
+Ref: 4348867073
+Ref: 4349867073
+Ref: 4350867073
+Ref: 4351867073
+Ref: 4352867382
+Ref: 4353867701
+Ref: 4354867701
+Ref: 4355867927
+Ref: 4356868224
+Ref: 4357868456
+Ref: 4358868596
+Ref: 4359868669
+Ref: 4360868669
+Ref: 4361868669
+Ref: 4362868669
+Ref: 4363868936
+Ref: 4364869060
+Ref: 4365869253
+Ref: 4366873141
+Ref: 4367873141
+Node: 10.1.2876280
+Ref: 4368876604
+Ref: S0253876604
+Ref: 4369876610
+Ref: 4370876644
+Ref: S0254876644
+Ref: 4371876648
+Ref: 4372876663
+Ref: 4373876695
+Ref: S0255876695
+Ref: 4374876699
+Ref: 4375876722
+Ref: 4376876776
+Ref: S0256876776
+Ref: 4377876819
+Ref: 4378876848
+Ref: 4379876889
+Ref: S0257876889
+Ref: 4380876924
+Ref: 4381876953
+Ref: 4382877012
+Ref: 4383877378
+Ref: 4384877378
+Ref: 4385877440
+Ref: 4386877441
+Node: 10.1.3882739
+Ref: 4387883269
+Ref: S0258883269
+Ref: 4388883273
+Ref: 4389883297
+Ref: 4390883317
+Ref: 4391883340
+Ref: 4392883390
+Ref: S0259883390
+Ref: 4393883404
+Ref: 4394883434
+Ref: 4395883483
+Ref: 4396883533
+Ref: S0260883533
+Ref: 4397883559
+Ref: 4398883603
+Ref: 4399883650
+Ref: S0261883650
+Ref: 4400883673
+Ref: 4401883717
+Ref: 4402883769
+Ref: S0262883769
+Ref: 4403883797
+Ref: 4404883841
+Ref: 4405883879
+Ref: S0263883879
+Ref: 4406883894
+Ref: 4407883912
+Ref: 4408883974
+Ref: 4409884069
+Ref: 4410884338
+Ref: 4411885220
+Ref: 4412885466
+Node: 10.1.4887272
+Ref: 4413887415
+Ref: 4414887415
+Ref: 4415889087
+Ref: 4416889271
+Ref: 4417890920
+Ref: 4418891339
+Node: 10.1.5891665
+Ref: 4419891956
+Ref: 4420891956
+Ref: 4421892013
+Ref: 4422893877
+Ref: 4423893877
+Ref: 4424893877
+Ref: 4425893877
+Ref: 4426894295
+Ref: 4427894295
+Node: 10.1.6895409
+Ref: 4428895832
+Ref: 4429895832
+Ref: 4430895832
+Ref: 4431895832
+Ref: 4432896484
+Ref: 4433896484
+Ref: 4434896484
+Ref: 4435896484
+Ref: 4436896956
+Ref: 4437896956
+Ref: 4438897179
+Ref: 4439897179
+Ref: 4440897378
+Node: 10.2897733
+Ref: 4441897839
+Ref: 4442897839
+Ref: 4443897839
+Ref: 4444898066
+Ref: 4445898066
+Ref: 4446898271
+Ref: 4447898760
+Ref: 4448898761
+Ref: 4449898761
+Ref: 4450899287
+Ref: 4451899478
+Ref: 4452899850
+Ref: 4453899852
+Ref: 4454900752
+Ref: 4455902434
+Ref: 4456902555
+Ref: 4457903119
+Ref: 4458903119
+Ref: 4459903383
+Ref: 4460903791
+Node: 10.2.1905894
+Ref: 4461905999
+Ref: 4462906202
+Ref: 4463906203
+Ref: 4464906232
+Ref: 4465906243
+Ref: 4466906248
+Ref: 4467906393
+Ref: 4468906394
+Ref: 4469906423
+Ref: 4470906485
+Ref: 4471907366
+Ref: 4472907907
+Ref: 4473908053
+Ref: 4474908053
+Ref: 4475908439
+Ref: 4476908599
+Ref: 4477908770
+Ref: 4478911101
+Ref: 4479912047
+Ref: 4480912048
+Ref: 4481912069
+Ref: 4482912081
+Ref: 4483912086
+Ref: 4484912180
+Ref: 4485913584
+Ref: 4486913684
+Ref: 4487913684
+Ref: 4488914116
+Ref: 4489915782
+Ref: 4490915783
+Ref: 4491915808
+Ref: 4492915830
+Ref: 4493915855
+Ref: 4494915856
+Ref: 4495915885
+Ref: 4496915907
+Ref: 4497915932
+Ref: 4498915933
+Ref: 4499915964
+Ref: 4500916067
+Ref: 4501916072
+Ref: 4502916173
+Ref: 4503916328
+Ref: 4504917046
+Ref: 4505917046
+Node: 11917244
+Ref: 4506917469
+Ref: 4507917471
+Ref: 4508917471
+Ref: 4509917471
+Ref: 4510917471
+Ref: 4511917471
+Ref: 4512917614
+Ref: 4513917759
+Node: 11.1918537
+Ref: 4514918653
+Ref: 4515918784
+Ref: S0264918784
+Ref: 4516918788
+Ref: 4517918835
+Ref: 4518919386
+Ref: 4519919386
+Ref: 4520919386
+Ref: 4521919386
+Ref: 4522919386
+Ref: 4523919652
+Ref: 4524919714
+Ref: 4525919714
+Ref: 4526919714
+Ref: 4527919818
+Node: 11.2920089
+Ref: 4528920366
+Ref: S0265920366
+Ref: 4529920381
+Ref: 4530920432
+Ref: 4531920460
+Ref: 4532920505
+Ref: S0266920505
+Ref: 4533920523
+Ref: 4534920556
+Ref: 4535920576
+Ref: 4536920613
+Ref: 4537920674
+Ref: S0267920674
+Ref: 4538920678
+Ref: 4539920723
+Ref: S0268920723
+Ref: 4540920740
+Ref: 4541920879
+Ref: 4542921516
+Ref: 4543921861
+Node: 11.3922467
+Ref: 4544922733
+Ref: S0269922733
+Ref: 4545922776
+Ref: 4546922796
+Ref: 4547922837
+Ref: S0270922837
+Ref: 4548922860
+Ref: 4549922880
+Ref: 4550923537
+Ref: 4551924011
+Ref: 4552924112
+Ref: 4553924473
+Node: 11.4925182
+Ref: 4554925451
+Ref: 4555925528
+Ref: 4556925737
+Ref: 4557925737
+Ref: 4558925994
+Ref: 4559926135
+Ref: 4560926746
+Ref: 4561926916
+Ref: 4562926916
+Ref: 4563926916
+Node: 11.4.1927601
+Ref: 4564927833
+Ref: 4565927943
+Ref: 4566928032
+Ref: 4567928088
+Ref: 4568928155
+Ref: 4569928232
+Ref: 4570928333
+Ref: 4571928456
+Ref: 4572928524
+Ref: 4573928602
+Ref: 4574928748
+Ref: 4575928826
+Ref: 4576928898
+Ref: 4577929019
+Ref: 4578929158
+Ref: 4579929325
+Ref: 4580929507
+Ref: 4581929594
+Ref: 4582929733
+Ref: 4583930926
+Ref: 4584930941
+Ref: 4585931973
+Ref: 4586933321
+Node: 11.4.2934993
+Ref: 4587935560
+Ref: 4588935560
+Ref: 4589935854
+Ref: 4590935855
+Ref: 4591935883
+Ref: 4592935923
+Ref: 4593936125
+Ref: 4594936126
+Ref: 4595936152
+Ref: 4596936185
+Ref: 4597936186
+Ref: 4598936230
+Ref: 4599936254
+Ref: 4600936290
+Ref: 4601936314
+Ref: 4602936333
+Ref: 4603936338
+Ref: 4604939203
+Ref: 4605939276
+Ref: 4606939334
+Ref: 4607939380
+Ref: 4608940054
+Ref: 4609940054
+Node: 11.4.3942428
+Node: 11.5944965
+Ref: 4610945106
+Ref: 4611945352
+Ref: 4612945352
+Ref: 4613945352
+Ref: 4614945352
+Ref: 4615945352
+Ref: 4616945555
+Ref: 4617945766
+Ref: 4618945767
+Ref: 4619945776
+Ref: 4620945809
+Ref: 4621945810
+Ref: 4622945821
+Ref: 4623945839
+Ref: 4624945844
+Ref: 4625945844
+Ref: 4626945844
+Ref: 4627946950
+Ref: 4628947536
+Ref: 4629947657
+Ref: 4630947928
+Ref: 4631948217
+Ref: 4632948343
+Ref: 4633948909
+Ref: 4634949117
+Ref: 4635949378
+Ref: 4636949954
+Ref: 4637950238
+Ref: 4638950358
+Ref: 4639950453
+Ref: 4640950744
+Ref: 4641951199
+Ref: 4642951199
+Ref: 4643951572
+Ref: 4644952031
+Ref: 4645952499
+Ref: 4646952998
+Ref: 4647952998
+Node: 11.6953717
+Ref: 4648953845
+Ref: 4649953845
+Ref: 4650953845
+Ref: 4651953845
+Ref: 4652953845
+Ref: 4653953845
+Ref: 4654954044
+Ref: 4655954917
+Ref: 4656954917
+Ref: 4657955710
+Ref: 4658956446
+Ref: 4659956623
+Ref: 4660956625
+Ref: 4661956625
+Node: 12957115
+Ref: 4662957217
+Ref: 4663957309
+Ref: 4664957539
+Ref: 4665957541
+Ref: 4666957541
+Node: 12.1958626
+Ref: 4667959151
+Ref: S0271959151
+Ref: 4668959155
+Ref: 4669959189
+Ref: 4670959263
+Ref: S0272959263
+Ref: 4671959278
+Ref: 4672959299
+Ref: 4673959338
+Ref: 4674959396
+Ref: S0273959396
+Ref: 4675959411
+Ref: 4676959432
+Ref: 4677959482
+Ref: S0274959482
+Ref: 4678959496
+Ref: 4679959541
+Ref: 4680959597
+Ref: S0275959597
+Ref: 4681959613
+Ref: 4682959650
+Ref: 4683959685
+Ref: 4684959726
+Ref: 4685960091
+Ref: 4686960091
+Ref: 4687960091
+Ref: 4688960091
+Ref: 4689960218
+Ref: 4690960668
+Node: 12.2963139
+Ref: 4691963252
+Ref: 4692963460
+Node: 12.3965411
+Ref: 4693965538
+Ref: 4694965680
+Ref: S0276965680
+Ref: 4695965703
+Ref: 4696965769
+Ref: 4697965775
+Ref: 4698965814
+Ref: 4699965848
+Ref: 4700965890
+Ref: 4701965958
+Ref: 4702965964
+Ref: 4703966003
+Ref: 4704966037
+Ref: 4705966078
+Ref: 4706966138
+Ref: 4707966144
+Ref: 4708966183
+Ref: 4709966233
+Ref: S0277966233
+Ref: 4710966247
+Ref: 4711966270
+Ref: 4712966319
+Ref: S0278966319
+Ref: 4713966360
+Ref: 4714966378
+Ref: 4715966459
+Ref: S0279966459
+Ref: 4716966463
+Ref: 4717966488
+Ref: 4718966516
+Ref: 4719966531
+Ref: 4720966538
+Ref: 4721966580
+Ref: 4722966588
+Ref: 4723966593
+Ref: 4724966838
+Ref: 4725966838
+Ref: 4726966838
+Ref: 4727969245
+Ref: 4728969247
+Ref: 4729969247
+Ref: 4730969247
+Ref: 4731969247
+Ref: 4732969247
+Ref: 4733969247
+Ref: 4734969247
+Ref: 4735971035
+Ref: 4736972312
+Ref: 4737972695
+Ref: 4738972760
+Node: 12.4974217
+Ref: 4739974330
+Ref: 4740974330
+Ref: 4741974489
+Ref: S0280974489
+Ref: 4742974503
+Ref: 4743974530
+Ref: 4744974536
+Ref: 4745974552
+Ref: 4746974575
+Ref: 4747974609
+Ref: 4748974642
+Ref: 4749974669
+Ref: 4750974674
+Ref: 4751974696
+Ref: 4752974736
+Ref: 4753974811
+Ref: 4754974921
+Ref: 4755975580
+Ref: 4756976316
+Ref: 4757976420
+Ref: 4758977036
+Ref: 4759977349
+Ref: 4760977496
+Ref: 4761977875
+Ref: 4762977875
+Ref: 4763977875
+Ref: 4764978230
+Ref: 4765978230
+Ref: 4766978506
+Node: 12.5978907
+Ref: 4767979211
+Ref: S0281979211
+Ref: 4768979227
+Ref: 4769979271
+Ref: 4770979350
+Ref: S0282979350
+Ref: 4771979369
+Ref: 4772979389
+Ref: 4773979411
+Ref: 4774979454
+Ref: 4775979523
+Ref: S0283979523
+Ref: 4776979542
+Ref: 4777979562
+Ref: 4778979626
+Ref: S0284979626
+Ref: 4779979642
+Ref: 4780979684
+Ref: 4781979726
+Ref: 4782979769
+Ref: 4783979818
+Ref: 4784979860
+Ref: 4785979904
+Ref: 4786979954
+Ref: 4787980003
+Ref: 4788980043
+Ref: 4789980084
+Ref: 4790980165
+Ref: 4791980165
+Ref: 4792980165
+Ref: 4793980165
+Ref: 4794980323
+Ref: 4795980323
+Ref: 4796980323
+Ref: 4797980323
+Ref: 4798980445
+Ref: 4799980445
+Node: 12.5.1983399
+Ref: 4800984131
+Ref: S0285984131
+Ref: 4801984219
+Ref: S0286984219
+Ref: 4802984274
+Ref: 4803984293
+Ref: 4804984516
+Ref: 4805984516
+Ref: 4806987499
+Ref: 4807990259
+Ref: 4808990274
+Ref: 4809991600
+Node: 12.5.2992250
+Ref: 4810992726
+Ref: S0287992726
+Ref: 4811992781
+Ref: S0288992781
+Ref: 4812992833
+Ref: S0289992833
+Ref: 4813992885
+Ref: S0290992885
+Ref: 4814992946
+Ref: S0291992946
+Ref: 4815993005
+Ref: S0292993005
+Node: 12.5.3993446
+Ref: 4816993742
+Ref: S0293993742
+Ref: 4817993746
+Ref: 4818994460
+Ref: 4819994559
+Node: 12.5.4995393
+Ref: 4820995694
+Ref: S0294995694
+Ref: 4821995698
+Ref: 4822995884
+Ref: 4823996371
+Node: 12.5.5997011
+Ref: 4824997314
+Ref: S0295997314
+Ref: 4825997318
+Node: 12.6998241
+Ref: 4826998362
+Ref: 4827998362
+Ref: 4828998518
+Ref: S0296998518
+Ref: 4829998522
+Ref: 4830998578
+Ref: 4831998667
+Ref: S0297998667
+Ref: 4832998687
+Ref: 4833998716
+Ref: 4834998750
+Ref: 4835998823
+Ref: S0298998823
+Ref: 4836998843
+Ref: 4837998881
+Ref: 4838998915
+Ref: 4839998966
+Ref: S0299998966
+Ref: 4840998970
+Ref: 4841999016
+Ref: S0300999016
+Ref: 4842999020
+Ref: 4843999218
+Ref: 4844999306
+Ref: 4845999533
+Ref: 4846999604
+Ref: 48471000351
+Ref: 48481001276
+Ref: 48491003525
+Node: 12.71007428
+Ref: 48501007543
+Ref: 48511007543
+Ref: 48521007879
+Ref: S03011007879
+Ref: 48531007906
+Ref: 48541007951
+Ref: 48551007963
+Ref: 48561008004
+Ref: 48571008063
+Ref: S03021008063
+Ref: 48581008104
+Ref: 48591008135
+Ref: 48601008165
+Ref: 48611008255
+Ref: S03031008255
+Ref: 48621008269
+Ref: 48631008325
+Ref: 48641008506
+Ref: 48651011010
+Ref: 48661011407
+Node: 12.81013840
+Node: 131016345
+Node: 13.11017149
+Ref: 48671017301
+Ref: 48681018108
+Ref: 48691018108
+Ref: 48701018108
+Ref: 48711018587
+Ref: 48721019001
+Ref: S03041019001
+Ref: S03051019001
+Ref: 48731019005
+Ref: 48741019047
+Ref: 48751019094
+Ref: 48761019136
+Ref: 48771019164
+Ref: S03061019164
+Ref: 48781019168
+Ref: 48791019194
+Ref: 48801019206
+Ref: 48811019255
+Ref: 48821019379
+Ref: 48831020941
+Ref: 48841020941
+Ref: 48851021454
+Ref: 48861021693
+Ref: 48871021693
+Ref: 48881021693
+Ref: 48891021969
+Ref: 48901021971
+Ref: 48911021971
+Ref: 48921021971
+Ref: 48931022463
+Ref: 48941022465
+Ref: 48951022465
+Ref: 48961022465
+Ref: 48971024731
+Ref: 48981026493
+Ref: 48991026732
+Ref: 49001026857
+Ref: 49011027311
+Ref: 49021027548
+Ref: 49031027548
+Ref: 49041027550
+Ref: 49051027550
+Ref: 49061027550
+Ref: 49071027604
+Ref: 49081027956
+Ref: 49091028325
+Node: 13.1.11030773
+Ref: 49101031169
+Ref: 49111031241
+Ref: S03071031241
+Ref: 49121031259
+Ref: 49131031275
+Ref: 49141031313
+Ref: 49151031329
+Ref: 49161031371
+Ref: S03081031371
+Ref: 49171031385
+Ref: 49181031431
+Ref: S03091031431
+Ref: 49191031435
+Ref: 49201031443
+Ref: 49211031456
+Ref: 49221031633
+Ref: 49231031953
+Ref: 49241032164
+Ref: 49251032164
+Ref: 49261032359
+Ref: 49271035359
+Ref: 49281035534
+Ref: 49291035576
+Ref: 49301036116
+Ref: 49311037334
+Ref: 49321037678
+Ref: 49331037743
+Ref: 49341037743
+Ref: 49351037932
+Ref: 49361038123
+Ref: 49371038880
+Node: 13.21040415
+Ref: 49381041305
+Ref: 49391041307
+Ref: 49401041307
+Ref: 49411041825
+Node: 13.31042925
+Ref: 49421043094
+Ref: 49431043094
+Ref: 49441043243
+Ref: 49451043398
+Ref: S03101043398
+Ref: 49461043418
+Ref: 49471043429
+Ref: 49481043454
+Ref: 49491043481
+Ref: 49501043492
+Ref: 49511043517
+Ref: 49521043754
+Ref: 49531043922
+Ref: 49541044313
+Ref: 49551044313
+Ref: 49561044515
+Ref: 49571044558
+Ref: 49581044923
+Ref: 49591044977
+Ref: 49601044977
+Ref: 49611044977
+Ref: 49621044977
+Ref: 49631044977
+Ref: 49641044977
+Ref: 49651044977
+Ref: 49661044977
+Ref: 49671044977
+Ref: 49681044977
+Ref: 49691044977
+Ref: 49701044977
+Ref: 49711044977
+Ref: 49721044977
+Ref: 49731044977
+Ref: 49741045130
+Ref: 49751045130
+Ref: 49761045203
+Ref: 49771045425
+Ref: 49781046074
+Ref: 49791046089
+Ref: 49801046655
+Ref: 49811046670
+Ref: 49821046791
+Ref: 49831046791
+Ref: 49841046846
+Ref: 49851047197
+Ref: 49861048371
+Ref: 49871048386
+Ref: 49881048876
+Ref: 49891048891
+Ref: 49901049221
+Ref: 49911049236
+Ref: 49921049578
+Ref: 49931049593
+Ref: 49941049816
+Ref: 49951049816
+Ref: 49961049869
+Ref: 49971049971
+Ref: 49981050270
+Ref: 49991051513
+Ref: 50001052668
+Ref: 50011052683
+Ref: 50021052844
+Ref: 50031052859
+Ref: 50041053045
+Ref: 50051053045
+Ref: 50061053168
+Ref: 50071053493
+Ref: 50081053508
+Ref: 50091054116
+Ref: 50101054118
+Ref: 50111054553
+Ref: 50121054553
+Ref: 50131055202
+Ref: 50141057036
+Ref: 50151057051
+Ref: 50161058228
+Ref: 50171058228
+Ref: 50181058635
+Ref: 50191058635
+Ref: 50201058635
+Ref: 50211058971
+Ref: 50221058986
+Ref: 50231059137
+Ref: 50241059152
+Ref: 50251059377
+Ref: 50261059377
+Ref: 50271059431
+Ref: 50281060212
+Ref: 50291060227
+Ref: 50301061050
+Ref: 50311061065
+Ref: 50321062171
+Ref: 50331062186
+Ref: 50341062186
+Ref: 50351062186
+Ref: 50361062492
+Ref: 50371062492
+Node: 13.41065772
+Ref: 50381066099
+Ref: S03111066099
+Ref: 50391066133
+Ref: 50401066148
+Ref: 50411066200
+Ref: S03121066200
+Ref: 50421066204
+Ref: 50431066273
+Ref: 50441067036
+Ref: 50451067121
+Ref: 50461067266
+Ref: 50471067266
+Ref: 50481067543
+Node: 13.51068529
+Ref: 50491068640
+Ref: 50501068640
+Ref: 50511068640
+Ref: 50521068640
+Ref: 50531068640
+Ref: 50541068640
+Ref: 50551068640
+Ref: 50561068640
+Ref: 50571068640
+Node: 13.5.11069011
+Ref: 50581069340
+Ref: 50591069420
+Ref: S03131069420
+Ref: 50601069454
+Ref: 50611069488
+Ref: 50621069514
+Ref: 50631069579
+Ref: S03141069579
+Ref: 50641069605
+Ref: 50651069619
+Ref: 50661069634
+Ref: 50671069647
+Ref: 50681069673
+Ref: S03151069673
+Ref: 50691069687
+Ref: 50701069715
+Ref: S03161069715
+Ref: 50711069729
+Ref: 50721069763
+Ref: S03171069763
+Ref: 50731069777
+Ref: 50741069847
+Ref: 50751069847
+Ref: 50761069847
+Ref: 50771069847
+Ref: 50781074003
+Node: 13.5.21077569
+Ref: 50791077760
+Ref: 50801077876
+Ref: 50811077891
+Ref: 50821078296
+Ref: 50831078311
+Ref: 50841078916
+Ref: 50851078931
+Ref: 50861079499
+Ref: 50871079499
+Node: 13.5.31079931
+Ref: 50881080172
+Ref: 50891080259
+Ref: 50901080261
+Ref: 50911080261
+Ref: 50921080494
+Ref: 50931080496
+Ref: 50941080496
+Ref: 50951080708
+Ref: 50961080723
+Ref: 50971080838
+Ref: 50981080840
+Ref: 50991081022
+Ref: 51001081022
+Ref: 51011081252
+Ref: 51021081423
+Node: 13.61081868
+Ref: 51031082003
+Ref: 51041082003
+Node: 13.71083495
+Ref: 51051083873
+Ref: 51061083941
+Ref: 51071083995
+Ref: 51081084111
+Ref: 51091084177
+Ref: 51101084245
+Ref: 51111084315
+Ref: 51121084388
+Ref: 51131084452
+Ref: 51141084525
+Ref: 51151084595
+Ref: 51161084669
+Ref: 51171084800
+Ref: 51181084840
+Ref: 51191084885
+Ref: 51201084946
+Ref: 51211085022
+Ref: 51221085098
+Ref: 51231085795
+Ref: 51241085809
+Ref: 51251085827
+Ref: 51261085848
+Ref: 51271086003
+Ref: 51281086075
+Ref: 51291086188
+Ref: 51301086292
+Ref: 51311089286
+Node: 13.7.11090041
+Ref: 51321090299
+Ref: 51331090394
+Ref: 51341090463
+Ref: 51351090541
+Ref: 51361090654
+Ref: 51371090815
+Ref: 51381091508
+Ref: 51391091570
+Ref: 51401091679
+Ref: 51411091974
+Ref: 51421091976
+Ref: 51431092713
+Node: 13.7.21092777
+Ref: 51441093067
+Ref: 51451093310
+Ref: 51461093418
+Ref: 51471093815
+Node: 13.81094110
+Ref: 51481094241
+Ref: 51491094426
+Ref: S03181094426
+Ref: 51501094430
+Ref: 51511095127
+Ref: 51521095480
+Ref: 51531095480
+Node: 13.91096990
+Ref: 51541097128
+Ref: 51551097128
+Ref: 51561097128
+Ref: 51571097128
+Ref: 51581097128
+Ref: 51591097463
+Ref: 51601098385
+Ref: 51611098385
+Ref: 51621099741
+Ref: 51631099940
+Ref: 51641099940
+Node: 13.9.11100385
+Ref: 51651100847
+Ref: 51661101053
+Ref: 51671101053
+Ref: 51681101356
+Ref: 51691102347
+Ref: 51701102593
+Ref: 51711102786
+Ref: 51721102786
+Ref: 51731103047
+Ref: 51741103049
+Ref: 51751103843
+Ref: 51761104514
+Node: 13.9.21105273
+Ref: 51771105718
+Ref: 51781105733
+Ref: 51791105956
+Node: 13.101107559
+Ref: 51801108028
+Ref: 51811108043
+Ref: 51821108335
+Node: 13.111108821
+Ref: 51831108947
+Ref: 51841108947
+Ref: 51851108947
+Ref: 51861108947
+Ref: 51871109866
+Ref: 51881109974
+Ref: 51891110158
+Ref: 51901110420
+Ref: 51911110682
+Ref: 51921110884
+Ref: 51931110884
+Ref: 51941110960
+Ref: 51951110962
+Ref: 51961110962
+Ref: 51971111164
+Ref: 51981111179
+Ref: 51991111311
+Ref: 52001111326
+Ref: 52011111592
+Ref: 52021111592
+Ref: 52031111592
+Ref: 52041111592
+Ref: 52051111792
+Ref: 52061111792
+Ref: 52071111792
+Ref: 52081111792
+Ref: 52091112099
+Ref: 52101112285
+Ref: 52111112287
+Ref: 52121112287
+Ref: 52131112789
+Ref: 52141113381
+Ref: 52151113615
+Ref: 52161115969
+Ref: 52171115969
+Ref: 52181115971
+Node: 13.11.11122039
+Ref: 52191122459
+Ref: 52201122474
+Ref: 52211122794
+Ref: 52221122809
+Node: 13.11.21123354
+Ref: 52231123517
+Ref: 52241123517
+Ref: 52251123517
+Ref: 52261123517
+Ref: 52271123517
+Ref: 52281123902
+Ref: 52291124342
+Ref: 52301125503
+Ref: 52311125503
+Ref: 52321125503
+Ref: 52331125503
+Ref: 52341125741
+Ref: 52351125887
+Ref: 52361125887
+Ref: 52371125976
+Ref: 52381125976
+Ref: 52391126377
+Ref: 52401126377
+Ref: 52411126566
+Ref: 52421126709
+Ref: 52431126711
+Ref: 52441126891
+Ref: 52451126891
+Node: 13.11.31127890
+Ref: 52461128343
+Ref: 52471128344
+Ref: 52481128366
+Ref: 52491128425
+Ref: S03191128425
+Ref: 52501128445
+Ref: 52511129388
+Ref: 52521129388
+Ref: 52531129388
+Ref: 52541130271
+Ref: 52551130271
+Node: 13.11.41132312
+Ref: 52561132841
+Ref: 52571132945
+Ref: 52581133054
+Ref: 52591133121
+Ref: 52601133239
+Ref: 52611133458
+Ref: 52621133598
+Ref: 52631133756
+Ref: 52641134168
+Ref: 52651134398
+Ref: 52661134572
+Ref: 52671134858
+Ref: 52681135152
+Ref: 52691135424
+Ref: 52701135424
+Ref: 52711135424
+Ref: 52721135424
+Ref: 52731135424
+Ref: 52741136209
+Ref: 52751137448
+Ref: 52761137448
+Ref: 52771137893
+Ref: 52781138504
+Ref: 52791138504
+Ref: 52801138615
+Ref: 52811138615
+Ref: 52821138677
+Ref: 52831139081
+Ref: 52841139081
+Ref: 52851139081
+Ref: 52861139214
+Node: 13.11.51141367
+Ref: 52871141740
+Ref: 52881142231
+Ref: 52891142305
+Node: 13.11.61142579
+Node: 13.121148988
+Ref: 52901149545
+Ref: 52911149546
+Ref: 52921149559
+Ref: 52931149572
+Ref: 52941149609
+Ref: S03201149609
+Ref: 52951149628
+Ref: 52961149674
+Ref: 52971149688
+Ref: 52981149767
+Ref: S03211149767
+Ref: 52991149771
+Ref: 53001149779
+Ref: 53011149842
+Ref: 53021150208
+Ref: 53031150208
+Ref: 53041152680
+Ref: 53051152681
+Ref: 53061152700
+Ref: 53071152724
+Ref: 53081153235
+Ref: 53091153235
+Node: 13.12.11154114
+Ref: 53101154457
+Ref: 53111154457
+Ref: 53121154744
+Ref: 53131154744
+Ref: 53141154973
+Ref: 53151154973
+Ref: 53161157397
+Ref: 53171157397
+Ref: 53181157640
+Ref: 53191157640
+Ref: 53201157968
+Ref: 53211157968
+Ref: 53221158464
+Ref: 53231158464
+Ref: 53241158584
+Ref: 53251158584
+Ref: 53261158753
+Ref: 53271158753
+Ref: 53281158908
+Ref: 53291158908
+Ref: 53301160155
+Node: 13.131160580
+Ref: 53311160684
+Ref: 53321160684
+Node: 13.13.11161118
+Ref: 53331161964
+Ref: 53341162021
+Ref: 53351162042
+Ref: 53361162178
+Ref: 53371162240
+Ref: 53381162314
+Ref: 53391162424
+Ref: 53401162548
+Ref: 53411162727
+Node: 13.13.21163907
+Ref: 53421164195
+Ref: 53431164195
+Ref: 53441164368
+Ref: 53451164383
+Ref: 53461165106
+Ref: 53471165106
+Ref: 53481165480
+Ref: 53491166102
+Ref: 53501166117
+Ref: 53511166440
+Ref: 53521166455
+Ref: 53531169559
+Ref: 53541169574
+Ref: 53551170020
+Ref: 53561170035
+Ref: 53571170634
+Ref: 53581170649
+Ref: 53591171033
+Ref: 53601171048
+Ref: 53611173026
+Ref: 53621173041
+Ref: 53631173808
+Ref: 53641173823
+Ref: 53651174665
+Ref: 53661174665
+Ref: 53671174912
+Ref: 53681175666
+Ref: 53691175916
+Ref: 53701176094
+Ref: 53711176094
+Ref: 53721176094
+Ref: 53731176094
+Ref: 53741176094
+Ref: 53751176094
+Ref: 53761176094
+Ref: 53771176094
+Ref: 53781176641
+Ref: 53791176643
+Ref: 53801176643
+Ref: 53811176643
+Ref: 53821176643
+Ref: 53831176643
+Ref: 53841176643
+Ref: 53851176643
+Ref: 53861176643
+Ref: 53871176643
+Ref: 53881176643
+Ref: 53891176643
+Ref: 53901176643
+Ref: 53911176643
+Ref: 53921176643
+Ref: 53931176643
+Ref: 53941177216
+Ref: 53951178664
+Ref: 53961179659
+Ref: 53971179659
+Ref: 53981180518
+Node: 13.141183440
+Ref: 53991183916
+Ref: 54001183916
+Ref: 54011184241
+Ref: 54021184571
+Ref: 54031184777
+Ref: 54041185063
+Ref: 54051185205
+Ref: 54061185355
+Ref: 54071186114
+Ref: 54081186221
+Ref: 54091186799
+Ref: 54101186895
+Ref: 54111187305
+Ref: 54121187493
+Ref: 54131187744
+Ref: 54141188046
+Ref: 54151188046
+Ref: 54161188402
+Ref: 54171188402
+Ref: 54181188804
+Ref: 54191189024
+Ref: 54201189167
+Ref: 54211189293
+Ref: 54221189439
+Ref: 54231189530
+Ref: 54241189736
+Ref: 54251189947
+Ref: 54261190006
+Ref: 54271190008
+Ref: 54281190251
+Ref: 54291190253
+Ref: 54301191347
+Node: Annex A1191349
+Ref: 54311191507
+Ref: 54321191507
+Ref: 54331202187
+Node: A.11204095
+Ref: 54341204330
+Ref: 54351204538
+Ref: 54361204792
+Ref: 54371204864
+Ref: 54381205985
+Ref: 54391206048
+Ref: 54401206109
+Ref: 54411207993
+Ref: 54421210678
+Ref: 54431214579
+Ref: 54441214900
+Ref: 54451215043
+Ref: 54461215101
+Ref: 54471215161
+Ref: 54481216048
+Ref: 54491216237
+Ref: 54501216451
+Ref: 54511216702
+Ref: 54521216739
+Ref: 54531216776
+Ref: 54541216813
+Ref: 54551217575
+Node: A.21219711
+Ref: 54561219930
+Node: A.31220247
+Node: A.3.11221181
+Ref: 54571221501
+Ref: 54581221666
+Ref: 54591221851
+Node: A.3.21222410
+Ref: 54601222762
+Ref: 54611222861
+Ref: 54621222936
+Ref: 54631223011
+Ref: 54641223086
+Ref: 54651223161
+Ref: 54661223236
+Ref: 54671223311
+Ref: 54681223386
+Ref: 54691223504
+Ref: 54701223579
+Ref: 54711223654
+Ref: 54721223729
+Ref: 54731223804
+Ref: 54741223879
+Ref: 54751223954
+Ref: 54761224033
+Ref: 54771224169
+Ref: 54781224234
+Ref: 54791224299
+Ref: 54801224367
+Ref: 54811224426
+Ref: 54821224485
+Ref: 54831224623
+Ref: 54841224719
+Ref: 54851224784
+Ref: 54861224853
+Ref: 54871224997
+Ref: 54881225726
+Ref: 54891225919
+Ref: 54901226114
+Ref: 54911226367
+Ref: 54921226610
+Ref: 54931226855
+Ref: 54941227116
+Ref: 54951227309
+Ref: 54961227545
+Ref: 54971227741
+Node: A.3.31231718
+Ref: 54981232109
+Ref: 54991232173
+Ref: 55001232181
+Ref: 55011232253
+Ref: 55021232325
+Ref: 55031232397
+Ref: 55041232469
+Ref: 55051232541
+Ref: 55061232613
+Ref: 55071232685
+Ref: 55081232757
+Ref: 55091232829
+Ref: 55101232901
+Ref: 55111232974
+Ref: 55121233047
+Ref: 55131233120
+Ref: 55141233193
+Ref: 55151233266
+Ref: 55161233342
+Ref: 55171233415
+Ref: 55181233488
+Ref: 55191233561
+Ref: 55201233634
+Ref: 55211233707
+Ref: 55221233780
+Ref: 55231233853
+Ref: 55241233926
+Ref: 55251233999
+Ref: 55261234072
+Ref: 55271234145
+Ref: 55281234218
+Ref: 55291234291
+Ref: 55301234364
+Ref: 55311234437
+Ref: 55321234554
+Ref: 55331234637
+Ref: 55341234720
+Ref: 55351234803
+Ref: 55361234886
+Ref: 55371234969
+Ref: 55381235052
+Ref: 55391235135
+Ref: 55401235218
+Ref: 55411235301
+Ref: 55421235384
+Ref: 55431235467
+Ref: 55441235550
+Ref: 55451235633
+Ref: 55461235716
+Ref: 55471235774
+Ref: 55481235857
+Ref: 55491236022
+Ref: 55501236105
+Ref: 55511236188
+Ref: 55521236271
+Ref: 55531236354
+Ref: 55541236437
+Ref: 55551236520
+Ref: 55561236680
+Ref: 55571236763
+Ref: 55581236846
+Ref: 55591236929
+Ref: 55601237012
+Ref: 55611237099
+Ref: 55621237182
+Ref: 55631237265
+Ref: 55641237348
+Ref: 55651237431
+Ref: 55661237515
+Ref: 55671237599
+Ref: 55681237683
+Ref: 55691237767
+Ref: 55701237851
+Ref: 55711237935
+Ref: 55721238019
+Ref: 55731238103
+Ref: 55741238187
+Ref: 55751238271
+Ref: 55761238355
+Ref: 55771238443
+Ref: 55781238527
+Ref: 55791238611
+Ref: 55801238695
+Ref: 55811238779
+Ref: 55821238863
+Ref: 55831238947
+Ref: 55841239031
+Ref: 55851239115
+Ref: 55861239199
+Ref: 55871239283
+Ref: 55881239367
+Ref: 55891239451
+Ref: 55901239535
+Ref: 55911239619
+Ref: 55921239703
+Ref: 55931239815
+Ref: 55941239824
+Ref: 55951239878
+Ref: 55961239932
+Ref: 55971239986
+Ref: 55981240044
+Ref: 55991240118
+Ref: 56001240192
+Ref: 56011240266
+Ref: 56021240340
+Ref: 56031240414
+Ref: 56041240488
+Ref: 56051240562
+Ref: 56061240636
+Ref: 56071240710
+Ref: 56081240784
+Ref: 56091240858
+Ref: 56101240932
+Ref: 56111241006
+Ref: 56121241080
+Ref: 56131241154
+Ref: 56141241232
+Ref: 56151241306
+Ref: 56161241380
+Ref: 56171241454
+Ref: 56181241528
+Ref: 56191241602
+Ref: 56201241676
+Ref: 56211241750
+Ref: 56221241828
+Ref: 56231241902
+Ref: 56241241976
+Ref: 56251242050
+Ref: 56261242124
+Ref: 56271242198
+Ref: 56281242272
+Ref: 56291242346
+Ref: 56301242526
+Ref: 56311242614
+Ref: 56321242686
+Ref: 56331242774
+Ref: 56341242862
+Ref: 56351242950
+Ref: 56361243038
+Ref: 56371243126
+Ref: 56381243214
+Ref: 56391243302
+Ref: 56401243390
+Ref: 56411243478
+Ref: 56421243566
+Ref: 56431243654
+Ref: 56441243742
+Ref: 56451243822
+Ref: 56461243910
+Ref: 56471244062
+Ref: 56481244150
+Ref: 56491244219
+Ref: 56501244307
+Ref: 56511244395
+Ref: 56521244483
+Ref: 56531244571
+Ref: 56541244659
+Ref: 56551244747
+Ref: 56561244817
+Ref: 56571244905
+Ref: 56581244993
+Ref: 56591245081
+Ref: 56601245169
+Ref: 56611245257
+Ref: 56621245345
+Ref: 56631245433
+Ref: 56641245521
+Ref: 56651245673
+Ref: 56661245761
+Ref: 56671245849
+Ref: 56681245937
+Ref: 56691246025
+Ref: 56701246113
+Ref: 56711246201
+Ref: 56721246289
+Ref: 56731246377
+Ref: 56741246465
+Ref: 56751246553
+Ref: 56761246641
+Ref: 56771246729
+Ref: 56781246817
+Ref: 56791246905
+Ref: 56801246993
+Ref: 56811247145
+Ref: 56821247233
+Ref: 56831247321
+Ref: 56841247409
+Ref: 56851247497
+Ref: 56861247585
+Ref: 56871247673
+Ref: 56881247761
+Ref: 56891247849
+Ref: 56901247937
+Ref: 56911248025
+Ref: 56921248113
+Ref: 56931248201
+Ref: 56941248289
+Ref: 56951248377
+Ref: 56961248465
+Ref: 56971248617
+Ref: 56981248705
+Ref: 56991248793
+Ref: 57001248881
+Ref: 57011248969
+Ref: 57021249057
+Ref: 57031249145
+Ref: 57041249233
+Ref: 57051249321
+Ref: 57061249409
+Ref: 57071249497
+Ref: 57081249585
+Ref: 57091249673
+Ref: 57101249761
+Ref: 57111249849
+Ref: 57121249937
+Ref: 57131250089
+Ref: 57141250177
+Ref: 57151250265
+Ref: 57161250353
+Ref: 57171250441
+Ref: 57181250529
+Ref: 57191250617
+Ref: 57201250705
+Ref: 57211250793
+Ref: 57221250881
+Ref: 57231250969
+Ref: 57241251057
+Ref: 57251251145
+Ref: 57261251233
+Ref: 57271251321
+Ref: 57281251409
+Node: A.3.41251748
+Ref: 57291252076
+Ref: 57301252133
+Ref: 57311252211
+Ref: 57321252289
+Ref: 57331252367
+Ref: 57341252445
+Ref: 57351252539
+Ref: 57361252635
+Ref: 57371252715
+Ref: 57381252792
+Ref: 57391252893
+Ref: 57401252988
+Ref: 57411253094
+Ref: 57421253199
+Ref: 57431253355
+Ref: 57441253506
+Ref: 57451253668
+Ref: 57461253824
+Ref: 57471254006
+Node: A.3.51258355
+Ref: 57481258823
+Ref: 57491258877
+Ref: 57501258936
+Ref: 57511259009
+Ref: 57521259081
+Ref: 57531259152
+Ref: 57541259223
+Ref: 57551259295
+Ref: 57561259403
+Ref: 57571259487
+Ref: 57581259566
+Ref: 57591259640
+Ref: 57601259722
+Ref: 57611259793
+Ref: 57621259872
+Ref: 57631259960
+Ref: 57641260032
+Ref: 57651260106
+Ref: 57661260179
+Ref: 57671260258
+Ref: 57681260325
+Node: A.3.61266584
+Ref: 57691266786
+Node: A.41266988
+Node: A.4.11268061
+Ref: 57701268369
+Ref: 57711268435
+Ref: 57721268488
+Ref: 57731268541
+Ref: 57741268607
+Ref: 57751268626
+Ref: 57761268641
+Ref: 57771268654
+Ref: 57781268701
+Ref: 57791268751
+Ref: 57801268800
+Ref: 57811268846
+Ref: 57821268894
+Node: A.4.21268952
+Ref: 57831269347
+Ref: 57841269484
+Ref: 57851269576
+Ref: 57861269632
+Ref: 57871269818
+Ref: 57881269904
+Ref: 57891269986
+Ref: 57901270068
+Ref: 57911270623
+Ref: 57921270754
+Ref: 57931271116
+Ref: 57941271167
+Ref: 57951271252
+Ref: 57961271333
+Ref: 57971271483
+Ref: 57981271598
+Ref: 57991271721
+Ref: 58001271786
+Ref: 58011271890
+Ref: 58021271984
+Ref: 58031272078
+Ref: 58041275666
+Ref: 58051275785
+Ref: 58061277392
+Node: A.4.31277937
+Ref: 58071279248
+Ref: 58081279411
+Ref: 58091279718
+Ref: 58101280026
+Ref: 58111280322
+Ref: 58121280621
+Ref: 58131280879
+Ref: 58141281177
+Ref: 58151281429
+Ref: 58161281638
+Ref: 58171281791
+Ref: 58181282031
+Ref: 58191282225
+Ref: 58201282365
+Ref: 58211282693
+Ref: 58221283013
+Ref: 58231283158
+Ref: 58241283282
+Ref: 58251283436
+Ref: 58261283617
+Ref: 58271283867
+Ref: 58281284301
+Ref: 58291284475
+Ref: 58301284690
+Ref: 58311284873
+Ref: 58321285100
+Ref: 58331285272
+Ref: 58341285579
+Ref: 58351285698
+Ref: 58361285911
+Ref: 58371286095
+Ref: 58381286383
+Ref: 58391286556
+Ref: 58401286768
+Ref: 58411286941
+Ref: 58421304142
+Node: A.4.41304270
+Ref: 58431305207
+Ref: 58441305388
+Ref: 58451305423
+Ref: 58461305486
+Ref: 58471305522
+Ref: 58481305596
+Ref: 58491305666
+Ref: 58501305815
+Ref: 58511305987
+Ref: 58521306070
+Ref: 58531306252
+Ref: 58541306421
+Ref: 58551306624
+Ref: 58561306827
+Ref: 58571307033
+Ref: 58581307240
+Ref: 58591307432
+Ref: 58601307616
+Ref: 58611308351
+Ref: 58621308496
+Ref: 58631308691
+Ref: 58641308880
+Ref: 58651309080
+Ref: 58661310771
+Ref: 58671311106
+Ref: 58681311429
+Ref: 58691311752
+Ref: 58701312033
+Ref: 58711312357
+Ref: 58721312632
+Ref: 58731312861
+Ref: 58741313031
+Ref: 58751313293
+Ref: 58761313507
+Ref: 58771313664
+Ref: 58781314018
+Ref: 58791314364
+Ref: 58801314534
+Ref: 58811314672
+Ref: 58821314851
+Ref: 58831315049
+Ref: 58841315400
+Ref: 58851315722
+Ref: 58861315987
+Ref: 58871316222
+Ref: 58881316503
+Ref: 58891316754
+Ref: 58901316954
+Ref: 58911317167
+Ref: 58921317307
+Ref: 58931317419
+Ref: 58941317631
+Ref: 58951317812
+Ref: 58961318073
+Ref: 58971318304
+Ref: 58981318565
+Ref: 58991319244
+Ref: 59001319452
+Ref: 59011319657
+Node: A.4.51325867
+Ref: 59021326699
+Ref: 59031326795
+Ref: 59041326893
+Ref: 59051326969
+Ref: 59061327039
+Ref: 59071327093
+Ref: 59081327210
+Ref: 59091327308
+Ref: 59101327407
+Ref: 59111327489
+Ref: 59121327613
+Ref: 59131327738
+Ref: 59141327853
+Ref: 59151328509
+Ref: 59161328647
+Ref: 59171328835
+Ref: 59181329014
+Ref: 59191329205
+Ref: 59201330841
+Ref: 59211331160
+Ref: 59221331467
+Ref: 59231331776
+Ref: 59241332044
+Ref: 59251332353
+Ref: 59261332604
+Ref: 59271332823
+Ref: 59281332986
+Ref: 59291333235
+Ref: 59301333439
+Ref: 59311333589
+Ref: 59321333927
+Ref: 59331334257
+Ref: 59341334422
+Ref: 59351334556
+Ref: 59361334730
+Ref: 59371334921
+Ref: 59381335191
+Ref: 59391335432
+Ref: 59401335626
+Ref: 59411335790
+Ref: 59421335996
+Ref: 59431336172
+Ref: 59441336364
+Ref: 59451336526
+Ref: 59461336665
+Ref: 59471336773
+Ref: 59481336977
+Ref: 59491337151
+Ref: 59501337344
+Ref: 59511337507
+Ref: 59521337700
+Ref: 59531338372
+Node: A.4.61342092
+Ref: 59541342573
+Ref: 59551342654
+Ref: 59561342710
+Ref: 59571342766
+Ref: 59581342822
+Ref: 59591342878
+Ref: 59601342934
+Ref: 59611342990
+Ref: 59621343046
+Ref: 59631343102
+Ref: 59641343158
+Ref: 59651343214
+Ref: 59661343273
+Ref: 59671343393
+Ref: 59681343513
+Node: A.4.71344119
+Ref: 59691345106
+Ref: 59701345108
+Ref: 59711345108
+Ref: 59721345108
+Ref: 59731345108
+Ref: 59741345108
+Ref: 59751345108
+Ref: 59761345108
+Ref: 59771345108
+Ref: 59781345108
+Ref: 59791345108
+Ref: 59801345108
+Ref: 59811345108
+Ref: 59821345108
+Ref: 59831345108
+Ref: 59841345108
+Ref: 59851345222
+Ref: 59861345382
+Ref: 59871345484
+Ref: 59881345545
+Ref: 59891345753
+Ref: 59901345860
+Ref: 59911345964
+Ref: 59921346068
+Ref: 59931346747
+Ref: 59941346888
+Ref: 59951347275
+Ref: 59961347336
+Ref: 59971347443
+Ref: 59981347541
+Ref: 59991347722
+Ref: 60001347847
+Ref: 60011347985
+Ref: 60021348055
+Ref: 60031348169
+Ref: 60041348277
+Ref: 60051348381
+Ref: 60061350463
+Ref: 60071351077
+Node: A.4.81351220
+Ref: 60081352357
+Ref: 60091352359
+Ref: 60101352359
+Ref: 60111352359
+Ref: 60121352359
+Ref: 60131352359
+Ref: 60141352359
+Ref: 60151352359
+Ref: 60161352359
+Ref: 60171352359
+Ref: 60181352359
+Ref: 60191352359
+Ref: 60201352359
+Ref: 60211352359
+Ref: 60221352359
+Ref: 60231352359
+Ref: 60241352532
+Ref: 60251352665
+Ref: 60261352779
+Ref: 60271352847
+Ref: 60281353079
+Ref: 60291353201
+Ref: 60301353317
+Ref: 60311353431
+Ref: 60321354191
+Ref: 60331354347
+Ref: 60341354769
+Ref: 60351354842
+Ref: 60361354963
+Ref: 60371355076
+Ref: 60381355292
+Ref: 60391355429
+Ref: 60401355587
+Ref: 60411355664
+Ref: 60421355793
+Ref: 60431355916
+Ref: 60441356034
+Ref: 60451356287
+Ref: 60461358322
+Ref: 60471358515
+Ref: 60481359196
+Node: A.4.91359349
+Ref: 60491359687
+Ref: 60501360290
+Ref: 60511360792
+Ref: 60521361132
+Ref: 60531361785
+Ref: 60541362169
+Ref: 60551362598
+Node: A.4.101363052
+Ref: 60561363388
+Ref: 60571364063
+Ref: 60581364439
+Ref: 60591364860
+Ref: 60601365264
+Ref: 60611365654
+Ref: 60621366029
+Ref: 60631366447
+Node: A.4.111366685
+Ref: 60641367203
+Ref: 60651367363
+Ref: 60661367432
+Ref: 60671367475
+Ref: 60681367520
+Ref: 60691367563
+Ref: 60701367604
+Ref: 60711367788
+Ref: 60721367925
+Ref: 60731368062
+Ref: 60741368189
+Ref: 60751368366
+Ref: 60761368535
+Ref: 60771368792
+Ref: 60781369009
+Ref: 60791369169
+Ref: 60801369375
+Ref: 60811369560
+Ref: 60821369740
+Ref: 60831369932
+Ref: 60841370062
+Ref: 60851370209
+Ref: 60861370339
+Ref: 60871370406
+Ref: 60881370511
+Ref: 60891370706
+Ref: 60901370903
+Ref: 60911371038
+Ref: 60921371190
+Ref: 60931371325
+Ref: 60941371397
+Ref: 60951371512
+Ref: 60961371722
+Ref: 60971371924
+Ref: 60981372064
+Ref: 60991372221
+Ref: 61001372361
+Ref: 61011372438
+Ref: 61021372900
+Ref: 61031372900
+Ref: 61041372900
+Ref: 61051372900
+Node: A.51382660
+Ref: 61061383350
+Ref: 61071383385
+Ref: 61081383421
+Ref: 61091383554
+Node: A.5.11384223
+Ref: 61101384857
+Ref: 61111384987
+Ref: 61121385068
+Ref: 61131385149
+Ref: 61141385230
+Ref: 61151385395
+Ref: 61161385476
+Ref: 61171385557
+Ref: 61181385638
+Ref: 61191385719
+Ref: 61201385800
+Ref: 61211385881
+Ref: 61221385962
+Ref: 61231386046
+Ref: 61241386127
+Ref: 61251386208
+Ref: 61261386289
+Ref: 61271386370
+Ref: 61281386572
+Ref: 61291386774
+Ref: 61301386976
+Ref: 61311387181
+Ref: 61321387262
+Ref: 61331387343
+Ref: 61341387424
+Ref: 61351387505
+Ref: 61361387586
+Ref: 61371387667
+Ref: 61381387748
+Ref: 61391387872
+Ref: 61401392144
+Ref: 61411392144
+Ref: 61421392144
+Ref: 61431392940
+Ref: 61441393190
+Ref: 61451393748
+Node: A.5.21396084
+Ref: 61461396509
+Ref: 61471397603
+Ref: 61481397653
+Ref: 61491397702
+Ref: 61501397768
+Ref: 61511397844
+Ref: 61521397945
+Ref: 61531398033
+Ref: 61541398073
+Ref: 61551398176
+Ref: 61561398268
+Ref: 61571398364
+Ref: 61581398425
+Ref: 61591398613
+Ref: 61601398725
+Ref: 61611398872
+Ref: 61621398923
+Ref: 61631398993
+Ref: 61641399094
+Ref: 61651399182
+Ref: 61661399222
+Ref: 61671399325
+Ref: 61681399417
+Ref: 61691399513
+Ref: 61701399574
+Ref: 61711399765
+Ref: 61721400076
+Ref: 61731401750
+Ref: 61741401986
+Ref: 61751403048
+Ref: 61761403048
+Ref: 61771403048
+Ref: 61781403342
+Ref: 61791403344
+Node: A.5.31411164
+Ref: 61801411369
+Ref: 61811411501
+Ref: 61821411516
+Ref: 61831411679
+Ref: 61841412227
+Ref: 61851412242
+Ref: 61861412659
+Ref: 61871412674
+Ref: 61881413072
+Ref: 61891413087
+Ref: 61901413478
+Ref: 61911413493
+Ref: 61921414024
+Ref: 61931414124
+Ref: 61941414210
+Ref: 61951414212
+Ref: 61961414505
+Ref: 61971414520
+Ref: 61981414835
+Ref: 61991414850
+Ref: 62001415203
+Ref: 62011415218
+Ref: 62021415666
+Ref: 62031416001
+Ref: 62041416122
+Ref: 62051416137
+Ref: 62061416407
+Ref: 62071416422
+Ref: 62081416848
+Ref: 62091416863
+Ref: 62101417114
+Ref: 62111417512
+Ref: 62121417514
+Ref: 62131417721
+Ref: 62141417736
+Ref: 62151417982
+Ref: 62161418303
+Ref: 62171418305
+Ref: 62181418487
+Ref: 62191418502
+Ref: 62201418958
+Ref: 62211418973
+Ref: 62221419483
+Ref: 62231419498
+Ref: 62241419947
+Ref: 62251419962
+Ref: 62261420441
+Ref: 62271420456
+Ref: 62281421111
+Ref: 62291421129
+Ref: 62301421144
+Ref: 62311421540
+Ref: 62321421555
+Ref: 62331421734
+Ref: 62341422081
+Ref: 62351422083
+Ref: 62361422236
+Ref: 62371422251
+Ref: 62381422434
+Ref: 62391422672
+Ref: 62401422674
+Ref: 62411422946
+Ref: 62421422961
+Ref: 62431423147
+Ref: 62441423362
+Ref: 62451423364
+Ref: 62461423579
+Ref: 62471423594
+Ref: 62481424287
+Ref: 62491424302
+Ref: 62501424302
+Ref: 62511424490
+Ref: 62521424505
+Ref: 62531424675
+Ref: 62541424936
+Ref: 62551424938
+Ref: 62561425210
+Ref: 62571425333
+Ref: 62581425348
+Ref: 62591425951
+Ref: 62601425966
+Ref: 62611426389
+Ref: 62621426404
+Ref: 62631426571
+Ref: 62641426586
+Ref: 62651426743
+Ref: 62661426758
+Ref: 62671427198
+Ref: 62681427213
+Ref: 62691427654
+Ref: 62701427669
+Node: A.5.41428095
+Ref: 62711428280
+Ref: 62721428409
+Ref: 62731428424
+Ref: 62741428604
+Ref: 62751428619
+Ref: 62761428933
+Ref: 62771428948
+Node: A.61429283
+Ref: 62781429394
+Ref: 62791429394
+Node: A.71430085
+Ref: 62801430278
+Ref: 62811430278
+Ref: 62821430278
+Ref: 62831430860
+Ref: 62841432590
+Ref: 62851432592
+Ref: 62861432592
+Ref: 62871432655
+Ref: 62881433925
+Ref: 62891433927
+Node: A.81434719
+Ref: 62901434906
+Ref: 62911434906
+Ref: 62921434906
+Ref: 62931435345
+Ref: 62941435764
+Ref: 62951435764
+Ref: 62961435764
+Ref: 62971436324
+Node: A.8.11436825
+Ref: 62981437207
+Ref: 62991437224
+Ref: 63001437270
+Ref: 63011437370
+Ref: 63021437580
+Ref: 63031437772
+Ref: 63041437823
+Ref: 63051437874
+Ref: 63061437946
+Ref: 63071437999
+Ref: 63081438063
+Ref: 63091438124
+Ref: 63101438189
+Ref: 63111438260
+Ref: 63121438356
+Ref: 63131438428
+Ref: 63141438502
+Ref: 63151438586
+Ref: 63161438655
+Ref: 63171438722
+Ref: 63181438789
+Ref: 63191438855
+Ref: 63201438924
+Ref: 63211438990
+Ref: 63221439189
+Node: A.8.21439250
+Node: A.8.31447357
+Node: A.8.41449129
+Ref: 63231449505
+Ref: 63241449522
+Ref: 63251449568
+Ref: 63261449627
+Ref: 63271449693
+Ref: 63281449793
+Ref: 63291450005
+Ref: 63301450197
+Ref: 63311450248
+Ref: 63321450299
+Ref: 63331450371
+Ref: 63341450424
+Ref: 63351450488
+Ref: 63361450549
+Ref: 63371450614
+Ref: 63381450685
+Ref: 63391450781
+Ref: 63401450923
+Ref: 63411450998
+Ref: 63421451140
+Ref: 63431451214
+Ref: 63441451291
+Ref: 63451451358
+Ref: 63461451420
+Ref: 63471451504
+Ref: 63481451573
+Ref: 63491451640
+Ref: 63501451707
+Ref: 63511451773
+Ref: 63521451842
+Ref: 63531451908
+Ref: 63541452103
+Node: A.8.51452160
+Node: A.91455514
+Ref: 63551456107
+Ref: 63561456155
+Ref: 63571456277
+Ref: 63581456423
+Ref: 63591456502
+Ref: 63601456593
+Node: A.101457349
+Ref: 63611459575
+Ref: 63621459575
+Ref: 63631459966
+Ref: 63641460290
+Ref: 63651460290
+Ref: 63661460290
+Ref: 63671461590
+Ref: 63681461596
+Ref: 63691461596
+Ref: 63701461596
+Ref: 63711461596
+Ref: 63721462413
+Ref: 63731462413
+Node: A.10.11463862
+Ref: 63741464146
+Ref: 63751464163
+Ref: 63761464209
+Ref: 63771464272
+Ref: 63781464334
+Ref: 63791464384
+Ref: 63801464467
+Ref: 63811464543
+Ref: 63821464597
+Ref: 63831464688
+Ref: 63841464909
+Ref: 63851465106
+Ref: 63861465158
+Ref: 63871465210
+Ref: 63881465283
+Ref: 63891465339
+Ref: 63901465404
+Ref: 63911465466
+Ref: 63921465532
+Ref: 63931465658
+Ref: 63941465709
+Ref: 63951465760
+Ref: 63961465814
+Ref: 63971465865
+Ref: 63981465916
+Ref: 63991465971
+Ref: 64001466022
+Ref: 64011466073
+Ref: 64021466124
+Ref: 64031466187
+Ref: 64041466240
+Ref: 64051466293
+Ref: 64061466350
+Ref: 64071466403
+Ref: 64081466456
+Ref: 64091466540
+Ref: 64101466587
+Ref: 64111466672
+Ref: 64121466743
+Ref: 64131466799
+Ref: 64141466870
+Ref: 64151466926
+Ref: 64161466991
+Ref: 64171467039
+Ref: 64181467104
+Ref: 64191467200
+Ref: 64201467319
+Ref: 64211467388
+Ref: 64221467507
+Ref: 64231467576
+Ref: 64241467643
+Ref: 64251467693
+Ref: 64261467745
+Ref: 64271467777
+Ref: 64281467829
+Ref: 64291467862
+Ref: 64301467929
+Ref: 64311467979
+Ref: 64321468046
+Ref: 64331468096
+Ref: 64341468169
+Ref: 64351468227
+Ref: 64361468300
+Ref: 64371468357
+Ref: 64381468423
+Ref: 64391468472
+Ref: 64401468538
+Ref: 64411468587
+Ref: 64421468653
+Ref: 64431468743
+Ref: 64441468810
+Ref: 64451468859
+Ref: 64461468925
+Ref: 64471468974
+Ref: 64481469150
+Ref: 64491469271
+Ref: 64501469390
+Ref: 64511469454
+Ref: 64521469630
+Ref: 64531469788
+Ref: 64541469852
+Ref: 64551469898
+Ref: 64561469961
+Ref: 64571470007
+Ref: 64581470150
+Ref: 64591470224
+Ref: 64601470287
+Ref: 64611470333
+Ref: 64621470401
+Ref: 64631470564
+Ref: 64641470588
+Ref: 64651470635
+Ref: 64661470700
+Ref: 64671470839
+Ref: 64681470935
+Ref: 64691471149
+Ref: 64701471316
+Ref: 64711471448
+Ref: 64721471671
+Ref: 64731471695
+Ref: 64741471742
+Ref: 64751471807
+Ref: 64761471946
+Ref: 64771472042
+Ref: 64781472256
+Ref: 64791472423
+Ref: 64801472555
+Ref: 64811472846
+Ref: 64821472868
+Ref: 64831472906
+Ref: 64841472955
+Ref: 64851473012
+Ref: 64861473152
+Ref: 64871473248
+Ref: 64881473507
+Ref: 64891473724
+Ref: 64901473855
+Ref: 64911474124
+Ref: 64921474146
+Ref: 64931474191
+Ref: 64941474235
+Ref: 64951474292
+Ref: 64961474432
+Ref: 64971474528
+Ref: 64981474787
+Ref: 64991475004
+Ref: 65001475136
+Ref: 65011475415
+Ref: 65021475439
+Ref: 65031475484
+Ref: 65041475528
+Ref: 65051475585
+Ref: 65061475725
+Ref: 65071475821
+Ref: 65081476080
+Ref: 65091476297
+Ref: 65101476429
+Ref: 65111476768
+Ref: 65121476796
+Ref: 65131476837
+Ref: 65141476909
+Ref: 65151476999
+Ref: 65161477046
+Ref: 65171477264
+Ref: 65181477439
+Ref: 65191477572
+Ref: 65201477763
+Ref: 65211477832
+Ref: 65221477899
+Ref: 65231477966
+Ref: 65241478032
+Ref: 65251478101
+Ref: 65261478167
+Ref: 65271478234
+Ref: 65281478425
+Node: A.10.21478446
+Node: A.10.31480868
+Ref: 65291484202
+Node: A.10.41484822
+Node: A.10.51487355
+Node: A.10.61497385
+Ref: 65301499473
+Node: A.10.71503505
+Ref: 65311505265
+Ref: 65321506620
+Ref: 65331508454
+Ref: 65341509167
+Node: A.10.81511233
+Ref: 65351515746
+Node: A.10.91516636
+Ref: 65361523342
+Node: A.10.101525002
+Node: A.10.111529587
+Ref: 65371530179
+Ref: 65381530203
+Ref: 65391530310
+Ref: 65401530384
+Ref: 65411530496
+Ref: 65421530574
+Ref: 65431530680
+Ref: 65441530755
+Ref: 65451530857
+Node: A.10.121532274
+Ref: 65461532732
+Ref: 65471532756
+Ref: 65481532875
+Ref: 65491532961
+Ref: 65501533085
+Ref: 65511533175
+Ref: 65521533293
+Ref: 65531533380
+Ref: 65541533494
+Node: A.111535127
+Ref: 65551535660
+Ref: 65561535943
+Ref: 65571535943
+Ref: 65581536217
+Ref: 65591536514
+Ref: 65601536516
+Ref: 65611536820
+Ref: 65621536820
+Ref: 65631537346
+Ref: 65641537346
+Node: A.121537892
+Node: A.12.11538394
+Ref: 65651538534
+Ref: 65661539494
+Ref: 65671539494
+Ref: 65681539600
+Ref: 65691539697
+Ref: 65701539768
+Ref: 65711539872
+Ref: 65721539939
+Ref: 65731540011
+Ref: 65741540133
+Ref: 65751540357
+Ref: 65761540550
+Ref: 65771540603
+Ref: 65781540656
+Ref: 65791540730
+Ref: 65801540786
+Ref: 65811540849
+Ref: 65821540909
+Ref: 65831540973
+Ref: 65841541041
+Ref: 65851541113
+Ref: 65861541355
+Ref: 65871541576
+Ref: 65881541841
+Ref: 65891542003
+Ref: 65901542207
+Ref: 65911542285
+Ref: 65921542353
+Ref: 65931542417
+Ref: 65941542498
+Ref: 65951542559
+Ref: 65961542629
+Ref: 65971542697
+Ref: 65981542765
+Ref: 65991542832
+Ref: 66001542902
+Ref: 66011542969
+Ref: 66021543174
+Ref: 66031546568
+Node: A.12.21546901
+Ref: 66041547299
+Ref: 66051547354
+Ref: 66061547434
+Node: A.12.31548058
+Ref: 66071548481
+Ref: 66081548541
+Ref: 66091548621
+Node: A.12.41548808
+Ref: 66101549247
+Ref: 66111549312
+Ref: 66121549394
+Node: A.131549588
+Ref: 66131549977
+Ref: 66141550020
+Ref: 66151550054
+Ref: 66161550088
+Ref: 66171550122
+Ref: 66181550156
+Ref: 66191550190
+Ref: 66201550224
+Ref: 66211550258
+Ref: 66221553765
+Ref: 66231554096
+Ref: 66241554098
+Node: A.141554100
+Ref: 66251554261
+Node: A.151554965
+Ref: 66261555405
+Ref: 66271555467
+Ref: 66281555517
+Ref: 66291555583
+Ref: 66301555626
+Ref: 66311555685
+Ref: 66321555724
+Ref: 66331555781
+Ref: 66341556584
+Node: A.161558451
+Ref: 66351558893
+Ref: 66361558965
+Ref: 66371559021
+Ref: 66381559083
+Ref: 66391559221
+Ref: 66401559286
+Ref: 66411559415
+Ref: 66421559476
+Ref: 66431559532
+Ref: 66441559597
+Ref: 66451559814
+Ref: 66461559881
+Ref: 66471559950
+Ref: 66481560028
+Ref: 66491560095
+Ref: 66501560162
+Ref: 66511560373
+Ref: 66521560489
+Ref: 66531560619
+Ref: 66541560693
+Ref: 66551560766
+Ref: 66561560831
+Ref: 66571560896
+Ref: 66581560961
+Ref: 66591561083
+Ref: 66601561143
+Ref: 66611561207
+Ref: 66621561263
+Ref: 66631561524
+Ref: 66641561589
+Ref: 66651561668
+Ref: 66661562138
+Ref: 66671562244
+Ref: 66681562348
+Ref: 66691562450
+Ref: 66701562552
+Ref: 66711562661
+Ref: 66721562734
+Ref: 66731562805
+Ref: 66741562875
+Ref: 66751563410
+Ref: 66761563412
+Ref: 66771563412
+Ref: 66781563623
+Ref: 66791563625
+Ref: 66801564291
+Ref: 66811564293
+Ref: 66821564484
+Ref: 66831564623
+Ref: 66841578985
+Ref: 66851585833
+Node: A.16.11587837
+Ref: 66861588399
+Ref: 66871588422
+Ref: 66881588494
+Ref: 66891588574
+Ref: 66901588656
+Ref: 66911588739
+Ref: 66921588809
+Ref: 66931588884
+Ref: 66941589000
+Ref: 66951589134
+Ref: 66961589209
+Ref: 66971589280
+Node: A.171593868
+Ref: 66981594026
+Ref: 66991594506
+Ref: 67001594581
+Ref: 67011594645
+Ref: 67021594728
+Ref: 67031594793
+Ref: 67041594859
+Ref: 67051594903
+Ref: 67061594933
+Ref: 67071598027
+Ref: 67081598403
+Node: A.181600058
+Ref: 67091600673
+Ref: 67101600673
+Ref: 67111601132
+Ref: 67121601133
+Ref: 67131601524
+Ref: 67141602179
+Node: A.18.11605157
+Ref: 67151605497
+Ref: 67161605549
+Ref: 67171605610
+Ref: 67181605671
+Node: A.18.21606109
+Ref: 67191606678
+Ref: 67201606678
+Ref: 67211606686
+Ref: 67221606686
+Ref: 67231607213
+Ref: 67241607692
+Ref: 67251607790
+Ref: 67261607958
+Ref: 67271608041
+Ref: 67281608339
+Ref: 67291608420
+Ref: 67301608466
+Ref: 67311608526
+Ref: 67321608598
+Ref: 67331608780
+Ref: 67341608850
+Ref: 67351609311
+Ref: 67361609384
+Ref: 67371609520
+Ref: 67381609591
+Ref: 67391609715
+Ref: 67401609785
+Ref: 67411609843
+Ref: 67421609968
+Ref: 67431610044
+Ref: 67441610178
+Ref: 67451610251
+Ref: 67461610454
+Ref: 67471610653
+Ref: 67481610842
+Ref: 67491610991
+Ref: 67501611220
+Ref: 67511611611
+Ref: 67521611752
+Ref: 67531611935
+Ref: 67541612095
+Ref: 67551612274
+Ref: 67561612431
+Ref: 67571612509
+Ref: 67581612610
+Ref: 67591612713
+Ref: 67601612887
+Ref: 67611613053
+Ref: 67621613272
+Ref: 67631613514
+Ref: 67641613748
+Ref: 67651614035
+Ref: 67661614218
+Ref: 67671614446
+Ref: 67681614561
+Ref: 67691614745
+Ref: 67701614858
+Ref: 67711615039
+Ref: 67721615240
+Ref: 67731615492
+Ref: 67741615675
+Ref: 67751615850
+Ref: 67761615984
+Ref: 67771616116
+Ref: 67781616186
+Ref: 67791616299
+Ref: 67801616407
+Ref: 67811616482
+Ref: 67821616547
+Ref: 67831616637
+Ref: 67841616715
+Ref: 67851616779
+Ref: 67861616868
+Ref: 67871616932
+Ref: 67881616988
+Ref: 67891617056
+Ref: 67901617116
+Ref: 67911617333
+Ref: 67921617514
+Ref: 67931617754
+Ref: 67941617959
+Ref: 67951618124
+Ref: 67961618264
+Ref: 67971618797
+Ref: 67981618842
+Ref: 67991618916
+Ref: 68001618977
+Ref: 68011619667
+Ref: 68021619755
+Ref: 68031621656
+Ref: 68041622083
+Ref: 68051622445
+Ref: 68061622445
+Ref: 68071632834
+Ref: 68081657106
+Ref: 68091658614
+Ref: 68101659001
+Ref: 68111660078
+Ref: 68121660078
+Ref: 68131660673
+Ref: 68141661295
+Ref: 68151661295
+Ref: 68161661912
+Ref: 68171662035
+Node: A.18.31664214
+Ref: 68181664634
+Ref: 68191664636
+Ref: 68201664642
+Ref: 68211665157
+Ref: 68221665528
+Ref: 68231665647
+Ref: 68241665941
+Ref: 68251666021
+Ref: 68261666062
+Ref: 68271666121
+Ref: 68281666192
+Ref: 68291666370
+Ref: 68301666438
+Ref: 68311666506
+Ref: 68321666562
+Ref: 68331666646
+Ref: 68341666843
+Ref: 68351666992
+Ref: 68361667381
+Ref: 68371667522
+Ref: 68381667699
+Ref: 68391667854
+Ref: 68401667928
+Ref: 68411667986
+Ref: 68421668085
+Ref: 68431668317
+Ref: 68441668602
+Ref: 68451668828
+Ref: 68461669010
+Ref: 68471669189
+Ref: 68481669362
+Ref: 68491669494
+Ref: 68501669624
+Ref: 68511669692
+Ref: 68521669799
+Ref: 68531669918
+Ref: 68541670077
+Ref: 68551670288
+Ref: 68561670448
+Ref: 68571670511
+Ref: 68581670599
+Ref: 68591670661
+Ref: 68601670748
+Ref: 68611670811
+Ref: 68621670879
+Ref: 68631670936
+Ref: 68641670996
+Ref: 68651671175
+Ref: 68661671378
+Ref: 68671671540
+Ref: 68681671678
+Ref: 68691672201
+Ref: 68701672246
+Ref: 68711672318
+Ref: 68721672377
+Ref: 68731673125
+Ref: 68741673207
+Ref: 68751674672
+Ref: 68761675310
+Ref: 68771675575
+Ref: 68781675575
+Ref: 68791679857
+Ref: 68801697486
+Ref: 68811699004
+Ref: 68821699299
+Ref: 68831699689
+Ref: 68841700223
+Ref: 68851700223
+Ref: 68861700956
+Ref: 68871700958
+Node: A.18.41702623
+Ref: 68881703123
+Ref: 68891703125
+Ref: 68901703895
+Ref: 68911703973
+Ref: 68921703998
+Ref: 68931704450
+Ref: 68941704456
+Ref: 68951704456
+Ref: 68961704456
+Ref: 68971705401
+Ref: 68981705909
+Ref: 68991706176
+Ref: 69001706176
+Ref: 69011712078
+Ref: 69021721278
+Ref: 69031721665
+Ref: 69041722180
+Ref: 69051722180
+Ref: 69061722763
+Ref: 69071722917
+Node: A.18.51723813
+Ref: 69081724531
+Ref: 69091724634
+Ref: 69101724926
+Ref: 69111725006
+Ref: 69121725045
+Ref: 69131725104
+Ref: 69141725175
+Ref: 69151725349
+Ref: 69161725418
+Ref: 69171725551
+Ref: 69181725618
+Ref: 69191725685
+Ref: 69201725740
+Ref: 69211725804
+Ref: 69221725877
+Ref: 69231726073
+Ref: 69241726294
+Ref: 69251726737
+Ref: 69261726878
+Ref: 69271727054
+Ref: 69281727207
+Ref: 69291727385
+Ref: 69301727541
+Ref: 69311727613
+Ref: 69321727697
+Ref: 69331727794
+Ref: 69341728072
+Ref: 69351728291
+Ref: 69361728462
+Ref: 69371728636
+Ref: 69381728810
+Ref: 69391728924
+Ref: 69401729036
+Ref: 69411729145
+Ref: 69421729218
+Ref: 69431729283
+Ref: 69441729340
+Ref: 69451729457
+Ref: 69461729586
+Ref: 69471729742
+Ref: 69481729831
+Ref: 69491729966
+Ref: 69501730102
+Ref: 69511730716
+Ref: 69521730723
+Ref: 69531731262
+Ref: 69541731766
+Ref: 69551731993
+Ref: 69561732000
+Ref: 69571732000
+Ref: 69581732000
+Ref: 69591732186
+Node: A.18.61736253
+Ref: 69601736885
+Ref: 69611736994
+Ref: 69621737069
+Ref: 69631737361
+Ref: 69641737441
+Ref: 69651737480
+Ref: 69661737539
+Ref: 69671737610
+Ref: 69681737784
+Ref: 69691737851
+Ref: 69701737918
+Ref: 69711737973
+Ref: 69721738037
+Ref: 69731738110
+Ref: 69741738306
+Ref: 69751738527
+Ref: 69761738970
+Ref: 69771739111
+Ref: 69781739287
+Ref: 69791739440
+Ref: 69801739618
+Ref: 69811739774
+Ref: 69821739846
+Ref: 69831739902
+Ref: 69841739999
+Ref: 69851740277
+Ref: 69861740496
+Ref: 69871740667
+Ref: 69881740841
+Ref: 69891741015
+Ref: 69901741129
+Ref: 69911741241
+Ref: 69921741351
+Ref: 69931741414
+Ref: 69941741475
+Ref: 69951741537
+Ref: 69961741613
+Ref: 69971741681
+Ref: 69981741742
+Ref: 69991741817
+Ref: 70001741884
+Ref: 70011741948
+Ref: 70021742004
+Ref: 70031742072
+Ref: 70041742132
+Ref: 70051742238
+Ref: 70061742356
+Ref: 70071742464
+Ref: 70081742576
+Ref: 70091743173
+Ref: 70101743310
+Ref: 70111743818
+Ref: 70121744491
+Ref: 70131744695
+Ref: 70141744702
+Ref: 70151744702
+Ref: 70161744702
+Ref: 70171744702
+Node: A.18.71751337
+Ref: 70181751820
+Ref: 70191751820
+Ref: 70201752592
+Ref: 70211752670
+Ref: 70221752984
+Ref: 70231752990
+Ref: 70241752990
+Ref: 70251752990
+Ref: 70261753965
+Ref: 70271754486
+Ref: 70281754608
+Ref: 70291754608
+Ref: 70301759832
+Ref: 70311769271
+Ref: 70321769478
+Ref: 70331771571
+Ref: 70341773947
+Ref: 70351774335
+Ref: 70361774850
+Ref: 70371774850
+Ref: 70381775450
+Ref: 70391775604
+Node: A.18.81776505
+Ref: 70401777205
+Ref: 70411777308
+Ref: 70421777552
+Ref: 70431777632
+Ref: 70441777671
+Ref: 70451777730
+Ref: 70461777801
+Ref: 70471777975
+Ref: 70481778049
+Ref: 70491778117
+Ref: 70501778187
+Ref: 70511778320
+Ref: 70521778387
+Ref: 70531778454
+Ref: 70541778509
+Ref: 70551778582
+Ref: 70561778778
+Ref: 70571779097
+Ref: 70581779274
+Ref: 70591779346
+Ref: 70601779430
+Ref: 70611779527
+Ref: 70621779750
+Ref: 70631779866
+Ref: 70641779984
+Ref: 70651780102
+Ref: 70661780220
+Ref: 70671780336
+Ref: 70681780446
+Ref: 70691780544
+Ref: 70701780680
+Ref: 70711780792
+Ref: 70721780943
+Ref: 70731781051
+Ref: 70741781196
+Ref: 70751781324
+Ref: 70761781500
+Ref: 70771781567
+Ref: 70781781673
+Ref: 70791781735
+Ref: 70801781799
+Ref: 70811781855
+Ref: 70821781965
+Ref: 70831782125
+Ref: 70841782217
+Ref: 70851782363
+Ref: 70861782510
+Ref: 70871783083
+Ref: 70881783125
+Ref: 70891783192
+Ref: 70901783330
+Ref: 70911783513
+Ref: 70921783633
+Ref: 70931783750
+Ref: 70941783876
+Ref: 70951784012
+Ref: 70961784261
+Ref: 70971784425
+Ref: 70981784617
+Ref: 70991784804
+Ref: 71001785123
+Ref: 71011785396
+Ref: 71021785945
+Ref: 71031786446
+Ref: 71041786630
+Ref: 71051786856
+Ref: 71061786863
+Ref: 71071786863
+Ref: 71081786863
+Ref: 71091787064
+Ref: 71101791355
+Ref: 71111791743
+Node: A.18.91792148
+Ref: 71121792751
+Ref: 71131792860
+Ref: 71141792943
+Ref: 71151793187
+Ref: 71161793267
+Ref: 71171793306
+Ref: 71181793365
+Ref: 71191793436
+Ref: 71201793610
+Ref: 71211793685
+Ref: 71221793753
+Ref: 71231793820
+Ref: 71241793887
+Ref: 71251793942
+Ref: 71261794015
+Ref: 71271794211
+Ref: 71281794530
+Ref: 71291794707
+Ref: 71301794779
+Ref: 71311794835
+Ref: 71321794932
+Ref: 71331795155
+Ref: 71341795271
+Ref: 71351795389
+Ref: 71361795507
+Ref: 71371795625
+Ref: 71381795741
+Ref: 71391795851
+Ref: 71401795914
+Ref: 71411795976
+Ref: 71421796074
+Ref: 71431796210
+Ref: 71441796322
+Ref: 71451796473
+Ref: 71461796581
+Ref: 71471796726
+Ref: 71481796854
+Ref: 71491797031
+Ref: 71501797098
+Ref: 71511797204
+Ref: 71521797266
+Ref: 71531797342
+Ref: 71541797403
+Ref: 71551797478
+Ref: 71561797542
+Ref: 71571797598
+Ref: 71581797666
+Ref: 71591797726
+Ref: 71601797847
+Ref: 71611797970
+Ref: 71621798097
+Ref: 71631798758
+Ref: 71641798895
+Ref: 71651799522
+Ref: 71661799565
+Ref: 71671799664
+Ref: 71681799732
+Ref: 71691799874
+Ref: 71701800060
+Ref: 71711800182
+Ref: 71721800301
+Ref: 71731800430
+Ref: 71741800561
+Ref: 71751800696
+Ref: 71761800820
+Ref: 71771801073
+Ref: 71781801237
+Ref: 71791801429
+Ref: 71801801616
+Ref: 71811802081
+Ref: 71821802625
+Ref: 71831802809
+Ref: 71841803018
+Ref: 71851803025
+Ref: 71861803025
+Ref: 71871803025
+Ref: 71881803025
+Ref: 71891809376
+Node: A.18.101810273
+Ref: 71901810774
+Ref: 71911810774
+Ref: 71921810787
+Ref: 71931810974
+Ref: 71941811398
+Ref: 71951811400
+Ref: 71961811400
+Ref: 71971811726
+Ref: 71981811872
+Ref: 71991811994
+Ref: 72001812259
+Ref: 72011812609
+Ref: 72021812718
+Ref: 72031813012
+Ref: 72041813093
+Ref: 72051813135
+Ref: 72061813193
+Ref: 72071813263
+Ref: 72081813376
+Ref: 72091813574
+Ref: 72101813641
+Ref: 72111813713
+Ref: 72121813794
+Ref: 72131813862
+Ref: 72141813929
+Ref: 72151813996
+Ref: 72161814059
+Ref: 72171814115
+Ref: 72181814188
+Ref: 72191814385
+Ref: 72201814534
+Ref: 72211814752
+Ref: 72221814919
+Ref: 72231815058
+Ref: 72241815233
+Ref: 72251815386
+Ref: 72261815458
+Ref: 72271815516
+Ref: 72281815615
+Ref: 72291815736
+Ref: 72301815863
+Ref: 72311815969
+Ref: 72321816091
+Ref: 72331816235
+Ref: 72341816375
+Ref: 72351816496
+Ref: 72361816634
+Ref: 72371816781
+Ref: 72381816901
+Ref: 72391817030
+Ref: 72401817102
+Ref: 72411817182
+Ref: 72421817497
+Ref: 72431817871
+Ref: 72441818180
+Ref: 72451818440
+Ref: 72461818696
+Ref: 72471818825
+Ref: 72481819062
+Ref: 72491819365
+Ref: 72501819610
+Ref: 72511819953
+Ref: 72521820229
+Ref: 72531820294
+Ref: 72541820362
+Ref: 72551820444
+Ref: 72561820511
+Ref: 72571820592
+Ref: 72581820663
+Ref: 72591820739
+Ref: 72601820804
+Ref: 72611820873
+Ref: 72621821018
+Ref: 72631821170
+Ref: 72641821943
+Ref: 72651822025
+Ref: 72661823543
+Ref: 72671824133
+Ref: 72681824396
+Ref: 72691824396
+Ref: 72701831371
+Ref: 72711862443
+Ref: 72721862831
+Ref: 72731863360
+Ref: 72741863360
+Ref: 72751863949
+Node: A.18.111865335
+Ref: 72761865948
+Node: A.18.121866877
+Ref: 72771867573
+Node: A.18.131868320
+Ref: 72781868924
+Node: A.18.141869710
+Ref: 72791870319
+Node: A.18.151871106
+Ref: 72801871695
+Node: A.18.161872181
+Ref: 72811872775
+Node: A.18.171873262
+Ref: 72821873872
+Node: A.18.181874712
+Ref: 72831875346
+Ref: 72841875674
+Ref: 72851875791
+Ref: 72861875879
+Ref: 72871876003
+Ref: 72881876077
+Ref: 72891876147
+Ref: 72901876205
+Ref: 72911876279
+Ref: 72921876416
+Ref: 72931876561
+Ref: 72941876710
+Ref: 72951876871
+Ref: 72961877007
+Ref: 72971877121
+Ref: 72981877222
+Ref: 72991877298
+Ref: 73001877360
+Ref: 73011878098
+Ref: 73021878642
+Ref: 73031879068
+Ref: 73041879068
+Ref: 73051882483
+Ref: 73061884939
+Ref: 73071885334
+Ref: 73081886005
+Node: A.18.191886663
+Ref: 73091888141
+Ref: 73101888676
+Node: A.18.201889768
+Ref: 73111891197
+Ref: 73121892002
+Ref: 73131892531
+Node: A.18.211893530
+Ref: 73141895045
+Ref: 73151895367
+Ref: 73161896174
+Ref: 73171896700
+Node: A.18.221897790
+Ref: 73181899179
+Ref: 73191899673
+Ref: 73201900199
+Node: A.18.231901292
+Ref: 73211902790
+Ref: 73221903112
+Ref: 73231903915
+Ref: 73241904441
+Node: A.18.241905426
+Ref: 73251906813
+Ref: 73261907303
+Ref: 73271907829
+Node: A.18.251908817
+Ref: 73281911142
+Ref: 73291911671
+Node: A.18.261912660
+Ref: 73301913446
+Ref: 73311914305
+Ref: 73321914714
+Ref: 73331915675
+Ref: 73341915994
+Ref: 73351917354
+Node: A.18.271918159
+Ref: 73361918854
+Ref: 73371918925
+Ref: 73381918981
+Ref: 73391919151
+Ref: 73401919320
+Ref: 73411919400
+Ref: 73421919745
+Node: A.18.281921095
+Ref: 73431921867
+Ref: 73441922073
+Ref: 73451922276
+Ref: 73461922370
+Ref: 73471922472
+Ref: 73481922545
+Node: A.18.291922916
+Ref: 73491923720
+Ref: 73501923924
+Ref: 73511924185
+Ref: 73521924279
+Ref: 73531924381
+Ref: 73541924454
+Node: A.18.301925041
+Ref: 73551926045
+Ref: 73561926247
+Ref: 73571926450
+Ref: 73581926544
+Ref: 73591926651
+Ref: 73601926878
+Ref: 73611926951
+Node: A.18.311928500
+Ref: 73621929536
+Ref: 73631929736
+Ref: 73641929995
+Ref: 73651930089
+Ref: 73661930196
+Ref: 73671930423
+Ref: 73681930496
+Node: A.18.321931085
+Node: A.191935877
+Ref: 73691936004
+Ref: 73701936301
+Ref: 73711936396
+Ref: 73721936546
+Ref: 73731936690
+Ref: 73741936750
+Ref: 73751936826
+Ref: 73761936874
+Ref: 73771936954
+Ref: 73781936954
+Node: Annex B1937707
+Ref: 73791937864
+Ref: 73801937864
+Ref: 73811937864
+Node: B.11938976
+Ref: 73821939225
+Ref: 73831939225
+Ref: 73841939231
+Ref: 73851939231
+Ref: 73861939498
+Ref: 73871939499
+Ref: 73881940070
+Ref: 73891940070
+Ref: 73901940070
+Ref: 73911940070
+Ref: 73921940070
+Ref: 73931940072
+Ref: 73941940072
+Ref: 73951940072
+Ref: 73961940072
+Ref: 73971940099
+Ref: 73981940099
+Ref: 73991940841
+Ref: 74001940842
+Ref: 74011940866
+Ref: 74021941191
+Ref: 74031941226
+Ref: 74041941324
+Ref: 74051941771
+Ref: 74061941842
+Ref: 74071942260
+Ref: 74081943621
+Ref: 74091943738
+Ref: 74101943738
+Ref: 74111945458
+Ref: 74121945656
+Ref: 74131946539
+Ref: 74141946539
+Ref: 74151946851
+Ref: 74161947696
+Ref: 74171947698
+Ref: 74181947698
+Ref: 74191947698
+Node: B.21949916
+Ref: 74201950464
+Ref: 74211951194
+Ref: 74221951194
+Ref: 74231951194
+Ref: 74241951194
+Ref: 74251951194
+Ref: 74261951702
+Ref: 74271951702
+Ref: 74281951711
+Ref: 74291951711
+Node: B.31953382
+Ref: 74301953521
+Ref: 74311953521
+Ref: 74321954243
+Ref: 74331954327
+Ref: 74341954403
+Ref: 74351954482
+Ref: 74361954560
+Ref: 74371954693
+Ref: 74381954747
+Ref: 74391954801
+Ref: 74401954858
+Ref: 74411954962
+Ref: 74421955023
+Ref: 74431955084
+Ref: 74441955149
+Ref: 74451955250
+Ref: 74461955307
+Ref: 74471955369
+Ref: 74481955458
+Ref: 74491955523
+Ref: 74501955588
+Ref: 74511955694
+Ref: 74521955754
+Ref: 74531955829
+Ref: 74541955892
+Ref: 74551955953
+Ref: 74561956102
+Ref: 74571956180
+Ref: 74581956321
+Ref: 74591956459
+Ref: 74601956673
+Ref: 74611956933
+Ref: 74621956996
+Ref: 74631957079
+Ref: 74641957146
+Ref: 74651957222
+Ref: 74661957364
+Ref: 74671957443
+Ref: 74681957590
+Ref: 74691957734
+Ref: 74701957954
+Ref: 74711958265
+Ref: 74721958331
+Ref: 74731958421
+Ref: 74741958487
+Ref: 74751958559
+Ref: 74761958709
+Ref: 74771958785
+Ref: 74781958933
+Ref: 74791959082
+Ref: 74801959308
+Ref: 74811959530
+Ref: 74821959597
+Ref: 74831959688
+Ref: 74841959759
+Ref: 74851959837
+Ref: 74861959989
+Ref: 74871960065
+Ref: 74881960219
+Ref: 74891960374
+Ref: 74901960605
+Ref: 74911960817
+Ref: 74921963955
+Ref: 74931964396
+Ref: 74941969915
+Ref: 74951969915
+Node: B.3.11975185
+Ref: 74961975924
+Ref: 74971975979
+Ref: 74981976041
+Ref: 74991976137
+Ref: 75001976208
+Ref: 75011976264
+Ref: 75021976425
+Ref: 75031976505
+Ref: 75041976574
+Ref: 75051976613
+Ref: 75061976670
+Ref: 75071976738
+Ref: 75081976837
+Ref: 75091976901
+Ref: 75101976996
+Ref: 75111977062
+Ref: 75121977267
+Ref: 75131977453
+Ref: 75141981929
+Ref: 75151982194
+Ref: 75161982306
+Ref: 75171982363
+Node: B.3.21982976
+Ref: 75181984256
+Ref: 75191984312
+Ref: 75201984363
+Ref: 75211984517
+Ref: 75221984629
+Ref: 75231985218
+Ref: 75241985310
+Ref: 75251985446
+Ref: 75261985618
+Ref: 75271985854
+Ref: 75281988893
+Ref: 75291988982
+Ref: 75301989126
+Ref: 75311989344
+Ref: 75321989497
+Ref: 75331989824
+Node: B.3.31991587
+Ref: 75341991708
+Ref: 75351992529
+Ref: 75361992529
+Ref: 75371992616
+Ref: 75381992616
+Ref: 75391992616
+Ref: 75401993574
+Ref: 75411995644
+Ref: 75421995914
+Node: B.41997564
+Ref: 75431997695
+Ref: 75441997695
+Ref: 75451998708
+Ref: 75461998829
+Ref: 75471998892
+Ref: 75481998959
+Ref: 75491999019
+Ref: 75501999073
+Ref: 75511999144
+Ref: 75521999231
+Ref: 75531999294
+Ref: 75541999396
+Ref: 75551999463
+Ref: 75561999556
+Ref: 75571999661
+Ref: 75581999765
+Ref: 75591999831
+Ref: 75601999902
+Ref: 75612000072
+Ref: 75622000227
+Ref: 75632000375
+Ref: 75642000409
+Ref: 75652000465
+Ref: 75662000521
+Ref: 75672000577
+Ref: 75682000633
+Ref: 75692000703
+Ref: 75702000736
+Ref: 75712000788
+Ref: 75722000840
+Ref: 75732000906
+Ref: 75742000939
+Ref: 75752000991
+Ref: 75762001128
+Ref: 75772001178
+Ref: 75782001255
+Ref: 75792001369
+Ref: 75802001492
+Ref: 75812001615
+Ref: 75822001691
+Ref: 75832001820
+Ref: 75842002031
+Ref: 75852002160
+Ref: 75862002235
+Ref: 75872002370
+Ref: 75882002590
+Ref: 75892002715
+Ref: 75902002786
+Ref: 75912002917
+Ref: 75922003135
+Ref: 75932003202
+Ref: 75942003273
+Ref: 75952003340
+Ref: 75962005103
+Node: B.52016699
+Ref: 75972016822
+Ref: 75982016822
+Ref: 75992017641
+Ref: 76002017688
+Ref: 76012017755
+Ref: 76022017821
+Ref: 76032017890
+Ref: 76042017933
+Ref: 76052018041
+Ref: 76062018116
+Ref: 76072018174
+Ref: 76082018238
+Ref: 76092018316
+Ref: 76102018393
+Ref: 76112018500
+Ref: 76122018572
+Ref: 76132018644
+Ref: 76142018717
+Ref: 76152018795
+Ref: 76162018976
+Node: Annex C2022815
+Ref: 76172022954
+Ref: 76182022954
+Ref: 76192022954
+Ref: 76202022954
+Ref: 76212022954
+Ref: 76222022954
+Node: C.12023437
+Ref: 76232023723
+Ref: 76242024210
+Ref: 76252024210
+Ref: 76262024210
+Ref: 76272024210
+Node: C.22026563
+Ref: 76282026877
+Node: C.32027005
+Ref: 76292027252
+Ref: 76302027305
+Ref: 76312027406
+Ref: 76322027513
+Ref: 76332027642
+Ref: 76342027742
+Ref: 76352027830
+Ref: 76362027972
+Ref: 76372027974
+Ref: 76382028252
+Ref: 76392028254
+Ref: 76402028878
+Node: C.3.12034428
+Ref: 76412035111
+Ref: 76422035111
+Ref: 76432035303
+Ref: 76442035303
+Ref: 76452035654
+Ref: 76462036139
+Ref: 76472036139
+Ref: 76482036474
+Ref: 76492036476
+Ref: 76502036541
+Ref: 76512036655
+Ref: 76522036655
+Ref: 76532036655
+Ref: 76542037010
+Ref: 76552037063
+Ref: 76562037863
+Ref: 76572038130
+Ref: 76582039914
+Node: C.3.22041193
+Ref: 76592041429
+Ref: 76602041508
+Ref: 76612041563
+Ref: 76622041687
+Ref: 76632041773
+Ref: 76642041859
+Ref: 76652041964
+Ref: 76662042096
+Ref: 76672042283
+Ref: 76682042361
+Ref: 76692042457
+Ref: 76702042673
+Ref: 76712043703
+Ref: 76722044479
+Ref: 76732044772
+Ref: 76742045093
+Node: C.42047038
+Ref: 76752047526
+Ref: 76762047906
+Node: C.52049572
+Ref: 76772050007
+Ref: 76782050007
+Ref: 76792050392
+Ref: 76802050392
+Ref: 76812050508
+Ref: 76822050509
+Ref: 76832050532
+Ref: 76842050716
+Ref: 76852050718
+Ref: 76862051444
+Ref: 76872051444
+Node: C.62052736
+Ref: 76882053308
+Ref: 76892053308
+Ref: 76902053385
+Ref: 76912053385
+Ref: 76922053456
+Ref: 76932053456
+Ref: 76942053738
+Ref: 76952053738
+Ref: 76962053831
+Ref: 76972053831
+Ref: 76982054105
+Ref: 76992054105
+Ref: 77002054297
+Ref: 77012054634
+Ref: 77022055416
+Ref: 77032055416
+Ref: 77042055693
+Ref: 77052058345
+Ref: 77062058452
+Ref: 77072058863
+Node: C.72059881
+Node: C.7.12060420
+Ref: 77082060704
+Ref: 77092060768
+Ref: 77102060846
+Ref: 77112060969
+Ref: 77122061039
+Ref: 77132061090
+Ref: 77142061141
+Ref: 77152061205
+Ref: 77162061276
+Ref: 77172061347
+Ref: 77182062944
+Ref: 77192062959
+Ref: 77202063153
+Ref: 77212063168
+Ref: 77222063485
+Ref: 77232063612
+Ref: 77242063612
+Ref: 77252063737
+Ref: 77262063868
+Ref: 77272064014
+Node: C.7.22064843
+Ref: 77282065285
+Ref: 77292065302
+Ref: 77302065364
+Ref: 77312065447
+Ref: 77322065542
+Ref: 77332065651
+Ref: 77342066831
+Ref: 77352066946
+Ref: 77362067348
+Ref: 77372067833
+Ref: 77382068033
+Ref: 77392068233
+Node: C.7.32073181
+Ref: 77402073519
+Ref: 77412073585
+Ref: 77422073668
+Ref: 77432073900
+Ref: 77442073994
+Ref: 77452074075
+Ref: 77462074216
+Ref: 77472074398
+Ref: 77482074398
+Ref: 77492075497
+Ref: 77502075497
+Ref: 77512075497
+Ref: 77522075497
+Ref: 77532075497
+Ref: 77542075497
+Node: Annex D2077746
+Ref: 77552077881
+Ref: 77562077881
+Node: D.12081165
+Ref: 77572081912
+Ref: 77582081912
+Ref: 77592082048
+Ref: 77602082048
+Ref: 77612083579
+Ref: 77622083579
+Ref: 77632083579
+Ref: 77642083579
+Ref: 77652083579
+Ref: 77662084566
+Ref: 77672084972
+Ref: 77682084974
+Node: D.22087636
+Node: D.2.12088155
+Ref: 77692088537
+Ref: 77702088603
+Ref: 77712088619
+Ref: 77722089210
+Ref: 77732089210
+Ref: 77742089210
+Ref: 77752089210
+Ref: 77762089604
+Ref: 77772089604
+Ref: 77782089604
+Ref: 77792089604
+Ref: 77802089604
+Ref: 77812089604
+Ref: 77822090399
+Ref: 77832091871
+Node: D.2.22093567
+Ref: 77842094027
+Ref: 77852094028
+Ref: 77862094061
+Ref: 77872094172
+Ref: 77882094173
+Ref: 77892094224
+Ref: 77902094253
+Ref: 77912094286
+Ref: 77922095855
+Ref: 77932095855
+Ref: 77942095981
+Ref: 77952095983
+Ref: 77962096350
+Ref: 77972096765
+Node: D.2.32098157
+Ref: 77982098482
+Ref: 77992098482
+Ref: 78002099571
+Ref: 78012099571
+Ref: 78022099985
+Ref: 78032100313
+Node: D.2.42101405
+Ref: 78042101757
+Ref: 78052101757
+Ref: 78062101873
+Ref: 78072101935
+Ref: 78082101969
+Ref: 78092103577
+Ref: 78102103577
+Node: D.2.52104770
+Ref: 78112105153
+Ref: 78122105153
+Ref: 78132105305
+Ref: 78142105308
+Ref: 78152105428
+Ref: 78162105557
+Ref: 78172105689
+Ref: 78182105794
+Node: D.2.62108753
+Ref: 78192109537
+Ref: 78202109537
+Ref: 78212109698
+Ref: 78222109714
+Ref: 78232109748
+Ref: 78242109854
+Ref: 78252110021
+Ref: 78262110195
+Ref: 78272110666
+Ref: 78282110666
+Ref: 78292115087
+Ref: 78302115463
+Node: D.32116514
+Ref: 78312116962
+Ref: 78322116963
+Ref: 78332116987
+Ref: 78342117061
+Ref: 78352117132
+Ref: 78362117197
+Ref: 78372117197
+Ref: 78382117300
+Ref: 78392118108
+Ref: 78402118605
+Ref: 78412118607
+Ref: 78422118702
+Ref: 78432118702
+Ref: 78442118713
+Ref: 78452120090
+Ref: 78462120090
+Ref: 78472120090
+Ref: 78482120564
+Ref: 78492120716
+Ref: 78502121012
+Node: D.42123721
+Ref: 78512123852
+Ref: 78522124133
+Ref: 78532124134
+Ref: 78542124158
+Ref: 78552124232
+Ref: 78562124318
+Ref: 78572124383
+Ref: 78582124383
+Ref: 78592124484
+Ref: 78602124930
+Ref: 78612124930
+Ref: 78622125061
+Ref: 78632125061
+Ref: 78642125070
+Node: D.52127757
+Node: D.5.12128084
+Ref: 78652128539
+Ref: 78662128612
+Ref: 78672128826
+Ref: 78682129318
+Ref: 78692129373
+Ref: 78702129744
+Node: D.5.22132556
+Ref: 78712132969
+Ref: 78722132984
+Ref: 78732134050
+Node: D.62134991
+Node: D.72138070
+Ref: 78742138490
+Ref: 78752138490
+Ref: 78762138608
+Ref: 78772138608
+Ref: 78782139041
+Ref: 78792139041
+Ref: 78802139196
+Ref: 78812139196
+Ref: 78822139315
+Ref: 78832139315
+Ref: 78842139767
+Ref: 78852139771
+Ref: 78862139771
+Ref: 78872140248
+Ref: 78882140250
+Ref: 78892140257
+Ref: 78902140257
+Ref: 78912140544
+Ref: 78922140544
+Ref: 78932141116
+Ref: 78942141116
+Ref: 78952141220
+Ref: 78962141220
+Ref: 78972141316
+Ref: 78982141316
+Ref: 78992141799
+Ref: 79002141808
+Ref: 79012141808
+Ref: 79022142035
+Ref: 79032142035
+Ref: 79042142113
+Ref: 79052142113
+Ref: 79062142189
+Ref: 79072142189
+Ref: 79082142390
+Ref: 79092142390
+Ref: 79102142910
+Ref: 79112142910
+Ref: 79122143207
+Ref: 79132143207
+Ref: 79142143333
+Ref: 79152143333
+Ref: 79162144008
+Ref: 79172144010
+Ref: 79182144132
+Ref: 79192144132
+Ref: 79202144545
+Ref: 79212144545
+Ref: 79222144850
+Ref: 79232144851
+Ref: 79242144851
+Ref: 79252144924
+Ref: 79262144924
+Ref: 79272145432
+Ref: 79282145433
+Ref: 79292145433
+Ref: 79302145505
+Ref: 79312145505
+Ref: 79322145980
+Ref: 79332145981
+Ref: 79342145981
+Ref: 79352146055
+Ref: 79362146055
+Ref: 79372146333
+Ref: 79382146342
+Ref: 79392146342
+Ref: 79402147052
+Node: D.82147608
+Ref: 79412147928
+Ref: 79422147944
+Ref: 79432147963
+Ref: 79442147998
+Ref: 79452148032
+Ref: 79462148114
+Ref: 79472148138
+Ref: 79482148183
+Ref: 79492148227
+Ref: 79502148271
+Ref: 79512148318
+Ref: 79522148366
+Ref: 79532149732
+Ref: 79542149794
+Ref: 79552149862
+Ref: 79562149924
+Ref: 79572149986
+Ref: 79582150048
+Ref: 79592150110
+Ref: 79602150172
+Ref: 79612150242
+Ref: 79622150322
+Ref: 79632150471
+Ref: 79642150882
+Ref: 79652150882
+Ref: 79662152377
+Ref: 79672154902
+Ref: 79682156416
+Node: D.92158130
+Ref: 79692159128
+Ref: 79702159128
+Ref: 79712160705
+Ref: 79722160705
+Node: D.102162129
+Ref: 79732162618
+Ref: 79742162688
+Ref: 79752162743
+Ref: 79762162800
+Ref: 79772162857
+Ref: 79782162927
+Ref: 79792163241
+Ref: 79802163260
+Ref: 79812164030
+Ref: 79822164030
+Ref: 79832164030
+Node: D.10.12165133
+Ref: 79842165555
+Ref: 79852165628
+Ref: 79862165709
+Ref: 79872165808
+Node: D.112167447
+Ref: 79882167957
+Ref: 79892168030
+Ref: 79902168093
+Ref: 79912168159
+Ref: 79922168320
+Ref: 79932168320
+Ref: 79942168320
+Ref: 79952169293
+Ref: 79962169338
+Ref: 79972169449
+Node: D.122171662
+Node: D.132174487
+Ref: 79982174666
+Node: D.142177720
+Ref: 79992178143
+Ref: 80002178162
+Ref: 80012178186
+Ref: 80022178230
+Ref: 80032178274
+Ref: 80042178349
+Ref: 80052178407
+Ref: 80062179133
+Ref: 80072179234
+Ref: 80082179350
+Ref: 80092179440
+Ref: 80102179563
+Ref: 80112179702
+Ref: 80122179702
+Ref: 80132181190
+Ref: 80142182597
+Node: D.14.12184686
+Ref: 80152185132
+Ref: 80162185151
+Ref: 80172185304
+Ref: 80182185388
+Ref: 80192185504
+Ref: 80202185674
+Ref: 80212185842
+Ref: 80222185911
+Ref: 80232186038
+Ref: 80242186092
+Ref: 80252186651
+Ref: 80262186653
+Ref: 80272186827
+Ref: 80282187984
+Ref: 80292189486
+Node: D.14.22190413
+Ref: 80302190884
+Ref: 80312190902
+Ref: 80322191072
+Ref: 80332191180
+Ref: 80342191302
+Ref: 80352191418
+Ref: 80362191540
+Ref: 80372191666
+Ref: 80382191792
+Ref: 80392191890
+Ref: 80402191959
+Ref: 80412192033
+Ref: 80422192106
+Ref: 80432192177
+Ref: 80442192255
+Ref: 80452192381
+Ref: 80462192473
+Ref: 80472192589
+Ref: 80482192870
+Ref: 80492193333
+Ref: 80502193333
+Ref: 80512193333
+Ref: 80522193597
+Ref: 80532193599
+Ref: 80542197458
+Node: D.14.32198341
+Ref: 80552198784
+Ref: 80562198802
+Ref: 80572198897
+Node: D.152200084
+Ref: 80582200536
+Ref: 80592200554
+Ref: 80602200606
+Ref: 80612200722
+Ref: 80622200898
+Ref: 80632201078
+Ref: 80642201175
+Ref: 80652201304
+Ref: 80662201583
+Ref: 80672201802
+Ref: 80682201804
+Ref: 80692201991
+Node: D.162205164
+Ref: 80702205534
+Ref: 80712205599
+Ref: 80722205652
+Ref: 80732205719
+Ref: 80742205785
+Ref: 80752206312
+Ref: 80762206312
+Node: D.16.12207808
+Ref: 80772208316
+Ref: 80782208325
+Ref: 80792208386
+Ref: 80802208438
+Ref: 80812208522
+Ref: 80822208610
+Ref: 80832208688
+Ref: 80842208770
+Ref: 80852208837
+Ref: 80862208911
+Ref: 80872208992
+Ref: 80882209195
+Ref: 80892209464
+Ref: 80902209644
+Ref: 80912209823
+Ref: 80922210069
+Ref: 80932210934
+Ref: 80942210934
+Node: Annex E2216428
+Ref: 80952216787
+Ref: 80962216787
+Ref: 80972216787
+Ref: 80982217094
+Ref: 80992217237
+Node: E.12218536
+Ref: 81002218765
+Ref: 81012218765
+Ref: 81022219546
+Ref: 81032219691
+Ref: 81042219984
+Ref: 81052219984
+Ref: 81062219984
+Ref: 81072219984
+Ref: 81082220578
+Ref: 81092220593
+Ref: 81102220972
+Ref: 81112221103
+Node: E.22222814
+Ref: 81122223227
+Ref: 81132223227
+Ref: 81142223227
+Ref: 81152223227
+Ref: 81162223227
+Ref: 81172223227
+Ref: 81182223922
+Ref: 81192224058
+Ref: 81202224190
+Ref: 81212224300
+Node: E.2.12225857
+Ref: 81222226365
+Ref: 81232226370
+Ref: 81242226437
+Ref: 81252226438
+Ref: 81262226469
+Ref: 81272226527
+Ref: 81282226663
+Ref: 81292226663
+Ref: 81302227464
+Ref: 81312227464
+Ref: 81322227783
+Ref: 81332227985
+Ref: 81342227985
+Ref: 81352227985
+Node: E.2.22228285
+Ref: 81362228594
+Ref: 81372228599
+Ref: 81382228664
+Ref: 81392228665
+Ref: 81402228694
+Ref: 81412228752
+Ref: 81422228882
+Ref: 81432228882
+Ref: 81442229575
+Ref: 81452229713
+Ref: 81462229715
+Node: E.2.32233562
+Ref: 81472233906
+Ref: 81482233911
+Ref: 81492233985
+Ref: 81502233986
+Ref: 81512234024
+Ref: 81522234109
+Ref: 81532234110
+Ref: 81542234143
+Ref: 81552234154
+Ref: 81562234159
+Ref: 81572234261
+Ref: 81582234261
+Ref: 81592234261
+Ref: 81602234261
+Ref: 81612234261
+Ref: 81622234411
+Ref: 81632234411
+Ref: 81642235795
+Ref: 81652235796
+Ref: 81662236266
+Ref: 81672236266
+Ref: 81682236266
+Node: E.32237636
+Ref: 81692238062
+Ref: 81702238077
+Ref: 81712238273
+Ref: 81722238288
+Ref: 81732238502
+Ref: 81742238845
+Ref: 81752239233
+Ref: 81762239233
+Ref: 81772239647
+Node: E.42239813
+Ref: 81782239944
+Ref: 81792239944
+Ref: 81802239944
+Ref: 81812239944
+Ref: 81822239944
+Ref: 81832241458
+Ref: 81842241458
+Ref: 81852241458
+Ref: 81862242148
+Ref: 81872242148
+Ref: 81882242453
+Ref: 81892242893
+Ref: 81902243895
+Ref: 81912243895
+Ref: 81922243995
+Ref: 81932243995
+Ref: 81942244286
+Ref: 81952244444
+Ref: 81962244444
+Ref: 81972244797
+Node: E.4.12246293
+Ref: 81982247031
+Ref: 81992247031
+Ref: 82002247890
+Ref: 82012247890
+Node: E.4.22248508
+Node: E.52252518
+Ref: 82022252659
+Ref: 82032252659
+Ref: 82042253059
+Ref: 82052253076
+Ref: 82062253135
+Ref: 82072253189
+Ref: 82082253352
+Ref: 82092253540
+Ref: 82102253701
+Ref: 82112253906
+Ref: 82122254067
+Ref: 82132254226
+Ref: 82142255524
+Ref: 82152255901
+Ref: 82162256570
+Ref: 82172256570
+Node: Annex F2259263
+Ref: 82182259402
+Node: F.12261263
+Ref: 82192261464
+Ref: 82202261464
+Ref: 82212261746
+Ref: 82222261746
+Node: F.22262095
+Ref: 82232262353
+Ref: 82242262390
+Ref: 82252262448
+Ref: 82262262509
+Ref: 82272262561
+Ref: 82282262616
+Ref: 82292262935
+Node: F.32264630
+Ref: 82302264922
+Node: F.3.12269840
+Ref: 82312269967
+Ref: 82322269967
+Node: F.3.22277025
+Ref: 82332278266
+Node: F.3.32289263
+Ref: 82342290018
+Ref: 82352290035
+Ref: 82362290075
+Ref: 82372290210
+Ref: 82382290366
+Ref: 82392290433
+Ref: 82402290490
+Ref: 82412290561
+Ref: 82422290606
+Ref: 82432290663
+Ref: 82442290720
+Ref: 82452290777
+Ref: 82462291307
+Ref: 82472291345
+Ref: 82482291500
+Ref: 82492291699
+Ref: 82502292128
+Ref: 82512292575
+Ref: 82522292969
+Node: F.3.42300088
+Ref: 82532300289
+Ref: 82542300289
+Node: F.3.52300926
+Ref: 82552301125
+Ref: 82562301125
+Node: Annex G2301812
+Ref: 82572301929
+Node: G.12303506
+Node: G.1.12304445
+Ref: 82582304701
+Ref: 82592304845
+Ref: 82602304949
+Ref: 82612305033
+Ref: 82622305065
+Ref: 82632305114
+Ref: 82642305168
+Ref: 82652305222
+Ref: 82662305280
+Ref: 82672305377
+Ref: 82682305474
+Ref: 82692305575
+Ref: 82702305652
+Ref: 82712305729
+Ref: 82722305809
+Ref: 82732305951
+Ref: 82742306015
+Ref: 82752306127
+Ref: 82762306229
+Ref: 82772306457
+Ref: 82782306976
+Ref: 82792309718
+Ref: 82802313414
+Ref: 82812313414
+Ref: 82822313414
+Ref: 82832313756
+Ref: 82842314111
+Node: G.1.22320184
+Ref: 82852320545
+Ref: 82862320815
+Ref: 82872320869
+Ref: 82882320923
+Ref: 82892320977
+Ref: 82902321262
+Ref: 82912321313
+Ref: 82922321364
+Ref: 82932321415
+Ref: 82942321469
+Ref: 82952321523
+Ref: 82962321577
+Ref: 82972321631
+Ref: 82982321688
+Ref: 82992321740
+Ref: 83002321792
+Ref: 83012321844
+Ref: 83022321899
+Ref: 83032321954
+Ref: 83042322009
+Ref: 83052322064
+Ref: 83062322170
+Ref: 83072326681
+Ref: 83082326681
+Ref: 83092326681
+Ref: 83102327635
+Ref: 83112328020
+Ref: 83122330594
+Ref: 83132331396
+Node: G.1.32332275
+Ref: 83142332953
+Ref: 83152333126
+Ref: 83162333161
+Ref: 83172333210
+Ref: 83182333263
+Ref: 83192333401
+Ref: 83202333496
+Ref: 83212333749
+Ref: 83222333961
+Ref: 83232334091
+Ref: 83242334314
+Node: G.1.42340986
+Ref: 83252341193
+Ref: 83262341193
+Node: G.1.52341604
+Ref: 83272341809
+Ref: 83282341809
+Node: G.22342240
+Ref: 83292342441
+Ref: 83302342441
+Ref: 83312342923
+Node: G.2.12343518
+Ref: 83322344540
+Ref: 83332344834
+Ref: 83342344937
+Ref: 83352345326
+Ref: 83362345719
+Ref: 83372346682
+Ref: 83382346682
+Ref: 83392346961
+Node: G.2.22347925
+Ref: 83402348466
+Ref: 83412348466
+Ref: 83422349197
+Ref: 83432349197
+Ref: 83442349545
+Ref: 83452349545
+Ref: 83462350365
+Ref: 83472350365
+Ref: 83482351183
+Ref: 83492351185
+Ref: 83502351185
+Ref: 83512351533
+Ref: 83522351535
+Node: G.2.32352994
+Ref: 83532354358
+Ref: 83542354528
+Ref: 83552360172
+Ref: 83562360174
+Ref: 83572360325
+Node: G.2.42360544
+Ref: 83582360895
+Ref: 83592360895
+Ref: 83602361375
+Ref: 83612361377
+Ref: 83622361531
+Ref: 83632362556
+Node: G.2.52366266
+Node: G.2.62368033
+Ref: 83642368707
+Ref: 83652369182
+Ref: 83662369456
+Ref: 83672369854
+Ref: 83682369856
+Ref: 83692370105
+Node: G.32375626
+Node: G.3.12376384
+Ref: 83702376745
+Ref: 83712376830
+Ref: 83722376897
+Ref: 83732378048
+Ref: 83742378534
+Ref: 83752379489
+Ref: 83762379567
+Ref: 83772379631
+Ref: 83782379694
+Ref: 83792379835
+Ref: 83802379909
+Ref: 83812380137
+Ref: 83822380366
+Ref: 83832381829
+Ref: 83842384098
+Ref: 83852391483
+Node: G.3.22394127
+Ref: 83862394790
+Ref: 83872394878
+Ref: 83882394946
+Ref: 83892395216
+Ref: 83902395277
+Ref: 83912395344
+Ref: 83922395450
+Ref: 83932395560
+Ref: 83942395657
+Ref: 83952395760
+Ref: 83962395972
+Ref: 83972396043
+Ref: 83982396171
+Ref: 83992396275
+Ref: 84002396661
+Ref: 84012398581
+Ref: 84022398896
+Ref: 84032398957
+Ref: 84042399025
+Ref: 84052399131
+Ref: 84062399242
+Ref: 84072399339
+Ref: 84082399442
+Ref: 84092399660
+Ref: 84102399731
+Ref: 84112399859
+Ref: 84122399963
+Ref: 84132400347
+Ref: 84142400422
+Ref: 84152403319
+Ref: 84162403417
+Ref: 84172403487
+Ref: 84182403556
+Ref: 84192403693
+Ref: 84202403769
+Ref: 84212404003
+Ref: 84222404238
+Ref: 84232405998
+Ref: 84242413405
+Ref: 84252428400
+Node: Annex H2431637
+Ref: 84262431784
+Ref: 84272431784
+Ref: 84282432445
+Ref: 84292432575
+Ref: 84302432576
+Node: H.12433059
+Ref: 84312433426
+Ref: 84322433427
+Ref: 84332433498
+Ref: 84342433498
+Node: H.22434871
+Ref: 84352435089
+Node: H.32435888
+Node: H.3.12436190
+Ref: 84362436685
+Ref: 84372436686
+Ref: 84382436750
+Ref: 84392436750
+Node: H.3.22439545
+Ref: 84402440071
+Ref: 84412440072
+Ref: 84422440099
+Ref: 84432440116
+Ref: 84442440388
+Ref: 84452440525
+Node: H.42442254
+Ref: 84462442789
+Ref: 84472442789
+Ref: 84482442951
+Ref: 84492442951
+Ref: 84502443027
+Ref: 84512443027
+Ref: 84522443172
+Ref: 84532443172
+Ref: 84542443269
+Ref: 84552443269
+Ref: 84562443355
+Ref: 84572443355
+Ref: 84582443877
+Ref: 84592443879
+Ref: 84602443919
+Ref: 84612443919
+Ref: 84622444209
+Ref: 84632444209
+Ref: 84642444395
+Ref: 84652444395
+Ref: 84662444722
+Ref: 84672444724
+Ref: 84682444729
+Ref: 84692444729
+Ref: 84702444767
+Ref: 84712444768
+Ref: 84722444815
+Ref: 84732444815
+Ref: 84742444931
+Ref: 84752444931
+Ref: 84762445131
+Ref: 84772445131
+Ref: 84782445252
+Ref: 84792445252
+Ref: 84802445377
+Ref: 84812445377
+Ref: 84822446941
+Ref: 84832447126
+Node: H.52447781
+Ref: 84842448151
+Ref: 84852448152
+Ref: 84862448223
+Ref: 84872448223
+Node: H.62448893
+Ref: 84882449246
+Ref: 84892449247
+Ref: 84902449286
+Ref: 84912449472
+Ref: 84922449472
+Ref: 84932449874
+Node: Annex J2452084
+Ref: 84942452227
+Node: J.12453185
+Node: J.22454285
+Node: J.32455450
+Ref: 84952455967
+Ref: S03222455967
+Ref: 84962455987
+Ref: 84972456006
+Ref: 84982456084
+Ref: 84992456394
+Ref: 85002457598
+Ref: 85012457824
+Ref: 85022458065
+Node: J.42458165
+Ref: 85032458416
+Ref: 85042458416
+Node: J.52458946
+Node: J.62461622
+Node: J.72461913
+Ref: 85052462073
+Ref: S03232462073
+Ref: 85062462082
+Ref: 85072462101
+Node: J.7.12462340
+Ref: 85082462869
+Ref: 85092462871
+Ref: 85102462871
+Ref: 85112463275
+Ref: 85122463435
+Ref: 85132463710
+Ref: 85142463860
+Ref: 85152464529
+Node: J.82467066
+Ref: 85162467229
+Ref: S03242467229
+Ref: 85172467250
+Node: J.92467571
+Ref: 85182467820
+Ref: 85192467820
+Ref: 85202468033
+Node: J.102468337
+Ref: 85212468680
+Ref: 85222468681
+Ref: 85232468690
+Ref: 85242468709
+Node: J.112469974
+Ref: 85252470352
+Ref: 85262470352
+Node: J.122470663
+Node: J.132471009
+Ref: 85272471453
+Ref: 85282471600
+Ref: 85292471751
+Node: J.142471903
+Node: J.152473167
+Node: J.15.12473871
+Ref: 85302474128
+Ref: 85312474128
+Ref: 85322474148
+Ref: 85332474149
+Ref: 85342474157
+Ref: 85352474163
+Node: J.15.22474877
+Ref: 85362475158
+Ref: 85372475158
+Ref: 85382475178
+Ref: 85392475179
+Ref: 85402475202
+Ref: 85412475227
+Node: J.15.32475692
+Ref: 85422475958
+Ref: 85432475958
+Ref: 85442475978
+Ref: 85452475979
+Ref: 85462476001
+Node: J.15.42476331
+Ref: 85472476581
+Ref: 85482476582
+Ref: 85492476596
+Ref: 85502476832
+Node: J.15.52477068
+Ref: 85512477246
+Ref: 85522477251
+Ref: 85532477251
+Ref: 85542477251
+Ref: 85552477251
+Ref: 85562477251
+Ref: 85572477251
+Ref: 85582477251
+Ref: 85592477251
+Ref: 85602477251
+Ref: 85612477251
+Ref: 85622477251
+Ref: 85632477251
+Ref: 85642477417
+Ref: 85652477418
+Ref: 85662477465
+Ref: 85672477488
+Ref: 85682477557
+Ref: 85692477613
+Ref: 85702477645
+Ref: 85712477646
+Ref: 85722477693
+Ref: 85732477716
+Ref: 85742477785
+Ref: 85752477841
+Ref: 85762477873
+Ref: 85772477874
+Ref: 85782477914
+Ref: 85792477941
+Ref: 85802478195
+Ref: 85812478195
+Ref: 85822478544
+Node: J.15.62480136
+Ref: 85832480435
+Ref: 85842480435
+Ref: 85852480455
+Ref: 85862480456
+Ref: 85872480489
+Node: J.15.72480903
+Ref: 85882481208
+Ref: 85892481209
+Ref: 85902481238
+Ref: 85912481324
+Ref: 85922481325
+Ref: 85932481351
+Ref: 85942481356
+Ref: 85952481693
+Ref: 85962482068
+Node: J.15.82482728
+Ref: 85972483085
+Ref: 85982483086
+Ref: 85992483094
+Ref: 86002483125
+Ref: 86012483126
+Ref: 86022483136
+Ref: 86032483167
+Ref: 86042483168
+Ref: 86052483193
+Ref: 86062483224
+Ref: 86072483225
+Ref: 86082483252
+Ref: 86092483283
+Ref: 86102483284
+Ref: 86112483313
+Ref: 86122483344
+Ref: 86132483345
+Ref: 86142483369
+Ref: 86152484314
+Ref: 86162484316
+Ref: 86172484316
+Ref: 86182484316
+Ref: 86192484316
+Ref: 86202484316
+Ref: 86212484316
+Ref: 86222484316
+Ref: 86232484316
+Ref: 86242484316
+Ref: 86252484316
+Ref: 86262484316
+Node: J.15.92484488
+Ref: 86272484712
+Ref: 86282484713
+Ref: 86292484718
+Ref: 86302484874
+Node: J.15.102485581
+Ref: 86312485853
+Ref: 86322485854
+Ref: 86332486043
+Node: J.15.112486495
+Ref: 86342486786
+Ref: 86352486787
+Ref: 86362486893
+Ref: 86372486894
+Ref: 86382487074
+Ref: 86392487074
+Node: J.15.122488514
+Ref: 86402488784
+Ref: 86412488785
+Ref: 86422488969
+Node: J.15.132489604
+Ref: 86432489883
+Ref: 86442489883
+Ref: 86452489903
+Ref: 86462489904
+Ref: 86472489918
+Node: Annex K2490339
+Node: K.12490769
+Ref: 86482490892
+Node: K.22501441
+Ref: 86492501570
+Ref: 86502503195
+Ref: 86512503433
+Ref: 86522503435
+Ref: 86532507853
+Ref: 86542507868
+Ref: 86552509262
+Ref: 86562509660
+Ref: 86572509662
+Ref: 86582510497
+Ref: 86592510712
+Ref: 86602510714
+Ref: 86612513709
+Ref: 86622513724
+Ref: 86632514030
+Ref: 86642514030
+Ref: 86652524327
+Ref: 86662524342
+Ref: 86672524342
+Ref: 86682525545
+Ref: 86692525806
+Ref: 86702525808
+Ref: 86712529975
+Ref: 86722539703
+Ref: 86732539870
+Ref: 86742539871
+Ref: 86752540379
+Ref: 86762540380
+Ref: 86772543113
+Ref: 86782543460
+Ref: 86792543462
+Ref: 86802546792
+Ref: 86812547401
+Ref: 86822547722
+Ref: 86832547724
+Ref: 86842551781
+Ref: 86852551948
+Ref: 86862551949
+Ref: 86872552443
+Ref: 86882552444
+Ref: 86892555289
+Ref: 86902555304
+Ref: 86912555816
+Ref: 86922556976
+Ref: 86932558186
+Node: Annex L2561296
+Ref: 86942561445
+Ref: 86952561541
+Ref: 86962561542
+Ref: 86972561575
+Ref: 86982561618
+Ref: 86992561619
+Ref: 87002561647
+Ref: 87012561682
+Ref: 87022561733
+Ref: 87032561734
+Ref: 87042561760
+Ref: 87052561809
+Ref: 87062561810
+Ref: 87072561849
+Ref: 87082561873
+Ref: 87092561904
+Ref: 87102561928
+Ref: 87112562014
+Ref: 87122562015
+Ref: 87132562029
+Ref: 87142562115
+Ref: 87152562116
+Ref: 87162562124
+Ref: 87172562209
+Ref: 87182562210
+Ref: 87192562237
+Ref: 87202562322
+Ref: 87212562323
+Ref: 87222562349
+Ref: 87232562354
+Ref: 87242562476
+Ref: 87252562477
+Ref: 87262562517
+Ref: 87272562539
+Ref: 87282562589
+Ref: 87292562590
+Ref: 87302562595
+Ref: 87312562644
+Ref: 87322562645
+Ref: 87332562667
+Ref: 87342562729
+Ref: 87352562730
+Ref: 87362562776
+Ref: 87372562777
+Ref: 87382562800
+Ref: 87392562848
+Ref: 87402562849
+Ref: 87412562916
+Ref: 87422562917
+Ref: 87432562942
+Ref: 87442562964
+Ref: 87452563005
+Ref: 87462563006
+Ref: 87472563035
+Ref: 87482563057
+Ref: 87492563098
+Ref: 87502563099
+Ref: 87512563130
+Ref: 87522563212
+Ref: 87532563213
+Ref: 87542563255
+Ref: 87552563278
+Ref: 87562563337
+Ref: 87572563388
+Ref: 87582563476
+Ref: 87592563477
+Ref: 87602563519
+Ref: 87612563542
+Ref: 87622563601
+Ref: 87632563652
+Ref: 87642563703
+Ref: 87652563704
+Ref: 87662563729
+Ref: 87672563779
+Ref: 87682563780
+Ref: 87692563804
+Ref: 87702563891
+Ref: 87712563892
+Ref: 87722563900
+Ref: 87732563906
+Ref: 87742563948
+Ref: 87752563949
+Ref: 87762563976
+Ref: 87772563993
+Ref: 87782564075
+Ref: 87792564076
+Ref: 87802564105
+Ref: 87812564186
+Ref: 87822564187
+Ref: 87832564256
+Ref: 87842564257
+Ref: 87852564281
+Ref: 87862564324
+Ref: 87872564325
+Ref: 87882564330
+Ref: 87892564373
+Ref: 87902564374
+Ref: 87912564398
+Ref: 87922564484
+Ref: 87932564485
+Ref: 87942564508
+Ref: 87952564533
+Ref: 87962564580
+Ref: 87972564581
+Ref: 87982564630
+Ref: 87992564631
+Ref: 88002564640
+Ref: 88012564724
+Ref: 88022564725
+Ref: 88032564747
+Ref: 88042564793
+Ref: 88052564794
+Ref: 88062564834
+Ref: 88072564835
+Ref: 88082564874
+Ref: 88092564921
+Ref: 88102564922
+Ref: 88112564951
+Ref: 88122564998
+Ref: 88132564999
+Ref: 88142565028
+Ref: 88152565110
+Ref: 88162565111
+Ref: 88172565172
+Ref: 88182565173
+Ref: 88192565219
+Ref: 88202565248
+Ref: 88212565276
+Ref: 88222565326
+Ref: 88232565327
+Ref: 88242565346
+Ref: 88252565370
+Ref: 88262565473
+Ref: 88272565474
+Ref: 88282565495
+Ref: 88292565536
+Ref: 88302565537
+Ref: 88312565561
+Ref: 88322565647
+Ref: 88332565648
+Ref: 88342565734
+Ref: 88352565735
+Ref: 88362565773
+Ref: 88372565813
+Ref: 88382565814
+Ref: 88392565843
+Ref: 88402565883
+Ref: 88412565884
+Ref: 88422565897
+Ref: 88432565910
+Ref: 88442565958
+Ref: 88452565959
+Ref: 88462566003
+Ref: 88472566004
+Ref: 88482566035
+Ref: 88492566116
+Ref: 88502566117
+Ref: 88512566131
+Ref: 88522566177
+Ref: 88532566178
+Ref: 88542566187
+Ref: 88552566231
+Ref: 88562566232
+Ref: 88572566265
+Ref: 88582566353
+Ref: 88592566354
+Ref: 88602566387
+Ref: 88612566437
+Ref: 88622566438
+Ref: 88632566449
+Ref: 88642566534
+Ref: 88652566535
+Ref: 88662566545
+Ref: 88672566632
+Ref: 88682566633
+Ref: 88692566662
+Node: Annex M2566699
+Ref: 88702566876
+Node: M.12567621
+Ref: 88712567766
+Ref: 88722567766
+Node: M.22575035
+Ref: 88732575198
+Ref: 88742575277
+Ref: 88752589844
+Node: M.32596433
+Ref: 88762596550
+Ref: 88772596550
+Node: Annex N2627063
+Ref: 88782627182
+Ref: 88792627404
+Ref: 88802627558
+Ref: 88812627722
+Ref: 88822628039
+Ref: 88832628282
+Ref: 88842628417
+Ref: 88852628617
+Ref: 88862628901
+Ref: 88872629111
+Ref: 88882629206
+Ref: 88892629223
+Ref: 88902629488
+Ref: 88912629748
+Ref: 88922629806
+Ref: 88932629949
+Ref: 88942630179
+Ref: 88952630324
+Ref: 88962630428
+Ref: 88972630430
+Ref: 88982630698
+Ref: 88992631233
+Ref: 89002631400
+Ref: 89012631571
+Ref: 89022631838
+Ref: 89032631990
+Ref: 89042632057
+Ref: 89052632205
+Ref: 89062632354
+Ref: 89072632509
+Ref: 89082632654
+Ref: 89092632763
+Ref: 89102632859
+Ref: 89112632861
+Ref: 89122632983
+Ref: 89132633099
+Ref: 89142633742
+Ref: 89152633995
+Ref: 89162634162
+Ref: 89172634625
+Ref: 89182634967
+Ref: 89192635131
+Ref: 89202635300
+Ref: 89212635515
+Ref: 89222635777
+Ref: 89232635882
+Ref: 89242636056
+Ref: 89252636304
+Ref: 89262636480
+Ref: 89272636869
+Ref: 89282637047
+Ref: 89292637381
+Ref: 89302637503
+Ref: 89312637728
+Ref: 89322637845
+Ref: 89332637953
+Ref: 89342638570
+Ref: 89352638709
+Ref: 89362638988
+Ref: 89372639113
+Ref: 89382639357
+Ref: 89392639546
+Ref: 89402639881
+Ref: 89412640071
+Ref: 89422640209
+Ref: 89432640320
+Ref: 89442640450
+Ref: 89452640586
+Ref: 89462640726
+Ref: 89472640804
+Ref: 89482641109
+Ref: 89492641288
+Ref: 89502641603
+Ref: 89512641848
+Ref: 89522642096
+Ref: 89532642545
+Ref: 89542642774
+Ref: 89552643060
+Ref: 89562643098
+Node: Annex P2643221
+Ref: 89572643348
+Ref: 89582643348
+Ref: 89592643348
+Ref: 89602643348
+Ref: 89612643348
+Ref: 89622643514
+Ref: 89632643532
+Ref: 89642643551
+Ref: 89652643626
+Ref: 89662643653
+Ref: 89672643680
+Ref: 89682643707
+Ref: 89692643733
+Ref: 89702643756
+Ref: 89712643827
+Ref: 89722643854
+Ref: 89732643887
+Ref: 89742643912
+Ref: 89752643978
+Ref: 89762643996
+Ref: 89772644056
+Ref: 89782644066
+Ref: 89792644076
+Ref: 89802644124
+Ref: 89812644132
+Ref: 89822644143
+Ref: 89832644195
+Ref: 89842644209
+Ref: 89852644344
+Ref: 89862644351
+Ref: 89872644367
+Ref: 89882644385
+Ref: 89892644430
+Ref: 89902644491
+Ref: 89912644508
+Ref: 89922644519
+Ref: 89932644580
+Ref: 89942644657
+Ref: 89952644721
+Ref: 89962644807
+Ref: 89972644882
+Ref: 89982644944
+Ref: 89992644957
+Ref: 90002644988
+Ref: 90012645112
+Ref: 90022645127
+Ref: 90032645161
+Ref: 90042645176
+Ref: 90052645215
+Ref: 90062645231
+Ref: 90072645264
+Ref: 90082645280
+Ref: 90092645348
+Ref: 90102645369
+Ref: 90112645399
+Ref: 90122645422
+Ref: 90132645451
+Ref: 90142645478
+Ref: 90152645520
+Ref: 90162645551
+Ref: 90172645593
+Ref: 90182645617
+Ref: 90192645648
+Ref: 90202645674
+Ref: 90212645704
+Ref: 90222645774
+Ref: 90232645833
+Ref: 90242645865
+Ref: 90252645903
+Ref: 90262645938
+Ref: 90272646036
+Ref: 90282646057
+Ref: 90292646085
+Ref: 90302646121
+Ref: 90312646154
+Ref: 90322646186
+Ref: 90332646270
+Ref: 90342646302
+Ref: 90352646336
+Ref: 90362646361
+Ref: 90372646393
+Ref: 90382646420
+Ref: 90392646453
+Ref: 90402646481
+Ref: 90412646574
+Ref: 90422646597
+Ref: 90432646630
+Ref: 90442646704
+Ref: 90452646720
+Ref: 90462646734
+Ref: 90472646799
+Ref: 90482646845
+Ref: 90492646865
+Ref: 90502646945
+Ref: 90512646964
+Ref: 90522646984
+Ref: 90532647063
+Ref: 90542647082
+Ref: 90552647165
+Ref: 90562647213
+Ref: 90572647242
+Ref: 90582647268
+Ref: 90592647300
+Ref: 90602647348
+Ref: 90612647376
+Ref: 90622647402
+Ref: 90632647434
+Ref: 90642647482
+Ref: 90652647514
+Ref: 90662647540
+Ref: 90672647572
+Ref: 90682647605
+Ref: 90692647697
+Ref: 90702647720
+Ref: 90712647801
+Ref: 90722647849
+Ref: 90732647957
+Ref: 90742647982
+Ref: 90752648004
+Ref: 90762648079
+Ref: 90772648120
+Ref: 90782648156
+Ref: 90792648177
+Ref: 90802648263
+Ref: 90812648300
+Ref: 90822648407
+Ref: 90832648429
+Ref: 90842648519
+Ref: 90852648591
+Ref: 90862648624
+Ref: 90872648730
+Ref: 90882648766
+Ref: 90892648851
+Ref: 90902648922
+Ref: 90912648950
+Ref: 90922649053
+Ref: 90932649065
+Ref: 90942649169
+Ref: 90952649199
+Ref: 90962649270
+Ref: 90972649304
+Ref: 90982649427
+Ref: 90992649439
+Ref: 91002649549
+Ref: 91012649576
+Ref: 91022649588
+Ref: 91032649693
+Ref: 91042649712
+Ref: 91052649789
+Ref: 91062649822
+Ref: 91072649925
+Ref: 91082649953
+Ref: 91092649983
+Ref: 91102650063
+Ref: 91112650158
+Ref: 91122650189
+Ref: 91132650228
+Ref: 91142650316
+Ref: 91152650337
+Ref: 91162650417
+Ref: 91172650454
+Ref: 91182650521
+Ref: 91192650539
+Ref: 91202650612
+Ref: 91212650633
+Ref: 91222650685
+Ref: 91232650713
+Ref: 91242650864
+Ref: 91252650894
+Ref: 91262650987
+Ref: 91272651015
+Ref: 91282651031
+Ref: 91292651048
+Ref: 91302651082
+Ref: 91312651109
+Ref: 91322651131
+Ref: 91332651204
+Ref: 91342651279
+Ref: 91352651307
+Ref: 91362651414
+Ref: 91372651446
+Ref: 91382651471
+Ref: 91392651563
+Ref: 91402651662
+Ref: 91412651773
+Ref: 91422651789
+Ref: 91432651816
+Ref: 91442651832
+Ref: 91452651905
+Ref: 91462651929
+Ref: 91472652002
+Ref: 91482652029
+Ref: 91492652054
+Ref: 91502652094
+Ref: 91512652189
+Ref: 91522652216
+Ref: 91532652236
+Ref: 91542652315
+Ref: 91552652350
+Ref: 91562652416
+Ref: 91572652435
+Ref: 91582652498
+Ref: 91592652529
+Ref: 91602652556
+Ref: 91612652628
+Ref: 91622652719
+Ref: 91632652750
+Ref: 91642652801
+Ref: 91652652949
+Ref: 91662653028
+Ref: 91672653058
+Ref: 91682653141
+Ref: 91692653157
+Ref: 91702653195
+Ref: 91712653211
+Ref: 91722653318
+Ref: 91732653343
+Ref: 91742653530
+Ref: 91752653586
+Ref: 91762653726
+Ref: 91772653760
+Ref: 91782653783
+Ref: 91792653828
+Ref: 91802653856
+Ref: 91812653900
+Ref: 91822653999
+Ref: 91832654020
+Ref: 91842654105
+Ref: 91852654179
+Ref: 91862654204
+Ref: 91872654271
+Ref: 91882654291
+Ref: 91892654307
+Ref: 91902654352
+Ref: 91912654366
+Ref: 91922654427
+Ref: 91932654445
+Ref: 91942654460
+Ref: 91952654472
+Ref: 91962654531
+Ref: 91972654547
+Ref: 91982654578
+Ref: 91992654600
+Ref: 92002654616
+Ref: 92012654639
+Ref: 92022654669
+Ref: 92032654689
+Ref: 92042654713
+Ref: 92052654735
+Ref: 92062654766
+Ref: 92072654792
+Ref: 92082654853
+Ref: 92092654866
+Ref: 92102654917
+Ref: 92112654924
+Ref: 92122654994
+Ref: 92132655052
+Ref: 92142655105
+Ref: 92152655112
+Ref: 92162655126
+Ref: 92172655175
+Ref: 92182655182
+Ref: 92192655247
+Ref: 92202655256
+Ref: 92212655314
+Ref: 92222655327
+Ref: 92232655347
+Ref: 92242655413
+Ref: 92252655420
+Ref: 92262655502
+Ref: 92272655523
+Ref: 92282655631
+Ref: 92292655638
+Ref: 92302655738
+Ref: 92312655822
+Ref: 92322655907
+Ref: 92332655914
+Ref: 92342655980
+Ref: 92352655999
+Ref: 92362656021
+Ref: 92372656091
+Ref: 92382656200
+Ref: 92392656232
+Ref: 92402656353
+Ref: 92412656379
+Ref: 92422656400
+Ref: 92432656503
+Ref: 92442656532
+Ref: 92452656625
+Ref: 92462656644
+Ref: 92472656723
+Ref: 92482656736
+Ref: 92492656803
+Ref: 92502656832
+Ref: 92512656922
+Ref: 92522656934
+Ref: 92532656948
+Ref: 92542656971
+Ref: 92552656985
+Ref: 92562657008
+Ref: 92572657030
+Ref: 92582657044
+Ref: 92592657134
+Ref: 92602657165
+Ref: 92612657263
+Ref: 92622657287
+Ref: 92632657307
+Ref: 92642657384
+Ref: 92652657398
+Ref: 92662657413
+Ref: 92672657432
+Ref: 92682657452
+Ref: 92692657465
+Ref: 92702657480
+Ref: 92712657498
+Ref: 92722657518
+Ref: 92732657532
+Ref: 92742657599
+Ref: 92752657620
+Ref: 92762657647
+Ref: 92772657667
+Ref: 92782657694
+Ref: 92792657715
+Ref: 92802657742
+Ref: 92812657768
+Ref: 92822657795
+Ref: 92832657820
+Ref: 92842657892
+Ref: 92852657911
+Ref: 92862657931
+Ref: 92872657998
+Ref: 92882658017
+Ref: 92892658037
+Ref: 92902658075
+Ref: 92912658102
+Ref: 92922658135
+Ref: 92932658203
+Ref: 92942658224
+Ref: 92952658298
+Ref: 92962658318
+Ref: 92972658326
+Ref: 92982658392
+Ref: 92992658415
+Ref: 93002658421
+Ref: 93012658450
+Ref: 93022658489
+Ref: 93032658497
+Ref: 93042658518
+Ref: 93052658561
+Ref: 93062658573
+Ref: 93072658588
+Ref: 93082658602
+Ref: 93092658655
+Ref: 93102658680
+Ref: 93112658697
+Ref: 93122658715
+Ref: 93132658722
+Ref: 93142658735
+Ref: 93152658756
+Ref: 93162658783
+Ref: 93172659288
+Ref: 93182659304
+Ref: 93192659376
+Ref: 93202659403
+Ref: 93212659429
+Ref: 93222659456
+Ref: 93232659494
+Ref: 93242659556
+Ref: 93252659640
+Ref: 93262659663
+Ref: 93272659703
+Ref: 93282659805
+Ref: 93292659854
+Ref: 93302659921
+Ref: 93312659932
+Ref: 93322659970
+Ref: 93332659993
+Ref: 93342660004
+Ref: 93352660030
+Ref: 93362660142
+Ref: 93372660207
+Ref: 93382660220
+Ref: 93392660241
+Ref: 93402660254
+Ref: 93412660318
+Ref: 93422660332
+Ref: 93432660346
+Ref: 93442660359
+Ref: 93452660421
+Ref: 93462660444
+Ref: 93472660476
+Ref: 93482660499
+Ref: 93492660588
+Ref: 93502660645
+Ref: 93512660656
+Ref: 93522660668
+Ref: 93532660723
+Ref: 93542660730
+Ref: 93552660750
+Ref: 93562660757
+Ref: 93572660821
+Ref: 93582660846
+Ref: 93592660871
+Ref: 93602660896
+Ref: 93612660915
+Ref: 93622660950
+Ref: 93632660978
+Ref: 93642661009
+Ref: 93652661031
+Ref: 93662661057
+Ref: 93672661077
+Ref: 93682661103
+Ref: 93692661176
+Ref: 93702661193
+Ref: 93712661218
+Ref: 93722661237
+Ref: 93732661263
+Ref: 93742661299
+Ref: 93752661320
+Ref: 93762661430
+Ref: 93772661502
+Ref: 93782661583
+Ref: 93792661591
+Ref: 93802661657
+Ref: 93812661683
+Ref: 93822661721
+Ref: 93832661747
+Ref: 93842661796
+Ref: 93852661906
+Ref: 93862661932
+Ref: 93872661971
+Ref: 93882662086
+Ref: 93892662121
+Ref: 93902662204
+Ref: 93912662239
+Ref: 93922662276
+Ref: 93932662328
+Ref: 93942662392
+Ref: 93952662416
+Ref: 93962662459
+Ref: 93972662548
+Ref: 93982662581
+Ref: 93992662672
+Ref: 94002662716
+Ref: 94012662730
+Ref: 94022662753
+Ref: 94032662803
+Ref: 94042662870
+Ref: 94052662931
+Ref: 94062662985
+Ref: 94072663042
+Ref: 94082663120
+Ref: 94092663132
+Ref: 94102663200
+Ref: 94112663268
+Ref: 94122663299
+Ref: 94132663338
+Ref: 94142663424
+Ref: 94152663457
+Ref: 94162663542
+Ref: 94172663569
+Ref: 94182663653
+Ref: 94192663673
+Ref: 94202663748
+Ref: 94212663768
+Ref: 94222663781
+Ref: 94232663845
+Ref: 94242663874
+Ref: 94252663961
+Ref: 94262663981
+Ref: 94272664051
+Ref: 94282664119
+Ref: 94292664182
+Ref: 94302664263
+Ref: 94312664284
+Ref: 94322664300
+Ref: 94332664323
+Ref: 94342664343
+Ref: 94352664411
+Ref: 94362664438
+Ref: 94372664526
+Ref: 94382664563
+Ref: 94392664569
+Ref: 94402664585
+Ref: 94412664608
+Ref: 94422664637
+Ref: 94432664664
+Ref: 94442664686
+Ref: 94452664820
+Ref: 94462664851
+Ref: 94472664889
+Ref: 94482664926
+Ref: 94492664971
+Ref: 94502665016
+Ref: 94512665104
+Ref: 94522665131
+Ref: 94532665138
+Ref: 94542665224
+Ref: 94552665249
+Ref: 94562665256
+Ref: 94572665339
+Ref: 94582665364
+Ref: 94592665467
+Ref: 94602665485
+Ref: 94612665565
+Ref: 94622665589
+Ref: 94632665654
+Ref: 94642665740
+Ref: 94652665782
+Ref: 94662665818
+Ref: 94672665901
+Ref: 94682665953
+Ref: 94692666060
+Ref: 94702666081
+Ref: 94712666170
+Ref: 94722666200
+Ref: 94732666245
+Ref: 94742666338
+Ref: 94752666368
+Ref: 94762666407
+Ref: 94772666432
+Ref: 94782666464
+Ref: 94792666494
+Ref: 94802666532
+Ref: 94812666555
+Ref: 94822666626
+Ref: 94832666717
+Ref: 94842666758
+Ref: 94852666795
+Ref: 94862666848
+Ref: 94872666888
+Ref: 94882666906
+Ref: 94892666982
+Ref: 94902667023
+Ref: 94912667060
+Ref: 94922667105
+Ref: 94932667152
+Ref: 94942667170
+Ref: 94952667250
+Ref: 94962667271
+Ref: 94972667349
+Ref: 94982667444
+Ref: 94992667465
+Ref: 95002667548
+Ref: 95012667588
+Ref: 95022667630
+Ref: 95032667760
+Ref: 95042667781
+Ref: 95052667858
+Ref: 95062667876
+Ref: 95072667942
+Ref: 95082667958
+Ref: 95092668034
+Ref: 95102668073
+Ref: 95112668115
+Ref: 95122668155
+Ref: 95132668198
+Ref: 95142668295
+Ref: 95152668318
+Ref: 95162668334
+Ref: 95172668370
+Ref: 95182668389
+Ref: 95192668421
+Ref: 95202668443
+Ref: 95212668478
+Ref: 95222668497
+Ref: 95232668581
+Ref: 95242668639
+Ref: 95252668653
+Ref: 95262668743
+Ref: 95272668794
+Ref: 95282668808
+Ref: 95292668904
+Ref: 95302668935
+Ref: 95312668986
+Ref: 95322669005
+Ref: 95332669115
+Ref: 95342669174
+Ref: 95352669193
+Ref: 95362669245
+Ref: 95372669306
+Ref: 95382669325
+Ref: 95392669376
+Ref: 95402669436
+Ref: 95412669455
+Ref: 95422669547
+Ref: 95432669568
+Ref: 95442669607
+Ref: 95452669648
+Ref: 95462669679
+Ref: 95472669763
+Ref: 95482669798
+Ref: 95492669838
+Ref: 95502669869
+Ref: 95512669943
+Ref: 95522669982
+Ref: 95532670013
+Ref: 95542670063
+Ref: 95552670083
+Ref: 95562670154
+Ref: 95572670188
+Ref: 95582670223
+Ref: 95592670264
+Ref: 95602670315
+Ref: 95612670406
+Ref: 95622670427
+Ref: 95632670466
+Ref: 95642670506
+Ref: 95652670537
+Ref: 95662670634
+Ref: 95672670668
+Ref: 95682670708
+Ref: 95692670739
+Ref: 95702670822
+Ref: 95712670882
+Ref: 95722670940
+Ref: 95732671012
+Ref: 95742671047
+Ref: 95752671077
+Ref: 95762671149
+Ref: 95772671193
+Ref: 95782671281
+Ref: 95792671315
+Ref: 95802671350
+Ref: 95812671401
+Ref: 95822671467
+Ref: 95832671502
+Ref: 95842671530
+Ref: 95852671569
+Ref: 95862671613
+Ref: 95872671636
+Ref: 95882671802
+Ref: 95892671838
+Ref: 95902671860
+Ref: 95912671890
+Ref: 95922671926
+Ref: 95932672020
+Ref: 95942672034
+Ref: 95952672048
+Ref: 95962672080
+Ref: 95972672132
+Ref: 95982672188
+Ref: 95992672254
+Ref: 96002672275
+Ref: 96012672299
+Ref: 96022672331
+Ref: 96032672370
+Ref: 96042672421
+Ref: 96052672489
+Ref: 96062672517
+Ref: 96072672590
+Ref: 96082672660
+Ref: 96092672683
+Ref: 96102672776
+Ref: 96112672782
+Ref: 96122672883
+Ref: 96132672952
+Ref: 96142672976
+Ref: 96152673077
+Ref: 96162673156
+Ref: 96172673222
+Ref: 96182673248
+Ref: 96192673274
+Ref: 96202673306
+Ref: 96212673397
+Ref: 96222673414
+Ref: 96232673452
+Ref: 96242673469
+Ref: 96252673510
+Ref: 96262673595
+Ref: 96272673666
+Ref: 96282673694
+Ref: 96292673721
+Ref: 96302673800
+Ref: 96312673818
+Ref: 96322673898
+Ref: 96332673915
+Ref: 96342674072
+Ref: 96352674113
+Ref: 96362674211
+Ref: 96372674236
+Ref: 96382674322
+Ref: 96392674349
+Ref: 96402674446
+Ref: 96412674489
+Ref: 96422674604
+Ref: 96432674653
+Ref: 96442674740
+Ref: 96452674762
+Ref: 96462674843
+Ref: 96472674869
+Ref: 96482674930
+Ref: 96492675010
+Ref: 96502675025
+Ref: 96512675076
+Ref: 96522675152
+Ref: 96532675167
+Ref: 96542675189
+Ref: 96552675204
+Ref: 96562675266
+Ref: 96572675300
+Ref: 96582675337
+Ref: 96592675438
+Ref: 96602675465
+Ref: 96612675495
+Ref: 96622675519
+Ref: 96632675615
+Ref: 96642675652
+Ref: 96652675689
+Ref: 96662675770
+Ref: 96672675788
+Ref: 96682675849
+Ref: 96692675901
+Ref: 96702675959
+Ref: 96712675973
+Ref: 96722676027
+Ref: 96732676049
+Ref: 96742676161
+Ref: 96752676190
+Ref: 96762676281
+Ref: 96772676310
+Ref: 96782676358
+Ref: 96792676381
+Ref: 96802676401
+Ref: 96812676424
+Ref: 96822676506
+Ref: 96832676536
+Ref: 96842676585
+Ref: 96852676679
+Ref: 96862676723
+Ref: 96872676811
+Ref: 96882676855
+Ref: 96892676953
+Ref: 96902676997
+Ref: 96912677069
+Ref: 96922677087
+Ref: 96932677150
+Ref: 96942677196
+Ref: 96952677290
+Ref: 96962677341
+Ref: 96972677369
+Ref: 96982677450
+Ref: 96992677483
+Ref: 97002677503
+Ref: 97012677540
+Ref: 97022677623
+Ref: 97032677701
+Ref: 97042677798
+Ref: 97052677818
+Ref: 97062677895
+Ref: 97072677915
+Ref: 97082677989
+Ref: 97092678022
+Ref: 97102678127
+Ref: 97112678148
+Ref: 97122678187
+Ref: 97132678278
+Ref: 97142678299
+Ref: 97152678380
+Ref: 97162678425
+Ref: 97172678515
+Ref: 97182678552
+Ref: 97192678587
+Ref: 97202678628
+Ref: 97212678725
+Ref: 97222678791
+Ref: 97232678797
+Ref: 97242678836
+Ref: 97252678870
+Ref: 97262678912
+Ref: 97272678980
+Ref: 97282678986
+Ref: 97292679025
+Ref: 97302679059
+Ref: 97312679100
+Ref: 97322679160
+Ref: 97332679166
+Ref: 97342679205
+Ref: 97352679287
+Ref: 97362679310
+Ref: 97372679418
+Ref: 97382679436
+Ref: 97392679539
+Ref: 97402679563
+Ref: 97412679591
+Ref: 97422679606
+Ref: 97432679613
+Ref: 97442679655
+Ref: 97452679725
+Ref: 97462679752
+Ref: 97472679758
+Ref: 97482679774
+Ref: 97492679797
+Ref: 97502679831
+Ref: 97512679864
+Ref: 97522679891
+Ref: 97532679896
+Ref: 97542679918
+Ref: 97552679958
+Ref: 97562680046
+Ref: 97572680090
+Ref: 97582680202
+Ref: 97592680222
+Ref: 97602680244
+Ref: 97612680287
+Ref: 97622680389
+Ref: 97632680409
+Ref: 97642680505
+Ref: 97652680547
+Ref: 97662680589
+Ref: 97672680632
+Ref: 97682680681
+Ref: 97692680723
+Ref: 97702680767
+Ref: 97712680817
+Ref: 97722680866
+Ref: 97732680906
+Ref: 97742680947
+Ref: 97752681193
+Ref: 97762681212
+Ref: 97772681763
+Ref: 97782681846
+Ref: 97792681933
+Ref: 97802682018
+Ref: 97812682074
+Ref: 97822682197
+Ref: 97832682226
+Ref: 97842682260
+Ref: 97852682367
+Ref: 97862682405
+Ref: 97872682439
+Ref: 97882682510
+Ref: 97892682577
+Ref: 97902682661
+Ref: 97912682706
+Ref: 97922682718
+Ref: 97932682759
+Ref: 97942682875
+Ref: 97952682906
+Ref: 97962682936
+Ref: 97972683054
+Ref: 97982683110
+Ref: 97992683173
+Ref: 98002683214
+Ref: 98012683261
+Ref: 98022683303
+Ref: 98032683353
+Ref: 98042683378
+Ref: 98052683390
+Ref: 98062683439
+Ref: 98072683510
+Ref: 98082683526
+Ref: 98092683564
+Ref: 98102683580
+Ref: 98112683653
+Ref: 98122683721
+Ref: 98132683728
+Ref: 98142683741
+Ref: 98152683825
+Ref: 98162683836
+Ref: 98172683861
+Ref: 98182683888
+Ref: 98192683899
+Ref: 98202683924
+Ref: 98212684023
+Ref: 98222684038
+Ref: 98232684112
+Ref: 98242684218
+Ref: 98252684252
+Ref: 98262684278
+Ref: 98272684389
+Ref: 98282684403
+Ref: 98292684418
+Ref: 98302684431
+Ref: 98312684490
+Ref: 98322684551
+Ref: 98332684618
+Ref: 98342684680
+Ref: 98352684772
+Ref: 98362684851
+Ref: 98372684897
+Ref: 98382684911
+Ref: 98392685009
+Ref: 98402685016
+Ref: 98412685087
+Ref: 98422685106
+Ref: 98432685172
+Ref: 98442685191
+Ref: 98452685258
+Ref: 98462685295
+Ref: 98472685295
+Ref: 98482685295
+Ref: 98492685295
+Ref: 98502685295
+Node: Annex Q2730843
+Node: Q.12731409
+Ref: 98512731585
+Node: Q.22743278
+Ref: 98522743496
+Ref: 98532743496
+Node: Q.32759969
+Ref: 98542760166
+Node: Q.42829070
+Ref: 98552829264
+Node: Q.52833049
+Ref: 98562833276
+Ref: 98572833276
+Ref: 98582833276
+Node: Index2857740
+Node: operators2858034
+Node: A2859482
+Node: B2897415
+Node: C2905257
+Node: D2940942
+Node: E2962558
+Node: F2994333
+Node: G3007994
+Node: H3015656
+Node: I3019876
+Node: J3046555
+Node: K3046749
+Node: L3047541
+Node: M3063230
+Node: N3072894
+Node: O3087495
+Node: P3094747
+Node: Q3121600
+Node: R3123439
+Node: S3145799
+Node: T3175554
+Node: U3193847
+Node: V3204999
+Node: W3209100
+Node: X3215441
+Node: Y3215575
End Tag Table
diff --git a/build/Makefile b/build/Makefile
index ab564ed..64fa51c 100755
--- a/build/Makefile
+++ b/build/Makefile
@@ -44,6 +44,8 @@ LDFLAGS :=
# that they take precedence. The intent is that you may configure the
# build with a simple variable override.
+PYTHON ?= python3
+
.PHONY: all clean publish
all: $(foreach d,$(DOCUMENTS),\
@@ -108,7 +110,7 @@ define doc_year_build
$(d)$(y).pdf: $(d)$(y).texinfo
texi2any --pdf $(TEXI_PDF_OPTS) $$< -o $$@
clean::
- rm -f $(d)$(y).log $(d)$(y).pdf $(d)$(y).toc
+ rm -f $(d)$(y).aux $(d)$(y).log $(d)$(y).pdf $(d)$(y).toc
endef
$(foreach d,$(AVAILABLE_DOCUMENTS),\
@@ -119,13 +121,13 @@ arm_form.exe : force
gnatmake -p $(BUILDER_OPTIONS) -P arm_info.gpr $(foreach var,ADAFLAGS
LDFLAGS,"-X$(var)=$($(var))")
clean::
rm -f arm_form.exe
- rm -f -r objects
+ rm -f -r objects __pycache__
trace :
addr2line -e arm_form.exe 0x5c12e7 0x5c598e 0x43e05b 0x446c5b 0x448369
0x545205 0x4e9221 0x4e3b1a 0x5831a1 0x5ad295 0x5adee9 0x4cb3f5 0x401850
0x401235 0x401286 0x7c817075
# year is latest standard; bump trailing digit for any change.
-ZIP_VERSION := $(lastword $(AVAILABLE_YEARS)).3
+ZIP_VERSION := $(lastword $(AVAILABLE_YEARS)).4
INFO_ARCHIVE := arm_info-$(ZIP_VERSION).tar.gz
SOURCE_ARCHIVE := arm_info-$(ZIP_VERSION)-src.tar.gz
@@ -145,7 +147,7 @@ clean::
ZIP_EXCLUDES := *~ *.dvi *.gz *.info *.log *.pdf *.ps *.texinfo *.toc \
*.stamp *.zip arm_form.exe _MTN .mtn-ignore .dvc-exclude aarm2005.html \
aarm2005.txt aarm2012.html aarm2012.txt arm2005.html arm2005.txt
arm2012.html \
- arm2012.txt objects
+ arm2012.txt objects __pycache__
$(SOURCE_ARCHIVE):
tar cf - -C ../.. $(foreach e,$(ZIP_EXCLUDES),--exclude="$(e)")
org.adaic.arm_form | gzip $(GZIP) -c > $@
clean::
@@ -161,7 +163,7 @@ update_upstream : source_scribe_2012.clean
source_scribe_2012.stamp
# consistency.
source_ada.stamp :
rm -rf ../../org.adaic.arm_form.upstream/progs
- cd ../../org.adaic.arm_form.upstream; python3
../org.adaic.arm_form/build/download.py progs
+ cd ../../org.adaic.arm_form.upstream; $(PYTHON)
../org.adaic.arm_form/build/download.py progs
touch source_ada.stamp
source_ada.clean :
@@ -178,7 +180,7 @@ source_ada.clean :
# consistently cased.
source_scribe_%.stamp :
rm -rf ../../org.adaic.arm_form.upstream/source_$*
- cd ../../org.adaic.arm_form.upstream; python3
../org.adaic.arm_form/build/download.py $*
+ cd ../../org.adaic.arm_form.upstream; $(PYTHON)
../org.adaic.arm_form/build/download.py $*
mv ../../org.adaic.arm_form.upstream/source
../../org.adaic.arm_form.upstream/source_$*
touch source_scribe_$*.stamp
diff --git a/build/arm_info.gpr b/build/arm_info.gpr
index 82f9342..025003e 100755
--- a/build/arm_info.gpr
+++ b/build/arm_info.gpr
@@ -71,7 +71,6 @@ project ARM_Info is
Switches :=
("-g",
"-O0",
- "-gnat2005",
"-gnatfoqQ",
"-gnatVa",
"-gnatwaCeFKLMP",
diff --git a/build/download.py b/build/download.py
index ec4feee..5255c92 100755
--- a/build/download.py
+++ b/build/download.py
@@ -68,7 +68,10 @@ class CVSWeb ():
match = re.search (str.encode (pattern), contents)
if not match:
return None
- cgi += '?rev=' + bytes.decode (match.group (1))
+ rev = bytes.decode (match.group (1))
+ cgi += '?rev=' + rev
+ print ('{:<30} : {}'.format (path, rev))
+
else:
cgi += '?rev=HEAD'
with urllib.request.urlopen (self._host + cgi) as f:
diff --git a/progs/arm_frm.adb b/progs/arm_frm.adb
index f730483..198f0a9 100755
--- a/progs/arm_frm.adb
+++ b/progs/arm_frm.adb
@@ -21,7 +21,7 @@ package body ARM_Format is
--
-- ---------------------------------------
-- Copyright 2000, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
- -- 2010, 2011, 2012, 2013, 2016
+ -- 2010, 2011, 2012, 2013, 2016, 2018
-- AXE Consultants. All rights reserved.
-- P.O. Box 1512, Madison WI 53701
-- E-Mail: randy@rrsoftware.com
@@ -2335,7 +2335,9 @@ Ada.Text_IO.Put_Line(" -- No Start Paragraph
(Del-NewOnly)");
-- supposed to be any at this point.
Ada.Text_IO.Put_Line ("** References generated for no
display paragraph; line " & ARM_Input.Line_String (Input_Object));
else
+ pragma Warnings (Off, "writable actual for ""List""
overlaps with actual for ""Format_Object""");
Make_References (Format_Object.References,
Format_Object, Output_Object);
+ pragma Warnings (On);
end if;
end if;
diff --git a/progs/arm_mast.adb b/progs/arm_mast.adb
index 6b74658..e0cded1 100755
--- a/progs/arm_mast.adb
+++ b/progs/arm_mast.adb
@@ -22,7 +22,7 @@ package body ARM_Master is
-- execute it.
--
-- ---------------------------------------
- -- Copyright 2006, 2007, 2009, 2011, 2012, 2013, 2016
+ -- Copyright 2006, 2007, 2009, 2011, 2012, 2013, 2016, 2018
-- AXE Consultants. All rights reserved.
-- P.O. Box 1512, Madison WI 53701
-- E-Mail: randy@rrsoftware.com
@@ -316,7 +316,7 @@ package body ARM_Master is
procedure Process_Command is
Command_Name : ARM_Input.Command_Name_Type;
Ch : Character;
- use type ARM_Output.Size_Type;
+ -- use type ARM_Output.Size_Type;
Command : Command_Type;
Close_Ch : Character;
diff --git a/progs/arm_rtf.adb b/progs/arm_rtf.adb
index fa2ed02..ea34d42 100755
--- a/progs/arm_rtf.adb
+++ b/progs/arm_rtf.adb
@@ -5237,7 +5237,7 @@ package body ARM_RTF is
-- Bold off, Italic off should be avoided (as separate commands).
TRACE_TF : constant Boolean := FALSE;
use type ARM_Output.Change_Type;
- use type ARM_Contents.Change_Version_Type;
+ -- use type ARM_Contents.Change_Version_Type;
use type ARM_Output.Location_Type;
use type ARM_Output.Size_Type;
use type ARM_Output.Color_Type;
diff --git a/progs/arm_texi.adb b/progs/arm_texi.adb
index 220ef45..0e362d9 100755
--- a/progs/arm_texi.adb
+++ b/progs/arm_texi.adb
@@ -2,7 +2,7 @@ with Ada.Exceptions;
with Ada.Strings.Fixed;
package body ARM_Texinfo is
- -- Copyright (C) 2003, 2007, 2010 - 2013, 2015, 2017 Stephen Leake. All
Rights Reserved.
+ -- Copyright (C) 2003, 2007, 2010 - 2013, 2015, 2017, 2018 Stephen Leake.
All Rights Reserved.
-- E-Mail: stephen_leake@acm.org
--
-- This library is free software; you can redistribute it and/or
@@ -824,7 +824,12 @@ package body ARM_Texinfo is
(Output_Object : in out Texinfo_Output_Type;
Format : in ARM_Output.Format_Type)
is begin
- null;
+ -- We only handle italic, for annotated syntax item names
+ if Format.Italic /= Output_Object.Format.Italic then
+ -- Info format does not support fonts, so we use <>
+ Put (Output_Object.File, (if Format.Italic then '<' else '>'));
+ end if;
+ Output_Object.Format := Format;
end Text_Format;
procedure End_Paragraph (Output_Object : in out Texinfo_Output_Type)
@@ -1647,8 +1652,11 @@ package body ARM_Texinfo is
"Table with 1 column");
when 2 =>
+ -- @table doesn't work inside @display; PDFTex fails with @table
here.
+ --
https://lists.gnu.org/archive/html/bug-texinfo/2004-10/txtJLetHrEhdc.txt
New_Line (Output_Object.File);
- Put_Line (Output_Object.File, "@table @asis");
+ Put_Line (Output_Object.File, "@multitable {wwwwwwwwww}
{wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww}");
+ Put (Output_Object.File, "@headitem ");
when others =>
New_Line (Output_Object.File);
@@ -1709,7 +1717,8 @@ package body ARM_Texinfo is
when 2 =>
New_Line (Output_Object.File);
- Put_Line (Output_Object.File, "@table @asis");
+ Put_Line (Output_Object.File, "@multitable {wwwwwwwwww}
{wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww}");
+ Put (Output_Object.File, "@headitem ");
when others =>
New_Line (Output_Object.File);
@@ -1733,8 +1742,8 @@ package body ARM_Texinfo is
when Normal =>
case Output_Object.Column_Count is
when 2 =>
- -- using @table
- Put (Output_Object.File, ' ');
+ New_Line (Output_Object.File);
+ Put (Output_Object.File, "@tab ");
when others =>
Put (Output_Object.File, " @tab ");
@@ -1769,7 +1778,8 @@ package body ARM_Texinfo is
when Normal =>
-- A two-column table; header has been output
- null;
+ New_Line (Output_Object.File);
+ Put (Output_Object.File, "@item ");
when Contents | Multi_Column | Title | Index_Start | Index =>
Unexpected_State (Output_Object);
@@ -1784,7 +1794,7 @@ package body ARM_Texinfo is
case Output_Object.Column_Count is
when 2 =>
New_Line (Output_Object.File);
- Put_Line (Output_Object.File, "@end table");
+ Put_Line (Output_Object.File, "@end multitable");
when others =>
Put_Line (Output_Object.File, "@end multitable");
diff --git a/progs/arm_texi.ads b/progs/arm_texi.ads
index 9ca6a33..2de8b0a 100755
--- a/progs/arm_texi.ads
+++ b/progs/arm_texi.ads
@@ -13,7 +13,7 @@ package ARM_Texinfo is
--
-- ---------------------------------------
--
- -- Copyright (C) 2003, 2007, 2011, 2013 Stephen Leake. All Rights
Reserved.
+ -- Copyright (C) 2003, 2007, 2011, 2013, 2018 Stephen Leake. All Rights
Reserved.
-- E-Mail: stephen_leake@stephe-leake.org
--
-- This library is free software; you can redistribute it and/or
@@ -35,13 +35,13 @@ package ARM_Texinfo is
-- Ancient - S L - Developed package as add-on to Arm_Form.
-- 10/19/11 - RLB - Integrated outside-developed package into Arm_Form.
-- Commented out/replaced Ada 2005 features (this is
- -- Ada 95 code). Updated for a few other changes since
- -- the last update.
+ -- Ada 95 code). Updated for a few other changes since
+ -- the last update.
-- 10/25/11 - RLB - Added old insertion version to Revised_Clause_Header.
-- 4/ 1/12 - S L - Various revisions.
-- 8/31/12 - RLB - Added Output_Path.
-- 11/26/12 - RLB - Added subdivision names to Clause_Header and
- -- Revised_Clause_Header.
+ -- Revised_Clause_Header.
type Texinfo_Output_Type is new ARM_Output.Output_Type with private;
@@ -281,6 +281,7 @@ private
In_Paragraph : Boolean := False; -- Sub-state within major states
Style : ARM_Output.Paragraph_Style_Type;
Indent : ARM_Output.Paragraph_Indent_Type;
+ Format : ARM_Output.Format_Type := ARM_Output.Normal_Format;
End_Hang_Seen : Boolean;
-- Detecting end of title page
- [elpa] externals/ada-ref-man 33180fd 06/18: Update ada-mode to version 5.2.2, wisi to version 1.1.5, (continued)
- [elpa] externals/ada-ref-man 33180fd 06/18: Update ada-mode to version 5.2.2, wisi to version 1.1.5, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man af01ec1 04/18: * packages/ada-ref-man/*: release version 2012 TC1, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man 158227b 01/18: publish ada-mode 5.1.6, wisi 1.0.6, new package ada-ref-man, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man f52f990 10/18: Release Ada mode 5.3.1, wisi 1.1.6, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man c6ec38c 08/18: Add ada-ref-man/build directory for the Makefile, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man a15f647 14/18: In packages/ada-ref-man: fix dir, bump version, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man c4232c1 09/18: * packages/ada-ref-man/README: add copyright, license info; add make command, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man 539f2fe 07/18: Add ada-ref-man document and program sources, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man dca5c3b 12/18: Release ada-mode 6.0.1, wisi 2.0.1; fix copyright, packaging bugs, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man 09c02bd 13/18: In ada-ref-man; indicated italics in syntax element names, Stefan Monnier, 2020/11/29
- [elpa] externals/ada-ref-man e94c605 11/18: Release ada-mode version 6.0. Release wisi version 2.0,
Stefan Monnier <=