Ada type composition demos
This is a collection of code examples demonstrating how to do some non-trivial type composition in Ada language. Ada is a stricktly typed language (for real, not in the sense of merely having types as many other languages claming to be strongly typed too). Correspondingly, Ada has a very rich type system, allowing buidling complex OOP hierarchies, intermixed with generics and some Ada-specific stuff. This project holds a collection of (reasonably) small code examples demonstrating less common or not entirely trivial ways to ties types toghether. This started by trying to add iteration and indexing to an existing type and providing the possibility to overlay Ada.Containers.Vectors.Vector over the existing type. The cleanest way to test the composition was to quickly whip up some small testing code, which exposed some issues and grew bigger than intended. As the resulting code presents the situation that can be usefull in some common cases, this depositary was created to keep this and other similar examples.
Each individual demo is in its own directory with a corresponding Readme providing a specific description.
- list_iface Iterable and indexabe interface that can be overlayed by an existing container type
- list_combo An evolution of list_iface. An iterable and indexable container that stores type hierarchy (and not just a single type).
- mixins A demo of how to mix separate type hierarchies, with some caases supporting inheritance and redispatch on both branches.
- separation A demo of how to separate algorithic part of the project (code-only in interfaces) from data storage and representation (data-storing type hierarchy).
All the code here is under non-restrictive license (basically AS-IS clause with copyright. For the moment this is BSD licence, but this can be changed if some other better license is suggested). It is intended to be copied and modified by anybody if there is any need.