C++ programming tutorial for professionals

Download free C++ language tutorial course in PDF, training file in 146 chapters and 708 pages. Free unaffiliated ebook created from Stack OverFlow contributor.

Table of contents

• About
• Getting started with C++
• Hello World
• Comments
• The standard C++ compilation process
• Function
• Visibility of function prototypes and declarations
• Preprocessor
• Literals
• this
• Integer literal
• true
• false
• nullptr
• operator precedence
• Logical && and || operators: short-circuit
• Unary Operators
• Arithmetic operators
• Logical AND and OR operators
• Floating Point Arithmetic
• Floating Point Numbers are Weird
• Bit Operators
• | - bitwise OR
• ^ - bitwise XOR (exclusive OR)
• & - bitwise AND
• << - left shift
• >> - right shift
• Bit Manipulation
• Remove rightmost set bit
• Set all bits
• Toggling a bit
• Checking a bit
• Counting bits set
• Check if an integer is a power of 2
• Setting a bit
• Clearing a bit
• Changing the nth bit to x
• Bit Manipulation Application: Small to Capital Letter
• Bit ?elds
• Declaration and Usage
• Arrays
• Array initialization
• A ?xed size raw array matrix (that is, a 2D raw array)
• Dynamically sized raw array
• Array size: type safe at compile time
• Expanding dynamic size array by using std::vector
• Literals
• Floating Point Arithmetic
• Bit Manipulation
• Arrays
• Basic input/output in c++
• File I/O
• Stream manipulators
• Metaprogramming
• mutable keyword
• Type Keywords
• Variable Declaration Keywords
• Returning several values from a function
• References
• C++ function "call by value" vs. "call by reference"
• Pointers
• The This Pointer
• Classes/Structures
• Operator Overloading
• Virtual Member Functions
• Special Member Functions
• Constant class member functions
• Namespaces
• Using declaration
• std::array
• std::map
• std::function: To wrap any element that is callable
• std::pair
• std::variant
• std::any
• std::integer_sequence
• Standard Library Algorithms
• The ISO C++ Standard
• Inline variables
• Random number generation
• Date and time using <chrono> header
• Sorting
• Enumeration
• Iteration
• Regular expressions
• Implementation-defined behavior
• Exceptions
• Lambdas
• Value Categories
• Preprocessor
• Data Structures in C++
• Templates
• Expression templates
• Curiously Recurring Template Pattern (CRTP)
• Threading
• Thread synchronization structures
• The Rule of Three, Five, And Zero
• RAII: Resource Acquisition Is Initialization
• RTTI: Run-Time Type Information
• Mutexes
• Recursive Mutex
• Semaphore
• Futures and Promises
• Atomic Types
• Type Erasure
• Explicit type conversions
• Unnamed types
• Type Traits
• Return Type Covariance
• Layout of object types
• Type Inference
• Typedef and type aliases
• type deduction
• Trailing return type
• Alignment
• Perfect Forwarding
• decltype
• SFINAE (Substitution Failure Is Not An Error)
• Undefined Behavior
• Overload resolution
• Move Semantics
• Pimpl Idiom
• auto
• Copy Elision
• Fold Expressions
• Unions
• Design pattern implementation in C++
• Singleton Design Pattern
• User-Defined Literals
• Memory management
• C++11 Memory Model
• Scopes
• static_assert
• constexpr
• One Definition Rule (ODR)
• Unspecified behavior
• Argument Dependent Name Lookup
• Attributes
• Recursion in C++
• Arithmitic Metaprogramming
• Callable Objects
• Client server examples
• Const Correctness
• Parameter packs
• Build Systems
• Concurrency With OpenMP
• Resource Management
• Storage class specifiers
• Linkage specifications
• Digit separators
• C incompatibilities
• Side by Side Comparisons of classic C++ examples solved via C++ vs C++11 vs C++14 vs C++17
• Compiling and Building
• Common compile/linker errors (GCC)
• More undefined behaviors in C++
• Unit Testing in C++
• C++ Debugging and Debug-prevention Tools & Techniques
• Optimization in C++
• Optimization
• Profiling
• Refactoring Techniques

It is a free C++ language ebook created for beginners. The content is extracted from Stack Overflow pltaform, which is written by many C++ language developers and contributors.

The content is released under Creative Commons BY-SA