Aapl is a C + + Template Library for generic programming. AAPL is a C + + Template Library for generic programming. AAPL supports various programming paradigms by providing generic versions of standard data structures. For example, a sub-model linked list of values may be used to store a type provided by the user as a different list integer.A model allows the user to define the data structure to be used as the element. A third list model allows a Single Instance of a data structure for an item in multiple lists. Whenever possible, AAPL data structures do not depend on the allocation of memory heap. There are variations of the linked list and the avl tree that allow the programmer to allocate a collection of elements statically and insert / remove at will. AAPL data structures are not members of their data hidden behind a layer of abstraction strict. AAPL uses very little the keyword private. Although the data abstractions can be a useful programming technique to quickly produce a very robust code, they can inhibit the function when the data structure is the focus of much attention. AAPL leaves therefore the use of abstractions to programmer.What 's New in this version: • A transfer function was added to the lists of duplicate and AVL Trees. Double · remaining list and AVL tree copy constructors and assignment operators have been modified to implement a deep copy, rather than a shallow copy. • All of the copy constructor and assignment operators now implement a deep copy. functions deep and shallow copy · have been deleted.