tindex1.htm

C++标准库 C++标准库 C++标准库 C++标准库

<BR>iterator
<UL>in <A HREF="int_2158.htm#idx7">2.1 Introduction to Iterators</a></UL>
<UL>bidirectional in <A HREF="var_0565.htm#idx15">2.2 Varieties of Iterators</a></UL>
<UL>constant in <A HREF="var_0565.htm#idx9">2.2 Varieties of Iterators</a></UL>
<UL>forward in <A HREF="var_0565.htm#idx14">2.2 Varieties of Iterators</a></UL>
<UL>input in <A HREF="var_0565.htm#idx11">2.2 Varieties of Iterators</a></UL>
<UL>insert in <A HREF="ins_0332.htm#idx22">2.4 Insert Iterators</a></UL>
<UL>output in <A HREF="var_0565.htm#idx13">2.2 Varieties of Iterators</a></UL>
<UL>random access in <A HREF="var_0565.htm#idx16">2.2 Varieties of Iterators</a></UL>
<UL>reverse in <A HREF="var_0565.htm#idx18">2.2 Varieties of Iterators</a></UL>
<UL>stream in <A HREF="str_7181.htm#idx19">2.3 Stream Iterators</a></UL>
<BR>iterators
<UL>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>
<BR>iterator_category
<UL>primitive in <A HREF="tip_9088.htm#idx202">16.4 Tips and Techniques for Building Algorithms</a></UL>
<BR>iter_swap() in <A HREF="ini_5794.htm#idx132">13.2 Initialization Algorithms</a>
</DL>
<A NAME="k"><H3>k</H3></A>
<DL><BR>key_comp() in <A HREF="map_8354.htm#idx93">9.2 Map and Multimap Operations</a>
</DL>
<A NAME="l"><H3>l</H3></A>
<DL><BR>length() in <A HREF="str_7474.htm#idx109">12.2 String Operations</a>
<BR>lexicographical_compare() in <A HREF="sca_1926.htm#idx162">13.6 Scalar-Producing Algorithms</a>
<BR>list in <A HREF="lis_0449.htm#idx65">6.1 The list Data Abstraction</a>
<BR>logic_error in <A HREF="sta_8979.htm#idx212">18.2 The Standard Exception Hierarchy</a>
<BR>lower_bound()
<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>
</DL>
<A NAME="m"><H3>m</H3></A>
<DL><BR>make_heap() in <A HREF="hea_8081.htm#idx179">14.8 Heap Operations</a>
<BR>max() in <A HREF="sea_9743.htm#idx140">13.3 Searching Operations</a>
<BR>max_element() in <A HREF="sea_9743.htm#idx141">13.3 Searching Operations</a>
<BR>max_size()
<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>memory management in <A HREF="mem_0434.htm#idx39">4.3 Memory Management Issues</a>
<BR>merge()
<UL>in <A HREF="inp_4704.htm#idx151">13.4 In-Place Transformations</a></UL>
<UL>in <A HREF="lis_8858.htm#idx72">6.2 List Operations</a></UL>
<UL>in <A HREF="mer_3553.htm#idx174">14.6 Merge Ordered Sequences</a></UL>
<BR>min() in <A HREF="sea_9743.htm#idx140">13.3 Searching Operations</a>
<BR>min_element() in <A HREF="sea_9743.htm#idx141">13.3 Searching Operations</a>
<BR>mismatch()
<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>multidimensional array in <A HREF="con_9414.htm#idx43">4.4 Container Types Not Found in the Standard Library</a>
</DL>
<A NAME="n"><H3>n</H3></A>
<DL><BR>negator in <A HREF="neg_5796.htm#idx33">3.5 Negators and Binders</a>
<BR>new operator in <A HREF="mem_0434.htm#idx39">4.3 Memory Management Issues</a>
<BR>next_permutation() in <A HREF="inp_4704.htm#idx150">13.4 In-Place Transformations</a>
<BR>norm() in <A HREF="cre_7274.htm#idx219">20.2 Creating and Using Complex Numbers</a>
<BR>nth_element() in <A HREF="nth_1433.htm#idx171">14.4 nth Element</a>
<BR>numeric_limits in <A HREF="ove_1724.htm#idx225">21.1 Overview</a>
</DL>
<A NAME="o"><H3>o</H3></A>
<DL><BR>ordered collections in <A HREF="ove_6146.htm#idx168">14.1 Overview</a>
<BR>ostream_iterator in <A HREF="str_7181.htm#idx21">2.3 Stream Iterators</a>
<BR>output iterator in <A HREF="var_0565.htm#idx13">2.2 Varieties of Iterators</a>
</DL>
<A NAME="p"><H3>p</H3></A>
<DL><BR>pairwise equality in <A HREF="sca_1926.htm#idx161">13.6 Scalar-Producing Algorithms</a>
<BR>parallel Sequences in <A HREF="sidebar1.htm#idx133">13.2 Initialization Algorithms</a>
<BR>partial_sort() in <A HREF="par_1934.htm#idx170">14.3 Partial Sort</a>
<BR>partial_sum() in <A HREF="seq_4302.htm#idx165">13.7 Sequence-Generating Algorithms</a>
<BR>partition() in <A HREF="inp_4704.htm#idx148">13.4 In-Place Transformations</a>
<BR>permutations in <A HREF="sidebar1.htm#idx149">13.4 In-Place Transformations</a>
<BR>phase angle, complex in <A HREF="cre_7274.htm#idx220">20.2 Creating and Using Complex Numbers</a>
<BR>pointers, as container values
<UL>in <A HREF="app_4189.htm#idx104">11.3 Application - Event-Driven Simulation</a></UL>
<UL>in <A HREF="mem_0434.htm#idx39">4.3 Memory Management Issues</a></UL>
<BR>polar() in <A HREF="cre_7274.htm#idx216">20.2 Creating and Using Complex Numbers</a>
<BR>pop_back() in <A HREF="vec_6528.htm#idx59">5.2 Vector Operations</a>
<BR>pop_heap() in <A HREF="hea_8081.htm#idx181">14.8 Heap Operations</a>
<BR>predicate in <A HREF="pre_1157.htm#idx28">3.2 Predicates</a>
<BR>prev_permutation() in <A HREF="inp_4704.htm#idx150">13.4 In-Place Transformations</a>
<BR>priority queue
<UL>in <A HREF="exa_7078.htm#idx94">9.3 Example Programs</a></UL>
<UL>in <A HREF="pri_5364.htm#idx99">11.1 The priority queue Data Abstraction</a></UL>
<BR>push_back()
<UL>in <A HREF="lis_8858.htm#idx69">6.2 List Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx58">5.2 Vector Operations</a></UL>
<BR>push_front() in <A HREF="lis_8858.htm#idx69">6.2 List Operations</a>
<BR>push_heap() in <A HREF="hea_8081.htm#idx180">14.8 Heap Operations</a>
</DL>
<A NAME="q"><H3>q</H3></A>
<DL><BR>queue in <A HREF="ove_6374.htm#idx96">10.1 Overview</a>
</DL>
<A NAME="r"><H3>r</H3></A>
<DL><BR>radix sort in <A HREF="exa_6226.htm#idx81">7.3 Example Program - Radix Sort</a>
<BR>random access iterators in <A HREF="var_0565.htm#idx16">2.2 Varieties of Iterators</a>
<BR>randomInteger()
<UL>in <A HREF="app_4189.htm#idx105">11.3 Application - Event-Driven Simulation</a></UL>
<UL>in <A HREF="var_0565.htm#idx17">2.2 Varieties of Iterators</a></UL>
<BR>random_shuffle() in <A HREF="inp_4704.htm#idx152">13.4 In-Place Transformations</a>
<BR>rbegin()
<UL>in <A HREF="map_8354.htm#idx88">9.2 Map and Multimap Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx62">5.2 Vector Operations</a></UL>
<BR>reachable iterator in <A HREF="int_2158.htm#idx8">2.1 Introduction to Iterators</a>
<BR>real() in <A HREF="cre_7274.htm#idx218">20.2 Creating and Using Complex Numbers</a>
<BR>removal algorithms in <A HREF="rem_8388.htm#idx153">13.5 Removal Algorithms</a>
<BR>remove()
<UL>in <A HREF="lis_8858.htm#idx74">6.2 List Operations</a></UL>
<UL>in <A HREF="rem_8388.htm#idx154">13.5 Removal Algorithms</a></UL>
<UL>in <A HREF="str_7474.htm#idx115">12.2 String Operations</a></UL>
<BR>remove_copy() in <A HREF="rem_8388.htm#idx154">13.5 Removal Algorithms</a>
<BR>remove_copy_if() in <A HREF="rem_8388.htm#idx154">13.5 Removal Algorithms</a>
<BR>remove_if()
<UL>in <A HREF="lis_8858.htm#idx74">6.2 List Operations</a></UL>
<UL>in <A HREF="rem_8388.htm#idx154">13.5 Removal Algorithms</a></UL>
<BR>rend()
<UL>in <A HREF="map_8354.htm#idx88">9.2 Map and Multimap Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx62">5.2 Vector Operations</a></UL>
<BR>replace() in <A HREF="inp_4704.htm#idx145">13.4 In-Place Transformations</a>
<BR>replace_copy() in <A HREF="inp_4704.htm#idx146">13.4 In-Place Transformations</a>
<BR>replace_copy_if() in <A HREF="inp_4704.htm#idx146">13.4 In-Place Transformations</a>
<BR>replace_if() in <A HREF="inp_4704.htm#idx145">13.4 In-Place Transformations</a>
<BR>reserve()
<UL>in <A HREF="str_7474.htm#idx108">12.2 String Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx55">5.2 Vector Operations</a></UL>
<BR>resize()
<UL>in <A HREF="lis_8858.htm#idx77">6.2 List Operations</a></UL>
<UL>in <A HREF="str_7474.htm#idx109">12.2 String Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx57">5.2 Vector Operations</a></UL>
<BR>reverse iterator in <A HREF="var_0565.htm#idx18">2.2 Varieties of Iterators</a>
<BR>reverse()
<UL>in <A HREF="inp_4704.htm#idx144">13.4 In-Place Transformations</a></UL>
<UL>in <A HREF="lis_8858.htm#idx79">6.2 List Operations</a></UL>
<BR>rfind() in <A HREF="str_7474.htm#idx119">12.2 String Operations</a>
<BR>rotate() in <A HREF="inp_4704.htm#idx147">13.4 In-Place Transformations</a>
<BR>running the tutorial programs in <A HREF="run_9497.htm#idx6">1.8 Running the Tutorial Programs</a>
<BR>runtime_error in <A HREF="sta_8979.htm#idx212">18.2 The Standard Exception Hierarchy</a>
</DL>
<A NAME="s"><H3>s</H3></A>
<DL><BR>scalar producing algorithms in <A HREF="sca_1926.htm#idx157">13.6 Scalar-Producing Algorithms</a>
<BR>Schonfinkel, Moses in <A HREF="sidebar1.htm#idx35">3.5 Negators and Binders</a>
<BR>search()
<UL>in <A HREF="sea_9743.htm#idx138">13.3 Searching Operations</a></UL>
<UL>in <A HREF="sea_9743.htm#idx139">13.3 Searching Operations</a></UL>
<BR>searching algorithms in <A HREF="sea_9743.htm#idx134">13.3 Searching Operations</a>
<BR>selecting a container in <A HREF="sel_2116.htm#idx37">4.2 Selecting a Container</a>
<BR>sequence generating algorithms in <A HREF="seq_4302.htm#idx163">13.7 Sequence-Generating Algorithms</a>
<BR>set in <A HREF="set_4687.htm#idx82">8.1 The set Data Abstraction</a>
<BR>set operations in <A HREF="set_1753.htm#idx176">14.7 Set Operations</a>
<BR>set
<UL>iterator category in <A HREF="var_0565.htm#idx10">2.2 Varieties of Iterators</a></UL>
<BR>set_difference() in <A HREF="set_1753.htm#idx177">14.7 Set Operations</a>
<BR>set_intersection() in <A HREF="set_1753.htm#idx177">14.7 Set Operations</a>
<BR>set_symmetric_difference() in <A HREF="set_1753.htm#idx177">14.7 Set Operations</a>
<BR>set_union() in <A HREF="mer_3553.htm#idx174">14.6 Merge Ordered Sequences</a>
<BR>shallow copy in <A HREF="mem_0434.htm#idx38">4.3 Memory Management Issues</a>
<BR>sieve of Eratosthenes in <A HREF="exa_7254.htm#idx64">5.4 Example Program - Sieve of Eratosthenes</a>
<BR>simulation programs in <A HREF="pri_5364.htm#idx100">11.1 The priority queue Data Abstraction</a>
<BR>size()
<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#idx108">12.2 String Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx54">5.2 Vector Operations</a></UL>
<BR>sort() in <A HREF="sor_5132.htm#idx169">14.2 Sorting Algorithms</a>
<BR>sort_heap() in <A HREF="hea_8081.htm#idx182">14.8 Heap Operations</a>
<BR>sparse array in <A HREF="con_9414.htm#idx45">4.4 Container Types Not Found in the Standard Library</a>
<BR>splice() in <A HREF="lis_8858.htm#idx71">6.2 List Operations</a>
<BR>stable_sort() in <A HREF="sor_5132.htm#idx169">14.2 Sorting Algorithms</a>
<BR>stack in <A HREF="ove_6374.htm#idx95">10.1 Overview</a>
<BR>Standard Template Library in <A HREF="wha_6844.htm#idx2">1.1 What is the Standard C++ Library?</a>
<BR>stream iterator in <A HREF="str_7181.htm#idx19">2.3 Stream Iterators</a>
<BR>string in <A HREF="str_1999.htm#idx106">12.1 The string Abstraction</a>
<BR>string traits class in <A HREF="usi_7948.htm#idx208">17.1 Using the Traits Technique</a>
<BR>string_char_trait in <A HREF="usi_7948.htm#idx209">17.1 Using the Traits Technique</a>
<BR>subscript operator
<UL>in <A HREF="map_8354.htm#idx85">9.2 Map and Multimap Operations</a></UL>
<UL>in <A HREF="str_7474.htm#idx113">12.2 String Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx51">5.2 Vector Operations</a></UL>
<BR>substr() in <A HREF="str_7474.htm#idx117">12.2 String Operations</a>
<BR>swap()
<UL>in <A HREF="ini_5794.htm#idx131">13.2 Initialization Algorithms</a></UL>
<UL>in <A HREF="lis_8858.htm#idx68">6.2 List Operations</a></UL>
<UL>in <A HREF="set_1754.htm#idx83">8.2 set and multiset Operations</a></UL>
<UL>in <A HREF="str_7474.htm#idx112">12.2 String Operations</a></UL>
<UL>in <A HREF="vec_6528.htm#idx50">5.2 Vector Operations</a></UL>
<BR>swap_ranges() in <A HREF="ini_5794.htm#idx132">13.2 Initialization Algorithms</a>
<BR>symbolic constants in <A HREF="ove_1724.htm#idx224">21.1 Overview</a>
</DL>
<A NAME="t"><H3>t</H3></A>
<DL><BR>traits in <A HREF="usi_7948.htm#idx207">17.1 Using the Traits Technique</a>
<BR>traits template in <A HREF="usi_7948.htm#idx206">17.1 Using the Traits Technique</a>
<BR>transcendental functions in <A HREF="cre_7274.htm#idx222">20.2 Creating and Using Complex Numbers</a>
<BR>transform() in <A HREF="seq_4302.htm#idx164">13.7 Sequence-Generating Algorithms</a>
<BR>transformation algorithms in <A HREF="inp_4704.htm#idx143">13.4 In-Place Transformations</a>
<BR>tree in <A HREF="con_9414.htm#idx41">4.4 Container Types Not Found in the Standard Library</a>
<BR>trigonometric functions in <A HREF="cre_7274.htm#idx221">20.2 Creating and Using Complex Numbers</a>
<BR>two-category error model in <A HREF="sta_8979.htm#idx211">18.2 The Standard Exception Hierarchy</a>
</DL>
<A NAME="u"><H3>u</H3></A>
<DL><BR>unary_function in <A HREF="fun_0476.htm#idx30">3.3 Function Objects</a>
<BR>unique()
<UL>in <A HREF="lis_8858.htm#idx75">6.2 List Operations</a></UL>
<UL>in <A HREF="rem_8388.htm#idx155">13.5 Removal Algorithms</a></UL>
<BR>unique_copy() in <A HREF="rem_8388.htm#idx156">13.5 Removal Algorithms</a>
<BR>unordered sets in <A HREF="con_9414.htm#idx42">4.4 Container Types Not Found in the Standard Library</a>
<BR>upper_bound()
<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>user-defined algorithms in <A HREF="ext_4563.htm#idx193">16.1 Extending the Library</a>
<BR>user-defined containers in <A HREF="ext_4563.htm#idx193">16.1 Extending the Library</a>
<BR>using exceptions in <A HREF="usi_0332.htm#idx213">18.3 Using Exceptions</a>
<BR>using the standard library in <A HREF="usi_1633.htm#idx5">1.7 Using the Standard Library</a>
</DL>
<A NAME="v"><H3>v</H3></A>
<DL><BR>value_comp() in <A HREF="map_8354.htm#idx93">9.2 Map and Multimap Operations</a>
<BR>value_type in <A HREF="tip_9088.htm#idx203">16.4 Tips and Techniques for Building Algorithms</a>
<BR>vector in <A HREF="vec_8165.htm#idx47">5.1 The vector Data Abstraction</a>
</DL>
<A NAME="w"><H3>w</H3></A>
<DL><BR>wstring in <A HREF="str_1999.htm#idx107">12.1 The string Abstraction</a>
</DL>
<A NAME=""><H3></H3></A>
<DL><H3>Return to the <A HREF="ug1.htm">User Guide home page</A></H3>
<P>&copy;Copyright 1996, Rogue Wave Software, Inc.</P>
</BODY>
</HTML>