Éî¶È̽Ë÷C++14

µÚ1Õ C++»ù´¡£¨C++ Basics£© 1
1£®1 **¸ö³ÌÐò£¨Our First Program£© 1
1£®2 ±äÁ¿£¨Variables£© 4
1£®2£®1 ³£Á¿£¨Constants£© 7
1£®2£®2 ×ÖÃæÁ¿£¨Literals£© 7
1£®2£®3 ·ÇÕ­»¯µÄ³õʼ»¯£¨non-narrowing initialization£© 9
1£®2£®4 ×÷ÓÃÓò£¨Scopes£© 11
1£®3 ²Ù×÷·û£¨Operators£© 13
1£®3£®1 ËãÊõ²Ù×÷·û£¨Arithmetic Operators£© 14
1£®3£®2 ²¼¶û²Ù×÷·û£¨Boolean Operators£© 17
1£®3£®3 λ²Ù×÷·û£¨Bitwise Operators£© 18
1£®3£®4 ¸³Öµ£¨Assignment£© 19
1£®3£®5 ³ÌÐòÁ÷£¨Program Flow£© 19
1£®3£®6 ÄÚ´æ´¦Àí£¨Memory Handling£© 20
1£®3£®7 ·ÃÎʲÙ×÷·û£¨Access Operators£© 21
1£®3£®8 ÀàÐÍ´¦Àí£¨Type Handling£© 21
1£®3£®9 ´íÎó´¦Àí£¨Error Handling£© 21
1£®3£®10 ÖØÔØ£¨Overloading£© 22
1£®3£®11 ²Ù×÷·ûÓÅÏȼ¶£¨Operator Precedence£© 22
1£®3£®12 ±ÜÃ⸱×÷Óã¨Avoid Side Effects£¡£© 22
1£®4 ±í´ïʽºÍÓï¾ä£¨Expressions and Statements£© 25
1£®4£®1 ±í´ïʽ£¨Expressions£© 25
1£®4£®2 Óï¾ä£¨Statements£© 26
1£®4£®3 ·ÖÖ§£¨Branching£© 27
1£®4£®4 Ñ­»·£¨Loops£© 29
1£®4£®5 goto 33
1£®5 º¯Êý£¨Functions£© 33
1£®5£®1 ²ÎÊý£¨Arguments£© 34
1£®5£®2 ·µ»Ø½á¹û£¨Returning Results£© 36
1£®5£®3 ÄÚÁª£¨Inlining£© 37
1£®5£®4 ÖØÔØ£¨Overloading£© 38
1£®5£®5 mainº¯Êý£¨main Function£© 40
1£®6 ´íÎó´¦Àí£¨Error Handling£© 41
1£®6£®1 ¶ÏÑÔ£¨Assertions£© 41
1£®6£®2 Òì³££¨Exceptions£© 43
1£®6£®3 ¾²Ì¬¶ÏÑÔ£¨Static Assertions£© 48
1£®7 I/O 48
1£®7£®1 ±ê×¼Êä³ö£¨Standard Output£© 48
1£®7£®2 ±ê×¼ÊäÈ루Standard Input£© 49
1£®7£®3 ÎļþµÄÊäÈëºÍÊä³ö£¨Input/Output with Files£© 49
1£®7£®4 ·º»¯µÄÁ÷¸ÅÄGeneric Stream Concept£© 50
1£®7£®5 ¸ñʽ»¯£¨Formatting£© 51
1£®7£®6 ´¦ÀíÊäÈëÊä³ö´íÎó£¨Dealing with I/O Errors£© 53
1£®8 Êý×é¡¢Ö¸ÕëºÍÒýÓã¨Arrays£¬ Pointers£¬ and References£© 56
1£®8£®1 Êý×飨Arrays£© 56
1£®8£®2 Ö¸Õ루Pointers£© 58
1£®8£®3 ÖÇÄÜÖ¸Õ루Smart Pointers£© 62
1£®8£®4 ÒýÓã¨References£© 65
1£®8£®5 Ö¸ÕëºÍÒýÓõıȽϣ¨Comparison between Pointers and References£© 66
1£®8£®6 ²»ÒªÒýÓùýÆÚÊý¾Ý£¨Do Not Refer to Outdated Data!£© 67
1£®8£®7 Êý×éµÄÈÝÆ÷£¨Containers for Arrays£© 67
1£®9 Èí¼þÏîÄ¿½á¹¹»¯£¨Structuring Software Projects£© 70
1£®9£®1 ×¢ÊÍ£¨Comments£© 70
1£®9£®2 Ô¤±àÒëָʾ×Ö£¨Preprocessor Directives£© 71
1£®10 Á·Ï°£¨Exercises£© 75
1£®10£®1 ÄêÁ䣨Age£© 75
1£®10£®2 Êý×éºÍÖ¸Õ루Arrays and Pointers£© 76
1£®10£®3 ¶ÁÈ¡Ò»¸ö¾ØÕóÊг¡ÎļþµÄÍ·²¿£¨Read the Header of a Matrix
Market File£© 76
µÚ2Õ ÀࣨClasses£© 77
2£®1 ΪÆÕ±éÒâÒå¶ø²»ÊǼ¼Êõϸ½Ú±à³Ì£¨Program for Universal Meaning Not for
Technical Details£© 77
2£®2 ³ÉÔ±£¨Members£© 79
2£®2£®1 ³ÉÔ±±äÁ¿£¨Member Variables£© 80
2£®2£®2 ¿É·ÃÎÊÐÔ£¨Accessibility£© 80
2£®2£®3 ·ÃÎʲÙ×÷·û£¨Access Operators£© 83
2£®2£®4 ÀàµÄ¾²Ì¬ÉùÃ÷·û£¨The Static Declarator for Classes) 84
2£®2£®5 ³ÉÔ±º¯Êý£¨Member Functions£© 84
2£®3 ÉèÖÃÖµ£º¹¹Ô캯ÊýºÍ¸³Öµ£¨Setting Values£º Constructors and Assignments£© 85
2£®3£®1 ¹¹Ô캯Êý£¨Constructors£© 86
2£®3£®2 ¸³Öµ£¨Assignment£© 96
2£®3£®3 ³õʼ»¯Æ÷ÁÐ±í£¨Initializer Lists£© 97
2£®3£®4 Ò»ÖÂÐÔ³õʼ»¯£¨Uniform Initialization£© 99
2£®3£®5 Òƶ¯ÓïÒ壨Move Semantic£© 101
2£®4 Îö¹¹º¯Êý£¨Destructors£© 105
2£®4£®1 ʵÏÖ×¼Ôò£¨Implementation Rules£© 105
2£®4£®2 Êʵ±´¦Àí×ÊÔ´£¨Dealing with Resources Properly£© 106
2£®5 ×Ô¶¯Éú³É·½·¨Çåµ¥£¨Method Generation Résum飩 112
2£®6 ³ÉÔ±±äÁ¿·ÃÎÊ£¨Accessing Member Variables£© 113
2£®6£®1 ·ÃÎʺ¯Êý£¨Access Functions£© 113
2£®6£®2 ϱê²Ù×÷·û£¨Subscript Operator£© 115
2£®6£®3 ³£Á¿³ÉÔ±º¯Êý£¨Constant Member Functions£© 116
2£®6£®4 ÒýÓÃÏÞ¶¨µÄ±äÁ¿£¨Reference-Qualified Members£© 117
2£®7 ²Ù×÷·ûÖØÔصÄÉè¼Æ£¨Operator Overloading Design£© 118
2£®7£®1 ±£³ÖÒ»Ö£¡£¨Be Consistent!£© 119
2£®7£®2 ×¢ÒâÓÅÏȼ¶£¨Respect the Priority£© 120
2£®7£®3 ³ÉÔ±º¯ÊýºÍ×ÔÓɺ¯Êý£¨Member or Free Function£© 120
2£®8 Á·Ï°£¨Exercises£© 123
2£®8£®1 ¶àÏîʽ£¨Polynomial£© 123
2£®8£®2 Òƶ¯¸³Öµ£¨Move Assignment£© 123
2£®8£®3 ³õʼ»¯Æ÷ÁÐ±í£¨Initializer List£© 123
2£®8£®4 ×ÊÔ´¹ÜÀí£¨Resource Rescue£© 124
µÚ3Õ ·ºÐͱà³Ì£¨Generic Programming£© 125
3£®1 º¯ÊýÄ£°å£¨Function Templates£© 125
3£®1£®1 ʵÀý»¯£¨Instantiation£© 127
3£®1£®2 ²ÎÊýÀàÐ͵ÄÍƵ¼£¨Parameter Type Deduction£© 128
3£®1£®3 ÔÚÄ£°åÖд¦Àí´íÎó£¨Dealing with Errors in Templates£© 132
3£®1£®4 »ìºÏÀàÐÍ£¨Mixing Types£© 133
3£®1£®5 Ò»ÖÂÐÔ³õʼ»¯£¨Uniform Initialization£© 134
3£®1£®6 ×Ô¶¯·µ»ØÖµÀàÐÍ£¨Automatic return Type£© 134
3£®2 ÃüÃû¿Õ¼äÓ뺯Êý²éÕÒ£¨Namespaces and Function Lookup£© 135
3£®2£®1 ÃüÃû¿Õ¼ä£¨Namespaces£© 135
3£®2£®2 ²ÎÊýÏà¹Ø²éÕÒ£¨Argument-Dependent Lookup£© 138
3£®2£®3 ÃüÃû¿Õ¼äÏÞ¶¨»¹ÊÇADL£¨Namespace Qualification or ADL£© 142
3£®3 ÀàÄ£°å£¨Class Templates£© 144
3£®3£®1 Ò»¸öÈÝÆ÷µÄ·¶Àý£¨A Container Example£© 144
3£®3£®2 ΪÀàºÍº¯ÊýÉè¼ÆͳһµÄ½Ó¿Ú£¨Designing Uniform Class and
Function Interfaces£© 146
3£®4 ÀàÐÍÍƵ¼Ó붨Ò壨Type Deduction and Definition£© 153
3£®4£®1 ×Ô¶¯±äÁ¿ÀàÐÍ£¨Automatic Variable Type£© 153
3£®4£®2 ±í´ïʽµÄÀàÐÍ£¨Type of an Expression£© 154
3£®4£®3 decltype(auto) 155
3£®4£®4 ¶¨ÒåÀàÐÍ£¨Defining Types£© 156
3£®5 ¹ØÓÚÄ£°åµÄÒ»µãµãÀíÂÛ£º¸ÅÄA Bit of Theory on Templates£º Concepts£© 158
3£®6 Ä£°åÌØ»¯£¨Template Specialization£© 159
3£®6£®1 Ϊµ¥¸öÀàÐÍÌØ»¯ÀࣨSpecializing a Class for One Type£© 159
3£®6£®2 º¯ÊýÌØ»¯ºÍÖØÔØ£¨Specializing and Overloading Functions£© 162
3£®6£®3 ²¿·ÖÌØ»¯£¨Partial Specialization£© 164
3£®6£®4 º¯ÊýµÄ²¿·ÖÌØ»¯£¨Partially Specializing Functions£© 165
3£®7 Ä£°åµÄ·ÇÀàÐͲÎÊý£¨Non-Type Parameters for Templates£© 168
3£®8 ·Âº¯Êý£¨Functors£© 170
3£®8£®1 ÀàËƺ¯ÊýµÄ²ÎÊý£¨Function-like Parameters£© 172
3£®8£®2 ×éºÏ·Âº¯Êý£¨Composing Functors£© 173
3£®8£®3 µÝ¹é£¨Recursion£© 175
3£®8£®4 ·ºÐ͹éÄɺ¯Êý£¨Generic Reduction£© 179
3£®9 ÄäÃûº¯Êý£¨Lambda£© 180
3£®9£®1 ²¶»ñ£¨Capture£© 181
3£®9£®2 °´Öµ²¶»ñ£¨Capture by Value£© 181
3£®9£®3 °´ÒýÓò¶»ñ£¨Capture by Reference£© 182
3£®9£®4 ¹ãÒ岶»ñ£¨Generalized Capture£© 184
3£®9£®5 ·ºÐÍÄäÃûº¯Êý£¨Generic Lambdas£© 185
3£®10 ±ä²ÎÄ£°å£¨Variadic Templates£© 186
3£®11 Á·Ï°£¨Exercises£© 188
3£®11£®1 ×Ö·û´®±íʾ£¨String Representation£© 188
3£®11£®2 Ôª×éµÄ×Ö·û´®±íʾ£¨String Representation of Tuples£© 188
3£®11£®3 ·ºÐÍÕ»£¨Generic Stack£© 188
3£®11£®4 ÏòÁ¿µÄµü´úÆ÷£¨Iterator of a Vector£© 189
3£®11£®5 ÆæÊýµü´úÆ÷£¨Odd Iterator£© 189
3£®11£®6 ÆæÊý·¶Î§£¨Odd Range£© 189
3£®11£®7 bool±äÁ¿µÄÕ»£¨Stack of bool£© 190
3£®11£®8 ×Ô¶¨Òå´óСµÄÕ»£¨Stack with Custom Size£© 190
3£®11£®9 ·ÇÀàÐÍÄ£°å²ÎÊýµÄÍƵ¼£¨Deducing Non-type Template Arguments£© 190
3£®11£®10 ÌÝÐι«Ê½£¨Trapezoid Rule£© 190
3£®11£®11 ·Âº¯Êý£¨Functor£© 191
3£®11£®12 ÄäÃûº¯Êý£¨Lambda£© 191
3£®11£®13 ʵÏÖmake_unique£¨Implement make_unique£© 191
µÚ4Õ ¿â£¨Libraries£© 192
4£®1 ±ê׼ģ°å¿â£¨Standard Template Library£© 193
4£®1£®1 ÈëÃÅʾÀý£¨Introductory Example£© 193
4£®1£®2 µü´úÆ÷£¨Iterators£© 194
4£®1£®3 ÈÝÆ÷£¨Containers£© 199
4£®1£®4 Ëã·¨£¨Algorithms£© 208
4£®1£®5 ³¬Ô½µü´úÆ÷£¨Beyond Iterators£© 215
4£®2 ÊýÖµ£¨Numerics£© 216
4£®2£®1 ¸´Êý£¨Complex Numbers£© 217
4£®2£®2 Ëæ»úÊý·¢ÉúÆ÷£¨Random Number Generators£© 220
4£®3 Ôª±à³Ì£¨Meta-programming£© 230
4£®3£®1 ¼«ÏÞ£¨Limits£© 230
4£®3£®2 ÀàÐÍÌØÕ÷£¨Type Traits£© 232
4£®4 Ö§³Ö¿â£¨Utilities£© 234
4£®4£®1 Ôª×飨Tuple£© 235
4£®4£®2 º¯Êý£¨function£© 238
4£®4£®3 ÒýÓðü×°Æ÷£¨Reference Wrapper£© 240
4£®5 ¾ÍÊÇÏÖÔÚ£¨The Time Is Now£© 242
4£®6 ²¢·¢£¨Concurrency£© 244
4£®7 ±ê×¼Ö®ÍâµÄ¿Æѧ¼ÆËã³ÌÐò¿â£¨Scientific Libraries Beyond the Standard£© 248
4£®7£®1 ÆäËûËãÊõÔËËã¿â£¨Other Arithmetics£© 248
4£®7£®2 Çø¼äËãÊõ£¨Interval Arithmetic£© 248
4£®7£®3 ÏßÐÔ´úÊý£¨Linear Algebra£© 249
4£®7£®4 ³£Î¢·Ö·½³Ì£¨Ordinary Differential Equations£© 249
4£®7£®5 ƫ΢·Ö·½³Ì£¨Partial Differential Equations£© 249
4£®7£®6 ͼÂÛËã·¨£¨Graph Algorithms£© 250
4£®8 Á·Ï°£¨Exercises£© 250
4£®8£®1 °´Ä£ÅÅÐò£¨Sorting by Magnitude£© 250
4£®8£®2 STLÈÝÆ÷£¨STL Container£© 250
4£®8£®3 ¸´Êý£¨Complex Numbers£© 250
µÚ5Õ Ԫ±à³Ì£¨Meta-Programming£© 252
5£®1 ÈñàÒëÆ÷½øÐмÆË㣨Let the Compiler Compute£© 252
5£®1£®1 ±àÒëÆÚº¯Êý£¨Compile-Time Functions£© 253
5£®1£®2 À©Õ¹µÄ±àÒëÆÚº¯Êý£¨Extended Compile-Time Functions£© 255
5£®1£®3 ÖÊÊý£¨Primeness£© 257
5£®1£®4 ´Ë³£Êý£¿±Ë³£Êý£¿£¨How Constant Are Our Constants?£© 259
5£®2 ÌṩºÍʹÓÃÀàÐÍÐÅÏ¢£¨Providing and Using Type Information£© 260
5£®2£®1 ÀàÐÍÌØÕ÷£¨Type Traits£© 261
5£®2£®2 Ìõ¼þÒì³£´¦Àí£¨Conditional Exception Handling£© 264
5£®2£®3 Ò»¸öconstÕû½àÊÓͼµÄÓÃÀý£¨A const-Clean View Example£© 265
5£®2£®4 ±ê×¼ÀàÐÍÌØÕ÷£¨Standard Type Traits£© 272
5£®2£®5 ÁìÓòÌض¨µÄÀàÐÍÊôÐÔ£¨Domain-Specific Type Properties£© 272
5£®2£®6 enable_if 274
5£®2£®7 аæ±ä²ÎÄ£°å£¨Variadic Templates Revised£© 278
5£®3 ±í´ïʽģ°å£¨Expression Templates£© 281
5£®3£®1 Ò»¸ö¼òµ¥µÄ²Ù×÷·ûʵÏÖ£¨Simple Operator Implementation£© 281
5£®3£®2 Ò»¸ö±í´ïʽģ°åÀࣨAn Expression Template Class£© 285
5£®3£®3 ·º»¯µÄ±í´ïʽģ°å£¨Generic Expression Templates£© 288
5£®4 ÔªÓÅ»¯£º±àдÄã×Ô¼ºµÄ±àÒëÆ÷ÓÅ»¯£¨Meta-Tuning£º Write Your Own Compiler Optimization£© 290
5£®4£®1 ¾­µäµÄ¹Ì¶¨´óСµÄÑ­»·Õ¹¿ª£¨Classical Fixed-Size Unrolling£© 292
5£®4£®2 ǶÌ×Õ¹¿ª£¨Nested Unrolling£© 295
5£®4£®3 ¶¯Ì¬Ñ­»·Õ¹¿ª¨D¨DÈÈÉí£¨Dynamic Unrolling¨DWarm-up£© 301
5£®4£®4 Õ¹¿ªÏòÁ¿±í´ïʽ£¨Unrolling Vector Expressions£© 303
5£®4£®5 µ÷Óűí´ïʽģ°å£¨Tuning an Expression Template£© 305
5£®4£®6 µ÷ÓÅËõ¼õÔËË㣨Tuning Reduction Operations£© 308
5£®4£®7 µ÷ÓÅǶÌ×Ñ­»·£¨Tuning Nested Loops£© 316
5£®4£®8 µ÷ÓÅÒ»ÀÀ£¨Tuning Résum飩 322
5£®5 Á·Ï°£¨Exercises£© 323
5£®5£®1 ÀàÐÍÌØÕ÷£¨Type Traits£© 323
5£®5£®2 FibonacciÊýÁУ¨Fibonacci Sequence£© 323
5£®5£®3 Ôª±à³Ì°æµÄ*´ó¹«Ô¼Êý£¨Meta-Program for Greatest Common Divisor£© 323
5£®5£®4 ÏòÁ¿±í´ïʽģ°å£¨Vector Expression Template£© 324
5£®5£®5 ÔªÁÐ±í£¨Meta-List£© 325
µÚ6Õ ÃæÏò¶ÔÏó±à³Ì£¨Object-Oriented Programming£© 326
6£®1 »ù±¾Ô­Ôò£¨Basic Principles£© 327
6£®1£®1 »ùÀàºÍÅÉÉúÀࣨBase and Derived Classes£© 327
6£®1£®2 ¼Ì³Ð¹¹Ô죨Inheriting Constructors£© 331
6£®1£®3 Ð麯ÊýºÍ¶à̬ÀࣨVirtual Functions and Polymorphic Classes£© 332
6£®1£®4 »ùÓڼ̳еķº¯Êý£¨Functors via Inheritance£© 338
6£®2 Ïû³ýÈßÓࣨRemoving Redundancy£© 339
6£®3 ¶àÖؼ̳У¨Multiple Inheritance£© 340
6£®3£®1 ¶à¸ö¸¸ÀࣨMultiple Parents£© 340
6£®3£®2 ¹«¹²×游£¨Common Grandparents£© 342
6£®4 ͨ¹ý×ÓÀàÐͽøÐж¯Ì¬Ñ¡Ôñ£¨Dynamic Selection by Sub-typing£© 347
6£®5 ת»»£¨Conversion£© 350
6£®5£®1 ÔÚ»ùÀàºÍÅÉÉúÀàÖ®¼äת»»£¨Casting between Base and Derived Classes£© 351
6£®5£®2 constת»»£¨const-Cast£© 356
6£®5£®3 ÖؽâÊÍתÐÍ£¨Reinterpretation Cast£© 356
6£®5£®4 º¯Êý·ç¸ñµÄתÐÍ£¨Function-Style Conversion£© 357
6£®5£®5 Òþʽת»»£¨Implicit Conversions£© 359
6£®6 CRTP 359
6£®6£®1 Ò»¸ö¼òµ¥µÄÀý×Ó£¨A Simple Example£© 360
6£®6£®2 Ò»¸ö¿É¸´ÓõķÃÎʲÙ×÷·û£¨A Reusable Access Operator£© 361
6£®7 Á·Ï°£¨Exercises) 364
6£®7£®1 ÎÞÈßÓàµÄÁâÐμ̳У¨Non-redundant Diamond Shape£© 364
6£®7£®2 ¼Ì³ÐÏòÁ¿ÀࣨInheritance Vector Class£© 364
6£®7£®3 ¿Ë¡º¯Êý£¨Clone Function£© 364
µÚ7Õ ¿Æѧ¼ÆËãÏîÄ¿£¨Scientific Projects£© 365
7£®1 ³£Î¢·Ö·½³Ì½âËãÆ÷µÄʵÏÖ£¨Implementation of ODE Solvers£© 365
7£®1£®1 ³£Î¢·Ö·½³Ì£¨Ordinary Differential Equations£© 366
7£®1£®2 Áú¸ñ-¿âËþ·¨£¨Runge-Kutta Algorithms£© 368
7£®1£®3 ·ºÐÍʵÏÖ£¨Generic Implementation£© 369
7£®1£®4 Õ¹Íû£¨Outlook£© 376
7£®2 ´´½¨¹¤³Ì£¨Creating Projects£© 377
7£®2£®1 ¹¹½¨¹ý³Ì£¨Build Process£© 378
7£®2£®2 ¹¹½¨¹¤¾ß£¨Build Tools£© 382
7£®2£®3 ·ÖÀë±àÒ루Separate Compilation£© 386
7£®3 *ÖյĻ°£¨Some Final Words£© 391
¸½Â¼A ÔÓ̸£¨Clumsy Stuff£© 393
A£®1 ¸ü¶àºÃµÄ»òÕß²»ºÃµÄÈí¼þ£¨More Good and Bad Scientific Software£© 393
A£®2 ϸ½ÚÖеĻù´¡£¨Basics in Detail£© 400
A£®2£®1 ¹ØÓÚ×ÖÃæÁ¿ÐÞÊεÄÆäËûÊÂÏMore about Qualifying Literals£© 400
A£®2£®2 ¾²Ì¬±äÁ¿£¨static Variables£© 401
A£®2£®3 ¹ØÓÚifµÄÆäËûÊÂÏMore about if£© 402
A£®2£®4 ´ï·òÉ豸£¨Duff¡¯s Device£© 404
A£®2£®5 ¹ØÓÚmainµÄÆäËûÊÂÏMore about main£© 404
A£®2£®6 Òì³£»¹ÊǶÏÑÔ£¿£¨Assertion or Exception?£© 405
A£®2£®7 ¶þ½øÖÆI/O£¨Binary I/O£© 406
A£®2£®8 C·ç¸ñµÄI/O£¨C-Style I/O£© 407
A£®2£®9 À¬»øÊÕ¼¯£¨Garbage Collection£© 408
A£®2£®10 ºêµÄÂé·³£¨Trouble with Macros£© 409
A£®3 ÏÖʵÊÀ½çµÄÓÃÀý£º¾ØÕóÇóÄ棨Real-World Example£º Matrix Inversion£© 411
A£®4 ÀàµÄһЩϸ½Ú£¨Class Details£© 421
A£®4£®1 Ö¸Ïò³ÉÔ±µÄÖ¸Õ루Pointer to Member£© 421
A£®4£®2 ¸ü¶àµÄ³õʼ»¯Àý×Ó£¨More Initialization Examples£© 422
A£®4£®3 ¶àάÊý×éµÄ´æÈ¡£¨Accessing Multi-dimensional Arrays£© 423
A£®5 ·½·¨µÄÉú³É£¨Method Generation£© 426
A£®5£®1 ¿ØÖÆÉú³ÉµÄ´úÂ루Controlling the Generation£© 428
A£®5£®2 ´úÂëÉú³ÉµÄ¹æÔò£¨Generation Rules£© 429
A£®5£®3 ÏÝÚåºÍÉè¼ÆÖ¸ÄÏ£¨Pitfalls and Design Guides£© 434
A£®6 Ä£°åÏà¹ØµÄϸ½Ú£¨Template Details£© 438
A£®6£®1 ͳһ³õʼ»¯£¨Uniform Initialization£© 438
A£®6£®2 Äĸöº¯Êý±»µ÷ÓÃÁË£¿£¨Which Function Is Called?£© 439
A£®6£®3 Õë¶ÔÌض¨Ó²¼þµÄÌØ»¯£¨Specializing for Specific Hardware£© 442
A£®6£®4 ±ä²Î¶þ½øÖÆI/O£¨Variadic Binary I/O£© 443
A£®7 ʹÓÃC++03ÖеÄstd£º£ºvector£¨Using std£º£ºvector in C++03£© 444
A£®8 ¸´¹Å·ç¸ñµÄ¶¯Ì¬Ñ¡Ôñ£¨Dynamic Selection in Old Style£© 445
A£®9 Ôª±à³ÌµÄһЩϸ½Ú£¨Meta-Programming Details£© 446
A£®9£®1 ÀúÊ·ÉϵÄ**¸öÔª³ÌÐò£¨First Meta-Program in History£© 446
A£®9£®2 Ôªº¯Êý£¨Meta-Functions£© 448
A£®9£®3 ÏòϼæÈݵľ²Ì¬¶ÏÑÔ£¨Backward-Compatible Static Assertion£© 450
A£®9£®4 ÄäÃûÀàÐͲÎÊý£¨Anonymous Type Parameters£© 450
A£®9£®5 ¡°¶¯Ì¬Ñ­»·Õ¹¿ª¡±µÄÐÔÄÜ»ù×¼²âÊÔÔ´Â루Benchmark Sources of
Dynamic Unrolling£© 454
A£®9£®6 ¾ØÕó³Ë·¨µÄÐÔÄÜ»ù×¼²âÊÔ£¨Benchmark for Matrix Product£© 455
¸½Â¼B ±à³Ì¹¤¾ß£¨Programming Tools£© 456
B£®1 gcc 456
B£®2 µ÷ÊÔ£¨Debugging£© 457
B£®2£®1 »ùÓÚÎı¾µÄµ÷ÊÔÆ÷£¨Text-Based Debugger£© 458
B£®2£®2 ʹÓÃͼÐνçÃæDDD½øÐе÷ÊÔ£¨Debugging with Graphical Interface£º DDD£© 460
B£®3 ÄÚ´æ·ÖÎö£¨Memory Analysis£© 462
B£®4 gnuplot 463
B£®5 UNIX¡¢LinuxºÍmacOSϵͳ£¨UNIX£¬ Linux£¬ and macOS£© 464
¸½Â¼C ÓïÑÔ¶¨Ò壨Language Definitions£© 467
C£®1 ÖµÀà±ð£¨Value Categories£© 467
C£®2 ²Ù×÷·û¸ÅÀÀ£¨Operator Overview£© 468
C£®3 ÀàÐÍת»»¹æÔò£¨Conversion Rules£© 470
C£®3£®1 ÀàÐÍÌáÉý£¨Promotion£© 471
C£®3£®2 ÆäËûÀàÐÍÌáÉý£¨Other Conversions£© 471
C£®3£®3 ³£ÓõÄÊýֵת»»£¨Usual Arithmetic Conversions£© 472
C£®3£®4 Õ­»¯£¨Narrowing£©