Cargando…
Using the C++ standard template libraries /
Using the C++ Standard Template Libraries is a contemporary treatment that teaches the generic programming capabilities that the C++ 14 Standard Library provides. In this book, author Ivor Horton explains what the class and function templates available with C++ 14 do, and how to use them in a practi...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Apress,
[2015]
|
| Colección: | Expert's voice in C++.
|
| Temas: | |
| Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
Tabla de Contenidos:
- At a Glance; Contents; About the Author; About the Technical Reviewer; Acknowledgments; Introduction; Chapter 1: Introducing the Standard Template Library; Basic Ideas; Templates; The Containers ; Iterators ; Obtaining Iterators; Iterator Categories; Stream Iterators; Iterator Adaptors ; Reverse Iterators; Insert Iterators; Move Iterators; Operations on Iterators ; Smart Pointers ; Using unique_ptr Pointers ; Resetting unique_ptr Objects; Comparing and Checking unique_ptr Objects; Using shared_ptr Pointers ; Resetting shared_ptr Objects.
- Comparing and Checking shared_ptr Objects weak_ptr Pointers; Algorithms ; Passing a Function as an Argument; Function Objects; Lambda Expressions ; Naming a Lambda Expression; Passing a Lambda Expression to a Function ; The Capture Clause ; Summary; Chapter 2: Using Sequence Containers; The Sequence Containers; Function Members That Are Common Between Containers; Using array Containers; Accessing Elements ; Using Iterators with array Containers ; Comparing array Containers; Using vector Containers; Creating vector Containers; The Capacity and Size of a Vector.
- Accessing Elements Using Iterators with a vector Container; Adding New Elements to a vector Container; Appending Elements ; Inserting Elements ; Deleting Elements ; vector Containers ; Using deque Containers; Creating deque Containers; Accessing Elements ; Adding and Removing Elements ; Replacing the Contents of a deque Container; Using a list Container; Creating list Containers; Adding Elements ; Removing Elements ; Sorting and Merging Elements ; Accessing Elements ; Using forward_list Containers; Defining Your Own Iterators; STL Iterator Requirements.
- A Problem with Using STL Iterators The STL Approach ; Using the Iterator Template; STL Iterator Member Function Requirements ; Summary; Chapter 3: Container Adapters; What Are Container Adapters?; Creating and Using a stack Container Adapter; Stack Operations ; Creating and Using a queue Container Adapter; Queue Operations ; A Practical Use of a Queue Container; Using a priority_queue Container Adapter; Creating a Priority Queue; Operations for a Priority Queue; Heaps; Creating a Heap; Heap Operations ; Storing Pointers in a Container.
- Storing Pointers in Sequence Containers Storing Pointers in a Priority Queue ; Heaps of Pointers; Containers of Base Class Pointers ; Applying Algorithms to a Range of Pointers; Summary; Chapter 4: Map Containers; Introducing Map Containers; Using a map Container; Creating a map Container; Inserting Elements in a map; Constructing map Elements in Place; Accessing Elements in a map; Deleting Elements; Using pair and tuple Objects; Operations with a pair; Operations with a tuple; tuples and pairs in Action; Using a multimap Container; Changing the Comparison Function.