Data Structures in C++ Using the Standard Template Library

Transcription

1 Data Structures in C++ Using the Standard Template Library Timothy Budd Oregon State University ^ ADDISON-WESLEY An imprint of Addison Wesley Longman, Inc. Reading, Massachusetts Harlow, England Menlo Park, California Berkeley, California Don Mills, Ontario Sydney Bonn Amsterdam Tokyo Mexico City

2 Preface I FUNDAMENTAL TOOLS 1 v 1 Fundamentals The Study of Data Structures The STL Language Fundamentals Comments Constants Basic Data Types and Declaration Statements Expressions and Assignment Statements Input and Output Pointer Values Conditional Statements Loops Arrays Structures Functions The Function main Include Files Binding Times Chapter Summary 19 Further Reading 20 Study Questions & Exercises 20 2 Classes and Object-Oriented Programming 23 Chapter Overview The Card Game WAR The Class Card The Class Deck In-Line Function Definitions 34

3 2.4 The Class Player The Game Itself Making an Interactive Game Accessor and Mutator Functions Chapter Summary 40 Further Reading 41 Study Questions & Exercises 42 3 Algorithms: Descriptions of Behavior 45 Chapter Overview Properties of Algorithms Recipes as Algorithms Analyzing Computer Algorithms Specification of the Input Description of the Result Instruction Precision Time to Execute Space Utilization Recursive Algorithms Chapter Summary 60 Further Reading 60 Study Questions & Exercises 61 4 Analyzing Execution Time 63 Chapter Overview Algorithmic Analysis and Big-Oh Notation Execution Time of Programming Constructs Constant Time Simple Loops Nested Loops While Loops Function Calls Recursive Calls Summing Algorithmic Execution Times Benchmarking Actual Execution Times Chapter Summary 83

4 Further Reading 83 Study Questions Si Exercises 84 5 Increasing Confidence in Correctness 87 Chapter Overview Program Proofs Invariants Analyzing Loops Asserting the Outcome is Correct Progress Toward an Objective Manipulating Unnamed Quantities Function Calls Recursive Algorithms Program Testing Chapter Summary 101 Further Reading 101 Study Questions Si Exercises 101 THE STANDARD CONTAINERS The Standard Library Container Classes 107 Chapter Overview Container Classes Vectors Strings Lists Double-Ended Queues Stacks and Queues Sets Priority Queues Maps (Dictionaries) Selecting a Container Iterators 115 Further Reading Chapter Summary 119 Study Questions Si Exercises The string Data Type 121 Chapter Overview 121

5 XVI CONTENTS 7.1 The String Data Abstraction Include Files Primitive (C-style) Strings Problem Solving with Strings Palindrome Testing Split a Line into Words String Operations Declaring String Variables Character Access Extent of String Assignment and Append Iterators Insertion, Removal, and Replacement String Comparisons Searching Operations Useful Generic Algorithms Input/Output Routines The Implementation of Strings Constructors, Assignment Destructor and Delete Resize Internal Buffer Computing Length Character Access Iterators Insertion, Removal, Replacement, and Append Comparison Operators Substring Matching 150 Further Reading Chapter Summary 151 Study Questions & Exercises Vectors: A Random Access Data Structure 155 Chapter Overview The Vector Data Abstraction Templates Function Templates Problem Solving with Vectors Sieve of Erastosthenes Sorting 161

6 8.3.3 Merge Sort Silly Sentence Generation* Matrices* Summary of Vector Operations Declaration and Initialization of Vectors Subscripting a Vector Element Insertion Element Removal Extent and Size-Changing Operations Iterators Generic Algorithms Sorting and Sorted Vector Operations The Implementation of Vector Constructors Reserve and Resize Access to Data Values Implementing Generic Algorithms Chapter Summary 182 Study Questions & Exercises 182 Lists: A Dynamic Data Structure 185 Chapter Overview The List Data Abstraction Summary of List Operations Insert Iterators Example Programs An Inventory System A Course Registration System An Example Implementation List Iterators Variation Through Inheritance Ordered Lists Self-Organizing Lists Private and Protected Chapter Summary 214 Further Reading 214 Study Questions & Exercises 215

7 xviii CONTENTS 10 Stacks and Queues 217 Chapter Overview The Stack and Queue Data Abstractions Adaptors Stacks Application: RPN Calculator Application: Conversion of Infix to Postfix* Queues Example Program: Bank Teller Simulation Ring Buffer Queues Chapter Summary 234 Further Reading 235 Study Questions & Exercises Deques: Double-Ended Data Structures 237 Chapter Overview The Deque Abstraction Application: Depth- and Breadth-First Search Application: A Framework for Backtracking Specialization Using Inheritance An Implementation Deque Iterators Chapter Summary 261 Study Questions & Exercises Sets and Multisets 263 Chapter Overview The Set Data Abstraction Set Operations Bit Vector Sets* The set Data Type A Spelling Checker Spelling Correction Anagrams Summary of Operations for Class set 276

