- •Thinking in C++ 2nd edition Volume 2: Standard Libraries & Advanced Topics
- •Preface
- •What’s new in the second edition
- •What’s in Volume 2 of this book
- •How to get Volume 2
- •Prerequisites
- •Learning C++
- •Goals
- •Chapters
- •Exercises
- •Exercise solutions
- •Source code
- •Language standards
- •Language support
- •The book’s CD ROM
- •Seminars, CD Roms & consulting
- •Errors
- •Acknowledgements
- •Library overview
- •1: Strings
- •What’s in a string
- •Creating and initializing C++ strings
- •Initialization limitations
- •Operating on strings
- •Appending, inserting and concatenating strings
- •Replacing string characters
- •Concatenation using non-member overloaded operators
- •Searching in strings
- •Finding in reverse
- •Finding first/last of a set
- •Removing characters from strings
- •Stripping HTML tags
- •Comparing strings
- •Using iterators
- •Iterating in reverse
- •Strings and character traits
- •A string application
- •Summary
- •Exercises
- •2: Iostreams
- •Why iostreams?
- •True wrapping
- •Iostreams to the rescue
- •Sneak preview of operator overloading
- •Inserters and extractors
- •Manipulators
- •Common usage
- •Line-oriented input
- •Overloaded versions of get( )
- •Reading raw bytes
- •Error handling
- •File iostreams
- •Open modes
- •Iostream buffering
- •Seeking in iostreams
- •Creating read/write files
- •User-allocated storage
- •Output strstreams
- •Automatic storage allocation
- •Proving movement
- •A better way
- •Output stream formatting
- •Internal formatting data
- •Format fields
- •Width, fill and precision
- •An exhaustive example
- •Formatting manipulators
- •Manipulators with arguments
- •Creating manipulators
- •Effectors
- •Iostream examples
- •Code generation
- •Maintaining class library source
- •Detecting compiler errors
- •A simple datalogger
- •Generating test data
- •Verifying & viewing the data
- •Counting editor
- •Breaking up big files
- •Summary
- •Exercises
- •3: Templates in depth
- •Nontype template arguments
- •Typedefing a typename
- •Using typename instead of class
- •Function templates
- •A string conversion system
- •A memory allocation system
- •Type induction in function templates
- •Taking the address of a generated function template
- •Local classes in templates
- •Applying a function to an STL sequence
- •Template-templates
- •Member function templates
- •Why virtual member template functions are disallowed
- •Nested template classes
- •Template specializations
- •A practical example
- •Pointer specialization
- •Partial ordering of function templates
- •Design & efficiency
- •Preventing template bloat
- •Explicit instantiation
- •Explicit specification of template functions
- •Controlling template instantiation
- •Template programming idioms
- •Summary
- •Containers and iterators
- •STL reference documentation
- •The Standard Template Library
- •The basic concepts
- •Containers of strings
- •Inheriting from STL containers
- •A plethora of iterators
- •Iterators in reversible containers
- •Iterator categories
- •Input: read-only, one pass
- •Output: write-only, one pass
- •Forward: multiple read/write
- •Bidirectional: operator--
- •Random-access: like a pointer
- •Is this really important?
- •Predefined iterators
- •IO stream iterators
- •Manipulating raw storage
- •Basic sequences: vector, list & deque
- •Basic sequence operations
- •vector
- •Cost of overflowing allocated storage
- •Inserting and erasing elements
- •deque
- •Converting between sequences
- •Cost of overflowing allocated storage
- •Checked random-access
- •list
- •Special list operations
- •list vs. set
- •Swapping all basic sequences
- •Robustness of lists
- •Performance comparison
- •A completely reusable tokenizer
- •stack
- •queue
- •Priority queues
- •Holding bits
- •bitset<n>
- •vector<bool>
- •Associative containers
- •Generators and fillers for associative containers
- •The magic of maps
- •A command-line argument tool
- •Multimaps and duplicate keys
- •Multisets
- •Combining STL containers
- •Creating your own containers
- •Summary
- •Exercises
- •5: STL Algorithms
- •Function objects
- •Classification of function objects
- •Automatic creation of function objects
- •Binders
- •Function pointer adapters
- •SGI extensions
- •A catalog of STL algorithms
- •Support tools for example creation
- •Filling & generating
- •Example
- •Counting
- •Example
- •Manipulating sequences
- •Example
- •Searching & replacing
- •Example
- •Comparing ranges
- •Example
- •Removing elements
- •Example
- •Sorting and operations on sorted ranges
- •Sorting
- •Example
- •Locating elements in sorted ranges
- •Example
- •Merging sorted ranges
- •Example
- •Set operations on sorted ranges
- •Example
- •Heap operations
- •Applying an operation to each element in a range
- •Examples
- •Numeric algorithms
- •Example
- •General utilities
- •Creating your own STL-style algorithms
- •Summary
- •Exercises
- •Perspective
- •Duplicate subobjects
- •Ambiguous upcasting
- •virtual base classes
- •The "most derived" class and virtual base initialization
- •"Tying off" virtual bases with a default constructor
- •Overhead
- •Upcasting
- •Persistence
- •MI-based persistence
- •Improved persistence
- •Avoiding MI
- •Mixin types
- •Repairing an interface
- •Summary
- •Exercises
- •7: Exception handling
- •Error handling in C
- •Throwing an exception
- •Catching an exception
- •The try block
- •Exception handlers
- •Termination vs. resumption
- •The exception specification
- •Better exception specifications?
- •Catching any exception
- •Rethrowing an exception
- •Uncaught exceptions
- •Function-level try blocks
- •Cleaning up
- •Constructors
- •Making everything an object
- •Exception matching
- •Standard exceptions
- •Programming with exceptions
- •When to avoid exceptions
- •Not for asynchronous events
- •Not for ordinary error conditions
- •Not for flow-of-control
- •You’re not forced to use exceptions
- •New exceptions, old code
- •Typical uses of exceptions
- •Always use exception specifications
- •Start with standard exceptions
- •Nest your own exceptions
- •Use exception hierarchies
- •Multiple inheritance
- •Catch by reference, not by value
- •Throw exceptions in constructors
- •Don’t cause exceptions in destructors
- •Avoid naked pointers
- •Overhead
- •Summary
- •Exercises
- •8: Run-time type identification
- •The “Shape” example
- •What is RTTI?
- •Two syntaxes for RTTI
- •Syntax specifics
- •Producing the proper type name
- •Nonpolymorphic types
- •Casting to intermediate levels
- •void pointers
- •Using RTTI with templates
- •References
- •Exceptions
- •Multiple inheritance
- •Sensible uses for RTTI
- •Revisiting the trash recycler
- •Mechanism & overhead of RTTI
- •Creating your own RTTI
- •Explicit cast syntax
- •Summary
- •Exercises
- •9: Building stable systems
- •Shared objects & reference counting
- •Reference-counted class hierarchies
- •Finding memory leaks
- •An extended canonical form
- •Exercises
- •10: Design patterns
- •The pattern concept
- •The singleton
- •Variations on singleton
- •Classifying patterns
- •Features, idioms, patterns
- •Basic complexity hiding
- •Factories: encapsulating object creation
- •Polymorphic factories
- •Abstract factories
- •Virtual constructors
- •Destructor operation
- •Callbacks
- •Observer
- •The “interface” idiom
- •The “inner class” idiom
- •The observer example
- •Multiple dispatching
- •Visitor, a type of multiple dispatching
- •Efficiency
- •Flyweight
- •The composite
- •Evolving a design: the trash recycler
- •Improving the design
- •“Make more objects”
- •A pattern for prototyping creation
- •Trash subclasses
- •Parsing Trash from an external file
- •Recycling with prototyping
- •Abstracting usage
- •Applying double dispatching
- •Implementing the double dispatch
- •Applying the visitor pattern
- •More coupling?
- •RTTI considered harmful?
- •Summary
- •Exercises
- •11: Tools & topics
- •The code extractor
- •Debugging
- •Trace macros
- •Trace file
- •Abstract base class for debugging
- •Tracking new/delete & malloc/free
- •CGI programming in C++
- •Encoding data for CGI
- •The CGI parser
- •Testing the CGI parser
- •Using POST
- •Handling mailing lists
- •Maintaining your list
- •Mailing to your list
- •A general information-extraction CGI program
- •Parsing the data files
- •Summary
- •Exercises
- •General C++
- •My own list of books
- •Depth & dark corners
- •Design Patterns
- •Index
for(int u = 0; u < shapes.size(); u++) { shapes[u]->draw(); if(dynamic_cast<SCircle*>(shapes[u]))
nCircles++; if(dynamic_cast<SEllipse*>(shapes[u]))
nEllipses++; if(dynamic_cast<SRectangle*>(shapes[u]))
nRects++; if(dynamic_cast<Shape*>(shapes[u]))
nShapes++;
}
cout << endl << endl
<<"Circles = " << nCircles << endl
<<"Ellipses = " << nEllipses << endl
<<"Rectangles = " << nRects << endl
<<"Shapes = " << nShapes << endl
<<endl
<<"SCircle::quantity() = "
<<SCircle::quantity() << endl
<<"SEllipse::quantity() = "
<<SEllipse::quantity() << endl
<<"SRectangle::quantity() = "
<<SRectangle::quantity() << endl
<<"Shape::quantity() = "
<<Shape::quantity() << endl; purge(shapes);
}///:~
Both types work for this example, but the static member approach can be used only if you own the code and have installed the static members and functions (or if a vendor provides them for you). In addition, the syntax for RTTI may then be different from one class to another.
Syntax specifics
This section looks at the details of how the two forms of RTTI work, and how they differ.
typeid( ) with built-in types
For consistency, the typeid( ) operator works with built-in types. So the following expressions are true:
//: C08:TypeidAndBuiltins.cpp
Chapter 17: Run-Time Type Identification
404
#include <cassert> #include <typeinfo> using namespace std;
int main() {
assert(typeid(47) == typeid(int)); assert(typeid(0) == typeid(int)); int i;
assert(typeid(i) == typeid(int)); assert(typeid(&i) == typeid(int*));
} ///:~
Producing the proper type name
typeid( ) must work properly in all situations. For example, the following class contains a nested class:
//: C08:RTTIandNesting.cpp #include <iostream> #include <typeinfo>
using namespace std;
class One {
class Nested {}; Nested* n;
public:
One() : n(new Nested) {} ~One() { delete n; }
Nested* nested() { return n; }
};
int main() { One o;
cout << typeid(*o.nested()).name() << endl; } ///:~
The typeinfo::name( ) member function will still produce the proper class name; the result is
One::Nested.
Nonpolymorphic types
Although typeid( ) works with nonpolymorphic types (those that don’t have a virtual function in the base class), the information you get this way is dubious. For the following class hierarchy,
Chapter 17: Run-Time Type Identification
405
//: C08:RTTIWithoutPolymorphism.cpp #include <cassert>
#include <typeinfo> using namespace std;
class X { int i;
public: // ...
};
class Y : public X { int j;
public: // ...
};
int main() {
X* xp = new Y;
assert(typeid(*xp) == typeid(X)); assert(typeid(*xp) != typeid(Y));
} ///:~
If you create an object of the derived type and upcast it,
X* xp = new Y;
The typeid( ) operator will produce results, but not the ones you might expect. Because there’s no polymorphism, the static type information is used:
typeid(*xp) == typeid(X) typeid(*xp) != typeid(Y)
RTTI is intended for use only with polymorphic classes.
Casting to intermediate levels
dynamic_cast can detect both exact types and, in an inheritance hierarchy with multiple levels, intermediate types. For example,
//: C08:DynamicCast.cpp
// Using the standard dynamic_cast operation #include <cassert>
#include <typeinfo> using namespace std;
Chapter 17: Run-Time Type Identification
406
class D1 { public:
virtual void func() {} virtual ~D1() {}
};
class D2 { public:
virtual void bar() {}
};
class MI : public D1, public D2 {}; class Mi2 : public MI {};
int main() |
{ |
||
D2* |
d2 |
= |
new Mi2; |
Mi2* mi2 |
= dynamic_cast<Mi2*>(d2); |
||
MI* mi = |
dynamic_cast<MI*>(d2); |
||
D1* |
d1 |
= |
dynamic_cast<D1*>(d2); |
assert(typeid(d2) != typeid(Mi2*)); assert(typeid(d2) == typeid(D2*));
} ///:~
This has the extra complication of multiple inheritance. If you create an mi2 and upcast it to the root (in this case, one of the two possible roots is chosen), then the dynamic_cast back to either of the derived levels MI or mi2 is successful.
You can even cast from one root to the other:
D1* d1 = dynamic_cast<D1*>(d2);
This is successful because D2 is actually pointing to an mi2 object, which contains a subobject of type d1.
Casting to intermediate levels brings up an interesting difference between dynamic_cast and typeid( ). typeid( ) always produces a reference to a typeinfo object that describes the exact type of the object. Thus it doesn’t give you intermediate-level information. In the following expression (which is true), typeid( ) doesn’t see d2 as a pointer to the derived type, like dynamic_cast does:
typeid(d2) != typeid(Mi2*)
The type of D2 is simply the exact type of the pointer:
typeid(d2) == typeid(D2*)
Chapter 17: Run-Time Type Identification
407