⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 booktoc.htm

📁 ARM编辑、编译软件
💻 HTM
📖 第 1 页 / 共 2 页
字号:
<A HREF="pri_5364.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="pri_0581.htm"><UL><LI>The Priority Queue Operations</LI></UL></A>
<A HREF="pri_0581.htm#declarationandinitializationofpriorityqueue"><UL><UL><LI>Declaration and Initialization of priority queue</LI></UL></UL></A>
<A HREF="app_4189.htm"><UL><LI>Application - Event-Driven Simulation</LI></UL></A>
<A HREF="app_4189.htm#anicecreamstoresimulation"><UL><UL><LI>An Ice Cream Store Simulation</LI></UL></UL></A>
<A HREF="str_8586.htm"><H3>Chapter 12:	 String</H3></A>
<A HREF="str_1999.htm"><UL><LI>The string Abstraction</LI></UL></A>
<A HREF="str_1999.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="str_7474.htm"><UL><LI>String Operations</LI></UL></A>
<A HREF="str_7474.htm#declarationandinitializationofstring"><UL><UL><LI>Declaration and Initialization of string</LI></UL></UL></A>
<A HREF="str_7474.htm#resettingsizeandcapacity"><UL><UL><LI>Resetting Size and Capacity</LI></UL></UL></A>
<A HREF="str_7474.htm#assignmentappendandswap"><UL><UL><LI>Assignment, Append and Swap</LI></UL></UL></A>
<A HREF="str_7474.htm#characteraccess"><UL><UL><LI>Character Access</LI></UL></UL></A>
<A HREF="str_7474.htm#iterators"><UL><UL><LI>Iterators</LI></UL></UL></A>
<A HREF="str_7474.htm#insertionremovalandreplacement"><UL><UL><LI>Insertion, Removal and Replacement</LI></UL></UL></A>
<A HREF="str_7474.htm#copyandsubstring"><UL><UL><LI>Copy and Substring</LI></UL></UL></A>
<A HREF="str_7474.htm#stringcomparisons"><UL><UL><LI>String Comparisons</LI></UL></UL></A>
<A HREF="str_7474.htm#searchingoperations"><UL><UL><LI>Searching Operations</LI></UL></UL></A>
<A HREF="ane_8974.htm"><UL><LI>An Example Function - Split a Line into Words</LI></UL></A>
<A HREF="gen_9895.htm"><H3>Chapter 13:	 Generic Algorithms</H3></A>
<A HREF="ove_2014.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="ove_2014.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="ini_5794.htm"><UL><LI>Initialization Algorithms</LI></UL></A>
<A HREF="ini_5794.htm#fillasequencewithaninitialvalue"><UL><UL><LI>Fill a Sequence with An Initial Value</LI></UL></UL></A>
<A HREF="ini_5794.htm#copyonesequenceintoanothersequence"><UL><UL><LI>Copy One Sequence Into Another Sequence</LI></UL></UL></A>
<A HREF="ini_5794.htm#initializeasequencewithgeneratedvalues"><UL><UL><LI>Initialize a Sequence with Generated Values</LI></UL></UL></A>
<A HREF="ini_5794.htm#swapvaluesfromtwoparallelranges"><UL><UL><LI>Swap Values from Two Parallel Ranges</LI></UL></UL></A>
<A HREF="sea_9743.htm"><UL><LI>Searching Operations</LI></UL></A>
<A HREF="sea_9743.htm#findanelementsatisfyingacondition"><UL><UL><LI>Find an Element Satisfying a Condition</LI></UL></UL></A>
<A HREF="sea_9743.htm#findconsecutiveduplicateelements"><UL><UL><LI>Find Consecutive Duplicate Elements</LI></UL></UL></A>
<A HREF="sea_9743.htm#findasubsequencewithinasequence"><UL><UL><LI>Find a Subsequence within a Sequence</LI></UL></UL></A>
<A HREF="sea_9743.htm#locatemaximumorminimumelement"><UL><UL><LI>Locate Maximum or Minimum Element</LI></UL></UL></A>
<A HREF="sea_9743.htm#locatethefirstmismatchedelementsinparallelsequences"><UL><UL><LI>Locate the First Mismatched Elements in Parallel Sequences</LI></UL></UL></A>
<A HREF="inp_4704.htm"><UL><LI>In-Place Transformations</LI></UL></A>
<A HREF="inp_4704.htm#reverseelementsinasequence"><UL><UL><LI>Reverse Elements in a Sequence</LI></UL></UL></A>
<A HREF="inp_4704.htm#replacecertainelementswithfixedvalue"><UL><UL><LI>Replace Certain Elements With Fixed Value</LI></UL></UL></A>
<A HREF="inp_4704.htm#rotateelementsaroundamidpoint"><UL><UL><LI>Rotate Elements Around a Midpoint</LI></UL></UL></A>
<A HREF="inp_4704.htm#partitionasequenceintotwogroups"><UL><UL><LI>Partition a Sequence into Two Groups</LI></UL></UL></A>
<A HREF="inp_4704.htm#generatepermutationsinsequence"><UL><UL><LI>Generate Permutations in Sequence</LI></UL></UL></A>
<A HREF="inp_4704.htm#mergetwoadjacentsequencesintoone"><UL><UL><LI>Merge Two Adjacent Sequences into One</LI></UL></UL></A>
<A HREF="inp_4704.htm#randomlyrearrangeelementsinasequence"><UL><UL><LI>Randomly Rearrange Elements in a Sequence</LI></UL></UL></A>
<A HREF="rem_8388.htm"><UL><LI>Removal Algorithms</LI></UL></A>
<A HREF="rem_8388.htm#removeunwantedelements"><UL><UL><LI>Remove Unwanted Elements</LI></UL></UL></A>
<A HREF="rem_8388.htm#removerunsofsimilarvalues"><UL><UL><LI>Remove Runs of Similar Values</LI></UL></UL></A>
<A HREF="sca_1926.htm"><UL><LI>Scalar-Producing Algorithms</LI></UL></A>
<A HREF="sca_1926.htm#countthenumberofelementsthatsatisfyacondition"><UL><UL><LI>Count the Number of Elements that Satisfy a Condition</LI></UL></UL></A>
<A HREF="sca_1926.htm#reducesequencetoasinglevalue"><UL><UL><LI>Reduce Sequence to a Single Value</LI></UL></UL></A>
<A HREF="sca_1926.htm#generalizedinnerproduct"><UL><UL><LI>Generalized Inner Product</LI></UL></UL></A>
<A HREF="sca_1926.htm#testtwosequencesforpairwiseequality"><UL><UL><LI>Test Two Sequences for Pairwise Equality</LI></UL></UL></A>
<A HREF="sca_1926.htm#lexicalcomparison"><UL><UL><LI>Lexical Comparison </LI></UL></UL></A>
<A HREF="seq_4302.htm"><UL><LI>Sequence-Generating Algorithms</LI></UL></A>
<A HREF="seq_4302.htm#transformoneortwosequences"><UL><UL><LI>Transform One or Two Sequences</LI></UL></UL></A>
<A HREF="seq_4302.htm#partialsums"><UL><UL><LI>Partial Sums</LI></UL></UL></A>
<A HREF="seq_4302.htm#adjacentdifferences"><UL><UL><LI>Adjacent Differences</LI></UL></UL></A>
<A HREF="mis_2456.htm"><UL><LI>Miscellaneous Algorithms</LI></UL></A>
<A HREF="mis_2456.htm#applyafunctiontoallelementsinacollection"><UL><UL><LI>Apply a Function to All Elements in a Collection</LI></UL></UL></A>
<A HREF="ord_1635.htm"><H3>Chapter 14:	 Ordered Collection Algorithms</H3></A>
<A HREF="ove_6146.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="ove_6146.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="sor_5132.htm"><UL><LI>Sorting Algorithms</LI></UL></A>
<A HREF="par_1934.htm"><UL><LI>Partial Sort</LI></UL></A>
<A HREF="nth_1433.htm"><UL><LI>nth Element</LI></UL></A>
<A HREF="bin_2092.htm"><UL><LI>Binary Search</LI></UL></A>
<A HREF="mer_3553.htm"><UL><LI>Merge Ordered Sequences</LI></UL></A>
<A HREF="set_1753.htm"><UL><LI>Set Operations</LI></UL></A>
<A HREF="hea_8081.htm"><UL><LI>Heap Operations</LI></UL></A>
<A HREF="usi_0776.htm"><H3>Chapter 15:	 Using Allocators</H3></A>
<A HREF="ano_4722.htm"><UL><LI>An Overview of the Standard Library Allocators</LI></UL></A>
<A HREF="usi_1829.htm"><UL><LI>Using Allocators with Existing Standard Library Containers</LI></UL></A>
<A HREF="bui_2068.htm"><UL><LI>Building Your Own Allocators</LI></UL></A>
<A HREF="bui_2068.htm#usingthestandardallocatorinterface"><UL><UL><LI>Using the Standard Allocator Interface</LI></UL></UL></A>
<A HREF="bui_2068.htm#usingroguewavesalternativeinterface"><UL><UL><LI>Using Rogue Wave's Alternative Interface</LI></UL></UL></A>
<A HREF="bui_2068.htm#howtosupportbothinterfaces"><UL><UL><LI>How to Support Both Interfaces</LI></UL></UL></A>
<A HREF="bui_4873.htm"><H3>Chapter 16:	 Building Containers &#38; Generic Algorithms</H3></A>
<A HREF="ext_4563.htm"><UL><LI>Extending the Library</LI></UL></A>
<A HREF="bui_0694.htm"><UL><LI>Building on the Standard Containers</LI></UL></A>
<A HREF="bui_0694.htm#inheritance"><UL><UL><LI>Inheritance </LI></UL></UL></A>
<A HREF="bui_0694.htm#genericinheritance"><UL><UL><LI>Generic Inheritance</LI></UL></UL></A>
<A HREF="bui_0694.htm#genericcomposition"><UL><UL><LI>Generic Composition</LI></UL></UL></A>
<A HREF="cre_5716.htm"><UL><LI>Creating Your Own Containers</LI></UL></A>
<A HREF="cre_5716.htm#meetingthecontainerrequirements"><UL><UL><LI>Meeting the Container Requirements</LI></UL></UL></A>
<A HREF="cre_5716.htm#meetingtheallocatorinterfacerequirements"><UL><UL><LI>Meeting the Allocator Interface Requirements</LI></UL></UL></A>
<A HREF="cre_5716.htm#iteratorrequirements"><UL><UL><LI>Iterator Requirements</LI></UL></UL></A>
<A HREF="tip_9088.htm"><UL><LI>Tips and Techniques for Building Algorithms</LI></UL></A>
<A HREF="tip_9088.htm#theiterator_categoryprimitive"><UL><UL><LI>The iterator_category Primitive</LI></UL></UL></A>
<A HREF="tip_9088.htm#thedistanceandadvanceprimitives"><UL><UL><LI>The distance and advance Primitives</LI></UL></UL></A>
<A HREF="the_5255.htm"><H3>Chapter 17:	 The Traits Parameter</H3></A>
<A HREF="usi_7948.htm"><UL><LI>Using the Traits Technique</LI></UL></A>
<A HREF="exc_0293.htm"><H3>Chapter 18:	 Exception Handling</H3></A>
<A HREF="ove_3018.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="ove_3018.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="sta_8979.htm"><UL><LI>The Standard Exception Hierarchy</LI></UL></A>
<A HREF="usi_0332.htm"><UL><LI>Using Exceptions</LI></UL></A>
<A HREF="exa_1053.htm"><UL><LI>Example Program</LI></UL></A>
<A HREF="aut_3512.htm"><H3>Chapter 19:	 auto_ptr</H3></A>
<A HREF="ove_3674.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="ove_3674.htm#includefile"><UL><UL><LI>Include File</LI></UL></UL></A>
<A HREF="dec_3723.htm"><UL><LI>Declaration and Initialization of Auto Pointers</LI></UL></A>
<A HREF="exa_5786.htm"><UL><LI>Example Program</LI></UL></A>
<A HREF="com_8038.htm"><H3>Chapter 20:	 Complex</H3></A>
<A HREF="ove_7764.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="ove_7764.htm#includefiles"><UL><UL><LI>Include Files</LI></UL></UL></A>
<A HREF="cre_7274.htm"><UL><LI>Creating and Using Complex Numbers</LI></UL></A>
<A HREF="cre_7274.htm#declaringcomplexnumbers"><UL><UL><LI>Declaring Complex Numbers</LI></UL></UL></A>
<A HREF="cre_7274.htm#accessingcomplexnumbervalues"><UL><UL><LI>Accessing Complex Number Values</LI></UL></UL></A>
<A HREF="cre_7274.htm#arithmeticoperations"><UL><UL><LI>Arithmetic Operations</LI></UL></UL></A>
<A HREF="cre_7274.htm#comparingcomplexvalues"><UL><UL><LI>Comparing Complex Values</LI></UL></UL></A>
<A HREF="cre_7274.htm#streaminputandoutput"><UL><UL><LI>Stream Input and Output</LI></UL></UL></A>
<A HREF="cre_7274.htm#normandabsolutevalue"><UL><UL><LI>Norm and Absolute Value</LI></UL></UL></A>
<A HREF="cre_7274.htm#trigonometricfunctions"><UL><UL><LI>Trigonometric Functions</LI></UL></UL></A>
<A HREF="cre_7274.htm#transcendentalfunctions"><UL><UL><LI>Transcendental Functions</LI></UL></UL></A>
<A HREF="exa_2656.htm"><UL><LI>Example Program - Roots of a Polynomial</LI></UL></A>
<A HREF="num_8453.htm"><H3>Chapter 21:	 Numeric Limits</H3></A>
<A HREF="ove_1724.htm"><UL><LI>Overview</LI></UL></A>
<A HREF="fun_3734.htm"><UL><LI>Fundamental Data Types</LI></UL></A>
<A HREF="num_4324.htm"><UL><LI>Numeric Limit Members</LI></UL></A>
<A HREF="num_4324.htm#memberscommontoalltypes"><UL><UL><LI>Members Common to All Types</LI></UL></UL></A>
<A HREF="num_4324.htm#membersspecifictofloatingpointvalues"><UL><UL><LI>Members Specific to Floating Point Values</LI></UL></UL></A>
<A HREF="glo_3764.htm"><H3>Chapter 22:	 Glossary</H3></A>

</UL>
</BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -