Welcome to the Standard Template Library
Online Reference Home Page

Copyright (c) 1994
Rensselaer Polytechnic Institute

This notice applies to all material accessible from this page except documents or source code bearing other copyright notices.

• What is STL?

• How does STL differ from other C++ libraries?

• How can users compile programs that use STL?
  Please note that this information is primarily for users of the Rensselaer Computing System (RCS).

• List of main STL include files

• Simple example programs that use STL

• The STL Online Algorithm Reference , by Robert Cook, Jr., David R. Musser, and Kenneth J. Zalewski, 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.

• FTP sites for STL source code and related materials

• Information on STL Container Classes and STL Iterator Categories .

• The Standard Template Library, by Alexander Stepanov and Meng Lee (ANSI/ISO document), 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. Consult it as the final authority on all STL component specifications.

• Additional references

• Index

• STL Overview
• Differences between STL and other C++ libraries
• Compiling programs that use STL
• STL include files
• STL example programs
  • STL vectors and vector iterators
    • The Program
    • Output of the program
  • Anagram-checking
    • Problem Specification
    • The Program
  • Sorting and searching with user-defined records
• STL Algorithm Datasheets
  • Non-mutating sequence operations
    • Apply a function to all elements in a sequence
    • Find an element satisfying a condition in a sequence
    • Find the first consecutive duplicate in a sequence
    • Count the number of elements satisfying a condition in a sequence
    • Find the first mismatch between two sequences
    • Check two sequences for element by element equality
    • Find the first match of a subsequence with a sequence
  • Mutating sequence operations
    • Copy one sequence into another sequence
    • Exchange values or ranges
    • Transform a sequence, or two sequences, into a new sequence
    • Replace specified elements of a sequence
    • Fill a range with copies of a value
    • Fill a range with generated values
    • Remove elements from a sequence
    • Remove consecutive duplicates from a sequence
    • Reverse a sequence
    • Rotate elements in a sequence
    • Randomly shuffle elements in a sequence
    • Partition with elements that satisfy a predicate first
  • Sorting and related operations
    • Sort a range (unstably, stably, or partially)
    • Place element in location where it would be sorted
    • Find bounds for, or location of, a value in a sorted sequence
    • Merge two sorted sequences
    • Set operations on sorted sequences
    • Heap operations
    • Finding minimum and maximum elements
    • Determine the lexicographical ordering of two sequences
    • Generate permutations of a sequence
  • Generalized numeric operations
    • Accumulate all elements in a sequence
    • Calculate the inner product of the elements in two sequences
    • Compute partial sums of one sequence into another sequence
    • Compute a sequence from its partial sums into another sequence
  • Algorithm Animations
• STL FTP sites
• STL Container Classes
• STL Iterator Categories
• Additional references
• Index