Ada Programming/Keywords/for

Computing » Computer Science » Computer Programming » Ada Programming

This keyword is used in:

For loops
Representation clauses:
- attribute definition clause
- enumeration representation clause
- record representation clause
- at clause (obsolescent)
Quantified expressions
- Universal quantification
- Existential quantification

Nowadays representation clauses are formally called aspect clauses in the last versions of the Reference Manual due to some technicalities, although representation clauses is the name far more extended among Ada programmers. As a historical note, they were known as representation specifications (rep specs) in pre-Ada 83 proposals.^[1]

For loops

[loop name :] for var in [ reverse ] [type range] range loop
   ...
end loop [loop name];

Where range can be:

explicit range like "low .. high",
range of scalar or array type: type'Range (or type'Range(n) for multidimensional array types)
range of an array: array'Range (or array'Range(n) for multidimensional arrays)

Keyword in may also be followed by an iterable. This generalizes iteration by including types that have one of the interfaces defined in Ada.Iterator_Interfaces. This language feature has been introduced in Ada 2012.

Another generalized form of looping iteration uses the keyword of in place of in. The loop parameter is then referring to components of arrays or of iterable container types, directly. This language feature has been introduced in Ada 2012.

[loop name :] for var [: type] of [ reverse ] iterable loop
   ...
end loop [loop name];

Representation clauses

The keywords for, use and at are used for representation clauses.

A record representation clause specifies the Layout aspect of a record.

An enumeration representation clause specifies the Coding aspect of an enumeration type.

See Ada Programming/Representation_clauses.

Quantified expressions

This language feature has been introduced in Ada 2012.

Quantified expressions are Boolean expressions. They are either True or False, or propagate any exception raised during evaluation.

Universal quantification

Universal quantification expression:

(for all var in range => predicate)
(for all var of iterable => predicate)

Both forms evaluate to True when all of the values in range (of iterable) make the predicate yield True. Evaluation of predicate stops when either all values of loop parameter var have been exhausted, or when evaluation for some value yields False (short circuit).

Existential quantification

Existential quantification expression:

(for some var in range => predicate)
(for some var of iterable => predicate)

Both forms evaluate to True when some of the values in range (of iterable) makes the predicate yield True. Evaluation of predicate stops when either all values of loop parameter var have been exhausted, or when evaluation for some value yields True (short circuit).

References

↑ John Barnes (2003-03-25). High-Integrity Software — The SPARK Approach to Safety and Security. Addison-Wesley. ISBN 0-321-13616-0. Retrieved 2008-06-06. Representation clauses are now strictly known as aspect clauses — the name was changed in the 2000 Corrigendum for Ada 95 for subtle reasons that need not concern us; Ada historians might recall that they were known as representation specifications (rep specs) prior to the ANSI standardization in 1983. These various terminologies are all in use and the reader will encounter them in the literature. (pp.212–213)

Ada Keywords
`abort`	`else`	`new`	`return`
`abs`	`elsif`	`not`	`reverse`
`abstract` (Ada 95)	`end`	`null`
`accept`	`entry`		`select`
`access`	`exception`	`of`	`separate`
`aliased` (Ada 95)	`exit`	`or`	`some` (Ada 2012)
`all`		`others`	`subtype`
`and`	`for`	`out`	`synchronized` (Ada 2005)
`array`	`function`	`overriding` (Ada 2005)
`at`			`tagged` (Ada 95)
	`generic`	`package`	`task`
`begin`	`goto`	`parallel` (Ada 2022)	`terminate`
`body`		`pragma`	`then`
	`if`	`private`	`type`
`case`	`in`	`procedure`
`constant`	`interface` (Ada 2005)	`protected` (Ada 95)	`until` (Ada 95)
	`is`		`use`
`declare`		`raise`
`delay`	`limited`	`range`	`when`
`delta`	`loop`	`record`	`while`
`digits`		`rem`	`with`
`do`	`mod`	`renames`
		`requeue` (Ada 95)	`xor`

[1] John Barnes (2003-03-25). High-Integrity Software — The SPARK Approach to Safety and Security. Addison-Wesley. ISBN 0-321-13616-0. Retrieved 2008-06-06. Representation clauses are now strictly known as aspect clauses — the name was changed in the 2000 Corrigendum for Ada 95 for subtle reasons that need not concern us; Ada historians might recall that they were known as representation specifications (rep specs) prior to the ANSI standardization in 1983. These various terminologies are all in use and the reader will encounter them in the literature. (pp.212–213)

[1]

Ada Programming/Keywords/for

For loops

Representation clauses

Quantified expressions

Universal quantification

Existential quantification

See also

Wikibook

Ada Reference Manual

Ada 83

Ada Quality and Style Guide

References