# Preface

Welcome to the Ada Programming tutorial at Wikibooks. This is the first Ada tutorial covering the Ada 2005, 2012 and 2022 standards. If you are a beginner you will learn the latest standard — if you are a seasoned Ada user you can see what's new.
Current Development Stage for Ada Programming is " (June 8, 2024)". At this date, there are more than 600 pages in this book, which makes Ada Programming one of the largest programming wikibooks.
But still there is always room for improvement — do help us to expand Ada Programming. Even beginners will find areas to participate.

## About Ada

Ada is a programming language suitable for all development needs. It has built-in features that directly support structured, object-oriented, generic, distributed and concurrent programming.
Ada is a good choice for Rapid Application Development, Extreme Programming (XP), and Free Software development.
Ada is named after Augusta Ada King-Noel, Countess of Lovelace.

### Programming in the large

Ada puts unique emphasis on and provides strong support for, good software engineering practices that scale well to very large software systems (millions of lines of code, and very large development teams). The following language features are particularly relevant in this respect:
* An extremely strong, static and safe type system, which allows the programmer to construct powerful abstractions that reflect the real world, and allows the compiler to detect many logic faults before they become errors.
* Modularity, whereby the compiler directly manages the construction of very large software systems from sources.
* Information hiding; the language separates interfaces from implementation, and provides fine-grained control over visibility.
* Readability, which helps programmers review and verify code. Ada favours the reader of the program over the writer because a program is written once but read many times. For example, the syntax bans all ambiguous constructs, so there are no surprises, following the Tao of Programming's Law of Least Astonishment. (Some Ada programmers are reluctant to talk about source code which is often cryptic; they prefer program text which is close to English prose.)
* Portability: the language definition allows compilers to differ only in a few controlled ways, and otherwise defines the semantics of programs very precisely; as a result, Ada source text is very portable across compilers and target hardware platforms. Most often, the program can be recompiled without any changes.
* Standardisation: standards have been a goal and a prominent feature ever since the design of the language in the late 1970s. The first standard was published in 1980, just 3 years after design commenced. Ada compilers all support the same language; the only dialect, SPARK, is merely an annotated subset and can be compiled with an Ada compiler.
Consequences of these qualities are superior reliability, reusability and maintainability. For example, compared to programs written in C, programs written in Ada 83 contain "70% fewer internal fixes and 90% fewer bugs", and cost half as much to develop in the first place. Ada shines even more in software maintenance, which often accounts for about 80% of the total cost of development. With support for object-oriented programming, Ada 95 may bring even more cost-benefit, depending on how objects are used; although no serious study comparable to Zeigler's has been published.

### Programming in the small

In addition to its support for good software engineering practices, which applies to general-purpose programming, Ada has powerful specialised features supporting low-level programming for real-time, safety-critical and embedded systems. Such features include, among others, machine code insertions, address arithmetic, low-level access to memory, control over bitwise representation of data, bit manipulations, and a well-defined, statically provable concurrent computing model called the Ravenscar Profile.
Other features include restrictions (it is possible to restrict which language features are accepted in a program) and features that help review and certify the object code generated by the compiler.
Several vendors provide Ada compilers accompanied by minimal run-time kernels suitable for use in certified, life-critical applications. It is also possible to write Ada programs which require no run-time kernel at all.
It should come as no surprise that Ada is heavily used in the aerospace, defence, medical, railroad, and nuclear industries.

### The Language Reference Manual

The Ada Reference Manual (RM) is the official language definition. If you have a problem and no one else can help, you should read the RM (albeit often a bit cryptic for non-language lawyers). For this reason, all complete (not draft) pages in Ada Programming contain links to the appropriate pages in the RM.
This tutorial covers Ada Reference Manual — ISO/IEC 8652:2023 Language and Standard Libraries, colloquially known as Ada 2022 or just Ada.
You can browse the complete Reference Manual at http://www.ada-auth.org/standards/22rm/html/RM-TOC.html
There are two companion documents:
* The Annotated Reference Manual, an extended version of the RM aimed at compiler writers or other persons who want to know the fine details of the language.
* The Overview of Ada 2022, an explanation of the features of this language edition.
The Ada Information Clearinghouse also offers the older Ada 83, 95, 2005 and 2012 standards and companion documents.
The RM is a collective work under the control of Ada users. If you think you've found a problem in the RM, please report it to the Ada Conformity Assessment Authority (the Ada RM explains how to do this, see http://www.ada-auth.org/standards/22rm/html/RM-0-2.html Introduction (58/1) ff). On this site, you can also see the list of "Ada Issues" raised by other people.

### Ada Conformity Assessment Test Suite

Unlike other programming languages, Ada compilers are officially tested, and only those which pass this test are accepted, for military and commercial work. This means that all Ada compilers behave (almost) the same, so you do not have to learn any dialects. The Ada standard does however allow compiler writers to include additional features and libraries that are not part of the standard.

## Programming in Ada

Reading a document online is often quite cumbersome. So if you just started you can also download All Chapters (PDF version) and print them out.

### Getting Started

Where to get a compiler, how to compile the source, all answered here:
* Basic Ada — Read Me First!
* Finding and Installing Ada
* Building an Ada program
* Ada Development Environment

### Language Features

These chapters look at the broader picture, introducing you to the main Ada features in a tutorial style.
* Expressions
* Control Structures
* Type System
* Constants
* Representation Clauses
* Strings
* Subprograms
* Packages
* Input Output
* Exceptions
* Generics
* Tasking
* Object Orientation
* Contract Based Programming
* Memory Management (Access Types)
* New in Ada 2005
* New in Ada 2012
* New in Ada 2022
* Containers
* Interfacing to other Languages
* Coding Standards
* Ada Programming Tips
* Common Programming Errors

### Computer Programming

The following articles are Ada adaptations from articles of the Computer programming book. The texts of these articles are language neutral but the examples are all Ada.
* Algorithms
** Chapter 1
** Chapter 6
** Knuth-Morris-Pratt pattern matcher
** Binary search
* Error handling
* Function overloading
* Mathematical calculations
* Statements
** Control
* Variables

### Language Reference

Within the following chapters we look at foundations of Ada. These chapters may be used for reference of a particular keyword, delimiter, operator and so forth.
* Lexical elements
** Keywords
** Delimiters
* Operators
* Attributes
* Aspects
* Pragmas
** Restrictions

### Predefined Language Libraries

This section is a reference of the Ada Standard Library, which is extensive and well structured. It has these four root packages:
* Standard
* Ada
* Interfaces
* System
Besides the Standard Library, compilers usually come with a built-in library. This chapter describes the GNAT library in particular.
* GNAT

### External Libraries

This section is a reference of third-party Ada libraries which are not part of the compiler predefined environment but are freely available.
* Libraries
** Multi Purpose
** Container Libraries
** GUI Libraries
** Distributed Objects
** Database
** Web Programming
** Input/Output
* Platform specific
** Programming Ada in Linux
** Programming Ada in Windows
** Programming Ada in Virtual Machines (Java, .NET)

## External resources

* Open-source portals
* Web Tutorials
* Web 2.0

## Collections
### Printable Versions

The following are collection pages. All collection pages are comprised of groups of the already available pages. You can use them for printing or to gain a quick overview. Please note that those pages are partly very long.

#### Tutorial

    Show HTML (1,839 kb) — Download PDF (2,663 kb, 243 pages)

#### Keywords

    Show HTML (470 kb) — Download PDF (290 kb, 59 pages)

#### Operators

    Show HTML (232 kb) — Download PDF (189 kb, 27 pages)

### Source Code

The Source from the Book is available for download and online browsing. The latter allows "drill down", meaning that you can follow the links right down to the package bodies in the Ada runtime library.

## References

* ↑ See Category:Book:Ada Programming or /All Chapters
* ↑ Gaetan Allaert, Dirk Craeynest, Philippe Waroquiers (2003). "European air traffic flow management: porting a large application to GNU/linux". Proceedings of the 2003 annual ACM SIGAda international conference on Ada. SIGAda'03. pp. 29–37. doi:10.1145/958420.958426. ISBN 1-58113-476-2. http://www.sigada.org/conf/sigada2003/SIGAda2003-CDROM/SIGAda2003-Proceedings/p29-allaert.pdf. Retrieved 2009-01-02. Paper by Eurocontrol (PDF, 160 kB) on portability.
* ↑ Stephen F. Zeigler (1995-03-30). "Comparing Development Costs of C and Ada". Retrieved 2009-01-02. Our data indicates that Ada has saved us millions of development dollars. {{cite journal}}: Cite journal requires |journal= (help)

## Further reading
### Ada 2005 textbooks

* John Barnes (2006). Programming in Ada 2005. Addison Wesley. ISBN 0-321-34078-7.
* Mordechai Ben-Ari (2009). Ada for Software Engineers (Second Edition with Ada 2005). Springer. ISBN 978-1-84882-313-6.
* Alan Burns, Andy Wellings (2007). Concurrent and Real-Time Programming in Ada. Cambridge University Press. ISBN 978-0-521-86697-2.
* Nell Dale, John W. McCormick (2007). Ada Plus Data Structures: An Object Oriented Approach (2nd ed.). Jones and Bartlett. ISBN 0-7637-3794-1.
* John W. McCormick, Frank Singhoff, Jérôme Hugues (2011). Building Parallel, Embedded, and Real-Time Applications with Ada. Cambridge University Press. ISBN 978-0-521-19716-8.{{cite book}}: CS1 maint: multiple names: authors list (link)

### Ada 2012 textbooks

* John Barnes (2014). Programming in Ada 2012. Cambridge University Press. ISBN 978-1-107-42481-4.
* Andrew T.Shvets (2020). Beginning Ada Programming: From Novice to Professional. Apress Media LLC, A Subsidiary of Springer Nature. ISBN 978-1-4842-5427-1.

### Ada 2022 textbooks

* John Barnes (2022). Programming in Ada 2012 with a Preview of Ada 2022. Cambridge University Press. ISBN 9781009181341
* John Barnes (2024) [PLANNED]. Programming in Ada 2022. Cambridge University Press. ISBN 9781009564779

### Manuals and guides

* Ada Quality & Style Guide: Guidelines for Professional Programmers (wikibook)
* Rationale for Ada 2005, by John Barnes (2007)
* Ada 2005 Reference Manual (2007)
* Ada Reference Card (in PDF format)

### High-Integrity Software

* ISO/IEC TR 15942:2000, Guide for the use of the Ada programming language in high integrity systems. ISO Freely Available Standards
* ISO/IEC TR 24718:2005, Guide for the use of the Ada Ravenscar Profile in high integrity systems. ISO Freely Available Standards
* John Barnes (2003). High Integrity Software: The SPARK Approach to Safety and Security. Addison-Wesley. ISBN 0-321-13616-0.

## External links
### Resources

* Ada Information Clearinghouse — News and resources
* comp.lang.ada (Web archive, Google groups) — International Usenet newsgroup
* ada-lang.io — Community site and forum

### Research and user groups

* Journals:
** Ada-Letters
** Ada User Journal (archive)
* International Conferences/Workshops:
** International Real-Time Ada Workshop (IRTAW) [IRTAW 15]
** ACM SIGAda international conference on Ada [HILT 2012]
** 18th International Conference on Reliable Software Technologies — Ada-Europe 2013
** 17th International Conference on Reliable Software Technologies — Ada-Europe 2012
** Ada Connection 2011 (videos)
** Ada "Developers Room" at FOSDEM (2020)
* Local conferences:
** Ada-Belgium Conference

### Associations

* ACM SIGAda — ACM Special Interest Group on Ada
* Ada-Europe
* Ada Germany
* Ada Spain
* Ada-Belgium
* Ada-France
* Ada Switzerland

### Free online books/courses

* learn.adacore.com
* The Big Online Book of Linux Ada Programming
* Ada Distilled
* Ada in Action
* Introducing Ada 95
* Learn Ada on the Web
* Quick Ada
* Ada 95: The Craft of Object-Oriented Programming — Free textbook originally published by Prentice Hall
* Online Ada books

## Authors and contributors

This Wikibook has been written by:
* Martin Krischik (Contributions)
* Manuel Gómez (Contributions)
* Santiago Urueña (Contributions)
* C.K.W. Grein (Contributions, more and more contributions)
* Bill Findlay (Contributions)
* B. Seidel (Contributions)
* Simon Wright (Contributions)
* Allen Lew (Contributions)
* John Oleszkiewicz (Contributions)
* Nicolas Kaiser (Contributions)
* Larry Luther (Contributions)
* Georg Bauhaus (Contributions)
* Samuel Tardieu (Contributions)
* Ludovic Brenta (Contributions)
* Mateus de Lima Oliveira (Contributions)
* Ed Falis
* Pascal Obry
* Bent Bracke (Contributions)
If you wish to contribute as well you should read Contributing and join us at the Contributors lounge.

# Basic Ada
## "Hello, world!" programs
### "Hello, world!"

A common example of a language's syntax is the Hello world program. Here is a straightforward Ada Implementation:
The with statement adds the package Ada.Text_IO to the program. This package comes with every Ada compiler and contains all functionality needed for textual Input/Output. The with statement makes the declarations of Ada.Text_IO available to procedure Hello. This includes the types declared in Ada.Text_IO, the subprograms of Ada.Text_IO and everything else that is declared in Ada.Text_IO for public use. In Ada, packages can be used as toolboxes. Text_IO provides a collection of tools for textual input and output in one easy-to-access module. Here is a partial glimpse at package Ada.Text_IO:
Next in the program we declare a main procedure. An Ada main procedure does not need to be called "main". Any simple name is fine so here it is Hello. Compilers might allow procedures or functions to be used as main subprograms.
The call on Ada.Text_IO.Put_Line writes the text "Hello World" to the current output file.
A with clause makes the content of a package visible by selection: we need to prefix the procedure name Put_Line from the Text_IO package with its full package name Ada.Text_IO. If you need procedures from a package more often some form of shortcut is needed. There are two options open:

### "Hello, world!" with renames

By renaming a package it is possible to give a shorter alias to any package name. This reduces the typing involved while still keeping some of the readability.

### "Hello, world!" with local use

The use clause makes all the content of a package directly visible for the scope it is declared it. use can be placed locally or globally (see below). Like rename this reduces the typing involved while still keeping some of the readability.
use can be used for packages and in the form of use type for types. use type makes only the operators of the given type directly visible but not any other operations on the type.

### "Hello, world!" with global use

Using use clause outside any scope will makes all the content of a package directly visible for the whole compilation unit. It allows even less typing but removes more of the readability and can lead to name clashes.
With that many options one need to consider which option to use when. One suggested "rule of thumb":
* global use for the most used package(s)
* renames for most other package(s)
* local use for packages only used in a single procedure
* no use use or renames for package(s) only used once
You might have another simpler rule (for example, always use package Ada and its children, never use anything else).
Another rule from the early days of Ada development was global use for all packages unless a name clash occurs.

## Compiling the "Hello, world!" program

For information on how to build the "Hello, world!" program on various compilers, see the Building chapter.

### FAQ: Why is "Hello, world!" so big?

Ada beginners frequently ask how it can be that such a simple program as "Hello, world!" results in such a large executable. The reason has nothing to do with Ada but can usually be found in the compiler and linker options used — or better, not used.
Standard behavior for Ada compilers — or good compilers in general — is not to create the best code possible but to be optimized for ease of use. This is done to ensure a system that works "out of the box" and thus does not frighten away potential new users with unneeded complexity.
The GNAT project files, which you can download alongside the example programs, use better tuned compiler, binder and linker options. If you use those your "Hello, world!" will be a lot smaller:
For comparison the sizes for a plain gnat make compile:
Worth mentioning is that hello_world (Ada, C, C++) compiled with GNAT/MSVC 7.1/GCC(C) all produces executables with approximately the same size given comparable optimisation and linker methods.

## Things to look out for

It will help to be prepared to spot a number of significant features of Ada that are important for learning its syntax and semantics.

### Comb Format

There is a comb format in all the control structures and module structures. See the following examples for the comb format. You don't have to understand what the examples do yet - just look for the similarities in layout.
Note that semicolons consistently terminate statements and declarations; the empty line (or a semicolon alone) is not a valid statement: the null statement is

### Type and subtype

There is an important distinction between type and subtype: a type is given by a set of values and their operations. A subtype is given by a type, and a constraint that limits the set of values. Values are always of a type. Objects (constants and variables) are of a subtype. This generalizes, clarifies and systematizes a relationship, e.g. between Integer and 1..100, that is handled ad hoc in the semantics of Pascal.

### Constrained types and unconstrained types

There is an important distinction between constrained types and unconstrained types. An unconstrained type has one or more free parameters that affect its size or shape. A constrained type fixes the values of these parameters and so determines its size and shape. Loosely speaking, objects must be of a constrained type, but formal parameters may be of an unconstrained type (they adopt the constraint of any corresponding actual parameter). This solves the problem of array parameters in Pascal (among other things).

### Dynamic types

Where values in Pascal or C must be static (e.g. the subscript bounds of an array) they may be dynamic in Ada. However, static expressions are required in certain cases where dynamic evaluation would not permit a reasonable implementation (e.g. in setting the number of digits of precision of a floating point type).

### Separation of concerns

Ada consistently supports a separation of interface and mechanism. You can see this in the format of a package, which separates its declaration from its body; and in the concept of a private type, whose representation in terms of Ada data structures is inaccessible outside the scope containing its definition.

## Where to ask for help

Most Ada experts lurk on the Usenet newsgroups comp.lang.ada (English) and fr.comp.lang.ada (French); they are accessible either with a newsreader or through one of the many web interfaces. This is the place for all questions related to Ada.
People on these newsgroups are willing to help but will not do students' homework for them; they will not post complete answers to assignments. Instead, they will provide guidance for students to find their own answers.
For more online resources, see the External links section in this wikibook's introduction.

## Notes

* ↑ Main subprograms may even have parameters; it is implementation-defined what kinds of subprograms can be used as main subprograms. The reference manual explains the details in 10.2: LRM 10.2(29): “…, an implementation is required to support all main subprograms that are public parameterless library procedures.” Library means not nested in another subprogram, for example, and other things that needn't concern us now.
* ↑ renames can also be used for procedures, functions, variables, array elements. It can not be used for types — a type rename can be accomplished with subtype.

# Installing

Ada compilers are available from several vendors, on a variety of host and target platforms. The Ada Resource Association maintains a list of available compilers.
Below is an alphabetical list of available compilers with additional comments.

## AdaMagic from SofCheck

SofCheck used to produce an Ada 95 front-end that can be plugged into a code generating back-end to produce a full compiler. This front-end is offered for licensing to compiler vendors.
Based on this front-end, SofCheck used to offer:
* AdaMagic, an Ada-to-C/C++ translator
* AppletMagic, an Ada-to-Java bytecode compiler
SofCheck has merged with AdaCore under the AdaCore name, leaving no visible trace of AdaMagic offering on AdaCore website.
However, MapuSoft is now licensed to resell AdaMagic. They renamed it to "Ada-to-C/C++ changer". New name sounds like fake. Almost no Ada developer heard of MapuSoft. MapuSoft is never seen making Ada libraries, commercial or FLOSS. They are never seen at Ada conferences. Yet this is a real stuff, a validated Ada compiler that knows lots of tricks required to work on top of C/C++ compilers. E.g. it contains a proven knowledge of handling integer overflow with a special "-1" case.
Thanks to MapuSoft, AdaMagic really became available to developers. Get AppCOE, but not Win64 one, install it. In the MapuSoft/AppCOE_x32/Tools/Ada there will be AdaMagic. AdaMagic is known to support Win64, but AppCOE for Win64 is known to contain no AdaMagic at all.
Using AdaMagic from command line is badly supported in AppCOE, but possible. Set up ADA_MAGIC environment variable, edit Tools/Ada/{linux|windows}/SITE/rts_path to point to real path, edit SITE/config to get rid of unsupported C compiler keys, and compile via e.g.
Commercial; proprietary.

## AdaMULTI from Green Hills Software

Green Hills Software sells development environments for multiple languages and multiple targets (including DSPs), primarily to embedded software developers.
| Languages supported | Ada 83, Ada 95, C, C++, Fortran |
| License for the run-time library | Proprietary, royalty free. |
| Native platforms | GNU/Linux on i386, Microsoft Windows on i386, and Solaris on SPARC |
| Cross platforms | INTEGRITY, INTEGRITY-178B and velOSity from Green Hills; VxWorks from Wind River; several bare board targets, including x86, PowerPC, ARM, MIPS and ColdFire/68k. Safety-critical GMART and GSTART run-time libraries certified to DO-178B level A. |
| Available from | http://www.ghs.com/ |
| Support | Commercial |
| Add-ons included | IDE, debugger, TimeMachine, integration with various version control systems, source browsers, other utilities |
GHS claims to make great efforts to ensure that their compilers produce the most efficient code and often cites the EEMBC benchmark results as evidence, since many of the results published by chip manufacturers use GHS compilers to show their silicon in the best light, although these benchmarks are not Ada specific.
GHS has no publicly announced plans to support the two most recent Ada standards (2005 and 2012) but they do continue to actively market and develop their existing Ada products.

## DEC Ada from HP

DEC Ada was an Ada 83 compiler for OpenVMS. While “DEC Ada” is probably the name most users know, the compiler has also been called “HP Ada”, "VAX Ada", and "Compaq Ada".
* Ada for OpenVMS Alpha Installation Guide (PDF)
* Ada for OpenVMS VAX Installation Guide (PDF)

## GNAT, the GNU Ada Compiler from AdaCore and the Free Software Foundation

GNAT is the free GNU Ada compiler, which is part of the GNU Compiler Collection. It is the only Ada compiler that supports all of the optional annexes of the language standard. The original authors formed the company AdaCore to offer professional support, consulting, training and custom development services. It is thus possible to obtain GNAT from many different sources, detailed below.
GNAT is always licensed under the terms of the GNU General Public License.
However, the run-time library uses either the GPL, or the GNAT Modified GPL, depending on where you obtain it.
Several optional add-ons are available from various places:
* ASIS, the Ada Semantic Interface Specification, is a library that allows Ada programs to examine and manipulate other Ada programs.
* FLORIST is a library that provides a POSIX programming interface to the operating system.
* GDB, the GNU Debugger, with Ada extensions.
* GLADE implements Annex E, the Distributed Systems Annex. With it, one can write distributed programs in Ada, where partitions of the program running on different computers communicate over the network with one another and with shared objects.
* GPS, the GNAT Programming Studio, is a full-featured integrated development environment, written in Ada. It allows you to code in Ada, C and C++.
Many Free Software libraries are also available.

### GNAT GPL (or Community) Edition

As of May 2022, AdaCore no longer supports GNAT GPL. The recommended way to install all the tools and libraries that the Community Edition included is to use Alire, a package manager for Ada sources, which also provides toolchains. Although you can still download and install the last GNAT Community Edition that was published, there won't be any further release.
GNAT Community Edition is a source and binary release from AdaCore, intended for use by Free Software developers only. If you want to distribute your binary programs linked with the GPL run-time library, then you must do so under terms compatible with the GNU General Public License.
As of GNAT GPL Edition 2013:
| Languages supported | Ada 83, Ada 95, Ada 2005, Ada 2012, C, C++ |
| License for the run-time library | pure GPL |
| Native platforms | GNU/Linux on x86_64; Microsoft Windows on i386; ; Mac OS X (Darwin, x86_64). Earlier releases have supported Solaris on SPARC, GNU/Linux on i386, Microsoft .NET on i386 |
| Cross platforms | AVR, hosted on Windows; Java VM, hosted on Windows; Mindstorms NXT, hosted on Windows; ARM, hosted on Windows and Linux; |
| Compiler back-end | GCC 4.9 |
| Available from | https://www.adacore.com/download |
| Support | None |
| Add-ons included | GDB, GPS in source and binary form; many more in source-only form. |

### GNAT Modified GPL releases

With these releases of GNAT, you can distribute your programs in binary form under licensing terms of your own choosing; you are not bound by the GPL.

#### GNAT 3.15p

This is the last public release of GNAT from AdaCore that uses the GNAT Modified General Public License.
GNAT 3.15p has passed the Ada Conformity Assessment Test Suite (ACATS). It was released in October 2002.
The binary distribution from AdaCore also contains an Ada-aware version of the GNU Debugger (GDB), and a graphical front-end to GDB called the GNU Visual Debugger (GVD).
| Languages supported | Ada 83, Ada 95, C |
| License for the run-time library | GNAT-modified GPL |
| Native platforms | GNU/Linux on i386 (with glibc 2.1 or later), Microsoft Windows on i386, OS/2 2.0 or later on i386, Solaris 2.5 or later on SPARC |
| Cross platforms | none |
| Compiler back-end | GCC 2.8.1 |
| Available from | ftp://ftp.cs.kuleuven.ac.be/pub/Ada-Belgium/mirrors/gnu-ada/3.15p/ |
| Support | None |
| Add-ons included | ASIS, Florist, GLADE, GDB, Gnatwin (on Windows only), GtkAda 1.2, GVD |

#### GNAT Pro

GNAT Pro is the professional version of GNAT, offered as a subscription package by AdaCore. The package also includes professional consulting, training and maintenance services. AdaCore can provide custom versions of the compiler for native or cross development. For more information, see http://www.adacore.com/.
| Languages supported | Ada 83, Ada 95, Ada 2005, Ada 2012, C, and optionally C++ |
| License for the run-time library | GNAT-modified GPL |
| Native platforms | many, see http://www.adacore.com/home/products/gnatpro/supported_platforms/ |
| Cross platforms | many, see http://www.adacore.com/home/products/gnatpro/supported_platforms/; even more on request |
| Compiler back-end | GCC 4.3 |
| Available from | http://www.adacore.com/ by subscription (commercial) |
| Support | Commercial; customer-only bug database |
| Add-ons included | ASIS, Florist, GDB, GLADE, GPS, GtkAda, XML/Ada, and many more in source and, on request, binary form. |

#### GCC

GNAT has been part of the Free Software Foundation's GCC since October 2001. The Free Software Foundation does not distribute binaries, only sources. Its licensing of the run-time library for Ada (and other languages) allows the development of proprietary software without necessarily imposing the terms of the GPL.
Most GNU/Linux distributions and several distributions for other platforms include prebuilt binaries; see below.
For technical reasons, we recommend against using the Ada compilers included in GCC 3.1, 3.2, 3.3 and 4.0. Instead, we recommend using GCC 3.4, 4.1 or later, or one of the releases from AdaCore (3.15p, GPL Edition or Pro).
Since October 2003, AdaCore merge most of their changes from GNAT Pro into GCC during Stage 1; this happens once for each major release. Since GCC 3.4, AdaCore has gradually added support for revised language standards, first Ada 2005 and now Ada 2012.
GCC version 4.4 switched to version 3 of the GNU General Public License and grants a Runtime Library Exception similar in spirit to the GNAT Modified General Public License used in all previous versions. This Runtime Library Exception applies to run-time libraries for all languages, not just Ada.
As of GCC 4.7, released on 2012-03-22:
| Languages supported | Ada 83, Ada 95, Ada 2005, parts of Ada 2012, C, C++, Fortran 95, Java, Objective-C, Objective-C++ (and others) |
| License for the run-time library | GPL version 3 with Runtime Library Exception |
| Native platforms | none (source only) |
| Cross platforms | none (source only) |
| Compiler back-end | GCC 4.7 |
| Available from | http://gcc.gnu.org/ in source only form. |
| Support | Volunteer; public bug database |
| Add-ons included | none |

### The GNU Ada Project

The GNU Ada Project provides source and binary packages of various GNAT versions for several operating systems, and, importantly, the scripts used to create the packages. This may be helpful if you plan to port the compiler to another platform or create a cross-compiler; there are instructions for building your own GNAT compiler for GNU/Linux and Mac OS X users.
Both GPL and GMGPL or GCC Runtime Library Exception versions of GNAT are available.
| Languages supported | Ada 83, Ada 95, Ada 2005, C. (Some distributions also support Ada 2012, Fortran 90, Java, Objective C and Objective C++) |
| License for the run-time library | pure, GNAT-modified GPL, or GCC Runtime Library Exception |
| Native platforms | Fedora Core 4 and 5, MS-DOS, OS/2, Solaris 10, SuSE 10, Mac OS X, (more?) |
| Cross platforms | none |
| Compiler back-end | GCC 2.8.1, 3.4, 4.0, 4.1, 4.2, 4.3, 4.4, 4.5, 4.6 (various binary packages) |
| Available from | Sourceforge |
| Support | Volunteer; public bug database |
| Add-ons included | AdaBrowse, ASIS, Booch Components, Charles, GPS, GtkAda (more?) |

### A# (A-Sharp, a.k.a. Ada for .NET)

This compiler is historical as it has now been merged into GNAT GPL Edition and GNAT Pro.
A# is a port of Ada to the .NET Platform. A# was originally developed at the Department of Computer Science at the United States Air Force Academy which distribute A# as a service to the Ada community under the terms of the GNU general public license. A# integrates well with Microsoft Visual Studio 2005, AdaGIDE and the RAPID open-source GUI Design tool. As of 2006-06-06:
| Languages supported | Ada 83, Ada 95, C |
| License for the run-time library | pure GPL |
| Native platforms | Microsoft .NET |
| Cross platforms | none |
| Compiler back-end | GCC 3.4 (GNAT GPL 2006 Edition?) |
| Available from | http://sourceforge.net/projects/asharp/ |
| Support | None (but see GNAT Pro) |
| Add-ons included | none. |

### GNAT for AVR microcontrollers

Rolf Ebert and others provide a version of GNAT configured as a cross-compiler to various AVR microcontrollers, as well as an experimental Ada run-time library suitable for use on the microcontrollers. As of Version 1.1.0 (2010-02-25):
| Languages supported | Ada 83, Ada 95, Ada 2005, C |
| License for the run-time library | GNAT-Modified GPL |
| Host platforms | GNU/Linux and Microsoft Windows on i386 |
| Target platforms | Various AVR 8-bit microcontrollers |
| Compiler back-end | GCC 4.7 |
| Available from | http://avr-ada.sourceforge.net/ |
| Support | Volunteer; public bug database |
| Add-ons included | partial Ada run time system, AVR peripherals support library |

### GNAT for LEON

The Real-Time Research Group of the Technical University of Madrid (UPM, Universidad Politécnica de Madrid) wrote a Ravenscar-compliant real-time kernel for execution on LEON processors and a modified run-time library. They also provide a GNAT cross-compiler. As of version 2.0.1:
| Languages supported | Ada 83, Ada 95, Ada 2005, C |
| License for the run-time library | pure GPL |
| Native platforms | none |
| Cross platforms | GNU/Linux on i686 to LEON2 bare boards |
| Compiler back-end | GCC 4.1 (GNAT GPL 2007 Edition) |
| Available from | http://www.dit.upm.es/ork/ |
| Support | ? |
| Add-ons included | OpenRavenscar real-time kernel; minimal run-time library |

### GNAT for Macintosh (Mac OS X)

GNAT for Macintosh provides both FSF (GMGPL) and AdaCore (GPL) versions of GNAT with Xcode and Carbon integration and bindings.
Note that this site was last updated for GCC 4.3 and Mac OS X Leopard (both PowerPC and Intel-based). Aside from the work on integration with Apple’s Carbon graphical user interface and with Xcode 3.1 it may be preferable to see above.
There is also support at MacPorts; the last update (at 25 Nov 2011) was for GCC 4.4.2.

### Prebuilt packages as part of larger distributions

Many distributions contain prebuilt binaries of GCC or various public releases of GNAT from AdaCore. Quality varies widely between distributions. The list of distributions below is in alphabetical oder. (Please keep it that way.)

#### AIDE (for Microsoft Windows)

AIDE — Ada Instant Development Environment is a complete one-click, just-works Ada distribution for Windows, consisting of GNAT, comprehensive documentation, tools and libraries. All are precompiled, and source code is also available. The installation procedure is particularly easy (just unzip to default c:\aide and run). AIDE is intended for beginners and teachers, but can also be used by advanced users.
| Languages supported | Ada 83, Ada 95, C |
| License for the run-time library | GNAT-modified GPL |
| Native platforms | Microsoft Windows on i386 |
| Cross platforms | none |
| Compiler back-end | GCC 2.8.1 |
| Available from | https://stef.genesix.org/aide/aide.html |
| Support | stef@genesix.org |
| Add-ons included | ASIS, GDB, GPS, GtkAda, Texinfo (more?) |

#### Cygwin (for Microsoft Windows)

Cygwin, the Linux-like environment for Windows, also contains a version of the GNAT compiler. The Cygwin version of GNAT is older than the MinGW version and does not support DLLs and Multi-Threading (as of 11.2004).

#### Debian (GNU/Linux and GNU/kFreeBSD)

There is a Debian Policy for Ada which tries to make Debian the best Ada development and deployment platform. The development platform includes the compiler and many libraries, pre-packaged and integrated so as to be easy to use in any program. The deployment platform is the renowned stable distribution, which is suitable for mission-critical workloads and enjoys long life cycles, typically 3 to 4 years. Because Debian is a binary distribution, it is possible to deploy non-free, binary-only programs on it while enjoying all the benefits of a stable platform. Compiler choices are conservative for this reason, and the Policy mandates that all Ada programs and libraries be compiled with the same version of GNAT. This makes it possible to use all libraries in the same program. Debian separates run-time libraries from development packages, so that end users do not have to install the development system just to run a program.
The GNU Ada compiler can be installed on a Debian system with this command:
This will also give you a list of related packages, which are likely to be useful for an Ada programmer.
Debian is unique in that it also allows programmers to use some of GNAT's internal components by means of two libraries:
* libgnatvsn (licensed under GNAT-Modified GPL) and
* libgnatprj (the project manager, licensed under pure GPL).
Debian packages make use of these libraries.
In the table below, the information about the future Debian 8.0 Jessie is accurate as of October 2014 and will change.
| | 3.1 Sarge | 4.0 Etch | 5.0 Lenny | 6.0 Squeeze | 7.0 Wheezy | 8.0 Jessie |
| Release date | June 2005 | April 2007 | February 2009 | February 2011 | May 2013 | April 2015 |
| Languages supported | Ada 83, Ada 95, C | +Ada 2005, parts of Ada 2012, C, C++, Fortran 95, Java, Objective-C, Objective-C++ | +Ada 2005, parts of Ada 2012, C, C++, Fortran 95, Java, Objective-C, Objective-C++ | +Ada 2005, parts of Ada 2012, C, C++, Fortran 95, Java, Objective-C, Objective-C++ | +Ada 2005, parts of Ada 2012, C, C++, Fortran 95, Java, Objective-C, Objective-C++ | +Ada 2012 |
| License for the run-time library | GNAT-modified GPL (both ZCX and SJLJ versions starting from 5.0 Lenny) | GNAT-modified GPL (both ZCX and SJLJ versions starting from 5.0 Lenny) | GNAT-modified GPL (both ZCX and SJLJ versions starting from 5.0 Lenny) | GPL version 3 with Run-time library exception | GPL version 3 with Run-time library exception | GPL version 3 with Run-time library exception |
| Native platforms: | 3.1 Sarge | 4.0 Etch | 5.0 Lenny | 6.0 Squeeze | 7.0 Wheezy | 8.0 Jessie |
| alpha | | yes | yes | | | |
| amd64 | | yes | yes | yes | yes | yes |
| armel | | | | preliminary | yes | yes |
| armhf | | | | | yes | yes |
| hppa | | yes | yes | yes | | |
| hurd-i386 | | | | | yes | yes |
| i386 | yes | yes | yes | yes | yes | yes |
| ia64 | | yes | yes | yes | yes | |
| kfreebsd-amd64 | | | | yes | yes | yes |
| kfreebsd-i386 | | yes | yes | yes | yes | yes |
| mips | | yes | yes | yes | yes | yes |
| mipsel | | yes | yes | yes | yes | yes |
| powerpc | yes | yes | yes | yes | yes | yes |
| ppc64 | | | yes | yes | yes | yes |
| s390 | | yes | yes | yes | yes | s390x |
| sparc | yes | yes | yes | yes | yes | yes |
| Cross platforms | none | none | none | none | none | none |
| Compiler back-end | GCC 2.8.1 | GCC 4.1 | GCC 4.3 | GCC 4.4 | GCC 4.6 | GCC 4.9 |
| Available from | http://www.debian.org/ | http://www.debian.org/ | http://www.debian.org/ | http://www.debian.org/ | http://www.debian.org/ | http://www.debian.org/ |
| Support | Volunteer; public bug database; paid support available from third parties; public mailing list | Volunteer; public bug database; paid support available from third parties; public mailing list | Volunteer; public bug database; paid support available from third parties; public mailing list | Volunteer; public bug database; paid support available from third parties; public mailing list | Volunteer; public bug database; paid support available from third parties; public mailing list | Volunteer; public bug database; paid support available from third parties; public mailing list |
| Add-ons included | 3.1 Sarge | 4.0 Etch | 5.0 Lenny | 6.0 Squeeze | 7.0 Wheezy | 8.0 Jessie |
| ada-reference-manual | 1995 | 1995 | 1995 | 2005 | 2012 | 2012 |
| AdaBindX | 0.7.2 | | | | | |
| AdaBrowse | 4.0.2 | 4.0.2 | 4.0.2 | 4.0.3 | 4.0.3 | - |
| AdaCGI | 1.6 | 1.6 | 1.6 | 1.6 | 1.6 | 1.6 |
| AdaControl | | 1.6r8 | 1.9r4 | 1.12r3 | 1.12r3 | 1.16r11 |
| APQ (with PostgreSQL) | | | | 3.0 | 3.2 | 3.2 |
| AdaSockets | 1.8.4.7 | 1.8.4.7 | 1.8.4.7 | 1.8.8 | 1.8.10 | 1.8.11 |
| Ahven | | | 1.2 | 1.7 | 2.1 | 2.4 |
| Alog | | | 0.1 | 0.3 | 0.4.1 | - |
| anet | | | | | 0.1 | 0.3.1 |
| ASIS | 3.15p | 2005 | 2007 | 2008 | 2010 | 2014 |
| AUnit | 1.01 | 1.03 | 1.03 | 1.03 | 1.03 | 3.7.1 |
| AWS | 2.0 | 2.2 | 2.5 prerelease | 2.7 | 2.10.2 | 3.2.0 |
| Charles | 2005-02-17 | (superseded by Ada.Containers in gnat) | (superseded by Ada.Containers in gnat) | (superseded by Ada.Containers in gnat) | (superseded by Ada.Containers in gnat) | (superseded by Ada.Containers in gnat) |
| Florist | 3.15p | 2006 | 2006 | 2009 | 2011 | 2014 |
| GDB | 5.3 | 6.4 | 6.8 | 7.0.1 | 7.4.1 | 7.7.1 |
| GLADE | 3.15p | 2006 | | (superseded by PolyORB) | (superseded by PolyORB) | (superseded by PolyORB) |
| GMPAda | | | | 0.0.20091124 | 0.0.20120331 | 0.0.20131223 |
| GNADE | 1.5.1 | 1.6.1 | 1.6.1 | 1.6.2 | 1.6.2 | - |
| GNAT Checker | 1999-05-19 | (superseded by AdaControl) | (superseded by AdaControl) | (superseded by AdaControl) | (superseded by AdaControl) | (superseded by AdaControl) |
| GPRBuild | | | | 1.3.0w | 2011 | 2014 |
| GPS | 2.1 | 4.0.1 | 4.0.1 | 4.3 | 5.0 | 5.3 |
| GtkAda | 2.4 | 2.8.1 | 2.8.1 | 2.14.2 | 2.24.1 | 2.24.4 |
| Log4Ada | | | | 1.0 | 1.2 | 1.2 |
| Narval | | | | 1.10.2 | | |
| OpenToken | 3.0b | 3.0b | 3.0b | 4.0b | 4.0b | 5.0a |
| PC/SC Ada | | | | 0.6 | 0.7.1 | 0.7.2 |
| PolyORB | | | | 2.6 prerelease | 2.8 prerelease | 2.11 prerelease |
| PLPlot | | | 5.9.0 | 5.9.5 | 5.9.5 | 5.10.0 |
| Templates Parser | | 10.0+20060522 | 11.1 | 11.5 | 11.6 | 11.8 |
| TextTools | 2.0.3 | 2.0.3 | 2.0.5 | 2.0.6 | | 2.1.0 |
| XML/Ada | 1.0 | 2.2 | 3.0 | 3.2 | 4.1 | 4.4 |
| XML-EZ-out | | | | 1.06 | 1.06.1 | 1.06.1 |
The ADT plugin for Eclipse (see section ObjectAda from Aonix) can be used with GNAT as packaged for Debian Etch. Specify "/usr" as the toolchain path.

#### DJGPP (for MS-DOS)

DJGPP has GNAT as part of their GCC distribution.
DJGPP is a port of a comprehensive collection of GNU utilities to MS-DOS with 32-bit extensions, and is actively supported (as of 1.2005). It includes the whole GCC compiler collection, that now includes Ada. See the DJGPP website for installation instructions.
DJGPP programs run also in a DOS command box in Windows, as well as in native MS-DOS systems.

#### FreeBSD and DragonFly

FreeBSD's ports collection has an Ada framework with an expanding set of software packages. The Framework is currently built by FSF GCC 6.3.1, although FSF GCC 5.4 can optionally be used instead. The AdaCore GPL compilers are not present. There are several reasons for this, not the least of which is the addition maintenance of multiple compilers is significant. There are no non-GCC based Ada compilers represented in ports either.
While FreeBSD does have a snapshot that goes with each release, the ports are updating in a rolling fashion continuously, and the vast majority of users prefer the "head" of ports which has the latest packages.
| Languages supported | Ada 83, Ada 95, Ada 2005, Ada 2012, C, C++, ObjC, Fortran |
| License for the run-time library | GPLv3 with Runtime Library Exception v3 |
| Native platforms | FreeBSD i386, FreeBSD AMD64, FreeBSD ARM64, DragonFly x86-64 |
| Cross platforms | FreeBSD/DragonFly->Android (targets ARMv7 and x86), FreeBSD/DragonFly->FreeBSD/ARM64 (targets Aarch64) |
| Compiler back-end | GCC 6.3.1 |
| Available from | http://www.freebsd.org, https://github.com/DragonFlyBSD/DPorts |
| Support | Volunteer; public bug database |
There are two ways to install the software. The quickest and easiest way is to install prebuilt binaries using the command "pkg install <pkg name>". For example, to install the GNAT Programming Studio and all of its dependencies including the GNAT compiler, all you need is one command:
If a specific package is not available, or the user just prefers to build from source (this can take a long time), then a typical command would be:
As with the binary installation, if any dependencies are missing they will be built first, also from source.
Available software as of 8 February 2017
| Directory | Common Name | version | pkg name |
| archivers/zip-ada | Zip-Ada (Library) | 52 | zip-ada |
| cad/ghdl | GNU VHDL simulator | 0.33 | ghdl |
| databases/adabase | Thick bindings to Postgres, MySQL and SQLite | 3.0 | adabase |
| databases/apq | Ada95 database interface library | 3.2.0 | apq |
| databases/apq-mysql | APQ MySQL driver | 3.2.0 | apq-mysql |
| databases/apq-odbc | APQ ODBC driver | 3.2.0 | apq-odbc |
| databases/apq-pgsql | APQ PostgreSQL driver | 3.2.0 | apq-pgsql |
| devel/ada-util | Ada 2005 app utilities (Library) | 1.8.0 | ada-util |
| devel/adaid | UUID generation library | 0.0.1 | adaid |
| devel/adabooch | Ada95 Booch Components (Library) | 2016-03-21 | adabooch |
| devel/adacurses | AdaCurses (Binding) | 2015-08-08 | adacurses |
| devel/afay | AFlex and AYACC parser generators | 041111 | afay |
| devel/ahven | Ahven (Unit Test Library) | 2.6 | ahven |
| devel/alog | Stackable logging framework | 0.5.2 | alog |
| devel/aunit | Unit testing framework | 2016 | aunit |
| devel/florist-gpl | Florist (Posix Binding) | 2016 | florist-gpl |
| devel/gnatcoll | GNAT Component Collection | 2016 | gnatcoll |
| devel/gnatpython | GNATPython (python-based test framework) | 2014-02-24 | gnatpython |
| devel/gprbuild | GPRbuild (Multi-language build tool) | 20160609 | gprbuild |
| devel/gps | GNAT Programming Studio | 2016 | gps-ide |
| devel/libspark2012 | SPARK 2012 library source files | 2012 | libspark2012 |
| devel/matreshka | Matreshka (Info Systems Library) | 0.7.0 | matreshka |
| devel/pcsc-ada | PCSC library | 0.7.3 | pcsc-ada |
| devel/pragmarcs | PragmAda Reusable Components | 20161207 | pragmarcs |
| devel/sdl_gnat | GNAT SDL bindings (Thin) | 2013 | sdl_gnat |
| devel/simple_components | Simple Ada components | 4.18 | simple_components |
| dns/ironsides | Spark/Ada Ironsides DNS Server | 2015-04-15 | ironsides |
| graphics/generic_image_decoder | image decoder library | 05 | generic_image_decoder |
| lang/adacontrol | AdaControl (Construct detection tool) | 1.17r3 | adacontrol |
| lang/asis | Ada Semantic Interface Specification | 2016 | asis |
| lang/gcc5-aux | GNAT Ada compiler (FSF GCC) | 5.4 (2016-06-03) | gcc5-aux |
| lang/gcc6-aux | GNAT Ada compiler (FSF GCC) | 6.3.1 (2017-02-02) | gcc6-aux |
| lang/gnat_util | GNAT sources (helper Library) | 2017-02-02 | gnat_util |
| lang/gnatcross-aarch64 | FreeBSD/ARM64 cross-compiler, Aarch64 | 2017-02-02 (6.3.1) | gnatcross-aarch64 |
| lang/gnatcross-binutils-aarch64 | GNU Binutils used by FreeBSD/ARM64 cross-compiler | 2.27 | gnatcross-binutils-aarch64 |
| lang/gnatcross-sysroot-aarch64 | FreeBSD/ARM64 sysroot | 1 | gnatcross-sysroot-aarch64 |
| lang/gnatdroid-armv7 | Android 5.0 cross-compiler, ARMv7 | 2017-02-02 (6.3.1) | gnatdroid-armv7 |
| lang/gnatdroid-binutils | GNU Binutils used by Android cross-compiler | 2.27 | gnatdroid-binutils |
| lang/gnatdroid-binutils-x86 | GNU Binutils used by Android cross-compiler (x86) | 2.27 | gnatdroid-binutils-x86 |
| lang/gnatdroid-sysroot | Android API 4.0 to 6.0 sysroot | 23 | gnatdroid-sysroot |
| lang/gnatdroid-sysroot-x86 | Android API 4.4 to 6.0 sysroot (x86) | 23 | gnatdroid-sysroot-x86 |
| lang/gnatdroid-x86 | Android 5.0 cross-compiler, x86 | 2017-02-02 (6.3.1) | gnatdroid-x86 |
| lang/lua-ada | Ada bindings for Lua | 1.0 | ada-lua |
| math/plplot-ada | PLplot Ada bindings | 5.12.0 | plplot-ada |
| misc/excel-writer | Excel output library | 15 | excel-writer |
| misc/ini_file_manager | Configuration file library | 03 | ini_file_manager |
| net/adasockets | IPv4 socket library | 1.10 | adasockets |
| net/anet | Network library (IPv4 and IPv6) | 0.3.4 | anet |
| net/polyorb | PolyORB (CORBA/SOAP/DSA middleware) | 2.11.1 (2014) | polyorb |
| security/libadacrypt | Cryptography Library (symm & asymm) | 20151019 | libadacrypt |
| security/libsparkcrypto | LibSparkCrypto (Cryptography Library) | 0.1.1 | libsparkcrypto |
| shells/sparforte | Shell and scripting language for mission-critical projects | 2.0.2 | spareforte |
| textproc/adabrowse | AdaBrowse (Ada95 HTML doc. generator) | 4.0.3 | adabrowse |
| textproc/opentoken | Ada Lex analyzer and parser | 6.0b | opentoken |
| textproc/py-sphinxcontrib-adadomain | Sphinx documentation generator for Ada | 0.1 | py27-sphinxcontrib-adadomain |
| textproc/templates_parser | AWS Template Parser library | 17.0.0 | templates_parser |
| textproc/words | Words (Latin/English dictionary) | 1.97F | words |
| textproc/xml_ez_out | XML output (Library) | 1.06 | xml_ez_out |
| textproc/xmlada | XML/Ada (Library) | 17.0.0 | xmlada |
| www/aws | Ada Web Server | 17.0.1 | aws |
| www/aws-demos | Ada Web Server demos | 17.0.1 | aws-demos |
| x11-toolkits/gtkada | GTK2/Ada (bindings) | 2.24.4 | gtkada |
| x11-toolkits/gtkada3 | GTK3/Ada (bindings) | 3.14.2 | gtkada3 |

#### Gentoo GNU/Linux

The GNU Ada compiler can be installed on a Gentoo system using emerge:
In contrast to Debian, Gentoo is primarily a source distribution, so many packages are available only in source form, and require the user to recompile them (using emerge).
Also in contrast to Debian, Gentoo supports several versions of GNAT in parallel on the same system. Be careful, because not all add-ons and libraries are available with all versions of GNAT.
| Languages supported | Ada 83, Ada 95, Ada 2005, C (more?) |
| License for the run-time library | pure or GNAT-modified GPL (both available) |
| Native platforms | Gentoo GNU/Linux on amd64, powerpc and i386 |
| Cross platforms | none |
| Compiler back-end | GCC 3.4, 4.1 (various binary packages) |
| Available from | http://www.gentoo.org/ (see other Gentoo dev-ada packages) |
| Support | Volunteer; public bug database |
| Add-ons included | AdaBindX, AdaBroker, AdaDoc, AdaOpenGL, AdaSockets, ASIS, AUnit, Booch Components, CBind, Charles, Florist, GLADE, GPS, GtkAda, XML/Ada |

#### Mandriva Linux

The GNU Ada compiler can be installed on a Mandriva system with this command:

#### MinGW (for Microsoft Windows)

MinGW — Minimalist GNU for Windows contains a version of the GNAT compiler.
The current version of MinGW (5.1.6) contains gcc-4.5.0. This includes a fully functional GNAT compiler. If the automatic downloader does not work correctly you can download the compiler directly: pick gcc-4.5.0-1 from MinGW/BaseSystem/GCC/Version4/

##### old instructions

The following list should help you with the installation. (I may have forgotten something — but this is wiki, just add to the list)
* Install MinGW-3.1.0-1.exe
** extract binutils-2.15.91-20040904-1.tar.gz
** extract mingw-runtime-3.5.tar.gz
** extract gcc-core-3.4.2-20040916-1.tar.gz
** extract gcc-ada-3.4.2-20040916-1.tar.gz
** extract gcc-g++-3.4.2-20040916-1.tar.gz (Optional)
** extract gcc-g77-3.4.2-20040916-1.tar.gz (Optional)
** extract gcc-java-3.4.2-20040916-1.tar.gz (Optional)
** extract gcc-objc-3.4.2-20040916-1.tar.gz (Optional)
** extract w32api-3.1.tar.gz
* Install mingw32-make-3.80.0-3.exe (Optional)
* Install gdb-5.2.1-1.exe (Optional)
* Install MSYS-1.0.10.exe (Optional)
* Install msysDTK-1.0.1.exe (Optional)
** extract msys-automake-1.8.2.tar.bz2 (Optional)
** extract msys-autoconf-2.59.tar.bz2 (Optional)
** extract msys-libtool-1.5.tar.bz2 (Optional)
I have made good experience in using D:\MinGW as target directory for all installations and extractions.
Also noteworthy is that the Windows version for GNAT from Libre is also based on MinGW.
In gcc-3.4.2-release_notes.txt from MinGW site reads: please check that the files in the /lib/gcc/mingw32/3.4.2/adainclude and adalib directories are flagged as read-only. This attribute is necessary to prevent them from being deleted when using gnatclean to clean a project.
So be sure to do this.

#### OpenCSW (for Solaris on SPARC and x86)

OpenCSW has binary packages of GCC 3.4.6 and 4.6.2 with Ada support. The package names are gcc3ada and gcc4ada respectively.
| Languages supported | Ada 83, Ada 95, parts of Ada 2005, C, C++, Fortran 95, Java, Objective-C, Objective-C++ |
| License for the run-time library | GNAT-modified GPL |
| Native platforms | Oracle Solaris and OpenSolaris on SPARC and x86 |
| Cross platforms | none |
| Compiler back-end | GCC 3.4.6 and 4.6.2 (both available) |
| Support | ? |
| Available from | http://www.opencsw.org/ |
| Add-ons included | none (?) |

#### pkgsrc: NetBSD, DragonFly, FreeBSD and Solaris

The pkgsrc portable package file system has a small Ada framework. It is based on FSF GCC 5.4 currently and the FSF GCC 6.2 is available as well.
The AdaCore GPL versions are not present, nor are non-GCC based compilers.
The pkgsrc system is released in quarterly branches, which are normally recommended. However, a user could also choose the "head" which would the very latest package versions. The pkgsrc system supports 21 platforms, but for Ada this is potentially limited to 5 due to the bootstrap compiler requirement: NetBSD, DragonFly, SunOS (Solaris/Illumos), OpenBSD/MirBSD, and FreeBSD.
| Languages supported | Ada 83, Ada 95, Ada 2005, Ada 2012, C, C++, ObjC, Fortran |
| License for the run-time library | GPLv3 with Runtime Library Exception v3 |
| Native platforms | NetBSD i386 and amd64, DragonFly x86-64, FreeBSD i386 and amd64, Solaris i386 and x86_64 |
| Cross platforms | None |
| Compiler back-end | GCC 5.4 (GCC 4.9 and 6 available) |
| Available from | http://www.pkgsrc.org, status: http://www.pkgsrc.se |
| Support | Volunteer; public bug database |
There are two ways to install the software. The quickest and easiest way is to install prebuilt binaries using the command "pkg_add <pkg name>". For example, to install the GNAT Programming Studio and all of its dependencies including the GNAT compiler, all you need is one command:
If a specific package is not available, or the user just prefers to build from source (this can take a long time), then a typical command would be:
As with the binary installation, if any dependencies are missing they will be built first, also from source.
Available software as of 14 December 2016
| Directory | Common Name | version | pkg name |
| cad/ghdl | GNU VHDL simulator | 0.32rc1 | ghdl |
| devel/florist | Florist (Posix Binding) | 2012 | florist-gpl |
| devel/gnatpython | GNATPython (python-based test framework) | 2011-09-12 | gnatpython |
| devel/gprbuild-aux | GPRbuild (Multi-language build tool) | 2016-06-09 | gprbuild-aux |
| lang/gcc-aux | GNAT Ada compiler (FSF GCC) | 4.9.2 (2014-10-23) | gcc-aux |
| lang/gcc5-aux | GNAT Ada compiler (FSF GCC) | 5.4.0 (2016-06-03) | gcc5-aux |
| lang/gcc6-aux | GNAT Ada compiler (FSF GCC) | 6.2.0 (2016-08-22) | gcc6-aux |
| textproc/xmlada | XML/Ada (Library) | 4.4.0 | xmlada |
| www/aws | Ada Web Server | 3.1.0.0 (w) | aws |
| www/aws-demos | Ada Web Server demos | 3.1.0.0 (w) | aws-demos |
| x11/gtkada | GTK/Ada (bindings) | 2.24.4 | gtkada |

#### SuSE Linux

All versions of SuSE Linux have a GNAT compiler included. SuSE versions 9.2 and higher also contains ASIS, Florist and GLADE libraries. The following two packages are needed:
For SuSE version 12.1, the compiler is in the package
For 64 bit system you will need the 32 bit compatibility packages as well:

#### Ubuntu

Ubuntu (and derivatives like Kubuntu, Xubuntu...) is a Debian-based Linux distribution, thus the installation process described above can be used. Graphical package managers like Synaptic or Adept can also be employed to select the Ada packages.

## ICC from Irvine Compiler Corporation

Irvine Compiler Corporation provides native and cross compilers for various platforms. The compiler and run-time system support development of certified, safety-critical software.
Commercial, proprietary. No-cost evaluation is possible on request. Royalty-free redistribution of the run-time system is allowed.

## Janus/Ada 83 and 95 from RR Software

RR Software offers native compilers for MS-DOS, Microsoft Windows and various Unix and Unix-like systems, and a library for Windows GUI programming called CLAW. There are academic, personal and professional editions, as well as support options.
Janus/Ada 95 supports subset of Ada 2007 and Ada 2012 features.
Commercial but relatively cheap; proprietary.

## MAXAda from Concurrent

Concurrent offers MAXAda, an Ada 95 compiler for Linux/Xeon and PowerPC platforms, and Ada bindings to POSIX and X/Motif.
Commercial, proprietary.

## ObjectAda from PTC (formerly Aonix/Atego)

PTC offers ObjectAda native (Windows, some flavors of Unix, and Linux) and cross (PPC, Intel, VxWorks, and ERC32) compilers.
Limited support of Ada 2012 is available.
Commercial, proprietary.

## PowerAda from OC Systems

OC Systems offers Ada compilers and bindings to POSIX and X-11:
* PowerAda, an Ada 95 compiler for Linux and AIX,
* LegacyAda/390, an Ada 83 compiler for IBM System 370 and 390 mainframes
Commercial, proprietary.

## ApexAda from PTC (formerly IBM Rational)

PTC ApexAda for native and embedded development.
Commercial, proprietary.

## SCORE from DDC-I

DDC-I offers its SCORE cross-compilers for embedded development. SCORE stands for Safety-Critical, Object-oriented, Real-time Embedded.
Commercial, proprietary.

## TADS from Tartan

Tartan offers the Tartan Ada Development System (TADS), with cross-compilers for some digital signal processors.
Commercial, proprietary.

## XD Ada from DXC

XD Ada is an Ada 83 cross-compiler for embedded development. Hosts include VAX, Alpha and Integrity Servers running OpenVMS. Targets include Motorola 68000 and MIL-STD-1750A processors.
Commercial, proprietary.

## XGC Ada from XGC Software

XGC compilers are GCC with custom run-time libraries suitable for avionics and space applications. The run-time kernels are very small and do not support exception propagation (i.e. you can handle an exception only in the subprogram that raised it).
Commercial but some versions are also offered as free downloads. Free Software.
| Languages supported | Ada 83, Ada 95, C |
| License for the run-time library | GNAT-Modified GPL |
| Native platforms | none |
| Cross platforms | Hosts: sun-sparc-solaris, pc-linux2.*; targets are bare boards with ERC32, MIL-STD-1750A, Motorola 68000 family or Intel 32-bit processors. PowerPC and Intel 80186 targets on request. |
| Compiler back-end | GCC 2.8.1 |
| Available from | http://www.xgc.com/ |
| Support | Commercial |
| Add-ons included | Ravenscar-compliant run-time kernels, certified for avionics and space applications; gdb cross-debugger; target simulator. |

## References
# Building

Ada programs are usually easier to build than programs written in other languages like C or C++, which frequently require a makefile. This is because an Ada source file already specifies the dependencies of its source unit. See the with keyword for further details.
Building an Ada program is not defined by the Reference Manual, so this process is absolutely dependent on the compiler. Usually the compiler kit includes a make tool which compiles a main program and all its dependencies, and links an executable file.

## Building with various compilers

    This list is incomplete. You can help Wikibooks by adding the build information for other compilers.

### Alire

Alire is a build tool and package manager which automatically manages package dependencies including downloading the needed build tools. It is based on the GNAT compiler.
You can create a new project with alr init:
Code:
Output:
Alire supports most of the GNAT feature mentioned below as well as the same IDE and code editors.

### GNAT

With GNAT, you can run this command:
If the file contains a procedure, gnatmake will generate an executable file with the procedure as main program. Otherwise, e.g. a package, gnatmake will compile the unit and all its dependencies.

#### GNAT command line

gnatmake can be written as one word gnatmake or two words gnat make. For a full list of gnat commands just type gnat without any command options. The output will look something like this:
For further help on the option just type the command (one word or two words — as you like) without any command options.

#### GNAT IDE

The GNAT toolchain comes with an IDE called GPS, included with recent releases of the GPL version of GNAT. GPS features a graphical user interface.
Emacs includes (Ada Mode), and GNAT plugins for KDevelop and Vim (Ada Mode) are available.
Vim Ada Mode is maintained by The GNU Ada project.

#### GNAT with Xcode

Apple's free (gratis) IDE, Xcode, uses the LLVM compiler with the Clang front-end, and does not support Ada: however, in Xcode 4.3 for OS X Lion and later versions, the command line tools (assembler, linker etc) which are required to use GNAT are an optional component of Xcode and must be specially installed.

### Rational APEX

Rational APEX is a complete development environment comprising a language sensitive editor, compiler, debugger, coverage analyser, configuration management and much more. You normally work with APEX running a GUI.
APEX has been built for the development of big programs. Therefore the basic entity of APEX is a subsystem, a directory with certain traits recognized by APEX. All Ada compilation units have to reside in subsystems.
You can define an export set, i.e. the set of Ada units visible to other subsystems. However for a subsystem A to gain visibility to another subsystem B, A has to import B. After importing, A sees all units in B's export set. (This is much like the with-clauses, but here visibility means only potential visibility for Ada: units to be actually visible must be mentioned in a with-clause of course; units not in the export set cannot be used in with-clauses of Ada units in external subsystems.)
Normally subsystems should be hierarchically ordered, i.e. form a directed graph. But for special uses, subsystems can also mutually import one another.
For configuration management, a subsystem is decomposed in views, subdirectories of the subsystem. Views hold different development versions of the Ada units. So actually it's not subsystems which import other subsystems, rather subsystem views import views of other subsystems. (Of course, the closure of all imports must be consistent — it cannot be the case that e.g. subsystem (A, view A1) imports subsystems (B, B1) and (C, C1), whereas (B, B1) imports (C, C2)).
A view can be defined to be the development view. Other views then hold releases at different stages.
Each Ada compilation unit has to reside in a file of its own. When compiling an Ada unit, the compiler follows the with-clauses. If a unit is not found within the subsystem holding the compile, the compiler searches the import list (only the direct imports are considered, not the closure).
Units can be taken under version control. In each subsystem, a set of histories can be defined. An Ada unit can be taken under control in a history. If you want to edit it, you first have to check it out — it gets a new version number. After the changes, you can check it in again, i.e. make the changes permanent (or you abandon your changes, i.e. go back to the previous version). You normally check out units in the development view only; check-outs in release views can be forbidden.
You can select which version shall be the active one; normally it is the one latest checked in. You can even switch histories to get different development paths. e.g. different bodies of the same specification for different targets.

### ObjectAda

ObjectAda is a set of tools for editing, compiling, navigating and debugging programs written in Ada. There are various editions of ObjectAda. With some editions you compile programs for the same platform and operating systems on which you run the tools. These are called native. With others, you can produce programs for different operating systems and platforms. One possible platform is the Java virtual machine.
These remarks apply to the native Microsoft Windows edition. You can run the translation tools either from the IDE or from the command line.
Whether you prefer to work from the IDE, or from the command line, a little bookkeeping is required. This is done by creating a project. Each project consists of a number of source files, and a number of settings like search paths for additional Ada libraries and other dependences. Each project also has at least one target. Typically, there is a debug target, and a release target. The names of the targets indicate their purpose. At one time you compile for debugging, typically during development, at other times you compile with different settings, for example when the program is ready for release. Some (all commercial?) editions of ObjectAda permit a Java (VM) target.

### DEC Ada for VMS

DEC Ada is an Ada 83 compiler for VMS. While “DEC Ada” is probably the name most users know, the compiler is now called “HP Ada”. It had previously been known also by names of "VAX Ada" and "Compaq Ada".
DEC Ada uses a true library management system — so the first thing you need to do is create and activate a library:
When creating a library you already set some constraints like support for Long_Float or the available memory size. So carefully read
Then next step is to load your Ada sources into the library:
The sources don't need to be perfect at this stage but syntactically correct enough for the compiler to determine the packages declared and analyze the with statements. Dec Ada allows you to have more than one package in one source file and you have any filename convention you like. The purpose of ACS Load is the creation of the dependency tree between the source files.
Next you compile them:
Note that compile take the package name and not the filename. The wildcard * means all packages loaded. The compiler automatically determines the right order for the compilation so a make tool is not strictly needed.
Last but not least you link your file into an
On large systems you might want to break sources down into several libraries — in which case you also need
to merge the content of the current library with the library higher up the hierarchy. The larger libraries should then be created with:
This uses a different directory layout more suitable for large libraries.

#### DEC Ada IDE

Dec Ada comes without an IDE, however the DEC LSE as well as the Ada Mode of the Vim text editor support DEC Ada.

## Compiling our Demo Source

Once you have downloaded our example programs, you might wonder how to compile them.
Unless you use Alire, you need to extract the sources. Use your favorite zip tool to achieve that. On extraction, a directory with the same name as the filename is created. Beware: WinZip might also create a directory equaling the filename, so Windows users need to be careful using the right option, otherwise they end up with wikibook-ada-1_2_0.src\wikibook-ada-1_2_0.
Once you extracted the files, you will find all sources in wikibook-ada-1_2_0/Source. You could compile them right there. For your convenience, we also provide ready-made project files for the following IDEs (If you find a directory for an IDE not named, it might be in the making and not actually work).

### Alire

Alire is the simplest way to compile the sample code if you use Windows, macOS or Linux. With Alire, you don't even need to download and extract the source, as Alire will do everything for you. All you need to do after the installation of Alire itself is execute the following command in a terminal or CMD window:
Code:
Output:
This will download all samples ordered by chapter. To then, for example, build and execute the first sample code from the Basic Ada chapter you type:
Code:
Output:

### GNAT

You will find multi-target GNAT Project files and a multi-make Makefile file in wikibook-ada-2_0_0/GNAT. For i686 Linux and Windows, you can compile any demo using:
You can also open them inside the GPS with
For other target platform it is a bit more difficult since you need to tell the project files which target you want to create. The following options can be used:

#### style ("Debug", "Release")

    you can define if you like a debug or release version so you can compare how the options affect size and speed.

#### os ("Linux", "OS2", "Windows_NT", "VMS")

    choose your operating system. Since there is no Ada 2005 available for OS/2 don't expect all examples to compile.

#### target ("i686", "x86_64", "AXP")

    choose your CPU — "i686" is any form of 32bit Intel or AMD CPU, "x86_64" is an 64 bit Intel or AMD CPU and if you have an "AXP" then you know it.
Remember to type all options as they are shown. To compile a debug version on x86-64 Linux you type:
As said in the beginning there is also a makefile available that will automatically determine the target used. So if you have a GNU make you can save yourself a lot of typing by using:
or even use
to make all examples in debug and release in one go.
Each compile is stored inside its own directory which is created in the form of wikibook-ada-2_0_0/GNAT/OS-Target-Style. Empty directories are provided inside the archive.

### Rational APEX

APEX uses the subsystem and view directory structure, so you will have to create those first and copy the source files into the view. After creating a view using the architecture model of your choice, use the menu option "Compile -> Maintenance -> Import Text Files". In the Import Text Files dialog, add "wikibook-ada-2_0_0/Source/*.ad?" to select the Ada source files from the directory you originally extracted to. Apex uses the file extensions .1.ada for specs and .2.ada for bodies — don't worry, the import text files command will change these automatically.
To link an example, select its main subprogram in the directory viewer and click the link button in the toolbar, or "Compile -> Link" from the menu. Double-click the executable to run it. You can use the shift-key modifier to bypass the link or run dialog.

### ObjectAda
#### ObjectAda command-line

The following describes using the ObjectAda tools for Windows in a console window.
Before you can use the ObjectAda tools from the command line, make sure the PATH environment variable lists the directory containing the ObjectAda tools. Something like
A minimal ObjectAda project can have just one source file. like the Hello World program provided in
To build an executable from this source file, follow these steps (assuming the current directory is a fresh one and contains the above mentioned source file):
* Register your source files:
This makes your sources known to the ObjectAda tools. Have a look at the file UNIT.MAP created by adareg in the current directory if you like seeing what is happening under the hood.
* Compile the source file:
* Build the executable program:
Notice that you specify the name of the main unit as argument to adabuild, not the name of the source file. In this case, it is Hello_World_1 as in
More information about the tools can be found in the user guide Using the command line interface, installed with the ObjectAda tools.

## External links

* GNAT Online Documentation:
** GNAT User's Guide
* DEC Ada:
** Developing Ada Products on OpenVMS (PDF)
** DEC Ada — Language Reference Manual (PDF)
** DEC Ada — Run-Time Reference (PDF)

# Control Statements
## Conditionals

Conditional clauses are blocks of code that will only execute if a particular expression (the condition) is true.

### if-else

The if-else statement is the simplest of the conditional statements. They are also called branches, as when the program arrives at an if statement during its execution, control will "branch" off into one of two or more "directions". An if-else statement is generally in the following form:
If the original condition is met, then all the code within the first statement is executed. The optional else section specifies an alternative statement that will be executed if the condition is false. Exact syntax will vary between programming languages, but the majority of programming languages (especially procedural and structured languages) will have some form of if-else conditional statement built-in. The if-else statement can usually be extended to the following form:
Only one statement in the entire block will be executed. This statement will be the first one with a condition which evaluates to be true. The concept of an if-else-if structure is easier to understand with the aid of an example:

### Optimizing hints

When this program executes, the computer will check all conditions in order until one of them matches its concept of truth. As soon as this occurs, the program will execute the statement immediately following the condition and continue, without checking any other condition . For this reason, when you are trying to optimize a program, it is a good idea to sort your if-else conditions in descending probability. This will ensure that in the most common scenarios, the computer has to do less work, as it will most likely only have to check one or two "branches" before it finds the statement which it should execute. However, when writing programs for the first time, try not to think about this too much lest you find yourself undertaking premature optimization.
Having said all that, you should be aware that an optimizing compiler might rearrange your if statement at will when the statement in question is free from side effects. Among other techniques optimizing compilers might even apply jump tables and binary searches.
In Ada, conditional statements with more than one conditional do not use short-circuit evaluation by default. In order to mimic C/C++'s short-circuit evaluation, use and then or or else between the conditions.

### case

Often it is necessary to compare one specific variable against several constant expressions. For this kind of conditional expression the case statement exists. For example:
The subtype of X must be a discrete type, i.e. an enumeration or integer type.
In Ada, one advantage of the case statement is that the compiler will check the coverage of the choices, that is, all the values of the subtype of variable X must be present or a default branch when others must specify what to do in the remaining cases.

## Unconditionals

Unconditionals let you change the flow of your program without a condition. You should be careful when using unconditionals. Often they make programs difficult to understand. Read Isn't goto evil? for more information.

### return

End a function and return to the calling procedure or function.
For procedures:
For functions:

### goto

Goto transfers control to the statement after the label.

#### Is goto evil?

Since Professor Dikstra wrote his article Go To Statement Considered Harmful, goto is considered bad practice in structured programming languages, and, in fact, many programming style guides forbid the use of the goto statement. But it is often overlooked that any return which is not the last statement inside a procedure or function is also an unconditional statement — a goto in disguise. There is an important difference though: a return is a forward only use of goto. Exceptions are also a type of goto statement; and note that they need not specify where they are going to.
Therefore, if you have functions and procedures with more than one return statement you are breaking the structure of the program similarly to a use of goto. In practice, nearly every programmer is familiar with a 'return' statement and its associated behavior; thus, when it comes down to readability the following two samples are almost the same:
Note also that the goto statement in Ada is safer than in other languages, since it doesn't allow you to transfer control:
* outside a body;
* between alternatives of a case statement, if statement, or select statement;
* between different exception handlers; or from an exception handler of a handled_sequence_of_statements back to its sequence_of_statements.
Because the use of a goto needs the declaration of a label, the goto is in fact twice as readable than the use of return. So if readability is your concern and not a strict "don't use goto" programming rule then you should rather use goto than multiple returns. Best, of course, is the structured approach where neither goto nor multiple returns are needed:

## Loops

Loops allow you to have a set of statements repeated over and over again.

### Endless loop

The endless loop is a loop which never ends and the statements inside are repeated forever. The term, endless loop, is a relative term; if the running program is forcibly terminated by some means beyond the control of the program, then an endless loop will indeed end.
The loop name (in this case, "Endless_Loop") is an optional feature of Ada. Naming loops is nice for readability but not strictly needed. Loop names are useful though if the program should jump out of an inner loop, see below.

### Loop with condition at the beginning

This loop has a condition at the beginning. The statements are repeated as long as the condition is met. If the condition is not met at the very beginning then the statements inside the loop are never executed.

### Loop with condition at the end

This loop has a condition at the end and the statements are repeated until the condition is met. Since the check is at the end the statements are at least executed once.

### Loop with condition in the middle

Sometimes you need to first make a calculation and exit the loop when a certain criterion is met. However when the criterion is not met there is something else to be done. Hence you need a loop where the exit condition is in the middle.
In Ada the exit condition can be combined with any other loop statement as well. You can also have more than one exit statement. You can also exit a named outer loop if you have several loops inside each other.

### for loop

Quite often one needs a loop where a specific variable is counted from a given start value up or down to a specific end value. You could use the while loop here — but since this is a very common loop there is an easier syntax available.
You don't have to declare both subtype and range as seen in the example. If you leave out the subtype then the compiler will determine it by context; if you leave out the range then the loop will iterate over every value of the subtype given.
As always with Ada: when "determine by context" gives two or more possible options then an error will be displayed and then you have to name the type to be used. Ada will only do "guess-works" when it is safe to do so.
The loop counter I is a constant implicitly declared and ceases to exist after the body of the loop.

#### for loop on arrays

Another very common situation is the need for a loop which iterates over every element of an array. The following sample code shows you how to achieve this:
With X being an array. Note: This syntax is mostly used on arrays — hence the name — but will also work with other types when a full iteration is needed.

#### Working example

The following example shows how to iterate over every element of an integer type.

## See also
### Wikibook

* Ada Programming

### Ada Reference Manual

* 5.3: If Statements
* 5.4: Case Statements
* 5.5: Loop Statements
* 5.6: Block Statements
* 5.7: Exit Statements
* 5.8: Goto Statements
* 6.5: Return Statements

# Type System

Ada's type system allows the programmer to construct powerful abstractions that represent the real world, and to provide valuable information to the compiler, so that the compiler can find many logic or design errors before they become bugs. It is at the heart of the language, and good Ada programmers learn to use it to great advantage. Four principles govern the type system:
* Type: a way to categorize data. characters are types 'a' through 'z'. Integers are types that include 0,1,2....
* Strong typing: types are incompatible with one another, so it is not possible to mix apples and oranges. The compiler will not guess that your apple is an orange. You must explicitly say my_fruit = fruit(my_apple). Strong typing reduces the amount of errors. This is because developers can really easily write a float into an integer variable without knowing. Now data you needed for your program to succeed has been lost in the conversion when the complier switched types. Ada gets mad and rejects the developer's dumb mistake by refusing to do the conversion unless explicitly told.
* Static typing: type checked while compiling, this allows type errors to be found earlier.
* Abstraction: types represent the real world or the problem at hand; not how the computer represents the data internally. There are ways to specify exactly how a type must be represented at the bit level, but we will defer that discussion to another chapter. An example of an abstraction is your car. You don't really know how it works you just know that bumbling hunk of metal moves. Nearly every technology you work with is abstracted layer to simplify the complex circuits that make it up - the same goes for software. You want abstraction because code in a class makes a lot more sense than a hundred if statements with no explanation when debugging
* Name equivalence: as opposed to structural equivalence used in most other languages. Two types are compatible if and only if they have the same name; not if they just happen to have the same size or bit representation. You can thus declare two integer types with the same ranges that are totally incompatible, or two record types with exactly the same components, but which are incompatible.
Types are incompatible with one another. However, each type can have any number of subtypes, which are compatible with their base type and may be compatible with one another. See below for examples of subtypes which are incompatible with one another.

## Predefined types

There are several predefined types, but most programmers prefer to define their own, application-specific types. Nevertheless, these predefined types are very useful as interfaces between libraries developed independently. The predefined library, obviously, uses these types too.
These types are predefined in the Standard package:

### Integer

    This type covers at least the range $-2^{15}+1$ .. $+2^{15}-1$ (RM 3.5.4: (21)). The Standard also defines Natural and Positive subtypes of this type.

### Float

    There is only a very weak implementation requirement on this type (RM 3.5.7: (14)); most of the time you would define your own floating-point types, and specify your precision and range requirements.

### Duration

    A fixed point type used for timing. It represents a period of time in seconds (RM A.1: (43)).

### Character

    A special form of Enumerations. There are three predefined kinds of character types: 8-bit characters (called Character), 16-bit characters (called Wide_Character), and 32-bit characters (Wide_Wide_Character). Character has been present since the first version of the language (Ada 83), Wide_Character was added in Ada 95, while the type Wide_Wide_Character is available with Ada 2005.

### String

    Three indefinite array types, of Character, Wide_Character, and Wide_Wide_Character respectively. The standard library contains packages for handling strings in three variants: fixed length (Ada.Strings.Fixed), with varying length below a certain upper bound (Ada.Strings.Bounded), and unbounded length (Ada.Strings.Unbounded). Each of these packages has a Wide_ and a Wide_Wide_ variant.

### Boolean

    A Boolean in Ada is an Enumeration of False and True with special semantics.
Packages System and System.Storage_Elements predefine some types which are primarily useful for low-level programming and interfacing to hardware.

### System.Address

    An address in memory.

### System.Storage_Elements.Storage_Offset

    An offset, which can be added to an address to obtain a new address. You can also subtract one address from another to get the offset between them. Together, Address, Storage_Offset and their associated subprograms provide for address arithmetic.

