Modern C++: Efficient and Scalable Application Development

Modern C++: Efficient and Scalable Application Development

By : Richard Grimes, Marius Bancila

Buy this Book

Modern C++: Efficient and Scalable Application Development

By: Richard Grimes, Marius Bancila

Buy this Book

Overview of this book

C++ is one of the most widely used programming languages. It is fast, flexible, and used to solve many programming problems. This Learning Path gives you an in-depth and hands-on experience of working with C++, using the latest recipes and understanding most recent developments. You will explore C++ programming constructs by learning about language structures, functions, and classes, which will help you identify the execution flow through code. You will also understand the importance of the C++ standard library as well as memory allocation for writing better and faster programs. Modern C++: Efficient and Scalable Application Development deals with the challenges faced with advanced C++ programming. You will work through advanced topics such as multithreading, networking, concurrency, lambda expressions, and many more recipes. By the end of this Learning Path, you will have all the skills to become a master C++ programmer. This Learning Path includes content from the following Packt products: • Beginning C++ Programming by Richard Grimes • Modern C++ Programming Cookbook by Marius Bancila • The Modern C++ Challenge by Marius Bancila

Title Page

About Packt

Contributors

Preface

Free Chapter

Understanding Language Features

Writing C++

Using Operators

Controlling Execution Flow

Using C++ language features

Summary

Working with Memory, Arrays, and Pointers

Using memory in C++

Using Arrays

Using Pointers in C++

Allocating memory in code

Memory and the C++ Standard Library

References

Using Pointers in Practice

Summary

Using Functions

Defining C++ functions

Using function parameters

Using functions in C++

Summary

Classes

Writing classes

Using objects with pointers

Templates

Using classes

Summary

Using the Standard Library Containers

Working with pairs and tuples

Containers

Algorithms

Using the numeric libraries

Using the Standard Library

Summary

Using Strings

Using the string class as a container

Internationalization

Strings and numbers

Using stream classes

Using regular expressions

Using strings

Summary

Diagnostics and Debugging

Preparing your code

Application termination

Error values

C++ exceptions

Summary

Learning Modern Core Language Features

Using auto whenever possible

Creating type aliases and alias templates

Understanding uniform initialization

Understanding the various forms of non-static member initialization

Controlling and querying object alignment

Using scoped enumerations

Using override and final for virtual methods

Using range-based for loops to iterate on a range

Enabling range-based for loops for custom types

Using explicit constructors and conversion operators to avoid implicit conversion

Using unnamed namespaces instead of static globals

Using inline namespaces for symbol versioning

Using structured bindings to handle multi-return values

Working with Numbers and Strings

Converting between numeric and string types

Limits and other properties of numeric types

Generating pseudo-random numbers

Initializing all bits of internal state of a pseudo-random number generator

Creating cooked user-defined literals

Creating raw user-defined literals

Using raw string literals to avoid escaping characters

Creating a library of string helpers

Verifying the format of a string using regular expressions

Parsing the content of a string using regular expressions

Replacing the content of a string using regular expressions

Using string_view instead of constant string references

Exploring Functions

Defaulted and deleted functions

Using lambdas with standard algorithms

Using generic lambdas

Writing a recursive lambda

Writing a function template with a variable number of arguments

Using fold expressions to simplify variadic function templates

Implementing higher-order functions map and fold

Composing functions into a higher-order function

Uniformly invoking anything callable

Standard Library Containers, Algorithms, and Iterators

Using vector as a default container

Using bitset for fixed-size sequences of bits

Using vector<bool> for variable-size sequences of bits

Finding elements in a range

Sorting a range

Initializing a range

Using set operations on a range

Using iterators to insert new elements in a container

Writing your own random access iterator

Container access with non-member functions

Math Problems

Language Features

Strings and Regular Expressions

Problems

Solutions

Streams and Filesystems

Date and Time

Algorithms and Data Structures

Problems

Solutions

Other Books You May Enjoy

Leave a Review - Let Other Readers Know What You Think

Index

Customer Reviews

5 star

4 star

3 star

2 star

1 star

Problems

Here are the problem-solving sections for this chapter.

45. Priority queue

Write a data structure that represents a priority queue that provides constant time lookup for the largest element, but has logarithmic time complexity for adding and removing elements. A queue inserts new elements at the end and removes elements from the top. By default, the queue should use operator< to compare elements, but it should be possible for the user to provide a comparison function object that returns true if the first argument is less than the second. The implementation must provide at least the following operations:

push() to add a new element
pop() to remove the top element
top() to provide access to the top element
size() to indicate the number of elements in the queue
empty() to indicate whether the queue is empty

46. Circular buffer

Create a data structure that represents a circular buffer of a fixed size. A circular buffer overwrites existing elements when the buffer is being filled beyond its...

Modern C++: Efficient and Scalable Application Development

By : Richard Grimes, Marius Bancila

Modern C++: Efficient and Scalable Application Development

By: Richard Grimes, Marius Bancila

Overview of this book

Related Content you might be interested in

Current Title:

Modern C++: Efficient and Scalable Application Development

Problems

45. Priority queue

46. Circular buffer