📄 page620.html
字号:
<HTML>
<HEAD>
<TITLE>Index</TITLE>
</HEAD>
<BODY bgcolor="#FFFFFF">
<img src="cover75.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/icons/cover75.gif" alt="Logo" align=right>
<b>Data Structures and Algorithms
with Object-Oriented Design Patterns in C++</b><br>
<IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="next_motif_gr.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/icons/next_motif_gr.gif"> <A NAME="tex2html9555" HREF="book.html" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/book.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="up_motif.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/icons/up_motif.gif"></A> <A NAME="tex2html9551" HREF="page619.html" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page619.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="previous_motif.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/icons/previous_motif.gif"></A> <A NAME="tex2html9557" HREF="page9.html" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page9.html"><IMG WIDTH=65 HEIGHT=24 ALIGN=BOTTOM ALT="contents" SRC="contents_motif.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/icons/contents_motif.gif"></A> <BR><HR>
<P><H2><A NAME="SECTION0022000000000000000000">Index</A></H2>
<DL><DT><I>o</I><DD>seebig oh, seelittle oh
<DT> <IMG WIDTH=8 HEIGHT=16 ALIGN=MIDDLE ALT="tex2html_wrap_inline58543" SRC="img114.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/img114.gif" ><DD>seeEuler's constant
<DT> <IMG WIDTH=10 HEIGHT=11 ALIGN=BOTTOM ALT="tex2html_wrap_inline59909" SRC="img407.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/img407.gif" ><DD>seeomega
<DT> <IMG WIDTH=10 HEIGHT=12 ALIGN=BOTTOM ALT="tex2html_wrap_inline60105" SRC="img434.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/img434.gif" ><DD>seetheta
<DT> <IMG WIDTH=8 HEIGHT=11 ALIGN=BOTTOM ALT="tex2html_wrap_inline62866" SRC="img985.gif" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/img985.gif" ><DD>seelambda
<DT>abstract algorithms<DD><A NAME="tex2html527" HREF="page267.html#16186" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page267.html#16186">Tree Traversals</A>
<DT>abstract class<DD><A NAME="tex2html199" HREF="page110.html#4454" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page110.html#4454">Class Hierarchy</A>, <A NAME="tex2html201" HREF="page110.html#4467" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page110.html#4467">Class Hierarchy</A>, <A NAME="tex2html1216" HREF="page611.html#57647" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page611.html#57647">Abstract Classes and Concrete </A>
<DT>abstract data type<DD><A NAME="tex2html104" HREF="page79.html#2435" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page79.html#2435">Foundational Data Structures</A>, <A NAME="tex2html193" HREF="page108.html#4435" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4435">Abstract Data Types</A>
<DT>abstract solver<DD><A NAME="tex2html858" HREF="page449.html#32659" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page449.html#32659">Abstract Backtracking Solvers</A>
<DT>abstract sorter<DD><A NAME="tex2html936" HREF="page485.html#34543" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page485.html#34543">Sorting and Sorters</A>
<DT>access path<DD><A NAME="tex2html601" HREF="page324.html#20127" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page324.html#20127">Inserting Items into an </A>
<DT>accessor<DD><A NAME="tex2html125" HREF="page85.html#2778" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page85.html#2778">Array Member Functions</A>, <A NAME="tex2html1199" HREF="page603.html#57334" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page603.html#57334">Accessors and Mutators</A>
<DT>activation record<DD><A NAME="tex2html3" HREF="page36.html#310" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page36.html#310">The Basic Axioms</A>, <A NAME="tex2html805" HREF="page420.html#30455" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page420.html#30455">The Heap</A>
<DT>activity-node graph<DD><A NAME="tex2html1150" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html \n\nThis file was not retrieved by Teleport Pro, because the server reports that an error occurred that prevented retrieval. \n\nDo you want to open it from the server?'))window.location='http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html#54766'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page582.html#54766">Application: Critical Path Analysis</A>
<DT>actual parameter<DD><A NAME="tex2html1186" HREF="page592.html#57152" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page592.html#57152">Pass By Value</A>
<DT>acyclic<DD><DL><DT>directed graph<DD><A NAME="tex2html1051" HREF="page528.html#48871" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page528.html#48871">Directed Acyclic Graphs</A>
</DL><DT>adapter<DD><A NAME="tex2html530" HREF="page269.html#16215" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page269.html#16215">PreorderInorder and Postorder </A>
<DT>address<DD><A NAME="tex2html184" HREF="page108.html#4392" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4392">Abstract Data Types</A>, <A NAME="tex2html1169" HREF="javascript:if(confirm('http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html \n\nThis file was not retrieved by Teleport Pro, because the server reports that an error occurred that prevented retrieval. \n\nDo you want to open it from the server?'))window.location='http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html#56939'" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page587.html#56939">VariablesPointers and References</A>
<DT>address arithmetic<DD><A NAME="tex2html159" HREF="page101.html#4044" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page101.html#4044">Array Subscript Calculations</A>
<DT>adjacency lists<DD><A NAME="tex2html1070" HREF="page535.html#49401" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page535.html#49401">Adjacency Lists</A>
<DT>adjacency matrix<DD><A NAME="tex2html1060" HREF="page533.html#49354" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page533.html#49354">Adjacency Matrices</A>
<DT>adjacent<DD><A NAME="tex2html1032" HREF="page526.html#48805" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48805">Terminology</A>
<DT>ADT<DD>seeabstract data type
<DT>algorithmic abstraction<DD><A NAME="tex2html1219" HREF="page612.html#57676" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page612.html#57676">Algorithmic Abstraction</A>
<DT>ancestor<DD><A NAME="tex2html476" HREF="page253.html#15113" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page253.html#15113">More Terminology</A>
<DL><DT>proper<DD><A NAME="tex2html477" HREF="page253.html#15115" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page253.html#15115">More Terminology</A>
</DL><DT>and<DD><A NAME="tex2html737" HREF="page392.html#28335" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page392.html#28335">UnionIntersection and Difference</A>
<DT>annealing<DD><A NAME="tex2html922" HREF="page479.html#34317" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page479.html#34317">Simulated Annealing</A>
<DT>annealing schedule<DD><A NAME="tex2html924" HREF="page479.html#34325" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page479.html#34325">Simulated Annealing</A>
<DT>arc<DD><DL><DT>directed<DD><A NAME="tex2html1031" HREF="page526.html#48801" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page526.html#48801">Terminology</A>
<DT>undirected<DD><A NAME="tex2html1054" HREF="page529.html#49013" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page529.html#49013">Undirected Graphs</A>
</DL><DT>arithmetic series<DD><A NAME="tex2html34" HREF="page49.html#856" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page49.html#856">About Arithmetic Series Summation</A>
<DT>arithmetic series summation<DD><A NAME="tex2html33" HREF="page48.html#848" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page48.html#848">An Example-Geometric Series Summation</A>, <A NAME="tex2html35" HREF="page49.html#860" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page49.html#860">About Arithmetic Series Summation</A>
<DT>arity<DD><A NAME="tex2html543" HREF="page282.html#16740" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page282.html#16740"><I>N</I>-ary Trees</A>
<DT>array<DD><A NAME="tex2html105" HREF="page79.html#2438" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page79.html#2438">Foundational Data Structures</A>
<DT>ASCII<DD><A NAME="tex2html412" HREF="page218.html#11434" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page218.html#11434">Character String Keys</A>
<DT>asymptotic behavior<DD><A NAME="tex2html49" HREF="page56.html#1317" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page56.html#1317">Asymptotic Notation</A>
<DT>attributes<DD><A NAME="tex2html175" HREF="page108.html#4375" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page108.html#4375">Abstract Data Types</A>
<DT>AVL balance condition<DD><A NAME="tex2html596" HREF="page320.html#19974" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page320.html#19974">AVL Search Trees</A>
<DT>AVL rotation<DD><A NAME="tex2html603" HREF="page325.html#20131" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page325.html#20131">Balancing AVL Trees</A>
<DT>AVL tree<DD><A NAME="tex2html654" HREF="page353.html#24008" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page353.html#24008">Basics</A>
<DT>B-Tree<DD><A NAME="tex2html631" HREF="page340.html#21676" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page340.html#21676">B-Trees</A>, <A NAME="tex2html634" HREF="page340.html#21687" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page340.html#21687">B-Trees</A>
<DT>Bachmann, P.<DD><A NAME="tex2html50" HREF="page57.html#1319" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page57.html#1319">An Asymptotic Upper Bound-Big </A>
<DT>backtracking algorithms<DD><A NAME="tex2html846" HREF="page446.html#32357" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page446.html#32357">Backtracking Algorithms</A>
<DT><code>bad_cast</code><DD><A NAME="tex2html221" HREF="page116.html#4775" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page116.html#4775">Implementation</A>
<DT><code>bad_cast</code><DD><A NAME="tex2html1225" HREF="page614.html#57964" tppabs="http://dictator.uwaterloo.ca/Bruno.Preiss/books/opus4/html/page614.html#57964">Run-Time Type Information and </A>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -