/usr/include/boost/core
NameSizeModeActions
addressof.hpp61530644editdlrm
allocator_access.hpp159440644editdlrm
alloc_construct.hpp34360644editdlrm
checked_delete.hpp16770644editdlrm
default_allocator.hpp33330644editdlrm
demangle.hpp30340644editdlrm
empty_value.hpp33240644editdlrm
enable_if.hpp33150644editdlrm
exchange.hpp9110644editdlrm
explicit_operator_bool.hpp53540644editdlrm
first_scalar.hpp8130644editdlrm
ignore_unused.hpp19760644editdlrm
is_same.hpp7930644editdlrm
lightweight_test.hpp184430644editdlrm
lightweight_test_trait.hpp39730644editdlrm
noinit_adaptor.hpp17910644editdlrm
noncopyable.hpp19110644editdlrm
no_exceptions_support.hpp18720644editdlrm
null_deleter.hpp12320644editdlrm
nvp.hpp10000644editdlrm
pointer_traits.hpp50720644editdlrm
quick_exit.hpp10980644editdlrm
ref.hpp59760644editdlrm
scoped_enum.hpp78800644editdlrm
swap.hpp21230644editdlrm
typeinfo.hpp31510644editdlrm
uncaught_exceptions.hpp68190644editdlrm
underlying_type.hpp22050644editdlrm
use_default.hpp3000644editdlrm
Edit: /usr/include/boost/core/alloc_construct.hpp (3436B)
/* Copyright 2019 Glen Joseph Fernandes (glenjofe@gmail.com) Distributed under the Boost Software License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt) */ #ifndef BOOST_CORE_ALLOC_CONSTRUCT_HPP #define BOOST_CORE_ALLOC_CONSTRUCT_HPP #include namespace boost { template inline void alloc_destroy(A& a, T* p) { boost::allocator_destroy(a, p); } template inline void alloc_destroy_n(A& a, T* p, std::size_t n) { while (n > 0) { boost::allocator_destroy(a, p + --n); } } template inline void alloc_destroy(noinit_adaptor&, T* p) { p->~T(); } template inline void alloc_destroy_n(noinit_adaptor&, T* p, std::size_t n) { while (n > 0) { p[--n].~T(); } } namespace detail { template class alloc_destroyer { public: alloc_destroyer(A& a, T* p) BOOST_NOEXCEPT : a_(a), p_(p), n_(0) { } ~alloc_destroyer() { boost::alloc_destroy_n(a_, p_, n_); } std::size_t& size() BOOST_NOEXCEPT { return n_; } private: alloc_destroyer(const alloc_destroyer&); alloc_destroyer& operator=(const alloc_destroyer&); A& a_; T* p_; std::size_t n_; }; } /* detail */ template inline void alloc_construct(A& a, T* p) { boost::allocator_construct(a, p); } #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) template inline void alloc_construct(A& a, T* p, U&& u, V&&... v) { boost::allocator_construct(a, p, std::forward(u), std::forward(v)...); } #else template inline void alloc_construct(A& a, T* p, U&& u) { boost::allocator_construct(a, p, std::forward(u)); } #endif #else template inline void alloc_construct(A& a, T* p, const U& u) { boost::allocator_construct(a, p, u); } template inline void alloc_construct(A& a, T* p, U& u) { boost::allocator_construct(a, p, u); } #endif template inline void alloc_construct_n(A& a, T* p, std::size_t n) { detail::alloc_destroyer hold(a, p); for (std::size_t& i = hold.size(); i < n; ++i) { boost::allocator_construct(a, p + i); } hold.size() = 0; } template inline void alloc_construct_n(A& a, T* p, std::size_t n, const T* l, std::size_t m) { detail::alloc_destroyer hold(a, p); for (std::size_t& i = hold.size(); i < n; ++i) { boost::allocator_construct(a, p + i, l[i % m]); } hold.size() = 0; } template inline void alloc_construct_n(A& a, T* p, std::size_t n, I b) { detail::alloc_destroyer hold(a, p); for (std::size_t& i = hold.size(); i < n; void(++i), void(++b)) { boost::allocator_construct(a, p + i, *b); } hold.size() = 0; } template inline void alloc_construct(noinit_adaptor&, T* p) { ::new(static_cast(p)) T; } template inline void alloc_construct_n(noinit_adaptor& a, T* p, std::size_t n) { detail::alloc_destroyer, T> hold(a, p); for (std::size_t& i = hold.size(); i < n; ++i) { ::new(static_cast(p + i)) T; } hold.size() = 0; } } /* boost */ #endif