Namespaces
Variants

std::ranges::destroy_at

From cppreference.com
 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Non-modifying sequence operations    
Batch operations
(C++17)
Search operations
Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
(C++11)    

Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations


 
 
Defined in header <memory>
Call signature
template< std::destructible T >
constexpr void destroy_at( T* p ) noexcept;
(since C++20)

If T is not an array type, calls the destructor of the object pointed to by p, as if by p->~T(). Otherwise, recursively destroys elements of *p in order, as if by calling std::destroy(std::begin(*p), std::end(*p)).

The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:

Parameters

p - a pointer to the object to be destroyed

Possible implementation

struct destroy_at_fn
{
    template<std::destructible T>
    constexpr void operator()(T *p) const noexcept
    {
        if constexpr (std::is_array_v<T>)
            for (auto &elem : *p)
                operator()(std::addressof(elem));
        else
            p->~T();
    }
};

inline constexpr destroy_at_fn destroy_at{};

Notes

destroy_at deduces the type of object to be destroyed and hence avoids writing it explicitly in the destructor call.

When destroy_at is called in the evaluation of some constant expression e, the argument p must point to an object whose lifetime began within the evaluation of e.

Example

The following example demonstrates how to use ranges::destroy_at to destroy a contiguous sequence of elements.

#include <iostream>
#include <memory>
#include <new>

struct Tracer
{
    int value;
    ~Tracer() { std::cout << value << " destructed\n"; }
};

int main()
{
    alignas(Tracer) unsigned char buffer[sizeof(Tracer) * 8];
    
    for (int i = 0; i < 8; ++i)
        new(buffer + sizeof(Tracer) * i) Tracer{i}; //manually construct objects

    auto ptr = std::launder(reinterpret_cast<Tracer*>(buffer));

    for (int i = 0; i < 8; ++i)
        std::ranges::destroy_at(ptr + i);
}

Output:

0 destructed
1 destructed
2 destructed
3 destructed
4 destructed
5 destructed
6 destructed
7 destructed

See also

destroys a range of objects
(algorithm function object)[edit]
destroys a number of objects in a range
(algorithm function object)[edit]
creates an object at a given address
(algorithm function object)[edit]
destroys an object at a given address
(function template) [edit]