2011-08-26 18:25:51 +00:00
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
2012-03-22 18:46:55 +00:00
|
|
|
// (C) Copyright Ion Gaztanaga 2008-2012. Distributed under the Boost
|
2011-08-26 18:25:51 +00:00
|
|
|
// Software License, Version 1.0. (See accompanying file
|
|
|
|
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
//
|
|
|
|
// See http://www.boost.org/libs/container for documentation.
|
|
|
|
//
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
#ifndef BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
|
|
|
|
#define BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
|
2011-08-26 18:25:51 +00:00
|
|
|
|
|
|
|
#if (defined _MSC_VER) && (_MSC_VER >= 1200)
|
|
|
|
# pragma once
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "config_begin.hpp"
|
|
|
|
#include <boost/container/detail/workaround.hpp>
|
2012-03-22 18:46:55 +00:00
|
|
|
#include <boost/container/allocator_traits.hpp>
|
|
|
|
#include <boost/container/detail/destroyers.hpp>
|
|
|
|
#include <boost/aligned_storage.hpp>
|
2012-11-24 21:08:18 +00:00
|
|
|
#include <boost/move/utility.hpp>
|
2011-08-26 18:25:51 +00:00
|
|
|
#include <iterator> //std::iterator_traits
|
|
|
|
#include <boost/assert.hpp>
|
2012-11-24 21:08:18 +00:00
|
|
|
#include <boost/detail/no_exceptions_support.hpp>
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
namespace boost { namespace container { namespace container_detail {
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
template<class A, class FwdIt, class Iterator>
|
|
|
|
struct insert_range_proxy
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef typename allocator_traits<A>::size_type size_type;
|
|
|
|
typedef typename allocator_traits<A>::value_type value_type;
|
|
|
|
|
|
|
|
insert_range_proxy(A& a, FwdIt first)
|
|
|
|
: a_(a), first_(first)
|
|
|
|
{}
|
|
|
|
|
|
|
|
void uninitialized_copy_n_and_update(Iterator pos, size_type n)
|
|
|
|
{
|
|
|
|
this->first_ = ::boost::container::uninitialized_copy_or_move_alloc_n_source
|
|
|
|
(this->a_, this->first_, n, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
void copy_n_and_update(Iterator pos, size_type n)
|
|
|
|
{
|
|
|
|
this->first_ = ::boost::container::copy_or_move_n_source(this->first_, n, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
A &a_;
|
|
|
|
FwdIt first_;
|
2011-08-26 18:25:51 +00:00
|
|
|
};
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
|
|
|
|
template<class A, class Iterator>
|
|
|
|
struct insert_n_copies_proxy
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2011-12-22 20:08:24 +00:00
|
|
|
typedef typename allocator_traits<A>::size_type size_type;
|
|
|
|
typedef typename allocator_traits<A>::value_type value_type;
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
insert_n_copies_proxy(A& a, const value_type &v)
|
|
|
|
: a_(a), v_(v)
|
2011-08-26 18:25:51 +00:00
|
|
|
{}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n)
|
|
|
|
{ std::uninitialized_fill_n(p, n, v_); }
|
|
|
|
|
|
|
|
void copy_n_and_update(Iterator p, size_type n)
|
|
|
|
{ std::fill_n(p, n, v_); }
|
|
|
|
|
|
|
|
A &a_;
|
|
|
|
const value_type &v_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template<class A, class Iterator>
|
|
|
|
struct insert_default_constructed_n_proxy
|
|
|
|
{
|
|
|
|
typedef ::boost::container::allocator_traits<A> alloc_traits;
|
|
|
|
typedef typename allocator_traits<A>::size_type size_type;
|
|
|
|
typedef typename allocator_traits<A>::value_type value_type;
|
2011-08-26 18:25:51 +00:00
|
|
|
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
explicit insert_default_constructed_n_proxy(A &a)
|
|
|
|
: a_(a)
|
|
|
|
{}
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
Iterator orig_p = p;
|
|
|
|
size_type n_left = n;
|
|
|
|
BOOST_TRY{
|
|
|
|
for(; n_left--; ++p){
|
|
|
|
alloc_traits::construct(this->a_, container_detail::to_raw_pointer(&*p));
|
|
|
|
}
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH(...){
|
|
|
|
for(; orig_p != p; ++orig_p){
|
|
|
|
alloc_traits::destroy(this->a_, container_detail::to_raw_pointer(&*orig_p++));
|
|
|
|
}
|
|
|
|
BOOST_RETHROW
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH_END
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator, size_type)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(false);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
|
|
|
|
private:
|
2011-12-22 20:08:24 +00:00
|
|
|
A &a_;
|
2011-08-26 18:25:51 +00:00
|
|
|
};
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
template<class A, class Iterator>
|
2012-11-24 21:08:18 +00:00
|
|
|
struct insert_copy_proxy
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits;
|
|
|
|
typedef typename alloc_traits::size_type size_type;
|
|
|
|
typedef typename alloc_traits::value_type value_type;
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
insert_copy_proxy(A& a, const value_type &v)
|
|
|
|
: a_(a), v_(v)
|
2011-08-26 18:25:51 +00:00
|
|
|
{}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n)
|
|
|
|
{
|
|
|
|
BOOST_ASSERT(n == 1); (void)n;
|
|
|
|
alloc_traits::construct( this->a_
|
|
|
|
, container_detail::to_raw_pointer(&*p)
|
|
|
|
, v_
|
|
|
|
);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator p, size_type n)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n;
|
|
|
|
*p =v_;
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
A &a_;
|
|
|
|
const value_type &v_;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
template<class A, class Iterator>
|
|
|
|
struct insert_move_proxy
|
|
|
|
{
|
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits;
|
|
|
|
typedef typename alloc_traits::size_type size_type;
|
|
|
|
typedef typename alloc_traits::value_type value_type;
|
|
|
|
|
|
|
|
insert_move_proxy(A& a, value_type &v)
|
|
|
|
: a_(a), v_(v)
|
|
|
|
{}
|
|
|
|
|
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n;
|
|
|
|
alloc_traits::construct( this->a_
|
|
|
|
, container_detail::to_raw_pointer(&*p)
|
|
|
|
, ::boost::move(v_)
|
|
|
|
);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator p, size_type n)
|
2011-12-22 20:08:24 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n;
|
|
|
|
*p = ::boost::move(v_);
|
2011-12-22 20:08:24 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
A &a_;
|
2012-11-24 21:08:18 +00:00
|
|
|
value_type &v_;
|
2011-08-26 18:25:51 +00:00
|
|
|
};
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
template<class It, class A>
|
|
|
|
insert_move_proxy<A, It> get_insert_value_proxy(A& a, BOOST_RV_REF(typename std::iterator_traits<It>::value_type) v)
|
|
|
|
{
|
|
|
|
return insert_move_proxy<A, It>(a, v);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class It, class A>
|
|
|
|
insert_copy_proxy<A, It> get_insert_value_proxy(A& a, const typename std::iterator_traits<It>::value_type &v)
|
|
|
|
{
|
|
|
|
return insert_copy_proxy<A, It>(a, v);
|
|
|
|
}
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
}}} //namespace boost { namespace container { namespace container_detail {
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
#ifdef BOOST_CONTAINER_PERFECT_FORWARDING
|
2011-08-26 18:25:51 +00:00
|
|
|
|
|
|
|
#include <boost/container/detail/variadic_templates_tools.hpp>
|
2012-11-24 21:08:18 +00:00
|
|
|
#include <boost/move/utility.hpp>
|
2011-08-26 18:25:51 +00:00
|
|
|
#include <typeinfo>
|
|
|
|
//#include <iostream> //For debugging purposes
|
|
|
|
|
|
|
|
namespace boost {
|
2011-12-22 20:08:24 +00:00
|
|
|
namespace container {
|
|
|
|
namespace container_detail {
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
template<class A, class Iterator, class ...Args>
|
2012-11-24 21:08:18 +00:00
|
|
|
struct insert_non_movable_emplace_proxy
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits;
|
|
|
|
typedef typename alloc_traits::size_type size_type;
|
|
|
|
typedef typename alloc_traits::value_type value_type;
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef typename build_number_seq<sizeof...(Args)>::type index_tuple_t;
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
explicit insert_non_movable_emplace_proxy(A &a, Args&&... args)
|
|
|
|
: a_(a), args_(args...)
|
2011-08-26 18:25:51 +00:00
|
|
|
{}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n)
|
|
|
|
{ this->priv_uninitialized_copy_some_and_update(index_tuple_t(), p, n); }
|
2011-08-26 18:25:51 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
template<int ...IdxPack>
|
2012-11-24 21:08:18 +00:00
|
|
|
void priv_uninitialized_copy_some_and_update(const index_tuple<IdxPack...>&, Iterator p, size_type n)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n;
|
|
|
|
alloc_traits::construct( this->a_
|
|
|
|
, container_detail::to_raw_pointer(&*p)
|
|
|
|
, ::boost::forward<Args>(get<IdxPack>(this->args_))...
|
|
|
|
);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2011-12-22 20:08:24 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
A &a_;
|
2011-08-26 18:25:51 +00:00
|
|
|
tuple<Args&...> args_;
|
|
|
|
};
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
template<class A, class Iterator, class ...Args>
|
2012-11-24 21:08:18 +00:00
|
|
|
struct insert_emplace_proxy
|
|
|
|
: public insert_non_movable_emplace_proxy<A, Iterator, Args...>
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef insert_non_movable_emplace_proxy<A, Iterator, Args...> base_t;
|
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits;
|
|
|
|
typedef typename base_t::value_type value_type;
|
|
|
|
typedef typename base_t::size_type size_type;
|
|
|
|
typedef typename base_t::index_tuple_t index_tuple_t;
|
2011-12-22 20:08:24 +00:00
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
explicit insert_emplace_proxy(A &a, Args&&... args)
|
2012-04-11 16:01:46 +00:00
|
|
|
: base_t(a, ::boost::forward<Args>(args)...)
|
2011-08-26 18:25:51 +00:00
|
|
|
{}
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator p, size_type n)
|
|
|
|
{ this->priv_copy_some_and_update(index_tuple_t(), p, n); }
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
private:
|
2012-11-24 21:08:18 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
template<int ...IdxPack>
|
2012-11-24 21:08:18 +00:00
|
|
|
void priv_copy_some_and_update(const index_tuple<IdxPack...>&, Iterator p, size_type n)
|
2011-08-26 18:25:51 +00:00
|
|
|
{
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n ==1); (void)n;
|
|
|
|
aligned_storage<sizeof(value_type), alignment_of<value_type>::value> v;
|
|
|
|
value_type *vp = static_cast<value_type *>(static_cast<void *>(&v));
|
|
|
|
alloc_traits::construct(this->a_, vp,
|
|
|
|
::boost::forward<Args>(get<IdxPack>(this->args_))...);
|
|
|
|
BOOST_TRY{
|
2012-04-11 16:01:46 +00:00
|
|
|
*p = ::boost::move(*vp);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH(...){
|
|
|
|
alloc_traits::destroy(this->a_, vp);
|
|
|
|
BOOST_RETHROW
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH_END
|
|
|
|
alloc_traits::destroy(this->a_, vp);
|
2011-08-26 18:25:51 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
}}} //namespace boost { namespace container { namespace container_detail {
|
|
|
|
|
|
|
|
#else //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING
|
|
|
|
|
2012-05-20 10:02:49 +00:00
|
|
|
#include <boost/container/detail/preprocessor.hpp>
|
2011-12-22 20:08:24 +00:00
|
|
|
#include <boost/container/detail/value_init.hpp>
|
|
|
|
|
|
|
|
namespace boost {
|
2012-05-20 10:02:49 +00:00
|
|
|
namespace container {
|
2011-12-22 20:08:24 +00:00
|
|
|
namespace container_detail {
|
|
|
|
|
2012-11-24 21:08:18 +00:00
|
|
|
#define BOOST_PP_LOCAL_MACRO(N) \
|
|
|
|
template<class A, class Iterator BOOST_PP_ENUM_TRAILING_PARAMS(N, class P) > \
|
|
|
|
struct BOOST_PP_CAT(insert_non_movable_emplace_proxy_arg, N) \
|
2011-12-22 20:08:24 +00:00
|
|
|
{ \
|
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits; \
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef typename alloc_traits::size_type size_type; \
|
|
|
|
typedef typename alloc_traits::value_type value_type; \
|
2011-12-22 20:08:24 +00:00
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_PP_CAT(insert_non_movable_emplace_proxy_arg, N) \
|
|
|
|
( A &a BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_PARAM_LIST, _) ) \
|
2011-12-22 20:08:24 +00:00
|
|
|
: a_(a) \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_PARAM_INIT, _) \
|
|
|
|
{} \
|
2011-12-22 20:08:24 +00:00
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
void uninitialized_copy_n_and_update(Iterator p, size_type n) \
|
2011-12-22 20:08:24 +00:00
|
|
|
{ \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n; \
|
|
|
|
alloc_traits::construct \
|
|
|
|
( this->a_ \
|
|
|
|
, container_detail::to_raw_pointer(&*p) \
|
|
|
|
BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_MEMBER_FORWARD, _) \
|
|
|
|
); \
|
2011-12-22 20:08:24 +00:00
|
|
|
} \
|
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator, size_type) \
|
2011-12-22 20:08:24 +00:00
|
|
|
{ BOOST_ASSERT(false); } \
|
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
protected: \
|
2011-12-22 20:08:24 +00:00
|
|
|
A &a_; \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_PP_REPEAT(N, BOOST_CONTAINER_PP_PARAM_DEFINE, _) \
|
2011-12-22 20:08:24 +00:00
|
|
|
}; \
|
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
template<class A, class Iterator BOOST_PP_ENUM_TRAILING_PARAMS(N, class P) > \
|
|
|
|
struct BOOST_PP_CAT(insert_emplace_proxy_arg, N) \
|
|
|
|
: BOOST_PP_CAT(insert_non_movable_emplace_proxy_arg, N) \
|
|
|
|
< A, Iterator BOOST_PP_ENUM_TRAILING_PARAMS(N, P) > \
|
2011-12-22 20:08:24 +00:00
|
|
|
{ \
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef BOOST_PP_CAT(insert_non_movable_emplace_proxy_arg, N) \
|
|
|
|
<A, Iterator BOOST_PP_ENUM_TRAILING_PARAMS(N, P) > base_t; \
|
2011-12-22 20:08:24 +00:00
|
|
|
typedef typename base_t::value_type value_type; \
|
2012-11-24 21:08:18 +00:00
|
|
|
typedef typename base_t::size_type size_type; \
|
2012-03-22 18:46:55 +00:00
|
|
|
typedef boost::container::allocator_traits<A> alloc_traits; \
|
2011-12-22 20:08:24 +00:00
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_PP_CAT(insert_emplace_proxy_arg, N) \
|
|
|
|
( A &a BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_PARAM_LIST, _) ) \
|
|
|
|
: base_t(a BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_PARAM_FORWARD, _) ) \
|
|
|
|
{} \
|
2011-12-22 20:08:24 +00:00
|
|
|
\
|
2012-11-24 21:08:18 +00:00
|
|
|
void copy_n_and_update(Iterator p, size_type n) \
|
2011-12-22 20:08:24 +00:00
|
|
|
{ \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_ASSERT(n == 1); (void)n; \
|
|
|
|
aligned_storage<sizeof(value_type), alignment_of<value_type>::value> v; \
|
|
|
|
value_type *vp = static_cast<value_type *>(static_cast<void *>(&v)); \
|
|
|
|
alloc_traits::construct(this->a_, vp \
|
|
|
|
BOOST_PP_ENUM_TRAILING(N, BOOST_CONTAINER_PP_MEMBER_FORWARD, _)); \
|
|
|
|
BOOST_TRY{ \
|
2012-09-01 11:01:03 +00:00
|
|
|
*p = ::boost::move(*vp); \
|
2011-12-22 20:08:24 +00:00
|
|
|
} \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH(...){ \
|
|
|
|
alloc_traits::destroy(this->a_, vp); \
|
|
|
|
BOOST_RETHROW \
|
2011-12-22 20:08:24 +00:00
|
|
|
} \
|
2012-11-24 21:08:18 +00:00
|
|
|
BOOST_CATCH_END \
|
|
|
|
alloc_traits::destroy(this->a_, vp); \
|
2011-12-22 20:08:24 +00:00
|
|
|
} \
|
|
|
|
}; \
|
2011-08-26 18:25:51 +00:00
|
|
|
//!
|
2011-12-22 20:08:24 +00:00
|
|
|
#define BOOST_PP_LOCAL_LIMITS (0, BOOST_CONTAINER_MAX_CONSTRUCTOR_PARAMETERS)
|
2011-08-26 18:25:51 +00:00
|
|
|
#include BOOST_PP_LOCAL_ITERATE()
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
}}} //namespace boost { namespace container { namespace container_detail {
|
2011-08-26 18:25:51 +00:00
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
#endif //#ifdef BOOST_CONTAINER_PERFECT_FORWARDING
|
2011-08-26 18:25:51 +00:00
|
|
|
|
|
|
|
#include <boost/container/detail/config_end.hpp>
|
|
|
|
|
2011-12-22 20:08:24 +00:00
|
|
|
#endif //#ifndef BOOST_CONTAINER_ADVANCED_INSERT_INT_HPP
|