Hacking C++

https://hackingcpp.com/
Admin
Hacking C++ is a comprehensive online resource offering articles, recipes, cheat sheets, and guides...
Tokens:6,846
Snippets:71
Trust Score:9.3
Update:10 months ago
Show doc for...
Tokens:
Raw
### C++ Standard Library Range Copy Algorithms

Source: https://hackingcpp.com/feed

Explains standard algorithms for copying ranges of elements in C++ with examples and visual explanations.

```cpp
/* Example for std::copy */
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> src = {1, 2, 3};
    std::vector<int> dest(3);
    std::copy(src.begin(), src.end(), dest.begin());
    std::cout << "Copied elements into dest vector." << std::endl;
    return 0;
}
```

--------------------------------

### C++ Standard Library Algorithms Introduction

Source: https://hackingcpp.com/feed

Provides a basic introduction to the C++ standard library algorithms. Includes conceptual explanations, examples, and visual aids to illustrate their fundamental principles.

```cpp
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> nums = {3, 1, 4, 1, 5, 9, 2, 6};

    // Example: std::sort
    std::sort(nums.begin(), nums.end());
    std::cout << "Sorted: ";
    for (int n : nums) {
        std::cout << n << " ";
    }
    std::cout << std::endl;

    // Example: std::find
    auto it = std::find(nums.begin(), nums.end(), 5);
    if (it != nums.end()) {
        std::cout << "Found 5 at position: " << std::distance(nums.begin(), it) << std::endl;
    }

    // Example: std::count
    int count_of_1 = std::count(nums.begin(), nums.end(), 1);
    std::cout << "Count of 1: " << count_of_1 << std::endl;

    return 0;
}
```

--------------------------------

### C++ Standard Library Range Utilities Introduction

Source: https://hackingcpp.com/feed

Introduces C++ standard library utilities for working with ranges of elements. Includes examples and visual explanations for better understanding.

```cpp
// Example: std::views::filter
#include <ranges>
#include <vector>
#include <iostream>

int main() {
    std::vector<int> numbers = {1, 2, 3, 4, 5, 6};
    auto even_numbers = numbers | std::views::filter([](int n){ return n % 2 == 0; });
    for (int n : even_numbers) {
        std::cout << n << " ";
    }
    std::cout << std::endl;
    return 0;
}
```

--------------------------------

### C++ Standard Library Sorted Sequence Operations

Source: https://hackingcpp.com/feed

Provides an introduction, examples, and visual explanations of standard algorithms for inspecting and manipulating sorted sequences in C++.

```cpp
/* Example for std::lower_bound */
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> v = {1, 2, 3, 4, 5};
    auto it = std::lower_bound(v.begin(), v.end(), 3);
    std::cout << "Lower bound for 3 is at index: " << (it - v.begin()) << std::endl;
    return 0;
}
```

--------------------------------

### C++ Standard Library Range Comparison Algorithms

Source: https://hackingcpp.com/feed

Introduces and provides examples and visual explanations for standard algorithms used to compare ranges of elements in C++.

```cpp
/* Example for std::equal */
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> v1 = {1, 2, 3};
    std::vector<int> v2 = {1, 2, 3};
    bool are_equal = std::equal(v1.begin(), v1.end(), v2.begin());
    std::cout << "Vectors are equal: " << std::boolalpha << are_equal << std::endl;
    return 0;
}
```

--------------------------------

### C++ Standard Library Range Move Algorithms

Source: https://hackingcpp.com/feed

Introduces and explains standard algorithms for moving ranges of elements in C++ with examples and visual aids.

```cpp
/* Example for std::move */
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> src = {1, 2, 3};
    std::vector<int> dest(3);
    std::move(src.begin(), src.end(), dest.begin());
    std::cout << "Moved elements into dest vector." << std::endl;
    return 0;
}
```

--------------------------------

### C++ Standard Library Heap Operations

Source: https://hackingcpp.com/feed

Covers standard algorithms for array-based max heap operations in C++, including introduction, examples, and visual explanations.

```cpp
/* Example for std::make_heap */
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> v = {1, 5, 2, 4, 3};
    std::make_heap(v.begin(), v.end());
    std::cout << "Heap created." << std::endl;
    return 0;
}
```

--------------------------------

### Value vs. Reference Semantics in C++ and Python

Source: https://hackingcpp.com/feed

Explains the programming paradigms of value semantics and reference semantics with examples in C++ and Python. Covers differences in how data is passed and manipulated.

```cpp
// Placeholder for C++ code example
// Actual code would demonstrate passing by value and by reference.
```

```python
# Placeholder for Python code example
# Actual code would demonstrate mutable vs. immutable objects and assignment behavior.
```

--------------------------------

### C++ Standard Library Removal Algorithms

Source: https://hackingcpp.com/feed

Introduces standard algorithms in the C++ library designed for removing elements from ranges. Includes examples and visual explanations of how these algorithms operate.

```cpp
#include <vector>
#include <algorithm>
#include <iostream>

int main() {
    std::vector<int> nums = {1, 0, 2, 0, 3, 0, 4, 0};

    // Using std::remove to move elements to be removed to the end
    // It returns an iterator to the new logical end of the range
    auto new_end = std::remove(nums.begin(), nums.end(), 0);

    // Erase the removed elements from the vector
    nums.erase(new_end, nums.end());

    std::cout << "Vector after removing 0s: ";
    for (int n : nums) {
        std::cout << n << " ";
    }
    std::cout << std::endl;

    // Example using std::remove_if
    std::vector<std::string> words = {"apple", "banana", "kiwi", "orange", "grape"};
    auto remove_short_words = [](const std::string& s) {
        return s.length() < 5;
    };

    auto new_end_words = std::remove_if(words.begin(), words.end(), remove_short_words);
    words.erase(new_end_words, words.end());

    std::cout << "Words after removing short ones: ";
    for (const auto& word : words) {
        std::cout << word << " ";
    }
    std::cout << std::endl;

    return 0;
}
```

--------------------------------

### C++ Standard Attributes Overview

Source: https://hackingcpp.com/feed

Presents a comprehensive overview of all C++ standard attributes, including [[nodiscard]], [[fallthrough]], [[likely]], [[unlikely]], [[maybe_unused]], [[noreturn]], [[no_unique_address]], and [[carries_dependency]]. Includes examples for each.

```cpp
#include <iostream>
#include <[[memory_resource]]>

[[nodiscard]] int get_value() {
    return 42;
}

void example_function(int x) {
    switch (x) {
        case 0:
            std::cout << "Case 0" << std::endl;
            [[fallthrough]]; // Indicate fallthrough is intentional
        case 1:
            std::cout << "Case 1 or 0" << std::endl;
            break;
        default:
            std::cout << "Default" << std::endl;
            break;
    }

    [[maybe_unused]] int unused_var = 10;
}

[[noreturn]] void terminate() {
    std::abort();
}

int main() {
    [[maybe_unused]] auto val = get_value(); // Suppress warning if val is not used
    example_function(0);
    // terminate(); // This call would not return
    return 0;
}
```

--------------------------------

### C++ Diagnostic Techniques: Warnings, Assertions, and Testing

Source: https://hackingcpp.com/feed

An overview of fundamental C++ diagnostic techniques for ensuring code correctness. It highlights important compiler warnings (GCC/Clang/MSVC), assertions (assert/static_assert), and provides examples of testing using doctest.

```cpp
#include <iostream>
#include <cassert>

// Example function
int divide(int a, int b) {
    // Assertion: Ensure b is not zero before division
    assert(b != 0 && "Division by zero is not allowed!");

    // Static assert: Compile-time check (if applicable, e.g., type constraints)
    static_assert(sizeof(int) >= 4, "Integer size too small.");

    return a / b;
}

// --- Doctest Example (requires doctest header) ---
// """ Simple test for the divide function
// >>> divide(10, 2)
// 5
// >>> divide(10, 0)
// *** assert failed: Division by zero is not allowed!
// ...
// """

int main() {
    std::cout << "Calling divide(10, 2)...\n";
    int result = divide(10, 2);
    std::cout << "Result: " << result << std::endl;

    // Uncomment the following line to see the assertion failure
    // std::cout << "Calling divide(10, 0)...\n";
    // result = divide(10, 0);

    // Compiler warnings are enabled via compiler flags (e.g., -Wall -Wextra for GCC/Clang)
    // MSVC has /W4 for high warning levels.

    return 0;
}

```

--------------------------------

### String Parameter Types for C++ Functions

Source: https://hackingcpp.com/feed

Guides on selecting the appropriate function parameter types for strings in C++. It covers four scenarios: read-only access (C++17 and C++98-C++14), when a copy is needed, and in-place modification.

