7 Million Study Materials
From students who've taken these classes before
From students who've taken these classes before
24/7 Access to Tutors
Personal attention for all your questions
Personal attention for all your questions
Learn
93% of our members earn better grades
93% of our members earn better grades
Cornell | CS 213
C++ Programming
Professors
- Dinapoli
92 sample documents related to CS 213
-
Cornell CS 213
0 C `C C 45\" C \" 4 `\" @ @ 4\" REQR~Q7q6 A8RhY)Cy5)7By)cm)R8%)AWf\")7p7yPR(qPu D 4\" C5 I 4 g @ C 55 `C 6U666)C7y6)ypge6%C 37yc7B7p`t Up(BuU666)23\" (9&635)(Bbkg767B8\'` #R 6A3V 27b -
Cornell CS 213
COM S 213 Fall 2004 Assignment #4 The Used Car Dealership Expands! Due September 23, 2004 The main purpose of this assignment is to experience polymorphismthe ability to associate many meanings to one function name by means of virtual member functi -
Cornell CS 213
Administrative. CS 213 - Lecture #19 Late Night Guide to C+ Chapter 11 MORE ABOUT EXCEPTIONS Assignment #8 due Today: Remember, second prelim on 11/23 Exceptions and Inheritance Last lecture, we found out that when an exception is thrown there -
Cornell CS 213
Administrative. CS 213 - Lecture #7 Late Night Guide to C+ Chapter 6 pg 131 - 144 CONSTRUCTORS Assignment #3 due today Assignment #4 is up! Constructors You may have noticed that in some class definitions weve included a member function to do i -
Cornell CS 213
Administrative. CS 213 - Lecture #21 Late Night Guide to C+ Chapter 12 pg. 311 - 330 MULTIPLE INHERITANCE Assignment #9 due today Assignment #10 is up on web site! Remember, second prelim on Tue. Nov. 23 What is Multiple Inheritance? Dialogue -
Cornell CS 213
Administrative. CS 213 - Lecture #22 Late Night Guide to C+ Chapter 12 pg. 319 - 326 MORE MULTIPLE INHERITANCE, NAMESPACES Assignment #10 due on Tuesday, 11/30 If you turn it in by 11/18, I will grade and make it available to you before the preli -
Cornell CS 213
Administrative. CS 213 - Lecture #20 Late Night Guide to C+ Chapter 10 pg 278 - 290 STANDARD TEMPLATE LIBRARY Assignment #9 due Thursday 2 more assignments to be done Remember, second prelim on 11/23 What is the Standard Template Library? A co -
Cornell CS 213
Administrative. CS 213 - Lecture #10 Late Night Guide to C+ Chapter 7 pg 180 - 184 Chapter 8 pg 192 - 207 MORE ABOUT FUNCTIONS MORE ABOUT TYPES Assignment #4 graded Average Score: # There were # assignments turned in Assignment #5 due Thursday -
Cornell CS 213
Administrative. CS 213 - Lecture #8 Late Night Guide to C+ Chapter 6 pg 145 - 157 DESTRUCTORS Assignment #3 graded Average grade: NN YY Assignments Turned In Remember, Prelim #1 10/14 Before we talk about destructors. Why reading in Strings -
Cornell CS 213
Administrative. CS 213 - Lecture #13 Late Night Guide to C+ Chapter 7 pg 184 - 191 Chapter 8 pg 217 - 221 Enumerations, Pointers to Functions Prelims are graded Enumerations Sometimes, when programming, we need to deal with a limited range of co -
Cornell CS 213
Administrative. CS 213 - Lecture #4 Late Night Guide to C+ Chapter 4 pages 69 - 86 POINTERS Prelims are given in class. Assignment #1 graded: Average score: NN Assignments turned in: 12 Pay attention to submission guidelines Writeup PRINTED -
Cornell CS 213
Administrative. CS 213 - Lecture #12 Late Night Guide to C+ Chapter 8 pg 207 - 216 STREAMS (and other miscellaneous topics) Assignment #6 due on Friday, 10/8 Anyone who wants theirs returned before the prelim on 10/14, please contact me. void an -
Cornell CS 213
Administrative. CS 213 - Lecture #16 Late Night Guide to C+ Chapter 10 pg 257 - 265 TEMPLATES, Part I Assignment #7 due on Thursday What is a Template? In short, its a way to define generic functionality on parameters without needing to declare -
Cornell CS 213
Administrative. CS 213 - Lecture #9 Late Night Guide to C+ Chapter 7 pg 158 - 184 MORE ABOUT FUNCTIONS Part I Assignment #4 due TODAY! Assignment #5 up on web site, due 9/30 Remember, prelim #1 on 10/14 Inline Functions Any function declaratio -
Cornell CS 213
Administrative. CS 213 - Lecture #15 Late Night Guide to C+ Chapter 9 pg 240 - 254 MORE ABOUT CLASSES, Part II Well need to start talking about final projects soon! Assignment #7 up, due on Thursday In Our Last Exciting Episode. In Part I of ou -
Cornell CS 213
Administrative. CS 213 - Lecture #5 Late Night Guide to C+ Chapter 4 pages 86 - 104 ARRAYS Assignment #2 due today Office Hours finalized - 351 Upson Wed 4PM - 5:30PM More office hours if necessary You can always make an appointment with me vi -
Cornell CS 213
Administrative. CS 213 - Lecture #23 Late Night Guide to C+ Chapter 12 pg. 330 - 338 SPACE ALLOCATION Remember, second prelim on 11/23! In class, closed book, similar to prelim #1 Will cover entire semester, main focus on second half of year. S -
Cornell CS 213
Administrative. CS 213 - Lecture #18 Late Night Guide to C+ Chapter 11 EXCEPTIONS Remember, second prelim on 11/23 Exceptional Events Sometimes, bad stuff happens. int main() { int arg1,arg2; cout < Enter two numbers and I will add them < endl; -
Cornell CS 213
COM S 213 PRELIM EXAMINATION #2 April 26, 2001 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. Define an interface named Printable -
Cornell CS 213
COM S 213 Fall 2004 Assignment #10 Grade Ledger Due November 30, 2004 This will be your last assignment (I will still drop the two lowest assignments, but your assignment average will now be based on 8 assignments instead of 10). The assignment is l -
Cornell CS 213
COM S 213 FALL 2004 SYLLABUS (tentative) Tuesdays 2: pg 3 - 37 Assignment #1 given F -
Cornell CS 213
CS 213 Fall 2004 Info Form and Waiver NAME: ID NUMBER: LOCAL ADDRESS: LOCAL PHONE: NETID: IMPORTANT: If youd like your grades posted you must either sign the waiver to allow them to be posted by your Student ID, or provide an alternative number to po -
Cornell CS 213
Administrative. CS 213 - Lecture #2 Late Night Guide to C+ Chapter 3 pages 38 - 51 FUNCTIONS ANSI C+ Draft approved November 14, 1997 Functions in C+ This is how Late Night denes a function declaration: Functions in C+ Lets take a look at an ex -
Cornell CS 213
Administrative. CS 213 - Lecture #14 Late Night Guide to C+ Chapter 9 pg 222 - 239 MORE ABOUT CLASSES Part I Were starting to catch up! Interfaces in C+ For those with Java experience, you know that Java implements the concept of an interface. -
Cornell CS 213
Default Arguments n n Lecture 13 n Suppose we want to write a new global function that searches for characters in a string. We want to be able to search for the first occurrence of a specified character from a specified starting point in the strin -
Cornell CS 213
Building a C+ Program n A C+ Program consists of n n Lecture 1 The Basics (Review of Familiar Topics) Source files Header files Usually have a .cpp or .cp extension Compiled individually Usually have a .h extension (some use of .hpp) Contain decla -
Cornell CS 213
What is a Template? n n n Lecture 17 n n n Templates, Part I In short, its a way to define generic functionality on parameters without needing to declare their types. Consider the following example Suppose you are in need of sorting arrays of v -
Cornell CS 213
Introduction to Classes n n Lecture 4 Classes Absolute C+ Chapter 6 Last lecture, we talked about streams and used functions called member functions. These functions operate on the variable they are attached to ifstream inFile; inFile.open(input.d -
Cornell CS 213
An Introduction to C-strings n n Lecture 8 C-Strings, C+ Strings And Multidimensional Arrays Absolute C+ Chapter 9, 5.4 n n n n A C string is not a class, it is simply an array of characters. Any given C string of length n will correspond to a c -
Cornell CS 213
Functions in C+ Lets take a look at an example declaration: long factorial(int n) Lecture 2 Functions The declaration above has the following meaning: n n n The return type is long. That means the function will return a long integer to the calli -
Cornell CS 213
What is Multiple Inheritance? n n Lecture 21 n n Multiple Inheritance n n n We defined inheritance earlier in the semester as a relationship between classes. If class C inherits from class B it is normally the case that C is a B or that C is -
Cornell CS 213
What is the Standard Template Library? n A collection of C+ classes (templates) n containers n n Lecture 20 n n n n n n vectors lists stacks queue/deques sets/multisets maps/multimaps iterators algorithms Standard Template Library n Each con -
Cornell CS 213
The Conceptual Side of Classes n n n n Earlier we defined classes as a user defined data type It could have member functions It could have member variables This is a technical, concrete definition Usually a noun n Lecture 10 Inheritance n The con -
Cornell CS 213
Flow Control - big if/else statements Consider the following code: int x; cin > x; Lecture 3 More on Flow Control, More on Functions, and Intro to Streams Absolute C+ Sections 1.3, 2.2, 4.2 n if (x = 0) cout < x is zero < endl; else if (x == 1) cou -
Cornell CS 213
Overriding n n Lecture 11 More Inheritance, More Constructors Absolute C+ Chapter 15 n n Lets recall the code we were working on from last lecture. We had a base class named Person and two derived classes named Student and Instructor. We defined -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #2: DATE GIVEN: DATE DUE: Calculator Class 9/12/02 9/19/02 PURPOSE: The purpose of this assignment is test your ability to design, implement and use a C+ class. ASSIGNMENT: You need to design a class named Calculator -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #4: DATE GIVEN: DATE DUE: More Menus 10/3/02 10/10/02 PURPOSE: To test your understanding of polymorphism (also known as utilizing virtual member functions) ASSIGNMENT: Consider a simple set of three classes that prov -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #6: DATE GIVEN: DATE DUE: Dynamic Array Class 10/17/02 10/24/02 PURPOSE: To review operator overloads, dynamic allocation of arrays and to utilize destructors and the array index operator overload. ASSIGNMENT: In our -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #1: DATE GIVEN: DATE DUE: Calculator 9/5/02 9/12/02 PURPOSE: The purpose of this assignment is to allow you to apply the review concepts weve covered in the first three lectures. While we will have covered additional -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #9: DATE GIVEN: DATE DUE: CoolArray 11/7/02 11/14/02 PURPOSE: To apply what weve learned about templates ASSIGNMENT: Today we learned that template arguments can be used with classes in one of two ways: To allow a da -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #3: DATE GIVEN: DATE DUE: MenuBar and Menus 9/16/02 9/26/02 PURPOSE: To gain experience with using arrays and pointers. To begin attempts at designing classes from more abstract descriptions. ASSIGNMENT: Consider two -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #4: DATE GIVEN: DATE DUE: Big Numbers 9/26/02 10/3/02 PURPOSE: To get more experience in using either arrays or C+ strings and to make sure you understand the concept of operator overloading. ASSIGNMENT: Every once in -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #10: DATE GIVEN: DATE DUE: Simple Shopping System 11/14/02 11/21/02 PURPOSE: To apply what weve learned about the Standard Template Library ASSIGNMENT: THIS is the LAST assignment of the semester. As such, Ive decided -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #8: DATE GIVEN: DATE DUE: Interfaces 11/2/02 (10/31/02) 11/7/02 PURPOSE: To apply what weve learned about Interfaces and Polymorphism ASSIGNMENT: You will need to define a new interface for Shapes. As a matter of fact -
Cornell CS 213
COM S 213 Fall 2002 ASSIGNMENT #7: DATE GIVEN: DATE DUE: A Better IntArray 10/24/02 10/31/02BOO! PURPOSE: To apply what weve learned about Exceptions to the IntArray class. ASSIGNMENT: Assignment #6 had you build an IntArray class. This week we are -
Cornell CS 213
CS213 Fall 2002 Info Form and Waiver NAME: ID NUMBER: LOCAL ADDR: LOCAL PHONE: NETID: IMPORTANT: If you want your grades to be posted, you must sign the following waiver! I, , consent to the use of my Student ID number for the purpose of posting of -
Cornell CS 213
Constructors-an Introduction n n Lecture 5 Constructors Operator Overloads Absolute C+ Chapters 7.1,8.1,8.2 Theres an inefficiency with the Course class we looked at last time. In order to set up the class with initial data I have to call the sett -
Cornell CS 213
COM S 213 FALL 2007 SYLLABUS (as of 8/22/07, subject to change) Tuesdays & Thursdays, 12:20 1:10 Room TBA Ron DiNapoli, Lecturer DATE Thursday, 8/23 Tuesday, 8/28 Thursday, 8/30 Tuesday, 9/4 Thursday, 9/6 Tuesday, 9/11 Thursday, 9/13 Tuesday, 9/18 T -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #7: DATE GIVEN: DATE DUE: Templates & Exceptions 4/3/03 4/10/03 PURPOSE: To apply what weve learned about Exceptions and Templates. ASSIGNMENT: Today we learned that template arguments can be used with classes in on -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #9: DATE GIVEN: DATE DUE: Simple Shopping System 4/17/03 4/24/03 PURPOSE: To apply what weve learned about the Standard Template Library map container ASSIGNMENT: THIS is the LAST assignment of the semester. As such -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #2: DATE GIVEN: DATE DUE: Menu Class 1/30/03 2/6/03 PURPOSE: Classes can be used to encapsulate functionality into a neat package. For assignment #2 we are going to apply this concept to the menu problem solved in a -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #3: DATE GIVEN: DATE DUE: Operator Overloads in the Menu Class 2/6/03 2/13/03 PURPOSE: This week we learned about operator overloads and constructors. Well apply these topics to the Menu class weve been working on. -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #1: DATE GIVEN: DATE DUE: Old-Style Menu 1/23/03 1/30/03 PURPOSE: The purpose of this assignment is to allow you to apply the review concepts weve covered in the first two lectures. While we will have covered additi -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #5: DATE GIVEN: DATE DUE: Inheritance in the Menu Class 2/28/03 3/7/03 PURPOSE: To apply what weve learned about inheritance to our Menu class. ASSIGNMENT: For this assignment we are going to re-implement our Menu c -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #4: DATE GIVEN: DATE DUE: Dynamic Arrays in the Menu Class 2/13/03 2/20/03 PURPOSE: To apply what weve learned about dynamic arrays and strings to our Menu class. ASSIGNMENT: In assignment #3 we hard coded the numbe -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #6: DATE GIVEN: DATE DUE: Function Pointers in the Menu Class 3/13/03 3/27/03 PURPOSE: To apply what weve learned about function pointers to our Menu class. ASSIGNMENT: For this assignment you will start with Assign -
Cornell CS 213
COM S 213 Spring 2003 ASSIGNMENT #8: DATE GIVEN: DATE DUE: Vectors 4/12/03 4/19/03 PURPOSE: To apply what weve learned about vectors and the Standard Template Library ASSIGNMENT: In Lecture 20 we introduced the Standard Template Library. We looked -
Cornell CS 213
Namespaces n Lecture 23 n n At the beginning of the semester, I asked you to take it on faith that if you wanted to use the functions defined in <iostream> you would need to add the following line of code to your program: n using namespace std; N -
Cornell CS 213
From Last Time: What is a Template? template <class a,class b,> fn (formal args) n Lecture 18 n This is the official specification for a template. It says that to define a template you must: n n n Templates, Part II n n n start with the keywo -
Cornell CS 213
Declarations in Classes: Enumerations n n Lecture 22 n n Since the class definition also provides a sense of scope, we can perform declarations and definitions within the class definition. Indeed, we do just that with member functions and member -
Cornell CS 213
Enumerations n n n Sometimes, when programming, we need to deal with a limited range of constants: A finite set of colors Result codes Lecture 14 n It is useful to define a set of constants which can be used in place of the actual integer values: -
Cornell CS 213
Exceptions and Inheritance n Lecture 16 n n Exceptions II (and Interfaces) n n n Last lecture, we found out that when an exception is thrown there is no attempt to implicitly coerce the type of data thrown to a catch statement which could rece -
Cornell CS 213
Arrays n What is an Array? n n Lecture 7 Arrays, Dynamic Arrays & Copy Constructors Absolute C+ Sections 5.1 - 5.3, 10.2 n An array is a chunk of memory which contains consecutive instances of a given data type. Think of it as a list of data, ea -
Cornell CS 213
Exceptional Events n Sometimes, bad stuff happens. Lecture 15 Exceptions I int main() { int arg1,arg2; cout < Enter two numbers and I will add them < endl; cout < Number 1: ; cin > arg1; cout < Number 2: ; cin > arg2; cout < The result is : < ar -
Cornell CS 213
Administrative. CS 213 - Lecture #3 Late Night Guide to C+ Chapter 3 pages 51 - 68 CLASSES Assignment #1 Due Today Assignment #2 up, Due 9/9/04 Classes What is a class? LNG, pg 51 says: A class is a user-defined type Are all user-defined type -
Cornell CS 213
COM S 213 PRELIM EXAMINATION #2 April 25, 2002 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. In C+, an interface is more of a co -
Cornell CS 213
CS213 C+ ProgrammingFall 2007 Course Information as of August 13, 2007 Welcome! Welcome to CS213, C+ Programming! We will be using the book C+ Primer by Lippman, Lajoie and Moo this semester. The goal of the course is to learn the syntax of the C+ l -
Cornell CS 213
Administrative. CS 213 - Lecture #17 Late Night Guide to C+ Chapter 10 pg 265 - 290 TEMPLATES, Part II Assignment #7 due today! Second prelim on 11/23 From Last Time: What is a Template? template <class a,class b,> fn (formal args) What is a Te -
Cornell CS 213
COM S 213 Fall 2004 Assignment #3 Honest Used Car Dealership Due September 16, 2004 The main purpose of this assignment is to experience dynamically allocated arrays along with getting used to pointers. You will need to create two classes: 1. An Aut -
Cornell CS 213
COM S 213 Fall 2004 Assignment #9 Exceptions Due November 11, 2004 Your assignment this week is to add exceptions to Assignment #8. Specifically, create a MatrixException class which stores the following: An error code An error message The x,y co -
Cornell CS 213
Destructors n Quick review of constructors: n n They\'re called when an object is created You may perform one-time initializations in constructors n n Lecture 12 Destructors n Memory allocation member variable initializations Each may take a varyi -
Cornell CS 213
n What is a pointer? n Pointers Lecture 6 Pointers \"Absolute C+\" Section 10.1 n n A pointer is a physical memory address which \"points\" at (presumably) an instance of a data type (either built-in or user defined) A pointer variable \"evaluates\" -
Cornell CS 213
Overloading the Assignment Operator n n In lectures past, weve talked about copy constructors Called when a new object is created and set equal to an existing instance n Whats the difference between the following lines of code? Lecture 19 Miscel -
Cornell CS 213
Daily Brain Teaser Welcome to CS 213 Programming in C+ Ron DiNapoli, Instructor Issues Issues Issues Issues Issues, issues, issues Issues Issues Issues Important Poll In order to get a feel for the experience of the class How many of yo -
Cornell CS 213
COM S 213 Fall 2004 Assignment #8 Template Class Due November 4, 2004 Your assignment this week is to create a template class named Matrix which takes three placeholders: 1. A data type used to represent each individual element of the matrix 2. An i -
Cornell CS 213
COM S 213 Fall 2004 Assignment #7 File Streams Due October 28, 2004 Continuing in the spirit of the free form assignment, your assignment this week is to modify assignment #4 (Expanded Dealership) to load inventory from a text file as opposed to usi -
Cornell CS 213
COM S 213 Fall 2004 Assignment #1 5 Numbers Due September 2, 2004 The main purpose of this assignment is to get you experience with a C+ development environment. I use Xcode in class (comes with MacOS X 10.3), but you are free to use CodeWarrior or -
Cornell CS 213
COM S 213 Fall 2004 Assignment #2 OurApp Class Due September 9, 2004 The main purpose of this assignment is to get you experience with a C+ class. You will be solving the same problem you solved in Assignment #1, but will use a class to implement th -
Cornell CS 213
COM S 213 Fall 2004 Assignment #5 Get to know MyString Due September 30, 2004 There are two purposes for this assignment. The first is to famliarize yourself with the MyString class a little morewe will use it for a couple of subsequent assignments. -
Cornell CS 213
COM S 213 Fall 2004 Assignment #5 Operator Overloading Due October 8, 2004 by 8am under the door of 351 Upson This is the last assignment prior to the first prelim. It is the most \"free form\" assignment we will have this semester! Design a class fo -
Cornell CS 213
/ Assignment 2 - Rational Numbers / Due 18 Sept 1997, in class / Please hand in a printout, sample run, and a LABELED disk. / Part I / / Here is the class declaration for rational numbers. Your first / mission is to complete its definition, a -
Cornell CS 213
Lecture 11 More Inheritance, More Constructors \"Absolute C+\" Chapter 15 Overriding Let\'s recall the code we were working on from last lecture. We had a base class named Person and two derived classes named Student and Instructor. We defined a -
Cornell CS 213
Lecture 2 Functions Functions in C+ Let\'s take a look at an example declaration: long factorial(int n) The declaration above has the following meaning: The return type is long. That means the function will return a long integer to the calling -
Cornell CS 213
COM S 213 PRELIM EXAMINATION #1 October 12, 2000 Name: Student ID: Please answer all questions in the space(s) provided. Each question is worth 4 points. You may leave when you are finished with the exam. Question 1. float f1 = 13.0; float f2 = 5.0; -
Cornell CS 213
COM S 213, Fall 2002 Ron DiNapoli, Lecturer SYLLABUS (preliminary) Thu, 8/29 Tue, 9/3 Thu, 9/5 Tue, 9/10 Thu, 9/12 Tue, 9/17 Thu, 9/19 Tue, 9/24 Thu, 9/26 Tue, 10/1 Thu, 10/3 Tue, 10/8 Thu, 10/10 Tue, 10/15 Thu, 10/17 Tue, 10/22 Lecture #1: Review of -
Cornell CS 213
This lecture is a bit of a departure in that we\'ll cover how C+\'s features are actually implemented. This implementation will look suspiciously similar to pointers to functions in C, so we\'ll take a detour to check this out (for those of you who have -
Cornell CS 213
COM S 213 Programming in C+ Preliminary Syllabus Spring 2003 Tue, 1/21 Thu, 1/23 Tue, 1/28 Thu, 1/30 Lecture 1, Review of Familiar Topics Lecture 2, Functions Assignment #1 Given Lecture 3, Functions, Streams and Flow Control Lecture 4, Classes Assi -
Cornell CS 213
Windowing Systems Windowing systems are probably the most non-standard aspect of modern computers, from a developer\'s point of view. There are many different windowing systems: Mac, Windows, X11, OS/2, NeXT, Java, Amiga, GEM, Desqview . All have s -
Cornell CS 213
Exception Handling (or, \"building robust software\") The examples presented in the course so far haven\'t dealt well with errors. However, real-life software must deal with exceptional situations in a reasonable way. Such situations might include: Inv -
Cornell CS 213
A gentle introduction to the standard template library (STL) Some references: http:/www-leland.stanford.edu/~iburrell/cpp/stl.html http:/www.cs.rpi.edu/~musser/stl.html http:/www.sgi.com/Technology/STL/ (this is so comprehensive that it documents -
Cornell CS 213
Elements are always copied when they are put into a container. So the following is ok: vector<string> v1; { string s1(\"foo\"); v1.push_back(s1); / a copy of s1 goes into v1 } / s1 is deallocated cout < v1.back() < endl; / ok - retrieves copy of s1 El -
Cornell CS 213
Run-time type information (RTTI) and casts Consider classes for components and windows: class Component { . virtual void draw() {} }; class Window: public Component { . virtual void addComponent(Component *c); virtual list<Component*> getAllComponent
7,000,000 study materials • 24/7 tutors • earn better grades