📄 booktoc.htm
字号:
<HTML><HEAD><TITLE>Comprehensive TOC</TITLE></HEAD>
<BODY><A HREF="ug.htm"><IMG SRC="images/banner.gif"></A>
<P><STRONG>Click on the banner to return to the user guide home page.</STRONG></P>
<P>©Copyright 1996 Rogue Wave Software</P>
<H2>Table of Contents</H2>
<UL>
<A HREF="int_4456.htm"><H3>Chapter 1: Introduction</H3></A>
<A HREF="wha_6844.htm"><UL><LI>What is the Standard C++ Library?</LI></UL></A>
<A HREF="doe_3822.htm"><UL><LI>Does the Standard C++ Library Differ From Other Libraries?</LI></UL></A>
<A HREF="wha_3608.htm"><UL><LI>What are the Effects of Non-Object-Oriented Design?</LI></UL></A>
<A HREF="how_0483.htm"><UL><LI>How Should I Use the Standard C++ Library?</LI></UL></A>
<A HREF="rea_7538.htm"><UL><LI>Reading This Manual</LI></UL></A>
<A HREF="con_0547.htm"><UL><LI>Conventions</LI></UL></A>
<A HREF="usi_1633.htm"><UL><LI>Using the Standard Library</LI></UL></A>
<A HREF="run_9497.htm"><UL><LI>Running the Tutorial Programs</LI></UL></A>
<A HREF="ite_2271.htm"><H3>Chapter 2: Iterators</H3></A>
<A HREF="int_2158.htm"><UL><LI>Introduction to Iterators</LI></UL></A>
<A HREF="var_0565.htm"><UL><LI>Varieties of Iterators</LI></UL></A>
<A HREF="var_0565.htm#inputiterators"><UL><UL><LI>Input Iterators</LI></UL></UL></A>
<A HREF="var_0565.htm#outputiterators"><UL><UL><LI>Output Iterators</LI></UL></UL></A>
<A HREF="var_0565.htm#forwarditerators"><UL><UL><LI>Forward Iterators</LI></UL></UL></A>
<A HREF="var_0565.htm#bidirectionaliterators"><UL><UL><LI>Bidirectional Iterators</LI></UL></UL></A>
<A HREF="var_0565.htm#randomaccessiterators"><UL><UL><LI>Random Access Iterators</LI></UL></UL></A>
<A HREF="var_0565.htm#reverseiterators"><UL><UL><LI>Reverse Iterators</LI></UL></UL></A>
<A HREF="str_7181.htm"><UL><LI>Stream Iterators</LI></UL></A>
<A HREF="str_7181.htm#inputstreamiterators"><UL><UL><LI>Input Stream Iterators</LI></UL></UL></A>
<A HREF="str_7181.htm#outputstreamiterators"><UL><UL><LI>Output Stream Iterators</LI></UL></UL></A>
<A HREF="ins_0332.htm"><UL><LI>Insert Iterators</LI></UL></A>
<A HREF="ite_8402.htm"><UL><LI>Iterator Operations</LI></UL></A>
<A HREF="fun_1852.htm"><H3>Chapter 3: Functions and Predicates</H3></A>
<A HREF="fun_5137.htm"><UL><LI>Functions</LI></UL></A>
<A HREF="pre_1157.htm"><UL><LI>Predicates</LI></UL></A>
<A HREF="fun_0476.htm"><UL><LI>Function Objects</LI></UL></A>
<A HREF="neg_5796.htm"><UL><LI>Negators and Binders</LI></UL></A>
<A HREF="con_2412.htm"><H3>Chapter 4: Container Classes</H3></A>
<A HREF="ove_0957.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="sel_2116.htm"><UL><LI>Selecting a Container</LI></UL></A>
<A HREF="mem_0434.htm"><UL><LI>Memory Management Issues</LI></UL></A>
<A HREF="con_9414.htm"><UL><LI>Container Types Not Found in the Standard Library</LI></UL></A>
<A HREF="vec_1893.htm"><H3>Chapter 5: vector and vector <bool></H3></A>
<A HREF="vec_4853.htm"><UL><LI>The vector Data Abstraction</LI></UL></A>
<A HREF="vec_4853.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="vec_8233.htm"><UL><LI>Vector Operations</LI></UL></A>
<A HREF="vec_8233.htm#declarationandinitializationofvectors"><UL><UL><LI>Declaration and Initialization of Vectors</LI></UL></UL></A>
<A HREF="vec_8233.htm#typedefinitions"><UL><UL><LI>Type Definitions</LI></UL></UL></A>
<A HREF="vec_8233.htm#subscriptingavector"><UL><UL><LI>Subscripting a Vector</LI></UL></UL></A>
<A HREF="vec_8233.htm#extentandsizechangingoperations"><UL><UL><LI>Extent and Size-Changing Operations</LI></UL></UL></A>
<A HREF="vec_8233.htm#insertingandremovingelements"><UL><UL><LI>Inserting and Removing Elements</LI></UL></UL></A>
<A HREF="vec_8233.htm#iteration"><UL><UL><LI>Iteration</LI></UL></UL></A>
<A HREF="vec_8233.htm#testforinclusion"><UL><UL><LI>Test for Inclusion</LI></UL></UL></A>
<A HREF="vec_8233.htm#sortingandsortedvectoroperations"><UL><UL><LI>Sorting and Sorted Vector Operations</LI></UL></UL></A>
<A HREF="vec_8233.htm#usefulgenericalgorithms"><UL><UL><LI>Useful Generic Algorithms</LI></UL></UL></A>
<A HREF="boo_1544.htm"><UL><LI>Boolean Vectors</LI></UL></A>
<A HREF="exa_4427.htm"><UL><LI>Example Program - Sieve of Eratosthenes</LI></UL></A>
<A HREF="lis_3222.htm"><H3>Chapter 6: list</H3></A>
<A HREF="lis_0449.htm"><UL><LI>The list Data Abstraction</LI></UL></A>
<A HREF="lis_0449.htm#includefiles"><UL><UL><LI>Include files</LI></UL></UL></A>
<A HREF="lis_8858.htm"><UL><LI>List Operations</LI></UL></A>
<A HREF="lis_8858.htm#declarationandinitializationoflists"><UL><UL><LI>Declaration and Initialization of Lists</LI></UL></UL></A>
<A HREF="lis_8858.htm#typedefinitions"><UL><UL><LI>Type Definitions</LI></UL></UL></A>
<A HREF="lis_8858.htm#placingelementsintoalist"><UL><UL><LI>Placing Elements into a List</LI></UL></UL></A>
<A HREF="lis_8858.htm#removingelements"><UL><UL><LI>Removing Elements</LI></UL></UL></A>
<A HREF="lis_8858.htm#extentandsizechangingoperations"><UL><UL><LI>Extent and Size-Changing Operations</LI></UL></UL></A>
<A HREF="lis_8858.htm#accessanditeration"><UL><UL><LI>Access and Iteration</LI></UL></UL></A>
<A HREF="lis_8858.htm#testforinclusion"><UL><UL><LI>Test for Inclusion</LI></UL></UL></A>
<A HREF="lis_8858.htm#sortingandsortedlistoperations"><UL><UL><LI>Sorting and Sorted List Operations</LI></UL></UL></A>
<A HREF="lis_8858.htm#searchingoperations"><UL><UL><LI>Searching Operations</LI></UL></UL></A>
<A HREF="lis_8858.htm#inplacetransformations"><UL><UL><LI>In Place Transformations</LI></UL></UL></A>
<A HREF="lis_8858.htm#otheroperations"><UL><UL><LI>Other Operations</LI></UL></UL></A>
<A HREF="exa_3285.htm"><UL><LI>Example Program - An Inventory System</LI></UL></A>
<A HREF="deq_4164.htm"><H3>Chapter 7: deque</H3></A>
<A HREF="deq_0575.htm"><UL><LI>The Deque Data Abstraction</LI></UL></A>
<A HREF="deq_0575.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="deq_2889.htm"><UL><LI>Deque Operations</LI></UL></A>
<A HREF="exa_6226.htm"><UL><LI>Example Program - Radix Sort</LI></UL></A>
<A HREF="set_3455.htm"><H3>Chapter 8: set, multiset, and bitset</H3></A>
<A HREF="set_4687.htm"><UL><LI>The set Data Abstraction</LI></UL></A>
<A HREF="set_4687.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="set_1754.htm"><UL><LI>set and multiset Operations</LI></UL></A>
<A HREF="set_1754.htm#declarationandinitializationofset"><UL><UL><LI>Declaration and Initialization of Set</LI></UL></UL></A>
<A HREF="set_1754.htm#typedefinitions"><UL><UL><LI>Type Definitions</LI></UL></UL></A>
<A HREF="set_1754.htm#insertion"><UL><UL><LI>Insertion</LI></UL></UL></A>
<A HREF="set_1754.htm#removalofelementsfromaset"><UL><UL><LI>Removal of Elements from a Set</LI></UL></UL></A>
<A HREF="set_1754.htm#searchingandcounting"><UL><UL><LI>Searching and Counting</LI></UL></UL></A>
<A HREF="set_1754.htm#iterators"><UL><UL><LI>Iterators</LI></UL></UL></A>
<A HREF="set_1754.htm#setoperations"><UL><UL><LI>Set Operations</LI></UL></UL></A>
<A HREF="set_1754.htm#othergenericalgorithms"><UL><UL><LI>Other Generic Algorithms</LI></UL></UL></A>
<A HREF="exa_2257.htm"><UL><LI>Example Program: - A Spelling Checker</LI></UL></A>
<A HREF="bit_2576.htm"><UL><LI>The bitset Abstraction</LI></UL></A>
<A HREF="bit_2576.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="bit_2576.htm#declarationandinitializationofbitset"><UL><UL><LI>Declaration and Initialization of bitset</LI></UL></UL></A>
<A HREF="bit_2576.htm#accessingandtestingelements"><UL><UL><LI>Accessing and Testing Elements</LI></UL></UL></A>
<A HREF="bit_2576.htm#setoperations"><UL><UL><LI>Set operations</LI></UL></UL></A>
<A HREF="bit_2576.htm#conversions"><UL><UL><LI>Conversions</LI></UL></UL></A>
<A HREF="map_7716.htm"><H3>Chapter 9: map and multimap</H3></A>
<A HREF="map_9326.htm"><UL><LI>The map Data Abstraction</LI></UL></A>
<A HREF="map_9326.htm#includefiles"><UL><UL><LI>Include files</LI></UL></UL></A>
<A HREF="map_8354.htm"><UL><LI>Map and Multimap Operations</LI></UL></A>
<A HREF="map_8354.htm#declarationandinitializationofmap"><UL><UL><LI>Declaration and Initialization of map</LI></UL></UL></A>
<A HREF="map_8354.htm#typedefinitions"><UL><UL><LI>Type Definitions</LI></UL></UL></A>
<A HREF="map_8354.htm#insertionandaccess"><UL><UL><LI>Insertion and Access</LI></UL></UL></A>
<A HREF="map_8354.htm#removalofvalues"><UL><UL><LI>Removal of Values</LI></UL></UL></A>
<A HREF="map_8354.htm#iterators"><UL><UL><LI>Iterators</LI></UL></UL></A>
<A HREF="map_8354.htm#searchingandcounting"><UL><UL><LI>Searching and Counting</LI></UL></UL></A>
<A HREF="map_8354.htm#elementcomparisons"><UL><UL><LI>Element Comparisons</LI></UL></UL></A>
<A HREF="map_8354.htm#othermapoperations"><UL><UL><LI>Other Map Operations</LI></UL></UL></A>
<A HREF="exa_7078.htm"><UL><LI>Example Programs</LI></UL></A>
<A HREF="exa_7078.htm#atelephonedatabase"><UL><UL><LI>A Telephone Database</LI></UL></UL></A>
<A HREF="exa_7078.htm#graphs"><UL><UL><LI>Graphs</LI></UL></UL></A>
<A HREF="exa_7078.htm#aconcordance"><UL><UL><LI>A Concordance</LI></UL></UL></A>
<A HREF="sta_2474.htm"><H3>Chapter 10: stack and queue</H3></A>
<A HREF="ove_6374.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="sta_5501.htm"><UL><LI>The Stack Data Abstraction</LI></UL></A>
<A HREF="sta_5501.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="sta_5501.htm#declarationandinitializationofstack"><UL><UL><LI>Declaration and Initialization of stack</LI></UL></UL></A>
<A HREF="sta_5501.htm#exampleprogramarpncalculator"><UL><UL><LI>Example Program - A RPN Calculator</LI></UL></UL></A>
<A HREF="que_3605.htm"><UL><LI>The Queue Data Abstraction</LI></UL></A>
<A HREF="que_3605.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="que_3605.htm#declarationandinitializationofqueue"><UL><UL><LI>Declaration and Initialization of queue</LI></UL></UL></A>
<A HREF="que_3605.htm#exampleprogrambanktellersimulation"><UL><UL><LI>Example Program - Bank Teller Simulation</LI></UL></UL></A>
<A HREF="pri_2327.htm"><H3>Chapter 11: priority_queue</H3></A>
<A HREF="pri_5364.htm"><UL><LI>The priority queue Data Abstraction</LI></UL></A>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -