Free software is a cornerstone of any modern
free society. We build this foundation.
With your help, we will raise $450,000 this
winter to make this foundation even stronger.
Donate today, and build us up for 2014.
Aapl is a C++ template library for generic programming. It contains Linked List, Avl Tree, Vector, Binary Search Table, Double Ended Queue, and Merge Sort. The library is designed to be versatile for the programmer. For example, the linked list utilizes both inheritance and templates to allow a single instance of a data structure to be an element in multiple lists. In general, Aapl data structures do not have private data members and are thus not abstracted away.
DocumentationUser guide included and available in HTML format from http://www.elude.ca/aapl/doc/
released on 15 May 2005
|License||Verified by||Verified on||Notes|
|GPLv2orlater||Janet Casey||19 March 2002|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 17 May 2005.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.