This document describes version 1.6 of the container libraries. The container libraries implements many fairly often used data structures, such as sets, lists, stacks, etc., giving solutions to a very broad range of data structuring issues. It is intended that the container libraries will be extended in the future to include data structures such as trees, and mappings. The container libraries contains a number of abstract patterns which can be used as the basis for other container data structures.
The entire inheritance hierarchy for the container libraries is:
The container libraries are fragmented into relatively small fragments to enable the programmers to be very selective in picking the proper data structures without being burdened with the overhead of the other data structures.
We will in the following discuss the patterns in the container libraries individually.
| Container Libraries - Reference Manual |
© 1992-2002 Mjølner Informatics |
[Modified: Sunday October 22nd 2000 at 0:53]
|