C ++ primer English version (version 5th)

Author: (US) Lippman, S. B .) (US) Lajoie (Lajoie, J .) (US) Moo, B. E .) publishing House: E-Industry Publishing House ISBN: 9787121200380 Release Date: May 2013 publication date: Open Book: 16 open page: 964 versions: 5-1 category: computer> Software and program design> C ++ more about "C ++ primer English version (5th) "Content Overview computer books this prestigious C ++ classic tutorial, after eight years, has ushered in an unprecedented major upgrade. In addition to benefiting countless programmers around the world, the C ++ master Stanley B. lippman's rich practical experience, the original director of the C ++ Standards Committee Jos é e Lajoie's in-depth understanding of the C ++ standards, and the C ++ pioneer Barbara E. moo's insights on C ++ teaching are fully and thoroughly updated based on the new C ++ 11 standard. It is very commendable that all examples of C ++ primer English version (version 5th) are rewritten using the C ++ 11 standard, this is extremely rare in the classic upgrade-it fully reflects the significant progress of the C ++ language and is extremely comprehensive. The rich content of the book's teaching aids, eye-catching knowledge tips, and well-organized programming demonstrations make this book's authoritative position in the C ++ field even more unshakable. This book is undoubtedly the first choice for beginners, middle and senior programmers. English version of C ++ primer (version 5th) "prefacechapter 1 getting started 11.1 writing a simple C ++ program 21.1.1 compiling and executing our program 31.2 contains input/output 51.3 blocks 91.4 flowofcontrol 111.4.1 the limit 111.4.2 the forstatement 131.4.3 contains inputs beyond the ifstatement 171.5 introducingclasses 191.5.1 the sales_itemclass 201.5.2 afirstlookatmemberfunctions 231.6 thebookstoreprogram. 24 hours 26 minutes 26 Part I the basics 29 Chapter 2 variables and basic types 312.1 blocks-intypes 322.1.1 limit 322.1.2 typeconversions 352.1.3 literals 382.2 variables 412.2.1 limit 412.2.2 limit 442.2.3 identifiers 462.2.4 scopeof aname 482.3 limit 502.3.1 references 502.3.2 pointers 522.3.3 limit 572.4 limit 592.4.1 references to const limit pointers and const 622.4.3 top-level const limit 652.5 limit 672.5.2 the limit 682.5.3 the limit 702.6 limit 722.6.1 defining using the sales_dataclass 742.6.3 writing our own header files 76 chaptersummary 78 definedterms 78 chapter 3 strings, vectors, and define 813.1 namespace between 823.2 library stringtype 843.2.1 defining and initializing strings 843.2.2 operations on strings 853.2.3 dealing with the characters in a string 903.3 library vectortype definition and initializing vectors before adding elements to a vector 1003.3.3 other versions 1023.4 versions earlier than 3.4.1 versions earlier than 3.4.2 earlier than 1113.5 arrays 1133.5.1 lower-than three versions of anarray earlier than 3.5.3 pointers andarrays lower C-greater than 1243.6 lower 125 chaptersummary 131 definedterms 131 Chapter 4 expressions 1334.1 versions 1344.1.2 g01364.1.3 g01374.2 g01394.3 logical certification 1414.4 April 1444.5 increment certification 1474.6 April 1504.7 April 1514.8 the latest 1524.9 commaoperator 1564.10 typeconversions extends other limit 1614.11.3 explicitconversions 1574.11 limit 1624.12 chaptersummary 166 definedterms 168 Chapter 5 statements 1715.1 simple statements 1725.2 statementscope 1745.3 conditional statements beyond the ifstatement beyond the switchstatement 1785.4 beyond the permitted parameter range forstatement beyond the do not 1895.5 beyond 5.5.1 The breakstatement limit 5.5.2 fig fig arrayparameters 2146.2.5 main: handlingcommand-lineoptions before release 2206.3 return types and the specified parameter must be 2236.3.2 then 2236.3.3 then toanarray 2286.4 then 2306.4.1 then 2346.5 features before release 2366.5.2 inline and between 2386.5.3 aids for debugging 2406.6 functionmatching before release 2456.7 pointers tofunctions 247 chaptersummary 251 definedterms 251 Chapter 7 classes 2537.1 faster than 2547.1.1 designing the faster 2547.1.2 defining the revised limit 2567.1.3 faster-relatedfunctions 2607.1.4 constructors 2627.1.5 copy, assignment, anddestruction 2677.2 accesscontrol limit 2687.2.1 friends 2697.3 limit 2717.3.1 limit 2717.3.2 functions that return * this limit classtypes limit 2797.4 classscope limit 2837.5 limit constructor initializerlist limit theroleof limit-typeconversions limit copyright copyright 2997.6 copyright 300 chaptersummary 305 definedterms 305 contents xipart II the C ++ library 307 Chapter 8 the IO library 3098.1 the ioclasses 3108.1.1 copyright %3118.1.2 conditionstates 3128.1.3 copyright 3148.2 file input and output limit 8.2.1 using file stream objects extends file modes 3198.3 stringstreams extends using an istringstream extends using limit 323 chaptersummary 324 definedterms 324 Chapter 9 sequential containers 3259.1 overviewof the limit 3269.2 faster than iterators limit between begin and endbers limit please wait and swap then there will be 3409.3 seconds before addingelements then there will be too many connections .3.3 too many specialized under 3509.3.5 too many connections 3539.4 how a vectorgrows 3559.5 additional stringoperations 3609.5.1 other ways to construct strings 3609.5.2 to change a string 3619.5.3 stringsearchoperations 3649.5.4 the comparefunctions 3669.5.5 numericconversions 3679.6 containeradaptors 368 chaptersummary 372 definedterms 372 chapter 10 generic algorithms 37510.1 overview. 37610.2 too many requests 10.2.1 read-only requests 10.2.2 too many 10.2.3 too 38310.3 too many 10.3.1 too many 10.3.2 too many requests exceed 39710.4 revisiting iterators 40110.4.1 insert into multiple iostream without reverse limit 40710.5 faster than 10.5.1 thefive limit 10.5.2 too many 41210.5.3 container 41310.6 container-plugin 415 chaptersummary 417 definedterms 417 Chapter 11 Associative containers 41911.1 overview 42011.2 overviewof specific parameter requirements onkeytype limit 11.2.3 The pairtype 42611.3 operations limit parameter addingelements limit subscripting A map 43511.3.5 throughput limit 44011.4 limit 443 chaptersummary 447 definedterms 447 Chapter 12 dynamicmemory 44912.1 limit 12.1.1 the maximum throughput 12.1.2 exceeds using limit with new minimum smartpointers andexceptions limit unique_ptr limit 2.2 47312.2 limit 47712. the allocatorclass 48112.3 usingthelibrary: atext-queryprogram 48412.3.1 designof thequeryprogram 48512.3.2 definingthequeryprogramclasses 487 chaptersummary 491 definedterms 491 Part III tools for class authors 493 chapter 13 copy control 49513.1 copy, assign, anddestroy then 49613.1.2 thecopy-extract 50013.1.3 10950113.1.4 copyright/five 50313.1.5 using = default quota limit 50713.2 copycontrol limit 13.2.2 limit 51313.3 swap 51613.4 acopy-controlexample 51913.5 limit 52413.6 movingobjects limit copyright 53413.6.3 copyright 544 chaptersummary 549 definedterms 549 chapter 14 overloaded operations and conversions 55114.1 basicconcepts 55214.2 input records 55614.2.1 overloading the output operator [[55714.2.2 overloading the input operator]. 55814.3 arithmetic versions 56014.3.1 equalityoperators 56114.3.2 limit 56214.4 limit 56314.5 subscriptoperator 56414.6 Increment Limit 56614.7 limit 56914.8 function-calloperator limit 57214.8.2 library-callback callable objects and function 57614.9 overloading, conversions, andoperators 57914.9.1 conversionoperators 58014.9.2 avoidingambiguousconversions 58314.9.3 summary 587 chaptersummary 590 definedterms 590 chapter 15 object-oriented programming 59115.1 OOP: anoverview 59215.2 was 59415.2.1 was wrongly formed into conversions versions was 60115.3 virtualfunctions 60315.4 was 60815.5 accesscontrol was 61115.6 was released inheritance 61715.7 constructors andcopycontrol was virtualdestructors were wrongly formed into derived-classcopy-controlmembers limit was 62815.8 writing a basketclass 63115.9 extends jsonanobject-orientedsolution 63615.9.2 the query_base and queryclasses extends beyond the evalfunctions 645 chaptersummary 649 definedterms 649 Chapter 16 templates and generic programming 65116.1 definingatemplate. 20171000065216.1.2 10965816.1.3 10966816.1.4 10967216.1.5 controlling instantiations extends efficiency and flexibility 67616.2 extends conversions without function-extends trailing return types and type transformation extends understanding STD:: move into forwarding 69216.3 seconds 69416.4 seconds before creating a packexpansion limit 70416.5 template specializations 706 chaptersummary 713 definedterms 713 Part IV advanced topics 715 chapter 17 specialized library facilities 71717.1 the tupletype limit defining and initializing tuples limit using a tuple limit 72117.2 the bitsettype limit defining and initializing bitsets limit operations on bitsets 72517.3 regularexpressions limit using limit 74117.4 limit random-numberengines limit otherkinds ofdistributions 74917.5 registry.formattedinput shortlisted/registry.randomaccess toastream 763 chaptersummary 769 found 769 chapter 18 tools for large programs 77118.1 exceptionhandling throwinganexception when using function tryblocks andconstructors beyond the specified parameter limit 78218.2 namespaces limit namespacedefinitions 78518.2.2 usingnamespacemembers 79218.2.3 classes, namespaces, andscope limits limit 80018.3 multiple andvirtual limits limit multiple limit conversions limit inheritance limit virtual inheritance limit constructors andvirtual inheritance 813 chaptersummary 816 definedterms 816 Chapter 19 limit tools and limit 81919.1 controlling memory allocation limit overload new and delete 82019.1.2 placement newexpressions 82319.2 run-since the specified parameter the typeidoperator has already reached the type_infoclass 83119.3 enumerations 83219.4 pointer when there are pointers when pointers tomemberfunctions usingmemberfunctions ascallableobjects 84119.5 limit 84319.6 Union: aspace-savingclass 84719.7 localclasses 85219.8 extends 85419.8.1 bit-fields 85419.8.2 volatilequalifier 85619.8.3 linkage directives: extern "C" 857 chaptersummary 862 definedterms 862 Appendix A the library 865a. 1 librarynames andheaders 866a. 2 abrieftourof thealgorithms 870a. 2.1 algorithms tofindanobject 871a. 2.2 otherread-onlyalgorithms 872a. 2.3 binarysearchalgorithms 873a. 2.4 algorithmsthatwritecontainerelements 873a. 2.5 partitioningandsortingalgorithms 875a. 2.6 generalreorderingoperations 877a. 2.7 permutationalgorithms 879a. 2.8 setalgorithms forsortedsequences 880a. 2.9 minimumandmaximumvalues 880a. 2.10 numericalgorithms 881a. 3 randomnumbers 882a. 3.1 randomnumberdistributions 883a. 3.2 randomnumberengines 884 Book Information Source: China Interactive publishing network