📄 tindex1.htm
字号:
<HTML><TITLE>Topic Index</TITLE><BODY><A HREF="ug1.htm"><IMG SRC="images/banner.gif"></A><BR><STRONG>Click on the banner to return to the user guide home page.</STRONG><H2>Topic Index</H2><P>Click on one of the letters below to jump immediately to that section of the index. If you get no response, that letter has no entries.</P><PRE><a href="#a">A</a> <a href="#b">B</a> <a href="#c">C</a> <a href="#d">D</a> <a href="#e">E</a> <a href="#f">F</a> <a href="#g">G</a> <a href="#h">H</a> <a href="#i">I</a> <a href="#j">J</a> <a href="#k">K</a> <a href="#l">L</a> <a href="#m">M</a> <a href="#n">N</a> <a href="#o">O</a> <a href="#p">P</a><br><br><a href="#q">Q</a> <a href="#r">R</a> <a href="#s">S</a> <a href="#t">T</a> <a href="#u">U</a> <a href="#v">V</a> <a href="#w">W</a> <a href="#x">X</a> <a href="#y">Y</a> <a href="#z">Z</a></PRE><A NAME="a"><H3>a</H3></A><DL><BR>abs() in <A HREF="cre_7274.htm#idx219">20.2 Creating and Using Complex Numbers</a><BR>accumulate() in <A HREF="sca_1926.htm#idx159">13.6 Scalar-Producing Algorithms</a><BR>adaptor<UL>function in <A HREF="neg_5796.htm#idx34">3.5 Negators and Binders</a></UL><UL>priority queue in <A HREF="pri_0581.htm#idx101">11.2 The Priority Queue Operations</a></UL><UL>queue in <A HREF="que_3605.htm#idx98">10.3 The queue Data Abstraction</a></UL><UL>stack in <A HREF="ove_6374.htm#idx97">10.1 Overview</a></UL><BR>adaptors in <A HREF="bui_0694.htm#idx196">16.2 Building on the Standard Containers</a><BR>adjacent_difference() in <A HREF="seq_4302.htm#idx166">13.7 Sequence-Generating Algorithms</a><BR>adjacent_find() in <A HREF="sea_9743.htm#idx136">13.3 Searching Operations</a><BR>advance in <A HREF="tip_9088.htm#idx205">16.4 Tips and Techniques for Building Algorithms</a><BR>advance() in <A HREF="ite_8402.htm#idx25">2.5 Iterator Operations</a><BR>algorithm in <A HREF="con_0547.htm#idx4">1.6 Conventions</a><BR>algorithms<UL>building in <A HREF="tip_9088.htm#idx201">16.4 Tips and Techniques for Building Algorithms</a></UL><UL>categories in <A HREF="ext_4563.htm#idx194">16.1 Extending the Library</a></UL><UL>tips and techniques in <A HREF="tip_9088.htm#idx201">16.4 Tips and Techniques for Building Algorithms</a></UL><UL>user-defined in <A HREF="ext_4563.htm#idx193">16.1 Extending the Library</a></UL><BR>allocator in <A HREF="ano_4722.htm#idx183">15.1 An Overview of the Standard Library Allocators</a><BR>allocator interface<UL>in <A HREF="ano_4722.htm#idx183">15.1 An Overview of the Standard Library Allocators</a></UL><UL>basic interface in <A HREF="cre_5716.htm#idx199">16.3 Creating Your Own Containers</a></UL><UL>requirements in <A HREF="cre_5716.htm#idx199">16.3 Creating Your Own Containers</a></UL><BR>allocator<UL>alternate interface in <A HREF="bui_2068.htm#idx189">15.3 Building Your Own Allocators</a></UL><UL>alternative interface in <A HREF="bui_2068.htm#idx191">15.3 Building Your Own Allocators</a></UL><UL>conforming in <A HREF="bui_2068.htm#idx186">15.3 Building Your Own Allocators</a></UL><UL>defining in <A HREF="bui_2068.htm#idx185">15.3 Building Your Own Allocators</a></UL><UL>required member functions in <A HREF="bui_2068.htm#idx187">15.3 Building Your Own Allocators</a></UL><UL><UL>in <A HREF="bui_2068.htm#idx188">15.3 Building Your Own Allocators</a></UL></UL><UL>standard interface in <A HREF="bui_2068.htm#idx191">15.3 Building Your Own Allocators</a></UL><UL>supporting both interfaces in <A HREF="bui_2068.htm#idx191">15.3 Building Your Own Allocators</a></UL><BR>allocator_interface in <A HREF="bui_2068.htm#idx190">15.3 Building Your Own Allocators</a><BR>American National Standards Institute in <A HREF="wha_6844.htm#idx1">1.1 What is the Standard C++ Library?</a><BR>append() in <A HREF="str_7474.htm#idx111">12.2 String Operations</a><BR>arg() in <A HREF="cre_7274.htm#idx220">20.2 Creating and Using Complex Numbers</a><BR>assign()<UL>in <A HREF="lis_8858.htm#idx67">6.2 List Operations</a></UL><UL>in <A HREF="str_7474.htm#idx111">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx49">5.2 Vector Operations</a></UL><BR>at()<UL>in <A HREF="str_7474.htm#idx113">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx52">5.2 Vector Operations</a></UL><BR>auto_ptr class in <A HREF="ove_3674.htm#idx214">19.1 Overview</a></DL><A NAME="b"><H3>b</H3></A><DL><BR>back()<UL>in <A HREF="lis_8858.htm#idx78">6.2 List Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx53">5.2 Vector Operations</a></UL><BR>back_inserter in <A HREF="ins_0332.htm#idx23">2.4 Insert Iterators</a><BR>basic_string in <A HREF="str_1999.htm#idx107">12.1 The string Abstraction</a><BR>begin()<UL>in <A HREF="map_8354.htm#idx87">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="var_0565.htm#idx12">2.2 Varieties of Iterators</a></UL><UL>in <A HREF="vec_6528.htm#idx62">5.2 Vector Operations</a></UL><BR>bidirectional iterator in <A HREF="var_0565.htm#idx15">2.2 Varieties of Iterators</a><BR>binary search tree in <A HREF="con_9414.htm#idx41">4.4 Container Types Not Found in the Standard Library</a><BR>binary_function<UL>in <A HREF="exa_3285.htm#idx80">6.3 Example Program - An Inventory System</a></UL><UL>in <A HREF="fun_0476.htm#idx30">3.3 Function Objects</a></UL><BR>binary_search() in <A HREF="bin_2092.htm#idx172">14.5 Binary Search</a><BR>binder in <A HREF="neg_5796.htm#idx33">3.5 Negators and Binders</a></DL><A NAME="c"><H3>c</H3></A><DL><BR>capacity()<UL>in <A HREF="str_7474.htm#idx108">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx54">5.2 Vector Operations</a></UL><BR>catenation in <A HREF="sidebar1.htm#idx125">13.2 Initialization Algorithms</a><BR>characteristics, of containers in <A HREF="ove_0957.htm#idx36">4.1 Overview</a><BR>code re-use<UL>composition in <A HREF="bui_0694.htm#idx197">16.2 Building on the Standard Containers</a></UL><UL>generic inheritance in <A HREF="bui_0694.htm#idx196">16.2 Building on the Standard Containers</a></UL><UL>inheritance in <A HREF="bui_0694.htm#idx195">16.2 Building on the Standard Containers</a></UL><BR>compare() in <A HREF="str_7474.htm#idx118">12.2 String Operations</a><BR>complex numbers in <A HREF="ove_7764.htm#idx215">20.1 Overview</a><BR>composition in <A HREF="bui_0694.htm#idx197">16.2 Building on the Standard Containers</a><BR>conj() in <A HREF="cre_7274.htm#idx217">20.2 Creating and Using Complex Numbers</a><BR>conjugate, complex in <A HREF="cre_7274.htm#idx217">20.2 Creating and Using Complex Numbers</a><BR>constant iterator in <A HREF="var_0565.htm#idx9">2.2 Varieties of Iterators</a><BR>containers not in standard library in <A HREF="con_9414.htm#idx40">4.4 Container Types Not Found in the Standard Library</a><BR>containers<UL>creating your own in <A HREF="cre_5716.htm#idx198">16.3 Creating Your Own Containers</a></UL><UL>design requirements in <A HREF="cre_5716.htm#idx198">16.3 Creating Your Own Containers</a></UL><UL>designing in <A HREF="ano_4722.htm#idx184">15.1 An Overview of the Standard Library Allocators</a></UL><UL>designing your own in <A HREF="cre_5716.htm#idx200">16.3 Creating Your Own Containers</a></UL><UL>iterator requirements in <A HREF="cre_5716.htm#idx200">16.3 Creating Your Own Containers</a></UL><UL>user-defined in <A HREF="cre_5716.htm#idx199">16.3 Creating Your Own Containers</a></UL><UL><UL>in <A HREF="ext_4563.htm#idx193">16.1 Extending the Library</a></UL></UL><BR>conventions, presentation in <A HREF="con_0547.htm#idx4">1.6 Conventions</a><BR>copy()<UL>in <A HREF="ini_5794.htm#idx126">13.2 Initialization Algorithms</a></UL><UL>in <A HREF="lis_8858.htm#idx66">6.2 List Operations</a></UL><UL>in <A HREF="str_7474.htm#idx116">12.2 String Operations</a></UL><BR>copy_backward() in <A HREF="ini_5794.htm#idx126">13.2 Initialization Algorithms</a><BR>count()<UL>in <A HREF="map_8354.htm#idx92">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="sca_1926.htm#idx158">13.6 Scalar-Producing Algorithms</a></UL><BR>count_if() in <A HREF="sca_1926.htm#idx158">13.6 Scalar-Producing Algorithms</a><BR>Curry, Haskell P. in <A HREF="sidebar1.htm#idx35">3.5 Negators and Binders</a><BR>c_str() in <A HREF="str_7474.htm#idx114">12.2 String Operations</a></DL><A NAME="d"><H3>d</H3></A><DL><BR>data() in <A HREF="str_7474.htm#idx114">12.2 String Operations</a><BR>deep copy in <A HREF="mem_0434.htm#idx38">4.3 Memory Management Issues</a><BR>default constructor in <A HREF="vec_6528.htm#idx48">5.2 Vector Operations</a><BR>design requirements<UL>containers in <A HREF="cre_5716.htm#idx198">16.3 Creating Your Own Containers</a></UL><BR>designing your own containers<UL>iterators in <A HREF="cre_5716.htm#idx200">16.3 Creating Your Own Containers</a></UL><BR>distance in <A HREF="tip_9088.htm#idx204">16.4 Tips and Techniques for Building Algorithms</a><BR>distance() in <A HREF="ite_8402.htm#idx26">2.5 Iterator Operations</a></DL><A NAME="e"><H3>e</H3></A><DL><BR>empty()<UL>in <A HREF="lis_8858.htm#idx76">6.2 List Operations</a></UL><UL>in <A HREF="map_8354.htm#idx89">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="str_7474.htm#idx110">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx56">5.2 Vector Operations</a></UL><BR>end()<UL>in <A HREF="map_8354.htm#idx87">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="var_0565.htm#idx12">2.2 Varieties of Iterators</a></UL><UL>in <A HREF="vec_6528.htm#idx62">5.2 Vector Operations</a></UL><BR>equal()<UL>in <A HREF="sca_1926.htm#idx161">13.6 Scalar-Producing Algorithms</a></UL><UL>in <A HREF="sea_9743.htm#idx142">13.3 Searching Operations</a></UL><BR>equal_range()<UL>in <A HREF="bin_2092.htm#idx173">14.5 Binary Search</a></UL><UL>in <A HREF="map_8354.htm#idx91">9.2 Map and Multimap Operations</a></UL><BR>erase()<UL>in <A HREF="lis_8858.htm#idx73">6.2 List Operations</a></UL><UL>in <A HREF="map_8354.htm#idx86">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="str_7474.htm#idx115">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx61">5.2 Vector Operations</a></UL><BR>Eratosthenes in <A HREF="exa_7254.htm#idx64">5.4 Example Program - Sieve of Eratosthenes</a><BR>errors in <A HREF="ove_3018.htm#idx210">18.1 Overview</a><BR>event driven simulation in <A HREF="app_4189.htm#idx103">11.3 Application - Event-Driven Simulation</a><BR>exception classes in <A HREF="sta_8979.htm#idx212">18.2 The Standard Exception Hierarchy</a><BR>exceptions<UL>using in <A HREF="usi_0332.htm#idx213">18.3 Using Exceptions</a></UL><BR>exponential function in <A HREF="cre_7274.htm#idx223">20.2 Creating and Using Complex Numbers</a></DL><A NAME="f"><H3>f</H3></A><DL><BR>fill() in <A HREF="ini_5794.htm#idx123">13.2 Initialization Algorithms</a><BR>fill_n() in <A HREF="ini_5794.htm#idx123">13.2 Initialization Algorithms</a><BR>find()<UL>in <A HREF="map_8354.htm#idx90">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="sea_9743.htm#idx135">13.3 Searching Operations</a></UL><UL>in <A HREF="sea_9743.htm#idx137">13.3 Searching Operations</a></UL><UL>in <A HREF="str_7474.htm#idx119">12.2 String Operations</a></UL><BR>find_first_not_of() in <A HREF="str_7474.htm#idx120">12.2 String Operations</a><BR>find_first_of() in <A HREF="str_7474.htm#idx120">12.2 String Operations</a><BR>find_if()<UL>in <A HREF="sea_9743.htm#idx135">13.3 Searching Operations</a></UL><UL>in <A HREF="sea_9743.htm#idx137">13.3 Searching Operations</a></UL><BR>find_last_not_of() in <A HREF="str_7474.htm#idx120">12.2 String Operations</a><BR>find_last_of() in <A HREF="str_7474.htm#idx120">12.2 String Operations</a><BR>flip() in <A HREF="boo_0584.htm#idx63">5.3 Boolean Vectors</a><BR>forward iterator in <A HREF="var_0565.htm#idx14">2.2 Varieties of Iterators</a><BR>for_each() in <A HREF="mis_2456.htm#idx167">13.8 Miscellaneous Algorithms</a><BR>front()<UL>in <A HREF="lis_8858.htm#idx78">6.2 List Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx53">5.2 Vector Operations</a></UL><BR>front_inserter in <A HREF="ins_0332.htm#idx23">2.4 Insert Iterators</a><BR>function object<UL>in <A HREF="fun_0476.htm#idx29">3.3 Function Objects</a></UL><UL>in <A HREF="fun_8456.htm#idx32">3.4 Function Adaptors</a></UL><BR>functions as arguments in <A HREF="fun_5137.htm#idx27">3.1 Functions</a><BR>future of OOP in <A HREF="how_0483.htm#idx3">1.4 How Should I Use the Standard C++ Library?</a></DL><A NAME="g"><H3>g</H3></A><DL><BR>generate() in <A HREF="ini_5794.htm#idx128">13.2 Initialization Algorithms</a><BR>generate_n() in <A HREF="ini_5794.htm#idx128">13.2 Initialization Algorithms</a><BR>generator<UL>in <A HREF="fun_0476.htm#idx31">3.3 Function Objects</a></UL><UL>in <A HREF="ini_5794.htm#idx129">13.2 Initialization Algorithms</a></UL><BR>generic adaptor in <A HREF="bui_0694.htm#idx196">16.2 Building on the Standard Containers</a><BR>generic algorithms in <A HREF="ove_2014.htm#idx121">13.1 Overview</a><BR>generic composition in <A HREF="bui_0694.htm#idx197">16.2 Building on the Standard Containers</a><BR>generic programming in <A HREF="ext_4563.htm#idx192">16.1 Extending the Library</a><BR>graph in <A HREF="con_9414.htm#idx44">4.4 Container Types Not Found in the Standard Library</a></DL><A NAME="h"><H3>h</H3></A><DL><BR>hash table in <A HREF="con_9414.htm#idx46">4.4 Container Types Not Found in the Standard Library</a><BR>heap<UL>in <A HREF="hea_8081.htm#idx178">14.8 Heap Operations</a></UL><UL>in <A HREF="pri_0581.htm#idx102">11.2 The Priority Queue Operations</a></UL><BR>heterogeneous collection in <A HREF="app_4189.htm#idx104">11.3 Application - Event-Driven Simulation</a></DL><A NAME="i"><H3>i</H3></A><DL><BR>imag() in <A HREF="cre_7274.htm#idx218">20.2 Creating and Using Complex Numbers</a><BR>in place transformations in <A HREF="inp_4704.htm#idx143">13.4 In-Place Transformations</a><BR>includes() in <A HREF="set_1753.htm#idx177">14.7 Set Operations</a><BR>initialization algorithms in <A HREF="ini_5794.htm#idx122">13.2 Initialization Algorithms</a><BR>inner_product() in <A HREF="sca_1926.htm#idx160">13.6 Scalar-Producing Algorithms</a><BR>inplace_merge()<UL>in <A HREF="inp_4704.htm#idx151">13.4 In-Place Transformations</a></UL><UL>in <A HREF="mer_3553.htm#idx175">14.6 Merge Ordered Sequences</a></UL><BR>input iterator in <A HREF="var_0565.htm#idx11">2.2 Varieties of Iterators</a><BR>insert iterator<UL>in <A HREF="ini_5794.htm#idx124">13.2 Initialization Algorithms</a></UL><UL>in <A HREF="ini_5794.htm#idx127">13.2 Initialization Algorithms</a></UL><UL>in <A HREF="ins_0332.htm#idx22">2.4 Insert Iterators</a></UL><UL>in <A HREF="lis_8858.htm#idx66">6.2 List Operations</a></UL><UL>in <A HREF="seq_4302.htm#idx163">13.7 Sequence-Generating Algorithms</a></UL><BR>insert()<UL>in <A HREF="lis_8858.htm#idx70">6.2 List Operations</a></UL><UL>in <A HREF="map_8354.htm#idx84">9.2 Map and Multimap Operations</a></UL><UL>in <A HREF="str_7474.htm#idx115">12.2 String Operations</a></UL><UL>in <A HREF="vec_6528.htm#idx60">5.2 Vector Operations</a></UL><BR>inserter in <A HREF="ins_0332.htm#idx24">2.4 Insert Iterators</a><BR>International Standards Organization in <A HREF="wha_6844.htm#idx1">1.1 What is the Standard C++ Library?</a><BR>iotaGen<UL>in <A HREF="fun_0476.htm#idx31">3.3 Function Objects</a></UL><UL>in <A HREF="ini_5794.htm#idx130">13.2 Initialization Algorithms</a></UL><BR>istream_iterator in <A HREF="str_7181.htm#idx20">2.3 Stream Iterators</a>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -