Essential_C++[Stanley_B._Lippman]【英文版】

C++

需积分: 11 138 浏览量更新于2023-05-29 评论收藏 669KB PDF 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

资源详情

资源评论

资源推荐

Table of

Contents

Essential C++

By Stanley B. Lippman

Publisher: Addison Wesley

Pub Date: September 12, 2002

ISBN: 0-201-48518-4

Pages: 416

"Readers can pick up this book and become familiar with C++ in a short time. Stan has

taken a very broad and complicated topic and reduced it to the essentials that budding

C++ programmers need to know to write real programs. His case study is effective and

provides a familiar thread throughout the book." -Steve Vinoski, IONA

For the practicing programmer with little time to spare, Essential C++ offers a fast-track

to learning and working with C++ on the job. This book is specifically designed to bring

you up to speed in a short amount of time. It focuses on the elements of C++

programming that you are most likely to encounter and examines features and techniques

that help solve real-world programming challenges.

Essential C++ presents the basics of C++ in the context of procedural, generic, object-

based, and object-oriented programming. It is organized around a series of increasingly

complex programming problems, and language features are introduced as solutions to

these problems. In this way you will not only learn about the functions and structure of

C++, but will understand their purpose and rationale.

You will find in-depth coverage of key topics such as:

• Generic programming and the Standard Template Library (STL)

• Object-based programming and class design

• Object-oriented programming and the design of class hierarchies

• Function and class template design and use

• Exception handling and Run-Time Type Identification

In addition, an invaluable appendix provides complete solutions to, and detailed

explanations of, the programming exercises found at the end of each chapter. A second

appendix offers a quick reference handbook for the generic algorithms, providing an

example of how each is used.

This concise tutorial will give you a working knowledge of C++ and a firm foundation on

which to further your professional expertise.

Table of Content

Table of Content .................................................................................................................. i

Copyright.............................................................................................................................. v

Dedication ...................................................................................................................... vi

Preface................................................................................................................................vi

Structure of This Book................................................................................................. vii

A Note on the Source Code.......................................................................................viii

Acknowledgments.......................................................................................................viii

Where to Find More Information................................................................................. ix

Typographical Conventions......................................................................................... ix

Chapter 1. Basic C++ Programming ............................................................................... 1

1.1 How to Write a C++ Program ................................................................................ 1

1.2 Defining and Initializing a Data Object................................................................. 6

1.3 Writing Expressions ................................................................................................ 9

1.4 Writing Conditional and Loop Statements......................................................... 13

1.5 How to Use Arrays and Vectors.......................................................................... 19

1.6 Pointers Allow for Flexibility ................................................................................. 23

1.7 Writing and Reading Files.................................................................................... 26

Chapter 2. Procedural Programming............................................................................. 30

2.1 How to Write a Function....................................................................................... 30

2.2 Invoking a Function............................................................................................... 35

2.3 Providing Default Parameter Values .................................................................. 43

2.4 Using Local Static Objects................................................................................... 45

2.5 Declaring a Function Inline .................................................................................. 47

2.6 Providing Overloaded Functions......................................................................... 48

2.7 Defining and Using Template Functions............................................................ 49

2.8 Pointers to Functions Add Flexibility .................................................................. 52

2.9 Setting Up a Header File...................................................................................... 54

Chapter 3. Generic Programming.................................................................................. 57

3.1 The Arithmetic of Pointers.................................................................................... 57

3.2 Making Sense of Iterators.................................................................................... 62

3.3 Operations Common to All Containers .............................................................. 65

3.4 Using the Sequential Containers ........................................................................ 66

3.5 Using the Generic Algorithms.............................................................................. 69

3.6 How to Design a Generic Algorithm ................................................................... 71

3.7 Using a Map ........................................................................................................... 77

3.8 Using a Set............................................................................................................. 78

3.9 How to Use Iterator Inserters............................................................................... 80

3.10 Using the iostream Iterators .............................................................................. 81

Chapter 4. Object-Based Programming........................................................................ 85

4.1 How to Implement a Class................................................................................... 86

4.2 What Are Class Constructors and the Class Destructor?............................... 89

4.3 What Are mutable and const?........................................................................ 94

4.4 What Is the this Pointer?................................................................................... 97

4.5 Static Class Members........................................................................................... 99

4.6 Building an Iterator Class................................................................................... 102

4.7 Collaboration Sometimes Requires Friendship .............................................. 106

4.8 Implementing a Copy Assignment Operator ................................................... 108

4.9 Implementing a Function Object ....................................................................... 109

4.10 Providing Class Instances of the iostream Operators ................................. 111

4.11 Pointers to Class Member Functions............................................................. 112

Chapter 5. Object-Oriented Programming.................................................................. 117

5.1 Object-Oriented Programming Concepts......................................................... 117

iii

5.2 A Tour of Object-Oriented Programming......................................................... 119

5.3 Polymorphism without Inheritance.................................................................... 123

5.4 Defining an Abstract Base Class ...................................................................... 125

5.5 Defining a Derived Class.................................................................................... 128

5.6 Using an Inheritance Hierarchy......................................................................... 133

5.7 How Abstract Should a Base Class Be?.......................................................... 135

5.8 Initialization, Destruction, and Copy................................................................. 136

5.9 Defining a Derived Class Virtual Function....................................................... 138

5.10 Run-Time Type Identification .......................................................................... 141

Chapter 6. Programming with Templates................................................................... 144

6.1 Parameterized Types.......................................................................................... 145

6.2 The Template Class Definition .......................................................................... 147

