Copyright (c) 1994
Rensselaer Polytechnic Institute
This notice applies to all material accessible from this page except books, documents or source code bearing other copyright notices.
Some of these also use string handling facilities in mstring.h.
Contains hypermedia data sheets describing all of the generic algorithms of STL, including source code and examples of use. The examples can be executed directly from the data sheets. Based on the ANSI/ISO STL document (see below) and the Hewlett Packard implementation.
This is a formal document, not intended for mass consumption. In addition to generic algorithm and container class descriptions, it covers iterators, function objects, and adaptors. All components are described rigorously, but with few examples or much motivating discussion. It has been incorporated with few changes into the Draft Working Paper of the ANSI/ISO C++ Standards Committee, which is the final authority on all STL component specifications.
This is a research paper describing some key design principles for building and documenting a software library based on generic algorithms. It does not describe STL per se, but has examples from a library that was STL's predecessor. A later version of this paper appeared in Software--Practice & Experience, Vol. 24(7), 623-642 (July 1994).
This online version of the paper contains enhancements by Kenny Zalewski to allow running animations of some of the sorting examples and other sorting algorithms, using an animation program developed by David Musser, Nathan Schimke, Alex Stepanov, and Meng Lee. The animation program was implemented using Xlib and a predecessor of STL.