Prev Up Next
Go backward to Formal Specification of STL Container and Iterator Concepts
Go up to Top
Go forward to A Portable Cache Profiler
Based on Source-Level Instrumentation


Anatomy of a List Class

The following are lecture notes on the specification and an implementation of the STL list class template. Included is an examination of "what special considerations are necessary for implementation of generic list structures (i.e., where the element type is a template parameter) so that they work correctly and efficiently no matter what type is substituted." For specific details of the implementation, we refer to the original Hewlett-Packard (HP) STL list class source code, or actually a slightly reorganized and simplified version of it. (HP STL was the basis for most STL implementations. Later implementations of STL lists differ most significantly from HP's in the way they handle storage management.)


 

Prev Up Next