6.3 Handling Template Type Parameters .............................................................. 148

6.4 Implementing the Template Class .................................................................... 150

6.5 A Function Template Output Operator............................................................. 155

6.6 Constant Expressions and Default Parameters.............................................. 156

6.7 Template Parameters as Strategy.................................................................... 160

6.8 Member Template Functions............................................................................. 161

Chapter 7. Exception Handling..................................................................................... 164

7.1 Throwing an Exception....................................................................................... 164

7.2 Catching an Exception........................................................................................ 165

7.3 Trying for an Exception....................................................................................... 167

7.4 Local Resource Management............................................................................ 170

7.5 The Standard Exceptions................................................................................... 172

Appendix A. Exercise Solutions ................................................................................... 176

Exercise 1.4 ................................................................................................................ 176

Exercise 1.5 ................................................................................................................ 177

Exercise 1.6 ................................................................................................................ 179

Exercise 1.7 ................................................................................................................ 180

Exercise 1.8 ................................................................................................................ 181

Exercise 2.1 ................................................................................................................ 182

Exercise 2.2 ................................................................................................................ 183

Exercise 2.3 ................................................................................................................ 184

Exercise 2.4 ................................................................................................................ 185

Exercise 2.5 ................................................................................................................ 186

Exercise 2.6 ................................................................................................................ 187

Exercise 3.1 ................................................................................................................ 188

Exercise 3.2 ................................................................................................................ 190

Exercise 3.3 ................................................................................................................ 191

Exercise 3.4 ................................................................................................................ 194

Exercise 4.1 ................................................................................................................ 196

Exercise 4.2 ................................................................................................................ 197

Exercise 4.3 ................................................................................................................ 198

Exercise 4.4 ................................................................................................................ 199

Exercise 4.5 ................................................................................................................ 202

Exercise 5.1 ................................................................................................................ 205

Exercise 5.2 ................................................................................................................ 208

Exercise 5.3 ................................................................................................................ 209

Exercise 5.4 ................................................................................................................ 210

Exercise 6.1 ................................................................................................................ 210

Exercise 6.2 ................................................................................................................ 212

Exercise 7.1 ................................................................................................................ 216

7.2 Exercise 7.2.......................................................................................................... 217

7.3 Exercise 7.3.......................................................................................................... 218

Appendix B. Generic Algorithms Handbook............................................................... 220

accumulate() ................................................................................................................. 221

adjacent_difference().................................................................................................... 221

adjacent_find().............................................................................................................. 221

binary_search() ............................................................................................................. 221

copy()............................................................................................................................ 222

copy_backward() .......................................................................................................... 222

count()........................................................................................................................... 222

count_if() ...................................................................................................................... 222

equal()........................................................................................................................... 222

fill()............................................................................................................................. 223

fill_n()........................................................................................................................... 223

find()............................................................................................................................. 223

find_end() ..................................................................................................................... 223

find_first_of() ............................................................................................................... 224

find_if()......................................................................................................................... 224

for_each()...................................................................................................................... 224

generate()...................................................................................................................... 224

generate_n().................................................................................................................. 225

includes() ...................................................................................................................... 225

inner_product() ............................................................................................................. 225

inplace_merge()............................................................................................................ 226

iter_swap().................................................................................................................... 226

lexicographical_compare() ........................................................................................... 226

max(), min().................................................................................................................. 227

max_element() , min_element().................................................................................... 227

merge().......................................................................................................................... 227

nth_element()................................................................................................................ 228

partial_sort(), partial_sort_copy()................................................................................. 228

partial_sum()................................................................................................................. 229

partition(), stable_partition()......................................................................................... 229

random_shuffle() .......................................................................................................... 229

remove(), remove_copy() ............................................................................................. 230

remove_if(), remove_copy_if() .................................................................................... 230

replace(), replace_copy().............................................................................................. 231

replace_if(), replace_copy_if() ..................................................................................... 231

reverse(), reverse_copy().............................................................................................. 231

rotate(), rotate_copy()................................................................................................... 231

search() ......................................................................................................................... 232

search_n() ..................................................................................................................... 232

set_difference()............................................................................................................. 233

set_intersection()........................................................................................................... 233

set_symmetric_difference().......................................................................................... 233

set_union()............................................................................................................ 233

sort(), stable_sort()........................................................................................................ 234

transform().................................................................................................................... 234

unique(), unique_copy()................................................................................................ 235

剩余250页未读，继续阅读

unilinu

粉丝: 0
资源: 7

会员权益专享

Essential_C++[Stanley_B._Lippman]【英文版】

评论0

会员权益专享

最新资源

Essential_C++[Stanley_B._Lippman]【英文版】

评论0

inside the c++ object model

计算机组成原理和体系结构 2.操作系统和计算机网络 3.数据结构和算法设计 4.编程语言和编程范式 5.软件工程和项目管理 6.数据库和数据管理 7.计算机安全和密码学 8.人工智能和机器学习什么学习资料好

列出人工智能发展史上有关的产品及应用

stanley算法代码

split_bregman

有哪些文献对ESG投资的发展历程进行了研究

计算机《网络安全知识》试题及答案.pdf

微信小程序源码模版_豆瓣图书.rar

课程设计-基于MATLAB的水果分级系统（含源码、数据、报告）

python基于SVD的推荐算法

SPI时序详解 嵌入式SPI学习

it项目执行控制阶段36 范围进度成本质量采购变更一览表.doc

Axure_Webdings_一些特殊的黑白字符(字符格式).rplib

会员权益专享

最新资源

SPI时序详解嵌入式SPI学习