Aapl C++ Template Library

Description

Aapl is a C++ template library for generic programming. Aapl supports different generic programming paradigms by providing variations of standard data structures. For example, a by-value linked list template may be used to store a user supplied type such as an integer. A different list template allows the user to define the data structure that is to be used as the element. A third list template allows a single instance of a data structure to be an element in multiple lists. Wherever possible, Aapl data structures do not depend on heap memory allocation. There are variations of the linked list and AVL tree that allow the programmer to allocate a collection of elements statically and insert/remove them at will. Aapl data structures do not have their data members hidden behind a strict abstraction layer. Aapl makes very little use of the private keyword. Though data abstractions can be a useful programming technique to quickly produce very robust code, they can inhibit functionality when the data structure is the centre of much attention. Therefore Aapl leaves the use of abstractions up to the programmer. Whats New in This Release: · A transfer function has been added to the double lists and AVL trees. · Remaining double list and AVL tree copy constructors and assignment operators have been changed to implement a deep copy, rather than a shallow copy. · All copy constructors and assignment operators now implement a deep copy. · Deep and shallow copy functions have been removed..

Aapl C - Avl - C Template Library - C Template - Aapl - Template - Library - Data - C++ - Copy - Libraries - Programming

- required fields

Your Name Your E-Mail Rating Bad   Not Bad   Moderate   Almost Excellent   Excellent   Review

STL AVL Map is an implementation of AVL-tree-based map, multimap, set and multiset containers for g++ 4.1.1. Almost everything on this library is based on libstdc++ v3 code, so the same license applies. The AVL operations (in lib/tree.

AVL Array is an STL-like container for C++ that fills the gap between vector (or deque) and list, providing both fast random access and fast insertion/removal, all O(log n).

GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere.

dimnum is a C++ template library for dimensional numbers. The dimnum C++ library provides templated classes for storage of dimensional numbers, like lengths, masses, and so on.

APL project is a general purpose C++ template class library. All the code is placed in header files, so no compilation is required. You just have to #include the header file. The classes are implemented using Policy Based Design.