```cpp
// Scenario 1: Read-only access in C++17 and later
void printString(const std::string& str) {
    // ... use str ...
}

// Scenario 2: Read-only access in C++98 to C++14
void printStringLegacy(const std::string& str) {
    // ... use str ...
}

// Scenario 3: When a copy of the input string is always needed inside the function
void processStringCopy(std::string str) {
    // str is a copy, modify it freely
    str += " - processed";
    // ... use modified str ...
}

// Scenario 4: In-place modification of the input string
void modifyString(std::string& str) {
    // str is a reference, modifications affect the original string
    str += " - modified";
}

// Alternative for read-only access (C++11 onwards, avoids potential SSO issues for very short strings)
void printStringView(std::string_view sv) {
    // ... use sv ...
}

```

--------------------------------

### C++ Pointers Introduction and Usage

Source: https://hackingcpp.com/feed

A fundamental introduction to pointers in C++. Covers syntax, semantics, const pointers, the 'this' pointer, forward declarations, and best practice guidelines for pointer management.

```cpp
#include <iostream>

int main() {
    int var = 10;
    int* ptr = &var; // ptr points to var

    std::cout << "Value of var: " << var << std::endl;
    std::cout << "Address of var: " << &var << std::endl;
    std::cout << "Value of ptr: " << ptr << std::endl; // prints address of var
    std::cout << "Value pointed to by ptr: " << *ptr << std::endl; // prints value of var (10)

    int const* const_ptr_to_int = &var; // Pointer to const int
    // *const_ptr_to_int = 20; // Error: cannot assign to variable with const-qualified type 'const int'

    int var2 = 5;
    int* const const_ptr = &var2; // Const pointer to int
    *const_ptr = 15; // OK: can change value
    // const_ptr = &var; // Error: cannot assign to variable with const-qualified type 'int *const'

    return 0;
}
```

--------------------------------

### Handling C++ Exceptions: Usage, Pitfalls, and Guarantees

Source: https://hackingcpp.com/feed

Details on C++ exception handling, including common practices, potential pitfalls, and the importance of exception guarantees. It covers Resource Acquisition Is Initialization (RAII) for exception safety and emphasizes avoiding exceptions in destructors.

```cpp
#include <iostream>
#include <stdexcept>
#include <fstream>

class Resource {
public:
    Resource() { std::cout << "Resource acquired.\n"; }
    ~Resource() { std::cout << "Resource released.\n"; } // RAII: Destructor ensures cleanup
    void use() { std::cout << "Using resource.\n"; }
};

void riskyFunction() {
    Resource res;
    // Simulate an operation that might throw
    bool condition = true;
    if (condition) {
        throw std::runtime_error("Something went wrong!");
    }
    res.use(); // This line might not be reached if an exception is thrown
}

int main() {
    try {
        riskyFunction();
    } catch (const std::exception& e) {
        std::cerr << "Caught exception: " << e.what() << std::endl;
        // RAII ensures 'res' destructor is called even after exception
    }

    // Pitfall: Never let exceptions escape from destructors
    // Destructors should generally not throw exceptions, as this can lead to std::terminate.
    return 0;
}
```

--------------------------------

### Overview of C++ Standard Library Algorithms

Source: https://hackingcpp.com/feed

Presents a comprehensive overview of the C++ Standard Library algorithms, with a focus on providing a small visual representation or explanation for each algorithm.

```cpp
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

int main() {
    std::vector<int> nums = {1, 5, 2, 8, 3};

    // Example: std::sort
    std::sort(nums.begin(), nums.end());
    std::cout << "Sorted: ";
    for (int n : nums) {
        std::cout << n << " ";
    }
    std::cout << std::endl;

    // Example: std::accumulate
    int sum = std::accumulate(nums.begin(), nums.end(), 0);
    std::cout << "Sum: " << sum << std::endl;

    // Example: std::find
    auto it = std::find(nums.begin(), nums.end(), 8);
    if (it != nums.end()) {
        std::cout << "Found 8 at index: " << std::distance(nums.begin(), it) << std::endl;
    }

    // Many other algorithms exist, such as:
    // std::copy, std::transform, std::for_each, std::remove, std::unique, std::lower_bound, std::upper_bound, etc.
    // Each algorithm has specific use cases and performance characteristics.

    return 0;
}

```

--------------------------------

### C++ Tooling Ecosystem Overview

