C++ primer

" C++ Primer is well known as one of the best books for learning C++ and is useful for C++ programmers of all skill levels. This Fourth Edition not only keeps this tradition alive, it actually improves on it." --Steve Vinoski, Chief Engineer, Product Innovation, IONA Technologies " Th...

Descripción completa

Detalles Bibliográficos
Autor Corporativo: Safari Tech Books Online (-)
Otros Autores: Lippman, Stanley B Author (author), Moo, Barbara E Contributor (contributor), Lajoie, Josâee. Contributor, Lajoie, Josée Contributor
Formato: Libro electrónico
Idioma:Inglés
Publicado: [Place of publication not identified] Addison Wesley 2005
Edición:4th ed
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627424906719
Tabla de Contenidos:
  • Cover
  • Contents
  • Preface
  • Chapter 1 Getting Started
  • 1.1 Writing a Simple C++ Program
  • 1.1.1 Compiling and Executing Our Program
  • 1.2 A First Look at Input/Output
  • 1.2.1 Standard Input and Output Objects
  • 1.2.2 A Program that Uses the IO Library
  • 1.3 A Word About Comments
  • 1.4 Control Structures
  • 1.4.1 The while Statement
  • 1.4.2 The for Statement
  • 1.4.3 The if Statement
  • 1.4.4 Reading an Unknown Number of Inputs
  • 1.5 Introducing Classes
  • 1.5.1 The Sales_itemClass
  • 1.5.2 A First Look at Member Functions
  • 1.6 The C++ Program
  • Chapter Summary
  • Defined Terms
  • Part I: The Basics
  • Chapter 2 Variables and Basic Types
  • 2.1 Primitive Built-in Types
  • 2.2 Literal Constants
  • 2.3 Variables
  • 2.4 const Qualifier
  • 2.5 References
  • 2.6 Typedef Names
  • 2.7 Enumerations
  • 2.8 Class Types
  • 2.9 Writing Our Own Header Files
  • Chapter Summary
  • Defined Terms
  • Chapter 3 Library Types
  • 3.1 Namespace using Declarations
  • 3.2 Library string Type
  • 3.3 Library vector Type
  • 3.4 Introducing Iterators
  • 3.5 Library bitset Type
  • Chapter Summary
  • Defined Terms
  • Chapter 4 Arrays and Pointers
  • 4.1 Arrays
  • 4.2 Introducing Pointers
  • 4.3 C-Style Character Strings
  • 4.4 Multidimensioned Arrays
  • Chapter Summary
  • Defined Terms
  • Chapter 5 Expressions
  • 5.1 Arithmetic Operators
  • 5.2 Relational and Logical Operators
  • 5.3 The Bitwise Operators
  • 5.4 Assignment Operators
  • 5.5 Increment and Decrement Operators
  • 5.6 The Arrow Operator
  • 5.7 The Conditional Operator
  • 5.8 The sizeof Operator
  • 5.9 Comma Operator
  • 5.10 Evaluating Compound Expressions
  • 5.11 The new and delete Expressions
  • 5.12 Type Conversions
  • Chapter Summary
  • Defined Terms
  • Chapter 6 Statements
  • 6.1 Simple Statements
  • 6.2 Declaration Statements
  • 6.3 Compound Statements (Blocks)
  • 6.4 Statement Scope.
  • 6.5 The if Statement
  • 6.6 The switch Statement
  • 6.7 The while Statement
  • 6.8 The for Loop Statement
  • 6.9 The do while Statement
  • 6.10 The break Statement
  • 6.11 The continue Statement
  • 6.12 The goto Statement
  • 6.13 try Blocks and Exception Handling
  • 6.14 Using the Preprocessor for Debugging
  • Chapter Summary
  • Defined Terms
  • Chapter 7 Functions
  • 7.1 Defining a Function
  • 7.2 Argument Passing
  • 7.3 The return Statement
  • 7.4 Function Declarations
  • 7.5 Local Objects
  • 7.6 Inline Functions
  • 7.7 Class Member Functions
  • 7.8 Overloaded Functions
  • 7.9 Pointers to Functions
  • Chapter Summary
  • Defined Terms
  • Chapter 8 The IO Library
  • 8.1 An Object-Oriented Library
  • 8.2 Condition States
  • 8.3 Managing the Output Buffer
  • 8.4 File Input and Output
  • 8.5 String Streams
  • Chapter Summary
  • Defined Terms
  • Part II: Containers and Algorithms
  • Chapter 9 Sequential Containers
  • 9.1 Defining a Sequential Container
  • 9.2 Iterators and Iterator Ranges
  • 9.3 Sequence Container Operations
  • 9.4 How a vector Grows
  • 9.5 Deciding Which Container to Use
  • 9.6 strings Revisited
  • 9.7 Container Adaptors
  • Chapter Summary
  • Defined Terms
  • Chapter 10 Associative Containers
  • 10.1 Preliminaries: the pair Type
  • 10.2 Associative Containers
  • 10.3 The map Type
  • 10.4 The set Type
  • 10.5 The multimap and multiset Types
  • 10.6 Using Containers: Text-Query Program
  • Chapter Summary
  • Defined Terms
  • Chapter 11 Generic Algorithms
  • 11.1 Overview
  • 11.2 A First Look at the Algorithms
  • 11.3 Revisiting Iterators
  • 11.4 Structure of Generic Algorithms
  • 11.5 Container-Specific Algorithms
  • Chapter Summary
  • Defined Terms
  • Part III: Classes and Data Abstraction
  • Chapter 12 Classes
  • 12.1 Class Definitions and Declarations
  • 12.2 The Implicit this Pointer
  • 12.3 Class Scope
  • 12.4 Constructors.
  • 12.5 Friends
  • 12.6 static Class Members
  • Chapter Summary
  • Defined Terms
  • Chapter 13 Copy Control
  • 13.1 The Copy Constructor
  • 13.2 The Assignment Operator
  • 13.3 The Destructor
  • 13.4 A Message-Handling Example
  • 13.5 Managing Pointer Members
  • Chapter Summary
  • Defined Terms
  • Chapter 14 Overloaded Operations and Conversions
  • 14.1 Defining an Overloaded Operator
  • 14.2 Input and Output Operators
  • 14.3 Arithmetic and Relational Operators
  • 14.4 Assignment Operators
  • 14.5 Subscript Operator
  • 14.6 Member Access Operators
  • 14.7 Increment and Decrement Operators
  • 14.8 Call Operator and Function Objects
  • 14.9 Conversions and Class Types
  • Chapter Summary
  • Defined Terms
  • Part IV: Object-Oriented and Generic Programming
  • Chapter 15 Object-Oriented Programming
  • 15.1 OOP: An Overview
  • 15.2 Defining Base and Derived Classes
  • 15.3 Conversions and Inheritance
  • 15.4 Constructors and Copy Control
  • 15.5 Class Scope under Inheritance
  • 15.6 Pure Virtual Functions
  • 15.7 Containers and Inheritance
  • 15.8 Handle Classes and Inheritance
  • 15.9 Text Queries Revisited
  • Chapter Summary
  • Defined Terms
  • Chapter 16 Templates and Generic Programming
  • 16.1 Template Definitions
  • 16.2 Instantiation
  • 16.3 Template Compilation Models
  • 16.4 Class Template Members
  • 16.5 A Generic Handle Class
  • 16.6 Template Specializations
  • 16.7 Overloading and Function Templates
  • Chapter Summary
  • Defined Terms
  • Part V: Advanced Topics
  • Chapter 17 Tools for Large Programs
  • 17.1 Exception Handling
  • 17.2 Namespaces
  • 17.3 Multiple and Virtual Inheritance
  • Chapter Summary
  • Defined Terms
  • Chapter 18 Specialized Tools and Techniques
  • 18.1 Optimizing Memory Allocation
  • 18.2 Run-Time Type Identification
  • 18.3 Pointer to Class Member
  • 18.4 Nested Classes
  • 18.5 Union: A Space-Saving Class.
  • 18.6 Local Classes
  • 18.7 Inherently Nonportable Features
  • Chapter Summary
  • Defined Terms
  • Appendix A: The Library
  • A.1 Library Names and Headers
  • A.2 A Brief Tour of the Algorithms
  • A.2.1 Algorithms to Find an Object
  • A.2.2 Other Read-Only Algorithms
  • A.2.3 Binary-Search Algorithms
  • A.2.4 Algorithms that Write Container Elements
  • A.2.5 Partitioning and Sorting Algorithms
  • A.2.6 General Reordering Operations
  • A.2.7 Permutation Algorithms
  • A.2.8 Set Algorithms for Sorted Sequences
  • A.2.9 Minimum and Maximum Values
  • A.2.10 Numeric Algorithms
  • A.3 The IO Library Revisited
  • A.3.1 Format State
  • A.3.2 Many Manipulators Change the Format State
  • A.3.3 Controlling Output Formats
  • A.3.4 Controlling Input Formatting
  • A.3.5 Unformatted Input/Output Operations
  • A.3.6 Single-Byte Operations
  • A.3.7 Multi-Byte Operations
  • A.3.8 Random Access to a Stream
  • A.3.9 Reading and Writing to the Same File
  • Index.