The Ada library contains packages for data structures called containers §A.18. The containers are generic packages that can be instantiated for any nonlimited type. There are separate packages for definite and indefinite types, because indefinite types must be implemented using pointers and thus are less efficient. The container library also includes generic procedures for sorting arrays §A.18.16 (see Section 9.4).
The subprograms in the container packages are required to be reentrant, as are all subprograms in Annex A §A(3). The containers are not “thread-safe,” so subprograms that operate on a single object should not be called from different tasks without additional synchronization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2009). Containers. In: Ben-Ari, M. (eds) Ada for Software Engineers (Second Edition with Ada 2005). Springer, London. https://doi.org/10.1007/978-1-84882-314-3_16
Download citation
DOI: https://doi.org/10.1007/978-1-84882-314-3_16
Publisher Name: Springer, London
Print ISBN: 978-1-84882-313-6
Online ISBN: 978-1-84882-314-3
eBook Packages: Computer ScienceComputer Science (R0)