The Standard Template Library

Table of Contents

• Standard Template Library
• COPYING
• Introduction
• Structure of the Library
• Requirements
• Core components
  • Operators
  • Pair
• Iterators
  • Input iterators
  • Output iterators
  • Forward iterators
  • Bidirectional iterators
  • Random access iterators
  • Iterator tags
    • Examples of using iterator tags
    • Library defined primitives
  • Iterator operations
• Function objects
  • Base
  • Arithmetic operations
  • Comparisons
  • Logical operations
• Allocators
  • Allocator requirements
  • The default allocator
• Containers
  • Sequences
    • Vector
    • List
    • Deque
  • Associative containers
    • Set
    • Multiset
    • Map
    • Multimap
• Stream iterators
  • Istream Iterator
  • Ostream iterator
• Algorithms
  • Non-mutating sequence operations
    • For each
    • Find
    • Adjacent find
    • Count
    • Mismatch
    • Equal
    • Search
  • Mutating sequence operations
    • Copy
    • Swap
    • Transform
    • Replace
    • Fill
    • Generate
    • Remove
    • Unique
    • Reverse
    • Rotate
    • Random shuffle
    • Partitions
  • Sorting and related operations
    • Sort
    • Nth element
    • Binary search
    • Merge
    • Set operations on sorted structures
    • Heap operations
    • Minimum and maximum
    • Lexicographical comparison
    • Permutation generators
  • Generalized numeric operations
    • Accumulate
    • Inner product
    • Partial sum
    • Adjacent difference
• Adaptors
  • Container adaptors
    • Stack
    • Queue
    • Priority queue
  • Iterator adaptors
    • Reverse iterators
    • Insert iterators
  • Function adaptors
    • Negators
    • Binders
    • Adaptors for pointers to functions
• Memory Handling Primitives
• Bibliography
• Class/Type Index
• Method/Function/Member Index
• Concept Index
• Example Index

Node:Top, Next:COPYING, Previous:(dir), Up:(dir)

Standard Template Library

• COPYING:
• Introduction:
• Structure of the Library:
• Requirements:
• Core components:
• Iterators:
• Function objects:
• Allocators:
• Containers:
• Stream iterators:
• Algorithms:
• Adaptors:
• Memory Handling Primitives:
• Bibliography:
• Class/Type Index:
• Method/Function/Member Index:
• Concept Index:
• Example Index:

  --- The Detailed Node Listing ---

  Core components

• Operators:
• Pair:

  Iterators

• Input iterators:
• Output iterators:
• Forward iterators:
• Bidirectional iterators:
• Random access iterators:
• Iterator tags:
• Iterator operations:

  Iterator tags

• Examples of using iterator tags:
• Library defined primitives:

  Function objects

• Base:
• Arithmetic operations:
• Comparisons:
• Logical operations:

  Allocators

• Allocator requirements:
• The default allocator:

  Containers

• Sequences:
• Associative containers:

  Sequences

• Vector:
• List:
• Deque:

  Associative containers

• Set:
• Multiset:
• Map:
• Multimap:

  Stream iterators

• Istream Iterator:
• Ostream iterator:

  Algorithms

• Non-mutating sequence operations:
• Mutating sequence operations:
• Sorting and related operations:
• Generalized numeric operations:

  Non-mutating sequence operations

• For each:
• Find:
• Adjacent find:
• Count:
• Mismatch:
• Equal:
• Search:

  Mutating sequence operations

• Copy:
• Swap:
• Transform:
• Replace:
• Fill:
• Generate:
• Remove:
• Unique:
• Reverse:
• Rotate:
• Random shuffle:
• Partitions:

  Sorting and related operations

• Sort:
• Nth element:
• Binary search:
• Merge:
• Set operations on sorted structures:
• Heap operations:
• Minimum and maximum:
• Lexicographical comparison:
• Permutation generators:

  Generalized numeric operations

• Accumulate:
• Inner product:
• Partial sum:
• Adjacent difference:

  Adaptors

• Container adaptors:
• Iterator adaptors:
• Function adaptors:

  Container adaptors

• Stack:
• Queue:
• Priority queue:

  Iterator adaptors

• Reverse iterators:
• Insert iterators:

  Function adaptors

• Negators:
• Binders:
• Adaptors for pointers to functions :