8 Generic Functions for Set Operations An Implementation of Class set Implementation of Generic Algorithms Chapter Summary 290 Further Reading 290 Study Questions &. Exercises Trees: A Nonlinear Data Structure 293 Chapter Overview Properties of Trees Binary Trees Vector Implementation Dynamic Memory Implementation Application: "Guess the Animal" Game Operator Precedence Parsing* Tree Traversals Postorder Tree Traversal Iterator Preorder Tree Traversal Iterator Inorder Tree Traversal Iterator Level-Order Tree Traversal Iterator Binary Tree Representation of General Trees Chapter Summary 323 Study Questions & Exercises Searching 327 Chapter Overview Divide and Conquer Binary Search Application: Root Finding Ordered Vectors Balanced Binary Search Trees Application: Tree Sort Finding the Nth Largest Application: Quick Sort Chapter Summary 355 Further Reading 356

9 Study Questions & Exercises Priority Queues 359 Chapter Overview The Priority Queue Data Abstraction Heaps Application: Heap Sort Skew Heaps* Application: Discrete Event-Driven Simulation A Framework for Simulations Chapter Summary 383 Further Reading 383 Study Questions & Exercises Maps and Multimaps 387 Chapter Overview The map Data Abstraction Pairs Example Programs A Telephone Directory Silly Sentence Generation Revisited A Concordance Operations on Maps Include Files Creation and Initialization Type Definitions Insertion and Access Removal of Values Iterators Searching and Counting An Example Implementation Chapter Summary 404 Further Reading 405 Study Questions & Exercises 405

10 III OTHER CONTAINERS Hash Tables 409 Chapter Overview The Hash Table Abstraction Hash Functions Collision Resolution Using Buckets Asymptotic Analysis of Hash Table Operations Hash Table Sorting Algorithms Counting Sort Bucket Sorting Radix Sorting The hash_table Data Type Hash Functions Chapter Summary 425 Further Reading 426 Study Questions &. Exercises Matrices: Two-Dimensional Data Structures 429 Chapter Overview The Matrix Data Abstraction C++Matrices Matrices as Vectors of Vectors Combining Matrices and Vectors Sparse Matrices Non-Integer Index Values Chapter Summary Graphs 445 Study Questions &. Exercises 442 Chapter Overview The Graph Data Abstraction Adjacency Matrix Representation Warshall's Algorithm Edge List Representation 451

11 xxii CONTENTS Reachability Using Depth-First Search Weighted Adjacency Matrix Floyd's Algorithm Sparse Matrix Representation Dijkstra's Algorithm Finite Automata Turing Machines* Chapter Summary 471 Further Reading 471 Study Questions &. Exercises Files: External Collections 475 Chapter Overview The File Data Abstraction Character Stream Operations Streams and Iterators Application: Lexical Analysis Application: File Merge Sort Binary Files Open Table Hashing Application: A Simple Database Chapter Summary 495 Further Reading 495 Study Questions & Exercises 495 IV APPENDICES 497 Appendix A Common Implementation Difficulties 499 A.l The Class bool 499 A.2 Integrating the string Library and the Container Classes 500 A.3 Optional Template Arguments 500 A.4 Allocators 501 A. 5 Template Arguments on Member Functions 501

12 xxiii Appendix В Summary of Standard Container Operations 503 B.l The Standard Containers 503 B.l.l String 503 В. 1.2 Vector 504 В. 1.3 List 505 В. 1.4 Stack 506 В. 1.5 Queue 506 В. 1.6 Deque 507 В. 1.7 Bit set 508 В. 1.8 Set 508 В. 1.9 Priority Queue 509 B.l.lOMap 509 B.2 Generic Algorithms 510 B.2.1 Initialization Algorithms 510 B.2.2 Searching Operations 511 B.2.3 In-Place Transformations 512 B.2.4 Removal Algorithms 513 B.2.5 Scalar-Producing Algorithms 514 B.2.6 Sequence-Generating Algorithms 515 B.2.7 Sorting Algorithms 515 B.2.8 Binary Search 516 B.2.9 Set Operations 516 B.2.10 Heap Operations 517 B.2.11 Miscellaneous Algorithms 517 Appendix С Tables of Various Functions 519 Appendix D If C++ Is the Solution, Then What Is the Problem? 523 D.l Class Definitions 524 D.2 Member Functions 524 D.3 Access Controls (Public, Private, and Protected) 525 D.4 References and Pointers 525 D.5 Reference Parameters 526 D.6 Constructors 526 D.7 Copy Constructor 527 D.8 Operators as Functions and Operators as Members 528 D.9 Conversion Operators 528 D. 10 Automatic and Dynamic Allocation 529 D. 11 Destructors 530

13 XXIV CONTENTS D. 12 Friends 530 D. 13 Derived Classes: Inheritance 531 D. 14 Templates 531 D. 15 Polymorphism: Virtual Functions 531 Bibliography 533 Index 539