### System.Storage_Elements.Storage_Count

    A subtype of Storage_Offset which cannot be negative, and represents the memory size of a data structure (similar to C's size_t).

### System.Storage_Elements.Storage_Element

    In most computers, this is a byte. Formally, it is the smallest unit of memory that has an address.

### System.Storage_Elements.Storage_Array

    An array of Storage_Elements without any meaning, useful when doing raw memory access.

## The Type Hierarchy

Types are organized hierarchically. A type inherits properties from types above it in the hierarchy. For example, all scalar types (integer, enumeration, modular, fixed-point and floating-point types) have operators "<", ">" and arithmetic operators defined for them, and all discrete types can serve as array indexes.
Here is a broad overview of each category of types; please follow the links for detailed explanations. Inside parenthesis there are equivalences in C and Pascal for readers familiar with those languages.

### Signed Integers (int, INTEGER)

    Signed Integers are defined via the range of values needed.

### Unsigned Integers (unsigned, CARDINAL)

    Unsigned Integers are called Modular Types. Apart from being unsigned they also have wrap-around functionality.

### Enumerations (enum, char, bool, BOOLEAN)

    Ada Enumeration types are a separate type family.

### Floating point (float, double, REAL)

    Floating point types are defined by the digits needed, the relative error bound.

### Ordinary and Decimal Fixed Point (DECIMAL)

    Fixed point types are defined by their delta, the absolute error bound.

### Arrays ( [ ], ARRAY [ ] OF, STRING )

    Arrays with both compile-time and run-time determined size are supported.

### Record (struct, class, RECORD OF)

    A record is a composite type that groups one or more fields.

### Access (*, ^, POINTER TO)

    Ada's Access types may be more than just a simple memory address.

### Task & Protected (similar to multithreading in C++)

    Task and Protected types allow the control of concurrency

### Interfaces (similar to virtual methods in C++)

    New in Ada 2005, these types are similar to the Java interfaces.

### Classification of Types

Ada's types can be classified as follows.
Specific vs. Class-wide
T'Class and T'Class'Class are the same.
Primitive operations with parameters of specific types are non-dispatching, those with parameters of class-wide types are dispatching.
New types can be declared by deriving from specific types; primitive operations are inherited by derivation. You cannot derive from class-wide types.
Constrained vs. Unconstrained
By giving a constraint to an unconstrained subtype, a subtype or object becomes constrained:
Declaring an unconstrained object is only possible if a default value is given in the type declaration above. The language does not specify how such objects are allocated. GNAT allocates the maximum size, so that size changes that might occur with discriminant changes present no problem. Another possibility is implicit dynamic allocation on the heap and re-allocation followed by a deallocation when the size changes.
Definite vs. Indefinite
Definite subtypes allow the declaration of objects without initial value, since objects of definite subtypes have constraints that are known at creation-time. Object declarations of indefinite subtypes need an initial value to supply a constraint; they are then constrained by the constraint delivered by the initial value.
Unconstrained vs. Indefinite
Note that unconstrained subtypes are not necessarily indefinite as can be seen above with RD: it is a definite unconstrained subtype.

## Concurrency Types

The Ada language uses types for one more purpose in addition to classifying data + operations. The type system integrates concurrency (threading, parallelism). Programmers will use types for expressing the concurrent threads of control of their programs.
The core pieces of this part of the type system, the task types and the protected types are explained in greater depth in a section on tasking.

## Limited Types

Limiting a type means disallowing assignment. The “concurrency types” described above are always limited. Programmers can define their own types to be limited, too, like this:
(The ellipsis stands for private, or for a record definition, see the corresponding subsection on this page.) A limited type also doesn't have an equality operator unless the programmer defines one.
You can learn more in the limited types chapter.

## Defining new types and subtypes

You can define a new type with the following syntax:
followed by the description of the type, as explained in detail in each category of type.
Formally, the above declaration creates a type and its first subtype named T. The type itself, correctly called the "type of T", is anonymous; the RM refers to it as T (in italics), but often speaks sloppily about the type T. But this is an academic consideration; for most purposes, it is sufficient to think of T as a type. For scalar types, there is also a base type called T'Base, which encompasses all values of T.
For signed integer types, the type of T comprises the (complete) set of mathematical integers. The base type is a certain hardware type, symmetric around zero (except for possibly one extra negative value), encompassing all values of T.
As explained above, all types are incompatible; thus:
is illegal, because Integer_1 and Integer_2 are different and incompatible types. It is this feature which allows the compiler to detect logic errors at compile time, such as adding a file descriptor to a number of bytes, or a length to a weight. The fact that the two types have the same range does not make them compatible: this is name equivalence in action, as opposed to structural equivalence. (Below, we will see how you can convert between incompatible types; there are strict rules for this.)

### Creating subtypes

You can also create new subtypes of a given type, which will be compatible with each other, like this:
The declaration of Integer_2 is bad because the constraint 7 .. 11 is not compatible with Integer_1; it raises Constraint_Error at subtype elaboration time.
Integer_1 and Integer_3 are compatible because they are both subtypes of the same type, namely Integer_1'Base.
It is not necessary that the subtype ranges overlap, or be included in one another. The compiler inserts a run-time range check when you assign A to B; if the value of A, at that point, happens to be outside the range of Integer_3, the program raises Constraint_Error.
There are a few predefined subtypes which are very useful:

### Derived types

A derived type is a new, full-blown type created from an existing one. Like any other type, it is incompatible with its parent; however, it inherits the primitive operations defined for the parent type.
Here both types are discrete; it is mandatory that the range of the derived type be included in the range of its parent. Contrast this with subtypes. The reason is that the derived type inherits the primitive operations defined for its parent, and these operations assume the range of the parent type. Here is an illustration of this feature:
When we call P (B), the parameter B is converted to Integer_1; this conversion of course passes since the set of acceptable values for the derived type (here, 8 .. 10) must be included in that of the parent type (1 .. 10). Then P is called with the converted parameter.
Consider however a variant of the example above:
When P (B, Y) is called, both parameters are converted to Integer_1. Thus the range check on J (7) in the body of P will pass. However on return parameter Y is converted back to Integer_2 and the range check on Y will of course fail.
With the above in mind, you will see why in the following program Constraint_Error will be called at run time, before P is even called.

## Subtype categories

Ada supports various categories of subtypes which have different abilities. Here is an overview in alphabetical order.

### Anonymous subtype

A subtype which does not have a name assigned to it. Such a subtype is created with a variable declaration:
Here, (1 .. 10) is the constraint. This variable declaration is equivalent to:

### Base type

In Ada, all types are anonymous and only subtypes may be named. For scalar types, there is a special subtype of the anonymous type, called the base type, which is nameable with Subtype'Base notation. This Name'Attribute (read "name tick attribute") is the special notation used in Ada for what is called an attribute, i.e. a characteristic of a type, a variable, or some other program entity, that is defined by the compiler and can be queried. In this case, the base type (Subtype'Base) comprises all values of the first subtype. Some examples:
The base type Int'Base is a hardware type selected by the compiler that comprises the values of Int. Thus, it may have the range -2$^7$ .. 2$^7$-1 or -2$^{15}$ .. 2$^{15}$-1 or any other such type.
Enum'Base is the same as Enum, but Short'Base also holds the literal D.

### Constrained subtype

A subtype of an indefinite subtype that adds constraints. The following example defines a 10 character string sub-type.
You cannot partially constrain an unconstrained subtype:
Constraints for all indices must be given, the result is necessarily a definite subtype.

### Definite subtype

A definite subtype is a subtype whose size is known at compile-time. All subtypes which are not indefinite subtypes are, by definition, definite subtypes.
Objects of definite subtypes may be declared without additional constraints.

### Indefinite subtype

An indefinite subtype is a subtype whose size is not known at compile-time but is dynamically calculated at run-time. An indefinite subtype does not by itself provide enough information to create an object; an additional constraint or explicit initialization expression is necessary in order to calculate the actual size and therefore create the object.
X is an object of the indefinite (sub)type String. Its constraint is derived implicitly from its initial value. X may change its value, but not its bounds.
It should be noted that it is not necessary to initialize the object from a literal. You can also use a function. For example:
This statement reads the first command-line argument and assigns it to X.
A subtype of an indefinite subtype that does not add a constraint only introduces a new name for the original subtype (a kind of renaming under a different notion).
My_String and String are interchangeable.

### Named subtype

A subtype which has a name assigned to it. “First subtypes” are created with the keyword type (remember that types are always anonymous, the name in a type declaration is the name of the first subtype), others with the keyword subtype. For example:
Count_to_Ten is the first subtype of a suitable integer base type. However, if you would like to use this as an index constraint on String, the following declaration is illegal:
This is because String has Positive as its index, which is a subtype of Integer (these declarations are taken from package Standard):
So you have to use the following declarations:
Now Ten_Characters is the name of that subtype of String which is constrained to Count_To_Ten. You see that posing constraints on types versus subtypes has very different effects.

### Unconstrained subtype

Any indefinite type is also an unconstrained subtype. However, unconstrainedness and indefiniteness are not the same.
This type is unconstrained and indefinite because you need to give an actual discriminant for object declarations; the object is constrained to this discriminant which may not change.
When however a default is provided for the discriminant, the type is definite yet unconstrained; it allows to define both, constrained and unconstrained objects:
Here, My_Object_U is unconstrained; upon declaration, it has the discriminant A (the default) which however may change.

### Incompatible subtypes

These subtypes are of course incompatible.
Another example are subtypes of a discriminated record:
Also these subtypes are incompatible.

## Qualified expressions

In most cases, the compiler is able to infer the type of an expression; for example:
Here the compiler knows that A is a value of the type Enum. But consider:
The compiler cannot choose between the two versions of P; both would be equally valid. To remove the ambiguity, you use a qualified expression:
As seen in the following example, this syntax is often used when creating new objects. If you try to compile the example, it will fail with a compilation error since the compiler will determine that 256 is not in range of Byte.
You should use qualified expression when getting a string literal's length.

## Type conversions

Data do not always come in the format you need them. You must, then, face the task of converting them. As a true multi-purpose language with a special emphasis on "mission critical", "system programming" and "safety", Ada has several conversion techniques. The most difficult part is choosing the right one, so the following list is sorted in order of utility. You should try the first one first; the last technique is a last resort, to be used if all others fail. There are also a few related techniques that you might choose instead of actually converting the data.
Since the most important aspect is not the result of a successful conversion, but how the system will react to an invalid conversion, all examples also demonstrate faulty conversions.

### Explicit type conversion

An explicit type conversion looks much like a function call; it does not use the tick (apostrophe, ') like the qualified expression does.
The compiler first checks that the conversion is legal, and if it is, it inserts a run-time check at the point of the conversion; hence the name checked conversion. If the conversion fails, the program raises Constraint_Error. Most compilers are very smart and optimise away the constraint checks; so, you need not worry about any performance penalty. Some compilers can also warn that a constraint check will always fail (and optimise the check with an unconditional raise).
Explicit type conversions are legal:
* between any two numeric types
* between any two subtypes of the same type
* between any two types derived from the same type (note special rules for tagged types)
* between array types under certain conditions (see RM 4.6(24.2/2..24.7/2))
* and nowhere else
(The rules become more complex with class-wide and anonymous access types.)
This example illustrates explicit type conversions:
Explicit conversions are possible between any two numeric types: integers, fixed-point and floating-point types. If one of the types involved is a fixed-point or floating-point type, the compiler not only checks for the range constraints (thus the code above will raise Constraint_Error), but also performs any loss of precision necessary.
Example 1: the loss of precision causes the procedure to only ever print "0" or "1", since P / 100 is an integer and is always zero or one.
Example 2: we use an intermediate floating-point type to guarantee the precision.
You might ask why you should convert between two subtypes of the same type. An example will illustrate this.
Here, Slice has bounds 1 and 10, whereas X (11 .. 20) has bounds 11 and 20.

### Change of Representation

Type conversions can be used for packing and unpacking of records or arrays.

### Checked conversion for non-numeric types

The examples above all revolved around conversions between numeric types; it is possible to convert between any two numeric types in this way. But what happens between non-numeric types, e.g. between array types or record types? The answer is two-fold:
* you can convert explicitly between a type and types derived from it, or between types derived from the same type,
* and that's all. No other conversions are possible.
Why would you want to derive a record type from another record type? Because of representation clauses. Here we enter the realm of low-level systems programming, which is not for the faint of heart, nor is it useful for desktop applications. So hold on tight, and let's dive in.
Suppose you have a record type which uses the default, efficient representation. Now you want to write this record to a device, which uses a special record format. This special representation is more compact (uses fewer bits), but is grossly inefficient. You want to have a layered programming interface: the upper layer, intended for applications, uses the efficient representation. The lower layer is a device driver that accesses the hardware directly and uses the inefficient representation.
The compiler chooses a default, efficient representation for Register. For example, on a 32-bit machine, it would probably use three 32-bit words, one for A, one for B and one for Size. This efficient representation is good for applications, but at one point we want to convert the entire record to just 8 bits, because that's what our hardware requires.
In the above example, the package body declares a derived type with the inefficient, but compact representation, and converts to and from it.
This illustrates that type conversions can result in a change of representation.

### View conversion, in object-oriented programming

Within object-oriented programming you have to distinguish between specific types and class-wide types.
With specific types, only conversions in the direction to the root are possible, which of course cannot fail. There are no conversions in the opposite direction (where would you get the further components from?); extension aggregates have to be used instead.
With the conversion itself, no components of the source object that are not present in the target object are lost, they are just hidden from visibility. Therefore, this kind of conversion is called a view conversion since it provides a view of the source object as an object of the target type (especially it does not change the object's tag).
It is a common idiom in object oriented programming to rename the result of a view conversion. (A renaming declaration does not create a new object; it only gives a new name to something that already exists.)
Parent_View is not a new object, but another name for Child_Instance viewed as the parent, i.e. only the parent components are visible, the child-specific components are hidden. Parent_Part, however, is an object of the parent type, which of course has no storage for the child-specific components, so they are lost with the assignment.
All types derived from a tagged type T form a tree rooted at T. The class-wide type T'Class can hold any object within this tree. With class-wide types, conversions in any direction are possible; there is a run-time tag check that raises Constraint_Error if the check fails. These conversions are also view conversions, no data is created or lost.
Object_1 is a new object, a copy; Object_2 is just a new name. Both objects are of the class-wide type. Conversions to any type within the given class are legal, but are tag-checked.
The first conversion passes the tag check and both objects Child_Instance and Success are equal. The second conversion fails the tag check. (Conversion assignments of this kind will rarely be used; dispatching will do this automatically, see object oriented programming.)
You can perform these checks yourself with membership tests:
There is also the package Ada.Tags.

### Address conversion

Ada's access type is not just a memory location (a thin pointer). Depending on implementation and the access type used, the access might keep additional information (a fat pointer). For example GNAT keeps two memory addresses for each access to an indefinite object — one for the data and one for the constraint informations ('Size, 'First, 'Last).
If you want to convert an access to a simple memory location you can use the package System.Address_To_Access_Conversions. Note however that an address and a fat pointer cannot be converted reversibly into one another.
The address of an array object is the address of its first component. Thus, the bounds get lost in such a conversion.

### Unchecked conversion

One of the great criticisms of Pascal was "there is no escape". The reason was that sometimes you have to convert the incompatible. For this purpose, Ada has the generic function Unchecked_Conversion:
Unchecked_Conversion will bit-copy the source data and reinterpret them under the target type without any checks. It is your chore to make sure that the requirements on unchecked conversion as stated in RM 13.9 (Annotated) are fulfilled; if not, the result is implementation dependent and may even lead to abnormal data. Use the 'Valid attribute after the conversion to check the validity of the data in problematic cases.
A function call to (an instance of) Unchecked_Conversion will copy the source to the destination. The compiler may also do a conversion in place (every instance has the convention Intrinsic).
To use Unchecked_Conversion you need to instantiate the generic.
In the example below, you can see how this is done. When run, the example will output A = -1, B = 255. No error will be reported, but is this the result you expect?
There is of course a range check in the assignment B := Convert (A);. Thus if B were defined as B: Byte range 0 .. 10;, Constraint_Error would be raised.

### Overlays

If the copying of the result of Unchecked_Conversion is too much waste in terms of performance, then you can try overlays, i.e. address mappings. By using overlays, both objects share the same memory location. If you assign a value to one, the other changes as well. The syntax is:
where expression defines the address of the source object.
While overlays might look more elegant than Unchecked_Conversion, you should be aware that they are even more dangerous and have even greater potential for doing something very wrong. For example if Source'Size < Target'Size and you assign a value to Target, you might inadvertently write into memory allocated to a different object.
You have to take care also of implicit initializations of objects of the target type, since they would overwrite the actual value of the source object. The Import pragma with convention Ada can be used to prevent this, since it avoids the implicit initialization, RM B.1 (Annotated).
The example below does the same as the example from "Unchecked Conversion".

### Export / Import

Just for the record: There is still another method using the Export and Import pragmas. However, since this method completely undermines Ada's visibility and type concepts even more than overlays, it has no place here in this language introduction and is left to experts.

## Elaborated Discussion of Types for Signed Integer Types

As explained before, a type declaration
declares an anonymous type T and its first subtype T (please note the italicization). T encompasses the complete set of mathematical integers. Static expressions and named numbers make use of this fact.
All numeric integer literals are of type Universal_Integer. They are converted to the appropriate specific type where needed. Universal_Integer itself has no operators.
Some examples with static named numbers:
Static expressions are evaluated at compile-time on the appropriate types with no overflow checks, i.e. mathematically exact (only limited by computer store). The result is then implicitly converted to Universal_Integer.
The literal 1 in S2 is of type Universal_Integer and implicitly converted to Long_Integer.
S3 implicitly converts the summands to root_integer, performs the calculation and converts back to Universal_Integer.
S4 is illegal because it mixes two different types. You can however write this as
where the Pos attributes convert the values to Universal_Integer, which are then further implicitly converted to root_integer, added and the result converted back to Universal_Integer.
root_integer is the anonymous greatest integer type representable by the hardware. It has the range System.Min_Integer .. System.Max_Integer. All integer types are rooted at root_integer, i.e. derived from it. Universal_Integer can be viewed as root_integer'Class.
During run-time, computations of course are performed with range checks and overflow checks on the appropriate subtype. Intermediate results may however exceed the range limits. Thus with I, J, K of the subtype T above, the following code will return the correct result:
Real literals are of type Universal_Real, and similar rules as the ones above apply accordingly.

## Relations between types

Types can be made from other types. Array types, for example, are made from two types, one for the arrays' index and one for the arrays' components. An array, then, expresses an association, namely that between one value of the index type and a value of the component type.
The type Color is the index type and the type Intensity is the component type of the array type Colored_Point. See array.

## See also
### Wikibook

* Ada Programming

### Ada Reference Manual

* 3.2.1: Type Declarations
* 3.3: Objects and Named Numbers
* 3.7: Discriminants
* 3.10: Access Types
* 4.9: Static Expressions and Static Subtypes
* 13.9: Unchecked Type Conversions
* 13.3: Operational and Representation Attributes
* Annex K: (informative) Language-Defined Attributes

# Integer types

A range is a signed integer value which ranges from a First to a last Last. It is defined as
When a value is assigned to an object with such a range constraint, the value is checked for validity and Constraint_Error exception is raised when the value is not within First to Last.
When declaring a range type, the corresponding mathematical operators are implicitly declared by the language at the same place.
The compiler is free to choose a suitable underlaying hardware type for this user defined type.

## Working example

The following example defines a new range from -5 to 10 and then prints the whole range out.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Keywords/range

### Ada Reference Manual

* 4.4 Expressions (Annotated)
* 3.5.4 Integer Types (Annotated)

# Unsigned integer types
## Description

Unsigned integers in Ada have a value range from 0 to some positive number (not necessarily 1 subtracted from some power of 2). They are defined using the mod keyword because they implement a wrap-around arithmetic.
where 'First is 0 and 'Last is Modulus - 1.
Wrap-around arithmetic means that 'Last + 1 = 0 = 'First, and 'First - 1 = 'Last. Additionally to the normal arithmetic operators, bitwise and, or and xor are defined for the type (see below).
The predefined package Interfaces (RM B.2) presents unsigned integers based on powers of 2
for which also shift and rotate operations are defined. The values of n depend on compiler and target architecture.
You can use range to sub-range a modular type:
But beware: the Modulus of Half_Byte is still 256! Arithmetic with such a type is interesting to say the least.

## Bitwise Operations

Be very careful with bitwise operators and, or, xor, not, when the modulus is not a power of two. An example might exemplify the problem.
The other operators work similarly.
Now take a modulus that is not a power of two. Naive expectations about the results may lead out of the value range. As an example take again the not operator (see the RM for the others):
The definition of not is therefore:

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Keywords/mod

### Ada Reference Manual

* 4.4: Expressions
* 3.5.4: Integer Types

# Enumerations

An enumeration type is defined as a list of possible values:
Like for numeric types, where e.g. 1 is an integer literal, Red, Green and Blue are called the literals of this type. There are no other values assignable to objects of this type.

## Operators and attributes

Apart from equality ("="), the only operators on enumeration types are the ordering operators: "<", "<=", "=", "/=", ">=", ">", where the order relation is given implicitly by the sequence of literals: Each literal has a position, starting with 0 for the first, incremented by one for each successor. This position can be queried via the 'Pos attribute; the inverse is 'Val, which returns the corresponding literal. In our example:
There are two other important attributes: Image and Value (don't confuse Val with Value). Image returns the string representation of the value (in capital letters), Value is the inverse:
These attributes are important for simple IO (there are more elaborate IO facilities in Ada.Text_IO for enumeration types). Note that, since Ada is case-insensitive, the string given to 'Value can be in any case.

## Enumeration literals

Literals are overloadable, i.e. you can have another type with the same literals.
Overload resolution within the context of use of a literal normally resolves which Red is meant. Only if you have an unresolvable overloading conflict, you can qualify with special syntax which Red is meant:
Like many other declarative items, enumeration literals can be renamed. In fact, such a literal is actually a function, so it has to be renamed as such:
Here, Primary_Color is assumed to be defined in package P, which is visible at the place of the renaming declaration. Renaming makes Red directly visible without necessity to resort the use-clause.
Note that redeclaration as a function does not affect the staticness of the literal.

### Characters as enumeration literals

Rather unique to Ada is the use of character literals as enumeration literals:
This literal 'A' has nothing in common with the literal 'A' of the predefined type Character (or Wide_Character).
Every type that has at least one character literal is a character type. For every character type, string literals and the concatenation operator "&" are also implicitly defined.
In this example, S and T have the same value.
Ada's Character type is defined that way. See Ada Programming/Libraries/Standard.

### Booleans as enumeration literals

Also Booleans are defined as enumeration types:
There is special semantics implied with this declaration in that objects and expressions of this type can be used as conditions. Note that the literals False and True are not Ada keywords.
Thus it is not sufficient to declare a type with these literals and then hope objects of this type can be used like so:
If you need your own Booleans (perhaps with special size requirements), you have to derive from the predefined Boolean:

## Enumeration subtypes

You can use range to subtype an enumeration type:

## Using enumerations

Enumeration types being scalar subtypes, type attributes such as First and Succ will allow stepping through a subsequence of the values.
A loop will automatically step through the values of the subtype's range. Filtering week days to include only working days with an even position number:
Enumeration types can be used as array index subtypes, yielding a table feature:

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Libraries/Standard
* Ada_Programming/Attributes/'First
* Ada_Programming/Attributes/'Last
* Ada_Programming/Attributes/'Pred
* Ada_Programming/Attributes/'Succ
* Ada_Programming/Attributes/'Img
* Ada_Programming/Attributes/'Image
* Ada_Programming/Attributes/'Value
* Ada_Programming/Attributes/'Pos
* Ada_Programming/Attributes/'Val
* Ada_Programming/Attributes/'Enum_Rep
* Ada_Programming/Attributes/'Enum_Val

### Ada Reference Manual

* 3.5.1 Enumeration Types (Annotated)

# Floating point types
## Description

To define a floating point type, you only have to say how many digits are needed, i.e. you define the relative precision:
If you like, you can declare the minimum range needed as well:
This facility is a great benefit of Ada over (most) other programming languages. In other languages, you just choose between "float" and "long float", and what most people do is:
* choose float if they don't care about accuracy
* otherwise, choose long float, because it is the best you can get
In either case, you don't know what accuracy you get.
In Ada, you specify the accuracy you need, and the compiler will choose an appropriate floating point type with at least the accuracy you asked for. This way, your requirement is guaranteed. Moreover, if the computer has more than two floating point types available, the compiler can make use of all of them.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Types/range
* Ada Programming/Types/delta
* Ada Programming/Types/mod
* Ada Programming/Keywords/digits

### Ada Reference Manual

* 3.5.7 Floating Point Types (Annotated)

# Fixed point types
## Description

A fixed point type defines a set of values that are evenly spaced with a given absolute precision. In contrast, floating point values are all spaced according to a relative precision.
The absolute precision is given as the delta of the type. There are two kinds of fixed point types, ordinary and decimal.
For Ordinary Fixed Point types, the delta gives a hint to the compiler how to choose the small value if it is not specified: It can be any integer power of two not greater than delta. You may specify the small via an attribute clause to be any value not greater than delta. (If the compiler cannot conform to this small value, it has to reject the declaration.)
For Decimal Fixed Point types, the small is defined to be the delta, which in turn must be an integer power of ten. (Thus you cannot specify the small by an attribute clause.)
For example, if you define a decimal fixed point type with a delta of 0.1, you will be able to accurately store the values 0.1, 1.0, 2.2, 5.7, etc. You will not be able to accurately store the value 0.01. Instead, the value will be rounded down to 0.0.
If the compiler accepts your fixed point type definition, it guarantees that values represented by that type will have at least the degree of accuracy specified (or better). If the compiler cannot support the type definition (e.g. due to limited hardware) then a compile-time error will result.

## Ordinary Fixed Point

For an ordinary fixed point, you just define the delta and a range:
The delta can be any real value — for example you may define a circle with one arcsecond resolution with:
[There is one rather strange rule about fixed point types: Because of the way they are internally represented, the range might only go up to 'Last - Delta. This is a bit like a circle — the 0° and 360° mark is also the same.]
It should be noted that in the example above the smallest possible value used is not ${\frac {1}{60^{2}}}={\frac {1}{3600}}$. The compiler will choose a smaller value which, by default, is an integer power of 2 not greater than the delta. In our example this could be $2^{-12}={\frac {1}{4096}}$. In most cases this should render better performance but sacrifices precision for it.
If this is not what you wish and precision is indeed more important, you can choose your own small value via the attribute clause 'Small.
As internal representation, you will get a 32 bit signed integer type.

## Decimal Fixed Point

You define a decimal fixed point by defining the delta and the number of digits needed:
Delta must be a positive or negative integer power of 10 — otherwise the declaration is illegal.
If you like, you can also define the range needed:

## Differences between Ordinary and Decimal Fixed Point Types

There is an alternative way of declaring a "decimal" fixed point: You declare an ordinary fixed point and use an integer power of 10 as 'Small. The following two declarations are equivalent with respect to the internal representation:
You might wonder what the difference then is between these two declarations. The answer is:
None with respect to precision, addition, subtraction, multiplication with integer values.
The following is an incomplete list of differences between ordinary and decimal fixed point types.
* Decimal fixed point types are intended to reflect typical COBOL declarations with a given number of digits.
* Truncation is required for decimal, not for ordinary, fixed point in multiplication and division (RM 4.5.5: (21)) and type conversions. Operations on decimal fixed point are fully specified, which is not true for ordinary fixed point.
* The following attributes are only defined for decimal fixed point: T'Digits (RM 3.5.10: (10)) corresponds to the number of decimal digits that are representable; T'Scale (RM 3.5.10: (11), taken from COBOL) indicates the position of the point relative to the rightmost significant digits; T'Round (RM 3.5.10: (12)) can be used to specify rounding on conversion.
* Package Decimal (RM F.2), which of course applies only to decimal fixed point, defines the decimal Divide generic procedure. If annex F is supported (GNAT does), at least 18 digits must be supported (there is no such rule for fixed point).
* Decimal_IO (RM A.10.1: (73)) has semantics different from Fixed_IO (RM A.10.1: (68)).
* Static expressions must be a multiple of the Small for decimal fixed point.
Conclusion: For normal numeric use, an ordinary fixed point (probably with 'Small defined) should be defined. Only if you are interested in COBOL like use, i.e. well defined deterministic decimal semantics (especially for financial computations, but that might apply to cases other than money) should you take decimal fixed point.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Types/range
* Ada Programming/Types/digits
* Ada Programming/Types/mod
* Ada Programming/Keywords/delta
* Ada Programming/Attributes/'Small

### Ada 95 Reference Manual

* 3.5.9: Fixed Point Types

### Ada 2005 Reference Manual

* 3.5.9: Fixed Point Types

# Arrays

An array is a collection of elements which can be accessed by one or more index values. In Ada any definite type is allowed as element and any discrete type, i.e. Range, Modular or Enumeration, can be used as an index.

## Declaring arrays

Ada's arrays are quite powerful and so there are quite a few syntax variations, which are presented below.

### Basic syntax

The basic form of an Ada array is:
where Index_Range is a range of values within a discrete index type, and Element_Type is a definite subtype. The array consists of one element of "Element_Type" for each possible value in the given range. If you for example want to count how often a specific letter appears inside a text, you could use:
Very often, the index does not have semantic contents by itself, it is just used a means to identify elements for instance in a list. Thus, as a general advice, do not use negative indices in these cases. It is also a good style when using numeric indices, to define them starting in 1 instead of 0, since it is more intuitive for humans and avoids off-by-one errors.
There are, however, cases, where negative indices make sense. So use indices adapted to the problem at hand. Imagine you are a chemist doing some experiments depending on the temperature:

### With known subrange

Often you don't need an array of all possible values of the index type. In this case you can subtype your index type to the actually needed range.
Since this may involve a lot of typing and you may also run out of useful names for new subtypes, the array declaration allows for a shortcut:
Since First and Last are expressions of Index_Type, a simpler form of the above is:
Note that if First and Last are numeric literals, this implies the index type Integer.
If in the example above the character counter should only count upper case characters and discard all other characters, you can use the following array type:

### With unknown subrange

Sometimes the range actually needed is not known until runtime or you need objects of different lengths. In some languages you would resort to pointers to element types. Not with Ada. Here we have the box '<>', which allows us to declare indefinite arrays:
When you declare objects of such a type, the bounds must of course be given and the object is constrained to them.
The predefined type String is such a type. It is defined as
You define objects of such an unconstrained type in several ways (the extrapolation to other arrays than String should be obvious):
(These declarations additionally define anonymous subtypes of String.) In the first example, the range of indices is explicitly given. In the second example, the range is implicitly defined from the initial expression, which here could be via a function reading data from some file. Both objects are constrained to their ranges, i.e. they cannot grow nor shrink.

### With aliased elements

If you come from C/C++, you are probably used to the fact that every element of an array has an address. The C/C++ standards actually demand that.
In Ada, this is not true. Consider the following array:
Since we have packed the array, the compiler will use as little storage as possible. And in most cases this will mean that 8 boolean values will fit into one byte.
So Ada knows about arrays where more than one element shares one address. So what if you need to address each single element. Just not using pragma Pack is not enough. If the CPU has very fast bit access, the compiler might pack the array without being told. You need to tell the compiler that you need to address each element via an access.

### Arrays with more than one dimension

Arrays can have more than one index. Consider the following 2-dimensional array:
This type permits declaring rectangular arrays of characters. Example:
Or, stating some index values explicitly,
The index values of the second dimension, those indexing the characters in each row, are in 1 .. 5 here. By choosing a different second range, we could change these to be in 11 .. 15:
By adding more dimensions to an array type, we could have squares, cubes (or « bricks »), etc., of homogenous data items.
Finally, an array of characters is a string (see Ada Programming/Strings). Therefore, Magic_Square may simply be declared like this:

## Using arrays
### Assignment

When accessing elements, the index is specified in parentheses. It is also possible to access slices in this way:
Note that the index range slides in this example: After the assignment, Vector_A (1) = Vector_B (3) and similarly for the other indices.
Also note that slice assignments are done in one go, not in a loop character by character, so that assignments with overlapping ranges work as expected:
The result is "Lady Lady Ada" (and not "Lady Lady Lad").

### Slicing

As has been shown above, in slice assignments index ranges slide. Also subtype conversions make index ranges slide:
The result of Str_1_8 (Name (6 .. 13)) has the new bounds 1 and 8 and contents "Lady Ada" and is not a copy. This is the best way to change the bounds of an array or of parts thereof.

### Concatenate

The operator "&" can be used to concatenate arrays:
In both cases, if the resulting array does not fit in the destination array, Constraint_Error is raised.
If you try to access an existing element by indexing outside the array bounds, Constraint_Error is raised (unless checks are suppressed).

### Array Attributes

There are four Attributes which are important for arrays: 'First, 'Last, 'Length and 'Range. Lets look at them with an example. Say we have the following three strings:
Then the four attributes will have the following values:
| Array | 'First | 'Last | 'Length | 'Range |
| Hello_World | 1 | 12 | 12 | 1 .. 12 |
| World | 7 | 11 | 5 | 7 .. 11 |
| Empty_String | 1 | 0 | 0 | 1 .. 0 |
The example was chosen to show a few common beginner's mistakes:
* The assumption that strings begin with the index value 1 is wrong (cf. World'First = 7 on the second line).
* The assumption (which follows from the first one) that X'Length = X'Last is wrong.
* The assumption that X'Last >= X'First; this is not true for empty strings.
The index subtype of predefined type String is Positive, therefore excluding 0 or -17 etc. from the set of possible index values, by subtype constraint (of Positive). Also, 'A' or 2.17e+4 are excluded, since they are not of type Positive.
The attribute 'Range is a little special as it does not return a discrete value but an abstract description of the array. One might wonder what it is good for. The most common use is in the for loop on arrays. When looping over all elements of an array, you need not know the actual index range; by using the attribute, one of the most frequent errors, accessing elements out of the index range, can never occur:
'Range can also be used in declaring a name for the index subtype:
The Range attribute can be convenient when programming index checks:

### Empty or Null Arrays

As you have seen in the section above, Ada allows for empty arrays. Any array whose last index value is lower than the first index value is empty. And — of course — you can have empty arrays of all sorts, not just String:
Note: If you give an initial expression to an empty array (which is a must for a constant), the expression in the aggregate will of course not be evaluated since there are no elements actually stored.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Data Structures
* Data Structures/Arrays

### Ada 95 Reference Manual

* 3.6: Array Types

### Ada 2005 Reference Manual

* 3.6: Array Types

### Ada Quality and Style Guide

* 10.5.7 Packed Boolean Array Shifts

# Records

A record is a composite type that groups one or more fields. A field can be of any type, even a record.

## Null record

The null record is when a type without data is needed. There are two ways to declare a null record:
For the compiler they are the same. However, programmers often use the first variant if the type is not finished yet to show that they are planning to expand the type later, or they usually use the second if the (tagged) record is a base class in object oriented programming.

## Record Values

Values of a record type can be specified using a record aggregate, giving a list of named components thus
Given a somewhat larger record type,
a value may be specified using positional notation, that is, specifying a value for each record component in declaration order
However, naming the components of a Car aggregate offers a number of advantages.
* Easy identification of which value is used for which component. (After all, named components are the raison d'être of records.)
* Reordering the components is allowed—you only have to remember the component names, not their position.
* Improved compiler diagnostic messages.
Reordering components is possible because component names will inform the compiler (and the human reader!) of the intended value associations. Improved compiler messages are also in consequence of this additional information passed to the compiler. While an omitted component will always be reported due to Ada's coverage rules, messages can be much more specific when there are named associations. Considering the Car type from above, suppose a programmer by mistake specifies only one of the two floating point values for BMW in positional notation. The compiler, in search of another component value, will then not be able to decide whether the specified value is intended for Horse_Power_kW or for Consumption. If the programmer instead uses named association, say Horse_Power_kW => 190.0, it will be clear which other component is missing.
In order to access a component of a record instance, use the dot delimiter (.), as in BMW.Number_Wheels.

## Variant record

The variant record is a special type of discriminated record where the presence of some components depend on the value of the discriminant.

### Mutable and immutable variant records

You can declare variant record types such that its discriminant, and thus its variant structure, can be changed during the lifetime of the variable. Such a record is said to be mutable. When "mutating" a record, you must assign all components of the variant structure which you are mutating at once, replacing the record with a complete variant structure. Although a variant record declaration may allow objects of its type to be mutable, there are certain restrictions on whether the objects will be mutable. Reasons restricting an object from being mutable include:
* the object is declared with a discriminant (see Immutable_Traffic_Light below)
* the object is aliased (either by use of aliased in the object declaration, or by allocation on the heap using new)
Conversely, you can declare record types so that the discriminant along with the structure of the variant record may not be changed. To make a record type declaration immutable, the discriminant must not have a default value.

## Union

This language feature is only available from Ada 2005 on.
The difference to a variant record is such that Option is not actually stored inside the record and never checked for correctness - it's just a dummy.
This kind of record is usually used for interfacing with C but can be used for other purposes as well (then without pragma Convention (C, Union);).

## Tagged record

The tagged record is one part of what in other languages is called a class. It is the basic foundation of object orientated programming in Ada. The other two parts a class in Ada needs is a package and primitive operations.
Ada 2005 only:

## Abstract tagged record

An abstract type has at least one abstract primitive operation, i.e. one of its operations is not defined and implementation must be provided by derivatives of the abstract type.

## With aliased elements

If you come from C/C++, you are probably used to the fact that every element of a record - which is not part of a bitset - has an address. In Ada, this is not true because records, just like arrays, can be packed. And just like arrays you can use aliased to ensure that an element can be accessed via an access type.
Please note: each element needs its own aliased.

## Limited Records

In addition to being variant, tagged, and abstract, records may also be limited (no assignment, and no predefined equality operation for Limited Types). In object oriented programming, when tagged objects are handled by references instead of copying them, this blends well with making objects limited.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types
* Ada Programming/Keywords/record
* Ada Programming/Keywords/null
* Ada Programming/Keywords/abstract
* Ada Programming/Keywords/case
* Ada Programming/Keywords/when
* Ada Programming/Pragmas/Unchecked Union

### Ada Reference Manual
#### Ada 95

* 3.8: Record Types

#### Ada 2005

* 3.8: Record Types
* B.3.3: Pragma Unchecked_Union

#### Ada Issues

* AI95-00216-01 Unchecked unions — variant records with no run-time discriminant

# Access types
## What's an Access Type?

Access types in Ada are what other languages call pointers. They point to objects located at certain addresses. So normally one can think of access types as simple addresses (there are exceptions from this simplified view). Ada instead of saying points to talks of granting access to or designating an object.
Objects of access types are implicitly initialized with null, i.e. they point to nothing when not explicitly initialized.
Access types should be used rarely in Ada. In a lot of circumstances where pointers are used in other languages, there are other ways without pointers. If you need dynamic data structures, first check whether you can use the Ada Container library. Especially for indefinite record or array components, the Ada 2012 package Ada.Containers.Indefinite_Holders (RM A.18.18) can be used instead of pointers.
There are four kinds of access types in Ada: Pool access types - General access types - Anonymous access types - Access to subprogram types.

## Pool access

A pool access type handles accesses to objects which were created on some specific heap (or storage pool as it is called in Ada). A pointer of these types cannot point to a stack or library level (static) object or an object in a different storage pool. Therefore, conversion between pool access types is illegal. (Unchecked_Conversion may be used, but note that deallocation via an access object with a storage pool different from the one it was allocated with is erroneous.)
A storage size clause may be used to limit the corresponding (implementation defined anonymous) storage pool. A storage size clause of 0 disables calls of an allocator.
The storage pool is implementation defined if not specified. Ada supports user defined storage pools, so you can define the storage pool with
Objects in a storage pool are created with the keyword new:
You access the object in the storage pool by appending .all. Mother.all is the complete record; components are denoted as usual with the dot notation: Mother.all.First_Name. When accessing components, implicit dereferencing (i.e. omitting all) can serve as a convenient shorthand:
Implicit dereferencing also applies to arrays:
Be careful to discriminate between deep and shallow copies when copying with access objects:

### Deleting objects from a storage pool

Although the Ada standard mentions a garbage collector, which would automatically remove all unneeded objects that have been created on the heap (when no storage pool has been defined), only Ada compilers targeting a virtual machine like Java or .NET actually have garbage collectors.
When an access type goes out of scope, the corresponding still allocated data items are finalized (i.e. they do no longer exist) in an arbitrary order; the allocated memory, however, is only freed when the attribute Storage_Size has been defined for the access type via an attribute_definition clause. (Note: Finalization and deallocation are different things!)

#### Proof

The following are excerpts from the Ada Reference Manual. The ellipses stand for parts not relevant for the case.
RM 3.10(7/1) There are ... access-to-object types, whose values designate objects... Associated with an access-to-object type is a storage pool; several access types may 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.
(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...
RM 7.6(1) ... Every object is 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)...
RM 7.6.1(5) For the finalization of an object:
(6/3) If the full type of the object is an elementary type, finalization has no effect;
(7/3) 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;
(10) Immediately before an instance of Unchecked_Deallocation reclaims the storage of an object, the object is finalized. If an instance of Unchecked_Deallocation is never applied to an object created by an allocator, the object will still exist when the corresponding master completes, and it will be finalized then.
(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. Finalization of a collection consists of finalization of each object in the collection, in an arbitrary order…
RM 13.11(1) Each access-to-object type has an associated storage pool. The storage allocated by an allocator comes from the pool; instances of Unchecked_Deallocation return storage to the pool. Several access types 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 access-to-object type…
(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.
(15) Storage_Size or Storage_Pool may be specified for a nonderived access-to-object type via an attribute_definition_clause...
(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...
(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...

#### Example

The following program will compile but will fail the accessibility check on runtime with an exception.
There is also a pragma Controlled, which, when applied to such an access type, prevents automatic garbage collection of objects created with it. Note that pragma Controlled was dropped from Ada 2012, subpools for storage management replacing it. See RM 2012 13.11.3 and 13.11.4.
Therefore, in order to delete an object from the heap, you need the generic unit Ada.Unchecked_Deallocation. Apply utmost care to not create dangling pointers when deallocating objects as is shown in the example below. (And note that deallocating objects with a different access type than the one with which they were created is erroneous when the corresponding storage pools are different.)
It is exactly because of this problem with dangling pointers that the deallocation operation is called unchecked. It is the chore of the programmer to take care that this does not happen.
Since Ada allows for user-defined storage pools, you could also try a garbage collector library.

### Constructing Reference Counting Pointers

You can find some implementations of reference counting pointers, called Safe or Smart Pointers, on the net. Using such a type prevents caring about deallocation, since this will automatically be done when there are no more pointers to an object. But be careful - most of those implementations do not prevent deliberate deallocation, thus undermining the alleged safety attained with their use.
A nice tutorial how to construct such a type can be found in a series of Gems on the AdaCore web site.
Gem #97: Reference Counting in Ada – Part 1 This little gem constructs a simple reference counted pointer that does not prevent deallocation, i.e. is inherently unsafe.
Gem #107: Preventing Deallocation for Reference-counted Types This further gem describes how to arrive at a pointer type whose safety cannot be compromised (tasking issues aside). The cost of this improved safety is awkward syntax.
Gem #123: Implicit Dereferencing in Ada 2012 This gem shows how to simplify the syntax with the new Ada 2012 generation. (Admittedly, this gem is a bit unrelated to reference counting since the new language feature can be applied to any kind of container.)

## General access

General access types grant access to objects created on any storage pool, on the stack or at library level (static). They come in two versions, granting either read-write access or read-only access. Conversions between general access types are allowed, but subject to certain access level checks.
Dereferencing is like for pool access types. Objects (other than pool objects) to be referenced have to be declared aliased, and references to them are created with the attribute 'Access. Access level restrictions prevent accesses to objects from outliving the accessed object, which would make the program erroneous. The attribute 'Unchecked_Access omits the corresponding checks.

### Access to Variable

When the keyword all is used in their definition, they grant read-write access.

### Access to Constant

General access types granting read-only access to the referenced object use the keyword constant in their definition. The referenced object may be a constant or a variable.

### Some examples
## Anonymous access

Also Anonymous access types come in two versions like general access types, granting either read-write access or read-only access depending on whether the keyword constant appears.
An anonymous access can be used as a parameter to a subprogram or as a discriminant. Here are some examples:
Before using an anonymous access, you should consider a named access type or, even better, consider if the "out" or "in out" modifier is not more appropriate.
This language feature is only available from Ada 2005 on.
In Ada 2005, anonymous accesses are allowed in more circumstances:

## Implicit Dereference

This language feature has been introduced in Ada 2012.
Ada 2012 simplifies accesses to objects via pointers with new syntax.
Imagine you have a container holding some kind of elements.
Now, how do you access elements stored in the container. Of course, you can retrieve them by
This will however copy the element, which is unfortunate if the element is big. You get direct access with
Now, pointers are dangerous since you might easily create dangling pointers like so:
Use of an accessor object instead of an access type can prevent inadvertent deallocation (this is still Ada 2005):
(For the null exclusion not null in the declaration of the discriminant, see below). Access via such an accessor is safe: The discriminant can only be used for dereferencing, it cannot be copied to an object of type Element_Ptr because its accessibility level is deeper. In the form above, the accessor provides read and write access. If the keyword constant is added, only read access is possible.
Access to the container object now looks like so:
Here the new Ada 2012 feature of aspects comes along handy; for the case at hand, the aspect Implicit_Dereference is the one we need:
Now rather than writing the long and ugly function call of above, we can just omit the discriminant and its dereference like so:
Note that the call Get (Cont) is overloaded — it can denote the accessor object or the element, the compiler will select the correct interpretation depending on context.

## Null exclusions

This language feature is only available from Ada 2005 on.
All access subtypes can be modified with not null, objects of such a subtype can then never have the value null, so initializations are compulsory.
The language also allows to declare the first subtype directly with a null exclusion:
However, in nearly all cases this is not a good idea because it renders objects of this type nearly unusable (for example, you are unable to free the allocated memory). Not null accesses are intended for access subtypes, object declarations, and subprogram parameters.

## Access to Subprogram

An access to subprogram allows the caller to call a subprogram without knowing its name nor its declaration location. One of the uses of this kind of access is the well known callbacks.
For getting an access to a subprogram, the attribute Access is applied to a subprogram name with the proper parameter and result profile.

### Anonymous access to Subprogram

This language feature is only available from Ada 2005 on.
There is now no limit on the number of keyword in a sequence:
This is a function that returns the access to a function that in turn returns an access to a function returning an access to some type.

## Access FAQ

A few "Frequently Asked Question" and "Frequently Encountered Problems" (mostly from C users) regarding Ada's access types.

### Access vs. access all

An access all can do anything a simple access can do. So one might ask: "Why use simple access at all?" - And indeed some programmers never use simple access.
Unchecked_Deallocation is always dangerous if misused. It is just as easy to deallocate a pool-specific object twice, and just as dangerous as deallocating a stack object. The advantage of "access all" is that you may not need to use Unchecked_Deallocation at all.
Moral: if you have (or may have) a valid reason to store an 'Access or 'Unchecked_Access into an access object, then use "access all" and don't worry about it. If not, the mantra of "least privilege" suggests that the "all" should be left out (don't enable capabilities that you are not going to use).
The following (perhaps disastrous) example will try to deallocate a stack object:
With a simple access you know at least that you won't try to deallocate a stack object. The reason is that access does not allow pointers to be created from stack objects.

### Access vs. System.Address

An access can be something different from a mere memory address, it may be something more. For example, an "access to String" often needs some way of storing the string size as well. If you need a simple address and are not concerned about strong typing, use the System.Address type.

### C compatible pointer

The correct way to create a C compatible access is to use pragma Convention:
pragma Convention should be used on any type you want to use in C. The compiler will warn you if the type cannot be made C compatible.
You may also consider the following - shorter - alternative when declaring Day_Of_Month:
Before you use access types in C, you should consider using the normal "in", "out" and "in out" modifiers. pragma Export and pragma Import know how parameters are usually passed in C and will use a pointer to pass a parameter automatically where C would have used them as well. Of course the RM contains precise rules on when to use a pointer for "in", "out", and "in out" - see "B.3: Interfacing with C".

### Where is void*?

While actually a problem for "interfacing with C", here are some possible solutions:
Less portable, but perhaps more usable (for 32 bit CPUs):
With GNAT you can get 32/64 bit portability by using:
Closer to the true nature of void - pointing to an element of zero size is a pointer to a null record. This also has the advantage of having a representation for void and void*:

## Thin and Fat Access Types

The difference between an access type and an address will be detailed in the following. The term pointer is used because this is usual terminology.
There is a predefined unit System.Address_to_Access_Conversion converting back and forth between access values and addresses. Use these conversions with care, as is explained below.

### Thin Pointers

Thin pointers grant access to constrained subtypes.
Objects of subtypes like these have a static size, so a simple address suffices to access them. In the case of arrays, this is generally the address of the first element.
For pointers of this kind, use of System.Address_to_Access_Conversion is safe.

### Fat Pointers

Objects of subtype Unc need a constraint, i.e. a start and a stop index, thus pointers to them need also to include those. So a simple address like the one of the first component is not sufficient. Note that A'Address is the same as A(A'First)'Address for any array object.
For pointers of this kind, System.Address_to_Access_Conversion will probably not work satisfactorily.

### Example

Here, CO is a nominally constrained object, a pointer to it need not store the constraint, i.e. a thin pointer suffices. In contrast, UO is an object of a nominally unconstrained subtype, its actual subtype is constrained by the initial value.
The relevant paragraphs in the RM are difficult to understand. In short words:
An access type's target type is called the designated subtype, in our example Unc. RM 3.10.2(27.1/2) requires that Acc_Unc's designated subtype statically match the nominal subtype of the object.
Now the nominal subtype of CO is the constrained anonymous subtype Unc (-1 .. +1), the nominal subtype of UO is the unconstrained subtype Unc. In the illegal cases, the designated and nominal subtypes do not statically match.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types

### Ada Reference Manual
#### Ada 95

* 4.8: Allocators
* 13.11: Storage Management
* 13.11.2: Unchecked Storage Deallocation
* 3.7: Discriminants
* 3.10: Access Types
* 6.1: Subprogram Declarations
* B.3: Interfacing with C

#### Ada 2005

* 4.8: Allocators
* 13.11: Storage Management
* 13.11.2: Unchecked Storage Deallocation
* 3.7: Discriminants
* 3.10: Access Types
* 6.1: Subprogram Declarations
* B.3: Interfacing with C

#### Newest RM

* 3.10: Access Types
* 7.6: Assignment and Finalization
* 7.6.1: Completion and Finalization
* 13.11: Storage Management

### Ada Quality and Style Guide

* 5.4.5 Dynamic Data
* 5.9.2 Unchecked Deallocation

### References
# Limited types
## Limited Types

When a type is declared limited this means that objects of the type cannot be assigned values of the same type. An Object b of limited type LT cannot be copied into an object a of same type LT.
Additionally, there is no predefined equality operation for objects of a limited type.
The desired effects of declaring a type limited include prevention of shallow copying. Also, the (unique) identity of an object is retained: once declared, a name of a variable of type LT will continue to refer to the same object.
The following example will use a rather simplifying type Boat.
When we declare a variable to be of type Boat, its name will denote one boat from then on. Boats will not be copied into one another.
The full view of a boat might be implemented as a record such as
The Choose function returns a Boat object depending on the parameters Load and Speed. If we now declare a variable of type Boat we will be better off Choosing an initial Boat (or else we might be dropping into uninitialized waters!). But when we do so, the initialization looks suspiciously like assignment which is not available with limited types:
Fortunately, current Ada distinguishes initialization from copying. Objects of a limited type may be initialized by an initialization expression on the right of the delimiter :=.
(Just to prevent confusion: The Ada Reference Manual discriminates between assignment and assignment statement, where assignment is part of the assignment statement. An initialisation is of course an assignment which, for limited types, is done in place. An assignment statement involves copying, which is forbidden for limited types.)
Related to this feature are aggregates of limited types and “constructor functions” for limited types. Internally, the implementation of the Choose function will return a limited record. However, since the return type Boat is limited, there must be no copying anywhere. Will this work? A first attempt might be to declare a result variable local to Choose, manipulate result, and return it. The result object needs to be “transported” into the calling environment. But result is a variable local to Choose. When Choose returns, result will no longer be in scope. Therefore it looks like result must be copied but this is not permitted for limited types. There are two solutions provided by the language: extended return statements (see 6.5: Return Statements) and aggregates of limited types. The following body of Choose returns an aggregate of limited type Boat, after finding the initial values for its components.
The object that is returned is at the same time the object that is to have the returned value. The function therefore initializes Henrietta in place.
In parallel to the predefined type Ada.Finalization.Controlled, Ada provides the type Limited_Controlled in the same package. It is a limited version of the former.

## Initialising Limited Types

A few methods to initialise such types are presented.
Note that D3 is a constant, whereas all others are variables.
Also note that the initial value that is defined for the component of Preinitialised is evaluated at the time of object creation, i.e. if an expression is used instead of the literal, the value can be run-time dependent.
In this declaration of two objects, the initial expression will be evaluated twice and can deliver different values, because it is equivalent to the sequence:
So X is initialised before Y.

## See also
### Ada 95 Reference Manual

* 7.5: Limited Types

### Ada 2005 Reference Manual

* 7.5: Limited Types

### Ada Quality and Style Guide

* 5.3.3 Private Types
* 8.3.3 Formal Private and Limited Private Types

## References

* ↑ ISO/IEC 8652:2007. "3.3.1 Object Declarations (7)". Ada 2005 Reference Manual. Any declaration [...] with more than one defining_identifier is equivalent to a series of declarations each containing one defining_identifier from the list, [...] in the same order as the list. {{cite book}}: Unknown parameter |chapterurl= ignored (|chapter-url= suggested) (help)

# Strings

Ada supports three different types of strings. Each string type is designed to solve a different problem.
In addition, every string type is implemented for each available Characters type (Character, Wide_Character, Wide_Wide_Character) giving a complement of nine combinations.

## Fixed-length string handling

Fixed-Length Strings (the predefined type String) are arrays of Character, and consequently of a fixed length. Since String is an indefinite subtype the length does not need to be known at compile time — the length may well be calculated at run time. In the following example the length is calculated from command-line argument 1:
However once the length has been calculated and the string has been created the length stays constant. Try the following program which shows a typical mistake:
The program will only work when the 1st and 2nd parameter have the same length. This is even true when the 2nd parameter is shorter. There is neither an automatic padding of shorter strings nor an automatic truncation of longer strings.
Having said that, the package Ada.Strings.Fixed contains a set of procedures and functions for Fixed-Length String Handling which allows padding of shorter strings and truncation of longer strings.
Try the following example to see how it works:

## Bounded-length string handling

Bounded-Length Strings can be used when the maximum length of a string is known and/or restricted. This is often the case in database applications where only a limited number of characters can be stored.
Like Fixed-Length Strings the maximum length does not need to be known at compile time — it can also be calculated at runtime — as the example below shows:
You should know that Bounded-Length Strings have some distinct disadvantages. Most noticeable is that each Bounded-Length String is a different type which makes converting them rather cumbersome. Also a Bounded-Length String type always allocates memory for the maximum permitted string length for the type. The memory allocation for a Bounded-Length String is equal to the maximum number of string "characters" plus an implementation dependent number containing the string length (each character can require allocation of more than one byte per character, depending on the underlying character type of the string, and the length number is 4 bytes long for the Windows GNAT Ada compiler v3.15p, for example).

## Unbounded-length string handling

Last but not least there is the Unbounded-Length String. In fact: If you are not doing embedded or database programming this will be the string type you are going to use most often as it gives you the maximum amount of flexibility.
As the name suggest the Unbounded-Length String can hold strings of almost any length — limited only to the value of Integer'Last or your available heap memory. This is because Unbounded_String type is implemented using dynamic memory allocation behind the scenes, providing lower efficiency but maximum flexibility.
As you can see the Unbounded-Length String example is also the shortest (disregarding the buggy first example) — this makes using Unbounded-Length Strings very appealing.

## See also
### Wikibook

* Ada Programming

### Ada 95 Reference Manual

* 2.6: String Literals
* 3.6.3: String Types
* A.4.3: Fixed-Length String Handling
* A.4.4: Bounded-Length String Handling
* A.4.5: Unbounded-Length String Handling

### Ada 2005 Reference Manual

* 2.6: String Literals
* 3.6.3: String Types
* A.4.3: Fixed-Length String Handling
* A.4.4: Bounded-Length String Handling
* A.4.5: Unbounded-Length String Handling

# Subprograms

In Ada the subprograms are classified into two categories: procedures and functions. A procedures call is a statement and does not return any value, whereas a function returns a value and must therefore be a part of an expression.
Subprogram parameters may have three modes.

## in

    The actual parameter value goes into the call and is not changed there; the formal parameter is a constant and allows only reading – with a caveat, see Ada Programming/Constants. This is the default when no mode is given. The actual parameter can be an expression.

## in out

    The actual parameter goes into the call and may be redefined. The formal parameter is a variable and can be read and written.

## out

    The actual parameter's value before the call is irrelevant, it will get a value in the call. The formal parameter can be read and written. (In Ada 83 out parameters were write-only.)
A parameter of any mode may also be explicitly aliased.

## access

    The formal parameter is an access (a pointer) to some variable. (This is not a parameter mode from the reference manual point of view.)
Note that parameter modes do not specify the parameter passing method. Their purpose is to document the data flow.
The parameter passing method depends on the type of the parameter. A rule of thumb is that parameters fitting into a register are passed by copy, others are passed by reference. For certain types, there are special rules, for others the parameter passing mode is left to the compiler (which you can assume to do what is most sensible). Tagged types are always passed by reference.
Explicitly aliased parameters and access parameters specify pass by reference.
Unlike in the C class of programming languages, Ada subprogram calls cannot have empty parameters parentheses ( ) when there are no parameters.

## Procedures

A procedure call in Ada constitutes a statement by itself.
For example:
When the procedure is called with the statement
the expressions 5 + P and 48 are evaluated (expressions are only allowed for in parameters), and then assigned to the formal parameters A and B, which behave like constants. Then, the value A + B is assigned to formal variable C, whose value will be assigned to the actual parameter Q when the procedure finishes.
C, being an out parameter, is an uninitialized variable before the first assignment. (Therefore in Ada 83, there existed the restriction that out parameters are write-only. If you wanted to read the value written, you had to declare a local variable, do all calculations with it, and finally assign it to C before return. This was awkward and error prone so the restriction was removed in Ada 95.)
Within a procedure, the return statement can be used without arguments to exit the procedure and return the control to the caller.
For example, to solve an equation of the kind $ax^{2}+bx+c=0$:
The function SQRT calculates the square root of non-negative values. If the roots are real, they are given back in R1 and R2, but if they are complex or the equation degenerates (A = 0), the execution of the procedure finishes after assigning to the Valid variable the False value, so that it is controlled after the call to the procedure. Notice that the out parameters should be modified at least once, and that if a mode is not specified, it is implied in.

## Functions

A function is a subprogram that can be invoked as part of an expression. Until Ada 2005, functions can only take in (the default) or access parameters; the latter can be used as a work-around for the restriction that functions may not have out parameters. Ada 2012 has removed this restriction.
Here is an example of a function body:
(There is, by the way, also the attribute Integer'Min, see RM 3.5.) Or in Ada2012:
or even shorter as an expression function
The formal parameters with mode in behave as local constants whose values are provided by the corresponding actual parameters. The statement return is used to indicate the value returned by the function call and to give back the control to the expression that called the function. The expression of the return statement may be of arbitrary complexity and must be of the same type declared in the specification. If an incompatible type is used, the compiler gives an error. If the restrictions of a subtype are not fulfilled, e.g. a range, it raises a Constraint_Error exception.
The body of the function can contain several return statements and the execution of any of them will finish the function, returning control to the caller. If the flow of control within the function branches in several ways, it is necessary to make sure that each one of them is finished with a return statement. If at run time the end of a function is reached without encountering a return statement, the exception Program_Error is raised. Therefore, the body of a function must have at least one such return statement.
Every call to a function produces a new copy of any object declared within it. When the function finalizes, its objects disappear. Therefore, it is possible to call the function recursively. For example, consider this implementation of the factorial function:
When evaluating the expression Factorial (4); the function will be called with parameter 4 and within the function it will try to evaluate the expression Factorial (3), calling itself as a function, but in this case parameter N would be 3 (each call copies the parameters) and so on until N = 1 is evaluated which will finalize the recursion and then the expression will begin to be completed in the reverse order.
A formal parameter of a function can be of any type, including vectors or records. Nevertheless, it cannot be an anonymous type, that is, its type must be declared before, for example:
In this example, the function can be used on a vector of arbitrary dimension. Therefore, there are no static bounds in the parameters passed to the functions. For example, it is possible to be used in the following way:
In the same way, a function can also return a type whose bounds are not known a priori. For example:
The variable Result has the same bounds as V, so the returned vector will always have the same dimension as the one passed as parameter.
A value returned by a function can be used without assigning it to a variable, it can be referenced as an expression. For example, Invert_Components (V4) (1), where the first element of the vector returned by the function would be obtained (in this case, the last element of V4, i.e. 7.8).

## Named parameters

In subprogram calls, named parameter notation (i.e. the name of the formal parameter followed of the symbol => and then the actual parameter) allows the rearrangement of the parameters in the call. For example:
This is especially useful to make clear which parameter is which.
The first call (from Ada.Numerics.Elementary_Functions) is not very clear. One might easily confuse the parameters. The second call makes the meaning clear without any ambiguity.
Another use is for calls with numeric literals:

## Default parameters

On the other hand, formal parameters may have default values. They can, therefore, be omitted in the subprogram call. For example:
can be called in these ways:
In the first statement, a "regular call" is used (with positional association); the second also uses positional association but omits the second parameter to use the default; in the third statement, all parameters are by default; the fourth statement uses named association to omit the first parameter; finally, the fifth statement uses mixed association, here the positional parameters have to precede the named ones.
Note that the default expression is evaluated once for each formal parameter that has no actual parameter. Thus, if in the above example a function would be used as defaults for A and B, the function would be evaluated once in case 2 and 4; twice in case 3, so A and B could have different values; in the others cases, it would not be evaluated.

## Renaming

Subprograms may be renamed. The parameter and result profile for a renaming-as-declaration must be mode conformant.
This may be especially comfortable for tagged types.
But note that Message.Print'Access; is illegal, you have to use a renaming declaration as above.
Since only mode conformance is required (and not full conformance as between specification and body), parameter names and default values may be changed with renamings:

## See also
### Wikibook

* Ada Programming
* Ada Programming/Operators

### Ada 95 Reference Manual

* Section 6: Subprograms
* 4.4: Expressions

### Ada 2005 Reference Manual

* Section 6: Subprograms
* 4.4: Expressions

### Ada Quality and Style Guide

* 4.1.3 Subprograms

# Packages

Ada encourages the division of code into separate modules called packages. Each package can contain any combination of items.
Some of the benefits of using packages are:
* package contents are placed in a separate namespace, preventing naming collisions,
* implementation details of the package can be hidden from the programmer (information hiding),
* object orientation requires defining a type and its primitive subprograms within a package, and
* packages that are library units can be separately compiled.
Some of the more common package usages are:
* a group of related subprograms along with their shared data, with the data not visible outside the package,
* one or more data types along with subprograms for manipulating those data types, and
* a generic package that can be instantiated under varying conditions.
The following is a quote from the current Ada Reference Manual Section 7: Packages. RM 7(1)

## Separate compilation

Note: The following chapters deal with packages on library level. This is the most common use, since packages are the basic code structuring means in Ada. However, Ada being a block oriented language, packages can be declared at any level in any declarative region. In this case, the normal visibility rules apply, also for the package body.
Package specifications and bodies on library level are compilation units, so can be separately compiled. Ada has nothing to say about how and where compilation units are stored. This is implementation dependent. (Most implementations indeed store compilation units in files of their own; name suffixes vary, GNAT uses .ads and .adb, APEX .1.ada and .2.ada.) The package body can itself be divided into multiple parts by specifying that subprogram implementations or bodies of nested packages are separate. These are then further compilation units.
One of the biggest advantages of Ada over most other programming languages is its well-defined system of modularization and separate compilation. Even though Ada allows separate compilation, it maintains the strong type checking among the various compilations by enforcing rules of compilation order and compatibility checking. Ada compilers determine the compilation sequence; no make file is needed. Ada uses separate compilation (like Modula-2, Java and C#), and not independent compilation (as C/C++ does), in which the various parts are compiled with no knowledge of the other compilation units with which they will be combined.
A note to C/C++ users: Yes, you can use the preprocessor to emulate separate compilation — but it is only an emulation and the smallest mistake leads to very hard to find bugs. It is telling that all C/C++ successor languages including D have turned away from the independent compilation and the use of the preprocessor.
So it's good to know that Ada has had separate compilation ever since Ada-83 and is probably the most sophisticated implementation around.

## Parts of a package

A package generally consists of two parts, the specification and the body. A package specification can be further divided in two logical parts, the visible part and the private part. Only the visible part of the specification is mandatory. The private part of the specification is optional, and a package specification might not have a package body—the package body only exists to complete any incomplete items in the specification. Subprogram declarations are the most common incomplete items. There must not be a package body if there is no incomplete declaration, and there has to be a package body if there is some incomplete declaration in the specification.
To understand the value of the three-way division, consider the case of a package that has already been released and is in use. A change to the visible part of the specification will require that the programmers of all using software verify that the change does not affect the using code. A change to the private part of the declaration will require that all using code be recompiled but no review is normally needed. Some changes to the private part can change the meaning of the client code however. An example is changing a private record type into a private access type. This change can be done with changes in the private part, but change the semantic meaning of assignment in the clients code. A change to the package body will only require that the file containing the package body be recompiled, because nothing outside of the package body can ever access anything within the package body (beyond the declarations in the specification part).
A common usage of the three parts is to declare the existence of a type and some subprograms that operate on that type in the visible part, define the actual structure of the type (e.g. as a record) in the private part, and provide the code to implement the subprograms in the package body.

### The package specification — the visible part

The visible part of a package specification describes all the subprogram specifications, variables, types, constants etc. that are visible to anyone who wishes to use the package.
Since Range_10 is an integer type, there are a lot of operations declared implicitly in this package.

### The private part

The private part of a package serves two purposes:
* To complete the deferred definition of private types and constants.
* To export entities only visible to the children of the package.
Since the type is private, clients cannot make any use of it as long as there are no operations defined in the visible part.

### The package body

The package body defines the implementation of the package. All the subprograms defined in the specification have to be implemented in the body. New subprograms, types and objects can be defined in the body that are not visible to the users of the package.

#### pragma Pure_Function

    Only available when using GNAT.

### Two Flavors of Package

The packages above each define a type together with operations of the type. When the type's composition is placed in the private part of a package, the package then exports what is known to be an Abstract Data Type or ADT for short. Objects of the type are then constructed by calling one of the subprograms associated with the respective type.
A different kind of package is the Abstract State Machine or ASM. A package will be modeling a single item of the problem domain, such as the motor of a car. If a program controls one car, there is typically just one motor, or the motor. The public part of the package specification only declares the operations of the module (of the motor, say), but no type. All data of the module are hidden in the body of the package where they act as state variables to be queried, or manipulated by the subprograms of the package. The initialization part sets the state variables to their initial values.
(A note on construction: The package initialization part after begin corresponds to a construction subprogram of an ADT package. However, as a state machine is an “object” already, “construction” is happening during package initialization. (Here it sets the state variable The_A to its initial value.) An ASM package can be viewed as a singleton.)

## Using packages

To utilize a package it's needed to name it in a with clause, whereas to have direct visibility of that package it's needed to name it in a use clause.
For C++ programmers, Ada's with clause is analogous to the C++ preprocessor's #include and Ada's use is similar to the using namespace statement in C++. In particular, use leads to the same namespace pollution problems as using namespace and thus should be used sparingly. Renaming can shorten long compound names to a manageable length, while the use type clause makes a type's operators visible. These features reduce the need for plain use.

### Standard with

The standard with clause provides visibility for the public part of a unit to the following defined unit. The imported package can be used in any part of the defined unit, including the body when the clause is used in the specification.

### Private with

This language feature is only available from Ada 2005 on.

### Limited with

This language feature is only available from Ada 2005 on.
The limited with can be used to represent two mutually dependent type (or more) located in separate packages.

### Making operators visible

Suppose you have a package Universe that defines some numeric type T.
This program fragment is illegal since the operators implicitly defined in Universe are not directly visible.
You have four choices to make the program legal.
Use a use_package_clause. This makes all declarations in Universe directly visible (provided they are not hidden because of other homographs).
Use renaming. This is error prone since if you rename many operators, cut and paste errors are probable.
Use qualification. This is extremely ugly and unreadable.
Use the use_type_clause. This makes only the operators in Universe directly visible.
There is a special beauty in the use_type_clause. Suppose you have a set of packages like so:
Now you've got into trouble. Since Universe is not made visible, you cannot use a use_package_clause for Universe to make the operator directly visible, nor can you use qualification for the same reason. Also a use_package_clause for Pack does not help, since the operator is not defined in Pack. The effect of the above construct means that the operator is not nameable, i.e. it cannot be renamed in a renaming statement.
Of course you can add Universe to the context clause, but this may be impossible due to some other reasons (e.g. coding standards); also adding the operators to Pack may be forbidden or not feasible. So what to do?
The solution is simple. Use the use_type_clause for Pack.T and all is well!

## Package organisation
### Nested packages

A nested package is a package declared inside a package. Like a normal package, it has a public part and a private part. From outside, items declared in a nested package N will have visibility as usual; the programmer may refer to these items using a full dotted name like P.N.X. (But not P.M.Y.)
Inside a package, declarations become visible as they are introduced, in textual order. That is, a nested package N that is declared after some other declaration D can refer to this declaration D. A declaration E following N can refer to items of N. But neither can “look ahead” and refer to any declaration that goes after them. For example, spec N above cannot refer to M in any way.
In the following example, a type is derived in both of the two nested packages Disks and Books. Notice that the full declaration of parent type Item appears before the two nested packages.
A package may also be nested inside a subprogram. In fact, packages can be declared in any declarative part, including those of a block.

### Child packages

Ada allows one to extend the functionality of a unit (package) with so-called children (child packages). With certain exceptions, all the functionality of the parent is available to a child. This means that all public and private declarations of the parent package are visible to all child packages.
The above example, reworked as a hierarchy of packages, looks like this. Notice that the package Ada.Strings.Unbounded is not needed by the top level package Shelf, hence its with clause doesn't appear here. (We have added a match function for searching a shelf, though):
The name of a child package consists of the parent unit's name followed by the child package's identifier, separated by a period (dot) `.'.
Book has two components of type Unbounded_String, so Ada.Strings.Unbounded appears in a with clause of the child package. This is unlike the nested packages case which requires that all units needed by any one of the nested packages be listed in the context clause of the enclosing package (see 10.1.2 Context Clauses - With Clauses (Annotated)). Child packages thus give better control over package dependences. With clauses are more local.
The new child package Shelf.Disks looks similar. The Boxes package which was a nested package in the private part of the original Shelf package is moved to a private child package:
The privacy of the package means that it can only be used by equally private client units. These clients include private siblings and also the bodies of siblings (as bodies are never public).
Child packages may be listed in context clauses just like normal packages. A with of a child also 'withs' the parent.

### Subunits

A subunit is just a feature to move a body into a place of its own when otherwise the enclosing body will become too large. It can also be used for limiting the scope of context clauses.
The subunits allow to physically divide a package into different compilation units without breaking the logical unity of the package. Usually each separated subunit goes to a different file allowing separate compilation of each subunit and independent version control history for each one.

## Notes

* ↑ For example, E: Integer := D + N.X;

## See also
### Wikibook

* Ada Programming

### Wikipedia

* Module

### Ada 95 Reference Manual

* Section 7: Packages

### Ada 2005 Reference Manual

* Section 7: Packages

# Input Output
## Overview

The standard Ada libraries provide several Input/Output facilities, each one adapted to specific needs. Namely, the language defines the following dedicated packages:
* Text_IO
* Sequential_IO
* Direct_IO
* Stream_IO
The programmer must choose the adequate package depending on the application needs. For example, the following properties of the data handled by the application should be considered:
* Data contents: plain text, or binary data?
* Accessing the data: random access, or sequential access?
* Medium: data file, console, network/data-bus?
* Data structure: homogeneous file (sequence of the same data field), heterogeneous file (different data fields)?
* Data format: adherence to an existing data format, or the application can freely choose a new one?
For example, Stream_IO is very powerful and can handle complex data structures but can be heavier than other packages; Sequential_IO is lean and easy to use but cannot be used by applications requiring random data access; Text_IO can handle just textual data, but it is enough for handling the command-line console.
The following table gives some advices for choosing the more adequate one:
Simple heuristics for choosing an I/O package :
| Data access | Plain text | Binary data | Binary data |
| Data access | Plain text | Homogeneous | Heterogeneous |
| Sequential | Text_IO | Sequential_IO | Stream_IO |
| Random | Stream_IO | Direct_IO | Stream_IO |
So the most important lesson to learn is choosing the right one. This chapter will describe more in detail these standard packages, explaining how to use them effectively. Besides these Ada-defined packages for general I/O operations each Ada compiler usually has other implementation-defined Input-Output facilities, and there are also other external libraries for specialized I/O needs like XML processing or interfacing with databases.

## Text I/O

Text I/O is probably the most used Input/Output package. All data inside the file are represented by human readable text. Text I/O provides support for line and page layout but the standard is free form text.
This example copies text from standard input to standard output when all lines are shorter than 80 characters, the string length. See package Text I/O how to deal with longer lines.
The package also contains several generic packages for converting numeric and enumeration types to character strings; there are child packages for handling Bounded and Unbounded strings, allowing the programmer to read and write different data types in the same file easily (there are ready-to-use instantiations of these generic packages for the Integer, Float, and Complex types). Finally, the same family of Ada.Text_IO packages (including the several children and instantiation packages) for the type Wide_Character and Wide_Wide_Character.
It is worth noting that the family of Text_IO packages provide some automatic text processing. For example, the Get procedures for numeric and enumeration types ignore white space at the beginning of a line (Get_Line for String does not present this behavior), or adding line and page terminators when closing the file. This is thus adequate for applications handling simple textual data, but users requiring direct management of text (e.g. raw access to the character encoding) must consider other packages like Sequential_IO.
See this tutorial for a longer example of using text I/O in Ada.

## Direct I/O

Direct I/O is used for random access files which contain only elements of one specific type. With Direct_IO you can position the file pointer to any element of that type (random access), however you can't freely choose the element type, the element type needs to be a definite subtype.

## Sequential I/O

Direct I/O is used for random access files which contain only elements of one specific type. With Sequential_IO it is the other way round: you can choose between definite and indefinite element types but you have to read and write the elements one after the other.

## Stream I/O

Stream I/O is the most powerful input/output package which Ada provides. Stream I/O allows you to mix objects from different element types in one sequential file. In order to read/write from/to a stream each type provides a 'Read and 'Write attribute as well as an 'Input and 'Output attribute. These attributes are automatically generated for each type you declare.
The 'Read and 'Write attributes treat the elements as raw data. They are suitable for low level input/output as well as interfacing with other programming languages.
The 'Input and 'Output attributes add additional control information to the file, like for example the 'First and 'Last attributes for an array.
In object orientated programming you can also use the 'Class'Input and 'Class'Output attributes - they will store and recover the actual object type as well.
Stream I/O is also the most flexible input/output package. All I/O attributes can be replaced with user defined functions or procedures using representation clauses and you can provide your own Stream I/O types using flexible object oriented techniques.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Libraries/Ada.Direct_IO
* Ada Programming/Libraries/Ada.Sequential_IO
* Ada Programming/Libraries/Ada.Streams
** Ada Programming/Libraries/Ada.Streams.Stream_IO
** Ada Programming/Libraries/Ada.Text_IO.Text_Streams
* Ada Programming/Libraries/Ada.Text_IO
** Ada Programming/Libraries/Ada.Text_IO.Enumeration_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Integer_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Modular_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Float_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Fixed_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Decimal_IO (nested package)
** Ada Programming/Libraries/Ada.Text_IO.Bounded_IO
** Ada Programming/Libraries/Ada.Text_IO.Unbounded_IO
** Ada Programming/Libraries/Ada.Text_IO.Complex_IO (specialized needs annex)
** Ada Programming/Libraries/Ada.Text_IO.Editing (specialized needs annex)
* Ada Programming/Libraries/Ada.Integer_Text_IO
* Ada Programming/Libraries/Ada.Float_Text_IO
* Ada Programming/Libraries/Ada.Complex_Text_IO (specialized needs annex)
* Ada Programming/Libraries/Ada.Storage_IO (not a general-purpose I/O package)
* Ada Programming/Libraries/Ada.IO_Exceptions
* Ada Programming/Libraries/Ada.Command_Line
* Ada Programming/Libraries/Ada.Directories
* Ada Programming/Libraries/Ada.Environment_Variables
* Ada Programming/Libraries/GNAT.IO (implementation defined)
* Ada Programming/Libraries/GNAT.IO_Aux (implementation defined)
* Ada Programming/Libraries/GNAT.Calendar.Time_IO (implementation defined)
* Ada Programming/Libraries/System.IO (implementation defined)
* Ada Programming/Libraries
** Ada Programming/Libraries/GUI
** Ada Programming/Libraries/Web
** Ada Programming/Libraries/Database
* Ada Programming/Platform
* Ada Programming/Platform/Linux
* Ada Programming/Platform/Windows

### Ada Reference Manual

* A.6 Input-Output (Annotated)
* A.7 External Files and File Objects (Annotated)
* A.8 Sequential and Direct Files (Annotated)
* A.10 Text Input-Output (Annotated)
* A.11 Wide Text Input-Output and Wide Wide Text Input-Output (Annotated)
* A.12 Stream Input-Output (Annotated)
* A.13 Exceptions in Input-Output (Annotated)
* A.14 File Sharing (Annotated)

### Ada 95 Quality and Style Guide

* 7.7 Input/Output
** 7.7.1 Name and Form Parameters
** 7.7.2 File Closing
** 7.7.3 Input/Output on Access Types
** 7.7.4 Package Ada.Streams.Stream_IO
** 7.7.5 Current Error Files

# Exceptions
## Robustness

Robustness is the ability of a system or system component to behave “reasonably” when it detects an anomaly, e.g.:
* It receives invalid inputs.
* Another system component (hardware or software) malfunctions.
Take as example a telephone exchange control program. What should the control program do when a line fails? It is unacceptable simply to halt — all calls will then fail. Better would be to abandon the current call (only), record that the line is out of service, and continue. Better still would be to try to reuse the line — the fault might be transient. Robustness is desirable in all systems, but it is essential in systems on which human safety or welfare depends, e.g., hospital patient monitoring, aircraft fly-by-wire, nuclear power station control, etc.

## Modules, preconditions and postconditions

A module may be specified in terms of its preconditions and postconditions. A precondition is a condition that the module’s inputs are supposed to satisfy. A postcondition is a condition that the module’s outputs are required to satisfy, provided that the precondition is satisfied. What should a module do if its precondition is not satisfied?
* Halt? Even with diagnostic information, this is generally unacceptable.
* Use a global result code? The result code can be set to indicate an anomaly. Subsequently it may be tested by a module that can effect error recovery. Problem: this induces tight coupling among the modules concerned.
* Each module has its own result code? This is a parameter (or function result) that may be set to indicate an anomaly, and is tested by calling modules. Problems: (1) setting and testing result codes tends to swamp the normal-case logic and (2) the result codes are normally ignored.
* Exception handling — Ada’s solution. A module detecting an anomaly raises an exception. The same, or another, module may handle that exception.
The exception mechanism permits clean, modular handling of anomalous situations:
* A unit (e.g., block or subprogram body) may raise an exception, to signal that an anomaly has been detected. The computation that raised the exception is abandoned (and can never be resumed, although it can be restarted).
* A unit may propagate an exception that has been raised by itself (or propagated out of another unit it has called).
* A unit may alternatively handle such an exception, allowing programmer-defined recovery from an anomalous situation. Exception handlers are segregated from normal-case code.

## Predefined exceptions

The predefined exceptions are those defined in package Standard. Every language-defined run-time error causes a predefined exception to be raised. Some examples are:
* Constraint_Error, raised when a subtype’s constraint is not satisfied
* Program_Error, when a protected operation is called inside a protected object, e.g.
* Storage_Error, raised by running out of storage
* Tasking_Error, when a task cannot be activated because the operating system has not enough resources, e.g.
Ex.1
Ex.2
Ex.3 Compare the following approaches:
A negative argument to Compute_Sqrt causes OK to be set to False. Triangle uses it to determine its own status parameter value, and so on up the calling tree, ad nauseam.
versus
A negative argument to Sqrt causes Constraint_Error to be explicitly raised inside Sqrt, and propagated out. Triangle simply propagates the exception (by not handling it).
Alternatively, we can catch the error by using the type system:
A negative argument to Sqrt now raises Constraint_Error at the point of call. Sqrt is never even entered.

## Input-output exceptions

Some examples of exceptions raised by subprograms of the predefined package Ada.Text_IO are:
* End_Error, raised by Get, Skip_Line, etc., if end-of-file already reached.
* Data_Error, raised by Get in Integer_IO, etc., if the input is not a literal of the expected type.
* Mode_Error, raised by trying to read from an output file, or write to an input file, etc.
* Layout_Error, raised by specifying an invalid data format in a text I/O operation
Ex. 1

## Exception declarations

Exceptions are declared similarly to objects.
Ex.1 declares two exceptions:
However, exceptions are not objects. For example, recursive re-entry to a scope where an exception is declared does not create a new exception of the same name; instead the exception declared in the outer invocation is reused.
Ex.2

## Exception handlers

When an exception occurs, the normal flow of execution is abandoned and the exception is handed up the call sequence until a matching handler is found. Any declarative region (except a package specification) can have a handler. The handler names the exceptions it will handle. By moving up the call sequence, exceptions can become anonymous; in this case, they can only be handled with the others handler.
Exceptions raised in the declarative region itself (1) cannot be handled by handlers of this region (3); they can only be handled in outer scopes. Exceptions raised in the sequence of statements (2) can of course be handled at (3).
The reason for this rule is so that the handler can assume that any items declared in the declarative region (1) are well defined and may be referenced. If the handler at (3) could handle exceptions raised at (1), it would be unknown which items existed and which ones didn't.

## Raising exceptions

The raise statement explicitly raises a specified exception.
Ex. 1

## Exception handling and propagation

Exception handlers may be grouped at the end of a block, subprogram body, etc. A handler is any sequence of statements that may end:
* by completing;
* by executing a return statement;
* by raising a different exception (raise e;);
* by re-raising the same exception (raise;).
Suppose that an exception e is raised in a sequence of statements U (a block, subprogram body, etc.).
* If U contains a handler for e: that handler is executed, then control leaves U.
* If U contains no handler for e: e is propagated out of U; in effect, e is raised at the "point of call” of U.
So the raising of an exception causes the sequence of statements responsible to be abandoned at the point of occurrence of the exception. It is not, and cannot be, resumed.
Ex. 1

## Information about an exception occurrence

Ada provides information about an exception in an object of type Exception_Occurrence, defined in Ada.Exceptions along with subprograms taking this type as parameter:
* Exception_Name: return the full exception name using the dot notation and in uppercase letters. For example, Queue.Overflow.
* Exception_Message: return the exception message associated with the occurrence.
* Exception_Information: return a string including the exception name and the associated exception message.
For getting an exception occurrence object the following syntax is used:
The exception message content is implementation defined when it is not set by the user who raises the exception. It usually contains a reason for the exception and the raising location.
The user can specify a message using the procedure Raise_Exception.
Starting with Ada 2005, a simpler syntax can be used to associate a string message with exception occurrence.
The Ada.Exceptions package also provides subprograms for saving exception occurrences and re-raising them.

## See also
### Wikibook

* Ada Programming

### Ada 95 Reference Manual

* Section 11: Exceptions
* 11.4.1: The Package Exceptions

### Ada 2005 Reference Manual

* Section 11: Exceptions
* 11.4.1: The Package Exceptions

### Ada Quality and Style Guide

* Chapter 4: Program Structure
** 4.3 Exceptions
*** 4.3.1 Using Exceptions to Help Define an Abstraction
* Chapter 5: Programming Practices
** 5.8 Using Exceptions
*** 5.8.1 Handling Versus Avoiding Exceptions
*** 5.8.2 Handling for Others
*** 5.8.3 Propagation
*** 5.8.4 Localizing the Cause of an Exception
* Chapter 7: Portability
** 7.5 Exceptions
*** 7.5.1 Predefined and User-Defined Exceptions
*** 7.5.2 Implementation-Specific Exceptions

# Generics
## Parametric polymorphism (generic units)

The idea of code reuse arises from the necessity for constructing large software systems combining well-established building blocks. The reusability of code improves the productivity and the quality of software. The generic units are one of the ways in which the Ada language supports this characteristic. A generic unit is a subprogram or package that defines algorithms in terms of types and operations that are not defined until the user instantiates them.
Note to C++ programmers: generic units are similar to C++ templates.
For example, to define a procedure for swapping variables of any (non-limited) type:
The Swap subprogram is said to be generic. The subprogram specification is preceded by the generic formal part consisting of the reserved word generic followed by a list of generic formal parameters which may be empty. The entities declared as generic are not directly usable, it is necessary to instantiate them.
To be able to use Swap, it is necessary to create an instance for the wanted type. For example:
Now the Swap_Integers procedure can be used for variables of type Integer.
The generic procedure can be instantiated for all the needed types. It can be instantiated with different names or, if the same identifier is used in the instantiation, each declaration overloads the procedure:
Similarly, generic packages can be used, for example, to implement a stack of any kind of elements:
A stack of a given size and type could be defined in this way:

## Generic parameters

The generic unit declares generic formal parameters, which can be:
* objects (of mode in or in out but never out)
* types
* subprograms
* instances of another, designated, generic unit.
When instantiating the generic, the programmer passes one actual parameter for each formal. Formal values and subprograms can have defaults, so passing an actual for them is optional.

### Generic formal objects

Formal parameters of mode in accept any value, constant, or variable of the designated type. The actual is copied into the generic instance, and behaves as a constant inside the generic; this implies that the designated type cannot be limited. It is possible to specify a default value, like this:
For mode in out, the actual must be a variable.
One limitation with generic formal objects is that they are never considered static, even if the actual happens to be static. If the object is a number, it cannot be used to create a new type. It can however be used to create a new derived type, or a subtype:
The reason why formal objects are nonstatic is to allow the compiler to emit the object code for the generic only once, and to have all instances share it, passing it the address of their actual object as a parameter. This bit of compiler technology is called shared generics. If formal objects were static, the compiler would have to emit one copy of the object code, with the object embedded in it, for each instance, potentially leading to an explosion in object code size (code bloat).
(Note to C++ programmers: in C++, since formal objects can be static, the compiler cannot implement shared generics in the general case; it would have to examine the entire body of the generic before deciding whether or not to share its object code. In contrast, Ada generics are designed so that the compiler can instantiate a generic without looking at its body.)

### Generic formal types

The syntax allows the programmer to specify which type categories are acceptable as actuals. As a rule of thumb: the syntax expresses how the generic sees the type, i.e. it assumes the worst, not how the creator of the instance sees the type.
This is the syntax of RM 12.5:
This is quite complex, so some examples are given below. A type declared with the syntax type T (<>) denotes a type with unknown discriminants. This is the Ada vernacular for indefinite types, i.e. types for which objects cannot be declared without giving an initial expression. An example of such a type is one with a discriminant without default, another example is an unconstrained array type.
| Generic formal type | Acceptable actual types |
| type T (<>) is limited private; | Any type at all. The actual type can be limited or not, indefinite or definite, but the generic treats it as limited and indefinite, i.e. does not assume that assignment is available for the type. |
| type T (<>) is private; | Any nonlimited type: the generic knows that it is possible to assign to variables of this type, but it is not possible to declare objects of this type without initial value. |
| type T is private; | Any nonlimited definite type: the generic knows that it is possible to assign to variables of this type and to declare objects without initial value. |
| type T (<>) is abstract tagged limited private; | Any tagged type, abstract or concrete, limited or not. |
| type T (<>) is tagged limited private; | Any concrete tagged type, limited or not. |
| type T (<>) is abstract tagged private; | Any nonlimited tagged type, abstract or concrete. |
| type T (<>) is tagged private; | Any nonlimited, concrete tagged type. |
| type T (<>) is new Parent; | Any type derived from Parent. The generic knows about Parent's operations, so can call them. Neither T nor Parent can be abstract. |
| type T (<>) is abstract new Parent with private; | Any type, abstract or concrete, derived from Parent, where Parent is a tagged type, so calls to T's operations can dispatch dynamically. |
| type T (<>) is new Parent with private; | Any concrete type, derived from the tagged type Parent. |
| type T is (<>); | Any discrete type: integer, modular, or enumeration. |
| type T is range <>; | Any signed integer type |
| type T is mod <>; | Any modular type |
| type T is delta <>; | Any (non-decimal) fixed point type |
| type T is delta <> digits <>; | Any decimal fixed point type |
| type T is digits <>; | Any floating point type |
| type T is array (I) of E; | Any array type with index of type I and elements of type E (I and E could be formal parameters as well) |
| type T is access O; | Any access type pointing to objects of type O (O could be a formal parameter as well) |
In the body we can only use the operations predefined for the type category of the formal parameter. That is, the generic specification is a contract between the generic implementor and the client instantiating the generic unit. This is different to the parametric features of other languages, such as C++.
It is possible to further restrict the set of acceptable actual types like so:
| Generic formal type | Acceptable actual types |
| type T (<>) is... | Definite or indefinite types (loosely speaking: types with or without discriminants, but other forms of indefiniteness exist) |
| type T (D : DT) is... | Types with a discriminant of type DT (it is possible to specify several discriminants, too) |
| type T is... | Definite types (loosely speaking types without a discriminant or with a discriminant with default value) |

### Generic formal subprograms

It is possible to pass a subprogram as a parameter to a generic. The generic specifies a generic formal subprogram, complete with parameter list and return type (if the subprogram is a function). The actual must match this parameter profile. It is not necessary that the names of parameters match, though.
Here is the specification of a generic subprogram that takes another subprogram as its parameter:
And here is the body of the generic subprogram; it calls parameter as it would any other subprogram.
This generic function could be used, for example, with matrices, having defined the matrix product.
It is possible to specify a default with "the box" (is <>), like this:
This means that if, at the point of instantiation, a function "*" exists for the actual type, and if it is directly visible, then it will be used by default as the actual subprogram.
One of the main uses is passing needed operators. The following example shows this (follow download links for full example):

### Generic instances of other generic packages

A generic formal can be a package; it must be an instance of a generic package, so that the generic knows the interface exported by the package:
This means that the actual must be an instance of the generic package Q. The box after Q means that we do not care which actual generic parameters were used to create the actual for P. It is possible to specify the exact parameters, or to specify that the defaults must be used, like this:
You can specify one default parameters, none or only some. Defaults are indicated with a box (" => <> "), and you can use " others => <>") to mean "use defaults for all parameters not mentioned". The actual package must, of course, match these constraints.
The generic sees both the public part and the generic parameters of the actual package (Param1 and Param2 in the above example).
This feature allows the programmer to pass arbitrarily complex types as parameters to a generic unit, while retaining complete type safety and encapsulation. (example needed)
It is not possible for a package to list itself as a generic formal, so no generic recursion is possible. The following is illegal:
In fact, this is only a particular case of:
which is also illegal, despite the fact that A is no longer generic.

## Instantiating generics

To instantiate a generic unit, use the keyword new:
Notes of special interest to C++ programmers:
* The generic formal types define completely which types are acceptable as actuals; therefore, the compiler can instantiate generics without looking at the body of the generic.
* Each instance has a name and is different from all other instances. In particular, if a generic package declares a type, and you create two instances of the package, then you will get two different, incompatible types, even if the actual parameters are the same.
* Ada requires that all instantiations be explicit.
* It is not possible to create special-case instances of a generic (known as "template specialisation" in C++).
As a consequence of the above, Ada does not permit template metaprogramming. However, this design has significant advantages:
* the object code can be shared by all instances of a generic, unless of course the programmer has requested that subprograms be inlined; there is no danger of code bloat.
* when reading programs written by other people, there are no hidden instantiations, and no special cases to worry about. Ada follows the Law of Least Astonishment.

## Advanced generics
### Generics and nesting

A generic unit can be nested inside another unit, which itself may be generic. Even though no special rules apply (just the normal rules about generics and the rules about nested units), novices may be confused. It is important to understand the difference between a generic unit and instances of a generic unit.
Example 1. A generic subprogram nested in a nongeneric package.
To use Apply_To_All, you first define the procedure to be applied to each String in the Bag. Then, you instantiate Apply_To_All, and finally you call the instance.
Example 2. A generic subprogram nested in a generic package
This is the same as above, except that now the Bag itself is generic:
As you can see, the generic formal subprogram Operator takes a parameter of the generic formal type Element_Type. This is okay: the nested generic sees everything that is in its enclosing unit.
You cannot instantiate Generic_Bag.Apply_To_All directly, so you must first create an instance of Generic_Bag, say Bag_Of_Strings, and then instantiate Bag_Of_Strings.Apply_To_All.

### Generics and child units

Example 3. A generic unit that is a child of a nongeneric unit.
Each instance of the generic child is a child of the parent unit, and so it can see the parent's public and private parts.
The differences between this and Example 1 are:
* Bag_Of_Strings.Apply_To_All is compiled separately. In particular, Bag_Of_Strings.Apply_To_All might have been written by a different person who did not have access to the source text of Bag_Of_Strings.
* Before you can use Bag_Of_Strings.Apply_To_All, you must with it explicitly; withing the parent, Bag_Of_Strings, is not sufficient.
* If you do not use Bag_Of_Strings.Apply_To_All, your program does not contain its object code.
* Because Bag_Of_Strings.Apply_To_All is at the library level, it can declare controlled types; the nested package could not do that in Ada 95. In Ada 2005, one can declare controlled types at any level.
Example 4. A generic unit that is a child of a generic unit
This is the same as Example 3, except that now the Bag is generic, too.
Example 5. A parameterless generic child unit
Children of a generic unit must be generic, no matter what. If you think about it, it is quite logical: a child unit sees the public and private parts of its parent, including the variables declared in the parent. If the parent is generic, which instance should the child see? The answer is that the child must be the child of only one instance of the parent, therefore the child must also be generic.
Suppose we want a child of a Generic_Hash_Map that can serialise the map to disk; for this it needs to sort the map by hash value. This is easy to do, because we know that Hash_Type is a discrete type, and so has a less-than operator. The child unit that does the serialisation does not need any additional generic parameters, but it must be generic nevertheless, so it can see its parent's generic parameters, public and private part.
To read and write a map to disk, you first create an instance of Generic_Hash_Map, for example Map_Of_Unbounded_Strings, and then an instance of Map_Of_Unbounded_Strings.Serializer:

## See also
### Wikibook

* Ada Programming
* Ada Programming/Object Orientation: tagged types provides other mean of polymorphism in Ada.

### Wikipedia

* Generic programming

### Ada Reference Manual

* Section 12: Generic Units

# Tasking
## Tasks

A task unit is a program unit that is obeyed concurrently with the rest of an Ada program. The corresponding activity, a new locus of control, is called a task in Ada terminology, and is similar to a thread, for example in Java Threads. The execution of the main program is also a task, the anonymous environment task. A task unit has both a declaration and a body, which is mandatory. A task body may be compiled separately as a subunit, but a task may not be a library unit, nor may it be generic. Every task depends on a master, which is the immediately surrounding declarative region - a block, a subprogram, another task, or a package. The execution of a master does not complete until all its dependent tasks have terminated. The environment task is the master of all other tasks; it terminates only when all other tasks have terminated.
Task units are similar to packages in that a task declaration defines entities exported from the task, whereas its body contains local declarations and statements of the task.
A single task is declared as follows:
A task declaration can be simplified, if nothing is exported, thus:
Ex. 1
It is possible to declare task types, thus allowing task units to be created dynamically, and incorporated in data structures:
Task types are limited, i.e. they are restricted in the same way as limited types, so assignment and comparison are not allowed.

### Rendezvous

The only entities that a task may export are entries. An entry looks much like a procedure. It has an identifier and may have in, out or in out parameters. Ada supports communication from task to task by means of the entry call. Information passes between tasks through the actual parameters of the entry call. We can encapsulate data structures within tasks and operate on them by means of entry calls, in a way analogous to the use of packages for encapsulating variables. The main difference is that an entry is executed by the called task, not the calling task, which is suspended until the call completes. If the called task is not ready to service a call on an entry, the calling task waits in a (FIFO) queue associated with the entry. This interaction between calling task and called task is known as a rendezvous. The calling task requests rendezvous with a specific named task by calling one of its entries. A task accepts rendezvous with any caller of a specific entry by executing an accept statement for the entry. If no caller is waiting, it is held up. Thus entry call and accept statement behave symmetrically. (To be honest, optimized object code may reduce the number of context switches below the number implied by this poor description.)
There is, however, a big difference between a procedure and an entry. A procedure has exactly one body that is executed when called. There is no such relation between an entry and a corresponding accept statement. An entry may have more than one accept statement, and the code executed may be different each time. In fact, there even need not be an accept statement at all. (Calling such an entry leads to deadlock of the caller if not timed, of course.)
Ex. 2 The following task type implements a single-slot buffer, i.e. an encapsulated variable that can have values inserted and removed in strict alternation. Note that the buffer task has no need of state variables to implement the buffer protocol: the alternation of insertion and removal operations is directly enforced by the control structure in the body of Encapsulated_Buffer_Task_Type which is, as is typical, a loop.

### Selective Wait

To avoid being held up when it could be doing productive work, a server task often needs the freedom to accept a call on any one of a number of alternative entries. It does this by means of the selective wait statement, which allows a task to wait for a call on any of two or more entries.
If only one of the alternatives in a selective wait statement has a pending entry call, then that one is accepted. If two or more alternatives have calls pending, the implementation is free to accept any one of them. For example, it could choose one at random. This introduces bounded non-determinism into the program. A sound Ada program should not depend on a particular method being used to choose between pending entry calls. (However, there are facilities to influence the method used, when that is necessary.)
Ex. 3
creates two variables of type Encapsulated_Variable_Task_Type. They can be used thus:
Again, note that the control structure of the body ensures that an Encapsulated_Variable_Task_Type must be given an initial value by a first Store operation before any Fetch operation can be accepted.

### Guards

Depending on circumstances, a server task may not be able to accept calls for some of the entries that have accept alternatives in a selective wait statement. The acceptance of any alternative can be made conditional by using a guard, which is Boolean precondition for acceptance. This makes it easy to write monitor-like server tasks, with no need for an explicit signaling mechanism, nor for mutual exclusion. An alternative with a True guard is said to be open. It is an error if no alternative is open when the selective wait statement is executed, and this raises the Program_Error exception.
Ex. 4

## Protected types

Tasks allow for encapsulation and safe usage of variable data without the need for any explicit mutual exclusion and signaling mechanisms. Ex. 4 shows how easy it is to write server tasks that safely manage locally-declared data on behalf of multiple clients. There is no need for mutual exclusion of access to the managed data, because it is never accessed concurrently. However, the overhead of creating a task merely to serve up some data may be excessive. For such applications, Ada 95 provides protected modules, based on the well-known computer science concept of a monitor. A protected module encapsulates a data structure and exports subprograms that operate on it under automatic mutual exclusion. It also provides automatic, implicit signaling of conditions between client tasks. Again, a protected module can be either a single protected object or a protected type, allowing many protected objects to be created.
A protected module can export only procedures, functions and entries, and its body may contain only the bodies of procedures, functions and entries. The protected data is declared after private in its specification, but is accessible only within the protected module's body. Protected procedures and entries may read and/or write its encapsulated data, and automatically exclude each other. Protected functions may only read the encapsulated data, so that multiple protected function calls can be concurrently executed in the same protected object, with complete safety; but protected procedure calls and entry calls exclude protected function calls, and vice versa. Exported entries and subprograms of a protected object are executed by its calling task, as a protected object has no independent locus of control. (To be honest, optimized object code may reduce the number of context switches below the number implied by this naive description.)
Similar to a task entry which optionally has a guard, a protected entry must have a barrier to control admission. This provides automatic signaling, and ensures that when a protected entry call is accepted, its barrier condition is True, so that a barrier provides a reliable precondition for the entry body. A barrier can statically be true, then the entry is always open.
Ex. 5 The following is a simple protected type analogous to the Encapsulated_Buffer task in Ex. 2.
Note how the barriers, using the state variable Empty, ensure that messages are alternately inserted and removed, and that no attempt can be made to take data from an empty buffer. All this is achieved without explicit signaling or mutual exclusion constructs, whether in the calling task or in the protected type itself.
The notation for calling a protected entry or procedure is exactly the same as that for calling a task entry. This makes it easy to replace one implementation of the abstract type by the other, the calling code being unaffected.
Ex. 6 The following task type implements Dijkstra's semaphore ADT, with FIFO scheduling of resumed processes. The algorithm will accept calls to both Wait and Signal, so long as the semaphore invariant would not be violated. When that circumstance approaches, calls to Wait are ignored for the time being.
This task could be used as follows:
Alternatively, semaphore functionality can be provided by a protected object, with major efficiency gains.
Ex. 7 The Initialize and Signal operations of this protected type are unconditional, so they are implemented as protected procedures, but the Wait operation must be guarded and is therefore implemented as an entry.
Unlike the task type above, this does not ensure that Initialize is called before Wait or Signal, and Count is given a default initial value instead. Restoring this defensive feature of the task version is left as an exercise for the reader.

## Entry families

Sometimes we need a group of related entries. Entry families, indexed by a discrete type, meet this need.
Ex. 8 This task provides a pool of several buffers.
Note that the busy wait else null is necessary here to prevent the task from being suspended on some buffer when there was no call pending for it, because such suspension would delay serving requests for all the other buffers (perhaps indefinitely).

## Termination

Server tasks often contain infinite loops to allow them to service an arbitrary number of calls in succession. But control cannot leave a task's master until the task terminates, so we need a way for a server to know when it should terminate. This is done by a terminate alternative in a selective wait.
Ex. 9
The task terminates when:
* at least one terminate alternative is open, and
* there are no pending calls to its entries, and
* all other tasks of the same master are in the same state (or already terminated), and
* the task's master has completed (i.e. has run out of statements to execute).
Conditions (1) and (2) ensure that the task is in a fit state to stop. Conditions (3) and (4) ensure that stopping cannot have an adverse effect on the rest of the program, because no further calls that might change its state are possible.

## Timeout

A task may need to avoid being held up by calling to a slow server. A timed entry call lets a client specify a maximum delay before achieving rendezvous, failing which the attempted entry call is withdrawn and an alternative sequence of statements is executed.
Ex. 10
To time out the functionality provided by a task, two distinct entries are needed: one to pass in arguments, and one to collect the result. Timing out on rendezvous with the latter achieves the desired effect.
Ex. 11
Symmetrically, a delay alternative in a selective wait statement allows a server task to withdraw an offer to accept calls after a maximum delay in achieving rendezvous with any client.
Ex. 12

## Conditional entry calls

An entry call can be made conditional, so that it is withdrawn if the rendezvous is not immediately achieved. This uses the select statement notation with an else part. Thus the constructs
and
seem to be conceptually equivalent. However, the attempt to start the rendezvous may take some time, especially if the callee is on another processor, so the delay 0.0; may expire although the callee would be able to accept the rendezvous, whereas the else construct is safe.

## Requeue statements

A requeue statement allows an accept statement or entry body to be completed while redirecting it to a different or the same entry queue, even to one of another task. The called entry has to share the same parameter list or be parameter-less. The caller of the original entry is not aware of the requeue and the entry call continues although now to possibly another entry of another task.
The requeue statement should normally be used to quickly check some precondition for the work proper. If these are fulfilled, the work proper is delegated to another task, hence the caller should nearly immediately be requeued.
Thus requeuing may have an effect on timed entry calls. To be a bit more specific, say the timed entry call is to T1.E1, the requeue within T1.E1 to T2.E2:
Let Delta_T be the timeout of the timed entry call to T1.E1. There are now several possibilities:
1. Delta_T expires before T1.E1 is accepted.
    The entry call is aborted, i.e. taken out of the queue.
2. Delta_T expires after T1.E1 is accepted.
    T1.E1 has finished (its check of preconditions) and T2.E2 is to be accepted.
    For the caller, who is unaware of the requeue, the entry call is still executing; it is completed only with the completion T2.E2.
Thus, although the original entry call may be postponed for a long time while T2.E2 is waiting to be accepted, the call is executing from the caller's point of view.
To avoid this behaviour, a call may be requeued with abort. This changes case 2 above:
2.a The call is requeued to T2.E2 before Delta_T expires.
    2.a.1. T2.E2 is accepted before expiration, the call continues until T2.E2 is completed.
    2.a.2. Delta_T expires before T2.E2 is accepted: The entry call is aborted, i.e. taken out of the queue of T2.E2.
2.b The call is requeued to T2.E2 after the expiration of Delta_T.
    2.b.1. T2.E2 is immediately available (i.e. there is no requeue), T2.E2 continues to completion.
    2.b.2. T2.E2 is queued: The entry call is aborted, i.e. taken out of the queue of T2.E2.
In short, for a requeue with abort, the entry call to T1.E1 is completed in cases 1, 2.a.1 and 2.b.1; it is aborted in 2.a.2 and 2.b.2.
So what is the difference between these three entries?
E1 has just been discussed. After the requeue, its enclosing task is free for other work, while the caller is still suspended until its call is completed or aborted.
E2 also delegates, however via an entry call. Thus E2 completes only with the completion of T2.E2.
E3 first frees the caller, then delegates to T2.E2, i.e. the entry call is completed with E3.

## Scheduling

FIFO, priority, priority inversion avoidance, ... to be completed.

## Interfaces and polymorphism

This language feature is only available from Ada 2005 on.
Tasks and protected types can also implement interfaces.
To allow delegation necessary to the polymorphism, the interface Printable shall be defined in its own package. It is then possible to define different task type implementing the Printable interface and use these implemetations polymorphically:
This feature is also called synchronized interfaces.

## Restrictions and Profiles

Ada tasking has too many features for some applications. Therefore there exist restrictions and profiles for certain, mostly safety or security critical applications. Restrictions and profiles are defined via pragmas. A restriction forbids the use of certain features, for instance the restriction No_Abort_Statements forbids the use of the abort statement. A profile (do not confuse with parameter profiles for subprograms) combines a set of restrictions.
See 13.12: Pragma Restrictions and Pragma Profile

## See also
### Wikibook

* Ada Programming
* Ada Programming/Libraries/Ada.Storage IO
* Ada Programming/Libraries/Ada.Task_Identification
* Ada Programming/Libraries/Ada.Task_Attributes

### Ada Reference Manual
#### Ada 95

* Section 9: Tasks and Synchronization

#### Ada 2005

* 3.9.4: Interface Types
* Section 9: Tasks and Synchronization

## Ada Quality and Style Guide

* Chapter 4: Program Structure
** 4.1.9 Tasks
** 4.1.10 Protected Types
* Chapter 6: Concurrency

# Object Orientation
## Object orientation in Ada

Object oriented programming consists in building the software in terms of "objects". An "object" contains data and has a behavior. The data, normally, consists in constants and variables as seen in the rest of this book but could also, conceivably, reside outside the program entirely, i.e. on disk or on the network. The behavior consists in subprograms that operate on the data. What makes Object Orientation unique, compared to procedural programming, is not a single feature but the combination of several features:
* encapsulation, i.e. the ability to separate the implementation of an object from its interface; this in turn separates "clients" of the object, who can only use the object in certain predefined ways, from the internals of the object, which have no knowledge of the outside clients.
* inheritance, the ability for one type of objects to inherit the data and behavior (subprograms) of another, without necessarily needing to break encapsulation;
* type extension, the ability for an object to add new data components and new subprograms on top of the inherited ones and to replace some inherited subprograms with its own versions; this is called overriding.
* polymorphism, the ability for a "client" to use the services of an object without knowing the exact type of the object, i.e. in an abstract way. Indeed at run time, the actual objects can have different types from one invocation to the next.
It is possible to do object-oriented programming in any language, even assembly. However, type extension and polymorphism are very difficult to get right without language support.
In Ada, each of these concepts has a matching construct; this is why Ada supports object-oriented programming directly.
* Packages provide encapsulation;
* Derived types provide inheritance;
* Record extensions, described below, provide for type extension;
* Class-wide types, also described below, provide for polymorphism.
Ada has had encapsulation and derived types since the first version (MIL-STD-1815 in 1980), which led some to qualify the language as "object-oriented" in a very narrow sense. Record extensions and class-wide types were added in Ada 95. Ada 2005 further adds interfaces. The rest of this chapter covers these aspects.

### The simplest object: the Singleton

The Directory is an object consisting of data (the telephone numbers and addresses, presumably held in an external file or database) and behavior (it can look an entry up and traverse all the entries matching a Name_Pattern, calling Visit on each).
A simple package provides for encapsulation (the inner workings of the directory are hidden) and a pair of subprograms provide the behavior.
This pattern is appropriate when only one object of a certain type must exist; there is, therefore, no need for type extension or polymorphism.

### Primitive operations

In Ada, methods are usually referred to by the technical term primitive subprograms of a tagged type or the equivalent term primitive operations of a tagged type. The primitive operations of a type are those that are always available wherever the type is used. For the tagged types that are used in object oriented programming, they also can be inherited by and overridden by derived types, and can be dynamically dispatched.
Primitive operations of a type need to be declared immediately within the same package as the type (not within a nested package nor a child package). For tagged types, new primitive operations and overrides of inherited primitive operations are further required to be declared before the freezing point of the type. Any subprograms declared after the freezing point will not be considered primitive, and therefore cannot be inherited and are not dynamically dispatched. Freezing points are discussed in more detail below, but the simple practice of declaring all primitive operations immediately following the initial type declaration will ensure that those subprograms are indeed recognized as primitive.
Primitive operations of type T need to have at least one parameter of type T or of type access T. While most object-oriented languages automatically provide a this or self pointer, Ada requires that you explicitly declare a formal parameter to receive the current object. That typically will be the first parameter in the list, which enables the object.subprogram call syntax (available since Ada 2005), but it may be at any parameter position. Tagged types are always passed by reference; the parameter passing method has nothing to do with the parameter modes in and out, which describe the dataflow. The parameter passing method is identical for T and access T.
For tagged types, no other directly dispatchable types can be used in the parameter list because Ada doesn't offer multiple dispatching. The following example is illegal.
When additional dispatchable objects need to be passed in, the parameter list should declare them using their class-wide types, T'Class. For example:
Note, however, that this does not limit the number of parameters of the same tagged type. For example, the following definition is legal.
Primitive operations of tagged types are dispatching operations. Whether a call to such a primitive operation is in effect dispatching or statically bound, depends on the context (see below). Note that in a dispatching call both actual parameters of the last example must have the same tag (i.e. the same type); Constraint_Error will be called if the tag check fails.

### Derived types

Type derivation has been part of Ada since the very start.
The above example creates a type T that contains data (here just a Boolean but it could be anything) and behavior consisting of some subprograms. It also demonstrates encapsulation by placing the details of the type T in the private part of the package.
The primitive operations of T are the function Create, the overloaded procedures Work, and the predefined "=" operator; Proc is not primitive, since it has an access type on T as parameter — don't confuse this with an access parameter, as used in the second procedure Work. When deriving from T, the primitive operations are inherited.
The type Q.Derived has the same data and the same behavior as P.T; it inherits both the data and the subprograms. Thus it is possible to write:
Inherited operations may be overridden and new operations added, but the rules (Ada 83) unfortunaltely are somewhat different from the rules for tagged types (Ada 95).
Admittedly, the reasons for writing this may seem obscure. The purpose of this kind of code is to have objects of types P.T and Q.Derived, which are not compatible:
This feature is not used very often (it's used e.g. for declaring types reflecting physical dimensions) but I present it here to introduce the next step: type extension.

### Type extensions

Type extensions are an Ada 95 amendment.
A tagged type provides support for dynamic polymorphism and type extension. A tagged type bears a hidden tag that identifies the type at run-time. Apart from the tag, a tagged record is like any other record, so it can contain arbitrary data.
As you can see, a Person.Object is an object in the sense that it has data and behavior (the procedure Put). However, this object does not hide its data; any program unit that has a with Person clause can read and write the data in a Person.Object directly. This breaks encapsulation and also illustrates that Ada completely separates the concepts of encapsulation and type. Here is a version of Person.Object that encapsulates its data:
Because the type Person.Object is tagged, it is possible to create a record extension, which is a derived type with additional data.
The type Programmer.Object inherits the data and behavior, i.e. the type's primitive operations, from Person.Object; it is thus possible to write:
So the declaration of the type Programmer.Object, as a record extension of Person.Object, implicitly declares a procedure Put that applies to a Programmer.Object.
Like in the case of untagged types, objects of type Person and Programmer are convertible. However, where untagged objects are convertible in either direction, conversion of tagged types only works in the direction to the root. (Conversion away from the root would have to add components out of the blue.) Such a conversion is called a view conversion, because components are not lost, they only become invisible.
Extension aggregates have to be used if you go away from the root.

### Overriding

Now that we have introduced tagged types, record extensions and primitive operations, it becomes possible to understand overriding. In the examples above, we introduced a type Person.Object with a primitive operation called Put. Here is the body of the package:
As you can see, this simple operation prints both data components of the record type to standard output. Now, remember that the record extension Programmer.Object has an additional data member. If we write:
then the program will call the inherited primitive operation Put, which will print the name and gender but not the additional data. In order to provide this extra behavior, we must override the inherited procedure Put like this:
Programmer.Put overrides Person.Put; in other words it replaces it completely. Since the intent is to extend the behavior rather than replace it, Programmer.Put calls Person.Put as part of its behavior. It does this by converting its parameter from the type Programmer.Object to its ancestor type Person.Object. This construct is a view conversion; contrary to a normal type conversion, it does not create a new object and does not incur any run-time cost (and indeed, if the operand of such view conversion was actually a variable, the result can be used when an out parameter is required (eg. procedure call)). Of course, it is optional that an overriding operation call its ancestor; there are cases where the intent is indeed to replace, not extend, the inherited behavior.
(Note that also for untagged types, overriding of inherited operations is possible. The reason why it's discussed here is that derivation of untagged types is done rather seldom.)

### Polymorphism, class-wide programming and dynamic dispatching

The full power of object orientation is realized by polymorphism, class-wide programming and dynamic dispatching, which are different words for the same, single concept. To explain this concept, let us extend the example from the previous sections, where we declared a base tagged type Person.Object with a primitive operation Put and a record extension Programmer.Object with additional data and an overriding primitive operation Put.
Now, let us imagine a collection of persons. In the collection, some of the persons are programmers. We want to traverse the collection and call Put on each person. When the person under consideration is a programmer, we want to call Programmer.Put; when the person is not a programmer, we want to call Person.Put. This, in essence, is polymorphism, class-wide programming and dynamic dispatching.
With Ada's strong typing, ordinary calls cannot be dynamically dispatched; a call to an operation on a declared type must always be statically bound to go to the operation defined for that specific type. Dynamic dispatching (known as simply dispatching in Ada parlance) is provided through separate class-wide types that are polymorphic. Each tagged type, such as Person.Object, has a corresponding class of types which is the set of types comprising the type Person.Object itself and all types that extend Person.Object. In our example, this class consists of two types:
* Person.Object
* Programmer.Object
Ada 95 defines the Person.Object'Class attribute to denote the corresponding class-wide type. In other words:
The declaration of Someone denotes an object that may be of either type, Person.Object or Programmer.Object. Consequently, the call to the primitive operation Put dispatches dynamically to either Person.Put or Programmer.Put.
The only problem is that, since we don't know whether Someone is a programmer or not, we don't know how many data components Someone has, either, and therefore we don't know how many bytes Someone takes in memory. For this reason, the class-wide type Person.Object'Class is indefinite. It is impossible to declare an object of this type without giving some constraint. It is, however, possible to:
* declare an object of a class-wide with an initial value (as above). The object is then constrained by its initial value.
* declare an access value to such an object (because the access value has a known size);
* pass objects of a class-wide type as parameters to subprograms
* assign an object of a specific type (in particular, the result of a function call) to a variable of a class-wide type.
With this knowledge, we can now build a polymorphic collection of persons; in this example we will quite simply create an array of access values to persons:
The above procedure achieves our desired goal: it traverses the array of Persons and calls the procedure Put that is appropriate for each person.

#### Advanced topic: How dynamic dispatching works

You don't need to know how dynamic dispatching works in order to use it effectively but, in case you are curious, here is an explanation.
The first component of each object in memory is the tag; this is why objects are of a tagged type rather than plain records. The tag really is an access value to a table; there is one table for each specific type. The table contains access values to each primitive operation of the type. In our example, since there are two types Person.Object and Programmer.Object, there are two tables, each containing a single access value. The table for Person.Object contains an access value to Person.Put and the table for Programmer.Object contains an access value to Programmer.Put. When you compile your program, the compiler constructs both tables and places them in the program executable code.
Each time the program creates a new object of a specific type, it automatically sets its tag to point to the appropriate table.
Each time the program performs a dispatching call of a primitive operation, the compiler inserts object code that:
* dereferences the tag to find the table of primitive operations for the specific type of the object at hand
* dereferences the access value to the primitive operation
* calls the primitive operation.
Conversely, when the program performs a call where the parameter is a view conversion to an ancestor type, the compiler performs these two dereferences at compile time rather than run time: such a call is statically bound; the compiler emits code that directly calls the primitive operation of the ancestor type specified in the view conversion.

#### Redispatching

Dispatching is controlled by the (hidden) tag of the object. So what happens when a primitive operation Op1 calls another primitive operation Op2 on the same object?
In this fragment, Op1 is not overridden, whereas Op2 is overridden. The body of Op1 calls Op2, so which Op2 will be called if Op1 is called for an object of type Derived?
The basic rules of dispatching still apply. Calls to Op2 will be dispatched when called using an object of a class-wide type.
The formal parameter lists for the operations specify the type of This to be a specific type, not class-wide. In fact, that parameter must be a specific type so that the operation will be dispatched for objects of that type, and to allow the operation's code to access any additional data items associated with that type. If you want redispatching, you must state that explicitly by converting the parameter of the specific type to the class-wide type again. (Remember: view conversions never lose components, they just hide them. A conversion to a class-wide type can unhide them again.) The first call Op1 (D) (statically bound, i.e., not dispatching) executes the inherited Op1 — and within Op1, the first call to Op2 is also statically bound (there is no redispatching) because parameter This is a view conversion to specific type Root. However, the second call is dispatching because the parameter This is converted to the class-wide type. That call dispatches to the overriding Op2.
Because the conventional This.Op2 call is not dispatching, the call will be to Root.Op2 even though the object itself is of type Derived and the Op2 operation is overridden. This is very different from how other OO languages behave. In other OO languages, a method is either dispatching or not. In Ada, an operation is either available for dispatching or not. Whether or not dispatching is actually used for a given call depends on the way that the object's type is specified at that call point. For programmers accustomed to other OO languages, it can come as quite a surprise that calls from a dispatchable operation to other operations on the same object are, by default, not (dynamically) dispatched.
The default of not redispatching is not an issue if all of the operations have been overridden, because they all will be operating on the expected type of object. However, it has ramifications when writing code for types that might be extended by another type sometime in the future. It's possible that the new type will not work as intended if it doesn't override all of the primitive operations that call other primitive operations. The safest policy is to use a class-wide conversion of the object to force dispatching of calls. One way to accomplish that is to define a class-wide constant in each dispatched method:
This is needed to access data items and to make any non-dispatching calls. This_Class is needed to make dispatching calls.
Less commonly encountered and perhaps less surprising, calls from a non-dispatchable (class-wide) routine for a tagged type to other routines on the same object are, by default, dispatched:
Note that calls on Op1 are always static, since Op1 is not inherited. Its parameter type is class-wide, so the operation is applicable to all types derived from Root. (Op2 has an entry for each type derived from Root in the dispatch table. There is no such dispatch table for Op1; rather there is only one such operation for all types in the class.)
Normal calls from Op1 are dispatched because the declared type of This is class-wide. The default to dispatching usually isn't bothersome because class-wide operations are typically used to perform a script involving calls to one or more dispatched operations.

#### Run-time type identification

Run-time type identification allows the program to (indirectly or directly) query the tag of an object at run time to determine which type the object belongs to. This feature, obviously, makes sense only in the context of polymorphism and dynamic dispatching, so works only on tagged types.
You can determine whether an object belongs to a certain class of types, or to a specific type, by means of the membership test in, like this:
Thanks to the strong typing rules of Ada, run-time type identification is in fact rarely needed; the distinction between class-wide and specific types usually allows the programmer to ensure objects are of the appropriate type without resorting to this feature.
Additionally, the reference manual defines package Ada.Tags (RM 3.9(6/2)), attribute 'Tag (RM 3.9(16,18)), and function Ada.Tags.Generic_Dispatching_Constructor (RM 3.9(18.2/2)), which enable direct manipulation with tags.

### Creating Objects

The Language Reference Manual's section on 3.3: Objects and Named Numbers states when an object is created, and destroyed again. This subsection illustrates how objects are created.
The LRM section starts,
For example, assume a typical hierarchy of object oriented types: a top-level type Person, a Programmer type derived from Person, and possibly more kinds of persons. Each person has a name; assume Person objects to have a Name component. Likewise, each Person has a Gender component. The Programmer type inherits the components and the operations of the Person type, so Programmer objects have a Name and a Gender component, too. Programmer objects may have additional components specific to programmers.
Objects of a tagged type are created the same way as objects of any type. The second LRM sentence says, for example, that an object will be created when you declare a variable or a constant of a type. For the tagged type Person,
Nothing special so far. Just like any ordinary variable declaration this O-O one is elaborated. The result of elaboration is an object named P of type Person. However, P has only default name and gender value components. These are likely not useful ones. One way of giving initial values to the object's components is to assign an aggregate.
The parenthesized expression after := is called an aggregate (4.3: Aggregates).
Another way to create an object that is mentioned in the LRM paragraph is to call a function. An object will be created as the return value of a function call. Therefore, instead of using an aggregate of initial values, we might call a function returning an object.
Introducing proper O-O information hiding, we change the package containing the Person type so that Person becomes a private type. To enable clients of the package to construct Person objects we declare a function that returns them. (The function may do some interesting construction work on the objects. For instance, the aggregate above will most probably raise the exception Constraint_Error depending on the name string supplied; the function can mangle the name so that it matches the declaration of the component.) We also declare a function that returns the name of Person objects.
Calling the Make function results in an object which can be used for initialization. Since the Person type is private we can no longer refer to the Name component of P. But there is a corresponding function Name declared with type Person making it a socalled primitive operation. (The component and the function in this example are both named Name However, we can choose a different name for either if we want.)
Objects can be copied into another. The target object is first destroyed. Then the component values of the source object are assigned to the corresponding components of the target object. In the following example, the default initialized P gets a copy of one of the objects created by the Make calls.
So far, there is no mention of the Programmer type derived from Person. There is no polymorphism yet, and likewise initialization does not yet mention inheritance. Before dealing with Programmer objects and their initialization a few words about class-wide types are in order.

### More details on primitive operations

Remember what we said before about "Primitive Operations". Primitive operations are:
* subprograms taking a parameter of the tagged type;
* functions returning an object of the tagged type;
* subprograms taking a parameter of an anonymous access type to the tagged type;
* In Ada 2005 only, functions returning an anonymous access type to the tagged type;
Additionally, primitive operations must be declared before the type is frozen (the concept of freezing will be explained later):
Examples:
All of these subprograms are primitive operations.
A primitive operation can also take parameters of the same or other types; also, the controlling operand does not have to be the first parameter:
The definition of primitive operations specifically excludes named access types and class-wide types as well as operations not defined immediately in the same declarative region. Counter-examples:

#### Advanced topic: Freezing rules

Freezing rules (ARM 13.14) are perhaps the most complex part of the Ada language definition; this is because the standard tries to describe freezing as unambiguously as possible. Also, that part of the language definition deals with freezing of all entities, including complicated situations like generics and objects reached by dereferencing access values. You can, however, get an intuitive understanding of freezing of tagged types if you understand how dynamic dispatching works. In that section, we saw that the compiler emits a table of primitive operations for each tagged type. The point in the program text where this happens is the point where the tagged type is frozen, i.e. the point where the table becomes complete. After the type is frozen, no more primitive operations can be added to it.
This point is the earliest of:
* the end of the package spec where the tagged type is declared
* the appearance of the first type derived from the tagged type
Example:
Intuitively: at the point where Derived is declared, the compiler starts a new table of primitive operations for the derived type. This new table, initially, is equal to the table of the primitive operations of the parent type, Object. Hence, Object must freeze.
* the declaration of a variable of the tagged type
Example:
Intuitively: after the declaration of V, it is possible to call any of the primitive operations of the type on V. Therefore, the list of primitive operations must be known and complete, i.e. frozen.
* The completion (not the declaration, if any) of a constant of the tagged type:

### New features of Ada 2005

This language feature is only available from Ada 2005 on.
Ada 2005 adds overriding indicators, allows anonymous access types in more places and offers the object.method notation.

#### Overriding indicators

The new keyword overriding can be used to indicate whether an operation overrides an inherited subprogram or not. Its use is optional because of upward-compatibility with Ada 95. For example:
The compiler will check the desired behaviour.
This is a good programming practice because it avoids some nasty bugs like not overriding an inherited subprogram because the programmer spelt the identifier incorrectly, or because a new parameter is added later in the parent type.
It can also be used with abstract operations, with renamings, or when instantiating a generic subprogram:

#### Object.Method notation

We have already seen this notation:
This notation is only available for primitive operations where the controlling parameter is the first parameter.

### Abstract types

A tagged type can also be abstract (and thus can have abstract operations):
An abstract operation cannot have any body, so derived types are forced to override it (unless those derived types are also abstract). See next section about interfaces for more information about this.
The difference with a non-abstract tagged type is that you cannot declare any variable of this type. However, you can declare an access to it, and use it as a parameter of a class-wide operation.

### Multiple Inheritance via Interfaces

This language feature is only available from Ada 2005 on.
Interfaces allow for a limited form of multiple inheritance (taken from Java). On a semantic level they are similar to an "abstract tagged null record" as they may have primitive operations but cannot hold any data and thus these operations cannot have a body, they are either declared abstract or null. Abstract means the operation has to be overridden, null means the default implementation is a null body, i.e. one that does nothing.
An interface is declared with:
You implement an interface by adding it to a concrete class:
As usual, all inherited abstract operations must be overridden although null subprograms ones need not.
Such a type may implement a list of interfaces (called the progenitors), but can have only one parent. The parent may be a concrete type or also an interface.

### Multiple Inheritance via Mix-in

Ada supports multiple inheritance of interfaces (see above), but only single inheritance of implementation. This means that a tagged type can implement multiple interfaces but can only extend a single ancestor tagged type.
This can be problematic if you want to add behavior to a type that already extends another type; for example, suppose you have
and you want to make Derived controlled, i.e. add the behavior that Derived controls its initialization, assignment and finalization. Alas you cannot write:
since Ada.Finalization for historical reasons does not define interfaces Controlled and Limited_Controlled, but abstract types.
If your base type is not limited, there is no good solution for this; you have to go back to the root of the class and make it controlled. (The reason will become obvious presently.)
For limited types however, another solutions is the use of a mix-in:
This special kind of mix-in is an object with an access discriminant that references its enclosing object (also known as Rosen trick). In the declaration of the Derived type, we initialize this discriminant with a special syntax: Derived'Access really refers to an access value to the current instance of type Derived. Thus the access discriminant allows the mix-in to see its enclosing object and all its components; therefore it can initialize and finalize its enclosing object:
and similarly for Finalize.
The reason why this does not work for non-limited types is the self-referentiality via the discriminant. Imagine you have two variables of such a non-limited type and assign one to the other:
In an assignment statement, Adjust is called only after Finalize of the target X and so cannot provide the new value of the discriminant. Thus X.Mixin_In.Enclosing will inevitably reference Y.
Now let's further extend our hierarchy:
Oops, this does not work because there are no corresponding procedures for Derived, yet – so let's quickly add them.
We have of course to write not overriding for the procedures on Derived because there is indeed nothing they could override. The bodies are
To our dismay, we have to learn that Initialize/Finalize for objects of type Further will not be called, instead those for the parent Derived. Why?
The reason is that the mix-in defines the local object Enclosing to be of type Derived in the renames-statement above. To cure this, we have necessarily to use the dreaded redispatch (shown in different but equivalent notations):
Alternatively (and presumably better still) is to write
Then we automatically get redispatch and can omit the type conversions on Enclosing.

## Class names

Both the class package and the class record need a name. In theory they may have the same name, but in practice this leads to nasty (because of unintuitive error messages) name clashes when you use the use clause. So over time three de facto naming standards have been commonly used.

### Classes/Class

The package is named by a plural noun and the record is named by the corresponding singular form.
This convention is the usually used in Ada's built-in libraries.
Disadvantage: Some "multiples" are tricky to spell, especially for those of us who aren't native English speakers.

### Class/Object

The package is named after the class, the record is just named Object.
Most UML and IDL code generators use this technique.
Disadvantage: You can't use the use clause on more than one such class packages at any one time. However you can always use the "type" instead of the package.

### Class/Class_Type

The package is named after the class, the record is postfixed with _Type.
Disadvantage: lots of ugly "_Type" postfixes.

## Object-Oriented Ada for C++ programmers

In C++, the construct
is strictly equivalent to the following in Ada:
In C++, member functions implicitly take a parameter this which is of type C*. In Ada, all parameters are explicit. As a consequence, the fact that u does not take a parameter is implicit in C++ but explicit in Ada.
In C++, this is a pointer. In Ada, the explicit This parameter does not have to be a pointer; all parameters of a tagged type are implicitly passed by reference anyway.

### Static dispatching

In C++, function calls dispatch statically in the following cases:
* the target of the call is an object type
* the member function is non-virtual
For example:
both dispatch statically. In particular, the static dispatch for v may be confusing; this is because object is neither a pointer nor a reference. Ada behaves exactly the same in this respect, except that Ada calls this static binding rather than dispatching:

### Dynamic dispatching

In C++, a function call dispatches dynamically if the two following conditions are met simultaneously:
* the target of the call is a pointer or a reference
* the member function is virtual.
For example:
In Ada, a primitive subprogram call dispatches (dynamically) if and only if:
* the target object is of a class-wide type;
Note: In Ada vernacular, the term dispatching always means dynamic.
For example:
As can be seen there is no need for access types or pointers to do dispatching in Ada. In Ada, tagged types are always passed by-reference to subprograms without the need for explicit access values.
Also note that in C++, the class serves as:
* the unit of encapsulation (Ada uses packages and visibility for this)
* the type, like in Ada.
As a consequence, you call C::u in C++ because u is encapsulated in C, but P.U in Ada since U is encapsulated in the package P, not the type C.

### Class-wide and specific types

The most confusing part for C++ programmers is the concept of a "class-wide type". To help you understand:
* pointers and references in C++ are really, implicitly, class-wide;
* object types in C++ are really specific;
* C++ provides no way to declare the equivalent of:
* C++ provides no way to declare the equivalent of:
which, in Ada, are two different, incompatible types, possibly allocating their memory from different storage pools!
* In Ada, you do not need access values for dynamic dispatching.
* In Ada, you use access values for dynamic memory management (only) and class-wide types for dynamic dispatching (only).
* In C++, you use pointers and references both for dynamic memory management and for dynamic dispatching.
* In Ada, class-wide types are explicit (with 'Class).
* In C++, class-wide types are implicit (with * or &).

### Constructors

in C++, a special syntax declares a constructor:
A constructor cannot be virtual. A class can have as many constructors, differentiated by their parameters, as necessary.
Ada does not have such constructors. Perhaps they were not deemed necessary since in Ada, any function that returns an object of the tagged type can serve as a kind of constructor. This is however not the same as a real constructor like the C++ one; this difference is most striking in cases of derivation trees (see Finalization below). The Ada constructor subprograms do not have to have a special name and there can be as many constructors as necessary; each function can take parameters as appropriate.
If an Ada constructor function is also a primitive operation (as in the example above), it becomes abstract upon derivation and has to be overridden if the derived type is not itself abstract. If you do not want this, declare such functions in a nested scope.
In C++, one idiom is the copy constructor and its cousin the assignment operator:
This copy constructor is invoked implicitly on initialization, e.g.
Ada provides a similar functionality by means of controlled types. A controlled type is one that extends the predefined type Ada.Finalization.Controlled:
Note that Initialize is not a constructor; it resembles the C++ constructor in some way, but is also very different. Suppose you have a type T1 derived from T with an appropriate overriding of Initialize. A real constructor (like the C++ one) would automatically first construct the parent components (T), then the child components. In Ada, this is not automatic. In order to mimic this in Ada, we have to write:
The compiler inserts a call to Initialize after each object of type T is allocated when no initial value is given. It also inserts a call to Adjust after each assignment to the object. Thus, the declarations:
will:
* allocate memory for A
* call Initialize (A)
* allocate memory for B
* copy the contents of X to B
* call Adjust (B)
Initialize (B) will not be called because of the explicit initialization.
So, the equivalent of a copy constructor is an overriding of Adjust.
If you would like to provide this functionality to a type that extends another, non-controlled type, see "Multiple Inheritance".

### Destructors

In C++, a destructor is a member function with only the implicit this parameter:
While a constructor cannot be virtual, a destructor must be virtual if the class is to be used with dynamic dispatch (has virtual methods or derives from a class with virtual methods). C++ classes do not use dynamic dispatch by default, so it can catch some programmers out and wreak havoc in their programs by simply forgetting the keyword virtual.
In Ada, the equivalent functionality is again provided by controlled types, by overriding the procedure Finalize:
Because Finalize is a primitive operation, it is automatically "virtual"; you cannot, in Ada, forget to make a destructor virtual.

### Encapsulation: public, private and protected members

In C++, the unit of encapsulation is the class; in Ada, the unit of encapsulation is the package. This has consequences on how an Ada programmer places the various components of an object type.
A way to mimic this C++ class in Ada is to define a hierarchy of types, where the base type is the public part, which must be abstract so that no stand-alone objects of this base type can be defined. It looks like so:
The private part is defined as a stub only, its completion is hidden in the body. In order to make it a component of the complete type, we have to use a pointer since the size of the component is still unknown (the size of a pointer is known to the compiler). With pointers, unfortunately, we incur the danger of memory leaks, so we have to make the private component controlled.
For a little test, this is the body, where the subprogram bodies are provided with identifying prints:
We see that, due to the construction, the private procedure is not a primitive operation.
Let's define a child class so that the protected operation can be reached:
A child can look inside the private part of the parent and thus can see the protected procedure:
This is a simple test program, its output is shown below.
This is the commented output of the test program:
You see that a direct translation of the C++ behaviour into Ada is difficult, if feasible at all. Methinks, the primitive Ada subprograms corresponds more to virtual C++ methods (in the example, they are not). Each language has its own idiosyncrasies which have to be taken into account, so that attempts to directly translate code from one into the other may not be the best approach.

### De-encapsulation: friends and stream input-output

In C++, a friend function or class can see all members of the class it is a friend of. Friends break encapsulation and are therefore to be discouraged. In Ada, since packages and not classes are the unit of encapsulation, a "friend" subprogram is simply one that is declared in the same package as the tagged type.
In C++, stream input and output are the particular case where friends are usually necessary:
Ada does not need this construct because it defines stream input and output operations by default: The default implementation of the Input, Output, Read and Write attributes may be overridden (shown for Write as an example). The overriding must occur before the type is frozen, i.e. (in the case of this example) in the package specification.
By default, the Write attribute sends the components to the stream in the same order as given in the declaration, i.e. A, B then C, so we change the order.
Now P.C'Write calls the overridden version of the package.
Note that the stream IO attributes are not primitive operations of the tagged type; this is also the case in C++ where the friend operators are not, in fact, member functions of the type.

### Terminology

| Ada | C++ |
| Package | class (as a unit of encapsulation) |
| Tagged type | class (of objects) (as a type) (not pointer or reference, which are class-wide) |
| Primitive operation | virtual member function |
| Tag | pointer to the virtual table |
| Class (of types) | a tree of classes, rooted by a base class and including all the (recursively-)derived classes of that base class |
| Class-wide type | - |
| Class-wide operation | static member function |
| Access value to a specific tagged type | - |
| Access value to a class-wide type | pointer or reference to a class |

## See also
### Wikibook

* Ada Programming
* Ada Programming/Types/record
* record
* interface
* tagged

### Wikipedia

* Object-oriented programming

### Ada Reference Manual
#### Ada 95

* 3.8: Record Types
* 3.9: Tagged Types and Type Extensions
* 3.9.1: Type Extensions
* 3.9.2: Dispatching Operations of Tagged Types
* 3.9.3: Abstract Types and Subprograms
* 3.10: Access Types

#### Ada 2005

* 3.8: Record Types
* 3.9: Tagged Types and Type Extensions
* 3.9.1: Type Extensions
* 3.9.2: Dispatching Operations of Tagged Types
* 3.9.3: Abstract Types and Subprograms
* 3.9.4: Interface Types
* 3.10: Access Types

### Ada Quality and Style Guide

* Chapter 9: Object-Oriented Features

# New in Ada 2005

This is an overview of the major features that are available in Ada 2005, the version of the Ada standard that was accepted by ISO in January 2007 (to differentiate it from its predecessors Ada 83 and Ada 95, the informal name Ada 2005 is generally agreed on). For the rationale and a more detailed (and very technical) description, see the Amendment to the Ada Reference Manual following the links to the last version of every Ada Issue document (AI).
Although the standard is now published, not all compilers will be able to handle it. Many of these additions are already implemented by the following Free Software compilers:
* GNAT GPL Edition
* GCC 4.1
* GNAT Pro 6.0.2 (the AdaCore supported version) is a complete implementation.
After downloading and installing any of them, remember to use the -gnat05 switch when compiling Ada 2005 code. Note that Ada 2005 is the default mode in GNAT GPL 2007 Edition.

## Language features
### Character set

Not only does Ada 2005 now support a new 32-bit character type — called Wide_Wide_Character — but the source code itself may be of this extended character set as well. Thus Russians and Indians, for example, will be able to use their native language in identifiers and comments. And mathematicians will rejoice: The whole Greek and fractur character sets are available for identifiers. For example, Ada.Numerics will be extended with a new constant:
This is not a new idea — GNAT always had the -gnatic compiler option to specify the character set . But now this idea has become standard, so all Ada compilers will need to support Unicode 4.0 for identifiers — as the new standard requires.
See also:
* AI95-00285-01 Support for 16-bit and 32-bit characters
* AI95-00388-01 Add Greek pi to Ada.Numerics

### Interfaces

Interfaces allow for a limited form of multiple inheritance similar to Java and C#.
You find a full description here: Ada Programming/OO.
See also:
* AI95-00251-01 Abstract Interfaces to provide multiple inheritance
* AI95-00345-01 Protected and task interfaces

### Union

In addition to Ada's safe variant record an unchecked C style union is now available.
You can find a full description here: Ada Programming/Types/record#Union.
See also:
* AI95-00216-01 Unchecked unions -- variant records with no run-time discriminant
* Annex B.3.3 Pragma Unchecked_Union (Annotated)

### With

The with statement got a massive upgrade. First there is the new limited with which allows two packages to with each other. Then there is private with to make a package only visible inside the private part of the specification.
See also:
* AI95-00217-06 Limited With Clauses
* AI95-00262-01 Access to private units in the private part

### Access types
#### Not null access

An access type definition can specify that the access type can never be null.
See Ada Programming/Types/access#Null exclusions.
See also: AI95-00231-01 Access-to-constant parameters and null-excluding access subtypes

#### Anonymous access

The possible uses of anonymous access types are extended. They are allowed virtually in every type or object definition, including access to subprogram parameters. Anonymous access types may point to constant objects as well. Also, they could be declared to be not null.
With the addition of the following operations in package Standard, it is possible to test the equality of anonymous access types.
See Ada Programming/Types/access#Anonymous access.
See also:
* AI95-00230-01 Generalized use of anonymous access types
* AI95-00385-01 Stand-alone objects of anonymous access types
* AI95-00318-02 Limited and anonymous access return types

## Language library
### Containers

A major addition to the language library is the generic packages for containers. If you are familiar with the C++ STL, you will likely feel very much at home using Ada.Containers. One thing, though: Ada is a block structured language. Many ideas of how to use the STL employ this feature of the language. For example, local subprograms can be supplied to iteration schemes.
The original Ada Issue text AI95-00302-03 Container library has now been transformed into A.18 Containers (Annotated).
If you know how to write Ada programs, and have a need for vectors, lists, sets, or maps (tables), please have a look at the AI95-00302-03 AI Text mentioned above. There is an !example section in the text explaining the use of the containers in some detail. Matthew Heaney provides a number of demonstration programs with his reference implementation of AI-302 (Ada.Containers) which you can find at tigris.
In Ada Programming/Containers you will find a demo using containers.
Historical side note: The C++ STL draws upon the work of David R. Musser and Alexander A. Stepanov. For some of their studies of generic programming, they had been using Ada 83. The Stepanov Papers Collection has a few publications available.

### Scan Filesystem Directories and Environment Variables

See also:
* AI95-00248-01 Directory Operations
* AI95-00370-01 Environment variables

### Numerics

Besides the new constant of package Ada.Numerics (see Character Set above), the most important addition are the packages to operate with vectors and matrices.
See also:
* AI95-00388-01 Add Greek pi (π) to Ada.Numerics
* AI95-00296-01 Vector and matrix operations
(Related note on Ada programming tools: AI-388 contains an interesting assessment of how compiler writers are bound to perpetuate the lack of handling of international characters in programming support tools for now. As an author of Ada programs, be aware that your tools provider or Ada consultant could recommend that the program text be 7bit ASCII only.)

## Real-Time and High Integrity Systems

See also:
* AI95-00297-01 Timing events
* AI95-00307-01 Execution-Time Clocks
* AI95-00354-01 Group execution-time budgets
* AI95-00266-02 Task termination procedure
* AI95-00386-01 Further functions returning Time_Span values

### Ravenscar profile

See also:
* AI95-00249-01 Ravenscar profile for high-integrity systems
* AI95-00305-01 New pragma and additional restriction identifiers for real-time systems
* AI95-00347-01 Title of Annex H
* AI95-00265-01 Partition Elaboration Policy for High-Integrity Systems

### New scheduling policies

See also:
* AI95-00355-01 Priority Specific Dispatching including Round Robin
* AI95-00357-01 Support for Deadlines and Earliest Deadline First Scheduling
* AI95-00298-01 Non-Preemptive Dispatching

### Dynamic priorities for protected objects

See also: AI95-00327-01 Dynamic ceiling priorities

## Summary of what's new
### New keywords

Added 3 keywords (72 total)
* interface
* overriding
* synchronized

### New pragmas

Added 11 pragmas:
* pragma Assert
* pragma Assertion_Policy
* pragma Detect_Blocking
* pragma No_Return
* pragma Partition_Elaboration_Policy
* pragma Preelaborable_Initialization
* pragma Priority_Specific_Dispatching
* pragma Profile
* pragma Relative_Deadline
* pragma Unchecked_Union
* pragma Unsuppress

### New attributes

Added 7 attributes:
* Machine_Rounding
* Mod
* Priority
* Stream_Size
* Wide_Wide_Image
* Wide_Wide_Value
* Wide_Wide_Width

### New packages

* Assertions:
** Ada.Assertions
* Container library:
** Ada.Containers
** Ada.Containers.Vectors
** Ada.Containers.Doubly_Linked_Lists
** Ada.Containers.Generic_Array_Sort (generic procedure)
** Ada.Containers.Generic_Constrained_Array_Sort (generic procedure)
** Ada.Containers.Hashed_Maps
** Ada.Containers.Ordered_Maps
** Ada.Containers.Hashed_Sets
** Ada.Containers.Ordered_Sets
** Ada.Containers.Indefinite_Vectors
** Ada.Containers.Indefinite_Doubly_Linked_Lists
** Ada.Containers.Indefinite_Hashed_Maps
** Ada.Containers.Indefinite_Ordered_Maps
** Ada.Containers.Indefinite_Hashed_Sets
** Ada.Containers.Indefinite_Ordered_Sets
* Vector and matrix manipulation:
** Ada.Numerics.Real_Arrays
** Ada.Numerics.Complex_Arrays
** Ada.Numerics.Generic_Real_Arrays
** Ada.Numerics.Generic_Complex_Arrays
* General OS facilities:
** Ada.Directories
** Ada.Directories.Information
** Ada.Environment_Variables
* String hashing:
** Ada.Strings.Hash (generic function)
** Ada.Strings.Fixed.Hash (generic function)
** Ada.Strings.Bounded.Hash (generic function)
** Ada.Strings.Unbounded.Hash (generic function)
** Ada.Strings.Wide_Hash (generic function)
** Ada.Strings.Wide_Fixed.Wide_Hash (generic function)
** Ada.Strings.Wide_Bounded.Wide_Hash (generic function)
** Ada.Strings.Wide_Unbounded.Wide_Hash (generic function)
** Ada.Strings.Wide_Wide_Hash (generic function)
** Ada.Strings.Wide_Wide_Fixed.Wide_Wide_Hash (generic function)
** Ada.Strings.Wide_Wide_Bounded.Wide_Wide_Hash (generic function)
** Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Hash (generic function)
* Time operations:
** Ada.Calendar.Time_Zones
** Ada.Calendar.Arithmetic
** Ada.Calendar.Formatting
* Tagged types:
** Ada.Tags.Generic_Dispatching_Constructor (generic function)
* Text packages:
** Ada.Complex_Text_IO
** Ada.Text_IO.Bounded_IO
** Ada.Text_IO.Unbounded_IO
** Ada.Wide_Text_IO.Wide_Bounded_IO
** Ada.Wide_Text_IO.Wide_Unbounded_IO
** Ada.Wide_Characters
** Ada.Wide_Wide_Characters
* Wide_Wide_Character packages:
** Ada.Strings.Wide_Wide_Bounded
** Ada.Strings.Wide_Wide_Fixed
** Ada.Strings.Wide_Wide_Maps
** Ada.Strings.Wide_Wide_Maps.Wide_Wide_Constants
** Ada.Strings.Wide_Wide_Unbounded
** Ada.Wide_Wide_Text_IO
** Ada.Wide_Wide_Text_IO.Complex_IO
** Ada.Wide_Wide_Text_IO.Editing
** Ada.Wide_Wide_Text_IO.Text_Streams
** Ada.Wide_Wide_Text_IO.Wide_Wide_Bounded_IO
** Ada.Wide_Wide_Text_IO.Wide_Wide_Unbounded_IO
* Execution-time clocks:
** Ada.Execution_Time
** Ada.Execution_Time.Timers
** Ada.Execution_Time.Group_Budgets
* Dispatching:
** Ada.Dispatching
** Ada.Dispatching.EDF
** Ada.Dispatching.Round_Robin
* Timing events:
** Ada.Real_Time.Timing_Events
* Task termination procedures:
** Ada.Task_Termination

## See also
### Wikibook

* Ada Programming/Ada 83
* Ada Programming/Ada 95
* Ada Programming/Ada 2012
* Ada Programming/Object Orientation
* Ada Programming/Types/access
* Ada Programming/Keywords
* Ada Programming/Keywords/and
* Ada Programming/Keywords/interface
* Ada Programming/Attributes
* Ada Programming/Pragmas
* Ada Programming/Pragmas/Restrictions
* Ada Programming/Libraries/Ada.Containers
* Ada Programming/Libraries/Ada.Directories

### Pages in the category Ada 2005

* Category:Book:Ada Programming/Ada 2005 feature

## External links
### Papers and presentations

* Ada 2005: Putting it all together (SIGAda 2004 presentation)
* GNAT and Ada 2005 (SIGAda 2004 paper)
* An invitation to Ada 2005, and the presentation of this paper at Ada-Europe 2004

### Rationale

* Rationale for Ada 2005 by John Barnes:
** Introduction
** Object Oriented Model
** Access Types
** Structure and Visibility
** Tasking and Real-Time
** Exceptions, Generics, Etc.
** Predefined Library
** Containers
** Epilogue
       References
       Index
Available as a single document for printing.

### Language Requirements

* Instructions to the Ada Rapporteur Group from SC22/WG9 for Preparation of the Amendment to ISO/IEC 8652 (10 October 2002), and a presentation of this document at SIGAda 2002

### Ada Reference Manual

* Ada Reference Manual, ISO/IEC 8652:1995(E) with COR.1:2001 and AMD.1:2007
* Annotated Ada Reference Manual, ISO/IEC 8652:1995(E) with COR.1:2001 and AMD.1:2007 (colored diffs)
* List of Ada Amendment drafts

### Ada Issues

* Amendment 200Y
** AI95-00387-01 Introduction to Amendment
** AI95-00284-02 New reserved words
** AI95-00252-01 Object.Operation notation
** AI95-00218-03 Accidental overloading when overriding
** AI95-00348-01 Null procedures
** AI95-00287-01 Limited aggregates allowed
** AI95-00326-01 Incomplete types
** AI95-00317-01 Partial parameter lists for formal packages
** AI95-00376-01 Interfaces.C works for C++ as well
** AI95-00368-01 Restrictions for obsolescent features
** AI95-00381-01 New Restrictions identifier No_Dependence
** AI95-00224-01 pragma Unsuppress
** AI95-00161-01 Default-initialized objects
** AI95-00361-01 Raise with message
** AI95-00286-01 Assert pragma
** AI95-00328-01 Preinstantiations of Complex_IO
** AI95-00301-01 Operations on language-defined string types
** AI95-00340-01 Mod attribute
** AI95-00364-01 Fixed-point multiply/divide
** AI95-00267-01 Fast float-to-integer conversions
** AI95-00321-01 Definition of dispatching policies
** AI95-00329-01 pragma No_Return -- procedures that never return
** AI95-00362-01 Some predefined packages should be recategorized
** AI95-00351-01 Time operations
** AI95-00427-01 Default parameters and Calendar operations
** AI95-00270-01 Stream item size control

# Containers

Ada Programming/Containers

# Interfacing

Ada Programming/Interfacing

# Coding Standards
## Introduction

Each project should follow a specific coding standard to ease readability and maintenance of the source code, and reduce the insertion of errors. Depending on the requirements of the project, a set of guidelines can help to achieve the desired level of performance, portability, code complexity...
There are many ASIS tools that can be used to check automatically the adherence of Ada source code to the guidelines.

## Tools

* AdaControl (Rules)
* gnatcheck
* GNAT Pretty-Printer
* The GNAT Metric Tool gnatmetric

## Coding guidelines

* Ada Quality & Style Guide: Guidelines for Professional Programmers
* ISO/IEC TR 15942:2000, Guide for the use of the Ada programming language in high integrity systems, First edition (2000-03-01). ISO Freely Available Standards
* Leake, Stephen (2013-10-18). "Goddard Dynamic Simulator — Ada Coding Standard" (PDF). Archived from the original (PDF) on 2014-04-14. Retrieved 2015-08-07.
* ESA BSSC (1998). Ada Coding Standard (PDF) (BSSC(98)3 Issue 1 ed.). Archived from the original (PDF) on 2024. Retrieved 2015-08-06.
* "GNAT Coding Style: A Guide for GNAT Developers". GCC online documentation. Free Software Foundation. Retrieved 2009-01-19. (PDF)

## See also
### Other wikibooks

* Ada Style Guide

### Wikibook

* Ada Programming

### Ada Quality and Style Guide

* Chapter 1: Introduction

## External links

* Introduction to Coding Standards

# Tips

Ada Programming/Tips

# Common Errors

Ada Programming/Errors

# Algorithms

Ada Programming/Algorithms

# Chapter 1

Ada Programming/Algorithms/Chapter 1

# Chapter 6

Ada Programming/Algorithms/Chapter 6

# Knuth-Morris-Pratt pattern matcher

Ada Programming/Algorithms/Knuth-Morris-Pratt pattern matcher

# Binary Search

Algorithm implementation/Search/Binary search

# Function overloading

Ada Programming/Function overloading

# Mathematical calculations

Ada Programming/Mathematical calculations

# Statements

Ada Programming/Statements

# Variables

Ada Programming/Variables

# Lexical elements

Ada Programming/Lexical elements

# Keywords

Ada Programming/Keywords

# Delimiters

Ada Programming/Delimiters

# Operators

Ada Programming/Operators

# Attributes

Ada Programming/Attributes

# Pragmas

Ada Programming/Pragmas

# Libraries

Ada Programming/Libraries

# Libraries: Standard

Ada Programming/Libraries/Standard

# Libraries: Ada

Ada Programming/Libraries/Ada

# Libraries: Interfaces

Ada Programming/Libraries/Interfaces

# Libraries: GNAT

Ada Programming/Libraries/GNAT

# Libraries: Multi-Purpose

Ada Programming/Libraries/MultiPurpose

# Libraries: Container

Ada Programming/Libraries/Container

# Libraries: GUI

Ada Programming/Libraries/GUI

# Libraries: Distributed Systems

Ada Programming/Libraries/Distributed

# Libraries: Databases

Ada Programming/Libraries/Database

# Libraries: Web

Ada Programming/Libraries/Web

# Libraries: Input Output

Ada Programming/Libraries/IO

# Platform Support

Ada Programming/Platform

# Platform: Linux

Ada Programming/Platform/Linux

# Platform: Windows

Ada Programming/Platform/Windows

# Platform: Virtual Machines

Ada Programming/Platform/VM

# Portals

Ada Programming/Portals

# Tutorials

Ada Programming/Tutorials

# Web 2.0

Ada Programming/Web 2.0