STL Tutorial and Reference Guide, Second Edition: Errata

First Printing

This page lists errata for STL Tutorial and Reference Guide, Second Edition: C++ Template Programming with the Standard Template Library by David R. Musser, Gillmer J. Derge, and Atul Saini (Addison-Wesley, 2001). For each item we list the location in the book, the date the item was reported, and who reported it. Items that affect the technical content significantly have their location displayed in red. Other items are essentially aesthetic issues.

If you notice errors in the book that are not listed here please notify us via email to either <stltrg-errata@gillmerderge.com> or <musser@cs.rpi.edu>.

Items added since your last visit are highlighted by displaying their headings in yellow. Use the form below to enter a different date.

Preface

The following acknowledgements will be added to the Preface in future printings:

We are greatly indebted to the following people who brought to our attention errors in the first printing: Arthur Ault, Robert Allan Schwartz.

Chapter 5: Generic Algorithms

Page 93, Section 5.3.5, Paragraph 1, Line 4 (printing error) [DRM / Mar 27, 2001]

Exclamation points in the normal font did not print properly. The text should read "the probability of each of the N! permutations of a range of size N is approximately 1/N!" rather than "the probability of each of the N permutations of a range of size N is approximately 1/N ." See also pages 221, 223, 259, 409, and 425.

Page 108, Example 5.22 (error) [DRM / Aug 7, 2001]

The comparison function defined in the comp_last class should be constant. Change the prototype to

bool operator()(int x, int y) const

Chapter 12: Program for Searching a Dictionary

Page 221, Paragraph 4, Line 3 (printing error) [DRM / Mar 27, 2001]

Exclamation points in the normal font did not print properly. The text should read "The total number is 5! = 120" rather than "The total number is 5 = 120." See also pages 93, 223, 259, 409, and 425.

Page 223, Paragraph 1, Line 2 (printing error) [DRM / Mar 27, 2001]

Exclamation points in the normal font did not print properly. The text should read "the number of permutations of a string of length N is N!" rather than "the number of permutations of a string of length N is N ." See also pages 93, 221, 259, 409, and 425.

Page 223, Paragraph 1, Line 5 (printing error) [DRM / Mar 27, 2001]

Exclamation points in the normal font did not print properly. The text should read "Exercise for the reader!" rather than "Exercise for the reader ." See also pages 93, 221, 259, 409, and 425.

Chapter 16: Defining an Iterator Class

Page 253, Part 253a and Page 255, following Part 255b (error) [DRM / Aug 7, 2001]

Forward iterators require a default constructor, but none was implemented for counting_iterator. On page 255, following Part 255b and the paragraph that begins with, "Having a 'talking copy constructor' ...," add the text and the nuweb part shown below.

Although it's not needed for the program in this chapter, we define a default constructor in order to meet the requirements for forward iterators.
<Define default constructor> =
counting_iterator() : current(0), plus_count(0), name("null"), version(1) {}

On page 253 in Part 253a insert a reference to the new "<Define default constructor>" part. The downloadable source code has been updated to reflect these changes.

Chapter 17: Combining STL with Object-Oriented Programming

Page 259, Paragraph 1, Line 1 (printing error) [GJD / Apr 9, 2001]

Exclamation points in the normal font did not print properly. The text should read "But it's not object-oriented!" rather than "But it's not object-oriented ." See also pages 93, 221, 223, 409, and 425.

Chapter 21: Container Reference Guide

Page 379, Section 21.10.4, Paragraph 2, Line 3 (error) [Arthur Ault / May 7, 2001]

As explained on page 194, a container adapted by the stack adaptor must support empty and size in addition to the operations listed (back, push_back, and pop_back). Note that all the STL containers provide both empty and size, so this does not present any new practical limitations on the adapted container.

Chapter 22: Generic Algorithm Reference Guide

Page 403, Section 22.18.1 (error) [Robert Allan Schwartz / Jul 4, 2001]

The first argument of the fill_n algorithm is documented as being a forward iterator. It is, in fact, an output iterator.

Page 404, Section 22.19.1 (error) [Robert Allan Schwartz / Jul 4, 2001]

The first argument of the generate_n algorithm is documented as being a forward iterator. It is, in fact, an output iterator.

Page 408, Section 22.23 (error) [Robert Allan Schwartz / Jul 4, 2001]

The return type of the rotate_copy algorithm is documented as being void. It is, in fact, an output iterator whose value is the end of the result range, result + (last - first).

Page 409, Section 22.24.3, Paragraph 1, Line 4 (printing error) [DRM / Mar 27, 2001]

Page 409, Section 22.24.4 (error) [DRM / Aug 7, 2001]

The time complexity of random_shuffle is described as performing "exactly (last - first) - 1 swaps (and therefore three times that many swaps)." It should read, "three times as many assignments."

Page 425, Section 22.35, Paragraph 1, Line 3 (printing error) [DRM / Mar 27, 2001]

Exclamation points in the normal font did not print properly. The text should read "in such a way that N! successive applications yield all permutations of N elements" rather than "in such a way that N successive applications yield all permutations of N elements." See also pages 93, 221, 223, 259, and 409.