std::destroy_n(3)
π std::destroy_n(3) β C++ Standard Library π
okay so bestie, welcome to the std::destroy_n page from the C++ Standard Library. Itβs giving βclean up your objectsβ energy, and honestly? iconic. Letβs get into it. π«Ά
πΈ NAME πΈ
std::destroy_n β literally std::destroy_n. Thatβs the name, bestie. π
π§ Synopsis π§
It lives in the header <memory>, periodt. β¨
template< class ForwardIt, class Size >
ForwardIt destroy_n( ForwardIt first, Size n ); // since C++17, until C++20
template< class ForwardIt, class Size >
constexpr ForwardIt destroy_n( ForwardIt first, Size n ); // (1) since C++20
template< class ExecutionPolicy, class ForwardIt, class Size >
ForwardIt destroy_n( ExecutionPolicy&& policy, ForwardIt first, Size n ); // (2) since C++17
- Destroys the
nobjects in the range starting atfirst, as if by:
for (; n > 0; (void) ++first, --n)
std::destroy_at(std::addressof(*first));
- Same as (1), but executed according to
policy. This overload participates in overload resolution only if:
std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true. // (until C++20)
std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> is true. // (since C++20)
π Parameters π
firstβ the beginning of the range of elements to destroy.nβ the number of elements to destroy.policyβ the execution policy to use. See execution policy for details.
π¦ Type requirements π¦
ForwardItmust meet the requirements ofLegacyForwardIterator.- No increment, assignment, comparison, or indirection through valid instances of
ForwardItmay throw exceptions.
bestie, those type requirements are not a vibe check you can skip π
β Return value β
The end of the range of objects that has been destroyed (i.e., std::next(first, n)).
π₯ Complexity π₯
Linear in n.
π Exceptions π
The overload with a template parameter named ExecutionPolicy reports errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicyis one of the standard policies,std::terminateis called. For any otherExecutionPolicy, the behavior is implementation-defined. - If the algorithm fails to allocate memory,
std::bad_allocis thrown.
π Possible implementation π
template<class ForwardIt, class Size>
constexpr // since C++20
ForwardIt destroy_n(ForwardIt first, Size n)
{
for (; n > 0; (void) ++first, --n)
std::destroy_at(std::addressof(*first));
return first;
}
π Example π
The following example demonstrates how to use destroy_n to destroy a contiguous sequence of elements.
// Run this code
#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));
std::destroy_n(ptr, 8);
}
π¬ Output π¬
0 destructed
1 destructed
2 destructed
3 destructed
4 destructed
5 destructed
6 destructed
7 destructed
π See also π
destroyβ destroys a range of objects; (C++17) (function template)destroy_atβ destroys an object at a given address; (C++17) (function template)ranges::destroy_nβ destroys a number of objects in a range; (C++20) (niebloid)
β xoxo, your Unix bestie π source: http://cppreference.com Β· version/date: 2024.06.10 Β· page: std::destroy_n(3) π«Ά
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms