0201379236,STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library 2ND,STL,Tutorial,and,Reference,Guide:,C++,Programming,with,the,Standard,Template,Library,2ND,buy,book,books,purchase,read,David R. R. Musser,Gillmer J. Derge,Atul Saini
Books
Books
Sign In | View Cart Cart | Wish List | Help
ToysHealthPersonalAdultBaby
ToysHealthPersonalAdultBaby
Home & Garden
Checkout Now »
Cart Cart Cart
0 Items
Cart
100% Safe and Private!
Search     for:    

Books
Browse All Topics    New Releases    Coming Soon

All Topics > Computers & Internet > Programming > General
 
Browse similar subjects

Shipping

All orders
shipped by
airmail!

Click here for our
Shipping Policies!

 


Quotations

"The Chinese use two brush strokes to write the word 'crisis.' One brush stroke stands for danger; the other for opportunity. In a crisis, be aware of the danger - but recognize the opportunity."

  - Richard M. Nixon

(1913 - 1994)

 

 

STL Tutorial and Reference Guide:
C++ Programming with the Standard Template Library 2ND

 
  by David R. R. Musser, Gillmer J. Derge, Atul Saini
 
 
 Take A Trip Around The Word
Take A Trip Around The Word
Product
Take A Trip Around The Word
Take A Trip Around The Word
Take A Trip Around The Word
  
  
  
Take A Trip Around The Word
Take A Trip Around The Word 


ZIN Product Number: 10043229

 
eBay (last 12 months)
Auctions: 30
Price Range: $0.02 - 0.06
 
Craigslist (last 12 months)
Classifieds: 24
Price Range: $0.09 - 0.03
 
Amazon Used (last 12 months)
Auctions: 61
Price Range: $0.06 - 0.02
 
ZooScape (last 12 months)
Auctions: 0
Price Range: N/A
 
 
Google listings (non-affiliate) 86
MSN listings (non-affiliate) 20
Yahoo listings (non-affiliate) 29
 


 FastFind Line
Inverse Black Hole
By the Numbers
By the Numbers
Cover To Cover
Cover to Cover
Reader's Corner
Reader's Corner
Table of Contents
Table of Contents
Related Reading
Related Reading
Inverse Black Hole
FastFind Line
 
 
By The Numbers
 Product Details

  Format: Textbook Hardcover, 2nd ed., 5
  Edition: 2ND
  Publisher: Addison-Wesley
  ISBN: 0201379236
  Release Date: Jan 3, 2001


 
 
Cover to Cover
 In Brief
The STL Tutorial and Reference Guide is highly acclaimed as the most accessible, comprehensive, and practical introduction to the Standard Template Library (STL). Encompassing a set of C++ generic data structures and algorithms, STL provides reusable, interchangeable components adaptable to many different uses without sacrificing efficiency. Written by authors who have been instrumental in the creation and practical application of STL, STL Tutorial and Reference Guide, Second Edition includes a tutorial, a thorough description of each element of the library, numerous sample applications, and a comprehensive reference.

You will find in-depth explanations of iterators, generic algorithms, containers, function objects, and much more. Several larger, non-trivial applications demonstrate how to put STL's power and flexibility to work. This book will also show you how to integrate STL with object-oriented programming techniques. In addition, the comprehensive and detailed STL reference guide will be a constant and convenient companion as you learn to work with the library.

This second edition is fully updated to reflect all of the changes made to STL for the final ANSI/ISO C++ language standard. It has been expanded with new chapters and appendices. Many new code examples throughout the book illustrate individual concepts and techniques, while larger sample programs demonstrate the use of the STL in real-world C++ software development. An accompanying Web site, including source code and examples referenced in the text, can be found at http://www.cs.rpi.edu/~musser/stl-book/index.html.


 
 
 Annotation
As part of the C++ standard, STL provides programmers with a catalog of reusable software components plus the rules that govern how to use them. This guide is the sole source for comprehensive tutorial and reference material on this new technology. Co-authored by one of the chief developers of the standard, this book teaches you everything you need to know about using STL effectively.

 
 
The Reader's Corner
  Product Review
 
 Be the first to rate this book!     Number of Reviews: 0
 
 
 
Table of Contents
 
Forewordxxi
Foreword to the First Editionxxix
Prefacexxxi
ITutorial Introduction to STL1
1Introduction3
1.1Who Should Read This Book4
1.2What Generic Programming Is and Why It's Important4
1.3How C++ Templates Enable Generic Programming7
1.4The "Code Bloat" Problem with Templates15
1.5Understanding STL's Performance Guarantees15
2Overview of STL Components19
2.1Containers19
2.2Generic Algorithms26
2.3Iterators33
2.4Function Objects36
2.5Adaptors40
2.6Allocators43
3How STL Differs from Other Libraries45
3.1Extensibility46
3.2Component Interchangeability46
3.3Algorithm/Container Compatibility48
4Iterators49
4.1Input Iterators50
4.2Output Iterators52
4.3Forward Iterators54
4.4Bidirectional Iterators55
4.5Random Access Iterators56
4.6The STL Iterator Hierarchy: Combining Algorithms and Containers Efficiently58
4.7Insert Iterators59
4.8Revisiting Input and Output: Stream Iterators62
4.9Specification of Iterator Categories Required by STL Algorithms64
4.10Designing Generic Algorithms65
4.11Why Some Algorithms Require More Powerful Iterators67
4.12Choosing the Right Algorithm68
4.13Constant Versus Mutable Iterator Types68
4.14Iterator Categories Provided by STL Containers71
5Generic Algorithms73
5.1Basic Algorithm Organization in STL73
5.2Nonmutating Sequence Algorithms77
5.3Mutating Sequence Algorithms87
5.4Sorting-Related Algorithms102
5.5Generalized Numeric Algorithms122
6Sequence Containers127
6.1Vectors129
6.2Deques148
6.3Lists152
7Sorted Associative Containers161
7.1Sets and Multisets162
7.2Maps and Multimaps174
8Function Objects183
8.1Passing Functions via Function Pointers184
8.2Advantages of Specifying Function Objects with Template Parameters186
8.3STL-Provided Function Objects191
9Container Adaptors193
9.1Stack Container Adaptor194
9.2Queue Container Adaptor196
9.3Priority Queue Container Adaptor198
10Iterator Adaptors201
11Function Adaptors205
11.1Binders205
11.2Negators206
11.3Adaptors for Pointers to Functions208
IIPutting It Together: Example Programs213
12Program for Searching a Dictionary215
12.1Finding Anagrams of a Given Word215
12.2Interacting with the Standard String and I/O Streams Classes218
12.3Generating Permutations and Searching the Dictionary220
12.4Complete Program221
12.5How Fast Is It?223
13Program for Finding All Anagram Groups225
13.1Finding Anagram Groups225
13.2Defining a Data Structure to Work with STL226
13.3Creating Function Objects for Comparisons227
13.4Complete Anagram Group Finding Program228
13.5Reading the Dictionary into a Vector of PS Objects229
13.6Using a Comparison Object to Sort Word Pairs230
13.7Using an Equality Predicate Object to Search for Adjacent Equal Elements230
13.8Using a Function Adaptor to Obtain a Predicate Object231
13.9Copying the Anagram Group to the Output Stream232
13.10Output of the Anagram Program232
14Better Anagram Program: Using the List and Map Containers235
14.1Data Structure Holding Iterator Pairs235
14.2Storing Information in a Map of Lists236
14.3Outputting the Anagram Groups in Order of Size237
14.4Better Anagram Program238
14.5Output of the Program239
14.6Why Use a Map Container?240
15Faster Anagram Program: Using Multimaps243
15.1Finding Anagram Groups, Version 3243
15.2Declaration of the Multimap246
15.3Reading the Dictionary into the Multimap247
15.4Finding the Anagram Groups in the Multimap247
15.5Outputting the Anagram Groups in Order of Size249
15.6Output of the Program249
15.7How Fast Is It?250
16Defining an Iterator Class251
16.1New Kind of Iterator: Counting Iterator251
16.2Counting Iterator Class253
17Combining STL with Object-Oriented Programming259
17.1Using Inheritance and Virtual Functions260
17.2Avoiding "Code Bloat" from Container Instances265
18Program for Displaying Theoretical Computer Science Genealogy267
18.1Sorting Students by Date267
18.2Associating Students with Advisors268
18.3Finding the Roots of the Tree270
18.4Reading the File273
18.5Printing the Results275
18.6Complete "Genealogy" Program276
19Class for Timing Generic Algorithms279
19.1Obstacles to Accurate Timing of Algorithms279
19.2Overcoming the Obstacles280
19.3Refining the Approach283
19.4Automated Analysis with a Timer Class284
19.5Timing the STL Sort Algorithms289
IIISTL Reference Guide293
20Iterator Reference Guide295
20.1Input Iterator Requirements296
20.2Output Iterator Requirements298
20.3Forward Iterator Requirements299
20.4Bidirectional Iterator Requirements299
20.5Random Access Iterator Requirements300
20.6Iterator Traits301
20.7Iterator Operations304
20.8Istream Iterators304
20.9Ostream Iterators307
20.10Reverse Iterators309
20.11Back Insert Iterators313
20.12Front Insert Iterators315
20.13Insert Iterators316
21Container Reference Guide319
21.1Requirements319
21.2Organization of the Container Class Descriptions330
21.3Vector331
21.4Deque339
21.5List345
21.6Set354
21.7Multiset360
21.8Map365
21.9Multimap373
21.10Stack Container Adaptor378
21.11Queue Container Adaptor380
21.12Priority Queue Container Adaptor383
22Generic Algorithm Reference Guide387
22.1Organization of the Algorithm Descriptions387
22.2Nonmutating Sequence Algorithm Overview389
22.3For Each390
22.4Find391
22.5Find First391
22.6Adjacent Find392
22.7Count393
22.8Mismatch394
22.9Equal395
22.10Search396
22.11Search N397
22.12Find End397
22.13Mutating Sequence Algorithm Overview398
22.14Copy399
22.15Swap400
22.16Transform401
22.17Replace402
22.18Fill403
22.19Generate404
22.20Remove404
22.21Unique406
22.22Reverse407
22.23Rotate408
22.24Random Shuffle408
22.25Partition409
22.26Sorting-Related Algorithms Overview410
22.27Sort412
22.28Nth Element414
22.29Binary Search415
22.30Merge417
22.31Set Operations on Sorted Structures418
22.32Heap Operations421
22.33Min and Max423
22.34Lexicographical Comparison424
22.35Permutation Generators425
22.36Generalized Numeric Algorithms Overview426
22.37Accumulate427
22.38Inner Product428
22.39Partial Sum429
22.40Adjacent Difference430
23Function Object and Function Adaptor Reference Guide431
23.1Requirements431
23.2Base Classes432
23.3Arithmetic Operations433
23.4Comparison Operations433
23.5Logical Operations434
23.6Negator Adaptors435
23.7Binder Adaptors435
23.8Adaptors for Pointers to Functions436
23.9Adaptors for Pointers to Member Functions437
24Allocator Reference Guide441
24.1Introduction441
24.2Allocator Requirements442
24.3Default Allocator445
24.4Custom Allocators448
25Utilities Reference Guide455
25.1Introduction455
25.2Comparison Functions455
25.3Pairs456
Appendix ASTL Header Files459
Appendix BString Reference Guide461
B.1String Classes461
B.2Character Traits472
Appendix CSTL Include Files Used in Example Programs477
C.1Files Used in Example 17.1477
Appendix DSTL Resources483
D.1Internet Addresses for SGI Reference Implementation of STL483
D.2World Wide Web Address for Source Code for Examples in this Book483
D.3STL-Compatible Compilers484
D.4Other Related STL and C++ Documents484
D.5Generic Programming and STL Discussion List484
References485
Index489


 
 
Related Reading
 Find similiar books in these subject areas:

All Topics > Computers & Internet > Programming > General
All Topics > Computers & Internet > Programming > Languages & Tools > C & C++ > General
All Topics > Computers & Internet > Programming > Languages & Tools > C & C++ > Language
All Topics > Computers & Internet > Programming > Languages & Tools > C & C++ > Programming
All Topics > Computers & Internet > Programming > Languages & Tools > C & C++ > Templates
All Topics > Computers & Internet > General


 
 
 People like you also bought:

The C++ Programming Language SPECIAL, by Bjarne Stroustrup

Effective C++ : 50 Specfic Ways to Improve Your Programs and Designs, Second Edition, by Scott Meyers

The C++ Standard Library: A Tutorial and Reference, by Nicolai M. Josuttis

STL Programming from the Ground Up, by Herbert Schildt

Design Patterns: Elements of Reusable Object Oriented Software, by Erich Gamma

Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library, by Scott Meyers

Modern C++ Design: Generic Programming and Design Patterns Applied (C++ in-Depth Series), by Andrei Alexandrescu

 
 
 Keywords
C++ (Computer program language), C++ (Computer program language, Standard template library, Computer Bks - Languages / Programming, Computers, Programming Languages - C++, Programming Languages - General, C++ (Computer program language, Standard template library, Computer Bks - Languages / Programming, Computers, Programming Languages - C++, Programming Languages - General, C++ (Computer program language, Standard template library, Computer Bks - Languages / Programming, Computers, Programming Languages - C++, Programming Languages - General

 
 
 FastFind Line
Inverse Black Hole
By the Numbers
By the Numbers
Cover To Cover
Cover to Cover
Reader's Corner
Reader's Corner
Table of Contents
Table of Contents
Related Reading
Related Reading
Inverse Black Hole
FastFind Line
 
 


Make $1 per sale -
Link to ZooScape.com!


About Us   |   Our Policies   |   Your Cart   |   Contact Us   |   Help
ZooScape.com

Copyright 1995 - 2009 - ZooScape.com
 
ZooScape.com