Essential C++ (Stanley B. Lippman) (z-library.sk, 1lib.sk, z-lib.sk)

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.

ii 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

iv 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

v Copyright Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and Addison-Wesley was aware of a trademark claim, the designations have been printed in initial capital letters or all capital letters. The author and publisher have taken care in preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. The programs and applications presented in this book have been included for their instructional value. They have been tested with care, but are not guaranteed for any particular purpose. The authors and publisher do not offer any warranties or representations, nor do they accept any liabilities with respect to the programs or applications. The publisher offers discounts on this book when ordered in quantity for special sales. For more information please contact: Corporate, Government, and Special Sales Addison Wesley Longman, Inc. One Jacob Way Reading, Massachusetts 01867 Copyright © 2000 Addison Wesley Longman Library of Congress Cataloging-in-Publication Data Lippman, Stanley B. Essential C++ / Stanley B. Lippman p. cm. Includes bibliographical references and index. 1. C++ (Computer program language) I. Title. QA76.73.C153 L577 1999 005.13'3--dc21 99–046613 CIP All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form, or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior consent of the publisher. Printed in the United States of America. Published simultaneously in Canada.

vi 1 2 3 4 5 6 7 8 9—MA—0302010099 First printing, October 1999 Dedication To Beth, who remains essential — To Danny and Anna, hey, kids look, it's done ... Preface Gosh, but this book is short. I mean, wow. My C++ Primer is 1237 pages counting the index, title, and dedication pages. This one weighs in at 276 — in boxing terms, we're talking bantamweight. The first question, of course, is how come? Actually, there's a story to that. I'd been pestering everyone at Disney Feature Animation for a number of years to let me work on a production. I asked directors, management types — even Mickey, if the truth be told. In part, it was for the glamour, I suppose. Hollywood. The big screen. Also, I hold a Master of Fine Arts as well as my Comp Sci degree, and film work seemed to promise some sort of personal synthesis. What I told management, of course, was that I needed the experience in production in order to provide usable tools. As a compiler writer, I'd always been one of my own main users. It's difficult to get defensive or feel unfairly criticized when you're one of the principal complainers about your software. The computer effects lead on the Firebird segment of Fantasia 2000 was interested in having me join the production. To kind of try things out, he asked me to write a tool to read the raw Disney camera information for a scene and generate a camera node that could be plugged in to the Houdini animation package. I wrote it in C++, of course. It worked. They liked it. I was invited to come on board. Once on the production (thanks to Jinko and Chyuan), I was asked to rewrite the tool in Perl. The other TDs, it was explained, weren't heavy-duty programmers but knew Perl, Tcl, and so on. (TD is film industry jargon for technical director. I was the segment's software TD. There was also a lighting TD [hi, Mira] and a model TD [hi, Tim] as well as the actual computer effects animators [hi, Mike, Steve, and Tonya].) And oh, by the way, could I do this quickly, because, gosh, we have a proof of concept test to get out that the directors (hi, Paul and Gaetan) and effects supervisor (hi, Dave) are waiting for to pitch to the then head of Feature Animation (hi, Peter). No emergency, you understand, but ... This left me in somewhat of a quandary. I can program reasonably quickly in C++ with confidence. Unfortunately, I didn't know Perl. I thought, OK, I'll read a book. But it can't be too big a book, at least not right now. And it had better not tell me too much, although I know I should know everything, only later. After all, this is show biz: The directors need a proof of concept, the artist needs a plug-in to prove the concept, and the producer — heck, she needs a 48-hour day. I

vii didn't need the best book on Perl — just the right book to get me going and not steer me too far off the righteous path. I found that book in Learning Perl, by Randal Schwartz. It got me up and running, and it was fun to read. Well, as much as any computer book is fun. It leaves out gobs of good stuff. At the time, though, I didn't need all that stuff — I needed to get my Perl scripts working. Eventually, I realized sadly that the third edition of C++ Primer could no longer fill a similar role for someone needing to learn C++. It had just become too big. I think it's a grand book, of course — particularly with Josée Lajoie coming on board as coauthor of the third edition. But it's too comprehensive for this kind of just-in-time C++ language learning. That's why I decided to write this book. You're probably thinking, but C++ is not Perl. That's correct. And this text is not Learning Perl. It's about learning C++. The real question is, How does one shed almost a thousand pages and still claim to be teaching anything? 1. Level of detail. In computer graphics, level of detail refers to how sharply an image is rendered. The invading Hun on horseback in the left front corner of the screen needs a face with eyes, hair, five o'clock shadow, clothes, and so on. The Hun way back there — no, not the rock, silly — well, we don't render both images with the same care for detail. Similarly, the level of detail in this book is clamped down considerably. C++ Primer, in my opinion, has the most complete but readable discussion of operator overloading in existence (I can say that because Josée was the author). However, it takes 46 pages of discussion and code examples. Here, I take 2 pages. 2. Core language. When I was editor of the C++ Report, I used to say that half the job of editing the magazine was in deciding what not to put in. The same is true for this text. The text is organized around a series of a programming problems. Language features are introduced to provide a solution to individual problems. I didn't have a problem that multiple or virtual inheritance could solve, so I do not discuss them. To implement an iterator class, however, I had to introduce nested types. Class conversion operators are easy to misuse and are complicated to explain. I therefore chose not to present them. And so on. The choice and order of presentation of language features are always open to criticism. This is my choice and my responsibility. 3. Number of code examples. C++ Primer has hundreds of pages of code that we step through in detail, including an object-oriented Text Query system and about a half-dozen fully implemented classes. Although this text is code-driven, the set of code examples is simply not as rich as that of C++ Primer. To help compensate, solutions to all the program exercises are provided in Appendix A. As my editor, Deborah Lafferty, said, ''If you are trying to teach something quickly, it is helpful to have the answers at your fingertips to reinforce the learning." Structure of This Book The text consists of seven chapters and two appendixes. Chapter 1 provides a description of the predefined language in the context of writing a small interactive program. It covers the built-in data types, the predefined operators, the vector and string library classes, the conditional and looping statements, and the iostream library for input and output. I introduce the vector and string classes in this chapter because I encourage their use over the built-in array and C-style character string.

viii Chapter 2 explains how to design and use a function and walks through the many flavors of functions supported in C++: inline, overloaded, and template functions as well as pointers to functions. Chapter 3 covers what is commonly referred to as the Standard Template Library (STL): a collection of container classes, such as a vector, list, set, and map, and generic algorithms to operate on those containers, such as sort(), copy(), and merge(). Appendix B presents an alphabetical listing of the most commonly used generic algorithms and provides an example of how each one is used. As a C++ programmer, your primary activity is the delivery of classes and object-oriented class hierarchies. Chapter 4 walks through the design and use of the C++ class facility to create data types specific to your application domain. For example, at Dreamworks Animation, where I do some consulting work, we design classes to do four-channel compositing of images and so on. Chapter 5 explains how to extend class design to support families of related classes in object- oriented class hierarchies. Rather than design eight independent image compositing classes, for example, we define a compositing hierarchy using inheritance and dynamic binding. Class templates are the topic of Chapter 6. A class template is a kind of prescription for creating a class in which one or more types or values are parameterized. A vector class, for example, may parameterize the type of element it contains. A buffer class may parameterize not only the type of element it holds but also the size of its buffer. The chapter is driven by the implementation of a binary tree template class. Finally, Chapter 7 illustrates how to use the C++ exception handling facility and fit it into the existing standard library exception class hierarchy. Appendix A provides solutions to the programming exercises. Appendix B provides a program example and discussion of the most frequently used generic algorithms. A Note on the Source Code The full source code of the programs developed within the text as well as the solutions to the exercises is available on-line for downloading both at the Addison Wesley Longman Web site (www.awl.com/cseng/titles/0-201-48518-4) and at my home page (www.objectwrite.com). All the code has been executed under both Visual C++ 5.0 using the Intel C++ compiler and Visual C++ 6.0 using the Microsoft C++ compiler. You may need to modify the code slightly to have it compile on your system. If you make any modifications, send me a list of them (slippman@objectwrite.com), and I will post them, along with your name, in a modifications file attached to the solutions code. (Note that the full source code is not displayed within the text itself.) Acknowledgments Special thanks go to Josée Lajoie, coauthor of C++ Primer, 3rd Edition. She has been a wonderful support because of her insightful comments on the various drafts of this text and her unfailing encouragement. I also offer special thanks to Dave Slayton for going through both the text and the code examples with a razor-sharp green pencil, and to Steve Vinoski for his compassionate but firm comments on the drafts of this text. Special thanks also go to the Addison-Wesley editorial team: Deborah Lafferty, who, as editor, supported this project from the beginning, Betsy Hardinger, who, as copyeditor, contributed

ix greatly to the readability of the text, and John Fuller, who, as production manager, shepherded us from manuscript to bound text. During the writing of this text, I worked as an independent consultant, multiplexing between Essential C++ and a set of (reasonably) understanding clients. I'd like to thank Colin Lipworth, Edwin Leonard, and Kenneth Meyer for their patience and good faith. Where to Find More Information From a completely biased point of view, the two best one-volume introductions to C++ are Lippman and Lajoie's C++ Primer and Stroustrup's The C++ Programming Language, both in their third edition. Throughout the text I refer you to one or both of the texts for more in-depth information. The following books are cited in the text. (A more extensive bibliography can be found in both C++ Primer and The C++ Programming Language.) [LIPPMAN98] Lippman, Stanley, and Josée Lajoie, C++ Primer, 3rd Edition, Addison Wesley Longman, Inc., Reading, MA 1998) ISBN 0-201-82470-1. [LIPPMAN96a] Lippman, Stanley, Inside the C++ Object Model, Addison Wesley Longman, Inc., Reading, MA(1996) ISBN 0-201-83454-5. [LIPPMAN96b] Lippman, Stanley, Editor, C++ Gems, a SIGS Books imprint, Cambridge University Press, Cambridge, England(1996) ISBN 0-13570581-9. [STROUSTRUP97] Stroustrup, Bjarne, The C++ Programming Language, 3rd Edition, Addison Wesley Longman, Inc., Reading, MA(1997) ISBN 0-201-88954-4. [SUTTER99] Sutter, Herb, Exceptional C++, Addison Wesley Longman, Inc., Reading, MA(2000) ISBN 0-201-61562-2. Typographical Conventions The text of the book is set in 10.5 pt. Palatino. Program text and language keywords appear in 8.5 pt. lucida. Functions are identified by following their name with the C++ function call operator (()). Thus, for example, foo represents a program object, and bar() represents a program function. Class names are set in Palatino.

1 Chapter 1. Basic C++ Programming In this chapter, we evolve a small program to exercise the fundamental components of the C++ language. These components consist of the following: 1. A small set of data types: Boolean, character, integer, and floating point. 2. A set of arithmetic, relational, and logical operators to manipulate these types. These include not only the usual suspects, such as addition, equality, less than, and assignment, but also the less conventional increment, conditional, and compound assignment operators. 3. A set of conditional branch and looping statements, such as the if statement and while loop, to alter the control flow of our program. 4. A small number of compound types, such as a pointer and an array. These allow us, respectively, to refer indirectly to an existing object and to define a collection of elements of a single type. 5. A standard library of common programming abstractions, such as a string and a vector. 1.1 How to Write a C++ Program We've been asked to write a simple program to write a message to the user's terminal asking her to type in her name. Then we read the name she enters, store the name so that we can use it later, and, finally, greet the user by name. OK, so where do we start? We start in the same place every C++ program starts — in a function called main(). main() is a user-implemented function of the following general form: int main() { // our program code goes here } int is a C++ language keyword. Keywords are predefined names given special meaning within the language. int represents a built-in integer data type. (I have much more to say about data types in the next section.) A function is an independent code sequence that performs some computation. It consists of four parts: the return type, the function name, the parameter list, and the function body. Let's briefly look at each part in turn. The return type of the function usually represents the result of the computation. main() has an integer return type. The value returned by main() indicates whether our program is successful. By convention, main() returns 0 to indicate success. A nonzero return value indicates something went wrong. The name of a function is chosen by the programmer and ideally should give some sense of what the function does. min() and sort(), for example, are pretty good function names. f() and g() are not as good. Why? Because they are less informative as to what the functions do. main is not a language keyword. The compilation system that executes our C++ programs, however, expects a main() function to be defined. If we forget to provide one, our program will not run. The parameter list of a function is enclosed in parentheses and is placed after the name of the function. An empty parameter list, such as that of main(), indicates that the function accepts no parameters.

2 The parameter list is typically a comma-separated list of types that the user can pass to the function when the function is executed. (We say that the user has called, or invoked, a function.) For example, if we write a function min() to return the smaller of two values, its parameter list would identify the types of the two values we want to compare. A min() function to compare two integer values might be defined as follows: int min(int val1, int val2) { // the program code goes here ... } The body of the function is enclosed in curly braces ({}). It holds the code sequence that provides the computation of the function. The double forward slash (//) represents a comment, a programmer's annotation on some aspect of the code. It is intended for readers of the program and is discarded during compilation. Everything following the double forward slash to the end of the line is treated as a comment. Our first task is to write a message to the user's terminal. Input and output are not a predefined part of the C++ language. Rather, they are supported by an object-oriented class hierarchy implemented in C++ and provided as part of the C++ standard library. A class is a user-defined data type. The class mechanism is a method of adding to the data types recognized by our program. An object-oriented class hierarchy defines a family of related class types, such as terminal and file input, terminal and file output, and so on. (We have a lot more to say about classes and object-oriented programming throughout this text.) C++ predefines a small set of fundamental data types: Boolean, character, integer, and floating point. Although these provide a foundation for all our programming, they are not the focus of our programs. A camera, for example, must have a location in space, which is generally represented by three floating point numbers. A camera also has a viewing orientation, which is also represented by three floating point numbers. There is usually an aspect ratio describing the ratio of the camera viewing width to height. This is represented by a single floating point number. On the most primitive level, that is, a camera is represented as seven floating point numbers, six of which form two x,y,z coordinate tuples. Programming at this low level requires that we shift our thinking back and forth from the manipulation of the camera abstraction to the corresponding manipulation of the seven floating point values that represent the camera in our program. The class mechanism allows us to add layers of type abstraction to our programs. For example, we can define a Point3d class to represent location and orientation in space. Similarly, we can define a Camera class containing two Point3d class objects and a floating point value. We're still representing a camera by seven floating point values. The difference is that in our programming we are now directly manipulating the Camera class rather than seven floating point values. The definition of a class is typically broken into two parts, each represented by a separate file: a header file that provides a declaration of the operations supported by the class, and a program text file that contains the implementation of those operations. To use a class, we include its header file within our program. The header file makes the class known to the program. The standard C++ input/output library is called the iostream library. It consists of a collection of related classes supporting input and output to the user's terminal and to files. To use the iostream class library, we must include its associated header file: #include <iostream> To write to the user's terminal, we use a predefined class object named cout (pronounced see out). We direct the data we wish cout to write using the output operator (<<), as follows:

3 cout << "Please enter your first name: "; This represents a C++ program statement, the smallest independent unit of a C++ program. It is analogous to a sentence in a natural language. A statement is terminated by a semicolon. Our output statement writes the string literal (marked by double quotation marks) onto the user's terminal. The quotation marks identify the string; they are not displayed on the terminal. The user sees Please enter your first name: Our next task is to read the user's input. Before we can read the name the user types, we must define an object in which to store the information. We define an object by specifying the data type of the object and giving it a name. We've already seen one data type: int. That's hardly a useful way of storing someone's name, however! A more appropriate data type in this case is the standard library string class: string user_name; This defines user_name as an object of the string class. The definition, oddly enough, is called a declaration statement. This statement won't be accepted, however, unless we first make the string class known to the program. We do this by including the string class header file: #include <string> To read input from the user's terminal, we use a predefined class object named cin (pronounced see in). We use the input operator (>>) to direct cin to read data from the user's terminal into an object of the appropriate type: cin >> user_name; The output and input sequence would appear as follows on the user's terminal. (The user's input is highlighted in bold.) Please enter your first name: anna All we've left to do now is to greet the user by name. We want our output to look like this: Hello, anna ... and goodbye! I know, that's not much of a greeting. Still, this is only the first chapter. We'll get a bit more inventive before the end of the book. To generate our greeting , our first step is to advance the output to the next line. We do this by writing a newline character literal to cout: cout << '\n'; A character literal is marked by a pair of single quotation marks. There are two primary flavors of character literals: printing characters such as the alphabet ('a', 'A', and so on), numbers, and punctuation marks (';', '-', and so on), and nonprinting characters such as a newline ('\n') or tab ('\t'). Because there is no literal representation of nonprinting characters, the most common instances, such as the newline and tab, are represented by special two-character sequences. Now that we've advanced to the next line, we want to generate our Hello: cout << "Hello, ";

4 Next, we need to output the name of the user. That's stored in our string object, user_name. How do we do that? Just the same as with the other types: cout << user_name; Finally, we finish our greeting by saying goodbye (notice that a string literal can be made up of both printing and nonprinting characters): cout << " ... and goodbye!\n"; In general, all the built-in types are output in the same way — that is, by placing the value on the right- hand side of the output operator. For example, cout << "3 + 4 = "; cout << 3 + 4; cout << '\n'; generates the following output: 3 + 4 = 7 As we define new class types for use in our applications, we also provide an instance of the output operator for each class. (We see how to do this in Chapter 4.) This allows users of our class to output individual class objects in exactly the same way as the built-in types. Rather than write successive output statements on separate lines, we can concatenate them into one compound output statement: cout << '\n' << "Hello, " << user_name << " ... and goodbye!\n"; Finally, we can explicitly end main() with the use of a return statement: return 0; return is a C++ keyword. The expression following return, in this case 0, represents the result value of the function. Recall that a return value of 0 from main() indicates that the program has executed successfully. [1] [1] If we don't place an explicit return statement at the end of main(), a return 0; statement is inserted automatically. In the program examples in this book, I do not place an explicit return statement. Putting the pieces together, here is our first complete C++ program: #include <iostream> #include <string> using namespace std; // haven't explained this yet ... int main() { string user_name; cout << "Please enter your first name: "; cin >> user_name; cout << '\n'

5 << "Hello, " << user_name << " ... and goodbye!\n"; return 0; } When compiled and executed, this code produces the following output (my input is highlighted in bold): Please enter your first name: anna Hello, anna ... and goodbye! There is one statement I haven't explained: using namespace std; Let's see if I can explain this without scaring you off. (A deep breath is recommended at this point!) Both using and namespace are C++ keywords. std is the name of the standard library namespace. Everything provided within the standard library (such as the string class and the iostream class objects cout and cin) is encapsulated within the std namespace. Of course, your next question is, what is a namespace? A namespace is a method of packaging library names so that they can be introduced within a user's program environment without also introducing name clashes. (A name clash occurs when there are two entities that have the same name in an application so that the program cannot distinguish between the two. When this happens, the program cannot run until the name clash is resolved.) Namespaces are a way of fencing in the visibility of names. To use the string class and the iostream class objects cin and cout within our program, we must not only include the string and iostream header files but also make the names within the std namespace visible. The using directive using namespace std; is the simplest method of making names within a namespace visible. (To read about namespaces in more detail, check out either Section 8.5 of [LIPPMAN98] or Section 8.2 of [STROUSTRUP97].) Exercise 1.1 Enter the main() program, shown earlier. Either type it in directly or download the program; see the Preface for how to acquire the source programs and solutions to exercises. Compile and execute the program on your system. Exercise 1.2 Comment out the string header file: // #include <string> Now recompile the program. What happens? Now restore the string header and comment out //using namespace std; What happens?

6 Exercise 1.3 Change the name of main() to my_main() and recompile the program. What happens? Exercise 1.4 Try to extend the program: (1) Ask the user to enter both a first and last name and (2) modify the output to write out both names. 1.2 Defining and Initializing a Data Object Now that we have the user's attention, let's challenge her to a quiz. We display two numbers representing a numerical sequence and then request our user to identify the next value in the sequence. For example, The values 2,3 form two consecutive elements of a numerical sequence. What is the next value? These values are the third and fourth elements of the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, and so on. A Fibonacci sequence begins with the first two elements set to 1. Each subsequent element is the sum of its two preceding elements. (In Chapter 2 we write a function to calculate the elements.) If the user enters 5, we congratulate her and ask whether she would like to try another numerical sequence. Any other entered value is incorrect, and we ask the user whether she would like to guess again. To add interest to the program, we keep a running score based on the number of correct answers divided by the number of guesses. Our program needs at least five objects: the string class object to hold the name of the user; three integer objects to hold, in turn, the user's guess, the number of guesses, and the number of correct guesses; and a floating point object to hold the user's score. To define a data object, we must both name it and provide it with a data type. The name can be any combination of letters, numbers, and the underscore. Letters are case-sensitive. Each one of the names user_name, User_name, uSeR_nAmE, and user_Name refers to a distinct object. A name cannot begin with a number. For example, 1_name is illegal but name_1 is OK. Also, a name must not match a language keyword exactly. For example, delete is a language keyword, and so we can't use it for an entity in our program. (This explains why the operation to remove a character from the string class is erase() and not delete().) Each object must be of a particular data type. The name of the object allows us to refer to it directly. The data type determines the range of values the object can hold and the amount of memory that must be allocated to hold those values. We saw the definition of user_name in the preceding section. We reuse the same definition in our new program: #include <string> string user_name;

7 A class is a programmer-defined data type. C++ also provides a set of built-in data types: Boolean, integer, floating point, and character. A keyword is associated with each one to allow us to specify the data type. For example, to store the value entered by the user, we define an integer data object: int usr_val; int is a language keyword identifying usr_val as a data object of integer type. Both the number of guesses a user makes and the number of correct guesses are also integer objects. The difference here is that we wish to set both of them to an initial value of 0. We can define each on a separate line: int num_tries = 0; int num_right = 0; Or we can define them in a single comma-separated declaration statement: int num_tries = 0, num_right = 0; In general, it is a good idea to initialize data objects even if the value simply indicates that the object has no useful value as yet. I didn't initialize usr_val because its value is set directly from the user's input before the program makes any use of the object. An alternative initialization syntax, called a constructor syntax, is int num_tries(0); I know. Why are there two initialization syntaxes? And, worse, why am I telling you this now? Well, let's see whether the following explanation satisfies either or both questions. The use of the assignment operator (=) for initialization is inherited from the C language. It works well with the data objects of the built-in types and for class objects that can be initialized with a single value, such as the string class: string sequence_name = "Fibonacci"; It does not work well with class objects that require multiple initial values, such as the standard library complex number class, which can take two initial values: one for its real component and one for its imaginary component. The alternative constructor initialization syntax was introduced to handle multiple value initialization: #include <complex> complex<double> purei(0, 7); The strange bracket notation following complex indicates that the complex class is a template class. We'll see a great deal more of template classes throughout the book. A template class allows us to define a class without having to specify the data type of one or all of its members. The complex number class, for example, contains two member data objects. One member represents the real component of the number. The second member represents the imaginary component of the number. These members need to be floating point data types, but which ones? C++ generously supports three floating point size types: single precision, represented by the keyword float; double precision, represented by the keyword double; and extended precision, represented by the two keywords long double.

8 The template class mechanism allows the programmer to defer deciding on the data type to use for a template class. It allows the programmer to insert a placeholder that is later bound to an actual data type. In the preceding example, the user chose to bind the data type of the complex class members to double. I know, this probably raises scads more questions than it answers. However, it is because of templates that C++ supports two initialization syntaxes for the built-in data types. When the built-in data types and programmer-defined class types had separate initialization syntaxes, it was not possible to write a template that supported both built-in and class data types. Making the syntax uniform simplified template design. Unfortunately, explaining the syntax seems to have become more complicated! The user's running score must to be a floating point value because it may be some percentage. We'll define it to be of type double: double usr_score = 0.0; We also need to keep track of the user's yes/no responses: Make another try? Try another sequence? We can store the user's response in a character data object: char usr_more; cout << "Try another sequence? Y/N? "; cin >> usr_more; The char keyword represents a character type. A character marked by a pair of single quotations represents a character literal: 'a', '7', ';', and so on. Some special built-in character literals are the following (they are sometimes called escape sequences): '\n' newline '\t' tab '\0' null '\'' single quote '\"' double quote '\\' backslash For example, to generate a newline and then tab before printing the user's name, we might write cout << '\n' << '\t' << user_name; Alternatively, we can concatentate single characters into a string: cout << "\n\t" << user_name; Typically, we use these special characters within string literals. For example, to represent a literal file path under Windows, we need to escape the backslash: "F:\\essential\\programs\\chapter1\\ch1_main.cpp"; C++ supports a built-in Boolean data type to represent true/false values. In our program, for example, we can define a Boolean object to control whether to display the next numeric sequence: bool go_for_it = true; A Boolean object is specified with the bool keyword. It can hold one of two literal values, either true or false.

9 All the data objects defined so far modified during the course of our program. go_for_it, for example, eventually gets set to false. usr_score is potentially updated with each user guess. Sometimes, however, we need an object to represent a constant value: the maximum number of guesses to allow a user, for example, or the value of pi. The objects holding these values should not be modified during the course of our program. How can we prevent the accidental modification of such objects? We can enlist the aid of the language by declaring these objects as const: const int max_tries = 3; const double pi = 3.14159; A const object cannot be modified from its initial value. Any attempt to assign a value to a const object results in a compile-time error. For example: max_tries = 42; // error: const object 1.3 Writing Expressions The built-in data types are supported by a collection of arithmetic, relational, logical, and compound assignment operators. The arithmetic operators are unsurprising except for integer division and the remainder operator: // Arithmetic Operators + addition a + b - subtraction a - b * multiplication a * b / division a / b % remainder a % b The division of two integer values yields a whole number. Any remainder is truncated; there is no rounding. The remainder is accessed using the % operator: 5 / 3 evaluates to 1 while 5 % 3 evaluates to 2 5 / 4 evaluates to 1 while 5 % 4 evaluates to 1 5 / 5 evaluates to 1 while 5 % 5 evaluates to 0 When might we actually use the remainder operator? Imagine that we want to print no more than eight strings on a line. If the number of words on the line is less than eight, we output a blank space following the word. If the string is the eighth word on the line, we output a newline. Here is our implementation: const int line_size = 8; int cnt = 1; // these statements are executed many times, with // a_string representing a different value each time // and cnt growing by one with each execution ... cout << a_string << (cnt % line_size ? ' ' : '\n'); The parenthetical expression following the output operator likely makes no sense to you unless you are already familiar with the conditional operator (?:). The result of the expression is to output either a space or a newline character depending on whether the remainder operator evaluates to a zero or a nonzero value. Let's see what sense we can make of it.

10 The expression cnt % line_size evaluates to zero whenever cnt is a multiple of line_size; otherwise, it evaluates to a nonzero value. Where does that get us? The conditional operator takes the following general form: expr ? execute_if_expr_is_true : execute_if_expr_is_false; If expr evaluates to true, the expression following the question mark is evaluated. If expr evaluates to false, the expression following the colon is evaluated. In our case, the evaluation is to feed either a space or a newline character to the output operator. A conditional expression is treated as evaluating to false if its value is zero. Any nonzero value is treated as true. In this example, whenever cnt is not a multiple of eight, the result is nonzero, the true branch of the conditional operator is evaluated, and a space is printed. A compound assignment operator provides a shorthand notation for applying an arithmetic operation on the object to be assigned. For example, rather than write cnt = cnt + 2; a C++ programmer typically writes cnt += 2; // add 2 to the current value of cnt A compound assignment operator is associated with each arithmetic operator: +=, -=, *=, /=, and %=. When an object is being added to or subtracted by 1, the C++ programmer uses the increment and decrement operators: cnt++; // add 1 to the current value of cnt cnt--; // subtract 1 from the current value of cnt There is a prefix and postfix version of the increment and decrement operators. In the prefix application, the object is either incremented (or decremented) by 1 before the object's value is accessed: int tries = 0; cout << "Are you ready for try #" << ++tries << "?\n"; In this example, tries is incremented by 1 before its value is printed. In the postfix application, the object's value is first used in the expression, and then incremented (or decremented) by 1: int tries = 1; cout << "Are you ready for try #" << tries++ << "?\n"; In this example, the value of tries is printed before it is incremented by 1. In both examples, the value 1 is printed. Each of the relational operators evaluates to either true or false. They consist of the following six operators:

11 == equality a == b != inequality a != b < less than a < b > greater than a > b <= less than or equal a <= b >= greater than or equal a >= b Here is how we might use the equality operator to test the user's response: bool usr_more = true; char usr_rsp; // ask the user if she wishes to continue // read the response into usr_rsp if (usr_rsp == 'N') usr_more = false; The if statement conditionally executes the statement following it if the expression within parentheses evaluates to true. In this example, usr_more is set to false if usr_rsp is equal to 'N'. If usr_rsp is not equal to 'N', nothing is done. The reverse logic using the inequality operator looks like this: if (usr_rsp != 'Y') usr_more = false; The problem with testing usr_rsp only for 'N' is that the user might enter a lowercase 'n'. We must recognize both. One strategy is to add an else clause: if (usr_rsp == 'N') usr_more = false; else if (usr_rsp == 'n') usr_more = false; If usr_rsp is equal to 'N', usr_more is set to false and nothing more is done. If it is not equal to 'N', the else clause is evaluated. If usr_rsp is equal to 'n', usr_more is set to false. If usr_rsp is not equal to either, usr_more is not assigned. A common beginner programmer error is to use the assignment operator for the equality test, as in the following: // oops this assigns usr_rsp the literal character 'N' // and therefore always evaluates as true if (usr_rsp = 'N') The logical OR operator (||) provides an alternative way of testing the truth condition of multiple expressions: if (usr_rsp == 'N' || usr_rsp == 'n') usr_more = false; The logical OR operator evaluates as true if either of its expressions evaluates as true. The leftmost expression is evaluated first. If it is true, the remaining expression is not evaluated. In our example, usr_rsp is tested for equality with 'n' only if it is not equal to 'N'. The logical AND operator (&&) evaluates as true only if both its expressions evaluate as true. For example,