Abstract
|
Abstract |
|
|||||||||
|
|
|
|
|
|
|
|
||||
| An Abstract Data Type (ADT) associates data and operations. The data representation is hidden. The operations are the means to access the data.
The ADTs presented here implemente classical data structures; all are container classes. Each ADT comes as a generic package; its generic formal parameters model the ADT's component type and required properties. Each ADT has two flavors, to suit both limited and non-limited component types. This distinction is detailed in the introductory paper Rational for the Design of Reusable Abstract Data Types Implemented in Ada . The Booch library [1] offers a similar, but more extensive set of software components. According to Booch's taxonomy, our ADTs are sequential and unbounded, and they have iterators. In addition, either managed or unmanaged behavior is possible, depending on a dynamically adjustable parameter. [1] Booch G.; Software Components with Ada; Benjamin/Cummings, 1987 A simple explanation of the List Component is presented in List Use document. |
 |
EPFL | IC | LGL | Teaching | Ada | LGL Components | ||
 |
|||
| Last modified |
 |
||