Source: https://hackingcpp.com/feed

An introductory overview of the C++ tooling ecosystem. Covers essential tools such as compilers, build systems, debuggers, sanitizers, analyzers, profilers, package managers, and online development tools.

```text
# Compilers:
#   GCC, Clang, MSVC

# Build Systems:
#   CMake, Make, Bazel, Meson

# Debuggers:
#   GDB, LLDB, Visual Studio Debugger

# Sanitizers:
#   AddressSanitizer (ASan), UndefinedBehaviorSanitizer (UBSan), ThreadSanitizer (TSan)

# Analyzers:
#   Clang-Tidy, Cppcheck

# Profilers:
#   Perf, Valgrind (Callgrind), VTune

# Package Managers:
#   Conan, vcpkg, Hunter

# Online Tools:
#   Compiler Explorer (godbolt.org), Wandbox

```

--------------------------------

### Generate Reproducible Random Number Sequences in C++

Source: https://hackingcpp.com/feed

Demonstrates how to create reproducible random number sequences using the C++ standard library. This is useful for testing and debugging where consistent random data is required. The approach involves seeding the random number generator with a specific value.

```cpp
#include <iostream>
#include <random>

int main() {
    // Create a reproducible random number sequence
    std::mt19937 generator(12345); // Seed with a specific value
    std::uniform_int_distribution<int> distribution(1, 100);

    // Generate and print 10 random numbers
    for (int i = 0; i < 10; ++i) {
        std::cout << distribution(generator) << std::endl;
    }

    return 0;
}
```

--------------------------------

### C++ Container Traversal Methods Overview

Source: https://hackingcpp.com/feed

Details various approaches for traversing containers in C++, including range-based for loops, std::for_each, explicit iterator traversal, and index traversal. Highlights their usage and differences.

```cpp
#include <vector>
#include <iostream>
#include <algorithm>

int main() {
    std::vector<int> v = {1, 2, 3};

    // Range-based for loop
    for (int x : v) {
        std::cout << "Range-based: " << x << std::endl;
    }

    // std::for_each
    std::for_each(v.begin(), v.end(), [](int x){ std::cout << "std::for_each: " << x << std::endl; });

    // Explicit iterator traversal
    for (auto it = v.begin(); it != v.end(); ++it) {
        std::cout << "Iterator: " << *it << std::endl;
    }

    // Index traversal
    for (size_t i = 0; i < v.size(); ++i) {
        std::cout << "Index: " << v[i] << std::endl;
    }

    return 0;
}
```

--------------------------------

### Create Random Generator by Combining Engine and Distribution in C++

Source: https://hackingcpp.com/feed

Explains how to create a single random number generator object by combining a standard library random distribution and a random engine. Two solutions are presented: one using a mutable lambda and another using a custom function class.

```cpp
#include <iostream>
#include <random>
#include <functional>

int main() {
    // Solution 1: Using a mutable lambda
    std::mt19937 engine;
    std::uniform_int_distribution<int> dist(1, 100);

    auto generator_lambda = [&engine, &dist]() mutable {
        return dist(engine);
    };

    std::cout << "Lambda generated: " << generator_lambda() << std::endl;
    std::cout << "Lambda generated: " << generator_lambda() << std::endl;

    // Solution 2: Using a custom function class (functor)
    struct RandomGeneratorFunctor {
        std::mt19937& engine;
        std::uniform_int_distribution<int>& dist;

        RandomGeneratorFunctor(std::mt19937& eng, std::uniform_int_distribution<int>& d) 
            : engine(eng), dist(d) {}

        int operator()() {
            return dist(engine);
        }
    };

    std::mt19937 engine2;
    std::uniform_int_distribution<int> dist2(1, 100);
    RandomGeneratorFunctor generator_functor(engine2, dist2);

    std::cout << "Functor generated: " << generator_functor() << std::endl;
    std::cout << "Functor generated: " << generator_functor() << std::endl;

    return 0;
}
```

--------------------------------

### Understanding the C++ __cplusplus Macro

Source: https://hackingcpp.com/feed

Provides an overview of the different values that the standard C++ macro __cplusplus can take. This macro indicates the C++ standard version being used by the compiler, which is crucial for feature detection.

```cpp
#include <iostream>

int main() {
    std::cout << "__cplusplus macro value: " << __cplusplus << std::endl;

    // Common values:
    // 199711L: C++98 / C++03
    // 201103L: C++11
    // 201402L: C++14
    // 201703L: C++17
    // 202002L: C++20

    #if __cplusplus >= 201703L
        std::cout << "This compiler supports at least C++17.\n";
    #elif __cplusplus == 201103L
        std::cout << "This compiler supports C++11.\n";
    #else
        std::cout << "This compiler supports an older C++ standard.\n";
    #endif

    return 0;
}

```

--------------------------------

### Fast Allocation for Uninitialized Numeric Arrays in C++

Source: https://hackingcpp.com/feed

Provides methods for allocating large, uninitialized numeric arrays or vectors in C++ without the overhead of zero-initialization. This is beneficial for performance-critical applications. The provided solution may vary in convenience, safety, and standard compliance.

```cpp
#include <vector>
#include <memory>

// Example using std::vector with std::uninitialized_value (C++20)
// Note: Direct uninitialized allocation is complex and often requires custom allocators or placement new.
// This example illustrates the concept of avoiding default initialization.

struct MyData {
    int value;
};

int main() {
    // For C++20 and later, std::vector might offer ways to avoid value-initialization
    // However, true "uninitialized" allocation often means bypassing standard containers' guarantees.
    // A common pattern involves raw memory allocation and placement new.

    size_t count = 1000;
    std::vector<MyData> data(count);

    // If you need to avoid default construction, consider manual memory management or specific allocator strategies.
    // For instance, using unique_ptr with a custom deleter that doesn't zero-initialize.

    // Example of raw allocation (use with extreme caution):
    char* buffer = new char[count * sizeof(MyData)];
    // Then use placement new to construct objects in this buffer without default initialization.
    // MyData* uninitialized_data = reinterpret_cast<MyData*>(buffer);
    // For example: new (uninitialized_data + i) MyData{}; // This still default initializes

    // The most performant way for raw uninitialized data is often manual memory management.
    // For example, if you only need POD types:
    int* uninitialized_ints = static_cast<int*>(operator new[](count * sizeof(int)));
    // ... use uninitialized_ints ...
    operator delete[](uninitialized_ints);

    return 0;
}
```

--------------------------------

### C++ Argument Dependent Lookup (ADL) Explained

Source: https://hackingcpp.com/feed

Explains Argument Dependent Lookup (ADL) in C++, detailing how it works and common C++ idioms that utilize it, such as two-step lookup, hidden friends, niebloids, and Custom Parameter Objects (CPOs).

```cpp
#include <iostream>

namespace MyNamespace {
    struct MyStruct {
        void foo() const { std::cout << "MyStruct::foo()\n"; }
    };

    // Function in the same namespace as MyStruct
    void adl_func(MyStruct s) {
        std::cout << "MyNamespace::adl_func()\n";
        s.foo(); // Normal member function call
    }

    // A free function that might be found via ADL
    void adl_func(int i) {
        std::cout << "MyNamespace::adl_func(int)\n";
    }
}

// Another namespace
namespace AnotherNamespace {
    void adl_func(MyNamespace::MyStruct s) {
        std::cout << "AnotherNamespace::adl_func()\n";
        s.foo();
    }
}

int main() {
    MyNamespace::MyStruct ms;
    int i = 5;

    // When calling adl_func(ms), the compiler looks in:
    // 1. The current scope (main)
    // 2. The scope of the argument types (MyNamespace)
    // This will find MyNamespace::adl_func(MyStruct)
    MyNamespace::adl_func(ms);

    // This will find AnotherNamespace::adl_func(MyStruct)
    AnotherNamespace::adl_func(ms);

    // This will find MyNamespace::adl_func(int)
    MyNamespace::adl_func(i);

    return 0;
}
```

--------------------------------

### C++ Standard Library Special Iterators Overview

Source: https://hackingcpp.com/feed

Provides a short overview of special-purpose iterators available in the C++ standard library. These iterators offer specialized functionalities beyond basic traversal.

```cpp
// Example: std::move_iterator
#include <iterator>
#include <vector>
#include <iostream>

int main() {
    std::vector<int> src = {1, 2, 3};
    std::vector<int> dest;
    std::move(src.begin(), src.end(), std::back_inserter(dest));
    // src might be in an unspecified state after move
    for (int x : dest) {
        std::cout << x << " ";
    }
    std::cout << std::endl;
    return 0;
}
```
Tokens:
Raw